| /dragonfly/contrib/ldns/ |
| HD | rbtree.c | 118 ldns_rbnode_t *right = node->right; in ldns_rbtree_rotate_left() local
119 node->right = right->left; in ldns_rbtree_rotate_left()
120 if (right->left != LDNS_RBTREE_NULL) in ldns_rbtree_rotate_left()
121 right->left->parent = node; in ldns_rbtree_rotate_left()
123 right->parent = node->parent; in ldns_rbtree_rotate_left()
127 node->parent->left = right; in ldns_rbtree_rotate_left()
129 node->parent->right = right; in ldns_rbtree_rotate_left()
132 rbtree->root = right; in ldns_rbtree_rotate_left()
134 right->left = node; in ldns_rbtree_rotate_left()
135 node->parent = right; in ldns_rbtree_rotate_left()
[all …]
|
| /dragonfly/contrib/gcc-8.0/libgomp/ |
| HD | 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()
99 || (cmp2 > 0 && !c->right)) in splay_tree_splay()
116 rotate_right (&n->right, c, c->right); in splay_tree_splay()
117 rotate_right (&sp->root, n, n->right); in splay_tree_splay()
121 rotate_right (&n->left, c, c->right); in splay_tree_splay()
126 rotate_left (&n->right, c, c->left); in splay_tree_splay()
127 rotate_right (&sp->root, n, n->right); in splay_tree_splay()
[all …]
|
| /dragonfly/share/misc/ |
| HD | operator | 3 () [] -> . left to right
4 ! ~ ++ -- - (type) * & sizeof right to left
5 * / % left to right
6 + - left to right
7 << >> left to right
8 < <= > >= left to right
9 == != left to right
10 & left to right
11 ^ left to right
12 | left to right
[all …]
|
| /dragonfly/contrib/binutils-2.27/libiberty/ |
| HD | splay-tree.c | 93 if (active->right) in splay_tree_delete_helper()
95 KDEL (active->right->key); in splay_tree_delete_helper()
96 VDEL (active->right->value); in splay_tree_delete_helper()
97 active->right->key = (splay_tree_key)pending; in splay_tree_delete_helper()
98 pending = (splay_tree_node)(active->right); in splay_tree_delete_helper()
117 tmp = n->right; in rotate_left()
118 n->right = p; in rotate_left()
132 p->right = tmp; in rotate_right()
159 c = n->right; in splay_tree_splay()
168 || (cmp2 > 0 && !c->right)) in splay_tree_splay()
[all …]
|
| HD | fibheap.c | 70 node->right = node; in fibnode_new()
161 a_root->left->right = b_root; in fibheap_union()
162 b_root->left->right = a_root; in fibheap_union()
302 y = x->right; in fibheap_extr_min_node()
318 heap->min = ret->right; in fibheap_extr_min_node()
335 node->right = node; in fibheap_ins_root()
449 if (a == a->right) in fibnode_insert_after()
451 a->right = b; in fibnode_insert_after()
453 b->right = a; in fibnode_insert_after()
458 b->right = a->right; in fibnode_insert_after()
[all …]
|
| /dragonfly/contrib/gdb-7/libiberty/ |
| HD | splay-tree.c | 93 if (active->right) in splay_tree_delete_helper()
95 KDEL (active->right->key); in splay_tree_delete_helper()
96 VDEL (active->right->value); in splay_tree_delete_helper()
97 active->right->key = (splay_tree_key)pending; in splay_tree_delete_helper()
98 pending = (splay_tree_node)(active->right); in splay_tree_delete_helper()
117 tmp = n->right; in rotate_left()
118 n->right = p; in rotate_left()
132 p->right = tmp; in rotate_right()
159 c = n->right; in splay_tree_splay()
168 || (cmp2 > 0 && !c->right)) in splay_tree_splay()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libiberty/ |
| HD | splay-tree.c | 93 if (active->right) in splay_tree_delete_helper()
95 KDEL (active->right->key); in splay_tree_delete_helper()
96 VDEL (active->right->value); in splay_tree_delete_helper()
97 active->right->key = (splay_tree_key)pending; in splay_tree_delete_helper()
98 pending = (splay_tree_node)(active->right); in splay_tree_delete_helper()
117 tmp = n->right; in rotate_left()
118 n->right = p; in rotate_left()
132 p->right = tmp; in rotate_right()
159 c = n->right; in splay_tree_splay()
168 || (cmp2 > 0 && !c->right)) in splay_tree_splay()
[all …]
|
| HD | fibheap.c | 70 node->right = node; in fibnode_new()
161 a_root->left->right = b_root; in fibheap_union()
162 b_root->left->right = a_root; in fibheap_union()
302 y = x->right; in fibheap_extr_min_node()
318 heap->min = ret->right; in fibheap_extr_min_node()
335 node->right = node; in fibheap_ins_root()
449 if (a == a->right) in fibnode_insert_after()
451 a->right = b; in fibnode_insert_after()
453 b->right = a; in fibnode_insert_after()
458 b->right = a->right; in fibnode_insert_after()
[all …]
|
| /dragonfly/contrib/gcc-8.0/libiberty/ |
| HD | splay-tree.c | 92 if (active->right) in splay_tree_delete_helper()
94 KDEL (active->right->key); in splay_tree_delete_helper()
95 VDEL (active->right->value); in splay_tree_delete_helper()
96 active->right->key = (splay_tree_key)pending; in splay_tree_delete_helper()
97 pending = (splay_tree_node)(active->right); in splay_tree_delete_helper()
116 tmp = n->right; in rotate_left()
117 n->right = p; in rotate_left()
131 p->right = tmp; in rotate_right()
158 c = n->right; in splay_tree_splay()
167 || (cmp2 > 0 && !c->right)) in splay_tree_splay()
[all …]
|
| HD | fibheap.c | 70 node->right = node; in fibnode_new()
161 a_root->left->right = b_root; in fibheap_union()
162 b_root->left->right = a_root; in fibheap_union()
302 y = x->right; in fibheap_extr_min_node()
318 heap->min = ret->right; in fibheap_extr_min_node()
335 node->right = node; in fibheap_ins_root()
449 if (a == a->right) in fibnode_insert_after()
451 a->right = b; in fibnode_insert_after()
453 b->right = a; in fibnode_insert_after()
458 b->right = a->right; in fibnode_insert_after()
[all …]
|
| /dragonfly/contrib/wpa_supplicant/src/crypto/ |
| HD | des-internal.c | 320 u32 work, right, leftt; in desfunc() local
324 right = block[1]; in desfunc()
326 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL; in desfunc()
327 right ^= work; in desfunc()
330 work = ((leftt >> 16) ^ right) & 0x0000ffffL; in desfunc()
331 right ^= work; in desfunc()
334 work = ((right >> 2) ^ leftt) & 0x33333333L; in desfunc()
336 right ^= (work << 2); in desfunc()
338 work = ((right >> 8) ^ leftt) & 0x00ff00ffL; in desfunc()
340 right ^= (work << 8); in desfunc()
[all …]
|
| /dragonfly/contrib/binutils-2.34/libiberty/ |
| HD | splay-tree.c | 95 if (active->right) in splay_tree_delete_helper()
97 KDEL (active->right->key); in splay_tree_delete_helper()
98 VDEL (active->right->value); in splay_tree_delete_helper()
99 active->right->key = (splay_tree_key)pending; in splay_tree_delete_helper()
100 pending = (splay_tree_node)(active->right); in splay_tree_delete_helper()
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()
170 || (cmp2 > 0 && !c->right)) in splay_tree_splay()
[all …]
|
| HD | fibheap.c | 70 node->right = node; in fibnode_new()
161 a_root->left->right = b_root; in fibheap_union()
162 b_root->left->right = a_root; in fibheap_union()
302 y = x->right; in fibheap_extr_min_node()
318 heap->min = ret->right; in fibheap_extr_min_node()
335 node->right = node; in fibheap_ins_root()
449 if (a == a->right) in fibnode_insert_after()
451 a->right = b; in fibnode_insert_after()
453 b->right = a; in fibnode_insert_after()
458 b->right = a->right; in fibnode_insert_after()
[all …]
|
| /dragonfly/sys/dev/sound/pci/ |
| HD | spicds.c | 50 unsigned int left, right; member
271 spicds_set(struct spicds_info *codec, int dir, unsigned int left, unsigned int right) in spicds_set() argument
274 device_printf(codec->dev, "spicds_set(codec, %d, %d, %d)\n", dir, left, right); in spicds_set()
295 if (right >= 100) in spicds_set()
298 right = 255; in spicds_set()
300 right = 127; in spicds_set()
304 right = right + 27; in spicds_set()
308 right = right * 255 / 100; in spicds_set()
311 right = right * 127 / 100; in spicds_set()
315 device_printf(codec->dev, "spicds_set(): AK4524(REC) %d/%d\n", left, right); in spicds_set()
[all …]
|
| /dragonfly/contrib/binutils-2.27/gprof/ |
| HD | sym_ids.c | 47 struct match left, right; member
182 parse_spec (slash + 1, &id->right.sym); in parse_id()
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()
208 printf ("%d", id->right.sym.line_num); in parse_id()
278 Sym *sym, *left, *right; in sym_id_parse() local
294 if (id->has_right && match (&id->right.sym, sym)) in sym_id_parse()
295 extend_match (&id->right, sym, &right_ids, FALSE); in sym_id_parse()
[all …]
|
| /dragonfly/contrib/binutils-2.34/gprof/ |
| HD | sym_ids.c | 47 struct match left, right; member
182 parse_spec (slash + 1, &id->right.sym); in parse_id()
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()
208 printf ("%d", id->right.sym.line_num); in parse_id()
278 Sym *sym, *left, *right; in sym_id_parse() local
294 if (id->has_right && match (&id->right.sym, sym)) in sym_id_parse()
295 extend_match (&id->right, sym, &right_ids, FALSE); in sym_id_parse()
[all …]
|
| /dragonfly/contrib/binutils-2.34/gas/ |
| HD | expr.c | 1758 expressionS right; in expr() local
1785 right.X_md = 0; in expr()
1786 rightseg = expr (op_rank[(int) op_left], &right, mode); in expr()
1787 if (right.X_op == O_absent) in expr()
1790 right.X_op = O_constant; in expr()
1791 right.X_add_number = 0; in expr()
1792 right.X_add_symbol = NULL; in expr()
1793 right.X_op_symbol = NULL; in expr()
1836 if (right.X_op == O_big) in expr()
1838 if (right.X_add_number > 0) in expr()
[all …]
|
| /dragonfly/sys/netgraph7/tee/ |
| HD | ng_tee.c | 76 struct hookinfo right; member
176 hinfo = &privdata->right; in ng_tee_newhook()
183 if (privdata->right.dest) in ng_tee_newhook()
184 privdata->right.dup = privdata->right.dest; in ng_tee_newhook()
185 privdata->right.dest = hinfo; in ng_tee_newhook()
189 if (privdata->right.dest) in ng_tee_newhook()
190 privdata->right.dup = hinfo; in ng_tee_newhook()
192 privdata->right.dest = hinfo; in ng_tee_newhook()
236 bcopy(&sc->right.stats, &stats->right, in ng_tee_rcvmsg()
237 sizeof(stats->right)); in ng_tee_rcvmsg()
[all …]
|
| /dragonfly/contrib/binutils-2.27/gas/ |
| HD | expr.c | 1762 expressionS right; in expr() local
1789 right.X_md = 0; in expr()
1790 rightseg = expr (op_rank[(int) op_left], &right, mode); in expr()
1791 if (right.X_op == O_absent) in expr()
1794 right.X_op = O_constant; in expr()
1795 right.X_add_number = 0; in expr()
1796 right.X_add_symbol = NULL; in expr()
1797 right.X_op_symbol = NULL; in expr()
1840 if (right.X_op == O_big) in expr()
1842 if (right.X_add_number > 0) in expr()
[all …]
|
| /dragonfly/sys/netgraph/tee/ |
| HD | ng_tee.c | 73 struct hookinfo right; member
178 sc->right.hook = hook; in ngt_newhook()
179 bzero(&sc->right.stats, sizeof(sc->right.stats)); in ngt_newhook()
180 hook->private = &sc->right; in ngt_newhook()
226 bcopy(&sc->right.stats, &stats->right, in ngt_rcvmsg()
227 sizeof(stats->right)); in ngt_rcvmsg()
236 bzero(&sc->right.stats, in ngt_rcvmsg()
237 sizeof(sc->right.stats)); in ngt_rcvmsg()
288 dest = &sc->right; in ngt_rcvdata()
289 } else if (hinfo == &sc->right) { in ngt_rcvdata()
[all …]
|
| /dragonfly/games/arithmetic/ |
| HD | arithmetic.c | 184 int left, op, right, result; in problem() local
188 right = 0; in problem()
192 right = getrandom(rangemax + 1, op, 1); in problem()
198 result = left + right; in problem()
202 left = right + result; in problem()
206 result = left * right; in problem()
209 right = getrandom(rangemax, op, 1) + 1; in problem()
211 left = right * result + random() % right; in problem()
222 printf("%d %c %d = ", left, op, right); in problem()
248 penalise(right, op, 1); in problem()
|
| /dragonfly/contrib/binutils-2.27/gold/ |
| HD | expression.cc | 371 Binary_expression(Expression* left, Expression* right) in Binary_expression() argument
372 : left_(left), right_(right) in Binary_expression()
458 Binary_ ## NAME(Expression* left, Expression* right) \
459 : Binary_expression(left, right) \
471 uint64_t right = this->right_value(eei, &right_section, \
496 if (IS_DIV && right == 0) \
501 return left OPERATOR right; \
516 script_exp_binary_ ## NAME(Expression* left, Expression* right) \
518 return new Binary_ ## NAME(left, right); \
676 Max_expression(Expression* left, Expression* right) in Max_expression() argument
[all …]
|
| /dragonfly/contrib/binutils-2.34/gold/ |
| HD | expression.cc | 383 Binary_expression(Expression* left, Expression* right) in Binary_expression() argument
384 : left_(left), right_(right) in Binary_expression()
477 Binary_ ## NAME(Expression* left, Expression* right) \
478 : Binary_expression(left, right) \
490 uint64_t right = this->right_value(eei, &right_section, \
515 if (IS_DIV && right == 0) \
520 return left OPERATOR right; \
535 script_exp_binary_ ## NAME(Expression* left, Expression* right) \
537 return new Binary_ ## NAME(left, right); \
703 Max_expression(Expression* left, Expression* right) in Max_expression() argument
[all …]
|
| /dragonfly/contrib/tre/lib/ |
| HD | tre-ast.c | 73 tre_ast_new_union(tre_mem_t mem, tre_ast_node_t *left, tre_ast_node_t *right) in tre_ast_new_union() argument
81 ((tre_union_t *)node->obj)->right = right; in tre_ast_new_union()
82 node->num_submatches = left->num_submatches + right->num_submatches; in tre_ast_new_union()
89 tre_ast_node_t *right) in tre_ast_new_catenation() argument
97 ((tre_catenation_t *)node->obj)->right = right; in tre_ast_new_catenation()
98 node->num_submatches = left->num_submatches + right->num_submatches; in tre_ast_new_catenation()
197 tre_do_print(stream, ((tre_union_t *)ast->obj)->right, indent + 2); in tre_do_print()
203 tre_do_print(stream, ((tre_catenation_t *)ast->obj)->right, indent + 2); in tre_do_print()
|
| /dragonfly/contrib/xz/src/liblzma/common/ |
| HD | index.c | 41 index_tree_node *right; member
202 if (node->right != NULL) in index_tree_node_end()
203 index_tree_node_end(node->right, allocator, free_func); in index_tree_node_end()
234 node->right = NULL; in index_tree_append()
252 tree->rightmost->right = node; in index_tree_append()
269 index_tree_node *pivot = node->right; in index_tree_append()
274 assert(node->parent->right == node); in index_tree_append()
275 node->parent->right = pivot; in index_tree_append()
280 node->right = pivot->left; in index_tree_append()
281 if (node->right != NULL) in index_tree_append()
[all …]
|