Home
last modified time | relevance | path

Searched refs:min_pos (Results 1 – 3 of 3) sorted by relevance

/external/freetype/src/autofit/
Daflatin.c1539 FT_Pos min_pos = 32000; in af_latin_hints_compute_segments() local
1552 FT_Pos prev_min_pos = min_pos; in af_latin_hints_compute_segments()
1593 if ( u < min_pos ) in af_latin_hints_compute_segments()
1594 min_pos = u; in af_latin_hints_compute_segments()
1633 segment->pos = (FT_Short)( ( min_pos + max_pos ) >> 1 ); in af_latin_hints_compute_segments()
1634 segment->delta = (FT_Short)( ( max_pos - min_pos ) >> 1 ); in af_latin_hints_compute_segments()
1648 prev_min_pos = min_pos; in af_latin_hints_compute_segments()
1672 if ( prev_min_pos < min_pos ) in af_latin_hints_compute_segments()
1673 min_pos = prev_min_pos; in af_latin_hints_compute_segments()
1694 prev_segment->pos = (FT_Short)( ( min_pos + in af_latin_hints_compute_segments()
[all …]
/external/libbrillo/brillo/streams/
Dfile_stream.cc404 const off64_t min_pos = 0; in GetPosition() local
405 return std::max(min_pos, pos); in GetPosition()
/external/webp/src/enc/
Dbackward_references_enc.c335 const int min_pos = in VP8LHashChainFill() local
362 if (best_length == MAX_LENGTH) pos = min_pos - 1; in VP8LHashChainFill()
366 for (; pos >= min_pos && --iter; pos = chain[pos]) { in VP8LHashChainFill()