/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...] |
/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
|
focus_search.cc | 12 FocusSearch::FocusSearch(View* root, bool cycle, bool accessibility_mode) 14 cycle_(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);
|
/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...] |
/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
|
/development/ndk/platforms/android-L/include/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
|
/external/chromium_org/chrome/common/extensions/docs/examples/api/pageAction/set_icon/ |
background.js | 31 // We only have 2 icons, but cycle through 3 icons to test the
|
/external/chromium_org/net/tools/testserver/ |
echo_message.py | 28 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/ |
type.pxd | 31 # Return true if the type object includes support for the cycle
|
/external/chromium_org/v8/test/webkit/fast/js/ |
Promise-resolve-with-itself.js | 37 shouldBeEqualToString('result', 'TypeError: Chaining cycle detected for promise #<Promise>');
|
/external/kernel-headers/original/uapi/linux/ |
firewire-cdev.h | 210 * @cycle: Cycle counter of the last completed packet 260 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt 849 __s32 cycle; member in struct:fw_cdev_start_iso [all...] |
/external/chromium_org/tools/gn/ |
builder.cc | 22 // 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/ |
chnsecal.cpp | 62 * 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/ |
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...] |
/external/icu/icu4c/source/i18n/ |
chnsecal.cpp | 62 * 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);
|