Searched refs:left (Results 51 - 75 of 581) sorted by relevance

1234567891011>>

/freebsd-11-stable/sys/contrib/zlib/
H A Dinftrees.c46 int left; /* number of prefix codes available */ local
131 left = 1;
133 left <<= 1;
134 left -= count[len];
135 if (left < 0) return -1; /* over-subscribed */
137 if (left > 0 && (type == CODES || max != 1))
268 left = (int)(1 << curr);
270 left -= count[curr + drop];
271 if (left <= 0) break;
273 left <<
[all...]
H A Dcompress.c32 uLong left; local
34 left = *destLen;
51 stream.avail_out = left > (uLong)max ? max : (uInt)left;
52 left -= stream.avail_out;
/freebsd-11-stable/crypto/heimdal/kadmin/
H A Drandom_password.c81 RND(unsigned char *key, int keylen, int *left) argument
83 if(*left == 0){
85 *left = keylen;
87 (*left)--;
88 return ((unsigned char*)key)[*left];
/freebsd-11-stable/sys/contrib/dev/acpica/compiler/
H A Ddtparser.y205 %left <op> EXPOP_LOGICAL_OR
206 %left <op> EXPOP_LOGICAL_AND
207 %left <op> EXPOP_OR
208 %left <op> EXPOP_XOR
209 %left <op> EXPOP_AND
210 %left <op> EXPOP_EQUAL EXPOP_NOT_EQUAL
211 %left <op> EXPOP_GREATER EXPOP_LESS EXPOP_GREATER_EQUAL EXPOP_LESS_EQUAL
212 %left <op> EXPOP_SHIFT_RIGHT EXPOP_SHIFT_LEFT
213 %left <op> EXPOP_ADD EXPOP_SUBTRACT
214 %left <o
[all...]
H A Dprparser.y205 %left <op> EXPOP_LOGICAL_OR
206 %left <op> EXPOP_LOGICAL_AND
207 %left <op> EXPOP_OR
208 %left <op> EXPOP_XOR
209 %left <op> EXPOP_AND
210 %left <op> EXPOP_EQUAL EXPOP_NOT_EQUAL
211 %left <op> EXPOP_GREATER EXPOP_LESS EXPOP_GREATER_EQUAL EXPOP_LESS_EQUAL
212 %left <op> EXPOP_SHIFT_RIGHT EXPOP_SHIFT_LEFT
213 %left <op> EXPOP_ADD EXPOP_SUBTRACT
214 %left <o
[all...]
/freebsd-11-stable/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;
284 if (tree->left != NULL
285 && offset < tree->left->offset)
288 range_index_node_t *const node = tree->left;
289 tree->left
269 range_index_node_t *left, *right; local
[all...]
/freebsd-11-stable/crypto/openssl/engines/ccgost/
H A Dgosthash.c64 static int add_blocks(int n, byte * left, const byte * right) argument
70 sum = (int)left[i] + (int)right[i] + carry;
71 left[i] = sum & 0xff;
191 ctx->left = 0;
202 if (ctx->left) {
206 unsigned int add_bytes = 32 - ctx->left;
210 memcpy(&(ctx->remainder[ctx->left]), block, add_bytes);
211 ctx->left += add_bytes;
212 if (ctx->left < 32) {
220 ctx->left
[all...]
/freebsd-11-stable/usr.sbin/cron/lib/
H A Dcompat.c76 strcasecmp(left, right)
77 char *left;
80 while (*left && (MkLower(*left) == MkLower(*right))) {
81 left++;
84 return MkLower(*left) - MkLower(*right);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/
H A Dsplit_join_fn_imps.hpp63 const size_type left = partition(pred_t(pred)); local
65 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
67 const size_type ersd = m_size - left;
72 resize_policy::get_new_size_for_arbitrary(left);
100 _GLIBCXX_DEBUG_ASSERT(actual_size >= left);
101 std::copy(m_a_entries, m_a_entries + left, a_entries);
102 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
110 m_size = left;
/freebsd-11-stable/contrib/ipfilter/lib/
H A Dload_http.c33 int fd, len, left, port, endhdr, removed, linenum = 0; local
115 left = sizeof(buffer) - 1;
117 while ((len = read(fd, s, left)) > 0) {
119 left -= len;
150 memmove(buffer, u, (sizeof(buffer) - left) - removed);
152 left += removed;
195 memmove(buffer, t, sizeof(buffer) - left - removed);
197 left += removed;
/freebsd-11-stable/gnu/usr.bin/grep/tests/
H A Dkhadafy.sh16 echo Khadafy test failed -- output left on khadafy.out
/freebsd-11-stable/sys/kern/
H A Dsubr_mchain.c274 long left; local
282 left = uiop->uio_iov->iov_len;
283 if (left == 0) {
288 if (left > size)
289 left = size;
290 error = mb_put_mem(mbp, uiop->uio_iov->iov_base, left, mtype);
293 uiop->uio_offset += left;
294 uiop->uio_resid -= left;
296 (char *)uiop->uio_iov->iov_base + left;
297 uiop->uio_iov->iov_len -= left;
528 long left; local
[all...]
/freebsd-11-stable/lib/libc/gen/
H A Dsigsetops.c86 sigorset(sigset_t *dest, const sigset_t *left, const sigset_t *right) argument
91 dest->__bits[i] = left->__bits[i] | right->__bits[i];
96 sigandset(sigset_t *dest, const sigset_t *left, const sigset_t *right) argument
101 dest->__bits[i] = left->__bits[i] & right->__bits[i];
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyLogical.cpp24 return implies(A->left(), LNeg, RHS, RNeg) &&
28 return implies(LHS, LNeg, A->left(), RNeg) &&
34 return implies(A->left(), LNeg, RHS, RNeg) ||
38 return implies(LHS, LNeg, A->left(), RNeg) ||
63 // After reaching the terminal, it's time to recurse on the left.
70 // When performing left recursion:
72 // When performing left recursion (negated):
77 // When performing left recursion:
79 // When performing left recursion (negated):
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DTargetCXXABI.h210 /// Are arguments to a call destroyed left to right in the callee?
336 friend bool operator==(const TargetCXXABI &left, const TargetCXXABI &right) { argument
337 return left.getKind() == right.getKind();
340 friend bool operator!=(const TargetCXXABI &left, const TargetCXXABI &right) { argument
341 return !(left == right);
/freebsd-11-stable/contrib/gcc/
H A Dtree-chrec.h104 tree left,
107 if (left == chrec_dont_know
111 gcc_assert (TREE_TYPE (left) == TREE_TYPE (right));
113 return build3 (POLYNOMIAL_CHREC, TREE_TYPE (left),
114 build_int_cst (NULL_TREE, loop_num), left, right);
100 build_polynomial_chrec(unsigned loop_num, tree left, tree right) argument
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dfibheap.c51 #define fibnode_insert_before(a, b) fibnode_insert_after (a->left, b)
70 node->left = node;
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
166 b_root->left = temp;
304 /* If we are left with no nodes, then the min is NULL. */
327 node->left
[all...]
/freebsd-11-stable/contrib/byacc/test/
H A Dok_syntax1.y55 %left '|'
56 %left '&'
57 %left '+' '-'
58 %left '*' '/' '%'
59 %left UMINUS /* supplies precedence for unary minus */
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dfibheap.c51 #define fibnode_insert_before(a, b) fibnode_insert_after (a->left, b)
70 node->left = node;
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
166 b_root->left = temp;
304 /* If we are left with no nodes, then the min is NULL. */
327 node->left
[all...]
/freebsd-11-stable/usr.bin/ctags/
H A Dtree.c85 np->left = np->right = 0;
112 if (cur_node->left)
113 add_node(node, cur_node->left);
115 cur_node->left = node;
129 node_next = node->left;
/freebsd-11-stable/contrib/wpa/src/eap_common/
H A Deap_pax_common.c39 size_t num_blocks, left; local
57 left = output_len;
59 size_t clen = left > EAP_PAX_MAC_LEN ? EAP_PAX_MAC_LEN : left;
64 left -= clen;
/freebsd-11-stable/usr.bin/wall/
H A Dttymsg.c63 ssize_t left, wret; local
97 for (cnt = 0, left = 0; cnt < iovcnt; ++cnt)
98 left += iov[cnt].iov_len;
102 if (wret >= left)
105 left -= wret;
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_barrier_combining.c106 tnode->left = tnode->right = NULL;
118 /* If the left child is free, link the group there. */
119 if (node->left == NULL) {
120 ck_barrier_combining_insert(node, tnode, &node->left);
134 ck_barrier_combining_queue_enqueue(&queue, node->left);
151 init_root->parent = init_root->left = init_root->right = NULL;
/freebsd-11-stable/contrib/gcclibs/libgomp/
H A Diter.c151 long start, end, chunk, left; local
158 left = ws->end - start;
161 if (chunk < left)
162 chunk = left;
166 if (chunk > left)
167 chunk = left;
196 long left = end - start; local
204 if (chunk < left)
205 chunk = left;
209 if (chunk > left)
[all...]
/freebsd-11-stable/contrib/ipfilter/
H A Darc4random.c216 int left, numbytes; local
220 left = sizeof(md5ctx.buf) - numbytes;
222 bcopy(md5ctx.buf + sizeof(md5ctx.buf) - left,
223 pottail, left);
224 pottail += left;
246 int left, numbytes; local
248 left = length;
251 left -= numbytes;
253 bcopy(pothead, dest + length - left, left);
[all...]

Completed in 227 milliseconds

1234567891011>>