Lines Matching refs:lc
30 struct linear_c *lc; in linear_ctr() local
39 lc = kmalloc(sizeof(*lc), GFP_KERNEL); in linear_ctr()
40 if (lc == NULL) { in linear_ctr()
49 lc->start = tmp; in linear_ctr()
51 if (dm_get_device(ti, argv[0], dm_table_get_mode(ti->table), &lc->dev)) { in linear_ctr()
59 ti->private = lc; in linear_ctr()
63 kfree(lc); in linear_ctr()
69 struct linear_c *lc = (struct linear_c *) ti->private; in linear_dtr() local
71 dm_put_device(ti, lc->dev); in linear_dtr()
72 kfree(lc); in linear_dtr()
77 struct linear_c *lc = ti->private; in linear_map_sector() local
79 return lc->start + dm_target_offset(ti, bi_sector); in linear_map_sector()
84 struct linear_c *lc = ti->private; in linear_map_bio() local
86 bio->bi_bdev = lc->dev->bdev; in linear_map_bio()
102 struct linear_c *lc = (struct linear_c *) ti->private; in linear_status() local
110 snprintf(result, maxlen, "%s %llu", lc->dev->name, in linear_status()
111 (unsigned long long)lc->start); in linear_status()
119 struct linear_c *lc = (struct linear_c *) ti->private; in linear_ioctl() local
120 struct dm_dev *dev = lc->dev; in linear_ioctl()
126 if (lc->start || in linear_ioctl()
136 struct linear_c *lc = ti->private; in linear_merge() local
137 struct request_queue *q = bdev_get_queue(lc->dev->bdev); in linear_merge()
142 bvm->bi_bdev = lc->dev->bdev; in linear_merge()
151 struct linear_c *lc = ti->private; in linear_iterate_devices() local
153 return fn(ti, lc->dev, lc->start, ti->len, data); in linear_iterate_devices()