| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | UnsafeBufferUsage.cpp | 111 void addNode(StringRef ID, const DynTypedNode &Node) { Nodes[ID] = Node; } in addNode() function in __anon8edba8be0211::MatchResult
1076 Result.addNode(Tag, DynTypedNode::create(*UnsafeArg)); in hasUnsafePrintfStringArg()
1090 Result.addNode(Tag, DynTypedNode::create(*UnsafeArg)); in hasUnsafePrintfStringArg()
1105 Result.addNode(Tag, DynTypedNode::create(*UnsafeArg)); in hasUnsafePrintfStringArg()
1115 Result.addNode(Tag, DynTypedNode::create(*Arg)); in hasUnsafePrintfStringArg()
1283 Result.addNode(OpTag, DynTypedNode::create(*UO)); in matches()
1331 Result.addNode(OpTag, DynTypedNode::create(*UO)); in matches()
1384 Result.addNode(ArraySubscrTag, DynTypedNode::create(*ASE)); in matches()
1441 Result.addNode(PointerArithmeticPointerTag, DynTypedNode::create(*LHS)); in matches()
1442 Result.addNode(PointerArithmeticTag, DynTypedNode::create(*BO)); in matches()
[all …]
|
| /freebsd/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()
71 addNode(std::max(AllocUnit, Size)); in allocUnalignedBuffer()
90 addNode(std::max(AllocUnit, Size)); in allocArray()
110 addNode(AllocUnit); in alloc()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | MaterializationUtils.cpp | 61 addNode(std::move(FirstNode), WorkList, cast<User>(I)); in RematGraph()
65 addNode(std::move(N), WorkList, cast<User>(I)); in RematGraph()
69 void addNode(std::unique_ptr<RematNode> NUPtr, in addNode() function
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DDG.h | 331 bool addNode(NodeType &N);
356 Graph.addNode(*RN); in createRootNode()
362 Graph.addNode(*SN); in createFineGrainedNode()
368 Graph.addNode(*Pi); in createPiBlock()
|
| H A D | BlockFrequencyInfoImpl.h | 642 void addNode(const BlockNode &Node) {
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | ExplodedGraph.cpp | 204 Preds.addNode(V, G); in addPredecessor()
205 V->Succs.addNode(this, G); in addPredecessor()
217 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 | 532 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 | 641 addNode(N); in addNodesInLoop()
649 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/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 679 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph()
|
| /freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchersInternal.h | 219 void addNode(StringRef ID, const DynTypedNode &DynNode) {
297 Binding.addNode(Id, DynNode);
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Testing/Demangle/ |
| H A D | DemangleTestCases.inc | 7575 …dNodeEPS1_RNS0_13ExplodedGraphE", "clang::ento::ExplodedNode::NodeGroup::addNode(clang::ento::Expl…
14901 …se7addNodeEPKN4llvm5SUnitE", "(anonymous namespace)::RegReductionPQBase::addNode(llvm::SUnit const…
17463 {"_ZN4llvm20LatencyPriorityQueue7addNodeEPKNS_5SUnitE", "llvm::LatencyPriorityQueue::addNode(llvm::…
|