Home
last modified time | relevance | path

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

/third_party/node/deps/v8/src/compiler/
Dsimplified-lowering.cc4439 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberOrNumericTruncatesToFloat64() local
4457 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in DoJSToNumberOrNumericTruncatesToFloat64()
4538 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberOrNumericTruncatesToWord32() local
4553 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in DoJSToNumberOrNumericTruncatesToWord32()
4676 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Div() local
4677 Node* true1 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true1); in Int32Div()
4695 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Div()
4752 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Mod() local
4753 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1); in Int32Mod()
4776 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Mod()
[all …]
Djs-typed-lowering.cc1243 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSHasInPrototypeChain() local
1252 graph()->NewNode(common()->Branch(BranchHint::kTrue), check10, if_true1); in ReduceJSHasInPrototypeChain()
1255 if_true1 = graph()->NewNode(common()->IfTrue(), branch10); in ReduceJSHasInPrototypeChain()
1310 control = graph()->NewNode(common()->Merge(5), if_true0, if_true1, if_true2, in ReduceJSHasInPrototypeChain()
Djs-call-reducer.cc5900 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceArrayPrototypeShift() local
5906 receiver, etrue1, if_true1); in ReduceArrayPrototypeShift()
5912 elements, jsgraph()->ZeroConstant(), etrue1, if_true1); in ReduceArrayPrototypeShift()
5918 receiver, elements, etrue1, if_true1); in ReduceArrayPrototypeShift()
5922 Node* loop = graph()->NewNode(common()->Loop(2), if_true1, if_true1); in ReduceArrayPrototypeShift()
5938 if_true1 = graph()->NewNode(common()->IfFalse(), branch2); in ReduceArrayPrototypeShift()
5984 new_length, length, etrue1, if_true1); in ReduceArrayPrototypeShift()
5989 receiver, new_length, etrue1, if_true1); in ReduceArrayPrototypeShift()
5996 if_true1); in ReduceArrayPrototypeShift()
6023 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in ReduceArrayPrototypeShift()
Dwasm-compiler.cc2814 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS() local
2815 Node* true1 = graph()->NewNode(m->Int32Mod(), left, right, if_true1); in BuildI32AsmjsRemS()
2837 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildI32AsmjsRemS()
2848 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS() local
2849 Node* true1 = graph()->NewNode(m->Int32Mod(), left, right, if_true1); in BuildI32AsmjsRemS()
2854 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildI32AsmjsRemS()