Searched refs:Int32LessThan (Results 1 – 15 of 15) sorted by relevance
| /external/v8/src/builtins/ |
| D | builtins-sharedarraybuffer.cc | 72 a->Branch(a->Int32LessThan(elements_instance_type, in ValidateSharedTypedArray()
148 a->Word32Or(a->Int32LessThan(index_word, a->Int32Constant(0)), in ValidateAtomicIndex()
|
| /external/v8/src/compiler/ |
| D | int64-lowering.cc | 510 LowerComparison(node, machine()->Int32LessThan(), in LowerNode()
515 LowerComparison(node, machine()->Int32LessThan(), in LowerNode()
686 graph()->NewNode(machine()->Int32LessThan(), masked_shift6, in LowerNode()
|
| D | simplified-lowering.cc | 2074 lowering->DoMax(node, lowering->machine()->Int32LessThan(), in VisitNode()
2100 lowering->DoMin(node, lowering->machine()->Int32LessThan(), in VisitNode()
3148 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs); in Int32Div()
3158 Node* check1 = graph()->NewNode(machine()->Int32LessThan(), rhs, minus_one); in Int32Div()
3226 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs); in Int32Mod()
3244 Node* check2 = graph()->NewNode(machine()->Int32LessThan(), lhs, zero); in Int32Mod()
3269 Node* check1 = graph()->NewNode(machine()->Int32LessThan(), rhs, minus_one); in Int32Mod()
3296 graph()->NewNode(machine()->Int32LessThan(), input, zero), minus_one, in Int32Sign()
3299 graph()->NewNode(machine()->Int32LessThan(), zero, input), one, in Int32Sign()
3500 graph()->NewNode(machine()->Int32LessThan(), input, min), in DoSigned32ToUint8Clamped()
|
| D | raw-machine-assembler.h | 300 Node* Int32LessThan(Node* a, Node* b) { in Int32LessThan() function
301 return AddNode(machine()->Int32LessThan(), a, b); in Int32LessThan()
321 Node* Int32GreaterThan(Node* a, Node* b) { return Int32LessThan(b, a); } in Int32GreaterThan()
|
| D | representation-change.cc | 801 return machine()->Int32LessThan(); in Int32OperatorFor()
832 return machine()->Is32() ? machine()->Int32LessThan() in TaggedSignedOperatorFor()
|
| D | graph-assembler.h | 51 V(Int32LessThan) \
|
| D | code-assembler.h | 58 V(Int32LessThan) \
|
| D | machine-operator.h | 258 const Operator* Int32LessThan(); in NON_EXPORTED_BASE()
|
| D | effect-control-linearizer.cc | 1274 Node* check0 = __ Int32LessThan(zero, rhs); in LowerCheckedInt32Div()
1371 Node* check1 = __ Int32LessThan(lhs, zero); in LowerCheckedInt32Mod()
1462 Node* check_or = __ Int32LessThan(__ Word32Or(lhs, rhs), zero); in LowerCheckedInt32Mul()
1518 Node* check_negative = __ Int32LessThan(__ Float64ExtractHighWord32(value), in BuildCheckedFloat64ToInt32()
|
| D | opcodes.h | 362 V(Int32LessThan) \
|
| D | wasm-compiler.cc | 578 op = m->Int32LessThan(); in Binop()
590 op = m->Int32LessThan(); in Binop()
2013 Node* check0 = graph()->NewNode(m->Int32LessThan(), zero, right); in BuildI32AsmjsRemS()
2031 Node* check2 = graph()->NewNode(m->Int32LessThan(), left, zero); in BuildI32AsmjsRemS()
2055 Node* check1 = graph()->NewNode(m->Int32LessThan(), right, minus_one); in BuildI32AsmjsRemS()
2432 machine->Int32LessThan(), in BuildChangeFloat64ToTagged()
|
| D | machine-operator.cc | 98 V(Int32LessThan, Operator::kNoProperties, 2, 0, 1) \
|
| D | machine-operator-reducer.cc | 874 graph()->NewNode(machine()->Int32LessThan(), dividend, zero), in ReduceInt32Mod()
|
| /external/v8/src/interpreter/ |
| D | interpreter-intrinsics.cc | 284 Node* comparison = __ Int32LessThan(target_args_count, __ Int32Constant(0)); in Call()
|
| /external/v8/src/ |
| D | code-stub-assembler.cc | 556 Branch(Int32LessThan(or_result, zero), &if_should_be_negative_zero, in SmiMul()
2551 Branch(Int32LessThan(Float64ExtractHighWord32(value), Int32Constant(0)), in ChangeFloat64ToTagged()
2879 return Int32LessThan(instance_type, Int32Constant(FIRST_NONSTRING_TYPE)); in IsStringInstanceType()
5786 GotoIf(Int32LessThan(int32_value, int32_zero), &done); in Int32ToUint8Clamped()
|