Searched refs:counts (Results 26 - 50 of 234) sorted by relevance

12345678910

/external/chromium_org/third_party/skia/debugger/
H A DSkDebugger.cpp76 SkTDArray<int> counts; local
77 counts.setCount(LAST_DRAWTYPE_ENUM+1);
79 counts[i] = 0;
83 counts[commands[i]->getType()]++;
92 if (0 == counts[i]) {
100 overview->appendS32(counts[i]);
115 total += counts[i];
/external/libvpx/libvpx/vp9/common/
H A Dvp9_entropy.c742 vp9_coeff_count_model *counts = cm->counts.coef[tx_size]; local
744 cm->counts.eob_branch[tx_size];
751 const int n0 = counts[i][j][k][l][ZERO_TOKEN];
752 const int n1 = counts[i][j][k][l][ONE_TOKEN];
753 const int n2 = counts[i][j][k][l][TWO_TOKEN];
754 const int neob = counts[i][j][k][l][EOB_MODEL_TOKEN];
/external/skia/debugger/
H A DSkDebugger.cpp78 SkTDArray<int> counts; local
79 counts.setCount(LAST_DRAWTYPE_ENUM+1);
81 counts[i] = 0;
85 counts[commands[i]->getType()]++;
94 if (0 == counts[i]) {
102 overview->appendS32(counts[i]);
117 total += counts[i];
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_encodemv.c151 const unsigned int counts[/*n - 1*/],
159 vp9_tree_probs_from_distribution(tree, branch_ct, counts);
167 nmv_context_counts *const counts = &cm->counts.mv; local
169 write_mv_update(vp9_mv_joint_tree, mvc->joints, counts->joints, MV_JOINTS, w);
173 nmv_component_counts *comp_counts = &counts->comps[i];
187 counts->comps[i].class0_fp[j], MV_FP_SIZE, w);
189 write_mv_update(vp9_mv_fp_tree, mvc->comps[i].fp, counts->comps[i].fp,
195 update_mv(w, counts->comps[i].class0_hp, &mvc->comps[i].class0_hp,
197 update_mv(w, counts
232 inc_mvs(const MB_MODE_INFO *mbmi, const int_mv mvs[2], nmv_context_counts *counts) argument
[all...]
/external/chromium_org/third_party/libwebp/utils/
H A Dhuffman_encode.c29 // Change the population counts in a way that the consequent
32 uint32_t* 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
50 uint32_t symbol = counts[0];
53 if (i == length || counts[i] != symbol) {
63 symbol = counts[i];
70 // 3) Let's replace those population counts that lead to more rle codes.
73 uint32_t limit = counts[
31 OptimizeHuffmanForRle(int length, uint8_t* const good_for_rle, uint32_t* const counts) argument
[all...]
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_encodemv.c151 const unsigned int counts[/*n - 1*/],
159 vp9_tree_probs_from_distribution(tree, branch_ct, counts);
167 nmv_context_counts *const counts = &cm->counts.mv; local
169 write_mv_update(vp9_mv_joint_tree, mvc->joints, counts->joints, MV_JOINTS, w);
173 nmv_component_counts *comp_counts = &counts->comps[i];
187 counts->comps[i].class0_fp[j], MV_FP_SIZE, w);
189 write_mv_update(vp9_mv_fp_tree, mvc->comps[i].fp, counts->comps[i].fp,
195 update_mv(w, counts->comps[i].class0_hp, &mvc->comps[i].class0_hp,
197 update_mv(w, counts
232 inc_mvs(const MB_MODE_INFO *mbmi, const int_mv mvs[2], nmv_context_counts *counts) argument
[all...]
/external/webp/src/utils/
H A Dhuffman_encode.c29 // Change the population counts in a way that the consequent
32 uint32_t* 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
50 uint32_t symbol = counts[0];
53 if (i == length || counts[i] != symbol) {
63 symbol = counts[i];
70 // 3) Let's replace those population counts that lead to more rle codes.
73 uint32_t limit = counts[
31 OptimizeHuffmanForRle(int length, uint8_t* const good_for_rle, uint32_t* const counts) argument
[all...]
/external/stlport/test/eh/
H A Dtest_algo.cpp105 // 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[
[all...]
/external/deqp/modules/gles2/stress/
H A Des2sVertexArrayTests.cpp74 int counts[] = {1, 256}; local
80 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++)
102 spec.drawCount = counts[countNdx];
140 // Test strides with different input types, component counts and storage, Usage(?)
143 int counts[] = {1, 256}; local
152 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++)
172 spec.drawCount = counts[countNdx];
210 // Test strides with different input types, component counts and storage, Usage(?)
212 int counts[] = {5, 256}; local
221 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd
283 int counts[] = {1, 256}; local
[all...]
/external/deqp/modules/gles3/stress/
H A Des3sVertexArrayTests.cpp76 int counts[] = {1, 256}; local
82 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++)
88 const std::string name = "stride" + typeToString(stride) + "_" + Array::inputTypeToString(inputTypes[inputTypeNdx]) + "_quads" + typeToString(counts[countNdx]);
103 spec.drawCount = counts[countNdx];
174 int counts[] = {1, 256}; local
181 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++)
190 std::string name = Array::storageToString(storages[storageNdx]) + "_stride" + typeToString(stride) + "_components" + typeToString(componentCount) + "_quads" + typeToString(counts[countNdx]);
208 spec.drawCount = counts[countNdx];
278 int counts[] = {5, 256}; local
285 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd
382 int counts[] = {1, 256}; local
[all...]
/external/oprofile/libpp/
H A Dformat_output.cpp305 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
[all...]
/external/chromium_org/cc/surfaces/
H A Dsurface_factory_unittest.cc217 int counts[] = {1, 1, 1}; local
218 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref));
223 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref));
238 int counts[] = {1, 1}; local
239 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref));
253 int counts[] = {2}; local
254 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref));
291 // and 3 will have counts of 2, since they were used in both frames, and
323 int counts[] = {1, 1, 1, 1}; local
324 UnrefResources(ids_to_unref, counts, arraysiz
338 int counts[] = {1, 1}; local
[all...]
/external/chromium_org/third_party/skia/include/pdf/
H A DSkPDFDocument.h75 int counts[SkAdvancedTypefaceMetrics::kOther_Font + 2]) const;
80 int counts[SkAdvancedTypefaceMetrics::kOther_Font + 1],
/external/skia/include/pdf/
H A DSkPDFDocument.h75 int counts[SkAdvancedTypefaceMetrics::kOther_Font + 2]) const;
80 int counts[SkAdvancedTypefaceMetrics::kOther_Font + 1],
/external/valgrind/main/exp-bbv/tests/amd64-linux/
H A Dfldcw_check.S7 # performance counter counts this as one instruction. However,
8 # on Pentium 4 systems it counts as two. Therefore this can
/external/valgrind/main/exp-bbv/tests/x86/
H A Dfldcw_check.S7 # performance counter counts this as one instruction. However,
8 # on Pentium 4 systems it counts as two. Therefore this can
/external/valgrind/main/gdbserver_tests/
H A Dmcclean_after_fork.stderr.exp14 For counts of detected and suppressed errors, rerun with: -v
H A Dmcmain_pic.stderr.exp12 For counts of detected and suppressed errors, rerun with: -v
/external/valgrind/main/memcheck/tests/
H A Daccounting.stderr.exp10 For counts of detected and suppressed errors, rerun with: -v
H A Dbrk2.stderr.exp9 For counts of detected and suppressed errors, rerun with: -v
H A Dbug287260.stderr.exp10 For counts of detected and suppressed errors, rerun with: -v
H A Derringfds.stderr.exp10 For counts of detected and suppressed errors, rerun with: -v
H A Dleak-pool-0.stderr.exp9 For counts of detected and suppressed errors, rerun with: -v
H A Dleak-pool-1.stderr.exp9 For counts of detected and suppressed errors, rerun with: -v
H A Dleak-pool-2.stderr.exp9 For counts of detected and suppressed errors, rerun with: -v

Completed in 3699 milliseconds

12345678910