HomeSort by: relevance | last modified time | path
    Searched refs:addNode (Results 1 - 17 of 17) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
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(To)
    [all...]
DDG.cpp 221 bool DataDependenceGraph::addNode(DDGNode &N) {
222 if (!DDGBase::addNode(N))
BlockFrequencyInfoImpl.cpp 651 addNode(N);
659 addNode(Index);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
LatencyPriorityQueue.h 57 void addNode(const SUnit *SU) override {
ResourcePriorityQueue.h 83 void addNode(const SUnit *SU) override {
ScheduleDAG.h 510 virtual void addNode(const SUnit *SU) = 0;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/
MicrosoftDemangle.h 36 void addNode(size_t Capacity) {
46 ArenaAllocator() { addNode(AllocUnit); }
67 addNode(std::max(AllocUnit, Size));
86 addNode(std::max(AllocUnit, Size));
106 addNode(AllocUnit);
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 207 Preds.addNode(V, G);
208 V->Succs.addNode(this, G);
220 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DDG.h 340 bool addNode(NodeType &N);
364 Graph.addNode(*RN);
370 Graph.addNode(*SN);
376 Graph.addNode(*Pi);
BlockFrequencyInfoImpl.h 648 void addNode(const BlockNode &Node) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
DirectedGraph.h 182 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); }
216 bool addNode(NodeType &N) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
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) {
  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 106 void addNode(ExplodedNode *N, ExplodedGraph &G);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
Graph.h 375 NodeId addNode(OtherVectorT Costs) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegAllocPBQP.cpp 682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts));
  /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
ASTMatchersInternal.h 224 void addNode(StringRef ID, const DynTypedNode &DynNode) {
302 Binding.addNode(Id, DynNode);
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 147 void addNode(Node &N) { Nodes.push_back(N); }

Completed in 62 milliseconds