Searched defs:down (Results 1 - 4 of 4) sorted by relevance

/bind-9.11.3/bin/tests/
H A Dname_test.c67 dns_name_t *name, *origin, *comp, *down; local
266 down = name;
269 down = dns_fixedname_name(&downname);
271 result = dns_name_downcase(name, down, NULL);
274 dns_name_toregion(down, &r);
277 dns_name_countlabels(down),
281 print_name(down);
/bind-9.11.3/lib/dns/include/dns/
H A Drbt.h129 dns_rbtnode_t *down; member in struct:dns_rbtnode
209 * chain to remain valid, the tree has to be locked down against writes for the
586 * in levels down from it are removed too.
768 * Then the down pointer, left and right pointers are displayed
769 * recursively in turn. NULL down pointers are silently omitted;
784 * Then the down pointer, left and right pointers are displayed
785 * recursively in turn. NULL left, right and down pointers are
1039 * Descend down if possible.
/bind-9.11.3/lib/dns/
H A Drbt.c120 * step two: walk the tree in a depth-first, left-right-down order, writing
147 uintptr_t right, uintptr_t down, uintptr_t parent,
185 char *adjusted_address = (char *)(node->down);
205 #define DOWN(node) ((node)->down)
566 uintptr_t right, uintptr_t down, uintptr_t parent,
610 if (temp_node.down != NULL) {
611 temp_node.down = (dns_rbtnode_t *)(down);
650 uintptr_t left = 0, right = 0, down = 0, data = 0; local
671 * WARNING: A change in the order (from left, right, down)
565 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left, uintptr_t right, uintptr_t down, uintptr_t parent, uintptr_t data, isc_uint64_t *crc) argument
[all...]
H A Drbtdb.c450 * Otherwise, it points up to the header whose down pointer points
454 struct rdatasetheader *down; member in struct:rdatasetheader
1764 for (dcurrent = header->down;
1766 dcurrent = dcurrent->down) {
1804 for (d = top->down; d != NULL; d = down_next) {
1805 down_next = d->down;
1808 top->down = NULL;
1864 for (dcurrent = current->down;
1867 down_next = dcurrent->down;
1873 dparent->down
[all...]

Completed in 42 milliseconds