/external/webkit/Source/WebCore/platform/android/ |
H A D | EventLoopAndroid.cpp | 33 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/brew/ |
H A D | EventLoopBrew.cpp | 31 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/efl/ |
H A D | EventLoopEfl.cpp | 30 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/gtk/ |
H A D | EventLoopGtk.cpp | 27 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/haiku/ |
H A D | EventLoopHaiku.cpp | 34 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/qt/ |
H A D | EventLoopQt.cpp | 27 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/wx/ |
H A D | EventLoopWx.cpp | 34 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/win/ |
H A D | EventLoopWin.cpp | 33 void EventLoop::cycle() function in class:WebCore::EventLoop
|
/external/webkit/Source/WebCore/platform/ |
H A D | AutodrainedPool.h | 48 void cycle(); 61 inline void AutodrainedPool::cycle() { } function in class:WebCore::AutodrainedPool
|
/external/qemu/distrib/sdl-1.2.15/src/audio/ |
H A D | SDL_audiodev.c | 151 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/llvm/lib/CodeGen/ |
H A D | ScoreboardHazardRecognizer.cpp | 43 // 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/dropbear/libtomcrypt/src/prngs/ |
H A D | sober128.c | 72 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 D | Helpers.java | 129 static <T> Iterator<T> cycle(final Iterable<T> iterable) { method in class:Helpers
|
/external/jmonkeyengine/engine/src/core/com/jme3/cinematic/ |
H A D | MotionPath.java | 344 * 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 D | Spline.java | 30 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 D | FragmentedMp4Builder.java | 81 * @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 D | Iterables.java | 353 * 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 D | Iterators.java | 400 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 D | Iterables.java | 335 * 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 D | Iterators.java | 382 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 D | antlr3collections.h | 427 * 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/icu4c/i18n/ |
H A D | chnsecal.cpp | 59 * 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/quake/quake/src/QW/client/ |
H A D | view.c | 115 float cycle; local 124 cycle = bobtime - (int)(bobtime/cl_bobcycle.value)*cl_bobcycle.value; 125 cycle /= cl_bobcycle.value; 126 if (cycle < cl_bobup.value) 127 cycle = M_PI * cycle / cl_bobup.value; 129 cycle = M_PI + M_PI*(cycle-cl_bobup.value)/(1.0 - cl_bobup.value); 135 bob = bob*0.3 + bob*0.7*sin(cycle);
|
/external/chromium/chrome/browser/download/ |
H A D | download_browsertest.cc | 315 void PingFileThread(int cycle) { argument 319 cycle)); 322 void PingIOThread(int cycle) { argument 323 if (--cycle) { 327 cycle));
|
/external/dbus/dbus/ |
H A D | dbus-marshal-recursive-util.c | 1315 static int cycle = 0; local 1320 elem = cycle; 1324 _dbus_verbose ("deleting array element %d of %d type %s cycle %d reader pos %d elem pos %d\n", 1326 cycle, reader.value_pos, array.value_pos); 1342 if (cycle > 2) 1343 cycle = 0; 1345 cycle += 1;
|