Searched defs:cycle (Results 1 - 25 of 37) sorted by relevance

12

/external/chromium_org/third_party/WebKit/Source/wtf/
H A DAutodrainedPool.h46 WTF_EXPORT void cycle();
50 void cycle() { } function in class:WTF::AutodrainedPool
/external/chromium_org/third_party/WebKit/Tools/GardeningServer/scripts/
H A Dsummary-mock.js59 cycle: function()
112 result[builders.cycle()] = { actual: expectations.cycle() };
126 summary: bugTitles.cycle(),
127 author: people.cycle(),
128 reviewer: people.cycle()
132 testName: testNames.cycle(),
143 builderNameList.push(builders.cycle());
/external/chromium_org/tools/page_cycler/database/
H A Dhead.js10 var cycle; variable
48 * Starts the next test cycle or redirects the browser to the results page.
68 if (cycle == iterations) {
79 var url = doc + '?n=' + iterations + '&i=' + cycle +
86 * @param {!number} cycleTime The running time of the test cycle.
108 cycle = f[1] - 0 + 1;
/external/chromium_org/tools/page_cycler/indexed_db/
H A Dhead.js10 var cycle; variable
48 * Starts the next test cycle or redirects the browser to the results page.
68 if (cycle == iterations) {
79 var url = doc + '?n=' + iterations + '&i=' + cycle +
86 * @param {!number} cycleTime The running time of the test cycle.
108 cycle = f[1] - 0 + 1;
/external/qemu/distrib/sdl-1.2.15/src/audio/
H A DSDL_audiodev.c151 int cycle; local
158 cycle = 0;
159 while( devsettings[cycle][0] != '\0' ) {
162 devsettings[cycle][0],
163 devsettings[cycle][1],
164 devsettings[cycle][2]);
/external/chromium_org/ui/views/focus/
H A Dfocus_search.cc12 FocusSearch::FocusSearch(View* root, bool cycle, bool accessibility_mode) argument
14 cycle_(cycle),
/external/smack/src/org/xbill/DNS/
H A DRRset.java113 iterator(boolean data, boolean cycle) { argument
126 if (!cycle)
151 * @param cycle If true, cycle through the records so that each Iterator will
155 rrs(boolean cycle) { argument
156 return iterator(true, cycle);
/external/chromium_org/net/tools/testserver/
H A Decho_message.py28 from itertools import cycle namespace
264 return ''.join(chr(ord(x) ^ ord(y)) for (x, y) in izip(payload, cycle(key)))
/external/chromium_org/tools/gn/
H A Ditem_tree.cc18 // participates in a cycle.
23 // If a cycle is found, the return value will be true and the cycle vector will
27 std::vector<const ItemNode*>* cycle) {
34 cycle->push_back(cur);
38 if (RecursiveFindCycle(look_for, cur, cycle)) {
39 // Found a cycle inside this one, record our path and return.
40 cycle->push_back(cur);
107 // dependencies because in this case all items in the cycle will be GENERATED
184 std::vector<const ItemNode*> cycle; local
25 RecursiveFindCycle(const ItemNode* look_for, const ItemNode* search_in, std::vector<const ItemNode*>* cycle) argument
[all...]
/external/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp43 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
123 int cycle = Stalls; local
136 // We must find one of the stage's units free for every cycle the
140 int StageCycle = cycle + (int)i;
164 DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
171 // Advance the cycle to the next stage.
172 cycle += IS->getNextCycles();
191 unsigned cycle = 0; local
196 // We must reserve one of the stage's units for every cycle the
200 assert(((cycle
[all...]
/external/chromium_org/content/public/test/
H A Ddownload_test_observer.cc393 void DownloadTestFlushObserver::PingFileThread(int cycle) { argument
396 base::Bind(&DownloadTestFlushObserver::PingIOThread, this, cycle));
399 void DownloadTestFlushObserver::PingIOThread(int cycle) { argument
400 if (--cycle) {
403 base::Bind(&DownloadTestFlushObserver::PingFileThread, this, cycle));
/external/chromium_org/third_party/jinja2/
H A Druntime.py284 def cycle(self, *args): member in class:LoopContext
/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.h261 uint8_t * cycle = new uint8_t[cycleLen + 16]; local
268 r.rand_p(cycle,cycleLen);
270 *(uint32_t*)cycle = f3mix(i ^ 0x746a94f1);
274 key[j] = cycle[j % cycleLen];
287 delete [] cycle;
/external/dropbear/libtomcrypt/src/prngs/
H A Dsober128.c72 static void cycle(ulong32 *R) function
161 cycle(c->R);
226 cycle(c->R);
253 cycle(c->R);
340 cycle(c->R);
349 cycle(c->R);
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DHelpers.java129 static <T> Iterator<T> cycle(final Iterable<T> iterable) { method in class:Helpers
/external/jmonkeyengine/engine/src/core/com/jme3/cinematic/
H A DMotionPath.java344 * Sets the path to be a cycle
345 * @param cycle
347 public void setCycle(boolean cycle) { argument
349 spline.setCycle(cycle);
361 * returns true if the path is a cycle
/external/jmonkeyengine/engine/src/core/com/jme3/math/
H A DSpline.java30 private boolean cycle; field in class:Spline
53 * @param cycle true if the spline cycle.
55 public Spline(SplineType splineType, Vector3f[] controlPoints, float curveTension, boolean cycle) { argument
65 this.cycle = cycle;
82 * @param cycle true if the spline cycle.
84 public Spline(SplineType splineType, List<Vector3f> controlPoints, float curveTension, boolean cycle) { argument
91 this.cycle
308 setCycle(boolean cycle) argument
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/
H A DFragmentedMp4Builder.java81 * @param cycle current fragment (sorting may vary between the fragments)
85 protected List<Track> sortTracksInSequence(List<Track> tracks, final int cycle, final Map<Track, long[]> intersectionMap) { argument
90 long startSample1 = startSamples1[cycle];
92 long endSample1 = cycle + 1 < startSamples1.length ? startSamples1[cycle + 1] : o1.getSamples().size() + 1;
94 long startSample2 = startSamples2[cycle];
96 long endSample2 = cycle + 1 < startSamples2.length ? startSamples2[cycle + 1] : o2.getSamples().size() + 1;
127 for (int cycle = 0; cycle < maxNumberOfFragment
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DIterables.java353 * Returns an iterable whose iterators cycle indefinitely over the elements of
366 * <p>To cycle over the iterable {@code n} times, use the following:
369 public static <T> Iterable<T> cycle(final Iterable<T> iterable) { method in class:Iterables
374 return Iterators.cycle(iterable);
383 * Returns an iterable whose iterators cycle indefinitely over the provided
389 * as {@code Iterables.cycle(Lists.newArrayList(elements))}. The iterator's
397 * <p>To cycle over the elements {@code n} times, use the following:
400 public static <T> Iterable<T> cycle(T... elements) { method in class:Iterables
401 return cycle(Lists.newArrayList(elements));
H A DIterators.java400 public static <T> Iterator<T> cycle(final Iterable<T> iterable) { method in class:Iterators
444 public static <T> Iterator<T> cycle(T... elements) { method in class:Iterators
445 return cycle(Lists.newArrayList(elements));
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DIterables.java335 * Returns an iterable whose iterators cycle indefinitely over the elements of
348 * <p>To cycle over the iterable {@code n} times, use the following:
351 public static <T> Iterable<T> cycle(final Iterable<T> iterable) { method in class:Iterables
356 return Iterators.cycle(iterable);
365 * Returns an iterable whose iterators cycle indefinitely over the provided
371 * as {@code Iterables.cycle(Lists.newArrayList(elements))}. The iterator's
379 * <p>To cycle over the elements {@code n} times, use the following:
382 public static <T> Iterable<T> cycle(T... elements) { method in class:Iterables
383 return cycle(Lists.newArrayList(elements));
H A DIterators.java382 public static <T> Iterator<T> cycle(final Iterable<T> iterable) { method in class:Iterators
426 public static <T> Iterator<T> cycle(T... elements) { method in class:Iterators
427 return cycle(Lists.newArrayList(elements));
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h427 * visited in the stack, then it means there wasa cycle such as 9->8->1->9
432 pANTLR3_UINT32 cycle; member in struct:ANTLR3_TOPO_struct
435 * A flag that indicates the algorithm found a cycle in the edges
438 * then the detected cycle will be contained in the cycle array and
439 * cycleLimit will point to the one after the last entry in the cycle.
444 * A watermark used to accumulate potential cycles in the cycle array.
446 * of the sort methods and if it is ANTLR3_TRUE then you can find the cycle
447 * in cycle[0]...cycle[cycleMar
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dchnsecal.cpp59 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle)
181 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR
190 int32_t cycle = internalGet(UCAL_ERA, 1) - 1; // 0-based cycle local
191 year = cycle * 60 + internalGet(UCAL_YEAR, 1);
665 int32_t cycle = ClockMath::floorDivide(year - 1, 60, yearOfCycle); local
666 internalSet(UCAL_ERA, cycle + 1);
/external/chromium/chrome/browser/download/
H A Ddownload_browsertest.cc315 void PingFileThread(int cycle) { argument
319 cycle));
322 void PingIOThread(int cycle) { argument
323 if (--cycle) {
327 cycle));

Completed in 846 milliseconds

12