| /external/oprofile/libpp/ |
| 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/valgrind/main/cachegrind/ |
| cg_merge.c | 212 ULong* counts; member in struct:__anon27667
214 Counts;
233 where innerMap is WordFM line-number=UWord Counts */
236 // Summary counts (computed whilst parsing)
238 Counts* summary;
271 static Counts* new_Counts ( Int n_counts, /*COPIED*/ULong* counts )
274 Counts* cts = malloc(sizeof(Counts));
279 cts->counts = malloc(n_counts * sizeof(ULong))
480 Counts* counts; local
[all...] |
| /packages/apps/Contacts/src/com/android/contacts/widget/ |
| PinnedHeaderListDemoActivity.java | 107 int[] counts = extras.getIntArray("counts"); local
113 if (counts == null || names == null || showIfEmpty == null || delays == null) {
118 for (int i = 0; i < counts.length; i++) {
123 for (int i = 0; i < counts.length; i++) {
125 final Cursor cursor = makeCursor(names[i], counts[i]);
|
| /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...] |
| /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/e2fsprogs/tests/f_big_sparse/ |
| expect.1 | 11 Pass 4: Checking reference counts
|
| /external/e2fsprogs/tests/f_bitmaps/ |
| expect.1 | 6 Pass 4: Checking reference counts
|
| /external/e2fsprogs/tests/f_dup_de2/ |
| expect.1 | 11 Pass 4: Checking reference counts
|
| /external/e2fsprogs/tests/f_end-bitmap/ |
| expect.1 | 6 Pass 4: Checking reference counts
|
| /external/e2fsprogs/tests/f_miss_blk_bmap/ |
| expect.1 | 5 Pass 4: Checking reference counts
|
| /external/e2fsprogs/tests/f_overfsblks/ |
| expect.1 | 10 Pass 4: Checking reference counts
|
| /external/e2fsprogs/tests/f_salvage_dir/ |
| expect.1 | 14 Pass 4: Checking reference counts
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| trip-count10.ll | 3 ; Trip counts with trivial exit conditions.
5 ; CHECK: Determining loop execution counts for: @a
9 ; CHECK: Determining loop execution counts for: @b
13 ; CHECK: Determining loop execution counts for: @c
17 ; CHECK: Determining loop execution counts for: @d
78 ; Trip counts for non-polynomial iterations. It's theoretically possible
83 ; CHECK: Determining loop execution counts for: @nonpolynomial
111 ; CHECK: Determining loop execution counts for: @constant_phi_operands
132 ; CHECK: Determining loop execution counts for: @exit_orcond_nsw
|
| /external/valgrind/main/lackey/docs/ |
| lk-manual.xml | 34 <varlistentry id="opt.basic-counts" xreflabel="--basic-counts">
36 <option><![CDATA[--basic-counts=<no|yes> [default: yes] ]]></option>
71 <para>Ratios between some of these counts.</para>
83 <varlistentry id="opt.detailed-counts" xreflabel="--detailed-counts">
85 <option><![CDATA[--detailed-counts=<no|yes> [default: no] ]]></option>
88 <para>When enabled, Lackey prints a table containing counts of loads,
130 <option>--basic-counts=yes</option> is specified.</para>
|
| /external/valgrind/main/memcheck/tests/ |
| erringfds.stderr.exp | 10 For counts of detected and suppressed errors, rerun with: -v
|
| /external/valgrind/main/memcheck/tests/linux/ |
| capget.stderr.exp2 | 14 For counts of detected and suppressed errors, rerun with: -v
|
| lsframe1.stderr.exp | 11 For counts of detected and suppressed errors, rerun with: -v
|
| lsframe2.stderr.exp | 11 For counts of detected and suppressed errors, rerun with: -v
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| CountOutputStream.java | 17 * An <code>OutputStream</code> that counts the written bytes.
40 * Counts the written bytes.
51 * Counts the written bytes.
62 * Counts the written bytes.
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| 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_list.py | 69 counts = [None] * 5
70 for i in xrange(len(counts)):
73 counts[i] = sys.gettotalrefcount()
74 print counts
|
| /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...] |
