children 366 ompi/mca/coll/portals4/coll_portals4.h ptl_rank_t *father, ptl_rank_t *children, unsigned int *child_nb) { children 373 ompi/mca/coll/portals4/coll_portals4.h (!children) || children 387 ompi/mca/coll/portals4/coll_portals4.h children[cnt] = PTL_INVALID_RANK; children 425 ompi/mca/coll/portals4/coll_portals4.h children[cnt] = (root + children 402 ompi/mca/coll/sm/coll_sm.h #define PARENT_NOTIFY_CHILDREN(children, num_children, index, value) \ children 408 ompi/mca/coll/sm/coll_sm.h (((children)[i]->mcstn_id + root) % size)))) = (value); \ children 59 ompi/mca/coll/sm/coll_sm_barrier.c volatile uint32_t *me_in, *me_out, *children = NULL; children 87 ompi/mca/coll/sm/coll_sm_barrier.c children = data->mcb_barrier_control_children + buffer_set + children 114 ompi/mca/coll/sm/coll_sm_barrier.c children[i * uint_control_size * 4] = 1; children 70 ompi/mca/coll/sm/coll_sm_bcast.c mca_coll_sm_tree_node_t *me, *parent, **children; children 93 ompi/mca/coll/sm/coll_sm_bcast.c children = me->mcstn_children; children 151 ompi/mca/coll/sm/coll_sm_bcast.c PARENT_NOTIFY_CHILDREN(children, num_children, index, children 218 ompi/mca/coll/sm/coll_sm_bcast.c PARENT_NOTIFY_CHILDREN(children, num_children, index, children 286 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c ompi_mtl_portals4.flowctl.children[i].rank = tmp; children 287 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c else ompi_mtl_portals4.flowctl.children[i] = children 468 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c ompi_mtl_portals4.flowctl.children[i], children 555 ompi/mca/mtl/portals4/mtl_portals4_flowctl.c ompi_mtl_portals4.flowctl.children[i], children 79 ompi/mca/mtl/portals4/mtl_portals4_flowctl.h ptl_process_t children[2]; children 286 opal/mca/hwloc/base/hwloc_base_dt.c obj2 = obj->children[i]; children 503 opal/mca/hwloc/base/hwloc_base_util.c free_object(obj->children[k]); children 525 opal/mca/hwloc/base/hwloc_base_util.c free_object(obj->children[k]); children 923 opal/mca/hwloc/base/hwloc_base_util.c df_clear(topo, start->children[k]); children 944 opal/mca/hwloc/base/hwloc_base_util.c df_clear(topo, root->children[k]); children 1924 opal/mca/hwloc/base/hwloc_base_util.c obj = root->children[i]; children 76 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c for (subnode = attr->children; subnode; subnode = subnode->next) { children 116 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c lchildstate->child = child->children; children 154 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c child = lstate->node->children; children 229 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c lstate->child = root_node->children; children 314 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml-libxml.c lstate->child = root_node->children; children 442 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c free(obj->children); children 777 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->children = hwloc_tma_malloc(tma, src->arity * sizeof(*newobj->children)); children 778 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (!newobj->children) children 816 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->children[0]->prev_sibling = NULL; children 818 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->children[i]->prev_sibling = newobj->children[i-1]; children 819 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->last_child = newobj->children[newobj->arity-1]; children 862 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newparent->children[newobj->sibling_rank] = newobj; children 2133 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c hwloc_obj_t *prev, child, children = parent->first_child; children 2135 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c while (children) { children 2137 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child = children; children 2138 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c children = child->next_sibling; children 2266 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c free(parent->children); children 2267 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->children = child->children; children 2268 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child->children = NULL; children 2271 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->children[k]->parent = parent; children 2289 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->parent->children[parent->sibling_rank] = child; children 2295 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child->prev_sibling = parent->parent->children[parent->sibling_rank-1]; children 2302 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child->next_sibling = parent->parent->children[parent->sibling_rank+1]; children 2334 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child->prev_sibling = rank > 0 ? child->parent->children[rank-1] : NULL; children 2335 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child->next_sibling = rank < child->parent->arity-1 ? child->parent->children[rank+1] : NULL; children 2423 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c memcpy(array, root->children, arity * sizeof(*array)); children 2484 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (n >= oldn || parent->children[n] != child) children 2493 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c free(parent->children); children 2494 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->children = NULL; children 2503 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c free(parent->children); children 2504 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->children = malloc(n * sizeof(*parent->children)); children 2510 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->children[n] = child; children 2593 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c remaining_objs[new_i++] = current_objs[i]->children[j]; children 2775 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c memcpy(objs, topology->levels[0][0]->children, n_objs*sizeof(objs[0])); children 3901 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(!parent->children); children 3907 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(parent->children); children 3920 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c hwloc__check_child_siblings(parent, parent->children, parent->arity, j, child, prev); children 3927 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(parent->first_child == parent->children[0]); children 3928 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(parent->last_child == parent->children[parent->arity-1]); children 200 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c if (!hwloc_bitmap_intersects(set,current->children[i]->cpuset)) children 204 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c hwloc_bitmap_and(subset, subset, current->children[i]->cpuset); children 205 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c ret = hwloc__get_largest_objs_inside_cpuset (current->children[i], subset, res, max); children 413 opal/mca/hwloc/hwloc201/hwloc/include/hwloc.h struct hwloc_obj **children; /**< \brief Normal children, \c children[0 .. arity -1] */ children 866 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h hwloc_distrib(topology, root->children, root->arity, cpusetp, chunk, until, flags); children 183 opal/mca/pmix/pmix4x/pmix/examples/server.c static pmix_list_t children; children 266 opal/mca/pmix/pmix4x/pmix/examples/server.c PMIX_CONSTRUCT(&children, pmix_list_t); children 360 opal/mca/pmix/pmix4x/pmix/examples/server.c pmix_list_append(&children, &child->super); children 891 opal/mca/pmix/pmix4x/pmix/examples/server.c PMIX_LIST_FOREACH(t2, &children, wait_tracker_t) { children 214 opal/mca/pmix/pmix4x/pmix/test/simple/gwtest.c static pmix_list_t children; children 393 opal/mca/pmix/pmix4x/pmix/test/simple/gwtest.c PMIX_CONSTRUCT(&children, pmix_list_t); children 490 opal/mca/pmix/pmix4x/pmix/test/simple/gwtest.c pmix_list_append(&children, &child->super); children 512 opal/mca/pmix/pmix4x/pmix/test/simple/gwtest.c PMIX_LIST_FOREACH(child, &children, wait_tracker_t) { children 534 opal/mca/pmix/pmix4x/pmix/test/simple/gwtest.c PMIX_LIST_DESTRUCT(&children); children 1044 opal/mca/pmix/pmix4x/pmix/test/simple/gwtest.c PMIX_LIST_FOREACH(t2, &children, wait_tracker_t) { children 198 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c static pmix_list_t children; children 514 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c PMIX_CONSTRUCT(&children, pmix_list_t); children 613 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c pmix_list_append(&children, &child->super); children 631 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c PMIX_LIST_FOREACH(child, &children, wait_tracker_t) { children 683 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c PMIX_LIST_DESTRUCT(&children); children 1245 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c PMIX_LIST_FOREACH(t2, &children, wait_tracker_t) { children 183 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c static pmix_list_t children; children 305 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c PMIX_CONSTRUCT(&children, pmix_list_t); children 369 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c pmix_list_append(&children, &child->super); children 392 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c PMIX_LIST_FOREACH(child, &children, wait_tracker_t) { children 414 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c PMIX_LIST_DESTRUCT(&children); children 415 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c PMIX_CONSTRUCT(&children, pmix_list_t); children 873 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c PMIX_LIST_FOREACH(t2, &children, wait_tracker_t) { children 232 orte/mca/grpcomm/base/grpcomm_base_stubs.c opal_list_t children; children 284 orte/mca/grpcomm/base/grpcomm_base_stubs.c OBJ_CONSTRUCT(&children, opal_list_t); children 285 orte/mca/grpcomm/base/grpcomm_base_stubs.c orte_routed.get_routing_list(&children); children 286 orte/mca/grpcomm/base/grpcomm_base_stubs.c while (NULL != (nm = (orte_namelist_t*)opal_list_remove_first(&children))) { children 295 orte/mca/grpcomm/base/grpcomm_base_stubs.c OPAL_LIST_DESTRUCT(&children); children 424 orte/mca/rmaps/ppr/rmaps_ppr.c nxt = find_split(topo, obj->children[k]); children 569 orte/mca/rmaps/ppr/rmaps_ppr.c if (hwloc_bitmap_intersects(top->children[k]->cpuset, locale->cpuset)) { children 398 orte/mca/routed/radix/routed_radix.c opal_list_t *children, opal_bitmap_t *relatives) children 419 orte/mca/routed/radix/routed_radix.c if (NULL != children) { children 421 orte/mca/routed/radix/routed_radix.c opal_list_append(children, &child->super); children 16 orte/test/mpi/concurrent_spawn.c MPI_Comm parent, children[NUM_CHILDREN]; children 37 orte/test/mpi/concurrent_spawn.c 0, MPI_COMM_WORLD, &children[i], children 46 orte/test/mpi/concurrent_spawn.c MPI_Send(&i, 1, MPI_INT, 0, 1, children[i]); children 53 orte/test/mpi/concurrent_spawn.c MPI_Comm_disconnect(&children[i]); children 42 orte/test/system/binom.c int *num_children, opal_list_t *children, opal_bitmap_t *relatives) children 60 orte/test/system/binom.c if (NULL != children) { children 62 orte/test/system/binom.c opal_list_append(children, &child->super); children 91 orte/test/system/binom.c if (0 <= (found = down_search(peer, rank, me, num_procs, num_children, children, relatives))) { children 103 orte/test/system/binom.c opal_list_t children; children 120 orte/test/system/binom.c OBJ_CONSTRUCT(&children, opal_list_t); children 123 orte/test/system/binom.c found = down_search(0, 0, i, num_procs, &num_children, &children, NULL); children 125 orte/test/system/binom.c while (NULL != (item = opal_list_remove_first(&children))) { children 135 orte/test/system/binom.c OBJ_DESTRUCT(&children); children 25 orte/test/system/radix.c int *num_children, opal_list_t *children, opal_bitmap_t *relatives) children 47 orte/test/system/radix.c if (NULL != children) { children 50 orte/test/system/radix.c opal_list_append(children, &child->super); children 75 orte/test/system/radix.c opal_list_t children; children 96 orte/test/system/radix.c OBJ_CONSTRUCT(&children, opal_list_t); children 122 orte/test/system/radix.c down_search(Ii, NProcs, &num_children, &children, NULL); children 123 orte/test/system/radix.c while (NULL != (item = opal_list_remove_first(&children))) { children 133 orte/test/system/radix.c OBJ_DESTRUCT(&children);