| /netbsd/external/bsd/nsd/dist/ |
| H A D | rbtree.c | 66 rbnode_type *right = node->right; in rbtree_rotate_left() local
67 node->right = right->left; in rbtree_rotate_left()
77 node->parent->right = right; in rbtree_rotate_left()
80 rbtree->root = right; in rbtree_rotate_left()
82 right->left = node; in rbtree_rotate_left()
83 node->parent = right; in rbtree_rotate_left()
109 left->right = node; in rbtree_rotate_right()
204 node = node->right; in rbtree_insert()
269 if(parent->right == old) parent->right = new; in change_parent_ptr()
324 swap_np(&to_delete->right, &smright->right); in rbtree_delete()
[all …]
|
| /netbsd/external/bsd/unbound/dist/util/ |
| H A D | rbtree.c | 110 rbnode_type *right = node->right; in rbtree_rotate_left() local
111 node->right = right->left; in rbtree_rotate_left()
121 node->parent->right = right; in rbtree_rotate_left()
124 rbtree->root = right; in rbtree_rotate_left()
126 right->left = node; in rbtree_rotate_left()
127 node->parent = right; in rbtree_rotate_left()
153 left->right = node; in rbtree_rotate_right()
249 node = node->right; in rbtree_insert()
317 if(parent->right == old) parent->right = new; in change_parent_ptr()
374 swap_np(&to_delete->right, &smright->right); in rbtree_delete()
[all …]
|
| /netbsd/external/mpl/dhcp/dist/keama/ |
| H A D | eval.c | 152 right = eval_expression(right, &rmodified); in eval_boolean_expression()
202 right = eval_expression(right, &rmodified); in eval_boolean_expression()
274 right = eval_boolean_expression(right, &rmodified); in eval_boolean_expression()
342 right = eval_boolean_expression(right, &rmodified); in eval_boolean_expression()
870 right = eval_data_expression(right, &rmodified); in eval_data_expression()
1658 right = eval_numeric_expression(right, &rmodified); in eval_numeric_expression()
1707 right = eval_numeric_expression(right, &rmodified); in eval_numeric_expression()
1756 right = eval_numeric_expression(right, &rmodified); in eval_numeric_expression()
1805 right = eval_numeric_expression(right, &rmodified); in eval_numeric_expression()
1856 right = eval_numeric_expression(right, &rmodified); in eval_numeric_expression()
[all …]
|
| H A D | reduce.c | 261 right = reduce_boolean_expression(right); in reduce_boolean_expression()
262 if ((right == NULL) || (right->type != ELEMENT_STRING)) in reduce_boolean_expression()
305 right = reduce_boolean_expression(right); in reduce_boolean_expression()
306 if ((right == NULL) || (right->type != ELEMENT_STRING)) in reduce_boolean_expression()
688 right = reduce_data_expression(right); in reduce_data_expression()
711 right = reduce_data_expression(right); in reduce_data_expression()
712 if ((right == NULL) || (right->type != ELEMENT_STRING)) in reduce_data_expression()
979 right = reduce_data_expression(right); in reduce_equal_expression()
980 if ((right == NULL) || (right->type != ELEMENT_STRING)) in reduce_equal_expression()
1001 right = reduce_data_expression(right); in reduce_equal_expression()
[all …]
|
| /netbsd/external/gpl3/gcc.old/dist/libgomp/ |
| H A D | splay-tree.c | 48 tmp = n->right; in rotate_left()
49 n->right = p; in rotate_left()
63 p->right = tmp; in rotate_right()
90 c = n->right; in splay_tree_splay()
116 rotate_right (&n->right, c, c->right); in splay_tree_splay()
154 node->right = node->left->right; in splay_tree_insert()
180 right = sp->root->right; in splay_tree_remove()
190 if (right) in splay_tree_remove()
193 left = left->right; in splay_tree_remove()
194 left->right = right; in splay_tree_remove()
[all …]
|
| /netbsd/external/gpl3/gcc/dist/libgomp/ |
| H A D | splay-tree.c | 48 tmp = n->right; in rotate_left()
49 n->right = p; in rotate_left()
63 p->right = tmp; in rotate_right()
90 c = n->right; in splay_tree_splay()
116 rotate_right (&n->right, c, c->right); in splay_tree_splay()
154 node->right = node->left->right; in splay_tree_insert()
180 right = sp->root->right; in splay_tree_remove()
190 if (right) in splay_tree_remove()
193 left = left->right; in splay_tree_remove()
194 left->right = right; in splay_tree_remove()
[all …]
|
| /netbsd/share/misc/ |
| H A D | operator | 5 ->* .* left to right
6 * / % left to right
7 + - left to right
8 << >> left to right
11 & left to right
12 ^ left to right
13 | left to right
14 && left to right
15 || left to right
16 ?: right to left
[all …]
|
| /netbsd/sys/arch/hppa/spmath/ |
| H A D | sfsub.c | 66 right = *rightptr; in sgl_fsub()
79 if (Sgl_isnotnan(right)) in sgl_fsub()
121 Sgl_set_quiet(right); in sgl_fsub()
122 *dstptr = right; in sgl_fsub()
140 Sgl_invert_sign(right); in sgl_fsub()
141 *dstptr = right; in sgl_fsub()
153 Sgl_set_quiet(right); in sgl_fsub()
158 *dstptr = right; in sgl_fsub()
173 Sgl_xorfromintp1(save,right,/*to*/right); in sgl_fsub()
183 if(Sgl_iszero_mantissa(right)) in sgl_fsub()
[all …]
|
| H A D | sfadd.c | 68 right = *rightptr; in sgl_fadd()
81 if (Sgl_isnotnan(right)) in sgl_fadd()
123 Sgl_set_quiet(right); in sgl_fadd()
124 *dstptr = right; in sgl_fadd()
139 if (Sgl_iszero_mantissa(right)) in sgl_fadd()
142 *dstptr = right; in sgl_fadd()
148 if (Sgl_isone_signaling(right)) in sgl_fadd()
154 Sgl_set_quiet(right); in sgl_fadd()
159 *dstptr = right; in sgl_fadd()
174 Sgl_xorfromintp1(save,right,/*to*/right); in sgl_fadd()
[all …]
|
| H A D | sfcmp.c | 57 register unsigned int left, right; in sgl_fcmp() local
62 right = *rightptr; in sgl_fcmp()
67 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) ) in sgl_fcmp()
77 && Sgl_isnotzero_mantissa(right) in sgl_fcmp()
93 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
94 && Sgl_isnotzero_mantissa(right)) ) in sgl_fcmp()
104 Sgl_xortointp1(left,right,xorresult); in sgl_fcmp()
110 && Sgl_iszero_exponentmantissa(right) ) in sgl_fcmp()
125 else if( Sgl_all(left) == Sgl_all(right) ) in sgl_fcmp()
132 if( Sgl_all(left) < Sgl_all(right) ) in sgl_fcmp()
[all …]
|
| /netbsd/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| H A D | rbtree.cc | 55 struct rbt_string_node *right = node->right; in rbt_left_rotate() local
56 assert (right); in rbt_left_rotate()
59 node->right = right->left; in rbt_left_rotate()
64 right->par = node->par; in rbt_left_rotate()
67 t->rbt_root = right; in rbt_left_rotate()
71 node->par->right = right; in rbt_left_rotate()
74 right->left = node; in rbt_left_rotate()
75 node->par = right; in rbt_left_rotate()
101 left->right = node; in rbt_right_rotate()
120 curr = curr->right; in rbt_insert()
[all …]
|
| /netbsd/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | GCNILPSched.cpp | 136 int RHeight = (int)right->getHeight(); in BUCompareLatency()
149 int RDepth = right->getDepth(); in BUCompareLatency()
156 if (left->Latency != right->Latency) in BUCompareLatency()
174 return left->getDepth() < right->getDepth() ? right : left; in pickBest()
182 return left->getHeight() > right->getHeight() ? right : left; in pickBest()
210 unsigned RDist = closestSucc(right); in pickBest()
212 return LDist < RDist ? right : left; in pickBest()
224 return result > 0 ? right : left; in pickBest()
229 return (left->getHeight() > right->getHeight()) ? right : left; in pickBest()
232 return (left->getDepth() < right->getDepth()) ? right : left; in pickBest()
[all …]
|
| /netbsd/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; \
53 parent->_f.right = tmp1; \
68 tmp2 = tmp1->_f.right; \
75 parent->_f.right = tmp1; \
78 tmp1->_f.right = node; \
91 p = &head->top._f.right; \
96 p = &n->_f.right; \
[all …]
|
| /netbsd/external/bsd/wpa/dist/src/crypto/ |
| H A D | des-internal.c | 324 right = block[1]; in desfunc()
327 right ^= work; in desfunc()
331 right ^= work; in desfunc()
336 right ^= (work << 2); in desfunc()
342 right = ROLc(right, 1); in desfunc()
346 right ^= work; in desfunc()
373 right = RORc(right, 1); in desfunc()
376 right ^= work; in desfunc()
379 right ^= work; in desfunc()
383 right ^= work; in desfunc()
[all …]
|
| /netbsd/external/gpl3/gdb/dist/libiberty/ |
| H A D | splay-tree.c | 119 tmp = n->right; in rotate_left()
120 n->right = p; in rotate_left()
134 p->right = tmp; in rotate_right()
161 c = n->right; in splay_tree_splay()
187 rotate_right (&n->right, c, c->right); in splay_tree_splay()
404 node->right = node->left->right; in splay_tree_insert()
432 right = sp->root->right; in splay_tree_remove()
449 if (right) in splay_tree_remove()
453 left->right = right; in splay_tree_remove()
457 sp->root = right; in splay_tree_remove()
[all …]
|
| /netbsd/external/gpl3/binutils.old/dist/libiberty/ |
| H A D | splay-tree.c | 119 tmp = n->right; in rotate_left()
120 n->right = p; in rotate_left()
134 p->right = tmp; in rotate_right()
161 c = n->right; in splay_tree_splay()
187 rotate_right (&n->right, c, c->right); in splay_tree_splay()
404 node->right = node->left->right; in splay_tree_insert()
432 right = sp->root->right; in splay_tree_remove()
449 if (right) in splay_tree_remove()
453 left->right = right; in splay_tree_remove()
457 sp->root = right; in splay_tree_remove()
[all …]
|
| /netbsd/external/gpl3/binutils/dist/libiberty/ |
| H A D | splay-tree.c | 119 tmp = n->right; in rotate_left()
120 n->right = p; in rotate_left()
134 p->right = tmp; in rotate_right()
161 c = n->right; in splay_tree_splay()
187 rotate_right (&n->right, c, c->right); in splay_tree_splay()
404 node->right = node->left->right; in splay_tree_insert()
432 right = sp->root->right; in splay_tree_remove()
449 if (right) in splay_tree_remove()
453 left->right = right; in splay_tree_remove()
457 sp->root = right; in splay_tree_remove()
[all …]
|
| /netbsd/external/gpl3/gcc.old/dist/libiberty/ |
| H A D | splay-tree.c | 119 tmp = n->right; in rotate_left()
120 n->right = p; in rotate_left()
134 p->right = tmp; in rotate_right()
161 c = n->right; in splay_tree_splay()
187 rotate_right (&n->right, c, c->right); in splay_tree_splay()
404 node->right = node->left->right; in splay_tree_insert()
432 right = sp->root->right; in splay_tree_remove()
449 if (right) in splay_tree_remove()
453 left->right = right; in splay_tree_remove()
457 sp->root = right; in splay_tree_remove()
[all …]
|
| /netbsd/external/gpl3/gdb.old/dist/libiberty/ |
| H A D | splay-tree.c | 119 tmp = n->right; in rotate_left()
120 n->right = p; in rotate_left()
134 p->right = tmp; in rotate_right()
161 c = n->right; in splay_tree_splay()
187 rotate_right (&n->right, c, c->right); in splay_tree_splay()
404 node->right = node->left->right; in splay_tree_insert()
432 right = sp->root->right; in splay_tree_remove()
449 if (right) in splay_tree_remove()
453 left->right = right; in splay_tree_remove()
457 sp->root = right; in splay_tree_remove()
[all …]
|
| /netbsd/external/gpl3/gcc/dist/libiberty/ |
| H A D | splay-tree.c | 119 tmp = n->right; in rotate_left()
120 n->right = p; in rotate_left()
134 p->right = tmp; in rotate_right()
161 c = n->right; in splay_tree_splay()
187 rotate_right (&n->right, c, c->right); in splay_tree_splay()
404 node->right = node->left->right; in splay_tree_insert()
432 right = sp->root->right; in splay_tree_remove()
449 if (right) in splay_tree_remove()
453 left->right = right; in splay_tree_remove()
457 sp->root = right; in splay_tree_remove()
[all …]
|
| /netbsd/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; \
114 parent->_f.right = tmp1; \
129 tmp2 = tmp1->_f.right; \
136 parent->_f.right = tmp1; \
139 tmp1->_f.right = node; \
152 p = &head->top._f.right; \
157 p = &n->_f.right; \
215 tmp = parent->_f.right; \
[all …]
|
| /netbsd/external/gpl3/gcc.old/dist/gcc/ |
| H A D | typed-splay-tree.h | 310 tmp = n->right; in rotate_left()
311 n->right = p; in rotate_left()
328 p->right = tmp; in rotate_right()
382 rotate_right (&n->right, c, c->right); in splay_tree_splay()
482 node->right = node->left->right; in splay_tree_insert()
511 right = root->right; in splay_tree_remove()
525 if (right) in splay_tree_remove()
529 left->right = right; in splay_tree_remove()
533 root = right; in splay_tree_remove()
563 while (n->right) in splay_tree_max()
[all …]
|
| /netbsd/external/gpl3/gcc/dist/gcc/ |
| H A D | typed-splay-tree.h | 310 tmp = n->right; in rotate_left()
311 n->right = p; in rotate_left()
328 p->right = tmp; in rotate_right()
382 rotate_right (&n->right, c, c->right); in splay_tree_splay()
482 node->right = node->left->right; in splay_tree_insert()
511 right = root->right; in splay_tree_remove()
525 if (right) in splay_tree_remove()
529 left->right = right; in splay_tree_remove()
533 root = right; in splay_tree_remove()
563 while (n->right) in splay_tree_max()
[all …]
|
| /netbsd/external/bsd/libbind/dist/isc/ |
| H A D | tree.c | 202 (*ppr)->right = NULL; in sprout()
241 p1->right = *ppr; in sprout()
247 p2 = p1->right; in sprout()
252 p2->right = *ppr; in sprout()
293 p1 = (*ppr)->right; in sprout()
305 p2->right = p1; in sprout()
437 p1 = (*ppr_p)->right; in bal_L()
459 p2->right = p1; in bal_L()
501 p1->right = *ppr_p; in bal_R()
515 p2 = p1->right; in bal_R()
[all …]
|
| /netbsd/external/gpl3/binutils/dist/gprof/ |
| H A D | sym_ids.c | 47 struct match left, right; member
203 id->right.sym.file ? id->right.sym.file->name : "*"); in parse_id()
205 if (id->right.sym.name) in parse_id()
206 printf ("%s", id->right.sym.name); in parse_id()
207 else if (id->right.sym.line_num) in parse_id()
278 Sym *sym, *left, *right; in sym_id_parse() local
337 for (right = id->right.first_match; right; right = right->next) in sym_id_parse()
346 right->file ? right->file->name : "*", in sym_id_parse()
347 right->name ? right->name : "*", in sym_id_parse()
348 (unsigned long) right->addr, in sym_id_parse()
[all …]
|