/netbsd-current/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | CFLGraph.h | 112 bool addNode(Node N, AliasAttrs Attr = AliasAttrs()) { 204 void addNode(Value *Val, AliasAttrs Attr = AliasAttrs()) { 207 if (Graph.addNode(InstantiatedValue{GVal, 0}, 209 Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown()); 212 if (Graph.addNode(InstantiatedValue{CExpr, 0})) 216 Graph.addNode(InstantiatedValue{Val, 0}, Attr); 223 addNode(From); 225 addNode(To); 240 addNode(From); 241 addNode(T [all...] |
H A D | DDG.cpp | 221 bool DataDependenceGraph::addNode(DDGNode &N) { function in class:DataDependenceGraph 222 if (!DDGBase::addNode(N))
|
H A D | BlockFrequencyInfoImpl.cpp | 651 addNode(N); 659 addNode(Index);
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
H A D | LatencyPriorityQueue.h | 57 void addNode(const SUnit *SU) override {
|
H A D | ResourcePriorityQueue.h | 83 void addNode(const SUnit *SU) override {
|
H A D | ScheduleDAG.h | 510 virtual void addNode(const SUnit *SU) = 0;
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Demangle/ |
H A D | MicrosoftDemangle.h | 36 void addNode(size_t Capacity) { function in class:llvm::ms_demangle::ArenaAllocator 46 ArenaAllocator() { addNode(AllocUnit); } 67 addNode(std::max(AllocUnit, Size)); 86 addNode(std::max(AllocUnit, Size)); 106 addNode(AllocUnit);
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 207 Preds.addNode(V, G); 208 V->Succs.addNode(this, G); 220 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { function in class:ExplodedNode::NodeGroup
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | DDG.h | 340 bool addNode(NodeType &N); 364 Graph.addNode(*RN); 370 Graph.addNode(*SN); 376 Graph.addNode(*Pi);
|
H A D | BlockFrequencyInfoImpl.h | 648 void addNode(const BlockNode &Node) { function in struct:llvm::bfi_detail::IrreducibleGraph
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
H A D | DirectedGraph.h | 182 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } 216 bool addNode(NodeType &N) { function
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 1120 AvailableQueue->addNode(LoadSU); 1122 AvailableQueue->addNode(NewSU); 1214 AvailableQueue->addNode(NewSU); 1265 AvailableQueue->addNode(CopyFromSU); 1266 AvailableQueue->addNode(CopyToSU); 1782 void addNode(const SUnit *SU) override; 2019 void RegReductionPQBase::addNode(const SUnit *SU) {
|
/netbsd-current/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 106 void addNode(ExplodedNode *N, ExplodedGraph &G);
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 375 NodeId addNode(OtherVectorT Costs) { function in class:llvm::PBQP::Graph
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts));
|
/netbsd-current/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchersInternal.h | 224 void addNode(StringRef ID, const DynTypedNode &DynNode) { function in class:clang::ast_matchers::internal::BoundNodesMap 302 Binding.addNode(Id, DynNode);
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/ |
H A D | ASTDiff.cpp | 147 void addNode(Node &N) { Nodes.push_back(N); } function in class:clang::diff::SyntaxTree::Impl
|