HomeSort by relevance Sort by last modified time
    Searched refs:counts (Results 126 - 150 of 373) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/
vp9_decodemv.c 35 ++cm->counts.y_mode[size_group][y_mode];
44 ++cm->counts.uv_mode[y_mode][uv_mode];
52 ++cm->counts.inter_mode[ctx][mode];
73 ++get_tx_counts(max_tx_size, ctx, &cm->counts.tx)[tx_size];
155 ++cm->counts.skip[ctx][skip];
238 nmv_context_counts *counts, int allow_hp) {
250 vp9_inc_mv(&diff, counts);
264 ++cm->counts.comp_inter[ctx][mode];
276 FRAME_COUNTS *const counts = &cm->counts; local
    [all...]
vp9_detokenize.c 88 FRAME_COUNTS *const counts = &cm->counts; local
95 counts->coef[tx_size][type][ref];
97 counts->eob_branch[tx_size][type][ref];
  /external/chromium_org/tools/perf/page_sets/
presubmit_unittest.py 107 counts = collections.defaultdict(int)
109 counts[type(result)] += 1
110 actual_errors = counts[OutputAPIStub.PresubmitError]
111 actual_notifications = counts[OutputAPIStub.PresubmitNotifyResult]
  /external/libvpx/libvpx/vp9/common/
vp9_prob.h 83 const unsigned int *counts, unsigned int count_sat,
  /external/libvpx/libvpx/vp9/decoder/
vp9_decodemv.c 35 ++cm->counts.y_mode[size_group][y_mode];
44 ++cm->counts.uv_mode[y_mode][uv_mode];
53 ++cm->counts.inter_mode[ctx][mode];
74 ++get_tx_counts(max_tx_size, ctx, &cm->counts.tx)[tx_size];
156 ++cm->counts.skip[ctx][skip];
239 nmv_context_counts *counts, int allow_hp) {
251 vp9_inc_mv(&diff, counts);
265 ++cm->counts.comp_inter[ctx][mode];
277 FRAME_COUNTS *const counts = &cm->counts; local
    [all...]
vp9_detokenize.c 88 FRAME_COUNTS *const counts = &cm->counts; local
95 counts->coef[tx_size][type][ref];
97 counts->eob_branch[tx_size][type][ref];
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_prob.h 83 const unsigned int *counts, unsigned int count_sat,
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/
vp9_decodemv.c 35 ++cm->counts.y_mode[size_group][y_mode];
44 ++cm->counts.uv_mode[y_mode][uv_mode];
53 ++cm->counts.inter_mode[ctx][mode];
74 ++get_tx_counts(max_tx_size, ctx, &cm->counts.tx)[tx_size];
156 ++cm->counts.skip[ctx][skip];
239 nmv_context_counts *counts, int allow_hp) {
251 vp9_inc_mv(&diff, counts);
265 ++cm->counts.comp_inter[ctx][mode];
277 FRAME_COUNTS *const counts = &cm->counts; local
    [all...]
vp9_detokenize.c 88 FRAME_COUNTS *const counts = &cm->counts; local
95 counts->coef[tx_size][type][ref];
97 counts->eob_branch[tx_size][type][ref];
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/sys/
gmon.h 50 long *counts; member in struct:__bb
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/sys/
gmon.h 50 long *counts; member in struct:__bb
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_peepholer.py 236 counts = [None] * 5
237 for i in xrange(len(counts)):
240 counts[i] = sys.gettotalrefcount()
241 print counts
test_trace.py 118 self.assertEqual(self.tracer.results().counts, expected)
130 self.assertEqual(self.tracer.results().counts, expected)
142 self.assertEqual(self.tracer.results().counts, expected)
157 self.assertEqual(self.tracer.results().counts, expected)
170 self.assertEqual(self.tracer.results().counts, expected)
187 self.assertEqual(tracer.results().counts, expected)
208 # When used through 'run', some other spurious counts are produced, like
210 # counts fo traced_func_loop were right.
213 self.assertEqual(self.tracer.results().counts[k], expected[k])
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_peepholer.py 236 counts = [None] * 5
237 for i in xrange(len(counts)):
240 counts[i] = sys.gettotalrefcount()
241 print counts
test_trace.py 118 self.assertEqual(self.tracer.results().counts, expected)
130 self.assertEqual(self.tracer.results().counts, expected)
142 self.assertEqual(self.tracer.results().counts, expected)
157 self.assertEqual(self.tracer.results().counts, expected)
170 self.assertEqual(self.tracer.results().counts, expected)
187 self.assertEqual(tracer.results().counts, expected)
208 # When used through 'run', some other spurious counts are produced, like
210 # counts fo traced_func_loop were right.
213 self.assertEqual(self.tracer.results().counts[k], expected[k])
  /external/oprofile/libpp/
profile_container.cpp 95 symb_entry.sample.counts[pclass] = count;
145 sample.counts[pclass] = it.count();
180 op_ratio(it->sample.counts[0], total_count[0]);
220 count_array_t counts = samples_count(*it); local
222 double const ratio = op_ratio(counts[0], total_count[0]);
  /external/zopfli/src/zopfli/
deflate.c 377 Change the population counts in a way that the consequent Hufmann tree
381 void OptimizeHuffmanForRle(int length, size_t* counts) {
392 if (counts[length - 1] != 0) {
393 /* Now counts[0..length - 1] does not have trailing zeros. */
397 /* 2) Let's mark all population counts that already can be encoded
405 symbol = counts[0];
408 if (i == length || counts[i] != symbol) {
416 symbol = counts[i];
423 /* 3) Let's replace those population counts that lead to more rle codes. */
425 limit = counts[0]
    [all...]
  /external/chromium_org/v8/test/mjsunit/
debug-ignore-breakpoints.js 32 // Simple debug event handler which just counts the number of break points hit.
66 // Set different ignore counts.
78 // Set different ignore counts (opposite).
  /external/chromium_org/base/metrics/
sample_vector.cc 62 // Go through the iterator and add the counts into correct bucket.
114 SampleVectorIterator::SampleVectorIterator(const vector<Count>* counts,
116 : counts_(counts),
  /external/valgrind/main/memcheck/tests/
badjump.stderr.exp 24 For counts of detected and suppressed errors, rerun with: -v
noisy_child.stderr.exp 22 For counts of detected and suppressed errors, rerun with: -v
partial_load_ok.stderr.exp 27 For counts of detected and suppressed errors, rerun with: -v
  /external/valgrind/main/memcheck/tests/darwin/
aio.stderr.exp 21 For counts of detected and suppressed errors, rerun with: -v
  /external/chromium_org/third_party/libvpx/source/libvpx/
rate_hist.c 247 void show_q_histogram(const int counts[64], int max_buckets) {
255 if (counts[i]) {
257 bucket[buckets].count = counts[i];
259 total += counts[i];
  /external/guava/guava-tests/test/com/google/common/util/concurrent/
AtomicDoubleArrayTest.java 289 volatile long counts; field in class:AtomicDoubleArrayTest.Counter
300 ++counts;
327 assertEquals(c1.counts + c2.counts, SIZE * COUNTDOWN);

Completed in 526 milliseconds

1 2 3 4 56 7 8 91011>>