[linux-2.6-block.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)
{
	int lo, mid, hi;
	linear_conf_t *conf = mddev->private;

	lo = 0;
	hi = mddev->raid_disks - 1;

	/*
	 * Binary Search
	 */

	while (hi > lo) {

		mid = (hi + lo) / 2;
		if (sector < conf->disks[mid].end_sector)
			hi = mid;
		else
			lo = mid + 1;
	}

	return conf->disks + lo;
}

/**
 *	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->end_sector - 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->private;
	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->private;
	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 sector_t linear_size(mddev_t *mddev, sector_t sectors, int raid_disks)
{
	linear_conf_t *conf = mddev->private;

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

	return conf->array_sectors;
}

static linear_conf_t *linear_conf(mddev_t *mddev, int raid_disks)
{
	linear_conf_t *conf;
	mdk_rdev_t *rdev;
	int i, cnt;

	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 &&
		    queue_max_sectors(mddev->queue) > (PAGE_SIZE>>9))
			blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);

		conf->array_sectors += rdev->sectors;
		cnt++;

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

	/*
	 * Here we calculate the device offsets.
	 */
	conf->disks[0].end_sector = conf->disks[0].rdev->sectors;

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

	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;
	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));

	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->private;
	mddev->private = newconf;
	mddev->raid_disks++;
	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
	set_capacity(mddev->gendisk, mddev->array_sectors);
	return 0;
}

static int linear_stop (mddev_t *mddev)
{
	linear_conf_t *conf = mddev->private;
  
	blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
	do {
		linear_conf_t *t = conf->prev;
		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;
	sector_t start_sector;
	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);
	start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;

	if (unlikely(bio->bi_sector >= (tmp_dev->end_sector)
		     || (bio->bi_sector < 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->rdev->sectors,
			(unsigned long long)start_sector);
		bio_io_error(bio);
		return 0;
	}
	if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
		     tmp_dev->end_sector)) {
		/* This bio crosses a device boundary, so we have to
		 * split it.
		 */
		struct bio_pair *bp;

		bp = bio_split(bio,
			       tmp_dev->end_sector - 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 - 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,
	.size		= linear_size,
};

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
1da177e4 LT	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
bff61975 N	19	#include <linux/blkdev.h>
bff61975 N	20	#include <linux/raid/md_u.h>
bff61975	21	#include <linux/seq_file.h>
43b2e5d8	22	#include "md.h"
ef740c37	23	#include "linear.h"
1da177e4	24
1da177e4 LT	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	{
aece3d1f	30	int lo, mid, hi;
070ec55d	31	linear_conf_t *conf = mddev->private;
1da177e4	32
aece3d1f SS	33	lo = 0;
aece3d1f SS	34	hi = mddev->raid_disks - 1;
1da177e4	35
aece3d1f SS	36	/*
	37	* Binary Search
	38	*/
	39
	40	while (hi > lo) {
	41
	42	mid = (hi + lo) / 2;
	43	if (sector < conf->disks[mid].end_sector)
	44	hi = mid;
	45	else
	46	lo = mid + 1;
	47	}
	48
	49	return conf->disks + lo;
1da177e4 LT	50	}
	51
	52	/**
15945fee	53	* linear_mergeable_bvec -- tell bio layer if two requests can be merged
1da177e4	54	* @q: request queue
cc371e66	55	* @bvm: properties of new bio
1da177e4 LT	56	* @biovec: the request that could be merged to it.
	57	*
	58	* Return amount of bytes we can take at this offset
	59	*/
cc371e66 AK	60	static int linear_mergeable_bvec(struct request_queue *q,
	61	struct bvec_merge_data *bvm,
	62	struct bio_vec *biovec)
1da177e4 LT	63	{
	64	mddev_t *mddev = q->queuedata;
	65	dev_info_t *dev0;
cc371e66 AK	66	unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
cc371e66 AK	67	sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
1da177e4 LT	68
1da177e4 LT	69	dev0 = which_dev(mddev, sector);
4db7cdc8	70	maxsectors = dev0->end_sector - sector;
1da177e4 LT	71
	72	if (maxsectors < bio_sectors)
	73	maxsectors = 0;
	74	else
	75	maxsectors -= bio_sectors;
	76
	77	if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0)
	78	return biovec->bv_len;
	79	/* The bytes available at this offset could be really big,
	80	* so we cap at 2^31 to avoid overflow */
	81	if (maxsectors > (1 << (31-9)))
	82	return 1<<31;
	83	return maxsectors << 9;
	84	}
	85
165125e1	86	static void linear_unplug(struct request_queue *q)
1da177e4 LT	87	{
1da177e4 LT	88	mddev_t *mddev = q->queuedata;
070ec55d	89	linear_conf_t *conf = mddev->private;
1da177e4 LT	90	int i;
	91
	92	for (i=0; i < mddev->raid_disks; i++) {
165125e1	93	struct request_queue *r_queue = bdev_get_queue(conf->disks[i].rdev->bdev);
2ad8b1ef	94	blk_unplug(r_queue);
1da177e4 LT	95	}
	96	}
	97
26be34dc N	98	static int linear_congested(void *data, int bits)
	99	{
	100	mddev_t *mddev = data;
070ec55d	101	linear_conf_t *conf = mddev->private;
26be34dc N	102	int i, ret = 0;
	103
	104	for (i = 0; i < mddev->raid_disks && !ret ; i++) {
165125e1	105	struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev);
26be34dc N	106	ret \|= bdi_congested(&q->backing_dev_info, bits);
	107	}
	108	return ret;
	109	}
	110
80c3a6ce DW	111	static sector_t linear_size(mddev_t *mddev, sector_t sectors, int raid_disks)
80c3a6ce DW	112	{
070ec55d	113	linear_conf_t *conf = mddev->private;
80c3a6ce DW	114
	115	WARN_ONCE(sectors \|\| raid_disks,
	116	"%s does not support generic reshape\n", __func__);
	117
	118	return conf->array_sectors;
	119	}
	120
7c7546cc	121	static linear_conf_t linear_conf(mddev_t mddev, int raid_disks)
1da177e4 LT	122	{
1da177e4 LT	123	linear_conf_t *conf;
1da177e4	124	mdk_rdev_t *rdev;
45d4582f	125	int i, cnt;
1da177e4	126
7c7546cc	127	conf = kzalloc (sizeof (conf) + raid_diskssizeof(dev_info_t),
1da177e4 LT	128	GFP_KERNEL);
1da177e4 LT	129	if (!conf)
7c7546cc N	130	return NULL;
7c7546cc N	131
1da177e4	132	cnt = 0;
d6e22150	133	conf->array_sectors = 0;
1da177e4	134
159ec1fc	135	list_for_each_entry(rdev, &mddev->disks, same_set) {
1da177e4 LT	136	int j = rdev->raid_disk;
	137	dev_info_t *disk = conf->disks + j;
	138
13864515	139	if (j < 0 \|\| j >= raid_disks \|\| disk->rdev) {
1da177e4 LT	140	printk("linear: disk numbering problem. Aborting!\n");
	141	goto out;
	142	}
	143
	144	disk->rdev = rdev;
	145
	146	blk_queue_stack_limits(mddev->queue,
	147	rdev->bdev->bd_disk->queue);
	148	/* as we don't honour merge_bvec_fn, we must never risk
	149	* violating it, so limit ->max_sector to one PAGE, as
	150	* a one page request is never in violation.
	151	*/
	152	if (rdev->bdev->bd_disk->queue->merge_bvec_fn &&
ae03bf63	153	queue_max_sectors(mddev->queue) > (PAGE_SIZE>>9))
1da177e4 LT	154	blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);
1da177e4 LT	155
dd8ac336	156	conf->array_sectors += rdev->sectors;
1da177e4	157	cnt++;
4db7cdc8	158
1da177e4	159	}
7c7546cc	160	if (cnt != raid_disks) {
1da177e4 LT	161	printk("linear: not enough drives present. Aborting!\n");
	162	goto out;
	163	}
	164
	165	/*
45d4582f	166	* Here we calculate the device offsets.
1da177e4	167	*/
4db7cdc8 SS	168	conf->disks[0].end_sector = conf->disks[0].rdev->sectors;
4db7cdc8 SS	169
a778b73f	170	for (i = 1; i < raid_disks; i++)
4db7cdc8 SS	171	conf->disks[i].end_sector =
	172	conf->disks[i-1].end_sector +
	173	conf->disks[i].rdev->sectors;
15945fee	174
7c7546cc N	175	return conf;
	176
	177	out:
	178	kfree(conf);
	179	return NULL;
	180	}
	181
	182	static int linear_run (mddev_t *mddev)
	183	{
	184	linear_conf_t *conf;
	185
e7e72bf6	186	mddev->queue->queue_lock = &mddev->queue->__queue_lock;
7c7546cc N	187	conf = linear_conf(mddev, mddev->raid_disks);
	188
	189	if (!conf)
	190	return 1;
	191	mddev->private = conf;
1f403624	192	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
7c7546cc	193
1da177e4 LT	194	blk_queue_merge_bvec(mddev->queue, linear_mergeable_bvec);
1da177e4 LT	195	mddev->queue->unplug_fn = linear_unplug;
26be34dc N	196	mddev->queue->backing_dev_info.congested_fn = linear_congested;
26be34dc N	197	mddev->queue->backing_dev_info.congested_data = mddev;
1da177e4	198	return 0;
7c7546cc	199	}
1da177e4	200
7c7546cc N	201	static int linear_add(mddev_t mddev, mdk_rdev_t rdev)
	202	{
	203	/* Adding a drive to a linear array allows the array to grow.
	204	* It is permitted if the new drive has a matching superblock
	205	* already on it, with raid_disk equal to raid_disks.
	206	* It is achieved by creating a new linear_private_data structure
	207	* and swapping it in in-place of the current one.
	208	* The current one is never freed until the array is stopped.
	209	* This avoids races.
	210	*/
	211	linear_conf_t *newconf;
	212
a778b73f	213	if (rdev->saved_raid_disk != mddev->raid_disks)
7c7546cc N	214	return -EINVAL;
7c7546cc N	215
a778b73f N	216	rdev->raid_disk = rdev->saved_raid_disk;
a778b73f N	217
7c7546cc N	218	newconf = linear_conf(mddev,mddev->raid_disks+1);
	219
	220	if (!newconf)
	221	return -ENOMEM;
	222
070ec55d	223	newconf->prev = mddev->private;
7c7546cc N	224	mddev->private = newconf;
7c7546cc N	225	mddev->raid_disks++;
1f403624	226	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
f233ea5c	227	set_capacity(mddev->gendisk, mddev->array_sectors);
7c7546cc	228	return 0;
1da177e4 LT	229	}
	230
	231	static int linear_stop (mddev_t *mddev)
	232	{
070ec55d	233	linear_conf_t *conf = mddev->private;
1da177e4 LT	234
1da177e4 LT	235	blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
7c7546cc N	236	do {
7c7546cc N	237	linear_conf_t *t = conf->prev;
7c7546cc N	238	kfree(conf);
	239	conf = t;
	240	} while (conf);
1da177e4 LT	241
	242	return 0;
	243	}
	244
165125e1	245	static int linear_make_request (struct request_queue q, struct bio bio)
1da177e4	246	{
a362357b	247	const int rw = bio_data_dir(bio);
1da177e4 LT	248	mddev_t *mddev = q->queuedata;
1da177e4 LT	249	dev_info_t *tmp_dev;
4db7cdc8	250	sector_t start_sector;
c9959059	251	int cpu;
1da177e4	252
e5dcdd80	253	if (unlikely(bio_barrier(bio))) {
6712ecf8	254	bio_endio(bio, -EOPNOTSUPP);
e5dcdd80 N	255	return 0;
	256	}
	257
074a7aca TH	258	cpu = part_stat_lock();
	259	part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
	260	part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw],
	261	bio_sectors(bio));
	262	part_stat_unlock();
1da177e4 LT	263
1da177e4 LT	264	tmp_dev = which_dev(mddev, bio->bi_sector);
4db7cdc8 SS	265	start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;
	266
	267	if (unlikely(bio->bi_sector >= (tmp_dev->end_sector)
	268	\|\| (bio->bi_sector < start_sector))) {
1da177e4 LT	269	char b[BDEVNAME_SIZE];
1da177e4 LT	270
6283815d AN	271	printk("linear_make_request: Sector %llu out of bounds on "
	272	"dev %s: %llu sectors, offset %llu\n",
	273	(unsigned long long)bio->bi_sector,
1da177e4	274	bdevname(tmp_dev->rdev->bdev, b),
4db7cdc8 SS	275	(unsigned long long)tmp_dev->rdev->sectors,
4db7cdc8 SS	276	(unsigned long long)start_sector);
6712ecf8	277	bio_io_error(bio);
1da177e4 LT	278	return 0;
	279	}
	280	if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
4db7cdc8	281	tmp_dev->end_sector)) {
1da177e4 LT	282	/* This bio crosses a device boundary, so we have to
	283	* split it.
	284	*/
	285	struct bio_pair *bp;
6283815d	286
6feef531	287	bp = bio_split(bio,
4db7cdc8	288	tmp_dev->end_sector - bio->bi_sector);
6283815d	289
1da177e4 LT	290	if (linear_make_request(q, &bp->bio1))
	291	generic_make_request(&bp->bio1);
	292	if (linear_make_request(q, &bp->bio2))
	293	generic_make_request(&bp->bio2);
	294	bio_pair_release(bp);
	295	return 0;
	296	}
	297
	298	bio->bi_bdev = tmp_dev->rdev->bdev;
4db7cdc8	299	bio->bi_sector = bio->bi_sector - start_sector
6283815d	300	+ tmp_dev->rdev->data_offset;
1da177e4 LT	301
	302	return 1;
	303	}
	304
	305	static void linear_status (struct seq_file seq, mddev_t mddev)
	306	{
	307
1da177e4 LT	308	seq_printf(seq, " %dk rounding", mddev->chunk_size/1024);
	309	}
	310
	311
2604b703	312	static struct mdk_personality linear_personality =
1da177e4 LT	313	{
1da177e4 LT	314	.name = "linear",
2604b703	315	.level = LEVEL_LINEAR,
1da177e4 LT	316	.owner = THIS_MODULE,
	317	.make_request = linear_make_request,
	318	.run = linear_run,
	319	.stop = linear_stop,
	320	.status = linear_status,
7c7546cc	321	.hot_add_disk = linear_add,
80c3a6ce	322	.size = linear_size,
1da177e4 LT	323	};
	324
	325	static int __init linear_init (void)
	326	{
2604b703	327	return register_md_personality (&linear_personality);
1da177e4 LT	328	}
	329
	330	static void linear_exit (void)
	331	{
2604b703	332	unregister_md_personality (&linear_personality);
1da177e4 LT	333	}
	334
	335
	336	module_init(linear_init);
	337	module_exit(linear_exit);
	338	MODULE_LICENSE("GPL");
d9d166c2 N	339	MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
d9d166c2 N	340	MODULE_ALIAS("md-linear");
2604b703	341	MODULE_ALIAS("md-level--1");