Home
last modified time | relevance | path

Searched refs:count_ (Results 1 – 25 of 145) sorted by relevance

123456

/external/webrtc/webrtc/base/
Drollingaccumulator.h40 return count_; in count()
44 count_ = 0U; in Reset()
55 if (count_ == max_count()) { in AddSample()
68 ++count_; in AddSample()
74 if (count_ == 1 || sample >= max_) { in AddSample()
78 if (count_ == 1 || sample <= min_) { in AddSample()
91 if (count_ == 0) { in ComputeMean()
94 return sum_ / count_; in ComputeMean()
99 ASSERT(count_ > 0 && in ComputeMax()
102 for (size_t i = 1u; i < count_; i++) { in ComputeMax()
[all …]
Dcallback_unittest.cc33 RefCountedBindTester() : count_(0) {} in RefCountedBindTester()
35 return ++count_; in AddRef()
38 return --count_; in Release()
40 int RefCount() const { return count_; } in RefCount()
43 mutable int count_; member in rtc::__anona9cefe470111::RefCountedBindTester
/external/libcxx/test/support/
Dcounting_predicates.hpp21 unary_counting_predicate(Predicate p) : p_(p), count_(0) {} in unary_counting_predicate()
24 bool operator () (const Arg &a) const { ++count_; return p_(a); } in operator ()()
25 size_t count() const { return count_; } in count()
26 void reset() { count_ = 0; } in reset()
30 mutable size_t count_; member
41 binary_counting_predicate ( Predicate p ) : p_(p), count_(0) {} in binary_counting_predicate()
44 bool operator () (const Arg1 &a1, const Arg2 &a2) const { ++count_; return p_(a1, a2); } in operator ()()
45 size_t count() const { return count_; } in count()
46 void reset() { count_ = 0; } in reset()
50 mutable size_t count_; member
/external/grpc-grpc/src/core/lib/gprpp/
Dfork.cc55 gpr_atm_no_barrier_store(&count_, UNBLOCKED(0)); in ExecCtxState()
59 gpr_atm count = gpr_atm_no_barrier_load(&count_); in IncExecCtxCount()
65 if (gpr_atm_no_barrier_load(&count_) <= BLOCKED(1)) { in IncExecCtxCount()
71 } else if (gpr_atm_no_barrier_cas(&count_, count, count + 1)) { in IncExecCtxCount()
74 count = gpr_atm_no_barrier_load(&count_); in IncExecCtxCount()
78 void DecExecCtxCount() { gpr_atm_no_barrier_fetch_add(&count_, -1); } in DecExecCtxCount()
82 if (gpr_atm_no_barrier_cas(&count_, UNBLOCKED(1), BLOCKED(1))) { in BlockExecCtx()
93 gpr_atm_no_barrier_store(&count_, UNBLOCKED(0)); in AllowExecCtx()
108 gpr_atm count_; member in grpc_core::internal::ExecCtxState
113 ThreadState() : awaiting_threads_(false), threads_done_(false), count_(0) { in ThreadState()
[all …]
/external/v4l2_codec2/vda/
Dvp8_bool_decoder.cc87 count_(-8), in Vp8BoolDecoder()
98 count_ = -8; in Initialize()
105 int shift = VP8_BD_VALUE_BIT - CHAR_BIT - (count_ + CHAR_BIT); in FillDecoder()
112 count_ += VP8_LOTS_OF_BITS; in FillDecoder()
118 count_ += CHAR_BIT; in FillDecoder()
129 if (count_ < 0) in ReadBit()
144 count_ -= static_cast<int>(shift); in ReadBit()
177 int bit_count = count_ + 8; in BitOffset()
189 if (count_ < 0) in GetBottom()
206 return (count_ > VP8_BD_VALUE_BIT) && (count_ < VP8_LOTS_OF_BITS); in OutOfBuffer()
/external/webrtc/webrtc/modules/audio_processing/intelligibility/
Dintelligibility_utils.cc68 count_(0), in VarianceArray()
106 ++count_; in InfiniteStep()
112 if (count_ == 1) { in InfiniteStep()
119 old_mean + (sample - old_mean) / static_cast<float>(count_); in InfiniteStep()
124 conj_sum_[i] / (count_ - 1); in InfiniteStep()
134 ++count_; in DecayStep()
139 if (count_ == 1) { in DecayStep()
160 size_t num = min(count_ + 1, window_size_); in WindowedStep()
185 ++count_; in WindowedStep()
196 AddToMean(data[i], count_ + 1, &sub_running_mean_[i]); in BlockedStep()
[all …]
/external/tensorflow/tensorflow/core/util/
Dstats_calculator.h37 if (count_ == 0) { in UpdateStat()
44 ++count_; in UpdateStat()
51 bool empty() const { return count_ == 0; } in empty()
61 int64_t count() const { return count_; } in count()
67 bool all_same() const { return (count_ == 0 || min_ == max_); } in all_same()
71 : static_cast<HighPrecisionValueType>(sum_) / count_; in avg()
75 return all_same() ? 0 : sqrt(squared_sum_ / count_ - avg() * avg()); in std_deviation()
82 *stream << "count=" << count_ << " curr=" << newest_; in OutputToStream()
83 if (count_ > 1) *stream << "(all same)"; in OutputToStream()
85 *stream << "count=" << count_ << " first=" << first_ in OutputToStream()
[all …]
Dutil.cc49 count_(0) { in MovingAverage()
56 count_ = 0; in Clear()
62 if (count_ == 0) { in GetAverage()
65 return static_cast<double>(sum_) / count_; in GetAverage()
70 if (count_ < window_) { in AddValue()
72 head_ = count_; in AddValue()
73 data_[count_++] = v; in AddValue()
/external/v8/src/base/
Dring-buffer.h19 if (count_ == kSize) { in Push()
24 elements_[count_++] = value; in Push()
28 int Count() const { return count_; } in Count()
32 int j = start_ + count_ - 1; in Sum()
35 for (int i = 0; i < count_; i++) { in Sum()
42 void Reset() { start_ = count_ = 0; } in Reset()
47 int count_; variable
/external/webrtc/webrtc/test/
Dstatistics.cc17 Statistics::Statistics() : sum_(0.0), sum_squared_(0.0), count_(0) {} in Statistics()
22 ++count_; in AddSample()
26 if (count_ == 0) in Mean()
28 return sum_ / count_; in Mean()
32 if (count_ == 0) in Variance()
34 return sum_squared_ / count_ - Mean() * Mean(); in Variance()
/external/libchrome/base/strings/
Dsafe_sprintf.cc115 count_(0) { in Buffer()
142 return count_ == static_cast<size_t>(kSSizeMax - 1); in OutOfAddressableSpace()
150 DEBUG_CHECK(count_ < kSSizeMax); in GetCount()
151 return static_cast<ssize_t>(count_); in GetCount()
161 if (size_ >= 1 && count_ < size_) { in Out()
162 buffer_[count_] = ch; in Out()
236 if (count_ > kSSizeMax - 1 - inc) { in IncrementCount()
237 count_ = kSSizeMax - 1; in IncrementCount()
240 count_ += inc; in IncrementCount()
255 size_t idx = count_; in GetInsertionPoint()
[all …]
/external/tensorflow/tensorflow/core/platform/profile_utils/
Dclock_cycle_profiler.h46 return count_; in GetCount()
85 const double next_count = count_ + 1.0; in AccumulateClockCycle()
88 next_count_inv * (average_clock_cycle_ * count_ + clock_diff); in AccumulateClockCycle()
89 count_ = next_count; in AccumulateClockCycle()
96 double count_{0.0};
/external/libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.fill.n/
Duninitialized_fill_n.pass.cpp23 static int count_; member
28 ++count_; in B()
29 if (count_ == 3) in B()
37 int B::count_ = 0; member in B
68 B::count_ = 0; in main()
/external/libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.fill/
Duninitialized_fill.pass.cpp24 static int count_; member
29 ++count_; in B()
30 if (count_ == 3) in B()
38 int B::count_ = 0; member in B
69 B::count_ = 0; in main()
/external/libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.copy/
Duninitialized_copy.pass.cpp24 static int count_; member
29 ++count_; in B()
30 if (count_ == 3) in B()
38 int B::count_ = 0; member in B
70 B::count_ = 0; in main()
Duninitialized_copy_n.pass.cpp24 static int count_; member
29 ++count_; in B()
30 if (count_ == 3) in B()
39 int B::count_ = 0; member in B
70 B::count_ = 0; in main()
/external/tensorflow/tensorflow/core/kernels/data/
Dtake_dataset_op.h28 : DatasetBase(DatasetContext(ctx)), count_(count), input_(input) { in TakeDataset()
35 count_(count), in TakeDataset()
61 return count_; in Cardinality()
63 return std::min(n, count_); in Cardinality()
74 const int64 count_; variable
Drepeat_dataset_op.cc45 : DatasetBase(DatasetContext(ctx)), count_(count), input_(input) { in Dataset()
53 if (count_ < 0) { in MakeIteratorInternal()
56 } else if (count_ == 0) { in MakeIteratorInternal()
76 if (count_ < 0) { in Cardinality()
82 if (count_ == 0) { in Cardinality()
88 return count_ * n; in Cardinality()
98 TF_RETURN_IF_ERROR(b->AddScalar(count_, &count)); in AsGraphDefInternal()
149 while (i_ < dataset()->count_) { in GetNextInternal()
279 const int64 count_; member in tensorflow::data::__anon6a14bcf10111::RepeatDatasetOp::Dataset
/external/tensorflow/tensorflow/core/common_runtime/
Doptimization_registry_test.cc25 static int count_; member in tensorflow::TestOptimization
27 ++count_; in Run()
32 int TestOptimization::count_ = 0; member in tensorflow::TestOptimization
38 EXPECT_EQ(0, TestOptimization::count_); in TEST()
43 EXPECT_EQ(1, TestOptimization::count_); in TEST()
/external/autotest/client/deps/glbench/src/
Dtrianglesetuptest.cc67 count_ = CreateMesh(&indices, &index_buffer_size, width, height, 0); in Run()
71 RunTest(this, "triangle_setup", count_ / 3, g_width, g_height, true); in Run()
73 RunTest(this, "triangle_setup_all_culled", count_ / 3, g_width, g_height, in Run()
85 count_ = in Run()
91 RunTest(this, "triangle_setup_half_culled", count_ / 3, g_width, g_height, in Run()
Dattributefetchtest.cc115 count_ = CreateMesh(&indices, &index_buffer_size, width, height, 0); in Run()
126 RunTest(this, "attribute_fetch_shader", count_, g_width, g_height, true); in Run()
130 RunTest(this, "attribute_fetch_shader_2_attr", count_, g_width, g_height, in Run()
135 RunTest(this, "attribute_fetch_shader_4_attr", count_, g_width, g_height, in Run()
140 RunTest(this, "attribute_fetch_shader_8_attr", count_, g_width, g_height, in Run()
/external/v8/src/base/debug/
Dstack_trace_win.cc168 count_ = CaptureStackBackTrace(0, arraysize(trace_), trace_, nullptr); in StackTrace()
187 count_ = 0; in InitTrace()
208 count_ < arraysize(trace_)) { in InitTrace()
209 trace_[count_++] = reinterpret_cast<void*>(stack_frame.AddrPC.Offset); in InitTrace()
212 for (size_t i = count_; i < arraysize(trace_); ++i) trace_[i] = nullptr; in InitTrace()
222 for (size_t i = 0; (i < count_) && os->good(); ++i) { in OutputToStream()
229 OutputTraceToStream(trace_, count_, os); in OutputToStream()
/external/v8/src/compiler/
Dnode.h63 : inputs_.outline_->count_; in InputCount()
170 int count_; member
321 bool empty() const { return count_ == 0; } in empty()
322 int count() const { return count_; } in count()
327 : input_root_(input_root), use_root_(use_root), count_(count) {} in InputEdges()
332 int count_; variable
343 bool empty() const { return count_ == 0; } in empty()
344 int count() const { return count_; } in count()
349 : input_root_(input_root), count_(count) {} in Inputs()
353 int count_; variable
[all …]
/external/tensorflow/tensorflow/core/graph/
Dcostmodel.cc35 if (count_.empty()) return; in SuppressInfrequent()
37 for (auto v : count_) { in SuppressInfrequent()
62 count_[global_id] += cm.count_[local_id]; in MergeFromLocal()
80 const int num_nodes = cm.count_.size(); in MergeFromGlobal()
82 count_[i] += cm.count_[i]; in MergeFromGlobal()
111 count_[global_id]++; in MergeFromStats()
128 count_.resize(id + 1); in Ensure()
171 count_[id] += count; in RecordCount()
177 return (static_cast<size_t>(id) < slot_bytes_.size()) ? count_[id] : 0; in TotalCount()
466 count_.reserve(num_node_ids); in InitFromGraph()
[all …]
/external/libcxx/utils/google-benchmark/test/
Dfilter_test.cc22 ++count_; in ReportRuns()
26 TestReporter() : count_(0) {} in TestReporter()
30 size_t GetCount() const { return count_; } in GetCount()
33 mutable size_t count_; member in __anon1749e2b60111::TestReporter

123456