Lines Matching defs:down
239 * Otherwise, it points up to the header whose down pointer points
243 struct rdatasetheader *down;
1322 for (dcurrent = header->down;
1324 dcurrent = dcurrent->down) {
1340 for (d = top->down; d != NULL; d = down_next) {
1341 down_next = d->down;
1344 top->down = NULL;
1400 for (dcurrent = current->down;
1403 down_next = dcurrent->down;
1409 dparent->down = down_next;
1420 down_next = current->down;
1434 * Pull up current->down, making it the new
1448 * We now try to find the first down node less than the
1452 for (dcurrent = current->down;
1455 down_next = dcurrent->down;
1467 down_next = dcurrent->down;
1472 dparent->down = NULL;
1481 if (current->down != NULL) {
1642 ((n)->data != NULL || (n)->down != NULL || (n) == (r)->origin_node)
1741 node->parent->down == node && node->left == NULL &&
1862 if (parent != NULL && parent->down == NULL) {
1864 * node was the only down child of the parent and has
2044 header = header->down;
2610 header = header->down;
3329 header = header->down;
3500 * Search down from the root of the tree. If, while going down, we
3631 header = header->down;
4023 * header->down can be non-NULL if the
4421 * Search down from the root of the tree. If, while going down, we
4761 * Search down from the root of the tree.
4995 force_expire = ISC_TF(rbtnode->down == NULL && val % 4 == 0);
5099 current = current->down;
5199 header = header->down;
5420 header = header->down;
5450 header = header->down;
5634 header = header->down;
5810 newheader->down = NULL;
5813 newheader->down = topheader;
5874 newheader->down = topheader;
5884 newheader->down = NULL;
6269 header = header->down;
6344 newheader->down = topheader;
7650 header = header->down;
7704 * If not walking back up the down list.
7726 header = header->down;
8224 if (expire_result == ISC_R_SUCCESS && node->down == NULL) {