| /bind-9.11.3/bin/tests/bigtest/ |
| H A D | buildzones.sh | 34 parent() { function
171 p=$(parent $zone)
178 #echo "zone='${zone}' parent='${p}'"
|
| /bind-9.11.3/lib/dns/include/dns/ |
| H A D | validator.h | 127 dns_validator_t * parent; member in struct:dns_validator
|
| H A D | rbt.h | 126 dns_rbtnode_t *parent; member in struct:dns_rbtnode
192 * node from the root of the tree. Originally nodes did not have parent
194 * the path back to the root from any given node. Now that nodes have parent
205 * In any event, parent information, whether via parent pointers or chains, is
|
| /bind-9.11.3/lib/isc/include/isc/ |
| H A D | radix.h | 100 struct isc_radix_node *parent; /* may be used */ member in struct:isc_radix_node
|
| /bind-9.11.3/lib/isc/ |
| H A D | radix.c | 304 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
337 node->parent = NULL;
417 parent = node->parent;
418 while (parent != NULL && parent->bit >= differ_bit) {
419 node = parent;
420 parent = node->parent;
513 new_node->parent
614 isc_radix_node_t *parent, *child; local
[all...] |
| /bind-9.11.3/unit/atf-src/atf-c/ |
| H A D | utils_test.c | 420 const pid_t parent = atf_utils_fork(); local
421 ATF_REQUIRE(parent != -1);
422 if (parent == 0) {
438 atf_utils_wait(parent, 40,
|
| /bind-9.11.3/unit/atf-src/atf-c++/ |
| H A D | utils_test.cpp | 360 const pid_t parent = atf::utils::fork(); local
361 ATF_REQUIRE(parent != -1);
362 if (parent == 0) {
378 atf::utils::wait(parent, 40,
|
| /bind-9.11.3/unit/atf-src/atf-c/detail/ |
| H A D | tp_main.c | 405 atf_fs_path_t parent; local
407 err = atf_fs_path_branch_path(srcdir, &parent);
412 *srcdir = parent;
|
| /bind-9.11.3/lib/dns/ |
| H A D | master.c | 151 dns_incctx_t *parent; member in struct:dns_incctx
422 dns_incctx_t *parent; local
425 parent = ictx->parent;
426 ictx->parent = NULL;
430 if (parent != NULL) {
431 ictx = parent;
495 ictx->parent = NULL;
1104 if (ictx->parent != NULL) {
1106 lctx->inc = ictx->parent;
[all...] |
| H A D | rpz.c | 118 dns_rpz_cidr_node_t *parent; member in struct:dns_rpz_cidr_node
367 cnode = cnode->parent;
967 * Handle wildcards by putting only the parent into the
1093 dns_rpz_cidr_node_t *cur, *parent, *child, *new_parent, *sibling; local
1103 parent = NULL;
1110 * or add the target as a child of the current parent.
1117 if (parent == NULL)
1120 parent->child[cur_num] = child;
1121 child->parent = parent;
1455 dns_rpz_cidr_node_t *cur, *child, *parent; local
1951 dns_rpz_cidr_node_t *tgt, *parent, *child; local
[all...] |
| H A D | validator.c | 508 eresult == DNS_R_SERVFAIL) /* RFC 1034 parent? */
1025 "covering nsec: for parent");
1036 * XXXMPA We could look for a parent NSEC
1049 * a parent NSEC with the same name. This requires
1098 dns_validator_t *parent; local
1100 for (parent = val; parent != NULL; parent = parent->parent) {
[all...] |
| H A D | rbt.c | 58 * XXXDCL Since parent pointers were added in again, I could remove all of the
147 uintptr_t right, uintptr_t down, uintptr_t parent,
151 serialize_nodes(FILE *file, dns_rbtnode_t *node, uintptr_t parent,
161 char *adjusted_address = (char *)(node->parent);
202 #define PARENT(node) ((node)->parent)
260 * being wholly handled by parent pointers (which didn't exist, because
349 * Upper node is the parent of the root of the passed node's
390 /* Upper node is the parent of the root of the passed node's
566 uintptr_t right, uintptr_t down, uintptr_t parent,
598 if (temp_node.parent !
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
646 serialize_nodes(FILE *file, dns_rbtnode_t *node, uintptr_t parent, dns_rbtdatawriter_t datawriter, void *writer_arg, uintptr_t *where, isc_uint64_t *crc) argument
1141 dns_rbtnode_t **root, *parent, *child, *current, *new_current; local
2114 dns_rbtnode_t *parent; local
2485 dns_rbtnode_t *child, *root, *parent, *grandparent; local
2590 dns_rbtnode_t *child, *sibling, *parent; local
3052 print_text_helper(dns_rbtnode_t *root, dns_rbtnode_t *parent, int depth, const char *direction, void (*data_printer)(FILE *, void *), FILE *f) argument
[all...] |
| H A D | rbtdb.c | 2114 if (node->parent != NULL &&
2115 node->parent->down == node && node->left == NULL &&
2311 * this node may recursively make its parent the only node in
2312 * the parent level; if so, and if no one is currently using
2313 * the parent node, this is almost the only opportunity to
2315 * since the child and parent may be in different lock buckets,
2325 if (!pruning && node->parent != NULL &&
2326 node->parent->down == node && node->left == NULL &&
2402 dns_rbtnode_t *parent; local
2413 parent
[all...] |
| /bind-9.11.3/lib/isc/win32/ |
| H A D | socket.c | 2090 "internal_accept parent %p", sock);
2425 // such an error. Additionally, the "parent" socket must be locked.
2430 restart_accept(isc_socket_t *parent, IoCompletionInfo *lpo) argument
2441 new_fd = socket(parent->pf, SOCK_STREAM, IPPROTO_TCP);
2443 return (ISC_R_FAILURE); // parent will ask windows for error message
2450 ISCAcceptEx(parent->fd,
|