/freebsd-11.0-release/sys/contrib/dev/acpica/compiler/ |
H A D | prparser.y | 98 %left <op> EXPOP_LOGICAL_OR 99 %left <op> EXPOP_LOGICAL_AND 100 %left <op> EXPOP_OR 101 %left <op> EXPOP_XOR 102 %left <op> EXPOP_AND 103 %left <op> EXPOP_EQUAL EXPOP_NOT_EQUAL 104 %left <op> EXPOP_GREATER EXPOP_LESS EXPOP_GREATER_EQUAL EXPOP_LESS_EQUAL 105 %left <op> EXPOP_SHIFT_RIGHT EXPOP_SHIFT_LEFT 106 %left <op> EXPOP_ADD EXPOP_SUBTRACT 107 %left <o [all...] |
/freebsd-11.0-release/contrib/subversion/subversion/libsvn_delta/ |
H A D | compose_delta.c | 56 /* '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.0-release/crypto/openssl/engines/ccgost/ |
H A D | gosthash.c | 64 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.0-release/usr.sbin/cron/lib/ |
H A D | compat.c | 88 strcasecmp(left, right) 89 char *left; 92 while (*left && (MkLower(*left) == MkLower(*right))) { 93 left++; 96 return MkLower(*left) - MkLower(*right);
|
/freebsd-11.0-release/contrib/wpa/src/tls/ |
H A D | tlsv1_client_read.c | 34 size_t left, len, i; local 47 left = *in_len; 49 if (left < 4) 65 left -= 4; 67 if (len > left) 218 size_t left, len, list_len, cert_len, idx; local 232 left = *in_len; 234 if (left < 4) { 236 "(len=%lu)", (unsigned long) left); 244 left 574 size_t left, len; local 665 size_t left, len; local 729 size_t left, len; local 787 size_t left; local 857 size_t left, len, hlen; local 991 size_t left; local [all...] |
/freebsd-11.0-release/gnu/usr.bin/grep/tests/ |
H A D | khadafy.sh | 16 echo Khadafy test failed -- output left on khadafy.out
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | split_join_fn_imps.hpp | 63 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.0-release/contrib/ipfilter/lib/ |
H A D | load_http.c | 33 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;
|
H A D | kmem.c | 98 int r = 0, left; local 109 for (bufp = buffer, left = size; left > 0; bufp += r, left -= r) { 110 r = read(*kvm, bufp, left); 117 r = left;
|
/freebsd-11.0-release/sys/kern/ |
H A D | subr_mchain.c | 274 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.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | ThreadSafetyLogical.cpp | 25 return implies(A->left(), LNeg, RHS, RNeg) && 29 return implies(LHS, LNeg, A->left(), RNeg) && 35 return implies(A->left(), LNeg, RHS, RNeg) || 39 return implies(LHS, LNeg, A->left(), RNeg) || 64 // After reaching the terminal, it's time to recurse on the left. 71 // When performing left recursion: 73 // When performing left recursion (negated): 78 // When performing left recursion: 80 // When performing left recursion (negated):
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | TargetCXXABI.h | 210 /// Are arguments to a call destroyed left to right in the callee? 343 friend bool operator==(const TargetCXXABI &left, const TargetCXXABI &right) { argument 344 return left.getKind() == right.getKind(); 347 friend bool operator!=(const TargetCXXABI &left, const TargetCXXABI &right) { argument 348 return !(left == right);
|
/freebsd-11.0-release/contrib/wpa/src/eap_common/ |
H A D | eap_pax_common.c | 39 size_t num_blocks, left; local 57 left = output_len; 59 size_t clen = left > EAP_PAX_MAC_LEN ? EAP_PAX_MAC_LEN : left; 63 left -= clen;
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | tree-chrec.h | 104 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.0-release/contrib/gcclibs/libiberty/ |
H A D | fibheap.c | 51 #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.0-release/contrib/binutils/libiberty/ |
H A D | fibheap.c | 51 #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.0-release/contrib/byacc/test/ |
H A D | ok_syntax1.y | 55 %left '|' 56 %left '&' 57 %left '+' '-' 58 %left '*' '/' '%' 59 %left UMINUS /* supplies precedence for unary minus */
|
/freebsd-11.0-release/usr.bin/ctags/ |
H A D | tree.c | 85 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.0-release/usr.bin/wall/ |
H A D | ttymsg.c | 63 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.0-release/contrib/wpa/src/crypto/ |
H A D | random.c | 158 size_t left; local 169 left = len; 170 while (left) { 176 siz = left > EXTRACT_LEN ? EXTRACT_LEN : left; 179 left -= siz; 185 left = len; 186 while (left) { 196 siz = left > EXTRACT_LEN ? EXTRACT_LEN : left; [all...] |
/freebsd-11.0-release/contrib/gcclibs/libgomp/ |
H A D | iter.c | 151 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.0-release/contrib/ipfilter/ |
H A D | arc4random.c | 226 int left, numbytes; local 230 left = sizeof(md5ctx.buf) - numbytes; 232 bcopy(md5ctx.buf + sizeof(md5ctx.buf) - left, 233 pottail, left); 234 pottail += left; 256 int left, numbytes; local 258 left = length; 261 left -= numbytes; 263 bcopy(pothead, dest + length - left, left); [all...] |
/freebsd-11.0-release/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
H A D | inftrees.c | 48 int left; /* number of prefix codes available */ local 133 left = 1; 135 left <<= 1; 136 left -= count[len]; 137 if (left < 0) return -1; /* over-subscribed */ 139 if (left > 0 && (type == CODES || max != 1)) 272 left = (int)(1 << curr); 274 left -= count[curr + drop]; 275 if (left <= 0) break; 277 left << [all...] |
/freebsd-11.0-release/contrib/wpa/src/common/ |
H A D | wpa_common.c | 530 int left; local 562 left = rsn_ie_len - 6; 579 left = rsn_ie_len - sizeof(*hdr); 582 if (left >= RSN_SELECTOR_LEN) { 590 left -= RSN_SELECTOR_LEN; 591 } else if (left > 0) { 593 __func__, left); 597 if (left >= 2) { 601 left -= 2; 602 if (count == 0 || count > left / RSN_SELECTOR_LE 723 int left; local [all...] |
/freebsd-11.0-release/contrib/binutils/gas/ |
H A D | expr.c | 639 /* If there is more than one littlenum, left justify the 1703 /* left-hand quantity in resultP. */ 1710 as_warn (_("left operand is a bignum; integer 0 assumed")); 1712 as_warn (_("left operand is a float; integer 0 assumed")); 1909 valueT left, right; 1921 left = 0; 1926 if (!snapshot_symbol (&add_symbol, &left, &seg_left, &frag_left)) 1934 if (!snapshot_symbol (&add_symbol, &left, &seg_left, &frag_left)) 1941 left = !left; 1902 valueT left, right; local [all...] |