Lines Matching defs:NULL
210 #define IS_EMPTY(node) ((node)->data == NULL)
251 #define IS_RED(node) ((node) != NULL && (node)->color == RED)
252 #define IS_BLACK(node) ((node) == NULL || (node)->color == BLACK)
315 dns_name_init(&name, NULL);
316 if (node != NULL)
350 * subtree. The passed node must not be NULL.
359 if (node == NULL)
375 fixup_uppernodes_helper(rbt->root, NULL);
380 /* The passed node must not be NULL. */
391 * subtree. The passed node must not be NULL.
400 * the top level, the return value is NULL.
411 while (node != NULL) {
479 result = isc_stdio_write(buffer, 1, HEADER_LENGTH, file, NULL);
539 CHECK(isc_stdio_write(&header, 1, sizeof(file_header_t), file, NULL));
578 INSIST(node != NULL);
593 * If the next node is not NULL, calculate the next node's location
598 if (temp_node.parent != NULL) {
602 if (temp_node.left != NULL) {
606 if (temp_node.right != NULL) {
610 if (temp_node.down != NULL) {
614 if (temp_node.data != NULL) {
623 file, NULL));
624 CHECK(isc_stdio_write(node_data, 1, datasize, file, NULL));
627 dns_name_init(&nodename, NULL);
654 if (node == NULL) {
655 if (where != NULL)
674 CHECK(serialize_nodes(file, getleft(node, NULL), location,
676 CHECK(serialize_nodes(file, getright(node, NULL), location,
678 CHECK(serialize_nodes(file, getdown(node, NULL), location,
681 if (node->data != NULL) {
701 if (where != NULL)
727 REQUIRE(file != NULL);
741 writer_arg, NULL, &crc));
786 if (n == NULL)
793 dns_name_init(&nodename, NULL);
802 CHECK(dns_name_concatenate(&nodename, name, fullname, NULL));
814 CONFIRM(n->left == NULL);
822 CONFIRM(n->right == NULL);
831 CONFIRM(n->down == NULL);
840 CONFIRM(n->parent == NULL);
848 CONFIRM(n->data == NULL);
853 if (n->left != NULL)
856 if (n->right != NULL)
859 if (n->down != NULL)
863 if (datafixer != NULL && n->data != NULL)
896 dns_rbt_t *rbt = NULL;
900 REQUIRE(originp == NULL || *originp == NULL);
901 REQUIRE(rbtp != NULL && *rbtp == NULL);
973 if (originp != NULL)
977 if (result != ISC_R_SUCCESS && rbt != NULL) {
978 rbt->root = NULL;
998 REQUIRE(mctx != NULL);
999 REQUIRE(rbtp != NULL && *rbtp == NULL);
1000 REQUIRE(deleter == NULL ? deleter_arg == NULL : 1);
1003 if (rbt == NULL)
1006 rbt->mctx = NULL;
1010 rbt->root = NULL;
1012 rbt->hashtable = NULL;
1014 rbt->mmap_location = NULL;
1043 REQUIRE(rbtp != NULL && VALID_RBT(*rbtp));
1048 if (rbt->root != NULL)
1053 rbt->mmap_location = NULL;
1055 if (rbt->hashtable != NULL)
1062 *rbtp = NULL;
1090 dns_name_init(&nodename, NULL);
1092 if (include_chain_end && chain->end != NULL) {
1094 result = dns_name_copy(&nodename, name, NULL);
1102 result = dns_name_concatenate(name, &nodename, name, NULL);
1117 while (RIGHT(node) != NULL)
1120 if (DOWN(node) == NULL)
1154 REQUIRE(nodep != NULL && *nodep == NULL);
1174 * right child is NULL). This cannot be determined from the
1195 if (ISC_UNLIKELY(rbt->root == NULL)) {
1201 UPPERNODE(new_current) = NULL;
1219 parent = NULL;
1220 current = NULL;
1276 add_name, NULL);
1279 * Follow the down pointer (possibly NULL).
1283 INSIST(*root == NULL ||
1287 parent = NULL;
1347 if (parent != NULL) {
1353 if (LEFT(new_current) != NULL)
1356 if (RIGHT(new_current) != NULL)
1382 LEFT(current) = NULL;
1383 RIGHT(current) = NULL;
1408 * Its data pointer is already NULL
1421 add_name, NULL);
1430 } while (ISC_LIKELY(child != NULL));
1437 if (*root == NULL)
1462 node = NULL;
1473 (result == ISC_R_EXISTS && DATA(node) == NULL)) {
1502 REQUIRE(node != NULL && *node == NULL);
1511 if (chain == NULL) {
1518 if (ISC_UNLIKELY(rbt->root == NULL))
1526 last_compared = NULL;
1543 dns_name_init(¤t_name, NULL);
1548 while (ISC_LIKELY(current != NULL)) {
1600 dns_name_init(&hash_name, NULL);
1625 hnode != NULL;
1642 dns_name_init(&hnode_name, NULL);
1648 if (hnode != NULL) {
1678 current = NULL;
1710 search_name, NULL);
1715 if (DATA(current) != NULL ||
1739 if (callback != NULL &&
1758 current = NULL;
1777 current = NULL;
1783 * If current is not NULL, NOEXACT is not disallowing exact matches,
1787 if (current != NULL && (options & DNS_RBTFIND_NOEXACT) == 0 &&
1788 (DATA(current) != NULL ||
1796 if (foundname != NULL)
1805 *node = NULL;
1810 if (*node != NULL) {
1828 if (foundname != NULL) {
1846 if (current != NULL) {
1860 DATA(current) == NULL));
1867 chain->end = NULL;
1878 * NULL, which means the searched for name was
1903 * The assignment of current to NULL when
1913 current = NULL;
1915 while (current != NULL) {
1966 if (DOWN(current) != NULL) {
1989 NULL,
1990 NULL);
2007 ENSURE(*node == NULL || DNS_RBTNODE_VALID(*node));
2018 dns_rbtnode_t *node = NULL;
2021 REQUIRE(data != NULL && *data == NULL);
2023 result = dns_rbt_findnode(rbt, name, foundname, &node, NULL,
2024 options, NULL, NULL);
2026 if (node != NULL &&
2027 (DATA(node) != NULL || (options & DNS_RBTFIND_EMPTYDATA) != 0))
2040 dns_rbtnode_t *node = NULL;
2060 result = dns_rbt_findnode(rbt, name, NULL, &node, NULL,
2061 DNS_RBTFIND_NOOPTIONS, NULL, NULL);
2064 if (DATA(node) != NULL)
2120 if (DOWN(node) != NULL) {
2122 PARENT(DOWN(node)) = NULL;
2125 if (DATA(node) != NULL && rbt->data_deleter != NULL)
2127 DATA(node) = NULL;
2145 * top level, parent will be set to NULL.
2153 deletefromlevel(node, parent == NULL ? &rbt->root : &DOWN(parent));
2155 if (DATA(node) != NULL && rbt->data_deleter != NULL)
2176 REQUIRE(name != NULL);
2177 REQUIRE(name->offsets == NULL);
2188 REQUIRE(name != NULL);
2189 REQUIRE(name->buffer != NULL);
2191 dns_name_init(¤t, NULL);
2195 INSIST(node != NULL);
2199 result = dns_name_concatenate(name, ¤t, name, NULL);
2217 REQUIRE(printname != NULL);
2238 REQUIRE(name->offsets != NULL);
2249 if (node == NULL)
2254 PARENT(node) = NULL;
2255 RIGHT(node) = NULL;
2256 LEFT(node) = NULL;
2257 DOWN(node) = NULL;
2258 DATA(node) = NULL;
2268 HASHNEXT(node) = NULL;
2317 REQUIRE(name != NULL);
2335 if (rbt->hashtable == NULL)
2360 if (rbt->hashtable == NULL) {
2367 rbt->hashtable[i] = NULL;
2370 for (node = oldtable[i]; node != NULL; node = nextnode) {
2405 INSIST(HASHNEXT(bucket_node) != NULL);
2418 REQUIRE(rootp != NULL);
2421 INSIST(child != NULL);
2424 if (LEFT(child) != NULL)
2450 REQUIRE(rootp != NULL);
2453 INSIST(child != NULL);
2456 if (RIGHT(child) != NULL)
2489 REQUIRE(rootp != NULL);
2490 REQUIRE(DNS_RBTNODE_VALID(node) && LEFT(node) == NULL &&
2491 RIGHT(node) == NULL);
2492 REQUIRE(current != NULL);
2495 if (root == NULL) {
2516 INSIST(LEFT(current) == NULL);
2519 INSIST(RIGHT(current) == NULL);
2523 INSIST(PARENT(node) == NULL);
2540 if (child != NULL && IS_RED(child)) {
2558 if (child != NULL && IS_RED(child)) {
2593 REQUIRE(item != NULL);
2603 child = NULL;
2605 if (LEFT(item) == NULL) {
2606 if (RIGHT(item) == NULL) {
2611 *rootp = NULL;
2620 } else if (RIGHT(item) == NULL)
2635 while (LEFT(successor) != NULL)
2642 if (RIGHT(successor) != NULL)
2678 if (LEFT(successor) != NULL)
2705 LEFT(item) = NULL;
2719 if (child != NULL)
2739 INSIST(child == NULL || ! IS_ROOT(child));
2751 INSIST(sibling != NULL);
2769 INSIST(RIGHT(sibling) != NULL);
2790 INSIST(sibling != NULL);
2807 INSIST(LEFT(sibling) != NULL);
2829 *nodep = NULL;
2840 while (root != NULL) {
2845 if (LEFT(root) != NULL) {
2848 LEFT(node) = NULL;
2849 } else if (RIGHT(root) != NULL) {
2852 RIGHT(node) = NULL;
2853 } else if (DOWN(root) != NULL) {
2856 DOWN(node) = NULL;
2865 if (DATA(node) != NULL && rbt->data_deleter != NULL)
2891 if (node == NULL)
2910 if (node == NULL)
2923 if ((DOWN(node) != NULL) && (!IS_ROOT(DOWN(node))))
2927 if ((PARENT(node) != NULL) &&
2955 if (node == NULL) {
3058 if (root != NULL) {
3068 if (PARENT(root) != NULL)
3071 fprintf(f, "NULL");
3077 if (root->data != NULL && data_printer != NULL) {
3095 print_text_helper(DOWN(root), NULL, depth, "down",
3098 fprintf(f, "NULL (%s)\n", direction);
3108 print_text_helper(rbt->root, NULL, 0, "root", data_printer, f);
3117 if (node == NULL)
3151 if (LEFT(node) != NULL)
3154 if (DOWN(node) != NULL)
3158 if (RIGHT(node) != NULL)
3183 REQUIRE(chain != NULL);
3189 chain->end = NULL;
3205 if (node != NULL)
3208 if (chain->end == NULL)
3211 if (name != NULL) {
3230 if (origin != NULL) {
3234 result = dns_name_copy(dns_rootname, origin, NULL);
3248 REQUIRE(VALID_CHAIN(chain) && chain->end != NULL);
3250 predecessor = NULL;
3254 if (LEFT(current) != NULL) {
3261 while (RIGHT(current) != NULL)
3284 if (predecessor != NULL) {
3289 if (DOWN(predecessor) != NULL) {
3308 while (RIGHT(predecessor) != NULL)
3310 } while (DOWN(predecessor) != NULL);
3313 if (origin != NULL)
3333 if (origin != NULL &&
3338 if (predecessor != NULL) {
3343 NULL);
3348 result = dns_rbtnodechain_current(chain, name, NULL,
3349 NULL);
3365 REQUIRE(VALID_CHAIN(chain) && chain->end != NULL);
3367 successor = NULL;
3371 if (DOWN(current) != NULL) {
3384 while (LEFT(current) != NULL)
3390 if (successor != NULL) {
3402 if (name != NULL)
3406 if (origin != NULL)
3426 REQUIRE(VALID_CHAIN(chain) && chain->end != NULL);
3428 successor = NULL;
3432 if (RIGHT(current) == NULL) {
3445 while (LEFT(current) != NULL)
3451 if (successor != NULL) {
3454 if (name != NULL)
3472 REQUIRE(VALID_CHAIN(chain) && chain->end != NULL);
3474 successor = NULL;
3482 if (DOWN(current) != NULL) {
3495 while (LEFT(current) != NULL)
3500 } else if (RIGHT(current) == NULL) {
3522 if (successor == NULL) {
3540 INSIST(PARENT(current) == NULL);
3547 if (RIGHT(current) != NULL)
3550 } while (successor == NULL);
3553 if (successor == NULL && RIGHT(current) != NULL) {
3556 while (LEFT(current) != NULL)
3562 if (successor != NULL) {
3580 if (name != NULL)
3584 if (origin != NULL)
3613 result = dns_rbtnodechain_current(chain, name, origin, NULL);
3637 result = dns_rbtnodechain_current(chain, name, origin, NULL);
3655 chain->end = NULL;