1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/***************************************************************************
* _ _ ____ _
* 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 "first.h"
static size_t t1940_write_cb(char *data, size_t n, size_t l, void *userp)
{
/* take care of the data here, ignored in this example */
(void)data;
(void)userp;
return n * l;
}
static void t1940_showem(CURL *curl, int header_request, unsigned int type)
{
static const char *testdata[] = {
"daTE",
"Server",
"content-type",
"content-length",
"location",
"set-cookie",
"silly-thing",
"fold",
"blank",
"Blank2",
"Test",
NULL
};
int i;
struct curl_header *header;
for(i = 0; testdata[i]; i++) {
if(CURLHE_OK == curl_easy_header(curl, testdata[i], 0,
type, header_request, &header)) {
if(header->amount > 1) {
/* more than one, iterate over them */
size_t index = 0;
size_t amount = header->amount;
do {
curl_mprintf("- %s == %s (%zu/%zu)\n", header->name, header->value,
index, amount);
if(++index == amount)
break;
if(CURLHE_OK != curl_easy_header(curl, testdata[i], index,
type, header_request, &header))
break;
} while(1);
}
else {
/* only one of this */
curl_mprintf(" %s == %s\n", header->name, header->value);
}
}
}
}
static CURLcode test_lib1940(const char *URL)
{
CURL *curl = NULL;
CURLcode result = CURLE_OK;
int header_request;
if(testnum == 1946) {
header_request = 0;
}
else {
header_request = -1;
}
global_init(CURL_GLOBAL_DEFAULT);
easy_init(curl);
easy_setopt(curl, CURLOPT_URL, URL);
easy_setopt(curl, CURLOPT_VERBOSE, 1L);
easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
/* ignores any content */
easy_setopt(curl, CURLOPT_WRITEFUNCTION, t1940_write_cb);
/* if there is a proxy set, use it */
if(libtest_arg2 && *libtest_arg2) {
easy_setopt(curl, CURLOPT_PROXY, libtest_arg2);
easy_setopt(curl, CURLOPT_HTTPPROXYTUNNEL, 1L);
}
result = curl_easy_perform(curl);
if(result)
goto test_cleanup;
t1940_showem(curl, header_request, CURLH_HEADER);
if(libtest_arg2 && *libtest_arg2) {
/* now show connect headers only */
t1940_showem(curl, header_request, CURLH_CONNECT);
}
t1940_showem(curl, header_request, CURLH_1XX);
t1940_showem(curl, header_request, CURLH_TRAILER);
test_cleanup:
curl_easy_cleanup(curl);
curl_global_cleanup();
return result;
}
|
