Home
last modified time | relevance | path

Searched refs:Edges (Results 1 – 11 of 11) sorted by relevance

/NextBSD/contrib/llvm/include/llvm/CodeGen/PBQP/
HDGraph.h189 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 …]
/NextBSD/contrib/llvm/lib/Analysis/
HDCFLAliasAnalysis.cpp613 std::vector<Edge> Edges; member
668 EdgeIterable(const std::vector<Edge> &Edges) in EdgeIterable()
669 : BeginIter(Edges.begin()), EndIter(Edges.end()) {} in EdgeIterable()
706 FromNode.Edges.push_back(Edge(Weight, To)); in addEdge()
707 ToNode.Edges.push_back(Edge(ReverseWeight, From)); in addEdge()
712 return EdgeIterable(Node.Edges); in edgesFor()
943 SmallVector<Edge, 8> Edges; in addInstructionToGraph() local
944 argsToEdges(Analysis, &Inst, Edges); in addInstructionToGraph()
948 if (Edges.empty()) { in addInstructionToGraph()
966 for (const Edge &E : Edges) { in addInstructionToGraph()
[all …]
HDBlockFrequencyInfoImpl.cpp583 Irr.Edges.push_back(&SuccIrr); in addEdge()
584 SuccIrr.Edges.push_front(&Irr); in addEdge()
/NextBSD/contrib/llvm/lib/CodeGen/
HDAggressiveAntiDepBreaker.cpp254 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { in AntiDepEdges() argument
260 Edges.push_back(&*P); in AntiDepEdges()
803 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
805 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
821 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
822 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
/NextBSD/contrib/llvm/include/llvm/Analysis/
HDBlockFrequencyInfoImpl.h555 std::deque<const IrrNode *> Edges;
559 iterator pred_begin() const { return Edges.begin(); }
560 iterator succ_begin() const { return Edges.begin() + NumIn; }
562 iterator succ_end() const { return Edges.end(); }
/NextBSD/contrib/llvm/lib/Transforms/Instrumentation/
HDGCOVProfiling.cpp581 unsigned Edges = 0; in emitProfileArcs() local
585 ++Edges; in emitProfileArcs()
587 Edges += TI->getNumSuccessors(); in emitProfileArcs()
591 ArrayType::get(Type::getInt64Ty(*Ctx), Edges); in emitProfileArcs()
/NextBSD/contrib/llvm/lib/IR/
HDGCOV.cpp183 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); in readGCNO()
184 GCOVEdge *Edge = Edges.back().get(); in readGCNO()
/NextBSD/contrib/llvm/lib/Transforms/Scalar/
HDJumpThreading.cpp310 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in FindLoopHeaders() local
311 FindFunctionBackedges(F, Edges); in FindLoopHeaders()
313 for (unsigned i = 0, e = Edges.size(); i != e; ++i) in FindLoopHeaders()
314 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second)); in FindLoopHeaders()
/NextBSD/contrib/gcc/doc/
HDcfg.texi26 * Edges:: Types of edges and their representation.
137 @node Edges
138 @section Edges
142 Edges represent possible control flow transfers from the end of some
144 a predecessor of B, and B is a successor of A@. Edges are represented
/NextBSD/contrib/llvm/include/llvm/Support/
HDGCOV.h288 SmallVector<std::unique_ptr<GCOVEdge>, 16> Edges; variable
/NextBSD/contrib/gcc/
HDChangeLog-20042320 * doc/cfg.texi (Edges): Update. Document the edge_iterator data
28054 * doc/cfg.texi (Edges): Fix typo.