| /external/autotest/client/site_tests/power_LoadTest/extension/ |
| D | 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) { argument
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;
48 if (cycle.timeout < cycle.delay / time_ratio && cycle.timeout > 0) {
49 cycle.timer = setTimeout(cycle_check_timeout, cycle.timeout, cycle);
[all …]
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| D | IteratorsTest.java | 470 Iterator<String> cycle = Iterators.<String>cycle(); in testCycleOfEmpty() local
471 assertFalse(cycle.hasNext()); in testCycleOfEmpty()
475 Iterator<String> cycle = Iterators.cycle("a"); in testCycleOfOne() local
477 assertTrue(cycle.hasNext()); in testCycleOfOne()
478 assertEquals("a", cycle.next()); in testCycleOfOne()
484 Iterator<String> cycle = Iterators.cycle(iterable); in testCycleOfOneWithRemove() local
485 assertTrue(cycle.hasNext()); in testCycleOfOneWithRemove()
486 assertEquals("a", cycle.next()); in testCycleOfOneWithRemove()
487 cycle.remove(); in testCycleOfOneWithRemove()
489 assertFalse(cycle.hasNext()); in testCycleOfOneWithRemove()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | ScoreboardHazardRecognizer.cpp | 124 int cycle = Stalls; in getHazardType() local
141 int StageCycle = cycle + (int)i; in getHazardType()
173 cycle += IS->getNextCycles(); in getHazardType()
192 unsigned cycle = 0; in EmitInstruction() local
201 assert(((cycle + i) < RequiredScoreboard.getDepth()) && in EmitInstruction()
208 freeUnits &= ~ReservedScoreboard[cycle + i]; in EmitInstruction()
212 freeUnits &= ~RequiredScoreboard[cycle + i]; in EmitInstruction()
224 RequiredScoreboard[cycle + i] |= freeUnit; in EmitInstruction()
226 ReservedScoreboard[cycle + i] |= freeUnit; in EmitInstruction()
230 cycle += IS->getNextCycles(); in EmitInstruction()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | IteratorsTest.java | 534 Iterator<String> cycle = Iterators.<String>cycle(); in testCycleOfEmpty() local
535 assertFalse(cycle.hasNext()); in testCycleOfEmpty()
539 Iterator<String> cycle = Iterators.cycle("a"); in testCycleOfOne() local
541 assertTrue(cycle.hasNext()); in testCycleOfOne()
542 assertEquals("a", cycle.next()); in testCycleOfOne()
548 Iterator<String> cycle = Iterators.cycle(iterable); in testCycleOfOneWithRemove() local
549 assertTrue(cycle.hasNext()); in testCycleOfOneWithRemove()
550 assertEquals("a", cycle.next()); in testCycleOfOneWithRemove()
551 cycle.remove(); in testCycleOfOneWithRemove()
553 assertFalse(cycle.hasNext()); in testCycleOfOneWithRemove()
[all …]
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/array/ |
| D | PrimitiveArrayTest.java | 144 private static Object cycle(Object in) { in cycle() method in PrimitiveArrayTest
158 Assert.assertArrayEquals(byteArr.getBytes(), ((ByteArr) cycle(byteArr)).getBytes()); in testCycle()
161 Assert.assertArrayEquals(shortArr.getShorts(), ((ShortArr) cycle(shortArr)).getShorts()); in testCycle()
164 Assert.assertArrayEquals(intArr.getInts(), ((IntArr) cycle(intArr)).getInts()); in testCycle()
167 Assert.assertArrayEquals(longArr.getLongs(), ((LongArr) cycle(longArr)).getLongs()); in testCycle()
170 Assert.assertArrayEquals(floatArr.getFloats(), ((FloatArr) cycle(floatArr)).getFloats(), in testCycle()
175 ((DoubleArr) cycle(doubleArr)).getDoubles(), 0.001); in testCycle()
178 Assert.assertArrayEquals(charArr.getChars(), ((CharArr) cycle(charArr)).getChars()); in testCycle()
181 assertArrayEquals(boolArr.getBools(), ((BooleanArr) cycle(boolArr)).getBools()); in testCycle()
187 assertTrue(Arrays.deepEquals(two.getLongs(), ((Array2D) cycle(two)).getLongs())); in testMultiDimensional()
[all …]
|
| /external/dagger2/compiler/src/it/functional-tests/src/test/java/test/cycle/ |
| D | 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;
|
| D | LongCycleTest.java | 16 package test.cycle;
21 import test.cycle.LongCycle.LongCycleComponent;
|
| /external/clang/test/SemaObjC/ |
| D | warn-retain-cycle.m | 12 …]; // expected-warning {{capturing 'x' strongly in this block is likely to lead to a retain cycle}}
14 …}; // expected-warning {{capturing 'x' strongly in this block is likely to lead to a retain cycle}}
17 …]; // expected-warning {{capturing 'x' strongly in this block is likely to lead to a retain cycle}}
31 … // expected-warning {{capturing 'x' strongly in this block is likely to lead to a retain cycle}} \
48 …x->owner.strong = ^{ (void) x; }; // expected-warning {{retain cycle}} expected-note {{block will …
49 …x.owner.strong = ^{ (void) x; }; // expected-warning {{retain cycle}} expected-note {{block will b…
63 …self.owner.strong = ^{ (void) owner; }; // expected-warning {{retain cycle}} expected-note {{block…
69 …owner.strong = ^{ (void) owner; }; // expected-warning {{retain cycle}} expected-note {{block will…
71 …owner.strong = ^{ ^{ (void) owner; }(); }; // expected-warning {{retain cycle}} expected-note {{bl…
74 …// expected-warning {{capturing 'self' strongly in this block is likely to lead to a retain cycle}}
[all …]
|
| /external/autotest/client/site_tests/power_LoadTest/ |
| D | control.email_1hour | 38 # type: [window, cycle] Window will open a window with tabs for the duration of
39 # the window. Cycle will cycle through the urls for the duration of the window
44 # delay: time for each url for the cycle type (ms)
45 # timeout: time before loading a url times out for the cycle type (ms)
48 # urls: list of urls to cycle through for the cycle type
63 ' type: \'cycle\',' + \
74 ' type: \'cycle\',' + \
|
| D | control.web_1hour | 38 # type: [window, cycle] Window will open a window with tabs for the duration of
39 # the window. Cycle will cycle through the urls for the duration of the window
44 # delay: time for each url for the cycle type (ms)
45 # timeout: time before loading a url times out for the cycle type (ms)
48 # urls: list of urls to cycle through for the cycle type
63 ' type: \'cycle\',' + \
|
| D | control.single_page | 38 # type: [window, cycle] Window will open a window with tabs for the duration of
39 # the window. Cycle will cycle through the urls for the duration of the window
44 # delay: time for each url for the cycle type (ms)
45 # timeout: time before loading a url times out for the cycle type (ms)
48 # urls: list of urls to cycle through for the cycle type
54 ' type: \'cycle\',' + \
|
| D | control.docs_1hour | 38 # type: [window, cycle] Window will open a window with tabs for the duration of
39 # the window. Cycle will cycle through the urls for the duration of the window
44 # delay: time for each url for the cycle type (ms)
45 # timeout: time before loading a url times out for the cycle type (ms)
48 # urls: list of urls to cycle through for the cycle type
63 ' type: \'cycle\',' + \
|
| D | control.video_1hour | 38 # type: [window, cycle] Window will open a window with tabs for the duration of
39 # the window. Cycle will cycle through the urls for the duration of the window
44 # delay: time for each url for the cycle type (ms)
45 # timeout: time before loading a url times out for the cycle type (ms)
48 # urls: list of urls to cycle through for the cycle type
|
| /external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| D | nv50_ir_emit_nvc0.cpp | 1932 void print(int cycle) in print()
1935 if (rd.r[i] > cycle) in print()
1937 if (wr.r[i] > cycle) in print()
1941 if (rd.p[i] > cycle) in print()
1943 if (wr.p[i] > cycle) in print()
1946 if (rd.c > cycle) in print()
1948 if (wr.c > cycle) in print()
1950 if (res.sfu > cycle) in print()
1952 if (res.imul > cycle) in print()
1954 if (res.tex > cycle) in print()
[all …]
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| D | FragmentedMp4Builder.java | 85 …protected List<Track> sortTracksInSequence(List<Track> tracks, final int cycle, final Map<Track, l… in sortTracksInSequence() argument
90 long startSample1 = startSamples1[cycle]; in sortTracksInSequence()
92 …long endSample1 = cycle + 1 < startSamples1.length ? startSamples1[cycle + 1] : o1.getSamples().si… in sortTracksInSequence()
94 long startSample2 = startSamples2[cycle]; in sortTracksInSequence()
96 …long endSample2 = cycle + 1 < startSamples2.length ? startSamples2[cycle + 1] : o2.getSamples().si… in sortTracksInSequence()
127 for (int cycle = 0; cycle < maxNumberOfFragments; cycle++) { in createMoofMdat()
129 … final List<Track> sortedTracks = sortTracksInSequence(movie.getTracks(), cycle, intersectionMap); in createMoofMdat()
135 if (cycle < startSamples.length) { in createMoofMdat()
137 long startSample = startSamples[cycle]; in createMoofMdat()
139 …long endSample = cycle + 1 < startSamples.length ? startSamples[cycle + 1] : track.getSamples().si… in createMoofMdat()
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCScheduleP7.td | 47 // Each LSU pipeline can complete a load or store in one cycle.
52 // FX loads have a two cycle load-to-use latency (so one "bubble" cycle).
53 // VSU loads have a three cycle load-to-use latency (so two "bubble" cycle).
55 // Frequent FX ops. take only one cycle and results can be used again in the
56 // next cycle (there is a self-bypass). Getting results from the other FX
57 // pipeline takes an additional cycle.
62 // (either to a float or XC op). prevents dispatch in that cycle to VS2 of any
70 // share the same write-back, and have a 5-cycle latency difference, so the
380 let IssueWidth = 6; // 4 (non-branch) instructions are dispatched per cycle.
383 // cycle (from all queues) is 8.
|
| /external/opencv3/samples/python2/ |
| D | morphology.py | 23 from itertools import cycle
39 modes = cycle(['erode/dilate', 'open/close', 'blackhat/tophat', 'gradient'])
40 str_modes = cycle(['ellipse', 'rect', 'cross'])
|
| /external/autotest/client/cros/ |
| D | storage.py | 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
|
| /external/jetty/src/java/org/eclipse/jetty/util/ |
| D | Scanner.java | 137 public void scanStarted(int cycle) throws Exception; in scanStarted() argument
138 public void scanEnded(int cycle) throws Exception; in scanEnded() argument
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);
|
| /external/v8/src/compiler/ |
| D | instruction-scheduler.cc | 133 int cycle = 0; in ScheduleBlock() local
142 if (cycle >= (*iterator)->start_cycle()) { in ScheduleBlock()
157 cycle + (*candidate)->latency())); in ScheduleBlock()
167 cycle++; in ScheduleBlock()
|
| /external/llvm/lib/Target/X86/ |
| D | X86ScheduleBtVer2.td | 18 // decode 2 instructions per cycle.
21 let LoadLatency = 5; // FPU latency (worse case cf Integer 3 cycle latency)
33 // Jaguar can issue up to 6 micro-ops in one cycle
80 // Register variant is using a single cycle on ExePort.
83 // Memory variant also uses a cycle on JLAGU and adds 3 cycles to the
93 // Register variant is using a single cycle on ExePort.
96 // Memory variant also uses a cycle on JLAGU and adds 5 cycles to the
103 // A folded store needs a cycle on the SAGU for the store data.
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | GrammarSanity.java | 181 Set cycle = new HashSet(); in addRulesToCycle() local
182 cycle.add(targetRule); in addRulesToCycle()
183 cycle.add(enclosingRule); in addRulesToCycle()
184 listOfRecursiveCycles.add(cycle); in addRulesToCycle()
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMScheduleA8.td | 96 // Result written in E5, but that is relative to the last cycle of multicycle,
125 // FIXME: lsl by 2 takes 1 cycle.
152 // FIXME: A8_LSPipe cycle time is dynamic, this assumes 3 to 4 registers.
230 // FIXME: A8_LSPipe cycle time is dynamic, this assumes 3 to 4 registers.
394 // FIXME: A8_LSPipe cycle time is dynamic, this assumes 3 to 4 registers.
780 // Result written in N5, but that is relative to the last cycle of multicycle,
799 // Result written in N5, but that is relative to the last cycle of multicycle,
821 // Result written in N2, but that is relative to the last cycle of multicycle,
855 // Result written in N2, but that is relative to the last cycle of multicycle,
860 // Quad-register Permute (3 cycle issue)
[all …]
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsScheduleP5600.td | 11 int IssueWidth = 2; // 2x dispatched per cycle
75 // FIXME: This is a bit pessimistic. P5600CTISTD is only used during cycle 2
263 // TODO: ADDVI_[BHW] might be 1 cycle latency rather than 2. Need to confirm it.
293 // Operand 0 is read on cycle 5. All other operands are read on operand 0.
299 // Operand 0 and 1 are read on cycle 5. All others are read on operand 0.
319 // current aggregates the resources and ignores the exact cycle they are
325 // current aggregates the resources and ignores the exact cycle they are
331 // current aggregates the resources and ignores the exact cycle they are
337 // current aggregates the resources and ignores the exact cycle they are
343 // current aggregates the resources and ignores the exact cycle they are
|
| /external/netperf/ |
| D | README.hpux | 9 "pstatnew" CPU utilization mechanism. 11.23 adds cycle counts for
10 user, kernel and interrupt modes to the idle cycle counter. As such,
16 interval, and we know (ass-u-me) that the idle cycle counter is good
|