mirror of
https://github.com/curl/curl.git
synced 2025-01-12 13:55:11 +08:00
61f52a97e9
Adding `bufq`: - at init() time configured to hold up to `n` chunks of `m` bytes each. - various methods for reading from and writing to it. - `peek` support to get access to buffered data without copy - `pass` support to allow buffer flushing on write if it becomes full - use case: IO buffers for dynamic reads and writes that do not blow up - distinct from `dynbuf` in that: - it maintains a read position - writes on a full bufq return CURLE_AGAIN instead of nuking itself - Init options: - SOFT_LIMIT: allow writes into a full bufq - NO_SPARES: free empty chunks right away - a `bufc_pool` that can keep a number of spare chunks to be shared between different `bufq` instances Adding `dynhds`: - a straightforward list of name+value pairs as used for HTTP headers - headers can be appended dynamically - headers can be removed again - headers can be replaced - headers can be looked up - http/1.1 formatting into a `dynbuf` - configured at init() with limits on header counts and total string sizes - use case: pass a HTTP request or response around without being version specific - express a HTTP request without a curl easy handle (used in h2 proxy tunnels) - future extension possibilities: - conversions of `dynhds` to nghttp2/nghttp3 name+value arrays Closes #10720
126 lines
4.6 KiB
C
126 lines
4.6 KiB
C
/***************************************************************************
|
|
* _ _ ____ _
|
|
* 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 "curlcheck.h"
|
|
|
|
#include "urldata.h"
|
|
#include "dynbuf.h"
|
|
#include "dynhds.h"
|
|
#include "curl_log.h"
|
|
|
|
static CURLcode unit_setup(void)
|
|
{
|
|
return CURLE_OK;
|
|
}
|
|
|
|
static void unit_stop(void)
|
|
{
|
|
}
|
|
|
|
|
|
UNITTEST_START
|
|
|
|
struct dynhds hds;
|
|
struct dynbuf dbuf;
|
|
CURLcode result;
|
|
size_t i;
|
|
|
|
/* add 1 more header than allowed */
|
|
Curl_dynhds_init(&hds, 2, 128);
|
|
fail_if(Curl_dynhds_count(&hds), "should be empty");
|
|
fail_if(Curl_dynhds_add(&hds, "test1", 5, "123", 3), "add failed");
|
|
fail_if(Curl_dynhds_add(&hds, "test2", 5, "456", 3), "add failed");
|
|
/* remove and add without exceeding limits */
|
|
for(i = 0; i < 100; ++i) {
|
|
if(Curl_dynhds_remove(&hds, "test2", 5) != 1) {
|
|
fail_if(TRUE, "should");
|
|
break;
|
|
}
|
|
if(Curl_dynhds_add(&hds, "test2", 5, "456", 3)) {
|
|
fail_if(TRUE, "add failed");
|
|
break;
|
|
}
|
|
}
|
|
fail_unless(Curl_dynhds_count(&hds) == 2, "should hold 2");
|
|
/* set, replacing previous entry without exceeding limits */
|
|
for(i = 0; i < 100; ++i) {
|
|
if(Curl_dynhds_set(&hds, "test2", 5, "456", 3)) {
|
|
fail_if(TRUE, "add failed");
|
|
break;
|
|
}
|
|
}
|
|
fail_unless(Curl_dynhds_count(&hds) == 2, "should hold 2");
|
|
/* exceed limit on # of entries */
|
|
result = Curl_dynhds_add(&hds, "test3", 5, "789", 3);
|
|
fail_unless(result, "add should have failed");
|
|
|
|
fail_unless(Curl_dynhds_count_name(&hds, "test", 4) == 0, "false positive");
|
|
fail_unless(Curl_dynhds_count_name(&hds, "test1", 4) == 0, "false positive");
|
|
fail_if(Curl_dynhds_get(&hds, "test1", 4), "false positive");
|
|
fail_unless(Curl_dynhds_get(&hds, "test1", 5), "false negative");
|
|
fail_unless(Curl_dynhds_count_name(&hds, "test1", 5) == 1, "should");
|
|
fail_unless(Curl_dynhds_ccount_name(&hds, "test2") == 1, "should");
|
|
fail_unless(Curl_dynhds_cget(&hds, "test2"), "should");
|
|
fail_unless(Curl_dynhds_ccount_name(&hds, "TEST2") == 1, "should");
|
|
fail_unless(Curl_dynhds_ccontains(&hds, "TesT2"), "should");
|
|
fail_unless(Curl_dynhds_contains(&hds, "TeSt2", 5), "should");
|
|
Curl_dynhds_free(&hds);
|
|
|
|
/* add header exceeding max overall length */
|
|
Curl_dynhds_init(&hds, 128, 10);
|
|
fail_if(Curl_dynhds_add(&hds, "test1", 5, "123", 3), "add failed");
|
|
fail_unless(Curl_dynhds_add(&hds, "test2", 5, "456", 3), "should fail");
|
|
fail_if(Curl_dynhds_add(&hds, "t", 1, "1", 1), "add failed");
|
|
Curl_dynhds_reset(&hds);
|
|
Curl_dynhds_free(&hds);
|
|
|
|
Curl_dynhds_init(&hds, 128, 4*1024);
|
|
fail_if(Curl_dynhds_add(&hds, "test1", 5, "123", 3), "add failed");
|
|
fail_if(Curl_dynhds_add(&hds, "test1", 5, "123", 3), "add failed");
|
|
fail_if(Curl_dynhds_cadd(&hds, "blablabla", "thingies"), "add failed");
|
|
fail_if(Curl_dynhds_h1_cadd_line(&hds, "blablabla: thingies"), "add failed");
|
|
fail_unless(Curl_dynhds_ccount_name(&hds, "blablabla") == 2, "should");
|
|
fail_unless(Curl_dynhds_cremove(&hds, "blablabla") == 2, "should");
|
|
fail_if(Curl_dynhds_ccontains(&hds, "blablabla"), "should not");
|
|
|
|
result = Curl_dynhds_h1_cadd_line(&hds, "blablabla thingies");
|
|
fail_unless(result, "add should have failed");
|
|
if(!result) {
|
|
fail_unless(Curl_dynhds_ccount_name(&hds, "bLABlaBlA") == 0, "should");
|
|
fail_if(Curl_dynhds_cadd(&hds, "Bla-Bla", "thingies"), "add failed");
|
|
|
|
Curl_dyn_init(&dbuf, 32*1024);
|
|
fail_if(Curl_dynhds_h1_dprint(&hds, &dbuf), "h1 print failed");
|
|
if(Curl_dyn_ptr(&dbuf)) {
|
|
fprintf(stderr, "%s", Curl_dyn_ptr(&dbuf));
|
|
fail_if(strcmp(Curl_dyn_ptr(&dbuf),
|
|
"test1: 123\r\ntest1: 123\r\nBla-Bla: thingies\r\n"),
|
|
"h1 format differs");
|
|
}
|
|
Curl_dyn_free(&dbuf);
|
|
}
|
|
|
|
Curl_dynhds_free(&hds);
|
|
|
|
UNITTEST_STOP
|