/external/webrtc/webrtc/base/ |
H A D | rollingaccumulator.h | 28 explicit RollingAccumulator(size_t max_count) argument 29 : samples_(max_count) { 35 size_t max_count() const { function in class:rtc::RollingAccumulator 55 if (count_ == max_count()) { 83 next_index_ = (next_index_ + 1) % max_count(); 103 max_ = std::max(max_, samples_[(next_index_ + i) % max_count()]); 116 min_ = std::min(min_, samples_[(next_index_ + i) % max_count()]); 133 const size_t max_size = max_count();
|
H A D | bandwidthsmoother.cc | 44 accumulator_.max_count() * min_sample_count_percent_)) {
|
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | blacklist.c | 126 int max_count = 0; local 131 if (e->count > max_count) 132 max_count = e->count; 140 wpa_s->extra_blacklist_count += max_count;
|
/external/e2fsprogs/e2fsck/ |
H A D | problemP.h | 19 int max_count; member in struct:e2fsck_problem
|
/external/curl/tests/libtest/ |
H A D | lib582.c | 36 int max_count; /* max number of sockets that fit in allocated array */ member in struct:Sockets 82 sockets->max_count = 20; 84 else if(sockets->count + 1 > sockets->max_count) { 87 (sockets->max_count + 20)); 93 sockets->max_count += 20;
|
/external/toybox/toys/posix/ |
H A D | od.c | 32 long max_count; 205 if (!TT.max_count) break; 206 if (TT.max_count < len) len = TT.max_count; 214 if (TT.max_count) TT.max_count -= len;
|
/external/opencv/cv/src/ |
H A D | cvfeatureselect.cpp | 62 int max_count = 0; local 87 max_count = *corner_count; 136 if( max_count <= 0 ) 211 if( ++count >= max_count )
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
H A D | make_default_searcher.pred.pass.cpp | 37 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { argument 41 assert(count_equal::count <= max_count);
|
/external/opencv/otherlibs/highgui/ |
H A D | grfmt_sunras.cpp | 227 int max_count = (int)(line_end - tsrc); local 240 while( ++len1 < max_count ); 295 int max_count = (int)(line_end - data); local 309 while( (max_count -= nch) > 0 );
|
/external/pdfium/third_party/zlib_v128/ |
H A D | trees.c | 715 int max_count = 7; /* max repeat count */ local 718 if (nextlen == 0) max_count = 138, min_count = 3; 723 if (++count < max_count && curlen == nextlen) { 737 max_count = 138, min_count = 3; 739 max_count = 6, min_count = 3; 741 max_count = 7, min_count = 4; 760 int max_count = 7; /* max repeat count */ local 764 if (nextlen == 0) max_count = 138, min_count = 3; 768 if (++count < max_count && curlen == nextlen) { 788 max_count [all...] |
/external/zlib/src/ |
H A D | trees.c | 715 int max_count = 7; /* max repeat count */ local 718 if (nextlen == 0) max_count = 138, min_count = 3; 723 if (++count < max_count && curlen == nextlen) { 737 max_count = 138, min_count = 3; 739 max_count = 6, min_count = 3; 741 max_count = 7, min_count = 4; 760 int max_count = 7; /* max repeat count */ local 764 if (nextlen == 0) max_count = 138, min_count = 3; 768 if (++count < max_count && curlen == nextlen) { 788 max_count [all...] |
/external/gemmlowp/internal/ |
H A D | multi_thread_gemm.h | 504 int max_count = context->max_num_threads(); local 505 if (!max_count) { 514 max_count = hardware_threads_count; 529 int thread_count = std::min(max_count, CeilQuotient(rows, MinRowsPerThread)); 551 assert(thread_count > 0 && thread_count <= max_count);
|
/external/syslinux/com32/lib/zlib/ |
H A D | trees.c | 721 int max_count = 7; /* max repeat count */ local 724 if (nextlen == 0) max_count = 138, min_count = 3; 729 if (++count < max_count && curlen == nextlen) { 743 max_count = 138, min_count = 3; 745 max_count = 6, min_count = 3; 747 max_count = 7, min_count = 4; 766 int max_count = 7; /* max repeat count */ local 770 if (nextlen == 0) max_count = 138, min_count = 3; 774 if (++count < max_count && curlen == nextlen) { 794 max_count [all...] |
/external/webrtc/webrtc/libjingle/xmpp/ |
H A D | xmpptask.h | 154 bool VerifyTaskRateLimit(const std::string task_name, int max_count,
|
/external/webrtc/webrtc/system_wrappers/source/spreadsortlib/ |
H A D | spreadsort.hpp | 192 size_t max_count = get_max_count(log_divisor, last - first);
200 if(count < max_count)
279 size_t max_count = get_max_count(log_divisor, last - first);
285 if(count < max_count)
327 size_t max_count = get_max_count(log_divisor, last - first);
333 if(count < max_count)
520 size_t max_count = get_max_count(log_divisor, last - first);
526 if(count < max_count)
571 size_t max_count = get_max_count(log_divisor, last - first);
577 if(count < max_count)
[all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
H A D | default.pred.pass.cpp | 52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { argument 56 assert(count_equal::count <= max_count);
|
/external/mesa3d/src/gallium/drivers/r300/ |
H A D | r300_render.c | 752 unsigned size, max_count, value; local 785 max_count = 1 + size / vb->stride; 786 result = MIN2(result, max_count); 809 unsigned max_count = r300_max_vertex_count(r300); local 811 if (!max_count) { 817 if (max_count == ~0) { 819 max_count = 0xffffff; 822 info.max_index = max_count - 1;
|
/external/nanopb-c/generator/ |
H A D | nanopb_generator.py | 169 self.max_count = None 178 if field_options.HasField("max_count"): 179 self.max_count = field_options.max_count 192 if self.max_count is None: 195 self.array_decl = '[%d]' % self.max_count 216 "max_count is not given." % self.name) 370 return max(self.tag, self.max_size, self.max_count) 413 encsize *= self.max_count 435 self.max_count [all...] |
/external/squashfs-tools/squashfs-tools/ |
H A D | caches-queues-lists.c | 412 if(cache->count > cache->max_count) 413 cache->max_count = cache->count; 519 cache->max_count);
|
H A D | caches-queues-lists.h | 165 int max_count; member in union:cache::__anon17558
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
H A D | hash.pred.pass.cpp | 56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { argument 63 assert(count_equal::count <= max_count);
|
H A D | pred.pass.cpp | 52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { argument 57 assert(count_equal::count <= max_count);
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
H A D | hash.pred.pass.cpp | 55 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { argument 62 assert(count_equal::count <= max_count);
|
H A D | pred.pass.cpp | 51 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { argument 56 assert(count_equal::count <= max_count);
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_allocator.h | 899 uptr max_count = SizeClassMap::MaxCached(class_id); local 910 if (b->count == max_count) { 962 // max_count will be zero, leading to check failure. 966 CHECK_NE(c->max_count, 0UL); 967 if (UNLIKELY(c->count == c->max_count)) 985 uptr max_count; member in struct:__sanitizer::SizeClassAllocatorLocalCache::PerClass 992 if (per_class_[1].max_count) 996 c->max_count = 2 * SizeClassMap::MaxCached(i); 1020 uptr cnt = Min(c->max_count / 2, c->count); 1023 c->batch[i] = c->batch[i + c->max_count / [all...] |