| /openbsd/src/regress/usr.bin/mandoc/tbl/layout/ |
| D | lines.out_ascii | 16 hline top right:
107 hline bottom right:
110 vline bottom right:
114 vline and hline bottom right:
118 hline and vline bottom right:
188 double vline bottom right:
192 double vline and hline bottom right:
196 hline and double vline bottom right:
204 vline right below hline top left:
212 vline right below hline at the top:
[all …]
|
| /openbsd/src/usr.sbin/nsd/ |
| D | rbtree.c | 66 rbnode_type *right = node->right; in rbtree_rotate_left() local
67 node->right = right->left; in rbtree_rotate_left()
68 if (right->left != RBTREE_NULL) in rbtree_rotate_left()
69 right->left->parent = node; in rbtree_rotate_left()
71 right->parent = node->parent; in rbtree_rotate_left()
75 node->parent->left = right; 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()
[all …]
|
| D | dname.c | 292 dname_is_subdomain(const dname_type *left, const dname_type *right) in dname_is_subdomain() argument
296 if (left->label_count < right->label_count) in dname_is_subdomain()
299 for (i = 1; i < right->label_count; ++i) { in dname_is_subdomain()
301 dname_label(right, i)) != 0) in dname_is_subdomain()
310 dname_compare(const dname_type *left, const dname_type *right) in dname_compare() argument
317 assert(right); in dname_compare()
319 if (left == right) { in dname_compare()
323 label_count = (left->label_count <= right->label_count in dname_compare()
325 : right->label_count); in dname_compare()
330 dname_label(right, i)); in dname_compare()
[all …]
|
| /openbsd/src/usr.sbin/unbound/util/ |
| D | rbtree.c | 110 rbnode_type *right = node->right; in rbtree_rotate_left() local
111 node->right = right->left; in rbtree_rotate_left()
112 if (right->left != RBTREE_NULL) in rbtree_rotate_left()
113 right->left->parent = node; in rbtree_rotate_left()
115 right->parent = node->parent; in rbtree_rotate_left()
119 node->parent->left = right; 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()
[all …]
|
| /openbsd/src/sbin/unwind/libunbound/util/ |
| D | rbtree.c | 110 rbnode_type *right = node->right; in rbtree_rotate_left() local
111 node->right = right->left; in rbtree_rotate_left()
112 if (right->left != RBTREE_NULL) in rbtree_rotate_left()
113 right->left->parent = node; in rbtree_rotate_left()
115 right->parent = node->parent; in rbtree_rotate_left()
119 node->parent->left = right; 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()
[all …]
|
| /openbsd/src/gnu/usr.bin/perl/cpan/CPAN-Meta/lib/CPAN/Meta/ |
| D | Merge.pm | 13 my ($left, $right) = @_;
15 (not defined $left and not defined $right)
17 || (defined $left and defined $right and $left eq $right);
21 my ($left, $right, $path) = @_;
22 …ak sprintf "Can't merge attribute %s: '%s' does not equal '%s'", join('.', @{$path}), $left, $right
23 unless _is_identical($left, $right);
52 my ($left, $right) = @_;
53 return [ +_uniq(@{$left}, @{$right}) ];
57 my ($left, $right, $path) = @_;
58 for my $key (keys %{$right}) {
[all …]
|
| /openbsd/src/sys/arch/hppa/spmath/ |
| D | sfsub.c | 28 register unsigned int left, right, result, extent; local
37 right = *rightptr;
41 Sgl_xortointp1(left,right,/*to*/save);
50 if (Sgl_isnotnan(right))
52 if (Sgl_isinfinity(right) && save==0)
86 else if (Sgl_is_signalingnan(right))
92 Sgl_set_quiet(right);
93 *dstptr = right;
106 if (Sgl_isinfinity_exponent(right))
108 if (Sgl_iszero_mantissa(right))
[all …]
|
| D | sfadd.c | 28 register unsigned int left, right, result, extent; local
39 right = *rightptr;
43 Sgl_xortointp1(left,right,/*to*/save);
52 if (Sgl_isnotnan(right))
54 if (Sgl_isinfinity(right) && save!=0)
88 else if (Sgl_is_signalingnan(right))
94 Sgl_set_quiet(right);
95 *dstptr = right;
108 if (Sgl_isinfinity_exponent(right))
110 if (Sgl_iszero_mantissa(right))
[all …]
|
| D | sfcmp.c | 29 register unsigned int left, right; local
34 right = *rightptr;
39 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) )
48 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
49 && Sgl_isnotzero_mantissa(right)
50 && (Exception(cond) || Sgl_isone_signaling(right)) ) )
65 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
66 && Sgl_isnotzero_mantissa(right)) )
76 Sgl_xortointp1(left,right,xorresult);
82 && Sgl_iszero_exponentmantissa(right) )
[all …]
|
| D | hppa.h | 18 #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/src/gnu/usr.sbin/mkhybrid/src/libhfs_iso/ |
| D | node.c | 202 node right; in n_split() local
206 right = *left; in n_split()
207 right.nd.ndBLink = left->nnum; in n_split()
209 if (n_new(&right) < 0) in n_split()
212 left->nd.ndFLink = right.nnum; in n_split()
221 n_search(&right, record); in n_split()
225 if (right.rnum < mid) in n_split()
238 …&& right.roff[nrecs] - right.roff[mid] + left->roff[0] + *reclen + 2 > HFS_BLOCKSZ - 2 * (mid + 1)) in n_split()
251 rec = HFS_NODEREC(right, i); in n_split()
270 n_compact(&right); in n_split()
[all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| D | GCNILPSched.cpp | 42 const SUnit *pickBest(const SUnit *left, const SUnit *right);
132 static int BUCompareLatency(const SUnit *left, const SUnit *right) { in BUCompareLatency() argument
136 int RHeight = (int)right->getHeight(); in BUCompareLatency()
149 int RDepth = right->getDepth(); in BUCompareLatency()
152 << ") depth " << LDepth << " vs SU (" << right->NodeNum in BUCompareLatency()
156 if (left->Latency != right->Latency) in BUCompareLatency()
157 return left->Latency > right->Latency ? 1 : -1; in BUCompareLatency()
162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) in pickBest() argument
169 int spread = (int)left->getDepth() - (int)right->getDepth(); in pickBest()
172 << left->getDepth() << " != SU(" << right->NodeNum in pickBest()
[all …]
|
| /openbsd/src/gnu/lib/libiberty/src/ |
| D | 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 …]
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/ |
| D | et-forest.c | 49 et_forest_occurrence_t left, right; member
97 while (occ->right)
98 occ = occ->right;
132 node1 = node->right;
134 node2 = parent->right;
145 parent->right = grandparent;
147 node->right = parent;
159 node->parent->right = node;
170 node2 = node->right;
173 grandparent->right = node1;
[all …]
|
| /openbsd/src/regress/sbin/iked/live/ |
| D | Makefile | 171 side=right; \
223 setup_certs: ca-both.crt left-from-ca-both.crt left.key right-from-ca-both.crt \
224 right.key ca-left.crt right-from-ca-left.crt ca-right.crt left-from-ca-right.crt \
225 ca-none.crt left-from-ca-none.crt right-from-ca-none.crt \
227 right-from-intermediate-from-ca-none.crt
264 left.key right.key:
273 right-from-ca-both.crt: ca-both.crt ca-both.key right.key
274 caname=ca-both; name=right; ${SETUP_CERT}
279 right-from-ca-left.crt right.key: ca-left.crt ca-left.key
280 caname=ca-left; name=right; ${SETUP_CERT}
[all …]
|
| /openbsd/src/gnu/usr.bin/binutils/gprof/ |
| D | sym_ids.c | 45 left, right; member
184 parse_spec (slash + 1, &id->right.sym);
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)
210 printf ("%d", id->right.sym.line_num);
279 Sym *sym, *left, *right; in sym_id_parse() local
295 if (id->has_right && match (&id->right.sym, sym)) in sym_id_parse()
296 extend_match (&id->right, sym, &right_ids, FALSE); in sym_id_parse()
[all …]
|
| /openbsd/src/gnu/usr.bin/binutils-2.17/gprof/ |
| D | sym_ids.c | 45 left, right; member
179 parse_spec (slash + 1, &id->right.sym); in parse_id()
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()
205 printf ("%d", id->right.sym.line_num); in parse_id()
268 Sym *sym, *left, *right; in sym_id_parse() local
284 if (id->has_right && match (&id->right.sym, sym)) in sym_id_parse()
285 extend_match (&id->right, sym, &right_ids, FALSE); in sym_id_parse()
[all …]
|
| /openbsd/src/gnu/usr.bin/perl/cpan/Encode/ucm/ |
| D | macHebrew.ucm | 44 <U0020> \xA0 |0 # SPACE, right-left
45 <U0021> \xA1 |0 # EXCLAMATION MARK, right-left
46 <U0022> \xA2 |0 # QUOTATION MARK, right-left
47 <U0023> \xA3 |0 # NUMBER SIGN, right-left
48 <U0024> \xA4 |0 # DOLLAR SIGN, right-left
49 <U0025> \xA5 |0 # PERCENT SIGN, right-left
51 <U0027> \xA7 |0 # APOSTROPHE, right-left
52 <U0028> \xA9 |0 # LEFT PARENTHESIS, right-left
53 <U0029> \xA8 |0 # RIGHT PARENTHESIS, right-left
54 <U002A> \xAA |0 # ASTERISK, right-left
[all …]
|
| D | macFarsi.ucm | 44 <U0020> \xA0 |0 # SPACE, right-left
45 <U0021> \xA1 |0 # EXCLAMATION MARK, right-left
46 <U0022> \xA2 |0 # QUOTATION MARK, right-left
47 <U0023> \xA3 |0 # NUMBER SIGN, right-left
48 <U0024> \xA4 |0 # DOLLAR SIGN, right-left
49 <U0025> \x25 |0 # PERCENT SIGN, left-right
50 <U0026> \xA6 |0 # AMPERSAND, right-left
51 <U0027> \xA7 |0 # APOSTROPHE, right-left
52 <U0028> \xA8 |0 # LEFT PARENTHESIS, right-left
53 <U0029> \xA9 |0 # RIGHT PARENTHESIS, right-left
[all …]
|
| D | macArabic.ucm | 44 <U0020> \xA0 |0 # SPACE, right-left
45 <U0021> \xA1 |0 # EXCLAMATION MARK, right-left
46 <U0022> \xA2 |0 # QUOTATION MARK, right-left
47 <U0023> \xA3 |0 # NUMBER SIGN, right-left
48 <U0024> \xA4 |0 # DOLLAR SIGN, right-left
49 <U0025> \x25 |0 # PERCENT SIGN, left-right
50 <U0026> \xA6 |0 # AMPERSAND, right-left
51 <U0027> \xA7 |0 # APOSTROPHE, right-left
52 <U0028> \xA8 |0 # LEFT PARENTHESIS, right-left
53 <U0029> \xA9 |0 # RIGHT PARENTHESIS, right-left
[all …]
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
| D | operators5.C | 12 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/src/gnu/usr.bin/binutils-2.17/gas/ |
| D | expr.c | 1652 expressionS right; in expr() local
1676 rightseg = expr (op_rank[(int) op_left], &right, mode); in expr()
1677 if (right.X_op == O_absent) in expr()
1680 right.X_op = O_constant; in expr()
1681 right.X_add_number = 0; in expr()
1682 right.X_add_symbol = NULL; in expr()
1683 right.X_op_symbol = NULL; in expr()
1722 if (right.X_op == O_big) in expr()
1724 if (right.X_add_number > 0) in expr()
1728 right.X_op = O_constant; in expr()
[all …]
|
| /openbsd/src/lib/libc/stdlib/ |
| D | tsearch.c | 19 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/src/usr.sbin/dhcpd/ |
| D | tree.c | 112 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/src/gnu/llvm/lldb/examples/scripting/ |
| D | dictionary.c | 16 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()
|