/src/curl/lib/bufq.c

Source
/***************************************************************************
 *                                  _   _ ____  _
 *  Project                     ___| | | |  _ \| |
 *                             / __| | | | |_) | |
 *                            | (__| |_| |  _ <| |___
 *                             \___|\___/|_| \_\_____|
 *
 * Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
 *
 * This software is licensed as described in the file COPYING, which
 * you should have received as part of this distribution. The terms
 * are also available at https://curl.se/docs/copyright.html.
 *
 * You may opt to use, copy, modify, merge, publish, distribute and/or sell
 * copies of the Software, and permit persons to whom the Software is
 * furnished to do so, under the terms of the COPYING file.
 *
 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
 * KIND, either express or implied.
 *
 * SPDX-License-Identifier: curl
 *
 ***************************************************************************/
#include "curl_setup.h"

#include "bufq.h"

static bool chunk_is_empty(const struct buf_chunk *chunk)
{
  return chunk->r_offset >= chunk->w_offset;
}

static bool chunk_is_full(const struct buf_chunk *chunk)
{
  return chunk->w_offset >= chunk->dlen;
}

static size_t chunk_len(const struct buf_chunk *chunk)
{
  return chunk->w_offset - chunk->r_offset;
}

static void chunk_reset(struct buf_chunk *chunk)
{
  chunk->next = NULL;
  chunk->r_offset = chunk->w_offset = 0;
}

static size_t chunk_append(struct buf_chunk *chunk,
                           const uint8_t *buf, size_t len)
{
  uint8_t *p = &chunk->x.data[chunk->w_offset];
  size_t n = chunk->dlen - chunk->w_offset;
  DEBUGASSERT(chunk->dlen >= chunk->w_offset);
  if(n) {
    n = CURLMIN(n, len);
    memcpy(p, buf, n);
    chunk->w_offset += n;
  }
  return n;
}

static size_t chunk_read(struct buf_chunk *chunk,
                         uint8_t *buf, size_t len)
{
  uint8_t *p = &chunk->x.data[chunk->r_offset];
  size_t n = chunk->w_offset - chunk->r_offset;
  DEBUGASSERT(chunk->w_offset >= chunk->r_offset);
  if(!n) {
    return 0;
  }
  else if(n <= len) {
    memcpy(buf, p, n);
    chunk->r_offset = chunk->w_offset = 0;
    return n;
  }
  else {
    memcpy(buf, p, len);
    chunk->r_offset += len;
    return len;
  }
}

static CURLcode chunk_slurpn(struct buf_chunk *chunk, size_t max_len,
                             Curl_bufq_reader *reader,
                             void *reader_ctx, size_t *pnread)
{
  uint8_t *p = &chunk->x.data[chunk->w_offset];
  size_t n = chunk->dlen - chunk->w_offset; /* free amount */
  CURLcode result;

  *pnread = 0;
  DEBUGASSERT(chunk->dlen >= chunk->w_offset);
  if(!n)
    return CURLE_AGAIN;
  if(max_len && n > max_len)
    n = max_len;
  result = reader(reader_ctx, p, n, pnread);
  if(!result) {
    DEBUGASSERT(*pnread <= n);
    chunk->w_offset += *pnread;
  }
  return result;
}

static void chunk_peek(const struct buf_chunk *chunk,
                       const uint8_t **pbuf, size_t *plen)
{
  DEBUGASSERT(chunk->w_offset >= chunk->r_offset);
  *pbuf = &chunk->x.data[chunk->r_offset];
  *plen = chunk->w_offset - chunk->r_offset;
}

static void chunk_peek_at(const struct buf_chunk *chunk, size_t offset,
                          const uint8_t **pbuf, size_t *plen)
{
  offset += chunk->r_offset;
  DEBUGASSERT(chunk->w_offset >= offset);
  *pbuf = &chunk->x.data[offset];
  *plen = chunk->w_offset - offset;
}

static size_t chunk_skip(struct buf_chunk *chunk, size_t amount)
{
  size_t n = chunk->w_offset - chunk->r_offset;
  DEBUGASSERT(chunk->w_offset >= chunk->r_offset);
  if(n) {
    n = CURLMIN(n, amount);
    chunk->r_offset += n;
    if(chunk->r_offset == chunk->w_offset)
      chunk->r_offset = chunk->w_offset = 0;
  }
  return n;
}

static void chunk_list_free(struct buf_chunk **anchor)
{
  struct buf_chunk *chunk;
  while(*anchor) {
    chunk = *anchor;
    *anchor = chunk->next;
    curlx_free(chunk);
  }
}

void Curl_bufcp_init(struct bufc_pool *pool,
                     size_t chunk_size, size_t spare_max)
{
  DEBUGASSERT(chunk_size > 0);
  DEBUGASSERT(spare_max > 0);
  memset(pool, 0, sizeof(*pool));
  pool->chunk_size = chunk_size;
  pool->spare_max = spare_max;
}

static CURLcode bufcp_take(struct bufc_pool *pool,
                           struct buf_chunk **pchunk)
{
  struct buf_chunk *chunk = NULL;

  if(pool->spare) {
    chunk = pool->spare;
    pool->spare = chunk->next;
    --pool->spare_count;
    chunk_reset(chunk);
    *pchunk = chunk;
    return CURLE_OK;
  }

  /* Check for integer overflow before allocation */
  if(pool->chunk_size > SIZE_MAX - sizeof(*chunk)) {
    *pchunk = NULL;
    return CURLE_OUT_OF_MEMORY;
  }

  chunk = curlx_calloc(1, sizeof(*chunk) + pool->chunk_size);
  if(!chunk) {
    *pchunk = NULL;
    return CURLE_OUT_OF_MEMORY;
  }
  chunk->dlen = pool->chunk_size;
  *pchunk = chunk;
  return CURLE_OK;
}

static void bufcp_put(struct bufc_pool *pool,
                      struct buf_chunk *chunk)
{
  if(pool->spare_count >= pool->spare_max) {
    curlx_free(chunk);
  }
  else {
    chunk_reset(chunk);
    chunk->next = pool->spare;
    pool->spare = chunk;
    ++pool->spare_count;
  }
}

void Curl_bufcp_free(struct bufc_pool *pool)
{
  chunk_list_free(&pool->spare);
  pool->spare_count = 0;
}

static void bufq_init(struct bufq *q, struct bufc_pool *pool,
                      size_t chunk_size, size_t max_chunks, int opts)
{
  DEBUGASSERT(chunk_size > 0);
  DEBUGASSERT(max_chunks > 0);
  memset(q, 0, sizeof(*q));
  q->chunk_size = chunk_size;
  q->max_chunks = max_chunks;
  q->pool = pool;
  q->opts = opts;
}

void Curl_bufq_init2(struct bufq *q, size_t chunk_size, size_t max_chunks,
                     int opts)
{
  bufq_init(q, NULL, chunk_size, max_chunks, opts);
}

void Curl_bufq_init(struct bufq *q, size_t chunk_size, size_t max_chunks)
{
  bufq_init(q, NULL, chunk_size, max_chunks, BUFQ_OPT_NONE);
}

void Curl_bufq_initp(struct bufq *q, struct bufc_pool *pool,
                     size_t max_chunks, int opts)
{
  bufq_init(q, pool, pool->chunk_size, max_chunks, opts);
}

void Curl_bufq_free(struct bufq *q)
{
  chunk_list_free(&q->head);
  chunk_list_free(&q->spare);
  q->tail = NULL;
  q->chunk_count = 0;
}

void Curl_bufq_reset(struct bufq *q)
{
  struct buf_chunk *chunk;
  while(q->head) {
    chunk = q->head;
    q->head = chunk->next;
    chunk->next = q->spare;
    q->spare = chunk;
  }
  q->tail = NULL;
}

size_t Curl_bufq_len(const struct bufq *q)
{
  const struct buf_chunk *chunk = q->head;
  size_t len = 0;
  while(chunk) {
    len += chunk_len(chunk);
    chunk = chunk->next;
  }
  return len;
}

bool Curl_bufq_is_empty(const struct bufq *q)
{
  return !q->head || chunk_is_empty(q->head);
}

bool Curl_bufq_is_full(const struct bufq *q)
{
  if(!q->tail || q->spare)
    return FALSE;
  if(q->chunk_count < q->max_chunks)
    return FALSE;
  if(q->chunk_count > q->max_chunks)
    return TRUE;
  /* we have no spares and cannot make more, is the tail full? */
  return chunk_is_full(q->tail);
}

static struct buf_chunk *get_spare(struct bufq *q)
{
  struct buf_chunk *chunk = NULL;

  if(q->spare) {
    chunk = q->spare;
    q->spare = chunk->next;
    chunk_reset(chunk);
    return chunk;
  }

  if(q->chunk_count >= q->max_chunks && (!(q->opts & BUFQ_OPT_SOFT_LIMIT)))
    return NULL;

  if(q->pool) {
    if(bufcp_take(q->pool, &chunk))
      return NULL;
    ++q->chunk_count;
    return chunk;
  }
  else {
    /* Check for integer overflow before allocation */
    if(q->chunk_size > SIZE_MAX - sizeof(*chunk)) {
      return NULL;
    }

    chunk = curlx_calloc(1, sizeof(*chunk) + q->chunk_size);
    if(!chunk)
      return NULL;
    chunk->dlen = q->chunk_size;
    ++q->chunk_count;
    return chunk;
  }
}

static void prune_head(struct bufq *q)
{
  struct buf_chunk *chunk;

  while(q->head && chunk_is_empty(q->head)) {
    chunk = q->head;
    q->head = chunk->next;
    if(q->tail == chunk)
      q->tail = q->head;
    if(q->pool) {
      bufcp_put(q->pool, chunk);
      --q->chunk_count;
    }
    else if((q->chunk_count > q->max_chunks) ||
            (q->opts & BUFQ_OPT_NO_SPARES)) {
      /* SOFT_LIMIT allowed us more than max. free spares until
       * we are at max again. Or free them if we are configured
       * to not use spares. */
      curlx_free(chunk);
      --q->chunk_count;
    }
    else {
      chunk->next = q->spare;
      q->spare = chunk;
    }
  }
}

static struct buf_chunk *get_non_full_tail(struct bufq *q)
{
  struct buf_chunk *chunk;

  if(q->tail && !chunk_is_full(q->tail))
    return q->tail;
  chunk = get_spare(q);
  if(chunk) {
    /* new tail, and possibly new head */
    if(q->tail) {
      q->tail->next = chunk;
      q->tail = chunk;
    }
    else {
      DEBUGASSERT(!q->head);
      q->head = q->tail = chunk;
    }
  }
  return chunk;
}

CURLcode Curl_bufq_write(struct bufq *q,
                         const uint8_t *buf, size_t len,
                         size_t *pnwritten)
{
  struct buf_chunk *tail;
  size_t n;

  DEBUGASSERT(q->max_chunks > 0);
  *pnwritten = 0;
  while(len) {
    tail = get_non_full_tail(q);
    if(!tail) {
      if((q->chunk_count < q->max_chunks) || (q->opts & BUFQ_OPT_SOFT_LIMIT))
        /* should have gotten a tail, but did not */
        return CURLE_OUT_OF_MEMORY;
      break;
    }
    n = chunk_append(tail, buf, len);
    if(!n)
      break;
    *pnwritten += n;
    buf += n;
    len -= n;
  }
  return (!*pnwritten && len) ? CURLE_AGAIN : CURLE_OK;
}

CURLcode Curl_bufq_cwrite(struct bufq *q,
                          const char *buf, size_t len,
                          size_t *pnwritten)
{
  return Curl_bufq_write(q, (const uint8_t *)buf, len, pnwritten);
}

CURLcode Curl_bufq_read(struct bufq *q, uint8_t *buf, size_t len,
                        size_t *pnread)
{
  *pnread = 0;
  while(len && q->head) {
    size_t n = chunk_read(q->head, buf, len);
    if(n) {
      *pnread += n;
      buf += n;
      len -= n;
    }
    prune_head(q);
  }
  return (!*pnread) ? CURLE_AGAIN : CURLE_OK;
}

CURLcode Curl_bufq_cread(struct bufq *q, char *buf, size_t len,
                         size_t *pnread)
{
  return Curl_bufq_read(q, (uint8_t *)buf, len, pnread);
}

bool Curl_bufq_peek(struct bufq *q,
                    const uint8_t **pbuf, size_t *plen)
{
  if(q->head && chunk_is_empty(q->head)) {
    prune_head(q);
  }
  if(q->head && !chunk_is_empty(q->head)) {
    chunk_peek(q->head, pbuf, plen);
    return TRUE;
  }
  *pbuf = NULL;
  *plen = 0;
  return FALSE;
}

bool Curl_bufq_peek_at(struct bufq *q, size_t offset,
                       const uint8_t **pbuf, size_t *plen)
{
  struct buf_chunk *c = q->head;
  size_t clen;

  while(c) {
    clen = chunk_len(c);
    if(!clen)
      break;
    if(offset >= clen) {
      offset -= clen;
      c = c->next;
      continue;
    }
    chunk_peek_at(c, offset, pbuf, plen);
    return TRUE;
  }
  *pbuf = NULL;
  *plen = 0;
  return FALSE;
}

void Curl_bufq_skip(struct bufq *q, size_t amount)
{
  size_t n;

  while(amount && q->head) {
    n = chunk_skip(q->head, amount);
    amount -= n;
    prune_head(q);
  }
}

CURLcode Curl_bufq_pass(struct bufq *q, Curl_bufq_writer *writer,
                        void *writer_ctx, size_t *pwritten)
{
  const uint8_t *buf;
  size_t blen;
  CURLcode result = CURLE_OK;

  *pwritten = 0;
  while(Curl_bufq_peek(q, &buf, &blen)) {
    size_t chunk_written;

    result = writer(writer_ctx, buf, blen, &chunk_written);
    if(result) {
      if((result == CURLE_AGAIN) && *pwritten) {
        /* blocked on subsequent write, report success */
        result = CURLE_OK;
      }
      break;
    }
    if(!chunk_written) {
      if(!*pwritten) {
        /* treat as blocked */
        result = CURLE_AGAIN;
      }
      break;
    }
    *pwritten += chunk_written;
    Curl_bufq_skip(q, chunk_written);
  }
  return result;
}

CURLcode Curl_bufq_write_pass(struct bufq *q,
                              const uint8_t *buf, size_t len,
                              Curl_bufq_writer *writer, void *writer_ctx,
                              size_t *pwritten)
{
  CURLcode result = CURLE_OK;
  size_t n;

  *pwritten = 0;
  while(len) {
    if(Curl_bufq_is_full(q)) {
      /* try to make room in case we are full */
      result = Curl_bufq_pass(q, writer, writer_ctx, &n);
      if(result) {
        if(result != CURLE_AGAIN) {
          /* real error, fail */
          return result;
        }
        /* would block, bufq is full, give up */
        break;
      }
    }

    /* Add to bufq as much as there is room for */
    result = Curl_bufq_write(q, buf, len, &n);
    if(result) {
      if(result != CURLE_AGAIN)
        /* real error, fail */
        return result;
      /* result == CURLE_AGAIN */
      if(*pwritten)
        /* we did write successfully before */
        result = CURLE_OK;
      return result;
    }
    else if(n == 0)
      /* edge case of writer returning 0 (and len is >0)
       * break or we might enter an infinite loop here */
      break;

    /* Track what we added to bufq */
    buf += n;
    len -= n;
    *pwritten += n;
  }

  return (!*pwritten && len) ? CURLE_AGAIN : CURLE_OK;
}

CURLcode Curl_bufq_sipn(struct bufq *q, size_t max_len,
                        Curl_bufq_reader *reader, void *reader_ctx,
                        size_t *pnread)
{
  struct buf_chunk *tail = NULL;

  *pnread = 0;
  tail = get_non_full_tail(q);
  if(!tail) {
    if(q->chunk_count < q->max_chunks)
      return CURLE_OUT_OF_MEMORY;
    /* full, blocked */
    return CURLE_AGAIN;
  }

  return chunk_slurpn(tail, max_len, reader, reader_ctx, pnread);
}

/**
 * Read up to `max_len` bytes and append it to the end of the buffer queue.
 * if `max_len` is 0, no limit is imposed and the call behaves exactly
 * the same as `Curl_bufq_slurp()`.
 * Returns the total amount of buf read (may be 0) in `pnread` or error
 * Note that even in case of an error chunks may have been read and
 * the buffer queue will have different length than before.
 */
static CURLcode bufq_slurpn(struct bufq *q, size_t max_len,
                            Curl_bufq_reader *reader, void *reader_ctx,
                            size_t *pnread)
{
  CURLcode result;

  *pnread = 0;
  while(1) {
    size_t n;
    result = Curl_bufq_sipn(q, max_len, reader, reader_ctx, &n);
    if(result) {
      if(!*pnread || result != CURLE_AGAIN) {
        /* blocked on first read or real error, fail */
        return result;
      }
      result = CURLE_OK;
      break;
    }
    else if(n == 0) {
      /* eof, result remains CURLE_OK */
      break;
    }
    *pnread += n;
    if(max_len) {
      DEBUGASSERT(n <= max_len);
      max_len -= n;
      if(!max_len)
        break;
    }
    /* give up slurping when we get less bytes than we asked for */
    if(q->tail && !chunk_is_full(q->tail))
      break;
  }
  return result;
}

CURLcode Curl_bufq_slurp(struct bufq *q, Curl_bufq_reader *reader,
                         void *reader_ctx, size_t *pnread)
{
  return bufq_slurpn(q, 0, reader, reader_ctx, pnread);
}

Coverage Report

Created: 2026-10-22 06:49

Line	Count	Source
1		/***************************************************************************
2		* _ _ ____ _
3		* Project ___\| \| \| \| _ \\| \|
4		* / __\| \| \| \| \|_) \| \|
5		* \| (__\| \|_\| \| _ <\| \|___
6		* \___\|\___/\|_\| \_\_____\|
7		*
8		* Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
9		*
10		* This software is licensed as described in the file COPYING, which
11		* you should have received as part of this distribution. The terms
12		* are also available at https://curl.se/docs/copyright.html.
13		*
14		* You may opt to use, copy, modify, merge, publish, distribute and/or sell
15		* copies of the Software, and permit persons to whom the Software is
16		* furnished to do so, under the terms of the COPYING file.
17		*
18		* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
19		* KIND, either express or implied.
20		*
21		* SPDX-License-Identifier: curl
22		*
23		***************************************************************************/
24		#include "curl_setup.h"
25
26		#include "bufq.h"
27
28		static bool chunk_is_empty(const struct buf_chunk *chunk)
29	167k	{
30	167k	return chunk->r_offset >= chunk->w_offset;
31	167k	}
32
33		static bool chunk_is_full(const struct buf_chunk *chunk)
34	143k	{
35	143k	return chunk->w_offset >= chunk->dlen;
36	143k	}
37
38		static size_t chunk_len(const struct buf_chunk *chunk)
39	7.02k	{
40	7.02k	return chunk->w_offset - chunk->r_offset;
41	7.02k	}
42
43		static void chunk_reset(struct buf_chunk *chunk)
44	39.6k	{
45	39.6k	chunk->next = NULL;
46	39.6k	chunk->r_offset = chunk->w_offset = 0;
47	39.6k	}
48
49		static size_t chunk_append(struct buf_chunk *chunk,
50		const uint8_t *buf, size_t len)
51	133k	{
52	133k	uint8_t *p = &chunk->x.data[chunk->w_offset];
53	133k	size_t n = chunk->dlen - chunk->w_offset;
54	133k	DEBUGASSERT(chunk->dlen >= chunk->w_offset);
55	133k	if(n) {
56	133k	n = CURLMIN(n, len);
57	133k	memcpy(p, buf, n);
58	133k	chunk->w_offset += n;
59	133k	}
60	133k	return n;
61	133k	}
62
63		static size_t chunk_read(struct buf_chunk *chunk,
64		uint8_t *buf, size_t len)
65	3.05k	{
66	3.05k	uint8_t *p = &chunk->x.data[chunk->r_offset];
67	3.05k	size_t n = chunk->w_offset - chunk->r_offset;
68	3.05k	DEBUGASSERT(chunk->w_offset >= chunk->r_offset);
69	3.05k	if(!n) {
70	0	return 0;
71	0	}
72	3.05k	else if(n <= len) {
73	2.83k	memcpy(buf, p, n);
74	2.83k	chunk->r_offset = chunk->w_offset = 0;
75	2.83k	return n;
76	2.83k	}
77	224	else {
78	224	memcpy(buf, p, len);
79	224	chunk->r_offset += len;
80	224	return len;
81	224	}
82	3.05k	}
83
84		static CURLcode chunk_slurpn(struct buf_chunk *chunk, size_t max_len,
85		Curl_bufq_reader *reader,
86		void reader_ctx, size_t pnread)
87	19.8k	{
88	19.8k	uint8_t *p = &chunk->x.data[chunk->w_offset];
89	19.8k	size_t n = chunk->dlen - chunk->w_offset; /* free amount */
90	19.8k	CURLcode result;
91
92	19.8k	*pnread = 0;
93	19.8k	DEBUGASSERT(chunk->dlen >= chunk->w_offset);
94	19.8k	if(!n)
95	0	return CURLE_AGAIN;
96	19.8k	if(max_len && n > max_len)
97	507	n = max_len;
98	19.8k	result = reader(reader_ctx, p, n, pnread);
99	19.8k	if(!result) {
100	13.1k	DEBUGASSERT(*pnread <= n);
101	13.1k	chunk->w_offset += *pnread;
102	13.1k	}
103	19.8k	return result;
104	19.8k	}
105
106		static void chunk_peek(const struct buf_chunk *chunk,
107		const uint8_t *pbuf, size_t plen)
108	32.2k	{
109	32.2k	DEBUGASSERT(chunk->w_offset >= chunk->r_offset);
110	32.2k	*pbuf = &chunk->x.data[chunk->r_offset];
111	32.2k	*plen = chunk->w_offset - chunk->r_offset;
112	32.2k	}
113
114		static void chunk_peek_at(const struct buf_chunk *chunk, size_t offset,
115		const uint8_t *pbuf, size_t plen)
116	0	{
117	0	offset += chunk->r_offset;
118	0	DEBUGASSERT(chunk->w_offset >= offset);
119	0	*pbuf = &chunk->x.data[offset];
120	0	*plen = chunk->w_offset - offset;
121	0	}
122
123		static size_t chunk_skip(struct buf_chunk *chunk, size_t amount)
124	30.7k	{
125	30.7k	size_t n = chunk->w_offset - chunk->r_offset;
126	30.7k	DEBUGASSERT(chunk->w_offset >= chunk->r_offset);
127	30.7k	if(n) {
128	30.7k	n = CURLMIN(n, amount);
129	30.7k	chunk->r_offset += n;
130	30.7k	if(chunk->r_offset == chunk->w_offset)
131	30.5k	chunk->r_offset = chunk->w_offset = 0;
132	30.7k	}
133	30.7k	return n;
134	30.7k	}
135
136		static void chunk_list_free(struct buf_chunk **anchor)
137	85.0k	{
138	85.0k	struct buf_chunk *chunk;
139	97.7k	while(*anchor) {
140	12.7k	chunk = *anchor;
141	12.7k	*anchor = chunk->next;
142	12.7k	curlx_free(chunk);
143	12.7k	}
144	85.0k	}
145
146		void Curl_bufcp_init(struct bufc_pool *pool,
147		size_t chunk_size, size_t spare_max)
148	3.58k	{
149	3.58k	DEBUGASSERT(chunk_size > 0);
150	3.58k	DEBUGASSERT(spare_max > 0);
151	3.58k	memset(pool, 0, sizeof(*pool));
152	3.58k	pool->chunk_size = chunk_size;
153	3.58k	pool->spare_max = spare_max;
154	3.58k	}
155
156		static CURLcode bufcp_take(struct bufc_pool *pool,
157		struct buf_chunk **pchunk)
158	22.8k	{
159	22.8k	struct buf_chunk *chunk = NULL;
160
161	22.8k	if(pool->spare) {
162	15.1k	chunk = pool->spare;
163	15.1k	pool->spare = chunk->next;
164	15.1k	--pool->spare_count;
165	15.1k	chunk_reset(chunk);
166	15.1k	*pchunk = chunk;
167	15.1k	return CURLE_OK;
168	15.1k	}
169
170		/* Check for integer overflow before allocation */
171	7.69k	if(pool->chunk_size > SIZE_MAX - sizeof(*chunk)) {
172	0	*pchunk = NULL;
173	0	return CURLE_OUT_OF_MEMORY;
174	0	}
175
176	7.69k	chunk = curlx_calloc(1, sizeof(*chunk) + pool->chunk_size);
177	7.69k	if(!chunk) {
178	0	*pchunk = NULL;
179	0	return CURLE_OUT_OF_MEMORY;
180	0	}
181	7.69k	chunk->dlen = pool->chunk_size;
182	7.69k	*pchunk = chunk;
183	7.69k	return CURLE_OK;
184	7.69k	}
185
186		static void bufcp_put(struct bufc_pool *pool,
187		struct buf_chunk *chunk)
188	19.3k	{
189	19.3k	if(pool->spare_count >= pool->spare_max) {
190	0	curlx_free(chunk);
191	0	}
192	19.3k	else {
193	19.3k	chunk_reset(chunk);
194	19.3k	chunk->next = pool->spare;
195	19.3k	pool->spare = chunk;
196	19.3k	++pool->spare_count;
197	19.3k	}
198	19.3k	}
199
200		void Curl_bufcp_free(struct bufc_pool *pool)
201	3.58k	{
202	3.58k	chunk_list_free(&pool->spare);
203	3.58k	pool->spare_count = 0;
204	3.58k	}
205
206		static void bufq_init(struct bufq q, struct bufc_pool pool,
207		size_t chunk_size, size_t max_chunks, int opts)
208	40.7k	{
209	40.7k	DEBUGASSERT(chunk_size > 0);
210	40.7k	DEBUGASSERT(max_chunks > 0);
211	40.7k	memset(q, 0, sizeof(*q));
212	40.7k	q->chunk_size = chunk_size;
213	40.7k	q->max_chunks = max_chunks;
214	40.7k	q->pool = pool;
215	40.7k	q->opts = opts;
216	40.7k	}
217
218		void Curl_bufq_init2(struct bufq *q, size_t chunk_size, size_t max_chunks,
219		int opts)
220	28.1k	{
221	28.1k	bufq_init(q, NULL, chunk_size, max_chunks, opts);
222	28.1k	}
223
224		void Curl_bufq_init(struct bufq *q, size_t chunk_size, size_t max_chunks)
225	0	{
226	0	bufq_init(q, NULL, chunk_size, max_chunks, BUFQ_OPT_NONE);
227	0	}
228
229		void Curl_bufq_initp(struct bufq q, struct bufc_pool pool,
230		size_t max_chunks, int opts)
231	12.5k	{
232	12.5k	bufq_init(q, pool, pool->chunk_size, max_chunks, opts);
233	12.5k	}
234
235		void Curl_bufq_free(struct bufq *q)
236	40.7k	{
237	40.7k	chunk_list_free(&q->head);
238	40.7k	chunk_list_free(&q->spare);
239	40.7k	q->tail = NULL;
240	40.7k	q->chunk_count = 0;
241	40.7k	}
242
243		void Curl_bufq_reset(struct bufq *q)
244	26.4k	{
245	26.4k	struct buf_chunk *chunk;
246	27.6k	while(q->head) {
247	1.26k	chunk = q->head;
248	1.26k	q->head = chunk->next;
249	1.26k	chunk->next = q->spare;
250	1.26k	q->spare = chunk;
251	1.26k	}
252	26.4k	q->tail = NULL;
253	26.4k	}
254
255		size_t Curl_bufq_len(const struct bufq *q)
256	6.68k	{
257	6.68k	const struct buf_chunk *chunk = q->head;
258	6.68k	size_t len = 0;
259	13.7k	while(chunk) {
260	7.02k	len += chunk_len(chunk);
261	7.02k	chunk = chunk->next;
262	7.02k	}
263	6.68k	return len;
264	6.68k	}
265
266		bool Curl_bufq_is_empty(const struct bufq *q)
267	237k	{
268	237k	return !q->head \|\| chunk_is_empty(q->head);
269	237k	}
270
271		bool Curl_bufq_is_full(const struct bufq *q)
272	30.5k	{
273	30.5k	if(!q->tail \|\| q->spare)
274	8.51k	return FALSE;
275	22.0k	if(q->chunk_count < q->max_chunks)
276	0	return FALSE;
277	22.0k	if(q->chunk_count > q->max_chunks)
278	1.35k	return TRUE;
279		/* we have no spares and cannot make more, is the tail full? */
280	20.7k	return chunk_is_full(q->tail);
281	22.0k	}
282
283		static struct buf_chunk get_spare(struct bufq q)
284	39.2k	{
285	39.2k	struct buf_chunk *chunk = NULL;
286
287	39.2k	if(q->spare) {
288	5.10k	chunk = q->spare;
289	5.10k	q->spare = chunk->next;
290	5.10k	chunk_reset(chunk);
291	5.10k	return chunk;
292	5.10k	}
293
294	34.1k	if(q->chunk_count >= q->max_chunks && (!(q->opts & BUFQ_OPT_SOFT_LIMIT)))
295	489	return NULL;
296
297	33.6k	if(q->pool) {
298	22.8k	if(bufcp_take(q->pool, &chunk))
299	0	return NULL;
300	22.8k	++q->chunk_count;
301	22.8k	return chunk;
302	22.8k	}
303	10.7k	else {
304		/* Check for integer overflow before allocation */
305	10.7k	if(q->chunk_size > SIZE_MAX - sizeof(*chunk)) {
306	0	return NULL;
307	0	}
308
309	10.7k	chunk = curlx_calloc(1, sizeof(*chunk) + q->chunk_size);
310	10.7k	if(!chunk)
311	0	return NULL;
312	10.7k	chunk->dlen = q->chunk_size;
313	10.7k	++q->chunk_count;
314	10.7k	return chunk;
315	10.7k	}
316	33.6k	}
317
318		static void prune_head(struct bufq *q)
319	33.8k	{
320	33.8k	struct buf_chunk *chunk;
321
322	67.2k	while(q->head && chunk_is_empty(q->head)) {
323	33.4k	chunk = q->head;
324	33.4k	q->head = chunk->next;
325	33.4k	if(q->tail == chunk)
326	27.6k	q->tail = q->head;
327	33.4k	if(q->pool) {
328	19.3k	bufcp_put(q->pool, chunk);
329	19.3k	--q->chunk_count;
330	19.3k	}
331	14.0k	else if((q->chunk_count > q->max_chunks) \|\|
332	8.32k	(q->opts & BUFQ_OPT_NO_SPARES)) {
333		/* SOFT_LIMIT allowed us more than max. free spares until
334		* we are at max again. Or free them if we are configured
335		* to not use spares. */
336	5.74k	curlx_free(chunk);
337	5.74k	--q->chunk_count;
338	5.74k	}
339	8.27k	else {
340	8.27k	chunk->next = q->spare;
341	8.27k	q->spare = chunk;
342	8.27k	}
343	33.4k	}
344	33.8k	}
345
346		static struct buf_chunk get_non_full_tail(struct bufq q)
347	154k	{
348	154k	struct buf_chunk *chunk;
349
350	154k	if(q->tail && !chunk_is_full(q->tail))
351	114k	return q->tail;
352	39.2k	chunk = get_spare(q);
353	39.2k	if(chunk) {
354		/* new tail, and possibly new head */
355	38.7k	if(q->tail) {
356	6.91k	q->tail->next = chunk;
357	6.91k	q->tail = chunk;
358	6.91k	}
359	31.8k	else {
360	31.8k	DEBUGASSERT(!q->head);
361	31.8k	q->head = q->tail = chunk;
362	31.8k	}
363	38.7k	}
364	39.2k	return chunk;
365	39.2k	}
366
367		CURLcode Curl_bufq_write(struct bufq *q,
368		const uint8_t *buf, size_t len,
369		size_t *pnwritten)
370	201k	{
371	201k	struct buf_chunk *tail;
372	201k	size_t n;
373
374	201k	DEBUGASSERT(q->max_chunks > 0);
375	201k	*pnwritten = 0;
376	335k	while(len) {
377	134k	tail = get_non_full_tail(q);
378	134k	if(!tail) {
379	489	if((q->chunk_count < q->max_chunks) \|\| (q->opts & BUFQ_OPT_SOFT_LIMIT))
380		/* should have gotten a tail, but did not */
381	0	return CURLE_OUT_OF_MEMORY;
382	489	break;
383	489	}
384	133k	n = chunk_append(tail, buf, len);
385	133k	if(!n)
386	0	break;
387	133k	*pnwritten += n;
388	133k	buf += n;
389	133k	len -= n;
390	133k	}
391	201k	return (!*pnwritten && len) ? CURLE_AGAIN : CURLE_OK;
392	201k	}
393
394		CURLcode Curl_bufq_cwrite(struct bufq *q,
395		const char *buf, size_t len,
396		size_t *pnwritten)
397	161k	{
398	161k	return Curl_bufq_write(q, (const uint8_t *)buf, len, pnwritten);
399	161k	}
400
401		CURLcode Curl_bufq_read(struct bufq q, uint8_t buf, size_t len,
402		size_t *pnread)
403	3.59k	{
404	3.59k	*pnread = 0;
405	6.64k	while(len && q->head) {
406	3.05k	size_t n = chunk_read(q->head, buf, len);
407	3.05k	if(n) {
408	3.05k	*pnread += n;
409	3.05k	buf += n;
410	3.05k	len -= n;
411	3.05k	}
412	3.05k	prune_head(q);
413	3.05k	}
414	3.59k	return (!*pnread) ? CURLE_AGAIN : CURLE_OK;
415	3.59k	}
416
417		CURLcode Curl_bufq_cread(struct bufq q, char buf, size_t len,
418		size_t *pnread)
419	1.40k	{
420	1.40k	return Curl_bufq_read(q, (uint8_t *)buf, len, pnread);
421	1.40k	}
422
423		bool Curl_bufq_peek(struct bufq *q,
424		const uint8_t *pbuf, size_t plen)
425	50.1k	{
426	50.1k	if(q->head && chunk_is_empty(q->head)) {
427	0	prune_head(q);
428	0	}
429	50.1k	if(q->head && !chunk_is_empty(q->head)) {
430	32.2k	chunk_peek(q->head, pbuf, plen);
431	32.2k	return TRUE;
432	32.2k	}
433	17.9k	*pbuf = NULL;
434	17.9k	*plen = 0;
435	17.9k	return FALSE;
436	50.1k	}
437
438		bool Curl_bufq_peek_at(struct bufq *q, size_t offset,
439		const uint8_t *pbuf, size_t plen)
440	0	{
441	0	struct buf_chunk *c = q->head;
442	0	size_t clen;
443
444	0	while(c) {
445	0	clen = chunk_len(c);
446	0	if(!clen)
447	0	break;
448	0	if(offset >= clen) {
449	0	offset -= clen;
450	0	c = c->next;
451	0	continue;
452	0	}
453	0	chunk_peek_at(c, offset, pbuf, plen);
454	0	return TRUE;
455	0	}
456	0	*pbuf = NULL;
457	0	*plen = 0;
458	0	return FALSE;
459	0	}
460
461		void Curl_bufq_skip(struct bufq *q, size_t amount)
462	31.4k	{
463	31.4k	size_t n;
464
465	62.2k	while(amount && q->head) {
466	30.7k	n = chunk_skip(q->head, amount);
467	30.7k	amount -= n;
468	30.7k	prune_head(q);
469	30.7k	}
470	31.4k	}
471
472		CURLcode Curl_bufq_pass(struct bufq q, Curl_bufq_writer writer,
473		void writer_ctx, size_t pwritten)
474	11.8k	{
475	11.8k	const uint8_t *buf;
476	11.8k	size_t blen;
477	11.8k	CURLcode result = CURLE_OK;
478
479	11.8k	*pwritten = 0;
480	23.1k	while(Curl_bufq_peek(q, &buf, &blen)) {
481	11.8k	size_t chunk_written;
482
483	11.8k	result = writer(writer_ctx, buf, blen, &chunk_written);
484	11.8k	if(result) {
485	449	if((result == CURLE_AGAIN) && *pwritten) {
486		/* blocked on subsequent write, report success */
487	0	result = CURLE_OK;
488	0	}
489	449	break;
490	449	}
491	11.3k	if(!chunk_written) {
492	0	if(!*pwritten) {
493		/* treat as blocked */
494	0	result = CURLE_AGAIN;
495	0	}
496	0	break;
497	0	}
498	11.3k	*pwritten += chunk_written;
499	11.3k	Curl_bufq_skip(q, chunk_written);
500	11.3k	}
501	11.8k	return result;
502	11.8k	}
503
504		CURLcode Curl_bufq_write_pass(struct bufq *q,
505		const uint8_t *buf, size_t len,
506		Curl_bufq_writer writer, void writer_ctx,
507		size_t *pwritten)
508	22.2k	{
509	22.2k	CURLcode result = CURLE_OK;
510	22.2k	size_t n;
511
512	22.2k	*pwritten = 0;
513	44.8k	while(len) {
514	22.5k	if(Curl_bufq_is_full(q)) {
515		/* try to make room in case we are full */
516	331	result = Curl_bufq_pass(q, writer, writer_ctx, &n);
517	331	if(result) {
518	0	if(result != CURLE_AGAIN) {
519		/* real error, fail */
520	0	return result;
521	0	}
522		/* would block, bufq is full, give up */
523	0	break;
524	0	}
525	331	}
526
527		/* Add to bufq as much as there is room for */
528	22.5k	result = Curl_bufq_write(q, buf, len, &n);
529	22.5k	if(result) {
530	0	if(result != CURLE_AGAIN)
531		/* real error, fail */
532	0	return result;
533		/* result == CURLE_AGAIN */
534	0	if(*pwritten)
535		/* we did write successfully before */
536	0	result = CURLE_OK;
537	0	return result;
538	0	}
539	22.5k	else if(n == 0)
540		/* edge case of writer returning 0 (and len is >0)
541		* break or we might enter an infinite loop here */
542	0	break;
543
544		/* Track what we added to bufq */
545	22.5k	buf += n;
546	22.5k	len -= n;
547	22.5k	*pwritten += n;
548	22.5k	}
549
550	22.2k	return (!*pwritten && len) ? CURLE_AGAIN : CURLE_OK;
551	22.2k	}
552
553		CURLcode Curl_bufq_sipn(struct bufq *q, size_t max_len,
554		Curl_bufq_reader reader, void reader_ctx,
555		size_t *pnread)
556	19.8k	{
557	19.8k	struct buf_chunk *tail = NULL;
558
559	19.8k	*pnread = 0;
560	19.8k	tail = get_non_full_tail(q);
561	19.8k	if(!tail) {
562	0	if(q->chunk_count < q->max_chunks)
563	0	return CURLE_OUT_OF_MEMORY;
564		/* full, blocked */
565	0	return CURLE_AGAIN;
566	0	}
567
568	19.8k	return chunk_slurpn(tail, max_len, reader, reader_ctx, pnread);
569	19.8k	}
570
571		/**
572		* Read up to `max_len` bytes and append it to the end of the buffer queue.
573		* if `max_len` is 0, no limit is imposed and the call behaves exactly
574		* the same as `Curl_bufq_slurp()`.
575		* Returns the total amount of buf read (may be 0) in `pnread` or error
576		* Note that even in case of an error chunks may have been read and
577		* the buffer queue will have different length than before.
578		*/
579		static CURLcode bufq_slurpn(struct bufq *q, size_t max_len,
580		Curl_bufq_reader reader, void reader_ctx,
581		size_t *pnread)
582	0	{
583	0	CURLcode result;
584
585	0	*pnread = 0;
586	0	while(1) {
587	0	size_t n;
588	0	result = Curl_bufq_sipn(q, max_len, reader, reader_ctx, &n);
589	0	if(result) {
590	0	if(!*pnread \|\| result != CURLE_AGAIN) {
591		/* blocked on first read or real error, fail */
592	0	return result;
593	0	}
594	0	result = CURLE_OK;
595	0	break;
596	0	}
597	0	else if(n == 0) {
598		/* eof, result remains CURLE_OK */
599	0	break;
600	0	}
601	0	*pnread += n;
602	0	if(max_len) {
603	0	DEBUGASSERT(n <= max_len);
604	0	max_len -= n;
605	0	if(!max_len)
606	0	break;
607	0	}
608		/* give up slurping when we get less bytes than we asked for */
609	0	if(q->tail && !chunk_is_full(q->tail))
610	0	break;
611	0	}
612	0	return result;
613	0	}
614
615		CURLcode Curl_bufq_slurp(struct bufq q, Curl_bufq_reader reader,
616		void reader_ctx, size_t pnread)
617	0	{
618	0	return bufq_slurpn(q, 0, reader, reader_ctx, pnread);
619	0	}