lustre/tests/it_test.c

   1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
   2  * vim:expandtab:shiftwidth=8:tabstop=8:
   3  *
   4  * GPL HEADER START
   5  *
   6  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   7  *
   8  * This program is free software; you can redistribute it and/or modify
   9  * it under the terms of the GNU General Public License version 2 only,
  10  * as published by the Free Software Foundation.
  11  *
  12  * This program is distributed in the hope that it will be useful, but
  13  * WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15  * General Public License version 2 for more details (a copy is included
  16  * in the LICENSE file that accompanied this code).
  17  *
  18  * You should have received a copy of the GNU General Public License
  19  * version 2 along with this program; If not, see
  20  * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
  21  *
  22  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
  23  * CA 95054 USA or visit www.sun.com if you need additional information or
  24  * have any questions.
  25  *
  26  * GPL HEADER END
  27  */
  28 /*
  29  * Copyright  2008 Sun Microsystems, Inc. All rights reserved
  30  * Use is subject to license terms.
  31  */
  32 /*
  33  * This file is part of Lustre, http://www.lustre.org/
  34  * Lustre is a trademark of Sun Microsystems, Inc.
  35  *
  36  * lustre/tests/it_test.c
  37  *
  38  * Unit test tool for interval tree.
  39  *
  40  * Author: jay <jxiong@clusterfs.com>
  41  */
  42
  43 #include <stdio.h>
  44 #include <stdlib.h>
  45 #include <time.h>
  46 #include <sys/time.h>
  47
  48 #include <libcfs/kp30.h>
  49 #include <../ldlm/interval_tree.c>
  50
  51 #define dprintf(fmt, args...) //printf(fmt, ##args)
  52 #define error(fmt, args...) do {                        \
  53         fflush(stdout), fflush(stderr);                 \
  54         fprintf(stderr, "\nError:" fmt, ##args);        \
  55         abort();                                        \
  56 } while(0)
  57
  58 #define __F(ext)         (ext)->start, (ext)->end
  59 #define __S              "["LPX64":"LPX64"]"
  60
  61 #define ALIGN_SIZE       4096
  62 #define ALIGN_MASK       (~(ALIGN_SIZE - 1))
  63
  64 static struct it_node {
  65         struct interval_node node;
  66         struct list_head list;
  67         int hit, valid;
  68 } *it_array;
  69 static int it_count;
  70 CFS_LIST_HEAD(header);
  71 static unsigned long max_count = ULONG_MAX & ALIGN_MASK;
  72 static int have_wide_lock = 0;
  73
  74 static void it_test_clear(void)
  75 {
  76         int i = 0;
  77         for (i = 0; i < it_count; i++)
  78                 it_array[i].hit = 0;
  79 }
  80
  81 static enum interval_iter cb(struct interval_node *n, void *args)
  82 {
  83         struct it_node *node = (struct it_node *)n;
  84         static int count = 1;
  85
  86         if (node->hit == 1) {
  87                 error("A duplicate node "__S" access found\n",
  88                        __F(&n->in_extent));
  89                 return INTERVAL_ITER_CONT;
  90         }
  91
  92         if (node->valid == 0) {
  93                 error("A deleted node "__S" being accessed\n",
  94                        __F(&n->in_extent));
  95                 return INTERVAL_ITER_STOP;
  96         }
  97
  98         if (count++ == 8) {
  99                 dprintf("\n");
 100                 count = 1;
 101         }
 102         dprintf(""__S" ", __F(&n->in_extent));
 103         fflush(stdout);
 104
 105         node->hit = 1;
 106         return INTERVAL_ITER_CONT;
 107 }
 108
 109 static int it_test_search(struct interval_node *root)
 110 {
 111         struct it_node *n;
 112         struct interval_node_extent ext;
 113         int times = 10, i, err = 0;
 114
 115         while (times--) {
 116                 it_test_clear();
 117                 ext.start = (random() % max_count) & ALIGN_MASK;
 118                 ext.end = random() % (max_count - ext.start + 2) + ext.start;
 119                 ext.end &= ALIGN_MASK;
 120                 if (ext.end > max_count)
 121                         ext.end = max_count;
 122
 123                 dprintf("\n\nSearching the node overlapped "__S" ..\n",
 124                         __F(&ext));
 125
 126                 interval_search(root, &ext, cb, NULL);
 127
 128                 dprintf("\nverifing ...");
 129
 130                 /* verify */
 131                 for (i = 0; i < it_count; i++) {
 132                         n = &it_array[i];
 133                         if (n->valid == 0)
 134                                 continue;
 135
 136                         if (extent_overlapped(&ext, &n->node.in_extent) &&
 137                             n->hit == 0)
 138                                 error("node "__S" overlaps" __S","
 139                                       "but never to be hit.\n",
 140                                       __F(&n->node.in_extent),
 141                                       __F(&ext));
 142
 143                         if (!extent_overlapped(&ext, &n->node.in_extent) &&
 144                             n->hit)
 145                                 error("node "__S" overlaps" __S", but hit.\n",
 146                                       __F(&n->node.in_extent),
 147                                       __F(&ext));
 148                 }
 149                 if (err) error("search error\n");
 150                 dprintf("ok.\n");
 151         }
 152
 153         return 0;
 154 }
 155
 156 static int it_test_iterate(struct interval_node *root)
 157 {
 158         int i;
 159
 160         dprintf("\n\nIterate testing start..\n");
 161
 162         it_test_clear();
 163         interval_iterate(root, cb, NULL);
 164
 165         /* verify */
 166         for (i = 0; i < it_count; i++) {
 167                 if (it_array[i].valid == 0)
 168                         continue;
 169                 if (it_array[i].hit == 0)
 170                         error("Node "__S" is not accessed\n",
 171                               __F(&it_array[i].node.in_extent));
 172         }
 173
 174         return 0;
 175 }
 176
 177 static int it_test_iterate_reverse(struct interval_node *root)
 178 {
 179         int i;
 180
 181         dprintf("\n\niterate reverse testing start..\n");
 182         it_test_clear();
 183         interval_iterate_reverse(root, cb, NULL);
 184
 185         /* verify */
 186         for (i = 0; i < it_count; i++) {
 187                 if (it_array[i].valid == 0)
 188                         continue;
 189                 if (it_array[i].hit == 0)
 190                         error("Not every extent is accessed\n");
 191         }
 192
 193         return 0;
 194 }
 195
 196 static int it_test_find(struct interval_node *root)
 197 {
 198         int idx;
 199         struct interval_node_extent *ext;
 200
 201         dprintf("\ninterval_find testing start ..\n");
 202         for (idx = 0; idx < it_count; idx++) {
 203                 if (it_array[idx].valid == 0)
 204                         continue;
 205
 206                 ext = &it_array[idx].node.in_extent;
 207                 dprintf("Try to find "__S"\n", __F(ext));
 208                 if (!interval_find(root, ext))
 209                         error("interval_find, try to find "__S"\n", __F(ext));
 210         }
 211         return 0;
 212 }
 213
 214 /* sanity test is tightly coupled with implementation, so when you changed
 215  * the interval tree implementation, change this code also. */
 216 static enum interval_iter sanity_cb(struct interval_node *node, void *args)
 217 {
 218         __u64 max_high = node->in_max_high;
 219         struct interval_node *tmp, *parent;
 220         int left = 1, has = 0, nr = 0;
 221
 222         parent = node->in_parent;
 223         node->in_parent = NULL;
 224         interval_for_each(tmp, node) {
 225                 if ((left && node_compare(tmp, node) > 0) ||
 226                     (!left && node_compare(tmp, node) < 0))
 227                         error("interval tree sanity test\n");
 228
 229                 if (tmp->in_max_high > max_high) {
 230                         dprintf("max high sanity check, max_high is %llu,"
 231                                 "child max_high: %llu"__S"\n",
 232                                 max_high, tmp->in_max_high,
 233                                 __F(&tmp->in_extent));
 234                         goto err;
 235                 } else if (tmp->in_max_high == max_high) {
 236                         has = 1;
 237                 }
 238
 239                 if (tmp == node) {
 240                         left = 0;
 241                         continue;
 242                 }
 243         }
 244
 245         if (!has) {
 246                 int count = 1;
 247 err:
 248                 dprintf("node"__S":%llu Child list:\n",
 249                         node->in_extent.start,
 250                         node->in_extent.end,
 251                         node->in_max_high);
 252
 253                 interval_for_each(tmp, node) {
 254                         dprintf(""__S":%llu ",
 255                                 __F(&tmp->in_extent),
 256                                 tmp->in_max_high);
 257                         if (count++ == 8) {
 258                                 dprintf("\n");
 259                                 count = 1;
 260                         }
 261                 }
 262
 263                 error("max high sanity check, has == %d\n", has);
 264         }
 265         node->in_parent = parent;
 266
 267         tmp = node;
 268         while (tmp) {
 269                 if (node_is_black(tmp))
 270                         nr++;
 271                 else if ((tmp->in_left && node_is_red(tmp->in_left)) ||
 272                          (tmp->in_right && node_is_red(tmp->in_right)))
 273                         error("wrong tree, a red node has red child\n");
 274                 tmp = tmp->in_left;
 275         }
 276
 277         tmp = node;
 278         while (tmp) {
 279                 if (node_is_black(tmp))
 280                         nr--;
 281                 tmp = tmp->in_right;
 282         }
 283         if (nr)
 284                 error("wrong tree, unbalanced!\n");
 285
 286         return 0;
 287 }
 288
 289 static int it_test_sanity(struct interval_node *root)
 290 {
 291         it_test_clear();
 292         interval_iterate(root, sanity_cb, NULL);
 293         return 0;
 294 }
 295
 296 static int it_test_search_hole(struct interval_node *root)
 297 {
 298         int i, count = 10;
 299         struct interval_node_extent ext, ext2;
 300         struct it_node *n;
 301         __u64 low = 0, high = ~0;
 302
 303         do {
 304                 if (--count == 0)
 305                         return 0;
 306
 307                 ext.start = random() % max_count;
 308                 ext.end = ext.start;
 309         } while (interval_is_overlapped(root, &ext));
 310         ext2 = ext;
 311
 312         interval_expand(root, &ext, NULL);
 313         dprintf("Extending "__S" to .."__S"\n", __F(&ext2), __F(&ext));
 314         for (i = 0; i < it_count; i++) {
 315                 n = &it_array[i];
 316                 if (n->valid == 0)
 317                         continue;
 318
 319                 if (extent_overlapped(&ext, &n->node.in_extent)) {
 320                         error("Extending "__S" to .."__S" overlaps node"__S"\n",
 321                                 __F(&ext2), __F(&ext), __F(&n->node.in_extent));
 322                 }
 323
 324                 if (n->node.in_extent.end < ext2.start)
 325                         low = max_u64(n->node.in_extent.end + 1, low);
 326
 327                 if (n->node.in_extent.start > ext2.end)
 328                         high = min_u64(n->node.in_extent.start - 1, high);
 329         }
 330
 331         /* only expanding high right now */
 332         if (ext2.start != ext.start || high != ext.end) {
 333                 ext2.start = low, ext2.end = high;
 334                 error("Real extending result:"__S", expected:"__S"\n",
 335                        __F(&ext), __F(&ext2));
 336         }
 337
 338         return 0;
 339 }
 340
 341 static int contended_count = 0;
 342 #define LOOP_COUNT 1000
 343 static enum interval_iter perf_cb(struct interval_node *n, void *args)
 344 {
 345         unsigned long count = LOOP_COUNT;
 346         while (count--);
 347         contended_count++;
 348         return INTERVAL_ITER_CONT;
 349 }
 350
 351 static inline long tv_delta(struct timeval *s, struct timeval *e)
 352 {
 353         long c = e->tv_sec - s->tv_sec;
 354         c *= 1000;
 355         c += (long int)(e->tv_usec - s->tv_usec) / 1000;
 356         dprintf("\tStart: %lu:%lu -> End: %lu:%lu\n",
 357                 s->tv_sec, s->tv_usec, e->tv_sec, e->tv_usec);
 358         return c;
 359 }
 360
 361 static int it_test_performance(struct interval_node *root, unsigned long len)
 362 {
 363         int i = 0, interval_time, list_time;
 364         struct interval_node_extent ext;
 365         struct it_node *n;
 366         struct timeval start, end;
 367         unsigned long count;
 368
 369         ext.start = (random() % (max_count - len)) & ALIGN_MASK;
 370         ext.end = (ext.start + len) & ALIGN_MASK;
 371         if (have_wide_lock) {
 372                 ext.start = (max_count - len) & ALIGN_MASK;
 373                 ext.end = max_count;
 374         }
 375
 376         dprintf("Extent search"__S"\n", __F(&ext));
 377
 378         /* list */
 379         contended_count = 0;
 380         gettimeofday(&start, NULL);
 381         list_for_each_entry(n, &header, list) {
 382                 if (extent_overlapped(&ext, &n->node.in_extent)) {
 383                         count = LOOP_COUNT;
 384                         while (count--);
 385                         contended_count++;
 386                 }
 387         }
 388         gettimeofday(&end, NULL);
 389         list_time = tv_delta(&start, &end);
 390         i = contended_count;
 391
 392         /* interval */
 393         contended_count = 0;
 394         gettimeofday(&start, NULL);
 395         interval_search(root, &ext, perf_cb, &contended_count);
 396         gettimeofday(&end, NULL);
 397         interval_time = tv_delta(&start, &end);
 398
 399         if (i != contended_count)
 400                 error("count of contended lock don't match(%d: %d)\n",
 401                       i, contended_count);
 402
 403         printf("\tList vs Int. search: \n\t\t"
 404                "(%d vs %d)ms, %d contended lock.\n",
 405                 list_time, interval_time, contended_count);
 406
 407         return 0;
 408 }
 409
 410 static struct interval_node *it_test_helper(struct interval_node *root)
 411 {
 412         int idx, count = 0;
 413         struct it_node *n;
 414
 415         count = random() % it_count;
 416         while (count--) {
 417                 idx = random() % it_count;
 418                 n = &it_array[idx];
 419                 if (n->valid) {
 420                         if (!interval_find(root, &n->node.in_extent))
 421                                 error("Cannot find an existent node\n");
 422                         dprintf("Erasing a node "__S"\n",
 423                                 __F(&n->node.in_extent));
 424                         interval_erase(&n->node, &root);
 425                         n->valid = 0;
 426                         list_del_init(&n->list);
 427                 } else {
 428                         __u64 low, high;
 429                         low = (random() % max_count) & ALIGN_MASK;
 430                         high = ((random() % max_count + 1) & ALIGN_MASK) + low;
 431                         if (high > max_count)
 432                                 high = max_count;
 433                         interval_set(&n->node, low, high);
 434                         while (interval_insert(&n->node, &root))
 435                                 interval_set(&n->node, low, ++high);
 436                         dprintf("Adding a node "__S"\n",
 437                                 __F(&n->node.in_extent));
 438                         n->valid = 1;
 439                         list_add(&n->list, &header);
 440                 }
 441         }
 442
 443         return root;
 444 }
 445
 446 static struct interval_node *it_test_init(int count)
 447 {
 448         int i;
 449         uint64_t high, low, len;
 450         struct it_node *n;
 451         struct interval_node *root = NULL;
 452
 453         it_count = count;
 454         it_array = (struct it_node *)malloc(sizeof(struct it_node) * count);
 455         if (it_array == NULL)
 456                 error("it_array == NULL, no memory\n");
 457
 458         have_wide_lock = 0;
 459         for (i = 0; i < count; i++) {
 460                 n = &it_array[i];
 461                 do {
 462                         low = (random() % max_count + 1) & ALIGN_MASK;
 463                         len = (random() % 256 + 1) * ALIGN_SIZE;
 464                         if (!have_wide_lock && !(random() % count)) {
 465                                 low = 0;
 466                                 len = max_count;
 467                                 have_wide_lock = 1;
 468                         }
 469                         high = low + (len & ALIGN_MASK);
 470
 471                         interval_set(&n->node, low, high);
 472                 } while (interval_insert(&n->node, &root));
 473                 n->hit = 0;
 474                 n->valid = 1;
 475                 if (i == 0)
 476                         list_add_tail(&n->list, &header);
 477                 else
 478                         list_add_tail(&n->list, &it_array[rand()%i].list);
 479         }
 480
 481         return root;
 482 }
 483
 484 static void it_test_fini(void)
 485 {
 486         free(it_array);
 487         it_array = NULL;
 488         it_count = 0;
 489         max_count = 0;
 490 }
 491
 492 int main(int argc, char *argv[])
 493 {
 494         int count = 5, perf = 0;
 495         struct interval_node *root;
 496         struct timeval tv;
 497
 498         gettimeofday(&tv, NULL);
 499         srandom(tv.tv_usec);
 500
 501         if (argc == 2) {
 502                 if (strcmp(argv[1], "-p"))
 503                         error("Unknow options, usage: %s [-p]\n", argv[0]);
 504                 perf = 1;
 505                 count = 1;
 506         }
 507
 508         if (perf) {
 509                 int M = 1024 * 1024;
 510                 root = it_test_init(1000000);
 511                 printf("1M locks with 4K request size\n");
 512                 it_test_performance(root, 4096);
 513                 printf("1M locks with 128K request size\n");
 514                 it_test_performance(root, 128 * 1024);
 515                 printf("1M locks with 256K request size\n");
 516                 it_test_performance(root, 256 * 1024);
 517                 printf("1M locks with 1M request size\n");
 518                 it_test_performance(root, 1 * M);
 519                 printf("1M locks with 16M request size\n");
 520                 it_test_performance(root, 16 * M);
 521                 printf("1M locks with 32M request size\n");
 522                 it_test_performance(root, 32 * M);
 523                 printf("1M locks with 64M request size\n");
 524                 it_test_performance(root, 64 * M);
 525                 printf("1M locks with 128M request size\n");
 526                 it_test_performance(root, 128 * M);
 527                 printf("1M locks with 256M request size\n");
 528                 it_test_performance(root, 256 * M);
 529                 printf("1M locks with 512M request size\n");
 530                 it_test_performance(root, 512 * M);
 531                 printf("1M locks with 1G request size\n");
 532                 it_test_performance(root, 1024 * M);
 533                 printf("1M locks with 2G request size\n");
 534                 it_test_performance(root, 2048 * M);
 535                 printf("1M locks with 3G request size\n");
 536                 it_test_performance(root, 3072 * M);
 537                 printf("1M locks with 4G request size\n");
 538                 it_test_performance(root, max_count - 1);
 539                 it_test_fini();
 540                 return 0;
 541         }
 542
 543         root = it_test_init(random() % 100000 + 1000);
 544         while (count--) {
 545                 it_test_sanity(root);
 546                 it_test_iterate(root);
 547                 it_test_iterate_reverse(root);
 548                 it_test_find(root);
 549                 it_test_search_hole(root);
 550                 it_test_search(root);
 551                 root = it_test_helper(root);
 552         }
 553         it_test_fini();
 554
 555         return 0;
 556 }