Home
last modified time | relevance | path

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

12345

/external/tensorflow/tensorflow/lite/delegates/gpu/common/transformations/
Dremove_noop_test.cc42 auto first_node = graph.NewNode(); in TEST()
45 auto add_node = graph.NewNode(); in TEST()
70 auto first_node = graph.NewNode(); in TEST()
73 auto add_node = graph.NewNode(); in TEST()
97 auto first_node = graph.NewNode(); in TEST()
100 auto add_node = graph.NewNode(); in TEST()
124 auto first_node = graph.NewNode(); in TEST()
127 auto add_node = graph.NewNode(); in TEST()
151 auto node_a = graph.NewNode(); in TEST()
152 auto node_b = graph.NewNode(); in TEST()
[all …]
Dmerge_padding_with_test.cc40 auto pad_node = graph.NewNode(); in TEST()
48 auto conv_node = graph.NewNode(); in TEST()
77 auto pad_node1 = graph.NewNode(); in TEST()
85 auto pad_node2 = graph.NewNode(); in TEST()
93 auto conv_node = graph.NewNode(); in TEST()
126 auto pad_node = graph.NewNode(); in TEST()
136 auto add_node = graph.NewNode(); in TEST()
164 auto pad_node = graph.NewNode(); in TEST()
174 auto add_node = graph.NewNode(); in TEST()
Dadd_quant_adjustments_test.cc62 auto add_node = graph.NewNode(); in TEST()
106 auto add1_node = graph.NewNode(); in TEST()
114 auto quant_node = graph.NewNode(); in TEST()
118 auto add2_node = graph.NewNode(); in TEST()
Dmake_fully_connected_test.cc64 auto conv1x1_node0 = graph.NewNode(); in TEST()
67 auto conv4x4_node1 = graph.NewNode(); in TEST()
70 auto conv1x1_node2 = graph.NewNode(); in TEST()
Dmake_padding_test.cc40 auto concat_node = graph.NewNode(); in TEST()
51 auto const_node = graph.NewNode(); in TEST()
/external/llvm-project/polly/lib/Transform/
DScheduleTreeTransform.cpp196 isl::schedule_node NewNode = in visitBand() local
200 NewNode = isl::manage(isl_schedule_node_band_set_permutable( in visitBand()
201 NewNode.release(), isl_schedule_node_band_get_permutable(Band.get()))); in visitBand()
204 NewNode = isl::manage(isl_schedule_node_band_member_set_coincident( in visitBand()
205 NewNode.release(), i, in visitBand()
208 return NewNode.get_schedule(); in visitBand()
304 isl::schedule NewNode = visit(Sequence.first_child(), Domain, Extensions); in visitSequence() local
309 NewNode = NewNode.sequence(NewChildNode); in visitSequence()
312 return NewNode; in visitSequence()
319 isl::schedule NewNode = visit(Set.first_child(), Domain, Extensions); in visitSet() local
[all …]
/external/tensorflow/tensorflow/lite/delegates/gpu/common/
Dmodel_test.cc32 Node* node = graph.NewNode(); in TEST()
53 Node* node = graph.NewNode(); in TEST()
68 Node* node = graph.NewNode(); in TEST()
77 Node* node = graph.NewNode(); in TEST()
102 Node* node = graph.NewNode(); in TEST()
110 Node* node = graph.NewNode(); in TEST()
125 Node* node = graph.NewNode(); in TEST()
143 node_ = graph_.NewNode(); in SetUp()
174 first_node_ = graph_.NewNode(); in SetUp()
176 second_node_ = graph_.NewNode(); in SetUp()
[all …]
Dlstm_parser.cc127 Node* node = graph->NewNode(); in BuildLstmGate()
144 Node* node = graph->NewNode(); in BuildLstmGate()
159 Node* node = graph->NewNode(); in BuildLstmGate()
171 Node* add_node = graph->NewNode(); in BuildLstmGate()
198 Node* node = graph->NewNode(); in BuildLstmGate()
208 Node* node = graph->NewNode(); in BuildLstmGate()
222 Node* node = graph->NewNode(); in BuildLstmGate()
260 Node* node = graph->NewNode(); in BuildCellStateUpdate()
270 Node* node = graph->NewNode(); in BuildCellStateUpdate()
279 Node* node = graph->NewNode(); in BuildCellStateUpdate()
[all …]
Dmodel_builder.cc105 Node* node = graph->NewNode(); in NewConstNode()
194 Node* node = graph->NewNode(); in Parse()
218 Node* node = graph->NewNode(); in Parse()
265 Node* node = graph->NewNode(); in Parse()
377 Node* node = graph->NewNode(); in Parse()
473 Node* node = graph->NewNode(); in Parse()
552 Node* node = graph->NewNode(); in Parse()
613 Node* node = graph->NewNode(); in Parse()
789 Node* node = graph->NewNode(); in Parse()
806 Node* node = graph->NewNode(); in Parse()
[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/llvm-project/clang/lib/Rewrite/
DRewriteRope.cpp309 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); in insert() local
313 &NewNode->Pieces[0]); in insert()
318 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
321 NewNode->FullRecomputeSizeLocally(); in insert()
325 NewNode->insertAfterLeafInOrder(this); in insert()
331 NewNode->insert(Offset - this->size(), R); in insert()
332 return NewNode; in insert()
548 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); in HandleChildPiece() local
551 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
555 NewNode->NumChildren = NumChildren = WidthFactor; in HandleChildPiece()
[all …]
DDeltaTree.cpp307 DeltaTreeNode *NewNode; in DoSplit() local
314 NewNode = New; in DoSplit()
317 NewNode = new DeltaTreeNode(); in DoSplit()
321 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
325 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
328 NewNode->RecomputeFullDeltaLocally(); in DoSplit()
332 InsertRes.RHS = NewNode; in DoSplit()
/external/llvm-project/compiler-rt/lib/xray/
Dxray_function_call_trie.h406 auto* NewNode = Nodes.AppendEmplace( in enterFunction() local
408 if (UNLIKELY(NewNode == nullptr)) in enterFunction()
410 DCHECK_NE(NewNode, nullptr); in enterFunction()
411 TopNode->Callees.AppendEmplace(NewNode, FId); in enterFunction()
412 if (ShadowStack.AppendEmplace(TSC, NewNode, CPU) == nullptr) in enterFunction()
487 FunctionCallTrie::Node *NewNode; in deepCopyInto() member
515 DCHECK_NE(NP.NewNode, nullptr); in deepCopyInto()
518 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto() local
519 NP.NewNode, NodeIdPairArray(*O.NodeIdPairAllocator), in deepCopyInto()
522 if (UNLIKELY(NewNode == nullptr)) in deepCopyInto()
[all …]
/external/tensorflow/tensorflow/lite/delegates/gpu/gl/compiler/
Dfuse_auto_input_test.cc41 auto* n1 = graph.NewNode(); in TEST()
47 auto* n2 = graph.NewNode(); in TEST()
53 auto* n3 = graph.NewNode(); in TEST()
78 auto* n1 = graph.NewNode(); in TEST()
84 auto* n2 = graph.NewNode(); in TEST()
/external/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 …]
/external/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 …]
/external/llvm-project/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()
134 if ((Node.getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
135 (Node.getNodeId() != NewNode && Mapped != 0)) { in PerformExpensiveChecks()
187 assert(UI->getNodeId() == NewNode && "NewNode used by non-NewNode!"); in PerformExpensiveChecks()
365 N->setNodeId(NewNode); in run()
380 assert(N->getNodeId() == NewNode && "Unexpected node state!"); in run()
418 if (NodeId == NewNode) in run()
472 if (Node.getNodeId() == NewNode) in run()
[all …]
/external/llvm-project/llvm/lib/Transforms/IPO/
DSampleContextTracker.cpp69 ContextTrieNode &NewNode = AllChildContext[Hash]; in moveToChildContext() local
70 NewNode.CallSiteLoc = CallSite; in moveToChildContext()
76 NewNode.setParentContext(this); in moveToChildContext()
77 NodeToUpdate.push(&NewNode); in moveToChildContext()
100 OldParentContext.removeChildContext(OldCallSite, NewNode.getFuncName()); in moveToChildContext()
102 return NewNode; in moveToChildContext()
183 ContextTrieNode *NewNode = getOrCreateContextPath(Context, true); in SampleContextTracker() local
184 assert(!NewNode->getFunctionSamples() && in SampleContextTracker()
186 NewNode->setFunctionSamples(FSamples); in SampleContextTracker()
/external/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.cpp78 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 …]
/external/llvm-project/llvm/lib/Analysis/
DCallGraph.cpp275 CallGraphNode *NewNode) { in replaceCallEdge() argument
281 I->second = NewNode; in replaceCallEdge()
282 NewNode->AddRef(); in replaceCallEdge()
297 CallGraphNode *NewNode = NewCBs[N]; in replaceCallEdge() local
302 J->second = NewNode; in replaceCallEdge()
304 NewNode->AddRef(); in replaceCallEdge()
/external/tensorflow/tensorflow/core/grappler/utils/
Dgraph_view_internal.h782 struct NewNode { struct
783 explicit NewNode(GraphViewT* graph_view, NodeDef&& node) in NewNode() argument
795 inline void UpdateName(NewNode<GraphViewT>* new_node, absl::string_view name) { in UpdateName() argument
805 inline void UpdateOp(NewNode<GraphViewT>* new_node, absl::string_view op) { in UpdateOp()
815 inline void UpdateDevice(NewNode<GraphViewT>* new_node, in UpdateDevice()
827 inline void AddOrUpdateRegularFanin(NewNode<GraphViewT>* new_node, int index, in AddOrUpdateRegularFanin()
841 inline void RemoveRegularFanin(NewNode<GraphViewT>* new_node, int index) { in RemoveRegularFanin()
853 inline void AddControllingFanin(NewNode<GraphViewT>* new_node, in AddControllingFanin()
860 inline void RemoveControllingFanin(NewNode<GraphViewT>* new_node, in RemoveControllingFanin()
867 inline void AddOrUpdateAttribute(NewNode<GraphViewT>* new_node, in AddOrUpdateAttribute()
[all …]
/external/llvm/lib/Transforms/Utils/
DLowerSwitch.cpp272 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
278 NewUpperBound, Val, NewNode, OrigBlock, in switchConvert()
281 UpperBound, Val, NewNode, OrigBlock, in switchConvert()
284 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); in switchConvert()
285 NewNode->getInstList().push_back(Comp); in switchConvert()
287 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert()
288 return NewNode; in switchConvert()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DLowerSwitch.cpp310 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
316 NewUpperBound, Val, NewNode, OrigBlock, in switchConvert()
319 UpperBound, Val, NewNode, OrigBlock, in switchConvert()
322 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); in switchConvert()
323 NewNode->getInstList().push_back(Comp); in switchConvert()
325 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert()
326 return NewNode; in switchConvert()
/external/llvm-project/llvm/lib/Transforms/Utils/
DLowerSwitch.cpp282 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in SwitchConvert() local
289 NewNode, OrigBlock, Default, UnreachableRanges); in SwitchConvert()
292 NewNode, OrigBlock, Default, UnreachableRanges); in SwitchConvert()
294 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); in SwitchConvert()
295 NewNode->getInstList().push_back(Comp); in SwitchConvert()
297 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in SwitchConvert()
298 return NewNode; in SwitchConvert()

12345