Home | History | Annotate | Download | only in lib 
      1 #ifndef HEADER_CURL_SPLAY_H
      2 #define HEADER_CURL_SPLAY_H
      3 /***************************************************************************
      4  *                                  _   _ ____  _
      5  *  Project                     ___| | | |  _ \| |
      6  *                             / __| | | | |_) | |
      7  *                            | (__| |_| |  _ <| |___
      8  *                             \___|\___/|_| \_\_____|
      9  *
     10  * Copyright (C) 1997 - 2017, Daniel Stenberg, <daniel (at) 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 https://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 #include "curl_setup.h"
     25 #include "timeval.h"
     26 
     27 struct Curl_tree {
     28   struct Curl_tree *smaller; /* smaller node */
     29   struct Curl_tree *larger;  /* larger node */
     30   struct Curl_tree *samen;   /* points to the next node with identical key */
     31   struct Curl_tree *samep;   /* points to the prev node with identical key */
     32   struct curltime key;        /* this node's "sort" key */
     33   void *payload;             /* data the splay code doesn't care about */
     34 };
     35 
     36 struct Curl_tree *Curl_splay(struct curltime i,
     37                              struct Curl_tree *t);
     38 
     39 struct Curl_tree *Curl_splayinsert(struct curltime key,
     40                                    struct Curl_tree *t,
     41                                    struct Curl_tree *newnode);
     42 
     43 #if 0
     44 struct Curl_tree *Curl_splayremove(struct curltime key,
     45                                    struct Curl_tree *t,
     46                                    struct Curl_tree **removed);
     47 #endif
     48 
     49 struct Curl_tree *Curl_splaygetbest(struct curltime key,
     50                                     struct Curl_tree *t,
     51                                     struct Curl_tree **removed);
     52 
     53 int Curl_splayremovebyaddr(struct Curl_tree *t,
     54                            struct Curl_tree *removenode,
     55                            struct Curl_tree **newroot);
     56 
     57 #define Curl_splaycomparekeys(i,j) ( ((i.tv_sec)  < (j.tv_sec)) ? -1 : \
     58                                    ( ((i.tv_sec)  > (j.tv_sec)) ?  1 : \
     59                                    ( ((i.tv_usec) < (j.tv_usec)) ? -1 : \
     60                                    ( ((i.tv_usec) > (j.tv_usec)) ?  1 : 0))))
     61 
     62 #ifdef DEBUGBUILD
     63 void Curl_splayprint(struct Curl_tree * t, int d, char output);
     64 #else
     65 #define Curl_splayprint(x,y,z) Curl_nop_stmt
     66 #endif
     67 
     68 #endif /* HEADER_CURL_SPLAY_H */
     69