tree               45 ompi/mca/coll/base/coll_base_bcast.c                                      ompi_coll_tree_t* tree )
tree               71 ompi/mca/coll/base/coll_base_bcast.c     if( tree->tree_nextsize != 0 ) {
tree               72 ompi/mca/coll/base/coll_base_bcast.c         send_reqs = ompi_coll_base_comm_get_reqs(module->base_data, tree->tree_nextsize);
tree               88 ompi/mca/coll/base/coll_base_bcast.c             for( i = 0; i < tree->tree_nextsize; i++ ) {
tree               90 ompi/mca/coll/base/coll_base_bcast.c                                          tree->tree_next[i],
tree               98 ompi/mca/coll/base/coll_base_bcast.c             err = ompi_request_wait_all( tree->tree_nextsize, send_reqs,
tree              109 ompi/mca/coll/base/coll_base_bcast.c     else if( tree->tree_nextsize > 0 ) {
tree              123 ompi/mca/coll/base/coll_base_bcast.c                                  tree->tree_prev, MCA_COLL_BASE_TAG_BCAST,
tree              133 ompi/mca/coll/base/coll_base_bcast.c                                       datatype, tree->tree_prev,
tree              143 ompi/mca/coll/base/coll_base_bcast.c             for( i = 0; i < tree->tree_nextsize; i++ ) {
tree              145 ompi/mca/coll/base/coll_base_bcast.c                                          tree->tree_next[i],
tree              153 ompi/mca/coll/base/coll_base_bcast.c             err = ompi_request_wait_all( tree->tree_nextsize, send_reqs,
tree              166 ompi/mca/coll/base/coll_base_bcast.c         for( i = 0; i < tree->tree_nextsize; i++ ) {
tree              168 ompi/mca/coll/base/coll_base_bcast.c                                      tree->tree_next[i],
tree              175 ompi/mca/coll/base/coll_base_bcast.c         err = ompi_request_wait_all( tree->tree_nextsize, send_reqs,
tree              192 ompi/mca/coll/base/coll_base_bcast.c                                  tree->tree_prev, MCA_COLL_BASE_TAG_BCAST,
tree              201 ompi/mca/coll/base/coll_base_bcast.c                                      tree->tree_prev, MCA_COLL_BASE_TAG_BCAST,
tree              228 ompi/mca/coll/base/coll_base_bcast.c             for( req_index = 0; req_index < tree->tree_nextsize; req_index++ ) {
tree              235 ompi/mca/coll/base/coll_base_bcast.c         ompi_coll_base_free_reqs(send_reqs, tree->tree_nextsize);
tree              374 ompi/mca/coll/base/coll_base_bcast.c     ompi_coll_tree_t *tree;
tree              387 ompi/mca/coll/base/coll_base_bcast.c     tree = module->base_data->cached_bintree;
tree              450 ompi/mca/coll/base/coll_base_bcast.c             for( i = 0; i < tree->tree_nextsize && i < 2; i++ ) {
tree              459 ompi/mca/coll/base/coll_base_bcast.c                                   tree->tree_next[i], MCA_COLL_BASE_TAG_BCAST,
tree              469 ompi/mca/coll/base/coll_base_bcast.c     else if( tree->tree_nextsize > 0 ) {
tree              483 ompi/mca/coll/base/coll_base_bcast.c                                  tree->tree_prev, MCA_COLL_BASE_TAG_BCAST,
tree              493 ompi/mca/coll/base/coll_base_bcast.c                                       datatype, tree->tree_prev, MCA_COLL_BASE_TAG_BCAST,
tree              499 ompi/mca/coll/base/coll_base_bcast.c             for( i = 0; i < tree->tree_nextsize; i++ ) {  /* send data to children (segcount[lr]) */
tree              501 ompi/mca/coll/base/coll_base_bcast.c                                          tree->tree_next[i], MCA_COLL_BASE_TAG_BCAST,
tree              514 ompi/mca/coll/base/coll_base_bcast.c         for( i = 0; i < tree->tree_nextsize; i++ ) {  /* send data to children */
tree              516 ompi/mca/coll/base/coll_base_bcast.c                                     tree->tree_next[i], MCA_COLL_BASE_TAG_BCAST,
tree              532 ompi/mca/coll/base/coll_base_bcast.c                                     tree->tree_prev, MCA_COLL_BASE_TAG_BCAST,
tree              241 ompi/mca/coll/base/coll_base_functions.h int ompi_coll_base_bcast_intra_generic(BCAST_ARGS, uint32_t count_by_segment, ompi_coll_tree_t* tree);
tree              265 ompi/mca/coll/base/coll_base_functions.h int ompi_coll_base_reduce_generic(REDUCE_ARGS, ompi_coll_tree_t* tree, int count_by_segment, int max_outstanding_reqs);
tree               66 ompi/mca/coll/base/coll_base_reduce.c                                     ompi_coll_tree_t* tree, int count_by_segment,
tree               98 ompi/mca/coll/base/coll_base_reduce.c     if( tree->tree_nextsize > 0 ) {
tree              131 ompi/mca/coll/base/coll_base_reduce.c         if( (num_segments > 1) || (tree->tree_nextsize > 1) ) {
tree              151 ompi/mca/coll/base/coll_base_reduce.c             for( i = 0; i < tree->tree_nextsize; i++ ) {
tree              171 ompi/mca/coll/base/coll_base_reduce.c                             !((MPI_IN_PLACE == sendbuf) && (rank == tree->tree_root)) ) {
tree              177 ompi/mca/coll/base/coll_base_reduce.c                                              tree->tree_next[i],
tree              198 ompi/mca/coll/base/coll_base_reduce.c                             !((MPI_IN_PLACE == sendbuf) && (rank == tree->tree_root)) ) {
tree              208 ompi/mca/coll/base/coll_base_reduce.c                     if( tree->tree_nextsize <= 1 ) {
tree              210 ompi/mca/coll/base/coll_base_reduce.c                             !((MPI_IN_PLACE == sendbuf) && (rank == tree->tree_root)) ) {
tree              220 ompi/mca/coll/base/coll_base_reduce.c                     if (rank != tree->tree_root) {
tree              223 ompi/mca/coll/base/coll_base_reduce.c                                                   datatype, tree->tree_prev,
tree              274 ompi/mca/coll/base/coll_base_reduce.c                                          tree->tree_prev,
tree              302 ompi/mca/coll/base/coll_base_reduce.c                                           tree->tree_prev,
tree              322 ompi/mca/coll/base/coll_base_reduce.c                                           tree->tree_prev,
tree               86 ompi/mca/coll/base/coll_base_topo.c     ompi_coll_tree_t* tree;
tree              105 ompi/mca/coll/base/coll_base_topo.c     tree = (ompi_coll_tree_t*)malloc(COLL_TREE_SIZE(MAXTREEFANOUT));
tree              106 ompi/mca/coll/base/coll_base_topo.c     if (!tree) {
tree              111 ompi/mca/coll/base/coll_base_topo.c     tree->tree_root     = MPI_UNDEFINED;
tree              112 ompi/mca/coll/base/coll_base_topo.c     tree->tree_nextsize = MPI_UNDEFINED;
tree              117 ompi/mca/coll/base/coll_base_topo.c     tree->tree_root = root;
tree              122 ompi/mca/coll/base/coll_base_topo.c     tree->tree_fanout   = fanout;
tree              123 ompi/mca/coll/base/coll_base_topo.c     tree->tree_bmtree   = 0;
tree              124 ompi/mca/coll/base/coll_base_topo.c     tree->tree_root     = root;
tree              125 ompi/mca/coll/base/coll_base_topo.c     tree->tree_prev     = -1;
tree              126 ompi/mca/coll/base/coll_base_topo.c     tree->tree_nextsize = 0;
tree              128 ompi/mca/coll/base/coll_base_topo.c         tree->tree_next[i] = -1;
tree              133 ompi/mca/coll/base/coll_base_topo.c         return tree;
tree              155 ompi/mca/coll/base/coll_base_topo.c             tree->tree_next[i] = (schild+root)%size;
tree              156 ompi/mca/coll/base/coll_base_topo.c             tree->tree_nextsize = tree->tree_nextsize + 1;
tree              172 ompi/mca/coll/base/coll_base_topo.c     tree->tree_prev = (sparent+root)%size;
tree              174 ompi/mca/coll/base/coll_base_topo.c     return tree;
tree              195 ompi/mca/coll/base/coll_base_topo.c     ompi_coll_tree_t* tree;
tree              203 ompi/mca/coll/base/coll_base_topo.c     tree = (ompi_coll_tree_t*)malloc(COLL_TREE_SIZE(MAXTREEFANOUT));
tree              204 ompi/mca/coll/base/coll_base_topo.c     if (!tree) {
tree              210 ompi/mca/coll/base/coll_base_topo.c     tree->tree_root     = MPI_UNDEFINED;
tree              211 ompi/mca/coll/base/coll_base_topo.c     tree->tree_nextsize = MPI_UNDEFINED;
tree              216 ompi/mca/coll/base/coll_base_topo.c     tree->tree_fanout   = 2;
tree              217 ompi/mca/coll/base/coll_base_topo.c     tree->tree_bmtree   = 0;
tree              218 ompi/mca/coll/base/coll_base_topo.c     tree->tree_root     = size - 1;
tree              219 ompi/mca/coll/base/coll_base_topo.c     tree->tree_prev     = -1;
tree              220 ompi/mca/coll/base/coll_base_topo.c     tree->tree_nextsize = 0;
tree              221 ompi/mca/coll/base/coll_base_topo.c     tree->tree_next[0]  = -1;
tree              222 ompi/mca/coll/base/coll_base_topo.c     tree->tree_next[1]  = -1;
tree              225 ompi/mca/coll/base/coll_base_topo.c                  tree->tree_fanout, tree->tree_root));
tree              258 ompi/mca/coll/base/coll_base_topo.c             if (lchild >= 0) tree->tree_next[0] = lchild + delta;
tree              259 ompi/mca/coll/base/coll_base_topo.c             if (rchild >= 0) tree->tree_next[1] = rchild + delta;
tree              269 ompi/mca/coll/base/coll_base_topo.c                 tree->tree_prev = parent + delta;
tree              284 ompi/mca/coll/base/coll_base_topo.c                 tree->tree_prev = parent + delta;
tree              291 ompi/mca/coll/base/coll_base_topo.c     if (tree->tree_next[0] >= 0) { tree->tree_nextsize = 1; }
tree              292 ompi/mca/coll/base/coll_base_topo.c     if (tree->tree_next[1] >= 0) { tree->tree_nextsize += 1; }
tree              294 ompi/mca/coll/base/coll_base_topo.c     return tree;
tree              297 ompi/mca/coll/base/coll_base_topo.c int ompi_coll_base_topo_destroy_tree( ompi_coll_tree_t** tree )
tree              301 ompi/mca/coll/base/coll_base_topo.c     if ((!tree)||(!*tree)) {
tree              305 ompi/mca/coll/base/coll_base_topo.c     ptr = *tree;
tree              308 ompi/mca/coll/base/coll_base_topo.c     *tree = NULL;   /* mark tree as gone */
tree              675 ompi/mca/coll/base/coll_base_topo.c int ompi_coll_base_topo_dump_tree (ompi_coll_tree_t* tree, int rank)
tree              681 ompi/mca/coll/base/coll_base_topo.c                  rank, tree->tree_root, tree->tree_bmtree, tree->tree_fanout,
tree              682 ompi/mca/coll/base/coll_base_topo.c                  tree->tree_nextsize, tree->tree_prev));
tree              683 ompi/mca/coll/base/coll_base_topo.c     if( tree->tree_nextsize ) {
tree              684 ompi/mca/coll/base/coll_base_topo.c         for( i = 0; i < tree->tree_nextsize; i++ )
tree              685 ompi/mca/coll/base/coll_base_topo.c             OPAL_OUTPUT((ompi_coll_base_framework.framework_output,"[%1d] %d", i, tree->tree_next[i]));
tree               65 ompi/mca/coll/base/coll_base_topo.h int ompi_coll_base_topo_destroy_tree( ompi_coll_tree_t** tree );
tree               68 ompi/mca/coll/base/coll_base_topo.h int ompi_coll_base_topo_dump_tree (ompi_coll_tree_t* tree, int rank);
tree               39 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_tree	*tree;
tree               43 ompi/mca/coll/libnbc/libdict/hb_tree.c static int rot_left __P((hb_tree *tree, hb_node *node));
tree               44 ompi/mca/coll/libnbc/libdict/hb_tree.c static int rot_right __P((hb_tree *tree, hb_node *node));
tree               58 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_tree *tree;
tree               60 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if ((tree = (hb_tree*)MALLOC(sizeof(*tree))) == NULL)
tree               63 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->root = NULL;
tree               64 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->count = 0;
tree               65 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->key_cmp = key_cmp ? key_cmp : dict_ptr_cmp;
tree               66 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->key_del = key_del;
tree               67 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->dat_del = dat_del;
tree               69 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return tree;
tree               77 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_tree *tree;
tree               82 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if ((tree = hb_tree_new(key_cmp, key_del, dat_del)) == NULL) {
tree               87 ompi/mca/coll/libnbc/libdict/hb_tree.c 	dct->_object = tree;
tree              102 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_destroy(hb_tree *tree, int del)
tree              104 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              106 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (tree->root)
tree              107 ompi/mca/coll/libnbc/libdict/hb_tree.c 		hb_tree_empty(tree, del);
tree              109 ompi/mca/coll/libnbc/libdict/hb_tree.c 	FREE(tree);
tree              113 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_empty(hb_tree *tree, int del)
tree              117 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              119 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node = tree->root;
tree              128 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (tree->key_del)
tree              129 ompi/mca/coll/libnbc/libdict/hb_tree.c 				tree->key_del(node->key);
tree              130 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (tree->dat_del)
tree              131 ompi/mca/coll/libnbc/libdict/hb_tree.c 				tree->dat_del(node->dat);
tree              146 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->root = NULL;
tree              147 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->count = 0;
tree              151 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_search(hb_tree *tree, const void *key)
tree              156 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              158 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node = tree->root;
tree              160 ompi/mca/coll/libnbc/libdict/hb_tree.c 		rv = tree->key_cmp(key, node->key);
tree              173 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_insert(hb_tree *tree, void *key, void *dat, int overwrite)
tree              178 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              180 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node = tree->root;
tree              182 ompi/mca/coll/libnbc/libdict/hb_tree.c 		rv = tree->key_cmp(key, node->key);
tree              190 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (tree->key_del)
tree              191 ompi/mca/coll/libnbc/libdict/hb_tree.c 				tree->key_del(node->key);
tree              192 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (tree->dat_del)
tree              193 ompi/mca/coll/libnbc/libdict/hb_tree.c 				tree->dat_del(node->dat);
tree              205 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = node;
tree              206 ompi/mca/coll/libnbc/libdict/hb_tree.c 		ASSERT(tree->count == 0);
tree              207 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->count = 1;
tree              224 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, q->llink);
tree              225 ompi/mca/coll/libnbc/libdict/hb_tree.c 				rot_right(tree, q);
tree              230 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, q->rlink);
tree              231 ompi/mca/coll/libnbc/libdict/hb_tree.c 				rot_left(tree, q);
tree              235 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->count++;
tree              240 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_probe(hb_tree *tree, void *key, void **dat)
tree              245 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              247 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node = tree->root;
tree              249 ompi/mca/coll/libnbc/libdict/hb_tree.c 		rv = tree->key_cmp(key, node->key);
tree              265 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = node;
tree              266 ompi/mca/coll/libnbc/libdict/hb_tree.c 		ASSERT(tree->count == 0);
tree              267 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->count = 1;
tree              284 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, q->llink);
tree              285 ompi/mca/coll/libnbc/libdict/hb_tree.c 				rot_right(tree, q);
tree              290 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, q->rlink);
tree              291 ompi/mca/coll/libnbc/libdict/hb_tree.c 				rot_left(tree, q);
tree              295 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->count++;
tree              301 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (tree->key_del)													\
tree              302 ompi/mca/coll/libnbc/libdict/hb_tree.c 			tree->key_del((n)->key);										\
tree              303 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (tree->dat_del)													\
tree              304 ompi/mca/coll/libnbc/libdict/hb_tree.c 			tree->dat_del((n)->dat);										\
tree              309 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_remove(hb_tree *tree, const void *key, int del)
tree              315 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              317 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node = tree->root;
tree              319 ompi/mca/coll/libnbc/libdict/hb_tree.c 		rv = tree->key_cmp(key, node->key);
tree              342 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = out;
tree              343 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->count--;
tree              362 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, parent->rlink);
tree              363 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, parent);
tree              366 ompi/mca/coll/libnbc/libdict/hb_tree.c 					if (rot_left(tree, parent) == 0)
tree              380 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, parent->llink);
tree              381 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, parent);
tree              384 ompi/mca/coll/libnbc/libdict/hb_tree.c 					if (rot_right(tree, parent) == 0)
tree              401 ompi/mca/coll/libnbc/libdict/hb_tree.c 	tree->count--;
tree              406 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_min(const hb_tree *tree)
tree              410 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              412 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (tree->root == NULL)
tree              415 ompi/mca/coll/libnbc/libdict/hb_tree.c 	for (node = tree->root; node->llink; node = node->llink)
tree              421 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_max(const hb_tree *tree)
tree              425 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              427 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if ((node = tree->root) == NULL)
tree              436 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_walk(hb_tree *tree, dict_vis_func visit)
tree              440 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              442 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (tree->root == NULL)
tree              444 ompi/mca/coll/libnbc/libdict/hb_tree.c 	for (node = node_min(tree->root); node; node = node_next(node))
tree              450 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_count(const hb_tree *tree)
tree              452 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              454 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return tree->count;
tree              458 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_height(const hb_tree *tree)
tree              460 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              462 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return tree->root ? node_height(tree->root) : 0;
tree              466 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_mheight(const hb_tree *tree)
tree              468 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              470 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return tree->root ? node_mheight(tree->root) : 0;
tree              474 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_tree_pathlen(const hb_tree *tree)
tree              476 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              478 ompi/mca/coll/libnbc/libdict/hb_tree.c 	return tree->root ? node_pathlen(tree->root, 1) : 0;
tree              609 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_left(hb_tree *tree, hb_node *node)
tree              614 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              630 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = rlink;
tree              653 ompi/mca/coll/libnbc/libdict/hb_tree.c rot_right(hb_tree *tree, hb_node *node)
tree              658 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              674 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = llink;
tree              686 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_itor_new(hb_tree *tree)
tree              690 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              695 ompi/mca/coll/libnbc/libdict/hb_tree.c 	itor->tree = tree;
tree              701 ompi/mca/coll/libnbc/libdict/hb_tree.c hb_dict_itor_new(hb_tree *tree)
tree              705 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(tree != NULL);
tree              710 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if ((itor->_itor = hb_itor_new(tree)) == NULL) {
tree              826 ompi/mca/coll/libnbc/libdict/hb_tree.c 	t = itor->tree;
tree              838 ompi/mca/coll/libnbc/libdict/hb_tree.c 	t = itor->tree;
tree              852 ompi/mca/coll/libnbc/libdict/hb_tree.c 	cmp = itor->tree->key_cmp;
tree              853 ompi/mca/coll/libnbc/libdict/hb_tree.c 	for (node = itor->tree->root; node;) {
tree              895 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (del && itor->tree->dat_del)
tree              896 ompi/mca/coll/libnbc/libdict/hb_tree.c 		itor->tree->dat_del(itor->node->dat);
tree               24 ompi/mca/coll/libnbc/libdict/hb_tree.h void	 hb_tree_destroy __P((hb_tree *tree, int del));
tree               26 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_tree_insert __P((hb_tree *tree, void *key, void *dat, int overwrite));
tree               27 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_tree_probe __P((hb_tree *tree, void *key, void **dat));
tree               28 ompi/mca/coll/libnbc/libdict/hb_tree.h void *hb_tree_search __P((hb_tree *tree, const void *key));
tree               29 ompi/mca/coll/libnbc/libdict/hb_tree.h int hb_tree_remove __P((hb_tree *tree, const void *key, int del));
tree               30 ompi/mca/coll/libnbc/libdict/hb_tree.h void hb_tree_empty __P((hb_tree *tree, int del));
tree               31 ompi/mca/coll/libnbc/libdict/hb_tree.h void hb_tree_walk __P((hb_tree *tree, dict_vis_func visit));
tree               32 ompi/mca/coll/libnbc/libdict/hb_tree.h unsigned hb_tree_count __P((const hb_tree *tree));
tree               33 ompi/mca/coll/libnbc/libdict/hb_tree.h unsigned hb_tree_height __P((const hb_tree *tree));
tree               34 ompi/mca/coll/libnbc/libdict/hb_tree.h unsigned hb_tree_mheight __P((const hb_tree *tree));
tree               35 ompi/mca/coll/libnbc/libdict/hb_tree.h unsigned hb_tree_pathlen __P((const hb_tree *tree));
tree               36 ompi/mca/coll/libnbc/libdict/hb_tree.h const void *hb_tree_min __P((const hb_tree *tree));
tree               37 ompi/mca/coll/libnbc/libdict/hb_tree.h const void *hb_tree_max __P((const hb_tree *tree));
tree               42 ompi/mca/coll/libnbc/libdict/hb_tree.h hb_itor *hb_itor_new __P((hb_tree *tree));
tree               43 ompi/mca/coll/libnbc/libdict/hb_tree.h dict_itor *hb_dict_itor_new __P((hb_tree *tree));
tree               44 ompi/mca/coll/libnbc/libdict/hb_tree.h void hb_itor_destroy __P((hb_itor *tree));
tree              154 ompi/mca/coll/portals4/coll_portals4_gather.c ompi_coll_portals4_destroy_tree( ompi_coll_portals4_tree_t** tree )
tree              158 ompi/mca/coll/portals4/coll_portals4_gather.c     if ((!tree)||(!*tree)) {
tree              162 ompi/mca/coll/portals4/coll_portals4_gather.c     ptr = *tree;
tree              165 ompi/mca/coll/portals4/coll_portals4_gather.c     *tree = NULL;   /* mark tree as gone */
tree               53 ompi/mca/topo/treematch/treematch/PriorityQueue.c   FiboTree * tree = (FiboTree *)q;
tree               55 ompi/mca/topo/treematch/treematch/PriorityQueue.c   if(&(tree->rootdat) == (tree->rootdat.linkdat.nextptr)) 
tree               20 ompi/mca/topo/treematch/treematch/PriorityQueue.h   FiboTree tree;
tree              118 ompi/mca/topo/treematch/treematch/tm_tree.c void free_list_child(tm_tree_t *tree)
tree              122 ompi/mca/topo/treematch/treematch/tm_tree.c   if(tree){
tree              123 ompi/mca/topo/treematch/treematch/tm_tree.c     for(i=0;i<tree->arity;i++)
tree              124 ompi/mca/topo/treematch/treematch/tm_tree.c       free_list_child(tree->child[i]);
tree              126 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(tree->child);
tree              127 ompi/mca/topo/treematch/treematch/tm_tree.c     if(tree->dumb) /*in dumb subtrees  internal nodes  have been allocated individually, they need to bee freed one by one*/
tree              128 ompi/mca/topo/treematch/treematch/tm_tree.c       FREE(tree);
tree              131 ompi/mca/topo/treematch/treematch/tm_tree.c void free_tab_child(tm_tree_t *tree)
tree              133 ompi/mca/topo/treematch/treematch/tm_tree.c   if(tree){
tree              135 ompi/mca/topo/treematch/treematch/tm_tree.c     free_tab_child(tree->tab_child);
tree              136 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(tree->tab_child);
tree              140 ompi/mca/topo/treematch/treematch/tm_tree.c void free_non_constraint_tree(tm_tree_t *tree)
tree              142 ompi/mca/topo/treematch/treematch/tm_tree.c   if(tree->dumb){
tree              149 ompi/mca/topo/treematch/treematch/tm_tree.c   free_list_child(tree); /* free the tree->child array recursively and the nodes in dumb subtree*/
tree              150 ompi/mca/topo/treematch/treematch/tm_tree.c   free_tab_child(tree); /* free the tree->tab_child array that correspond of all the child nodes of a given node in non dumb subtrees */
tree              151 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(tree);
tree              154 ompi/mca/topo/treematch/treematch/tm_tree.c void free_constraint_tree(tm_tree_t *tree)
tree              158 ompi/mca/topo/treematch/treematch/tm_tree.c   if(tree){
tree              159 ompi/mca/topo/treematch/treematch/tm_tree.c     for(i=0;i<tree->arity;i++)
tree              160 ompi/mca/topo/treematch/treematch/tm_tree.c       free_constraint_tree(tree->child[i]);
tree              162 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(tree->child);
tree              163 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(tree);
tree              168 ompi/mca/topo/treematch/treematch/tm_tree.c void tm_free_tree(tm_tree_t *tree)
tree              170 ompi/mca/topo/treematch/treematch/tm_tree.c   if(tree->constraint)
tree              171 ompi/mca/topo/treematch/treematch/tm_tree.c     free_constraint_tree(tree);
tree              173 ompi/mca/topo/treematch/treematch/tm_tree.c     free_non_constraint_tree(tree); /* tab_child field is NULL for all nodes in the tree*/
tree             2055 ompi/mca/topo/treematch/treematch/tm_tree.c void set_deb_tab_child(tm_tree_t *tree, tm_tree_t *child, int depth)
tree             2059 ompi/mca/topo/treematch/treematch/tm_tree.c     set_deb_tab_child(tree->tab_child, child, depth-1);
tree             2061 ompi/mca/topo/treematch/treematch/tm_tree.c     tree->tab_child=child;
tree               31 opal/class/opal_interval_tree.c static void opal_interval_tree_insert_node (opal_interval_tree_t *tree, opal_interval_tree_node_t *node);
tree               34 opal/class/opal_interval_tree.c static void opal_interval_tree_delete_fixup (opal_interval_tree_t *tree, opal_interval_tree_node_t *node,
tree               36 opal/class/opal_interval_tree.c static void opal_interval_tree_insert_fixup (opal_interval_tree_t *tree, opal_interval_tree_node_t *x);
tree               38 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *opal_interval_tree_next (opal_interval_tree_t *tree,
tree               40 opal/class/opal_interval_tree.c static opal_interval_tree_node_t * opal_interval_tree_find_node(opal_interval_tree_t *tree,
tree               44 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *left_rotate (opal_interval_tree_t *tree, opal_interval_tree_node_t *x);
tree               45 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *right_rotate (opal_interval_tree_t *tree, opal_interval_tree_node_t *x);
tree               47 opal/class/opal_interval_tree.c static void inorder_destroy(opal_interval_tree_t *tree, opal_interval_tree_node_t * node);
tree               58 opal/class/opal_interval_tree.c static void opal_interval_tree_construct (opal_interval_tree_t *tree)
tree               60 opal/class/opal_interval_tree.c     OBJ_CONSTRUCT(&tree->root, opal_interval_tree_node_t);
tree               61 opal/class/opal_interval_tree.c     OBJ_CONSTRUCT(&tree->nill, opal_interval_tree_node_t);
tree               62 opal/class/opal_interval_tree.c     OBJ_CONSTRUCT(&tree->free_list, opal_free_list_t);
tree               63 opal/class/opal_interval_tree.c     OBJ_CONSTRUCT(&tree->gc_list, opal_list_t);
tree               66 opal/class/opal_interval_tree.c     tree->nill.color = OPAL_INTERVAL_TREE_COLOR_BLACK;
tree               67 opal/class/opal_interval_tree.c     tree->nill.left = tree->nill.right = tree->nill.parent = &tree->nill;
tree               68 opal/class/opal_interval_tree.c     tree->nill.max = 0;
tree               69 opal/class/opal_interval_tree.c     tree->nill.data = NULL;
tree               72 opal/class/opal_interval_tree.c     tree->root.color = OPAL_INTERVAL_TREE_COLOR_BLACK;
tree               73 opal/class/opal_interval_tree.c     tree->root.left = tree->root.right = tree->root.parent = &tree->nill;
tree               76 opal/class/opal_interval_tree.c     tree->root.low = (uint64_t) -1;
tree               77 opal/class/opal_interval_tree.c     tree->root.data = NULL;
tree               80 opal/class/opal_interval_tree.c     tree->tree_size = 0;
tree               81 opal/class/opal_interval_tree.c     tree->lock = 0;
tree               82 opal/class/opal_interval_tree.c     tree->reader_count = 0;
tree               83 opal/class/opal_interval_tree.c     tree->epoch = 0;
tree               88 opal/class/opal_interval_tree.c         tree->reader_epochs[i] = UINT_MAX;
tree               97 opal/class/opal_interval_tree.c static void opal_interval_tree_destruct (opal_interval_tree_t *tree)
tree               99 opal/class/opal_interval_tree.c     opal_interval_tree_destroy (tree);
tree              101 opal/class/opal_interval_tree.c     OBJ_DESTRUCT(&tree->free_list);
tree              102 opal/class/opal_interval_tree.c     OBJ_DESTRUCT(&tree->root);
tree              103 opal/class/opal_interval_tree.c     OBJ_DESTRUCT(&tree->nill);
tree              116 opal/class/opal_interval_tree.c static opal_interval_tree_token_t opal_interval_tree_reader_get_token (opal_interval_tree_t *tree)
tree              121 opal/class/opal_interval_tree.c         int32_t reader_count = tree->reader_count;
tree              125 opal/class/opal_interval_tree.c         token = tree->reader_id++ % OPAL_INTERVAL_TREE_MAX_READERS;
tree              127 opal/class/opal_interval_tree.c             if (opal_atomic_compare_exchange_strong_32 (&tree->reader_count, &reader_count, token + 1)) {
tree              133 opal/class/opal_interval_tree.c     while (!OPAL_ATOMIC_COMPARE_EXCHANGE_STRONG_32((opal_atomic_int32_t *) &tree->reader_epochs[token],
tree              134 opal/class/opal_interval_tree.c                                                    &(int32_t) {UINT_MAX}, tree->epoch));
tree              139 opal/class/opal_interval_tree.c static void opal_interval_tree_reader_return_token (opal_interval_tree_t *tree, opal_interval_tree_token_t token)
tree              141 opal/class/opal_interval_tree.c     tree->reader_epochs[token] = UINT_MAX;
tree              145 opal/class/opal_interval_tree.c int opal_interval_tree_init (opal_interval_tree_t *tree)
tree              147 opal/class/opal_interval_tree.c     return opal_free_list_init (&tree->free_list, sizeof(opal_interval_tree_node_t),
tree              152 opal/class/opal_interval_tree.c static bool opal_interval_tree_write_trylock (opal_interval_tree_t *tree)
tree              155 opal/class/opal_interval_tree.c     return !(tree->lock || opal_atomic_swap_32 (&tree->lock, 1));
tree              158 opal/class/opal_interval_tree.c static void opal_interval_tree_write_lock (opal_interval_tree_t *tree)
tree              160 opal/class/opal_interval_tree.c     while (!opal_interval_tree_write_trylock (tree));
tree              163 opal/class/opal_interval_tree.c static void opal_interval_tree_write_unlock (opal_interval_tree_t *tree)
tree              166 opal/class/opal_interval_tree.c     tree->lock = 0;
tree              169 opal/class/opal_interval_tree.c static void opal_interval_tree_insert_fixup_helper (opal_interval_tree_t *tree, opal_interval_tree_node_t *node) {
tree              188 opal/class/opal_interval_tree.c         opal_interval_tree_insert_fixup_helper (tree, parent->parent);
tree              194 opal/class/opal_interval_tree.c             node = left_rotate (tree, parent);
tree              200 opal/class/opal_interval_tree.c         (void) right_rotate(tree, parent->parent);
tree              203 opal/class/opal_interval_tree.c             node = right_rotate(tree, parent);
tree              208 opal/class/opal_interval_tree.c         (void) left_rotate(tree, parent->parent);
tree              211 opal/class/opal_interval_tree.c     opal_interval_tree_insert_fixup_helper (tree, node);
tree              214 opal/class/opal_interval_tree.c static void opal_interval_tree_insert_fixup (opal_interval_tree_t *tree, opal_interval_tree_node_t *node) {
tree              218 opal/class/opal_interval_tree.c     opal_interval_tree_insert_fixup_helper (tree, node);
tree              221 opal/class/opal_interval_tree.c     tree->root.left->color = OPAL_INTERVAL_TREE_COLOR_BLACK;
tree              234 opal/class/opal_interval_tree.c opal_interval_tree_delete_fixup_helper (opal_interval_tree_t *tree, opal_interval_tree_node_t *node,
tree              245 opal/class/opal_interval_tree.c             (void) left_rotate(tree, parent);
tree              248 opal/class/opal_interval_tree.c             (void) right_rotate(tree, parent);
tree              262 opal/class/opal_interval_tree.c             (void) right_rotate(tree, w);
tree              268 opal/class/opal_interval_tree.c         (void) left_rotate(tree, parent);
tree              273 opal/class/opal_interval_tree.c             (void) left_rotate(tree, w);
tree              279 opal/class/opal_interval_tree.c         (void) right_rotate(tree, parent);
tree              283 opal/class/opal_interval_tree.c     return tree->root.left;
tree              287 opal/class/opal_interval_tree.c static void opal_interval_tree_delete_fixup (opal_interval_tree_t *tree, opal_interval_tree_node_t *node,
tree              290 opal/class/opal_interval_tree.c     while ((node != tree->root.left) && (node->color == OPAL_INTERVAL_TREE_COLOR_BLACK)) {
tree              291 opal/class/opal_interval_tree.c         node = opal_interval_tree_delete_fixup_helper (tree, node, parent, node == parent->left);
tree              296 opal/class/opal_interval_tree.c     tree->nill.color = OPAL_INTERVAL_TREE_COLOR_BLACK;
tree              301 opal/class/opal_interval_tree.c static void opal_interval_tree_gc_clean (opal_interval_tree_t *tree)
tree              306 opal/class/opal_interval_tree.c     if (0 == opal_list_get_size (&tree->gc_list)) {
tree              310 opal/class/opal_interval_tree.c     for (int i = 0 ; i < tree->reader_count ; ++i) {
tree              311 opal/class/opal_interval_tree.c         oldest_epoch = (oldest_epoch < tree->reader_epochs[i]) ? oldest_epoch : tree->reader_epochs[i];
tree              314 opal/class/opal_interval_tree.c     OPAL_LIST_FOREACH_SAFE(node, next, &tree->gc_list, opal_interval_tree_node_t) {
tree              316 opal/class/opal_interval_tree.c             opal_list_remove_item (&tree->gc_list, &node->super.super);
tree              317 opal/class/opal_interval_tree.c             opal_free_list_return_st (&tree->free_list, &node->super);
tree              323 opal/class/opal_interval_tree.c int opal_interval_tree_insert (opal_interval_tree_t *tree, void *value, uint64_t low, uint64_t high)
tree              331 opal/class/opal_interval_tree.c     opal_interval_tree_write_lock (tree);
tree              333 opal/class/opal_interval_tree.c     opal_interval_tree_gc_clean (tree);
tree              336 opal/class/opal_interval_tree.c     node = (opal_interval_tree_node_t *) opal_free_list_get (&tree->free_list);
tree              338 opal/class/opal_interval_tree.c         opal_interval_tree_write_unlock (tree);
tree              347 opal/class/opal_interval_tree.c     node->epoch = tree->epoch;
tree              350 opal/class/opal_interval_tree.c     opal_interval_tree_insert_node (tree, node);
tree              352 opal/class/opal_interval_tree.c     opal_interval_tree_insert_fixup (tree, node);
tree              353 opal/class/opal_interval_tree.c     opal_interval_tree_write_unlock (tree);
tree              358 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *opal_interval_tree_find_interval(opal_interval_tree_t *tree, opal_interval_tree_node_t *node, uint64_t low,
tree              361 opal/class/opal_interval_tree.c     if (node == &tree->nill) {
tree              371 opal/class/opal_interval_tree.c         return opal_interval_tree_find_interval (tree, node->left, low, high, exact, data);
tree              374 opal/class/opal_interval_tree.c     return opal_interval_tree_find_interval (tree, node->right, low, high, exact, data);
tree              380 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *opal_interval_tree_find_node(opal_interval_tree_t *tree, uint64_t low, uint64_t high, bool exact, void *data)
tree              382 opal/class/opal_interval_tree.c     return opal_interval_tree_find_interval (tree, tree->root.left, low, high, exact, data);
tree              385 opal/class/opal_interval_tree.c void *opal_interval_tree_find_overlapping (opal_interval_tree_t *tree, uint64_t low, uint64_t high)
tree              390 opal/class/opal_interval_tree.c     token = opal_interval_tree_reader_get_token (tree);
tree              391 opal/class/opal_interval_tree.c     node = opal_interval_tree_find_node (tree, low, high, true, NULL);
tree              392 opal/class/opal_interval_tree.c     opal_interval_tree_reader_return_token (tree, token);
tree              397 opal/class/opal_interval_tree.c static size_t opal_interval_tree_depth_node (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              399 opal/class/opal_interval_tree.c     if (&tree->nill == node) {
tree              403 opal/class/opal_interval_tree.c     return 1 + max (opal_interval_tree_depth_node (tree, node->right), opal_interval_tree_depth_node (tree, node->left));
tree              406 opal/class/opal_interval_tree.c size_t opal_interval_tree_depth (opal_interval_tree_t *tree)
tree              411 opal/class/opal_interval_tree.c     token = opal_interval_tree_reader_get_token (tree);
tree              412 opal/class/opal_interval_tree.c     depth = opal_interval_tree_depth_node (tree, &tree->root);
tree              413 opal/class/opal_interval_tree.c     opal_interval_tree_reader_return_token (tree, token);
tree              428 opal/class/opal_interval_tree.c static inline void rp_wait_for_readers (opal_interval_tree_t *tree)
tree              430 opal/class/opal_interval_tree.c     uint32_t epoch_id = ++tree->epoch;
tree              433 opal/class/opal_interval_tree.c     for (int i = 0 ; i < tree->reader_count ; ++i) {
tree              434 opal/class/opal_interval_tree.c         while (tree->reader_epochs[i] < epoch_id);
tree              439 opal/class/opal_interval_tree.c static inline void rp_free_wait (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              441 opal/class/opal_interval_tree.c     rp_wait_for_readers (tree);
tree              443 opal/class/opal_interval_tree.c     opal_free_list_return_st (&tree->free_list, &node->super);
tree              447 opal/class/opal_interval_tree.c static inline void rp_free (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              449 opal/class/opal_interval_tree.c     opal_list_append (&tree->gc_list, &node->super.super);
tree              452 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *opal_interval_tree_node_copy (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              454 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *copy = (opal_interval_tree_node_t *) opal_free_list_wait_st (&tree->free_list);
tree              463 opal/class/opal_interval_tree.c static void opal_interval_tree_delete_leaf (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              465 opal/class/opal_interval_tree.c     const opal_interval_tree_node_t *nill = &tree->nill;
tree              478 opal/class/opal_interval_tree.c     rp_free (tree, node);
tree              484 opal/class/opal_interval_tree.c             opal_interval_tree_delete_fixup (tree, next, parent);
tree              489 opal/class/opal_interval_tree.c static void opal_interval_tree_delete_interior (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              495 opal/class/opal_interval_tree.c     next = opal_interval_tree_next (tree, node);
tree              500 opal/class/opal_interval_tree.c         next_copy = opal_interval_tree_node_copy (tree, next);
tree              509 opal/class/opal_interval_tree.c         rp_free_wait (tree, node);
tree              511 opal/class/opal_interval_tree.c         opal_interval_tree_delete_leaf (tree, next);
tree              519 opal/class/opal_interval_tree.c         rp_free (tree, node);
tree              527 opal/class/opal_interval_tree.c 		opal_interval_tree_delete_fixup (tree, next->right, next);
tree              534 opal/class/opal_interval_tree.c int opal_interval_tree_delete (opal_interval_tree_t *tree, uint64_t low, uint64_t high, void *data)
tree              538 opal/class/opal_interval_tree.c     opal_interval_tree_write_lock (tree);
tree              539 opal/class/opal_interval_tree.c     node = opal_interval_tree_find_node (tree, low, high, true, data);
tree              541 opal/class/opal_interval_tree.c         opal_interval_tree_write_unlock (tree);
tree              555 opal/class/opal_interval_tree.c     if ((node->left == &tree->nill) || (node->right == &tree->nill)) {
tree              557 opal/class/opal_interval_tree.c         opal_interval_tree_delete_leaf (tree, node);
tree              560 opal/class/opal_interval_tree.c         opal_interval_tree_delete_interior (tree, node);
tree              563 opal/class/opal_interval_tree.c     --tree->tree_size;
tree              565 opal/class/opal_interval_tree.c     opal_interval_tree_write_unlock (tree);
tree              570 opal/class/opal_interval_tree.c int opal_interval_tree_destroy (opal_interval_tree_t *tree)
tree              573 opal/class/opal_interval_tree.c     inorder_destroy(tree, &tree->root);
tree              574 opal/class/opal_interval_tree.c     tree->tree_size = 0;
tree              580 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *opal_interval_tree_next (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              584 opal/class/opal_interval_tree.c     if (p == &tree->nill) {
tree              591 opal/class/opal_interval_tree.c         if (p == &tree->root) {
tree              592 opal/class/opal_interval_tree.c             return &tree->nill;
tree              598 opal/class/opal_interval_tree.c     while (p->left != &tree->nill) {
tree              608 opal/class/opal_interval_tree.c static void opal_interval_tree_insert_node (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              610 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *parent = &tree->root;
tree              612 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *nill = &tree->nill;
tree              641 opal/class/opal_interval_tree.c     ++tree->tree_size;
tree              644 opal/class/opal_interval_tree.c static int inorder_traversal (opal_interval_tree_t *tree, uint64_t low, uint64_t high,
tree              650 opal/class/opal_interval_tree.c     if (node == &tree->nill) {
tree              654 opal/class/opal_interval_tree.c     rc = inorder_traversal(tree, low, high, partial_ok, action, node->left, ctx);
tree              670 opal/class/opal_interval_tree.c     return inorder_traversal(tree, low, high, partial_ok, action, node->right, ctx);
tree              675 opal/class/opal_interval_tree.c static void inorder_destroy (opal_interval_tree_t *tree, opal_interval_tree_node_t *node)
tree              677 opal/class/opal_interval_tree.c     if (node == &tree->nill) {
tree              681 opal/class/opal_interval_tree.c     inorder_destroy(tree, node->left);
tree              682 opal/class/opal_interval_tree.c     inorder_destroy(tree, node->right);
tree              684 opal/class/opal_interval_tree.c     if (node->left != &tree->nill) {
tree              685 opal/class/opal_interval_tree.c         opal_free_list_return_st (&tree->free_list, &node->left->super);
tree              688 opal/class/opal_interval_tree.c     if (node->right != &tree->nill) {
tree              689 opal/class/opal_interval_tree.c         opal_free_list_return_st (&tree->free_list, &node->right->super);
tree              695 opal/class/opal_interval_tree.c int opal_interval_tree_traverse (opal_interval_tree_t *tree, uint64_t low, uint64_t high,
tree              705 opal/class/opal_interval_tree.c     token = opal_interval_tree_reader_get_token (tree);
tree              706 opal/class/opal_interval_tree.c     rc = inorder_traversal (tree, low, high, partial_ok, action, tree->root.left, ctx);
tree              707 opal/class/opal_interval_tree.c     opal_interval_tree_reader_return_token (tree, token);
tree              714 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *left_rotate (opal_interval_tree_t *tree, opal_interval_tree_node_t *x)
tree              721 opal/class/opal_interval_tree.c     if (y->left != &tree->nill) {
tree              750 opal/class/opal_interval_tree.c static opal_interval_tree_node_t *right_rotate (opal_interval_tree_t *tree, opal_interval_tree_node_t *x)
tree              757 opal/class/opal_interval_tree.c     if (y->right != &tree->nill) {
tree              781 opal/class/opal_interval_tree.c size_t opal_interval_tree_size(opal_interval_tree_t *tree)
tree              783 opal/class/opal_interval_tree.c     return tree->tree_size;
tree              786 opal/class/opal_interval_tree.c static bool opal_interval_tree_verify_node (opal_interval_tree_t *tree, opal_interval_tree_node_t *node, int black_depth,
tree              789 opal/class/opal_interval_tree.c     if (node == &tree->nill) {
tree              804 opal/class/opal_interval_tree.c     if (node->left == &tree->nill && node->right == &tree->nill) {
tree              813 opal/class/opal_interval_tree.c     return opal_interval_tree_verify_node (tree, node->left, black_depth, current_black_depth) ||
tree              814 opal/class/opal_interval_tree.c         opal_interval_tree_verify_node (tree, node->right, black_depth, current_black_depth);
tree              817 opal/class/opal_interval_tree.c static int opal_interval_tree_black_depth (opal_interval_tree_t *tree, opal_interval_tree_node_t *node, int depth)
tree              819 opal/class/opal_interval_tree.c     if (node == &tree->nill) {
tree              828 opal/class/opal_interval_tree.c     return opal_interval_tree_black_depth (tree, node->left, depth);
tree              831 opal/class/opal_interval_tree.c bool opal_interval_tree_verify (opal_interval_tree_t *tree)
tree              835 opal/class/opal_interval_tree.c     if (OPAL_INTERVAL_TREE_COLOR_BLACK != tree->root.left->color) {
tree              840 opal/class/opal_interval_tree.c     if (OPAL_INTERVAL_TREE_COLOR_BLACK != tree->nill.color) {
tree              845 opal/class/opal_interval_tree.c     black_depth = opal_interval_tree_black_depth (tree, tree->root.left, 0);
tree              847 opal/class/opal_interval_tree.c     return opal_interval_tree_verify_node (tree, tree->root.left, black_depth, 0);
tree              850 opal/class/opal_interval_tree.c static void opal_interval_tree_dump_node (opal_interval_tree_t *tree, opal_interval_tree_node_t *node, int black_rank, FILE *fh)
tree              854 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *nill = &tree->nill;
tree              885 opal/class/opal_interval_tree.c     if (node != tree->root.left) {
tree              888 opal/class/opal_interval_tree.c     opal_interval_tree_dump_node (tree, node->left, black_rank, fh);
tree              889 opal/class/opal_interval_tree.c     opal_interval_tree_dump_node (tree, node->right, black_rank, fh);
tree              892 opal/class/opal_interval_tree.c int opal_interval_tree_dump (opal_interval_tree_t *tree, const char *path)
tree              903 opal/class/opal_interval_tree.c     opal_interval_tree_dump_node (tree, tree->root.left, 0, fh);
tree              128 opal/class/opal_interval_tree.h OPAL_DECLSPEC int opal_interval_tree_init(opal_interval_tree_t * tree);
tree              141 opal/class/opal_interval_tree.h OPAL_DECLSPEC int opal_interval_tree_insert(opal_interval_tree_t *tree, void *value, uint64_t low, uint64_t high);
tree              154 opal/class/opal_interval_tree.h OPAL_DECLSPEC void *opal_interval_tree_find_overlapping (opal_interval_tree_t *tree, uint64_t low, uint64_t high);
tree              170 opal/class/opal_interval_tree.h OPAL_DECLSPEC int opal_interval_tree_delete(opal_interval_tree_t *tree, uint64_t low, uint64_t high, void *data);
tree              179 opal/class/opal_interval_tree.h OPAL_DECLSPEC int opal_interval_tree_destroy(opal_interval_tree_t *tree);
tree              195 opal/class/opal_interval_tree.h OPAL_DECLSPEC int opal_interval_tree_traverse (opal_interval_tree_t *tree, uint64_t low, uint64_t high,
tree              205 opal/class/opal_interval_tree.h OPAL_DECLSPEC size_t opal_interval_tree_size (opal_interval_tree_t *tree);
tree              216 opal/class/opal_interval_tree.h OPAL_DECLSPEC size_t opal_interval_tree_depth (opal_interval_tree_t *tree);
tree              227 opal/class/opal_interval_tree.h OPAL_DECLSPEC bool opal_interval_tree_verify (opal_interval_tree_t *tree);
tree              238 opal/class/opal_interval_tree.h OPAL_DECLSPEC int opal_interval_tree_dump (opal_interval_tree_t *tree, const char *path);
tree               30 opal/class/opal_rb_tree.c static void btree_insert(opal_rb_tree_t *tree, opal_rb_tree_node_t * node);
tree               31 opal/class/opal_rb_tree.c static void btree_delete_fixup(opal_rb_tree_t *tree, opal_rb_tree_node_t * x);
tree               32 opal/class/opal_rb_tree.c static opal_rb_tree_node_t * btree_successor(opal_rb_tree_t * tree,
tree               34 opal/class/opal_rb_tree.c static opal_rb_tree_node_t * opal_rb_tree_find_node(opal_rb_tree_t *tree, void *key);
tree               35 opal/class/opal_rb_tree.c static void left_rotate(opal_rb_tree_t *tree, opal_rb_tree_node_t * x);
tree               36 opal/class/opal_rb_tree.c static void right_rotate(opal_rb_tree_t *tree, opal_rb_tree_node_t * x);
tree               37 opal/class/opal_rb_tree.c static void inorder_destroy(opal_rb_tree_t *tree, opal_rb_tree_node_t * node);
tree               38 opal/class/opal_rb_tree.c static void inorder_traversal(opal_rb_tree_t *tree,
tree               53 opal/class/opal_rb_tree.c     opal_rb_tree_t * tree = (opal_rb_tree_t *) object;
tree               54 opal/class/opal_rb_tree.c     tree->root_ptr = NULL;
tree               55 opal/class/opal_rb_tree.c     OBJ_CONSTRUCT(&(tree->free_list), opal_free_list_t);
tree               56 opal/class/opal_rb_tree.c     opal_free_list_init (&(tree->free_list), sizeof(opal_rb_tree_node_t),
tree               81 opal/class/opal_rb_tree.c int opal_rb_tree_init(opal_rb_tree_t * tree,
tree               86 opal/class/opal_rb_tree.c     node = opal_free_list_get (&(tree->free_list));
tree               87 opal/class/opal_rb_tree.c     tree->root_ptr = (opal_rb_tree_node_t *) node;
tree               92 opal/class/opal_rb_tree.c     node = opal_free_list_get (&(tree->free_list));
tree               94 opal/class/opal_rb_tree.c         opal_free_list_return (&tree->free_list, (opal_free_list_item_t*)tree->root_ptr);
tree               97 opal/class/opal_rb_tree.c     tree->nill = (opal_rb_tree_node_t *) node;
tree               99 opal/class/opal_rb_tree.c     tree->nill->color = BLACK;
tree              100 opal/class/opal_rb_tree.c     tree->nill->left = tree->nill;
tree              101 opal/class/opal_rb_tree.c     tree->nill->right = tree->nill;
tree              102 opal/class/opal_rb_tree.c     tree->nill->parent = tree->nill;
tree              105 opal/class/opal_rb_tree.c     tree->root_ptr->left = tree->nill;
tree              106 opal/class/opal_rb_tree.c     tree->root_ptr->right = tree->nill;
tree              107 opal/class/opal_rb_tree.c     tree->root_ptr->parent = tree->nill;
tree              108 opal/class/opal_rb_tree.c     tree->root_ptr->color = BLACK;
tree              110 opal/class/opal_rb_tree.c     tree->comp = comp;
tree              113 opal/class/opal_rb_tree.c     tree->tree_size = 0;
tree              120 opal/class/opal_rb_tree.c int opal_rb_tree_insert(opal_rb_tree_t *tree, void * key, void * value)
tree              127 opal/class/opal_rb_tree.c     item = opal_free_list_get (&tree->free_list);
tree              137 opal/class/opal_rb_tree.c     btree_insert(tree, node);
tree              153 opal/class/opal_rb_tree.c                     left_rotate(tree, node);
tree              157 opal/class/opal_rb_tree.c                 right_rotate(tree, node->parent->parent);
tree              169 opal/class/opal_rb_tree.c                     right_rotate(tree, node);
tree              173 opal/class/opal_rb_tree.c                 left_rotate(tree, node->parent->parent);
tree              178 opal/class/opal_rb_tree.c     tree->root_ptr->left->color = BLACK;
tree              183 opal/class/opal_rb_tree.c void * opal_rb_tree_find_with(opal_rb_tree_t *tree, void *key,
tree              189 opal/class/opal_rb_tree.c     node = tree->root_ptr->left;
tree              190 opal/class/opal_rb_tree.c     while (node != tree->nill) {
tree              206 opal/class/opal_rb_tree.c static opal_rb_tree_node_t * opal_rb_tree_find_node(opal_rb_tree_t *tree, void *key)
tree              211 opal/class/opal_rb_tree.c     node = tree->root_ptr->left;
tree              212 opal/class/opal_rb_tree.c     while (node != tree->nill) {
tree              213 opal/class/opal_rb_tree.c         compvalue = tree->comp(key, node->key);
tree              226 opal/class/opal_rb_tree.c int opal_rb_tree_delete(opal_rb_tree_t *tree, void *key)
tree              233 opal/class/opal_rb_tree.c     p = opal_rb_tree_find_node(tree, key);
tree              237 opal/class/opal_rb_tree.c     if ((p->left == tree->nill) || (p->right == tree->nill)) {
tree              240 opal/class/opal_rb_tree.c         todelete = btree_successor(tree, p);
tree              243 opal/class/opal_rb_tree.c     if (todelete->left == tree->nill) {
tree              251 opal/class/opal_rb_tree.c     if (y->parent == tree->root_ptr) {
tree              252 opal/class/opal_rb_tree.c         tree->root_ptr->left = y;
tree              267 opal/class/opal_rb_tree.c         btree_delete_fixup(tree, y);
tree              270 opal/class/opal_rb_tree.c     opal_free_list_return (&(tree->free_list), item);
tree              271 opal/class/opal_rb_tree.c     --tree->tree_size;
tree              277 opal/class/opal_rb_tree.c int opal_rb_tree_destroy(opal_rb_tree_t *tree)
tree              282 opal/class/opal_rb_tree.c     inorder_destroy(tree, tree->root_ptr);
tree              285 opal/class/opal_rb_tree.c     item = (opal_free_list_item_t *) tree->root_ptr;
tree              286 opal/class/opal_rb_tree.c     opal_free_list_return(&(tree->free_list), item);
tree              289 opal/class/opal_rb_tree.c     item = (opal_free_list_item_t *) tree->nill;
tree              290 opal/class/opal_rb_tree.c     opal_free_list_return (&(tree->free_list), item);
tree              297 opal/class/opal_rb_tree.c static opal_rb_tree_node_t * btree_successor(opal_rb_tree_t * tree, opal_rb_tree_node_t * node)
tree              301 opal/class/opal_rb_tree.c     if (node->right == tree->nill) {
tree              307 opal/class/opal_rb_tree.c         if(p == tree->root_ptr) {
tree              308 opal/class/opal_rb_tree.c             return tree->nill;
tree              314 opal/class/opal_rb_tree.c     while(p->left != tree->nill) {
tree              324 opal/class/opal_rb_tree.c static void btree_insert(opal_rb_tree_t *tree, opal_rb_tree_node_t * node)
tree              326 opal/class/opal_rb_tree.c     opal_rb_tree_node_t * parent = tree->root_ptr;
tree              332 opal/class/opal_rb_tree.c     node->left = tree->nill;
tree              333 opal/class/opal_rb_tree.c     node->right = tree->nill;
tree              336 opal/class/opal_rb_tree.c     while (n != tree->nill) {
tree              338 opal/class/opal_rb_tree.c         n = ((tree->comp(node->key, n->key) <= 0) ? n->left : n->right);
tree              342 opal/class/opal_rb_tree.c     if((parent == tree->root_ptr) || (tree->comp(node->key, parent->key) <= 0)) {
tree              350 opal/class/opal_rb_tree.c     node->left = tree->nill;
tree              351 opal/class/opal_rb_tree.c     node->right = tree->nill;
tree              352 opal/class/opal_rb_tree.c     ++(tree->tree_size);
tree              357 opal/class/opal_rb_tree.c static void btree_delete_fixup(opal_rb_tree_t *tree, opal_rb_tree_node_t * x)
tree              360 opal/class/opal_rb_tree.c     opal_rb_tree_node_t * root = tree->root_ptr->left;
tree              367 opal/class/opal_rb_tree.c                 left_rotate(tree, x->parent);
tree              377 opal/class/opal_rb_tree.c                     right_rotate(tree, w);
tree              383 opal/class/opal_rb_tree.c                 left_rotate(tree, x->parent);
tree              392 opal/class/opal_rb_tree.c                 right_rotate(tree, x->parent);
tree              402 opal/class/opal_rb_tree.c                     left_rotate(tree, w);
tree              408 opal/class/opal_rb_tree.c                 right_rotate(tree, x->parent);
tree              422 opal/class/opal_rb_tree.c inorder_destroy(opal_rb_tree_t *tree, opal_rb_tree_node_t * node)
tree              426 opal/class/opal_rb_tree.c     if (node == tree->nill) {
tree              430 opal/class/opal_rb_tree.c     inorder_destroy(tree, node->left);
tree              432 opal/class/opal_rb_tree.c     if (node->left != tree->nill) {
tree              434 opal/class/opal_rb_tree.c         --tree->tree_size;
tree              435 opal/class/opal_rb_tree.c         opal_free_list_return (&tree->free_list, item);
tree              438 opal/class/opal_rb_tree.c     inorder_destroy(tree, node->right);
tree              439 opal/class/opal_rb_tree.c     if (node->right != tree->nill) {
tree              441 opal/class/opal_rb_tree.c         --tree->tree_size;
tree              442 opal/class/opal_rb_tree.c         opal_free_list_return (&tree->free_list, item);
tree              448 opal/class/opal_rb_tree.c int opal_rb_tree_traverse(opal_rb_tree_t *tree,
tree              456 opal/class/opal_rb_tree.c     inorder_traversal(tree, cond, action, tree->root_ptr->left);
tree              462 opal/class/opal_rb_tree.c static void inorder_traversal(opal_rb_tree_t *tree,
tree              467 opal/class/opal_rb_tree.c     if (node == tree->nill) {
tree              471 opal/class/opal_rb_tree.c     inorder_traversal(tree, cond, action, node->left);
tree              477 opal/class/opal_rb_tree.c     inorder_traversal(tree, cond, action, node->right);
tree              483 opal/class/opal_rb_tree.c static void left_rotate(opal_rb_tree_t *tree, opal_rb_tree_node_t * x)
tree              489 opal/class/opal_rb_tree.c     if (y->left != tree->nill) {
tree              514 opal/class/opal_rb_tree.c static void right_rotate(opal_rb_tree_t *tree, opal_rb_tree_node_t * x)
tree              520 opal/class/opal_rb_tree.c     if(y->right != tree->nill) {
tree              540 opal/class/opal_rb_tree.c int opal_rb_tree_size(opal_rb_tree_t *tree)
tree              542 opal/class/opal_rb_tree.c         return tree->tree_size;
tree              548 opal/class/opal_rb_tree.c static void inorder(opal_rb_tree_t * tree, opal_rb_tree_node_t * node);
tree              549 opal/class/opal_rb_tree.c static void print_inorder(opal_rb_tree_t * tree);
tree              551 opal/class/opal_rb_tree.c void inorder(opal_rb_tree_t * tree, opal_rb_tree_node_t * node)
tree              554 opal/class/opal_rb_tree.c     if (node == tree->nill) {
tree              559 opal/class/opal_rb_tree.c     inorder(tree, node->left);
tree              563 opal/class/opal_rb_tree.c     inorder(tree, node->right);
tree              568 opal/class/opal_rb_tree.c void print_inorder(opal_rb_tree_t *tree)
tree              570 opal/class/opal_rb_tree.c     inorder(tree, tree->root_ptr->left);
tree              117 opal/class/opal_rb_tree.h OPAL_DECLSPEC int opal_rb_tree_init(opal_rb_tree_t * tree, opal_rb_tree_comp_fn_t comp);
tree              130 opal/class/opal_rb_tree.h OPAL_DECLSPEC int opal_rb_tree_insert(opal_rb_tree_t *tree, void * key, void * value);
tree              143 opal/class/opal_rb_tree.h OPAL_DECLSPEC void * opal_rb_tree_find_with(opal_rb_tree_t *tree, void *key, opal_rb_tree_comp_fn_t compfn);
tree              154 opal/class/opal_rb_tree.h static inline void * opal_rb_tree_find(opal_rb_tree_t *tree, void *key)
tree              156 opal/class/opal_rb_tree.h     return opal_rb_tree_find_with(tree, key, tree->comp);
tree              168 opal/class/opal_rb_tree.h OPAL_DECLSPEC int opal_rb_tree_delete(opal_rb_tree_t *tree, void *key);
tree              177 opal/class/opal_rb_tree.h OPAL_DECLSPEC int opal_rb_tree_destroy(opal_rb_tree_t *tree);
tree              190 opal/class/opal_rb_tree.h OPAL_DECLSPEC int opal_rb_tree_traverse(opal_rb_tree_t *tree,
tree              201 opal/class/opal_rb_tree.h OPAL_DECLSPEC int opal_rb_tree_size(opal_rb_tree_t *tree);
tree               82 opal/class/opal_tree.c static void opal_tree_construct(opal_tree_t *tree)
tree               84 opal/class/opal_tree.c     OBJ_CONSTRUCT( &(tree->opal_tree_sentinel), opal_tree_item_t );
tree               91 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_item_refcount  = 1;
tree               92 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_item_belong_to = tree;
tree               94 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_container = tree;
tree               95 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_parent = &tree->opal_tree_sentinel;
tree               96 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_num_ancestors = -1;
tree               98 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_next_sibling =
tree               99 opal/class/opal_tree.c         &tree->opal_tree_sentinel;
tree              100 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_prev_sibling =
tree              101 opal/class/opal_tree.c         &tree->opal_tree_sentinel;
tree              103 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_first_child = &tree->opal_tree_sentinel;
tree              104 opal/class/opal_tree.c     tree->opal_tree_sentinel.opal_tree_last_child = &tree->opal_tree_sentinel;
tree              106 opal/class/opal_tree.c     tree->opal_tree_num_items = 0;
tree              107 opal/class/opal_tree.c     tree->comp = NULL;
tree              108 opal/class/opal_tree.c     tree->serialize = NULL;
tree              109 opal/class/opal_tree.c     tree->deserialize = NULL;
tree              110 opal/class/opal_tree.c     tree->get_key = NULL;
tree              117 opal/class/opal_tree.c static void opal_tree_destruct(opal_tree_t *tree)
tree              119 opal/class/opal_tree.c     opal_tree_construct(tree);
tree              125 opal/class/opal_tree.c void opal_tree_init(opal_tree_t *tree, opal_tree_comp_fn_t comp,
tree              130 opal/class/opal_tree.c     tree->comp = comp;
tree              131 opal/class/opal_tree.c     tree->serialize = serialize;
tree              132 opal/class/opal_tree.c     tree->deserialize = deserialize;
tree              133 opal/class/opal_tree.c     tree->get_key = get_key;
tree              155 opal/class/opal_tree.c size_t opal_tree_get_size(opal_tree_t* tree)
tree              165 opal/class/opal_tree.c     if (!opal_tree_is_empty(tree)) {
tree              167 opal/class/opal_tree.c         root = opal_tree_get_root(tree);
tree              171 opal/class/opal_tree.c     if (check_len != tree->opal_tree_num_items) {
tree              178 opal/class/opal_tree.c     return tree->opal_tree_num_items;
tree              317 opal/class/opal_tree.c int opal_tree_remove_item(opal_tree_t *tree,
tree              532 opal/class/opal_tree.c void * opal_tree_get_key(opal_tree_t *tree, opal_tree_item_t *item)
tree              534 opal/class/opal_tree.c     return tree->get_key(item);
tree              293 opal/class/opal_tree.h static inline bool opal_tree_is_empty(opal_tree_t* tree)
tree              297 opal/class/opal_tree.h     assert(NULL != tree);
tree              299 opal/class/opal_tree.h     return (tree->opal_tree_sentinel.opal_tree_first_child ==
tree              300 opal/class/opal_tree.h             &(tree->opal_tree_sentinel) ? true : false);
tree              317 opal/class/opal_tree.h static inline opal_tree_item_t* opal_tree_get_root(opal_tree_t* tree)
tree              321 opal/class/opal_tree.h     assert(NULL != tree);
tree              323 opal/class/opal_tree.h     item = tree->opal_tree_sentinel.opal_tree_first_child;
tree              327 opal/class/opal_tree.h     assert(tree == item->opal_tree_item_belong_to );
tree              342 opal/class/opal_tree.h OPAL_DECLSPEC size_t opal_tree_get_size(opal_tree_t* tree);
tree              356 opal/class/opal_tree.h OPAL_DECLSPEC void opal_tree_init(opal_tree_t *tree,
tree              403 opal/class/opal_tree.h OPAL_DECLSPEC int opal_tree_remove_item(opal_tree_t *tree,
tree              455 opal/class/opal_tree.h OPAL_DECLSPEC void * opal_tree_get_key(opal_tree_t *tree, opal_tree_item_t *item);
tree              199 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c hwloc_pci_traverse(void * cbdata, struct hwloc_obj *tree,
tree              203 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c   cb(cbdata, tree);
tree              204 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c   for_each_io_child(child, tree) {
tree             5698 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c   hwloc_obj_t tree = NULL;
tree             5821 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     hwloc_pcidisc_tree_insert_by_busid(&tree, obj);
tree             5826 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c   hwloc_pcidisc_tree_attach(backend->topology, tree);
tree             5831 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c hwloc_linuxfs_pci_find_pcislot_obj(struct hwloc_obj *tree,
tree             5834 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c   for ( ; tree; tree = tree->next_sibling) {
tree             5835 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     if (tree->type == HWLOC_OBJ_PCI_DEVICE
tree             5836 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	|| (tree->type == HWLOC_OBJ_BRIDGE
tree             5837 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	    && tree->attr->bridge.upstream_type == HWLOC_OBJ_BRIDGE_PCI)) {
tree             5838 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       if (tree->attr->pcidev.domain == domain
tree             5839 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->pcidev.bus == bus
tree             5840 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->pcidev.dev == dev
tree             5841 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->pcidev.func == 0)
tree             5843 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	return tree;
tree             5844 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       if (tree->attr->pcidev.domain > domain
tree             5845 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  || (tree->attr->pcidev.domain == domain
tree             5846 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	      && tree->attr->pcidev.bus > bus))
tree             5849 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       if (tree->type == HWLOC_OBJ_BRIDGE
tree             5850 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->bridge.downstream_type == HWLOC_OBJ_BRIDGE_PCI
tree             5851 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->bridge.downstream.pci.domain == domain
tree             5852 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->bridge.downstream.pci.secondary_bus <= bus
tree             5853 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	  && tree->attr->bridge.downstream.pci.subordinate_bus >= bus)
tree             5855 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	return hwloc_linuxfs_pci_find_pcislot_obj(tree->io_first_child, domain, bus, dev);
tree             5857 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c     } else if (tree->type == HWLOC_OBJ_BRIDGE
tree             5858 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	       && tree->attr->bridge.upstream_type != HWLOC_OBJ_BRIDGE_PCI
tree             5859 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	       && tree->attr->bridge.downstream_type == HWLOC_OBJ_BRIDGE_PCI
tree             5861 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	       && tree->attr->bridge.downstream.pci.domain == domain
tree             5862 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	       && tree->attr->bridge.downstream.pci.secondary_bus <= bus
tree             5863 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c 	       && tree->attr->bridge.downstream.pci.subordinate_bus >= bus) {
tree             5865 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c       return hwloc_linuxfs_pci_find_pcislot_obj(tree->io_first_child, domain, bus, dev);
tree               95 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-pci.c   struct hwloc_obj *tree = NULL, *tmp;
tree              282 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-pci.c     hwloc_pcidisc_tree_insert_by_busid(&tree, obj);
tree              290 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-pci.c   hwloc_pcidisc_tree_attach(topology, tree);
tree              499 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/plugins.h HWLOC_DECLSPEC int hwloc_pcidisc_tree_attach(struct hwloc_topology *topology, struct hwloc_obj *tree);
tree              502 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h void netloc_arch_tree_complete(netloc_arch_tree_t *tree, UT_array **down_degrees_by_level,
tree              505 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h NETLOC_int netloc_arch_tree_num_leaves(netloc_arch_tree_t *tree);
tree               45 opal/mca/rcache/base/rcache_base_vma.h     opal_interval_tree_t tree;
tree               36 opal/mca/rcache/base/rcache_base_vma_tree.c     OBJ_CONSTRUCT(&vma_module->tree, opal_interval_tree_t);
tree               38 opal/mca/rcache/base/rcache_base_vma_tree.c     return opal_interval_tree_init (&vma_module->tree);
tree               43 opal/mca/rcache/base/rcache_base_vma_tree.c     OBJ_DESTRUCT(&vma_module->tree);
tree               49 opal/mca/rcache/base/rcache_base_vma_tree.c     return (mca_rcache_base_registration_t *) opal_interval_tree_find_overlapping (&vma_module->tree, (uintptr_t) base,
tree               81 opal/mca/rcache/base/rcache_base_vma_tree.c     (void) opal_interval_tree_traverse (&vma_module->tree, (uint64_t) (uintptr_t) base, ((uint64_t) (uintptr_t) bound) + 1,
tree              105 opal/mca/rcache/base/rcache_base_vma_tree.c     return opal_interval_tree_traverse (&vma_module->tree, (uint64_t) (intptr_t) base, bound, partial_ok,
tree              112 opal/mca/rcache/base/rcache_base_vma_tree.c     return opal_interval_tree_insert (&vma_module->tree, reg, (uintptr_t) reg->base, (uintptr_t) reg->bound + 1);
tree              126 opal/mca/rcache/base/rcache_base_vma_tree.c     return opal_interval_tree_delete (&vma_module->tree, (uintptr_t) reg->base, (uintptr_t) reg->bound + 1, reg);
tree              147 opal/mca/rcache/base/rcache_base_vma_tree.c     if (opal_interval_tree_size (&vma_module->tree)) {
tree              148 opal/mca/rcache/base/rcache_base_vma_tree.c         (void) opal_interval_tree_traverse (&vma_module->tree, (uintptr_t) base, bound, false,
tree              157 opal/mca/rcache/base/rcache_base_vma_tree.c     return opal_interval_tree_size (&vma_module->tree);
tree               89 test/class/ompi_rb_tree.c     opal_rb_tree_t tree;
tree               98 test/class/ompi_rb_tree.c     OBJ_CONSTRUCT(&tree, opal_rb_tree_t);
tree               99 test/class/ompi_rb_tree.c     rc = opal_rb_tree_init(&tree, comp_key);
tree              110 test/class/ompi_rb_tree.c         rc = opal_rb_tree_insert(&tree, cur_key, cur_val);
tree              117 test/class/ompi_rb_tree.c         rc = opal_rb_tree_delete(&tree, cur_key);
tree              124 test/class/ompi_rb_tree.c         cur_val = (my_val_t*) opal_rb_tree_find(&tree, cur_key);
tree              140 test/class/ompi_rb_tree.c     opal_rb_tree_t tree;
tree              144 test/class/ompi_rb_tree.c     OBJ_CONSTRUCT(&tree, opal_rb_tree_t);
tree              145 test/class/ompi_rb_tree.c     rc = opal_rb_tree_init(&tree, comp_fn);
tree              150 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[0], &values[0]);
tree              154 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[0]);
tree              162 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[1], &values[1]);
tree              166 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[1]);
tree              174 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[2], &values[2]);
tree              178 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[2]);
tree              186 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[3], &values[3]);
tree              190 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[3]);
tree              198 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[4], &values[4]);
tree              202 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[4]);
tree              210 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[5], &values[5]);
tree              214 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[5]);
tree              222 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[6], &values[6]);
tree              226 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[6]);
tree              234 test/class/ompi_rb_tree.c     rc = opal_rb_tree_insert(&tree, &keys[7], &values[7]);
tree              238 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[7]);
tree              246 test/class/ompi_rb_tree.c     rc = opal_rb_tree_size(&tree);
tree              251 test/class/ompi_rb_tree.c     rc = opal_rb_tree_delete(&tree, &keys[0]);
tree              255 test/class/ompi_rb_tree.c     result = opal_rb_tree_find(&tree, &keys[0]);
tree              262 test/class/ompi_rb_tree.c     OBJ_DESTRUCT(&tree);
tree              312 test/class/ompi_rb_tree.c     opal_rb_tree_t tree;
tree              326 test/class/ompi_rb_tree.c     OBJ_CONSTRUCT(&tree, opal_rb_tree_t);
tree              327 test/class/ompi_rb_tree.c     rc = opal_rb_tree_init(&tree, mem_node_compare);
tree              351 test/class/ompi_rb_tree.c         rc = opal_rb_tree_insert(&tree, &((opal_test_rb_value_t *)new_value)->key,
tree              364 test/class/ompi_rb_tree.c         result = opal_rb_tree_find(&tree, &lookup);
tree              372 test/class/ompi_rb_tree.c         result = opal_rb_tree_find(&tree, &lookup);
tree              400 test/class/ompi_rb_tree.c     OBJ_DESTRUCT(&tree);
tree               48 test/class/opal_tree.c     opal_tree_t tree, x;
tree               67 test/class/opal_tree.c     OBJ_CONSTRUCT(&tree, opal_tree_t);
tree               68 test/class/opal_tree.c     opal_tree_init(&tree, test_comp, test_serialize, test_deserialize, test_get_key);
tree               73 test/class/opal_tree.c     tree_size=opal_tree_get_size(&tree);
tree               81 test/class/opal_tree.c     if (opal_tree_is_empty(&tree)) {
tree               99 test/class/opal_tree.c     item = opal_tree_get_root(&tree);
tree              113 test/class/opal_tree.c     tree_size=opal_tree_get_size(&tree);
tree              121 test/class/opal_tree.c     if (!opal_tree_is_empty(&tree)) {
tree              130 test/class/opal_tree.c     if (!opal_tree_is_empty(&tree)) {
tree              131 test/class/opal_tree.c         item = opal_tree_get_root(&tree);
tree              150 test/class/opal_tree.c     item = opal_tree_find_with(opal_tree_get_root(&tree), (void*)&key);
tree              160 test/class/opal_tree.c     item = opal_tree_find_with(opal_tree_get_root(&tree), (void*)&key);
tree              186 test/class/opal_tree.c     tree_size=opal_tree_get_size(&tree);
tree              187 test/class/opal_tree.c     item = opal_tree_find_with(opal_tree_get_root(&tree), (void*)&key);
tree              193 test/class/opal_tree.c     if (5 != (tree_size - opal_tree_get_size(&tree))) {
tree              199 test/class/opal_tree.c 	    opal_tree_find_with(opal_tree_get_root(&tree), (void*)&key)) {
tree              205 test/class/opal_tree.c 		opal_tree_find_with(opal_tree_get_root(&tree), (void*)&key)) {
tree              217 test/class/opal_tree.c     if (OPAL_SUCCESS == opal_tree_serialize(opal_tree_get_root(&tree),