Searched refs:max_count (Results 1 - 25 of 49) sorted by relevance

12

/external/webrtc/webrtc/base/
H A Drollingaccumulator.h28 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 Dbandwidthsmoother.cc44 accumulator_.max_count() * min_sample_count_percent_)) {
/external/wpa_supplicant_8/wpa_supplicant/
H A Dblacklist.c126 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 DproblemP.h19 int max_count; member in struct:e2fsck_problem
/external/curl/tests/libtest/
H A Dlib582.c36 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 Dod.c32 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 Dcvfeatureselect.cpp62 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 Dmake_default_searcher.pred.pass.cpp37 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 Dgrfmt_sunras.cpp227 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 Dtrees.c715 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 Dtrees.c715 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 Dmulti_thread_gemm.h504 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 Dtrees.c721 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 Dxmpptask.h154 bool VerifyTaskRateLimit(const std::string task_name, int max_count,
/external/webrtc/webrtc/system_wrappers/source/spreadsortlib/
H A Dspreadsort.hpp192 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 Ddefault.pred.pass.cpp52 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 Dr300_render.c752 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 Dnanopb_generator.py169 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 Dcaches-queues-lists.c412 if(cache->count > cache->max_count)
413 cache->max_count = cache->count;
519 cache->max_count);
H A Dcaches-queues-lists.h165 int max_count; member in union:cache::__anon17558
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Dhash.pred.pass.cpp56 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 Dpred.pass.cpp52 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 Dhash.pred.pass.cpp55 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 Dpred.pass.cpp51 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 Dsanitizer_allocator.h899 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...]

Completed in 2818 milliseconds

12