/external/valgrind/memcheck/tests/ |
H A D | 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 [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/math/ |
H A D | 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) { argument 65 this.cycle = cycle; 82 * @param cycle true if the spline cycle. 84 public Spline(SplineType splineType, List<Vector3f> controlPoints, float curveTension, boolean cycle) { argument 91 this.cycle 308 setCycle(boolean cycle) argument [all...] |
/external/llvm/lib/CodeGen/ |
H A D | 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 [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | IteratorsTest.java | 534 Iterator<String> cycle = Iterators.<String>cycle(); 535 assertFalse(cycle.hasNext()); 539 Iterator<String> cycle = Iterators.cycle("a"); 541 assertTrue(cycle.hasNext()); 542 assertEquals("a", cycle.next()); 548 Iterator<String> cycle = Iterators.cycle(iterable); 549 assertTrue(cycle [all...] |
H A D | FluentIterableTest.java | 136 FluentIterable<String> cycle = FluentIterable.from(asList("a", "b")).cycle(); 139 for (String string : cycle) { 149 assertEquals("a", cycle.iterator().next()); 153 FluentIterable<Integer> cycle = fluent(1, 2).cycle(); 154 Iterator<Integer> iterator = cycle.iterator(); 160 assertFalse(cycle.iterator().hasNext());
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | IteratorsTest.java | 470 Iterator<String> cycle = Iterators.<String>cycle(); 471 assertFalse(cycle.hasNext()); 475 Iterator<String> cycle = Iterators.cycle("a"); 477 assertTrue(cycle.hasNext()); 478 assertEquals("a", cycle.next()); 484 Iterator<String> cycle = Iterators.cycle(iterable); 485 assertTrue(cycle [all...] |
/external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
H A D | nv50_ir_emit_nvc0.cpp | 1932 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/jetty/src/java/org/eclipse/jetty/util/ |
H A D | Scanner.java | 137 public void scanStarted(int cycle) throws Exception; argument 138 public void scanEnded(int cycle) throws Exception; argument 705 * signal any scan cycle listeners that a scan has started 707 private void reportScanStart(int cycle) argument 715 ((ScanCycleListener)listener).scanStarted(cycle); 720 LOG.warn(listener + " failed on scan start for cycle " + cycle, e); 728 private void reportScanEnd(int cycle) argument 736 ((ScanCycleListener)listener).scanEnded(cycle); 741 LOG.warn(listener + " failed on scan end for cycle " [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | 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(); 182 cycle.add(targetRule); 183 cycle.add(enclosingRule); 184 listOfRecursiveCycles.add(cycle);
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
H A D | 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) { 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/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
H A D | StripedBenchmark.java | 19 import static com.google.common.collect.Iterables.cycle; 86 bulkGetSet = ImmutableList.copyOf(limit(cycle(asList), 10));
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | ChineseCalendar.java | 40 * point, which is designated year 1 of cycle 1. In this class, the 42 * The <code>ERA</code> field contains the cycle number, and the 43 * <code>YEAR</code> field contains the year of the cycle, a value between 49 * 60 years greater and cycle numbers one greater than what this class 438 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR 447 int cycle = internalGet(ERA, 1) - 1; // 0-based cycle 449 year = cycle * 60 + internalGet(YEAR, 1) - (epochYear - CHINESE_EPOCH_YEAR); 640 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle) [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | FluentIterable.java | 150 public final FluentIterable<E> cycle() { method in class:FluentIterable 151 return from(Iterables.cycle(iterable));
|
H A D | Iterables.java | 374 * Returns an iterable whose iterators cycle indefinitely over the elements of 387 * <p>To cycle over the iterable {@code n} times, use the following: 390 public static <T> Iterable<T> cycle(final Iterable<T> iterable) { method in class:Iterables 395 return Iterators.cycle(iterable); 404 * Returns an iterable whose iterators cycle indefinitely over the provided 410 * as {@code Iterables.cycle(Lists.newArrayList(elements))}. The iterator's 418 * <p>To cycle over the elements {@code n} times, use the following: 421 public static <T> Iterable<T> cycle(T... elements) { method in class:Iterables 422 return cycle(Lists.newArrayList(elements));
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | FluentIterable.java | 149 public final FluentIterable<E> cycle() { method in class:FluentIterable 150 return from(Iterables.cycle(iterable));
|
H A D | Iterables.java | 357 * Returns an iterable whose iterators cycle indefinitely over the elements of 370 * <p>To cycle over the iterable {@code n} times, use the following: 373 public static <T> Iterable<T> cycle(final Iterable<T> iterable) { method in class:Iterables 378 return Iterators.cycle(iterable); 387 * Returns an iterable whose iterators cycle indefinitely over the provided 393 * as {@code Iterables.cycle(Lists.newArrayList(elements))}. The iterator's 401 * <p>To cycle over the elements {@code n} times, use the following: 404 public static <T> Iterable<T> cycle(T... elements) { method in class:Iterables 405 return cycle(Lists.newArrayList(elements));
|
H A D | Iterators.java | 369 public static <T> Iterator<T> cycle(final Iterable<T> iterable) { method in class:Iterators 412 public static <T> Iterator<T> cycle(T... elements) { method in class:Iterators 413 return cycle(Lists.newArrayList(elements));
|
/external/jmonkeyengine/engine/src/core/com/jme3/cinematic/ |
H A D | MotionPath.java | 344 * Sets the path to be a cycle 345 * @param cycle 347 public void setCycle(boolean cycle) { argument 349 spline.setCycle(cycle); 361 * returns true if the path is a cycle
|
/external/kernel-headers/original/uapi/linux/ |
H A D | firewire-cdev.h | 210 * @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/guava/guava-tests/test/com/google/common/io/ |
H A D | ByteSourceTest.java | 304 Iterable<ByteSource> cycle = Iterables.cycle(ImmutableList.of(source)); 305 ByteSource concatenated = ByteSource.concat(cycle);
|
H A D | CharSourceTest.java | 226 Iterable<CharSource> cycle = Iterables.cycle(ImmutableList.of(source)); 227 CharSource concatenated = CharSource.concat(cycle);
|
/external/icu/icu4c/source/i18n/ |
H A D | chnsecal.cpp | 65 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle) 215 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR 224 int32_t cycle = internalGet(UCAL_ERA, 1) - 1; // 0-based cycle local 226 year = cycle * 60 + internalGet(UCAL_YEAR, 1) - (fEpochYear - CHINESE_EPOCH_YEAR); 713 // Extended year and cycle year is based on the epoch year 728 int32_t cycle = ClockMath::floorDivide(cycle_year - 1, 60, yearOfCycle); local 729 internalSet(UCAL_ERA, cycle + 1);
|
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 2300 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/mesa3d/src/gallium/drivers/r600/ |
H A D | r600_asm.c | 670 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...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | 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[cycleMar [all...] |