| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | DirectedGraphTest.cpp | 143 DG.addNode(N1); in TEST()
144 DG.addNode(N2); in TEST()
145 DG.addNode(N3); in TEST()
189 DG.addNode(N1); in TEST()
190 DG.addNode(N2); in TEST()
191 DG.addNode(N3); in TEST()
213 DG.addNode(N1); in TEST()
214 DG.addNode(N2); in TEST()
215 DG.addNode(N3); in TEST()
251 DG.addNode(N1); in TEST()
[all …]
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/unittests/ |
| H A D | GLRTest.cpp | 216 const auto *GSSNode4 = GSStack.addNode( in TEST_F()
260 const auto *GSSNode1 = GSStack.addNode( in TEST_F()
262 const auto *GSSNode2 = GSStack.addNode( in TEST_F()
264 const auto *GSSNode3 = GSStack.addNode( in TEST_F()
690 auto *Root = GSStack.addNode(0, nullptr, {}); in TEST()
691 auto *A = GSStack.addNode(0, nullptr, {Root}); in TEST()
692 auto *B = GSStack.addNode(0, nullptr, {Root}); in TEST()
693 auto *C = GSStack.addNode(0, nullptr, {Root}); in TEST()
694 auto *D = GSStack.addNode(0, nullptr, {Root}); in TEST()
695 auto *AB = GSStack.addNode(0, nullptr, {A, B}); in TEST()
[all …]
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | CFLGraph.h | 223 addNode(From);
225 addNode(To);
240 addNode(From); in addDerefEdge()
241 addNode(To); in addDerefEdge()
266 addNode(RetVal); in visitReturnInst()
274 addNode(Ptr, getAttrEscaped()); in visitPtrToIntInst()
279 addNode(Ptr, getAttrUnknown()); in visitIntToPtrInst()
375 addNode(&Inst, getAttrUnknown()); in visitVAArgInst()
428 addNode(V); in visitCallBase()
430 addNode(&Call); in visitCallBase()
[all …]
|
| H A D | DDG.cpp | 220 bool DataDependenceGraph::addNode(DDGNode &N) { in addNode() function in DataDependenceGraph
221 if (!DDGBase::addNode(N)) in addNode()
|
| H A D | BlockFrequencyInfoImpl.cpp | 664 addNode(N); in addNodesInLoop()
672 addNode(Index); in addNodesInFunction()
|
| /llvm-project-15.0.7/llvm/include/llvm/Demangle/ |
| H A D | MicrosoftDemangle.h | 34 void addNode(size_t Capacity) { in addNode() function
44 ArenaAllocator() { addNode(AllocUnit); } in ArenaAllocator()
65 addNode(std::max(AllocUnit, Size)); in allocUnalignedBuffer()
84 addNode(std::max(AllocUnit, Size)); in allocArray()
104 addNode(AllocUnit); in alloc()
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | BinaryFunctionCallGraph.cpp | 30 CallGraph::NodeId BinaryFunctionCallGraph::addNode(BinaryFunction *BF, in addNode() function in llvm::bolt::BinaryFunctionCallGraph
33 NodeId Id = CallGraph::addNode(Size, Samples); in addNode()
116 return Cg.addNode(Function, Size, Function->getKnownExecutionCount()); in buildCallGraph()
|
| H A D | CallGraph.cpp | 76 CallGraph::NodeId CallGraph::addNode(uint32_t Size, uint64_t Samples) { in addNode() function in llvm::bolt::CallGraph
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/lib/ |
| H A D | GLR.cpp | 191 Params.GSStack.addNode(NewState, &Placeholder, {Option->RecoveryNode}); in glrRecover()
254 NewHeads.push_back(Params.GSStack.addNode(NextState, &NewTok, Parents)); in glrShift()
538 Heads->push_back(Params.GSStack.addNode(NextState, Parsed, Parents)); in pushNext()
585 Heads->push_back(Params.GSStack.addNode(*NextState, Parsed, {Base})); in popAndPushTrivial()
601 std::vector<const GSS::Node *> Heads = {GSS.addNode(/*State=*/StartState, in glrParse()
686 const GSS::Node *GSS::addNode(LRTable::StateID State, const ForestNode *Symbol, in addNode() function in clang::pseudo::GSS
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | DDG.h | 330 bool addNode(NodeType &N);
354 Graph.addNode(*RN); in createRootNode()
360 Graph.addNode(*SN); in createFineGrainedNode()
366 Graph.addNode(*Pi); in createPiBlock()
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/ |
| H A D | ExplodedGraph.cpp | 206 Preds.addNode(V, G); in addPredecessor()
207 V->Succs.addNode(this, G); in addPredecessor()
219 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { in addNode() function in ExplodedNode::NodeGroup
|
| /llvm-project-15.0.7/bolt/include/bolt/Passes/ |
| H A D | BinaryFunctionCallGraph.h | 42 NodeId addNode(BinaryFunction *BF, uint32_t Size, uint64_t Samples = 0);
|
| H A D | CallGraph.h | 124 NodeId addNode(uint32_t Size, uint64_t Samples = 0);
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | LatencyPriorityQueue.h | 57 void addNode(const SUnit *SU) override { in addNode() function
|
| H A D | ResourcePriorityQueue.h | 83 void addNode(const SUnit *SU) override { in addNode() function
|
| H A D | ScheduleDAG.h | 510 virtual void addNode(const SUnit *SU) = 0;
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | DirectedGraph.h | 183 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph()
217 bool addNode(NodeType &N) { in addNode() function
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/include/clang-pseudo/ |
| H A D | GLR.h | 91 const Node *addNode(LRTable::StateID State, const ForestNode *Symbol,
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 1120 AvailableQueue->addNode(LoadSU); in TryUnfoldSU()
1122 AvailableQueue->addNode(NewSU); in TryUnfoldSU()
1214 AvailableQueue->addNode(NewSU); in CopyAndMoveSuccessors()
1265 AvailableQueue->addNode(CopyFromSU); in InsertCopiesAndMoveSuccs()
1266 AvailableQueue->addNode(CopyToSU); in InsertCopiesAndMoveSuccs()
1795 void addNode(const SUnit *SU) override;
2032 void RegReductionPQBase::addNode(const SUnit *SU) { in addNode() function in RegReductionPQBase
|
| /llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 106 void addNode(ExplodedNode *N, ExplodedGraph &G);
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 375 NodeId addNode(OtherVectorT Costs) { in addNode() function
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | LoopFusion.cpp | 224 unsigned addNode(Operation *op) { in addNode() function
1661 mdg->addNode(newMemRef.getDefiningOp()); in fuseProducerConsumerNodes()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph()
|
| /llvm-project-15.0.7/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchersInternal.h | 221 void addNode(StringRef ID, const DynTypedNode &DynNode) {
299 Binding.addNode(Id, DynNode);
|
| /llvm-project-15.0.7/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 147 void addNode(Node &N) { Nodes.push_back(N); } in addNode() function in clang::diff::SyntaxTree::Impl
|