Coverage Report

Created: 2026-07-30 07:26

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/curl/lib/dynhds.c
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 "dynhds.h"
27
#include "strcase.h"
28
29
static struct dynhds_entry *entry_new(const char *name, size_t namelen,
30
                                      const char *value, size_t valuelen,
31
                                      int opts)
32
1.84M
{
33
1.84M
  struct dynhds_entry *e;
34
1.84M
  char *p;
35
36
1.84M
  DEBUGASSERT(name);
37
1.84M
  DEBUGASSERT(value);
38
1.84M
  e = curlx_calloc(1, sizeof(*e) + namelen + valuelen + 2);
39
1.84M
  if(!e)
40
0
    return NULL;
41
1.84M
  e->name = p = (char *)e + sizeof(*e);
42
1.84M
  memcpy(p, name, namelen);
43
1.84M
  e->namelen = namelen;
44
1.84M
  e->value = p += namelen + 1; /* leave a \0 at the end of name */
45
1.84M
  memcpy(p, value, valuelen);
46
1.84M
  e->valuelen = valuelen;
47
1.84M
  if(opts & DYNHDS_OPT_LOWERCASE)
48
849k
    Curl_strntolower(e->name, e->name, e->namelen);
49
1.84M
  return e;
50
1.84M
}
51
52
static void entry_free(struct dynhds_entry *e)
53
1.84M
{
54
1.84M
  curlx_free(e);
55
1.84M
}
56
57
void Curl_dynhds_init(struct dynhds *dynhds, size_t max_entries,
58
                      size_t max_strs_size)
59
109k
{
60
109k
  DEBUGASSERT(dynhds);
61
109k
  DEBUGASSERT(max_strs_size);
62
109k
  dynhds->hds = NULL;
63
109k
  dynhds->hds_len = dynhds->hds_allc = dynhds->strs_len = 0;
64
109k
  dynhds->max_entries = max_entries;
65
109k
  dynhds->max_strs_size = max_strs_size;
66
109k
  dynhds->opts = 0;
67
109k
}
68
69
void Curl_dynhds_free(struct dynhds *dynhds)
70
109k
{
71
109k
  DEBUGASSERT(dynhds);
72
109k
  if(dynhds->hds && dynhds->hds_len) {
73
54.4k
    size_t i;
74
54.4k
    DEBUGASSERT(dynhds->hds);
75
1.89M
    for(i = 0; i < dynhds->hds_len; ++i) {
76
1.84M
      entry_free(dynhds->hds[i]);
77
1.84M
    }
78
54.4k
  }
79
109k
  curlx_safefree(dynhds->hds);
80
109k
  dynhds->hds_len = dynhds->hds_allc = dynhds->strs_len = 0;
81
109k
}
82
83
void Curl_dynhds_reset(struct dynhds *dynhds)
84
19.2k
{
85
19.2k
  DEBUGASSERT(dynhds);
86
19.2k
  if(dynhds->hds_len) {
87
0
    size_t i;
88
0
    DEBUGASSERT(dynhds->hds);
89
0
    for(i = 0; i < dynhds->hds_len; ++i) {
90
0
      entry_free(dynhds->hds[i]);
91
0
      dynhds->hds[i] = NULL;
92
0
    }
93
0
  }
94
19.2k
  dynhds->hds_len = dynhds->strs_len = 0;
95
19.2k
}
96
97
size_t Curl_dynhds_count(struct dynhds *dynhds)
98
830k
{
99
830k
  return dynhds->hds_len;
100
830k
}
101
102
void Curl_dynhds_set_opts(struct dynhds *dynhds, int opts)
103
19.2k
{
104
19.2k
  dynhds->opts = opts;
105
19.2k
}
106
107
struct dynhds_entry *Curl_dynhds_getn(struct dynhds *dynhds, size_t n)
108
811k
{
109
811k
  DEBUGASSERT(dynhds);
110
811k
  return (n < dynhds->hds_len) ? dynhds->hds[n] : NULL;
111
811k
}
112
113
struct dynhds_entry *Curl_dynhds_get(struct dynhds *dynhds, const char *name,
114
                                     size_t namelen)
115
19.1k
{
116
19.1k
  size_t i;
117
40.4k
  for(i = 0; i < dynhds->hds_len; ++i) {
118
40.3k
    if(dynhds->hds[i]->namelen == namelen &&
119
21.4k
       curl_strnequal(dynhds->hds[i]->name, name, namelen)) {
120
19.1k
      return dynhds->hds[i];
121
19.1k
    }
122
40.3k
  }
123
59
  return NULL;
124
19.1k
}
125
126
struct dynhds_entry *Curl_dynhds_cget(struct dynhds *dynhds, const char *name)
127
0
{
128
0
  return Curl_dynhds_get(dynhds, name, strlen(name));
129
0
}
130
131
CURLcode Curl_dynhds_add(struct dynhds *dynhds,
132
                         const char *name, size_t namelen,
133
                         const char *value, size_t valuelen)
134
1.84M
{
135
1.84M
  struct dynhds_entry *entry = NULL;
136
1.84M
  CURLcode result = CURLE_OUT_OF_MEMORY;
137
138
1.84M
  DEBUGASSERT(dynhds);
139
1.84M
  if(dynhds->max_entries && dynhds->hds_len >= dynhds->max_entries)
140
0
    return CURLE_OUT_OF_MEMORY;
141
1.84M
  if(dynhds->strs_len + namelen + valuelen > dynhds->max_strs_size)
142
0
    return CURLE_OUT_OF_MEMORY;
143
144
1.84M
  entry = entry_new(name, namelen, value, valuelen, dynhds->opts);
145
1.84M
  if(!entry)
146
0
    goto out;
147
148
1.84M
  if(dynhds->hds_len + 1 >= dynhds->hds_allc) {
149
161k
    size_t nallc = dynhds->hds_len + 16;
150
161k
    struct dynhds_entry **nhds;
151
152
161k
    if(dynhds->max_entries && nallc > dynhds->max_entries)
153
0
      nallc = dynhds->max_entries;
154
155
161k
    nhds = curlx_calloc(nallc, sizeof(struct dynhds_entry *));
156
161k
    if(!nhds)
157
0
      goto out;
158
161k
    if(dynhds->hds) {
159
107k
      memcpy(nhds, dynhds->hds,
160
107k
             dynhds->hds_len * sizeof(struct dynhds_entry *));
161
107k
      curlx_safefree(dynhds->hds);
162
107k
    }
163
161k
    dynhds->hds = nhds;
164
161k
    dynhds->hds_allc = nallc;
165
161k
  }
166
1.84M
  dynhds->hds[dynhds->hds_len++] = entry;
167
1.84M
  entry = NULL;
168
1.84M
  dynhds->strs_len += namelen + valuelen;
169
1.84M
  result = CURLE_OK;
170
171
1.84M
out:
172
1.84M
  if(entry)
173
0
    entry_free(entry);
174
1.84M
  return result;
175
1.84M
}
176
177
CURLcode Curl_dynhds_cadd(struct dynhds *dynhds,
178
                          const char *name, const char *value)
179
36.8k
{
180
36.8k
  return Curl_dynhds_add(dynhds, name, strlen(name), value, strlen(value));
181
36.8k
}
182
183
CURLcode Curl_dynhds_h1_add_line(struct dynhds *dynhds,
184
                                 const char *line, size_t line_len)
185
819k
{
186
819k
  const char *p;
187
819k
  const char *name;
188
819k
  size_t namelen;
189
819k
  const char *value;
190
819k
  size_t valuelen, i;
191
192
819k
  if(!line || !line_len)
193
0
    return CURLE_OK;
194
195
819k
  p = memchr(line, ':', line_len);
196
819k
  if(!p)
197
40
    return CURLE_BAD_FUNCTION_ARGUMENT;
198
819k
  name = line;
199
819k
  namelen = p - line;
200
819k
  p++; /* move past the colon */
201
976k
  for(i = namelen + 1; i < line_len; ++i, ++p) {
202
777k
    if(!ISBLANK(*p))
203
620k
      break;
204
777k
  }
205
819k
  value = p;
206
819k
  valuelen = line_len - i;
207
208
819k
  p = memchr(value, '\r', valuelen);
209
819k
  if(!p)
210
774k
    p = memchr(value, '\n', valuelen);
211
819k
  if(p)
212
45.4k
    valuelen = (size_t)(p - value);
213
214
819k
  return Curl_dynhds_add(dynhds, name, namelen, value, valuelen);
215
819k
}
216
217
CURLcode Curl_dynhds_h1_cadd_line(struct dynhds *dynhds, const char *line)
218
6.38k
{
219
6.38k
  return Curl_dynhds_h1_add_line(dynhds, line, line ? strlen(line) : 0);
220
6.38k
}
221
222
#ifdef UNITTESTS
223
/* @unittest 2602 */
224
225
/**
226
 * Return TRUE iff one or more headers with the given name exist.
227
 */
228
UNITTEST bool dynhds_contains(struct dynhds *dynhds,
229
                              const char *name, size_t namelen);
230
UNITTEST bool dynhds_contains(struct dynhds *dynhds,
231
                              const char *name, size_t namelen)
232
0
{
233
0
  return !!Curl_dynhds_get(dynhds, name, namelen);
234
0
}
235
236
/* @unittest 2602 */
237
UNITTEST bool dynhds_ccontains(struct dynhds *dynhds, const char *name);
238
UNITTEST bool dynhds_ccontains(struct dynhds *dynhds, const char *name)
239
0
{
240
0
  return dynhds_contains(dynhds, name, strlen(name));
241
0
}
242
243
/**
244
 * Return how often the given name appears in `dynhds`.
245
 * Names are case-insensitive.
246
 *
247
 * @unittest 2602
248
 */
249
UNITTEST size_t dynhds_count_name(struct dynhds *dynhds,
250
                                  const char *name, size_t namelen);
251
UNITTEST size_t dynhds_count_name(struct dynhds *dynhds,
252
                                  const char *name, size_t namelen)
253
0
{
254
0
  size_t n = 0;
255
0
  if(dynhds->hds_len) {
256
0
    size_t i;
257
0
    for(i = 0; i < dynhds->hds_len; ++i) {
258
0
      if((namelen == dynhds->hds[i]->namelen) &&
259
0
         curl_strnequal(name, dynhds->hds[i]->name, namelen))
260
0
        ++n;
261
0
    }
262
0
  }
263
0
  return n;
264
0
}
265
266
/**
267
 * Return how often the given null-terminated name appears in `dynhds`.
268
 * Names are case-insensitive.
269
 *
270
 * @unittest 2602
271
 */
272
UNITTEST size_t dynhds_ccount_name(struct dynhds *dynhds,
273
                                        const char *name);
274
UNITTEST size_t dynhds_ccount_name(struct dynhds *dynhds,
275
                                        const char *name)
276
0
{
277
0
  return dynhds_count_name(dynhds, name, strlen(name));
278
0
}
279
280
/**
281
 * Remove all entries with the given name.
282
 * Returns number of entries removed.
283
 *
284
 * @unittest 2602
285
 */
286
UNITTEST size_t dynhds_remove(struct dynhds *dynhds,
287
                              const char *name, size_t namelen);
288
UNITTEST size_t dynhds_remove(struct dynhds *dynhds,
289
                              const char *name, size_t namelen)
290
0
{
291
0
  size_t n = 0;
292
0
  if(dynhds->hds_len) {
293
0
    size_t i, len;
294
0
    for(i = 0; i < dynhds->hds_len; ++i) {
295
0
      if((namelen == dynhds->hds[i]->namelen) &&
296
0
         curl_strnequal(name, dynhds->hds[i]->name, namelen)) {
297
0
        ++n;
298
0
        --dynhds->hds_len;
299
0
        dynhds->strs_len -= (dynhds->hds[i]->namelen +
300
0
                             dynhds->hds[i]->valuelen);
301
0
        entry_free(dynhds->hds[i]);
302
0
        len = dynhds->hds_len - i; /* remaining entries */
303
0
        if(len) {
304
0
          memmove(&dynhds->hds[i], &dynhds->hds[i + 1],
305
0
                  len * sizeof(dynhds->hds[i]));
306
0
        }
307
0
        --i; /* do this index again */
308
0
      }
309
0
    }
310
0
  }
311
0
  return n;
312
0
}
313
314
/**
315
 * Set the give header name and value, replacing any entries with
316
 * the same name. The header is added at the end of all (remaining)
317
 * entries.
318
 *
319
 * @unittest 2602
320
 */
321
UNITTEST CURLcode dynhds_set(struct dynhds *dynhds,
322
                             const char *name, size_t namelen,
323
                             const char *value, size_t valuelen);
324
UNITTEST CURLcode dynhds_set(struct dynhds *dynhds,
325
                             const char *name, size_t namelen,
326
                             const char *value, size_t valuelen)
327
0
{
328
0
  dynhds_remove(dynhds, name, namelen);
329
0
  return Curl_dynhds_add(dynhds, name, namelen, value, valuelen);
330
0
}
331
332
/* @unittest 2602 */
333
UNITTEST size_t dynhds_cremove(struct dynhds *dynhds, const char *name);
334
UNITTEST size_t dynhds_cremove(struct dynhds *dynhds, const char *name)
335
0
{
336
0
  return dynhds_remove(dynhds, name, strlen(name));
337
0
}
338
339
#endif /* UNITTESTS */
340
341
CURLcode Curl_dynhds_h1_dprint(struct dynhds *dynhds, struct dynbuf *dbuf)
342
15.8k
{
343
15.8k
  CURLcode result = CURLE_OK;
344
15.8k
  size_t i;
345
346
15.8k
  if(!dynhds->hds_len)
347
0
    return result;
348
349
192k
  for(i = 0; i < dynhds->hds_len; ++i) {
350
176k
    result = curlx_dyn_addf(dbuf, "%.*s: %.*s\r\n",
351
176k
                            (int)dynhds->hds[i]->namelen, dynhds->hds[i]->name,
352
176k
                            (int)dynhds->hds[i]->valuelen,
353
176k
                            dynhds->hds[i]->value);
354
176k
    if(result)
355
0
      break;
356
176k
  }
357
358
15.8k
  return result;
359
15.8k
}
360
361
#ifdef USE_NGHTTP2
362
363
nghttp2_nv *Curl_dynhds_to_nva(struct dynhds *dynhds, size_t *pcount)
364
19.2k
{
365
19.2k
  nghttp2_nv *nva = curlx_calloc(1, sizeof(nghttp2_nv) * dynhds->hds_len);
366
19.2k
  size_t i;
367
368
19.2k
  *pcount = 0;
369
19.2k
  if(!nva)
370
0
    return NULL;
371
372
868k
  for(i = 0; i < dynhds->hds_len; ++i) {
373
849k
    struct dynhds_entry *e = dynhds->hds[i];
374
849k
    DEBUGASSERT(e);
375
849k
    nva[i].name = (unsigned char *)e->name;
376
849k
    nva[i].namelen = e->namelen;
377
849k
    nva[i].value = (unsigned char *)e->value;
378
849k
    nva[i].valuelen = e->valuelen;
379
849k
    nva[i].flags = NGHTTP2_NV_FLAG_NONE;
380
849k
  }
381
19.2k
  *pcount = dynhds->hds_len;
382
19.2k
  return nva;
383
19.2k
}
384
385
#endif /* USE_NGHTTP2 */