Coverage Report

Created: 2026-01-10 07:08

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
#ifdef USE_NGHTTP2
30
#include <stdint.h>
31
#include <nghttp2/nghttp2.h>
32
#endif /* USE_NGHTTP2 */
33
34
static struct dynhds_entry *entry_new(const char *name, size_t namelen,
35
                                      const char *value, size_t valuelen,
36
                                      int opts)
37
2.01M
{
38
2.01M
  struct dynhds_entry *e;
39
2.01M
  char *p;
40
41
2.01M
  DEBUGASSERT(name);
42
2.01M
  DEBUGASSERT(value);
43
2.01M
  e = curlx_calloc(1, sizeof(*e) + namelen + valuelen + 2);
44
2.01M
  if(!e)
45
0
    return NULL;
46
2.01M
  e->name = p = (char *)e + sizeof(*e);
47
2.01M
  memcpy(p, name, namelen);
48
2.01M
  e->namelen = namelen;
49
2.01M
  e->value = p += namelen + 1; /* leave a \0 at the end of name */
50
2.01M
  memcpy(p, value, valuelen);
51
2.01M
  e->valuelen = valuelen;
52
2.01M
  if(opts & DYNHDS_OPT_LOWERCASE)
53
954k
    Curl_strntolower(e->name, e->name, e->namelen);
54
2.01M
  return e;
55
2.01M
}
56
57
static void entry_free(struct dynhds_entry *e)
58
2.01M
{
59
2.01M
  curlx_free(e);
60
2.01M
}
61
62
void Curl_dynhds_init(struct dynhds *dynhds, size_t max_entries,
63
                      size_t max_strs_size)
64
126k
{
65
126k
  DEBUGASSERT(dynhds);
66
126k
  DEBUGASSERT(max_strs_size);
67
126k
  dynhds->hds = NULL;
68
126k
  dynhds->hds_len = dynhds->hds_allc = dynhds->strs_len = 0;
69
126k
  dynhds->max_entries = max_entries;
70
126k
  dynhds->max_strs_size = max_strs_size;
71
126k
  dynhds->opts = 0;
72
126k
}
73
74
void Curl_dynhds_free(struct dynhds *dynhds)
75
126k
{
76
126k
  DEBUGASSERT(dynhds);
77
126k
  if(dynhds->hds && dynhds->hds_len) {
78
62.6k
    size_t i;
79
62.6k
    DEBUGASSERT(dynhds->hds);
80
2.07M
    for(i = 0; i < dynhds->hds_len; ++i) {
81
2.01M
      entry_free(dynhds->hds[i]);
82
2.01M
    }
83
62.6k
  }
84
126k
  Curl_safefree(dynhds->hds);
85
126k
  dynhds->hds_len = dynhds->hds_allc = dynhds->strs_len = 0;
86
126k
}
87
88
void Curl_dynhds_reset(struct dynhds *dynhds)
89
19.3k
{
90
19.3k
  DEBUGASSERT(dynhds);
91
19.3k
  if(dynhds->hds_len) {
92
0
    size_t i;
93
0
    DEBUGASSERT(dynhds->hds);
94
0
    for(i = 0; i < dynhds->hds_len; ++i) {
95
0
      entry_free(dynhds->hds[i]);
96
0
      dynhds->hds[i] = NULL;
97
0
    }
98
0
  }
99
19.3k
  dynhds->hds_len = dynhds->strs_len = 0;
100
19.3k
}
101
102
size_t Curl_dynhds_count(struct dynhds *dynhds)
103
938k
{
104
938k
  return dynhds->hds_len;
105
938k
}
106
107
void Curl_dynhds_set_opts(struct dynhds *dynhds, int opts)
108
19.3k
{
109
19.3k
  dynhds->opts = opts;
110
19.3k
}
111
112
struct dynhds_entry *Curl_dynhds_getn(struct dynhds *dynhds, size_t n)
113
918k
{
114
918k
  DEBUGASSERT(dynhds);
115
918k
  return (n < dynhds->hds_len) ? dynhds->hds[n] : NULL;
116
918k
}
117
118
struct dynhds_entry *Curl_dynhds_get(struct dynhds *dynhds, const char *name,
119
                                     size_t namelen)
120
19.2k
{
121
19.2k
  size_t i;
122
66.2k
  for(i = 0; i < dynhds->hds_len; ++i) {
123
66.1k
    if(dynhds->hds[i]->namelen == namelen &&
124
25.5k
       curl_strnequal(dynhds->hds[i]->name, name, namelen)) {
125
19.1k
      return dynhds->hds[i];
126
19.1k
    }
127
66.1k
  }
128
108
  return NULL;
129
19.2k
}
130
131
struct dynhds_entry *Curl_dynhds_cget(struct dynhds *dynhds, const char *name)
132
0
{
133
0
  return Curl_dynhds_get(dynhds, name, strlen(name));
134
0
}
135
136
CURLcode Curl_dynhds_add(struct dynhds *dynhds,
137
                         const char *name, size_t namelen,
138
                         const char *value, size_t valuelen)
139
2.01M
{
140
2.01M
  struct dynhds_entry *entry = NULL;
141
2.01M
  CURLcode result = CURLE_OUT_OF_MEMORY;
142
143
2.01M
  DEBUGASSERT(dynhds);
144
2.01M
  if(dynhds->max_entries && dynhds->hds_len >= dynhds->max_entries)
145
0
    return CURLE_OUT_OF_MEMORY;
146
2.01M
  if(dynhds->strs_len + namelen + valuelen > dynhds->max_strs_size)
147
0
    return CURLE_OUT_OF_MEMORY;
148
149
2.01M
  entry = entry_new(name, namelen, value, valuelen, dynhds->opts);
150
2.01M
  if(!entry)
151
0
    goto out;
152
153
2.01M
  if(dynhds->hds_len + 1 >= dynhds->hds_allc) {
154
179k
    size_t nallc = dynhds->hds_len + 16;
155
179k
    struct dynhds_entry **nhds;
156
157
179k
    if(dynhds->max_entries && nallc > dynhds->max_entries)
158
0
      nallc = dynhds->max_entries;
159
160
179k
    nhds = curlx_calloc(nallc, sizeof(struct dynhds_entry *));
161
179k
    if(!nhds)
162
0
      goto out;
163
179k
    if(dynhds->hds) {
164
116k
      memcpy(nhds, dynhds->hds,
165
116k
             dynhds->hds_len * sizeof(struct dynhds_entry *));
166
116k
      Curl_safefree(dynhds->hds);
167
116k
    }
168
179k
    dynhds->hds = nhds;
169
179k
    dynhds->hds_allc = nallc;
170
179k
  }
171
2.01M
  dynhds->hds[dynhds->hds_len++] = entry;
172
2.01M
  entry = NULL;
173
2.01M
  dynhds->strs_len += namelen + valuelen;
174
2.01M
  result = CURLE_OK;
175
176
2.01M
out:
177
2.01M
  if(entry)
178
0
    entry_free(entry);
179
2.01M
  return result;
180
2.01M
}
181
182
CURLcode Curl_dynhds_cadd(struct dynhds *dynhds,
183
                          const char *name, const char *value)
184
48.5k
{
185
48.5k
  return Curl_dynhds_add(dynhds, name, strlen(name), value, strlen(value));
186
48.5k
}
187
188
CURLcode Curl_dynhds_h1_add_line(struct dynhds *dynhds,
189
                                 const char *line, size_t line_len)
190
940k
{
191
940k
  const char *p;
192
940k
  const char *name;
193
940k
  size_t namelen;
194
940k
  const char *value;
195
940k
  size_t valuelen, i;
196
197
940k
  if(!line || !line_len)
198
0
    return CURLE_OK;
199
200
940k
  p = memchr(line, ':', line_len);
201
940k
  if(!p)
202
81
    return CURLE_BAD_FUNCTION_ARGUMENT;
203
940k
  name = line;
204
940k
  namelen = p - line;
205
940k
  p++; /* move past the colon */
206
1.08M
  for(i = namelen + 1; i < line_len; ++i, ++p) {
207
849k
    if(!ISBLANK(*p))
208
703k
      break;
209
849k
  }
210
940k
  value = p;
211
940k
  valuelen = line_len - i;
212
213
940k
  p = memchr(value, '\r', valuelen);
214
940k
  if(!p)
215
891k
    p = memchr(value, '\n', valuelen);
216
940k
  if(p)
217
48.5k
    valuelen = (size_t)(p - value);
218
219
940k
  return Curl_dynhds_add(dynhds, name, namelen, value, valuelen);
220
940k
}
221
222
CURLcode Curl_dynhds_h1_cadd_line(struct dynhds *dynhds, const char *line)
223
12.5k
{
224
12.5k
  return Curl_dynhds_h1_add_line(dynhds, line, line ? strlen(line) : 0);
225
12.5k
}
226
227
#ifdef UNITTESTS
228
/* used by unit2602.c */
229
230
bool Curl_dynhds_contains(struct dynhds *dynhds,
231
                          const char *name, size_t namelen)
232
{
233
  return !!Curl_dynhds_get(dynhds, name, namelen);
234
}
235
236
bool Curl_dynhds_ccontains(struct dynhds *dynhds, const char *name)
237
{
238
  return Curl_dynhds_contains(dynhds, name, strlen(name));
239
}
240
241
size_t Curl_dynhds_count_name(struct dynhds *dynhds,
242
                              const char *name, size_t namelen)
243
{
244
  size_t n = 0;
245
  if(dynhds->hds_len) {
246
    size_t i;
247
    for(i = 0; i < dynhds->hds_len; ++i) {
248
      if((namelen == dynhds->hds[i]->namelen) &&
249
         curl_strnequal(name, dynhds->hds[i]->name, namelen))
250
        ++n;
251
    }
252
  }
253
  return n;
254
}
255
256
size_t Curl_dynhds_ccount_name(struct dynhds *dynhds, const char *name)
257
{
258
  return Curl_dynhds_count_name(dynhds, name, strlen(name));
259
}
260
261
CURLcode Curl_dynhds_set(struct dynhds *dynhds,
262
                         const char *name, size_t namelen,
263
                         const char *value, size_t valuelen)
264
{
265
  Curl_dynhds_remove(dynhds, name, namelen);
266
  return Curl_dynhds_add(dynhds, name, namelen, value, valuelen);
267
}
268
269
size_t Curl_dynhds_remove(struct dynhds *dynhds,
270
                          const char *name, size_t namelen)
271
{
272
  size_t n = 0;
273
  if(dynhds->hds_len) {
274
    size_t i, len;
275
    for(i = 0; i < dynhds->hds_len; ++i) {
276
      if((namelen == dynhds->hds[i]->namelen) &&
277
         curl_strnequal(name, dynhds->hds[i]->name, namelen)) {
278
        ++n;
279
        --dynhds->hds_len;
280
        dynhds->strs_len -= (dynhds->hds[i]->namelen +
281
                             dynhds->hds[i]->valuelen);
282
        entry_free(dynhds->hds[i]);
283
        len = dynhds->hds_len - i; /* remaining entries */
284
        if(len) {
285
          memmove(&dynhds->hds[i], &dynhds->hds[i + 1],
286
                  len * sizeof(dynhds->hds[i]));
287
        }
288
        --i; /* do this index again */
289
      }
290
    }
291
  }
292
  return n;
293
}
294
295
size_t Curl_dynhds_cremove(struct dynhds *dynhds, const char *name)
296
{
297
  return Curl_dynhds_remove(dynhds, name, strlen(name));
298
}
299
300
#endif
301
302
CURLcode Curl_dynhds_h1_dprint(struct dynhds *dynhds, struct dynbuf *dbuf)
303
23.8k
{
304
23.8k
  CURLcode result = CURLE_OK;
305
23.8k
  size_t i;
306
307
23.8k
  if(!dynhds->hds_len)
308
0
    return result;
309
310
152k
  for(i = 0; i < dynhds->hds_len; ++i) {
311
128k
    result = curlx_dyn_addf(dbuf, "%.*s: %.*s\r\n",
312
128k
                            (int)dynhds->hds[i]->namelen, dynhds->hds[i]->name,
313
128k
                            (int)dynhds->hds[i]->valuelen,
314
128k
                            dynhds->hds[i]->value);
315
128k
    if(result)
316
0
      break;
317
128k
  }
318
319
23.8k
  return result;
320
23.8k
}
321
322
#ifdef USE_NGHTTP2
323
324
nghttp2_nv *Curl_dynhds_to_nva(struct dynhds *dynhds, size_t *pcount)
325
19.3k
{
326
19.3k
  nghttp2_nv *nva = curlx_calloc(1, sizeof(nghttp2_nv) * dynhds->hds_len);
327
19.3k
  size_t i;
328
329
19.3k
  *pcount = 0;
330
19.3k
  if(!nva)
331
0
    return NULL;
332
333
974k
  for(i = 0; i < dynhds->hds_len; ++i) {
334
954k
    struct dynhds_entry *e = dynhds->hds[i];
335
954k
    DEBUGASSERT(e);
336
954k
    nva[i].name = (unsigned char *)e->name;
337
954k
    nva[i].namelen = e->namelen;
338
954k
    nva[i].value = (unsigned char *)e->value;
339
954k
    nva[i].valuelen = e->valuelen;
340
954k
    nva[i].flags = NGHTTP2_NV_FLAG_NONE;
341
954k
  }
342
19.3k
  *pcount = dynhds->hds_len;
343
19.3k
  return nva;
344
19.3k
}
345
346
#endif /* USE_NGHTTP2 */