Home
last modified time | relevance | path

Searched refs:max_pos (Results 1 – 8 of 8) sorted by relevance

/external/brotli/research/
Ddraw_histogram.cc81 int max_pos = FLAGS_size - skip; in BuildHistogram() local
94 if (pos >= max_pos) break; in BuildHistogram()
99 y = 1ul * pos * width / max_pos; in BuildHistogram()
101 printf("pos = %d, max_pos = %d, y = %d\n", pos, max_pos, y); in BuildHistogram()
106 int right = 1ul * (pos + copy - 1) * width / max_pos; in BuildHistogram()
115 int pos2 = static_cast<int>(ceil(1.0 * (y + 1) * max_pos / width)); in BuildHistogram()
118 histo[x][i] += max_pos / width; // Sometimes 1 more, but who cares. in BuildHistogram()
122 pos2 = static_cast<int>(ceil(1.0 * right * max_pos / width)); in BuildHistogram()
/external/webp/src/dsp/
Dfilters_sse2.c38 const int max_pos = length & ~31; in PredictLineTop_SSE2() local
40 for (i = 0; i < max_pos; i += 32) { in PredictLineTop_SSE2()
56 const int max_pos = length & ~31; in PredictLineLeft_SSE2() local
58 for (i = 0; i < max_pos; i += 32) { in PredictLineLeft_SSE2()
148 const int max_pos = length & ~7; in GradientPredictDirect_SSE2() local
151 for (i = 0; i < max_pos; i += 8) { in GradientPredictDirect_SSE2()
251 const int max_pos = width & ~31; in VerticalUnfilter_SSE2() local
253 for (i = 0; i < max_pos; i += 32) { in VerticalUnfilter_SSE2()
272 const int max_pos = length & ~7; in GradientPredictInverse_SSE2() local
275 for (i = 0; i < max_pos; i += 8) { in GradientPredictInverse_SSE2()
/external/perfetto/src/trace_processor/containers/
Dstring_pool.cc101 size_t max_pos = static_cast<size_t>(pos_) + str_size + kMaxMetadataSize; in TryInsert() local
102 if (max_pos > size_) in TryInsert()
106 mem_.EnsureCommitted(max_pos); in TryInsert()
/external/pdfium/core/fxcodec/fax/
Dfaxmodule.cpp47 int FindBit(const uint8_t* data_buf, int max_pos, int start_pos, bool bit) { in FindBit() argument
49 if (start_pos >= max_pos) in FindBit()
50 return max_pos; in FindBit()
63 const int max_byte = (max_pos + 7) / 8; in FindBit()
83 return std::min(byte_pos * 8 + OneLeadPos[data], max_pos); in FindBit()
87 return max_pos; in FindBit()
/external/freetype/src/autofit/
Daflatin.c1599 FT_Pos max_pos = -32000; in af_latin_hints_compute_segments() local
1612 FT_Pos prev_max_pos = max_pos; in af_latin_hints_compute_segments()
1654 if ( u > max_pos ) in af_latin_hints_compute_segments()
1655 max_pos = u; in af_latin_hints_compute_segments()
1692 segment->pos = (FT_Short)( ( min_pos + max_pos ) >> 1 ); in af_latin_hints_compute_segments()
1693 segment->delta = (FT_Short)( ( max_pos - min_pos ) >> 1 ); in af_latin_hints_compute_segments()
1708 prev_max_pos = max_pos; in af_latin_hints_compute_segments()
1733 if ( prev_max_pos > max_pos ) in af_latin_hints_compute_segments()
1734 max_pos = prev_max_pos; in af_latin_hints_compute_segments()
1754 max_pos ) >> 1 ); in af_latin_hints_compute_segments()
[all …]
/external/libaom/libaom/test/
Dcdef_test.cc76 const unsigned int max_pos = size * size >> static_cast<int>(depth == 8); in test_cdef() local
130 for (pos = 0; pos < max_pos && !error; pos++) { in test_cdef()
/external/python/cpython3/Tools/clinic/
Dclinic.py647 pos_only = min_pos = max_pos = min_kw_only = 0
652 min_kw_only = i - max_pos
654 max_pos = i
859 """ % (nargs, min_pos, max_pos), indent=4)]
915 """ % (min_pos, max_pos, min_kw_only), indent=4)]
935 """ % (min_pos, max_pos, min_kw_only), indent=4)]
948 if add_label and (i == pos_only or i == max_pos):
966 if i < max_pos:
971 first_opt = max_pos + min_kw_only
/external/freetype/
DChangeLog.272028 `max_pos' is always larger than `min_pos' so `FT_ABS' is not needed.