Home
last modified time | relevance | path

Searched refs:NewNode (Results 1 – 25 of 90) sorted by relevance

1234

/third_party/node/deps/v8/src/compiler/
Dint64-lowering.cc38 placeholder_(graph->NewNode(common->Dead())), in Int64Lowering()
139 ReplaceNode(node, node, graph()->NewNode(common()->Int32Constant(0))); in LowerWord64AtomicNarrowOp()
155 *index_high = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes()
156 graph()->NewNode(common()->Int32Constant(4))); in GetIndexNodes()
158 *index_low = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes()
159 graph()->NewNode(common()->Int32Constant(4))); in GetIndexNodes()
177 high_node = graph()->NewNode(load_op, base, index_high, effect_high, in LowerLoadOperator()
183 high_node = graph()->NewNode(load_op, base, index_high); in LowerLoadOperator()
214 high_node = graph()->NewNode(store_op, base, index_high, in LowerStoreOperator()
220 high_node = graph()->NewNode(store_op, base, index_high, in LowerStoreOperator()
[all …]
Dgraph-assembler.cc78 return AddNode(graph()->NewNode( in UniqueIntPtrConstant()
112 graph()->NewNode(common()->Parameter(index), graph()->start())); in Parameter()
120 return AddNode(graph()->NewNode(machine()->LoadFramePointer())); in LoadFramePointer()
146 return AddNode(graph()->NewNode(machine()->Name(), input)); \ in JSGRAPH_SINGLETON_CONSTANT_LIST()
153 return AddNode(graph()->NewNode(machine()->Name(), left, right)); \
161 graph()->NewNode(machine()->Name(), left, right, control())); \
196 return AddNode(graph()->NewNode(machine()->Float64RoundDown().op(), value)); in Float64RoundDown()
202 graph()->NewNode(machine()->Float64RoundTruncate().op(), value)); in Float64RoundTruncate()
207 graph()->NewNode(machine()->TruncateFloat64ToInt64(kind), value)); in TruncateFloat64ToInt64()
212 graph()->NewNode(common()->Projection(index), value, control())); in Projection()
[all …]
Djs-native-context-specialization.cc171 Replace(graph()->NewNode(common()->DelayedStringConstant(base))); in ReduceJSToString()
227 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReduceJSAsyncFunctionEnter()
244 graph()->NewNode(javascript()->CreateAsyncFunctionObject(register_count), in ReduceJSAsyncFunctionEnter()
263 Node* promise = effect = graph()->NewNode( in ReduceJSAsyncFunctionReject()
280 effect = graph()->NewNode(javascript()->RejectPromise(), promise, reason, in ReduceJSAsyncFunctionReject()
299 Node* promise = effect = graph()->NewNode( in ReduceJSAsyncFunctionResolve()
313 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value, in ReduceJSAsyncFunctionResolve()
348 Node* reduced = graph()->NewNode(common()->DelayedStringConstant(cons)); in ReduceJSAdd()
501 Node* value = graph()->NewNode(simplified()->ToBoolean(), node); in ReduceJSInstanceOf()
688 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReduceJSPromiseResolve()
[all …]
Djs-call-reducer.cc326 graph()->NewNode(common()->IfException(), effect(), control()); in MayThrow()
330 AddNode(graph()->NewNode(common()->IfSuccess(), control())); in MayThrow()
402 Node* merge = gasm_->graph()->NewNode(gasm_->common()->Merge(size), in MergeExceptionalPaths()
411 Node* ephi = gasm_->graph()->NewNode(gasm_->common()->EffectPhi(size), in MergeExceptionalPaths()
414 Node* phi = gasm_->graph()->NewNode( in MergeExceptionalPaths()
794 graph()->NewNode(simplified()->CheckFloat64Hole(mode, feedback()), in CheckFloat64Hole()
838 graph()->NewNode(javascript()->CreatePromise(), context, effect())); in CreatePromise()
844 return AddNode<Context>(graph()->NewNode( in CreateFunctionContext()
864 return AddNode<JSFunction>(graph()->NewNode( in CreateClosureFromBuiltinSharedFunctionInfo()
876 return AddNode<Object>(graph()->NewNode( in CallPromiseExecutor()
[all …]
Djs-typed-lowering.cc136 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(), in CheckLeftInputToReceiver()
145 graph()->NewNode(simplified()->CheckReceiverOrNullOrUndefined(), left(), in CheckLeftInputToReceiverOrNullOrUndefined()
159 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(), in CheckInputsToReceiver()
175 graph()->NewNode(simplified()->CheckReceiverOrNullOrUndefined(), in CheckInputsToReceiverOrNullOrUndefined()
184 Node* left_input = graph()->NewNode(simplified()->CheckSymbol(), left(), in CheckLeftInputToSymbol()
198 Node* right_input = graph()->NewNode(simplified()->CheckSymbol(), right(), in CheckInputsToSymbol()
211 graph()->NewNode(simplified()->CheckString(FeedbackSource()), left(), in CheckInputsToString()
218 graph()->NewNode(simplified()->CheckString(FeedbackSource()), right(), in CheckInputsToString()
230 Node* left_input = graph()->NewNode( in CheckInputsToInternalizedString()
237 graph()->NewNode(simplified()->CheckInternalizedString(), right(), in CheckInputsToInternalizedString()
[all …]
Dbasic-block-instrumentor.cc90 counters_array = graph->NewNode(common.HeapConstant(Handle<HeapObject>::New( in Instrument()
93 counters_array = graph->NewNode(PointerConstant(&common, data->counts())); in Instrument()
95 Node* zero = graph->NewNode(common.Int32Constant(0)); in Instrument()
96 Node* one = graph->NewNode(common.Int32Constant(1)); in Instrument()
113 graph->NewNode(IntPtrConstant(&common, offset_to_counter_value)); in Instrument()
115 graph->NewNode(machine.Load(MachineType::Uint32()), counters_array, in Instrument()
117 Node* inc = graph->NewNode(machine.Int32Add(), load, one); in Instrument()
121 Node* overflow = graph->NewNode(machine.Uint32LessThan(), inc, load); in Instrument()
122 Node* overflow_mask = graph->NewNode(machine.Int32Sub(), zero, overflow); in Instrument()
124 graph->NewNode(machine.Word32Or(), inc, overflow_mask); in Instrument()
[all …]
Dwasm-compiler.cc105 ? graph()->NewNode(mcgraph()->common()->HeapConstant( \
229 graph()->NewNode(mcgraph()->common()->Branch(hint), cond, control()); in Branch()
230 *true_node = graph()->NewNode(mcgraph()->common()->IfTrue(), branch); in Branch()
231 *false_node = graph()->NewNode(mcgraph()->common()->IfFalse(), branch); in Branch()
236 return graph()->NewNode(mcgraph()->common()->NumberConstant(value)); in NumberConstant()
253 graph()->NewNode(simplified_.AllocateRaw( in Allocate()
259 return AddNode(graph()->NewNode( in LoadFromObject()
269 return AddNode(graph()->NewNode(simplified_.LoadImmutableFromObject( in LoadImmutableFromObject()
279 return AddNode(graph()->NewNode(mcgraph()->machine()->LoadImmutable(rep), in LoadImmutable()
289 return AddNode(graph()->NewNode(simplified_.StoreToObject(access), base, in StoreToObject()
[all …]
Dmachine-graph.cc17 *loc = graph()->NewNode(common()->Int32Constant(value)); in Int32Constant()
25 *loc = graph()->NewNode(common()->Int64Constant(value)); in Int64Constant()
44 *loc = graph()->NewNode(common()->TaggedIndexConstant(value32)); in TaggedIndexConstant()
54 *loc = graph()->NewNode(common()->RelocatableInt32Constant(value, rmode)); in RelocatableInt32Constant()
64 *loc = graph()->NewNode(common()->RelocatableInt64Constant(value, rmode)); in RelocatableInt64Constant()
79 *loc = graph()->NewNode(common()->Float32Constant(value)); in Float32Constant()
87 *loc = graph()->NewNode(common()->Float64Constant(value)); in Float64Constant()
95 *loc = graph()->NewNode(common()->PointerConstant(value)); in PointerConstant()
103 *loc = graph()->NewNode(common()->ExternalConstant(reference)); in ExternalConstant()
Dbytecode-graph-builder.cc115 Node* NewNode(const Operator* op, bool incomplete = false) { in NewNode() function in v8::internal::compiler::BytecodeGraphBuilder
120 Node* NewNode(const Operator* op, Node* n0, Args... nodes) { in NewNode() function in v8::internal::compiler::BytecodeGraphBuilder
126 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue()
127 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } in NewIfFalse()
128 Node* NewIfValue(int32_t value) { return NewNode(common()->IfValue(value)); } in NewIfValue()
129 Node* NewIfDefault() { return NewNode(common()->IfDefault()); } in NewIfDefault()
130 Node* NewMerge() { return NewNode(common()->Merge(1), true); } in NewMerge()
131 Node* NewLoop() { return NewNode(common()->Loop(1), true); } in NewLoop()
133 return NewNode(common()->Branch(hint), condition); in NewBranch()
136 return NewNode(common()->Switch(control_output_count), condition); in NewSwitch()
[all …]
Ddiamond.h29 branch = graph->NewNode(common->Branch(hint), cond, graph->start());
30 if_true = graph->NewNode(common->IfTrue(), branch);
31 if_false = graph->NewNode(common->IfFalse(), branch);
32 merge = graph->NewNode(common->Merge(2), if_true, if_false);
53 return graph->NewNode(common->Phi(rep, 2), tv, fv, merge); in Phi()
57 return graph->NewNode(common->EffectPhi(2), tv, fv, merge); in EffectPhi()
Dproperty-access-builder.cc63 graph()->NewNode(simplified()->CheckString(FeedbackSource()), *receiver, in TryBuildStringCheck()
77 graph()->NewNode(simplified()->CheckNumber(FeedbackSource()), *receiver, in TryBuildNumberCheck()
107 *effect = graph()->NewNode(simplified()->CheckMaps(flags, map_set), object, in BuildCheckMaps()
118 graph()->NewNode(simplified()->ReferenceEqual(), receiver, expected); in BuildCheckValue()
120 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongValue), in BuildCheckValue()
225 storage = *effect = graph()->NewNode( in BuildLoadDataField()
241 storage = *effect = graph()->NewNode( in BuildLoadDataField()
248 storage = *effect = graph()->NewNode(simplified()->CheckHeapObject(), in BuildLoadDataField()
251 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in BuildLoadDataField()
254 graph()->NewNode(simplified()->ReferenceEqual(), map, in BuildLoadDataField()
[all …]
Djs-inlining.cc174 Node* on_success = graph()->NewNode(common()->IfSuccess(), subcall); in InlineCall()
178 graph()->NewNode(common()->IfException(), subcall, subcall); in InlineCall()
185 graph()->NewNode(common()->Merge(subcall_count), subcall_count, in InlineCall()
190 Node* value_output = graph()->NewNode( in InlineCall()
194 graph()->NewNode(common()->EffectPhi(subcall_count), in InlineCall()
231 Node* control_output = graph()->NewNode(common()->Merge(input_count), in InlineCall()
235 Node* value_output = graph()->NewNode( in InlineCall()
239 graph()->NewNode(common()->EffectPhi(input_count), in InlineCall()
263 Node* node0 = graph()->NewNode(op0); in CreateArtificialFrameState()
273 Node* params_node = graph()->NewNode( in CreateArtificialFrameState()
[all …]
Dsimplified-lowering.cc866 graph()->NewNode(common()->Unreachable(), effect, control); in ChangeToDeadValue()
1038 DeferReplacement(node, graph()->NewNode(common()->Plug())); in VisitUnused()
1276 graph()->NewNode(jsgraph_->machine()->Word32And(), rhs, in MaskShiftOperand()
1398 jsgraph_->graph()->NewNode( in VisitFrameState()
2988 graph()->NewNode(lowering->machine()->Word64Shl(), value, in VisitNode()
2991 graph()->NewNode(lowering->machine()->Word64Sar(), shifted, in VisitNode()
4128 node = graph()->NewNode(common()->SLVerifierHint(nullptr, type), node); in InsertTypeOverrideForVerifier()
4337 graph()->NewNode(common()->Unreachable(), node, control); in InsertUnreachableIfNecessary()
4397 Node* check0 = graph()->NewNode(simplified()->ObjectIsSmi(), value); in DoJSToNumberOrNumericTruncatesToFloat64()
4399 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberOrNumericTruncatesToFloat64()
[all …]
Drepresentation-change.cc272 return jsgraph()->graph()->NewNode( in GetTaggedSignedRepresentationFor()
417 return jsgraph()->graph()->NewNode( in GetTaggedPointerRepresentationFor()
429 return jsgraph()->graph()->NewNode( in GetTaggedPointerRepresentationFor()
458 node = jsgraph()->graph()->NewNode(op, node); in GetTaggedPointerRepresentationFor()
535 return jsgraph()->graph()->NewNode( in GetTaggedRepresentationFor()
625 return jsgraph()->graph()->NewNode(op, node); in GetTaggedRepresentationFor()
647 return jsgraph()->graph()->NewNode( in GetFloat32RepresentationFor()
653 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
662 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
673 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
[all …]
Djs-intrinsic-lowering.cc128 Node* deoptimize = graph()->NewNode( in ReduceDeoptimizeNow()
147 graph()->NewNode(op, closure, receiver, context, effect, control); in ReduceCreateJSGeneratorObject()
247 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value); in ReduceIsInstanceType()
248 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceIsInstanceType()
250 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsInstanceType()
254 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceIsInstanceType()
257 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), value, in ReduceIsInstanceType()
259 Node* map_instance_type = efalse = graph()->NewNode( in ReduceIsInstanceType()
263 graph()->NewNode(simplified()->NumberEqual(), map_instance_type, in ReduceIsInstanceType()
266 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceIsInstanceType()
[all …]
Djs-inlining-heuristic.cc620 effect_phi_effect = graph()->NewNode( in TryReuseDispatch()
633 graph()->NewNode(node->op(), input_count, inputs); in TryReuseDispatch()
672 graph()->NewNode(simplified()->ReferenceEqual(), callee, target); in CreateOrReuseDispatch()
674 graph()->NewNode(common()->Branch(), check, fallthrough_control); in CreateOrReuseDispatch()
675 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in CreateOrReuseDispatch()
676 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch); in CreateOrReuseDispatch()
697 graph()->NewNode(node->op(), input_count, inputs); in CreateOrReuseDispatch()
739 if_successes[i] = graph()->NewNode(common()->IfSuccess(), calls[i]); in InlineCandidate()
741 graph()->NewNode(common()->IfException(), calls[i], calls[i]); in InlineCandidate()
746 graph()->NewNode(common()->Merge(num_calls), num_calls, if_exceptions); in InlineCandidate()
[all …]
Dgraph-assembler.h579 AddNode(graph()->NewNode(common()->LoopExit(), control(), in MergeState()
581 AddNode(graph()->NewNode(common()->LoopExitEffect(), effect(), control())); in MergeState()
583 var_array[i] = AddNode(graph()->NewNode( in MergeState()
593 graph()->NewNode(common()->Loop(2), control(), control()); in MergeState()
594 label->effect_ = graph()->NewNode(common()->EffectPhi(2), effect(), in MergeState()
596 Node* terminate = graph()->NewNode(common()->Terminate(), label->effect_, in MergeState()
601 graph()->NewNode(common()->Phi(label->representations_[i], 2), in MergeState()
627 graph()->NewNode(common()->Merge(2), label->control_, control()); in MergeState()
628 label->effect_ = graph()->NewNode(common()->EffectPhi(2), label->effect_, in MergeState()
631 label->bindings_[i] = graph()->NewNode( in MergeState()
[all …]
Dwasm-inlining.cc391 return_inputs.push_back(graph()->NewNode(common()->Int32Constant(0))); in InlineCall()
397 graph()->NewNode(common()->Projection(i), input, input)); in InlineCall()
409 Node* ret = graph()->NewNode(common()->Return(return_arity), in InlineCall()
426 graph()->NewNode(common()->Merge(handler_count), handler_count, in InlineCall()
438 effects.push_back(graph()->NewNode(common()->LoopExitEffect(), in InlineCall()
440 values.push_back(graph()->NewNode( in InlineCall()
448 Node* value_output = graph()->NewNode( in InlineCall()
451 Node* effect_output = graph()->NewNode(common()->EffectPhi(handler_count), in InlineCall()
470 Node* control_output = graph()->NewNode(common()->Merge(return_count), in InlineCall()
474 graph()->NewNode(common()->EffectPhi(return_count), in InlineCall()
[all …]
Dtyped-optimization.cc180 Node* check_bounds = graph()->NewNode( in ReduceMaybeGrowFastElements()
480 graph()->NewNode(simplified()->NumberToInt32(), from_char_code_repl); in TryReduceStringComparisonOfStringFromSingleCharCode()
481 from_char_code_repl = graph()->NewNode( in TryReduceStringComparisonOfStringFromSingleCharCode()
496 graph()->NewNode(comparison_op, constant_repl, from_char_code_repl); in TryReduceStringComparisonOfStringFromSingleCharCode()
504 graph()->NewNode(comparison_op, from_char_code_repl, constant_repl); in TryReduceStringComparisonOfStringFromSingleCharCode()
526 left = graph()->NewNode(simplified()->NumberToInt32(), left); in ReduceStringComparison()
527 left = graph()->NewNode( in ReduceStringComparison()
533 right = graph()->NewNode(simplified()->NumberToInt32(), right); in ReduceStringComparison()
534 right = graph()->NewNode( in ReduceStringComparison()
539 graph()->NewNode(NumberComparisonFor(node->op()), left, right); in ReduceStringComparison()
[all …]
Dallocation-builder.h34 effect_ = graph()->NewNode(simplified()->StoreField(access), allocation_, in Store()
40 effect_ = graph()->NewNode(simplified()->StoreElement(access), allocation_, in Store()
76 return graph()->NewNode(common()->FinishRegion(), allocation_, effect_); in Finish()
Dgraph.h65 Node* NewNode(const Operator* op, int input_count, Node* const* inputs, in NON_EXPORTED_BASE()
74 Node* NewNode(const Operator* op, Nodes... nodes) { in NON_EXPORTED_BASE()
77 return NewNode(op, nodes_arr.size(), nodes_arr.data()); in NON_EXPORTED_BASE()
Djs-graph.cc87 *loc = graph()->NewNode(common()->NumberConstant(value)); in NumberConstant()
95 *loc = graph()->NewNode(common()->HeapConstant(value)); in HeapConstant()
181 graph()->NewNode(common()->StateValues(0,
186 graph()->NewNode(common()->TypedStateValues(
Draw-machine-assembler.cc35 graph->SetStart(graph->NewNode(common_.Start(param_count + 1))); in RawMachineAssembler()
44 graph->SetEnd(graph->NewNode(common_.End(0))); in RawMachineAssembler()
205 graph->NewNode(common->IfTrue(), branch_clone)); in OptimizeControlFlow()
207 graph->NewNode(common->IfFalse(), branch_clone)); in OptimizeControlFlow()
253 current_control = graph()->NewNode(common()->Loop(2), graph()->start(), in MakeReschedulable()
256 graph()->NewNode(common()->EffectPhi(2), graph()->start(), in MakeReschedulable()
259 Node* terminate = graph()->NewNode(common()->Terminate(), current_effect, in MakeReschedulable()
281 current_control = graph()->NewNode(common()->Merge(predecessor_count), in MakeReschedulable()
285 current_effect = graph()->NewNode( in MakeReschedulable()
393 return graph()->NewNode(op, static_cast<int>(inputs.size()), inputs.data()); in CreateNodeFromPredecessors()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
DIceCfgNode.cpp287 CfgNode *NewNode = Func->makeNode(); in splitIncomingEdge() local
291 NewNode->setLoopNestDepth( in splitIncomingEdge()
294 NewNode->setName("split_" + Pred->getName() + "_" + getName() + "_" + in splitIncomingEdge()
298 NewNode->setNeedsPlacement(true); in splitIncomingEdge()
303 I = NewNode; in splitIncomingEdge()
304 NewNode->InEdges.push_back(Pred); in splitIncomingEdge()
315 I = NewNode; in splitIncomingEdge()
316 NewNode->OutEdges.push_back(this); in splitIncomingEdge()
326 if (!I.isDeleted() && I.repointEdges(this, NewNode)) in splitIncomingEdge()
330 return NewNode; in splitIncomingEdge()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.cpp79 if (Node.getNodeId() == NewNode) in PerformExpensiveChecks()
95 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks()
108 assert(NewVal.getNode()->getNodeId() != NewNode && in PerformExpensiveChecks()
132 if ((Node.getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
133 (Node.getNodeId() != NewNode && Mapped != 0)) { in PerformExpensiveChecks()
182 assert(UI->getNodeId() == NewNode && "NewNode used by non-NewNode!"); in PerformExpensiveChecks()
345 N->setNodeId(NewNode); in run()
360 assert(N->getNodeId() == NewNode && "Unexpected node state!"); in run()
398 if (NodeId == NewNode) in run()
452 if (Node.getNodeId() == NewNode) in run()
[all …]

1234