linear.c 8.1 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
   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.  
*/

19 20 21
#include <linux/blkdev.h>
#include <linux/raid/md_u.h>
#include <linux/seq_file.h>
22
#include "md.h"
23
#include "linear.h"
L
Linus Torvalds 已提交
24 25 26 27 28 29 30

/*
 * find which device holds a particular offset 
 */
static inline dev_info_t *which_dev(mddev_t *mddev, sector_t sector)
{
	dev_info_t *hash;
31
	linear_conf_t *conf = mddev->private;
L
Linus Torvalds 已提交
32

33
	hash = conf->disks;
L
Linus Torvalds 已提交
34

35
	while (sector >= hash->end_sector)
L
Linus Torvalds 已提交
36 37 38 39 40
		hash++;
	return hash;
}

/**
41
 *	linear_mergeable_bvec -- tell bio layer if two requests can be merged
L
Linus Torvalds 已提交
42
 *	@q: request queue
43
 *	@bvm: properties of new bio
L
Linus Torvalds 已提交
44 45 46 47
 *	@biovec: the request that could be merged to it.
 *
 *	Return amount of bytes we can take at this offset
 */
48 49 50
static int linear_mergeable_bvec(struct request_queue *q,
				 struct bvec_merge_data *bvm,
				 struct bio_vec *biovec)
L
Linus Torvalds 已提交
51 52 53
{
	mddev_t *mddev = q->queuedata;
	dev_info_t *dev0;
54 55
	unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
	sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
L
Linus Torvalds 已提交
56 57

	dev0 = which_dev(mddev, sector);
58
	maxsectors = dev0->end_sector - sector;
L
Linus Torvalds 已提交
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73

	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;
}

74
static void linear_unplug(struct request_queue *q)
L
Linus Torvalds 已提交
75 76
{
	mddev_t *mddev = q->queuedata;
77
	linear_conf_t *conf = mddev->private;
L
Linus Torvalds 已提交
78 79 80
	int i;

	for (i=0; i < mddev->raid_disks; i++) {
81
		struct request_queue *r_queue = bdev_get_queue(conf->disks[i].rdev->bdev);
82
		blk_unplug(r_queue);
L
Linus Torvalds 已提交
83 84 85
	}
}

86 87 88
static int linear_congested(void *data, int bits)
{
	mddev_t *mddev = data;
89
	linear_conf_t *conf = mddev->private;
90 91 92
	int i, ret = 0;

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

99 100
static sector_t linear_size(mddev_t *mddev, sector_t sectors, int raid_disks)
{
101
	linear_conf_t *conf = mddev->private;
102 103 104 105 106 107 108

	WARN_ONCE(sectors || raid_disks,
		  "%s does not support generic reshape\n", __func__);

	return conf->array_sectors;
}

109
static linear_conf_t *linear_conf(mddev_t *mddev, int raid_disks)
L
Linus Torvalds 已提交
110 111 112
{
	linear_conf_t *conf;
	mdk_rdev_t *rdev;
113
	int i, cnt;
L
Linus Torvalds 已提交
114

115
	conf = kzalloc (sizeof (*conf) + raid_disks*sizeof(dev_info_t),
L
Linus Torvalds 已提交
116 117
			GFP_KERNEL);
	if (!conf)
118 119
		return NULL;

L
Linus Torvalds 已提交
120
	cnt = 0;
121
	conf->array_sectors = 0;
L
Linus Torvalds 已提交
122

123
	list_for_each_entry(rdev, &mddev->disks, same_set) {
L
Linus Torvalds 已提交
124 125 126
		int j = rdev->raid_disk;
		dev_info_t *disk = conf->disks + j;

127
		if (j < 0 || j >= raid_disks || disk->rdev) {
L
Linus Torvalds 已提交
128 129 130 131 132 133 134 135 136 137 138 139 140
			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 &&
141
		    queue_max_sectors(mddev->queue) > (PAGE_SIZE>>9))
L
Linus Torvalds 已提交
142 143
			blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);

144
		conf->array_sectors += rdev->sectors;
L
Linus Torvalds 已提交
145
		cnt++;
146

L
Linus Torvalds 已提交
147
	}
148
	if (cnt != raid_disks) {
L
Linus Torvalds 已提交
149 150 151 152 153
		printk("linear: not enough drives present. Aborting!\n");
		goto out;
	}

	/*
154
	 * Here we calculate the device offsets.
L
Linus Torvalds 已提交
155
	 */
156 157
	conf->disks[0].end_sector = conf->disks[0].rdev->sectors;

158
	for (i = 1; i < raid_disks; i++)
159 160 161
		conf->disks[i].end_sector =
			conf->disks[i-1].end_sector +
			conf->disks[i].rdev->sectors;
162

163 164 165 166 167 168 169 170 171 172 173
	return conf;

out:
	kfree(conf);
	return NULL;
}

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

174
	mddev->queue->queue_lock = &mddev->queue->__queue_lock;
175 176 177 178 179
	conf = linear_conf(mddev, mddev->raid_disks);

	if (!conf)
		return 1;
	mddev->private = conf;
180
	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
181

L
Linus Torvalds 已提交
182 183
	blk_queue_merge_bvec(mddev->queue, linear_mergeable_bvec);
	mddev->queue->unplug_fn = linear_unplug;
184 185
	mddev->queue->backing_dev_info.congested_fn = linear_congested;
	mddev->queue->backing_dev_info.congested_data = mddev;
L
Linus Torvalds 已提交
186
	return 0;
187
}
L
Linus Torvalds 已提交
188

189 190 191 192 193 194 195 196 197 198 199 200
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;

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

204 205
	rdev->raid_disk = rdev->saved_raid_disk;

206 207 208 209 210
	newconf = linear_conf(mddev,mddev->raid_disks+1);

	if (!newconf)
		return -ENOMEM;

211
	newconf->prev = mddev->private;
212 213
	mddev->private = newconf;
	mddev->raid_disks++;
214
	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
215
	set_capacity(mddev->gendisk, mddev->array_sectors);
216
	return 0;
L
Linus Torvalds 已提交
217 218 219 220
}

static int linear_stop (mddev_t *mddev)
{
221
	linear_conf_t *conf = mddev->private;
L
Linus Torvalds 已提交
222 223
  
	blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
224 225 226 227 228
	do {
		linear_conf_t *t = conf->prev;
		kfree(conf);
		conf = t;
	} while (conf);
L
Linus Torvalds 已提交
229 230 231 232

	return 0;
}

233
static int linear_make_request (struct request_queue *q, struct bio *bio)
L
Linus Torvalds 已提交
234
{
235
	const int rw = bio_data_dir(bio);
L
Linus Torvalds 已提交
236 237
	mddev_t *mddev = q->queuedata;
	dev_info_t *tmp_dev;
238
	sector_t start_sector;
T
Tejun Heo 已提交
239
	int cpu;
L
Linus Torvalds 已提交
240

241
	if (unlikely(bio_barrier(bio))) {
242
		bio_endio(bio, -EOPNOTSUPP);
243 244 245
		return 0;
	}

T
Tejun Heo 已提交
246 247 248 249 250
	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();
L
Linus Torvalds 已提交
251 252

	tmp_dev = which_dev(mddev, bio->bi_sector);
253 254 255 256
	start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;

	if (unlikely(bio->bi_sector >= (tmp_dev->end_sector)
		     || (bio->bi_sector < start_sector))) {
L
Linus Torvalds 已提交
257 258
		char b[BDEVNAME_SIZE];

259 260 261
		printk("linear_make_request: Sector %llu out of bounds on "
			"dev %s: %llu sectors, offset %llu\n",
			(unsigned long long)bio->bi_sector,
L
Linus Torvalds 已提交
262
			bdevname(tmp_dev->rdev->bdev, b),
263 264
			(unsigned long long)tmp_dev->rdev->sectors,
			(unsigned long long)start_sector);
265
		bio_io_error(bio);
L
Linus Torvalds 已提交
266 267 268
		return 0;
	}
	if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
269
		     tmp_dev->end_sector)) {
L
Linus Torvalds 已提交
270 271 272 273
		/* This bio crosses a device boundary, so we have to
		 * split it.
		 */
		struct bio_pair *bp;
274

D
Denis ChengRq 已提交
275
		bp = bio_split(bio,
276
			       tmp_dev->end_sector - bio->bi_sector);
277

L
Linus Torvalds 已提交
278 279 280 281 282 283 284 285 286
		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;
287
	bio->bi_sector = bio->bi_sector - start_sector
288
		+ tmp_dev->rdev->data_offset;
L
Linus Torvalds 已提交
289 290 291 292 293 294 295 296 297 298 299

	return 1;
}

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

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


300
static struct mdk_personality linear_personality =
L
Linus Torvalds 已提交
301 302
{
	.name		= "linear",
303
	.level		= LEVEL_LINEAR,
L
Linus Torvalds 已提交
304 305 306 307 308
	.owner		= THIS_MODULE,
	.make_request	= linear_make_request,
	.run		= linear_run,
	.stop		= linear_stop,
	.status		= linear_status,
309
	.hot_add_disk	= linear_add,
310
	.size		= linear_size,
L
Linus Torvalds 已提交
311 312 313 314
};

static int __init linear_init (void)
{
315
	return register_md_personality (&linear_personality);
L
Linus Torvalds 已提交
316 317 318 319
}

static void linear_exit (void)
{
320
	unregister_md_personality (&linear_personality);
L
Linus Torvalds 已提交
321 322 323 324 325 326
}


module_init(linear_init);
module_exit(linear_exit);
MODULE_LICENSE("GPL");
327 328
MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
MODULE_ALIAS("md-linear");
329
MODULE_ALIAS("md-level--1");