urlmap.c 28.1 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 urlmap.c
 * @brief Mapping with hierarchical URLs.
 *
 * @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 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 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 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 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 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540

#include "urlmap.h"

/** Create map entry. */
UrlMap *url_map_new(su_home_t *home,
		    url_string_t const *url,
		    unsigned size)
{
  UrlMap *um;
  int xtra;
  url_t *u;

  xtra = url_xtra(url->us_url);
  um = su_zalloc(home, size + xtra);
  if (!um || url_dup((char *)um + size, xtra, um->um_url, url->us_url) < 0) {
    su_free(home, um);
    return NULL;
  }

  u = um->um_url;
  if (!u->url_path)
    u->url_path = "";

  return um;
}

static
void left_rotate(UrlMap **top, UrlMap *x)
{
  /*               x                c
   *              / \              / \
   * Convert     a   c    into    x   d
   *                / \          / \
   *               b   d        a   b
   */
  UrlMap *c = x->um_right, *dad = x->um_dad; assert(c);

  if ((x->um_right = c->um_left))
    x->um_right->um_dad = x;

  if (!(c->um_dad = dad))
    *top = c;
  else if (dad->um_left == x)
    dad->um_left = c;
  else
    assert(dad->um_right == x), dad->um_right = c;

  c->um_left = x;
  x->um_dad = c;
}

static
void right_rotate(UrlMap **top, UrlMap *x)
{
  /*               x                c
   *              / \              / \
   * Convert     c   f    into    a   x
   *            / \                  / \
   *           a   d                d   f
   */
  UrlMap *c = x->um_left, *dad = x->um_dad; assert(c);

  if ((x->um_left = c->um_right))
    x->um_left->um_dad = x;

  if (!(c->um_dad = dad))
    *top = c;
  else if (dad->um_right == x)
    dad->um_right = c;
  else
    assert(dad->um_left == x), dad->um_left = c;

  c->um_right = x;
  x->um_dad = c;
}

/** Balance Red-Black binary tree after inserting node @a um.
 *
 * The function red_black_balance_insert() balances a red-black tree after
 * insertion.
 */
static
void red_black_balance_insert(UrlMap **top, UrlMap *um)
{
  UrlMap *dad, *uncle, *granddad;

  um->um_black = 0;

  for (dad = um->um_dad; um != *top && !dad->um_black; dad = um->um_dad) {
    /* Repeat until we are parent or we have a black dad */
    granddad = dad->um_dad; assert(granddad);
    if (dad == granddad->um_left) {
      uncle = granddad->um_right;
      if (uncle && !uncle->um_black) {
	dad->um_black = 1;
	uncle->um_black = 1;
	granddad->um_black = 0;
	um = granddad;
      } else {
	if (um == dad->um_right) {
	  left_rotate(top, um = dad);
	  dad = um->um_dad; assert(dad);
	  granddad = dad->um_dad; assert(granddad);
	}
	dad->um_black = 1;
	granddad->um_black = 0;
	right_rotate(top, granddad);
      }
    } else { assert(dad == granddad->um_right);
      uncle = granddad->um_left;
      if (uncle && !uncle->um_black) {
	dad->um_black = 1;
	uncle->um_black = 1;
	granddad->um_black = 0;
	um = granddad;
      } else {
	if (um == dad->um_left) {
	  right_rotate(top, um = dad);
	  dad = um->um_dad; assert(dad);
	  granddad = dad->um_dad; assert(granddad);
	}
	dad->um_black = 1;
	granddad->um_black = 0;
	left_rotate(top, granddad);
      }
    }
  }

  assert(*top);

  (*top)->um_black = 1;
}

static 
void red_black_balance_delete(UrlMap **top, UrlMap *um)
{
  UrlMap *dad, *brother;

  for (dad = um->um_dad; um != *top && !dad->um_black; dad = um->um_dad) {
    if (um == dad->um_left) {
      brother = dad->um_right;

      if (!brother) {
	um = dad;
	continue;
      }

      assert(brother->um_black);
      if ((!brother->um_left || brother->um_left->um_black) &&
	  (!brother->um_right || brother->um_right->um_black)) {
	brother->um_black = 0;
	um = dad;
	continue;
      } 

      if (!brother->um_right || brother->um_right->um_black) {
	brother->um_left->um_black = 1;
	brother->um_black = 0;
	right_rotate(top, brother);
	brother = dad->um_right;
      }

      brother->um_black = dad->um_black;
      dad->um_black = 1;
      if (brother->um_right)
	brother->um_right->um_black = 1;
      left_rotate(top, dad);
      um = *top;
      break;
    } else { 
      assert(um == dad->um_right);
      brother = dad->um_left;

      if (!brother) {
	um = dad;
	continue;
      }

      assert(brother->um_black);

      if ((!brother->um_left || brother->um_left->um_black) &&
	  (!brother->um_right || brother->um_right->um_black)) {
	brother->um_black = 0;
	um = dad;
	continue;
      } 

      if (!brother->um_left || brother->um_left->um_black) {
	brother->um_right->um_black = 1;
	brother->um_black = 0;
	left_rotate(top, brother);
	brother = dad->um_left;
      }

      brother->um_black = um->um_dad->um_black;
      um->um_dad->um_black = 1;
      if (brother->um_left)
	brother->um_left->um_black = 1;
      right_rotate(top, dad);
      um = *top;
      break;
    }
  }

  um->um_black = 1;
}

/** Compare paths. */
static inline
int urlmap_pathcmp(url_t const *a, url_t const *b, int *return_hostmatch)
{
  int retval;

  retval = url_cmp(a, b);

  *return_hostmatch = !retval;

  if (retval)
    return retval;
  else
    return strcmp(a->url_path, b->url_path);
}

/** Insert URL into map. */
int url_map_insert(UrlMap ** const tree,
		   UrlMap * const um,
		   UrlMap **return_old)
{
  UrlMap *old, *dad, **tslot;
  url_t *u;
  int cmp, hostmatch;

  if (tree == NULL || um == NULL || um->um_inserted)
    return (errno = EINVAL), -1;

  u = um->um_url;

  /* Insert into red-black binary tree */

  tslot = tree;

  for (old = *tree, dad = NULL; old; old = *tslot) {
    cmp = urlmap_pathcmp(u, old->um_url, &hostmatch);
    if (cmp < 0)
      dad = old, tslot = &old->um_left;
    else if (cmp > 0)
      dad = old, tslot = &old->um_right;
    else
      break;
  }

  assert(old != um);

  if (old) {
    if ((um->um_left = old->um_left))
      um->um_left->um_dad = um;
    if ((um->um_right = old->um_right))
      um->um_right->um_dad = um;

    if (!(um->um_dad = old->um_dad))
      *tree = um;
    else if (um->um_dad->um_left == old)
      um->um_dad->um_left = um;
    else assert(um->um_dad->um_right == old),
      um->um_dad->um_right = um;

    um->um_black = old->um_black;

    old->um_left = NULL;
    old->um_right = NULL;
    old->um_dad = NULL;
    old->um_inserted = 0;
  } else {
    *tslot = um;
    um->um_dad = dad;
    if (tree != tslot) {
      red_black_balance_insert(tree, um);
    } else {
      um->um_black = 1;
    }
  }

  um->um_inserted = 1;

  if (return_old)
    *return_old = old;

  return 0;
}

/** Find a URL */
UrlMap *
url_map_find(UrlMap *root,
	     url_string_t const *url,
	     int relative)
{
  UrlMap *um, *maybe = NULL;
  url_t u[1];
  void *tbf = NULL;
  char *end;
  int cmp, hostmatch;

  if (root == NULL || url == NULL)
    return NULL;

  url = tbf = url_hdup(NULL, (url_t *)url);
  if (!url)
    return NULL;

  *u = *url->us_url;
  if (!u->url_path)
    u->url_path = "";

  for (um = root; um; um = cmp < 0 ? um->um_left : um->um_right) {
    cmp = urlmap_pathcmp(u, um->um_url, &hostmatch);
    if (cmp == 0)
      break;
    if (hostmatch && !maybe)
      maybe = um;
  }

  while (!um && relative && u->url_path[0]) {
    end = strrchr(u->url_path, '/');
    end = end ? end + 1 : (char *)u->url_path;
    if (*end)
      *end = '\0';
    for (um = maybe; um; um = cmp < 0 ? um->um_left : um->um_right) {
      if ((cmp = urlmap_pathcmp(u, um->um_url, &hostmatch)) == 0)
	break;
    }
  }

  su_free(NULL, tbf);

  return um;
}

/** Remove URL. */
void url_map_remove(UrlMap **top, UrlMap *um)
{
  UrlMap *kid, *dad;
  int need_to_balance;

  if (top == NULL || um == NULL || !um->um_inserted)
    return;

  /* Make sure that node is in tree */
  for (dad = um; dad; dad = dad->um_dad)
    if (dad == *top)
      break;

  assert(dad);
  if (!dad)
    return;

  /* Find a successor node with a free branch */
  if (!um->um_left || !um->um_right)
    dad = um;
  else for (dad = um->um_right; dad->um_left; dad = dad->um_left)
    ;
  /* Dad has a free branch => kid is dad's only child */
  kid = dad->um_left ? dad->um_left : dad->um_right;

  /* Remove dad from tree */
  if (!(dad->um_dad))
    *top = kid;
  else if (dad->um_dad->um_left == dad)
    dad->um_dad->um_left = kid;
  else assert(dad->um_dad->um_right == dad),
    dad->um_dad->um_right = kid;
  if (kid)
    kid->um_dad = dad->um_dad;

  need_to_balance = kid && dad->um_black;

  /* Put dad in place of um */
  if (um != dad) {
    if (!(dad->um_dad = um->um_dad))
      *top = dad;
    else if (dad->um_dad->um_left == um)
      dad->um_dad->um_left = dad;
    else assert(dad->um_dad->um_right == um),
      dad->um_dad->um_right = dad;

    dad->um_black = um->um_black;
    
    if ((dad->um_left = um->um_left))
      dad->um_left->um_dad = dad;      

    if ((dad->um_right = um->um_right))
      dad->um_right->um_dad = dad;      
  }

  um->um_left = NULL;
  um->um_right = NULL;
  um->um_dad = NULL;
  um->um_black = 0;
  um->um_inserted = 0;

  if (need_to_balance) 
    red_black_balance_delete(top, kid);
}

#if TEST_URLMAP
/* Functions currently used only by test cases */

/** Return inorder successor of node @a um. */
UrlMap *url_map_succ(UrlMap *um)
{
  UrlMap *dad;

  if (um->um_right) {
    for (um = um->um_right; um->um_left; um = um->um_left)
      ;
    return um;
  }

  for (dad = um->um_dad; dad && um == dad->um_right; dad = um->um_dad)
    um = dad;

  return dad;
}

/** Return inorder precedessor of node @a um. */
UrlMap *url_map_prec(UrlMap *um)
{
  UrlMap *dad;

  if (um->um_left) {
    for (um = um->um_left; um->um_right; um = um->um_right)
      ;
    return um;
  }

  for (dad = um->um_dad; dad && um == dad->um_left; dad = um->um_dad)
    um = dad;

  return dad;
}

/** Return first node in tree @a um. */
UrlMap *url_map_first(UrlMap *um)
{
  while (um && um->um_left)
    um = um->um_left;

  return um;
}

/** Return last node in tree @a um. */
UrlMap *url_map_last(UrlMap *um)
{
  while (um && um->um_right)
    um = um->um_right;

  return um;
}

/** Return height of the tree */
int url_map_height(UrlMap const *tree)
{
  int left, right;

  if (!tree)
    return 0;

  left = tree->um_left ? url_map_height(tree->um_left) : 0;
  right = tree->um_right ? url_map_height(tree->um_right) : 0;

  if (left > right)
    return left + 1;
  else
    return right + 1;
}

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

  if (!n)
    return 1;

  l = n->um_left, r = n->um_right;

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

/* Testing functions */

int tstflags;

#define TSTFLAGS tstflags

#include <stdio.h>
541
#include <sofia-sip/tstdef.h>
Pekka Pessi's avatar
Pekka Pessi committed
542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568

char const *name = "test_urlmap";

int test_path(void)
{
  su_home_t *home;
  UrlMap *tree = NULL, *o;
  UrlMap *um, *um1, *um2, *um3;

  BEGIN();

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

  um1 = url_map_new(home, (void*)"http://host/aa/", sizeof *um1);
  TEST_1(um1);

  um2 = url_map_new(home, (void*)"http://host/aa/bb/", sizeof *um1);
  TEST_1(um2);

  um3 = url_map_new(home, (void*)"http://host/aa/bb/cc/",
				sizeof *um);
  TEST_1(um3);

  TEST_1(um1 != um2 && um1 != um3 && um2 != um3);

  o = (void *)-1;
  TEST(url_map_insert(&tree, um3, &o), 0);
569
  TEST_P(o, NULL); o = (void *)-1;
Pekka Pessi's avatar
Pekka Pessi committed
570
  TEST(url_map_insert(&tree, um2, &o), 0);
571
  TEST_P(o, NULL); o = (void *)-1;
Pekka Pessi's avatar
Pekka Pessi committed
572
  TEST(url_map_insert(&tree, um1, &o), 0);
573
  TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
574

575 576 577 578 579 580
  um = url_map_find(tree, (void*)"http://host/aa/bb/cc", 1); TEST_P(um, um2);
  um = url_map_find(tree, (void*)"http://host/aa/bb/cc/oo", 1);
                                                          TEST_P(um, um3);
  um = url_map_find(tree, (void*)"http://host/aa/bb", 1); TEST_P(um, um1);
  um = url_map_find(tree, (void*)"http://host/aa/bb", 0); TEST_P(um, NULL);
  um = url_map_find(tree, (void*)"http://host/aa/bb/", 1); TEST_P(um, um2);
Pekka Pessi's avatar
Pekka Pessi committed
581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609

  su_home_check(home);
  su_home_zap(home);

  END();
}

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

  BEGIN();

  home = su_home_clone(NULL, sizeof(*home)); TEST_1(home);
  one = url_map_new(home, (void*)"/1", sizeof (UrlMap));
  three = url_map_new(home, (void*)"/3", sizeof (UrlMap));
  five = url_map_new(home, (void*)"/5", sizeof (UrlMap));
  six = url_map_new(home, (void*)"/6", sizeof (UrlMap));
  seven = url_map_new(home, (void*)"/7", sizeof (UrlMap));

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

  /* Check single node */
610 611 612 613
  TEST(url_map_insert(&tree, five, &o), 0); TEST_P(o, NULL);
  TEST_P(tree, five);
  TEST_P(five->um_left, NULL); TEST_P(five->um_right, NULL);
  TEST_P(five->um_dad, NULL); TEST(five->um_black, 1);
Pekka Pessi's avatar
Pekka Pessi committed
614 615 616 617 618 619 620

  /* Check after another node: 
   *
   *         5b
   *        / 
   *       3r
   */
621 622 623 624
  TEST(url_map_insert(&tree, three, &o), 0); TEST_P(o, NULL);
  TEST_P(tree->um_left, three); TEST(tree->um_black, 1);
  TEST_P(three->um_left, NULL); TEST_P(three->um_right, NULL);
  TEST_P(three->um_dad, tree); TEST(three->um_black, 0); 
Pekka Pessi's avatar
Pekka Pessi committed
625 626 627 628 629 630

  /* Check third node
   *         5b
   *        / \
   *       3r  7r
   */
631 632 633 634
  TEST(url_map_insert(&tree, seven, &o), 0); TEST_P(o, NULL);
  TEST_P(tree->um_right, seven); TEST(tree->um_black, 1);
  TEST_P(seven->um_left, NULL); TEST_P(seven->um_right, NULL);
  TEST_P(seven->um_dad, tree); TEST(seven->um_black, 0); 
Pekka Pessi's avatar
Pekka Pessi committed
635 636 637 638 639 640 641 642

  /* Check after fourth node:
   *         5b
   *        / \
   *       3b  7b
   *      /
   *     1r  
   */
643 644
  TEST(url_map_insert(&tree, one, &o), 0); TEST_P(o, NULL);
  TEST_P(tree->um_left->um_left, one); 
Pekka Pessi's avatar
Pekka Pessi committed
645 646
  TEST(tree->um_black, 1); 
  TEST(tree->um_left->um_black, 1); TEST(tree->um_right->um_black, 1);
647 648
  TEST_P(one->um_left, NULL); TEST_P(one->um_right, NULL);
  TEST_P(one->um_dad, tree->um_left); TEST(one->um_black, 0); 
Pekka Pessi's avatar
Pekka Pessi committed
649 650 651 652 653 654 655 656

  /* Checks that we got after fifth node:
   *         5b
   *        / \
   *       3b  7b
   *      /   /
   *     1r  6r
   */
657 658 659 660 661 662
  TEST(url_map_insert(&tree, six, &o), 0); TEST_P(o, NULL);
  TEST_P(tree, five); TEST(five->um_black, 1);
  TEST_P(tree->um_left, three); TEST(three->um_black, 1);
  TEST_P(tree->um_left->um_left, one); TEST(one->um_black, 0);
  TEST_P(tree->um_right, seven); TEST(seven->um_black, 1);
  TEST_P(tree->um_right->um_left, six); TEST(six->um_black, 0);
Pekka Pessi's avatar
Pekka Pessi committed
663 664 665 666

  /* Insert five second time */
  old = five;
  five = url_map_new(home, (void*)"/5", sizeof (UrlMap));
667 668 669 670 671 672 673 674
  TEST(url_map_insert(&tree, five, &o), 0); TEST_P(o, old);
  TEST_P(tree, five); TEST(five->um_black, 1);
  TEST_P(tree->um_left, three); TEST(three->um_black, 1);
  TEST_P(three->um_dad, five);
  TEST_P(tree->um_left->um_left, one); TEST(one->um_black, 0);
  TEST_P(tree->um_right, seven); TEST(seven->um_black, 1);
  TEST_P(seven->um_dad, five);
  TEST_P(tree->um_right->um_left, six); TEST(six->um_black, 0);
Pekka Pessi's avatar
Pekka Pessi committed
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

  su_home_check(home);
  su_home_zap(home);

  END();
}

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

  BEGIN();

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

  x = url_map_new(home, (void*)"/x", sizeof *x);
  y = url_map_new(home, (void*)"/y", sizeof *y);

  TEST_1(x);
  TEST_1(y); 

  /*
   *              x                   y               x
   * Checks that   \  transforms to  /   and back to   \
   *                y               x                   y
   */
703 704
  TEST(url_map_insert(&tree, x, &o), 0); TEST_P(o, NULL);
  TEST(url_map_insert(&tree, y, &o), 0); TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
705

706
  TEST_P(tree, x); TEST_P(x->um_right, y);
Pekka Pessi's avatar
Pekka Pessi committed
707
  left_rotate(&tree, x);
708
  TEST_P(tree, y); TEST_P(y->um_left, x);
Pekka Pessi's avatar
Pekka Pessi committed
709
  right_rotate(&tree, y);
710
  TEST_P(tree, x); TEST_P(x->um_right, y);
Pekka Pessi's avatar
Pekka Pessi committed
711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774

  su_home_check(home);
  su_home_zap(home);

  END();
}

/** ceil of log2 */
static
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;
}

typedef struct {
  UrlMap te_urlmap[1];
  int      te_value;
  int      te_inserted;
} TEntry;

int test_balance(void)
{
  su_home_t *home;
  UrlMap *tree = NULL, *o = NULL;
  url_t *u;
  TEntry *te, **nodes;
  char path[16];
  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++;

  u = url_hdup(home, (url_t *)"http://host");
  u->url_path = path;

  for (i = 0; i < N; i++) {
    snprintf(path, (sizeof path), "p%07u", i);
    te = (TEntry *)url_map_new(home, (void *)u, sizeof *te);
    te->te_value = i;
    nodes[i] = te;
    TEST(url_map_insert(&tree, te->te_urlmap, &o), 0);
775
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796
    TEST_1(url_map_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    snprintf(path, (sizeof path), "p%07u", i);
    te = (TEntry *)url_map_find(tree, (void*)u, 1);
    TEST_1(te); TEST(te->te_value, i);
  }

  snprintf(path, (sizeof path), "p%07u", 0);

  te = (TEntry *)url_map_find(tree, (void*)u, 1);

  for (i = 0; i < N; i++) {
    TEST_1(te); TEST(te->te_value, i);
    te = (TEntry *)url_map_succ(te->te_urlmap);
  }
  TEST_1(te == NULL);

  for (i = 0; i < N; i++) {
797 798
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
799 800 801 802 803 804 805 806 807 808 809 810 811 812
  }

  for (i = 0; i < N; i++) {
    snprintf(path, (sizeof path), "p%07u", i);
    te = (TEntry *)url_map_find(tree, (void*)u, 1);
    TEST_1(te); TEST(te->te_value, i);
    url_map_remove(&tree, te->te_urlmap);
    TEST_1(te->te_urlmap->um_dad == NULL && 
	   te->te_urlmap->um_left == NULL && 
	   te->te_urlmap->um_right == NULL); 
    TEST_1(url_map_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

813
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
814 815 816 817

  for (i = N - 1; i >= 0; i--) {
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[i]->te_urlmap, &o), 0); 
818
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
819 820 821 822 823
    TEST_1(url_map_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
824 825
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
826 827 828 829 830 831 832 833
  }

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

834
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
835 836 837 838 839 840 841

  for (i = 0; i < N; i++) {
    int sn = (i * 57) % N;
    o = (void *)-1;
    TEST(nodes[sn]->te_inserted, 0);
    TEST(url_map_insert(&tree, nodes[sn]->te_urlmap, &o), 0); 
    nodes[sn]->te_inserted = 1;
842
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
843 844 845 846 847 848
    TEST_1(url_map_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
849 850
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
851 852 853 854 855 856 857 858 859 860 861
  }

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

862
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
863 864 865 866 867 868 869

  for (i = 0; i < N; i++) {
    int sn = (i * 517) % N;	/* relative prime to N */
    o = (void *)-1;
    TEST(nodes[sn]->te_inserted, 0);
    TEST(url_map_insert(&tree, nodes[sn]->te_urlmap, &o), 0); 
    nodes[sn]->te_inserted = 1;
870
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
871 872 873 874 875 876
    TEST_1(url_map_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
877 878
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
879 880 881 882 883 884 885 886 887 888 889
  }

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

890
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
891 892 893 894 895 896 897

  for (i = 0; i < N; i++) {
    int sn = (i * 1957) % N;	/* relative prime to N */
    o = (void *)-1;
    TEST(nodes[sn]->te_inserted, 0);
    TEST(url_map_insert(&tree, nodes[sn]->te_urlmap, &o), 0); 
    nodes[sn]->te_inserted = 1;
898
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
899 900 901 902 903 904
    TEST_1(url_map_height(tree) <= 2 * log2ceil(i + 1 + 1));
    TEST_1(redblack_check(tree));
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
905 906
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
907 908 909 910 911 912 913 914 915 916 917
  }

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

918
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
919 920 921 922 923 924 925 926

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

  for (i = 0; i < N / 2; i++) {
    int sn = N - i - 1;
    TEST(nodes[i]->te_inserted, 0);
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[i]->te_urlmap, &o), 0); 
927
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
928 929 930 931 932
    nodes[i]->te_inserted = 1;

    TEST(nodes[sn]->te_inserted, 0);
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[sn]->te_urlmap, &o), 0); 
933
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
934 935 936 937 938
    nodes[sn]->te_inserted = 1;
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
939 940
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
941 942 943 944 945 946 947 948 949 950 951 952 953
  }

  for (i = 0; i < N; i++) {
    te = (TEntry *)((i & 1) ? url_map_succ(tree) : url_map_prec(tree));
    if (te == NULL)
      te = (TEntry *)tree;
    TEST(te->te_inserted, 1);
    url_map_remove(&tree, te->te_urlmap);
    te->te_inserted = 0;
    TEST_1(url_map_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

954
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
955 956 957 958 959 960 961 962

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

  for (i = 0; i < N / 2; i++) {
    int sn = N - i - 1;
    TEST(nodes[i]->te_inserted, 0);
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[i]->te_urlmap, &o), 0); 
963
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
964 965 966 967 968
    nodes[i]->te_inserted = 1;

    TEST(nodes[sn]->te_inserted, 0);
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[sn]->te_urlmap, &o), 0); 
969
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
970 971 972 973 974
    nodes[sn]->te_inserted = 1;
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
975 976
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
977 978 979 980 981 982 983 984 985 986 987 988 989
  }

  /* Remove last, first, last, first, ... */
  for (i = 0; i < N; i++) {
    te = (TEntry *)((i & 1) ? url_map_first(tree) : url_map_last(tree));
    TEST_1(te);
    TEST(te->te_inserted, 1);
    url_map_remove(&tree, te->te_urlmap);
    te->te_inserted = 0;
    TEST_1(url_map_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

990
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
991 992 993 994 995 996 997 998

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

  for (i = 0; i < N / 2; i++) {
    int sn = N / 2 + i;
    TEST(nodes[i]->te_inserted, 0);
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[i]->te_urlmap, &o), 0); 
999
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
1000 1001 1002 1003 1004
    nodes[i]->te_inserted = 1;

    TEST(nodes[sn]->te_inserted, 0);
    o = (void *)-1;
    TEST(url_map_insert(&tree, nodes[sn]->te_urlmap, &o), 0); 
1005
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
1006 1007 1008 1009 1010
    nodes[sn]->te_inserted = 1;
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
1011 1012
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025
  }

  /* Remove last, first, last, first, ... */
  for (i = 0; i < N; i++) {
    te = (TEntry *)((i & 1) ? url_map_first(tree) : url_map_last(tree));
    TEST_1(te);
    TEST(te->te_inserted, 1);
    url_map_remove(&tree, te->te_urlmap);
    te->te_inserted = 0;
    TEST_1(url_map_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

1026
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
1027 1028 1029 1030 1031 1032 1033 1034 1035

  /* Insert in perfect order ... */
  
  for (j = N / 2; j > 0; j /= 2) {
    for (i = N - j; i >= 0; i -= j) {
      if (nodes[i]->te_inserted)
	continue;
      o = (void *)-1;
      TEST(url_map_insert(&tree, nodes[i]->te_urlmap, &o), 0); 
1036
      TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
1037 1038 1039 1040 1041 1042
      nodes[i]->te_inserted = 1;
    }
  }

  for (i = 0; i < N; i++) {
    TEST(nodes[i]->te_inserted, 1);
1043 1044
    TEST_P(url_map_succ(nodes[i]->te_urlmap), nodes[i + 1]->te_urlmap);
    TEST_P(url_map_prec(nodes[i]->te_urlmap), nodes[i - 1]->te_urlmap);
Pekka Pessi's avatar
Pekka Pessi committed
1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079
  }

  /* Remove such nodes that insert red uncles into tree */
  for (i = 0; i < N; i++) {
    te = (TEntry *)url_map_last(tree);
    for (o = te->te_urlmap; o; o = url_map_prec(o)) {
      UrlMap *dad, *granddad, *uncle, *to_be_removed;
      /* We must have a node with black dad, no brother, red granddad and uncle */
      if (!(dad = o->um_dad) || !dad->um_black)
	continue;
      if (dad->um_left && dad->um_right)
	continue;
      if (!(granddad = dad->um_dad) || granddad->um_black)
	continue;
      if (granddad->um_left == dad)
	uncle = granddad->um_right;
      else
	uncle = granddad->um_left;
      if (!uncle || uncle->um_black)
	continue;
      to_be_removed = url_map_prec(o->um_dad);
      if (to_be_removed == granddad || to_be_removed == uncle)
	continue;
      if (!to_be_removed->um_left || !to_be_removed->um_right)
	continue;
      te = (TEntry *)to_be_removed;
      break;
    }
    TEST(te->te_inserted, 1);
    url_map_remove(&tree, te->te_urlmap);
    te->te_inserted = 0;
    TEST_1(url_map_height(tree) <= 2 * log2ceil(N - i + 1));
    TEST_1(redblack_check(tree));
  }

1080
  TEST_P(tree, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109

  su_home_check(home);
  su_home_zap(home);

  END();
}

int test_speed(void)
{
  su_home_t *home;
  UrlMap *tree = NULL, *o = NULL;
  url_t *u;
  TEntry *te;
  unsigned i;
  char path[16];
  int const N = 1000000;

  BEGIN();

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

  u = url_hdup(home, (url_t *)"http://host");
  u->url_path = path;

  for (i = 0; i < N; i++) {
    snprintf(path, (sizeof path), "p%07u", i);
    te = (TEntry *)url_map_new(home, (void *)u, sizeof *te);
    te->te_value = i;
    TEST(url_map_insert(&tree, te->te_urlmap, &o), 0);
1110
    TEST_P(o, NULL);
Pekka Pessi's avatar
Pekka Pessi committed
1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167
  }

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

  for (i = 0; i < N; i++) {
    snprintf(path, (sizeof path), "p%07u", i);
    te = (TEntry *)url_map_find(tree, (void*)u, 1);
    TEST_1(te); TEST(te->te_value, i);
  }

  snprintf(path, (sizeof path), "p%07u", 0);

  te = (TEntry *)url_map_find(tree, (void*)u, 1);

  for (i = 0; i < N; i++) {
    TEST_1(te); TEST(te->te_value, i);
    te = (TEntry *)url_map_succ(te->te_urlmap);
  }
  TEST_1(te == 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_path(); fflush(stdout);
  retval |= test_balance(); fflush(stdout);

  return retval;
}

#endif