| /external/swiftshader/third_party/LLVM/test/Transforms/IndVarSimplify/ |
| D | exit_value_tests.ll | 10 br label %Loop
12 Loop: ; preds = %Loop, %0
13 %A1 = phi i32 [ 0, %0 ], [ %A2, %Loop ] ; <i32> [#uses=3]
14 %B1 = phi i32 [ 0, %0 ], [ %B2, %Loop ] ; <i32> [#uses=1]
18 br i1 %C, label %Out, label %Loop
20 Out: ; preds = %Loop
26 br label %Loop
28 Loop: ; preds = %Loop, %0
29 %X = phi i32 [ 0, %0 ], [ %X2, %Loop ] ; <i32> [#uses=4]
32 br i1 %c, label %Out, label %Loop
[all …]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | exit_value_tests.ll | 10 br label %Loop
12 Loop: ; preds = %Loop, %0
13 %A1 = phi i32 [ 0, %0 ], [ %A2, %Loop ] ; <i32> [#uses=3]
14 %B1 = phi i32 [ 0, %0 ], [ %B2, %Loop ] ; <i32> [#uses=1]
18 br i1 %C, label %Out, label %Loop
20 Out: ; preds = %Loop
26 br label %Loop
28 Loop: ; preds = %Loop, %0
29 %X = phi i32 [ 0, %0 ], [ %X2, %Loop ] ; <i32> [#uses=4]
32 br i1 %c, label %Out, label %Loop
[all …]
|
| /external/v8/src/compiler/ |
| D | loop-analysis.h | 37 class Loop {
39 Loop* parent() const { return parent_; } in parent()
40 const ZoneVector<Loop*>& children() const { return children_; } in children()
51 explicit Loop(Zone* zone) in Loop() function
59 Loop* parent_;
61 ZoneVector<Loop*> children_;
69 Loop* ContainingLoop(Node* node) { in ContainingLoop()
77 bool Contains(Loop* loop, Node* node) { in Contains()
78 for (Loop* c = ContainingLoop(node); c != nullptr; c = c->parent_) { in Contains()
85 const ZoneVector<Loop*>& outer_loops() const { return outer_loops_; } in outer_loops()
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Transforms/LICM/ |
| D | sinking.ll | 9 br label %Loop
11 Loop: ; preds = %Loop, %0
13 br i1 false, label %Loop, label %Out
15 Out: ; preds = %Loop
27 br label %Loop
29 Loop: ; preds = %Loop, %0
32 br i1 true, label %Loop, label %Out
34 Out: ; preds = %Loop
46 br i1 false, label %Loop, label %Exit
47 Loop:
[all …]
|
| D | scalar_promote.ll | 8 br label %Loop
12 ; CHECK-NEXT: br label %Loop
15 Loop: ; preds = %Loop, %0
16 %j = phi i32 [ 0, %Entry ], [ %Next, %Loop ] ; <i32> [#uses=1]
22 br i1 %cond, label %Out, label %Loop
34 br label %Loop
38 ; CHECK-NEXT: br label %Loop
40 Loop: ; preds = %Loop, %0
46 br i1 false, label %Loop, label %Exit
48 Exit: ; preds = %Loop
[all …]
|
| D | hoisting.ll | 12 br label %Loop
13 Loop: ; preds = %LoopTail, %0
17 IfUnEqual: ; preds = %Loop
23 LoopTail: ; preds = %IfUnEqual, %Loop
24 %B = phi i32 [ 0, %Loop ], [ %B1, %IfUnEqual ] ; <i32> [#uses=1]
25 br i1 %c, label %Loop, label %Out
41 br label %Loop
42 Loop:
46 br i1 %c, label %Loop, label %Out
47 Out: ; preds = %Loop
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 38 template class llvm::LoopBase<BasicBlock, Loop>;
39 template class llvm::LoopInfoBase<BasicBlock, Loop>;
55 bool Loop::isLoopInvariant(const Value *V) const { in isLoopInvariant()
61 bool Loop::hasLoopInvariantOperands(const Instruction *I) const { in hasLoopInvariantOperands()
65 bool Loop::makeLoopInvariant(Value *V, bool &Changed, in makeLoopInvariant()
72 bool Loop::makeLoopInvariant(Instruction *I, bool &Changed, in makeLoopInvariant()
110 PHINode *Loop::getCanonicalInductionVariable() const { in getCanonicalInductionVariable()
146 bool Loop::isLCSSAForm(DominatorTree &DT) const { in isLCSSAForm()
176 bool Loop::isRecursivelyLCSSAForm(DominatorTree &DT) const { in isRecursivelyLCSSAForm()
180 return std::all_of(begin(), end(), [&](const Loop *L) { in isRecursivelyLCSSAForm()
[all …]
|
| D | BlockFrequencyInfoImpl.cpp | 329 const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) { in addLoopSuccessorsToDist() argument
331 for (const auto &I : Loop.Exits) in addLoopSuccessorsToDist()
332 if (!addToDist(Dist, OuterLoop, Loop.getHeader(), I.first, in addLoopSuccessorsToDist()
341 void BlockFrequencyInfoImplBase::computeLoopScale(LoopData &Loop) { in computeLoopScale() argument
343 DEBUG(dbgs() << "compute-loop-scale: " << getLoopName(Loop) << "\n"); in computeLoopScale()
359 for (auto &Mass : Loop.BackedgeMass) in computeLoopScale()
366 Loop.Scale = in computeLoopScale()
371 << " - scale = " << Loop.Scale << "\n"); in computeLoopScale()
375 void BlockFrequencyInfoImplBase::packageLoop(LoopData &Loop) { in packageLoop() argument
376 DEBUG(dbgs() << "packaging-loop: " << getLoopName(Loop) << "\n"); in packageLoop()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | LoopInfo.cpp | 52 bool Loop::isLoopInvariant(Value *V) const { in INITIALIZE_PASS_DEPENDENCY()
60 bool Loop::hasLoopInvariantOperands(Instruction *I) const { in hasLoopInvariantOperands()
77 bool Loop::makeLoopInvariant(Value *V, bool &Changed, in makeLoopInvariant()
93 bool Loop::makeLoopInvariant(Instruction *I, bool &Changed, in makeLoopInvariant()
132 PHINode *Loop::getCanonicalInductionVariable() const { in getCanonicalInductionVariable()
176 Value *Loop::getTripCount() const { in getTripCount()
207 unsigned Loop::getSmallConstantTripCount() const { in getSmallConstantTripCount()
229 unsigned Loop::getSmallConstantTripMultiple() const { in getSmallConstantTripMultiple()
262 bool Loop::isLCSSAForm(DominatorTree &DT) const { in isLCSSAForm()
294 bool Loop::isLoopSimplifyForm() const { in isLoopSimplifyForm()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopPass.h | 40 virtual bool runOnLoop(Loop *L, LPPassManager &LPM) = 0;
46 virtual bool doInitialization(Loop *L, LPPassManager &LPM) { in doInitialization()
80 virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {} in cloneBasicBlockAnalysis()
83 virtual void deleteAnalysisValue(Value *V, Loop *L) {} in deleteAnalysisValue()
88 virtual void deleteAnalysisLoop(Loop *L) {} in deleteAnalysisLoop()
94 bool skipLoop(const Loop *L) const;
133 Loop &addLoop(Loop *ParentLoop);
144 void cloneBasicBlockSimpleAnalysis(BasicBlock *From, BasicBlock *To, Loop *L);
148 void deleteSimpleAnalysisValue(Value *V, Loop *L);
152 void deleteSimpleAnalysisLoop(Loop *L);
[all …]
|
| D | DependenceAnalysis.h | 50 class Loop; variable
397 const Loop *AssociatedLoop;
442 const Loop *getAssociatedLoop() const;
445 void setPoint(const SCEV *X, const SCEV *Y, const Loop *CurrentLoop);
449 const SCEV *C, const Loop *CurrentLoop);
452 void setDistance(const SCEV *D, const Loop *CurrentLoop);
522 unsigned mapSrcLoop(const Loop *SrcLoop) const;
526 unsigned mapDstLoop(const Loop *DstLoop) const;
530 bool isLoopInvariant(const SCEV *Expression, const Loop *LoopNest) const;
547 const Loop *LoopNest,
[all …]
|
| D | BlockFrequencyInfoImpl.h | 43 class Loop; variable
253 LoopData *Loop; ///< The loop this block is inside.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
260 return isLoopHeader() && Loop->Parent && Loop->Parent->isIrreducible() &&
261 Loop->Parent->isHeader(Node);
266 return Loop;
268 return Loop->Parent;
269 return Loop->Parent->Parent;
290 if (!Loop || !Loop->IsPackaged)
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | LoopPass.h | 40 virtual bool runOnLoop(Loop *L, LPPassManager &LPM) = 0;
43 virtual bool doInitialization(Loop *L, LPPassManager &LPM) { in doInitialization()
78 virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {} in cloneBasicBlockAnalysis()
81 virtual void deleteAnalysisValue(Value *V, Loop *L) {} in deleteAnalysisValue()
119 void deleteLoopFromQueue(Loop *L);
123 void insertLoop(Loop *L, Loop *ParentLoop);
126 void insertLoopIntoQueue(Loop *L);
131 void redoLoop(Loop *L);
142 void cloneBasicBlockSimpleAnalysis(BasicBlock *From, BasicBlock *To, Loop *L);
146 void deleteSimpleAnalysisValue(Value *V, Loop *L);
[all …]
|
| D | ScalarEvolution.h | 45 class Loop; variable
336 DenseMap<const Loop*, BackedgeTakenInfo> BackedgeTakenCounts;
349 std::map<const Loop *, const SCEV *> > ValuesAtScopes;
353 std::map<const Loop *, LoopDisposition> > LoopDispositions;
356 LoopDisposition computeLoopDisposition(const SCEV *S, const Loop *L);
406 const SCEV *computeSCEVAtScope(const SCEV *S, const Loop *L);
425 const BackedgeTakenInfo &getBackedgeTakenInfo(const Loop *L);
429 BackedgeTakenInfo ComputeBackedgeTakenCount(const Loop *L);
433 ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
438 ExitLimit ComputeExitLimitFromCond(const Loop *L,
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Analysis/BasicAA/ |
| D | store-promote.ll | 14 br label %Loop
16 Loop: ; preds = %Loop, %0
19 br i1 %c, label %Out, label %Loop
21 Out: ; preds = %Loop
25 ; The Loop block should be empty after the load/store are promoted.
28 ; CHECK: Loop:
29 ; CHECK-NEXT: br i1 %c, label %Out, label %Loop
35 br label %Loop
37 Loop: ; preds = %Loop, %0
44 br i1 %c, label %Out, label %Loop
[all …]
|
| /external/llvm/test/Analysis/BasicAA/ |
| D | store-promote.ll | 14 br label %Loop
16 Loop: ; preds = %Loop, %0
19 br i1 %c, label %Out, label %Loop
21 Out: ; preds = %Loop
25 ; The Loop block should be empty after the load/store are promoted.
28 ; CHECK: Loop:
29 ; CHECK-NEXT: br i1 %c, label %Out, label %Loop
35 br label %Loop
37 Loop: ; preds = %Loop, %0
44 br i1 %c, label %Out, label %Loop
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Transforms/LoopStrengthReduce/ |
| D | dont_insert_redundant_ops.ll | 8 br label %Loop
9 Loop: ; preds = %Loop, %0
10 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
17 br i1 %cond, label %Loop, label %Out
18 Out: ; preds = %Loop
24 br label %Loop
25 Loop: ; preds = %Loop, %0
26 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
33 br i1 %cond, label %Loop, label %Out
34 Out: ; preds = %Loop
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | dont_insert_redundant_ops.ll | 12 br label %Loop
13 Loop: ; preds = %Loop, %0
14 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
21 br i1 %cond, label %Loop, label %Out
22 Out: ; preds = %Loop
28 br label %Loop
29 Loop: ; preds = %Loop, %0
30 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
37 br i1 %cond, label %Loop, label %Out
38 Out: ; preds = %Loop
|
| /external/llvm/test/Transforms/LoopSimplify/ |
| D | hardertest.ll | 6 br label %Loop
8 br label %Loop
9 Loop: ; preds = %L2, %Loop, %F, %T
10 %Val = phi i32 [ 0, %T ], [ 1, %F ], [ 2, %Loop ], [ 3, %L2 ] ; <i32> [#uses=0]
11 br i1 %C, label %Loop, label %L2
12 L2: ; preds = %Loop
13 br label %Loop
|
| /external/swiftshader/third_party/LLVM/test/Transforms/LoopSimplify/ |
| D | hardertest.ll | 6 br label %Loop
8 br label %Loop
9 Loop: ; preds = %L2, %Loop, %F, %T
10 %Val = phi i32 [ 0, %T ], [ 1, %F ], [ 2, %Loop ], [ 3, %L2 ] ; <i32> [#uses=0]
11 br i1 %C, label %Loop, label %L2
12 L2: ; preds = %Loop
13 br label %Loop
|
| D | single-backedge.ll | 6 ; CHECK: Loop.backedge:
8 ; CHECK: br label %Loop
12 br label %Loop
13 Loop: ; preds = %BE2, %BE1, %0
18 BE1: ; preds = %Loop
19 br label %Loop
20 BE2: ; preds = %Loop
21 br label %Loop
|
| /external/llvm/test/Transforms/Util/MemorySSA/ |
| D | multi-edges.ll | 13 br i1 %a, label %Loop.Body, label %Loop.End
15 Loop.Body:
16 ; CHECK: 4 = MemoryPhi({entry,1},{Loop.End,3})
20 br i1 %a, label %Loop.End, label %Loop.End ; WhyDoWeEvenHaveThatLever.gif
22 Loop.End:
23 ; CHECK: 3 = MemoryPhi({entry,1},{Loop.Body,2},{Loop.Body,2})
28 br i1 %2, label %Ret, label %Loop.Body
|
| /external/llvm/test/Transforms/LICM/ |
| D | sinking.ll | 9 br label %Loop
11 Loop: ; preds = %Loop, %0
13 br i1 false, label %Loop, label %Out
15 Out: ; preds = %Loop
27 br label %Loop
29 Loop: ; preds = %Loop, %0
32 br i1 true, label %Loop, label %Out
34 Out: ; preds = %Loop
46 br i1 false, label %Loop, label %Exit
47 Loop:
[all …]
|
| D | scalar_promote.ll | 9 br label %Loop
13 ; CHECK-NEXT: br label %Loop
16 Loop: ; preds = %Loop, %0
17 %j = phi i32 [ 0, %Entry ], [ %Next, %Loop ] ; <i32> [#uses=1]
23 br i1 %cond, label %Out, label %Loop
36 br label %Loop
40 ; CHECK-NEXT: br label %Loop
42 Loop: ; preds = %Loop, %0
48 br i1 false, label %Loop, label %Exit
50 Exit: ; preds = %Loop
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/ |
| D | trip-count9.ll | 12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
13 ; CHECK: Loop %loop: max backedge-taken count is 6
28 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
44 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax %n))
45 ; CHECK: Loop %loop: max backedge-taken count is 5
60 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
61 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
76 ; CHECK: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
77 ; CHECK: Loop %loop: max backedge-taken count is -1
[all …]
|