Searched defs:right (Results 1 - 3 of 3) sorted by relevance
| /bind-9.11.3/lib/dns/include/dns/ |
| H A D | rbt.h | 128 dns_rbtnode_t *right; member in struct:dns_rbtnode
768 * Then the down pointer, left and right pointers are displayed
770 * NULL left and right pointers are printed.
784 * Then the down pointer, left and right pointers are displayed
785 * recursively in turn. NULL left, right and down pointers are
|
| /bind-9.11.3/contrib/dlz/bin/dlzbdb/ |
| H A D | dlzbdb.c | 291 char *right; local
298 tmp = right = malloc(pdata->size + 1);
301 if (right == NULL) {
307 strncpy(right, pdata->data, pdata->size);
308 right[pdata->size] = '\0';
311 left = isc_string_separate(&right, " ");
340 char *right; local
347 tmp = right = malloc(pdata->size + 1);
356 strncpy(right, pdata->data, pdata->size);
357 right[pdat
[all...] |
| /bind-9.11.3/lib/dns/ |
| H A D | rbt.c | 120 * step two: walk the tree in a depth-first, left-right-down order, writing
147 uintptr_t right, uintptr_t down, uintptr_t parent,
177 char *adjusted_address = (char *)(node->right);
204 #define RIGHT(node) ((node)->right)
566 uintptr_t right, uintptr_t down, uintptr_t parent,
606 if (temp_node.right != NULL) {
607 temp_node.right = (dns_rbtnode_t *)(right);
650 uintptr_t left = 0, right = 0, down = 0, data = 0; local
671 * WARNING: A change in the order (from left, right, dow
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...] |
Completed in 19 milliseconds