Lines Matching defs:min_incl
1724 uint32_t min_incl;
1743 ret.min_incl = 0;
1749 wuffs_base__make_range_ii_u32(uint32_t min_incl, uint32_t max_incl) {
1751 ret.min_incl = min_incl;
1758 return r->min_incl > r->max_incl;
1764 return (r->min_incl == s.min_incl && r->max_incl == s.max_incl) ||
1773 t.min_incl = wuffs_base__u32__max(r->min_incl, s.min_incl);
1788 t.min_incl = wuffs_base__u32__min(r->min_incl, s.min_incl);
1796 return (r->min_incl <= x) && (x <= r->max_incl);
1843 uint32_t min_incl;
1863 ret.min_incl = 0;
1869 wuffs_base__make_range_ie_u32(uint32_t min_incl, uint32_t max_excl) {
1871 ret.min_incl = min_incl;
1878 return r->min_incl >= r->max_excl;
1884 return (r->min_incl == s.min_incl && r->max_excl == s.max_excl) ||
1893 t.min_incl = wuffs_base__u32__max(r->min_incl, s.min_incl);
1908 t.min_incl = wuffs_base__u32__min(r->min_incl, s.min_incl);
1916 return (r->min_incl <= x) && (x < r->max_excl);
1928 return wuffs_base__u32__sat_sub(r->max_excl, r->min_incl);
1973 uint64_t min_incl;
1992 ret.min_incl = 0;
1998 wuffs_base__make_range_ii_u64(uint64_t min_incl, uint64_t max_incl) {
2000 ret.min_incl = min_incl;
2007 return r->min_incl > r->max_incl;
2013 return (r->min_incl == s.min_incl && r->max_incl == s.max_incl) ||
2022 t.min_incl = wuffs_base__u64__max(r->min_incl, s.min_incl);
2037 t.min_incl = wuffs_base__u64__min(r->min_incl, s.min_incl);
2045 return (r->min_incl <= x) && (x <= r->max_incl);
2092 uint64_t min_incl;
2112 ret.min_incl = 0;
2118 wuffs_base__make_range_ie_u64(uint64_t min_incl, uint64_t max_excl) {
2120 ret.min_incl = min_incl;
2127 return r->min_incl >= r->max_excl;
2133 return (r->min_incl == s.min_incl && r->max_excl == s.max_excl) ||
2142 t.min_incl = wuffs_base__u64__max(r->min_incl, s.min_incl);
2157 t.min_incl = wuffs_base__u64__min(r->min_incl, s.min_incl);
2165 return (r->min_incl <= x) && (x < r->max_excl);
2177 return wuffs_base__u64__sat_sub(r->max_excl, r->min_incl);
2593 ret.min_incl = m->y;
2616 ret.min_incl = m->y;
2625 ret.min_incl = m->y;
10377 // grow ensures that the byte array size is at least min_incl and at most
10379 // allocating more than max_incl bytes, including the case where (min_incl >
10381 GrowResult grow(uint64_t min_incl);
10388 static uint64_t round_up(uint64_t min_incl, uint64_t max_incl);
10673 // should be at least len_range.min_incl, but larger allocations (up to
11205 return r->min_incl;
11215 return r->min_incl;
11225 return r->min_incl;
11235 return r->min_incl;
43984 DynIOBuffer::grow(uint64_t min_incl) {
43985 uint64_t n = round_up(min_incl, m_max_incl);
43987 return ((min_incl == 0) && (m_max_incl == 0))
44001 // round_up rounds min_incl up, returning the smallest value x satisfying
44002 // (min_incl <= x) and (x <= max_incl) and some other constraints. It returns 0
44012 DynIOBuffer::round_up(uint64_t min_incl, uint64_t max_incl) {
44013 if (min_incl > max_incl) {
44020 while (n < min_incl) {
44202 if (io_buf.reader_position() > r.min_incl) {
44206 AdvanceIOBufferTo(error_messages, input, io_buf, r.min_incl);
44967 uint64_t pos = minfo.io_redirect__range().min_incl;
45101 } else if (alloc_workbuf_result.workbuf.len < workbuf_len.min_incl) {