Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 4 of 4) sorted by relevance

/curl/tests/unit/
H A Dunit1309.c77 struct Curl_tree nodes[NUM_NODES*3]; variable
91 Curl_splayset(&nodes[i], &storage[i]);
92 root = Curl_splayinsert(key, root, &nodes[i]);
103 *(size_t *)Curl_splayget(&nodes[rem]));
104 rc = Curl_splayremove(root, &nodes[rem], &root);
124 Curl_splayset(&nodes[i * 3 + j], &storage[i * 3 + j]);
125 root = Curl_splayinsert(key, root, &nodes[i * 3 + j]);
/curl/tests/data/
H A Dtest13091451 Removing nodes not larger than 0
1453 Removing nodes not larger than 100
1463 Removing nodes not larger than 200
1473 Removing nodes not larger than 300
1486 Removing nodes not larger than 400
1494 Removing nodes not larger than 500
1503 Removing nodes not larger than 600
1516 Removing nodes not larger than 700
1526 Removing nodes not larger than 800
1536 Removing nodes not larger than 900
[all …]
/curl/lib/
H A Dhostip.c411 struct Curl_addrinfo **nodes; in Curl_shuffle_addr() local
414 nodes = malloc(num_addrs*sizeof(*nodes)); in Curl_shuffle_addr()
415 if(nodes) { in Curl_shuffle_addr()
421 nodes[0] = *addr; in Curl_shuffle_addr()
423 nodes[i] = nodes[i-1]->ai_next; in Curl_shuffle_addr()
433 nodes[rnd[i] % (unsigned int)(i + 1)] = nodes[i]; in Curl_shuffle_addr()
434 nodes[i] = swap_tmp; in Curl_shuffle_addr()
439 nodes[i-1]->ai_next = nodes[i]; in Curl_shuffle_addr()
442 nodes[num_addrs-1]->ai_next = NULL; in Curl_shuffle_addr()
443 *addr = nodes[0]; in Curl_shuffle_addr()
[all …]
H A Dasyn-ares.c740 res->temp_ai = ares2addr(result->nodes); in addrinfo_cb()

Completed in 17 milliseconds