| /external/chromium_org/third_party/skia/src/animator/ |
| SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int),
29 hits.setCount(bullets.count());
37 hits[bIndex] = -1;
45 hits[bIndex] = tIndex;
|
| SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
| /external/skia/src/animator/ |
| SkHitTest.cpp | 16 SK_MEMBER_ARRAY(hits, Int),
29 hits.setCount(bullets.count());
37 hits[bIndex] = -1;
45 hits[bIndex] = tIndex;
|
| SkHitTest.h | 25 SkTDIntArray hits; member in class:SkHitTest
|
| /dalvik/vm/ |
| AtomicCache.cpp | 176 pCache->trivial, pCache->fail, pCache->hits,
178 (pCache->hits == 0) ? 0 :
179 pCache->hits * 100 /
180 (pCache->fail + pCache->hits + pCache->misses + pCache->fills),
|
| AtomicCache.h | 57 int hits; /* found entry in cache */ member in struct:AtomicCache
129 (_cache)->hits++; \
|
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| tokenized_string_match.h | 26 typedef std::vector<ui::Range> Hits;
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
43 Hits hits_;
|
| 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) {
|
| 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/ |
| 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 >= 2 )
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| 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/ |
| 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/ |
| 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);
|
| 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/ |
| 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/ |
| memprof.pl | 44 my $hits = 0;
59 $hits = $2;
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteDebug.java | 133 /** statement cache stats: hits/misses/cachesize */
137 int hits, int misses, int cachesize) {
142 this.cache = hits + "/" + misses + "/" + cachesize;
|
| /external/linux-tools-perf/ |
| perf-archive.sh | 24 perf buildid-list -i $PERF_DATA --with-hits | grep -v "^$NOBUILDID " > $BUILDIDS
|
| /external/qemu-pc-bios/vgabios/ |
| 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) {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| GrepDialog.py | 81 hits = 0
99 hits = hits + 1
100 if hits:
101 if hits == 1:
105 print "Found", hits, "hit%s." % s
108 print "No hits."
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| GrepDialog.py | 81 hits = 0
99 hits = hits + 1
100 if hits:
101 if hits == 1:
105 print "Found", hits, "hit%s." % s
108 print "No hits."
|
| /external/skia/tests/ |
| 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/ |
| 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/ |
| 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/ |
| 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
|
