]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - crypto/xor.c
crypto: wait for a full jiffy in do_xor_speed
[mirror_ubuntu-zesty-kernel.git] / crypto / xor.c
CommitLineData
1da177e4
LT
1/*
2 * xor.c : Multiple Devices driver for Linux
3 *
4 * Copyright (C) 1996, 1997, 1998, 1999, 2000,
5 * Ingo Molnar, Matti Aarnio, Jakub Jelinek, Richard Henderson.
6 *
7 * Dispatch optimized RAID-5 checksumming functions.
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2, or (at your option)
12 * any later version.
13 *
14 * You should have received a copy of the GNU General Public License
15 * (for example /usr/src/linux/COPYING); if not, write to the Free
16 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
17 */
18
19#define BH_TRACE 0
20#include <linux/module.h>
5a0e3ad6 21#include <linux/gfp.h>
1da177e4 22#include <linux/raid/xor.h>
bff61975 23#include <linux/jiffies.h>
1da177e4
LT
24#include <asm/xor.h>
25
26/* The xor routines to use. */
27static struct xor_block_template *active_template;
28
29void
9bc89cd8 30xor_blocks(unsigned int src_count, unsigned int bytes, void *dest, void **srcs)
1da177e4 31{
9bc89cd8 32 unsigned long *p1, *p2, *p3, *p4;
1da177e4 33
9bc89cd8
DW
34 p1 = (unsigned long *) srcs[0];
35 if (src_count == 1) {
36 active_template->do_2(bytes, dest, p1);
1da177e4
LT
37 return;
38 }
39
9bc89cd8
DW
40 p2 = (unsigned long *) srcs[1];
41 if (src_count == 2) {
42 active_template->do_3(bytes, dest, p1, p2);
1da177e4
LT
43 return;
44 }
45
9bc89cd8
DW
46 p3 = (unsigned long *) srcs[2];
47 if (src_count == 3) {
48 active_template->do_4(bytes, dest, p1, p2, p3);
1da177e4
LT
49 return;
50 }
51
9bc89cd8
DW
52 p4 = (unsigned long *) srcs[3];
53 active_template->do_5(bytes, dest, p1, p2, p3, p4);
1da177e4 54}
685784aa 55EXPORT_SYMBOL(xor_blocks);
1da177e4
LT
56
57/* Set of all registered templates. */
58static struct xor_block_template *template_list;
59
60#define BENCH_SIZE (PAGE_SIZE)
61
62static void
63do_xor_speed(struct xor_block_template *tmpl, void *b1, void *b2)
64{
65 int speed;
6a328475 66 unsigned long now, j;
1da177e4
LT
67 int i, count, max;
68
69 tmpl->next = template_list;
70 template_list = tmpl;
71
72 /*
73 * Count the number of XORs done during a whole jiffy, and use
74 * this to calculate the speed of checksumming. We use a 2-page
75 * allocation to have guaranteed color L1-cache layout.
76 */
77 max = 0;
78 for (i = 0; i < 5; i++) {
6a328475 79 j = jiffies;
1da177e4 80 count = 0;
6a328475
JK
81 while ((now = jiffies) == j)
82 cpu_relax();
83 while (time_before(jiffies, now + 1)) {
685784aa 84 mb(); /* prevent loop optimzation */
1da177e4
LT
85 tmpl->do_2(BENCH_SIZE, b1, b2);
86 mb();
87 count++;
88 mb();
89 }
90 if (count > max)
91 max = count;
92 }
93
94 speed = max * (HZ * BENCH_SIZE / 1024);
95 tmpl->speed = speed;
96
685784aa 97 printk(KERN_INFO " %-10s: %5d.%03d MB/sec\n", tmpl->name,
1da177e4
LT
98 speed / 1000, speed % 1000);
99}
100
685784aa
DW
101static int __init
102calibrate_xor_blocks(void)
1da177e4
LT
103{
104 void *b1, *b2;
105 struct xor_block_template *f, *fastest;
106
33f65df7
VN
107 /*
108 * Note: Since the memory is not actually used for _anything_ but to
109 * test the XOR speed, we don't really want kmemcheck to warn about
110 * reading uninitialized bytes here.
111 */
112 b1 = (void *) __get_free_pages(GFP_KERNEL | __GFP_NOTRACK, 2);
685784aa
DW
113 if (!b1) {
114 printk(KERN_WARNING "xor: Yikes! No memory available.\n");
1da177e4
LT
115 return -ENOMEM;
116 }
117 b2 = b1 + 2*PAGE_SIZE + BENCH_SIZE;
118
119 /*
685784aa
DW
120 * If this arch/cpu has a short-circuited selection, don't loop through
121 * all the possible functions, just test the best one
1da177e4
LT
122 */
123
124 fastest = NULL;
125
126#ifdef XOR_SELECT_TEMPLATE
127 fastest = XOR_SELECT_TEMPLATE(fastest);
128#endif
129
130#define xor_speed(templ) do_xor_speed((templ), b1, b2)
131
132 if (fastest) {
685784aa
DW
133 printk(KERN_INFO "xor: automatically using best "
134 "checksumming function: %s\n",
1da177e4
LT
135 fastest->name);
136 xor_speed(fastest);
137 } else {
9bc89cd8 138 printk(KERN_INFO "xor: measuring software checksum speed\n");
1da177e4
LT
139 XOR_TRY_TEMPLATES;
140 fastest = template_list;
141 for (f = fastest; f; f = f->next)
142 if (f->speed > fastest->speed)
143 fastest = f;
144 }
145
685784aa 146 printk(KERN_INFO "xor: using function: %s (%d.%03d MB/sec)\n",
1da177e4
LT
147 fastest->name, fastest->speed / 1000, fastest->speed % 1000);
148
149#undef xor_speed
150
151 free_pages((unsigned long)b1, 2);
152
153 active_template = fastest;
154 return 0;
155}
156
157static __exit void xor_exit(void) { }
158
1da177e4
LT
159MODULE_LICENSE("GPL");
160
685784aa
DW
161/* when built-in xor.o must initialize before drivers/md/md.o */
162core_initcall(calibrate_xor_blocks);
1da177e4 163module_exit(xor_exit);