/src/PROJ/curl/lib/splay.c

Source (jump to first uncovered line)
/***************************************************************************
 *                                  _   _ ____  _
 *  Project                     ___| | | |  _ \| |
 *                             / __| | | | |_) | |
 *                            | (__| |_| |  _ <| |___
 *                             \___|\___/|_| \_\_____|
 *
 * Copyright (C) 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.
 *
 * SPDX-License-Identifier: curl
 *
 ***************************************************************************/

#include "curl_setup.h"

#include "splay.h"

/*
 * This macro compares two node keys i and j and returns:
 *
 *  negative value: when i is smaller than j
 *  zero          : when i is equal   to   j
 *  positive when : when i is larger  than j
 */
#define compare(i,j) Curl_splaycomparekeys((i),(j))

/*
 * Splay using the key i (which may or may not be in the tree.) The starting
 * root is t.
 */
struct Curl_tree *Curl_splay(struct curltime i,
                             struct Curl_tree *t)
{
  struct Curl_tree N, *l, *r, *y;

  if(!t)
    return t;
  N.smaller = N.larger = NULL;
  l = r = &N;

  for(;;) {
    long comp = compare(i, t->key);
    if(comp < 0) {
      if(!t->smaller)
        break;
      if(compare(i, t->smaller->key) < 0) {
        y = t->smaller;                           /* rotate smaller */
        t->smaller = y->larger;
        y->larger = t;
        t = y;
        if(!t->smaller)
          break;
      }
      r->smaller = t;                               /* link smaller */
      r = t;
      t = t->smaller;
    }
    else if(comp > 0) {
      if(!t->larger)
        break;
      if(compare(i, t->larger->key) > 0) {
        y = t->larger;                          /* rotate larger */
        t->larger = y->smaller;
        y->smaller = t;
        t = y;
        if(!t->larger)
          break;
      }
      l->larger = t;                              /* link larger */
      l = t;
      t = t->larger;
    }
    else
      break;
  }

  l->larger = t->smaller;                                /* assemble */
  r->smaller = t->larger;
  t->smaller = N.larger;
  t->larger = N.smaller;

  return t;
}

/* Insert key i into the tree t.  Return a pointer to the resulting tree or
 * NULL if something went wrong.
 *
 * @unittest: 1309
 */
struct Curl_tree *Curl_splayinsert(struct curltime i,
                                   struct Curl_tree *t,
                                   struct Curl_tree *node)
{
  static const struct curltime KEY_NOTUSED = {
    ~0, -1
  }; /* will *NEVER* appear */

  if(!node)
    return t;

  if(t) {
    t = Curl_splay(i, t);
    if(compare(i, t->key) == 0) {
      /* There already exists a node in the tree with the very same key. Build
         a doubly-linked circular list of nodes. We add the new 'node' struct
         to the end of this list. */

      node->key = KEY_NOTUSED; /* we set the key in the sub node to NOTUSED
                                  to quickly identify this node as a subnode */
      node->samen = t;
      node->samep = t->samep;
      t->samep->samen = node;
      t->samep = node;

      return t; /* the root node always stays the same */
    }
  }

  if(!t) {
    node->smaller = node->larger = NULL;
  }
  else if(compare(i, t->key) < 0) {
    node->smaller = t->smaller;
    node->larger = t;
    t->smaller = NULL;

  }
  else {
    node->larger = t->larger;
    node->smaller = t;
    t->larger = NULL;
  }
  node->key = i;

  /* no identical nodes (yet), we are the only one in the list of nodes */
  node->samen = node;
  node->samep = node;
  return node;
}

/* Finds and deletes the best-fit node from the tree. Return a pointer to the
   resulting tree.  best-fit means the smallest node if it is not larger than
   the key */
struct Curl_tree *Curl_splaygetbest(struct curltime i,
                                    struct Curl_tree *t,
                                    struct Curl_tree **removed)
{
  static const struct curltime tv_zero = {0, 0};
  struct Curl_tree *x;

  if(!t) {
    *removed = NULL; /* none removed since there was no root */
    return NULL;
  }

  /* find smallest */
  t = Curl_splay(tv_zero, t);
  if(compare(i, t->key) < 0) {
    /* even the smallest is too big */
    *removed = NULL;
    return t;
  }

  /* FIRST! Check if there is a list with identical keys */
  x = t->samen;
  if(x != t) {
    /* there is, pick one from the list */

    /* 'x' is the new root node */

    x->key = t->key;
    x->larger = t->larger;
    x->smaller = t->smaller;
    x->samep = t->samep;
    t->samep->samen = x;

    *removed = t;
    return x; /* new root */
  }

  /* we splayed the tree to the smallest element, there is no smaller */
  x = t->larger;
  *removed = t;

  return x;
}


/* Deletes the very node we point out from the tree if it's there. Stores a
 * pointer to the new resulting tree in 'newroot'.
 *
 * Returns zero on success and non-zero on errors!
 * When returning error, it does not touch the 'newroot' pointer.
 *
 * NOTE: when the last node of the tree is removed, there's no tree left so
 * 'newroot' will be made to point to NULL.
 *
 * @unittest: 1309
 */
int Curl_splayremove(struct Curl_tree *t,
                     struct Curl_tree *removenode,
                     struct Curl_tree **newroot)
{
  static const struct curltime KEY_NOTUSED = {
    ~0, -1
  }; /* will *NEVER* appear */
  struct Curl_tree *x;

  if(!t || !removenode)
    return 1;

  if(compare(KEY_NOTUSED, removenode->key) == 0) {
    /* Key set to NOTUSED means it is a subnode within a 'same' linked list
       and thus we can unlink it easily. */
    if(removenode->samen == removenode)
      /* A non-subnode should never be set to KEY_NOTUSED */
      return 3;

    removenode->samep->samen = removenode->samen;
    removenode->samen->samep = removenode->samep;

    /* Ensures that double-remove gets caught. */
    removenode->samen = removenode;

    *newroot = t; /* return the same root */
    return 0;
  }

  t = Curl_splay(removenode->key, t);

  /* First make sure that we got the same root node as the one we want
     to remove, as otherwise we might be trying to remove a node that
     isn't actually in the tree.

     We cannot just compare the keys here as a double remove in quick
     succession of a node with key != KEY_NOTUSED && same != NULL
     could return the same key but a different node. */
  if(t != removenode)
    return 2;

  /* Check if there is a list with identical sizes, as then we're trying to
     remove the root node of a list of nodes with identical keys. */
  x = t->samen;
  if(x != t) {
    /* 'x' is the new root node, we just make it use the root node's
       smaller/larger links */

    x->key = t->key;
    x->larger = t->larger;
    x->smaller = t->smaller;
    x->samep = t->samep;
    t->samep->samen = x;
  }
  else {
    /* Remove the root node */
    if(!t->smaller)
      x = t->larger;
    else {
      x = Curl_splay(removenode->key, t->smaller);
      x->larger = t->larger;
    }
  }

  *newroot = x; /* store new root pointer */

  return 0;
}

Coverage Report

Created: 2024-02-25 06:14

Line	Count	Source (jump to first uncovered line)
1		/***************************************************************************
2		* _ _ ____ _
3		* Project ___\| \| \| \| _ \\| \|
4		* / __\| \| \| \| \|_) \| \|
5		* \| (__\| \|_\| \| _ <\| \|___
6		* \___\|\___/\|_\| \_\_____\|
7		*
8		* Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
9		*
10		* This software is licensed as described in the file COPYING, which
11		* you should have received as part of this distribution. The terms
12		* are also available at https://curl.se/docs/copyright.html.
13		*
14		* You may opt to use, copy, modify, merge, publish, distribute and/or sell
15		* copies of the Software, and permit persons to whom the Software is
16		* furnished to do so, under the terms of the COPYING file.
17		*
18		* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
19		* KIND, either express or implied.
20		*
21		* SPDX-License-Identifier: curl
22		*
23		***************************************************************************/
24
25		#include "curl_setup.h"
26
27		#include "splay.h"
28
29		/*
30		* This macro compares two node keys i and j and returns:
31		*
32		* negative value: when i is smaller than j
33		* zero : when i is equal to j
34		* positive when : when i is larger than j
35		*/
36	0	#define compare(i,j) Curl_splaycomparekeys((i),(j))
37
38		/*
39		* Splay using the key i (which may or may not be in the tree.) The starting
40		* root is t.
41		*/
42		struct Curl_tree *Curl_splay(struct curltime i,
43		struct Curl_tree *t)
44	0	{
45	0	struct Curl_tree N, l, r, *y;
46
47	0	if(!t)
48	0	return t;
49	0	N.smaller = N.larger = NULL;
50	0	l = r = &N;
51
52	0	for(;;) {
53	0	long comp = compare(i, t->key);
54	0	if(comp < 0) {
55	0	if(!t->smaller)
56	0	break;
57	0	if(compare(i, t->smaller->key) < 0) {
58	0	y = t->smaller; /* rotate smaller */
59	0	t->smaller = y->larger;
60	0	y->larger = t;
61	0	t = y;
62	0	if(!t->smaller)
63	0	break;
64	0	}
65	0	r->smaller = t; /* link smaller */
66	0	r = t;
67	0	t = t->smaller;
68	0	}
69	0	else if(comp > 0) {
70	0	if(!t->larger)
71	0	break;
72	0	if(compare(i, t->larger->key) > 0) {
73	0	y = t->larger; /* rotate larger */
74	0	t->larger = y->smaller;
75	0	y->smaller = t;
76	0	t = y;
77	0	if(!t->larger)
78	0	break;
79	0	}
80	0	l->larger = t; /* link larger */
81	0	l = t;
82	0	t = t->larger;
83	0	}
84	0	else
85	0	break;
86	0	}
87
88	0	l->larger = t->smaller; /* assemble */
89	0	r->smaller = t->larger;
90	0	t->smaller = N.larger;
91	0	t->larger = N.smaller;
92
93	0	return t;
94	0	}
95
96		/* Insert key i into the tree t. Return a pointer to the resulting tree or
97		* NULL if something went wrong.
98		*
99		* @unittest: 1309
100		*/
101		struct Curl_tree *Curl_splayinsert(struct curltime i,
102		struct Curl_tree *t,
103		struct Curl_tree *node)
104	0	{
105	0	static const struct curltime KEY_NOTUSED = {
106	0	~0, -1
107	0	}; /* will NEVER appear */
108
109	0	if(!node)
110	0	return t;
111
112	0	if(t) {
113	0	t = Curl_splay(i, t);
114	0	if(compare(i, t->key) == 0) {
115		/* There already exists a node in the tree with the very same key. Build
116		a doubly-linked circular list of nodes. We add the new 'node' struct
117		to the end of this list. */
118
119	0	node->key = KEY_NOTUSED; /* we set the key in the sub node to NOTUSED
120		to quickly identify this node as a subnode */
121	0	node->samen = t;
122	0	node->samep = t->samep;
123	0	t->samep->samen = node;
124	0	t->samep = node;
125
126	0	return t; /* the root node always stays the same */
127	0	}
128	0	}
129
130	0	if(!t) {
131	0	node->smaller = node->larger = NULL;
132	0	}
133	0	else if(compare(i, t->key) < 0) {
134	0	node->smaller = t->smaller;
135	0	node->larger = t;
136	0	t->smaller = NULL;
137
138	0	}
139	0	else {
140	0	node->larger = t->larger;
141	0	node->smaller = t;
142	0	t->larger = NULL;
143	0	}
144	0	node->key = i;
145
146		/* no identical nodes (yet), we are the only one in the list of nodes */
147	0	node->samen = node;
148	0	node->samep = node;
149	0	return node;
150	0	}
151
152		/* Finds and deletes the best-fit node from the tree. Return a pointer to the
153		resulting tree. best-fit means the smallest node if it is not larger than
154		the key */
155		struct Curl_tree *Curl_splaygetbest(struct curltime i,
156		struct Curl_tree *t,
157		struct Curl_tree **removed)
158	0	{
159	0	static const struct curltime tv_zero = {0, 0};
160	0	struct Curl_tree *x;
161
162	0	if(!t) {
163	0	removed = NULL; / none removed since there was no root */
164	0	return NULL;
165	0	}
166
167		/* find smallest */
168	0	t = Curl_splay(tv_zero, t);
169	0	if(compare(i, t->key) < 0) {
170		/* even the smallest is too big */
171	0	*removed = NULL;
172	0	return t;
173	0	}
174
175		/* FIRST! Check if there is a list with identical keys */
176	0	x = t->samen;
177	0	if(x != t) {
178		/* there is, pick one from the list */
179
180		/* 'x' is the new root node */
181
182	0	x->key = t->key;
183	0	x->larger = t->larger;
184	0	x->smaller = t->smaller;
185	0	x->samep = t->samep;
186	0	t->samep->samen = x;
187
188	0	*removed = t;
189	0	return x; /* new root */
190	0	}
191
192		/* we splayed the tree to the smallest element, there is no smaller */
193	0	x = t->larger;
194	0	*removed = t;
195
196	0	return x;
197	0	}
198
199
200		/* Deletes the very node we point out from the tree if it's there. Stores a
201		* pointer to the new resulting tree in 'newroot'.
202		*
203		* Returns zero on success and non-zero on errors!
204		* When returning error, it does not touch the 'newroot' pointer.
205		*
206		* NOTE: when the last node of the tree is removed, there's no tree left so
207		* 'newroot' will be made to point to NULL.
208		*
209		* @unittest: 1309
210		*/
211		int Curl_splayremove(struct Curl_tree *t,
212		struct Curl_tree *removenode,
213		struct Curl_tree **newroot)
214	0	{
215	0	static const struct curltime KEY_NOTUSED = {
216	0	~0, -1
217	0	}; /* will NEVER appear */
218	0	struct Curl_tree *x;
219
220	0	if(!t \|\| !removenode)
221	0	return 1;
222
223	0	if(compare(KEY_NOTUSED, removenode->key) == 0) {
224		/* Key set to NOTUSED means it is a subnode within a 'same' linked list
225		and thus we can unlink it easily. */
226	0	if(removenode->samen == removenode)
227		/* A non-subnode should never be set to KEY_NOTUSED */
228	0	return 3;
229
230	0	removenode->samep->samen = removenode->samen;
231	0	removenode->samen->samep = removenode->samep;
232
233		/* Ensures that double-remove gets caught. */
234	0	removenode->samen = removenode;
235
236	0	newroot = t; / return the same root */
237	0	return 0;
238	0	}
239
240	0	t = Curl_splay(removenode->key, t);
241
242		/* First make sure that we got the same root node as the one we want
243		to remove, as otherwise we might be trying to remove a node that
244		isn't actually in the tree.
245
246		We cannot just compare the keys here as a double remove in quick
247		succession of a node with key != KEY_NOTUSED && same != NULL
248		could return the same key but a different node. */
249	0	if(t != removenode)
250	0	return 2;
251
252		/* Check if there is a list with identical sizes, as then we're trying to
253		remove the root node of a list of nodes with identical keys. */
254	0	x = t->samen;
255	0	if(x != t) {
256		/* 'x' is the new root node, we just make it use the root node's
257		smaller/larger links */
258
259	0	x->key = t->key;
260	0	x->larger = t->larger;
261	0	x->smaller = t->smaller;
262	0	x->samep = t->samep;
263	0	t->samep->samen = x;
264	0	}
265	0	else {
266		/* Remove the root node */
267	0	if(!t->smaller)
268	0	x = t->larger;
269	0	else {
270	0	x = Curl_splay(removenode->key, t->smaller);
271	0	x->larger = t->larger;
272	0	}
273	0	}
274
275	0	newroot = x; / store new root pointer */
276
277	0	return 0;
278	0	}