mirror of
https://github.com/curl/curl.git
synced 2026-04-14 00:51:42 +08:00
4deea9396b
To make the source code match the functions called at runtime. And to avoid the preprocessor trick that may introduces build issues. Before this patch, libtests, tunits and units were calling a mixture of curl and system printf calls, then transformed them all to curl printf calls by including `curl_printf.h`. Changes made: - tests: stop including `curl_printf.h`. - libtest: switch a couple of outlier system printf calls to curl printf. - unit: use more curl printf to avoid casts and show whole values. - unit: switch remaining calls to curl printf explicitly. - tunit: switch to call curl printf explicitly. - libtest, tunit, unit: ban system printf. - unit1307, unit1607, unit1609, unit1652, unit1655, unit3214: bump types/masks to avoid casts. After this patch: - libtests, tunits, units: use exclusively curl printf. (as before, but explicitly, without relying on redefinitions.) - servers: is unchanged (it can only use system printf). Closes #18814
135 lines
3.7 KiB
C
135 lines
3.7 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 "unitcheck.h"
|
|
|
|
#include "splay.h"
|
|
|
|
static void splayprint(struct Curl_tree *t, int d, char output)
|
|
{
|
|
struct Curl_tree *node;
|
|
int i;
|
|
int count;
|
|
if(!t)
|
|
return;
|
|
|
|
splayprint(t->larger, d + 1, output);
|
|
for(i = 0; i < d; i++)
|
|
if(output)
|
|
curl_mprintf(" ");
|
|
|
|
if(output) {
|
|
curl_mprintf("%ld.%ld[%d]", (long)t->key.tv_sec, (long)t->key.tv_usec, i);
|
|
}
|
|
|
|
for(count = 0, node = t->samen; node != t; node = node->samen, count++)
|
|
;
|
|
|
|
if(output) {
|
|
if(count)
|
|
curl_mprintf(" [%d more]\n", count);
|
|
else
|
|
curl_mprintf("\n");
|
|
}
|
|
|
|
splayprint(t->smaller, d + 1, output);
|
|
}
|
|
|
|
static CURLcode test_unit1309(const char *arg)
|
|
{
|
|
UNITTEST_BEGIN_SIMPLE
|
|
|
|
/* number of nodes to add to the splay tree */
|
|
#define NUM_NODES 50
|
|
|
|
struct Curl_tree *root, *removed;
|
|
struct Curl_tree nodes[NUM_NODES*3];
|
|
size_t storage[NUM_NODES*3];
|
|
int rc;
|
|
int i, j;
|
|
struct curltime tv_now = {0, 0};
|
|
root = NULL; /* the empty tree */
|
|
|
|
/* add nodes */
|
|
for(i = 0; i < NUM_NODES; i++) {
|
|
struct curltime key;
|
|
|
|
key.tv_sec = 0;
|
|
key.tv_usec = (541*i)%1023;
|
|
storage[i] = key.tv_usec;
|
|
Curl_splayset(&nodes[i], &storage[i]);
|
|
root = Curl_splayinsert(key, root, &nodes[i]);
|
|
}
|
|
|
|
puts("Result:");
|
|
splayprint(root, 0, 1);
|
|
|
|
for(i = 0; i < NUM_NODES; i++) {
|
|
int rem = (i + 7)%NUM_NODES;
|
|
curl_mprintf("Tree look:\n");
|
|
splayprint(root, 0, 1);
|
|
curl_mprintf("remove pointer %d, payload %zu\n", rem,
|
|
*(size_t *)Curl_splayget(&nodes[rem]));
|
|
rc = Curl_splayremove(root, &nodes[rem], &root);
|
|
if(rc) {
|
|
/* failed! */
|
|
curl_mprintf("remove %d failed!\n", rem);
|
|
fail("remove");
|
|
}
|
|
}
|
|
|
|
fail_unless(root == NULL, "tree not empty after removing all nodes");
|
|
|
|
/* rebuild tree */
|
|
for(i = 0; i < NUM_NODES; i++) {
|
|
struct curltime key;
|
|
|
|
key.tv_sec = 0;
|
|
key.tv_usec = (541*i)%1023;
|
|
|
|
/* add some nodes with the same key */
|
|
for(j = 0; j <= i % 3; j++) {
|
|
storage[i * 3 + j] = key.tv_usec*10 + j;
|
|
Curl_splayset(&nodes[i * 3 + j], &storage[i * 3 + j]);
|
|
root = Curl_splayinsert(key, root, &nodes[i * 3 + j]);
|
|
}
|
|
}
|
|
|
|
removed = NULL;
|
|
for(i = 0; i <= 1100; i += 100) {
|
|
curl_mprintf("Removing nodes not larger than %d\n", i);
|
|
tv_now.tv_usec = i;
|
|
root = Curl_splaygetbest(tv_now, root, &removed);
|
|
while(removed) {
|
|
curl_mprintf("removed payload %zu[%zu]\n",
|
|
*(size_t *)Curl_splayget(removed) / 10,
|
|
*(size_t *)Curl_splayget(removed) % 10);
|
|
root = Curl_splaygetbest(tv_now, root, &removed);
|
|
}
|
|
}
|
|
|
|
fail_unless(root == NULL, "tree not empty when it should be");
|
|
|
|
UNITTEST_END_SIMPLE
|
|
}
|