Home
last modified time | relevance | path

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

1234

/external/v8/src/compiler/
Deffect-control-linearizer.cc247 Node* branch1 = graph->NewNode(common->Branch(hint), cond1, control1); in TryCloneBranch()
248 merge_true_inputs[index] = graph->NewNode(common->IfTrue(), branch1); in TryCloneBranch()
249 merge_false_inputs[index] = graph->NewNode(common->IfFalse(), branch1); in TryCloneBranch()
273 Node* phi_true = graph->NewNode(phi->op(), input_count + 1, inputs); in TryCloneBranch()
275 Node* phi_false = graph->NewNode(phi->op(), input_count + 1, inputs); in TryCloneBranch()
392 effect = graph()->NewNode( in Run()
828 Node* branch = graph()->NewNode(common()->Branch(), value, control); in LowerChangeBitToTagged()
830 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in LowerChangeBitToTagged()
833 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in LowerChangeBitToTagged()
836 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in LowerChangeBitToTagged()
[all …]
Dint64-lowering.cc33 placeholder_(graph->NewNode(common->Parameter(-2, "placeholder"), in Int64Lowering()
109 index_high = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes()
110 graph()->NewNode(common()->Int32Constant(4))); in GetIndexNodes()
112 index_low = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes()
113 graph()->NewNode(common()->Int32Constant(4))); in GetIndexNodes()
130 Node* low_node = graph()->NewNode( in LowerNode()
132 Node* high_node = graph()->NewNode( in LowerNode()
166 high_node = graph()->NewNode(load_op, base, index_high, effect_high, in LowerNode()
172 high_node = graph()->NewNode(load_op, base, index_high); in LowerNode()
221 high_node = graph()->NewNode(store_op, base, index_high, in LowerNode()
[all …]
Djs-builtin-reducer.cc241 Node* buffer = effect = graph()->NewNode( in ReduceArrayIterator()
245 Node* check = effect = graph()->NewNode( in ReduceArrayIterator()
247 check = graph()->NewNode(simplified()->BooleanNot(), check); in ReduceArrayIterator()
248 effect = graph()->NewNode(simplified()->CheckIf(), check, effect, control); in ReduceArrayIterator()
308 effect = graph()->NewNode( in ReduceArrayIterator()
310 Node* value = effect = graph()->NewNode( in ReduceArrayIterator()
313 effect = graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()), in ReduceArrayIterator()
315 effect = graph()->NewNode( in ReduceArrayIterator()
318 effect = graph()->NewNode( in ReduceArrayIterator()
323 effect = graph()->NewNode( in ReduceArrayIterator()
[all …]
Dgraph.h62 Node* NewNode(const Operator* op, int input_count, Node* const* inputs, in NON_EXPORTED_BASE()
66 Node* NewNode(const Operator* op) { in NON_EXPORTED_BASE()
67 return NewNode(op, 0, static_cast<Node* const*>(nullptr)); in NON_EXPORTED_BASE()
69 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NON_EXPORTED_BASE()
70 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NON_EXPORTED_BASE()
72 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NON_EXPORTED_BASE()
76 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
78 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NON_EXPORTED_BASE()
80 return NewNode(op, arraysize(nodes), nodes); in NON_EXPORTED_BASE()
[all …]
Dwasm-compiler.cc63 g->SetEnd(g->NewNode(jsgraph->common()->End(1), node)); in MergeControlToEnd()
95 jsgraph->graph()->NewNode(jsgraph->common()->Call(desc), count, inputs); in BuildCallToRuntime()
132 graph()->NewNode(jsgraph()->machine()->Word32Equal(), node, in TrapIfEq32()
150 AddTrapIfTrue(reason, graph()->NewNode(jsgraph()->machine()->Word64Equal(), in TrapIfEq64()
181 Node* branch = graph()->NewNode(common()->Branch(hint), cond, *control_ptr); in AddTrapIf()
182 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in AddTrapIf()
183 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in AddTrapIf()
255 graph()->NewNode(common()->Merge(1), *control_ptr); in BuildTrapCode()
257 graph()->NewNode(common()->EffectPhi(1), *effect_ptr, *control_ptr); in BuildTrapCode()
259 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1), in BuildTrapCode()
[all …]
Dmemory-optimizer.cc174 Node* top = graph()->NewNode(machine()->IntAdd(), state->top(), in VisitAllocate()
176 effect = graph()->NewNode( in VisitAllocate()
182 value = graph()->NewNode( in VisitAllocate()
184 graph()->NewNode(machine()->IntAdd(), state->top(), in VisitAllocate()
193 Node* size = graph()->NewNode(common()->Int32Constant(object_size)); in VisitAllocate()
197 graph()->NewNode(machine()->Load(MachineType::Pointer()), top_address, in VisitAllocate()
199 Node* limit = effect = graph()->NewNode( in VisitAllocate()
205 Node* check = graph()->NewNode( in VisitAllocate()
207 graph()->NewNode( in VisitAllocate()
210 ? graph()->NewNode(machine()->ChangeInt32ToInt64(), size) in VisitAllocate()
[all …]
Djs-native-context-specialization.cc163 Node* value = graph()->NewNode(javascript()->ToBoolean(ToBooleanHint::kAny), in ReduceJSInstanceOf()
244 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), index, in ReduceNamedAccess()
246 effect = graph()->NewNode(simplified()->CheckIf(), check, effect, control); in ReduceNamedAccess()
255 receiver = effect = graph()->NewNode(simplified()->CheckString(), in ReduceNamedAccess()
259 receiver = effect = graph()->NewNode(simplified()->CheckNumber(), in ReduceNamedAccess()
263 receiver = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceNamedAccess()
296 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceNamedAccess()
297 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceNamedAccess()
298 control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
299 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
[all …]
Djs-typed-lowering.cc177 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); in ChangeToPureOperator()
232 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); in ChangeToSpeculativeOperator()
369 return graph()->NewNode(simplified()->PlainPrimitiveToNumber(), node); in ConvertPlainPrimitiveToNumber()
374 Node* const n = graph()->NewNode(javascript()->ToNumber(), node, context(), in ConvertSingleInputToNumber()
376 Node* const if_success = graph()->NewNode(common()->IfSuccess(), n); in ConvertSingleInputToNumber()
394 graph()->NewNode(javascript()->ToNumber(), left(), context(), in ConvertBothInputsToNumber()
396 Node* left_success = graph()->NewNode(common()->IfSuccess(), left_conv); in ConvertBothInputsToNumber()
399 graph()->NewNode(javascript()->ToNumber(), right(), context(), in ConvertBothInputsToNumber()
402 graph()->NewNode(common()->IfException(), left_conv, left_conv); in ConvertBothInputsToNumber()
404 graph()->NewNode(common()->IfException(), right_conv, right_conv); in ConvertBothInputsToNumber()
[all …]
Dbytecode-graph-builder.cc149 Node* parameter = builder->graph()->NewNode(op, graph()->start()); in Environment()
270 builder()->NewNode(common()->Projection(i), node); in BindRegistersToProjections()
357 Node* terminate = builder()->graph()->NewNode( in PrepareForLoop()
370 Node* entry = graph()->NewNode(common()->OsrLoopEntry(), start, start); in PrepareForOsrEntry()
375 SetContext(graph()->NewNode( in PrepareForOsrEntry()
382 values()->at(i) = graph()->NewNode(common()->OsrValue(idx), entry); in PrepareForOsrEntry()
389 graph()->NewNode(common()->Checkpoint(), frame_state, entry, entry); in PrepareForOsrEntry()
397 graph()->NewNode(guard_op, values()->at(i), effect, entry); in PrepareForOsrEntry()
399 Node* context = effect = graph()->NewNode(guard_op, Context(), effect, entry); in PrepareForOsrEntry()
426 Node* loop_exit = graph()->NewNode(common()->LoopExit(), control, loop); in PrepareForLoopExit()
[all …]
Dsimplified-lowering.cc2721 Node* check0 = graph()->NewNode(simplified()->ObjectIsSmi(), value); in DoJSToNumberTruncatesToFloat64()
2723 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberTruncatesToFloat64()
2725 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in DoJSToNumberTruncatesToFloat64()
2729 vtrue0 = graph()->NewNode(simplified()->ChangeTaggedSignedToInt32(), value); in DoJSToNumberTruncatesToFloat64()
2730 vtrue0 = graph()->NewNode(machine()->ChangeInt32ToFloat64(), vtrue0); in DoJSToNumberTruncatesToFloat64()
2733 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in DoJSToNumberTruncatesToFloat64()
2738 graph()->NewNode(ToNumberOperator(), ToNumberCode(), value, context, in DoJSToNumberTruncatesToFloat64()
2740 if_false0 = graph()->NewNode(common()->IfSuccess(), throwing); in DoJSToNumberTruncatesToFloat64()
2742 Node* check1 = graph()->NewNode(simplified()->ObjectIsSmi(), vfalse0); in DoJSToNumberTruncatesToFloat64()
2743 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0); in DoJSToNumberTruncatesToFloat64()
[all …]
Djs-inlining-heuristic.cc198 graph()->NewNode(simplified()->ReferenceEqual(), callee, target); in InlineCandidate()
200 graph()->NewNode(common()->Branch(), check, fallthrough_control); in InlineCandidate()
201 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in InlineCandidate()
202 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch); in InlineCandidate()
211 calls[i] = graph()->NewNode(node->op(), input_count, inputs); in InlineCandidate()
212 if_successes[i] = graph()->NewNode(common()->IfSuccess(), calls[i]); in InlineCandidate()
229 graph()->NewNode(common()->IfException(), calls[i], calls[i]); in InlineCandidate()
232 graph()->NewNode(common()->Merge(num_calls), num_calls, if_exceptions); in InlineCandidate()
234 Node* exception_effect = graph()->NewNode(common()->EffectPhi(num_calls), in InlineCandidate()
236 Node* exception_value = graph()->NewNode( in InlineCandidate()
[all …]
Dast-graph-builder.cc285 return owner_->NewNode( in NewPathDispatchCondition()
456 return NewNode(op, current_context()); in GetFunctionClosureForContext()
468 Node* node = NewNode(op, graph()->start()); in GetFunctionClosure()
480 Node* node = NewNode(op, graph()->start()); in GetFunctionContext()
492 Node* node = NewNode(op, graph()->start()); in GetNewTarget()
502 Node* node = graph()->NewNode( in GetEmptyFrameState()
519 graph()->SetStart(graph()->NewNode(common()->Start(actual_parameter_count))); in CreateGraph()
528 NewNode(common()->OsrNormalEntry()); in CreateGraph()
558 Node* end = graph()->NewNode(common()->End(input_count), input_count, inputs); in CreateGraph()
588 NewNode(javascript()->CallRuntime(Runtime::kTraceEnter)); in CreateGraphBody()
[all …]
Djs-graph.cc131 *loc = graph()->NewNode(common()->HeapConstant(value)); in HeapConstant()
180 *loc = graph()->NewNode(common()->Int32Constant(value)); in Int32Constant()
189 *loc = graph()->NewNode(common()->Int64Constant(value)); in Int64Constant()
198 *loc = graph()->NewNode(common()->RelocatableInt32Constant(value, rmode)); in RelocatableInt32Constant()
207 *loc = graph()->NewNode(common()->RelocatableInt64Constant(value, rmode)); in RelocatableInt64Constant()
222 *loc = graph()->NewNode(common()->NumberConstant(value)); in NumberConstant()
231 *loc = graph()->NewNode(common()->Float32Constant(value)); in Float32Constant()
240 *loc = graph()->NewNode(common()->Float64Constant(value)); in Float64Constant()
248 *loc = graph()->NewNode(common()->PointerConstant(value)); in PointerConstant()
256 *loc = graph()->NewNode(common()->ExternalConstant(reference)); in ExternalConstant()
[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()
Dbytecode-graph-builder.h66 Node* NewNode(const Operator* op, bool incomplete = false) {
70 Node* NewNode(const Operator* op, Node* n1) { in NewNode() function
75 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
85 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
91 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue()
92 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } in NewIfFalse()
93 Node* NewMerge() { return NewNode(common()->Merge(1), true); } in NewMerge()
94 Node* NewLoop() { return NewNode(common()->Loop(1), true); } in NewLoop()
96 return NewNode(common()->Branch(hint), condition);
Dbasic-block-instrumentor.cc72 Node* zero = graph->NewNode(common.Int32Constant(0)); in Instrument()
73 Node* one = graph->NewNode(common.Int32Constant(1)); in Instrument()
83 Node* base = graph->NewNode( in Instrument()
85 Node* load = graph->NewNode(machine.Load(MachineType::Uint32()), base, zero, in Instrument()
87 Node* inc = graph->NewNode(machine.Int32Add(), load, one); in Instrument()
89 graph->NewNode(machine.Store(StoreRepresentation( in Instrument()
Djs-global-object-specialization.cc77 Node* value = effect = graph()->NewNode( in ReduceJSLoadGlobal()
138 graph()->NewNode(simplified()->LoadField(ForPropertyCellValue( in ReduceJSLoadGlobal()
159 effect = graph()->NewNode(javascript()->StoreContext(0, result.index), in ReduceJSStoreGlobal()
184 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), value, in ReduceJSStoreGlobal()
187 graph()->NewNode(simplified()->CheckIf(), check, effect, control); in ReduceJSStoreGlobal()
205 value = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceJSStoreGlobal()
209 effect = graph()->NewNode( in ReduceJSStoreGlobal()
217 graph()->NewNode(simplified()->CheckSmi(), value, effect, control); in ReduceJSStoreGlobal()
221 effect = graph()->NewNode( in ReduceJSStoreGlobal()
236 effect = graph()->NewNode( in ReduceJSStoreGlobal()
Drepresentation-change.cc416 return jsgraph()->graph()->NewNode(op, node); in GetTaggedRepresentationFor()
446 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
455 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
467 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
477 return jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
679 Node* conversion = jsgraph()->graph()->NewNode(op, node, effect, control); in InsertConversion()
683 return jsgraph()->graph()->NewNode(op, node); in InsertConversion()
713 node = jsgraph()->graph()->NewNode(machine()->WordEqual(), node, in GetBitRepresentationFor()
715 return jsgraph()->graph()->NewNode(machine()->Word32Equal(), node, in GetBitRepresentationFor()
718 node = jsgraph()->graph()->NewNode(machine()->Word32Equal(), node, in GetBitRepresentationFor()
[all …]
Djs-intrinsic-lowering.cc101 Node* deoptimize = graph()->NewNode( in ReduceDeoptimizeNow()
157 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value); in ReduceIsInstanceType()
158 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceIsInstanceType()
160 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsInstanceType()
164 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceIsInstanceType()
165 Node* efalse = graph()->NewNode( in ReduceIsInstanceType()
167 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), value, in ReduceIsInstanceType()
170 Node* vfalse = graph()->NewNode(simplified()->NumberEqual(), efalse, in ReduceIsInstanceType()
173 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceIsInstanceType()
176 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge); in ReduceIsInstanceType()
[all …]
Djs-generic-lowering.cc163 Node* literals = effect = graph()->NewNode( in LowerJSLoadProperty()
167 Node* vector = effect = graph()->NewNode( in LowerJSLoadProperty()
187 Node* literals = effect = graph()->NewNode( in LowerJSLoadNamed()
191 Node* vector = effect = graph()->NewNode( in LowerJSLoadNamed()
213 Node* literals = effect = graph()->NewNode( in LowerJSLoadGlobal()
217 Node* vector = effect = graph()->NewNode( in LowerJSLoadGlobal()
242 Node* literals = effect = graph()->NewNode( in LowerJSStoreProperty()
246 Node* vector = effect = graph()->NewNode( in LowerJSStoreProperty()
275 Node* literals = effect = graph()->NewNode( in LowerJSStoreNamed()
279 Node* vector = effect = graph()->NewNode( in LowerJSStoreNamed()
[all …]
Djs-inlining.cc155 graph()->NewNode(common()->IfException(), subcall, subcall); in InlineCall()
162 graph()->NewNode(common()->Merge(subcall_count), subcall_count, in InlineCall()
167 Node* value_output = graph()->NewNode( in InlineCall()
171 graph()->NewNode(common()->EffectPhi(subcall_count), in InlineCall()
209 Node* control_output = graph()->NewNode(common()->Merge(input_count), in InlineCall()
213 Node* value_output = graph()->NewNode( in InlineCall()
217 graph()->NewNode(common()->EffectPhi(input_count), in InlineCall()
239 Node* node0 = graph()->NewNode(op0); in CreateArtificialFrameState()
246 Node* params_node = graph()->NewNode( in CreateArtificialFrameState()
248 return graph()->NewNode(op, params_node, node0, node0, in CreateArtificialFrameState()
[all …]
Dast-graph-builder.h50 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue()
51 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } in NewIfFalse()
52 Node* NewMerge() { return NewNode(common()->Merge(1), true); } in NewMerge()
53 Node* NewLoop() { return NewNode(common()->Loop(1), true); } in NewLoop()
55 return NewNode(common()->Branch(hint), condition);
181 Node* NewNode(const Operator* op, bool incomplete = false) {
185 Node* NewNode(const Operator* op, Node* n1) { in NewNode() function
189 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
194 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
199 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
[all …]
/external/clang/lib/Rewrite/
DRewriteRope.cpp308 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); in insert() local
312 &NewNode->Pieces[0]); in insert()
317 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
320 NewNode->FullRecomputeSizeLocally(); in insert()
324 NewNode->insertAfterLeafInOrder(this); in insert()
330 NewNode->insert(Offset - this->size(), R); in insert()
331 return NewNode; in insert()
543 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); in HandleChildPiece() local
546 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
550 NewNode->NumChildren = NumChildren = WidthFactor; in HandleChildPiece()
[all …]
DDeltaTree.cpp302 DeltaTreeNode *NewNode; in DoSplit() local
309 NewNode = New; in DoSplit()
312 NewNode = new DeltaTreeNode(); in DoSplit()
316 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
320 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
323 NewNode->RecomputeFullDeltaLocally(); in DoSplit()
327 InsertRes.RHS = NewNode; in DoSplit()
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DLegalizeTypes.cpp77 if (I->getNodeId() == NewNode) in PerformExpensiveChecks()
91 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks()
102 assert(NewVal.getNode()->getNodeId() != NewNode && in PerformExpensiveChecks()
124 if ((I->getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
125 (I->getNodeId() != NewNode && Mapped != 0)) { in PerformExpensiveChecks()
172 assert(UI->getNodeId() == NewNode && "NewNode used by non-NewNode!"); in PerformExpensiveChecks()
322 N->setNodeId(NewNode); in run()
337 assert(N->getNodeId() == NewNode && "Unexpected node state!"); in run()
374 if (NodeId == NewNode) in run()
427 if (I->getNodeId() == NewNode) in run()
[all …]

1234