34 #define compare(i,j) Curl_splaycomparekeys((i),(j)) 104 static const struct curltime KEY_NOTUSED = {
105 (time_t)-1, (
unsigned int)-1
118 node->
key = KEY_NOTUSED;
158 static struct curltime tv_zero = {0, 0};
214 static const struct curltime KEY_NOTUSED = {
215 (time_t)-1, (
unsigned int)-1
219 if(!t || !removenode)
222 if(
compare(KEY_NOTUSED, removenode->
key) == 0) {
225 if(removenode->
samen == removenode)
233 removenode->
samen = removenode;
struct Curl_tree * Curl_splaygetbest(struct curltime i, struct Curl_tree *t, struct Curl_tree **removed)
struct Curl_tree * larger
TFSIMD_FORCE_INLINE const tfScalar & y() const
struct Curl_tree * removed
struct Curl_tree * smaller
struct Curl_tree * Curl_splayinsert(struct curltime i, struct Curl_tree *t, struct Curl_tree *node)
TFSIMD_FORCE_INLINE const tfScalar & x() const
struct Curl_tree * Curl_splay(struct curltime i, struct Curl_tree *t)
int Curl_splayremovebyaddr(struct Curl_tree *t, struct Curl_tree *removenode, struct Curl_tree **newroot)