| /freebsd-13.1/contrib/llvm-project/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 | 221 bool DataDependenceGraph::addNode(DDGNode &N) { in addNode() function in DataDependenceGraph
222 if (!DDGBase::addNode(N)) in addNode()
|
| H A D | BlockFrequencyInfoImpl.cpp | 665 addNode(N); in addNodesInLoop()
673 addNode(Index); in addNodesInFunction()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Demangle/ |
| H A D | MicrosoftDemangle.h | 36 void addNode(size_t Capacity) { in addNode() function
46 ArenaAllocator() { addNode(AllocUnit); } in ArenaAllocator()
67 addNode(std::max(AllocUnit, Size)); in allocUnalignedBuffer()
86 addNode(std::max(AllocUnit, Size)); in allocArray()
106 addNode(AllocUnit); in alloc()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DDG.h | 340 bool addNode(NodeType &N);
364 Graph.addNode(*RN); in createRootNode()
370 Graph.addNode(*SN); in createFineGrainedNode()
376 Graph.addNode(*Pi); in createPiBlock()
|
| H A D | BlockFrequencyInfoImpl.h | 648 void addNode(const BlockNode &Node) {
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | ExplodedGraph.cpp | 207 Preds.addNode(V, G); in addPredecessor()
208 V->Succs.addNode(this, G); in addPredecessor()
220 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { in addNode() function in ExplodedNode::NodeGroup
|
| /freebsd-13.1/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-13.1/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | DirectedGraph.h | 182 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph()
216 bool addNode(NodeType &N) { in addNode() function
|
| /freebsd-13.1/contrib/llvm-project/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()
1782 void addNode(const SUnit *SU) override;
2019 void RegReductionPQBase::addNode(const SUnit *SU) { in addNode() function in RegReductionPQBase
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 106 void addNode(ExplodedNode *N, ExplodedGraph &G);
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 375 NodeId addNode(OtherVectorT Costs) { in addNode() function
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchersInternal.h | 224 void addNode(StringRef ID, const DynTypedNode &DynNode) {
302 Binding.addNode(Id, DynNode);
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph()
|
| /freebsd-13.1/contrib/llvm-project/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
|