xor.c 3.81 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/*
 * xor.c : Multiple Devices driver for Linux
 *
 * Copyright (C) 1996, 1997, 1998, 1999, 2000,
 * Ingo Molnar, Matti Aarnio, Jakub Jelinek, Richard Henderson.
 *
 * Dispatch optimized RAID-5 checksumming functions.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
 *
 * You should have received a copy of the GNU General Public License
 * (for example /usr/src/linux/COPYING); if not, write to the Free
 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

#define BH_TRACE 0
#include <linux/module.h>
21
#include <linux/gfp.h>
Linus Torvalds's avatar
Linus Torvalds committed
22
#include <linux/raid/xor.h>
23
#include <linux/jiffies.h>
24
#include <linux/preempt.h>
Linus Torvalds's avatar
Linus Torvalds committed
25 26
#include <asm/xor.h>

27 28 29 30
#ifndef XOR_SELECT_TEMPLATE
#define XOR_SELECT_TEMPLATE(x) (x)
#endif

Linus Torvalds's avatar
Linus Torvalds committed
31 32 33 34
/* The xor routines to use.  */
static struct xor_block_template *active_template;

void
Dan Williams's avatar
Dan Williams committed
35
xor_blocks(unsigned int src_count, unsigned int bytes, void *dest, void **srcs)
Linus Torvalds's avatar
Linus Torvalds committed
36
{
Dan Williams's avatar
Dan Williams committed
37
	unsigned long *p1, *p2, *p3, *p4;
Linus Torvalds's avatar
Linus Torvalds committed
38

Dan Williams's avatar
Dan Williams committed
39 40 41
	p1 = (unsigned long *) srcs[0];
	if (src_count == 1) {
		active_template->do_2(bytes, dest, p1);
Linus Torvalds's avatar
Linus Torvalds committed
42 43 44
		return;
	}

Dan Williams's avatar
Dan Williams committed
45 46 47
	p2 = (unsigned long *) srcs[1];
	if (src_count == 2) {
		active_template->do_3(bytes, dest, p1, p2);
Linus Torvalds's avatar
Linus Torvalds committed
48 49 50
		return;
	}

Dan Williams's avatar
Dan Williams committed
51 52 53
	p3 = (unsigned long *) srcs[2];
	if (src_count == 3) {
		active_template->do_4(bytes, dest, p1, p2, p3);
Linus Torvalds's avatar
Linus Torvalds committed
54 55 56
		return;
	}

Dan Williams's avatar
Dan Williams committed
57 58
	p4 = (unsigned long *) srcs[3];
	active_template->do_5(bytes, dest, p1, p2, p3, p4);
Linus Torvalds's avatar
Linus Torvalds committed
59
}
60
EXPORT_SYMBOL(xor_blocks);
Linus Torvalds's avatar
Linus Torvalds committed
61 62

/* Set of all registered templates.  */
63
static struct xor_block_template *__initdata template_list;
Linus Torvalds's avatar
Linus Torvalds committed
64 65 66

#define BENCH_SIZE (PAGE_SIZE)

67
static void __init
Linus Torvalds's avatar
Linus Torvalds committed
68 69 70
do_xor_speed(struct xor_block_template *tmpl, void *b1, void *b2)
{
	int speed;
71
	unsigned long now, j;
Linus Torvalds's avatar
Linus Torvalds committed
72 73 74 75 76
	int i, count, max;

	tmpl->next = template_list;
	template_list = tmpl;

77 78
	preempt_disable();

Linus Torvalds's avatar
Linus Torvalds committed
79 80 81 82 83 84 85
	/*
	 * Count the number of XORs done during a whole jiffy, and use
	 * this to calculate the speed of checksumming.  We use a 2-page
	 * allocation to have guaranteed color L1-cache layout.
	 */
	max = 0;
	for (i = 0; i < 5; i++) {
86
		j = jiffies;
Linus Torvalds's avatar
Linus Torvalds committed
87
		count = 0;
88 89 90
		while ((now = jiffies) == j)
			cpu_relax();
		while (time_before(jiffies, now + 1)) {
91
			mb(); /* prevent loop optimzation */
Linus Torvalds's avatar
Linus Torvalds committed
92 93 94 95 96 97 98 99 100
			tmpl->do_2(BENCH_SIZE, b1, b2);
			mb();
			count++;
			mb();
		}
		if (count > max)
			max = count;
	}

101 102
	preempt_enable();

Linus Torvalds's avatar
Linus Torvalds committed
103 104 105
	speed = max * (HZ * BENCH_SIZE / 1024);
	tmpl->speed = speed;

106
	printk(KERN_INFO "   %-10s: %5d.%03d MB/sec\n", tmpl->name,
Linus Torvalds's avatar
Linus Torvalds committed
107 108 109
	       speed / 1000, speed % 1000);
}

110 111
static int __init
calibrate_xor_blocks(void)
Linus Torvalds's avatar
Linus Torvalds committed
112 113 114 115
{
	void *b1, *b2;
	struct xor_block_template *f, *fastest;

116
	fastest = XOR_SELECT_TEMPLATE(NULL);
117 118 119 120 121 122 123 124

	if (fastest) {
		printk(KERN_INFO "xor: automatically using best "
				 "checksumming function   %-10s\n",
		       fastest->name);
		goto out;
	}

125
	b1 = (void *) __get_free_pages(GFP_KERNEL, 2);
126 127
	if (!b1) {
		printk(KERN_WARNING "xor: Yikes!  No memory available.\n");
Linus Torvalds's avatar
Linus Torvalds committed
128 129 130 131 132
		return -ENOMEM;
	}
	b2 = b1 + 2*PAGE_SIZE + BENCH_SIZE;

	/*
133 134
	 * If this arch/cpu has a short-circuited selection, don't loop through
	 * all the possible functions, just test the best one
Linus Torvalds's avatar
Linus Torvalds committed
135 136 137 138
	 */

#define xor_speed(templ)	do_xor_speed((templ), b1, b2)

139 140 141 142 143 144
	printk(KERN_INFO "xor: measuring software checksum speed\n");
	XOR_TRY_TEMPLATES;
	fastest = template_list;
	for (f = fastest; f; f = f->next)
		if (f->speed > fastest->speed)
			fastest = f;
Linus Torvalds's avatar
Linus Torvalds committed
145

146
	printk(KERN_INFO "xor: using function: %s (%d.%03d MB/sec)\n",
Linus Torvalds's avatar
Linus Torvalds committed
147 148 149 150 151
	       fastest->name, fastest->speed / 1000, fastest->speed % 1000);

#undef xor_speed

	free_pages((unsigned long)b1, 2);
152
out:
Linus Torvalds's avatar
Linus Torvalds committed
153 154 155 156 157 158 159 160
	active_template = fastest;
	return 0;
}

static __exit void xor_exit(void) { }

MODULE_LICENSE("GPL");

161 162
/* when built-in xor.o must initialize before drivers/md/md.o */
core_initcall(calibrate_xor_blocks);
Linus Torvalds's avatar
Linus Torvalds committed
163
module_exit(xor_exit);