num_children 402 ompi/mca/coll/sm/coll_sm.h #define PARENT_NOTIFY_CHILDREN(children, num_children, index, value) \ num_children 404 ompi/mca/coll/sm/coll_sm.h for (i = 0; i < (num_children); ++i) { \ num_children 58 ompi/mca/coll/sm/coll_sm_barrier.c uint32_t i, num_children; num_children 77 ompi/mca/coll/sm/coll_sm_barrier.c num_children = data->mcb_tree[rank].mcstn_num_children; num_children 85 ompi/mca/coll/sm/coll_sm_barrier.c if (0 != num_children) { num_children 89 ompi/mca/coll/sm/coll_sm_barrier.c SPIN_CONDITION(*me_in == num_children, exit_label1); num_children 113 ompi/mca/coll/sm/coll_sm_barrier.c for (i = 0; i < num_children; ++i) { num_children 64 ompi/mca/coll/sm/coll_sm_bcast.c int i, ret, rank, size, num_children, src_rank; num_children 94 ompi/mca/coll/sm/coll_sm_bcast.c num_children = me->mcstn_num_children; num_children 151 ompi/mca/coll/sm/coll_sm_bcast.c PARENT_NOTIFY_CHILDREN(children, num_children, index, num_children 209 ompi/mca/coll/sm/coll_sm_bcast.c if (num_children > 0) { num_children 218 ompi/mca/coll/sm/coll_sm_bcast.c PARENT_NOTIFY_CHILDREN(children, num_children, index, num_children 252 ompi/mca/coll/sm/coll_sm_module.c int parent, min_child, num_children; num_children 322 ompi/mca/coll/sm/coll_sm_module.c num_children = mca_coll_sm_component.sm_tree_degree; num_children 326 ompi/mca/coll/sm/coll_sm_module.c if ((root * num_children) + 1 >= size) { num_children 329 ompi/mca/coll/sm/coll_sm_module.c num_children = 0; num_children 333 ompi/mca/coll/sm/coll_sm_module.c min_child = root * num_children + 1; num_children 334 ompi/mca/coll/sm/coll_sm_module.c max_child = root * num_children + num_children; num_children 338 ompi/mca/coll/sm/coll_sm_module.c num_children = max_child - min_child + 1; num_children 348 ompi/mca/coll/sm/coll_sm_module.c data->mcb_tree[root].mcstn_num_children = num_children; num_children 351 ompi/mca/coll/sm/coll_sm_module.c (i < num_children) ? num_children 214 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c ompi_mtl_portals4.flowctl.num_children = 0; num_children 284 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c ompi_mtl_portals4.flowctl.num_children++; num_children 463 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c for (i = 0 ; i < ompi_mtl_portals4.flowctl.num_children ; ++i) { num_children 503 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c epoch * (ompi_mtl_portals4.flowctl.num_children + 1)); num_children 522 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c epoch * (ompi_mtl_portals4.flowctl.num_children + 1)); num_children 541 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c epoch * (ompi_mtl_portals4.flowctl.num_children + 1)); num_children 550 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c for (i = 0 ; i < ompi_mtl_portals4.flowctl.num_children ; ++i) { num_children 78 ompi/mca/mtl/portals4/mtl_portals4_flowctl.h size_t num_children; num_children 347 ompi/patterns/net/netpatterns_nary_tree.c int rc, num_ranks_per_child, num_children, n_extra; num_children 353 ompi/patterns/net/netpatterns_nary_tree.c num_children=tree_order; num_children 356 ompi/patterns/net/netpatterns_nary_tree.c num_children=num_nodes; num_children 364 ompi/patterns/net/netpatterns_nary_tree.c nodes_data[my_node].n_children=num_children; num_children 365 ompi/patterns/net/netpatterns_nary_tree.c if( num_children ) { num_children 367 ompi/patterns/net/netpatterns_nary_tree.c malloc(sizeof(int)*num_children); num_children 380 ompi/patterns/net/netpatterns_nary_tree.c for( child=0 ; child < num_children ; child ++ ) { num_children 81 orte/mca/routed/binomial/routed_binomial.c static int num_children; num_children 111 orte/mca/routed/binomial/routed_binomial.c num_children = 0; num_children 127 orte/mca/routed/binomial/routed_binomial.c num_children = 0; num_children 487 orte/mca/routed/binomial/routed_binomial.c num_children = 0; num_children 494 orte/mca/routed/binomial/routed_binomial.c &num_children, &my_children, NULL, true); num_children 497 orte/mca/routed/binomial/routed_binomial.c opal_output(0, "%s: parent %d num_children %d", ORTE_NAME_PRINT(ORTE_PROC_MY_NAME), ORTE_PROC_MY_PARENT->vpid, num_children); num_children 83 orte/mca/routed/radix/routed_radix.c static int num_children; num_children 113 orte/mca/routed/radix/routed_radix.c num_children = 0; num_children 129 orte/mca/routed/radix/routed_radix.c num_children = 0; num_children 397 orte/mca/routed/radix/routed_radix.c static void radix_tree(int rank, int *num_children, num_children 422 orte/mca/routed/radix/routed_radix.c (*num_children)++; num_children 462 orte/mca/routed/radix/routed_radix.c num_children = 0; num_children 489 orte/mca/routed/radix/routed_radix.c radix_tree(Ii, &num_children, &my_children, NULL); num_children 492 orte/mca/routed/radix/routed_radix.c opal_output(0, "%s: parent %d num_children %d", ORTE_NAME_PRINT(ORTE_PROC_MY_NAME), ORTE_PROC_MY_PARENT->vpid, num_children); num_children 42 orte/test/system/binom.c int *num_children, opal_list_t *children, opal_bitmap_t *relatives) num_children 63 orte/test/system/binom.c (*num_children)++; num_children 91 orte/test/system/binom.c if (0 <= (found = down_search(peer, rank, me, num_procs, num_children, children, relatives))) { num_children 105 orte/test/system/binom.c int num_children; num_children 121 orte/test/system/binom.c num_children = 0; num_children 123 orte/test/system/binom.c found = down_search(0, 0, i, num_procs, &num_children, &children, NULL); num_children 124 orte/test/system/binom.c printf("\tparent %d num_children %d\n", found, num_children); num_children 25 orte/test/system/radix.c int *num_children, opal_list_t *children, opal_bitmap_t *relatives) num_children 51 orte/test/system/radix.c (*num_children)++; num_children 77 orte/test/system/radix.c int num_children; num_children 97 orte/test/system/radix.c num_children = 0; num_children 122 orte/test/system/radix.c down_search(Ii, NProcs, &num_children, &children, NULL);