| /external/autotest/client/site_tests/power_LoadTest/extension/ |
| test.js | 23 cycle = cycle_tabs[sender.tab.id];
24 cycle.successful_loads++;
25 if (request.action == "should_scroll" && cycle.focus) {
43 function cycle_navigate(cycle) {
44 cycle_tabs[cycle.id] = cycle;
45 var url = cycle.urls[cycle.idx];
46 chrome.tabs.update(cycle.id, {'url': url, 'selected': true});
47 cycle.idx = (cycle.idx + 1) % cycle.urls.length
[all...] |
| urls.js | 27 // Page cycle through popular external websites for 36 minutes
28 type: 'cycle',
39 type: 'cycle',
54 type: 'cycle',
69 type: 'cycle',
95 // List of URLs to cycle through
|
| /hardware/bsp/intel/peripheral/libupm/src/lol/ |
| lol.cxx | 62 void clear_prev_cycle(int cycle)
66 // What is prev cycle?
67 cycle--;
68 if (cycle == -1)
69 cycle = 11;
73 if (charlie_pairs[cycle][i*2] == -1)
75 if(buffer[charlie_pairs[cycle][i*2 + 1]])
76 clear_gpio(charlie_pairs[cycle][i*2]);
80 clear_gpio(cycle);
111 uint8_t cycle = 0 local
[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/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 44 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
124 int cycle = Stalls; local
137 // We must find one of the stage's units free for every cycle the
141 int StageCycle = cycle + (int)i;
165 DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
172 // Advance the cycle to the next stage.
173 cycle += IS->getNextCycles();
192 unsigned cycle = 0; local
197 // We must reserve one of the stage's units for every cycle the
201 assert(((cycle + i) < RequiredScoreboard.getDepth()) &
[all...] |
| /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...] |
| /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/opencv3/samples/python2/ |
| morphology.py | 23 from itertools import cycle namespace
39 modes = cycle(['erode/dilate', 'open/close', 'blackhat/tophat', 'gradient'])
40 str_modes = cycle(['ellipse', 'rect', 'cross'])
|
| /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...] |
| /build/tools/releasetools/ |
| rangelib.py | 140 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
141 zip(other.data, itertools.cycle((+1, -1)))):
158 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
159 zip(other.data, itertools.cycle((+1, -1)))):
177 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
178 zip(other.data, itertools.cycle((-1, +1)))):
197 for _, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
198 zip(other.data, itertools.cycle((+1, -1)))):
238 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
239 zip(other.data, itertools.cycle((-1, +1))))
[all...] |
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 23 InstructionScheduler::CriticalPathFirstQueue::PopBestCandidate(int cycle) {
29 if (cycle >= (*iterator)->start_cycle()) {
47 InstructionScheduler::StressSchedulerQueue::PopBestCandidate(int cycle) {
194 int cycle = 0; local
196 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);
205 cycle + candidate->latency()));
213 cycle++;
|
| instruction-scheduler.h | 86 // The scheduler keeps a nominal cycle count to keep track of when the
127 ScheduleGraphNode* PopBestCandidate(int cycle);
142 ScheduleGraphNode* PopBestCandidate(int cycle);
|
| /external/autotest/client/cros/ |
| storage.py | 294 """Cycles |cycles| times waiting |time_to_sleep| seconds each cycle,
320 cycle = 0
321 while cycles == -1 or cycle < cycles:
329 return (ret, cycle*time_to_sleep)
332 '(cycle %d).', storage_filter, cycle)
335 cycle += 1
345 """Cycles |cycles| times waiting |time_to_sleep| seconds each cycle,
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/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
|
| /prebuilts/gdb/linux-x86/lib/python2.7/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
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/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
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/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/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_emit_nvc0.cpp | 1961 int cycle; member in class:nv50_ir::SchedDataCalculator
2042 int cycle = 0; local
[all...] |
| /external/chromium-trace/catapult/third_party/vinn/third_party/parse5/benchmark/ |
| index.js | 24 .on('cycle', function (event) {
|
| /external/jetty/src/java/org/eclipse/jetty/util/ |
| Scanner.java | 137 public void scanStarted(int cycle) throws Exception;
138 public void scanEnded(int cycle) throws Exception;
705 * signal any scan cycle listeners that a scan has started
707 private void reportScanStart(int cycle)
715 ((ScanCycleListener)listener).scanStarted(cycle);
720 LOG.warn(listener + " failed on scan start for cycle " + cycle, e);
728 private void reportScanEnd(int cycle)
736 ((ScanCycleListener)listener).scanEnded(cycle);
741 LOG.warn(listener + " failed on scan end for cycle " + cycle, e)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarSanity.java | 157 /** enclosingRuleName calls targetRuleName, find the cycle containing
158 * the target and add the caller. Find the cycle containing the caller
160 * cycle. listOfRecursiveCycles is List<Set<String>> that holds a list
170 // ensure both rules are in same cycle
181 Set cycle = new HashSet(); local
182 cycle.add(targetRule);
183 cycle.add(enclosingRule);
184 listOfRecursiveCycles.add(cycle);
|
| /frameworks/compile/mclinker/lib/LD/ |
| StaticResolver.cpp | 63 bool cycle = false; local
68 cycle = false;
191 case REFC: { /* Mark indirect symbol referenced and then CYCLE. */
199 cycle = true;
208 } while (cycle);
|
