Lines Matching refs:DOWN
82 #define DOWN(node) ((node)->down)
351 if (DOWN(node) == NULL)
355 node = DOWN(node);
478 root = &DOWN(current);
485 child = DOWN(current);
574 DOWN(new_current) = current;
575 root = &DOWN(new_current);
927 current = DOWN(current);
1129 if (DOWN(current) != NULL) {
1134 DOWN(current));
1282 if (DOWN(node) != NULL) {
1284 RUNTIME_CHECK(dns_rbt_deletetree(rbt, DOWN(node))
1316 &DOWN(parent));
1339 * DOWN(parent) == NULL. This case can only exist if the parent was
1346 * LEFT(DOWN(parent)) == NULL && RIGHT(DOWN(parent)) == NULL.
1442 DOWN(node) = NULL;
2008 * + deleting everything DOWN from a node that is itself being deleted, and
2037 if (DOWN(node) != NULL) {
2038 result = dns_rbt_deletetree(rbt, DOWN(node));
2041 DOWN(node) = NULL;
2079 if (DOWN(node) != NULL) {
2080 node = DOWN(node);
2100 else if (DOWN(parent) == node)
2101 DOWN(parent) = RIGHT(node);
2155 DOWN(PARENT(root)) != root)) {
2170 if (DOWN(root)) {
2175 dns_rbt_printtree(DOWN(root), NULL, depth);
2314 if (DOWN(predecessor) != NULL) {
2328 predecessor = DOWN(predecessor);
2335 } while (DOWN(predecessor) != NULL);
2396 if (DOWN(current) != NULL) {
2407 current = DOWN(current);
2507 if (DOWN(current) != NULL) {
2518 current = DOWN(current);