torture_rbtree.c 17.6 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
 * 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>
41
#include <stdlib.h>
Pekka Pessi's avatar
Pekka Pessi committed
42

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

typedef struct node Node;

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

int tstflags;

#define TSTFLAGS tstflags

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

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)

76
RBTREE_PROTOS(su_inline, redblack, Node);
Pekka Pessi's avatar
Pekka Pessi committed
77

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

82
#include <sofia-sip/su_alloc.h>
Pekka Pessi's avatar
Pekka Pessi committed
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 172

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 */
173 174 175 176
  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
177 178 179 180 181 182 183

  /* Check after another node: 
   *
   *         5b
   *        / 
   *       3r
   */
184 185 186 187
  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
188 189 190 191 192 193

  /* Check third node
   *         5b
   *        / \
   *       3r  7r
   */
194 195 196 197
  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
198 199 200 201 202 203 204 205

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

  /* Checks that we got after fifth node:
   *         5b
   *        / \
   *       3b  7b
   *      /   /
   *     1r  6r
   */
220 221 222 223 224 225
  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
226 227 228 229

  /* Insert five second time */
  old = five;
  five = node_new(home, 5);
230 231 232 233 234 235 236 237
  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
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 265

  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
   */
266 267
  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
268

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

  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);
294
    o = (void *)-1; TEST(redblack_insert(&tree, um, &o), 0); TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
295 296 297 298 299 300
  }

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

301 302 303
  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
304

305 306 307 308 309
  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
310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333

  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);
334
    TEST_P(o, NULL);
335
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(i + 1 + 1));
Pekka Pessi's avatar
Pekka Pessi committed
336 337 338 339 340 341 342
    TEST_1(redblack_check(tree));
  }

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

  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++) {
355 356
    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
357 358 359 360 361 362 363 364 365
  }

  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); 
366
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
367 368 369
    TEST_1(redblack_check(tree));
  }

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

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

  for (i = 0; i < N; i++) {
381 382
    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
383 384 385 386
  }

  for (i = 0; i < N; i++) {
    redblack_remove(&tree, nodes[i]);
387
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
388 389 390
    TEST_1(redblack_check(tree));
  }

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

  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;
399
    TEST_P(o, NULL);
400
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(i + 1 + 1));
Pekka Pessi's avatar
Pekka Pessi committed
401 402 403 404 405
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
406 407
    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
408 409 410 411 412 413 414
  }

  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;
415
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
416 417 418
    TEST_1(redblack_check(tree));
  }

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

  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;
427
    TEST_P(o, NULL);
428
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(i + 1 + 1));
Pekka Pessi's avatar
Pekka Pessi committed
429 430 431 432 433
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
434 435
    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
436 437 438 439 440 441 442
  }

  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;
443
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
444 445 446
    TEST_1(redblack_check(tree));
  }

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

  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;
455
    TEST_P(o, NULL);
456
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(i + 1 + 1));
Pekka Pessi's avatar
Pekka Pessi committed
457 458 459 460 461
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
462 463
    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
464 465 466 467 468 469 470
  }

  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;
471
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
472 473 474
    TEST_1(redblack_check(tree));
  }

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

  /* 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); 
484
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
485 486 487 488 489
    nodes[i]->inserted = 1;

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

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
496 497
    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
498 499 500 501 502 503 504 505 506
  }

  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;
507
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
508 509 510
    TEST_1(redblack_check(tree));
  }

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

  /* 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); 
520
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
521 522 523 524 525
    nodes[i]->inserted = 1;

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

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
532 533
    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
534 535 536 537 538 539 540 541 542
  }

  /* 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;
543
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
544 545 546
    TEST_1(redblack_check(tree));
  }

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

  /* 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); 
556
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
557 558 559 560 561
    nodes[i]->inserted = 1;

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

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
568 569
    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
570 571 572 573 574 575 576 577 578
  }

  /* 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;
579
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
580 581 582
    TEST_1(redblack_check(tree));
  }

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

  /* 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); 
593
      TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
594 595 596 597 598 599
      nodes[i]->inserted = 1;
    }
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->inserted, 1);
600 601
    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
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
  }

  /* 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;
633
    TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(N - i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
634 635 636
    TEST_1(redblack_check(tree));
  }

637
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
638 639 640 641 642 643 644 645 646 647 648 649 650

  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;
651
  unsigned int const N = 1000000U;
Pekka Pessi's avatar
Pekka Pessi committed
652 653 654 655 656 657 658 659

  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);
660
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
661 662
  }

663
  TEST_1(redblack_height(tree) <= 2 * (int)log2ceil(i + 1));
Pekka Pessi's avatar
Pekka Pessi committed
664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683

  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();
}


684
void usage(int exitcode)
Pekka Pessi's avatar
Pekka Pessi committed
685 686
{
  fprintf(stderr,
687
	  "usage: %s [-v] [-a]\n",
Pekka Pessi's avatar
Pekka Pessi committed
688
	  name);
689
  exit(exitcode);
Pekka Pessi's avatar
Pekka Pessi committed
690 691 692 693 694 695 696 697 698 699
}

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;
700 701
    else if (strcmp(argv[i], "-a") == 0)
      tstflags |= tst_abort;
Pekka Pessi's avatar
Pekka Pessi committed
702
    else
703
      usage(1);
Pekka Pessi's avatar
Pekka Pessi committed
704 705 706 707 708 709 710 711 712 713
  }

  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;
}