Home
last modified time | relevance | path

Searched refs:right (Results 1 – 25 of 1453) sorted by relevance

12345678910>>...59

/openbsd/regress/usr.bin/mandoc/tbl/layout/
H A Dlines.out_ascii224 vline right below hline top right:
335 vline right above hline bottom right:
364 double vline right below hline top right:
901 vline right below hline top right:
1054 vline right above hline bottom right:
1813 vline right below hline top right:
2035 vline right above hline bottom right:
2888 vline right below hline top right:
3083 vline right above hline bottom right:
4042 vline right below hline top right:
[all …]
/openbsd/usr.sbin/nsd/
H A Drbtree.c66 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 …]
H A Ddname.c301 dname_label(right, i)) != 0) in dname_is_subdomain()
317 assert(right); in dname_compare()
319 if (left == right) { in dname_compare()
325 : right->label_count); in dname_compare()
330 dname_label(right, i)); in dname_compare()
352 assert(right); in label_compare()
355 assert(label_is_normal(right)); in label_compare()
378 assert(right); in dname_label_match_count()
382 dname_label(right, i)) != 0) in dname_label_match_count()
466 const dname_type *right) in dname_concatenate() argument
[all …]
/openbsd/sbin/unwind/libunbound/util/
H A Drbtree.c110 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 …]
/openbsd/usr.sbin/unbound/util/
H A Drbtree.c110 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 …]
/openbsd/gnu/usr.bin/perl/cpan/CPAN-Meta/lib/CPAN/Meta/
H A DMerge.pm13 my ($left, $right) = @_;
17 || (defined $left and defined $right and $left eq $right);
21 my ($left, $right, $path) = @_;
52 my ($left, $right) = @_;
57 my ($left, $right, $path) = @_;
58 for my $key (keys %{$right}) {
77 my ($left, $right, $path) = @_;
96 for my $key (keys %{$right}) {
127 my ($left, $right) = @_;
128 return $left || $right;
[all …]
/openbsd/sys/arch/hppa/spmath/
H A Dsfsub.c37 right = *rightptr;
50 if (Sgl_isnotnan(right))
92 Sgl_set_quiet(right);
93 *dstptr = right;
111 Sgl_invert_sign(right);
112 *dstptr = right;
124 Sgl_set_quiet(right);
129 *dstptr = right;
144 Sgl_xorfromintp1(save,right,/*to*/right);
154 if(Sgl_iszero_mantissa(right))
[all …]
H A Dsfadd.c39 right = *rightptr;
52 if (Sgl_isnotnan(right))
94 Sgl_set_quiet(right);
95 *dstptr = right;
110 if (Sgl_iszero_mantissa(right))
113 *dstptr = right;
119 if (Sgl_isone_signaling(right))
125 Sgl_set_quiet(right);
130 *dstptr = right;
145 Sgl_xorfromintp1(save,right,/*to*/right);
[all …]
H A Dsfcmp.c29 register unsigned int left, right; local
34 right = *rightptr;
39 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) )
49 && Sgl_isnotzero_mantissa(right)
65 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
66 && Sgl_isnotzero_mantissa(right)) )
76 Sgl_xortointp1(left,right,xorresult);
82 && Sgl_iszero_exponentmantissa(right) )
97 else if( Sgl_all(left) == Sgl_all(right) )
104 if( Sgl_all(left) < Sgl_all(right) )
[all …]
H A Dhppa.h18 #define Shiftdouble(left,right,amount,dest) \ argument
20 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount))
23 #define Variableshiftdouble(left,right,amount,dest) \ argument
25 if (amount == 0) dest = right; \
27 ((unsigned) right >> (amount))
30 #define Variable_shift_double(left,right,amount,dest) \ argument
32 dest = (left << (32-(amount))) | ((unsigned) right >> (amount))
/openbsd/gnu/usr.sbin/mkhybrid/src/libhfs_iso/
H A Dnode.c202 node right; in n_split() local
206 right = *left; in n_split()
209 if (n_new(&right) < 0) in n_split()
225 if (right.rnum < mid) in n_split()
270 n_compact(&right); in n_split()
273 if (right.rnum >= 0) in n_split()
289 n_index(right.bt, HFS_NODEREC(right, 0), right.nnum, record, reclen); in n_split()
299 if (right.nd.ndFLink) in n_split()
376 right->roff[right->nd.ndNRecs] - right->roff[0]); in n_merge()
390 if (right->bt->hdr.bthLNode == right->nnum) in n_merge()
[all …]
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp136 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 …]
/openbsd/gnu/lib/libiberty/src/
H A Dsplay-tree.c116 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()
184 rotate_right (&n->right, c, c->right); in splay_tree_splay()
328 node->right = node->left->right; in splay_tree_insert()
356 right = sp->root->right; in splay_tree_remove()
371 if (right) in splay_tree_remove()
375 left->right = right; in splay_tree_remove()
379 sp->root = right; in splay_tree_remove()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/
H A Det-forest.c97 while (occ->right)
98 occ = occ->right;
348 if (first->right)
357 if (last->right)
358 last->right->parent = 0;
373 prev_node->right = next_node->right;
397 if (node->right)
511 new_occ->right = parent_occ->right;
519 if (new_occ->right)
566 parent_pre_occ->right = parent_post_occ->right;
[all …]
/openbsd/regress/sbin/iked/live/
H A DMakefile171 side=right; \
224 right.key ca-left.crt right-from-ca-left.crt ca-right.crt left-from-ca-right.crt \
273 right-from-ca-both.crt: ca-both.crt ca-both.key right.key
279 right-from-ca-left.crt right.key: ca-left.crt ca-left.key
282 ca-right.crt ca-right.key:
285 left-from-ca-right.crt left.key: ca-right.crt ca-right.key
294 right-from-ca-none.crt right.key: ca-none.crt ca-none.key
304 right-from-intermediate-from-ca-none.crt right.key: \
373 side=right; \
396 side=right; \
[all …]
/openbsd/gnu/usr.bin/binutils/gprof/
H A Dsym_ids.c45 left, right; member
205 id->right.sym.file ? id->right.sym.file->name : "*");
207 if (id->right.sym.name)
208 printf ("%s", id->right.sym.name);
209 else if (id->right.sym.line_num)
279 Sym *sym, *left, *right; in sym_id_parse() local
338 for (right = id->right.first_match; right; right = right->next) in sym_id_parse()
347 right->file ? right->file->name : "*", in sym_id_parse()
348 right->name ? right->name : "*", in sym_id_parse()
349 (unsigned long) right->addr, in sym_id_parse()
[all …]
/openbsd/gnu/usr.bin/binutils-2.17/gprof/
H A Dsym_ids.c45 left, right; member
200 id->right.sym.file ? id->right.sym.file->name : "*"); in parse_id()
202 if (id->right.sym.name) in parse_id()
203 printf ("%s", id->right.sym.name); in parse_id()
204 else if (id->right.sym.line_num) in parse_id()
268 Sym *sym, *left, *right; in sym_id_parse() local
327 for (right = id->right.first_match; right; right = right->next) in sym_id_parse()
336 right->file ? right->file->name : "*", in sym_id_parse()
337 right->name ? right->name : "*", in sym_id_parse()
338 (unsigned long) right->addr, in sym_id_parse()
[all …]
/openbsd/gnu/usr.bin/perl/cpan/Encode/ucm/
H A DmacHebrew.ucm44 <U0020> \xA0 |0 # SPACE, right-left
47 <U0023> \xA3 |0 # NUMBER SIGN, right-left
48 <U0024> \xA4 |0 # DOLLAR SIGN, right-left
51 <U0027> \xA7 |0 # APOSTROPHE, right-left
54 <U002A> \xAA |0 # ASTERISK, right-left
55 <U002B> \xAB |0 # PLUS SIGN, right-left
56 <U002C> \xAC |0 # COMMA, right-left
58 <U002E> \xAE |0 # FULL STOP, right-left
59 <U002F> \xAF |0 # SOLIDUS, right-left
70 <U003A> \xBA |0 # COLON, right-left
[all …]
H A DmacArabic.ucm44 <U0020> \xA0 |0 # SPACE, right-left
47 <U0023> \xA3 |0 # NUMBER SIGN, right-left
50 <U0026> \xA6 |0 # AMPERSAND, right-left
51 <U0027> \xA7 |0 # APOSTROPHE, right-left
54 <U002A> \xAA |0 # ASTERISK, right-left
55 <U002B> \xAB |0 # PLUS SIGN, right-left
58 <U002E> \xAE |0 # FULL STOP, right-left
59 <U002F> \xAF |0 # SOLIDUS, right-left
70 <U003A> \xBA |0 # COLON, right-left
71 <U003B> \x3B |0 # SEMICOLON, left-right
[all …]
H A DmacFarsi.ucm44 <U0020> \xA0 |0 # SPACE, right-left
47 <U0023> \xA3 |0 # NUMBER SIGN, right-left
48 <U0024> \xA4 |0 # DOLLAR SIGN, right-left
50 <U0026> \xA6 |0 # AMPERSAND, right-left
51 <U0027> \xA7 |0 # APOSTROPHE, right-left
54 <U002A> \xAA |0 # ASTERISK, right-left
55 <U002B> \xAB |0 # PLUS SIGN, right-left
58 <U002E> \xAE |0 # FULL STOP, right-left
59 <U002F> \xAF |0 # SOLIDUS, right-left
70 <U003A> \xBA |0 # COLON, right-left
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/
H A Doperators5.C12 base operator+ (const base& left, const base& right)
16 ret_val.i = left.i + right.i;
20 base operator- (const base& left, int right)
24 ret_val.i = left.i - right;
31 base operator! (const base& right)
33 if (right.i < 2)
34 return right;
36 return ((!(right-1)) + (!(right-2)));
/openbsd/gnu/usr.bin/binutils-2.17/gas/
H A Dexpr.c1652 expressionS right; in expr() local
1681 right.X_add_number = 0; in expr()
1729 right.X_add_number = 0; in expr()
1911 valueT left, right; in resolve_expression() local
1987 left = right; in resolve_expression()
2037 left = right; in resolve_expression()
2059 left = right; in resolve_expression()
2070 else if (left != right in resolve_expression()
2092 if (right == 0) in resolve_expression()
2097 if (right == 0) in resolve_expression()
[all …]
/openbsd/lib/libc/stdlib/
H A Dtsearch.c19 struct node_t *left, *right; member
40 &(*rootp)->right; /* T4: follow right branch */ in tsearch()
46 q->left = q->right = (struct node_t *)0; in tsearch()
69 &(*rootp)->right; /* follow right branch */ in tdelete()
73 r = (*rootp)->right; /* D1: */ in tdelete()
83 r->left = q->right; in tdelete()
85 q->right = (*rootp)->right; in tdelete()
97 if (root->left == (struct node_t *)0 && root->right == (struct node_t *)0) in trecurse()
104 if (root->right != (struct node_t *)0) in trecurse()
105 trecurse(root->right, action, level + 1); in trecurse()
/openbsd/usr.sbin/dhcpd/
H A Dtree.c112 tree_concat(struct tree *left, struct tree *right) in tree_concat() argument
122 return right; in tree_concat()
123 if (!right) in tree_concat()
127 if (left->op == TREE_CONST && right->op == TREE_CONST) { in tree_concat()
131 + right->data.const_val.len); in tree_concat()
138 right->data.const_val.data, right->data.const_val.len); in tree_concat()
140 free(right->data.const_val.data); in tree_concat()
142 left->data.const_val.len += right->data.const_val.len; in tree_concat()
143 free(right); in tree_concat()
153 nt->data.concat.right = right; in tree_concat()
[all …]
/openbsd/gnu/llvm/lldb/examples/scripting/
H A Ddictionary.c16 struct tree_node *right; member
63 new_node->right = NULL; in insert()
67 if (root->right != NULL) in insert()
68 insert(root->right, word); in insert()
73 new_node->right = NULL; in insert()
74 root->right = new_node; in insert()
95 new_node->right = NULL; in populate_dictionary()
117 return find_word(dictionary->right, word); in find_word()
131 if (dictionary->right) in print_tree()
132 print_tree(dictionary->right); in print_tree()

12345678910>>...59