Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/XRay/
H A DGraph.h113 EdgeMapT Edges;
322 iterator begin() { return G.Edges.begin(); } in begin()
323 iterator end() { return G.Edges.end(); } in end()
342 Edges.clear(); in clear()
390 auto &P = Edges.FindAndConstruct(I);
419 auto It = Edges.find(I); in at()
420 if (It == Edges.end()) in at()
428 auto It = Edges.find(I); in at()
429 if (It == Edges.end()) in at()
463 const auto &p = Edges.insert(Val); in insert()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h258 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
259 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
273 auto &E = Edges[EI->second]; in lookup()
278 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
287 for (auto &E : Edges) in empty()
295 VectorT Edges;
377 if (Edges) in populate()
378 return *Edges; in populate()
393 Optional<EdgeSequence> Edges; variable
[all …]
H A DBlockFrequencyInfoImpl.h606 std::deque<const IrrNode *> Edges;
612 iterator pred_begin() const { return Edges.begin(); }
613 iterator succ_begin() const { return Edges.begin() + NumIn; }
615 iterator succ_end() const { return Edges.end(); }
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h174 EdgeVector Edges; variable
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
213 Edges[EId] = std::move(E); in addConstructedEdge()
215 EId = Edges.size(); in addConstructedEdge()
216 Edges.push_back(std::move(E)); in addConstructedEdge()
307 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
309 bool empty() const { return G.Edges.empty(); } in empty()
312 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
660 Edges[EId].invalidate(); in removeEdge()
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyCallGraph.cpp45 EdgeIndexMap.insert({&TargetN, Edges.size()}); in insertEdgeInternal()
46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
50 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
58 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
66 if (!EdgeIndexMap.insert({&N, Edges.size()}).second) in addEdge()
70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
79 Edges = EdgeSequence(); in populateSlow()
108 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
122 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), in populateSlow()
130 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), in populateSlow()
[all …]
H A DCFLGraph.h71 EdgeList Edges, ReverseEdges; member
134 FromInfo->Edges.push_back(Edge{To, Offset});
H A DCFLSteensAliasAnalysis.cpp218 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) in buildSetsFrom()
H A DCFLAndersAliasAnalysis.cpp617 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) { in initializeWorkList()
683 for (const auto &AssignEdge : NodeInfo->Edges) in processWorkListItem()
H A DBlockFrequencyInfoImpl.cpp657 Irr.Edges.push_back(&SuccIrr); in addEdge()
658 SuccIrr.Edges.push_front(&Irr); in addEdge()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp153 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
154 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
156 for (unsigned i = 0, e = Edges.size(); i != e; ++i) in iterativelySimplifyCFG()
157 LoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second)); in iterativelySimplifyCFG()
H A DJumpThreading.cpp545 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in FindLoopHeaders() local
546 FindFunctionBackedges(F, Edges); in FindLoopHeaders()
548 for (const auto &Edge : Edges) in FindLoopHeaders()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp931 Edges) { in getBestNonConflictingEdges() argument
941 std::stable_sort(Edges[0].begin(), Edges[0].end(), Cmp); in getBestNonConflictingEdges()
942 std::stable_sort(Edges[1].begin(), Edges[1].end(), Cmp); in getBestNonConflictingEdges()
943 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
944 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
989 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1134 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
1137 : Edges({src, dst}) {} in precomputeTriangleChains()
1142 Edges.push_back(dst); in precomputeTriangleChains()
1148 return Edges.back(); in precomputeTriangleChains()
[all …]
H A DAggressiveAntiDepBreaker.cpp266 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
272 Edges.push_back(&*P); in AntiDepEdges()
833 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
835 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
851 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
852 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
/freebsd-12.1/contrib/llvm/lib/Target/X86/
H A DX86DomainReassignment.cpp304 DenseSet<unsigned> Edges; member in __anon76e4914e0111::Closure
334 bool empty() const { return Edges.empty(); } in empty()
337 return Edges.insert(Reg).second; in insertEdge()
342 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end()); in edges()
356 for (unsigned Reg : Edges) { in dump()
/freebsd-12.1/contrib/llvm/include/llvm/ProfileData/
H A DGCOV.h308 SmallVector<std::unique_ptr<GCOVEdge>, 16> Edges; variable
330 using Edges = SmallVector<GCOVEdge *, 4>; variable
374 static uint64_t getCycleCount(const Edges &Path);
378 Edges &Path, BlockVector &Blocked,
/freebsd-12.1/contrib/llvm/lib/ProfileData/
H A DGCOV.cpp188 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); in readGCNO()
189 GCOVEdge *Edge = Edges.back().get(); in readGCNO()
447 uint64_t GCOVBlock::getCycleCount(const Edges &Path) { in getCycleCount()
477 Edges &Path, BlockVector &Blocked, in lookForCircuit()
527 Edges Path; in getCyclesCount()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DModuleSummaryIndex.h499 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
505 std::vector<ValueInfo>(), std::move(Edges),
920 std::vector<FunctionSummary::EdgeTy> Edges;
925 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
927 if (Edges.empty()) {
931 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp131 std::map<Node,NodeSet> Edges; member
172 Edges[I].insert(PC); in build()
183 NodeSet &Is = Edges[I]; in build()
206 NodeSet &Ns = Edges[N]; in color()
214 for (auto E : Edges) { in color()
227 for (auto E : Edges) { in color()
235 NodeSet &Ns = Edges[N]; in color()
246 NodeSet &Cs = Edges[C]; in color()
253 Edges[M].insert(C); in color()
255 Edges[M].erase(N); in color()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp839 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount() argument
841 for (auto &E : Edges) { in sumEdgeCount()
937 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
1001 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount() argument
1002 for (auto &E : Edges) { in setEdgeCount()
H A DGCOVProfiling.cpp779 unsigned Edges = 0; in emitProfileArcs() local
783 EdgeToCounter[{&BB, nullptr}] = Edges++; in emitProfileArcs()
786 EdgeToCounter[{&BB, Succ}] = Edges++; in emitProfileArcs()
792 ArrayType::get(Type::getInt64Ty(*Ctx), Edges); in emitProfileArcs()
/freebsd-12.1/contrib/gcc/doc/
H A Dcfg.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
/freebsd-12.1/contrib/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp5483 std::vector<FunctionSummary::EdgeTy> Edges = makeCallList( in parseEntireSummary() local
5490 std::move(Refs), std::move(Edges), std::move(PendingTypeTests), in parseEntireSummary()
/freebsd-12.1/contrib/gcc/
H A DChangeLog-20042320 * doc/cfg.texi (Edges): Update. Document the edge_iterator data
28054 * doc/cfg.texi (Edges): Fix typo.