Home
last modified time | relevance | path

Searched refs:if_true1 (Results 1 – 4 of 4) sorted by relevance

/external/v8/src/compiler/
Dsimplified-lowering.cc3351 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberOrNumericTruncatesToFloat64() local
3369 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in DoJSToNumberOrNumericTruncatesToFloat64()
3450 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberOrNumericTruncatesToWord32() local
3465 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in DoJSToNumberOrNumericTruncatesToWord32()
3588 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Div() local
3589 Node* true1 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true1); in Int32Div()
3607 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Div()
3664 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Mod() local
3665 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1); in Int32Mod()
3688 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Mod()
[all …]
Djs-typed-lowering.cc1234 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSHasInPrototypeChain() local
1243 graph()->NewNode(common()->Branch(BranchHint::kTrue), check10, if_true1); in ReduceJSHasInPrototypeChain()
1246 if_true1 = graph()->NewNode(common()->IfTrue(), branch10); in ReduceJSHasInPrototypeChain()
1301 control = graph()->NewNode(common()->Merge(5), if_true0, if_true1, if_true2, in ReduceJSHasInPrototypeChain()
Djs-call-reducer.cc4649 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceArrayPrototypeShift() local
4655 receiver, etrue1, if_true1); in ReduceArrayPrototypeShift()
4660 elements, jsgraph()->ZeroConstant(), etrue1, if_true1); in ReduceArrayPrototypeShift()
4666 receiver, elements, etrue1, if_true1); in ReduceArrayPrototypeShift()
4670 Node* loop = graph()->NewNode(common()->Loop(2), if_true1, if_true1); in ReduceArrayPrototypeShift()
4685 if_true1 = graph()->NewNode(common()->IfFalse(), branch2); in ReduceArrayPrototypeShift()
4715 receiver, length, etrue1, if_true1); in ReduceArrayPrototypeShift()
4721 elements, length, jsgraph()->TheHoleConstant(), etrue1, if_true1); in ReduceArrayPrototypeShift()
4748 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in ReduceArrayPrototypeShift()
Dwasm-compiler.cc2321 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS() local
2322 Node* true1 = graph()->NewNode(m->Int32Mod(), left, right, if_true1); in BuildI32AsmjsRemS()
2344 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildI32AsmjsRemS()
2355 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS() local
2356 Node* true1 = graph()->NewNode(m->Int32Mod(), left, right, if_true1); in BuildI32AsmjsRemS()
2361 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildI32AsmjsRemS()