| /external/webkit/Source/WebCore/platform/android/ |
| EventLoopAndroid.cpp | 33 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/brew/ |
| EventLoopBrew.cpp | 31 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/efl/ |
| EventLoopEfl.cpp | 30 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/gtk/ |
| EventLoopGtk.cpp | 27 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/haiku/ |
| EventLoopHaiku.cpp | 34 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/qt/ |
| EventLoopQt.cpp | 27 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/wx/ |
| EventLoopWx.cpp | 34 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/win/ |
| EventLoopWin.cpp | 33 void EventLoop::cycle() function in class:WebCore::EventLoop
|
| /external/webkit/Source/WebCore/platform/ |
| AutodrainedPool.h | 48 void cycle();
61 inline void AutodrainedPool::cycle() { } function in class:WebCore::AutodrainedPool
|
| /external/qemu/distrib/sdl-1.2.12/src/audio/ |
| 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]);
|
| /frameworks/compile/mclinker/lib/LD/ |
| StaticResolver.cpp | 73 bool cycle = false; local
80 cycle = false;
212 case REFC: { /* Mark indirect symbol referenced and then CYCLE. */
223 cycle = true;
227 } while(cycle);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 38 /** whether this {@link Match} results in a cycle */
39 public boolean cycle; field in class:Match
|
| GuidelinePainter.java | 165 /** Paints a constraint cycle */
166 void paintCycle(IGraphics gc, GuidelineHandler state, List<Constraint> cycle) {
167 gc.useStyle(DrawingStyle.CYCLE);
168 assert cycle.size() > 0;
170 INode from = cycle.get(0).from.node;
181 for (Constraint constraint : cycle) {
|
| /external/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;
154 DEBUG(dbgs() << "*** Hazard in cycle " << (cycle + i) << ", ");
161 // Advance the cycle to the next stage.
162 cycle += IS->getNextCycles();
181 unsigned cycle = 0; local
186 // We must reserve one of the stage's units for every cycle th
[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);
|
| /external/dropbear/libtomcrypt/src/prngs/ |
| 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/src/com/google/common/collect/ |
| 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) {
401 return cycle(Lists.newArrayList(elements));
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| 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) {
383 return cycle(Lists.newArrayList(elements));
[all...] |
| /frameworks/base/core/java/android/net/ |
| NetworkPolicyManager.java | 148 * Compute the last cycle boundary for the given {@link NetworkPolicy}. For
149 * example, if cycle day is 20th, and today is June 15th, it will return May
150 * 20th. When cycle day doesn't exist in current month, it snaps to the 1st
163 // first, find cycle boundary for current month
164 final Time cycle = new Time(now); local
165 cycle.hour = cycle.minute = cycle.second = 0;
166 snapToCycleDay(cycle, policy.cycleDay);
168 if (Time.compare(cycle, now) >= 0)
194 final Time cycle = new Time(now); local
[all...] |
| /sdk/emulator/qtools/ |
| gtrace.h | 14 uint32_t cycle; member in struct:Gtrace::trace_entry
47 void AddProcEntry(int filenum, int procnum, uint32_t cycle, uint32_t pid);
48 void AddProcExit(int filenum, int procnum, uint32_t cycle, uint32_t pid);
51 void AddGtraceRecord(int filenum, int procnum, uint32_t cycle, uint32_t pid,
55 void WriteBlockHeader(uint32_t cycle, uint32_t pid);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| IteratorsTest.java | 486 Iterator<String> cycle = Iterators.<String>cycle(); local
487 assertFalse(cycle.hasNext());
491 Iterator<String> cycle = Iterators.cycle("a"); local
493 assertTrue(cycle.hasNext());
494 assertEquals("a", cycle.next());
500 Iterator<String> cycle = Iterators.cycle(iterable); local
501 assertTrue(cycle.hasNext())
509 Iterator<String> cycle = Iterators.cycle("a", "b"); local
520 Iterator<String> cycle = Iterators.cycle(iterable); local
539 Iterator<String> cycle = Iterators.cycle("a", "b"); local
549 Iterator<String> cycle = Iterators.cycle("a", "b"); local
561 Iterator<String> cycle = Iterators.cycle(iterable); local
572 Iterator<String> cycle = Iterators.cycle(iterable); local
583 Iterator<String> cycle = Iterators.cycle(iterable); local
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| 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[cycleMark-1
[all...] |
| /external/icu4c/i18n/ |
| 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/jmonkeyengine/engine/src/core/com/jme3/math/ |
| 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) {
65 this.cycle = cycle;
82 * @param cycle true if the spline cycle.
84 public Spline(SplineType splineType, List<Vector3f> controlPoints, float curveTension, boolean cycle) {
91 this.cycle = cycle
[all...] |
| /external/quake/quake/src/QW/client/ |
| 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);
|
