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

1234567891011>>

/freebsd-head/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-head/contrib/byacc/test/
H A Derr_syntax11.y7 %right '|'
/freebsd-head/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-head/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-head/contrib/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-head/contrib/apr/include/
H A Dapr_user.h105 * @param right Another uid to test
111 APR_DECLARE(apr_status_t) apr_uid_compare(apr_uid_t left, apr_uid_t right);
113 #define apr_uid_compare(left,right) (((left) == (right)) ? APR_SUCCESS : APR_EMISMATCH)
139 * @param right Another gid to test
145 APR_DECLARE(apr_status_t) apr_gid_compare(apr_gid_t left, apr_gid_t right);
147 #define apr_gid_compare(left,right) (((left) == (right)) ? APR_SUCCESS : APR_EMISMATCH)
/freebsd-head/contrib/gcclibs/libiberty/
H A Dsplay-tree.c83 deallocated, we just need to process left and right. */
92 if (active->right)
94 KDEL (active->right->key);
95 VDEL (active->right->value);
96 active->right->key = (splay_tree_key)pending;
97 pending = (splay_tree_node)(active->right);
116 tmp = n->right;
117 n->right = p;
122 /* Rotate the edge joining the right child N with its parent P. PP is the
131 p->right
353 splay_tree_node left, right; local
[all...]
/freebsd-head/contrib/binutils/libiberty/
H A Dsplay-tree.c83 deallocated, we just need to process left and right. */
92 if (active->right)
94 KDEL (active->right->key);
95 VDEL (active->right->value);
96 active->right->key = (splay_tree_key)pending;
97 pending = (splay_tree_node)(active->right);
116 tmp = n->right;
117 n->right = p;
122 /* Rotate the edge joining the right child N with its parent P. PP is the
131 p->right
353 splay_tree_node left, right; local
[all...]
/freebsd-head/contrib/binutils/bfd/
H A Dmep-relocs.pl103 my ($bits, $left, $right, $ci, $c, $cv);
106 $right = 32;
114 $right = $cv unless $right < $cv;
122 return ($bits, $left, $right, $mask, $rmask);
133 ($bits, $left, $right, $mask) = mask2shifts ($mask);
142 $c, $bytesize, $bits, $left, $right, $pcrel, $overflow, $mask);
176 ($bits, $left, $right, $mask, $rmask) = mask2shifts ($mask);
177 if ($left > $right) { $left -= $right;
[all...]
/freebsd-head/sys/dev/sound/pci/
H A Dspicds.c52 unsigned int left, right; member in struct:spicds_info
274 spicds_set(struct spicds_info *codec, int dir, unsigned int left, unsigned int right) argument
277 device_printf(codec->dev, "spicds_set(codec, %d, %d, %d)\n", dir, left, right);
298 if (right >= 100)
301 right = 255;
303 right = 127;
307 right = right + 27;
311 right = right * 25
[all...]
/freebsd-head/contrib/ipfilter/
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-head/sys/contrib/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-head/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-head/contrib/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-head/sys/netgraph/
H A Dng_tee.c47 * It has 4 hooks: left, right, left2right, and right2left. Data
48 * entering from the right is passed to the left and duplicated on
49 * right2left, and data entering from the left is passed to the right
51 * sent to left, and data from right2left to right.
76 struct hookinfo right; member in struct:privdata
173 hinfo = &privdata->right;
180 if (privdata->right.dest)
181 privdata->right.dup = privdata->right.dest;
182 privdata->right
[all...]
/freebsd-head/contrib/subversion/subversion/libsvn_delta/
H A Dcompose_delta.c56 /* 'left' and 'right' link the node into a splay tree. */ member in struct:range_index_node_t
57 range_index_node_t *left, *right;
248 node->left = node->right = NULL;
272 range_index_node_t *left, *right;
277 scratch_node.left = scratch_node.right = NULL;
278 left = right = &scratch_node;
289 tree->left = node->right;
290 node->right = tree;
296 /* Remember the right subtree */
297 right
269 range_index_node_t *left, *right; local
[all...]
/freebsd-head/sys/xen/interface/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-head/sys/kern/
H A Dsubr_capability.c161 right_to_index(uint64_t right) argument
169 idx = CAPIDXBIT(right);
177 uint64_t right; local
186 right = (uint64_t)va_arg(ap, unsigned long long);
187 if (right == 0)
189 assert(CAPRVER(right) == 0);
190 i = right_to_index(right);
193 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
194 rights->cr_rights[i] |= right;
195 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
202 uint64_t right; local
227 uint64_t right; local
[all...]
/freebsd-head/usr.bin/ctags/
H A Dtree.c87 np->left = np->right = 0;
118 else if (cur_node->right)
119 add_node(node, cur_node->right);
121 cur_node->right = node;
129 if (node->right)
130 free_tree(node->right);
/freebsd-head/contrib/binutils/gas/
H A Dexpr.c178 for me to fix right. Thus a hack. JF: Just make generic_bignum bigger,
1648 expressionS right;
1672 rightseg = expr (op_rank[(int) op_left], &right, mode);
1673 if (right.X_op == O_absent)
1676 right.X_op = O_constant;
1677 right.X_add_number = 0;
1678 right.X_add_symbol = NULL;
1679 right.X_op_symbol = NULL;
1687 as_bad ("missing right bracket");
1702 /* input_line_pointer->after right
1641 expressionS right; local
1902 valueT left, right; local
2092 case O_left_shift: left <<= right; break; local
2093 case O_right_shift: left >>= right; break; local
[all...]
/freebsd-head/contrib/llvm/tools/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):
/freebsd-head/contrib/llvm/tools/clang/include/clang/Basic/
H A DTargetCXXABI.h201 /// Are arguments to a call destroyed left to right in the callee?
334 friend bool operator==(const TargetCXXABI &left, const TargetCXXABI &right) { argument
335 return left.getKind() == right.getKind();
338 friend bool operator!=(const TargetCXXABI &left, const TargetCXXABI &right) { argument
339 return !(left == right);
/freebsd-head/contrib/wpa/src/crypto/
H A Ddes-internal.c320 u32 work, right, leftt; local
324 right = block[1];
326 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL;
327 right ^= work;
330 work = ((leftt >> 16) ^ right) & 0x0000ffffL;
331 right ^= work;
334 work = ((right >> 2) ^ leftt) & 0x33333333L;
336 right ^= (work << 2);
338 work = ((right >> 8) ^ leftt) & 0x00ff00ffL;
340 right
[all...]
/freebsd-head/usr.sbin/cron/lib/
H A Dcompat.c88 strcasecmp(left, right)
90 char *right;
92 while (*left && (MkLower(*left) == MkLower(*right))) {
94 right++;
96 return MkLower(*left) - MkLower(*right);
/freebsd-head/sys/contrib/ck/src/
H A Dck_barrier_combining.c106 tnode->left = tnode->right = NULL;
124 /* If the right child is free, link the group there. */
125 if (node->right == NULL) {
126 ck_barrier_combining_insert(node, tnode, &node->right);
135 ck_barrier_combining_queue_enqueue(&queue, node->right);
151 init_root->parent = init_root->left = init_root->right = NULL;

Completed in 312 milliseconds

1234567891011>>