| /external/llvm-project/llvm/test/Analysis/ScalarEvolution/ |
| D | trip-count-andor.ll | 10 ; CHECK-NEXT: Determining loop execution counts for: @unsimplified_and1
11 ; CHECK-NEXT: Loop %loop: backedge-taken count is %n
12 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
13 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
15 ; CHECK: Loop %loop: Trip multiple is 1
18 br label %loop
20 loop:
21 %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
25 br i1 %and, label %loop, label %leave
33 ; CHECK-NEXT: Determining loop execution counts for: @unsimplified_and2
[all …]
|
| D | trip-count9.ll | 15 ; CHECK-NEXT: Determining loop execution counts for: @foo
16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + %n)
17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 6
18 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
20 ; CHECK: Loop %loop: Trip multiple is 1
24 br i1 %s, label %loop, label %exit
25 loop:
26 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
29 br i1 %t, label %loop, label %exit
36 ; CHECK-NEXT: Determining loop execution counts for: @step2
[all …]
|
| D | max-backedge-taken-count-guard-info.ll | 5 ; Test case for PR40961. The loop guard limit the max backedge-taken count.
10 ; CHECK-NEXT: %iv = phi i64 [ %iv.next, %loop ], [ %i, %entry ]
11 ; CHECK-NEXT: --> {%i,+,1}<nuw><nsw><%loop> U: full-set S: full-set Exits: 15 LoopDispositions: …
13 …NEXT: --> {((4 * %i) + %a),+,4}<nw><%loop> U: full-set S: full-set Exits: (60 + %a) LoopDisposi…
15 …HECK-NEXT: --> {(1 + %i),+,1}<nuw><nsw><%loop> U: full-set S: full-set Exits: 16 LoopDispositio…
16 ; CHECK-NEXT: Determining loop execution counts for: @test_guard_less_than_16
17 ; CHECK-NEXT: Loop %loop: backedge-taken count is (15 + (-1 * %i))
18 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 15
19 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (15 + (-1 * %i))
21 ; CHECK: Loop %loop: Trip multiple is 1
[all …]
|
| D | umin-umax-folds.ll | 12 ; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
13 …CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64…
15 …XT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<…
17 ; CHECK-NEXT: --> %and U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Var…
18 ; CHECK-NEXT: Determining loop execution counts for: @umin_sext_x_zext_x
19 ; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
20 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
21 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
23 ; CHECK: Loop %loop: Trip multiple is 1
28 br label %loop
[all …]
|
| D | shift-op.ll | 6 ; CHECK: Loop %loop: max backedge-taken count is 32
8 br label %loop
10 loop:
11 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
14 br i1 %exit.cond, label %leave, label %loop
22 ; CHECK: Loop %loop: max backedge-taken count is 32
24 br label %loop
26 loop:
27 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
30 br i1 %exit.cond, label %leave, label %loop
[all …]
|
| D | trip-count10.ll | 9 ; CHECK-NEXT: Determining loop execution counts for: @a
10 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
11 ; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
12 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
16 br i1 %t0, label %loop, label %return
18 loop:
19 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
22 br i1 false, label %return, label %loop
29 ; CHECK-NEXT: Determining loop execution counts for: @b
30 ; CHECK-NEXT: Loop %loop: backedge-taken count is false
[all …]
|
| /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 …]
|
| /external/python/cpython3/Lib/test/test_asyncio/ |
| D | test_locks.py | 27 self.loop = self.new_test_loop()
30 loop = mock.Mock()
32 lock = asyncio.Lock(loop=loop)
33 self.assertIs(lock._loop, loop)
36 lock = asyncio.Lock(loop=self.loop)
37 self.assertIs(lock._loop, self.loop)
40 asyncio.set_event_loop(self.loop)
42 self.assertIs(lock._loop, self.loop)
46 lock = asyncio.Lock(loop=self.loop)
50 self.loop.run_until_complete(lock.acquire())
[all …]
|
| D | test_queues.py | 18 self.loop = self.new_test_loop()
36 loop = self.new_test_loop(gen)
39 q = asyncio.Queue(loop=loop)
45 q = asyncio.Queue(loop=loop)
47 loop.create_task(q.get())
55 loop.run_until_complete(add_getter())
58 q = asyncio.Queue(maxsize=1, loop=loop)
61 loop.create_task(q.put(2))
69 loop.run_until_complete(add_putter())
70 q = asyncio.Queue(loop=loop)
[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()
50 self.loop.set_exception_handler(lambda loop, ctx: messages.append(ctx))
52 reader, writer = self.loop.run_until_complete(open_connection_fut)
55 data = self.loop.run_until_complete(f)
58 data = self.loop.run_until_complete(f)
66 loop=self.loop)
73 loop=self.loop)
[all …]
|
| D | test_base_events.py | 154 self.loop = base_events.BaseEventLoop()
155 self.loop._selector = mock.Mock()
156 self.loop._selector.select.return_value = ()
157 self.set_event_loop(self.loop)
163 self.loop._make_socket_transport, m, m)
166 self.loop._make_ssl_transport, m, m, m, m)
169 self.loop._make_datagram_transport, m, m)
171 NotImplementedError, self.loop._process_events, [])
173 NotImplementedError, self.loop._write_to_self)
176 self.loop._make_read_pipe_transport, m, m)
[all …]
|
| D | test_tasks.py | 111 def new_task(self, loop, coro, name='TestTask'): argument
112 return self.__class__.Task(coro, loop=loop, name=name)
114 def new_future(self, loop): argument
115 return self.__class__.Future(loop=loop)
119 self.loop = self.new_test_loop()
120 self.loop.set_task_factory(self.new_task)
121 self.loop.create_future = lambda: self.new_future(self.loop)
126 t = self.new_task(self.loop, coro())
134 self.loop.run_until_complete(t)
139 t = self.new_task(self.loop, coro())
[all …]
|
| D | test_events.py | 58 loop = asyncio.new_event_loop()
59 asyncio.set_event_loop(loop)
60 return loop.run_until_complete(doit())
81 def __init__(self, loop=None): argument
85 if loop is not None:
86 self.connected = loop.create_future()
87 self.done = loop.create_future()
120 def __init__(self, loop=None): argument
123 if loop is not None:
124 self.done = loop.create_future()
[all …]
|
| /external/llvm-project/flang/test/Semantics/ |
| D | acc-canonicalization-validity.f90 | 4 ! 2.9 Loop
5 ! 2.11 Parallel Loop
6 ! 2.11 Kernels Loop
7 ! 2.11 Serial Loop
18 !ERROR: A DO loop must follow the LOOP directive
19 !$acc loop
22 !ERROR: DO loop after the LOOP directive must have loop control
23 !$acc loop
27 !ERROR: A DO loop must follow the PARALLEL LOOP directive
28 !$acc parallel loop
[all …]
|
| /external/llvm-project/llvm/test/Other/ |
| D | loop-pm-invalidation.ll | 1 ; Test that the loop PM infrastructure is invalidated appropriately.
6 ; RUN: -passes='loop(no-op-loop),invalidate<loops>,loop(no-op-loop)' \
7 ; RUN: | FileCheck %s --check-prefix=CHECK-LOOP-INV
12 ; RUN: -passes='loop(no-op-loop),invalidate<scalar-evolution>,loop(no-op-loop)' \
17 ; RUN: -passes='loop(no-op-loop,loop-deletion),invalidate<scalar-evolution>,loop(no-op-loop)' \
21 ; CHECK-LOOP-INV: Starting {{.*}}Function pass manager run
22 ; CHECK-LOOP-INV-NEXT: Starting {{.*}}Function pass manager run
23 ; CHECK-LOOP-INV-NEXT: Running pass: LoopSimplifyPass
24 ; CHECK-LOOP-INV-NEXT: Running analysis: LoopAnalysis
25 ; CHECK-LOOP-INV-NEXT: Running analysis: DominatorTreeAnalysis
[all …]
|
| /external/llvm-project/llvm/docs/ |
| D | TransformMetadata.rst | 34 Attributes can be attached to loops as described in :ref:`llvm.loop`.
35 Attributes can describe properties of the loop, disable transformations,
40 metadata), in order to add or remove a loop attributes, a new ``MDNode``
41 must be created and assigned as the new ``llvm.loop`` metadata. Any
42 connection between the old ``MDNode`` and the loop is lost. The
43 ``llvm.loop`` node is also used as LoopID (``Loop::getLoopID()``), i.e.
44 the loop effectively gets a new identifier. For instance,
47 loop attributes, any ``llvm.mem.parallel_loop_access`` reference must be
54 loop distribution, etc.). They can either be a hint to the optimizer
57 ``#pragma clang loop`` or ``#pragma omp simd``).
[all …]
|
| D | LoopTerminology.rst | 4 LLVM Loop Terminology (and Canonical Forms)
10 Loop Definition
17 A loop is a subset of nodes from the control-flow graph (CFG; where
21 edges from the CFG within the loop) is strongly connected
26 all nodes in the loop (i.e. every execution path to any of the loop's
29 3. The loop is the maximum subset with these properties. That is, no
34 In computer science literature, this is often called a *natural loop*.
35 In LLVM, this is the only definition of a loop.
41 The definition of a loop comes with some additional terminology:
43 * An **entering block** (or **loop predecessor**) is a non-loop node
[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 | 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 …]
|
| /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 …]
|
| /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 …]
|
| /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/llvm-project/llvm/test/Transforms/LoopInstSimplify/ |
| D | basic.ll | 2 ; RUN: opt -S %s -passes=loop-instsimplify | FileCheck %s
3 ; RUN: opt -S %s -passes='loop-mssa(loop-instsimplify)' -verify-memoryssa | FileCheck %s
5 ; Test very basic folding and propagation occurs within a loop body. This should
6 ; collapse to the loop iteration structure and the LCSSA PHI node.
10 ; CHECK-NEXT: br label [[LOOP:%.*]]
11 ; CHECK: loop:
12 ; CHECK-NEXT: [[I:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[I_NEXT:%.*]], [[LOOP]] ]
15 ; CHECK-NEXT: br i1 [[I_CMP]], label [[LOOP]], label [[EXIT:%.*]]
17 ; CHECK-NEXT: [[X_LCSSA:%.*]] = phi i32 [ [[X:%.*]], [[LOOP]] ]
21 br label %loop
[all …]
|