67 lines
		
	
	
		
			2.6 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			67 lines
		
	
	
		
			2.6 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| #ifndef __SPLAY_H
 | |
| #define __SPLAY_H
 | |
| /***************************************************************************
 | |
|  *                                  _   _ ____  _
 | |
|  *  Project                     ___| | | |  _ \| |
 | |
|  *                             / __| | | | |_) | |
 | |
|  *                            | (__| |_| |  _ <| |___
 | |
|  *                             \___|\___/|_| \_\_____|
 | |
|  *
 | |
|  * Copyright (C) 1997 - 2008, 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 http://curl.haxx.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.
 | |
|  *
 | |
|  * $Id: splay.h,v 1.5 2008-05-07 15:41:41 yangtse Exp $
 | |
|  ***************************************************************************/
 | |
| 
 | |
| struct Curl_tree {
 | |
|   struct Curl_tree *smaller; /* smaller node */
 | |
|   struct Curl_tree *larger;  /* larger node */
 | |
|   struct Curl_tree *same;    /* points to a node with identical key */
 | |
|   struct timeval key;        /* this node's "sort" key */
 | |
|   void *payload;             /* data the splay code doesn't care about */
 | |
| };
 | |
| 
 | |
| struct Curl_tree *Curl_splay(struct timeval i,
 | |
|                              struct Curl_tree *t);
 | |
| 
 | |
| struct Curl_tree *Curl_splayinsert(struct timeval key,
 | |
|                                    struct Curl_tree *t,
 | |
|                                    struct Curl_tree *newnode);
 | |
| 
 | |
| #if 0
 | |
| struct Curl_tree *Curl_splayremove(struct timeval key,
 | |
|                                    struct Curl_tree *t,
 | |
|                                    struct Curl_tree **removed);
 | |
| #endif
 | |
| 
 | |
| struct Curl_tree *Curl_splaygetbest(struct timeval key,
 | |
|                                     struct Curl_tree *t,
 | |
|                                     struct Curl_tree **removed);
 | |
| 
 | |
| int Curl_splayremovebyaddr(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 ))))
 | |
| 
 | |
| #ifdef CURLDEBUG
 | |
| void Curl_splayprint(struct Curl_tree * t, int d, char output);
 | |
| #else
 | |
| #define Curl_splayprint(x,y,z)
 | |
| #endif
 | |
| 
 | |
| #endif
 |