HomeSort by relevance Sort by last modified time
    Searched refs:cycle (Results 1 - 25 of 102) sorted by null

1 2 3 4 5

  /external/webkit/Source/WebCore/platform/brew/
EventLoopBrew.cpp 31 void EventLoop::cycle() function in class:WebCore::EventLoop
  /external/webkit/Source/WebCore/platform/android/
EventLoopAndroid.cpp 33 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/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
EventLoop.h 41 void cycle();
  /external/webkit/Source/WebCore/platform/wx/
EventLoopWx.cpp 34 void EventLoop::cycle() function in class:WebCore::EventLoop
  /external/valgrind/main/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...]
  /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);
gtrace.cpp 94 void Gtrace::WriteBlockHeader(uint32_t cycle, uint32_t pid)
101 bh.block_tic = cycle + kBaseTic;
102 bh.block_time = start_sec_ + cycle / kTicsPerSecond;
111 void Gtrace::AddGtraceRecord(int filenum, int procnum, uint32_t cycle, uint32_t pid,
123 WriteBlockHeader(cycle, pid);
129 WriteBlockHeader(cycle, pid);
133 entry.cycle = cycle + kBaseTic;
139 void Gtrace::AddProcEntry(int filenum, int procnum, uint32_t cycle, uint32_t pid)
141 AddGtraceRecord(filenum, procnum, cycle, pid, 0)
    [all...]
dmtrace.h 22 void addFunctionEntry(int methodId, uint32_t cycle, uint32_t pid);
23 void addFunctionExit(int methodId, uint32_t cycle, uint32_t pid);
  /external/webkit/Source/WebCore/platform/mac/
AutodrainedPool.mm 46 void AutodrainedPool::cycle()
EventLoopMac.mm 31 void EventLoop::cycle()
  /frameworks/base/core/java/android/net/
NetworkPolicyManager.java 149 * Compute the last cycle boundary for the given {@link NetworkPolicy}. For
150 * example, if cycle day is 20th, and today is June 15th, it will return May
151 * 20th. When cycle day doesn't exist in current month, it snaps to the 1st
164 // first, find cycle boundary for current month
165 final Time cycle = new Time(now); local
166 cycle.hour = cycle.minute = cycle.second = 0;
167 snapToCycleDay(cycle, policy.cycleDay);
169 if (Time.compare(cycle, now) >= 0)
195 final Time cycle = new Time(now); local
    [all...]
  /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/llvm/lib/CodeGen/
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 + i) < RequiredScoreboard.getDepth()) &
    [all...]
  /external/qemu/distrib/sdl-1.2.15/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]);
  /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/smack/src/org/xbill/DNS/
RRset.java 113 iterator(boolean data, boolean cycle) {
126 if (!cycle)
151 * @param cycle If true, cycle through the records so that each Iterator will
155 rrs(boolean cycle) {
156 return iterator(true, 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/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/webkit/Source/WebCore/fileapi/
FileThread.cpp 104 pool.cycle();

Completed in 1316 milliseconds

1 2 3 4 5