#include "setup.h"
#include "splay.h"
#define compare(i,j) Curl_splaycomparekeys((i),(j))
struct Curl_tree *Curl_splay(struct timeval i,
struct Curl_tree *t)
{
struct Curl_tree N, *l, *r, *y;
long comp;
if(t == NULL)
return t;
N.smaller = N.larger = NULL;
l = r = &N;
for (;;) {
comp = compare(i, t->key);
if(comp < 0) {
if(t->smaller == NULL)
break;
if(compare(i, t->smaller->key) < 0) {
y = t->smaller;
t->smaller = y->larger;
y->larger = t;
t = y;
if(t->smaller == NULL)
break;
}
r->smaller = t;
r = t;
t = t->smaller;
}
else if(comp > 0) {
if(t->larger == NULL)
break;
if(compare(i, t->larger->key) > 0) {
y = t->larger;
t->larger = y->smaller;
y->smaller = t;
t = y;
if(t->larger == NULL)
break;
}
l->larger = t;
l = t;
t = t->larger;
}
else
break;
}
l->larger = t->smaller;
r->smaller = t->larger;
t->smaller = N.larger;
t->larger = N.smaller;
return t;
}
struct Curl_tree *Curl_splayinsert(struct timeval i,
struct Curl_tree *t,
struct Curl_tree *node)
{
static struct timeval KEY_NOTUSED = {-1,-1};
if(node == NULL)
return t;
if(t != NULL) {
t = Curl_splay(i,t);
if(compare(i, t->key)==0) {
node->same = t;
node->key = i;
node->smaller = t->smaller;
node->larger = t->larger;
t->smaller = node;
t->key = KEY_NOTUSED;
return node;
}
}
if(t == NULL) {
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;
node->same = NULL;
return node;
}
#if 0
struct Curl_tree *Curl_splayremove(struct timeval i,
struct Curl_tree *t,
struct Curl_tree **removed)
{
struct Curl_tree *x;
*removed = NULL;
if(t==NULL)
return NULL;
t = Curl_splay(i,t);
if(compare(i, t->key) == 0) {
if((x = t->same) != NULL) {
x->key = t->key;
x->larger = t->larger;
x->smaller = t->smaller;
*removed = t;
return x;
}
if(t->smaller == NULL) {
x = t->larger;
}
else {
x = Curl_splay(i, t->smaller);
x->larger = t->larger;
}
*removed = t;
return x;
}
else
return t;
}
#endif
struct Curl_tree *Curl_splaygetbest(struct timeval i,
struct Curl_tree *t,
struct Curl_tree **removed)
{
struct Curl_tree *x;
if(!t) {
*removed = NULL;
return NULL;
}
t = Curl_splay(i,t);
if(compare(i, t->key) < 0) {
if(t->smaller)
t=Curl_splay(t->smaller->key, t);
else {
*removed = NULL;
return t;
}
}
if(compare(i, t->key) >= 0) {
x = t->same;
if(x) {
x->key = t->key;
x->larger = t->larger;
x->smaller = t->smaller;
*removed = t;
return x;
}
if(t->smaller == NULL) {
x = t->larger;
}
else {
x = Curl_splay(i, t->smaller);
x->larger = t->larger;
}
*removed = t;
return x;
}
else {
*removed = NULL;
return t;
}
}
int Curl_splayremovebyaddr(struct Curl_tree *t,
struct Curl_tree *removenode,
struct Curl_tree **newroot)
{
static struct timeval KEY_NOTUSED = {-1,-1};
struct Curl_tree *x;
if(!t || !removenode)
return 1;
if(compare(KEY_NOTUSED, removenode->key) == 0) {
if(removenode->smaller == NULL)
return 3;
removenode->smaller->same = removenode->same;
if(removenode->same)
removenode->same->smaller = removenode->smaller;
removenode->smaller = NULL;
*newroot = t;
return 0;
}
t = Curl_splay(removenode->key, t);
if(t != removenode)
return 2;
x = t->same;
if(x) {
x->key = t->key;
x->larger = t->larger;
x->smaller = t->smaller;
}
else {
if(t->smaller == NULL)
x = t->larger;
else {
x = Curl_splay(removenode->key, t->smaller);
x->larger = t->larger;
}
}
*newroot = x;
return 0;
}
#ifdef DEBUGBUILD
void Curl_splayprint(struct Curl_tree * t, int d, char output)
{
struct Curl_tree *node;
int i;
int count;
if(t == NULL)
return;
Curl_splayprint(t->larger, d+1, output);
for (i=0; i<d; i++)
if(output)
fprintf(stderr, " ");
if(output) {
#ifdef TEST_SPLAY
fprintf(stderr, "%ld[%d]", (long)t->key.tv_usec, i);
#else
fprintf(stderr, "%ld.%ld[%d]", (long)t->key.tv_sec, (long)t->key.tv_usec, i);
#endif
}
for(count=0, node = t->same; node; node = node->same, count++)
;
if(output) {
if(count)
fprintf(stderr, " [%d more]\n", count);
else
fprintf(stderr, "\n");
}
Curl_splayprint(t->smaller, d+1, output);
}
#endif
#ifdef TEST_SPLAY
#define MAX 50
#define TEST2
int main(int argc, argv_item_t argv[])
{
struct Curl_tree *root, *t;
void *ptrs[MAX];
int adds=0;
int rc;
static const long sizes[]={
50, 60, 50, 100, 60, 200, 120, 300, 400, 200, 256, 122, 60, 120, 200, 300,
220, 80, 90, 50, 100, 60, 200, 120, 300, 400, 200, 256, 122, 60, 120, 200,
300, 220, 80, 90, 50, 100, 60, 200, 120, 300, 400, 200, 256, 122, 60, 120,
200, 300, 220, 80, 90};
int i;
root = NULL;
for (i = 0; i < MAX; i++) {
struct timeval key;
ptrs[i] = t = malloc(sizeof(struct Curl_tree));
if(!t) {
puts("out of memory!");
return 0;
}
key.tv_sec = 0;
#ifdef TEST2
key.tv_usec = sizes[i];
#elif defined(TEST1)
key.tv_usec = (541*i)%1023;
#elif defined(TEST3)
key.tv_usec = 100;
#endif
t->payload = (void *)key.tv_usec;
root = Curl_splayinsert(key, root, t);
}
#if 0
puts("Result:");
Curl_splayprint(root, 0, 1);
#endif
#if 1
for (i = 0; i < MAX; i++) {
int rem = (i+7)%MAX;
struct Curl_tree *r;
printf("Tree look:\n");
Curl_splayprint(root, 0, 1);
printf("remove pointer %d, payload %ld\n", rem,
(long)((struct Curl_tree *)ptrs[rem])->payload);
rc = Curl_splayremovebyaddr(root, (struct Curl_tree *)ptrs[rem], &root);
if(rc)
printf("remove %d failed!\n", rem);
}
#endif
return 0;
}
#endif