| /external/oprofile/events/i386/nehalem/ |
| events | 27 event:0x0C counters:0,1,2,3 um:mem_store_retired minimum:6000 name:MEM_STORE_RETIRED : The event counts the number of retired stores that missed the DTLB. The DTLB miss is not counted if the store operation causes a fault. Does not count prefetches. Counts both primary and secondary misses to the TLB
43 event:0x2E counters:0,1,2,3 um:longest_lat_cache minimum:6000 name:LONGEST_LAT_CACHE : Count LLC cache reference latencies.
60 event:0x63 counters:0,1 um:cache_lock_cycles minimum:6000 name:CACHE_LOCK_CYCLES : Cycle count during which the L1/L2 caches are locked. A lock is asserted when there is a locked memory access, due to uncacheable memory, a locked operation that spans two cache lines, or a page walk from an uncacheable page table.
82 event:0xC2 counters:0,1,2,3 um:uops_retired minimum:6000 name:UOPS_RETIRED : Counts the number of micro-ops retired, (macro-fused=1, micro-fused=2, others=1; maximum count of 8 per cycle). Most instructions are composed of one or two microops. Some instructions are decoded into longer sequences such as repeat instructions, floating point transcendental instructions, and assists
102 event:0xF3 counters:0,1,2,3 um:l2_hw_prefetch minimum:6000 name:L2_HW_PREFETCH : Count L2 HW prefetcher events
|
| /external/skia/src/svg/ |
| SkSVGPaintState.cpp | 80 int pairs = SkParse::Count(attrValue, ';');
|
| /external/v8/tools/ |
| tickprocessor.js | 220 // Count each tick as a time unit.
434 // Count library ticks
|
| /external/llvm/lib/Target/X86/ |
| X86InstrInfo.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| RetainCountChecker.cpp | 11 // a reference count checker for Core Foundation and Cocoa on (Mac OS X).
64 // The function decrements the reference count and the checker
215 unsigned Count = 1) {
216 return RefVal(Owned, o, Count, 0, t);
220 unsigned Count = 0) {
221 return RefVal(NotOwned, o, Count, 0, t);
[all...] |
| /external/clang/unittests/ASTMatchers/ |
| ASTMatchersTest.cpp | 625 : Id(Id), ExpectedCount(-1), Count(0) {}
630 : Id(Id), ExpectedCount(ExpectedCount), Count(0) {}
637 : Id(Id), ExpectedCount(ExpectedCount), Count(0),
642 EXPECT_EQ(ExpectedCount, Count);
649 ++Count;
669 int Count;
[all...] |
| /packages/apps/Exchange/assets/ |
| FolderSyncParserTest.txt | 25 [14:02:28] EAS Parser| <Count>
26 [14:02:28] EAS Parser| Count: 60
27 [14:02:28] EAS Parser| </Count>
[all...] |
| FolderSyncParserTest2.txt | 25 [14:02:28] EAS Parser| <Count>
26 [14:02:28] EAS Parser| Count: 60
27 [14:02:28] EAS Parser| </Count>
[all...] |
| /external/llvm/lib/Analysis/ |
| ValueTracking.cpp | [all...] |
| ScalarEvolution.cpp | 33 // types, computes the execution count of a loop, etc.
515 // count. This is pretty loose.
564 // Addrec complexity grows with operand count.
723 // width or the input iteration count's width; if the subtraction overflows,
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMLoadStoreOptimizer.cpp | 399 bool isKill = memOps[i].isKill || KilledRegs.count(Reg);
425 if (KilledRegs.count(Reg)) {
460 unsigned Count = 1;
492 ((Count < Limit) && RegNum == PRegNum+1))) {
495 ++Count;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | [all...] |
| /external/libnfc-nxp/src/ |
| phLibNfc_ndef_raw.c | [all...] |
| /external/llvm/lib/IR/ |
| DIBuilder.cpp | 789 DISubrange DIBuilder::getOrCreateSubrange(int64_t Lo, int64_t Count) {
793 ConstantInt::get(Type::getInt64Ty(VMContext), Count)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
| ITreeNodeStreamFixture.cs | 645 for (int i = 0; i < nodes.Count; i++)
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| CSharp2.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| CSharp3.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| Delphi.stg | [all...] |
| /external/clang/lib/CodeGen/ |
| CGObjC.cpp | 154 llvm::Value *Count =
156 Args.add(RValue::get(Count), ArgQT);
1507 llvm::PHINode *count = Builder.CreatePHI(UnsignedLongLTy, 3, "forcoll.count"); local
[all...] |
| /external/llvm/lib/MC/MCParser/ |
| AsmParser.cpp | [all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tree.Tests.pas | 92 function CreateTokenList(const Count: Integer): IList<IToken>;
[all...] |
| /external/clang/lib/Serialization/ |
| ASTReader.cpp | 230 if (MacroNames && !Macros.count(MacroName))
246 if (MacroNames && !Macros.count(MacroName))
[all...] |
| /external/v8/src/ |
| liveobjectlist.cc | 628 int* count,
644 void ComputeTotalCountAndSize(LolFilter* filter, int* count, int* size) {
645 *count = 0;
656 (*count)++;
668 int count = 0; local
697 if (count >= start) {
712 count++;
733 void ComputeTotalCountAndSize(LolFilter* filter, int* count, int* size) {
743 count,
756 int count; local
946 int count = 0; local
1086 int count = 0; local
1105 int count = total_count; local
1277 int count = -1; local
1437 int count = summary.Count(type); local
1565 int count; local
1801 int count = 0; local
2284 int count = lol->obj_count_; local
2309 int count = 0; local
2487 int count = 0; local
[all...] |
| /ndk/build/core/ |
| definitions-graph.mk | 266 # For topological sort, we need to count the number of incoming edges
270 # Count the number of incoming edges for each node during topological
300 -ndk-mod-topo-dump-count = \
322 $(call -ndk-mod-topo-count,$(_ndk_mod_nodes))\
332 # Given a closure list of nodes, count their incoming edges.
334 -ndk-mod-topo-count = \
|
| /external/clang/include/clang/AST/ |
| ASTContext.h | [all...] |
