Searched refs:Edges (Results 1 – 11 of 11) sorted by relevance
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 189 EdgeVector Edges; variable
203 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
204 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
226 Edges[EId] = std::move(E); in addConstructedEdge()
228 EId = Edges.size(); in addConstructedEdge()
229 Edges.push_back(std::move(E)); in addConstructedEdge()
281 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { in EdgeItr()
321 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
322 bool empty() const { return G.Edges.empty(); } in empty()
324 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CFLAliasAnalysis.cpp | 518 std::vector<Edge> Edges; member
573 EdgeIterable(const std::vector<Edge> &Edges) in EdgeIterable()
574 : BeginIter(Edges.begin()), EndIter(Edges.end()) {} in EdgeIterable()
611 FromNode.Edges.push_back(Edge(Weight, To)); in addEdge()
612 ToNode.Edges.push_back(Edge(ReverseWeight, From)); in addEdge()
617 return EdgeIterable(Node.Edges); in edgesFor()
833 SmallVector<Edge, 8> Edges; in addInstructionToGraph() local
834 argsToEdges(Analysis, &Inst, Edges); in addInstructionToGraph()
838 if (Edges.empty()) { in addInstructionToGraph()
856 for (const Edge &E : Edges) { in addInstructionToGraph()
[all …]
|
| D | BlockFrequencyInfoImpl.cpp | 590 Irr.Edges.push_back(&SuccIrr); in addEdge()
591 SuccIrr.Edges.push_front(&Irr); in addEdge()
|
| /external/llvm/test/Transforms/GCOVProfiling/ |
| D | return-block.ll | 69 ; RETURN-LAST: Destination Edges
70 ; RETURN-SECOND-NOT: Destination Edges
73 ; RETURN-LAST-NOT: Destination Edges
74 ; RETURN-SECOND: Destination Edges
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | PGOInstrumentation.cpp | 391 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount() argument
393 for (auto &E : Edges) { in sumEdgeCount()
422 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
496 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount() argument
497 for (auto &E : Edges) { in setEdgeCount()
|
| D | GCOVProfiling.cpp | 586 unsigned Edges = 0; in emitProfileArcs() local
590 ++Edges; in emitProfileArcs()
592 Edges += TI->getNumSuccessors(); in emitProfileArcs()
596 ArrayType::get(Type::getInt64Ty(*Ctx), Edges); in emitProfileArcs()
|
| /external/llvm/lib/CodeGen/ |
| D | AggressiveAntiDepBreaker.cpp | 253 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { in AntiDepEdges() argument
259 Edges.push_back(&*P); in AntiDepEdges()
811 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
813 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
829 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
830 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
|
| /external/llvm/include/llvm/Analysis/ |
| D | BlockFrequencyInfoImpl.h | 557 std::deque<const IrrNode *> Edges;
561 iterator pred_begin() const { return Edges.begin(); }
562 iterator succ_begin() const { return Edges.begin() + NumIn; }
564 iterator succ_end() const { return Edges.end(); }
|
| /external/llvm/lib/IR/ |
| D | GCOV.cpp | 183 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); in readGCNO()
184 GCOVEdge *Edge = Edges.back().get(); in readGCNO()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 357 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in FindLoopHeaders() local
358 FindFunctionBackedges(F, Edges); in FindLoopHeaders()
360 for (unsigned i = 0, e = Edges.size(); i != e; ++i) in FindLoopHeaders()
361 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second)); in FindLoopHeaders()
|
| /external/llvm/include/llvm/Support/ |
| D | GCOV.h | 293 SmallVector<std::unique_ptr<GCOVEdge>, 16> Edges; variable
|