Release 4.11 crypto/xor.c

/*
 * 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>
#include <linux/gfp.h>
#include <linux/raid/xor.h>
#include <linux/jiffies.h>
#include <linux/preempt.h>
#include <asm/xor.h>

#ifndef XOR_SELECT_TEMPLATE

#define XOR_SELECT_TEMPLATE(x) (x)
#endif

/* The xor routines to use.  */

static struct xor_block_template *active_template;


void

xor_blocks(unsigned int src_count, unsigned int bytes, void *dest, void **srcs)
{
	unsigned long *p1, *p2, *p3, *p4;

	p1 = (unsigned long *) srcs[0];
	if (src_count == 1) {
		active_template->do_2(bytes, dest, p1);
		return;
	}

	p2 = (unsigned long *) srcs[1];
	if (src_count == 2) {
		active_template->do_3(bytes, dest, p1, p2);
		return;
	}

	p3 = (unsigned long *) srcs[2];
	if (src_count == 3) {
		active_template->do_4(bytes, dest, p1, p2, p3);
		return;
	}

	p4 = (unsigned long *) srcs[3];
	active_template->do_5(bytes, dest, p1, p2, p3, p4);
}
Contributors
Person
Tokens
Prop
Commits
CommitProp
Linus Torvalds (pre-git)
137
82.04%
2
40.00%
Dan J Williams
25
14.97%
2
40.00%
Neil Brown
5
2.99%
1
20.00%
Total
167
100.00%
5
100.00%


EXPORT_SYMBOL(xor_blocks);

/* Set of all registered templates.  */

static struct xor_block_template *__initdata template_list;


#define BENCH_SIZE (PAGE_SIZE)


static void __init

do_xor_speed(struct xor_block_template *tmpl, void *b1, void *b2)
{
	int speed;
	unsigned long now, j;
	int i, count, max;

	tmpl->next = template_list;
	template_list = tmpl;

	preempt_disable();

	/*
         * 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++) {
		j = jiffies;
		count = 0;
		while ((now = jiffies) == j)
			cpu_relax();
		while (time_before(jiffies, now + 1)) {
			mb(); /* prevent loop optimzation */
			tmpl->do_2(BENCH_SIZE, b1, b2);
			mb();
			count++;
			mb();
		}
		if (count > max)
			max = count;
	}

	preempt_enable();

	speed = max * (HZ * BENCH_SIZE / 1024);
	tmpl->speed = speed;

	printk(KERN_INFO "   %-10s: %5d.%03d MB/sec\n", tmpl->name,
	       speed / 1000, speed % 1000);
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
Linus Torvalds (pre-git)
146
82.95%
2
33.33%
Jim Kukunas
27
15.34%
2
33.33%
Dan J Williams
2
1.14%
1
16.67%
Jan Beulich
1
0.57%
1
16.67%
Total
176
100.00%
6
100.00%


static int __init

calibrate_xor_blocks(void)
{
	void *b1, *b2;
	struct xor_block_template *f, *fastest;

	fastest = XOR_SELECT_TEMPLATE(NULL);

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

	/*
         * Note: Since the memory is not actually used for _anything_ but to
         * test the XOR speed, we don't really want kmemcheck to warn about
         * reading uninitialized bytes here.
         */
	b1 = (void *) __get_free_pages(GFP_KERNEL | __GFP_NOTRACK, 2);
	if (!b1) {
		printk(KERN_WARNING "xor: Yikes!  No memory available.\n");
		return -ENOMEM;
	}
	b2 = b1 + 2*PAGE_SIZE + BENCH_SIZE;

	/*
         * If this arch/cpu has a short-circuited selection, don't loop through
         * all the possible functions, just test the best one
         */


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

	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;

	printk(KERN_INFO "xor: using function: %s (%d.%03d MB/sec)\n",
	       fastest->name, fastest->speed / 1000, fastest->speed % 1000);


#undef xor_speed

	free_pages((unsigned long)b1, 2);
out:
	active_template = fastest;
	return 0;
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
Linus Torvalds (pre-git)
121
64.71%
2
22.22%
Martin Schwidefsky
28
14.97%
1
11.11%
Andrew Morton
25
13.37%
1
11.11%
Dan J Williams
8
4.28%
2
22.22%
Vegard Nossum
3
1.60%
1
11.11%
Herbert Xu
1
0.53%
1
11.11%
Neil Brown
1
0.53%
1
11.11%
Total
187
100.00%
9
100.00%



static __exit void xor_exit(void) { }

Contributors
Person
Tokens
Prop
Commits
CommitProp
Neil Brown
8
100.00%
1
100.00%
Total
8
100.00%
1
100.00%

MODULE_LICENSE("GPL");

/* when built-in xor.o must initialize before drivers/md/md.o */

core_initcall(calibrate_xor_blocks);

module_exit(xor_exit);
Overall Contributors
Person
Tokens
Prop
Commits
CommitProp
Linus Torvalds (pre-git)
439
71.62%
3
15.79%
Dan J Williams
43
7.01%
2
10.53%
Jim Kukunas
30
4.89%
2
10.53%
Martin Schwidefsky
28
4.57%
1
5.26%
Andrew Morton
25
4.08%
1
5.26%
Neil Brown
21
3.43%
4
21.05%
Herbert Xu
13
2.12%
1
5.26%
Linus Torvalds
6
0.98%
2
10.53%
Vegard Nossum
3
0.49%
1
5.26%
Tejun Heo
3
0.49%
1
5.26%
Jan Beulich
2
0.33%
1
5.26%
Total
613
100.00%
19
100.00%
Directory: crypto

Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.