| /external/swiftshader/third_party/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 …]
|
| /external/python/cpython3/Lib/test/test_asyncio/ |
| D | test_queues.py | 14 self.loop = self.new_test_loop()
32 loop = self.new_test_loop(gen)
34 q = asyncio.Queue(loop=loop)
40 q = asyncio.Queue(loop=loop)
42 asyncio.Task(q.get(), loop=loop)
44 await asyncio.sleep(0.1, loop=loop)
49 loop.run_until_complete(add_getter())
52 q = asyncio.Queue(maxsize=1, loop=loop)
55 asyncio.Task(q.put(2), loop=loop)
57 await asyncio.sleep(0.1, loop=loop)
[all …]
|
| D | test_locks.py | 23 self.loop = self.new_test_loop()
26 loop = mock.Mock()
27 lock = asyncio.Lock(loop=loop)
28 self.assertIs(lock._loop, loop)
30 lock = asyncio.Lock(loop=self.loop)
31 self.assertIs(lock._loop, self.loop)
34 asyncio.set_event_loop(self.loop)
36 self.assertIs(lock._loop, self.loop)
39 lock = asyncio.Lock(loop=self.loop)
48 self.loop.run_until_complete(acquire_lock())
[all …]
|
| D | test_tasks.py | 86 def new_task(self, loop, coro): argument
87 return self.__class__.Task(coro, loop=loop)
89 def new_future(self, loop): argument
90 return self.__class__.Future(loop=loop)
94 self.loop = self.new_test_loop()
95 self.loop.set_task_factory(self.new_task)
96 self.loop.create_future = lambda: self.new_future(self.loop)
107 self.loop.run_until_complete(
109 self.new_task(self.loop, run()) for _ in range(100)
110 ], loop=self.loop))
[all …]
|
| D | test_base_events.py | 150 self.loop = base_events.BaseEventLoop()
151 self.loop._selector = mock.Mock()
152 self.loop._selector.select.return_value = ()
153 self.set_event_loop(self.loop)
159 self.loop._make_socket_transport, m, m)
162 self.loop._make_ssl_transport, m, m, m, m)
165 self.loop._make_datagram_transport, m, m)
167 NotImplementedError, self.loop._process_events, [])
169 NotImplementedError, self.loop._write_to_self)
172 self.loop._make_read_pipe_transport, m, m)
[all …]
|
| D | test_streams.py | 28 self.loop = asyncio.new_event_loop()
29 self.set_event_loop(self.loop)
33 test_utils.run_briefly(self.loop)
35 self.loop.close()
45 reader, writer = self.loop.run_until_complete(open_connection_fut)
48 data = self.loop.run_until_complete(f)
51 data = self.loop.run_until_complete(f)
58 loop=self.loop)
65 loop=self.loop)
70 reader, writer = self.loop.run_until_complete(open_connection_fut)
[all …]
|
| D | test_events.py | 55 loop = asyncio.new_event_loop()
56 asyncio.set_event_loop(loop)
57 return loop.run_until_complete(doit())
78 def __init__(self, loop=None): argument
82 if loop is not None:
83 self.connected = asyncio.Future(loop=loop)
84 self.done = asyncio.Future(loop=loop)
117 def __init__(self, loop=None): argument
120 if loop is not None:
121 self.done = asyncio.Future(loop=loop)
[all …]
|
| D | test_selector_events.py | 40 # Don't call transport.close() because the event loop and the selector
54 self.loop = TestBaseSelectorEventLoop(self.selector)
55 self.set_event_loop(self.loop)
59 self.loop.add_reader = mock.Mock()
60 self.loop.add_reader._is_coroutine = False
61 transport = self.loop._make_socket_transport(m, asyncio.Protocol())
64 # Calling repr() must not fail when the event loop is closed
65 self.loop.close()
73 self.loop._add_reader = mock.Mock()
74 self.loop._add_reader._is_coroutine = 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/swiftshader/third_party/llvm-7.0/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 …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopPredication/ |
| D | nested.ll | 1 ; RUN: opt -S -loop-predication < %s 2>&1 | FileCheck %s
2 ; RUN: opt -S -passes='require<scalar-evolution>,loop(loop-predication)' < %s 2>&1 | FileCheck %s
10 br i1 %tmp5, label %exit, label %outer.loop.preheader
12 outer.loop.preheader:
13 br label %outer.loop
15 outer.loop:
16 %outer.loop.acc = phi i32 [ %outer.loop.acc.next, %outer.loop.inc ], [ 0, %outer.loop.preheader ]
17 %i = phi i32 [ %i.next, %outer.loop.inc ], [ 0, %outer.loop.preheader ]
19 br i1 %tmp6, label %outer.loop.inc, label %inner.loop.preheader
21 inner.loop.preheader:
[all …]
|
| D | basic.ll | 1 ; RUN: opt -S -loop-predication < %s 2>&1 | FileCheck %s
2 ; RUN: opt -S -passes='require<scalar-evolution>,loop(loop-predication)' < %s 2>&1 | FileCheck %s
10 br i1 %tmp5, label %exit, label %loop.preheader
12 loop.preheader:
13 ; CHECK: loop.preheader:
17 ; CHECK-NEXT: br label %loop
18 br label %loop
20 loop:
21 ; CHECK: loop:
23 %loop.acc = phi i32 [ %loop.acc.next, %loop ], [ 0, %loop.preheader ]
[all …]
|
| D | reverse.ll | 1 ; RUN: opt -S -loop-predication -loop-predication-enable-count-down-loop=true < %s 2>&1 | FileCheck…
2 …: opt -S -passes='require<scalar-evolution>,loop(loop-predication)' -loop-predication-enable-count…
10 br i1 %tmp5, label %exit, label %loop.preheader
12 ; CHECK: loop.preheader:
17 loop.preheader:
18 br label %loop
20 ; CHECK: loop:
22 loop:
23 %loop.acc = phi i32 [ %loop.acc.next, %loop ], [ 0, %loop.preheader ]
24 %i = phi i32 [ %i.next, %loop ], [ %n, %loop.preheader ]
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/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-LABEL: Running pass: FunctionToLoopPassAdaptor<{{.*}}> on no_loops
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/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 …]
|
| 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/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/v8/src/compiler/ |
| D | loop-analysis.h | 35 // Represents a loop in the tree of loops, including the header nodes,
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_;
68 // Return the innermost nested loop, if any, that contains {node}.
69 Loop* ContainingLoop(Node* node) { in ContainingLoop()
75 // Check if the {loop} contains the {node}, either directly or by containing
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopInstSimplify/ |
| D | basic.ll | 2 ; RUN: opt -S %s -passes=loop-instsimplify | FileCheck %s
4 ; Test very basic folding and propagation occurs within a loop body. This should
5 ; collapse to the loop iteration structure and the LCSSA PHI node.
9 ; CHECK-NEXT: br label [[LOOP:%.*]]
10 ; CHECK: loop:
11 ; CHECK-NEXT: [[I:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[I_NEXT:%.*]], [[LOOP]] ]
14 ; CHECK-NEXT: br i1 [[I_CMP]], label [[LOOP]], label [[EXIT:%.*]]
16 ; CHECK-NEXT: [[X_LCSSA:%.*]] = phi i32 [ [[X:%.*]], [[LOOP]] ]
20 br label %loop
22 loop:
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Transforms/Scalar/ |
| D | LoopPassManagerTest.cpp | 118 /// Mock handle for loop analyses.
123 /// registered and queried. If you want to register multiple loop analysis
133 : MockAnalysisHandleBase<MockLoopAnalysisHandleTemplate<I>, Loop,
138 MOCK_METHOD3_T(run, typename Analysis::Result(Loop &, LoopAnalysisManager &,
141 MOCK_METHOD3_T(invalidate, bool(Loop &, const PreservedAnalyses &,
195 : MockPassHandleBase<MockLoopPassHandle, Loop, LoopAnalysisManager,
198 PreservedAnalyses(Loop &, LoopAnalysisManager &,
256 getLoopAnalysisResult(Loop &L, LoopAnalysisManager &AM, in getLoopAnalysisResult()
267 " br label %loop.0\n" in LoopPassManagerTest()
268 "loop.0:\n" in LoopPassManagerTest()
[all …]
|