root_ptr           54 opal/class/opal_rb_tree.c     tree->root_ptr = NULL;
root_ptr           68 opal/class/opal_rb_tree.c     if(NULL != ((opal_rb_tree_t *)object)->root_ptr) {
root_ptr           87 opal/class/opal_rb_tree.c     tree->root_ptr = (opal_rb_tree_node_t *) node;
root_ptr           94 opal/class/opal_rb_tree.c         opal_free_list_return (&tree->free_list, (opal_free_list_item_t*)tree->root_ptr);
root_ptr          105 opal/class/opal_rb_tree.c     tree->root_ptr->left = tree->nill;
root_ptr          106 opal/class/opal_rb_tree.c     tree->root_ptr->right = tree->nill;
root_ptr          107 opal/class/opal_rb_tree.c     tree->root_ptr->parent = tree->nill;
root_ptr          108 opal/class/opal_rb_tree.c     tree->root_ptr->color = BLACK;
root_ptr          178 opal/class/opal_rb_tree.c     tree->root_ptr->left->color = BLACK;
root_ptr          189 opal/class/opal_rb_tree.c     node = tree->root_ptr->left;
root_ptr          211 opal/class/opal_rb_tree.c     node = tree->root_ptr->left;
root_ptr          251 opal/class/opal_rb_tree.c     if (y->parent == tree->root_ptr) {
root_ptr          252 opal/class/opal_rb_tree.c         tree->root_ptr->left = y;
root_ptr          282 opal/class/opal_rb_tree.c     inorder_destroy(tree, tree->root_ptr);
root_ptr          285 opal/class/opal_rb_tree.c     item = (opal_free_list_item_t *) tree->root_ptr;
root_ptr          307 opal/class/opal_rb_tree.c         if(p == tree->root_ptr) {
root_ptr          326 opal/class/opal_rb_tree.c     opal_rb_tree_node_t * parent = tree->root_ptr;
root_ptr          342 opal/class/opal_rb_tree.c     if((parent == tree->root_ptr) || (tree->comp(node->key, parent->key) <= 0)) {
root_ptr          360 opal/class/opal_rb_tree.c     opal_rb_tree_node_t * root = tree->root_ptr->left;
root_ptr          456 opal/class/opal_rb_tree.c     inorder_traversal(tree, cond, action, tree->root_ptr->left);
root_ptr          570 opal/class/opal_rb_tree.c     inorder(tree, tree->root_ptr->left);
root_ptr           75 opal/class/opal_rb_tree.h     opal_rb_tree_node_t * root_ptr; /**< a pointer to the root of the tree */