Searched refs:histo (Results 1 - 25 of 34) sorted by relevance

12

/external/brotli/c/enc/
H A Dbit_cost_inc.h48 uint32_t histo[4]; local
52 histo[i] = histogram->data_[s[i]];
58 if (histo[j] > histo[i]) {
59 BROTLI_SWAP(uint32_t, histo, j, i);
63 h23 = histo[2] + histo[3];
64 histomax = BROTLI_MAX(uint32_t, h23, histo[0]);
66 3 * h23 + 2 * (histo[0] + histo[
[all...]
H A Dliteral_cost.c104 size_t histo = histogram[utf8_pos][data[masked_pos]]; local
106 if (histo == 0) {
107 histo = 1;
109 lit_cost = FastLog2(in_window_utf8[utf8_pos]) - FastLog2(histo);
145 size_t histo; local
156 histo = histogram[data[(pos + i) & mask]];
157 if (histo == 0) {
158 histo = 1;
161 double lit_cost = FastLog2(in_window) - FastLog2(histo);
H A Dcompress_fragment.c181 uint32_t histo[128],
187 ++histo[code];
195 ++histo[inscode];
202 ++histo[code];
206 ++histo[21];
213 uint32_t histo[128],
219 ++histo[22];
223 ++histo[23];
230 uint32_t histo[128],
236 ++histo[copyle
178 EmitInsertLen(size_t insertlen, const uint8_t depth[128], const uint16_t bits[128], uint32_t histo[128], size_t* storage_ix, uint8_t* storage) argument
210 EmitLongInsertLen(size_t insertlen, const uint8_t depth[128], const uint16_t bits[128], uint32_t histo[128], size_t* storage_ix, uint8_t* storage) argument
227 EmitCopyLen(size_t copylen, const uint8_t depth[128], const uint16_t bits[128], uint32_t histo[128], size_t* storage_ix, uint8_t* storage) argument
259 EmitCopyLenLastDistance(size_t copylen, const uint8_t depth[128], const uint16_t bits[128], uint32_t histo[128], size_t* storage_ix, uint8_t* storage) argument
302 EmitDistance(size_t distance, const uint8_t depth[128], const uint16_t bits[128], uint32_t histo[128], size_t* storage_ix, uint8_t* storage) argument
375 size_t histo[256] = { 0 }; local
[all...]
H A Dblock_splitter_inc.h303 HistogramType histo;
307 FN(HistogramClear)(&histo);
309 FN(HistogramAdd)(&histo, data[pos++]);
313 FN(BrotliHistogramBitCostDistance)(&histo, &all_histograms[best_out]);
316 &histo, &all_histograms[clusters[j]]);
/external/brotli/research/
H A Ddraw_histogram.cc67 void BuildHistogram(FILE* fin, int** histo) { argument
77 histo[i][j] = 0;
113 histo[x][y] += copy;
116 histo[x][y] += pos2 - pos;
118 histo[x][i] += max_pos / width; // Sometimes 1 more, but who cares.
123 histo[x][right] += pos + copy - 1 - pos2 + 1;
127 histo[x][y]++;
133 void ConvertToPixels(int** histo, uint8_t** pixel) { argument
140 if (maxs < histo[i][j]) maxs = histo[
182 int** histo = new int*[height]; local
[all...]
/external/webp/src/enc/
H A Dhistogram_enc.h74 VP8LHistogram* const histo);
77 void VP8LFreeHistogram(VP8LHistogram* const histo);
80 void VP8LFreeHistogramSet(VP8LHistogramSet* const histo);
92 void VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo,
H A Dhistogram_enc.c67 void VP8LFreeHistogram(VP8LHistogram* const histo) { argument
68 WebPSafeFree(histo);
71 void VP8LFreeHistogramSet(VP8LHistogramSet* const histo) { argument
72 WebPSafeFree(histo);
76 VP8LHistogram* const histo) {
79 VP8LHistogramAddSinglePixOrCopy(histo, c.cur_pos, NULL, 0);
100 VP8LHistogram* histo = NULL; local
104 histo = (VP8LHistogram*)memory;
106 histo->literal_ = (uint32_t*)(memory + sizeof(VP8LHistogram));
107 VP8LHistogramInit(histo, cache_bit
75 VP8LHistogramStoreRefs(const VP8LBackwardRefs* const refs, VP8LHistogram* const histo) argument
140 VP8LHistogramAddSinglePixOrCopy(VP8LHistogram* const histo, const PixOrCopy* const v, int (*const distance_modifier)(int, int), int distance_modifier_arg0) argument
502 VP8LHistogram* const histo = orig_histograms[i]; local
[all...]
H A Danalysis_enc.c113 static int GetAlpha(const VP8Histogram* const histo) { argument
117 const int max_value = histo->max_value;
118 const int last_non_zero = histo->last_non_zero;
124 static void InitHistogram(VP8Histogram* const histo) { argument
125 histo->max_value = 0;
126 histo->last_non_zero = 1;
154 // 'int' type is ok for histo, and won't overflow
248 VP8Histogram histo; local
251 InitHistogram(&histo);
254 0, 16, &histo);
340 VP8Histogram histo; local
[all...]
H A Dvp8l_enc.c197 uint32_t* histo; local
206 histo = (uint32_t*)WebPSafeCalloc(kHistoTotal, sizeof(*histo) * 256);
207 if (histo != NULL) {
221 &histo[kHistoAlpha * 256],
222 &histo[kHistoRed * 256],
223 &histo[kHistoGreen * 256],
224 &histo[kHistoBlue * 256]);
226 &histo[kHistoAlphaPred * 256],
227 &histo[kHistoRedPre
466 const VP8LHistogram* const histo = histogram_image->histograms[i]; local
507 VP8LHistogram* const histo = histogram_image->histograms[i]; local
[all...]
H A Dbackward_references_cost_enc.c65 VP8LHistogram* const histo = VP8LAllocateHistogram(cache_bits); local
66 if (histo == NULL) goto Error;
70 VP8LHistogramInit(histo, cache_bits);
72 VP8LHistogramAddSinglePixOrCopy(histo, c.cur_pos, VP8LDistanceToPlaneCode,
78 VP8LHistogramNumCodes(histo->palette_code_bits_),
79 histo->literal_, m->literal_);
81 VALUES_IN_BYTE, histo->red_, m->red_);
83 VALUES_IN_BYTE, histo->blue_, m->blue_);
85 VALUES_IN_BYTE, histo->alpha_, m->alpha_);
87 NUM_DISTANCE_CODES, histo
[all...]
H A Dpredictor_enc.c480 int histo[4][256]; local
488 memset(histo, 0, sizeof(histo));
493 bits, histo, argb_scratch, argb, max_quantization, exact,
542 int histo[256] = { 0 }; local
546 green_to_red, histo);
548 cur_diff = PredictionCostCrossColor(accumulated_red_histo, histo);
595 int histo[256] = { 0 }; local
599 green_to_blue, red_to_blue, histo);
601 cur_diff = PredictionCostCrossColor(accumulated_blue_histo, histo);
[all...]
H A Dbackward_references_enc.c850 VP8LHistogram* histo = NULL; local
855 histo = VP8LAllocateHistogram(MAX_COLOR_CACHE_BITS);
856 if (histo == NULL) goto Error;
894 VP8LHistogramCreate(histo, worst, cache_bits_tmp);
895 bit_cost = VP8LHistogramEstimateBits(histo);
916 VP8LHistogramCreate(histo, worst, *cache_bits);
917 bit_cost_trace = VP8LHistogramEstimateBits(histo);
926 VP8LFreeHistogram(histo);
/external/libdrm/tests/
H A Ddrmstat.c361 int histo[HISTOSIZE]; local
370 for (i = 0; i < HISTOSIZE; i++) histo[i] = 0;
380 if (wt <= 2.5) ++histo[8];
381 if (wt < 5.0) ++histo[0];
382 else if (wt < 50.0) ++histo[1];
383 else if (wt < 500.0) ++histo[2];
384 else if (wt < 5000.0) ++histo[3];
385 else if (wt < 50000.0) ++histo[4];
386 else if (wt < 500000.0) ++histo[5];
387 else if (wt < 5000000.0) ++histo[
[all...]
/external/tensorflow/tensorflow/core/kernels/
H A Dsummary_op_test.cc182 histogram::Histogram histo; local
183 EXPECT_TRUE(histo.DecodeFromProto(summary.value(0).histo()));
192 histo.ToString());
210 histogram::Histogram histo; local
211 EXPECT_TRUE(histo.DecodeFromProto(summary.value(0).histo()));
220 histo.ToString());
239 histogram::Histogram histo; local
240 EXPECT_TRUE(histo
[all...]
H A Dsummary_op.cc88 histogram::Histogram histo; variable
100 histo.Add(double_val);
106 histo.EncodeToProto(v->mutable_histo(), false /* Drop zero buckets */);
/external/toolchain-utils/
H A Dperf-to-inst-page.sh58 test awk '{print $3}' out.txt | sort -n | uniq -c > inst-histo.txt
70 plot 'inst-histo.txt' using (\$2/1024/1024):1 with impulses notitle
/external/webp/src/dsp/
H A Dlossless_enc_mips_dsp_r2.c180 int histo[]) {
211 ++histo[(uint8_t)(temp2 >> 16)];
212 ++histo[(uint8_t)temp2];
215 ++histo[TransformColorBlue(green_to_blue, red_to_blue, *p_argb)];
233 int histo[]) {
256 ++histo[(uint8_t)(temp2 >> 16)];
257 ++histo[(uint8_t)temp2];
260 ++histo[TransformColorRed(green_to_red, *p_argb)];
174 CollectColorBlueTransforms_MIPSdspR2(const uint32_t* argb, int stride, int tile_width, int tile_height, int green_to_blue, int red_to_blue, int histo[]) argument
228 CollectColorRedTransforms_MIPSdspR2(const uint32_t* argb, int stride, int tile_width, int tile_height, int green_to_red, int histo[]) argument
H A Dlossless.h132 int green_to_blue, int red_to_blue, int histo[]);
138 int green_to_red, int histo[]);
147 int green_to_red, int histo[]);
151 int histo[]);
H A Dlossless_enc_sse2.c87 int histo[]) {
122 for (i = 0; i < SPAN; ++i) ++histo[values[i]];
130 green_to_blue, red_to_blue, histo);
137 int green_to_red, int histo[]) {
164 for (i = 0; i < SPAN; ++i) ++histo[values[i]];
172 green_to_red, histo);
84 CollectColorBlueTransforms_SSE2(const uint32_t* argb, int stride, int tile_width, int tile_height, int green_to_blue, int red_to_blue, int histo[]) argument
135 CollectColorRedTransforms_SSE2(const uint32_t* argb, int stride, int tile_width, int tile_height, int green_to_red, int histo[]) argument
/external/libcap/libcap/
H A Dcap_text.c330 int histo[8]; local
362 memset(histo, 0, sizeof(histo));
366 histo[getstateflags(caps, n)]++;
373 if (histo[t] >= histo[m])
380 histo[getstateflags(caps, n)]++;
389 if (t != m && histo[t]) {
/external/swiftshader/third_party/LLVM/utils/lit/lit/
H A DUtil.py111 histo = [set() for i in range(N)]
114 histo[bin].add(name)
133 for i,row in enumerate(histo):
/external/llvm/utils/lit/lit/
H A Dutil.py132 histo = [set() for i in range(N)]
135 histo[bin].add(name)
154 for i,row in enumerate(histo):
/external/valgrind/exp-dhat/
H A Ddh_main.c212 UInt* histo; /* [0 .. xsize-1] */ member in struct:__anon29298
245 // histo stuff
289 the access counts and histo data that have so far accumulated for
334 // histo stuff. First, do state transitions for xsize/xsize_tag.
340 tl_assert(!api->histo);
344 // and allocate the histo
346 api->histo = VG_(malloc)("dh.main.retire_Block.1",
348 VG_(memset)(api->histo, 0, api->xsize * sizeof(UInt));
359 // deallocate the histo, if any
360 if (api->histo) {
[all...]
/external/tensorflow/tensorflow/contrib/tensorboard/db/
H A Dsummary_converter.cc220 histogram::Histogram histo; local
230 histo.Add(double_val);
232 histo.EncodeToProto(v->mutable_histo(), false /* Drop zero buckets */);
H A Dsummary_db_writer.cc1137 TF_RETURN_WITH_CONTEXT_IF_ERROR(MigrateHistogram(e, s, now), "histo");
1177 const HistogramProto& histo = s->histo(); local
1178 int k = histo.bucket_size();
1179 if (k != histo.bucket_limit_size()) {
1186 double left_edge = ((i - 1 >= 0) ? histo.bucket_limit(i - 1)
1188 double right_edge = ((i + 1 < k) ? histo.bucket_limit(i + 1)
1192 data(i + 2) = histo.bucket(i);

Completed in 790 milliseconds

12