1#ifndef __SPLAY_H
2#define __SPLAY_H
3/***************************************************************************
4 *                                  _   _ ____  _
5 *  Project                     ___| | | |  _ \| |
6 *                             / __| | | | |_) | |
7 *                            | (__| |_| |  _ <| |___
8 *                             \___|\___/|_| \_\_____|
9 *
10 * Copyright (C) 1997 - 2009, Daniel Stenberg, <daniel@haxx.se>, et al.
11 *
12 * This software is licensed as described in the file COPYING, which
13 * you should have received as part of this distribution. The terms
14 * are also available at http://curl.haxx.se/docs/copyright.html.
15 *
16 * You may opt to use, copy, modify, merge, publish, distribute and/or sell
17 * copies of the Software, and permit persons to whom the Software is
18 * furnished to do so, under the terms of the COPYING file.
19 *
20 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
21 * KIND, either express or implied.
22 *
23 ***************************************************************************/
24
25struct Curl_tree {
26  struct Curl_tree *smaller; /* smaller node */
27  struct Curl_tree *larger;  /* larger node */
28  struct Curl_tree *same;    /* points to a node with identical key */
29  struct timeval key;        /* this node's "sort" key */
30  void *payload;             /* data the splay code doesn't care about */
31};
32
33struct Curl_tree *Curl_splay(struct timeval i,
34                             struct Curl_tree *t);
35
36struct Curl_tree *Curl_splayinsert(struct timeval key,
37                                   struct Curl_tree *t,
38                                   struct Curl_tree *newnode);
39
40#if 0
41struct Curl_tree *Curl_splayremove(struct timeval key,
42                                   struct Curl_tree *t,
43                                   struct Curl_tree **removed);
44#endif
45
46struct Curl_tree *Curl_splaygetbest(struct timeval key,
47                                    struct Curl_tree *t,
48                                    struct Curl_tree **removed);
49
50int Curl_splayremovebyaddr(struct Curl_tree *t,
51                           struct Curl_tree *removenode,
52                           struct Curl_tree **newroot);
53
54#define Curl_splaycomparekeys(i,j) ( ((i.tv_sec)  < (j.tv_sec))  ? -1 : \
55                                   ( ((i.tv_sec)  > (j.tv_sec))  ?  1 : \
56                                   ( ((i.tv_usec) < (j.tv_usec)) ? -1 : \
57                                   ( ((i.tv_usec) > (j.tv_usec)) ?  1 : 0 ))))
58
59#ifdef DEBUGBUILD
60void Curl_splayprint(struct Curl_tree * t, int d, char output);
61#else
62#define Curl_splayprint(x,y,z)
63#endif
64
65#endif
66