| /external/chromium_org/tools/telemetry/telemetry/core/chrome/ |
| inspector_memory_unittest.py | 22 counts = tab.dom_stats
23 self.assertEqual(counts['document_count'], 2)
24 self.assertEqual(counts['node_count'], 18)
25 self.assertEqual(counts['event_listener_count'], 2)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| test_list.py | 69 counts = [None] * 5
70 for i in xrange(len(counts)):
73 counts[i] = sys.gettotalrefcount()
74 print counts
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| test_list.py | 69 counts = [None] * 5
70 for i in xrange(len(counts)):
73 counts[i] = sys.gettotalrefcount()
74 print counts
|
| /external/linux-tools-perf/scripts/python/bin/ |
| syscall-counts-report | 2 # description: system-wide syscall counts
10 perf script $@ -s "$PERF_EXEC_PATH"/scripts/python/syscall-counts.py $comm
|
| syscall-counts-by-pid-report | 2 # description: system-wide syscall counts, by pid
10 perf script $@ -s "$PERF_EXEC_PATH"/scripts/python/syscall-counts-by-pid.py $comm
|
| /external/strace/ |
| count.c | 46 #define counts (countv[current_personality]) macro
56 if (!counts)
58 counts = calloc(nsyscalls, sizeof(*counts));
59 if (!counts)
62 "strace: out of memory for call counts\n");
67 counts[tcp->scno].calls++;
69 counts[tcp->scno].errors++;
102 tv_add(&counts[tcp->scno].time, &counts[tcp->scno].time, tv)
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| Header.java | 19 private int [] counts; field in class:Header
28 counts = new int[4];
57 for (int i = 0; i < counts.length; i++)
58 counts[i] = in.readU16();
74 for (int i = 0; i < counts.length; i++)
75 out.writeU16(counts[i]);
212 counts[field] = value;
217 if (counts[field] == 0xFFFF)
220 counts[field]++;
225 if (counts[field] == 0
[all...] |
| /external/chromium_org/chrome/test/functional/media/ |
| media_basic_playback.py | 63 counts = [(item, events.count(item)) for item in sorted(set(events))]
68 self.assertEqual(counts, _EXPECTED_EVENTS_0)
70 self.assertEqual(counts, _EXPECTED_EVENTS_n)
|
| /external/chromium_org/third_party/smhasher/src/ |
| AvalancheTest.cpp | 37 double maxBias ( std::vector<int> & counts, int reps )
41 for(int i = 0; i < (int)counts.size(); i++)
43 double c = double(counts[i]) / double(reps);
|
| Bitslice.cpp | 83 std::vector<int> counts(slices.size(),0);
87 counts[i] = countbits(slices[i]);
103 if((d < counts[i]) && (d < counts[j]))
105 if(counts[i] < counts[j])
111 else if(d < counts[i])
|
| /packages/apps/ContactsCommon/src/com/android/contacts/common/list/ |
| ContactsSectionIndexer.java | 26 * their respective counts.
39 * @param counts a non-null array of the same size as <code>sections</code>
41 public ContactsSectionIndexer(String[] sections, int[] counts) {
42 if (sections == null || counts == null) {
46 if (sections.length != counts.length) {
48 "The sections and counts arrays must have the same length");
51 // TODO process sections/counts based on current locale and/or specific section titles
54 mPositions = new int[counts.length];
56 for (int i = 0; i < counts.length; i++) {
64 position += counts[i]
[all...] |
| /external/oprofile/libpp/ |
| symbol.cpp | 35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi)
38 if (counts[i] != 0)
|
| sample_container.cpp | 25 count_array_t add_counts(count_array_t const & counts,
28 count_array_t temp(counts);
29 temp += s->counts;
73 it->second.counts += sample.counts;
|
| format_output.cpp | 305 out << f.sample.counts[f.pclass];
315 f.counts.cumulated_samples[f.pclass] += f.sample.counts[f.pclass];
316 out << f.counts.cumulated_samples[f.pclass];
325 return get_percent(f.sample.counts[f.pclass], f.counts.total[f.pclass]);
333 f.counts.cumulated_percent[f.pclass] += f.sample.counts[f.pclass];
335 return get_percent(f.counts.cumulated_percent[f.pclass],
336 f.counts.total[f.pclass])
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/tests/ |
| manual.js | 22 var counts = {passed: 0, failed: 0};
31 counts.passed += run.tests[i].success ? 1 : 0;
32 counts.failed += run.tests[i].success ? 0 : 1;
49 passed.textContent = counts.passed;
50 passed.setAttribute('class', counts.passed ? 'passed' : 'passed none');
51 failed.textContent = counts.failed;
52 failed.setAttribute('class', counts.failed ? 'failed' : 'failed none');
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_treecoder.h | 46 /* Convert array of token occurrence counts into a table of probabilities
95 const unsigned int *counts,
101 ? counts[-l]
102 : tree_merge_probs_impl(l, tree, pre_probs, counts,
106 ? counts[-r]
107 : tree_merge_probs_impl(r, tree, pre_probs, counts,
117 const unsigned int *counts,
120 tree_merge_probs_impl(0, tree, pre_probs, counts,
|
| vp9_entropymode.c | 357 const vp9_prob *pre_probs, const unsigned int *counts,
359 tree_merge_probs(tree, pre_probs, counts, COUNT_SAT, MAX_UPDATE_FACTOR,
367 const FRAME_COUNTS *counts = &cm->counts; local
371 counts->intra_inter[i]);
374 counts->comp_inter[i]);
377 counts->comp_ref[i]);
381 counts->single_ref[i][j]);
385 counts->inter_mode[i], fc->inter_mode_probs[i]);
389 counts->y_mode[i], fc->y_mode_prob[i])
[all...] |
| vp9_entropymv.c | 178 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) {
179 if (counts != NULL) {
181 ++counts->joints[j];
184 inc_mv_component(mv->row, &counts->comps[0], 1, 1);
188 inc_mv_component(mv->col, &counts->comps[1], 1, 1);
198 const unsigned int *counts, vp9_prob *probs) {
199 tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT, MV_MAX_UPDATE_FACTOR,
208 const nmv_context_counts *counts = &cm->counts.mv; local
210 adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, fc->joints)
[all...] |
| /external/chromium_org/net/spdy/ |
| spdy_priority_forest_test.cc | 216 int counts[8] = {0}; local
221 ++counts[node_id];
226 EXPECT_GE(counts[1], 800); EXPECT_LE(counts[1], 1200);
227 EXPECT_GE(counts[7], 1600); EXPECT_LE(counts[7], 2400);
228 EXPECT_GE(counts[5], 3200); EXPECT_LE(counts[5], 4800);
257 int counts[8] = {0}; local
262 ++counts[node_id]
[all...] |
| /external/chromium_org/third_party/libwebp/utils/ |
| huffman_encode.c | 29 // Change the population counts in a way that the consequent
31 static int OptimizeHuffmanForRle(int length, int* const counts) {
39 if (counts[length - 1] != 0) {
40 // Now counts[0..length - 1] does not have trailing zeros.
44 // 2) Let's mark all population counts that already can be encoded
54 int symbol = counts[0];
57 if (i == length || counts[i] != symbol) {
67 symbol = counts[i];
74 // 3) Let's replace those population counts that lead to more rle codes.
77 int limit = counts[0]
[all...] |
| /external/webp/src/utils/ |
| huffman_encode.c | 29 // Change the population counts in a way that the consequent
31 static int OptimizeHuffmanForRle(int length, int* const counts) {
39 if (counts[length - 1] != 0) {
40 // Now counts[0..length - 1] does not have trailing zeros.
44 // 2) Let's mark all population counts that already can be encoded
54 int symbol = counts[0];
57 if (i == length || counts[i] != symbol) {
67 symbol = counts[i];
74 // 3) Let's replace those population counts that lead to more rle codes.
77 int limit = counts[0]
[all...] |
| /external/stlport/test/eh/ |
| test_algo.cpp | 105 // Prepare an array of counts of the occurrence of each value in
107 unsigned counts[SortClass::kRange]; local
108 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 );
110 counts[ q->value() ]++;
125 counts[ p->value() ]--;
130 EH_ASSERT( counts[j] == 0 );
151 // Prepare an array of counts of the occurrence of each value in
153 unsigned counts[SortClass::kRange]; local
154 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 );
156 counts[ q->value() ]++
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Phaser.java | 28 * only internal counts; they do not establish any further internal
287 int counts = (int)s; local
288 return (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK);
300 int counts = (int)s; local
301 return (counts == EMPTY) ? 0 :
302 (counts >>> PARTIES_SHIFT) - (counts & UNARRIVED_MASK);
360 int counts = (int)s; local
361 int unarrived = (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK)
406 int counts = (int)s; local
655 int counts = (int)s; local
[all...] |
