#include #include #include #include #define NODES 100 #define PERF_LOOPS 100000 #define SEARCHES 100 #define SEARCH_LOOPS 10000 static struct rb_root root = RB_ROOT; static struct interval_tree_node nodes[NODES]; static u32 queries[SEARCHES]; static struct rnd_state rnd; static inline unsigned long search(unsigned long query, struct rb_root *root) { struct interval_tree_node *node; unsigned long results = 0; for (node = interval_tree_iter_first(root, query, query); node; node = interval_tree_iter_next(node, query, query)) results++; return results; } static void init(void) { int i; for (i = 0; i < NODES; i++) { u32 a = prandom_u32_state(&rnd); u32 b = prandom_u32_state(&rnd); if (a <= b) { nodes[i].start = a; nodes[i].last = b; } else { nodes[i].start = b; nodes[i].last = a; } } for (i = 0; i < SEARCHES; i++) queries[i] = prandom_u32_state(&rnd); } static int interval_tree_test_init(void) { int i, j; unsigned long results; cycles_t time1, time2, time; printk(KERN_ALERT "interval tree insert/remove"); prandom_seed_state(&rnd, 3141592653589793238ULL); init(); time1 = get_cycles(); for (i = 0; i < PERF_LOOPS; i++) { for (j = 0; j < NODES; j++) interval_tree_insert(nodes + j, &root); for (j = 0; j < NODES; j++) interval_tree_remove(nodes + j, &root); } time2 = get_cycles(); time = time2 - time1; time = div_u64(time, PERF_LOOPS); printk(" -> %llu cycles\n", (unsigned long long)time); printk(KERN_ALERT "interval tree search"); for (j = 0; j < NODES; j++) interval_tree_insert(nodes + j, &root); time1 = get_cycles(); results = 0; for (i = 0; i < SEARCH_LOOPS; i++) for (j = 0; j < SEARCHES; j++) results += search(queries[j], &root); time2 = get_cycles(); time = time2 - time1; time = div_u64(time, SEARCH_LOOPS); results = div_u64(results, SEARCH_LOOPS); printk(" -> %llu cycles (%lu results)\n", (unsigned long long)time, results); return -EAGAIN; /* Fail will directly unload the module */ } static void interval_tree_test_exit(void) { printk(KERN_ALERT "test exit\n"); } module_init(interval_tree_test_init) module_exit(interval_tree_test_exit) MODULE_LICENSE("GPL"); MODULE_AUTHOR("Michel Lespinasse"); MODULE_DESCRIPTION("Interval Tree test"); xt.git/log/net/netlabel/Makefile'>
path: root/net/netlabel/Makefile
diff options
context:
space:
mode:
authorThomas Gleixner <tglx@linutronix.de>2016-12-25 12:30:41 +0100
committerThomas Gleixner <tglx@linutronix.de>2016-12-25 17:21:22 +0100
commit8b0e195314fabd58a331c4f7b6db75a1565535d7 (patch)
tree6ff9d2d9388406b8447b09b6a4037795142172de /net/netlabel/Makefile
parent2456e855354415bfaeb7badaa14e11b3e02c8466 (diff)
ktime: Cleanup ktime_set() usage
ktime_set(S,N) was required for the timespec storage type and is still useful for situations where a Seconds and Nanoseconds part of a time value needs to be converted. For anything where the Seconds argument is 0, this is pointless and can be replaced with a simple assignment. Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Cc: Peter Zijlstra <peterz@infradead.org>
Diffstat (limited to 'net/netlabel/Makefile')