Home
last modified time | relevance | path

Searched refs:left (Results 126 - 150 of 3984) sorted by relevance

12345678910>>...160

/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationCompare.java19 public static int compareUpToQuaternary(CollationIterator left, CollationIterator right, in compareUpToQuaternary() argument
36 long ce = left.nextCE(); in compareUpToQuaternary()
44 left.setCurrentCE(ce & 0xffffffff00000000L); in compareUpToQuaternary()
46 ce = left.nextCE(); in compareUpToQuaternary()
49 left.setCurrentCE(0); in compareUpToQuaternary()
105 leftSecondary = ((int) left.getCE(leftIndex++)) >>> 16; in compareUpToQuaternary()
129 while ((p = left.getCE(leftLimit) >>> 32) > Collation.MERGE_SEPARATOR_PRIMARY in compareUpToQuaternary()
145 leftSecondary = ((int) left.getCE(--leftIndex)) >>> 16; in compareUpToQuaternary()
164 assert (left.getCE(leftLimit) == right.getCE(rightLimit)); in compareUpToQuaternary()
189 ce = left in compareUpToQuaternary()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationCompare.java23 public static int compareUpToQuaternary(CollationIterator left, CollationIterator right, in compareUpToQuaternary() argument
40 long ce = left.nextCE(); in compareUpToQuaternary()
48 left.setCurrentCE(ce & 0xffffffff00000000L); in compareUpToQuaternary()
50 ce = left.nextCE(); in compareUpToQuaternary()
53 left.setCurrentCE(0); in compareUpToQuaternary()
109 leftSecondary = ((int) left.getCE(leftIndex++)) >>> 16; in compareUpToQuaternary()
133 while ((p = left.getCE(leftLimit) >>> 32) > Collation.MERGE_SEPARATOR_PRIMARY in compareUpToQuaternary()
149 leftSecondary = ((int) left.getCE(--leftIndex)) >>> 16; in compareUpToQuaternary()
168 assert (left.getCE(leftLimit) == right.getCE(rightLimit)); in compareUpToQuaternary()
193 ce = left in compareUpToQuaternary()
[all...]
/third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/tools/conversion/eot/
H A DHuffmanEncoder.java36 short left; field in HuffmanEncoder.TreeNode
62 tree[i].left = (short)(2 * i); in HuffmanEncoder()
68 tree[range + i].left = -1; in HuffmanEncoder()
96 if (tree[tree[i].left].up != i) { in checkTree()
97 return "tree[tree[" + i + "].left].up == " + tree[tree[i].left].up + ", expected " + i; in checkTree()
106 if (tree[i].weight != tree[tree[i].left].weight + tree[tree[i].right].weight) { in checkTree()
108 tree[tree[i].left].weight + " + " + tree[tree[i].right].weight; in checkTree()
121 int a = tree[i].left; in checkTree()
124 return "tree[" + i + "].left in checkTree()
[all...]
/foundation/arkui/ui_lite/frameworks/layout/
H A Dflex_layout.cpp101 int16_t left; in CalValidLength() local
111 left = child->GetStyle(STYLE_MARGIN_LEFT); in CalValidLength()
113 totalValidLength += (child->GetRelativeRect().GetWidth() + left + right); in CalValidLength()
129 int16_t left; in CalRowCount() local
136 left = child->GetStyle(STYLE_MARGIN_LEFT); in CalRowCount()
138 pos += left; in CalRowCount()
140 pos = left; in CalRowCount()
153 int16_t left; in GetRowMaxHeight() local
166 left = child->GetStyle(STYLE_MARGIN_LEFT); in GetRowMaxHeight()
170 pos += left; in GetRowMaxHeight()
189 int16_t left; GetRowsWidth() local
287 int16_t left = child->GetStyle(STYLE_MARGIN_LEFT); LayoutHorizontal() local
343 int16_t left; GetColumnMaxWidth() local
418 int16_t left = child->GetStyle(STYLE_MARGIN_LEFT); GetCrossAxisPosX() local
[all...]
/third_party/node/deps/v8/src/compiler/backend/arm64/
H A Dinstruction-selector-arm64.cc22 kArithmeticImm, // 12 bit unsigned immediate shifted left 0 or 12 bits
252 if (m.left().IsLoad() && m.right().Is(32) && in Initialize()
253 selector_->CanCover(m.node(), m.left().node())) { in Initialize()
255 Node* load = m.left().node(); in Initialize()
339 *right_op = g->UseRegister(mright.left().node()); in TryMatchAnyExtend()
346 if (selector->CanCover(mright.node(), mright.left().node()) && in TryMatchAnyExtend()
347 mright.left().IsWord32Shl()) { in TryMatchAnyExtend()
348 Int32BinopMatcher mleft_of_right(mright.left().node()); in TryMatchAnyExtend()
353 *right_op = g->UseRegister(mleft_of_right.left().node()); in TryMatchAnyExtend()
376 Node* left in TryMatchLoadStoreShift()
1336 Node* left = m.left().node(); VisitWord32Shr() local
1387 Node* left = m.left().node(); VisitWord32Sar() local
1647 InstructionOperand left = g.UseRegister(m.left().node()); EmitInt32MulWithOverflow() local
2156 VisitCompare(InstructionSelector* selector, InstructionCode opcode, InstructionOperand left, InstructionOperand right, FlagsContinuation* cont) VisitCompare() argument
2408 Node* left = node->InputAt(0); VisitWordCompare() local
2794 Node* const left = m.left().node(); VisitWordCompareZero() local
2858 Node* const left = m.left().node(); VisitWordCompareZero() local
3239 Node* left = node->InputAt(0); VisitFloat64InsertLowWord32() local
3256 Node* left = node->InputAt(0); VisitFloat64InsertHighWord32() local
3712 ShuffleMatcher left = m.left(); TryMatchMulWithDup() local
3787 Node* left() const { return left_; } left() function
[all...]
/kernel/linux/linux-5.10/drivers/video/fbdev/core/
H A Dcfbcopyarea.c110 int const left = shift & (bits - 1); in bitcpy() local
121 d0 <<= left; in bitcpy() local
129 d0 = d0 >> right | d1 << left; in bitcpy()
146 d0 <<= left; in bitcpy() local
153 d0 = d0 >> right | d1 << left; in bitcpy()
166 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
169 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
172 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
175 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
182 d0 = d0 >> right | d1 << left; in bitcpy()
283 int const left = shift & (bits-1); bitcpy_rev() local
296 d0 <<= left; bitcpy_rev() local
366 d0 <<= left; bitcpy_rev() local
[all...]
H A Dcfbfillrect.c93 unsigned long pat, int left, int right, unsigned n, int bits) in bitfill_unaligned()
114 pat = pat << left | pat >> right; in bitfill_unaligned()
122 pat = pat << left | pat >> right; in bitfill_unaligned()
124 pat = pat << left | pat >> right; in bitfill_unaligned()
126 pat = pat << left | pat >> right; in bitfill_unaligned()
128 pat = pat << left | pat >> right; in bitfill_unaligned()
133 pat = pat << left | pat >> right; in bitfill_unaligned()
218 int dst_idx, unsigned long pat, int left, int right, in bitfill_unaligned_rev()
243 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
252 pat = pat << left | pa in bitfill_unaligned_rev()
92 bitfill_unaligned(struct fb_info *p, unsigned long __iomem *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned() argument
217 bitfill_unaligned_rev(struct fb_info *p, unsigned long __iomem *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned_rev() argument
285 int dst_idx, left; cfb_fillrect() local
[all...]
/kernel/linux/linux-6.6/drivers/video/fbdev/core/
H A Dcfbcopyarea.c110 int const left = shift & (bits - 1); in bitcpy() local
121 d0 <<= left; in bitcpy() local
129 d0 = d0 >> right | d1 << left; in bitcpy()
146 d0 <<= left; in bitcpy() local
153 d0 = d0 >> right | d1 << left; in bitcpy()
166 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
169 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
172 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
175 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
182 d0 = d0 >> right | d1 << left; in bitcpy()
283 int const left = shift & (bits-1); bitcpy_rev() local
296 d0 <<= left; bitcpy_rev() local
366 d0 <<= left; bitcpy_rev() local
[all...]
H A Dcfbfillrect.c93 unsigned long pat, int left, int right, unsigned n, int bits) in bitfill_unaligned()
114 pat = pat << left | pat >> right; in bitfill_unaligned()
122 pat = pat << left | pat >> right; in bitfill_unaligned()
124 pat = pat << left | pat >> right; in bitfill_unaligned()
126 pat = pat << left | pat >> right; in bitfill_unaligned()
128 pat = pat << left | pat >> right; in bitfill_unaligned()
133 pat = pat << left | pat >> right; in bitfill_unaligned()
218 int dst_idx, unsigned long pat, int left, int right, in bitfill_unaligned_rev()
243 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
252 pat = pat << left | pa in bitfill_unaligned_rev()
92 bitfill_unaligned(struct fb_info *p, unsigned long __iomem *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned() argument
217 bitfill_unaligned_rev(struct fb_info *p, unsigned long __iomem *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned_rev() argument
285 int dst_idx, left; cfb_fillrect() local
[all...]
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dpicture_rescale_enc.c38 // Adjust top-left corner to chroma sample position.
40 int* const left, int* const top) { in SnapTopLeftPosition()
42 *left &= ~1; in SnapTopLeftPosition()
47 // Adjust top-left corner and verify that the sub-rectangle is valid.
49 int* const left, int* const top, in AdjustAndCheckRectangle()
51 SnapTopLeftPosition(pic, left, top); in AdjustAndCheckRectangle()
52 if ((*left) < 0 || (*top) < 0) return 0; in AdjustAndCheckRectangle()
54 if ((*left) + width > pic->width) return 0; in AdjustAndCheckRectangle()
94 int left, int top, int width, int height, in WebPPictureView()
99 if (!AdjustAndCheckRectangle(src, &left, in WebPPictureView()
39 SnapTopLeftPosition(const WebPPicture* const pic, int* const left, int* const top) SnapTopLeftPosition() argument
48 AdjustAndCheckRectangle(const WebPPicture* const pic, int* const left, int* const top, int width, int height) AdjustAndCheckRectangle() argument
93 WebPPictureView(const WebPPicture* src, int left, int top, int width, int height, WebPPicture* dst) WebPPictureView() argument
126 WebPPictureCrop(WebPPicture* pic, int left, int top, int width, int height) WebPPictureCrop() argument
288 WebPPictureView(const WebPPicture* src, int left, int top, int width, int height, WebPPicture* dst) WebPPictureView() argument
300 WebPPictureCrop(WebPPicture* pic, int left, int top, int width, int height) WebPPictureCrop() argument
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dsort.c95 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) in sort__thread_cmp() argument
97 return right->thread->tid - left->thread->tid; in sort__thread_cmp()
136 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) in sort__comm_cmp() argument
138 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_cmp()
142 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) in sort__comm_collapse() argument
144 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_collapse()
148 sort__comm_sort(struct hist_entry *left, struct hist_entry *right) in sort__comm_sort() argument
150 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_sort()
192 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) in sort__dso_cmp() argument
194 return _sort__dso_cmp(right->ms.map, left in sort__dso_cmp()
264 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_cmp() argument
285 sort__sym_sort(struct hist_entry *left, struct hist_entry *right) sort__sym_sort() argument
369 sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right) sort__srcline_cmp() argument
403 sort__srcline_from_cmp(struct hist_entry *left, struct hist_entry *right) sort__srcline_from_cmp() argument
430 sort__srcline_to_cmp(struct hist_entry *left, struct hist_entry *right) sort__srcline_to_cmp() argument
531 sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right) sort__srcfile_cmp() argument
560 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) sort__parent_cmp() argument
588 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) sort__cpu_cmp() argument
619 sort__cgroup_id_cmp(struct hist_entry *left, struct hist_entry *right) sort__cgroup_id_cmp() argument
649 sort__cgroup_cmp(struct hist_entry *left, struct hist_entry *right) sort__cgroup_cmp() argument
682 sort__socket_cmp(struct hist_entry *left, struct hist_entry *right) sort__socket_cmp() argument
714 sort__time_cmp(struct hist_entry *left, struct hist_entry *right) sort__time_cmp() argument
770 sort__trace_cmp(struct hist_entry *left, struct hist_entry *right) sort__trace_cmp() argument
810 sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_from_cmp() argument
842 sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_to_cmp() argument
874 sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_from_cmp() argument
891 sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_to_cmp() argument
990 sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right) sort__mispredict_cmp() argument
1017 sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right) sort__cycles_cmp() argument
1046 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right) sort__daddr_cmp() argument
1072 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right) sort__iaddr_cmp() argument
1098 sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_daddr_cmp() argument
1123 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right) sort__locked_cmp() argument
1151 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right) sort__tlb_cmp() argument
1179 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right) sort__lvl_cmp() argument
1207 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right) sort__snoop_cmp() argument
1235 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right) sort__dcacheline_cmp() argument
1330 sort__local_weight_cmp(struct hist_entry *left, struct hist_entry *right) sort__local_weight_cmp() argument
1349 sort__global_weight_cmp(struct hist_entry *left, struct hist_entry *right) sort__global_weight_cmp() argument
1424 sort__phys_daddr_cmp(struct hist_entry *left, struct hist_entry *right) sort__phys_daddr_cmp() argument
1465 sort__abort_cmp(struct hist_entry *left, struct hist_entry *right) sort__abort_cmp() argument
1497 sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right) sort__in_tx_cmp() argument
1529 sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right) sort__transaction_cmp() argument
1612 sort__sym_size_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_size_cmp() argument
1651 sort__dso_size_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_size_cmp() argument
[all...]
/kernel/linux/linux-5.10/drivers/misc/cb710/
H A Dsgbuf2.c27 size_t len, left = 4; in sg_dwiter_read_buffer() local
32 len = min(miter->length - miter->consumed, left); in sg_dwiter_read_buffer()
35 left -= len; in sg_dwiter_read_buffer()
36 if (!left) in sg_dwiter_read_buffer()
41 memset(addr, 0, left); in sg_dwiter_read_buffer()
103 size_t len, left = 4; in sg_dwiter_write_slow() local
107 len = min(miter->length - miter->consumed, left); in sg_dwiter_write_slow()
110 left -= len; in sg_dwiter_write_slow()
111 if (!left) in sg_dwiter_write_slow()
/kernel/linux/linux-6.6/drivers/misc/cb710/
H A Dsgbuf2.c27 size_t len, left = 4; in sg_dwiter_read_buffer() local
32 len = min(miter->length - miter->consumed, left); in sg_dwiter_read_buffer()
35 left -= len; in sg_dwiter_read_buffer()
36 if (!left) in sg_dwiter_read_buffer()
41 memset(addr, 0, left); in sg_dwiter_read_buffer()
103 size_t len, left = 4; in sg_dwiter_write_slow() local
107 len = min(miter->length - miter->consumed, left); in sg_dwiter_write_slow()
110 left -= len; in sg_dwiter_write_slow()
111 if (!left) in sg_dwiter_write_slow()
/third_party/ltp/testcases/kernel/mem/thp/
H A Dthp01.c47 long left; member
60 while (bst->right - bst->left > 1) { in thp_test()
64 /* We set mid to left assuming exec will succeed. If in thp_test()
66 * restore left and set right to mid instead. in thp_test()
68 prev_left = bst->left; in thp_test()
69 bst->mid = (bst->left + bst->right) / 2; in thp_test()
70 bst->left = bst->mid; in thp_test()
76 bst->left = prev_left; in thp_test()
82 tst_res(TINFO, "left: %ld, right: %ld, mid: %ld", in thp_test()
83 bst->left, bs in thp_test()
[all...]
/third_party/python/Modules/
H A Drotatingtree.c35 root = &((*root)->left); in RotatingTree_Add()
39 node->left = NULL; in RotatingTree_Add()
57 node = node->left; in RotatingTree_Get()
75 next = node->left; in RotatingTree_Get()
79 node->left = next->right; in RotatingTree_Get()
84 pnode = &(node->left); in RotatingTree_Get()
91 node->right = next->left; in RotatingTree_Get()
92 next->left = node; in RotatingTree_Get()
113 result = RotatingTree_Enum(root->left, enumfn, arg); in RotatingTree_Enum()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_consume.cc43 // Unrefs the provided `concat`, and returns `{concat->left, concat->right}`
44 // Adds or assumes a reference on `concat->left` and `concat->right`.
45 // Returns an array of 2 elements containing the left and right nodes.
47 std::array<CordRep*, 2> result{concat->left, concat->right}; in ClipConcat()
71 CordRep* left = res[0]; in Consume() local
74 if (left->length <= offset) { in Consume()
75 // Don't need left node in Consume()
76 offset -= left->length; in Consume()
77 CordRep::Unref(left); in Consume()
82 size_t length_left = left in Consume()
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dexpand.c193 struct expression *left = expr->left, *right = expr->right; in simplify_int_binop() local
205 if (left->type != EXPR_VALUE) in simplify_int_binop()
207 l = left->value; r = right->value; in simplify_int_binop()
295 expr->taint = left->taint | right->taint; in simplify_int_binop()
309 struct expression *left = expr->left, *right = expr->right; in simplify_cmp_binop() local
313 if (left->type != EXPR_VALUE || right->type != EXPR_VALUE) in simplify_cmp_binop()
315 l = left->value; r = right->value; in simplify_cmp_binop()
335 expr->taint = left in simplify_cmp_binop()
341 struct expression *left = expr->left, *right = expr->right; simplify_float_binop() local
390 struct expression *left = expr->left, *right = expr->right; simplify_float_cmp() local
426 struct expression *left = expr->left; expand_logical() local
496 compare_types(int op, struct symbol *left, struct symbol *right) compare_types() argument
519 struct expression *left = expr->left, *right = expr->right; expand_compare() local
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_range_analysis.c301 /* left\right unknown lt_zero le_zero gt_zero ge_zero ne_zero eq_zero */ in union_ranges()
503 /* left\right unknown lt_zero le_zero gt_zero ge_zero ne_zero eq_zero */ in analyze_expression()
549 /* left\right unknown lt_zero le_zero gt_zero ge_zero ne_zero eq_zero */ in analyze_expression()
586 const struct ssa_result_range left = in analyze_expression() local
591 r.is_integral = left.is_integral && right.is_integral; in analyze_expression()
605 r.is_a_number = left.is_a_number && right.is_a_number; in analyze_expression()
606 r.is_finite = left.is_finite && right.is_finite; in analyze_expression()
608 r.range = union_ranges(left.range, right.range); in analyze_expression()
648 const struct ssa_result_range left = in analyze_expression() local
653 r.is_integral = left in analyze_expression()
690 const struct ssa_result_range left = analyze_expression() local
776 const struct ssa_result_range left = analyze_expression() local
863 const struct ssa_result_range left = analyze_expression() local
919 const struct ssa_result_range left = analyze_expression() local
968 const struct ssa_result_range left = analyze_expression() local
990 const struct ssa_result_range left = analyze_expression() local
1012 const struct ssa_result_range left = analyze_expression() local
1059 const struct ssa_result_range left = analyze_expression() local
1131 const struct ssa_result_range left = analyze_expression() local
[all...]
/third_party/openssl/test/testutil/
H A Dformat_output.c24 static void test_diff_header(const char *left, const char *right) in test_diff_header() argument
26 test_printf_stderr("--- %s\n", left); in test_diff_header()
41 const char *left, const char *right, in test_fail_string_common()
52 test_fail_message_prefix(prefix, file, line, type, left, right, op); in test_fail_string_common()
61 test_diff_header(left, right); in test_fail_string_common()
69 test_diff_header(left, right); in test_fail_string_common()
130 const char *left, const char *right, in test_fail_string_message()
134 test_fail_string_common(prefix, file, line, type, left, right, op, in test_fail_string_message()
268 const char *left, const char *right, in test_fail_bignum_common()
281 test_fail_message_prefix(prefix, file, line, type, left, righ in test_fail_bignum_common()
39 test_fail_string_common(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const char *m1, size_t l1, const char *m2, size_t l2) test_fail_string_common() argument
128 test_fail_string_message(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const char *m1, size_t l1, const char *m2, size_t l2) test_fail_string_message() argument
266 test_fail_bignum_common(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const BIGNUM *bn1, const BIGNUM *bn2) test_fail_bignum_common() argument
367 test_fail_bignum_message(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const BIGNUM *bn1, const BIGNUM *bn2) test_fail_bignum_message() argument
377 test_fail_bignum_mono_message(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const BIGNUM *bn) test_fail_bignum_mono_message() argument
424 test_fail_memory_common(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const unsigned char *m1, size_t l1, const unsigned char *m2, size_t l2) test_fail_memory_common() argument
519 test_fail_memory_message(const char *prefix, const char *file, int line, const char *type, const char *left, const char *right, const char *op, const unsigned char *m1, size_t l1, const unsigned char *m2, size_t l2) test_fail_memory_message() argument
[all...]
/kernel/linux/linux-5.10/lib/zlib_inflate/
H A Dinftrees.c32 int left; /* number of prefix codes available */ in zlib_inflate_table() local
117 left = 1; in zlib_inflate_table()
119 left <<= 1; in zlib_inflate_table()
120 left -= count[len]; in zlib_inflate_table()
121 if (left < 0) return -1; /* over-subscribed */ in zlib_inflate_table()
123 if (left > 0 && (type == CODES || max != 1)) in zlib_inflate_table()
256 left = (int)(1 << curr); in zlib_inflate_table()
258 left -= count[curr + drop]; in zlib_inflate_table()
259 if (left <= 0) break; in zlib_inflate_table()
261 left << in zlib_inflate_table()
[all...]
/kernel/linux/linux-6.6/lib/zlib_inflate/
H A Dinftrees.c32 int left; /* number of prefix codes available */ in zlib_inflate_table() local
117 left = 1; in zlib_inflate_table()
119 left <<= 1; in zlib_inflate_table()
120 left -= count[len]; in zlib_inflate_table()
121 if (left < 0) return -1; /* over-subscribed */ in zlib_inflate_table()
123 if (left > 0 && (type == CODES || max != 1)) in zlib_inflate_table()
256 left = (int)(1 << curr); in zlib_inflate_table()
258 left -= count[curr + drop]; in zlib_inflate_table()
259 if (left <= 0) break; in zlib_inflate_table()
261 left << in zlib_inflate_table()
[all...]
/third_party/lzma/CPP/7zip/UI/FileManager/
H A DSysIconUtils.cpp132 unsigned left = 0, right = vect.Size(); in FindInSorted_Attrib() local
133 while (left != right) in FindInSorted_Attrib()
135 const unsigned mid = (left + right) / 2; in FindInSorted_Attrib()
142 left = mid + 1; in FindInSorted_Attrib()
144 insertPos = left; in FindInSorted_Attrib()
150 unsigned left = 0, right = vect.Size(); in FindInSorted_Ext() local
151 while (left != right) in FindInSorted_Ext()
153 const unsigned mid = (left + right) / 2; in FindInSorted_Ext()
160 left = mid + 1; in FindInSorted_Ext()
162 insertPos = left; in FindInSorted_Ext()
[all...]
/third_party/node/deps/v8/third_party/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...]
/third_party/node/deps/zlib/
H A Dinftrees.c41 int left; /* number of prefix codes available */ in inflate_table() local
126 left = 1; in inflate_table()
128 left <<= 1; in inflate_table()
129 left -= count[len]; in inflate_table()
130 if (left < 0) return -1; /* over-subscribed */ in inflate_table()
132 if (left > 0 && (type == CODES || max != 1)) in inflate_table()
263 left = (int)(1 << curr); in inflate_table()
265 left -= count[curr + drop]; in inflate_table()
266 if (left <= 0) break; in inflate_table()
268 left << in inflate_table()
[all...]
/third_party/skia/third_party/externals/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...]

Completed in 20 milliseconds

12345678910>>...160