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 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
|
/***************************************************************************
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\___/|_| \_\_____|
*
* Copyright (C) Dmitry Karpov <dkarpov1970, 2025@gmail.com>
*
* 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
*
***************************************************************************/
/*
* The purpose of this test is to test behavior of curl_multi_waitfds
* function in different scenarios:
* empty multi handle (expected zero descriptors),
* HTTP1 amd HTTP2 (no multiplexing) two transfers (expected two descriptors),
* HTTP2 with multiplexing (expected one descriptors)
* Improper inputs to the API result in CURLM_BAD_FUNCTION_ARGUMENT.
* Sending an empty ufds, and size = 0 will return the number of fds needed.
* Sending a non-empty ufds, but smaller than the fds needed will result in a
* CURLM_OUT_OF_MEMORY, and a number of fds that is >= to the number needed.
*
* It is also expected that all transfers run by multi-handle should complete
* successfully.
*/
#include "first.h"
/* ---------------------------------------------------------------- */
#define test_check(expected_fds) \
if(result != CURLE_OK) { \
curl_mfprintf(stderr, "test failed with code: %d\n", result); \
goto test_cleanup; \
} \
else if(fd_count != expected_fds) { \
curl_mfprintf(stderr, "Max number of waitfds: %u not as expected: %u\n", \
fd_count, expected_fds); \
result = TEST_ERR_FAILURE; \
goto test_cleanup; \
}
#define test_run_check(option, expected_fds) \
do { \
result = test_run(URL, option, &fd_count); \
test_check(expected_fds); \
} while(0)
/* ---------------------------------------------------------------- */
enum {
TEST_USE_HTTP1 = 0,
TEST_USE_HTTP2,
TEST_USE_HTTP2_MPLEX
};
static size_t emptyWriteFunc(char *ptr, size_t size, size_t nmemb, void *data)
{
(void)ptr;
(void)data;
return size * nmemb;
}
static CURLcode set_easy(const char *URL, CURL *curl, long option)
{
CURLcode result = CURLE_OK;
/* First set the URL that is about to receive our POST. */
easy_setopt(curl, CURLOPT_URL, URL);
/* get verbose debug output please */
easy_setopt(curl, CURLOPT_VERBOSE, 1L);
switch(option) {
case TEST_USE_HTTP1:
/* go http1 */
easy_setopt(curl, CURLOPT_HTTP_VERSION, CURL_HTTP_VERSION_1_1);
break;
case TEST_USE_HTTP2:
/* go http2 */
easy_setopt(curl, CURLOPT_HTTP_VERSION, CURL_HTTP_VERSION_2_0);
break;
case TEST_USE_HTTP2_MPLEX:
/* go http2 with multiplexing */
easy_setopt(curl, CURLOPT_HTTP_VERSION, CURL_HTTP_VERSION_2_0);
easy_setopt(curl, CURLOPT_PIPEWAIT, 1L);
break;
}
/* no peer verify */
easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, 0L);
easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, 0L);
/* include headers */
easy_setopt(curl, CURLOPT_HEADER, 1L);
/* empty write function */
easy_setopt(curl, CURLOPT_WRITEFUNCTION, emptyWriteFunc);
test_cleanup:
return result;
}
static CURLcode test_run(const char *URL, long option,
unsigned int *max_fd_count)
{
CURLMcode mresult = CURLM_OK;
CURLM *multi = NULL;
CURLM *multi1 = NULL;
CURL *curl1 = NULL;
CURL *curl2 = NULL;
unsigned int max_count = 0;
int still_running; /* keep number of running handles */
CURLMsg *msg; /* for picking up messages with the transfer status */
int msgs_left; /* how many messages are left */
CURLcode result = CURLE_OK;
struct curl_waitfd ufds[10];
struct curl_waitfd ufds1[10];
int numfds;
easy_init(curl1);
easy_init(curl2);
if(set_easy(URL, curl1, option) != CURLE_OK)
goto test_cleanup;
if(set_easy(URL, curl2, option) != CURLE_OK)
goto test_cleanup;
multi_init(multi);
multi_init(multi1);
if(option == TEST_USE_HTTP2_MPLEX)
multi_setopt(multi, CURLMOPT_PIPELINING, CURLPIPE_MULTIPLEX);
multi_add_handle(multi, curl1);
multi_add_handle(multi, curl2);
while(!mresult) {
/* get the count of file descriptors from the transfers */
unsigned int fd_count = 0;
unsigned int fd_count_chk = 0;
mresult = curl_multi_perform(multi, &still_running);
if(!still_running || mresult != CURLM_OK)
break;
/* verify improper inputs are treated correctly. */
mresult = curl_multi_waitfds(multi, NULL, 0, NULL);
if(mresult != CURLM_BAD_FUNCTION_ARGUMENT) {
curl_mfprintf(stderr, "curl_multi_waitfds() return code %d instead of "
"CURLM_BAD_FUNCTION_ARGUMENT.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
mresult = curl_multi_waitfds(multi, NULL, 1, NULL);
if(mresult != CURLM_BAD_FUNCTION_ARGUMENT) {
curl_mfprintf(stderr, "curl_multi_waitfds() return code %d instead of "
"CURLM_BAD_FUNCTION_ARGUMENT.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
mresult = curl_multi_waitfds(multi, NULL, 1, &fd_count);
if(mresult != CURLM_BAD_FUNCTION_ARGUMENT) {
curl_mfprintf(stderr, "curl_multi_waitfds() return code %d instead of "
"CURLM_BAD_FUNCTION_ARGUMENT.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
mresult = curl_multi_waitfds(multi, ufds, 10, &fd_count);
if(mresult != CURLM_OK) {
curl_mfprintf(stderr, "curl_multi_waitfds() failed, code %d.\n",
mresult);
result = TEST_ERR_FAILURE;
break;
}
if(!fd_count)
continue; /* no descriptors yet */
/* verify that sending nothing but the fd_count results in at least the
* same number of fds */
mresult = curl_multi_waitfds(multi, NULL, 0, &fd_count_chk);
if(mresult != CURLM_OK) {
curl_mfprintf(stderr, "curl_multi_waitfds() failed, code %d.\n",
mresult);
result = TEST_ERR_FAILURE;
break;
}
if(fd_count_chk < fd_count) {
curl_mfprintf(stderr,
"curl_multi_waitfds() should return at least the number "
"of fds needed (%u vs. %u)\n", fd_count_chk, fd_count);
result = TEST_ERR_FAILURE;
break;
}
/* checking case when we do not have enough space for waitfds */
mresult = curl_multi_waitfds(multi, ufds1, fd_count - 1, &fd_count_chk);
if(mresult != CURLM_OUT_OF_MEMORY) {
curl_mfprintf(stderr, "curl_multi_waitfds() return code %d instead of "
"CURLM_OUT_OF_MEMORY.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
if(fd_count_chk < fd_count) {
curl_mfprintf(stderr,
"curl_multi_waitfds() should return the amount of fds "
"needed if enough is not passed in (%u vs. %u).\n",
fd_count_chk, fd_count);
result = TEST_ERR_FAILURE;
break;
}
/* sending ufds with zero size, is valid */
mresult = curl_multi_waitfds(multi, ufds, 0, NULL);
if(mresult != CURLM_OUT_OF_MEMORY) {
curl_mfprintf(stderr, "curl_multi_waitfds() return code %d instead of "
"CURLM_OUT_OF_MEMORY.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
mresult = curl_multi_waitfds(multi, ufds, 0, &fd_count_chk);
if(mresult != CURLM_OUT_OF_MEMORY) {
curl_mfprintf(stderr, "curl_multi_waitfds() return code %d instead of "
"CURLM_OUT_OF_MEMORY.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
if(fd_count_chk < fd_count) {
curl_mfprintf(stderr,
"curl_multi_waitfds() should return the amount of fds "
"needed if enough is not passed in (%u vs. %u).\n",
fd_count_chk, fd_count);
result = TEST_ERR_FAILURE;
break;
}
if(fd_count > max_count)
max_count = fd_count;
/* Do polling on descriptors in ufds in Multi 1 */
mresult = curl_multi_poll(multi1, ufds, fd_count, 500, &numfds);
if(mresult != CURLM_OK) {
curl_mfprintf(stderr, "curl_multi_poll() failed, code %d.\n", mresult);
result = TEST_ERR_FAILURE;
break;
}
}
for(;;) {
msg = curl_multi_info_read(multi, &msgs_left);
if(!msg)
break;
if(msg->msg == CURLMSG_DONE) {
result = msg->data.result;
}
}
curl_multi_remove_handle(multi, curl1);
curl_multi_remove_handle(multi, curl2);
test_cleanup:
curl_easy_cleanup(curl1);
curl_easy_cleanup(curl2);
curl_multi_cleanup(multi);
curl_multi_cleanup(multi1);
if(max_fd_count)
*max_fd_count = max_count;
return result;
}
static CURLcode empty_multi_test(void)
{
CURLMcode mresult = CURLM_OK;
CURLM *multi = NULL;
CURL *curl = NULL;
struct curl_waitfd ufds[10];
CURLcode result = CURLE_OK;
unsigned int fd_count = 0;
multi_init(multi);
/* calling curl_multi_waitfds() on an empty multi handle. */
mresult = curl_multi_waitfds(multi, ufds, 10, &fd_count);
if(mresult != CURLM_OK) {
curl_mfprintf(stderr, "curl_multi_waitfds() failed, code %d.\n", mresult);
result = TEST_ERR_FAILURE;
goto test_cleanup;
}
else if(fd_count > 0) {
curl_mfprintf(stderr, "curl_multi_waitfds() returned non-zero count of "
"waitfds: %d.\n", fd_count);
result = TEST_ERR_FAILURE;
goto test_cleanup;
}
/* calling curl_multi_waitfds() on multi handle with added easy handle. */
easy_init(curl);
if(set_easy("http://example.com", curl, TEST_USE_HTTP1) != CURLE_OK)
goto test_cleanup;
multi_add_handle(multi, curl);
mresult = curl_multi_waitfds(multi, ufds, 10, &fd_count);
if(mresult != CURLM_OK) {
curl_mfprintf(stderr, "curl_multi_waitfds() failed, code %d.\n", mresult);
result = TEST_ERR_FAILURE;
goto test_cleanup;
}
else if(fd_count > 0) {
curl_mfprintf(stderr, "curl_multi_waitfds() returned non-zero count of "
"waitfds: %d.\n", fd_count);
result = TEST_ERR_FAILURE;
goto test_cleanup;
}
curl_multi_remove_handle(multi, curl);
test_cleanup:
curl_easy_cleanup(curl);
curl_multi_cleanup(multi);
return result;
}
static CURLcode test_lib2405(const char *URL)
{
CURLcode result = CURLE_OK;
unsigned int fd_count = 0;
global_init(CURL_GLOBAL_ALL);
/* Testing curl_multi_waitfds on empty and not started handles */
result = empty_multi_test();
if(result != CURLE_OK)
goto test_cleanup;
if(testnum == 2405) {
/* HTTP1, expected 2 waitfds - one for each transfer */
test_run_check(TEST_USE_HTTP1, 2);
}
#ifdef USE_HTTP2
else { /* 2407 */
/* HTTP2, expected 2 waitfds - one for each transfer */
test_run_check(TEST_USE_HTTP2, 2);
/* HTTP2 with multiplexing, expected 1 waitfds - one for all transfers */
test_run_check(TEST_USE_HTTP2_MPLEX, 1);
}
#endif
test_cleanup:
curl_global_cleanup();
return result;
}
|