HomeSort by relevance Sort by last modified time
    Searched refs:counts (Results 1 - 25 of 194) sorted by null

1 2 3 4 5 6 7 8

  /external/chromium_org/tools/telemetry/telemetry/core/backends/chrome/
inspector_memory_unittest.py 23 counts = self._tab.dom_stats
24 self.assertEqual(counts['document_count'], 1,
27 self.assertEqual(counts['node_count'], 14,
29 self.assertEqual(counts['event_listener_count'], 2,
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
vp9_prob.c 36 const unsigned int *counts,
42 ? counts[-l]
43 : tree_merge_probs_impl(l, tree, pre_probs, counts,
47 ? counts[-r]
48 : tree_merge_probs_impl(r, tree, pre_probs, counts,
57 const unsigned int *counts, unsigned int count_sat,
59 tree_merge_probs_impl(0, tree, pre_probs, counts, count_sat,
vp9_entropymode.c 345 const vp9_prob *pre_probs, const unsigned int *counts,
347 vp9_tree_merge_probs(tree, pre_probs, counts, COUNT_SAT, MAX_UPDATE_FACTOR,
355 const FRAME_COUNTS *counts = &cm->counts; local
359 counts->intra_inter[i]);
362 counts->comp_inter[i]);
365 counts->comp_ref[i]);
369 counts->single_ref[i][j]);
373 counts->inter_mode[i], fc->inter_mode_probs[i]);
377 counts->y_mode[i], fc->y_mode_prob[i])
    [all...]
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 770 vp9_coeff_count_model *counts = cm->counts.coef[tx_size]; local
    [all...]
  /external/libvpx/libvpx/vp9/common/
vp9_prob.c 36 const unsigned int *counts,
42 ? counts[-l]
43 : tree_merge_probs_impl(l, tree, pre_probs, counts,
47 ? counts[-r]
48 : tree_merge_probs_impl(r, tree, pre_probs, counts,
57 const unsigned int *counts, unsigned int count_sat,
59 tree_merge_probs_impl(0, tree, pre_probs, counts, count_sat,
vp9_entropymode.c 345 const vp9_prob *pre_probs, const unsigned int *counts,
347 vp9_tree_merge_probs(tree, pre_probs, counts, COUNT_SAT, MAX_UPDATE_FACTOR,
355 const FRAME_COUNTS *counts = &cm->counts; local
359 counts->intra_inter[i]);
362 counts->comp_inter[i]);
365 counts->comp_ref[i]);
369 counts->single_ref[i][j]);
373 counts->inter_mode[i], fc->inter_mode_probs[i]);
377 counts->y_mode[i], fc->y_mode_prob[i])
    [all...]
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/linux-tools-perf/perf-3.12.0/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/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])
  /external/chromium_org/third_party/brotli/src/brotli/enc/
entropy_encode.h 29 // The (data,length) contains the population counts.
41 // Change the population counts in a way that the consequent
46 // counts contains the population counts.
47 int OptimizeHuffmanCountsForRle(int length, int* counts);
90 int counts[kSize]; local
91 memcpy(counts, &histogram.data_[0], sizeof(counts[0]) * kSize);
92 OptimizeHuffmanCountsForRle(alphabet_size, counts);
93 CreateHuffmanTree(counts, alphabet_size, tree_limit, &code->depth_[0])
    [all...]
entropy_encode.cc 79 // especially when population counts are longer than 2**tree_limit, but
245 int OptimizeHuffmanCountsForRle(int length, int* counts) {
256 if (counts[length - 1] != 0) {
257 // Now counts[0..length - 1] does not have trailing zeros.
265 if (counts[i] != 0) {
267 if (smallest_nonzero > counts[i]) {
268 smallest_nonzero = counts[i];
280 if (counts[i - 1] != 0 && counts[i] == 0 && counts[i + 1] != 0)
    [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;
  /external/chromium_org/chrome/browser/profiles/
profile_metrics.cc 119 ProfileCounts* counts) {
122 counts->total = number_of_profiles;
134 counts->unused++;
137 counts->supervised++;
139 counts->signedin++;
141 counts->gaia_icon++;
150 ProfileCounts counts; local
151 if (CountProfileInformation(manager, &counts)) {
152 int limited_total = counts.total;
153 int limited_signedin = counts.signedin
165 ProfileCounts counts; local
    [all...]
  /external/chromium_org/third_party/libvpx/source/libvpx/
rate_hist.h 31 void show_q_histogram(const int counts[64], int max_buckets);
  /external/libvpx/libvpx/
rate_hist.h 31 void show_q_histogram(const int counts[64], int max_buckets);
  /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/linux-tools-perf/perf-3.12.0/tools/perf/tests/
open-syscall.c 41 if (evsel->counts->cpu[0].val != nr_open_calls) {
43 nr_open_calls, evsel->counts->cpu[0].val);
  /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/chromium_org/third_party/skia/debugger/
SkDebugger.cpp 76 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];

Completed in 579 milliseconds

1 2 3 4 5 6 7 8