| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | trip-count9.ll | 11 ; CHECK: Determining loop execution counts for: @foo
12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
13 ; CHECK: Loop %loop: max backedge-taken count is 6
17 br i1 %s, label %loop, label %exit
18 loop:
19 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
22 br i1 %t, label %loop, label %exit
27 ; CHECK: Determining loop execution counts for: @step2
28 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
[all …]
|
| D | shift-op.ll | 5 ; CHECK: Loop %loop: max backedge-taken count is 32
7 br label %loop
9 loop:
10 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
13 br i1 %exit.cond, label %leave, label %loop
21 ; CHECK: Loop %loop: max backedge-taken count is 32
23 br label %loop
25 loop:
26 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
29 br i1 %exit.cond, label %leave, label %loop
[all …]
|
| D | increasing-or-decreasing-iv.ll | 8 br label %loop
10 loop:
11 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
12 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
13 ; CHECK: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
14 ; CHECK-NEXT: --> {%start,+,%step}<%loop> U: [0,128) S: [0,128)
16 %loop.iv.inc = add i32 %loop.iv, 1
17 %be.cond = icmp ne i32 %loop.iv.inc, 128
18 br i1 %be.cond, label %loop, label %leave
29 br label %loop
[all …]
|
| D | trip-count10.ll | 5 ; CHECK: Determining loop execution counts for: @a
6 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
9 ; CHECK: Determining loop execution counts for: @b
10 ; CHECK: Loop %loop: backedge-taken count is false
11 ; CHECK: Loop %loop: max backedge-taken count is false
13 ; CHECK: Determining loop execution counts for: @c
14 ; CHECK: Loop %loop: backedge-taken count is false
15 ; CHECK: Loop %loop: max backedge-taken count is false
17 ; CHECK: Determining loop execution counts for: @d
[all …]
|
| /external/python/cpython3/Lib/test/test_asyncio/ |
| D | test_base_events.py | 155 self.loop = base_events.BaseEventLoop()
156 self.loop._selector = mock.Mock()
157 self.loop._selector.select.return_value = ()
158 self.set_event_loop(self.loop)
164 self.loop._make_socket_transport, m, m)
167 self.loop._make_ssl_transport, m, m, m, m)
170 self.loop._make_datagram_transport, m, m)
172 NotImplementedError, self.loop._process_events, [])
174 NotImplementedError, self.loop._write_to_self)
177 self.loop._make_read_pipe_transport, m, m)
[all …]
|
| D | test_streams.py | 32 self.loop = asyncio.new_event_loop()
33 self.set_event_loop(self.loop)
37 test_utils.run_briefly(self.loop)
39 self.loop.close()
45 self.loop.set_exception_handler(lambda loop, ctx: messages.append(ctx))
46 reader, writer = self.loop.run_until_complete(open_connection_fut)
49 data = self.loop.run_until_complete(f)
52 data = self.loop.run_until_complete(f)
70 self.loop.set_exception_handler(lambda loop, ctx: messages.append(ctx))
72 reader, writer = self.loop.run_until_complete(open_connection_fut)
[all …]
|
| D | test_events.py | 59 loop = asyncio.new_event_loop()
60 asyncio.set_event_loop(loop)
61 return loop.run_until_complete(doit())
82 def __init__(self, loop=None): argument
86 if loop is not None:
87 self.connected = loop.create_future()
88 self.done = loop.create_future()
125 def __init__(self, loop=None): argument
128 if loop is not None:
129 self.done = loop.create_future()
[all …]
|
| D | test_tasks.py | 112 def new_task(self, loop, coro, name='TestTask'): argument
113 return self.__class__.Task(coro, loop=loop, name=name)
115 def new_future(self, loop): argument
116 return self.__class__.Future(loop=loop)
120 self.loop = self.new_test_loop()
121 self.loop.set_task_factory(self.new_task)
122 self.loop.create_future = lambda: self.new_future(self.loop)
133 t = self.new_task(self.loop, coro())
141 self.loop.run_until_complete(t)
146 t = self.new_task(self.loop, coro())
[all …]
|
| D | test_futures.py | 88 self.loop = self.new_test_loop()
89 self.addCleanup(self.loop.close)
109 self.loop = self.new_test_loop()
110 self.addCleanup(self.loop.close)
131 f = self._new_future(loop=self.loop)
141 f = self._new_future(loop=self.loop)
149 with self.assertRaisesRegex(RuntimeError, 'There is no current event loop'):
156 f = self.loop.run_until_complete(test())
157 self.assertIs(f._loop, self.loop)
158 self.assertIs(f.get_loop(), self.loop)
[all …]
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/ |
| D | loop_descriptor.h | 39 // A class to represent and manipulate a loop in structured control flow.
40 class Loop {
42 using ChildrenList = std::vector<Loop*>;
49 explicit Loop(IRContext* context) in Loop() function
59 Loop(IRContext* context, DominatorAnalysis* analysis, BasicBlock* header,
70 // Returns the header (first basic block of the loop). This block contains the
77 // loop.
80 "The loop is not structured"); in UpdateLoopMergeInst()
91 // These functions return nullptr if the loop is not structured (i.e. if it
96 // Sets |latch| as the loop unique block branching back to the header.
[all …]
|
| D | loop_unroller.cpp | 26 // Implements loop util unrolling functionality for fully and partially
27 // unrolling loops. Given a factor it will duplicate the loop that many times,
28 // appending each one to the end of the old loop and removing backedges, to
29 // create a new unrolled loop.
32 // loop they wish to unroll. LoopUtils::CanPerformUnroll is used to
33 // validate that a given loop can be unrolled. That method (along with the
34 // constructor of loop) checks that the IR is in the expected canonicalised
38 // perform the unrolling. This implements helper methods to copy the loop basic
42 // actually performs the loop duplication. It does this by creating a
43 // LoopUnrollState object and then copying the loop as given by the factor
[all …]
|
| D | loop_peeling.h | 36 // Utility class to perform the peeling of a given loop.
37 // The loop peeling transformation make a certain amount of a loop iterations to
39 // loop.
42 // - It clones the loop and inserts the cloned loop before the original loop;
43 // - It connects all iterating values of the cloned loop with the
44 // corresponding original loop values so that the second loop starts with
51 // The exit condition of the cloned loop is changed so that the loop
52 // exits when "i < N" becomes false. The original loop is then protected to
55 // then the exit condition of the cloned loop is changed so that the loop
57 // is the upper bound of the loop. The cloned loop is then protected to
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | loop_descriptor.h | 39 // A class to represent and manipulate a loop in structured control flow.
40 class Loop {
42 using ChildrenList = std::vector<Loop*>;
49 explicit Loop(IRContext* context) in Loop() function
59 Loop(IRContext* context, DominatorAnalysis* analysis, BasicBlock* header,
70 // Returns the header (first basic block of the loop). This block contains the
77 // loop.
80 "The loop is not structured"); in UpdateLoopMergeInst()
91 // These functions return nullptr if the loop is not structured (i.e. if it
96 // Sets |latch| as the loop unique block branching back to the header.
[all …]
|
| D | loop_unroller.cpp | 27 // Implements loop util unrolling functionality for fully and partially
28 // unrolling loops. Given a factor it will duplicate the loop that many times,
29 // appending each one to the end of the old loop and removing backedges, to
30 // create a new unrolled loop.
33 // loop they wish to unroll. LoopUtils::CanPerformUnroll is used to
34 // validate that a given loop can be unrolled. That method (along with the
35 // constructor of loop) checks that the IR is in the expected canonicalised
39 // perform the unrolling. This implements helper methods to copy the loop basic
43 // actually performs the loop duplication. It does this by creating a
44 // LoopUnrollState object and then copying the loop as given by the factor
[all …]
|
| D | loop_peeling.h | 36 // Utility class to perform the peeling of a given loop.
37 // The loop peeling transformation make a certain amount of a loop iterations to
39 // loop.
42 // - It clones the loop and inserts the cloned loop before the original loop;
43 // - It connects all iterating values of the cloned loop with the
44 // corresponding original loop values so that the second loop starts with
51 // The exit condition of the cloned loop is changed so that the loop
52 // exits when "i < N" becomes false. The original loop is then protected to
55 // then the exit condition of the cloned loop is changed so that the loop
57 // is the upper bound of the loop. The cloned loop is then protected to
[all …]
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | loop_descriptor.h | 39 // A class to represent and manipulate a loop in structured control flow.
40 class Loop {
42 using ChildrenList = std::vector<Loop*>;
49 explicit Loop(IRContext* context) in Loop() function
59 Loop(IRContext* context, DominatorAnalysis* analysis, BasicBlock* header,
70 // Returns the header (first basic block of the loop). This block contains the
77 // loop.
80 "The loop is not structured"); in UpdateLoopMergeInst()
91 // These functions return nullptr if the loop is not structured (i.e. if it
96 // Sets |latch| as the loop unique block branching back to the header.
[all …]
|
| D | loop_unroller.cpp | 27 // Implements loop util unrolling functionality for fully and partially
28 // unrolling loops. Given a factor it will duplicate the loop that many times,
29 // appending each one to the end of the old loop and removing backedges, to
30 // create a new unrolled loop.
33 // loop they wish to unroll. LoopUtils::CanPerformUnroll is used to
34 // validate that a given loop can be unrolled. That method (along with the
35 // constructor of loop) checks that the IR is in the expected canonicalised
39 // perform the unrolling. This implements helper methods to copy the loop basic
43 // actually performs the loop duplication. It does this by creating a
44 // LoopUnrollState object and then copying the loop as given by the factor
[all …]
|
| D | loop_peeling.h | 36 // Utility class to perform the peeling of a given loop.
37 // The loop peeling transformation make a certain amount of a loop iterations to
39 // loop.
42 // - It clones the loop and inserts the cloned loop before the original loop;
43 // - It connects all iterating values of the cloned loop with the
44 // corresponding original loop values so that the second loop starts with
51 // The exit condition of the cloned loop is changed so that the loop
52 // exits when "i < N" becomes false. The original loop is then protected to
55 // then the exit condition of the cloned loop is changed so that the loop
57 // is the upper bound of the loop. The cloned loop is then protected to
[all …]
|
| /external/mesa3d/src/compiler/nir/ |
| D | nir_opt_loop_unroll.c | 39 /* Prepare this loop for unrolling by first converting to lcssa and then
40 * converting the phis from the top level of the loop body to regs.
41 * Partially converting out of SSA allows us to unroll the loop without having
45 * The loop may have a jump instruction at the end of the loop which does
50 loop_prepare_for_unroll(nir_loop *loop) in loop_prepare_for_unroll() argument
53 nir_cf_node_get_function(&loop->cf_node)); in loop_prepare_for_unroll()
55 nir_convert_loop_to_lcssa(loop); in loop_prepare_for_unroll()
57 /* Lower phis at the top level of the loop body */ in loop_prepare_for_unroll()
58 foreach_list_typed_safe(nir_cf_node, node, node, &loop->body) { in loop_prepare_for_unroll()
64 /* Lower phis after the loop */ in loop_prepare_for_unroll()
[all …]
|
| /external/clang/test/Parser/ |
| D | pragma-loop.cpp | 8 #pragma clang loop vectorize_width(V) interleave_count(I) in test_nontype_template_param()
13 #pragma clang loop vectorize_width(V + 4) interleave_count(I + 4) in test_nontype_template_param()
21 …/* expected-error {{invalid value '-1'; must be positive}} */ #pragma clang loop vectorize_width(V) in test_nontype_template_vectorize()
26 …/* expected-error {{invalid value '0'; must be positive}} */ #pragma clang loop vectorize_width(V … in test_nontype_template_vectorize()
34 …/* expected-error {{invalid value '-1'; must be positive}} */ #pragma clang loop interleave_count(… in test_nontype_template_interleave()
39 …/* expected-error {{invalid value '0'; must be positive}} */ #pragma clang loop interleave_count(2… in test_nontype_template_interleave()
47 …nvalid argument of type 'char'; expected an integer type}} */ #pragma clang loop vectorize_width(V) in test_nontype_template_char()
55 …nvalid argument of type 'bool'; expected an integer type}} */ #pragma clang loop vectorize_width(V) in test_nontype_template_bool()
63 …/* expected-error {{use of undeclared identifier 'Vec'}} */ #pragma clang loop vectorize_width(Vec… in test_nontype_template_badarg()
64 …/* expected-error {{use of undeclared identifier 'Int'}} */ #pragma clang loop vectorize_width(V) … in test_nontype_template_badarg()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | LoopInfo.h | 1 //===- llvm/Analysis/LoopInfo.h - Natural Loop Calculator -------*- C++ -*-===//
10 // and determine the loop depth of various nodes of the CFG. A natural loop
15 // each natural loop identified, this analysis identifies natural loops
16 // contained entirely within the loop and the basic blocks the make up the loop.
20 // * whether there is a preheader for the loop
22 // * whether or not a particular block branches out of the loop
23 // * the successor blocks of the loop
24 // * the loop depth
29 // this analysis will not recognize and that will not be represented by a Loop
30 // instance. In particular, a Loop might be inside such a non-loop SCC, or a
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Scalar/ |
| D | LoopPassManager.h | 1 //===- LoopPassManager.h - Loop pass management -----------------*- C++ -*-===//
13 /// The primary loop pass pipeline is managed in a very particular way to
17 /// 3) A collection of Loop-specific analysis results are available:
22 /// 4) All loop passes preserve #1 (where possible), #2, and #3.
23 /// 5) Loop passes run over each loop in the loop nest from the innermost to
26 /// loop creates new inner loops, those are added and processed in this
31 /// optimizing loops, especially optimizing loop *nests* instead of single
66 PassManager<Loop, LoopAnalysisManager, LoopStandardAnalysisResults &,
67 LPMUpdater &>::run(Loop &InitialL, LoopAnalysisManager &AM,
70 extern template class PassManager<Loop, LoopAnalysisManager,
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/ |
| D | LoopUtils.h | 1 //===- llvm/Transforms/Utils/LoopUtils.h - Loop utilities -------*- C++ -*-===//
9 // This file defines some loop transformation utilities.
41 class Loop; variable
53 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
56 /// Ensure that all exit blocks of the loop are dedicated exits.
58 /// For any loop exit block with non-loop predecessors, we split the loop
59 /// predecessors to use a dedicated loop exit block. We update the dominator
60 /// tree and loop info if provided, and will preserve LCSSA if requested.
61 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
65 /// innermost containing loop.
[all …]
|
| /external/llvm/test/Other/ |
| D | loop-pass-ordering.ll | 2 ; RUN: -passes='no-op-loop' %s 2>&1 \
7 ; loop.0 loop.1
9 ; loop.0.0 loop.0.1 loop.1.0
11 ; CHECK: Running pass: NoOpLoopPass on loop.1.0
12 ; CHECK: Running pass: NoOpLoopPass on loop.1
13 ; CHECK: Running pass: NoOpLoopPass on loop.0.0
14 ; CHECK: Running pass: NoOpLoopPass on loop.0.1
15 ; CHECK: Running pass: NoOpLoopPass on loop.0
18 br label %loop.0
19 loop.0:
[all …]
|
| /external/llvm/test/Transforms/IRCE/ |
| D | with-parent-loops.ll | 1 ; RUN: opt -verify-loop-info -irce-print-changed-loops -irce < %s 2>&1 | FileCheck %s
8 ; CHECK: irce: in function inner_loop: constrained Loop at depth 1 containing: %loop<header><exitin…
13 br i1 %first.itr.check, label %loop, label %exit
15 loop: ; preds = %in.bounds, %entry
21 in.bounds: ; preds = %loop
25 br i1 %next, label %loop, label %exit
27 out.of.bounds: ; preds = %loop
36 ; CHECK: irce: in function with_parent: constrained Loop at depth 2 containing: %loop.i<header><exi…
39 br label %loop
41 loop: ; preds = %inner_loop.exit, %entry
[all …]
|