Merge pull request #5979 from mkurnosov/coll-libnbc-cleanup

jsquyres · web-flow · commit 8459d29738dd · 2018-11-26T18:10:10.000-05:00
coll/libnbc: remove debug output
diff --git a/ompi/mca/coll/libnbc/nbc_iallgather.c b/ompi/mca/coll/libnbc/nbc_iallgather.c
@@ -136,7 +136,6 @@ static int nbc_allgather_init(const void* sendbuf, int sendcount, MPI_Datatype s
                                      recvbuf, recvcount, recvtype);
         break;
       case NBC_ALLGATHER_RDBL:
-        if (rank == 0) printf("MK: RDBL\n");
         res = allgather_sched_recursivedoubling(rank, p, schedule, sendbuf, sendcount,
                                                 sendtype, recvbuf, recvcount, recvtype);
         break;
diff --git a/ompi/mca/coll/libnbc/nbc_ibcast.c b/ompi/mca/coll/libnbc/nbc_ibcast.c
@@ -368,7 +368,6 @@ static inline int bcast_sched_chain(int rank, int p, int root, NBC_Schedule *sch
  * Description: an implementation of Ibcast using k-nomial tree algorithm
  *
  * Time: (radix - 1)O(log_{radix}(comm_size))
- * Memory: O(reqs_max)
  * Schedule length (rounds): O(log(comm_size))
  */
 static inline int bcast_sched_knomial(

Original file line number	Diff line number	Diff line change
`@@ -368,7 +368,6 @@ static inline int bcast_sched_chain(int rank, int p, int root, NBC_Schedule *sch`
`368`	`368`	`* Description: an implementation of Ibcast using k-nomial tree algorithm`
`369`	`369`	`*`
`370`	`370`	`* Time: (radix - 1)O(log_{radix}(comm_size))`
`371`		`- * Memory: O(reqs_max)`
`372`	`371`	`* Schedule length (rounds): O(log(comm_size))`
`373`	`372`	`*/`
`374`	`373`	`static inline int bcast_sched_knomial(`