Lines Matching defs:len
64 size_t len() const { return last - pos; }
119 len(0),
128 len{std::exchange(other.len, 0)},
143 len = std::exchange(other.len, 0);
168 ++len;
187 len += n;
209 dest.append(m->pos, m->len());
212 return len;
228 auto n = std::min(static_cast<size_t>(last - first), m->len());
230 assert(m->len());
233 len -= n;
234 if (m->len() > 0) {
259 auto n = std::min(left, m->len());
261 assert(m->len());
264 len -= n;
266 if (m->len() > 0) {
287 auto n = len;
296 dest.len += len;
299 len = 0;
310 auto n = std::min(count, m->len());
313 len -= n;
314 if (m->len() > 0) {
332 auto n = std::min(count, m->len());
335 len -= n;
338 if (m->len() > 0) {
367 iov[i].iov_len = m->len();
381 iov[0].iov_len = mark->len() - (mark_pos - mark->pos);
395 iov[i].iov_len = m->len();
399 mark_offset += m->len();
404 size_t rleft() const { return len; }
405 size_t rleft_mark() const { return len - mark_offset; }
412 len = 0;
420 size_t len;
433 len(0),
441 len{std::exchange(other.len, 0)},
453 len = std::exchange(other.len, 0);
460 len += count;
466 len -= count;
470 if (count == 0 || len == 0) {
495 len -= n;
510 size_t rleft() const { return len; }
519 assert(len == memchunks.rleft());
521 len = memchunks.rleft();
531 len = 0;
539 // This is the length we have left unprocessed. len <=
541 size_t len;
626 size_t rleft() const { return chunk->len(); }