Home
last modified time | relevance | path

Searched refs:SCCs (Results 1 – 6 of 6) sorted by relevance

/external/llvm/lib/Analysis/
DLazyCallGraph.cpp211 assert(!SCCs.empty() && "Can't have an empty SCC!"); in verify()
214 for (SCC *C : SCCs) { in verify()
226 assert(SCCs[i] == C && "Index doesn't point to SCC!"); in verify()
230 for (int i = 0, Size = SCCs.size(); i < Size; ++i) { in verify()
231 SCC &SourceSCC = *SCCs[i]; in verify()
357 make_range(SCCs.begin() + SourceIdx + 1, SCCs.begin() + TargetIdx + 1)) in switchInternalEdgeToCall()
365 SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx + 1, in switchInternalEdgeToCall()
368 SCCIndices.find(SCCs[i])->second = i; in switchInternalEdgeToCall()
373 assert(SourceI > (SCCs.begin() + SourceIdx) && in switchInternalEdgeToCall()
384 assert(SCCs[TargetIdx] == &TargetSCC && in switchInternalEdgeToCall()
[all …]
/external/llvm/test/Analysis/LazyCallGraph/
Dbasic.ll256 ; Verify the SCCs formed.
258 ; CHECK-LABEL: RefSCC with 1 call SCCs:
264 ; CHECK-LABEL: RefSCC with 2 call SCCs:
270 ; CHECK-LABEL: RefSCC with 3 call SCCs:
281 ; CHECK-LABEL: RefSCC with 1 call SCCs:
285 ; CHECK-LABEL: RefSCC with 1 call SCCs:
289 ; CHECK-LABEL: RefSCC with 1 call SCCs:
293 ; CHECK-LABEL: RefSCC with 1 call SCCs:
297 ; CHECK-LABEL: RefSCC with 1 call SCCs:
301 ; CHECK-LABEL: RefSCC with 1 call SCCs:
[all …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h447 SmallVector<SCC *, 4> SCCs; variable
471 OS << "..., " << *RC.SCCs.back();
503 iterator begin() const { return SCCs.begin(); } in begin()
504 iterator end() const { return SCCs.end(); } in end()
506 ssize_t size() const { return SCCs.size(); } in size()
508 SCC &operator[](int Idx) { return *SCCs[Idx]; }
511 return SCCs.begin() + SCCIndices.find(&C)->second; in find()
/external/llvm/test/Analysis/BlockFrequencyInfo/
Dirreducible.ll45 ; In addition to loops, -block-freq has limited support for irreducible SCCs,
46 ; which are SCCs with multiple entry blocks. Irreducible SCCs are discovered
49 ; The headers of irreducible sub-SCCs consist of its entry blocks and all nodes
190 ; Two unrelated irreducible SCCs.
/external/llvm/docs/
DPasses.rst279 ``-print-callgraph-sccs``: Print SCCs of the Call Graph
282 This pass, only available in ``opt``, prints the SCCs of the call graph to
285 ``-print-cfg-sccs``: Print SCCs of each function CFG
288 This pass, only available in ``opt``, printsthe SCCs of each function CFG to
DWritingAnLLVMPass.rst394 has to handle SCCs with more than one node in it. All of the virtual methods
409 SCCs being processed. The ``doInitialization`` method call is not scheduled to