lib537.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520
  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 "test.h"
  25. #ifdef HAVE_SYS_RESOURCE_H
  26. #include <sys/resource.h>
  27. #endif
  28. #ifdef HAVE_FCNTL_H
  29. #include <fcntl.h>
  30. #endif
  31. #include <limits.h>
  32. #include "warnless.h"
  33. #include "memdebug.h"
  34. #if !defined(HAVE_POLL_FINE) && \
  35. !defined(USE_WINSOCK) && \
  36. !defined(FD_SETSIZE)
  37. #error "this test requires FD_SETSIZE"
  38. #endif
  39. #define SAFETY_MARGIN (11)
  40. #if defined(_WIN32) || defined(MSDOS)
  41. #define DEV_NULL "NUL"
  42. #else
  43. #define DEV_NULL "/dev/null"
  44. #endif
  45. #if defined(HAVE_GETRLIMIT) && defined(HAVE_SETRLIMIT)
  46. static int *testfd = NULL;
  47. static struct rlimit num_open;
  48. static char msgbuff[256];
  49. static void store_errmsg(const char *msg, int err)
  50. {
  51. if(!err)
  52. msnprintf(msgbuff, sizeof(msgbuff), "%s", msg);
  53. else
  54. msnprintf(msgbuff, sizeof(msgbuff), "%s, errno %d, %s", msg,
  55. err, strerror(err));
  56. }
  57. static void close_file_descriptors(void)
  58. {
  59. for(num_open.rlim_cur = 0;
  60. num_open.rlim_cur < num_open.rlim_max;
  61. num_open.rlim_cur++)
  62. if(testfd[num_open.rlim_cur] > 0)
  63. close(testfd[num_open.rlim_cur]);
  64. free(testfd);
  65. testfd = NULL;
  66. }
  67. static int fopen_works(void)
  68. {
  69. FILE *fpa[3];
  70. int i;
  71. int ret = 1;
  72. for(i = 0; i < 3; i++) {
  73. fpa[i] = NULL;
  74. }
  75. for(i = 0; i < 3; i++) {
  76. fpa[i] = fopen(DEV_NULL, FOPEN_READTEXT);
  77. if(!fpa[i]) {
  78. store_errmsg("fopen failed", errno);
  79. fprintf(stderr, "%s\n", msgbuff);
  80. ret = 0;
  81. break;
  82. }
  83. }
  84. for(i = 0; i < 3; i++) {
  85. if(fpa[i])
  86. fclose(fpa[i]);
  87. }
  88. return ret;
  89. }
  90. static void rlim2str(char *buf, size_t len, rlim_t val)
  91. {
  92. #ifdef RLIM_INFINITY
  93. if(val == RLIM_INFINITY) {
  94. msnprintf(buf, len, "INFINITY");
  95. return;
  96. }
  97. #endif
  98. #ifdef HAVE_LONGLONG
  99. if(sizeof(rlim_t) > sizeof(long))
  100. msnprintf(buf, len, "%llu", (unsigned long long)val);
  101. else
  102. #endif
  103. {
  104. if(sizeof(rlim_t) < sizeof(long))
  105. msnprintf(buf, len, "%u", (unsigned int)val);
  106. else
  107. msnprintf(buf, len, "%lu", (unsigned long)val);
  108. }
  109. }
  110. static int test_rlimit(int keep_open)
  111. {
  112. int *tmpfd;
  113. rlim_t nitems, i;
  114. int *memchunk = NULL;
  115. struct rlimit rl;
  116. char strbuff[256];
  117. char strbuff1[81];
  118. /* get initial open file limits */
  119. if(getrlimit(RLIMIT_NOFILE, &rl) != 0) {
  120. store_errmsg("getrlimit() failed", errno);
  121. fprintf(stderr, "%s\n", msgbuff);
  122. return -1;
  123. }
  124. /* show initial open file limits */
  125. rlim2str(strbuff, sizeof(strbuff), rl.rlim_cur);
  126. fprintf(stderr, "initial soft limit: %s\n", strbuff);
  127. rlim2str(strbuff, sizeof(strbuff), rl.rlim_max);
  128. fprintf(stderr, "initial hard limit: %s\n", strbuff);
  129. /* If the OS allows a HUGE number of open files, we do not run.
  130. * Modern debian sid reports a limit of 134217724 and this tests
  131. * takes minutes. */
  132. #define LIMIT_CAP (256*1024)
  133. if(rl.rlim_cur > LIMIT_CAP) {
  134. fprintf(stderr, "soft limit above %ld, not running\n", (long)LIMIT_CAP);
  135. return -2;
  136. }
  137. /*
  138. * if soft limit and hard limit are different we ask the
  139. * system to raise soft limit all the way up to the hard
  140. * limit. Due to some other system limit the soft limit
  141. * might not be raised up to the hard limit. So from this
  142. * point the resulting soft limit is our limit. Trying to
  143. * open more than soft limit file descriptors will fail.
  144. */
  145. if(rl.rlim_cur != rl.rlim_max) {
  146. #ifdef OPEN_MAX
  147. if((rl.rlim_cur > 0) &&
  148. (rl.rlim_cur < OPEN_MAX)) {
  149. fprintf(stderr, "raising soft limit up to OPEN_MAX\n");
  150. rl.rlim_cur = OPEN_MAX;
  151. if(setrlimit(RLIMIT_NOFILE, &rl) != 0) {
  152. /* on failure don't abort just issue a warning */
  153. store_errmsg("setrlimit() failed", errno);
  154. fprintf(stderr, "%s\n", msgbuff);
  155. msgbuff[0] = '\0';
  156. }
  157. }
  158. #endif
  159. fprintf(stderr, "raising soft limit up to hard limit\n");
  160. rl.rlim_cur = rl.rlim_max;
  161. if(setrlimit(RLIMIT_NOFILE, &rl) != 0) {
  162. /* on failure don't abort just issue a warning */
  163. store_errmsg("setrlimit() failed", errno);
  164. fprintf(stderr, "%s\n", msgbuff);
  165. msgbuff[0] = '\0';
  166. }
  167. /* get current open file limits */
  168. if(getrlimit(RLIMIT_NOFILE, &rl) != 0) {
  169. store_errmsg("getrlimit() failed", errno);
  170. fprintf(stderr, "%s\n", msgbuff);
  171. return -3;
  172. }
  173. /* show current open file limits */
  174. rlim2str(strbuff, sizeof(strbuff), rl.rlim_cur);
  175. fprintf(stderr, "current soft limit: %s\n", strbuff);
  176. rlim2str(strbuff, sizeof(strbuff), rl.rlim_max);
  177. fprintf(stderr, "current hard limit: %s\n", strbuff);
  178. } /* (rl.rlim_cur != rl.rlim_max) */
  179. /*
  180. * test 537 is all about testing libcurl functionality
  181. * when the system has nearly exhausted the number of
  182. * available file descriptors. Test 537 will try to run
  183. * with a very small number of file descriptors available.
  184. * This implies that any file descriptor which is open
  185. * when the test runs will have a number in the high range
  186. * of whatever the system supports.
  187. */
  188. /*
  189. * reserve a chunk of memory before opening file descriptors to
  190. * avoid a low memory condition once the file descriptors are
  191. * open. System conditions that could make the test fail should
  192. * be addressed in the precheck phase. This chunk of memory shall
  193. * be always free()ed before exiting the test_rlimit() function so
  194. * that it becomes available to the test.
  195. */
  196. for(nitems = i = 1; nitems <= i; i *= 2)
  197. nitems = i;
  198. if(nitems > 0x7fff)
  199. nitems = 0x40000;
  200. do {
  201. num_open.rlim_max = sizeof(*memchunk) * nitems;
  202. rlim2str(strbuff, sizeof(strbuff), num_open.rlim_max);
  203. fprintf(stderr, "allocating memchunk %s byte array\n", strbuff);
  204. memchunk = malloc(sizeof(*memchunk) * (size_t)nitems);
  205. if(!memchunk) {
  206. fprintf(stderr, "memchunk, malloc() failed\n");
  207. nitems /= 2;
  208. }
  209. } while(nitems && !memchunk);
  210. if(!memchunk) {
  211. store_errmsg("memchunk, malloc() failed", errno);
  212. fprintf(stderr, "%s\n", msgbuff);
  213. return -4;
  214. }
  215. /* initialize it to fight lazy allocation */
  216. fprintf(stderr, "initializing memchunk array\n");
  217. for(i = 0; i < nitems; i++)
  218. memchunk[i] = -1;
  219. /* set the number of file descriptors we will try to open */
  220. #ifdef RLIM_INFINITY
  221. if((rl.rlim_cur > 0) && (rl.rlim_cur != RLIM_INFINITY)) {
  222. #else
  223. if(rl.rlim_cur > 0) {
  224. #endif
  225. /* soft limit minus SAFETY_MARGIN */
  226. num_open.rlim_max = rl.rlim_cur - SAFETY_MARGIN;
  227. }
  228. else {
  229. /* a huge number of file descriptors */
  230. for(nitems = i = 1; nitems <= i; i *= 2)
  231. nitems = i;
  232. if(nitems > 0x7fff)
  233. nitems = 0x40000;
  234. num_open.rlim_max = nitems;
  235. }
  236. /* verify that we won't overflow size_t in malloc() */
  237. if((size_t)(num_open.rlim_max) > ((size_t)-1) / sizeof(*testfd)) {
  238. rlim2str(strbuff1, sizeof(strbuff1), num_open.rlim_max);
  239. msnprintf(strbuff, sizeof(strbuff), "unable to allocate an array for %s "
  240. "file descriptors, would overflow size_t", strbuff1);
  241. store_errmsg(strbuff, 0);
  242. fprintf(stderr, "%s\n", msgbuff);
  243. free(memchunk);
  244. return -5;
  245. }
  246. /* allocate array for file descriptors */
  247. do {
  248. rlim2str(strbuff, sizeof(strbuff), num_open.rlim_max);
  249. fprintf(stderr, "allocating array for %s file descriptors\n", strbuff);
  250. testfd = malloc(sizeof(*testfd) * (size_t)(num_open.rlim_max));
  251. if(!testfd) {
  252. fprintf(stderr, "testfd, malloc() failed\n");
  253. num_open.rlim_max /= 2;
  254. }
  255. } while(num_open.rlim_max && !testfd);
  256. if(!testfd) {
  257. store_errmsg("testfd, malloc() failed", errno);
  258. fprintf(stderr, "%s\n", msgbuff);
  259. free(memchunk);
  260. return -6;
  261. }
  262. /* initialize it to fight lazy allocation */
  263. fprintf(stderr, "initializing testfd array\n");
  264. for(num_open.rlim_cur = 0;
  265. num_open.rlim_cur < num_open.rlim_max;
  266. num_open.rlim_cur++)
  267. testfd[num_open.rlim_cur] = -1;
  268. rlim2str(strbuff, sizeof(strbuff), num_open.rlim_max);
  269. fprintf(stderr, "trying to open %s file descriptors\n", strbuff);
  270. /* open a dummy descriptor */
  271. testfd[0] = open(DEV_NULL, O_RDONLY);
  272. if(testfd[0] < 0) {
  273. msnprintf(strbuff, sizeof(strbuff), "opening of %s failed", DEV_NULL);
  274. store_errmsg(strbuff, errno);
  275. fprintf(stderr, "%s\n", msgbuff);
  276. free(testfd);
  277. testfd = NULL;
  278. free(memchunk);
  279. return -7;
  280. }
  281. /* create a bunch of file descriptors */
  282. for(num_open.rlim_cur = 1;
  283. num_open.rlim_cur < num_open.rlim_max;
  284. num_open.rlim_cur++) {
  285. testfd[num_open.rlim_cur] = dup(testfd[0]);
  286. if(testfd[num_open.rlim_cur] < 0) {
  287. testfd[num_open.rlim_cur] = -1;
  288. rlim2str(strbuff1, sizeof(strbuff1), num_open.rlim_cur);
  289. msnprintf(strbuff, sizeof(strbuff), "dup() attempt %s failed", strbuff1);
  290. fprintf(stderr, "%s\n", strbuff);
  291. rlim2str(strbuff1, sizeof(strbuff1), num_open.rlim_cur);
  292. msnprintf(strbuff, sizeof(strbuff), "fds system limit seems close to %s",
  293. strbuff1);
  294. fprintf(stderr, "%s\n", strbuff);
  295. num_open.rlim_max = num_open.rlim_cur - SAFETY_MARGIN;
  296. num_open.rlim_cur -= num_open.rlim_max;
  297. rlim2str(strbuff1, sizeof(strbuff1), num_open.rlim_cur);
  298. msnprintf(strbuff, sizeof(strbuff), "closing %s file descriptors",
  299. strbuff1);
  300. fprintf(stderr, "%s\n", strbuff);
  301. for(num_open.rlim_cur = num_open.rlim_max;
  302. testfd[num_open.rlim_cur] >= 0;
  303. num_open.rlim_cur++) {
  304. close(testfd[num_open.rlim_cur]);
  305. testfd[num_open.rlim_cur] = -1;
  306. }
  307. rlim2str(strbuff, sizeof(strbuff), num_open.rlim_max);
  308. fprintf(stderr, "shrinking array for %s file descriptors\n", strbuff);
  309. /* we don't care if we can't shrink it */
  310. tmpfd = realloc(testfd, sizeof(*testfd) * (size_t)(num_open.rlim_max));
  311. if(tmpfd) {
  312. testfd = tmpfd;
  313. tmpfd = NULL;
  314. }
  315. break;
  316. }
  317. }
  318. rlim2str(strbuff, sizeof(strbuff), num_open.rlim_max);
  319. fprintf(stderr, "%s file descriptors open\n", strbuff);
  320. #if !defined(HAVE_POLL_FINE) && !defined(USE_WINSOCK)
  321. /*
  322. * when using select() instead of poll() we cannot test
  323. * libcurl functionality with a socket number equal or
  324. * greater than FD_SETSIZE. In any case, macro VERIFY_SOCK
  325. * in lib/select.c enforces this check and protects libcurl
  326. * from a possible crash. The effect of this protection
  327. * is that test 537 will always fail, since the actual
  328. * call to select() never takes place. We skip test 537
  329. * with an indication that select limit would be exceeded.
  330. */
  331. num_open.rlim_cur = FD_SETSIZE - SAFETY_MARGIN;
  332. if(num_open.rlim_max > num_open.rlim_cur) {
  333. msnprintf(strbuff, sizeof(strbuff), "select limit is FD_SETSIZE %d",
  334. FD_SETSIZE);
  335. store_errmsg(strbuff, 0);
  336. fprintf(stderr, "%s\n", msgbuff);
  337. close_file_descriptors();
  338. free(memchunk);
  339. return -8;
  340. }
  341. num_open.rlim_cur = FD_SETSIZE - SAFETY_MARGIN;
  342. for(rl.rlim_cur = 0;
  343. rl.rlim_cur < num_open.rlim_max;
  344. rl.rlim_cur++) {
  345. if((testfd[rl.rlim_cur] > 0) &&
  346. ((unsigned int)testfd[rl.rlim_cur] > num_open.rlim_cur)) {
  347. msnprintf(strbuff, sizeof(strbuff), "select limit is FD_SETSIZE %d",
  348. FD_SETSIZE);
  349. store_errmsg(strbuff, 0);
  350. fprintf(stderr, "%s\n", msgbuff);
  351. close_file_descriptors();
  352. free(memchunk);
  353. return -9;
  354. }
  355. }
  356. #endif /* using a FD_SETSIZE bound select() */
  357. /*
  358. * Old or 'backwards compatible' implementations of stdio do not allow
  359. * handling of streams with an underlying file descriptor number greater
  360. * than 255, even when allowing high numbered file descriptors for sockets.
  361. * At this point we have a big number of file descriptors which have been
  362. * opened using dup(), so lets test the stdio implementation and discover
  363. * if it is capable of fopen()ing some additional files.
  364. */
  365. if(!fopen_works()) {
  366. rlim2str(strbuff1, sizeof(strbuff1), num_open.rlim_max);
  367. msnprintf(strbuff, sizeof(strbuff), "fopen fails with %s fds open",
  368. strbuff1);
  369. fprintf(stderr, "%s\n", msgbuff);
  370. msnprintf(strbuff, sizeof(strbuff), "fopen fails with lots of fds open");
  371. store_errmsg(strbuff, 0);
  372. close_file_descriptors();
  373. free(memchunk);
  374. return -10;
  375. }
  376. /* free the chunk of memory we were reserving so that it
  377. becomes available to the test */
  378. free(memchunk);
  379. /* close file descriptors unless instructed to keep them */
  380. if(!keep_open) {
  381. close_file_descriptors();
  382. }
  383. return 0;
  384. }
  385. CURLcode test(char *URL)
  386. {
  387. CURLcode res;
  388. CURL *curl;
  389. if(!strcmp(URL, "check")) {
  390. /* used by the test script to ask if we can run this test or not */
  391. if(test_rlimit(FALSE)) {
  392. fprintf(stdout, "test_rlimit problem: %s\n", msgbuff);
  393. return (CURLcode)1;
  394. }
  395. return CURLE_OK; /* sure, run this! */
  396. }
  397. if(test_rlimit(TRUE)) {
  398. /* failure */
  399. return TEST_ERR_MAJOR_BAD;
  400. }
  401. /* run the test with the bunch of open file descriptors
  402. and close them all once the test is over */
  403. if(curl_global_init(CURL_GLOBAL_ALL) != CURLE_OK) {
  404. fprintf(stderr, "curl_global_init() failed\n");
  405. close_file_descriptors();
  406. return TEST_ERR_MAJOR_BAD;
  407. }
  408. curl = curl_easy_init();
  409. if(!curl) {
  410. fprintf(stderr, "curl_easy_init() failed\n");
  411. close_file_descriptors();
  412. curl_global_cleanup();
  413. return TEST_ERR_MAJOR_BAD;
  414. }
  415. test_setopt(curl, CURLOPT_URL, URL);
  416. test_setopt(curl, CURLOPT_HEADER, 1L);
  417. res = curl_easy_perform(curl);
  418. test_cleanup:
  419. close_file_descriptors();
  420. curl_easy_cleanup(curl);
  421. curl_global_cleanup();
  422. return res;
  423. }
  424. #else /* defined(HAVE_GETRLIMIT) && defined(HAVE_SETRLIMIT) */
  425. CURLcode test(char *URL)
  426. {
  427. (void)URL;
  428. printf("system lacks necessary system function(s)");
  429. return (CURLcode)1; /* skip test */
  430. }
  431. #endif /* defined(HAVE_GETRLIMIT) && defined(HAVE_SETRLIMIT) */