| /freebsd/contrib/llvm-project/llvm/include/llvm/Demangle/ |
| H A D | MicrosoftDemangle.h | 35 void addNode(size_t Capacity) { in addNode() function
45 ArenaAllocator() { addNode(AllocUnit); } in ArenaAllocator()
66 addNode(std::max(AllocUnit, Size)); in allocUnalignedBuffer()
85 addNode(std::max(AllocUnit, Size)); in allocArray()
105 addNode(AllocUnit); in alloc()
|
| /freebsd/contrib/llvm-project/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()
|
| H A D | BlockFrequencyInfoImpl.h | 648 void addNode(const BlockNode &Node) {
|
| /freebsd/contrib/llvm-project/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
|
| /freebsd/contrib/llvm-project/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;
|
| /freebsd/contrib/llvm-project/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
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| 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 | 656 addNode(N); in addNodesInLoop()
664 addNode(Index); in addNodesInFunction()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 1117 AvailableQueue->addNode(LoadSU); in TryUnfoldSU()
1119 AvailableQueue->addNode(NewSU); in TryUnfoldSU()
1211 AvailableQueue->addNode(NewSU); in CopyAndMoveSuccessors()
1262 AvailableQueue->addNode(CopyFromSU); in InsertCopiesAndMoveSuccs()
1263 AvailableQueue->addNode(CopyToSU); in InsertCopiesAndMoveSuccs()
1789 void addNode(const SUnit *SU) override;
2026 void RegReductionPQBase::addNode(const SUnit *SU) { in addNode() function in RegReductionPQBase
|
| /freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 107 void addNode(ExplodedNode *N, ExplodedGraph &G);
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 375 NodeId addNode(OtherVectorT Costs) { in addNode() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroFrame.cpp | 369 addNode(std::move(FirstNode), WorkList, cast<User>(I)); in RematGraph()
373 addNode(std::move(N), WorkList, cast<User>(I)); in RematGraph()
377 void addNode(std::unique_ptr<RematNode> NUPtr, in addNode() function
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph()
|
| /freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchersInternal.h | 220 void addNode(StringRef ID, const DynTypedNode &DynNode) {
298 Binding.addNode(Id, DynNode);
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 146 void addNode(Node &N) { Nodes.push_back(N); } in addNode() function in clang::diff::SyntaxTree::Impl
|