| /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...] |
| /frameworks/base/core/java/android/net/ |
| NetworkPolicyManager.java | 183 * Compute the last cycle boundary for the given {@link NetworkPolicy}. For
184 * example, if cycle day is 20th, and today is June 15th, it will return May
185 * 20th. When cycle day doesn't exist in current month, it snaps to the 1st
198 // first, find cycle boundary for current month
199 final Time cycle = new Time(now); local
200 cycle.hour = cycle.minute = cycle.second = 0;
201 snapToCycleDay(cycle, policy.cycleDay);
203 if (Time.compare(cycle, now) >= 0)
229 final Time cycle = new Time(now); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 44 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
124 int cycle = Stalls; local
137 // We must find one of the stage's units free for every cycle the
141 int StageCycle = cycle + (int)i;
165 DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
172 // Advance the cycle to the next stage.
173 cycle += IS->getNextCycles();
192 unsigned cycle = 0; local
197 // We must reserve one of the stage's units for every cycle the
201 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]);
|
| /build/tools/releasetools/ |
| rangelib.py | 131 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
132 zip(other.data, itertools.cycle((+1, -1)))):
149 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
150 zip(other.data, itertools.cycle((+1, -1)))):
168 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
169 zip(other.data, itertools.cycle((-1, +1)))):
188 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
189 zip(other.data, itertools.cycle((+1, -1)))):
229 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
230 zip(other.data, itertools.cycle((-1, +1))))
[all...] |
| /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/chromium_org/ui/views/focus/ |
| focus_search.h | 31 // - |cycle| should be true if you want FindNextFocusableView to cycle back
39 FocusSearch(View* root, bool cycle, bool accessibility_mode);
49 // was initialized with |cycle|=true, in which case it goes back to the
|
| /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);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_threading_local.py | 85 # 1) Involve Local in a cycle
86 cycle = [Local()]
87 cycle.append(cycle)
88 cycle[0].foo = 'bar'
90 # 2) GC the cycle (triggers threadmodule.c::local_clear
92 del cycle
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_threading_local.py | 85 # 1) Involve Local in a cycle
86 cycle = [Local()]
87 cycle.append(cycle)
88 cycle[0].foo = 'bar'
90 # 2) GC the cycle (triggers threadmodule.c::local_clear
92 del cycle
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_emit_nvc0.cpp | 1961 int cycle; member in class:nv50_ir::SchedDataCalculator
2042 int cycle = 0; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_emit_nvc0.cpp | 1961 int cycle; member in class:nv50_ir::SchedDataCalculator
2042 int cycle = 0; local
[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);
|
| /frameworks/compile/mclinker/lib/LD/ |
| StaticResolver.cpp | 65 bool cycle = false; local
70 cycle = false;
193 case REFC: { /* Mark indirect symbol referenced and then CYCLE. */
201 cycle = true;
209 } while(cycle);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| ImageMirror.java | 48 mLocalRep.cycle();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| GuidelinePainter.java | 166 /** Paints a constraint cycle */
167 void paintCycle(IGraphics gc, GuidelineHandler state, List<Constraint> cycle) {
168 gc.useStyle(DrawingStyle.CYCLE);
169 assert cycle.size() > 0;
171 INode from = cycle.get(0).from.node;
182 for (Constraint constraint : cycle) {
|
| Match.java | 40 /** whether this {@link Match} results in a cycle */
41 public boolean cycle; field in class:Match
|
| /external/chromium_org/content/public/test/ |
| download_test_observer.cc | 397 void DownloadTestFlushObserver::PingFileThread(int cycle) {
400 base::Bind(&DownloadTestFlushObserver::PingIOThread, this, cycle));
403 void DownloadTestFlushObserver::PingIOThread(int cycle) {
404 if (--cycle) {
407 base::Bind(&DownloadTestFlushObserver::PingFileThread, this, cycle));
|
| download_test_observer.h | 264 void PingFileThread(int cycle);
266 void PingIOThread(int cycle);
|
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.h | 261 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/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| 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) {
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 < maxNumberOfFragments; cycle++)
[all...] |
| /external/chromium_org/third_party/boringssl/linux-arm/crypto/sha/ |
| sha1-armv4-large.S | 182 eor r11,r11,r12 @ 1 cycle stall
199 eor r11,r11,r12 @ 1 cycle stall
216 eor r11,r11,r12 @ 1 cycle stall
233 eor r11,r11,r12 @ 1 cycle stall
254 eor r11,r11,r12 @ 1 cycle stall
270 eor r11,r11,r12 @ 1 cycle stall
286 eor r11,r11,r12 @ 1 cycle stall
302 eor r11,r11,r12 @ 1 cycle stall
318 eor r11,r11,r12 @ 1 cycle stall
341 eor r11,r11,r12 @ 1 cycle stal
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_refcounts.py | 77 # create a cycle
78 f.cycle = f
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_refcounts.py | 77 # create a cycle
78 f.cycle = f
|
| /bionic/libc/kernel/uapi/linux/ |
| firewire-cdev.h | 95 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt
275 __s32 cycle; member in struct:fw_cdev_start_iso
|
