| /external/mesa3d/src/glsl/tests/lower_jumps/ |
| return_void_at_end_of_loop_lower_return.opt_test | 5 # Test that a return of void at the end of a loop is properly
11 ((loop () () () ()
|
| return_void_at_end_of_loop_lower_return_and_break.opt_test | 5 # Test that a return of void at the end of a loop is properly
11 ((loop () () () ()
|
| /prebuilts/go/darwin-x86/misc/cgo/test/issue9400/ |
| asm_arm.s | 29 loop: label
33 BCC loop
|
| /prebuilts/go/linux-x86/misc/cgo/test/issue9400/ |
| asm_arm.s | 29 loop: label
33 BCC loop
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
| mpx-inval-1.s | 10 bnd loop foo
18 bnd loop foo
|
| /external/v8/test/cctest/compiler/ |
| test-loop-analysis.cc | 11 #include "src/compiler/loop-analysis.h"
138 LoopTree::Loop* loop = tree->ContainingLoop(header[0]); local
139 CHECK(loop);
141 CHECK(header_count == static_cast<int>(loop->HeaderSize()));
143 // Each header node should be in the loop.
144 CHECK_EQ(loop, tree->ContainingLoop(header[i]));
145 CheckRangeContains(tree->HeaderNodes(loop), header[i]);
148 CHECK_EQ(body_count, static_cast<int>(loop->BodySize()));
151 // Each body node should be contained in the loop
166 LoopTree::Loop* loop = tree->ContainingLoop(header); local
191 Node* loop; member in struct:v8::internal::compiler::While
619 Node* loop = t.graph.NewNode(t.common.Loop(2), t.start, t.start); local
653 Node* loop = t.graph.NewNode(t.common.Loop(1 + i), 1 + i, loop_inputs); local
691 Node* loop = t.graph.NewNode(t.common.Loop(2), t.start, t.start); local
930 Node* loop = t.graph.NewNode(t.common.Loop(2), last, t.start); local
966 Node* loop = t.graph.NewNode(t.common.Loop(2), entry, t.start); local
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
| DateFormatRoundTripTest.java | 65 // Special infinite loop test mode for finding hard to reproduce errors
67 logln("ENTERING INFINITE TEST LOOP FOR Locale: " + loc.getDisplayName());
179 // We go through this loop until we achieve a match or until
180 // the maximum loop count is reached. We record the points at
183 int loop; local
186 for (loop = 0; loop < DEPTH; ++loop) {
187 if (loop > 0) {
188 d[loop] = fmt.parse(s[loop - 1])
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
| DateFormatRoundTripTest.java | 61 // Special infinite loop test mode for finding hard to reproduce errors
63 logln("ENTERING INFINITE TEST LOOP FOR Locale: " + loc.getDisplayName());
175 // We go through this loop until we achieve a match or until
176 // the maximum loop count is reached. We record the points at
179 int loop; local
182 for (loop = 0; loop < DEPTH; ++loop) {
183 if (loop > 0) {
184 d[loop] = fmt.parse(s[loop - 1])
[all...] |
| /external/v8/test/unittests/compiler/ |
| loop-peeling-unittest.cc | 9 #include "src/compiler/loop-peeling.h"
28 Node* loop; member in struct:v8::internal::compiler::While
74 LoopTree::Loop* loop = loop_tree->outer_loops()[0]; local
75 EXPECT_TRUE(LoopPeeler::CanPeel(loop_tree, loop));
76 return Peel(loop_tree, loop);
79 PeeledIteration* Peel(LoopTree* loop_tree, LoopTree::Loop* loop) {
80 EXPECT_TRUE(LoopPeeler::CanPeel(loop_tree, loop));
82 LoopPeeler::Peel(graph(), common(), loop_tree, loop, zone())
108 Node* loop = graph()->NewNode(common()->Loop(2), control, control); local
242 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop); local
279 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop); local
314 Node* loop = graph()->NewNode(common()->Loop(3), start(), start(), start()); local
348 Node* loop = graph()->NewNode(common()->Loop(3), start(), start(), start()); local
396 Node* loop = graph()->NewNode(common()->Loop(3), start(), start(), start()); local
456 Node* loop = graph()->NewNode(common()->Loop(2), start(), start()); local
466 LoopTree::Loop* loop = loop_tree->outer_loops()[0]; local
478 Node* loop = graph()->NewNode(common()->Loop(2), start(), start()); local
492 LoopTree::Loop* loop = loop_tree->outer_loops()[0]; local
[all...] |
| /development/ndk/platforms/android-21/samples/native-codec/jni/ |
| looper.h | 35 void loop();
|
| /external/clang/test/Frontend/ |
| optimization-remark-analysis.c | 4 // RPASS: {{.*}}:21:1: remark: loop not vectorized: loop contains a switch statement
5 // CHECK-NOT: {{.*}}:21:1: remark: loop not vectorized: loop contains a switch statement
10 #pragma clang loop vectorize(enable)
|
| /external/clang/test/Misc/ |
| backend-optimization-failure-nodbg.cpp | 8 #pragma clang loop vectorize(enable) unroll(disable)
21 /* expected-warning {{loop not vectorized: failed explicitly specified loop vectorization}} */ }
|
| backend-optimization-failure.cpp | 8 #pragma clang loop vectorize(enable) unroll(disable)
10 /* expected-warning {{loop not vectorized: failed explicitly specified loop vectorization}} */ switch (A[i]) {
|
| /external/dbus/test/ |
| test-names.c | 4 static DBusLoop *loop; variable
61 loop = _dbus_loop_new ();
62 if (loop == NULL)
65 if (!test_connection_setup (loop, connection))
|
| /external/v8/src/compiler/ |
| ast-loop-assignment-analyzer.h | 21 // The result of analyzing loop assignments.
24 BitVector* GetVariablesAssignedInLoop(IterationStatement* loop) {
26 // TODO(turbofan): hashmap or binary search for loop assignments.
27 if (list_[i].first == loop) return list_[i].second;
42 // The class that performs loop assignment analysis by walking the AST.
63 void Enter(IterationStatement* loop);
64 void Exit(IterationStatement* loop);
|
| /frameworks/av/include/media/nbaio/ |
| LibsndfileSource.h | 30 // If 'loop' is true and it permits seeking, then we'll act as an infinite source
31 LibsndfileSource(SNDFILE *sndfile, const SF_INFO &sfinfo, bool loop = false);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/h8300/ |
| ffxx1-coff.d | 15 0+040a <loop>.*mov.b r0l,@0xffbb:16
22 419: DISP8 loop[+]0xffffffff
|
| ffxx1-elf.d | 15 0+040a <loop>.*mov.b r0l,@0xffbb:16
22 419: R_H8_PCREL8 loop
|
| /external/proguard/src/proguard/classfile/util/ |
| DescriptorClassEnumeration.java | 109 loop: while (index < descriptor.length())
136 continue loop; local
140 continue loop; local
147 break loop; local
158 break loop; local
189 loop: while (true)
197 break loop; local
|
| /external/autotest/client/deps/fakegudev/src/ |
| gudev-exercise.c | 18 static GMainLoop* loop; variable
29 loop = g_main_loop_new (NULL, FALSE);
34 g_main_loop_run (loop);
36 g_main_loop_unref (loop);
112 g_main_loop_quit (loop);
|
| /external/clang/test/Parser/ |
| pragma-unroll.cpp | 52 /* expected-error {{expected a for, while, or do-while loop to follow '#pragma unroll'}} */ int j = Length;
54 /* expected-error {{expected a for, while, or do-while loop to follow '#pragma unroll'}} */ int k = Length;
56 /* expected-error {{expected a for, while, or do-while loop to follow '#pragma nounroll'}} */ int l = Length;
59 #pragma clang loop unroll(disable)
65 #pragma clang loop unroll(full)
71 #pragma clang loop unroll(enable)
82 /* expected-error {{incompatible directives '#pragma nounroll' and 'unroll_count(4)'}} */ #pragma clang loop unroll_count(4)
101 #pragma clang loop unroll(full)
|
| /external/valgrind/memcheck/tests/ |
| sbfragment.c | 45 int loop; local
47 // two optional arguments: [nr of loop] [debug]
49 loop = atoi(argv[1]);
51 loop = 3000;
64 for (i = 0; i < loop; i++)
77 printf ("after %d loops, last size block requested %lu\n", loop, bigsize);
|
| /system/update_engine/payload_consumer/ |
| postinstall_runner_action_unittest.cc | 241 ScopedLoopbackDeviceBinder loop(postinstall_image_, false, nullptr);
242 RunPosinstallAction(loop.dev(), kPostinstallDefaultScript, false);
251 ScopedLoopbackDeviceBinder loop(postinstall_image_, false, nullptr);
252 RunPosinstallAction(loop.dev(), "bin/postinst_link", false);
257 ScopedLoopbackDeviceBinder loop(postinstall_image_, false, nullptr);
259 RunPosinstallAction(loop.dev(), "bin/postinst_example", true);
280 ScopedLoopbackDeviceBinder loop(postinstall_image_, false, nullptr);
281 RunPosinstallAction(loop.dev(), "bin/postinst_fail1", false);
288 ScopedLoopbackDeviceBinder loop(postinstall_image_, false, nullptr);
289 RunPosinstallAction(loop.dev(), "bin/postinst_fail3", false)
[all...] |
| /external/mesa3d/src/glsl/ |
| lower_jumps.cpp | 32 * 3. Replace all "break" with a single conditional one at the end of the loop
42 * Continues are lowered by adding a per-loop "execute flag", initialized to
43 * true, that when cleared inhibits all execution until the end of the loop.
46 * at the end of the loop, and trigger the unique "break".
54 * a dummy loop and using break.
86 * - It assumes it is always possible for control to flow from a loop
88 * is not true (since all execution paths through the loop might
101 * continue to the top of the innermost enclosing loop, break out
109 * continue to the top of the innermost enclosing loop, break out
116 * continue to the top of the innermost enclosing loop, break ou
162 ir_loop* loop; member in struct:loop_record
272 struct loop_record loop; member in struct:ir_lower_jumps_visitor
[all...] |
| /art/compiler/optimizing/ |
| induction_var_analysis.cc | 28 static void RotateEntryPhiFirst(HLoopInformation* loop,
32 const HInstructionList& phis = loop->GetHeader()->GetPhis();
102 // range analysis on outer loop while visiting inner loops.
113 void HInductionVarAnalysis::VisitLoop(HLoopInformation* loop) {
114 // Find strongly connected components (SSCs) in the SSA graph of this loop using Tarjan's
120 for (HBlocksInLoopIterator it_loop(*loop); !it_loop.Done(); it_loop.Advance()) {
123 if (loop_block->GetLoopInformation() != loop) {
130 VisitNode(loop, instruction);
136 VisitNode(loop, instruction);
144 // Determine the loop's trip-count
[all...] |
