Home
last modified time | relevance | path

Searched refs:bins (Results 1 – 17 of 17) sorted by relevance

/hardware/qcom/sdm845/display/libhistogram/
Dringbuffer_test.cpp95 std::array<uint64_t, HIST_V_SIZE> bins; member in RingbufferTestCases
110 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
112 EXPECT_THAT(bins, Each(0)); in TEST_F()
129 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
131 ASSERT_THAT(bins.size(), Eq(HIST_V_SIZE)); in TEST_F()
132 for (auto i = 0u; i < bins.size(); i++) { in TEST_F()
133 EXPECT_THAT(bins[i], Eq(toMs(3ms) * i)); in TEST_F()
152 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
154 EXPECT_THAT(bins, Each(fill_frame0)); in TEST_F()
157 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
[all …]
Dringbuffer.cpp40 uint64_t& count, std::array<uint64_t, HIST_V_SIZE>& bins) const { in update_cumulative()
50 for (auto i = 0u; i < bins.size(); i++) { in update_cumulative()
52 …if (CC_UNLIKELY((bins[i] + increment < bins[i]) || (increment < ringbuffer.front().histogram.data[… in update_cumulative()
53 bins[i] = std::numeric_limits<uint64_t>::max(); in update_cumulative()
55 bins[i] += increment; in update_cumulative()
116 std::array<uint64_t, HIST_V_SIZE> bins; in collect_max() local
117 bins.fill(0); in collect_max()
126 bins[i] += it->histogram.data[i] * delta.count(); in collect_max()
129 return { collect_first, bins }; in collect_max()
Dringbuffer.h69 …void update_cumulative(nsecs_t now, uint64_t& count, std::array<uint64_t, HIST_V_SIZE>& bins) cons…
/hardware/qcom/sm8150/display/libhistogram/
Dringbuffer_test.cpp95 std::array<uint64_t, HIST_V_SIZE> bins; member in RingbufferTestCases
110 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
112 EXPECT_THAT(bins, Each(0)); in TEST_F()
129 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
131 ASSERT_THAT(bins.size(), Eq(HIST_V_SIZE)); in TEST_F()
132 for (auto i = 0u; i < bins.size(); i++) { in TEST_F()
133 EXPECT_THAT(bins[i], Eq(toMs(3ms) * i)); in TEST_F()
152 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
154 EXPECT_THAT(bins, Each(fill_frame0)); in TEST_F()
157 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
[all …]
Dringbuffer.cpp40 uint64_t& count, std::array<uint64_t, HIST_V_SIZE>& bins) const { in update_cumulative()
50 for (auto i = 0u; i < bins.size(); i++) { in update_cumulative()
52 …if (CC_UNLIKELY((bins[i] + increment < bins[i]) || (increment < ringbuffer.front().histogram.data[… in update_cumulative()
53 bins[i] = std::numeric_limits<uint64_t>::max(); in update_cumulative()
55 bins[i] += increment; in update_cumulative()
116 std::array<uint64_t, HIST_V_SIZE> bins; in collect_max() local
117 bins.fill(0); in collect_max()
126 bins[i] += it->histogram.data[i] * delta.count(); in collect_max()
129 return { collect_first, bins }; in collect_max()
Dhistogram_collector.cpp61 std::array<uint64_t, numBuckets> bins; in rebucketTo8Buckets() local
62 bins.fill(0); in rebucketTo8Buckets()
64 bins[i / bucket_compression] += frame[i]; in rebucketTo8Buckets()
65 return bins; in rebucketTo8Buckets()
Dringbuffer.h69 …void update_cumulative(nsecs_t now, uint64_t& count, std::array<uint64_t, HIST_V_SIZE>& bins) cons…
/hardware/qcom/sm7250/display/libhistogram/
Dringbuffer_test.cpp95 std::array<uint64_t, HIST_V_SIZE> bins; member in RingbufferTestCases
109 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
111 EXPECT_THAT(bins, Each(0)); in TEST_F()
128 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
130 ASSERT_THAT(bins.size(), Eq(HIST_V_SIZE)); in TEST_F()
131 for (auto i = 0u; i < bins.size(); i++) { in TEST_F()
132 EXPECT_THAT(bins[i], Eq(toMs(3ms) * i)); in TEST_F()
151 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
153 EXPECT_THAT(bins, Each(fill_frame0)); in TEST_F()
156 std::tie(numFrames, bins) = rb->collect_ringbuffer_all(); in TEST_F()
[all …]
Dringbuffer.cpp42 std::array<uint64_t, HIST_V_SIZE> &bins) const { in update_cumulative()
52 for (auto i = 0u; i < bins.size(); i++) { in update_cumulative()
55 if (CC_UNLIKELY((bins[i] + increment < bins[i]) || in update_cumulative()
57 bins[i] = std::numeric_limits<uint64_t>::max(); in update_cumulative()
59 bins[i] += increment; in update_cumulative()
61 ALOGI("bins[%d]: %llu\n", i, static_cast<unsigned long long>(bins[i])); in update_cumulative()
126 std::array<uint64_t, HIST_V_SIZE> bins; in collect_max() local
127 bins.fill(0); in collect_max()
137 bins[i] += it->histogram.data[i] * delta.count(); in collect_max()
140 return {collect_first, bins}; in collect_max()
Dhistogram_collector.cpp61 std::array<uint64_t, numBuckets> bins; in rebucketTo8Buckets() local
62 bins.fill(0); in rebucketTo8Buckets()
64 bins[i / bucket_compression] += frame[i]; in rebucketTo8Buckets()
65 return bins; in rebucketTo8Buckets()
Dringbuffer.h70 std::array<uint64_t, HIST_V_SIZE> &bins) const;
/hardware/google/pixel/health/
DCycleCountBackupRestore.cpp92 void CycleCountBackupRestore::Read(const std::string &path, int *bins) { in Read() argument
107 bins[i] = std::stoi(counts[i]); in Read()
112 void CycleCountBackupRestore::Write(int *bins, const std::string &path) { in Write() argument
119 str_data += std::to_string(bins[i]); in Write()
/hardware/google/pixel/health/include/pixelhealth/
DCycleCountBackupRestore.h49 void Read(const std::string &path, int *bins);
50 void Write(int *bins, const std::string &path);
/hardware/qcom/media/msm8974/mm-video-legacy/vidc/common/src/
Dextra_data_handler.cpp50 OMX_U32 rem_bits = num_bits, bins = 0, shift = 0; in d_u() local
55 bins <<= shift; in d_u()
57 bins |= ((rbsp_buf[byte_ptr] << shift) & 0xFF) >> shift; in d_u()
66 bins <<= rem_bits; in d_u()
67 bins |= ((rbsp_buf[byte_ptr] << (8-bit_ptr)) & 0xFF) >> (8-rem_bits); in d_u()
77 DEBUG_PRINT_LOW("\nIn %s() bin/num_bits : %x/%d", __func__, bins, num_bits); in d_u()
78 return bins; in d_u()
/hardware/qcom/media/msm8974/mm-video-v4l2/vidc/common/src/
Dextra_data_handler.cpp52 OMX_U32 rem_bits = num_bits, bins = 0, shift = 0; in d_u() local
57 bins <<= shift; in d_u()
59 bins |= ((rbsp_buf[byte_ptr] << shift) & 0xFF) >> shift; in d_u()
69 bins <<= rem_bits; in d_u()
70 bins |= ((rbsp_buf[byte_ptr] << (8-bit_ptr)) & 0xFF) >> (8-rem_bits); in d_u()
82 … DEBUG_PRINT_LOW("In %s() bin/num_bits : %x/%u", __func__, (unsigned)bins, (unsigned int)num_bits); in d_u()
83 return bins; in d_u()
/hardware/interfaces/neuralnetworks/1.2/
Dtypes.hal4103 * regions of interest and pooling bins.
/hardware/interfaces/neuralnetworks/1.3/
Dtypes.hal4336 * regions of interest and pooling bins.