| /src/external/bsd/kyua-cli/dist/utils/logging/ |
| macros.hpp | 57 #define LI(message) utils::logging::log(utils::logging::level_info, \
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| WarnMissedTransforms.cpp | 86 static void warnAboutLeftoverTransformations(Function *F, LoopInfo *LI,
88 for (auto *L : LI->getLoopsInPreorder())
101 auto &LI = AM.getResult<LoopAnalysis>(F);
103 warnAboutLeftoverTransformations(&F, &LI, &ORE);
124 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
126 warnAboutLeftoverTransformations(&F, &LI, &ORE);
|
| LoopPassManager.cpp | 192 LoopInfo &LI = AM.getResult<LoopAnalysis>(F);
195 if (LI.empty())
234 appendLoopsToWorklist(LI, Worklist);
236 for (Loop *L : LI)
241 PI.pushBeforeNonSkippedPassCallback([&LAR, &LI](StringRef PassID, Any IR) {
252 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) &&
295 LAR.LI.verify(LAR.DT);
|
| Reg2Mem.cpp | 99 auto *LI = &AM.getResult<LoopAnalysis>(F);
100 unsigned N = SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI));
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanHCFGBuilder.h | 45 LoopInfo *LI;
63 VPlanHCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P)
64 : TheLoop(Lp), LI(LI), Plan(P) {}
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| LazyBlockFrequencyInfo.h | 38 : Calculated(false), F(nullptr), BPIPass(nullptr), LI(nullptr) {}
42 const LoopInfoT *LI) {
45 this->LI = LI;
51 assert(F && BPIPass && LI && "call setAnalysis");
53 *F, BPIPassTrait<BranchProbabilityInfoPassT>::getBPI(BPIPass), *LI);
74 const LoopInfoT *LI;
|
| LazyBranchProbabilityInfo.h | 58 LazyBranchProbabilityInfo(const Function *F, const LoopInfo *LI,
60 : Calculated(false), F(F), LI(LI), TLI(TLI) {}
65 assert(F && LI && "call setAnalysis");
66 BPI.calculate(*F, *LI, TLI, nullptr, nullptr);
80 const LoopInfo *LI;
|
| SyncDependenceAnalysis.h | 64 const LoopInfo &LI);
84 const LoopInfo &LI;
|
| LoopAnalysisManager.h | 56 LoopInfo &LI;
88 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI)
89 : InnerAM(&InnerAM), LI(&LI), MSSAUsed(false) {}
91 : InnerAM(std::move(Arg.InnerAM)), LI(Arg.LI), MSSAUsed(Arg.MSSAUsed) {
99 LI = RHS.LI;
137 LoopInfo *LI;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| LegalizerHelper.h | 48 const LegalizerInfo &LI;
66 const LegalizerInfo &getLegalizerInfo() const { return LI; }
71 LegalizerHelper(MachineFunction &MF, const LegalizerInfo &LI,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Vectorize/ |
| SLPVectorizer.h | 68 LoopInfo *LI = nullptr;
|
| LoopVectorize.h | 143 LoopInfo *LI;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| LazyBlockFrequencyInfo.cpp | 45 // We require DT so it's available when LI is available. The LI updating code
57 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
58 LBFI.setAnalysis(&F, &BPIPass, &LI);
|
| LazyBranchProbabilityInfo.cpp | 46 // We require DT so it's available when LI is available. The LI updating code
58 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
61 LBPI = std::make_unique<LazyBranchProbabilityInfo>(&F, &LI, &TLI);
|
| OptimizationRemarkEmitter.cpp | 36 LoopInfo LI;
37 LI.analyze(DT);
40 BranchProbabilityInfo BPI(*F, LI, nullptr, &DT, nullptr);
43 OwnedBFI = std::make_unique<BlockFrequencyInfo>(*F, BPI, LI);
|
| Delinearization.cpp | 45 LoopInfo *LI;
59 void printDelinearization(raw_ostream &O, Function *F, LoopInfo *LI,
71 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
120 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
125 printDelinearization(O, F, LI, SE);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNRegPressure.cpp | 33 const auto &LI = LIS.getInterval(Reg);
34 if (LI.hasSubRanges()) {
36 for (const auto &S : LI.subranges()) {
46 } else if (LI.liveAt(SI)) {
47 dbgs() << " " << LI << '\n';
249 const auto &LI = LIS.getInterval(Reg);
250 if (LI.hasSubRanges()) {
251 for (const auto &S : LI.subranges())
257 } else if (LI.liveAt(SI)) {
367 const LiveInterval &LI = LIS.getInterval(It.first)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/ |
| NVPTXLowerAlloca.cpp | 90 auto LI = dyn_cast<LoadInst>(AllocaUse.getUser());
91 if (LI && LI->getPointerOperand() == allocaInst &&
92 !LI->isVolatile()) {
93 LI->setOperand(LI->getPointerOperandIndex(), NewASCToGeneric);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyOptimizeLiveIntervals.cpp | 112 LiveInterval &LI = LIS.getInterval(MI->getOperand(0).getReg());
113 LIS.removeVRegDefAt(LI, LIS.getInstructionIndex(*MI).getRegSlot());
|
| /src/games/hack/ |
| hack.terminfo.c | 79 int CO, LI; /* used in pri.c and whatis.c */
88 LI = lines;
89 if (CO < COLNO || LI < ROWNO + 2)
305 while (cury <= LI - 2) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 93 LoopInfoBase<MachineBasicBlock, MachineLoop> LI;
106 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; }
118 inline iterator begin() const { return LI.begin(); }
119 inline iterator end() const { return LI.end(); }
120 bool empty() const { return LI.empty(); }
125 return LI.getLoopFor(BB);
130 return LI.getLoopFor(BB);
135 return LI.getLoopDepth(BB);
140 return LI.isLoopHeader(BB);
147 void releaseMemory() override { LI.releaseMemory();
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 95 LoopInfo *LI = nullptr,
109 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr);
139 LoopInfo *LI;
145 /// SplitCriticalEdge is guaranteed to preserve loop-simplify form if LI is
151 LoopInfo *LI = nullptr,
154 : DT(DT), PDT(PDT), LI(LI), MSSAU(MSSAU) {}
266 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
298 LoopInfo *LI = nullptr,
311 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr
[all...] |
| LoopVersioning.h | 47 ArrayRef<RuntimePointerCheck> Checks, Loop *L, LoopInfo *LI,
141 LoopInfo *LI;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| RegAllocBasic.cpp | 91 void enqueue(LiveInterval *LI) override {
92 Queue.push(LI);
98 LiveInterval *LI = Queue.top();
100 return LI;
150 LiveInterval &LI = LIS->getInterval(VirtReg);
152 Matrix->unassign(LI);
153 aboutToRemoveInterval(LI);
160 LI.clear();
169 LiveInterval &LI = LIS->getInterval(VirtReg);
170 Matrix->unassign(LI);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 321 const LiveInterval &LI = LIs.getInterval(reg);
323 return LI.expiredAt(SI);
|
