splay.h 2.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  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@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. struct Curl_tree {
  27. struct Curl_tree *smaller; /* smaller node */
  28. struct Curl_tree *larger; /* larger node */
  29. struct Curl_tree *samen; /* points to the next node with identical key */
  30. struct Curl_tree *samep; /* points to the prev node with identical key */
  31. struct curltime key; /* this node's "sort" key */
  32. void *payload; /* data the splay code doesn't care about */
  33. };
  34. struct Curl_tree *Curl_splay(struct curltime i,
  35. struct Curl_tree *t);
  36. struct Curl_tree *Curl_splayinsert(struct curltime key,
  37. struct Curl_tree *t,
  38. struct Curl_tree *newnode);
  39. #if 0
  40. struct Curl_tree *Curl_splayremove(struct curltime key,
  41. struct Curl_tree *t,
  42. struct Curl_tree **removed);
  43. #endif
  44. struct Curl_tree *Curl_splaygetbest(struct curltime key,
  45. struct Curl_tree *t,
  46. struct Curl_tree **removed);
  47. int Curl_splayremovebyaddr(struct Curl_tree *t,
  48. struct Curl_tree *removenode,
  49. struct Curl_tree **newroot);
  50. #define Curl_splaycomparekeys(i,j) ( ((i.tv_sec) < (j.tv_sec)) ? -1 : \
  51. ( ((i.tv_sec) > (j.tv_sec)) ? 1 : \
  52. ( ((i.tv_usec) < (j.tv_usec)) ? -1 : \
  53. ( ((i.tv_usec) > (j.tv_usec)) ? 1 : 0))))
  54. #ifdef DEBUGBUILD
  55. void Curl_splayprint(struct Curl_tree * t, int d, char output);
  56. #else
  57. #define Curl_splayprint(x,y,z) Curl_nop_stmt
  58. #endif
  59. #endif /* HEADER_CURL_SPLAY_H */