4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
31 * This file is part of Lustre, http://www.lustre.org/
32 * Lustre is a trademark of Sun Microsystems, Inc.
34 * lustre/tests/it_test.c
36 * Unit test tool for interval tree.
38 * Author: jay <jxiong@clusterfs.com>
47 #include <libcfs/util/list.h>
49 #include <linux/types.h>
51 #define EXPORT_SYMBOL(s)
53 #include <../ldlm/interval_tree.c>
55 #define dprintf(fmt, args...) //printf(fmt, ##args)
56 #define error(fmt, args...) do { \
57 fflush(stdout), fflush(stderr); \
58 fprintf(stderr, "\nError:" fmt, ##args); \
62 #define ALIGN_SIZE 4096
63 #define ALIGN_MASK (~(ALIGN_SIZE - 1))
65 static struct it_node {
66 struct interval_node node;
67 struct list_head list;
71 static struct list_head header = LIST_HEAD_INIT(header);
72 static unsigned long max_count = ULONG_MAX & ALIGN_MASK;
73 static int have_wide_lock = 0;
75 static void it_test_clear(void)
78 for (i = 0; i < it_count; i++)
82 static enum interval_iter cb(struct interval_node *n, void *args)
84 struct it_node *node = (struct it_node *)n;
88 error("A duplicate node [%#jx:%#jx] access found\n",
89 (uintmax_t)n->in_extent.start,
90 (uintmax_t)n->in_extent.end);
91 return INTERVAL_ITER_CONT;
94 if (node->valid == 0) {
95 error("A deleted node [%#jx:%#jx] being accessed\n",
96 (uintmax_t)n->in_extent.start,
97 (uintmax_t)n->in_extent.end);
98 return INTERVAL_ITER_STOP;
105 dprintf("[%#jx:%#jx] ", (uintmax_t)n->in_extent.start,
106 (uintmax_t)n->in_extent.end);
110 return INTERVAL_ITER_CONT;
113 static int it_test_search(struct interval_node *root)
116 struct interval_node_extent ext;
117 int times = 10, i, err = 0;
121 ext.start = (random() % max_count) & ALIGN_MASK;
122 ext.end = random() % (max_count - ext.start + 2) + ext.start;
123 ext.end &= ALIGN_MASK;
124 if (ext.end > max_count)
127 dprintf("\n\nSearching the node overlapped [%#jx:%#jx] ..\n",
128 (uintmax_t)ext.start, (uintmax_t)ext.end);
130 interval_search(root, &ext, cb, NULL);
132 dprintf("\nverifing ...");
135 for (i = 0; i < it_count; i++) {
140 if (extent_overlapped(&ext, &n->node.in_extent) &&
142 error("node [%#jx:%#jx] overlaps [%#jx:%#jx],"
143 "but never to be hit.\n",
144 (uintmax_t)n->node.in_extent.start,
145 (uintmax_t)n->node.in_extent.end,
146 (uintmax_t)ext.start, (uintmax_t)ext.end);
148 if (!extent_overlapped(&ext, &n->node.in_extent) &&
150 error("node [%#jx:%#jx] overlaps [%#jx:%#jx], but hit.\n",
151 (uintmax_t)n->node.in_extent.start,
152 (uintmax_t)n->node.in_extent.end,
153 (uintmax_t)ext.start, (uintmax_t)ext.end);
155 if (err) error("search error\n");
162 static int it_test_iterate(struct interval_node *root)
166 dprintf("\n\nIterate testing start..\n");
169 interval_iterate(root, cb, NULL);
172 for (i = 0; i < it_count; i++) {
173 if (it_array[i].valid == 0)
175 if (it_array[i].hit == 0) {
176 error("Node [%#jx:%#jx] is not accessed\n",
177 (uintmax_t)it_array[i].node.in_extent.start,
178 (uintmax_t)it_array[i].node.in_extent.end);
184 static int it_test_iterate_reverse(struct interval_node *root)
188 dprintf("\n\niterate reverse testing start..\n");
190 interval_iterate_reverse(root, cb, NULL);
193 for (i = 0; i < it_count; i++) {
194 if (it_array[i].valid == 0)
196 if (it_array[i].hit == 0)
197 error("Not every extent is accessed\n");
203 static int it_test_find(struct interval_node *root)
206 struct interval_node_extent *ext;
208 dprintf("\ninterval_find testing start ..\n");
209 for (idx = 0; idx < it_count; idx++) {
210 if (it_array[idx].valid == 0)
213 ext = &it_array[idx].node.in_extent;
214 dprintf("Try to find [%#jx:%#jx]\n", (uintmax_t)ext->start,
215 (uintmax_t)ext->end);
216 if (!interval_find(root, ext)) {
217 error("interval_find, try to find [%#jx:%#jx]\n",
218 (uintmax_t)ext->start, (uintmax_t)ext->end);
224 /* sanity test is tightly coupled with implementation, so when you changed
225 * the interval tree implementation, change this code also. */
226 static enum interval_iter sanity_cb(struct interval_node *node, void *args)
228 __u64 max_high = node->in_max_high;
229 struct interval_node *tmp, *parent;
230 int left = 1, has = 0, nr = 0;
232 parent = node->in_parent;
233 node->in_parent = NULL;
234 interval_for_each(tmp, node) {
235 if ((left && node_compare(tmp, node) > 0) ||
236 (!left && node_compare(tmp, node) < 0))
237 error("interval tree sanity test\n");
239 if (tmp->in_max_high > max_high) {
240 dprintf("max high sanity check, max_high is %llu,"
241 "child max_high: %llu[%#jx:%#jx]\n",
242 max_high, tmp->in_max_high,
243 __F(&tmp->in_extent));
245 } else if (tmp->in_max_high == max_high) {
259 dprintf("node[%#jx:%#jx]:%llu Child list:\n",
260 node->in_extent.start,
264 interval_for_each(tmp, node) {
265 dprintf("[%#jx:%#jx]:%llu ",
266 __F(&tmp->in_extent),
274 error("max high sanity check, has == %d\n", has);
276 node->in_parent = parent;
280 if (node_is_black(tmp))
282 else if ((tmp->in_left && node_is_red(tmp->in_left)) ||
283 (tmp->in_right && node_is_red(tmp->in_right)))
284 error("wrong tree, a red node has red child\n");
290 if (node_is_black(tmp))
295 error("wrong tree, unbalanced!\n");
300 static int it_test_sanity(struct interval_node *root)
303 interval_iterate(root, sanity_cb, NULL);
307 static int it_test_search_hole(struct interval_node *root)
310 struct interval_node_extent ext, ext2;
312 __u64 low = 0, high = ~0;
318 ext.start = random() % max_count;
320 } while (interval_is_overlapped(root, &ext));
323 interval_expand(root, &ext, NULL);
324 dprintf("Extending [%#jx:%#jx] to ..[%#jx:%#jx]\n",
325 (uintmax_t)ext2.start, (uintmax_t)ext2.end,
326 (uintmax_t)ext.start, (uintmax_t)ext.end);
327 for (i = 0; i < it_count; i++) {
332 if (extent_overlapped(&ext, &n->node.in_extent)) {
333 error("Extending [%#jx:%#jx] to ..[%#jx:%#jx] overlaps node[%#jx:%#jx]\n",
334 (uintmax_t)ext2.start, (uintmax_t)ext2.end,
335 (uintmax_t)ext.start, (uintmax_t)ext.end,
336 (uintmax_t)n->node.in_extent.start,
337 (uintmax_t)n->node.in_extent.end);
340 if (n->node.in_extent.end < ext2.start)
341 low = max_u64(n->node.in_extent.end + 1, low);
343 if (n->node.in_extent.start > ext2.end)
344 high = min_u64(n->node.in_extent.start - 1, high);
347 /* only expanding high right now */
348 if (ext2.start != ext.start || high != ext.end) {
349 ext2.start = low, ext2.end = high;
350 error("Real extending result:[%#jx:%#jx], expected:[%#jx:%#jx]\n",
351 (uintmax_t)ext.start, (uintmax_t)ext.end,
352 (uintmax_t)ext2.start, (uintmax_t)ext2.end);
358 static int contended_count = 0;
359 #define LOOP_COUNT 1000
360 static enum interval_iter perf_cb(struct interval_node *n, void *args)
362 unsigned long count = LOOP_COUNT;
365 return INTERVAL_ITER_CONT;
368 static inline long tv_delta(struct timeval *s, struct timeval *e)
370 long c = e->tv_sec - s->tv_sec;
372 c += (long int)(e->tv_usec - s->tv_usec) / 1000;
373 dprintf("\tStart: %lu:%lu -> End: %lu:%lu\n",
374 s->tv_sec, s->tv_usec, e->tv_sec, e->tv_usec);
378 static int it_test_performance(struct interval_node *root, unsigned long len)
380 int i = 0, interval_time, list_time;
381 struct interval_node_extent ext;
383 struct timeval start, end;
386 ext.start = (random() % (max_count - len)) & ALIGN_MASK;
387 ext.end = (ext.start + len) & ALIGN_MASK;
388 if (have_wide_lock) {
389 ext.start = (max_count - len) & ALIGN_MASK;
393 dprintf("Extent search[%#jx:%#jx]\n", (uintmax_t)ext.start,
398 gettimeofday(&start, NULL);
399 list_for_each_entry(n, &header, list) {
400 if (extent_overlapped(&ext, &n->node.in_extent)) {
406 gettimeofday(&end, NULL);
407 list_time = tv_delta(&start, &end);
412 gettimeofday(&start, NULL);
413 interval_search(root, &ext, perf_cb, &contended_count);
414 gettimeofday(&end, NULL);
415 interval_time = tv_delta(&start, &end);
417 if (i != contended_count)
418 error("count of contended lock don't match(%d: %d)\n",
421 printf("\tList vs Int. search: \n\t\t"
422 "(%d vs %d)ms, %d contended lock.\n",
423 list_time, interval_time, contended_count);
428 static struct interval_node *it_test_helper(struct interval_node *root)
433 count = random() % it_count;
435 idx = random() % it_count;
438 if (!interval_find(root, &n->node.in_extent))
439 error("Cannot find an existent node\n");
440 dprintf("Erasing a node [%#jx:%#jx]\n",
441 (uintmax_t)n->node.in_extent.start,
442 (uintmax_t)n->node.in_extent.end);
443 interval_erase(&n->node, &root);
445 list_del_init(&n->list);
448 low = (random() % max_count) & ALIGN_MASK;
449 high = ((random() % max_count + 1) & ALIGN_MASK) + low;
450 if (high > max_count)
452 interval_set(&n->node, low, high);
453 while (interval_insert(&n->node, &root))
454 interval_set(&n->node, low, ++high);
455 dprintf("Adding a node [%#jx:%#jx]\n",
456 (uintmax_t)n->node.in_extent.start,
457 (uintmax_t)n->node.in_extent.end);
459 list_add(&n->list, &header);
466 static struct interval_node *it_test_init(int count)
469 uint64_t high, low, len;
471 struct interval_node *root = NULL;
474 it_array = (struct it_node *)malloc(sizeof(struct it_node) * count);
475 if (it_array == NULL)
476 error("it_array == NULL, no memory\n");
479 for (i = 0; i < count; i++) {
482 low = (random() % max_count + 1) & ALIGN_MASK;
483 len = (random() % 256 + 1) * ALIGN_SIZE;
484 if (!have_wide_lock && !(random() % count)) {
489 high = low + (len & ALIGN_MASK);
491 interval_set(&n->node, low, high);
492 } while (interval_insert(&n->node, &root));
496 list_add_tail(&n->list, &header);
498 list_add_tail(&n->list, &it_array[rand()%i].list);
504 static void it_test_fini(void)
512 int main(int argc, char *argv[])
514 int count = 5, perf = 0;
515 struct interval_node *root;
518 gettimeofday(&tv, NULL);
522 if (strcmp(argv[1], "-p"))
523 error("Unknow options, usage: %s [-p]\n", argv[0]);
530 root = it_test_init(1000000);
531 printf("1M locks with 4K request size\n");
532 it_test_performance(root, 4096);
533 printf("1M locks with 128K request size\n");
534 it_test_performance(root, 128 * 1024);
535 printf("1M locks with 256K request size\n");
536 it_test_performance(root, 256 * 1024);
537 printf("1M locks with 1M request size\n");
538 it_test_performance(root, 1 * M);
539 printf("1M locks with 16M request size\n");
540 it_test_performance(root, 16 * M);
541 printf("1M locks with 32M request size\n");
542 it_test_performance(root, 32 * M);
543 printf("1M locks with 64M request size\n");
544 it_test_performance(root, 64 * M);
545 printf("1M locks with 128M request size\n");
546 it_test_performance(root, 128 * M);
547 printf("1M locks with 256M request size\n");
548 it_test_performance(root, 256 * M);
549 printf("1M locks with 512M request size\n");
550 it_test_performance(root, 512 * M);
551 printf("1M locks with 1G request size\n");
552 it_test_performance(root, 1024 * M);
553 printf("1M locks with 2G request size\n");
554 it_test_performance(root, 2048 * M);
555 printf("1M locks with 3G request size\n");
556 it_test_performance(root, 3072 * M);
557 printf("1M locks with 4G request size\n");
558 it_test_performance(root, max_count - 1);
563 root = it_test_init(random() % 100000 + 1000);
565 it_test_sanity(root);
566 it_test_iterate(root);
567 it_test_iterate_reverse(root);
569 it_test_search_hole(root);
570 it_test_search(root);
571 root = it_test_helper(root);