remove unused functions

SCOREC · Mar 30, 2023 · eed5a0c · eed5a0c
1 parent 2eada4e
commit eed5a0c
Show file tree

Hide file tree

Showing 2 changed files with 0 additions and 111 deletions.
diff --git a/pcu/pcu_coll.c b/pcu/pcu_coll.c
@@ -33,106 +33,6 @@ void pcu_merge_assign(void* local, void* incoming, size_t size)
   memcpy(local,incoming,size);
 }
 
-// TODO remove once struct fully inplace
-void pcu_add_doubles(void* local, void* incoming, size_t size)
-{
-  double* a = local;
-  double* b= incoming;
-  size_t n = size/sizeof(double);
-  for (size_t i=0; i < n; ++i)
-    a[i] += b[i];
-}
-
-void pcu_max_doubles(void* local, void* incoming, size_t size)
-{
-  double* a = local;
-  double* b= incoming;
-  size_t n = size/sizeof(double);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MAX(a[i],b[i]);
-}
-
-void pcu_min_doubles(void* local, void* incoming, size_t size)
-{
-  double* a = local;
-  double* b= incoming;
-  size_t n = size/sizeof(double);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MIN(a[i],b[i]);
-}
-
-void pcu_add_ints(void* local, void* incoming, size_t size)
-{
-  int* a = local;
-  int* b= incoming;
-  size_t n = size/sizeof(int);
-  for (size_t i=0; i < n; ++i)
-    a[i] += b[i];
-}
-
-void pcu_min_ints(void* local, void* incoming, size_t size)
-{
-  int* a = local;
-  int* b= incoming;
-  size_t n = size/sizeof(int);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MIN(a[i],b[i]);
-}
-
-void pcu_max_ints(void* local, void* incoming, size_t size)
-{
-  int* a = local;
-  int* b= incoming;
-  size_t n = size/sizeof(int);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MAX(a[i],b[i]);
-}
-
-void pcu_max_longs(void* local, void* incoming, size_t size)
-{
-  long* a = local;
-  long* b= incoming;
-  size_t n = size/sizeof(long);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MAX(a[i],b[i]);
-}
-
-void pcu_min_sizets(void* local, void* incoming, size_t size)
-{
-  size_t* a = local;
-  size_t* b = incoming;
-  size_t n = size/sizeof(size_t);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MIN(a[i],b[i]);
-}
-
-void pcu_max_sizets(void* local, void* incoming, size_t size)
-{
-  size_t* a = local;
-  size_t* b = incoming;
-  size_t n = size/sizeof(size_t);
-  for (size_t i=0; i < n; ++i)
-    a[i] = MAX(a[i],b[i]);
-}
-
-void pcu_add_sizets(void* local, void* incoming, size_t size)
-{
-  size_t* a = local;
-  size_t* b = incoming;
-  size_t n = size/sizeof(size_t);
-  for (size_t i=0; i < n; ++i)
-    a[i] += b[i];
-}
-
-void pcu_add_longs(void* local, void* incoming, size_t size)
-{
-  long* a = local;
-  long* b= incoming;
-  size_t n = size/sizeof(long);
-  for (size_t i=0; i < n; ++i)
-    a[i] += b[i];
-}
-
 /* initiates non-blocking calls for this
    communication step */
 static void begin_coll_step(pcu_mpi_t* mpi, pcu_coll* c)

diff --git a/pcu/pcu_coll.h b/pcu/pcu_coll.h
@@ -31,17 +31,6 @@ extern "C" {
 
 typedef void pcu_merge(void* local, void* incoming, size_t size);
 void pcu_merge_assign(void* local, void* incoming, size_t size);
-void pcu_add_doubles(void* local, void* incoming, size_t size);
-void pcu_max_doubles(void* local, void* incoming, size_t size);
-void pcu_min_doubles(void* local, void* incoming, size_t size);
-void pcu_add_ints(void* local, void* incoming, size_t size);
-void pcu_min_ints(void* local, void* incoming, size_t size);
-void pcu_max_ints(void* local, void* incoming, size_t size);
-void pcu_max_longs(void* local, void* incoming, size_t size);
-void pcu_add_longs(void* local, void* incoming, size_t size);
-void pcu_add_sizets(void* local, void* incoming, size_t size);
-void pcu_min_sizets(void* local, void* incoming, size_t size);
-void pcu_max_sizets(void* local, void* incoming, size_t size);
 
 /* Enumerated actions that a rank takes during one
    step of the communication pattern */