[deliverable/linux.git] / drivers / md / linear.c

/*
   linear.c : Multiple Devices driver for Linux
	      Copyright (C) 1994-96 Marc ZYNGIER
	      <zyngier@ufr-info-p7.ibp.fr> or
	      <maz@gloups.fdn.fr>

   Linear mode management 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.  
*/

#include <linux/blkdev.h>
#include <linux/raid/md_u.h>
#include <linux/seq_file.h>
#include "md.h"
#include "linear.h"

/*
 * find which device holds a particular offset 
 */
static inline dev_info_t *which_dev(mddev_t *mddev, sector_t sector)
{
	dev_info_t *hash;
	linear_conf_t *conf = mddev_to_conf(mddev);
	sector_t idx = sector >> conf->sector_shift;

	/*
	 * sector_div(a,b) returns the remainer and sets a to a/b
	 */
	(void)sector_div(idx, conf->spacing);
	hash = conf->hash_table[idx];

	while (sector >= hash->num_sectors + hash->start_sector)
		hash++;
	return hash;
}

/**
 *	linear_mergeable_bvec -- tell bio layer if two requests can be merged
 *	@q: request queue
 *	@bvm: properties of new bio
 *	@biovec: the request that could be merged to it.
 *
 *	Return amount of bytes we can take at this offset
 */
static int linear_mergeable_bvec(struct request_queue *q,
				 struct bvec_merge_data *bvm,
				 struct bio_vec *biovec)
{
	mddev_t *mddev = q->queuedata;
	dev_info_t *dev0;
	unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
	sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);

	dev0 = which_dev(mddev, sector);
	maxsectors = dev0->num_sectors - (sector - dev0->start_sector);

	if (maxsectors < bio_sectors)
		maxsectors = 0;
	else
		maxsectors -= bio_sectors;

	if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0)
		return biovec->bv_len;
	/* The bytes available at this offset could be really big,
	 * so we cap at 2^31 to avoid overflow */
	if (maxsectors > (1 << (31-9)))
		return 1<<31;
	return maxsectors << 9;
}

static void linear_unplug(struct request_queue *q)
{
	mddev_t *mddev = q->queuedata;
	linear_conf_t *conf = mddev_to_conf(mddev);
	int i;

	for (i=0; i < mddev->raid_disks; i++) {
		struct request_queue *r_queue = bdev_get_queue(conf->disks[i].rdev->bdev);
		blk_unplug(r_queue);
	}
}

static int linear_congested(void *data, int bits)
{
	mddev_t *mddev = data;
	linear_conf_t *conf = mddev_to_conf(mddev);
	int i, ret = 0;

	for (i = 0; i < mddev->raid_disks && !ret ; i++) {
		struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev);
		ret |= bdi_congested(&q->backing_dev_info, bits);
	}
	return ret;
}

static linear_conf_t *linear_conf(mddev_t *mddev, int raid_disks)
{
	linear_conf_t *conf;
	dev_info_t **table;
	mdk_rdev_t *rdev;
	int i, nb_zone, cnt;
	sector_t min_sectors;
	sector_t curr_sector;

	conf = kzalloc (sizeof (*conf) + raid_disks*sizeof(dev_info_t),
			GFP_KERNEL);
	if (!conf)
		return NULL;

	cnt = 0;
	conf->array_sectors = 0;

	list_for_each_entry(rdev, &mddev->disks, same_set) {
		int j = rdev->raid_disk;
		dev_info_t *disk = conf->disks + j;

		if (j < 0 || j >= raid_disks || disk->rdev) {
			printk("linear: disk numbering problem. Aborting!\n");
			goto out;
		}

		disk->rdev = rdev;

		blk_queue_stack_limits(mddev->queue,
				       rdev->bdev->bd_disk->queue);
		/* as we don't honour merge_bvec_fn, we must never risk
		 * violating it, so limit ->max_sector to one PAGE, as
		 * a one page request is never in violation.
		 */
		if (rdev->bdev->bd_disk->queue->merge_bvec_fn &&
		    mddev->queue->max_sectors > (PAGE_SIZE>>9))
			blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);

		disk->num_sectors = rdev->size * 2;
		conf->array_sectors += rdev->size * 2;

		cnt++;
	}
	if (cnt != raid_disks) {
		printk("linear: not enough drives present. Aborting!\n");
		goto out;
	}

	min_sectors = conf->array_sectors;
	sector_div(min_sectors, PAGE_SIZE/sizeof(struct dev_info *));
	if (min_sectors == 0)
		min_sectors = 1;

	/* min_sectors is the minimum spacing that will fit the hash
	 * table in one PAGE.  This may be much smaller than needed.
	 * We find the smallest non-terminal set of consecutive devices
	 * that is larger than min_sectors and use the size of that as
	 * the actual spacing
	 */
	conf->spacing = conf->array_sectors;
	for (i=0; i < cnt-1 ; i++) {
		sector_t tmp = 0;
		int j;
		for (j = i; j < cnt - 1 && tmp < min_sectors; j++)
			tmp += conf->disks[j].num_sectors;
		if (tmp >= min_sectors && tmp < conf->spacing)
			conf->spacing = tmp;
	}

	/* spacing may be too large for sector_div to work with,
	 * so we might need to pre-shift
	 */
	conf->sector_shift = 0;
	if (sizeof(sector_t) > sizeof(u32)) {
		sector_t space = conf->spacing;
		while (space > (sector_t)(~(u32)0)) {
			space >>= 1;
			conf->sector_shift++;
		}
	}
	/*
	 * This code was restructured to work around a gcc-2.95.3 internal
	 * compiler error.  Alter it with care.
	 */
	{
		sector_t sz;
		unsigned round;
		unsigned long base;

		sz = conf->array_sectors >> conf->sector_shift;
		sz += 1; /* force round-up */
		base = conf->spacing >> conf->sector_shift;
		round = sector_div(sz, base);
		nb_zone = sz + (round ? 1 : 0);
	}
	BUG_ON(nb_zone > PAGE_SIZE / sizeof(struct dev_info *));

	conf->hash_table = kmalloc (sizeof (struct dev_info *) * nb_zone,
					GFP_KERNEL);
	if (!conf->hash_table)
		goto out;

	/*
	 * Here we generate the linear hash table
	 * First calculate the device offsets.
	 */
	conf->disks[0].start_sector = 0;
	for (i = 1; i < raid_disks; i++)
		conf->disks[i].start_sector =
			conf->disks[i-1].start_sector +
			conf->disks[i-1].num_sectors;

	table = conf->hash_table;
	i = 0;
	for (curr_sector = 0;
	     curr_sector < conf->array_sectors;
	     curr_sector += conf->spacing) {

		while (i < raid_disks-1 &&
		       curr_sector >= conf->disks[i+1].start_sector)
			i++;

		*table ++ = conf->disks + i;
	}

	if (conf->sector_shift) {
		conf->spacing >>= conf->sector_shift;
		/* round spacing up so that when we divide by it,
		 * we err on the side of "too-low", which is safest.
		 */
		conf->spacing++;
	}

	BUG_ON(table - conf->hash_table > nb_zone);

	return conf;

out:
	kfree(conf);
	return NULL;
}

static int linear_run (mddev_t *mddev)
{
	linear_conf_t *conf;

	mddev->queue->queue_lock = &mddev->queue->__queue_lock;
	conf = linear_conf(mddev, mddev->raid_disks);

	if (!conf)
		return 1;
	mddev->private = conf;
	mddev->array_sectors = conf->array_sectors;

	blk_queue_merge_bvec(mddev->queue, linear_mergeable_bvec);
	mddev->queue->unplug_fn = linear_unplug;
	mddev->queue->backing_dev_info.congested_fn = linear_congested;
	mddev->queue->backing_dev_info.congested_data = mddev;
	return 0;
}

static int linear_add(mddev_t *mddev, mdk_rdev_t *rdev)
{
	/* Adding a drive to a linear array allows the array to grow.
	 * It is permitted if the new drive has a matching superblock
	 * already on it, with raid_disk equal to raid_disks.
	 * It is achieved by creating a new linear_private_data structure
	 * and swapping it in in-place of the current one.
	 * The current one is never freed until the array is stopped.
	 * This avoids races.
	 */
	linear_conf_t *newconf;

	if (rdev->saved_raid_disk != mddev->raid_disks)
		return -EINVAL;

	rdev->raid_disk = rdev->saved_raid_disk;

	newconf = linear_conf(mddev,mddev->raid_disks+1);

	if (!newconf)
		return -ENOMEM;

	newconf->prev = mddev_to_conf(mddev);
	mddev->private = newconf;
	mddev->raid_disks++;
	mddev->array_sectors = newconf->array_sectors;
	set_capacity(mddev->gendisk, mddev->array_sectors);
	return 0;
}

static int linear_stop (mddev_t *mddev)
{
	linear_conf_t *conf = mddev_to_conf(mddev);
  
	blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
	do {
		linear_conf_t *t = conf->prev;
		kfree(conf->hash_table);
		kfree(conf);
		conf = t;
	} while (conf);

	return 0;
}

static int linear_make_request (struct request_queue *q, struct bio *bio)
{
	const int rw = bio_data_dir(bio);
	mddev_t *mddev = q->queuedata;
	dev_info_t *tmp_dev;
	int cpu;

	if (unlikely(bio_barrier(bio))) {
		bio_endio(bio, -EOPNOTSUPP);
		return 0;
	}

	cpu = part_stat_lock();
	part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
	part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw],
		      bio_sectors(bio));
	part_stat_unlock();

	tmp_dev = which_dev(mddev, bio->bi_sector);
    
	if (unlikely(bio->bi_sector >= (tmp_dev->num_sectors +
					tmp_dev->start_sector)
		     || (bio->bi_sector <
			 tmp_dev->start_sector))) {
		char b[BDEVNAME_SIZE];

		printk("linear_make_request: Sector %llu out of bounds on "
			"dev %s: %llu sectors, offset %llu\n",
			(unsigned long long)bio->bi_sector,
			bdevname(tmp_dev->rdev->bdev, b),
			(unsigned long long)tmp_dev->num_sectors,
			(unsigned long long)tmp_dev->start_sector);
		bio_io_error(bio);
		return 0;
	}
	if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
		     tmp_dev->start_sector + tmp_dev->num_sectors)) {
		/* This bio crosses a device boundary, so we have to
		 * split it.
		 */
		struct bio_pair *bp;

		bp = bio_split(bio,
			       tmp_dev->start_sector + tmp_dev->num_sectors
			       - bio->bi_sector);

		if (linear_make_request(q, &bp->bio1))
			generic_make_request(&bp->bio1);
		if (linear_make_request(q, &bp->bio2))
			generic_make_request(&bp->bio2);
		bio_pair_release(bp);
		return 0;
	}
		    
	bio->bi_bdev = tmp_dev->rdev->bdev;
	bio->bi_sector = bio->bi_sector - tmp_dev->start_sector
		+ tmp_dev->rdev->data_offset;

	return 1;
}

static void linear_status (struct seq_file *seq, mddev_t *mddev)
{

	seq_printf(seq, " %dk rounding", mddev->chunk_size/1024);
}


static struct mdk_personality linear_personality =
{
	.name		= "linear",
	.level		= LEVEL_LINEAR,
	.owner		= THIS_MODULE,
	.make_request	= linear_make_request,
	.run		= linear_run,
	.stop		= linear_stop,
	.status		= linear_status,
	.hot_add_disk	= linear_add,
};

static int __init linear_init (void)
{
	return register_md_personality (&linear_personality);
}

static void linear_exit (void)
{
	unregister_md_personality (&linear_personality);
}


module_init(linear_init);
module_exit(linear_exit);
MODULE_LICENSE("GPL");
MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
MODULE_ALIAS("md-linear");
MODULE_ALIAS("md-level--1");
Commit	Line	Data
	1	/*
	2	linear.c : Multiple Devices driver for Linux
	3	Copyright (C) 1994-96 Marc ZYNGIER
	4	<zyngier@ufr-info-p7.ibp.fr> or
	5	<maz@gloups.fdn.fr>
	6
	7	Linear mode management 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	#include <linux/blkdev.h>
	20	#include <linux/raid/md_u.h>
	21	#include <linux/seq_file.h>
	22	#include "md.h"
	23	#include "linear.h"
	24
	25	/*
	26	* find which device holds a particular offset
	27	*/
	28	static inline dev_info_t which_dev(mddev_t mddev, sector_t sector)
	29	{
	30	dev_info_t *hash;
	31	linear_conf_t *conf = mddev_to_conf(mddev);
	32	sector_t idx = sector >> conf->sector_shift;
	33
	34	/*
	35	* sector_div(a,b) returns the remainer and sets a to a/b
	36	*/
	37	(void)sector_div(idx, conf->spacing);
	38	hash = conf->hash_table[idx];
	39
	40	while (sector >= hash->num_sectors + hash->start_sector)
	41	hash++;
	42	return hash;
	43	}
	44
	45	/**
	46	* linear_mergeable_bvec -- tell bio layer if two requests can be merged
	47	* @q: request queue
	48	* @bvm: properties of new bio
	49	* @biovec: the request that could be merged to it.
	50	*
	51	* Return amount of bytes we can take at this offset
	52	*/
	53	static int linear_mergeable_bvec(struct request_queue *q,
	54	struct bvec_merge_data *bvm,
	55	struct bio_vec *biovec)
	56	{
	57	mddev_t *mddev = q->queuedata;
	58	dev_info_t *dev0;
	59	unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
	60	sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
	61
	62	dev0 = which_dev(mddev, sector);
	63	maxsectors = dev0->num_sectors - (sector - dev0->start_sector);
	64
	65	if (maxsectors < bio_sectors)
	66	maxsectors = 0;
	67	else
	68	maxsectors -= bio_sectors;
	69
	70	if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0)
	71	return biovec->bv_len;
	72	/* The bytes available at this offset could be really big,
	73	* so we cap at 2^31 to avoid overflow */
	74	if (maxsectors > (1 << (31-9)))
	75	return 1<<31;
	76	return maxsectors << 9;
	77	}
	78
	79	static void linear_unplug(struct request_queue *q)
	80	{
	81	mddev_t *mddev = q->queuedata;
	82	linear_conf_t *conf = mddev_to_conf(mddev);
	83	int i;
	84
	85	for (i=0; i < mddev->raid_disks; i++) {
	86	struct request_queue *r_queue = bdev_get_queue(conf->disks[i].rdev->bdev);
	87	blk_unplug(r_queue);
	88	}
	89	}
	90
	91	static int linear_congested(void *data, int bits)
	92	{
	93	mddev_t *mddev = data;
	94	linear_conf_t *conf = mddev_to_conf(mddev);
	95	int i, ret = 0;
	96
	97	for (i = 0; i < mddev->raid_disks && !ret ; i++) {
	98	struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev);
	99	ret \|= bdi_congested(&q->backing_dev_info, bits);
	100	}
	101	return ret;
	102	}
	103
	104	static linear_conf_t linear_conf(mddev_t mddev, int raid_disks)
	105	{
	106	linear_conf_t *conf;
	107	dev_info_t **table;
	108	mdk_rdev_t *rdev;
	109	int i, nb_zone, cnt;
	110	sector_t min_sectors;
	111	sector_t curr_sector;
	112
	113	conf = kzalloc (sizeof (conf) + raid_diskssizeof(dev_info_t),
	114	GFP_KERNEL);
	115	if (!conf)
	116	return NULL;
	117
	118	cnt = 0;
	119	conf->array_sectors = 0;
	120
	121	list_for_each_entry(rdev, &mddev->disks, same_set) {
	122	int j = rdev->raid_disk;
	123	dev_info_t *disk = conf->disks + j;
	124
	125	if (j < 0 \|\| j >= raid_disks \|\| disk->rdev) {
	126	printk("linear: disk numbering problem. Aborting!\n");
	127	goto out;
	128	}
	129
	130	disk->rdev = rdev;
	131
	132	blk_queue_stack_limits(mddev->queue,
	133	rdev->bdev->bd_disk->queue);
	134	/* as we don't honour merge_bvec_fn, we must never risk
	135	* violating it, so limit ->max_sector to one PAGE, as
	136	* a one page request is never in violation.
	137	*/
	138	if (rdev->bdev->bd_disk->queue->merge_bvec_fn &&
	139	mddev->queue->max_sectors > (PAGE_SIZE>>9))
	140	blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);
	141
	142	disk->num_sectors = rdev->size * 2;
	143	conf->array_sectors += rdev->size * 2;
	144
	145	cnt++;
	146	}
	147	if (cnt != raid_disks) {
	148	printk("linear: not enough drives present. Aborting!\n");
	149	goto out;
	150	}
	151
	152	min_sectors = conf->array_sectors;
	153	sector_div(min_sectors, PAGE_SIZE/sizeof(struct dev_info *));
	154	if (min_sectors == 0)
	155	min_sectors = 1;
	156
	157	/* min_sectors is the minimum spacing that will fit the hash
	158	* table in one PAGE. This may be much smaller than needed.
	159	* We find the smallest non-terminal set of consecutive devices
	160	* that is larger than min_sectors and use the size of that as
	161	* the actual spacing
	162	*/
	163	conf->spacing = conf->array_sectors;
	164	for (i=0; i < cnt-1 ; i++) {
	165	sector_t tmp = 0;
	166	int j;
	167	for (j = i; j < cnt - 1 && tmp < min_sectors; j++)
	168	tmp += conf->disks[j].num_sectors;
	169	if (tmp >= min_sectors && tmp < conf->spacing)
	170	conf->spacing = tmp;
	171	}
	172
	173	/* spacing may be too large for sector_div to work with,
	174	* so we might need to pre-shift
	175	*/
	176	conf->sector_shift = 0;
	177	if (sizeof(sector_t) > sizeof(u32)) {
	178	sector_t space = conf->spacing;
	179	while (space > (sector_t)(~(u32)0)) {
	180	space >>= 1;
	181	conf->sector_shift++;
	182	}
	183	}
	184	/*
	185	* This code was restructured to work around a gcc-2.95.3 internal
	186	* compiler error. Alter it with care.
	187	*/
	188	{
	189	sector_t sz;
	190	unsigned round;
	191	unsigned long base;
	192
	193	sz = conf->array_sectors >> conf->sector_shift;
	194	sz += 1; /* force round-up */
	195	base = conf->spacing >> conf->sector_shift;
	196	round = sector_div(sz, base);
	197	nb_zone = sz + (round ? 1 : 0);
	198	}
	199	BUG_ON(nb_zone > PAGE_SIZE / sizeof(struct dev_info *));
	200
	201	conf->hash_table = kmalloc (sizeof (struct dev_info ) nb_zone,
	202	GFP_KERNEL);
	203	if (!conf->hash_table)
	204	goto out;
	205
	206	/*
	207	* Here we generate the linear hash table
	208	* First calculate the device offsets.
	209	*/
	210	conf->disks[0].start_sector = 0;
	211	for (i = 1; i < raid_disks; i++)
	212	conf->disks[i].start_sector =
	213	conf->disks[i-1].start_sector +
	214	conf->disks[i-1].num_sectors;
	215
	216	table = conf->hash_table;
	217	i = 0;
	218	for (curr_sector = 0;
	219	curr_sector < conf->array_sectors;
	220	curr_sector += conf->spacing) {
	221
	222	while (i < raid_disks-1 &&
	223	curr_sector >= conf->disks[i+1].start_sector)
	224	i++;
	225
	226	*table ++ = conf->disks + i;
	227	}
	228
	229	if (conf->sector_shift) {
	230	conf->spacing >>= conf->sector_shift;
	231	/* round spacing up so that when we divide by it,
	232	* we err on the side of "too-low", which is safest.
	233	*/
	234	conf->spacing++;
	235	}
	236
	237	BUG_ON(table - conf->hash_table > nb_zone);
	238
	239	return conf;
	240
	241	out:
	242	kfree(conf);
	243	return NULL;
	244	}
	245
	246	static int linear_run (mddev_t *mddev)
	247	{
	248	linear_conf_t *conf;
	249
	250	mddev->queue->queue_lock = &mddev->queue->__queue_lock;
	251	conf = linear_conf(mddev, mddev->raid_disks);
	252
	253	if (!conf)
	254	return 1;
	255	mddev->private = conf;
	256	mddev->array_sectors = conf->array_sectors;
	257
	258	blk_queue_merge_bvec(mddev->queue, linear_mergeable_bvec);
	259	mddev->queue->unplug_fn = linear_unplug;
	260	mddev->queue->backing_dev_info.congested_fn = linear_congested;
	261	mddev->queue->backing_dev_info.congested_data = mddev;
	262	return 0;
	263	}
	264
	265	static int linear_add(mddev_t mddev, mdk_rdev_t rdev)
	266	{
	267	/* Adding a drive to a linear array allows the array to grow.
	268	* It is permitted if the new drive has a matching superblock
	269	* already on it, with raid_disk equal to raid_disks.
	270	* It is achieved by creating a new linear_private_data structure
	271	* and swapping it in in-place of the current one.
	272	* The current one is never freed until the array is stopped.
	273	* This avoids races.
	274	*/
	275	linear_conf_t *newconf;
	276
	277	if (rdev->saved_raid_disk != mddev->raid_disks)
	278	return -EINVAL;
	279
	280	rdev->raid_disk = rdev->saved_raid_disk;
	281
	282	newconf = linear_conf(mddev,mddev->raid_disks+1);
	283
	284	if (!newconf)
	285	return -ENOMEM;
	286
	287	newconf->prev = mddev_to_conf(mddev);
	288	mddev->private = newconf;
	289	mddev->raid_disks++;
	290	mddev->array_sectors = newconf->array_sectors;
	291	set_capacity(mddev->gendisk, mddev->array_sectors);
	292	return 0;
	293	}
	294
	295	static int linear_stop (mddev_t *mddev)
	296	{
	297	linear_conf_t *conf = mddev_to_conf(mddev);
	298
	299	blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
	300	do {
	301	linear_conf_t *t = conf->prev;
	302	kfree(conf->hash_table);
	303	kfree(conf);
	304	conf = t;
	305	} while (conf);
	306
	307	return 0;
	308	}
	309
	310	static int linear_make_request (struct request_queue q, struct bio bio)
	311	{
	312	const int rw = bio_data_dir(bio);
	313	mddev_t *mddev = q->queuedata;
	314	dev_info_t *tmp_dev;
	315	int cpu;
	316
	317	if (unlikely(bio_barrier(bio))) {
	318	bio_endio(bio, -EOPNOTSUPP);
	319	return 0;
	320	}
	321
	322	cpu = part_stat_lock();
	323	part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
	324	part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw],
	325	bio_sectors(bio));
	326	part_stat_unlock();
	327
	328	tmp_dev = which_dev(mddev, bio->bi_sector);
	329
	330	if (unlikely(bio->bi_sector >= (tmp_dev->num_sectors +
	331	tmp_dev->start_sector)
	332	\|\| (bio->bi_sector <
	333	tmp_dev->start_sector))) {
	334	char b[BDEVNAME_SIZE];
	335
	336	printk("linear_make_request: Sector %llu out of bounds on "
	337	"dev %s: %llu sectors, offset %llu\n",
	338	(unsigned long long)bio->bi_sector,
	339	bdevname(tmp_dev->rdev->bdev, b),
	340	(unsigned long long)tmp_dev->num_sectors,
	341	(unsigned long long)tmp_dev->start_sector);
	342	bio_io_error(bio);
	343	return 0;
	344	}
	345	if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
	346	tmp_dev->start_sector + tmp_dev->num_sectors)) {
	347	/* This bio crosses a device boundary, so we have to
	348	* split it.
	349	*/
	350	struct bio_pair *bp;
	351
	352	bp = bio_split(bio,
	353	tmp_dev->start_sector + tmp_dev->num_sectors
	354	- bio->bi_sector);
	355
	356	if (linear_make_request(q, &bp->bio1))
	357	generic_make_request(&bp->bio1);
	358	if (linear_make_request(q, &bp->bio2))
	359	generic_make_request(&bp->bio2);
	360	bio_pair_release(bp);
	361	return 0;
	362	}
	363
	364	bio->bi_bdev = tmp_dev->rdev->bdev;
	365	bio->bi_sector = bio->bi_sector - tmp_dev->start_sector
	366	+ tmp_dev->rdev->data_offset;
	367
	368	return 1;
	369	}
	370
	371	static void linear_status (struct seq_file seq, mddev_t mddev)
	372	{
	373
	374	seq_printf(seq, " %dk rounding", mddev->chunk_size/1024);
	375	}
	376
	377
	378	static struct mdk_personality linear_personality =
	379	{
	380	.name = "linear",
	381	.level = LEVEL_LINEAR,
	382	.owner = THIS_MODULE,
	383	.make_request = linear_make_request,
	384	.run = linear_run,
	385	.stop = linear_stop,
	386	.status = linear_status,
	387	.hot_add_disk = linear_add,
	388	};
	389
	390	static int __init linear_init (void)
	391	{
	392	return register_md_personality (&linear_personality);
	393	}
	394
	395	static void linear_exit (void)
	396	{
	397	unregister_md_personality (&linear_personality);
	398	}
	399
	400
	401	module_init(linear_init);
	402	module_exit(linear_exit);
	403	MODULE_LICENSE("GPL");
	404	MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
	405	MODULE_ALIAS("md-linear");
	406	MODULE_ALIAS("md-level--1");