/netbsd-current/external/mpl/dhcp/dist/keama/ |
H A D | eval.c | 125 * "right": <expression> } 132 struct element *right; local 144 right = mapGet(arg, "right"); 145 if (right == NULL) 152 right = eval_expression(right, &rmodified); 154 mapRemove(arg, "right"); 155 mapSet(arg, right, "right"); 182 struct element *right; local 255 struct element *right; local 323 struct element *right; local 568 struct element *right; local 599 struct element *right; local 784 struct element *right; local 850 struct element *right; local 1639 struct element *right; local 1688 struct element *right; local 1737 struct element *right; local 1786 struct element *right; local 1837 struct element *right; local 1888 struct element *right; local 1937 struct element *right; local 1986 struct element *right; local 2040 eval_equal_expression(struct element *left, struct element *right) argument 2201 cmp_hexa(struct element *left, isc_boolean_t left_is_hexa, struct element *right, isc_boolean_t right_is_hexa) argument [all...] |
H A D | reduce.c | 42 struct element *right); 137 * "right": <expression> } 144 struct element *right; local 156 right = mapGet(arg, "right"); 157 if (right == NULL) { 158 debug("can't get equal right branch"); 161 return reduce_equal_expression(left, right); 169 * "right": <expression> } 176 struct element *right; local 240 struct element *right; local 284 struct element *right; local 667 struct element *right; local 965 reduce_equal_expression(struct element *left, struct element *right) argument [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | typed-splay-tree.h | 66 /* The left and right children, respectively. */ 67 splay_tree_node_s *left, *right; member in struct:typed_splay_tree::splay_tree_node_s 276 deallocated, we just need to process left and right. */ 285 if (active->right) 287 KDEL (active->right->key); 288 VDEL (active->right->value); 289 active->right->back = pending; 290 pending = active->right; 310 tmp = n->right; 311 n->right 508 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | typed-splay-tree.h | 66 /* The left and right children, respectively. */ 67 splay_tree_node_s *left, *right; member in struct:typed_splay_tree::splay_tree_node_s 276 deallocated, we just need to process left and right. */ 285 if (active->right) 287 KDEL (active->right->key); 288 VDEL (active->right->value); 289 active->right->back = pending; 290 pending = active->right; 310 tmp = n->right; 311 n->right 508 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libiberty/ |
H A D | splay-tree.c | 86 deallocated, we just need to process left and right. */ 95 if (active->right) 97 KDEL (active->right->key); 98 VDEL (active->right->value); 99 active->right->key = (splay_tree_key)pending; 100 pending = (splay_tree_node)(active->right); 119 tmp = n->right; 120 n->right = p; 125 /* Rotate the edge joining the right child N with its parent P. PP is the 134 p->right 429 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/libiberty/ |
H A D | splay-tree.c | 86 deallocated, we just need to process left and right. */ 95 if (active->right) 97 KDEL (active->right->key); 98 VDEL (active->right->value); 99 active->right->key = (splay_tree_key)pending; 100 pending = (splay_tree_node)(active->right); 119 tmp = n->right; 120 n->right = p; 125 /* Rotate the edge joining the right child N with its parent P. PP is the 134 p->right 429 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/libiberty/ |
H A D | splay-tree.c | 86 deallocated, we just need to process left and right. */ 95 if (active->right) 97 KDEL (active->right->key); 98 VDEL (active->right->value); 99 active->right->key = (splay_tree_key)pending; 100 pending = (splay_tree_node)(active->right); 119 tmp = n->right; 120 n->right = p; 125 /* Rotate the edge joining the right child N with its parent P. PP is the 134 p->right 429 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gdb/dist/libiberty/ |
H A D | splay-tree.c | 86 deallocated, we just need to process left and right. */ 95 if (active->right) 97 KDEL (active->right->key); 98 VDEL (active->right->value); 99 active->right->key = (splay_tree_key)pending; 100 pending = (splay_tree_node)(active->right); 119 tmp = n->right; 120 n->right = p; 125 /* Rotate the edge joining the right child N with its parent P. PP is the 134 p->right 429 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/binutils.old/dist/libiberty/ |
H A D | splay-tree.c | 86 deallocated, we just need to process left and right. */ 95 if (active->right) 97 KDEL (active->right->key); 98 VDEL (active->right->value); 99 active->right->key = (splay_tree_key)pending; 100 pending = (splay_tree_node)(active->right); 119 tmp = n->right; 120 n->right = p; 125 /* Rotate the edge joining the right child N with its parent P. PP is the 134 p->right 429 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/binutils/dist/libiberty/ |
H A D | splay-tree.c | 86 deallocated, we just need to process left and right. */ 95 if (active->right) 97 KDEL (active->right->key); 98 VDEL (active->right->value); 99 active->right->key = (splay_tree_key)pending; 100 pending = (splay_tree_node)(active->right); 119 tmp = n->right; 120 n->right = p; 125 /* Rotate the edge joining the right child N with its parent P. PP is the 134 p->right 429 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/bfd/ |
H A D | mep-relocs.pl | 104 my ($bits, $left, $right, $ci, $c, $cv); 107 $right = 32; 115 $right = $cv unless $right < $cv; 123 return ($bits, $left, $right, $mask, $rmask); 134 ($bits, $left, $right, $mask) = mask2shifts ($mask); 143 $c, $bytesize, $bits, $left, $right, $pcrel, $overflow, $mask); 180 ($bits, $left, $right, $mask, $rmask) = mask2shifts ($mask); 181 if ($left > $right) { $left -= $right; [all...] |
/netbsd-current/external/gpl3/gdb/dist/bfd/ |
H A D | mep-relocs.pl | 104 my ($bits, $left, $right, $ci, $c, $cv); 107 $right = 32; 115 $right = $cv unless $right < $cv; 123 return ($bits, $left, $right, $mask, $rmask); 134 ($bits, $left, $right, $mask) = mask2shifts ($mask); 143 $c, $bytesize, $bits, $left, $right, $pcrel, $overflow, $mask); 180 ($bits, $left, $right, $mask, $rmask) = mask2shifts ($mask); 181 if ($left > $right) { $left -= $right; [all...] |
/netbsd-current/external/gpl3/binutils.old/dist/bfd/ |
H A D | mep-relocs.pl | 104 my ($bits, $left, $right, $ci, $c, $cv); 107 $right = 32; 115 $right = $cv unless $right < $cv; 123 return ($bits, $left, $right, $mask, $rmask); 134 ($bits, $left, $right, $mask) = mask2shifts ($mask); 143 $c, $bytesize, $bits, $left, $right, $pcrel, $overflow, $mask); 180 ($bits, $left, $right, $mask, $rmask) = mask2shifts ($mask); 181 if ($left > $right) { $left -= $right; [all...] |
/netbsd-current/external/gpl3/binutils/dist/bfd/ |
H A D | mep-relocs.pl | 104 my ($bits, $left, $right, $ci, $c, $cv); 107 $right = 32; 115 $right = $cv unless $right < $cv; 123 return ($bits, $left, $right, $mask, $rmask); 134 ($bits, $left, $right, $mask) = mask2shifts ($mask); 143 $c, $bytesize, $bits, $left, $right, $pcrel, $overflow, $mask); 180 ($bits, $left, $right, $mask, $rmask) = mask2shifts ($mask); 181 if ($left > $right) { $left -= $right; [all...] |
/netbsd-current/crypto/external/bsd/openssl/dist/test/testutil/ |
H A D | tu_local.h | 23 const char *left, const char *right, 28 const char *left, const char *right, 34 const char *left, const char *right, 39 const char *left, const char *right, 44 const char *left, const char *right,
|
/netbsd-current/external/bsd/ipf/dist/ |
H A D | ipf_rb.h | 17 struct _t *right; \ 45 tmp1 = node->_f.right; \ 47 node->_f.right = tmp2; \ 51 head->top._f.right = tmp1; \ 52 else if (parent->_f.right == node) \ 53 parent->_f.right = tmp1; \ 68 tmp2 = tmp1->_f.right; \ 73 head->top._f.right = tmp1; \ 74 else if (parent->_f.right == node) \ 75 parent->_f.right [all...] |
/netbsd-current/sys/external/bsd/ipf/netinet/ |
H A D | ipf_rb.h | 74 struct _t *right; \ 106 tmp1 = node->_f.right; \ 108 node->_f.right = tmp2; \ 112 head->top._f.right = tmp1; \ 113 else if (parent->_f.right == node) \ 114 parent->_f.right = tmp1; \ 129 tmp2 = tmp1->_f.right; \ 134 head->top._f.right = tmp1; \ 135 else if (parent->_f.right == node) \ 136 parent->_f.right [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/util/container/ |
H A D | treap.d | 18 Node* left, right; 90 auto right = height(node.right); 91 return 1 + (left > right ? left : right); 103 return count(node.left) + count(node.right) + 1; 116 node.left = node.right = null; 134 node.right = insert(node.right, element); 135 if (node.right [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/libdruntime/core/internal/container/ |
H A D | treap.d | 17 Node* left, right; 90 auto right = height(node.right); 91 return 1 + (left > right ? left : right); 103 return count(node.left) + count(node.right) + 1; 116 node.left = node.right = null; 134 node.right = insert(node.right, element); 135 if (node.right [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gprof/ |
H A D | sym_ids.c | 48 struct match left, right; 78 the right half of an arc id. It is NOT sorted according 183 parse_spec (slash + 1, &id->right.sym); 204 id->right.sym.file ? id->right.sym.file->name : "*"); 206 if (id->right.sym.name) 207 printf ("%s", id->right.sym.name); 208 else if (id->right.sym.line_num) 209 printf ("%d", id->right.sym.line_num); 279 Sym *sym, *left, *right; 47 struct match left, right; member in struct:sym_id 278 Sym *sym, *left, *right; local [all...] |
/netbsd-current/external/gpl3/binutils.old/dist/gprof/ |
H A D | sym_ids.c | 48 struct match left, right; 78 the right half of an arc id. It is NOT sorted according 183 parse_spec (slash + 1, &id->right.sym); 204 id->right.sym.file ? id->right.sym.file->name : "*"); 206 if (id->right.sym.name) 207 printf ("%s", id->right.sym.name); 208 else if (id->right.sym.line_num) 209 printf ("%d", id->right.sym.line_num); 279 Sym *sym, *left, *right; 47 struct match left, right; member in struct:sym_id 278 Sym *sym, *left, *right; local [all...] |
/netbsd-current/external/gpl3/binutils/dist/gprof/ |
H A D | sym_ids.c | 48 struct match left, right; 78 the right half of an arc id. It is NOT sorted according 183 parse_spec (slash + 1, &id->right.sym); 204 id->right.sym.file ? id->right.sym.file->name : "*"); 206 if (id->right.sym.name) 207 printf ("%s", id->right.sym.name); 208 else if (id->right.sym.line_num) 209 printf ("%d", id->right.sym.line_num); 279 Sym *sym, *left, *right; 47 struct match left, right; member in struct:sym_id 278 Sym *sym, *left, *right; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/libsanitizer/hwasan/ |
H A D | hwasan_malloc_bisect.h | 33 uptr right = flags()->malloc_bisect_right; local 34 if (LIKELY(left == 0 && right == 0)) 41 if (h < left || h > right)
|
/netbsd-current/external/bsd/libbind/dist/isc/ |
H A D | tree.c | 113 RET(tree_srch(&(**ppr_tree).right, 166 if (!tree_trav(&(**ppr_tree).right, pfi_uar)) 176 tree_mung(&(**ppr_tree).right, pfv_uar); 202 (*ppr)->right = NULL; 224 /* right branch WAS longer; bal is ok now */ 240 (*ppr)->left = p1->right; 241 p1->right = *ppr; 247 p2 = p1->right; 248 p1->right = p2->left; 251 (*ppr)->left = p2->right; [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/i386/ |
H A D | x86-64-unwind.s | 1 # First create .eh_frame with the right type.
|