Searched refs:right (Results 1 - 25 of 286) sorted by relevance

1234567891011>>

/freebsd-current/contrib/capsicum-test/
H A Dcapsicum-rights.h46 cap_rights_t right; local
50 right = va_arg(ap, cap_rights_t);
51 *rights |= right;
52 if (right == 0) break;
60 cap_rights_t right; local
63 right = va_arg(ap, cap_rights_t);
64 *rights |= right;
65 if (right == 0) break;
73 cap_rights_t right; local
76 right
86 cap_rights_t right; local
[all...]
/freebsd-current/contrib/byacc/test/
H A Derr_syntax11.y7 %right '|'
/freebsd-current/contrib/bmake/unit-tests/
H A Ddeptgt-suffixes.exp7 # To: .tgt-right
10 # ".tgt-right" (num 3, ref 2)
16 # From: .src-right
18 # ".src-right" (num 5, ref 2)
23 .src-left.tgt-right:
26 .src-right.tgt-left:
30 : Making deptgt-suffixes.tgt-right from deptgt-suffixes.src-left.
31 : Making deptgt-suffixes.src-right out of nothing.
32 : Making deptgt-suffixes.tgt-left from deptgt-suffixes.src-right.
/freebsd-current/tools/test/stress2/misc/
H A Dchain.sh48 coroutine void f(chan left, chan right) {
49 chs(left, int, 1 + chr(right, int));
58 chan right = leftmost;
62 left = right;
63 right = chmake(int, 0);
64 go(f(left, right));
66 chs(right, int, 0);
/freebsd-current/contrib/unbound/util/
H A Drbtree.c63 /** rotate subtree right (to preserve redblack property) */
110 rbnode_type *right = node->right; local
111 node->right = right->left;
112 if (right->left != RBTREE_NULL)
113 right->left->parent = node;
115 right->parent = node->parent;
119 node->parent->left = right;
121 node->parent->right
[all...]
/freebsd-current/contrib/ldns/
H A Drbtree.c66 /** rotate subtree right (to preserve redblack property) */
118 ldns_rbnode_t *right = node->right; local
119 node->right = right->left;
120 if (right->left != LDNS_RBTREE_NULL)
121 right->left->parent = node;
123 right->parent = node->parent;
127 node->parent->left = right;
129 node->parent->right
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp42 const SUnit *pickBest(const SUnit *left, const SUnit *right);
92 // scheduled right before its predecessors that it doesn't lengthen
130 // Return -1 if left has higher priority, 1 if right has higher priority.
132 static int BUCompareLatency(const SUnit *left, const SUnit *right) { argument
136 int RHeight = (int)right->getHeight();
149 int RDepth = right->getDepth();
152 << ") depth " << LDepth << " vs SU (" << right->NodeNum
156 if (left->Latency != right->Latency)
157 return left->Latency > right->Latency ? 1 : -1;
162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) argument
[all...]
/freebsd-current/contrib/libdiff/test/
H A Dresults_test.c35 .right = &d_right,
39 diff_atomize_text_by_line(NULL, result->right);
48 diff_data_init_subsection(&state.right, result->right,
49 result->right->atoms.head,
50 result->right->atoms.len);
55 &state.right.atoms.head[0], 2);
60 &state.right.atoms.head[2], 3);
65 &state.right.atoms.head[5], 0);
70 &state.right
[all...]
/freebsd-current/contrib/libdiff/lib/
H A Ddiff_output_edscript.c53 right_len = cc->right.end - cc->right.start;
56 else if (result->right->atoms.len == 0)
58 else if (right_len == 0 && cc->right.start > 0)
59 right_start = cc->right.start;
60 else if (cc->right.end > 0)
61 right_start = cc->right.start + 1;
63 right_start = cc->right.start;
71 right_start, cc->right.end);
88 right_start, cc->right
[all...]
H A Ddiff_myers.c75 * Moving right means delete an atom from the left-hand-side,
76 * Moving down means add an atom from the right-hand-side.
81 * bottom right, remembers all steps, and then backtraces to find the shortest
120 * x = atom index in left-side source, y = atom index in the right-side source.
123 * most left.len + 1 + right.len items. Note that each d step occupies either
132 * in the left-hand file, and the y coordinate, i.e. position in the right-hand
192 * right: the right side to diff against.
213 struct diff_data *left, struct diff_data *right,
217 int delta = (int)right
212 diff_divide_myers_forward(bool *found_midpoint, struct diff_data *left, struct diff_data *right, int *kd_forward, int *kd_backward, int d, struct diff_box *meeting_snake) argument
510 diff_divide_myers_backward(bool *found_midpoint, struct diff_data *left, struct diff_data *right, int *kd_forward, int *kd_backward, int d, struct diff_box *meeting_snake) argument
797 struct diff_data *right = &state->right; local
1083 struct diff_data *right = &state->right; local
[all...]
H A Ddiff_main.c71 const unsigned char *right, size_t right_len,
80 unsigned char cr = right[ir];
104 unsigned char cr = right[ir++];
112 cmp = memcmp(left, right, MIN(left_len, right_len));
123 const struct diff_atom *right)
126 int flags = (left->root->diff_flags | right->root->diff_flags);
129 if (!left->len && !right->len) {
134 if (!right->len) {
144 if (left->at != NULL && right->at != NULL) {
145 *cmp = buf_cmp(left->at, left->len, right
70 buf_cmp(const unsigned char *left, size_t left_len, const unsigned char *right, size_t right_len, bool ignore_whitespace) argument
121 diff_atom_cmp(int *cmp, const struct diff_atom *left, const struct diff_atom *right) argument
213 diff_atom_same(bool *same, const struct diff_atom *left, const struct diff_atom *right) argument
609 diff_main(const struct diff_config *config, struct diff_data *left, struct diff_data *right) argument
[all...]
H A Ddiff_patience.c104 diff_atoms_mark_unique_in_both(struct diff_data *left, struct diff_data *right, argument
116 r = diff_atoms_mark_unique(right, NULL);
128 diff_data_foreach_atom(j, right) {
154 /* Still need to unmark right[*]->patience.unique_in_both for atoms that
156 diff_data_foreach_atom(i, right) {
248 diff_atoms_mark_unique_in_both(struct diff_data *left, struct diff_data *right, argument
259 all_atoms = calloc(left->atoms.len + right->atoms.len,
265 right->err = 0;
267 right->root->err = 0;
271 diff_data_foreach_atom(b, right) {
385 struct diff_data *right = &state->right; local
[all...]
H A Ddiff_output_plain.c53 right_len = cc->right.end - cc->right.start;
56 else if (result->right->atoms.len == 0)
58 else if (right_len == 0 && cc->right.start > 0)
59 right_start = cc->right.start;
60 else if (cc->right.end > 0)
61 right_start = cc->right.start + 1;
63 right_start = cc->right.start;
71 right_start, cc->right.end);
89 right_start, cc->right
[all...]
/freebsd-current/crypto/openssl/test/testutil/
H A Dtu_local.h23 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,
/freebsd-current/sys/dev/sound/pci/
H A Dspicds.c50 unsigned int left, right; member in struct:spicds_info
272 spicds_set(struct spicds_info *codec, int dir, unsigned int left, unsigned int right) argument
275 device_printf(codec->dev, "spicds_set(codec, %d, %d, %d)\n", dir, left, right);
296 if (right >= 100)
299 right = 255;
301 right = 127;
305 right = right + 27;
309 right = right * 25
[all...]
/freebsd-current/sys/netpfil/ipfilter/netinet/
H A Dipf_rb.h15 struct _t *right; \
43 tmp1 = node->_f.right; \
45 node->_f.right = tmp2; \
49 head->top._f.right = tmp1; \
50 else if (parent->_f.right == node) \
51 parent->_f.right = tmp1; \
66 tmp2 = tmp1->_f.right; \
71 head->top._f.right = tmp1; \
72 else if (parent->_f.right == node) \
73 parent->_f.right
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/hwasan/
H A Dhwasan_malloc_bisect.h33 uptr right = flags()->malloc_bisect_right; local
34 if (LIKELY(left == 0 && right == 0))
41 if (h < left || h > right)
/freebsd-current/contrib/ofed/libibverbs/
H A Dmemory.c55 struct ibv_mem_node *left, *right; member in struct:ibv_mem_node
168 mm_root->right = NULL;
181 while (node->right)
182 node = node->right;
195 if (node->right) {
196 node = node->right;
200 while (node->parent && node == node->parent->right)
215 node->left = tmp->right;
220 if (node->parent->right == node)
221 node->parent->right
[all...]
/freebsd-current/usr.bin/ctags/
H A Dtree.c79 np->left = np->right = 0;
110 else if (cur_node->right)
111 add_node(node, cur_node->right);
113 cur_node->right = node;
121 if (node->right)
122 free_tree(node->right);
/freebsd-current/sys/netgraph/
H A Dng_tee.c45 * It has 4 hooks: left, right, left2right, and right2left. Data
46 * entering from the right is passed to the left and duplicated on
47 * right2left, and data entering from the left is passed to the right
49 * sent to left, and data from right2left to right.
74 struct hookinfo right; member in struct:privdata
171 hinfo = &privdata->right;
178 if (privdata->right.dest)
179 privdata->right.dup = privdata->right.dest;
180 privdata->right
[all...]
/freebsd-current/sys/contrib/xen/io/
H A Dlibxenvchan.h67 * right is client read, server write
69 struct ring_shared left, right; member in struct:vchan_interface
94 * Grant list: ordering is left, right. Must not extend into actual ring
/freebsd-current/lib/libc/gen/
H A Dsigsetops.c80 sigorset(sigset_t *dest, const sigset_t *left, const sigset_t *right) argument
85 dest->__bits[i] = left->__bits[i] | right->__bits[i];
90 sigandset(sigset_t *dest, const sigset_t *left, const sigset_t *right) argument
95 dest->__bits[i] = left->__bits[i] & right->__bits[i];
/freebsd-current/sys/contrib/openzfs/module/os/linux/spl/
H A Dspl-cred.c31 unsigned int left, right, mid; local
38 right = group_info->ngroups;
39 while (left < right) {
40 mid = (left + right) / 2;
47 right = mid;
/freebsd-current/sys/kern/
H A Dsubr_capability.c158 right_to_index(uint64_t right) argument
166 idx = CAPIDXBIT(right);
174 uint64_t right; local
183 right = (uint64_t)va_arg(ap, unsigned long long);
184 if (right == 0)
186 assert(CAPRVER(right) == 0);
187 i = right_to_index(right);
190 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
191 rights->cr_rights[i] |= right;
192 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
199 uint64_t right; local
224 uint64_t right; local
[all...]
/freebsd-current/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyLogical.cpp25 implies(A->right(), LNeg, RHS, RNeg);
29 implies(LHS, LNeg, A->right(), RNeg);
35 implies(A->right(), LNeg, RHS, RNeg);
39 implies(LHS, LNeg, A->right(), RNeg);
42 // Recurse on right.
45 // When performing right recursion:
47 // When performing right recursion (negated):
52 // When performing right recursion:
54 // When performing right recursion (negated):

Completed in 262 milliseconds

1234567891011>>