maxr              358 ompi/mca/coll/libnbc/nbc_iallreduce.c   int root, vrank, maxr, vpeer, peer, res;
maxr              364 ompi/mca/coll/libnbc/nbc_iallreduce.c   maxr = (int)ceil((log((double)p)/LOG2));
maxr              366 ompi/mca/coll/libnbc/nbc_iallreduce.c   if (0 == (maxr%2)) {
maxr              386 ompi/mca/coll/libnbc/nbc_iallreduce.c   for (int r = 1, firstred = 1 ; r <= maxr ; ++r) {
maxr              441 ompi/mca/coll/libnbc/nbc_iallreduce.c     for (int r = 0; r < maxr ; ++r) {
maxr              459 ompi/mca/coll/libnbc/nbc_iallreduce.c   for (int r = 0; r < maxr; ++r) {
maxr              239 ompi/mca/coll/libnbc/nbc_ibcast.c   int maxr, vrank, peer, res;
maxr              241 ompi/mca/coll/libnbc/nbc_ibcast.c   maxr = (int)ceil((log((double)p)/LOG2));
maxr              247 ompi/mca/coll/libnbc/nbc_ibcast.c     for (int r = 0 ; r < maxr ; ++r) {
maxr              264 ompi/mca/coll/libnbc/nbc_ibcast.c   for (int r = 0 ; r < maxr ; ++r) {
maxr              358 ompi/mca/coll/libnbc/nbc_ireduce.c   int vroot, vrank, vpeer, peer, res, maxr;
maxr              370 ompi/mca/coll/libnbc/nbc_ireduce.c   maxr = (int)ceil((log((double)p)/LOG2));
maxr              377 ompi/mca/coll/libnbc/nbc_ireduce.c   if (0 == (maxr%2)) {
maxr              397 ompi/mca/coll/libnbc/nbc_ireduce.c   for (int r = 1, firstred = 1 ; r <= maxr ; ++r) {
maxr               48 ompi/mca/coll/libnbc/nbc_ireduce_scatter.c   int peer, rank, maxr, p, res, count;
maxr               85 ompi/mca/coll/libnbc/nbc_ireduce_scatter.c   maxr = (int) ceil ((log((double) p) / LOG2));
maxr              103 ompi/mca/coll/libnbc/nbc_ireduce_scatter.c   for (int r = 1, firstred = 1 ; r <= maxr ; ++r) {
maxr               46 ompi/mca/coll/libnbc/nbc_ireduce_scatter_block.c   int peer, rank, maxr, p, res, count;
maxr               70 ompi/mca/coll/libnbc/nbc_ireduce_scatter_block.c   maxr = (int)ceil((log((double)p)/LOG2));
maxr              101 ompi/mca/coll/libnbc/nbc_ireduce_scatter_block.c     for (int r = 1, firstred = 1 ; r <= maxr; ++r) {