Searched refs:addNode (Results 1 - 9 of 9) sorted by relevance

/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h57 void addNode(const SUnit *SU) { function in class:llvm::LatencyPriorityQueue
H A DResourcePriorityQueue.h88 void addNode(const SUnit *SU) { function in class:llvm::ResourcePriorityQueue
H A DScheduleDAG.h493 virtual void addNode(const SUnit *SU) = 0;
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp215 Preds.addNode(V, G);
216 V->Succs.addNode(this, G);
231 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { function in class:ExplodedNode::NodeGroup
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h95 void addNode(ExplodedNode *N, ExplodedGraph &G);
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h213 NodeId addNode(const Vector &costs) { function in class:PBQP::Graph
472 // nodeMap[nItr] = addNode(other.getNodeCosts(nItr));
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp1086 AvailableQueue->addNode(LoadSU);
1087 AvailableQueue->addNode(NewSU);
1127 AvailableQueue->addNode(NewSU);
1179 AvailableQueue->addNode(CopyFromSU);
1180 AvailableQueue->addNode(CopyToSU);
1680 void addNode(const SUnit *SU);
1876 void RegReductionPQBase::addNode(const SUnit *SU) {
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp250 g.addNode(PBQP::Vector(vrAllowed.size() + 1, 0));
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h71 void addNode(StringRef ID, const T* Node) { function in class:clang::ast_matchers::internal::BoundNodesMap
139 Bindings[i].addNode(Id, Node);

Completed in 132 milliseconds