Home
last modified time | relevance | path

Searched refs:EffectPhi (Results 1 - 24 of 24) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Ddiamond.h56 Node* EffectPhi(Node* tv, Node* fv) { in EffectPhi() function
57 return graph->NewNode(common->EffectPhi(2), tv, fv, merge); in EffectPhi()
H A Dwasm-loop-peeling.cc72 ? common->EffectPhi(2) in PeelWasmLoop()
H A Draw-machine-assembler.cc256 graph()->NewNode(common()->EffectPhi(2), graph()->start(), in MakeReschedulable()
286 common()->EffectPhi(predecessor_count), in MakeReschedulable()
358 loop_entries, block_final_effect, common()->EffectPhi(entrance_count), in MakeReschedulable()
361 loop_backedges, block_final_effect, common()->EffectPhi(backedge_count), in MakeReschedulable()
H A Dloop-peeling.cc209 NodeProperties::ChangeOp(exit, common_->EffectPhi(2)); in Peel()
H A Dloop-unrolling.cc85 // {use}: EffectPhi (stack check effect that we need to replace) in UnrollLoop()
120 phi_operator = common->EffectPhi(iteration_count); in UnrollLoop()
H A Dwasm-inlining.cc451 Node* effect_output = graph()->NewNode(common()->EffectPhi(handler_count), in InlineCall()
474 graph()->NewNode(common()->EffectPhi(return_count), in InlineCall()
H A Djs-native-context-specialization.cc1191 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceNamedAccess()
1220 // Merge+Phi+EffectPhi at the bottom. in ReduceNamedAccess()
1301 this_effect = graph()->NewNode(common()->EffectPhi(2), this_effect, in ReduceNamedAccess()
1370 effect = graph()->NewNode(common()->EffectPhi(control_count), in ReduceNamedAccess()
1384 graph()->NewNode(common()->EffectPhi(if_exception_count), in ReduceNamedAccess()
1493 Node* effect_phi = graph()->NewNode(common()->EffectPhi(2), dead_node, in ReduceJSGetIterator()
1760 // Merge+Phi+EffectPhi at the bottom. in ReduceElementAccess()
1844 effect = graph()->NewNode(common()->EffectPhi(control_count), in ReduceElementAccess()
2798 graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in BuildElementAccess()
2867 graph()->NewNode(common()->EffectPhi( in BuildElementAccess()
[all...]
H A Djs-call-reducer.cc411 Node* ephi = gasm_->graph()->NewNode(gasm_->common()->EffectPhi(size), in MergeExceptionalPaths()
2671 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception0,
2681 effect = graph()->NewNode(common()->EffectPhi(2), effect0, effect1, control);
3197 graph()->NewNode(common()->EffectPhi(2), extrue, exfalse, merge);
3263 graph()->NewNode(common()->EffectPhi(2), extrue, exfalse, merge);
3945 Node* ephi = graph()->NewNode(common()->EffectPhi(2), if_exception,
5381 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
5433 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control);
5668 effect = graph()->NewNode(common()->EffectPhi(count), count + 1,
5790 effect = graph()->NewNode(common()->EffectPhi(
[all...]
H A Dgraph-assembler.h594 label->effect_ = graph()->NewNode(common()->EffectPhi(2), effect(), in MergeState()
628 label->effect_ = graph()->NewNode(common()->EffectPhi(2), label->effect_, in MergeState()
646 common()->EffectPhi(merged_count + 1)); in MergeState()
H A Djs-inlining.cc194 graph()->NewNode(common()->EffectPhi(subcall_count), in InlineCall()
239 graph()->NewNode(common()->EffectPhi(input_count), in InlineCall()
H A Djs-inlining-heuristic.cc431 // Phi(callee) EffectPhi(effect_phi) | in TryReuseDispatch()
498 // EffectPhi in TryReuseDispatch()
748 Node* exception_effect = graph()->NewNode(common()->EffectPhi(num_calls), in InlineCandidate()
762 graph()->NewNode(common()->EffectPhi(num_calls), num_calls + 1, calls); in InlineCandidate()
H A Djs-typed-lowering.cc1159 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceJSToObject()
1218 graph()->NewNode(common()->EffectPhi(2), effect, effect, loop); in ReduceJSHasInPrototypeChain()
1312 effect = graph()->NewNode(common()->EffectPhi(5), etrue0, etrue1, etrue2, in ReduceJSHasInPrototypeChain()
1937 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceJSForInNext()
2041 effect = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, control); in ReduceJSForInPrepare()
2312 effect = graph()->NewNode(common()->EffectPhi(count), count + 1, effects); in ReduceObjectIsArray()
H A Dcommon-operator.h527 const Operator* EffectPhi(int effect_input_count);
H A Djs-intrinsic-lowering.cc269 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge); in ReduceIsInstanceType()
H A Dwasm-compiler.cc670 Node* WasmGraphBuilder::EffectPhi(unsigned count, Node** effects_and_control) { in EffectPhi() function in v8::internal::compiler::WasmGraphBuilder
672 return graph()->NewNode(mcgraph()->common()->EffectPhi(count), count + 1, in EffectPhi()
785 Node* ephi = EffectPhi(2, ephi_inputs); in StackCheck()
2481 SetEffectControl(is_32_bit.EffectPhi(effect(), old_effect), is_32_bit.merge); in MemoryGrow()
3603 tnode = graph()->NewNode(mcgraph()->common()->EffectPhi(count), count + 1, in CreateOrMergeIntoEffectPhi()
4245 SetEffectControl(bounds_check.EffectPhi(load, effect()), bounds_check.merge); in BuildAsmjsLoadMem()
4292 SetEffectControl(bounds_check.EffectPhi(store, effect()), bounds_check.merge); in BuildAsmjsStoreMem()
5861 *match_effect = EffectPhi(count, match_effects.data());
5868 *no_match_effect = EffectPhi(count, no_match_effects.data());
6600 SetEffectControl(type_check.EffectPhi(old_effec
[all...]
H A Dcommon-operator.cc654 "EffectPhi", // name in EffectPhiOperator()
1323 const Operator* CommonOperatorBuilder::EffectPhi(int effect_input_count) { in EffectPhi() function in v8::internal::compiler::CommonOperatorBuilder
1337 "EffectPhi", // name in EffectPhi()
1548 return EffectPhi(size); in ResizeMergeOrPhi()
H A Dopcodes.h54 V(EffectPhi) \
H A Dwasm-compiler.h276 Node* EffectPhi(unsigned count, Node** effects_and_control);
724 // control nodes to merge; the EffectPhi needs an additional input.
H A Dsimplified-lowering.cc4459 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0); in DoJSToNumberOrNumericTruncatesToFloat64()
4466 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control); in DoJSToNumberOrNumericTruncatesToFloat64()
4555 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0); in DoJSToNumberOrNumericTruncatesToWord32()
4561 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control); in DoJSToNumberOrNumericTruncatesToWord32()
H A Djs-generic-lowering.cc1215 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge); in LowerJSStackCheck()
H A Dbytecode-graph-builder.cc4335 const Operator* phi_op = common()->EffectPhi(count); in NewEffectPhi()
4371 NodeProperties::ChangeOp(value, common()->EffectPhi(inputs)); in MergeEffect()
H A Deffect-control-linearizer.cc467 // EffectPhi nodes whose uses have either the IfTrue or IfFalse as control in TryCloneBranch()
489 // The resulting graph (modulo the Phi and EffectPhi nodes) looks like this: in TryCloneBranch()
522 // Check/collect other Phi/EffectPhi nodes hanging off the Merge. in TryCloneBranch()
526 // We cannot currently deal with non-Phi/EffectPhi nodes hanging off the in TryCloneBranch()
532 // Right now we can only handle Phi/EffectPhi nodes whose uses are in TryCloneBranch()
716 common()->EffectPhi(static_cast<int>(block->PredecessorCount())), in Run()
/third_party/node/deps/v8/src/wasm/
H A Dgraph-builder-interface.cc231 builder_->SetEffect(builder_->EffectPhi(1, effect_inputs)); in Loop()
735 TFNode* effect = builder_->EffectPhi(2, effect_args); in CallRef()
1549 to->effect = builder_->EffectPhi(2, inputs); in Goto()
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DWasmTranslator.cpp356 Node EffectPhi(uint32_t Count, Node *Effects, Node Control) { in EffectPhi() function in IceBuilder
358 LOG(out << "EffectPhi(" << Count << ", " << Control << "):\n"); in EffectPhi()

Completed in 88 milliseconds