Searched defs:left (Results 1 - 5 of 5) sorted by relevance
/bind-9.11.3/lib/isc/ |
H A D | print.c | 159 int left; local 199 dot = neg = space = plus = left = zero = alt = h = l = q = z = 0; 210 left = 1; 222 if (!left) 500 if (!left) { 552 if (!left) 575 if (left) 579 if (!left) 598 if (!left) 679 if (!left) [all...] |
/bind-9.11.3/lib/lwres/ |
H A D | print.c | 63 int left; local 105 dot = space = plus = left = zero = alt = h = l = q = z = 0; 116 left = 1; 128 if (!left) 332 if (!left) { 389 if (!left) 418 if (left) { 426 if (!left && size > 1U) { 450 if (!left) 546 if (!left) [all...] |
/bind-9.11.3/lib/dns/include/dns/ |
H A D | rbt.h | 127 dns_rbtnode_t *left; 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 | 290 char *left; local 311 left = isc_string_separate(&right, " "); 314 skey->data = strdup(left); 339 char *left; local 359 /* we don't care about left string. */ 360 /* memory of left string will be freed when tmp is freed. */ 363 /* verify right still has some characters left */ 370 left = isc_string_separate(&right, " "); 372 skey->data = strdup(left); 1217 /* left i [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 146 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left, 169 char *adjusted_address = (char *)(node->left); 203 #define LEFT(node) ((node)->left) 565 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left, argument 602 if (temp_node.left != NULL) { 603 temp_node.left = (dns_rbtnode_t *)(left); 650 uintptr_t left = 0, right = 0, down = 0, data = 0; local 671 * WARNING: A change in the order (from left, righ [all...] |
Completed in 26 milliseconds