/external/chromium-trace/trace-viewer/src/tracing/analysis/ |
H A D | analyze_slices.js | 58 hits: [] 63 sliceGroup.hits.push(sliceHits[i]); 80 for (var i = 0; i < sliceHitGroup.hits.length; i++) { 81 var slice = sliceHitGroup.hits[i].slice; 93 if (sliceHitGroup.hits.length == 0) 95 avg = duration / sliceHitGroup.hits.length; 106 for (var i = 0; i < sliceHitGroup.hits.length; i++) { 108 statistics.avg - sliceHitGroup.hits[i].slice.duration; 113 sumOfSquaredDistancesToMean / (sliceHitGroup.hits.length - 1)); 117 if (sliceHitGroup.hits [all...] |
H A D | analyze_counters.js | 41 var hits = hitsByCounter[id]; 42 var ctr = hits[0].counter; 45 for (var i = 0; i < hits.length; i++) 46 sampleIndices.push(hits[i].sampleIndex);
|
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int), 29 hits.setCount(bullets.count()); 37 hits[bIndex] = -1; 45 hits[bIndex] = tIndex;
|
H A D | SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
/external/skia/src/animator/ |
H A D | SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int), 29 hits.setCount(bullets.count()); 37 hits[bIndex] = -1; 45 hits[bIndex] = tIndex;
|
H A D | SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
/external/chromium_org/chrome/browser/ui/app_list/search/ |
H A D | tokenized_string_match.h | 31 // Calculates the relevance and hits. Returns true if the two strings are 39 const Hits& hits() const { return hits_; } function in class:app_list::TokenizedStringMatch
|
H A D | tokenized_string_match_unittest.cc | 15 // Returns a string of |text| marked the hits in |match| using block bracket. 16 // e.g. text= "Text", hits = [{0,1}], returns "[T]ext". 21 const TokenizedStringMatch::Hits& hits = match.hits(); local 22 for (TokenizedStringMatch::Hits::const_reverse_iterator it = hits.rbegin(); 23 it != hits.rend(); ++it) {
|
H A D | app_result.cc | 57 const TokenizedStringMatch::Hits& hits = match.hits(); local 60 tags.reserve(hits.size()); 61 for (size_t i = 0; i < hits.size(); ++i) 62 tags.push_back(Tag(Tag::MATCH, hits[i].start(), hits[i].end()));
|
/external/qemu-pc-bios/bochs/bios/ |
H A D | biossums.c | 96 int arg = 1, hits, pad = 0; local 121 hits = 0; 130 hits++; 132 if( hits == 1 && cur_val != new_val ) { 136 if( hits >= 2 ) { 139 if( hits ) { 144 hits = 0; 153 hits++; 155 if( hits == 1 && cur_val != new_val ) { 159 if( hits > [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | csr2022.cpp | 36 int32_t hits = 0; local 59 hits += 1; 79 if (hits == 0) { 89 quality = (100*hits - 100*misses) / (hits + misses); 94 if (hits+shifts < 5) { 95 quality -= (5-(hits+shifts))*10;
|
/external/icu4c/i18n/ |
H A D | csr2022.cpp | 37 int32_t hits = 0; local 60 hits += 1; 80 if (hits == 0) { 90 quality = (100*hits - 100*misses) / (hits + misses); 95 if (hits+shifts < 5) { 96 quality -= (5-(hits+shifts))*10;
|
/external/libvorbis/vq/ |
H A D | latticetune.c | 43 long *hits; local 84 hits=_ogg_malloc(entries*sizeof(long)); 86 for(j=0;j<entries;j++)hits[j]=guard; 103 hits[code]++; 115 /* code:hits\n */ 123 hits[code]+=val; 133 build_tree_from_lengths0(entries,hits,lengths);
|
H A D | latticebuild.c | 26 description into a static codebook. It used to count hits for a 60 long *hits; local 113 hits=_ogg_malloc(c.entries*sizeof(long)); 114 for(j=0;j<entries;j++)hits[j]=1; 169 for(i=0;i<entries;i++)hits[i]=1; 170 build_tree_from_lengths(entries,hits,c.lengthlist);
|
/external/chromium_org/tools/heapcheck/ |
H A D | heapcheck_test.py | 158 hits, bytes, objects = used_suppressions[description] 159 hits += 1 162 used_suppressions[description] = [hits, bytes, objects] 188 hits, bytes, objects = used_suppressions[description] 189 line = '%8d %8d %8d %s' % (hits, bytes, objects, description) 190 if hits in histo: 191 histo[hits].append(line) 193 histo[hits] = [line]
|
/external/chromium_org/tools/memory_watcher/scripts/ |
H A D | memprof.pl | 44 my $hits = 0; 59 $hits = $2;
|
/external/chromium-trace/trace-viewer/src/tracing/ |
H A D | selection.js | 182 pushHits: function(hits) { 183 for (var i = 0; i < hits.length; i++) 184 this.pushHit(hits[i]); 247 var hits = {}; 249 hits[hitType.pluralName] = new Selection(); 255 hits[hitType.pluralName].push_(hit); 258 return hits;
|
/external/linux-tools-perf/ |
H A D | perf-archive.sh | 24 perf buildid-list -i $PERF_DATA --with-hits | grep -v "^$NOBUILDID " > $BUILDIDS
|
/external/qemu-pc-bios/vgabios/ |
H A D | biossums.c | 55 int hits, modified; local 91 hits = 0; 100 hits++; 102 if ((hits == 1) && (cur_val != new_val)) { 111 if (hits >= 2) { 114 if (hits) {
|
/external/skia/tests/ |
H A D | RTreeTest.cpp | 74 SkTDArray<void*> hits; local 76 tree.search(query, &hits); 77 REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
/external/chromium/chrome/browser/safe_browsing/ |
H A D | filter_false_positive_perftest.cc | 225 int hits = 0; local 257 ++hits; 279 << ", hits: " << hits 282 std::cout << ", weighted hits: " << weighted_hits 342 int hits = 0; local 347 ++hits; 359 << ", hits: " << hits
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/port/ |
H A D | chromium.py | 93 hits = [] 98 hits.append((filesystem.mtime(path), path)) 104 hits.append((filesystem.mtime(path), path)) 106 if hits: 107 hits.sort(reverse=True) 108 return hits[0][1] # Return the newest file found.
|
/external/oprofile/events/mips/sb1/ |
H A D | events | 50 event:0x6 counters:1,2,3 um:zero minimum:500 name:LD_ST_HITS_PREFETCH_IN_QUEUE :Load/store hits prefetch in read queue 51 event:0x5 counters:1,2,3 um:zero minimum:500 name:PREFETCH_HITS_CACHE_OR_READ_Q :Prefetch hits in cache or read queue 52 event:0x4 counters:1,2,3 um:zero minimum:500 name:READ_HITS_READ_Q :Read hits in read queue 65 event:0x16 counters:1,2,3 um:zero minimum:500 name:SNOOP_RQ_HITS :Snoop request hits anywhere
|
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | glxhash.c | 118 unsigned long hits; /* At top of linked list */ member in struct:__glxHashTable 166 table->hits = 0; 220 ++table->hits; 362 table->hits, table->partials, table->misses);
|
/external/mesa3d/src/glx/ |
H A D | glxhash.c | 118 unsigned long hits; /* At top of linked list */ member in struct:__glxHashTable 166 table->hits = 0; 220 ++table->hits; 362 table->hits, table->partials, table->misses);
|