| /external/v8/test/unittests/compiler/ |
| branch-elimination-unittest.cc | 174 graph()->NewNode(common()->EffectPhi(1), graph()->start(), loop);
186 NodeProperties::ChangeOp(effect, common()->EffectPhi(2));
191 Node* outer_ephi = graph()->NewNode(common()->EffectPhi(2), effect,
|
| dead-code-elimination-unittest.cc | 195 Node* const ephi = graph()->NewNode(common()->EffectPhi(2), e0, e1, merge);
223 graph()->NewNode(common()->EffectPhi(4), e0, e1, e2, e3, merge);
280 Node* const ephi = graph()->NewNode(common()->EffectPhi(2), e0, e1, loop);
310 graph()->NewNode(common()->EffectPhi(4), e0, e1, e2, e3, loop);
345 // EffectPhi
356 common()->EffectPhi(input_count), input_count + 1, inputs));
|
| node-properties-unittest.cc | 50 Node* use_effect = NewMockNode(common.EffectPhi(1), node);
|
| common-operator-reducer-unittest.cc | 229 // EffectPhi
250 Reduce(&editor, graph()->NewNode(common()->EffectPhi(value_input_count),
263 Node* const ephi = graph()->NewNode(common()->EffectPhi(2), e0, e0, loop);
447 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge);
|
| escape-analysis-unittest.cc | 268 Node* phi = graph()->NewNode(common()->EffectPhi(2), effect1, effect2, merge);
|
| scheduler-unittest.cc | 750 Node* ephi1 = graph()->NewNode(common()->EffectPhi(2), start, map, m);
[all...] |
| graph-reducer-unittest.cc | 312 Node* use_effect = graph()->NewNode(common.EffectPhi(1), node, use_control);
|
| /external/v8/src/compiler/ |
| common-operator.h | 163 const Operator* EffectPhi(int effect_input_count);
|
| js-intrinsic-lowering.cc | 223 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge);
265 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
309 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
357 const Operator* const ephi_op = common()->EffectPhi(2);
|
| wasm-compiler.h | 78 Node* EffectPhi(unsigned count, Node** effects, Node* control);
|
| js-native-context-specialization.cc | 89 // Merge++Phi+EffectPhi at the bottom.
173 // Create dominating Merge+EffectPhi for this {receiver} type.
185 : graph()->NewNode(common()->EffectPhi(this_control_count),
438 effect = graph()->NewNode(common()->EffectPhi(control_count),
517 // Merge+Phi+EffectPhi at the bottom.
622 graph()->NewNode(common()->EffectPhi(this_control_count),
[all...] |
| loop-peeling.cc | 321 Node* effect_phi = graph->NewNode(common->EffectPhi(2), node,
|
| js-typed-lowering.cc | 390 graph()->NewNode(common()->EffectPhi(2), left_exception,
[all...] |
| js-generic-lowering.cc | 708 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_true0);
739 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
[all...] |
| opcodes.h | 46 V(EffectPhi) \
|
| common-operator.cc | 329 "EffectPhi", // name
701 const Operator* CommonOperatorBuilder::EffectPhi(int effect_input_count) {
715 "EffectPhi", // name
854 return EffectPhi(size);
|
| js-inlining.cc | 229 jsgraph_->common()->EffectPhi(input_count),
|
| wasm-compiler.cc | 198 graph()->NewNode(common()->EffectPhi(1), *effect_ptr, *control_ptr);
355 Node* WasmGraphBuilder::EffectPhi(unsigned count, Node** effects,
361 return graph()->NewNode(jsgraph()->common()->EffectPhi(count), count + 1,
[all...] |
| change-lowering.cc | 333 const Operator* ephi_op = common()->EffectPhi(2);
|
| bytecode-graph-builder.cc | [all...] |
| simplified-lowering.cc | [all...] |
| ast-graph-builder.cc | [all...] |
| /external/v8/test/cctest/compiler/ |
| test-loop-analysis.cc | 90 Node* EffectPhi(Node* a) {
94 Node* EffectPhi(Node* a, Node* b) {
98 Node* EffectPhi(Node* a, Node* b, Node* c) {
102 Node* EffectPhi(Node* a, Node* b, Node* c, Node* d) {
114 return effect ? common.EffectPhi(count)
|
| test-js-typed-lowering.cc | 166 // TODO(titzer): use EffectPhi after fixing EffectCount
745 effect_use = R.graph.NewNode(R.common.EffectPhi(1), ton, R.start());
791 effect_use(R.graph.NewNode(R.common.EffectPhi(1), binop, R.start())) {
[all...] |
| /external/v8/src/wasm/ |
| ast-decoder.cc | [all...] |
