aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/curl/lib/splay.h
blob: 7b979cca37362194933c51a774af4208bd08b885 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#ifndef HEADER_CURL_SPLAY_H 
#define HEADER_CURL_SPLAY_H 
/*************************************************************************** 
 *                                  _   _ ____  _ 
 *  Project                     ___| | | |  _ \| | 
 *                             / __| | | | |_) | | 
 *                            | (__| |_| |  _ <| |___ 
 *                             \___|\___/|_| \_\_____| 
 * 
 * Copyright (C) 1997 - 2020, 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. 
 * 
 ***************************************************************************/ 
#include "curl_setup.h" 
#include "timeval.h"
 
struct Curl_tree { 
  struct Curl_tree *smaller; /* smaller node */ 
  struct Curl_tree *larger;  /* larger node */ 
  struct Curl_tree *samen;   /* points to the next node with identical key */
  struct Curl_tree *samep;   /* points to the prev node with identical key */
  struct curltime key;        /* this node's "sort" key */
  void *payload;             /* data the splay code doesn't care about */ 
}; 
 
struct Curl_tree *Curl_splay(struct curltime i,
                             struct Curl_tree *t); 
 
struct Curl_tree *Curl_splayinsert(struct curltime key,
                                   struct Curl_tree *t, 
                                   struct Curl_tree *newnode); 
 
struct Curl_tree *Curl_splaygetbest(struct curltime key,
                                    struct Curl_tree *t, 
                                    struct Curl_tree **removed); 
 
int Curl_splayremove(struct Curl_tree *t,
                     struct Curl_tree *removenode,
                     struct Curl_tree **newroot);
 
#define Curl_splaycomparekeys(i,j) ( ((i.tv_sec)  < (j.tv_sec)) ? -1 : \
                                   ( ((i.tv_sec)  > (j.tv_sec)) ?  1 : \
                                   ( ((i.tv_usec) < (j.tv_usec)) ? -1 : \ 
                                   ( ((i.tv_usec) > (j.tv_usec)) ?  1 : 0))))
 
#endif /* HEADER_CURL_SPLAY_H */