Searched refs:cycle (Results 1 - 25 of 71) sorted by relevance

123

/external/valgrind/main/memcheck/tests/
H A Dleak-cycle.stderr.exp7 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
[all...]
/external/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp44 // 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
[all...]
/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/guava/guava-tests/test/com/google/common/collect/
H A DIteratorsTest.java486 Iterator<String> cycle = Iterators.<String>cycle();
487 assertFalse(cycle.hasNext());
491 Iterator<String> cycle = Iterators.cycle("a");
493 assertTrue(cycle.hasNext());
494 assertEquals("a", cycle.next());
500 Iterator<String> cycle = Iterators.cycle(iterable);
501 assertTrue(cycle
[all...]
/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/third_party/mesa/src/src/gallium/drivers/nvc0/codegen/
H A Dnv50_ir_emit_nvc0.cpp1932 void print(int cycle) argument
1935 if (rd.r[i] > cycle)
1937 if (wr.r[i] > cycle)
1941 if (rd.p[i] > cycle)
1943 if (wr.p[i] > cycle)
1946 if (rd.c > cycle)
1948 if (wr.c > cycle)
1950 if (res.sfu > cycle)
1952 if (res.imul > cycle)
1954 if (res.tex > cycle)
1961 int cycle; member in class:nv50_ir::SchedDataCalculator
2042 int cycle = 0; local
2157 commitInsn(const Instruction *insn, int cycle) argument
2202 checkRd(const Value *v, int cycle, int& delay) const argument
2240 checkWr(const Value *v, int cycle, int& delay) const argument
[all...]
/external/mesa3d/src/gallium/drivers/nvc0/codegen/
H A Dnv50_ir_emit_nvc0.cpp1932 void print(int cycle) argument
1935 if (rd.r[i] > cycle)
1937 if (wr.r[i] > cycle)
1941 if (rd.p[i] > cycle)
1943 if (wr.p[i] > cycle)
1946 if (rd.c > cycle)
1948 if (wr.c > cycle)
1950 if (res.sfu > cycle)
1952 if (res.imul > cycle)
1954 if (res.tex > cycle)
1961 int cycle; member in class:nv50_ir::SchedDataCalculator
2042 int cycle = 0; local
2157 commitInsn(const Instruction *insn, int cycle) argument
2202 checkRd(const Value *v, int cycle, int& delay) const argument
2240 checkWr(const Value *v, int cycle, int& delay) const argument
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DGrammarSanity.java157 /** 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();
182 cycle.add(targetRule);
183 cycle.add(enclosingRule);
184 listOfRecursiveCycles.add(cycle);
/external/chromium_org/ui/views/focus/
H A Dfocus_search.h31 // - |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
H A Dfocus_search.cc12 FocusSearch::FocusSearch(View* root, bool cycle, bool accessibility_mode) argument
14 cycle_(cycle),
/external/chromium_org/content/public/test/
H A Ddownload_test_observer.cc397 void DownloadTestFlushObserver::PingFileThread(int cycle) { argument
400 base::Bind(&DownloadTestFlushObserver::PingIOThread, this, cycle));
403 void DownloadTestFlushObserver::PingIOThread(int cycle) { argument
404 if (--cycle) {
407 base::Bind(&DownloadTestFlushObserver::PingFileThread, this, cycle));
H A Ddownload_test_observer.h264 void PingFileThread(int cycle);
266 void PingIOThread(int cycle);
/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/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/chromium_org/third_party/boringssl/linux-arm/crypto/sha/
H A Dsha1-armv4-large.S182 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...]
/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/third_party/cython/src/Cython/Includes/cpython/
H A Dtype.pxd31 # Return true if the type object includes support for the cycle
/external/kernel-headers/original/uapi/linux/
H A Dfirewire-cdev.h210 * @cycle: Cycle counter of the last completed packet
260 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt
839 * @cycle: Cycle in which to start I/O. If @cycle is greater than or
840 * equal to 0, the I/O will start on that cycle.
849 __s32 cycle; member in struct:fw_cdev_start_iso
883 * struct fw_cdev_get_cycle_timer - read cycle timer register
899 * struct fw_cdev_get_cycle_timer2 - read cycle timer register
905 * The %FW_CDEV_IOC_GET_CYCLE_TIMER2 ioctl reads the isochronous cycle timer
/external/chromium_org/tools/gn/
H A Dbuilder.cc22 // participates in a cycle.
24 // If this returns true, the cycle will be in *path. This should point to an
28 // Return false means no cycle was found.
42 // This item is already in the set, we found the cycle. Everything before
43 // the first definition of cur is irrelevant to the cycle.
50 return true; // Found cycle.
172 // dependencies because in this case all items in the cycle will be GENERATED
219 *err = Err(Location(), "Dependency cycle:", depstring);
528 std::vector<const BuilderRecord*> cycle; local
529 if (!RecursiveFindCycle(bad_records[0], &cycle))
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dchnsecal.cpp62 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle)
212 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR
221 int32_t cycle = internalGet(UCAL_ERA, 1) - 1; // 0-based cycle local
223 year = cycle * 60 + internalGet(UCAL_YEAR, 1) - (fEpochYear - CHINESE_EPOCH_YEAR);
710 // Extended year and cycle year is based on the epoch year
725 int32_t cycle = ClockMath::floorDivide(cycle_year - 1, 60, yearOfCycle); local
726 internalSet(UCAL_ERA, cycle + 1);
/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));
/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));
/external/icu/icu4c/source/i18n/
H A Dchnsecal.cpp62 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle)
212 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR
221 int32_t cycle = internalGet(UCAL_ERA, 1) - 1; // 0-based cycle local
223 year = cycle * 60 + internalGet(UCAL_YEAR, 1) - (fEpochYear - CHINESE_EPOCH_YEAR);
710 // Extended year and cycle year is based on the epoch year
725 int32_t cycle = ClockMath::floorDivide(cycle_year - 1, 60, yearOfCycle); local
726 internalSet(UCAL_ERA, cycle + 1);
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c2300 topo->cycle = NULL; // No cycles at the start
2302 topo->hasCycle = ANTLR3_FALSE; // No cycle at the start
2423 return; // We don't do anything else if we found a cycle
2428 // Check to see if we found a cycle. To do this we search the
2429 // current cycle stack and see if we find this node already in the stack.
2435 if (topo->cycle[i] == node)
2437 // Stop! We found a cycle in the input, so rejig the cycle
2438 // stack so that it only contains the cycle and set the cycle fla
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/
H A Dr600_asm.c670 int i, cycle, component; local
672 for (cycle = 0; cycle < NUM_OF_CYCLES; cycle++)
674 bs->hw_gpr[cycle][component] = -1;
681 static int reserve_gpr(struct alu_bank_swizzle *bs, unsigned sel, unsigned chan, unsigned cycle) argument
683 if (bs->hw_gpr[cycle][chan] == -1)
684 bs->hw_gpr[cycle][chan] = sel;
685 else if (bs->hw_gpr[cycle][chan] != (int)sel) {
737 int r, src, num_src, sel, elem, cycle; local
767 int r, src, num_src, const_count, sel, elem, cycle; local
[all...]

Completed in 729 milliseconds

123