/external/v8/src/compiler/ |
D | js-call-reducer.cc | 50 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathUnary() 53 Node* value = graph()->NewNode(op, input); in ReduceMathUnary() 76 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathBinary() 80 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathBinary() 83 Node* value = graph()->NewNode(op, left, right); in ReduceMathBinary() 107 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathImul() 111 graph()->NewNode(simplified()->SpeculativeToNumber( in ReduceMathImul() 114 left = graph()->NewNode(simplified()->NumberToUint32(), left); in ReduceMathImul() 115 right = graph()->NewNode(simplified()->NumberToUint32(), right); in ReduceMathImul() 116 Node* value = graph()->NewNode(simplified()->NumberImul(), left, right); in ReduceMathImul() [all …]
|
D | int64-lowering.cc | 35 placeholder_(graph->NewNode(common->Parameter(-2, "placeholder"), in Int64Lowering() 151 index_high = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes() 152 graph()->NewNode(common()->Int32Constant(4))); in GetIndexNodes() 154 index_low = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes() 155 graph()->NewNode(common()->Int32Constant(4))); in GetIndexNodes() 164 Node* low_node = graph()->NewNode( in LowerNode() 166 Node* high_node = graph()->NewNode( in LowerNode() 200 high_node = graph()->NewNode(load_op, base, index_high, effect_high, in LowerNode() 206 high_node = graph()->NewNode(load_op, base, index_high); in LowerNode() 255 high_node = graph()->NewNode(store_op, base, index_high, in LowerNode() [all …]
|
D | wasm-compiler.cc | 73 SetEffect(graph()->NewNode( \ 79 SetEffect(graph()->NewNode( \ 98 g->SetEnd(g->NewNode(mcgraph->common()->End(1), node)); in MergeControlToEnd() 137 Node* start = graph()->NewNode(mcgraph()->common()->Start(params)); in Start() 143 return graph()->NewNode(mcgraph()->common()->Parameter(index), in Param() 148 return graph()->NewNode(mcgraph()->common()->Loop(1), entry); in Loop() 153 graph()->NewNode(mcgraph()->common()->Terminate(), effect, control); in Terminate() 169 *if_success = graph()->NewNode(mcgraph()->common()->IfSuccess(), node); in ThrowsException() 171 graph()->NewNode(mcgraph()->common()->IfException(), node, node); in ThrowsException() 193 return graph()->NewNode(mcgraph()->common()->Merge(count), count, controls); in Merge() [all …]
|
D | graph-assembler.cc | 30 return graph()->NewNode(common()->Int32Constant(value)); in UniqueInt32Constant() 59 return graph()->NewNode(machine()->LoadFramePointer()); in LoadFramePointer() 69 return graph()->NewNode(machine()->Name(), input); \ 76 return graph()->NewNode(machine()->Name(), left, right); \ in PURE_ASSEMBLER_MACH_UNOP_LIST() 83 return graph()->NewNode(machine()->Name(), left, right, current_control_); \ 90 return graph()->NewNode(machine()->Float64RoundDown().op(), value); 95 return graph()->NewNode(machine()->Float64RoundTruncate().op(), value); in Float64RoundTruncate() 99 return graph()->NewNode(common()->Projection(index), value, current_control_); in Projection() 104 graph()->NewNode(simplified()->AllocateRaw(Type::Any(), pretenure), in Allocate() 110 graph()->NewNode(simplified()->LoadField(access), object, in LoadField() [all …]
|
D | js-native-context-specialization.cc | 294 Node* value = graph()->NewNode(simplified()->ToBoolean(), node); in ReduceJSInstanceOf() 465 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReduceJSPromiseResolve() 466 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value, in ReduceJSPromiseResolve() 516 graph()->NewNode(javascript()->FulfillPromise(), promise, resolution, in ReduceJSResolvePromise() 599 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver, in ReduceGlobalAccess() 601 effect = graph()->NewNode( in ReduceGlobalAccess() 656 value = effect = graph()->NewNode( in ReduceGlobalAccess() 676 graph()->NewNode(simplified()->ReferenceEqual(), value, in ReduceGlobalAccess() 678 effect = graph()->NewNode( in ReduceGlobalAccess() 701 value = effect = graph()->NewNode(simplified()->CheckHeapObject(), in ReduceGlobalAccess() [all …]
|
D | js-typed-lowering.cc | 119 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(), in CheckLeftInputToReceiver() 133 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(), in CheckInputsToReceiver() 145 Node* left_input = graph()->NewNode(simplified()->CheckSymbol(), left(), in CheckInputsToSymbol() 151 Node* right_input = graph()->NewNode(simplified()->CheckSymbol(), right(), in CheckInputsToSymbol() 164 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), left(), in CheckInputsToString() 171 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), right(), in CheckInputsToString() 183 Node* left_input = graph()->NewNode( in CheckInputsToInternalizedString() 190 graph()->NewNode(simplified()->CheckInternalizedString(), right(), in CheckInputsToInternalizedString() 382 return graph()->NewNode(simplified()->PlainPrimitiveToNumber(), node); in ConvertPlainPrimitiveToNumber() 390 node = graph()->NewNode(simplified()->NumberToInt32(), node); in ConvertToUI32() [all …]
|
D | bytecode-graph-builder.cc | 161 Node* parameter = builder->graph()->NewNode(op, graph()->start()); in Environment() 177 context_ = builder->graph()->NewNode(op, graph()->start()); in Environment() 184 Node* new_target_node = builder->graph()->NewNode(op, graph()->start()); in Environment() 271 builder()->NewNode(common()->Projection(i), node); in BindRegistersToProjections() 384 Node* terminate = builder()->graph()->NewNode( in PrepareForLoop() 393 SetContext(graph()->NewNode( in FillWithOsrValues() 400 values()->at(i) = graph()->NewNode(common()->OsrValue(idx), start); in FillWithOsrValues() 427 Node* loop_exit = graph()->NewNode(common()->LoopExit(), control, loop); in PrepareForLoopExit() 431 Node* effect_rename = graph()->NewNode(common()->LoopExitEffect(), in PrepareForLoopExit() 444 graph()->NewNode(common()->LoopExitValue(), values_[i], loop_exit); in PrepareForLoopExit() [all …]
|
D | simplified-lowering.cc | 1136 2, jsgraph_->graph()->NewNode(jsgraph_->common()->TypedStateValues( in VisitFrameState() 2877 0, jsgraph_->graph()->NewNode( in VisitNode() 3309 Node* check0 = graph()->NewNode(simplified()->ObjectIsSmi(), value); in DoJSToNumberOrNumericTruncatesToFloat64() 3311 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control); in DoJSToNumberOrNumericTruncatesToFloat64() 3313 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in DoJSToNumberOrNumericTruncatesToFloat64() 3317 vtrue0 = graph()->NewNode(simplified()->ChangeTaggedSignedToInt32(), value); in DoJSToNumberOrNumericTruncatesToFloat64() 3318 vtrue0 = graph()->NewNode(machine()->ChangeInt32ToFloat64(), vtrue0); in DoJSToNumberOrNumericTruncatesToFloat64() 3321 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in DoJSToNumberOrNumericTruncatesToFloat64() 3336 vfalse0 = efalse0 = if_false0 = graph()->NewNode( in DoJSToNumberOrNumericTruncatesToFloat64() 3345 if_false0 = graph()->NewNode(common()->IfSuccess(), vfalse0); in DoJSToNumberOrNumericTruncatesToFloat64() [all …]
|
D | simd-scalar-lowering.cc | 35 placeholder_(graph()->NewNode(common()->Parameter(-2, "placeholder"), in SimdScalarLowering() 350 new_indices[laneIndex] = graph()->NewNode( in GetIndexNodes() 352 graph()->NewNode( in GetIndexNodes() 388 rep_nodes[i] = graph()->NewNode(load_op, base, indices[i], effect_input, in LowerLoadOp() 395 rep_nodes[i] = graph()->NewNode(load_op, base, indices[i]); in LowerLoadOp() 456 graph()->NewNode(store_op, base, indices[i], rep_inputs[i], in LowerStoreOp() 464 graph()->NewNode(store_op, base, indices[i], rep_inputs[i]); in LowerStoreOp() 483 rep_node[i] = graph()->NewNode(op, rep_left[i], rep_right[i]); in LowerBinaryOp() 487 rep_node[i] = graph()->NewNode(op, rep_left[i * 2], rep_left[i * 2 + 1]); in LowerBinaryOp() 489 graph()->NewNode(op, rep_right[i * 2], rep_right[i * 2 + 1]); in LowerBinaryOp() [all …]
|
D | machine-graph.cc | 17 *loc = graph()->NewNode(common()->Int32Constant(value)); in Int32Constant() 25 *loc = graph()->NewNode(common()->Int64Constant(value)); in Int64Constant() 40 *loc = graph()->NewNode(common()->RelocatableInt32Constant(value, rmode)); in RelocatableInt32Constant() 50 *loc = graph()->NewNode(common()->RelocatableInt64Constant(value, rmode)); in RelocatableInt64Constant() 65 *loc = graph()->NewNode(common()->Float32Constant(value)); in Float32Constant() 73 *loc = graph()->NewNode(common()->Float64Constant(value)); in Float64Constant() 81 *loc = graph()->NewNode(common()->PointerConstant(value)); in PointerConstant() 89 *loc = graph()->NewNode(common()->ExternalConstant(reference)); in ExternalConstant()
|
D | js-inlining.cc | 156 Node* on_success = graph()->NewNode(common()->IfSuccess(), subcall); in InlineCall() 160 graph()->NewNode(common()->IfException(), subcall, subcall); in InlineCall() 167 graph()->NewNode(common()->Merge(subcall_count), subcall_count, in InlineCall() 172 Node* value_output = graph()->NewNode( in InlineCall() 176 graph()->NewNode(common()->EffectPhi(subcall_count), in InlineCall() 214 Node* control_output = graph()->NewNode(common()->Merge(input_count), in InlineCall() 218 Node* value_output = graph()->NewNode( in InlineCall() 222 graph()->NewNode(common()->EffectPhi(input_count), in InlineCall() 245 Node* node0 = graph()->NewNode(op0); in CreateArtificialFrameState() 252 Node* params_node = graph()->NewNode( in CreateArtificialFrameState() [all …]
|
D | diamond.h | 29 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()
|
D | representation-change.cc | 219 return jsgraph()->graph()->NewNode( in GetTaggedSignedRepresentationFor() 341 return jsgraph()->graph()->NewNode( in GetTaggedPointerRepresentationFor() 420 return jsgraph()->graph()->NewNode( in GetTaggedRepresentationFor() 475 return jsgraph()->graph()->NewNode(op, node); in GetTaggedRepresentationFor() 498 return jsgraph()->graph()->NewNode( in GetFloat32RepresentationFor() 504 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor() 513 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor() 524 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor() 534 return jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor() 559 return jsgraph()->graph()->NewNode( in GetFloat64RepresentationFor() [all …]
|
D | bytecode-graph-builder.h | 72 Node* NewNode(const Operator* op, bool incomplete = false) { 76 Node* NewNode(const Operator* op, Node* n1) { in NewNode() function 81 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function 86 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function 91 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function 96 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function 103 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue() 104 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } in NewIfFalse() 105 Node* NewIfValue(int32_t value) { return NewNode(common()->IfValue(value)); } in NewIfValue() 106 Node* NewIfDefault() { return NewNode(common()->IfDefault()); } in NewIfDefault() [all …]
|
D | basic-block-instrumentor.cc | 68 Node* zero = graph->NewNode(common.Int32Constant(0)); in Instrument() 69 Node* one = graph->NewNode(common.Int32Constant(1)); in Instrument() 79 Node* base = graph->NewNode( in Instrument() 81 Node* load = graph->NewNode(machine.Load(MachineType::Uint32()), base, zero, in Instrument() 83 Node* inc = graph->NewNode(machine.Int32Add(), load, one); in Instrument() 85 graph->NewNode(machine.Store(StoreRepresentation( in Instrument()
|
D | property-access-builder.cc | 59 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), *receiver, in TryBuildStringCheck() 72 graph()->NewNode(simplified()->CheckNumber(VectorSlotPair()), *receiver, in TryBuildNumberCheck() 124 receiver = *effect = graph()->NewNode(simplified()->CheckHeapObject(), in BuildCheckHeapObject() 154 *effect = graph()->NewNode(simplified()->CheckMaps(flags, maps), receiver, in BuildCheckMaps() 165 graph()->NewNode(simplified()->ReferenceEqual(), receiver, expected); in BuildCheckValue() 167 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongValue), in BuildCheckValue() 236 storage = *effect = graph()->NewNode( in BuildLoadDataField() 258 storage = *effect = graph()->NewNode( in BuildLoadDataField() 274 Node* value = *effect = graph()->NewNode( in BuildLoadDataField()
|
D | graph-assembler.h | 305 label->control_ = graph()->NewNode(common()->Loop(2), current_control_, in MergeState() 307 label->effect_ = graph()->NewNode(common()->EffectPhi(2), current_effect_, in MergeState() 309 Node* terminate = graph()->NewNode(common()->Terminate(), label->effect_, in MergeState() 313 label->bindings_[i] = graph()->NewNode( in MergeState() 338 label->control_ = graph()->NewNode(common()->Merge(2), label->control_, in MergeState() 340 label->effect_ = graph()->NewNode(common()->EffectPhi(2), label->effect_, in MergeState() 343 label->bindings_[i] = graph()->NewNode( in MergeState() 402 graph()->NewNode(common()->Branch(hint), condition, current_control_); in GotoIf() 404 current_control_ = graph()->NewNode(common()->IfTrue(), branch); in GotoIf() 407 current_control_ = graph()->NewNode(common()->IfFalse(), branch); in GotoIf() [all …]
|
D | js-inlining-heuristic.cc | 527 effect = graph()->NewNode(checkpoint->op(), new_checkpoint_state, effect, in TryReuseDispatch() 540 graph()->NewNode(node->op(), input_count, inputs); in TryReuseDispatch() 577 graph()->NewNode(simplified()->ReferenceEqual(), callee, target); in CreateOrReuseDispatch() 579 graph()->NewNode(common()->Branch(), check, fallthrough_control); in CreateOrReuseDispatch() 580 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in CreateOrReuseDispatch() 581 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch); in CreateOrReuseDispatch() 598 graph()->NewNode(node->op(), input_count, inputs); in CreateOrReuseDispatch() 641 if_successes[i] = graph()->NewNode(common()->IfSuccess(), calls[i]); in InlineCandidate() 643 graph()->NewNode(common()->IfException(), calls[i], calls[i]); in InlineCandidate() 648 graph()->NewNode(common()->Merge(num_calls), num_calls, if_exceptions); in InlineCandidate() [all …]
|
D | allocation-builder.h | 31 effect_ = graph()->NewNode( 34 graph()->NewNode(simplified()->Allocate(type, pretenure), 41 effect_ = graph()->NewNode(simplified()->StoreField(access), allocation_, in Store() 47 effect_ = graph()->NewNode(simplified()->StoreElement(access), allocation_, in Store() 92 return graph()->NewNode(common()->FinishRegion(), allocation_, effect_); in Finish()
|
D | js-intrinsic-lowering.cc | 111 Node* deoptimize = graph()->NewNode( in ReduceDeoptimizeNow() 131 graph()->NewNode(op, closure, receiver, context, effect, control); in ReduceCreateJSGeneratorObject() 199 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value); in ReduceIsInstanceType() 200 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceIsInstanceType() 202 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsInstanceType() 206 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceIsInstanceType() 209 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), value, in ReduceIsInstanceType() 211 Node* map_instance_type = efalse = graph()->NewNode( in ReduceIsInstanceType() 215 graph()->NewNode(simplified()->NumberEqual(), map_instance_type, in ReduceIsInstanceType() 218 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceIsInstanceType() [all …]
|
/external/clang/lib/Rewrite/ |
D | RewriteRope.cpp | 308 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 …]
|
D | DeltaTree.cpp | 302 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/subzero/src/ |
D | IceCfgNode.cpp | 287 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 …]
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
D | LegalizeTypes.cpp | 77 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 …]
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | LegalizeTypes.cpp | 78 if (Node.getNodeId() == NewNode) in PerformExpensiveChecks() 92 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks() 103 assert(NewVal.getNode()->getNodeId() != NewNode && in PerformExpensiveChecks() 125 if ((Node.getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks() 126 (Node.getNodeId() != NewNode && Mapped != 0)) { in PerformExpensiveChecks() 173 assert(UI->getNodeId() == NewNode && "NewNode used by non-NewNode!"); in PerformExpensiveChecks() 330 N->setNodeId(NewNode); in run() 345 assert(N->getNodeId() == NewNode && "Unexpected node state!"); in run() 382 if (NodeId == NewNode) in run() 443 if (Node.getNodeId() == NewNode) in run() [all …]
|