7
7
* | (__| |_| | _ <| |___
8
8
* \___|\___/|_| \_\_____|
10
* Copyright (C) 1997 - 2006, Daniel Stenberg, <daniel@haxx.se>, et al.
10
* Copyright (C) 1997 - 2008, Daniel Stenberg, <daniel@haxx.se>, et al.
12
12
* This software is licensed as described in the file COPYING, which
13
13
* you should have received as part of this distribution. The terms
20
20
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
21
21
* KIND, either express or implied.
23
* $Id: splay.h,v 1.4 2007-09-27 01:45:23 danf Exp $
23
* $Id: splay.h,v 1.5 2008-05-07 15:41:41 yangtse Exp $
24
24
***************************************************************************/
27
27
struct Curl_tree *smaller; /* smaller node */
28
28
struct Curl_tree *larger; /* larger node */
29
29
struct Curl_tree *same; /* points to a node with identical key */
30
int key; /* the "sort" key */
30
struct timeval key; /* this node's "sort" key */
31
31
void *payload; /* data the splay code doesn't care about */
34
struct Curl_tree *Curl_splay(int i, struct Curl_tree *t);
35
struct Curl_tree *Curl_splayinsert(int key, struct Curl_tree *t,
34
struct Curl_tree *Curl_splay(struct timeval i,
37
struct Curl_tree *Curl_splayinsert(struct timeval key,
36
39
struct Curl_tree *newnode);
38
struct Curl_tree *Curl_splayremove(int key, struct Curl_tree *t,
42
struct Curl_tree *Curl_splayremove(struct timeval key,
39
44
struct Curl_tree **removed);
42
struct Curl_tree *Curl_splaygetbest(int key, struct Curl_tree *t,
47
struct Curl_tree *Curl_splaygetbest(struct timeval key,
43
49
struct Curl_tree **removed);
44
51
int Curl_splayremovebyaddr(struct Curl_tree *t,
45
52
struct Curl_tree *removenode,
46
53
struct Curl_tree **newroot);
55
#define Curl_splaycomparekeys(i,j) ( ((i.tv_sec) < (j.tv_sec)) ? -1 : \
56
( ((i.tv_sec) > (j.tv_sec)) ? 1 : \
57
( ((i.tv_usec) < (j.tv_usec)) ? -1 : \
58
( ((i.tv_usec) > (j.tv_usec)) ? 1 : 0 ))))
49
61
void Curl_splayprint(struct Curl_tree * t, int d, char output);