Home
last modified time | relevance | path

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

12345678910>>...55

/third_party/toybox/kconfig/
H A Dexpr.c39 e->right.expr = e2; in expr_alloc_two()
49 e->right.sym = s2; in expr_alloc_comp()
86 e->right.sym = org->right.sym; in expr_copy()
92 e->right.expr = expr_copy(org->right.expr); in expr_copy()
121 expr_free(e->right.expr); in expr_free()
139 __expr_eliminate_eq(type, &e1->right.expr, &e2); in __expr_eliminate_eq()
144 __expr_eliminate_eq(type, &e1, &e2->right.expr); in __expr_eliminate_eq()
203 return e1->left.sym == e2->left.sym && e1->right in expr_eq()
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dmachine-operator-reducer.cc339 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
342 m.left().ResolvedValue(), m.right().ResolvedValue() & 31)); in Reduce()
353 m.right().ResolvedValue()); in Reduce()
355 if (m.left().IsInt64Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
358 node->ReplaceInput(1, msub.right().node()); in Reduce()
365 if (!ObjectsMayAlias(m.left().node(), m.right().node())) { in Reduce()
380 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0 in Reduce()
381 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x in Reduce()
384 m.right() in Reduce()
1398 uint32_t right = m.right().ResolvedValue(); ReduceWord32Comparisons() local
[all...]
H A Dnode-matchers.h287 // right hand sides of a binary operation and can put constants on the right
304 const Right& right() const { return right_; } in right() function
307 return left().HasResolvedValue() && right().HasResolvedValue(); in IsFoldable()
309 bool LeftEqualsRight() const { return left().node() == right().node(); } in LeftEqualsRight()
327 node()->ReplaceInput(1, right().node()); in SwapInputs()
332 if (left().HasResolvedValue() && !right().HasResolvedValue()) { in PutConstantOnRight()
363 if (m.right().HasResolvedValue()) { in ScaleMatcher()
365 m.right().ResolvedValue(); in ScaleMatcher()
371 if (m.right() in ScaleMatcher()
556 Node* right = m.right().node(); Initialize() local
[all...]
/third_party/gn/src/gn/
H A Doperators.cc227 const Value& right) { in MakeIncompatibleTypeError()
231 Value::DescribeType(right.type()) + ">."; in MakeIncompatibleTypeError()
308 Value right, in ExecuteEquals()
317 if (old_value->type() == Value::LIST && right.type() == Value::LIST && in ExecuteEquals()
318 !old_value->list_value().empty() && !right.list_value().empty()) { in ExecuteEquals()
322 right.type() == Value::SCOPE && in ExecuteEquals()
324 right.scope_value()->HasValues(Scope::SEARCH_CURRENT)) { in ExecuteEquals()
330 dest->SetValue(std::move(right), op_node->right()); in ExecuteEquals()
340 Value right, in ExecutePlus()
225 MakeIncompatibleTypeError(const BinaryOpNode* op_node, const Value& left, const Value& right) MakeIncompatibleTypeError() argument
305 ExecuteEquals(Scope* exec_scope, const BinaryOpNode* op_node, ValueDestination* dest, Value right, Err* err) ExecuteEquals() argument
338 ExecutePlus(const BinaryOpNode* op_node, Value left, Value right, bool allow_left_type_conversion, Err* err) ExecutePlus() argument
389 ExecuteMinus(const BinaryOpNode* op_node, Value left, const Value& right, Err* err) ExecuteMinus() argument
412 ExecutePlusEquals(Scope* exec_scope, const BinaryOpNode* op_node, ValueDestination* dest, Value right, Err* err) ExecutePlusEquals() argument
485 ExecuteMinusEquals(const BinaryOpNode* op_node, ValueDestination* dest, const Value& right, Err* err) ExecuteMinusEquals() argument
513 ExecuteEqualsEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteEqualsEquals() argument
523 ExecuteNotEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteNotEquals() argument
534 FillNeedsTwoIntegersError(const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) FillNeedsTwoIntegersError() argument
545 ExecuteLessEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteLessEquals() argument
555 ExecuteGreaterEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteGreaterEquals() argument
565 ExecuteGreater(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteGreater() argument
575 ExecuteLess(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteLess() argument
666 ExecuteBinaryOperator(Scope* scope, const BinaryOpNode* op_node, const ParseNode* left, const ParseNode* right, Err* err) ExecuteBinaryOperator() argument
[all...]
/third_party/skia/src/core/
H A DSkStringView.cpp13 bool operator==(string_view left, string_view right) { in operator ==() argument
14 if (left.length() != right.length()) { in operator ==()
17 return !string_view::traits_type::compare(left.data(), right.data(), left.length()); in operator ==()
20 bool operator!=(string_view left, string_view right) { in operator !=() argument
21 return !(left == right); in operator !=()
24 bool operator<(string_view left, string_view right) { in operator <() argument
25 int result = string_view::traits_type::compare(left.data(), right.data(), in operator <()
26 std::min(left.length(), right.length())); in operator <()
28 result = left.length() - right.length(); in operator <()
33 bool operator<=(string_view left, string_view right) { in operator <=() argument
37 operator >(string_view left, string_view right) operator >() argument
41 operator >=(string_view left, string_view right) operator >=() argument
[all...]
H A DSkScalar.cpp22 int right = 0; in SkScalarInterpFunc() local
23 while (right < length && keys[right] < searchKey) { in SkScalarInterpFunc()
24 ++right; in SkScalarInterpFunc()
28 if (right == length) { in SkScalarInterpFunc()
31 if (right == 0) { in SkScalarInterpFunc()
34 // Otherwise, interpolate between right - 1 and right. in SkScalarInterpFunc()
35 SkScalar leftKey = keys[right-1]; in SkScalarInterpFunc()
36 SkScalar rightKey = keys[right]; in SkScalarInterpFunc()
[all...]
/third_party/skia/src/sksl/
H A DSkSLConstantFolder.cpp31 const Expression& right) { in eliminate_no_op_boolean()
32 bool rightVal = right.as<Literal>().boolValue(); in eliminate_no_op_boolean()
49 const Expression& right) { in short_circuit_boolean()
59 // We can't eliminate the right-side expression via short-circuit, but we might still be able to in short_circuit_boolean()
61 return eliminate_no_op_boolean(right, op, left); in short_circuit_boolean()
67 const Expression& right) { in simplify_vector_equality()
71 switch (left.compareConstant(right)) { in simplify_vector_equality()
89 const Expression& right) { in simplify_vector()
91 SkASSERT(left.type() == right.type()); in simplify_vector()
95 if (std::unique_ptr<Expression> result = simplify_vector_equality(context, left, op, right)) { in simplify_vector()
29 eliminate_no_op_boolean(const Expression& left, Operator op, const Expression& right) eliminate_no_op_boolean() argument
47 short_circuit_boolean(const Expression& left, Operator op, const Expression& right) short_circuit_boolean() argument
64 simplify_vector_equality(const Context& context, const Expression& left, Operator op, const Expression& right) simplify_vector_equality() argument
86 simplify_vector(const Context& context, const Expression& left, Operator op, const Expression& right) simplify_vector() argument
179 error_on_divide_by_zero(const Context& context, int line, Operator op, const Expression& right) error_on_divide_by_zero() argument
231 simplify_no_op_arithmetic(const Context& context, const Expression& left, Operator op, const Expression& right, const Type& resultType) simplify_no_op_arithmetic() argument
341 const Expression* right = GetConstantValueForVariable(rightExpr); Simplify() local
[all...]
H A DSkSLOperators.cpp233 bool Operator::isMatrixMultiply(const Type& left, const Type& right) { in isMatrixMultiply() argument
238 return right.isMatrix() || right.isVector(); in isMatrixMultiply()
240 return left.isVector() && right.isMatrix(); in isMatrixMultiply()
249 const Type& right, in determineBinaryType()
255 case Token::Kind::TK_EQ: // left = right in determineBinaryType()
259 return right.canCoerceTo(left, allowNarrowing); in determineBinaryType()
261 case Token::Kind::TK_EQEQ: // left == right in determineBinaryType()
262 case Token::Kind::TK_NEQ: { // left != right in determineBinaryType()
263 CoercionCost rightToLeft = right in determineBinaryType()
247 determineBinaryType(const Context& context, const Type& left, const Type& right, const Type** outLeftType, const Type** outRightType, const Type** outResultType) determineBinaryType() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp43 const SUnit *pickBest(const SUnit *left, const SUnit *right);
93 // scheduled right before its predecessors that it doesn't lengthen in getNodePriority()
131 // Return -1 if left has higher priority, 1 if right has higher priority.
133 static int BUCompareLatency(const SUnit *left, const SUnit *right) { in BUCompareLatency() argument
137 int RHeight = (int)right->getHeight(); in BUCompareLatency()
150 int RDepth = right->getDepth(); in BUCompareLatency()
153 << ") depth " << LDepth << " vs SU (" << right->NodeNum in BUCompareLatency()
157 if (left->Latency != right->Latency) in BUCompareLatency()
158 return left->Latency > right->Latency ? 1 : -1; in BUCompareLatency()
163 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) in pickBest() argument
[all...]
/third_party/skia/include/sksl/
H A DDSLExpression.h175 DSLPossibleExpression operator+(DSLExpression left, DSLExpression right);
177 DSLPossibleExpression operator+=(DSLExpression left, DSLExpression right);
178 DSLPossibleExpression operator-(DSLExpression left, DSLExpression right);
180 DSLPossibleExpression operator-=(DSLExpression left, DSLExpression right);
181 DSLPossibleExpression operator*(DSLExpression left, DSLExpression right);
182 DSLPossibleExpression operator*=(DSLExpression left, DSLExpression right);
183 DSLPossibleExpression operator/(DSLExpression left, DSLExpression right);
184 DSLPossibleExpression operator/=(DSLExpression left, DSLExpression right);
185 DSLPossibleExpression operator%(DSLExpression left, DSLExpression right);
186 DSLPossibleExpression operator%=(DSLExpression left, DSLExpression right);
[all...]
/third_party/mesa3d/src/util/
H A Drb_tree.c90 while (node->right) in rb_node_maximum()
91 node = node->right; in rb_node_maximum()
119 assert(u == p->right); in rb_tree_splice()
120 p->right = v; in rb_tree_splice()
129 assert(x && x->right); in rb_tree_rotate_left()
131 struct rb_node *y = x->right; in rb_tree_rotate_left()
132 x->right = y->left; in rb_tree_rotate_left()
146 y->left = x->right; in rb_tree_rotate_right()
147 if (x->right) in rb_tree_rotate_right()
148 rb_node_set_parent(x->right, in rb_tree_rotate_right()
[all...]
/third_party/skia/src/sksl/ir/
H A DSkSLBinaryExpression.cpp25 const Expression& right, in is_low_precision_matrix_vector_multiply()
30 right.type().isVector() && in is_low_precision_matrix_vector_multiply()
31 left.type().rows() == right.type().columns() && in is_low_precision_matrix_vector_multiply()
33 Analysis::IsTrivialExpression(right); in is_low_precision_matrix_vector_multiply()
39 const Expression& right, in rewrite_matrix_vector_multiply()
49 context, right.clone(), ComponentArray{(SkSL::SwizzleComponent::Type)n}); in rewrite_matrix_vector_multiply()
72 std::unique_ptr<Expression> right) { in Convert()
73 if (!left || !right) { in Convert()
78 const Type* rawLeftType = (left->isIntLiteral() && right->type().isInteger()) in Convert()
79 ? &right in Convert()
23 is_low_precision_matrix_vector_multiply(const Expression& left, const Operator& op, const Expression& right, const Type& resultType) is_low_precision_matrix_vector_multiply() argument
36 rewrite_matrix_vector_multiply(const Context& context, const Expression& left, const Operator& op, const Expression& right, const Type& resultType) rewrite_matrix_vector_multiply() argument
69 Convert(const Context& context, std::unique_ptr<Expression> left, Operator op, std::unique_ptr<Expression> right) Convert() argument
136 Make(const Context& context, std::unique_ptr<Expression> left, Operator op, std::unique_ptr<Expression> right) Make() argument
150 Make(const Context& context, std::unique_ptr<Expression> left, Operator op, std::unique_ptr<Expression> right, const Type* resultType) Make() argument
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DRopeByteString.java135 private final ByteString right; field in RopeByteString
144 * @param right string on the right of this node, should have {@code size() > 0}
146 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
148 this.right = right; in RopeByteString()
150 totalLength = leftLength + right.size(); in RopeByteString()
151 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
164 * @param right string on the right
167 concatenate(ByteString left, ByteString right) concatenate() argument
230 concatenateBytes(ByteString left, ByteString right) concatenateBytes() argument
249 newInstanceForTest(ByteString left, ByteString right) newInstanceForTest() argument
629 balance(ByteString left, ByteString right) balance() argument
[all...]
/third_party/f2fs-tools/fsck/
H A Ddict.c52 #define right dict_right macro
78 * its right child C are rearranged so that the P instead becomes the left
79 * child of C. The left subtree of C is inherited as the new right subtree
86 lower = upper->right; in rotate_left()
87 upper->right = lowleft = lower->left; in rotate_left()
98 dict_assert(upper == upparent->right); in rotate_left()
99 upparent->right = lower; in rotate_left()
108 * the same procedure, but with left and right interchanged.
115 upper->left = lowright = lower->right; in rotate_right()
120 if (upper == upparent->right) { in rotate_right()
411 dict_similar(const dict_t *left, const dict_t *right) dict_similar() argument
854 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; dict_last() local
896 dnode_t *nil = dict_nil(dict), *parent, *right; dict_prev() local
[all...]
/third_party/ffmpeg/libavcodec/alpha/
H A Dme_cmp_mvi_asm.S67 t2: right_u -> right hi -> right
69 t4: ref right
73 t7: right_u -> right hi -> right
75 t9: ref right
78 tb: right lo
80 td: error right */
87 ldq t4, 8(a1) # ref right
95 ldq t9, 8(a1) # ref right
[all...]
/third_party/cups-filters/filter/pdftopdf/
H A Dpptypes.cc79 std::swap(left,right); in rotate_move()
85 top=right; in rotate_move()
86 right=tmp; in rotate_move()
93 right=pwidth-right; in rotate_move()
107 top=right; in rotate_move()
108 right=pheight-tmp0; in rotate_move()
114 left=pwidth-right; in rotate_move()
115 right=pwidth-tmp1; in rotate_move()
125 bottom=pwidth-right; in rotate_move()
[all...]
/third_party/icu/icu4c/source/common/
H A Duarrsort.cpp46 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
48 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
52 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
54 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
58 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
60 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
172 int32_t left, right; in subQuickSort() local
174 /* start and left are inclusive, limit and right are exclusive */ in subQuickSort()
182 right=limit; in subQuickSort()
193 while(/* x<array[right in subQuickSort()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Duarrsort.cpp46 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
48 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
52 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
54 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
58 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
60 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
172 int32_t left, right; in subQuickSort() local
174 /* start and left are inclusive, limit and right are exclusive */ in subQuickSort()
182 right=limit; in subQuickSort()
193 while(/* x<array[right in subQuickSort()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Duarrsort.cpp46 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
48 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
52 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
54 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
58 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
60 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
172 int32_t left, right; in subQuickSort() local
174 /* start and left are inclusive, limit and right are exclusive */ in subQuickSort()
182 right=limit; in subQuickSort()
193 while(/* x<array[right in subQuickSort()
[all...]
/third_party/glslang/glslang/Include/
H A DTypes.h212 bool operator==(const TSampler& right) const in operator ==()
214 return type == right.type && in operator ==()
215 dim == right.dim && in operator ==()
216 arrayed == right.arrayed && in operator ==()
217 shadow == right.shadow && in operator ==()
218 isMultiSample() == right.isMultiSample() && in operator ==()
219 isImageClass() == right.isImageClass() && in operator ==()
220 isCombined() == right.isCombined() && in operator ==()
221 isPureSampler() == right.isPureSampler() && in operator ==()
222 isExternal() == right in operator ==()
[all...]
/third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/
H A DTrans.java93 int right = -1; in trans()
95 right = line.indexOf('>'); in trans()
96 if (right < 0) { in trans()
97 right = line.length()-1; in trans()
99 buf.append(line.substring(0, right+1)); in trans()
100 if (DEBUG) System.out.println("*S:" + line.substring(0, right+1)); in trans()
104 int left = line.indexOf('<', right+1); in trans()
106 if (right < line.length()-1) { in trans()
107 buf.append(trans.transliterate(line.substring(right+1))); in trans()
108 if (DEBUG) System.out.println("T:" + line.substring(right in trans()
[all...]
/third_party/vulkan-loader/loader/
H A Dloader_linux.c77 struct LinuxSortedDeviceInfo *right = (struct LinuxSortedDeviceInfo *)b; in compare_devices() local
82 } else if (right->default_device) { in compare_devices()
87 int32_t dev_type_comp = device_type_compare(left->device_type, right->device_type); in compare_devices()
93 if (left->has_pci_bus_info && !right->has_pci_bus_info) { in compare_devices()
95 } else if (!left->has_pci_bus_info && right->has_pci_bus_info) { in compare_devices()
97 } else if (left->has_pci_bus_info && right->has_pci_bus_info) { in compare_devices()
99 if (left->pci_domain < right->pci_domain) { in compare_devices()
101 } else if (left->pci_domain > right->pci_domain) { in compare_devices()
105 if (left->pci_bus < right->pci_bus) { in compare_devices()
107 } else if (left->pci_bus > right in compare_devices()
148 struct LinuxSortedDeviceInfo *right = &grp_b->internal_device_info[0]; compare_device_groups() local
[all...]
/third_party/node/deps/v8/src/ic/
H A Dbinary-op-assembler.h25 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right,
30 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right,
35 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right,
58 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_BitwiseOrWithFeedback()
62 Operation::kBitwiseOr, left, right, context, slot, in Generate_BitwiseOrWithFeedback()
68 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_BitwiseXorWithFeedback()
72 Operation::kBitwiseXor, left, right, context, slot, in Generate_BitwiseXorWithFeedback()
79 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_BitwiseAndWithFeedback()
83 Operation::kBitwiseAnd, left, right, context, slot, in Generate_BitwiseAndWithFeedback()
90 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_ShiftLeftWithFeedback()
57 Generate_BitwiseOrWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseOrWithFeedback() argument
67 Generate_BitwiseXorWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseXorWithFeedback() argument
78 Generate_BitwiseAndWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseAndWithFeedback() argument
89 Generate_ShiftLeftWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ShiftLeftWithFeedback() argument
100 Generate_ShiftRightWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ShiftRightWithFeedback() argument
111 Generate_ShiftRightLogicalWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ShiftRightLogicalWithFeedback() argument
122 Generate_BitwiseBinaryOpWithFeedback( Operation bitwise_op, TNode<Object> left, TNode<Object> right, const LazyNode<Context>& context, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseBinaryOpWithFeedback() argument
136 Generate_BitwiseBinaryOp(Operation bitwise_op, TNode<Object> left, TNode<Object> right, TNode<Context> context) Generate_BitwiseBinaryOp() argument
[all...]
/third_party/lzma/CPP/Common/
H A DMyVector.h285 int FindInSorted(const T item, unsigned left, unsigned right) const in FindInSorted()
287 while (left != right) in FindInSorted()
289 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2); in FindInSorted()
290 const unsigned mid = (left + right) / 2; in FindInSorted()
295 right = mid; in FindInSorted()
302 int FindInSorted2(const T &item, unsigned left, unsigned right) const in FindInSorted2()
304 while (left != right) in FindInSorted2()
306 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2); in FindInSorted2()
307 const unsigned mid = (left + right) / 2; in FindInSorted2()
313 right in FindInSorted2()
332 unsigned left = 0, right = _size; AddToUniqueSorted() local
351 unsigned left = 0, right = _size; AddToUniqueSorted2() local
637 unsigned left = 0, right = Size(); FindInSorted() local
656 unsigned left = 0, right = Size(); AddToUniqueSorted() local
[all...]
/third_party/libuv/src/
H A Dheap-inl.h30 struct heap_node* right; member
86 sibling = child->right; in heap_node_swap()
88 child->right = parent; in heap_node_swap()
96 if (parent->right != NULL) in heap_node_swap()
97 parent->right->parent = parent; in heap_node_swap()
104 child->parent->right = child; in heap_node_swap()
117 newnode->right = NULL; in HEAP_EXPORT()
132 child = &(*child)->right; in HEAP_EXPORT()
175 max = &(*max)->right; in HEAP_EXPORT()
204 child->right in HEAP_EXPORT()
[all...]

Completed in 29 milliseconds

12345678910>>...55