Searched refs:down (Results 1 - 5 of 5) sorted by relevance

/bind-9.6-ESV-R11/bin/tests/
H A Dname_test.c75 dns_name_t *name, *origin, *comp, *down; local
275 down = name;
278 down = dns_fixedname_name(&downname);
280 result = dns_name_downcase(name, down, NULL);
283 dns_name_toregion(down, &r);
286 dns_name_countlabels(down),
290 print_name(down);
/bind-9.6-ESV-R11/bin/tests/system/
H A Difconfig.sh149 stop|down)
166 ifconfig lo0:$int 0.0.0.0 down
169 ifconfig lo0:$int 10.53.0.$ns down
172 ifconfig lo0:$int 10.53.0.$ns down
176 ifconfig lo0:$int6 inet6 down
181 ifconfig lo:$int 10.53.0.$ns down
232 echo "Usage: $0 { up | down } [base]"
/bind-9.6-ESV-R11/lib/dns/include/dns/
H A Drbt.h80 dns_rbtnode_t *down; member in struct:dns_rbtnode
156 * chain to remain valid, the tree has to be locked down against writes for the
533 * in levels down from it are removed too.
666 * Then the down pointer, left and right pointers are displayed
667 * recursively in turn. NULL down pointers are silently omitted;
871 * Descend down if possible.
/bind-9.6-ESV-R11/lib/dns/
H A Drbtdb.c239 * Otherwise, it points up to the header whose down pointer points
243 struct rdatasetheader *down; member in struct:rdatasetheader
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
[all...]
H A Drbt.c82 #define DOWN(node) ((node)->down)
345 * Go as far right and then down as much as possible,
346 * as long as the rightmost node has a down pointer.
458 * the down pointer to this tree should point
476 * Follow the down pointer (possibly NULL).
493 * to have just the common suffix, and a down
595 * the not-in-common parts down to
862 * down pointer and search in the new tree.
917 * had no down pointer.
1040 * Attempted to follow a down pointe
[all...]

Completed in 37 milliseconds