Home
last modified time | relevance | path

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

/external/v8/src/compiler/
Dsimplified-lowering.cc2880 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in DoJSToNumberTruncatesToFloat64() local
2886 efalse1, if_false1); in DoJSToNumberTruncatesToFloat64()
2889 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in DoJSToNumberTruncatesToFloat64()
2957 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in DoJSToNumberTruncatesToWord32() local
2963 efalse1, if_false1); in DoJSToNumberTruncatesToWord32()
2967 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in DoJSToNumberTruncatesToWord32()
3164 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in Int32Div() local
3168 Node* branch2 = graph()->NewNode(common()->Branch(), check2, if_false1); in Int32Div()
3176 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2); in Int32Div()
3177 false1 = graph()->NewNode(phi_op, true2, false2, if_false1); in Int32Div()
[all …]
Djs-builtin-reducer.cc452 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceFastArrayIteratorNext() local
459 iterator, vfalse1, efalse1, if_false1); in ReduceFastArrayIteratorNext()
462 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in ReduceFastArrayIteratorNext()
1897 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceStringIteratorNext() local
1899 if_true0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in ReduceStringIteratorNext()
Djs-typed-lowering.cc1534 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch10); in ReduceJSOrdinaryHasInstance() local
1541 prototype, context, frame_state, efalse1, if_false1); in ReduceJSOrdinaryHasInstance()
1542 if_false1 = graph()->NewNode(common()->IfSuccess(), vfalse1); in ReduceJSOrdinaryHasInstance()
1587 if_true3, if_false1); in ReduceJSOrdinaryHasInstance()
1814 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceJSConvertReceiver() local
1820 graph()->NewNode(common()->Branch(BranchHint::kFalse), check2, if_false1); in ReduceJSConvertReceiver()
Dwasm-compiler.cc2028 Node* if_false1 = graph()->NewNode(c->IfFalse(), branch1); in BuildI32AsmjsRemS() local
2033 graph()->NewNode(c->Branch(BranchHint::kFalse), check2, if_false1); in BuildI32AsmjsRemS()
2044 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2); in BuildI32AsmjsRemS()
2045 false1 = graph()->NewNode(phi_op, true2, false2, if_false1); in BuildI32AsmjsRemS()
2048 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildI32AsmjsRemS()
2062 Node* if_false1 = graph()->NewNode(c->IfFalse(), branch1); in BuildI32AsmjsRemS() local
2065 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildI32AsmjsRemS()
2565 Node* if_false1 = graph()->NewNode(common->IfFalse(), branch1); in BuildChangeTaggedToFloat64() local
2569 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildChangeTaggedToFloat64()