Searched refs:BLI (Results 1 – 4 of 4) sorted by relevance
107 const BinaryLoopInfo &BLI = BF.getLoopInfo(); in checkFunction() local108 FuncInfo.NumLoops = BLI.OuterLoops; in checkFunction()109 FuncInfo.MaxLoopDepth = BLI.MaximumDepth; in checkFunction()
359 const BinaryLoopInfo &BLI = BF.getLoopInfo(); in createLoopNestLevelMap() local362 LoopNestLevel[&BB] = BLI[&BB]; in createLoopNestLevelMap()
3015 if (BLI && BLI->getLoopFor(BB)) { in dumpGraph()3017 const BinaryLoop *Loop = BLI->getLoopFor(BB); in dumpGraph()3971 BLI.reset(new BinaryLoopInfo()); in calculateLoopInfo()3972 BLI->analyze(DomTree); in calculateLoopInfo()3976 for (auto I = BLI->begin(), E = BLI->end(); I != E; ++I) { in calculateLoopInfo()3978 ++BLI->OuterLoops; in calculateLoopInfo()3984 ++BLI->TotalLoops; in calculateLoopInfo()3985 BLI->MaximumDepth = std::max(L->getLoopDepth(), BLI->MaximumDepth); in calculateLoopInfo()4400 for_each(*BLI, [&](BinaryLoop *L) { St.push(L); }); in printLoopInfo()4431 OS << "Total number of loops: " << BLI->TotalLoops << "\n"; in printLoopInfo()[all …]
255 std::unique_ptr<BinaryLoopInfo> BLI; variable854 bool hasLoopInfo() const { return BLI != nullptr; } in hasLoopInfo()856 const BinaryLoopInfo &getLoopInfo() { return *BLI.get(); } in getLoopInfo()861 return BLI->empty(); in isLoopFree()