nill 61 opal/class/opal_interval_tree.c OBJ_CONSTRUCT(&tree->nill, opal_interval_tree_node_t); nill 66 opal/class/opal_interval_tree.c tree->nill.color = OPAL_INTERVAL_TREE_COLOR_BLACK; nill 67 opal/class/opal_interval_tree.c tree->nill.left = tree->nill.right = tree->nill.parent = &tree->nill; nill 68 opal/class/opal_interval_tree.c tree->nill.max = 0; nill 69 opal/class/opal_interval_tree.c tree->nill.data = NULL; nill 73 opal/class/opal_interval_tree.c tree->root.left = tree->root.right = tree->root.parent = &tree->nill; nill 103 opal/class/opal_interval_tree.c OBJ_DESTRUCT(&tree->nill); nill 296 opal/class/opal_interval_tree.c tree->nill.color = OPAL_INTERVAL_TREE_COLOR_BLACK; nill 361 opal/class/opal_interval_tree.c if (node == &tree->nill) { nill 399 opal/class/opal_interval_tree.c if (&tree->nill == node) { nill 465 opal/class/opal_interval_tree.c const opal_interval_tree_node_t *nill = &tree->nill; nill 469 opal/class/opal_interval_tree.c assert (node->left == nill || node->right == nill); nill 473 opal/class/opal_interval_tree.c next = (node->right == nill) ? node->left : node->right; nill 555 opal/class/opal_interval_tree.c if ((node->left == &tree->nill) || (node->right == &tree->nill)) { nill 584 opal/class/opal_interval_tree.c if (p == &tree->nill) { nill 592 opal/class/opal_interval_tree.c return &tree->nill; nill 598 opal/class/opal_interval_tree.c while (p->left != &tree->nill) { nill 612 opal/class/opal_interval_tree.c opal_interval_tree_node_t *nill = &tree->nill; nill 617 opal/class/opal_interval_tree.c node->left = nill; nill 618 opal/class/opal_interval_tree.c node->right = nill; nill 621 opal/class/opal_interval_tree.c while (n != nill) { nill 628 opal/class/opal_interval_tree.c assert (nill == n || n->parent == parent); nill 650 opal/class/opal_interval_tree.c if (node == &tree->nill) { nill 677 opal/class/opal_interval_tree.c if (node == &tree->nill) { nill 684 opal/class/opal_interval_tree.c if (node->left != &tree->nill) { nill 688 opal/class/opal_interval_tree.c if (node->right != &tree->nill) { nill 721 opal/class/opal_interval_tree.c if (y->left != &tree->nill) { nill 757 opal/class/opal_interval_tree.c if (y->right != &tree->nill) { nill 789 opal/class/opal_interval_tree.c if (node == &tree->nill) { nill 804 opal/class/opal_interval_tree.c if (node->left == &tree->nill && node->right == &tree->nill) { nill 819 opal/class/opal_interval_tree.c if (node == &tree->nill) { nill 840 opal/class/opal_interval_tree.c if (OPAL_INTERVAL_TREE_COLOR_BLACK != tree->nill.color) { nill 854 opal/class/opal_interval_tree.c opal_interval_tree_node_t *nill = &tree->nill; nill 860 opal/class/opal_interval_tree.c if (nill == node) { nill 865 opal/class/opal_interval_tree.c if ((uintptr_t) nill == left) { nill 872 opal/class/opal_interval_tree.c if ((uintptr_t) nill == right) { nill 82 opal/class/opal_interval_tree.h opal_interval_tree_node_t nill; /**< the nill sentinal node */ nill 97 opal/class/opal_rb_tree.c tree->nill = (opal_rb_tree_node_t *) node; nill 99 opal/class/opal_rb_tree.c tree->nill->color = BLACK; nill 100 opal/class/opal_rb_tree.c tree->nill->left = tree->nill; nill 101 opal/class/opal_rb_tree.c tree->nill->right = tree->nill; nill 102 opal/class/opal_rb_tree.c tree->nill->parent = tree->nill; nill 105 opal/class/opal_rb_tree.c tree->root_ptr->left = tree->nill; nill 106 opal/class/opal_rb_tree.c tree->root_ptr->right = tree->nill; nill 107 opal/class/opal_rb_tree.c tree->root_ptr->parent = tree->nill; nill 190 opal/class/opal_rb_tree.c while (node != tree->nill) { nill 212 opal/class/opal_rb_tree.c while (node != tree->nill) { nill 237 opal/class/opal_rb_tree.c if ((p->left == tree->nill) || (p->right == tree->nill)) { nill 243 opal/class/opal_rb_tree.c if (todelete->left == tree->nill) { nill 289 opal/class/opal_rb_tree.c item = (opal_free_list_item_t *) tree->nill; nill 301 opal/class/opal_rb_tree.c if (node->right == tree->nill) { nill 308 opal/class/opal_rb_tree.c return tree->nill; nill 314 opal/class/opal_rb_tree.c while(p->left != tree->nill) { nill 332 opal/class/opal_rb_tree.c node->left = tree->nill; nill 333 opal/class/opal_rb_tree.c node->right = tree->nill; nill 336 opal/class/opal_rb_tree.c while (n != tree->nill) { nill 350 opal/class/opal_rb_tree.c node->left = tree->nill; nill 351 opal/class/opal_rb_tree.c node->right = tree->nill; nill 426 opal/class/opal_rb_tree.c if (node == tree->nill) { nill 432 opal/class/opal_rb_tree.c if (node->left != tree->nill) { nill 439 opal/class/opal_rb_tree.c if (node->right != tree->nill) { nill 467 opal/class/opal_rb_tree.c if (node == tree->nill) { nill 489 opal/class/opal_rb_tree.c if (y->left != tree->nill) { nill 520 opal/class/opal_rb_tree.c if(y->right != tree->nill) { nill 554 opal/class/opal_rb_tree.c if (node == tree->nill) { nill 76 opal/class/opal_rb_tree.h opal_rb_tree_node_t * nill; /**< the nill sentinal node */