| /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...] |
| hpack_huffman_aggregator_test.cc | 33 std::vector<size_t>* counts() { function in class:net::test::HpackHuffmanAggregatorPeer
142 (*peer_.counts())[0] = 1;
143 (*peer_.counts())[255] = 10;
144 (*peer_.counts())[128] = 101;
149 // Internal counts were reset after being published.
150 EXPECT_THAT(*peer_.counts(), Each(Eq(0u)));
153 // Verify histogram counts match the expectation.
164 // Publish a second round of counts;
165 (*peer_.counts())[1] = 32;
166 (*peer_.counts())[128] = 5
[all...] |
| /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/third_party/libvpx/source/libvpx/vp9/common/ |
| vp9_entropymv.c | 171 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) {
172 if (counts != NULL) {
174 ++counts->joints[j];
177 inc_mv_component(mv->row, &counts->comps[0], 1, 1);
181 inc_mv_component(mv->col, &counts->comps[1], 1, 1);
191 const unsigned int *counts, vp9_prob *probs) {
192 vp9_tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT,
201 const nmv_context_counts *counts = &cm->counts.mv; local
203 adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, fc->joints)
[all...] |
| vp9_entropy.c | 742 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];
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_entropymv.c | 171 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) {
172 if (counts != NULL) {
174 ++counts->joints[j];
177 inc_mv_component(mv->row, &counts->comps[0], 1, 1);
181 inc_mv_component(mv->col, &counts->comps[1], 1, 1);
191 const unsigned int *counts, vp9_prob *probs) {
192 vp9_tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT,
201 const nmv_context_counts *counts = &cm->counts.mv; local
203 adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, fc->joints)
[all...] |
| vp9_entropy.c | 742 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];
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_entropymv.c | 171 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) {
172 if (counts != NULL) {
174 ++counts->joints[j];
177 inc_mv_component(mv->row, &counts->comps[0], 1, 1);
181 inc_mv_component(mv->col, &counts->comps[1], 1, 1);
191 const unsigned int *counts, vp9_prob *probs) {
192 vp9_tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT,
201 const nmv_context_counts *counts = &cm->counts.mv; local
203 adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, fc->joints)
[all...] |
| vp9_entropy.c | 742 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];
[all...] |
| /external/chromium_org/third_party/skia/debugger/ |
| SkDebugger.cpp | 78 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/skia/debugger/ |
| SkDebugger.cpp | 78 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/ |
| vp9_encodemv.c | 151 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->comps[i].hp, &mvc->comps[i].hp, MV_UPDATE_PROB)
[all...] |
| /external/chromium_org/third_party/libwebp/utils/ |
| huffman_encode.c | 29 // 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[0]
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encodemv.c | 151 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->comps[i].hp, &mvc->comps[i].hp, MV_UPDATE_PROB)
[all...] |
| /external/webp/src/utils/ |
| huffman_encode.c | 29 // 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[0]
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_encodemv.c | 151 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->comps[i].hp, &mvc->comps[i].hp, MV_UPDATE_PROB)
[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...] |
| /external/deqp/modules/gles2/stress/ |
| es2sVertexArrayTests.cpp | 74 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); countNdx++
283 int counts[] = {1, 256}; local
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Phaser.java | 28 * only internal counts; they do not establish any further internal
286 int counts = (int)s; local
287 return (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK);
299 int counts = (int)s; local
300 return (counts == EMPTY) ? 0 :
301 (counts >>> PARTIES_SHIFT) - (counts & UNARRIVED_MASK);
359 int counts = (int)s; local
360 int unarrived = (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK)
405 int counts = (int)s; local
654 int counts = (int)s; local
[all...] |
| /packages/apps/Exchange/src/com/android/exchange/eas/ |
| EasSync.java | 87 final long[][] messageIds, final int[] counts) {
99 messageIds[index][counts[index]] = messageId;
100 ++counts[index];
122 final int[] counts = new int[2]; local
157 counts);
163 messageIds[0][counts[0]] = msc.getMessageId();
164 ++counts[0];
180 messageIds[1][counts[1]] = msc.getMessageId();
181 ++counts[1];
187 MessageStateChange.upsyncSuccessful(cr, messageIds[0], counts[0])
[all...] |
| /external/deqp/modules/gles3/stress/ |
| es3sVertexArrayTests.cpp | 76 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); countNdx++
382 int counts[] = {1, 256}; local
[all...] |
| /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/cc/surfaces/ |
| surface_unittest.cc | 241 int counts[] = {1, 1, 1}; local
242 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref), &surface);
248 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref), &surface);
265 int counts[] = {1, 1}; local
266 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref), &surface);
282 int counts[] = {2}; local
283 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref), &surface);
331 // and 3 will have counts of 2, since they were used in both frames, and
369 int counts[] = {1, 1, 1, 1}; local
370 UnrefResources(ids_to_unref, counts, arraysize(ids_to_unref), &surface)
386 int counts[] = {1, 1}; local
[all...] |
