| /external/swiftshader/third_party/LLVM/tools/llvm-config/ |
| find-cycles.pl | 44 foreach my $cycle (@CYCLES) {
45 my @modules = sort keys %{$cycle};
47 # Merge the dependencies of all modules in this cycle.
81 # Depedency Cycle Support
83 # For now, we have cycles in our dependency graph. Ideally, each cycle
103 my %cycle = ($module, 1);
104 $CYCLES{$module} = \%cycle;
112 foreach my $cycle (values %CYCLES) {
113 unless ($seen{$cycle}) {
114 $seen{$cycle} = 1;
[all...] |
| /external/autotest/client/site_tests/power_LoadTest/extension/ |
| test.js | 39 function get_active_url(cycle) {
40 active_idx = cycle.idx == 0 ? cycle.urls.length - 1 : cycle.idx - 1;
41 return cycle.urls[active_idx];
47 cycle = cycle_tabs[sender.tab.id];
48 cycle.successful_loads++;
49 url = get_active_url(cycle);
50 var page_load_time = end - page_load_time_counter[cycle.id]
54 if (request.action == "should_scroll" && cycle.focus)
[all...] |
| /external/valgrind/memcheck/tests/ |
| leak-cycle.stderr.exp | 7 by 0x........: mk (leak-cycle.c:15)
8 by 0x........: mkcycle (leak-cycle.c:26)
9 by 0x........: main (leak-cycle.c:44)
13 by 0x........: mk (leak-cycle.c:15)
14 by 0x........: mkcycle (leak-cycle.c:26)
15 by 0x........: main (leak-cycle.c:45)
19 by 0x........: mk (leak-cycle.c:15)
20 by 0x........: mkcycle (leak-cycle.c:26)
21 by 0x........: main (leak-cycle.c:51)
25 by 0x........: mk (leak-cycle.c:15
[all...] |
| /external/dagger2/compiler/src/it/functional-tests/src/test/java/test/cycle/ |
| LongCycleTest.java | 16 package test.cycle;
21 import test.cycle.LongCycle.LongCycleComponent;
29 * Tests a cycle long enough that the real factory is created in a separate initialize method from
39 * Fails if {@link LongCycleComponent} doesn't have a long enough cycle to make sure the real
|
| CycleTest.java | 16 package test.cycle;
21 import test.cycle.Cycles.A;
22 import test.cycle.Cycles.C;
23 import test.cycle.Cycles.ChildCycleComponent;
24 import test.cycle.Cycles.CycleComponent;
25 import test.cycle.Cycles.CycleMapComponent;
26 import test.cycle.Cycles.S;
27 import test.cycle.Cycles.SelfCycleComponent;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 44 // cycle deep to avoid dealing with the boundary condition.
113 int cycle = Stalls; local
126 // We must find one of the stage's units free for every cycle the
130 int StageCycle = cycle + (int)i;
156 DEBUG(dbgs() << "*** Hazard in cycle " << (cycle + i) << ", ");
163 // Advance the cycle to the next stage.
164 cycle += IS->getNextCycles();
183 unsigned cycle = 0; local
188 // We must reserve one of the stage's units for every cycle th
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 35 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
115 int cycle = Stalls; local
128 // We must find one of the stage's units free for every cycle the
132 int StageCycle = cycle + (int)i;
156 DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
163 // Advance the cycle to the next stage.
164 cycle += IS->getNextCycles();
183 unsigned cycle = 0; local
188 // We must reserve one of the stage's units for every cycle the
192 assert(((cycle + i) < RequiredScoreboard.getDepth()) &
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/crashers/ |
| borrowed_ref_1.py | 22 a.cycle = a
|
| mutation_inside_cyclegc.py | 2 # The cycle GC collector can be executed when any GC-tracked object is
27 a.cycle = a
|
| borrowed_ref_2.py | 29 a.cycle = a
|
| /external/python/cpython2/Lib/test/crashers/ |
| borrowed_ref_1.py | 22 a.cycle = a
|
| mutation_inside_cyclegc.py | 2 # The cycle GC collector can be executed when any GC-tracked object is
27 a.cycle = a
|
| borrowed_ref_2.py | 29 a.cycle = a
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/array/ |
| PrimitiveArrayTest.java | 144 private static Object cycle(Object in) { method in class:PrimitiveArrayTest
152 * All kinds of primitive arrays should be able to cycle from (Java array)
158 Assert.assertArrayEquals(byteArr.getBytes(), ((ByteArr) cycle(byteArr)).getBytes());
161 Assert.assertArrayEquals(shortArr.getShorts(), ((ShortArr) cycle(shortArr)).getShorts());
164 Assert.assertArrayEquals(intArr.getInts(), ((IntArr) cycle(intArr)).getInts());
167 Assert.assertArrayEquals(longArr.getLongs(), ((LongArr) cycle(longArr)).getLongs());
170 Assert.assertArrayEquals(floatArr.getFloats(), ((FloatArr) cycle(floatArr)).getFloats(),
175 ((DoubleArr) cycle(doubleArr)).getDoubles(), 0.001);
178 Assert.assertArrayEquals(charArr.getChars(), ((CharArr) cycle(charArr)).getChars());
181 assertArrayEquals(boolArr.getBools(), ((BooleanArr) cycle(boolArr)).getBools())
[all...] |
| /frameworks/base/core/tests/coretests/src/android/util/ |
| RecurrenceRuleTest.java | 129 final Pair<ZonedDateTime, ZonedDateTime> cycle = it.next(); local
131 // Make sure cycle has reasonable length
132 final long length = cycle.second.toEpochSecond() - cycle.first.toEpochSecond();
133 assertTrue(cycle + " must be more than 4 weeks", length >= 2419200);
134 assertTrue(cycle + " must be less than 5 weeks", length <= 3024000);
138 assertEquals(lastStart, cycle.second);
140 lastStart = cycle.first;
|
| /toolchain/binutils/binutils-2.25/include/opcode/ |
| tic6x-opcode-table.h | 132 INSN(abs, l, unary, 1cycle, C62X, 0,
137 INSN(abs, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
142 INSN(abs2, l, unary, 1cycle, C64X, 0,
154 INSN(abssp, s, unary, 1cycle, C67X, 0,
160 INSNE(add, l_si_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
165 INSNE(add, l_si_xsi_sl, l, 1_or_2_src, 1cycle, C62X, 0,
170 INSNE(add, l_xsi_sl_sl, l, 1_or_2_src, 1cycle, C62X, 0,
175 INSNE(add, l_s5_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
180 INSNE(add, l_s5_sl_sl, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
185 INSNE(add, s_si_xsi_si, s, 1_or_2_src, 1cycle, C62X, 0
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| IteratorsTest.java | 534 Iterator<String> cycle = Iterators.<String>cycle(); local
535 assertFalse(cycle.hasNext());
539 Iterator<String> cycle = Iterators.cycle("a"); local
541 assertTrue(cycle.hasNext());
542 assertEquals("a", cycle.next());
548 Iterator<String> cycle = Iterators.cycle(iterable); local
549 assertTrue(cycle.hasNext())
557 Iterator<String> cycle = Iterators.cycle("a", "b"); local
568 Iterator<String> cycle = Iterators.cycle(iterable); local
587 Iterator<String> cycle = Iterators.cycle("a", "b"); local
597 Iterator<String> cycle = Iterators.cycle("a", "b"); local
609 Iterator<String> cycle = Iterators.cycle(iterable); local
620 Iterator<String> cycle = Iterators.cycle(iterable); local
631 Iterator<String> cycle = Iterators.cycle(iterable); local
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| IteratorsTest.java | 470 Iterator<String> cycle = Iterators.<String>cycle(); local
471 assertFalse(cycle.hasNext());
475 Iterator<String> cycle = Iterators.cycle("a"); local
477 assertTrue(cycle.hasNext());
478 assertEquals("a", cycle.next());
484 Iterator<String> cycle = Iterators.cycle(iterable); local
485 assertTrue(cycle.hasNext())
493 Iterator<String> cycle = Iterators.cycle("a", "b"); local
504 Iterator<String> cycle = Iterators.cycle(iterable); local
523 Iterator<String> cycle = Iterators.cycle("a", "b"); local
533 Iterator<String> cycle = Iterators.cycle("a", "b"); local
545 Iterator<String> cycle = Iterators.cycle(iterable); local
556 Iterator<String> cycle = Iterators.cycle(iterable); local
567 Iterator<String> cycle = Iterators.cycle(iterable); local
[all...] |
| /prebuilts/go/darwin-x86/src/go/types/ |
| initorder.go | 70 // if n still depends on other nodes, we have a cycle
72 cycle := findPath(check.objMap, n.obj, n.obj, make(objSet))
73 // If n.obj is not part of the cycle (e.g., n.obj->b->c->d->c),
74 // cycle will be nil. Don't report anything in that case since
75 // the cycle is reported when the algorithm gets to an object
76 // in the cycle.
77 // Furthermore, once an object in the cycle is encountered,
78 // the cycle will be broken (dependency count will be reduced
79 // below), and so the remaining nodes in the cycle don't trigger
81 if cycle != nil
[all...] |
| /prebuilts/go/linux-x86/src/go/types/ |
| initorder.go | 70 // if n still depends on other nodes, we have a cycle
72 cycle := findPath(check.objMap, n.obj, n.obj, make(objSet))
73 // If n.obj is not part of the cycle (e.g., n.obj->b->c->d->c),
74 // cycle will be nil. Don't report anything in that case since
75 // the cycle is reported when the algorithm gets to an object
76 // in the cycle.
77 // Furthermore, once an object in the cycle is encountered,
78 // the cycle will be broken (dependency count will be reduced
79 // below), and so the remaining nodes in the cycle don't trigger
81 if cycle != nil
[all...] |
| /build/make/tools/releasetools/ |
| rangelib.py | 153 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
154 zip(other.data, itertools.cycle((+1, -1)))):
171 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
172 zip(other.data, itertools.cycle((+1, -1)))):
190 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
191 zip(other.data, itertools.cycle((-1, +1)))):
210 for _, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
211 zip(other.data, itertools.cycle((+1, -1)))):
251 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
252 zip(other.data, itertools.cycle((-1, +1))))
[all...] |
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 28 InstructionScheduler::CriticalPathFirstQueue::PopBestCandidate(int cycle) {
33 if (cycle >= (*iterator)->start_cycle()) {
50 InstructionScheduler::StressSchedulerQueue::PopBestCandidate(int cycle) {
216 int cycle = 0; local
218 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);
227 cycle + candidate->latency()));
235 cycle++;
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_threading_local.py | 85 # 1) Involve Local in a cycle
86 cycle = [Local()]
87 cycle.append(cycle)
88 cycle[0].foo = 'bar'
90 # 2) GC the cycle (triggers threadmodule.c::local_clear
92 del cycle
|
| /external/autotest/client/cros/ |
| storage.py | 293 """Cycles |cycles| times waiting |time_to_sleep| seconds each cycle,
319 cycle = 0
320 while cycles == -1 or cycle < cycles:
328 return (ret, cycle*time_to_sleep)
331 '(cycle %d).', storage_filter, cycle)
334 cycle += 1
344 """Cycles |cycles| times waiting |time_to_sleep| seconds each cycle,
|
| /external/python/cpython2/Lib/test/ |
| test_threading_local.py | 80 # 1) Involve Local in a cycle
81 cycle = [Local()]
82 cycle.append(cycle)
83 cycle[0].foo = 'bar'
85 # 2) GC the cycle (triggers threadmodule.c::local_clear
87 del cycle
|
