| /external/ceres-solver/data/nist/ |
| ENSO.dat | 15 reveals 3 significant cycles. The annual cycle is the
16 strongest, but cycles with periods of approximately 44
17 and 26 months are also present. These cycles
|
| /external/chromium/base/ |
| message_pump.h | 51 // messages as well as for giving cycles to the delegate periodically. The
53 // message processing so neither type of event starves the other of cycles.
89 // Notice that the run loop cycles between calling DoInternalWork, DoWork,
|
| /external/chromium_org/base/message_loop/ |
| message_pump.h | 65 // messages as well as for giving cycles to the delegate periodically. The
67 // message processing so neither type of event starves the other of cycles.
103 // Notice that the run loop cycles between calling DoInternalWork, DoWork,
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
| ImageSource.h | 49 // cycles once; if it is 0, the animation cycles infinitely; otherwise the
50 // animation plays n + 1 cycles (where n is the specified loop count). If the
|
| /external/oprofile/events/mips/r10000/ |
| events | 6 event:0x00 counters:0,1 um:zero minimum:500 name:CYCLES : Cycles
33 event:0x0e counters:0 um:zero minimum:500 name:FUNCTIONAL_UNIT_COMPLETION_CYCLES : Functional unit completion cycles
|
| /external/dropbear/libtomcrypt/testprof/ |
| x86_prof.c | 264 fprintf(stderr, "\n\nKey Schedule Time Trials for the Symmetric Ciphers:\n(Times are cycles per key)\n");
668 fprintf(stderr, "%4lu bits: %9llu cycles\n", x*DIGIT_BIT, t2);
698 fprintf(stderr, "%4lu bits: %9llu cycles\n", x*DIGIT_BIT, t2);
718 fprintf(stderr, "Timing PRNGs (cycles/byte output, cycles add_entropy (32 bytes) :\n");
801 fprintf(stderr, "DSA-(%lu, %lu) make_key took %15llu cycles\n", (unsigned long)groups[x].group*8, (unsigned long)groups[x].modulus*8, t2);
839 fprintf(stderr, "RSA-%lu make_key took %15llu cycles\n", x, t2);
860 fprintf(stderr, "RSA-%lu encrypt_key took %15llu cycles\n", x, t2);
880 fprintf(stderr, "RSA-%lu decrypt_key took %15llu cycles\n", x, t2);
900 fprintf(stderr, "RSA-%lu sign_hash took %15llu cycles\n", x, t2)
[all...] |
| /external/arduino/hardware/arduino/cores/arduino/ |
| wiring.c | 27 // the prescaler is set so that timer0 ticks every 64 clock cycles, and the
132 // the following loop takes a quarter of a microsecond (4 cycles)
150 // the following loop takes half of a microsecond (4 cycles)
162 "1: sbiw %0,1" "\n\t" // 2 cycles
163 "brne 1b" : "=w" (us) : "0" (us) // 2 cycles
|
| /external/chromium_org/third_party/smhasher/src/ |
| SpeedTest.cpp | 220 double cycles = SpeedTest(hash,seed,trials,blocksize,align); local
222 double bestbpc = double(blocksize)/cycles;
237 double cycles = SpeedTest(hash,seed,trials,keysize,0); local
239 printf("%8.2f cycles/hash\n",cycles);
|
| /external/llvm/lib/CodeGen/ |
| TargetSchedule.cpp | 96 static unsigned capLatency(int Cycles) {
97 return Cycles >= 0 ? Cycles : 1000;
195 unsigned Latency = capLatency(WLEntry->Cycles);
242 Latency = std::max(Latency, capLatency(WLEntry->Cycles));
|
| /external/llvm/lib/Target/ARM/ |
| ARMScheduleV6.td | 24 // No operand cycles
109 // Scaled register offset, issues over 2 cycles
122 // Scaled register offset with update, issues over 2 cycles
162 // Scaled register offset, issues over 2 cycles
175 // Scaled register offset with update, issues over 2 cycles
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| lp_test_blend.c | 85 double cycles,
91 fprintf(fp, "%.1f\t", cycles / type.length);
96 fprintf(fp, "%.1f\t", cycles / (4 * type.length));
470 int64_t cycles[LP_TEST_NUM_SAMPLES]; local
523 cycles[i] = end_counter - start_counter;
603 cycles[i] = end_counter - start_counter;
660 sum += cycles[i];
661 sum2 += cycles[i]*cycles[i];
670 if(fabs(cycles[i] - avg) <= 4.0*std)
[all...] |
| /external/linux-tools-perf/util/ |
| parse-events.c | 40 { CHW(CPU_CYCLES), "cpu-cycles", "cycles" },
41 { CHW(STALLED_CYCLES_FRONTEND), "stalled-cycles-frontend", "idle-cycles-frontend" },
42 { CHW(STALLED_CYCLES_BACKEND), "stalled-cycles-backend", "idle-cycles-backend" },
48 { CHW(BUS_CYCLES), "bus-cycles", "" },
70 "cycles",
76 "bus-cycles",
77 "stalled-cycles-frontend"
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_test_blend.c | 85 double cycles,
91 fprintf(fp, "%.1f\t", cycles / type.length);
96 fprintf(fp, "%.1f\t", cycles / (4 * type.length));
470 int64_t cycles[LP_TEST_NUM_SAMPLES]; local
523 cycles[i] = end_counter - start_counter;
603 cycles[i] = end_counter - start_counter;
660 sum += cycles[i];
661 sum2 += cycles[i]*cycles[i];
670 if(fabs(cycles[i] - avg) <= 4.0*std)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/math/ |
| m_debug_clip.c | 230 int psize, long *cycles )
241 (void) cycles;
282 BEGIN_RACE( *cycles );
284 END_RACE( *cycles );
365 printf( "counter overhead: %ld cycles\n\n", counter_overhead );
384 long *cycles = &(benchmark_tab[np][psize-1]); local
386 if ( test_cliptest_function( func, np, psize, cycles ) == 0 ) {
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/etc/ |
| jdepend.xsl | 100 [<a href="#NVcycles">cycles</a>]
157 [<a href="#NVcycles">cycles</a>]
226 <a name="NVcycles"><h2>Cycles</h2></a>
230 [<a href="#NVcycles">cycles</a>]
234 <xsl:if test="count(Cycles/Package) = 0">
237 <xsl:for-each select="Cycles/Package">
249 [<a href="#NVcycles">cycles</a>]
|
| /external/mesa3d/src/mesa/math/ |
| m_debug_clip.c | 230 int psize, long *cycles )
241 (void) cycles;
282 BEGIN_RACE( *cycles );
284 END_RACE( *cycles );
365 printf( "counter overhead: %ld cycles\n\n", counter_overhead );
384 long *cycles = &(benchmark_tab[np][psize-1]); local
386 if ( test_cliptest_function( func, np, psize, cycles ) == 0 ) {
|
| /external/chromium_org/chrome/browser/sync/ |
| about_sync_util.cc | 283 IntSyncStat empty_get_updates(section_counters, "Cycles Without Updates");
284 IntSyncStat non_empty_get_updates(section_counters, "Cycles With Updates");
286 "Cycles Without Commits");
287 IntSyncStat sync_cycles_with_commits(section_counters, "Cycles With Commits");
289 "Cycles Without Commits or Updates");
291 "Cycles With Commits or Updates");
|
| /external/oprofile/events/x86-64/family11h/ |
| events | 25 event:0x01 counters:0,1,2,3 um:zero minimum:500 name:CYCLES_NO_FPU_OPS_RETIRED : Cycles in which the FPU is empty
32 event:0x23 counters:0,1,2,3 um:zero minimum:500 name:LS_BUFFER_2_FULL_CYCLES : Cycles LS Buffer 2 full
78 event:0x76 counters:0,1,2,3 um:zero minimum:3000 name:CPU_CLK_UNHALTED : Cycles outside of halt state
94 event:0xcd counters:0,1,2,3 um:zero minimum:500 name:INTERRUPTS_MASKED_CYCLES : Cycles with interrupts masked (IF=0)
95 event:0xce counters:0,1,2,3 um:zero minimum:500 name:INTERRUPTS_MASKED_CYCLES_WITH_INTERRUPT_PENDING : Cycles with interrupts masked while interrupt pending
128 event:0x1e9 counters:0,1,2,3 um:sideband_signals_and_special_cycles minimum:500 name:SIDEBAND_SIGNALS_AND_SPECIAL_CYCLES : Sideband Signals and Special Cycles
|
| /external/valgrind/main/callgrind/docs/ |
| cl-manual.xml | 171 has a significant fraction of its cost in <emphasis>cycles</emphasis> (sets
378 <sect2 id="cl-manual.cycles" xreflabel="Avoiding cycles">
379 <title>Avoiding cycles</title>
392 <para>Recursion is quite usual in programs, and therefore, cycles
395 about cycles which makes you want to avoid them? And: How can
396 cycles be avoided without changing program code?</para>
398 <para>Cycles are not bad in itself, but tend to make performance
403 cycles, this does not hold true: callees of a function in a cycle include
406 of cycles. Further, all functions in a cycle are collapsed into artifica
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| cycleclock.h | 32 // A CycleClock tells you the current time in Cycles. The "time"
41 // serializing. So if you're trying to count at cycles granularity, your
81 // This should return the number of cycles since power-on. Thread-safe.
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| cycleclock.h | 32 // A CycleClock tells you the current time in Cycles. The "time"
41 // serializing. So if you're trying to count at cycles granularity, your
79 // This should return the number of cycles since power-on. Thread-safe.
|
| /external/neven/Embedded/common/src/b_BasicEm/ |
| Math.h | 55 * C6201: 162 cycles
81 * C6201: 24 cycles
106 * C6201: 72 cycles
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarSanity.java | 54 * of troublesome rule cycles. This method has two side-effects: it notifies
86 * filling the cycles in listOfRecursiveCycles and also, as a
159 * and add the target. If no cycles contain either, then create a new
161 * of cycles (sets of rule names).
|
| /external/chromium_org/base/test/ |
| multiprocess_test_android.cc | 24 // TODO(vtl): The FD-remapping done below is wrong in the presence of cycles
|
| /external/chromium_org/chrome/browser/extensions/api/push_messaging/ |
| sync_setup_helper.h | 40 // Block until all sync clients have completed their mutual sync cycles.
|
