torture_rbtree.c 17.4 KB
Newer Older
Pekka Pessi's avatar
Pekka Pessi committed
1 2 3 4 5 6 7
/*
 * This file is part of the Sofia-SIP package
 *
 * Copyright (C) 2005 Nokia Corporation.
 *
 * Contact: Pekka Pessi <pekka.pessi@nokia.com>
 *
8
 * This library is free software; you can redistribute it and/or
Pekka Pessi's avatar
Pekka Pessi committed
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA
 *
 */

/**
 * @file torture_rbtree.c
 * @brief Test red-black tree
 *
 * @author Pekka Pessi <Pekka.Pessi@nokia.com>
 *
 * @date Created: Wed Mar 10 17:05:23 2004 ppessi
 *
 */

#include "config.h"

#include <stddef.h>
#include <string.h>
#include <assert.h>
#include <errno.h>

42
#include "sofia-sip/rbtree.h"
Pekka Pessi's avatar
Pekka Pessi committed
43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

typedef struct node Node;

struct node {
  Node *left, *right, *parent;
  int black;
  int value;
  int inserted;
};

int tstflags;

#define TSTFLAGS tstflags

#include <stdio.h>
58
#include <sofia-sip/tstdef.h>
Pekka Pessi's avatar
Pekka Pessi committed
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74

char const *name = "torture_rbtree";

/* Define accessor macros */
#define LEFT(node) ((node)->left)
#define RIGHT(node) ((node)->right)
#define PARENT(node) ((node)->parent)
#define SET_RED(node) ((node)->black = 0)
#define SET_BLACK(node) ((node)->black = 1)
#define CMP(a, b) ((a)->value - (b)->value)
#define IS_RED(node) ((node) && (node)->black == 0)
#define IS_BLACK(node) (!(node) || (node)->black == 1)
#define COPY_COLOR(dst, src) ((dst)->black = (src)->black)
#define INSERT(node) ((void)0)
#define REMOVE(node) ((node)->left = (node)->right = (node)->parent = NULL)

Pekka Pessi's avatar
Pekka Pessi committed
75
RBTREE_PROTOS(static inline, redblack, Node);
Pekka Pessi's avatar
Pekka Pessi committed
76

Pekka Pessi's avatar
Pekka Pessi committed
77
RBTREE_BODIES(static inline, redblack, Node, LEFT, RIGHT, PARENT,
Pekka Pessi's avatar
Pekka Pessi committed
78 79 80
	      IS_RED, SET_RED, IS_BLACK, SET_BLACK, COPY_COLOR,
	      CMP, INSERT, REMOVE);

81
#include <sofia-sip/su_alloc.h>
Pekka Pessi's avatar
Pekka Pessi committed
82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171

static
Node *node_new(su_home_t *home, int value)
{
  Node *n = su_zalloc(home, sizeof (*n));
  
  n->value = value;

  return n;
}

/** ceil of log2 */
unsigned log2ceil(unsigned k)
{
  unsigned result = 0;

#if 0
  if (k > (1 << 32))
    result += 32, k = (k >> 32) + ((k & ((1 << 32) - 1)) != 0);
#endif
  if (k > (1 << 16)) 
    result += 16, k = (k >> 16) + ((k & ((1 << 16) - 1)) != 0);
  if (k > (1 << 8)) 
    result += 8, k = (k >> 8) + ((k & ((1 << 8) - 1)) != 0);
  if (k > (1 << 4))
    result += 4, k = (k >> 4) + ((k & 15) != 0);
  if (k > (1 << 2))
    result += 2, k = (k >> 2) + ((k & 3) != 0);
  if (k > (1 << 1))
    result += 1, k = (k >> 1) + (k & 1);
  if (k > 1)
    result += 1;
  
  return result;
}

static
Node *node_find(Node *tree, int value)
{
  while (tree) {
    if (tree->value == value)
      break;
    else if (tree->value < value)
      tree = tree->right;
    else
      tree = tree->left;
  }
   
  return tree;
}

/** Check consistency */
static
int redblack_check(Node const *n)
{
  Node const *l, *r;

  if (!n)
    return 1;

  l = n->left, r = n->right;

  if (n->black || ((!l || l->black) && (!r || r->black)))
    return (!l || redblack_check(l)) && (!r || redblack_check(r));
  else
    return 0;
}

int test_insert(void)
{
  su_home_t *home;
  Node *tree = NULL, *o, *old;
  Node *one, *three, *five, *six, *seven;

  BEGIN();

  home = su_home_clone(NULL, sizeof(*home)); TEST_1(home);
  one = node_new(home, 1);
  three = node_new(home, 3);
  five = node_new(home, 5);
  six = node_new(home, 6);
  seven = node_new(home, 7);

  TEST_1(one); 
  TEST_1(three);
  TEST_1(five);
  TEST_1(six);
  TEST_1(seven);

  /* Check single node */
172 173 174 175
  TEST(redblack_insert(&tree, five, &o), 0); TEST_P(o, NULL);
  TEST_P(tree, five);
  TEST_P(five->left, NULL); TEST_P(five->right, NULL);
  TEST_P(five->parent, NULL); TEST(five->black, 1);
Pekka Pessi's avatar
Pekka Pessi committed
176 177 178 179 180 181 182

  /* Check after another node: 
   *
   *         5b
   *        / 
   *       3r
   */
183 184 185 186
  TEST(redblack_insert(&tree, three, &o), 0); TEST_P(o, NULL);
  TEST_P(tree->left, three); TEST(tree->black, 1);
  TEST_P(three->left, NULL); TEST_P(three->right, NULL);
  TEST_P(three->parent, tree); TEST(three->black, 0); 
Pekka Pessi's avatar
Pekka Pessi committed
187 188 189 190 191 192

  /* Check third node
   *         5b
   *        / \
   *       3r  7r
   */
193 194 195 196
  TEST(redblack_insert(&tree, seven, &o), 0); TEST_P(o, NULL);
  TEST_P(tree->right, seven); TEST(tree->black, 1);
  TEST_P(seven->left, NULL); TEST_P(seven->right, NULL);
  TEST_P(seven->parent, tree); TEST(seven->black, 0); 
Pekka Pessi's avatar
Pekka Pessi committed
197 198 199 200 201 202 203 204

  /* Check after fourth node:
   *         5b
   *        / \
   *       3b  7b
   *      /
   *     1r  
   */
205 206
  TEST(redblack_insert(&tree, one, &o), 0); TEST_P(o, NULL);
  TEST_P(tree->left->left, one); 
Pekka Pessi's avatar
Pekka Pessi committed
207 208
  TEST(tree->black, 1); 
  TEST(tree->left->black, 1); TEST(tree->right->black, 1);
209 210
  TEST_P(one->left, NULL); TEST_P(one->right, NULL);
  TEST_P(one->parent, tree->left); TEST(one->black, 0); 
Pekka Pessi's avatar
Pekka Pessi committed
211 212 213 214 215 216 217 218

  /* Checks that we got after fifth node:
   *         5b
   *        / \
   *       3b  7b
   *      /   /
   *     1r  6r
   */
219 220 221 222 223 224
  TEST(redblack_insert(&tree, six, &o), 0); TEST_P(o, NULL);
  TEST_P(tree, five); TEST(five->black, 1);
  TEST_P(tree->left, three); TEST(three->black, 1);
  TEST_P(tree->left->left, one); TEST(one->black, 0);
  TEST_P(tree->right, seven); TEST(seven->black, 1);
  TEST_P(tree->right->left, six); TEST(six->black, 0);
Pekka Pessi's avatar
Pekka Pessi committed
225 226 227 228

  /* Insert five second time */
  old = five;
  five = node_new(home, 5);
229 230 231 232 233 234 235 236
  TEST(redblack_insert(&tree, five, &o), 0); TEST_P(o, old);
  TEST_P(tree, five); TEST(five->black, 1);
  TEST_P(tree->left, three); TEST(three->black, 1);
  TEST_P(three->parent, five);
  TEST_P(tree->left->left, one); TEST(one->black, 0);
  TEST_P(tree->right, seven); TEST(seven->black, 1);
  TEST_P(seven->parent, five);
  TEST_P(tree->right->left, six); TEST(six->black, 0);
Pekka Pessi's avatar
Pekka Pessi committed
237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264

  su_home_check(home);
  su_home_zap(home);

  END();
}

int test_rotate(void)
{
  su_home_t *home;
  Node *tree = NULL;
  Node *x, *y, *o;

  BEGIN();

  home = su_home_clone(NULL, sizeof(*home)); TEST_1(home);

  x = node_new(home, 1);
  y = node_new(home, 2);

  TEST_1(x);
  TEST_1(y); 

  /*
   *              x                   y               x
   * Checks that   \  transforms to  /   and back to   \
   *                y               x                   y
   */
265 266
  TEST(redblack_insert(&tree, x, &o), 0); TEST_P(o, NULL);
  TEST(redblack_insert(&tree, y, &o), 0); TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
267

268
  TEST_P(tree, x); TEST_P(x->right, y);
Pekka Pessi's avatar
Pekka Pessi committed
269
  redblack_left_rotate(&tree, x);
270
  TEST_P(tree, y); TEST_P(y->left, x);
Pekka Pessi's avatar
Pekka Pessi committed
271
  redblack_right_rotate(&tree, y);
272
  TEST_P(tree, x); TEST_P(x->right, y);
Pekka Pessi's avatar
Pekka Pessi committed
273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292

  su_home_check(home);
  su_home_zap(home);

  END();
}

int test_simple(void)
{
  su_home_t *home;
  Node *tree = NULL, *o;
  int i;
  Node *um, *um103, *um497, *um995;

  BEGIN();

  home = su_home_clone(NULL, sizeof(*home)); TEST_1(home);

  for (i = 3; i < 1000; i += 3) {
    um = node_new(home, i); TEST_1(um);
293
    o = (void *)-1; TEST(redblack_insert(&tree, um, &o), 0); TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
294 295 296 297 298 299
  }

  um103 = node_new(home, 103); TEST_1(um103);
  um497 = node_new(home, 497); TEST_1(um497);
  um995 = node_new(home, 995); TEST_1(um995);

300 301 302
  o = (void *)-1; TEST(redblack_insert(&tree, um995, &o), 0); TEST_P(o, NULL); 
  o = (void *)-1; TEST(redblack_insert(&tree, um497, &o), 0); TEST_P(o, NULL); 
  o = (void *)-1; TEST(redblack_insert(&tree, um103, &o), 0); TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
303

304 305 306 307 308
  um = node_find(tree, 103); TEST_P(um, um103);
  um = node_find(tree, 497); TEST_P(um, um497);
  um = node_find(tree, 995); TEST_P(um, um995);
  um = node_find(tree, 994); TEST_P(um, NULL);
  um = node_find(tree, 1); TEST_P(um, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332

  su_home_check(home);
  su_home_zap(home);

  END();
}

int test_balance(void)
{
  su_home_t *home;
  Node *tree = NULL, *o = NULL;
  Node *node, **nodes;
  int i, j;
  int const N = 1000;

  BEGIN();

  home = su_home_clone(NULL, sizeof(*home)); TEST_1(home);
  nodes = su_zalloc(home, (N + 2) * (sizeof *nodes)); TEST_1(nodes);
  nodes++;

  for (i = 0; i < N; i++) {
    nodes[i] = node = node_new(home, i); TEST_1(node);
    TEST(redblack_insert(&tree, node, &o), 0);
333
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
334 335 336 337 338 339 340 341
    TEST_1(redblack_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    node = node_find(tree, i);
    TEST_1(node); 
    TEST(node->value, i);
342
    TEST_P(nodes[i], node); 
Pekka Pessi's avatar
Pekka Pessi committed
343 344 345 346 347 348 349 350 351 352 353
  }

  node = node_find(tree, 0);

  for (i = 0; i < N; i++) {
    TEST_1(node); TEST(node->value, i);
    node = redblack_succ(node);
  }
  TEST_1(node == NULL);

  for (i = 0; i < N; i++) {
354 355
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
356 357 358 359 360 361 362 363 364 365 366 367 368
  }

  for (i = 0; i < N; i++) {
    node = node_find(tree, i);
    TEST_1(node); TEST(node->value, i);
    redblack_remove(&tree, node);
    TEST_1(node->parent == NULL && 
	   node->left == NULL && 
	   node->right == NULL); 
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

369
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
370 371 372 373

  for (i = N - 1; i >= 0; i--) {
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[i], &o), 0); 
374
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
375 376 377 378 379
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
380 381
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
382 383 384 385 386 387 388 389
  }

  for (i = 0; i < N; i++) {
    redblack_remove(&tree, nodes[i]);
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

390
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
391 392 393 394 395 396 397

  for (i = 0; i < N; i++) {
    int sn = (i * 57) % N;
    o = (void *)-1;
    TEST(nodes[sn]->inserted, 0);
    TEST(redblack_insert(&tree, nodes[sn], &o), 0); 
    nodes[sn]->inserted = 1;
398
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
399 400 401 402 403 404
    TEST_1(redblack_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
405 406
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
407 408 409 410 411 412 413 414 415 416 417
  }

  for (i = 0; i < N; i++) {
    int sn = (i * 23) % N;	/* 23 is relative prime to N */
    TEST(nodes[sn]->inserted, 1);
    redblack_remove(&tree, nodes[sn]);
    nodes[sn]->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

418
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
419 420 421 422 423 424 425

  for (i = 0; i < N; i++) {
    int sn = (i * 517) % N;	/* relative prime to N */
    o = (void *)-1;
    TEST(nodes[sn]->inserted, 0);
    TEST(redblack_insert(&tree, nodes[sn], &o), 0); 
    nodes[sn]->inserted = 1;
426
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
427 428 429 430 431 432
    TEST_1(redblack_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
433 434
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
435 436 437 438 439 440 441 442 443 444 445
  }

  for (i = 0; i < N; i++) {
    int sn = (i * 497) % N;	/* relative prime to N */
    TEST(nodes[sn]->inserted, 1);
    redblack_remove(&tree, nodes[sn]);
    nodes[sn]->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

446
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
447 448 449 450 451 452 453

  for (i = 0; i < N; i++) {
    int sn = (i * 1957) % N;	/* relative prime to N */
    o = (void *)-1;
    TEST(nodes[sn]->inserted, 0);
    TEST(redblack_insert(&tree, nodes[sn], &o), 0); 
    nodes[sn]->inserted = 1;
454
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
455 456 457 458 459 460
    TEST_1(redblack_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
461 462
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
463 464 465 466 467 468 469 470 471 472 473
  }

  for (i = 0; i < N; i++) {
    int sn = (i * 1519) % N;	/* relative prime to N */
    TEST(nodes[sn]->inserted, 1);
    redblack_remove(&tree, nodes[sn]);
    nodes[sn]->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

474
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
475 476 477 478 479 480 481 482

  /* Insert small, big, small, big ... */

  for (i = 0; i < N / 2; i++) {
    int sn = N - i - 1;
    TEST(nodes[i]->inserted, 0);
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[i], &o), 0); 
483
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
484 485 486 487 488
    nodes[i]->inserted = 1;

    TEST(nodes[sn]->inserted, 0);
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[sn], &o), 0); 
489
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
490 491 492 493 494
    nodes[sn]->inserted = 1;
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
495 496
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
497 498 499 500 501 502 503 504 505 506 507 508 509
  }

  for (i = 0; i < N; i++) {
    node = ((i & 1) ? redblack_succ(tree) : redblack_prec(tree));
    if (node == NULL)
      node = tree;
    TEST(node->inserted, 1);
    redblack_remove(&tree, node);
    node->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

510
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
511 512 513 514 515 516 517 518

  /* Insert small, big, small, big ... */

  for (i = 0; i < N / 2; i++) {
    int sn = N - i - 1;
    TEST(nodes[i]->inserted, 0);
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[i], &o), 0); 
519
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
520 521 522 523 524
    nodes[i]->inserted = 1;

    TEST(nodes[sn]->inserted, 0);
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[sn], &o), 0); 
525
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
526 527 528 529 530
    nodes[sn]->inserted = 1;
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
531 532
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
533 534 535 536 537 538 539 540 541 542 543 544 545
  }

  /* Remove last, first, last, first, ... */
  for (i = 0; i < N; i++) {
    node = ((i & 1) ? redblack_first(tree) : redblack_last(tree));
    TEST_1(node);
    TEST(node->inserted, 1);
    redblack_remove(&tree, node);
    node->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

546
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
547 548 549 550 551 552 553 554

  /* Insert small, big, small, big ... */

  for (i = 0; i < N / 2; i++) {
    int sn = N / 2 + i;
    TEST(nodes[i]->inserted, 0);
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[i], &o), 0); 
555
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
556 557 558 559 560
    nodes[i]->inserted = 1;

    TEST(nodes[sn]->inserted, 0);
    o = (void *)-1;
    TEST(redblack_insert(&tree, nodes[sn], &o), 0); 
561
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
562 563 564 565 566
    nodes[sn]->inserted = 1;
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
567 568
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
569 570 571 572 573 574 575 576 577 578 579 580 581
  }

  /* Remove last, first, last, first, ... */
  for (i = 0; i < N; i++) {
    node = ((i & 1) ? redblack_first(tree) : redblack_last(tree));
    TEST_1(node);
    TEST(node->inserted, 1);
    redblack_remove(&tree, node);
    node->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

582
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
583 584 585 586 587 588 589 590 591

  /* Insert in perfect order ... */
  
  for (j = N / 2; j > 0; j /= 2) {
    for (i = N - j; i >= 0; i -= j) {
      if (nodes[i]->inserted)
	continue;
      o = (void *)-1;
      TEST(redblack_insert(&tree, nodes[i], &o), 0); 
592
      TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
593 594 595 596 597 598
      nodes[i]->inserted = 1;
    }
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
599 600
    TEST_P(redblack_succ(nodes[i]), nodes[i + 1]);
    TEST_P(redblack_prec(nodes[i]), nodes[i - 1]);
Pekka Pessi's avatar
Pekka Pessi committed
601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635
  }

  /* Remove such nodes that inserts red uncles into tree */
  for (i = 0; i < N; i++) {
    node = redblack_last(tree);
    for (o = node; o; o = redblack_prec(o)) {
      Node *dad, *granddad, *uncle, *to_be_removed;
      /* We must have a node with black dad, no brother, red granddad and uncle */
      if (!(dad = o->parent) || !dad->black)
	continue;
      if (dad->left && dad->right)
	continue;
      if (!(granddad = dad->parent) || granddad->black)
	continue;
      if (granddad->left == dad)
	uncle = granddad->right;
      else
	uncle = granddad->left;
      if (!uncle || uncle->black)
	continue;
      to_be_removed = redblack_prec(o->parent);
      if (to_be_removed == granddad || to_be_removed == uncle)
	continue;
      if (!to_be_removed->left || !to_be_removed->right)
	continue;
      node = to_be_removed;
      break;
    }
    TEST(node->inserted, 1);
    redblack_remove(&tree, node);
    node->inserted = 0;
    TEST_1(redblack_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

636
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658

  su_home_check(home);
  su_home_zap(home);

  END();
}

int test_speed(void)
{
  su_home_t *home;
  Node *tree = NULL, *o = NULL;
  Node *node;
  unsigned i;
  int const N = 1000000;

  BEGIN();

  home = su_home_clone(NULL, sizeof(*home)); TEST_1(home);

  for (i = 0; i < N; i++) {
    node = node_new(home, i);
    TEST(redblack_insert(&tree, node, &o), 0);
659
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709
  }

  TEST_1(redblack_height(tree) <= 2 * log2ceil(i + 1));

  for (i = 0; i < N; i++) {
    node = node_find(tree, i);
    TEST_1(node); TEST(node->value, i);
  }

  node = node_find(tree, 0);
  for (i = 0; i < N; i++) {
    TEST_1(node); TEST(node->value, i);
    node = redblack_succ(node);
  }
  TEST_1(node == NULL);

  su_home_check(home);
  su_home_zap(home);

  END();
}


void usage(void)
{
  fprintf(stderr,
	  "usage: %s [-v]\n",
	  name);
}

int main(int argc, char *argv[])
{
  int retval = 0;
  int i;

  for (i = 1; argv[i]; i++) {
    if (strcmp(argv[i], "-v") == 0)
      tstflags |= tst_verbatim;
    else
      usage();
  }

  retval |= test_insert(); fflush(stdout);
  retval |= test_rotate(); fflush(stdout);
  retval |= test_simple(); fflush(stdout);
  retval |= test_balance(); fflush(stdout);
  retval |= test_speed(); fflush(stdout);

  return retval;
}