HomeSort by relevance Sort by last modified time
    Searched full:cycles (Results 126 - 150 of 1214) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/chromium_org/tools/page_cycler/webpagereplay/extension/
page_cycler.js 23 reportUrl += "&i=" + iterations * pages.length; // "cycles"
  /external/chromium_org/webkit/browser/fileapi/
sandbox_isolated_origin_database.h 40 // TODO(kinuko): Deprecate this after a few release cycles, e.g. around M33.
  /external/compiler-rt/test/timing/
ashldi3.c 46 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
ashrdi3.c 46 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
divdi3.c 49 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
lshrdi3.c 46 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
moddi3.c 49 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
modsi3.c 49 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
muldi3.c 49 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
negdi2.c 47 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
udivdi3.c 49 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
umoddi3.c 49 printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
  /external/icu4c/common/
ucasemap_titlecase_brkiter.cpp 15 * were moved here to break dependency cycles among parts of the common library.
  /frameworks/base/core/java/android/text/
Annotation.java 23 * TextView save/restore cycles and can be used to keep application-specific
  /packages/apps/Settings/res/layout/
data_usage_cycles.xml 18 android:id="@+id/cycles"
  /external/oprofile/events/ppc64/power5++/
events 19 event:0X001 counters:1 um:zero minimum:10000 name:CYCLES : Processor Cycles
22 event:0X002 counters:2 um:zero minimum:10000 name:CYCLES_RND_SMPL : Processor Cycles with random sampling
26 event:0X0010 counters:0 um:zero minimum:10000 name:PM_RUN_CYC_GRP1 : (Group 1 pm_utilization) Run cycles
29 event:0X0013 counters:3 um:zero minimum:10000 name:PM_CYC_GRP1 : (Group 1 pm_utilization) Processor cycles
33 event:0X0021 counters:1 um:zero minimum:1000 name:PM_GCT_EMPTY_CYC_GRP2 : (Group 2 pm_completion) Cycles GCT empty
35 event:0X0023 counters:3 um:zero minimum:10000 name:PM_CYC_GRP2 : (Group 2 pm_completion) Processor cycles
40 event:0X0032 counters:2 um:zero minimum:1000 name:PM_GRP_DISP_BLK_SB_CYC_GRP3 : (Group 3 pm_group_dispatch) Cycles group dispatch blocked by scoreboard
44 event:0X0040 counters:0 um:zero minimum:1000 name:PM_0INST_CLB_CYC_GRP4 : (Group 4 pm_clb1) Cycles no instructions in CLB
45 event:0X0041 counters:1 um:zero minimum:1000 name:PM_2INST_CLB_CYC_GRP4 : (Group 4 pm_clb1) Cycles 2 instructions in CL
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/math/
m_debug_norm.c 196 static int test_norm_function( normal_func func, int mtype, long *cycles )
209 (void) cycles;
285 BEGIN_RACE( *cycles );
287 END_RACE( *cycles );
349 printf( "counter overhead: %ld cycles\n\n", counter_overhead );
359 long *cycles = &benchmark_tab[mtype]; local
361 if ( test_norm_function( func, mtype, cycles ) == 0 ) {
  /external/mesa3d/src/mesa/math/
m_debug_norm.c 196 static int test_norm_function( normal_func func, int mtype, long *cycles )
209 (void) cycles;
285 BEGIN_RACE( *cycles );
287 END_RACE( *cycles );
349 printf( "counter overhead: %ld cycles\n\n", counter_overhead );
359 long *cycles = &benchmark_tab[mtype]; local
361 if ( test_norm_function( func, mtype, cycles ) == 0 ) {
  /external/oprofile/events/i386/nehalem/
events 10 event:0x3c counters:0,1,2,3 um:zero minimum:6000 name:CPU_CLK_UNHALTED : Clock cycles when not halted
11 event:0x3c counters:0,1,2,2 um:one minimum:6000 name:UNHALTED_REFERENCE_CYCLES : Unhalted reference cycles
20 event:0x04 counters:0,1,2,3 um:sb_drain minimum:6000 name:SB_DRAIN : Counts the cycles of store buffer drains.
33 event:0x14 counters:0,1,2,3 um:arith minimum:6000 name:ARITH : Counts division cycles and number of multiplies. Includes integer and FP, but excludes DPPS/MPSAD.
38 event:0x1E counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITE_CYCLES : This event counts the number of cycles during which instructions are written to the instruction queue. Dividing this counter by the number of instructions written to the instruction queue (INST_QUEUE_WRITES) yields the average number of instructions decoded each cycle. If this number is less than four and the pipe stalls, this indicates that the decoder is failing to decode enough instructions per cycle to sustain the 4-wide pipeline.
44 event:0x3C counters:0,1,2,3 um:cpu_clk_unhalted minimum:6000 name:CPU_CLK_UNHALTED : Counts the number of thread cycles while the thread is not in a halt state.
53 event:0x4D counters:0,1,2,3 um:one minimum:6000 name:SFENCE_CYCLES : Counts store fence cycles
59 event:0x60 counters:0,1,2,3 um:offcore_requests_outstanding minimum:6000 name:OFFCORE_REQUESTS_OUTSTANDING : Counts weighted cycles of offcore requests.
67 event:0x87 counters:0,1,2,3 um:ild_stall minimum:6000 name:ILD_STALL : Cycles Instruction Length Decoder stalls
77 event:0xB2 counters:0,1,2,3 um:one minimum:6000 name:OFFCORE_REQUESTS_SQ_FULL : Counts number of cycles the SQ is full to handle off-core requests
    [all...]
  /external/llvm/utils/TableGen/
SubtargetEmitter.cpp 90 void ExpandProcResources(RecVec &PRVec, std::vector<int64_t> &Cycles,
306 // Form string as ,{ cycles, u1 | u2 | ... | un, timeinc, kind }
307 int Cycles = Stage->getValueAsInt("Cycles");
308 ItinString += " { " + itostr(Cycles) + ", ";
335 // number of operands that has cycles specified.
436 // operand cycles, and pipepine bypess tables. Then add the new Itinerary
487 // Emit as { cycles, u1 | u2 | ... | un, timeinc }, // indices
535 // Closing operand cycles
536 OperandCycleTable += " 0 // End operand cycles\n"
    [all...]
  /development/tools/labpretest/
README 21 script, it will detect the device and go through 100 cycles, running the monkey
24 specific devices. Additional parameters are -i for how many cycles and -m for
  /external/arduino/hardware/arduino/cores/arduino/
wiring_pulse.c 43 // the initial loop; it takes 16 clock cycles per iteration.
65 // to be 20 clock cycles long and have about 16 clocks between the edge
  /external/chromium/chrome/browser/ui/cocoa/bookmarks/
bookmark_folder_target_unittest.mm 97 // OCMockRecorders we used to break the cycles.
123 // Break retain cycles.
  /external/chromium/net/proxy/
proxy_script_fetcher_impl.h 34 // to |url_request_context|. Be careful not to create cycles between the
35 // fetcher and the context; you can break such cycles by calling Cancel().
  /external/chromium-trace/trace-viewer/src/tracing/importer/linux_perf/
mali_parser.js 371 return this.jmSample(hwcTitle, 'cycles', ts, eventBase);
391 return this.tilerSample(hwcTitle, 'cycles', ts, eventBase);
411 return this.fragSample(hwcTitle, 'cycles', ts, eventBase);
431 return this.computeSample(hwcTitle, 'cycles', ts, eventBase);
441 return this.hwcSample('mali:shader', 'Tripipe: ' + hwcTitle, 'cycles',
462 return this.arithSample(hwcTitle, 'cycles', ts, eventBase);
529 return this.mmuSample(hwcTitle, 'cycles', ts, eventBase);
549 return this.l2Sample(hwcTitle, 'cycles', ts, eventBase);

Completed in 838 milliseconds

1 2 3 4 56 7 8 91011>>