]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | md.c : Multiple Devices driver for Linux | |
3 | Copyright (C) 1998, 1999, 2000 Ingo Molnar | |
4 | ||
5 | completely rewritten, based on the MD driver code from Marc Zyngier | |
6 | ||
7 | Changes: | |
8 | ||
9 | - RAID-1/RAID-5 extensions by Miguel de Icaza, Gadi Oxman, Ingo Molnar | |
10 | - RAID-6 extensions by H. Peter Anvin <hpa@zytor.com> | |
11 | - boot support for linear and striped mode by Harald Hoyer <HarryH@Royal.Net> | |
12 | - kerneld support by Boris Tobotras <boris@xtalk.msk.su> | |
13 | - kmod support by: Cyrus Durgin | |
14 | - RAID0 bugfixes: Mark Anthony Lisher <markal@iname.com> | |
15 | - Devfs support by Richard Gooch <rgooch@atnf.csiro.au> | |
16 | ||
17 | - lots of fixes and improvements to the RAID1/RAID5 and generic | |
18 | RAID code (such as request based resynchronization): | |
19 | ||
20 | Neil Brown <neilb@cse.unsw.edu.au>. | |
21 | ||
22 | - persistent bitmap code | |
23 | Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc. | |
24 | ||
25 | This program is free software; you can redistribute it and/or modify | |
26 | it under the terms of the GNU General Public License as published by | |
27 | the Free Software Foundation; either version 2, or (at your option) | |
28 | any later version. | |
29 | ||
30 | You should have received a copy of the GNU General Public License | |
31 | (for example /usr/src/linux/COPYING); if not, write to the Free | |
32 | Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
33 | */ | |
34 | ||
35 | #include <linux/module.h> | |
36 | #include <linux/config.h> | |
37 | #include <linux/kthread.h> | |
38 | #include <linux/linkage.h> | |
39 | #include <linux/raid/md.h> | |
40 | #include <linux/raid/bitmap.h> | |
41 | #include <linux/sysctl.h> | |
42 | #include <linux/devfs_fs_kernel.h> | |
43 | #include <linux/buffer_head.h> /* for invalidate_bdev */ | |
44 | #include <linux/suspend.h> | |
45 | #include <linux/poll.h> | |
46 | #include <linux/mutex.h> | |
47 | #include <linux/ctype.h> | |
48 | ||
49 | #include <linux/init.h> | |
50 | ||
51 | #include <linux/file.h> | |
52 | ||
53 | #ifdef CONFIG_KMOD | |
54 | #include <linux/kmod.h> | |
55 | #endif | |
56 | ||
57 | #include <asm/unaligned.h> | |
58 | ||
59 | #define MAJOR_NR MD_MAJOR | |
60 | #define MD_DRIVER | |
61 | ||
62 | /* 63 partitions with the alternate major number (mdp) */ | |
63 | #define MdpMinorShift 6 | |
64 | ||
65 | #define DEBUG 0 | |
66 | #define dprintk(x...) ((void)(DEBUG && printk(x))) | |
67 | ||
68 | ||
69 | #ifndef MODULE | |
70 | static void autostart_arrays (int part); | |
71 | #endif | |
72 | ||
73 | static LIST_HEAD(pers_list); | |
74 | static DEFINE_SPINLOCK(pers_lock); | |
75 | ||
76 | /* | |
77 | * Current RAID-1,4,5 parallel reconstruction 'guaranteed speed limit' | |
78 | * is 1000 KB/sec, so the extra system load does not show up that much. | |
79 | * Increase it if you want to have more _guaranteed_ speed. Note that | |
80 | * the RAID driver will use the maximum available bandwidth if the IO | |
81 | * subsystem is idle. There is also an 'absolute maximum' reconstruction | |
82 | * speed limit - in case reconstruction slows down your system despite | |
83 | * idle IO detection. | |
84 | * | |
85 | * you can change it via /proc/sys/dev/raid/speed_limit_min and _max. | |
86 | * or /sys/block/mdX/md/sync_speed_{min,max} | |
87 | */ | |
88 | ||
89 | static int sysctl_speed_limit_min = 1000; | |
90 | static int sysctl_speed_limit_max = 200000; | |
91 | static inline int speed_min(mddev_t *mddev) | |
92 | { | |
93 | return mddev->sync_speed_min ? | |
94 | mddev->sync_speed_min : sysctl_speed_limit_min; | |
95 | } | |
96 | ||
97 | static inline int speed_max(mddev_t *mddev) | |
98 | { | |
99 | return mddev->sync_speed_max ? | |
100 | mddev->sync_speed_max : sysctl_speed_limit_max; | |
101 | } | |
102 | ||
103 | static struct ctl_table_header *raid_table_header; | |
104 | ||
105 | static ctl_table raid_table[] = { | |
106 | { | |
107 | .ctl_name = DEV_RAID_SPEED_LIMIT_MIN, | |
108 | .procname = "speed_limit_min", | |
109 | .data = &sysctl_speed_limit_min, | |
110 | .maxlen = sizeof(int), | |
111 | .mode = 0644, | |
112 | .proc_handler = &proc_dointvec, | |
113 | }, | |
114 | { | |
115 | .ctl_name = DEV_RAID_SPEED_LIMIT_MAX, | |
116 | .procname = "speed_limit_max", | |
117 | .data = &sysctl_speed_limit_max, | |
118 | .maxlen = sizeof(int), | |
119 | .mode = 0644, | |
120 | .proc_handler = &proc_dointvec, | |
121 | }, | |
122 | { .ctl_name = 0 } | |
123 | }; | |
124 | ||
125 | static ctl_table raid_dir_table[] = { | |
126 | { | |
127 | .ctl_name = DEV_RAID, | |
128 | .procname = "raid", | |
129 | .maxlen = 0, | |
130 | .mode = 0555, | |
131 | .child = raid_table, | |
132 | }, | |
133 | { .ctl_name = 0 } | |
134 | }; | |
135 | ||
136 | static ctl_table raid_root_table[] = { | |
137 | { | |
138 | .ctl_name = CTL_DEV, | |
139 | .procname = "dev", | |
140 | .maxlen = 0, | |
141 | .mode = 0555, | |
142 | .child = raid_dir_table, | |
143 | }, | |
144 | { .ctl_name = 0 } | |
145 | }; | |
146 | ||
147 | static struct block_device_operations md_fops; | |
148 | ||
149 | static int start_readonly; | |
150 | ||
151 | /* | |
152 | * We have a system wide 'event count' that is incremented | |
153 | * on any 'interesting' event, and readers of /proc/mdstat | |
154 | * can use 'poll' or 'select' to find out when the event | |
155 | * count increases. | |
156 | * | |
157 | * Events are: | |
158 | * start array, stop array, error, add device, remove device, | |
159 | * start build, activate spare | |
160 | */ | |
161 | static DECLARE_WAIT_QUEUE_HEAD(md_event_waiters); | |
162 | static atomic_t md_event_count; | |
163 | void md_new_event(mddev_t *mddev) | |
164 | { | |
165 | atomic_inc(&md_event_count); | |
166 | wake_up(&md_event_waiters); | |
167 | sysfs_notify(&mddev->kobj, NULL, "sync_action"); | |
168 | } | |
169 | EXPORT_SYMBOL_GPL(md_new_event); | |
170 | ||
171 | /* Alternate version that can be called from interrupts | |
172 | * when calling sysfs_notify isn't needed. | |
173 | */ | |
174 | void md_new_event_inintr(mddev_t *mddev) | |
175 | { | |
176 | atomic_inc(&md_event_count); | |
177 | wake_up(&md_event_waiters); | |
178 | } | |
179 | ||
180 | /* | |
181 | * Enables to iterate over all existing md arrays | |
182 | * all_mddevs_lock protects this list. | |
183 | */ | |
184 | static LIST_HEAD(all_mddevs); | |
185 | static DEFINE_SPINLOCK(all_mddevs_lock); | |
186 | ||
187 | ||
188 | /* | |
189 | * iterates through all used mddevs in the system. | |
190 | * We take care to grab the all_mddevs_lock whenever navigating | |
191 | * the list, and to always hold a refcount when unlocked. | |
192 | * Any code which breaks out of this loop while own | |
193 | * a reference to the current mddev and must mddev_put it. | |
194 | */ | |
195 | #define ITERATE_MDDEV(mddev,tmp) \ | |
196 | \ | |
197 | for (({ spin_lock(&all_mddevs_lock); \ | |
198 | tmp = all_mddevs.next; \ | |
199 | mddev = NULL;}); \ | |
200 | ({ if (tmp != &all_mddevs) \ | |
201 | mddev_get(list_entry(tmp, mddev_t, all_mddevs));\ | |
202 | spin_unlock(&all_mddevs_lock); \ | |
203 | if (mddev) mddev_put(mddev); \ | |
204 | mddev = list_entry(tmp, mddev_t, all_mddevs); \ | |
205 | tmp != &all_mddevs;}); \ | |
206 | ({ spin_lock(&all_mddevs_lock); \ | |
207 | tmp = tmp->next;}) \ | |
208 | ) | |
209 | ||
210 | ||
211 | static int md_fail_request (request_queue_t *q, struct bio *bio) | |
212 | { | |
213 | bio_io_error(bio, bio->bi_size); | |
214 | return 0; | |
215 | } | |
216 | ||
217 | static inline mddev_t *mddev_get(mddev_t *mddev) | |
218 | { | |
219 | atomic_inc(&mddev->active); | |
220 | return mddev; | |
221 | } | |
222 | ||
223 | static void mddev_put(mddev_t *mddev) | |
224 | { | |
225 | if (!atomic_dec_and_lock(&mddev->active, &all_mddevs_lock)) | |
226 | return; | |
227 | if (!mddev->raid_disks && list_empty(&mddev->disks)) { | |
228 | list_del(&mddev->all_mddevs); | |
229 | spin_unlock(&all_mddevs_lock); | |
230 | blk_cleanup_queue(mddev->queue); | |
231 | kobject_unregister(&mddev->kobj); | |
232 | } else | |
233 | spin_unlock(&all_mddevs_lock); | |
234 | } | |
235 | ||
236 | static mddev_t * mddev_find(dev_t unit) | |
237 | { | |
238 | mddev_t *mddev, *new = NULL; | |
239 | ||
240 | retry: | |
241 | spin_lock(&all_mddevs_lock); | |
242 | list_for_each_entry(mddev, &all_mddevs, all_mddevs) | |
243 | if (mddev->unit == unit) { | |
244 | mddev_get(mddev); | |
245 | spin_unlock(&all_mddevs_lock); | |
246 | kfree(new); | |
247 | return mddev; | |
248 | } | |
249 | ||
250 | if (new) { | |
251 | list_add(&new->all_mddevs, &all_mddevs); | |
252 | spin_unlock(&all_mddevs_lock); | |
253 | return new; | |
254 | } | |
255 | spin_unlock(&all_mddevs_lock); | |
256 | ||
257 | new = kzalloc(sizeof(*new), GFP_KERNEL); | |
258 | if (!new) | |
259 | return NULL; | |
260 | ||
261 | new->unit = unit; | |
262 | if (MAJOR(unit) == MD_MAJOR) | |
263 | new->md_minor = MINOR(unit); | |
264 | else | |
265 | new->md_minor = MINOR(unit) >> MdpMinorShift; | |
266 | ||
267 | mutex_init(&new->reconfig_mutex); | |
268 | INIT_LIST_HEAD(&new->disks); | |
269 | INIT_LIST_HEAD(&new->all_mddevs); | |
270 | init_timer(&new->safemode_timer); | |
271 | atomic_set(&new->active, 1); | |
272 | spin_lock_init(&new->write_lock); | |
273 | init_waitqueue_head(&new->sb_wait); | |
274 | ||
275 | new->queue = blk_alloc_queue(GFP_KERNEL); | |
276 | if (!new->queue) { | |
277 | kfree(new); | |
278 | return NULL; | |
279 | } | |
280 | set_bit(QUEUE_FLAG_CLUSTER, &new->queue->queue_flags); | |
281 | ||
282 | blk_queue_make_request(new->queue, md_fail_request); | |
283 | ||
284 | goto retry; | |
285 | } | |
286 | ||
287 | static inline int mddev_lock(mddev_t * mddev) | |
288 | { | |
289 | return mutex_lock_interruptible(&mddev->reconfig_mutex); | |
290 | } | |
291 | ||
292 | static inline int mddev_trylock(mddev_t * mddev) | |
293 | { | |
294 | return mutex_trylock(&mddev->reconfig_mutex); | |
295 | } | |
296 | ||
297 | static inline void mddev_unlock(mddev_t * mddev) | |
298 | { | |
299 | mutex_unlock(&mddev->reconfig_mutex); | |
300 | ||
301 | md_wakeup_thread(mddev->thread); | |
302 | } | |
303 | ||
304 | static mdk_rdev_t * find_rdev_nr(mddev_t *mddev, int nr) | |
305 | { | |
306 | mdk_rdev_t * rdev; | |
307 | struct list_head *tmp; | |
308 | ||
309 | ITERATE_RDEV(mddev,rdev,tmp) { | |
310 | if (rdev->desc_nr == nr) | |
311 | return rdev; | |
312 | } | |
313 | return NULL; | |
314 | } | |
315 | ||
316 | static mdk_rdev_t * find_rdev(mddev_t * mddev, dev_t dev) | |
317 | { | |
318 | struct list_head *tmp; | |
319 | mdk_rdev_t *rdev; | |
320 | ||
321 | ITERATE_RDEV(mddev,rdev,tmp) { | |
322 | if (rdev->bdev->bd_dev == dev) | |
323 | return rdev; | |
324 | } | |
325 | return NULL; | |
326 | } | |
327 | ||
328 | static struct mdk_personality *find_pers(int level, char *clevel) | |
329 | { | |
330 | struct mdk_personality *pers; | |
331 | list_for_each_entry(pers, &pers_list, list) { | |
332 | if (level != LEVEL_NONE && pers->level == level) | |
333 | return pers; | |
334 | if (strcmp(pers->name, clevel)==0) | |
335 | return pers; | |
336 | } | |
337 | return NULL; | |
338 | } | |
339 | ||
340 | static inline sector_t calc_dev_sboffset(struct block_device *bdev) | |
341 | { | |
342 | sector_t size = bdev->bd_inode->i_size >> BLOCK_SIZE_BITS; | |
343 | return MD_NEW_SIZE_BLOCKS(size); | |
344 | } | |
345 | ||
346 | static sector_t calc_dev_size(mdk_rdev_t *rdev, unsigned chunk_size) | |
347 | { | |
348 | sector_t size; | |
349 | ||
350 | size = rdev->sb_offset; | |
351 | ||
352 | if (chunk_size) | |
353 | size &= ~((sector_t)chunk_size/1024 - 1); | |
354 | return size; | |
355 | } | |
356 | ||
357 | static int alloc_disk_sb(mdk_rdev_t * rdev) | |
358 | { | |
359 | if (rdev->sb_page) | |
360 | MD_BUG(); | |
361 | ||
362 | rdev->sb_page = alloc_page(GFP_KERNEL); | |
363 | if (!rdev->sb_page) { | |
364 | printk(KERN_ALERT "md: out of memory.\n"); | |
365 | return -EINVAL; | |
366 | } | |
367 | ||
368 | return 0; | |
369 | } | |
370 | ||
371 | static void free_disk_sb(mdk_rdev_t * rdev) | |
372 | { | |
373 | if (rdev->sb_page) { | |
374 | put_page(rdev->sb_page); | |
375 | rdev->sb_loaded = 0; | |
376 | rdev->sb_page = NULL; | |
377 | rdev->sb_offset = 0; | |
378 | rdev->size = 0; | |
379 | } | |
380 | } | |
381 | ||
382 | ||
383 | static int super_written(struct bio *bio, unsigned int bytes_done, int error) | |
384 | { | |
385 | mdk_rdev_t *rdev = bio->bi_private; | |
386 | mddev_t *mddev = rdev->mddev; | |
387 | if (bio->bi_size) | |
388 | return 1; | |
389 | ||
390 | if (error || !test_bit(BIO_UPTODATE, &bio->bi_flags)) | |
391 | md_error(mddev, rdev); | |
392 | ||
393 | if (atomic_dec_and_test(&mddev->pending_writes)) | |
394 | wake_up(&mddev->sb_wait); | |
395 | bio_put(bio); | |
396 | return 0; | |
397 | } | |
398 | ||
399 | static int super_written_barrier(struct bio *bio, unsigned int bytes_done, int error) | |
400 | { | |
401 | struct bio *bio2 = bio->bi_private; | |
402 | mdk_rdev_t *rdev = bio2->bi_private; | |
403 | mddev_t *mddev = rdev->mddev; | |
404 | if (bio->bi_size) | |
405 | return 1; | |
406 | ||
407 | if (!test_bit(BIO_UPTODATE, &bio->bi_flags) && | |
408 | error == -EOPNOTSUPP) { | |
409 | unsigned long flags; | |
410 | /* barriers don't appear to be supported :-( */ | |
411 | set_bit(BarriersNotsupp, &rdev->flags); | |
412 | mddev->barriers_work = 0; | |
413 | spin_lock_irqsave(&mddev->write_lock, flags); | |
414 | bio2->bi_next = mddev->biolist; | |
415 | mddev->biolist = bio2; | |
416 | spin_unlock_irqrestore(&mddev->write_lock, flags); | |
417 | wake_up(&mddev->sb_wait); | |
418 | bio_put(bio); | |
419 | return 0; | |
420 | } | |
421 | bio_put(bio2); | |
422 | bio->bi_private = rdev; | |
423 | return super_written(bio, bytes_done, error); | |
424 | } | |
425 | ||
426 | void md_super_write(mddev_t *mddev, mdk_rdev_t *rdev, | |
427 | sector_t sector, int size, struct page *page) | |
428 | { | |
429 | /* write first size bytes of page to sector of rdev | |
430 | * Increment mddev->pending_writes before returning | |
431 | * and decrement it on completion, waking up sb_wait | |
432 | * if zero is reached. | |
433 | * If an error occurred, call md_error | |
434 | * | |
435 | * As we might need to resubmit the request if BIO_RW_BARRIER | |
436 | * causes ENOTSUPP, we allocate a spare bio... | |
437 | */ | |
438 | struct bio *bio = bio_alloc(GFP_NOIO, 1); | |
439 | int rw = (1<<BIO_RW) | (1<<BIO_RW_SYNC); | |
440 | ||
441 | bio->bi_bdev = rdev->bdev; | |
442 | bio->bi_sector = sector; | |
443 | bio_add_page(bio, page, size, 0); | |
444 | bio->bi_private = rdev; | |
445 | bio->bi_end_io = super_written; | |
446 | bio->bi_rw = rw; | |
447 | ||
448 | atomic_inc(&mddev->pending_writes); | |
449 | if (!test_bit(BarriersNotsupp, &rdev->flags)) { | |
450 | struct bio *rbio; | |
451 | rw |= (1<<BIO_RW_BARRIER); | |
452 | rbio = bio_clone(bio, GFP_NOIO); | |
453 | rbio->bi_private = bio; | |
454 | rbio->bi_end_io = super_written_barrier; | |
455 | submit_bio(rw, rbio); | |
456 | } else | |
457 | submit_bio(rw, bio); | |
458 | } | |
459 | ||
460 | void md_super_wait(mddev_t *mddev) | |
461 | { | |
462 | /* wait for all superblock writes that were scheduled to complete. | |
463 | * if any had to be retried (due to BARRIER problems), retry them | |
464 | */ | |
465 | DEFINE_WAIT(wq); | |
466 | for(;;) { | |
467 | prepare_to_wait(&mddev->sb_wait, &wq, TASK_UNINTERRUPTIBLE); | |
468 | if (atomic_read(&mddev->pending_writes)==0) | |
469 | break; | |
470 | while (mddev->biolist) { | |
471 | struct bio *bio; | |
472 | spin_lock_irq(&mddev->write_lock); | |
473 | bio = mddev->biolist; | |
474 | mddev->biolist = bio->bi_next ; | |
475 | bio->bi_next = NULL; | |
476 | spin_unlock_irq(&mddev->write_lock); | |
477 | submit_bio(bio->bi_rw, bio); | |
478 | } | |
479 | schedule(); | |
480 | } | |
481 | finish_wait(&mddev->sb_wait, &wq); | |
482 | } | |
483 | ||
484 | static int bi_complete(struct bio *bio, unsigned int bytes_done, int error) | |
485 | { | |
486 | if (bio->bi_size) | |
487 | return 1; | |
488 | ||
489 | complete((struct completion*)bio->bi_private); | |
490 | return 0; | |
491 | } | |
492 | ||
493 | int sync_page_io(struct block_device *bdev, sector_t sector, int size, | |
494 | struct page *page, int rw) | |
495 | { | |
496 | struct bio *bio = bio_alloc(GFP_NOIO, 1); | |
497 | struct completion event; | |
498 | int ret; | |
499 | ||
500 | rw |= (1 << BIO_RW_SYNC); | |
501 | ||
502 | bio->bi_bdev = bdev; | |
503 | bio->bi_sector = sector; | |
504 | bio_add_page(bio, page, size, 0); | |
505 | init_completion(&event); | |
506 | bio->bi_private = &event; | |
507 | bio->bi_end_io = bi_complete; | |
508 | submit_bio(rw, bio); | |
509 | wait_for_completion(&event); | |
510 | ||
511 | ret = test_bit(BIO_UPTODATE, &bio->bi_flags); | |
512 | bio_put(bio); | |
513 | return ret; | |
514 | } | |
515 | EXPORT_SYMBOL_GPL(sync_page_io); | |
516 | ||
517 | static int read_disk_sb(mdk_rdev_t * rdev, int size) | |
518 | { | |
519 | char b[BDEVNAME_SIZE]; | |
520 | if (!rdev->sb_page) { | |
521 | MD_BUG(); | |
522 | return -EINVAL; | |
523 | } | |
524 | if (rdev->sb_loaded) | |
525 | return 0; | |
526 | ||
527 | ||
528 | if (!sync_page_io(rdev->bdev, rdev->sb_offset<<1, size, rdev->sb_page, READ)) | |
529 | goto fail; | |
530 | rdev->sb_loaded = 1; | |
531 | return 0; | |
532 | ||
533 | fail: | |
534 | printk(KERN_WARNING "md: disabled device %s, could not read superblock.\n", | |
535 | bdevname(rdev->bdev,b)); | |
536 | return -EINVAL; | |
537 | } | |
538 | ||
539 | static int uuid_equal(mdp_super_t *sb1, mdp_super_t *sb2) | |
540 | { | |
541 | if ( (sb1->set_uuid0 == sb2->set_uuid0) && | |
542 | (sb1->set_uuid1 == sb2->set_uuid1) && | |
543 | (sb1->set_uuid2 == sb2->set_uuid2) && | |
544 | (sb1->set_uuid3 == sb2->set_uuid3)) | |
545 | ||
546 | return 1; | |
547 | ||
548 | return 0; | |
549 | } | |
550 | ||
551 | ||
552 | static int sb_equal(mdp_super_t *sb1, mdp_super_t *sb2) | |
553 | { | |
554 | int ret; | |
555 | mdp_super_t *tmp1, *tmp2; | |
556 | ||
557 | tmp1 = kmalloc(sizeof(*tmp1),GFP_KERNEL); | |
558 | tmp2 = kmalloc(sizeof(*tmp2),GFP_KERNEL); | |
559 | ||
560 | if (!tmp1 || !tmp2) { | |
561 | ret = 0; | |
562 | printk(KERN_INFO "md.c: sb1 is not equal to sb2!\n"); | |
563 | goto abort; | |
564 | } | |
565 | ||
566 | *tmp1 = *sb1; | |
567 | *tmp2 = *sb2; | |
568 | ||
569 | /* | |
570 | * nr_disks is not constant | |
571 | */ | |
572 | tmp1->nr_disks = 0; | |
573 | tmp2->nr_disks = 0; | |
574 | ||
575 | if (memcmp(tmp1, tmp2, MD_SB_GENERIC_CONSTANT_WORDS * 4)) | |
576 | ret = 0; | |
577 | else | |
578 | ret = 1; | |
579 | ||
580 | abort: | |
581 | kfree(tmp1); | |
582 | kfree(tmp2); | |
583 | return ret; | |
584 | } | |
585 | ||
586 | static unsigned int calc_sb_csum(mdp_super_t * sb) | |
587 | { | |
588 | unsigned int disk_csum, csum; | |
589 | ||
590 | disk_csum = sb->sb_csum; | |
591 | sb->sb_csum = 0; | |
592 | csum = csum_partial((void *)sb, MD_SB_BYTES, 0); | |
593 | sb->sb_csum = disk_csum; | |
594 | return csum; | |
595 | } | |
596 | ||
597 | ||
598 | /* | |
599 | * Handle superblock details. | |
600 | * We want to be able to handle multiple superblock formats | |
601 | * so we have a common interface to them all, and an array of | |
602 | * different handlers. | |
603 | * We rely on user-space to write the initial superblock, and support | |
604 | * reading and updating of superblocks. | |
605 | * Interface methods are: | |
606 | * int load_super(mdk_rdev_t *dev, mdk_rdev_t *refdev, int minor_version) | |
607 | * loads and validates a superblock on dev. | |
608 | * if refdev != NULL, compare superblocks on both devices | |
609 | * Return: | |
610 | * 0 - dev has a superblock that is compatible with refdev | |
611 | * 1 - dev has a superblock that is compatible and newer than refdev | |
612 | * so dev should be used as the refdev in future | |
613 | * -EINVAL superblock incompatible or invalid | |
614 | * -othererror e.g. -EIO | |
615 | * | |
616 | * int validate_super(mddev_t *mddev, mdk_rdev_t *dev) | |
617 | * Verify that dev is acceptable into mddev. | |
618 | * The first time, mddev->raid_disks will be 0, and data from | |
619 | * dev should be merged in. Subsequent calls check that dev | |
620 | * is new enough. Return 0 or -EINVAL | |
621 | * | |
622 | * void sync_super(mddev_t *mddev, mdk_rdev_t *dev) | |
623 | * Update the superblock for rdev with data in mddev | |
624 | * This does not write to disc. | |
625 | * | |
626 | */ | |
627 | ||
628 | struct super_type { | |
629 | char *name; | |
630 | struct module *owner; | |
631 | int (*load_super)(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version); | |
632 | int (*validate_super)(mddev_t *mddev, mdk_rdev_t *rdev); | |
633 | void (*sync_super)(mddev_t *mddev, mdk_rdev_t *rdev); | |
634 | }; | |
635 | ||
636 | /* | |
637 | * load_super for 0.90.0 | |
638 | */ | |
639 | static int super_90_load(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version) | |
640 | { | |
641 | char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE]; | |
642 | mdp_super_t *sb; | |
643 | int ret; | |
644 | sector_t sb_offset; | |
645 | ||
646 | /* | |
647 | * Calculate the position of the superblock, | |
648 | * it's at the end of the disk. | |
649 | * | |
650 | * It also happens to be a multiple of 4Kb. | |
651 | */ | |
652 | sb_offset = calc_dev_sboffset(rdev->bdev); | |
653 | rdev->sb_offset = sb_offset; | |
654 | ||
655 | ret = read_disk_sb(rdev, MD_SB_BYTES); | |
656 | if (ret) return ret; | |
657 | ||
658 | ret = -EINVAL; | |
659 | ||
660 | bdevname(rdev->bdev, b); | |
661 | sb = (mdp_super_t*)page_address(rdev->sb_page); | |
662 | ||
663 | if (sb->md_magic != MD_SB_MAGIC) { | |
664 | printk(KERN_ERR "md: invalid raid superblock magic on %s\n", | |
665 | b); | |
666 | goto abort; | |
667 | } | |
668 | ||
669 | if (sb->major_version != 0 || | |
670 | sb->minor_version < 90 || | |
671 | sb->minor_version > 91) { | |
672 | printk(KERN_WARNING "Bad version number %d.%d on %s\n", | |
673 | sb->major_version, sb->minor_version, | |
674 | b); | |
675 | goto abort; | |
676 | } | |
677 | ||
678 | if (sb->raid_disks <= 0) | |
679 | goto abort; | |
680 | ||
681 | if (csum_fold(calc_sb_csum(sb)) != csum_fold(sb->sb_csum)) { | |
682 | printk(KERN_WARNING "md: invalid superblock checksum on %s\n", | |
683 | b); | |
684 | goto abort; | |
685 | } | |
686 | ||
687 | rdev->preferred_minor = sb->md_minor; | |
688 | rdev->data_offset = 0; | |
689 | rdev->sb_size = MD_SB_BYTES; | |
690 | ||
691 | if (sb->level == LEVEL_MULTIPATH) | |
692 | rdev->desc_nr = -1; | |
693 | else | |
694 | rdev->desc_nr = sb->this_disk.number; | |
695 | ||
696 | if (refdev == 0) | |
697 | ret = 1; | |
698 | else { | |
699 | __u64 ev1, ev2; | |
700 | mdp_super_t *refsb = (mdp_super_t*)page_address(refdev->sb_page); | |
701 | if (!uuid_equal(refsb, sb)) { | |
702 | printk(KERN_WARNING "md: %s has different UUID to %s\n", | |
703 | b, bdevname(refdev->bdev,b2)); | |
704 | goto abort; | |
705 | } | |
706 | if (!sb_equal(refsb, sb)) { | |
707 | printk(KERN_WARNING "md: %s has same UUID" | |
708 | " but different superblock to %s\n", | |
709 | b, bdevname(refdev->bdev, b2)); | |
710 | goto abort; | |
711 | } | |
712 | ev1 = md_event(sb); | |
713 | ev2 = md_event(refsb); | |
714 | if (ev1 > ev2) | |
715 | ret = 1; | |
716 | else | |
717 | ret = 0; | |
718 | } | |
719 | rdev->size = calc_dev_size(rdev, sb->chunk_size); | |
720 | ||
721 | if (rdev->size < sb->size && sb->level > 1) | |
722 | /* "this cannot possibly happen" ... */ | |
723 | ret = -EINVAL; | |
724 | ||
725 | abort: | |
726 | return ret; | |
727 | } | |
728 | ||
729 | /* | |
730 | * validate_super for 0.90.0 | |
731 | */ | |
732 | static int super_90_validate(mddev_t *mddev, mdk_rdev_t *rdev) | |
733 | { | |
734 | mdp_disk_t *desc; | |
735 | mdp_super_t *sb = (mdp_super_t *)page_address(rdev->sb_page); | |
736 | ||
737 | rdev->raid_disk = -1; | |
738 | rdev->flags = 0; | |
739 | if (mddev->raid_disks == 0) { | |
740 | mddev->major_version = 0; | |
741 | mddev->minor_version = sb->minor_version; | |
742 | mddev->patch_version = sb->patch_version; | |
743 | mddev->persistent = ! sb->not_persistent; | |
744 | mddev->chunk_size = sb->chunk_size; | |
745 | mddev->ctime = sb->ctime; | |
746 | mddev->utime = sb->utime; | |
747 | mddev->level = sb->level; | |
748 | mddev->clevel[0] = 0; | |
749 | mddev->layout = sb->layout; | |
750 | mddev->raid_disks = sb->raid_disks; | |
751 | mddev->size = sb->size; | |
752 | mddev->events = md_event(sb); | |
753 | mddev->bitmap_offset = 0; | |
754 | mddev->default_bitmap_offset = MD_SB_BYTES >> 9; | |
755 | ||
756 | if (mddev->minor_version >= 91) { | |
757 | mddev->reshape_position = sb->reshape_position; | |
758 | mddev->delta_disks = sb->delta_disks; | |
759 | mddev->new_level = sb->new_level; | |
760 | mddev->new_layout = sb->new_layout; | |
761 | mddev->new_chunk = sb->new_chunk; | |
762 | } else { | |
763 | mddev->reshape_position = MaxSector; | |
764 | mddev->delta_disks = 0; | |
765 | mddev->new_level = mddev->level; | |
766 | mddev->new_layout = mddev->layout; | |
767 | mddev->new_chunk = mddev->chunk_size; | |
768 | } | |
769 | ||
770 | if (sb->state & (1<<MD_SB_CLEAN)) | |
771 | mddev->recovery_cp = MaxSector; | |
772 | else { | |
773 | if (sb->events_hi == sb->cp_events_hi && | |
774 | sb->events_lo == sb->cp_events_lo) { | |
775 | mddev->recovery_cp = sb->recovery_cp; | |
776 | } else | |
777 | mddev->recovery_cp = 0; | |
778 | } | |
779 | ||
780 | memcpy(mddev->uuid+0, &sb->set_uuid0, 4); | |
781 | memcpy(mddev->uuid+4, &sb->set_uuid1, 4); | |
782 | memcpy(mddev->uuid+8, &sb->set_uuid2, 4); | |
783 | memcpy(mddev->uuid+12,&sb->set_uuid3, 4); | |
784 | ||
785 | mddev->max_disks = MD_SB_DISKS; | |
786 | ||
787 | if (sb->state & (1<<MD_SB_BITMAP_PRESENT) && | |
788 | mddev->bitmap_file == NULL) { | |
789 | if (mddev->level != 1 && mddev->level != 4 | |
790 | && mddev->level != 5 && mddev->level != 6 | |
791 | && mddev->level != 10) { | |
792 | /* FIXME use a better test */ | |
793 | printk(KERN_WARNING "md: bitmaps not supported for this level.\n"); | |
794 | return -EINVAL; | |
795 | } | |
796 | mddev->bitmap_offset = mddev->default_bitmap_offset; | |
797 | } | |
798 | ||
799 | } else if (mddev->pers == NULL) { | |
800 | /* Insist on good event counter while assembling */ | |
801 | __u64 ev1 = md_event(sb); | |
802 | ++ev1; | |
803 | if (ev1 < mddev->events) | |
804 | return -EINVAL; | |
805 | } else if (mddev->bitmap) { | |
806 | /* if adding to array with a bitmap, then we can accept an | |
807 | * older device ... but not too old. | |
808 | */ | |
809 | __u64 ev1 = md_event(sb); | |
810 | if (ev1 < mddev->bitmap->events_cleared) | |
811 | return 0; | |
812 | } else /* just a hot-add of a new device, leave raid_disk at -1 */ | |
813 | return 0; | |
814 | ||
815 | if (mddev->level != LEVEL_MULTIPATH) { | |
816 | desc = sb->disks + rdev->desc_nr; | |
817 | ||
818 | if (desc->state & (1<<MD_DISK_FAULTY)) | |
819 | set_bit(Faulty, &rdev->flags); | |
820 | else if (desc->state & (1<<MD_DISK_SYNC) /* && | |
821 | desc->raid_disk < mddev->raid_disks */) { | |
822 | set_bit(In_sync, &rdev->flags); | |
823 | rdev->raid_disk = desc->raid_disk; | |
824 | } | |
825 | if (desc->state & (1<<MD_DISK_WRITEMOSTLY)) | |
826 | set_bit(WriteMostly, &rdev->flags); | |
827 | } else /* MULTIPATH are always insync */ | |
828 | set_bit(In_sync, &rdev->flags); | |
829 | return 0; | |
830 | } | |
831 | ||
832 | /* | |
833 | * sync_super for 0.90.0 | |
834 | */ | |
835 | static void super_90_sync(mddev_t *mddev, mdk_rdev_t *rdev) | |
836 | { | |
837 | mdp_super_t *sb; | |
838 | struct list_head *tmp; | |
839 | mdk_rdev_t *rdev2; | |
840 | int next_spare = mddev->raid_disks; | |
841 | ||
842 | ||
843 | /* make rdev->sb match mddev data.. | |
844 | * | |
845 | * 1/ zero out disks | |
846 | * 2/ Add info for each disk, keeping track of highest desc_nr (next_spare); | |
847 | * 3/ any empty disks < next_spare become removed | |
848 | * | |
849 | * disks[0] gets initialised to REMOVED because | |
850 | * we cannot be sure from other fields if it has | |
851 | * been initialised or not. | |
852 | */ | |
853 | int i; | |
854 | int active=0, working=0,failed=0,spare=0,nr_disks=0; | |
855 | ||
856 | rdev->sb_size = MD_SB_BYTES; | |
857 | ||
858 | sb = (mdp_super_t*)page_address(rdev->sb_page); | |
859 | ||
860 | memset(sb, 0, sizeof(*sb)); | |
861 | ||
862 | sb->md_magic = MD_SB_MAGIC; | |
863 | sb->major_version = mddev->major_version; | |
864 | sb->patch_version = mddev->patch_version; | |
865 | sb->gvalid_words = 0; /* ignored */ | |
866 | memcpy(&sb->set_uuid0, mddev->uuid+0, 4); | |
867 | memcpy(&sb->set_uuid1, mddev->uuid+4, 4); | |
868 | memcpy(&sb->set_uuid2, mddev->uuid+8, 4); | |
869 | memcpy(&sb->set_uuid3, mddev->uuid+12,4); | |
870 | ||
871 | sb->ctime = mddev->ctime; | |
872 | sb->level = mddev->level; | |
873 | sb->size = mddev->size; | |
874 | sb->raid_disks = mddev->raid_disks; | |
875 | sb->md_minor = mddev->md_minor; | |
876 | sb->not_persistent = !mddev->persistent; | |
877 | sb->utime = mddev->utime; | |
878 | sb->state = 0; | |
879 | sb->events_hi = (mddev->events>>32); | |
880 | sb->events_lo = (u32)mddev->events; | |
881 | ||
882 | if (mddev->reshape_position == MaxSector) | |
883 | sb->minor_version = 90; | |
884 | else { | |
885 | sb->minor_version = 91; | |
886 | sb->reshape_position = mddev->reshape_position; | |
887 | sb->new_level = mddev->new_level; | |
888 | sb->delta_disks = mddev->delta_disks; | |
889 | sb->new_layout = mddev->new_layout; | |
890 | sb->new_chunk = mddev->new_chunk; | |
891 | } | |
892 | mddev->minor_version = sb->minor_version; | |
893 | if (mddev->in_sync) | |
894 | { | |
895 | sb->recovery_cp = mddev->recovery_cp; | |
896 | sb->cp_events_hi = (mddev->events>>32); | |
897 | sb->cp_events_lo = (u32)mddev->events; | |
898 | if (mddev->recovery_cp == MaxSector) | |
899 | sb->state = (1<< MD_SB_CLEAN); | |
900 | } else | |
901 | sb->recovery_cp = 0; | |
902 | ||
903 | sb->layout = mddev->layout; | |
904 | sb->chunk_size = mddev->chunk_size; | |
905 | ||
906 | if (mddev->bitmap && mddev->bitmap_file == NULL) | |
907 | sb->state |= (1<<MD_SB_BITMAP_PRESENT); | |
908 | ||
909 | sb->disks[0].state = (1<<MD_DISK_REMOVED); | |
910 | ITERATE_RDEV(mddev,rdev2,tmp) { | |
911 | mdp_disk_t *d; | |
912 | int desc_nr; | |
913 | if (rdev2->raid_disk >= 0 && test_bit(In_sync, &rdev2->flags) | |
914 | && !test_bit(Faulty, &rdev2->flags)) | |
915 | desc_nr = rdev2->raid_disk; | |
916 | else | |
917 | desc_nr = next_spare++; | |
918 | rdev2->desc_nr = desc_nr; | |
919 | d = &sb->disks[rdev2->desc_nr]; | |
920 | nr_disks++; | |
921 | d->number = rdev2->desc_nr; | |
922 | d->major = MAJOR(rdev2->bdev->bd_dev); | |
923 | d->minor = MINOR(rdev2->bdev->bd_dev); | |
924 | if (rdev2->raid_disk >= 0 && test_bit(In_sync, &rdev2->flags) | |
925 | && !test_bit(Faulty, &rdev2->flags)) | |
926 | d->raid_disk = rdev2->raid_disk; | |
927 | else | |
928 | d->raid_disk = rdev2->desc_nr; /* compatibility */ | |
929 | if (test_bit(Faulty, &rdev2->flags)) | |
930 | d->state = (1<<MD_DISK_FAULTY); | |
931 | else if (test_bit(In_sync, &rdev2->flags)) { | |
932 | d->state = (1<<MD_DISK_ACTIVE); | |
933 | d->state |= (1<<MD_DISK_SYNC); | |
934 | active++; | |
935 | working++; | |
936 | } else { | |
937 | d->state = 0; | |
938 | spare++; | |
939 | working++; | |
940 | } | |
941 | if (test_bit(WriteMostly, &rdev2->flags)) | |
942 | d->state |= (1<<MD_DISK_WRITEMOSTLY); | |
943 | } | |
944 | /* now set the "removed" and "faulty" bits on any missing devices */ | |
945 | for (i=0 ; i < mddev->raid_disks ; i++) { | |
946 | mdp_disk_t *d = &sb->disks[i]; | |
947 | if (d->state == 0 && d->number == 0) { | |
948 | d->number = i; | |
949 | d->raid_disk = i; | |
950 | d->state = (1<<MD_DISK_REMOVED); | |
951 | d->state |= (1<<MD_DISK_FAULTY); | |
952 | failed++; | |
953 | } | |
954 | } | |
955 | sb->nr_disks = nr_disks; | |
956 | sb->active_disks = active; | |
957 | sb->working_disks = working; | |
958 | sb->failed_disks = failed; | |
959 | sb->spare_disks = spare; | |
960 | ||
961 | sb->this_disk = sb->disks[rdev->desc_nr]; | |
962 | sb->sb_csum = calc_sb_csum(sb); | |
963 | } | |
964 | ||
965 | /* | |
966 | * version 1 superblock | |
967 | */ | |
968 | ||
969 | static unsigned int calc_sb_1_csum(struct mdp_superblock_1 * sb) | |
970 | { | |
971 | unsigned int disk_csum, csum; | |
972 | unsigned long long newcsum; | |
973 | int size = 256 + le32_to_cpu(sb->max_dev)*2; | |
974 | unsigned int *isuper = (unsigned int*)sb; | |
975 | int i; | |
976 | ||
977 | disk_csum = sb->sb_csum; | |
978 | sb->sb_csum = 0; | |
979 | newcsum = 0; | |
980 | for (i=0; size>=4; size -= 4 ) | |
981 | newcsum += le32_to_cpu(*isuper++); | |
982 | ||
983 | if (size == 2) | |
984 | newcsum += le16_to_cpu(*(unsigned short*) isuper); | |
985 | ||
986 | csum = (newcsum & 0xffffffff) + (newcsum >> 32); | |
987 | sb->sb_csum = disk_csum; | |
988 | return cpu_to_le32(csum); | |
989 | } | |
990 | ||
991 | static int super_1_load(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version) | |
992 | { | |
993 | struct mdp_superblock_1 *sb; | |
994 | int ret; | |
995 | sector_t sb_offset; | |
996 | char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE]; | |
997 | int bmask; | |
998 | ||
999 | /* | |
1000 | * Calculate the position of the superblock. | |
1001 | * It is always aligned to a 4K boundary and | |
1002 | * depeding on minor_version, it can be: | |
1003 | * 0: At least 8K, but less than 12K, from end of device | |
1004 | * 1: At start of device | |
1005 | * 2: 4K from start of device. | |
1006 | */ | |
1007 | switch(minor_version) { | |
1008 | case 0: | |
1009 | sb_offset = rdev->bdev->bd_inode->i_size >> 9; | |
1010 | sb_offset -= 8*2; | |
1011 | sb_offset &= ~(sector_t)(4*2-1); | |
1012 | /* convert from sectors to K */ | |
1013 | sb_offset /= 2; | |
1014 | break; | |
1015 | case 1: | |
1016 | sb_offset = 0; | |
1017 | break; | |
1018 | case 2: | |
1019 | sb_offset = 4; | |
1020 | break; | |
1021 | default: | |
1022 | return -EINVAL; | |
1023 | } | |
1024 | rdev->sb_offset = sb_offset; | |
1025 | ||
1026 | /* superblock is rarely larger than 1K, but it can be larger, | |
1027 | * and it is safe to read 4k, so we do that | |
1028 | */ | |
1029 | ret = read_disk_sb(rdev, 4096); | |
1030 | if (ret) return ret; | |
1031 | ||
1032 | ||
1033 | sb = (struct mdp_superblock_1*)page_address(rdev->sb_page); | |
1034 | ||
1035 | if (sb->magic != cpu_to_le32(MD_SB_MAGIC) || | |
1036 | sb->major_version != cpu_to_le32(1) || | |
1037 | le32_to_cpu(sb->max_dev) > (4096-256)/2 || | |
1038 | le64_to_cpu(sb->super_offset) != (rdev->sb_offset<<1) || | |
1039 | (le32_to_cpu(sb->feature_map) & ~MD_FEATURE_ALL) != 0) | |
1040 | return -EINVAL; | |
1041 | ||
1042 | if (calc_sb_1_csum(sb) != sb->sb_csum) { | |
1043 | printk("md: invalid superblock checksum on %s\n", | |
1044 | bdevname(rdev->bdev,b)); | |
1045 | return -EINVAL; | |
1046 | } | |
1047 | if (le64_to_cpu(sb->data_size) < 10) { | |
1048 | printk("md: data_size too small on %s\n", | |
1049 | bdevname(rdev->bdev,b)); | |
1050 | return -EINVAL; | |
1051 | } | |
1052 | rdev->preferred_minor = 0xffff; | |
1053 | rdev->data_offset = le64_to_cpu(sb->data_offset); | |
1054 | atomic_set(&rdev->corrected_errors, le32_to_cpu(sb->cnt_corrected_read)); | |
1055 | ||
1056 | rdev->sb_size = le32_to_cpu(sb->max_dev) * 2 + 256; | |
1057 | bmask = queue_hardsect_size(rdev->bdev->bd_disk->queue)-1; | |
1058 | if (rdev->sb_size & bmask) | |
1059 | rdev-> sb_size = (rdev->sb_size | bmask)+1; | |
1060 | ||
1061 | if (refdev == 0) | |
1062 | ret = 1; | |
1063 | else { | |
1064 | __u64 ev1, ev2; | |
1065 | struct mdp_superblock_1 *refsb = | |
1066 | (struct mdp_superblock_1*)page_address(refdev->sb_page); | |
1067 | ||
1068 | if (memcmp(sb->set_uuid, refsb->set_uuid, 16) != 0 || | |
1069 | sb->level != refsb->level || | |
1070 | sb->layout != refsb->layout || | |
1071 | sb->chunksize != refsb->chunksize) { | |
1072 | printk(KERN_WARNING "md: %s has strangely different" | |
1073 | " superblock to %s\n", | |
1074 | bdevname(rdev->bdev,b), | |
1075 | bdevname(refdev->bdev,b2)); | |
1076 | return -EINVAL; | |
1077 | } | |
1078 | ev1 = le64_to_cpu(sb->events); | |
1079 | ev2 = le64_to_cpu(refsb->events); | |
1080 | ||
1081 | if (ev1 > ev2) | |
1082 | ret = 1; | |
1083 | else | |
1084 | ret = 0; | |
1085 | } | |
1086 | if (minor_version) | |
1087 | rdev->size = ((rdev->bdev->bd_inode->i_size>>9) - le64_to_cpu(sb->data_offset)) / 2; | |
1088 | else | |
1089 | rdev->size = rdev->sb_offset; | |
1090 | if (rdev->size < le64_to_cpu(sb->data_size)/2) | |
1091 | return -EINVAL; | |
1092 | rdev->size = le64_to_cpu(sb->data_size)/2; | |
1093 | if (le32_to_cpu(sb->chunksize)) | |
1094 | rdev->size &= ~((sector_t)le32_to_cpu(sb->chunksize)/2 - 1); | |
1095 | ||
1096 | if (le32_to_cpu(sb->size) > rdev->size*2) | |
1097 | return -EINVAL; | |
1098 | return ret; | |
1099 | } | |
1100 | ||
1101 | static int super_1_validate(mddev_t *mddev, mdk_rdev_t *rdev) | |
1102 | { | |
1103 | struct mdp_superblock_1 *sb = (struct mdp_superblock_1*)page_address(rdev->sb_page); | |
1104 | ||
1105 | rdev->raid_disk = -1; | |
1106 | rdev->flags = 0; | |
1107 | if (mddev->raid_disks == 0) { | |
1108 | mddev->major_version = 1; | |
1109 | mddev->patch_version = 0; | |
1110 | mddev->persistent = 1; | |
1111 | mddev->chunk_size = le32_to_cpu(sb->chunksize) << 9; | |
1112 | mddev->ctime = le64_to_cpu(sb->ctime) & ((1ULL << 32)-1); | |
1113 | mddev->utime = le64_to_cpu(sb->utime) & ((1ULL << 32)-1); | |
1114 | mddev->level = le32_to_cpu(sb->level); | |
1115 | mddev->clevel[0] = 0; | |
1116 | mddev->layout = le32_to_cpu(sb->layout); | |
1117 | mddev->raid_disks = le32_to_cpu(sb->raid_disks); | |
1118 | mddev->size = le64_to_cpu(sb->size)/2; | |
1119 | mddev->events = le64_to_cpu(sb->events); | |
1120 | mddev->bitmap_offset = 0; | |
1121 | mddev->default_bitmap_offset = 1024 >> 9; | |
1122 | ||
1123 | mddev->recovery_cp = le64_to_cpu(sb->resync_offset); | |
1124 | memcpy(mddev->uuid, sb->set_uuid, 16); | |
1125 | ||
1126 | mddev->max_disks = (4096-256)/2; | |
1127 | ||
1128 | if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_BITMAP_OFFSET) && | |
1129 | mddev->bitmap_file == NULL ) { | |
1130 | if (mddev->level != 1 && mddev->level != 5 && mddev->level != 6 | |
1131 | && mddev->level != 10) { | |
1132 | printk(KERN_WARNING "md: bitmaps not supported for this level.\n"); | |
1133 | return -EINVAL; | |
1134 | } | |
1135 | mddev->bitmap_offset = (__s32)le32_to_cpu(sb->bitmap_offset); | |
1136 | } | |
1137 | if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_RESHAPE_ACTIVE)) { | |
1138 | mddev->reshape_position = le64_to_cpu(sb->reshape_position); | |
1139 | mddev->delta_disks = le32_to_cpu(sb->delta_disks); | |
1140 | mddev->new_level = le32_to_cpu(sb->new_level); | |
1141 | mddev->new_layout = le32_to_cpu(sb->new_layout); | |
1142 | mddev->new_chunk = le32_to_cpu(sb->new_chunk)<<9; | |
1143 | } else { | |
1144 | mddev->reshape_position = MaxSector; | |
1145 | mddev->delta_disks = 0; | |
1146 | mddev->new_level = mddev->level; | |
1147 | mddev->new_layout = mddev->layout; | |
1148 | mddev->new_chunk = mddev->chunk_size; | |
1149 | } | |
1150 | ||
1151 | } else if (mddev->pers == NULL) { | |
1152 | /* Insist of good event counter while assembling */ | |
1153 | __u64 ev1 = le64_to_cpu(sb->events); | |
1154 | ++ev1; | |
1155 | if (ev1 < mddev->events) | |
1156 | return -EINVAL; | |
1157 | } else if (mddev->bitmap) { | |
1158 | /* If adding to array with a bitmap, then we can accept an | |
1159 | * older device, but not too old. | |
1160 | */ | |
1161 | __u64 ev1 = le64_to_cpu(sb->events); | |
1162 | if (ev1 < mddev->bitmap->events_cleared) | |
1163 | return 0; | |
1164 | } else /* just a hot-add of a new device, leave raid_disk at -1 */ | |
1165 | return 0; | |
1166 | ||
1167 | if (mddev->level != LEVEL_MULTIPATH) { | |
1168 | int role; | |
1169 | rdev->desc_nr = le32_to_cpu(sb->dev_number); | |
1170 | role = le16_to_cpu(sb->dev_roles[rdev->desc_nr]); | |
1171 | switch(role) { | |
1172 | case 0xffff: /* spare */ | |
1173 | break; | |
1174 | case 0xfffe: /* faulty */ | |
1175 | set_bit(Faulty, &rdev->flags); | |
1176 | break; | |
1177 | default: | |
1178 | if ((le32_to_cpu(sb->feature_map) & | |
1179 | MD_FEATURE_RECOVERY_OFFSET)) | |
1180 | rdev->recovery_offset = le64_to_cpu(sb->recovery_offset); | |
1181 | else | |
1182 | set_bit(In_sync, &rdev->flags); | |
1183 | rdev->raid_disk = role; | |
1184 | break; | |
1185 | } | |
1186 | if (sb->devflags & WriteMostly1) | |
1187 | set_bit(WriteMostly, &rdev->flags); | |
1188 | } else /* MULTIPATH are always insync */ | |
1189 | set_bit(In_sync, &rdev->flags); | |
1190 | ||
1191 | return 0; | |
1192 | } | |
1193 | ||
1194 | static void super_1_sync(mddev_t *mddev, mdk_rdev_t *rdev) | |
1195 | { | |
1196 | struct mdp_superblock_1 *sb; | |
1197 | struct list_head *tmp; | |
1198 | mdk_rdev_t *rdev2; | |
1199 | int max_dev, i; | |
1200 | /* make rdev->sb match mddev and rdev data. */ | |
1201 | ||
1202 | sb = (struct mdp_superblock_1*)page_address(rdev->sb_page); | |
1203 | ||
1204 | sb->feature_map = 0; | |
1205 | sb->pad0 = 0; | |
1206 | sb->recovery_offset = cpu_to_le64(0); | |
1207 | memset(sb->pad1, 0, sizeof(sb->pad1)); | |
1208 | memset(sb->pad2, 0, sizeof(sb->pad2)); | |
1209 | memset(sb->pad3, 0, sizeof(sb->pad3)); | |
1210 | ||
1211 | sb->utime = cpu_to_le64((__u64)mddev->utime); | |
1212 | sb->events = cpu_to_le64(mddev->events); | |
1213 | if (mddev->in_sync) | |
1214 | sb->resync_offset = cpu_to_le64(mddev->recovery_cp); | |
1215 | else | |
1216 | sb->resync_offset = cpu_to_le64(0); | |
1217 | ||
1218 | sb->cnt_corrected_read = atomic_read(&rdev->corrected_errors); | |
1219 | ||
1220 | sb->raid_disks = cpu_to_le32(mddev->raid_disks); | |
1221 | sb->size = cpu_to_le64(mddev->size<<1); | |
1222 | ||
1223 | if (mddev->bitmap && mddev->bitmap_file == NULL) { | |
1224 | sb->bitmap_offset = cpu_to_le32((__u32)mddev->bitmap_offset); | |
1225 | sb->feature_map = cpu_to_le32(MD_FEATURE_BITMAP_OFFSET); | |
1226 | } | |
1227 | ||
1228 | if (rdev->raid_disk >= 0 && | |
1229 | !test_bit(In_sync, &rdev->flags) && | |
1230 | rdev->recovery_offset > 0) { | |
1231 | sb->feature_map |= cpu_to_le32(MD_FEATURE_RECOVERY_OFFSET); | |
1232 | sb->recovery_offset = cpu_to_le64(rdev->recovery_offset); | |
1233 | } | |
1234 | ||
1235 | if (mddev->reshape_position != MaxSector) { | |
1236 | sb->feature_map |= cpu_to_le32(MD_FEATURE_RESHAPE_ACTIVE); | |
1237 | sb->reshape_position = cpu_to_le64(mddev->reshape_position); | |
1238 | sb->new_layout = cpu_to_le32(mddev->new_layout); | |
1239 | sb->delta_disks = cpu_to_le32(mddev->delta_disks); | |
1240 | sb->new_level = cpu_to_le32(mddev->new_level); | |
1241 | sb->new_chunk = cpu_to_le32(mddev->new_chunk>>9); | |
1242 | } | |
1243 | ||
1244 | max_dev = 0; | |
1245 | ITERATE_RDEV(mddev,rdev2,tmp) | |
1246 | if (rdev2->desc_nr+1 > max_dev) | |
1247 | max_dev = rdev2->desc_nr+1; | |
1248 | ||
1249 | sb->max_dev = cpu_to_le32(max_dev); | |
1250 | for (i=0; i<max_dev;i++) | |
1251 | sb->dev_roles[i] = cpu_to_le16(0xfffe); | |
1252 | ||
1253 | ITERATE_RDEV(mddev,rdev2,tmp) { | |
1254 | i = rdev2->desc_nr; | |
1255 | if (test_bit(Faulty, &rdev2->flags)) | |
1256 | sb->dev_roles[i] = cpu_to_le16(0xfffe); | |
1257 | else if (test_bit(In_sync, &rdev2->flags)) | |
1258 | sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk); | |
1259 | else if (rdev2->raid_disk >= 0 && rdev2->recovery_offset > 0) | |
1260 | sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk); | |
1261 | else | |
1262 | sb->dev_roles[i] = cpu_to_le16(0xffff); | |
1263 | } | |
1264 | ||
1265 | sb->sb_csum = calc_sb_1_csum(sb); | |
1266 | } | |
1267 | ||
1268 | ||
1269 | static struct super_type super_types[] = { | |
1270 | [0] = { | |
1271 | .name = "0.90.0", | |
1272 | .owner = THIS_MODULE, | |
1273 | .load_super = super_90_load, | |
1274 | .validate_super = super_90_validate, | |
1275 | .sync_super = super_90_sync, | |
1276 | }, | |
1277 | [1] = { | |
1278 | .name = "md-1", | |
1279 | .owner = THIS_MODULE, | |
1280 | .load_super = super_1_load, | |
1281 | .validate_super = super_1_validate, | |
1282 | .sync_super = super_1_sync, | |
1283 | }, | |
1284 | }; | |
1285 | ||
1286 | static mdk_rdev_t * match_dev_unit(mddev_t *mddev, mdk_rdev_t *dev) | |
1287 | { | |
1288 | struct list_head *tmp; | |
1289 | mdk_rdev_t *rdev; | |
1290 | ||
1291 | ITERATE_RDEV(mddev,rdev,tmp) | |
1292 | if (rdev->bdev->bd_contains == dev->bdev->bd_contains) | |
1293 | return rdev; | |
1294 | ||
1295 | return NULL; | |
1296 | } | |
1297 | ||
1298 | static int match_mddev_units(mddev_t *mddev1, mddev_t *mddev2) | |
1299 | { | |
1300 | struct list_head *tmp; | |
1301 | mdk_rdev_t *rdev; | |
1302 | ||
1303 | ITERATE_RDEV(mddev1,rdev,tmp) | |
1304 | if (match_dev_unit(mddev2, rdev)) | |
1305 | return 1; | |
1306 | ||
1307 | return 0; | |
1308 | } | |
1309 | ||
1310 | static LIST_HEAD(pending_raid_disks); | |
1311 | ||
1312 | static int bind_rdev_to_array(mdk_rdev_t * rdev, mddev_t * mddev) | |
1313 | { | |
1314 | mdk_rdev_t *same_pdev; | |
1315 | char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE]; | |
1316 | struct kobject *ko; | |
1317 | char *s; | |
1318 | ||
1319 | if (rdev->mddev) { | |
1320 | MD_BUG(); | |
1321 | return -EINVAL; | |
1322 | } | |
1323 | /* make sure rdev->size exceeds mddev->size */ | |
1324 | if (rdev->size && (mddev->size == 0 || rdev->size < mddev->size)) { | |
1325 | if (mddev->pers) | |
1326 | /* Cannot change size, so fail */ | |
1327 | return -ENOSPC; | |
1328 | else | |
1329 | mddev->size = rdev->size; | |
1330 | } | |
1331 | same_pdev = match_dev_unit(mddev, rdev); | |
1332 | if (same_pdev) | |
1333 | printk(KERN_WARNING | |
1334 | "%s: WARNING: %s appears to be on the same physical" | |
1335 | " disk as %s. True\n protection against single-disk" | |
1336 | " failure might be compromised.\n", | |
1337 | mdname(mddev), bdevname(rdev->bdev,b), | |
1338 | bdevname(same_pdev->bdev,b2)); | |
1339 | ||
1340 | /* Verify rdev->desc_nr is unique. | |
1341 | * If it is -1, assign a free number, else | |
1342 | * check number is not in use | |
1343 | */ | |
1344 | if (rdev->desc_nr < 0) { | |
1345 | int choice = 0; | |
1346 | if (mddev->pers) choice = mddev->raid_disks; | |
1347 | while (find_rdev_nr(mddev, choice)) | |
1348 | choice++; | |
1349 | rdev->desc_nr = choice; | |
1350 | } else { | |
1351 | if (find_rdev_nr(mddev, rdev->desc_nr)) | |
1352 | return -EBUSY; | |
1353 | } | |
1354 | bdevname(rdev->bdev,b); | |
1355 | if (kobject_set_name(&rdev->kobj, "dev-%s", b) < 0) | |
1356 | return -ENOMEM; | |
1357 | while ( (s=strchr(rdev->kobj.k_name, '/')) != NULL) | |
1358 | *s = '!'; | |
1359 | ||
1360 | list_add(&rdev->same_set, &mddev->disks); | |
1361 | rdev->mddev = mddev; | |
1362 | printk(KERN_INFO "md: bind<%s>\n", b); | |
1363 | ||
1364 | rdev->kobj.parent = &mddev->kobj; | |
1365 | kobject_add(&rdev->kobj); | |
1366 | ||
1367 | if (rdev->bdev->bd_part) | |
1368 | ko = &rdev->bdev->bd_part->kobj; | |
1369 | else | |
1370 | ko = &rdev->bdev->bd_disk->kobj; | |
1371 | sysfs_create_link(&rdev->kobj, ko, "block"); | |
1372 | bd_claim_by_disk(rdev->bdev, rdev, mddev->gendisk); | |
1373 | return 0; | |
1374 | } | |
1375 | ||
1376 | static void unbind_rdev_from_array(mdk_rdev_t * rdev) | |
1377 | { | |
1378 | char b[BDEVNAME_SIZE]; | |
1379 | if (!rdev->mddev) { | |
1380 | MD_BUG(); | |
1381 | return; | |
1382 | } | |
1383 | bd_release_from_disk(rdev->bdev, rdev->mddev->gendisk); | |
1384 | list_del_init(&rdev->same_set); | |
1385 | printk(KERN_INFO "md: unbind<%s>\n", bdevname(rdev->bdev,b)); | |
1386 | rdev->mddev = NULL; | |
1387 | sysfs_remove_link(&rdev->kobj, "block"); | |
1388 | kobject_del(&rdev->kobj); | |
1389 | } | |
1390 | ||
1391 | /* | |
1392 | * prevent the device from being mounted, repartitioned or | |
1393 | * otherwise reused by a RAID array (or any other kernel | |
1394 | * subsystem), by bd_claiming the device. | |
1395 | */ | |
1396 | static int lock_rdev(mdk_rdev_t *rdev, dev_t dev) | |
1397 | { | |
1398 | int err = 0; | |
1399 | struct block_device *bdev; | |
1400 | char b[BDEVNAME_SIZE]; | |
1401 | ||
1402 | bdev = open_by_devnum(dev, FMODE_READ|FMODE_WRITE); | |
1403 | if (IS_ERR(bdev)) { | |
1404 | printk(KERN_ERR "md: could not open %s.\n", | |
1405 | __bdevname(dev, b)); | |
1406 | return PTR_ERR(bdev); | |
1407 | } | |
1408 | err = bd_claim(bdev, rdev); | |
1409 | if (err) { | |
1410 | printk(KERN_ERR "md: could not bd_claim %s.\n", | |
1411 | bdevname(bdev, b)); | |
1412 | blkdev_put(bdev); | |
1413 | return err; | |
1414 | } | |
1415 | rdev->bdev = bdev; | |
1416 | return err; | |
1417 | } | |
1418 | ||
1419 | static void unlock_rdev(mdk_rdev_t *rdev) | |
1420 | { | |
1421 | struct block_device *bdev = rdev->bdev; | |
1422 | rdev->bdev = NULL; | |
1423 | if (!bdev) | |
1424 | MD_BUG(); | |
1425 | bd_release(bdev); | |
1426 | blkdev_put(bdev); | |
1427 | } | |
1428 | ||
1429 | void md_autodetect_dev(dev_t dev); | |
1430 | ||
1431 | static void export_rdev(mdk_rdev_t * rdev) | |
1432 | { | |
1433 | char b[BDEVNAME_SIZE]; | |
1434 | printk(KERN_INFO "md: export_rdev(%s)\n", | |
1435 | bdevname(rdev->bdev,b)); | |
1436 | if (rdev->mddev) | |
1437 | MD_BUG(); | |
1438 | free_disk_sb(rdev); | |
1439 | list_del_init(&rdev->same_set); | |
1440 | #ifndef MODULE | |
1441 | md_autodetect_dev(rdev->bdev->bd_dev); | |
1442 | #endif | |
1443 | unlock_rdev(rdev); | |
1444 | kobject_put(&rdev->kobj); | |
1445 | } | |
1446 | ||
1447 | static void kick_rdev_from_array(mdk_rdev_t * rdev) | |
1448 | { | |
1449 | unbind_rdev_from_array(rdev); | |
1450 | export_rdev(rdev); | |
1451 | } | |
1452 | ||
1453 | static void export_array(mddev_t *mddev) | |
1454 | { | |
1455 | struct list_head *tmp; | |
1456 | mdk_rdev_t *rdev; | |
1457 | ||
1458 | ITERATE_RDEV(mddev,rdev,tmp) { | |
1459 | if (!rdev->mddev) { | |
1460 | MD_BUG(); | |
1461 | continue; | |
1462 | } | |
1463 | kick_rdev_from_array(rdev); | |
1464 | } | |
1465 | if (!list_empty(&mddev->disks)) | |
1466 | MD_BUG(); | |
1467 | mddev->raid_disks = 0; | |
1468 | mddev->major_version = 0; | |
1469 | } | |
1470 | ||
1471 | static void print_desc(mdp_disk_t *desc) | |
1472 | { | |
1473 | printk(" DISK<N:%d,(%d,%d),R:%d,S:%d>\n", desc->number, | |
1474 | desc->major,desc->minor,desc->raid_disk,desc->state); | |
1475 | } | |
1476 | ||
1477 | static void print_sb(mdp_super_t *sb) | |
1478 | { | |
1479 | int i; | |
1480 | ||
1481 | printk(KERN_INFO | |
1482 | "md: SB: (V:%d.%d.%d) ID:<%08x.%08x.%08x.%08x> CT:%08x\n", | |
1483 | sb->major_version, sb->minor_version, sb->patch_version, | |
1484 | sb->set_uuid0, sb->set_uuid1, sb->set_uuid2, sb->set_uuid3, | |
1485 | sb->ctime); | |
1486 | printk(KERN_INFO "md: L%d S%08d ND:%d RD:%d md%d LO:%d CS:%d\n", | |
1487 | sb->level, sb->size, sb->nr_disks, sb->raid_disks, | |
1488 | sb->md_minor, sb->layout, sb->chunk_size); | |
1489 | printk(KERN_INFO "md: UT:%08x ST:%d AD:%d WD:%d" | |
1490 | " FD:%d SD:%d CSUM:%08x E:%08lx\n", | |
1491 | sb->utime, sb->state, sb->active_disks, sb->working_disks, | |
1492 | sb->failed_disks, sb->spare_disks, | |
1493 | sb->sb_csum, (unsigned long)sb->events_lo); | |
1494 | ||
1495 | printk(KERN_INFO); | |
1496 | for (i = 0; i < MD_SB_DISKS; i++) { | |
1497 | mdp_disk_t *desc; | |
1498 | ||
1499 | desc = sb->disks + i; | |
1500 | if (desc->number || desc->major || desc->minor || | |
1501 | desc->raid_disk || (desc->state && (desc->state != 4))) { | |
1502 | printk(" D %2d: ", i); | |
1503 | print_desc(desc); | |
1504 | } | |
1505 | } | |
1506 | printk(KERN_INFO "md: THIS: "); | |
1507 | print_desc(&sb->this_disk); | |
1508 | ||
1509 | } | |
1510 | ||
1511 | static void print_rdev(mdk_rdev_t *rdev) | |
1512 | { | |
1513 | char b[BDEVNAME_SIZE]; | |
1514 | printk(KERN_INFO "md: rdev %s, SZ:%08llu F:%d S:%d DN:%u\n", | |
1515 | bdevname(rdev->bdev,b), (unsigned long long)rdev->size, | |
1516 | test_bit(Faulty, &rdev->flags), test_bit(In_sync, &rdev->flags), | |
1517 | rdev->desc_nr); | |
1518 | if (rdev->sb_loaded) { | |
1519 | printk(KERN_INFO "md: rdev superblock:\n"); | |
1520 | print_sb((mdp_super_t*)page_address(rdev->sb_page)); | |
1521 | } else | |
1522 | printk(KERN_INFO "md: no rdev superblock!\n"); | |
1523 | } | |
1524 | ||
1525 | void md_print_devices(void) | |
1526 | { | |
1527 | struct list_head *tmp, *tmp2; | |
1528 | mdk_rdev_t *rdev; | |
1529 | mddev_t *mddev; | |
1530 | char b[BDEVNAME_SIZE]; | |
1531 | ||
1532 | printk("\n"); | |
1533 | printk("md: **********************************\n"); | |
1534 | printk("md: * <COMPLETE RAID STATE PRINTOUT> *\n"); | |
1535 | printk("md: **********************************\n"); | |
1536 | ITERATE_MDDEV(mddev,tmp) { | |
1537 | ||
1538 | if (mddev->bitmap) | |
1539 | bitmap_print_sb(mddev->bitmap); | |
1540 | else | |
1541 | printk("%s: ", mdname(mddev)); | |
1542 | ITERATE_RDEV(mddev,rdev,tmp2) | |
1543 | printk("<%s>", bdevname(rdev->bdev,b)); | |
1544 | printk("\n"); | |
1545 | ||
1546 | ITERATE_RDEV(mddev,rdev,tmp2) | |
1547 | print_rdev(rdev); | |
1548 | } | |
1549 | printk("md: **********************************\n"); | |
1550 | printk("\n"); | |
1551 | } | |
1552 | ||
1553 | ||
1554 | static void sync_sbs(mddev_t * mddev) | |
1555 | { | |
1556 | mdk_rdev_t *rdev; | |
1557 | struct list_head *tmp; | |
1558 | ||
1559 | ITERATE_RDEV(mddev,rdev,tmp) { | |
1560 | super_types[mddev->major_version]. | |
1561 | sync_super(mddev, rdev); | |
1562 | rdev->sb_loaded = 1; | |
1563 | } | |
1564 | } | |
1565 | ||
1566 | void md_update_sb(mddev_t * mddev) | |
1567 | { | |
1568 | int err; | |
1569 | struct list_head *tmp; | |
1570 | mdk_rdev_t *rdev; | |
1571 | int sync_req; | |
1572 | ||
1573 | repeat: | |
1574 | spin_lock_irq(&mddev->write_lock); | |
1575 | sync_req = mddev->in_sync; | |
1576 | mddev->utime = get_seconds(); | |
1577 | mddev->events ++; | |
1578 | ||
1579 | if (!mddev->events) { | |
1580 | /* | |
1581 | * oops, this 64-bit counter should never wrap. | |
1582 | * Either we are in around ~1 trillion A.C., assuming | |
1583 | * 1 reboot per second, or we have a bug: | |
1584 | */ | |
1585 | MD_BUG(); | |
1586 | mddev->events --; | |
1587 | } | |
1588 | mddev->sb_dirty = 2; | |
1589 | sync_sbs(mddev); | |
1590 | ||
1591 | /* | |
1592 | * do not write anything to disk if using | |
1593 | * nonpersistent superblocks | |
1594 | */ | |
1595 | if (!mddev->persistent) { | |
1596 | mddev->sb_dirty = 0; | |
1597 | spin_unlock_irq(&mddev->write_lock); | |
1598 | wake_up(&mddev->sb_wait); | |
1599 | return; | |
1600 | } | |
1601 | spin_unlock_irq(&mddev->write_lock); | |
1602 | ||
1603 | dprintk(KERN_INFO | |
1604 | "md: updating %s RAID superblock on device (in sync %d)\n", | |
1605 | mdname(mddev),mddev->in_sync); | |
1606 | ||
1607 | err = bitmap_update_sb(mddev->bitmap); | |
1608 | ITERATE_RDEV(mddev,rdev,tmp) { | |
1609 | char b[BDEVNAME_SIZE]; | |
1610 | dprintk(KERN_INFO "md: "); | |
1611 | if (test_bit(Faulty, &rdev->flags)) | |
1612 | dprintk("(skipping faulty "); | |
1613 | ||
1614 | dprintk("%s ", bdevname(rdev->bdev,b)); | |
1615 | if (!test_bit(Faulty, &rdev->flags)) { | |
1616 | md_super_write(mddev,rdev, | |
1617 | rdev->sb_offset<<1, rdev->sb_size, | |
1618 | rdev->sb_page); | |
1619 | dprintk(KERN_INFO "(write) %s's sb offset: %llu\n", | |
1620 | bdevname(rdev->bdev,b), | |
1621 | (unsigned long long)rdev->sb_offset); | |
1622 | ||
1623 | } else | |
1624 | dprintk(")\n"); | |
1625 | if (mddev->level == LEVEL_MULTIPATH) | |
1626 | /* only need to write one superblock... */ | |
1627 | break; | |
1628 | } | |
1629 | md_super_wait(mddev); | |
1630 | /* if there was a failure, sb_dirty was set to 1, and we re-write super */ | |
1631 | ||
1632 | spin_lock_irq(&mddev->write_lock); | |
1633 | if (mddev->in_sync != sync_req|| mddev->sb_dirty == 1) { | |
1634 | /* have to write it out again */ | |
1635 | spin_unlock_irq(&mddev->write_lock); | |
1636 | goto repeat; | |
1637 | } | |
1638 | mddev->sb_dirty = 0; | |
1639 | spin_unlock_irq(&mddev->write_lock); | |
1640 | wake_up(&mddev->sb_wait); | |
1641 | ||
1642 | } | |
1643 | EXPORT_SYMBOL_GPL(md_update_sb); | |
1644 | ||
1645 | /* words written to sysfs files may, or my not, be \n terminated. | |
1646 | * We want to accept with case. For this we use cmd_match. | |
1647 | */ | |
1648 | static int cmd_match(const char *cmd, const char *str) | |
1649 | { | |
1650 | /* See if cmd, written into a sysfs file, matches | |
1651 | * str. They must either be the same, or cmd can | |
1652 | * have a trailing newline | |
1653 | */ | |
1654 | while (*cmd && *str && *cmd == *str) { | |
1655 | cmd++; | |
1656 | str++; | |
1657 | } | |
1658 | if (*cmd == '\n') | |
1659 | cmd++; | |
1660 | if (*str || *cmd) | |
1661 | return 0; | |
1662 | return 1; | |
1663 | } | |
1664 | ||
1665 | struct rdev_sysfs_entry { | |
1666 | struct attribute attr; | |
1667 | ssize_t (*show)(mdk_rdev_t *, char *); | |
1668 | ssize_t (*store)(mdk_rdev_t *, const char *, size_t); | |
1669 | }; | |
1670 | ||
1671 | static ssize_t | |
1672 | state_show(mdk_rdev_t *rdev, char *page) | |
1673 | { | |
1674 | char *sep = ""; | |
1675 | int len=0; | |
1676 | ||
1677 | if (test_bit(Faulty, &rdev->flags)) { | |
1678 | len+= sprintf(page+len, "%sfaulty",sep); | |
1679 | sep = ","; | |
1680 | } | |
1681 | if (test_bit(In_sync, &rdev->flags)) { | |
1682 | len += sprintf(page+len, "%sin_sync",sep); | |
1683 | sep = ","; | |
1684 | } | |
1685 | if (!test_bit(Faulty, &rdev->flags) && | |
1686 | !test_bit(In_sync, &rdev->flags)) { | |
1687 | len += sprintf(page+len, "%sspare", sep); | |
1688 | sep = ","; | |
1689 | } | |
1690 | return len+sprintf(page+len, "\n"); | |
1691 | } | |
1692 | ||
1693 | static struct rdev_sysfs_entry | |
1694 | rdev_state = __ATTR_RO(state); | |
1695 | ||
1696 | static ssize_t | |
1697 | super_show(mdk_rdev_t *rdev, char *page) | |
1698 | { | |
1699 | if (rdev->sb_loaded && rdev->sb_size) { | |
1700 | memcpy(page, page_address(rdev->sb_page), rdev->sb_size); | |
1701 | return rdev->sb_size; | |
1702 | } else | |
1703 | return 0; | |
1704 | } | |
1705 | static struct rdev_sysfs_entry rdev_super = __ATTR_RO(super); | |
1706 | ||
1707 | static ssize_t | |
1708 | errors_show(mdk_rdev_t *rdev, char *page) | |
1709 | { | |
1710 | return sprintf(page, "%d\n", atomic_read(&rdev->corrected_errors)); | |
1711 | } | |
1712 | ||
1713 | static ssize_t | |
1714 | errors_store(mdk_rdev_t *rdev, const char *buf, size_t len) | |
1715 | { | |
1716 | char *e; | |
1717 | unsigned long n = simple_strtoul(buf, &e, 10); | |
1718 | if (*buf && (*e == 0 || *e == '\n')) { | |
1719 | atomic_set(&rdev->corrected_errors, n); | |
1720 | return len; | |
1721 | } | |
1722 | return -EINVAL; | |
1723 | } | |
1724 | static struct rdev_sysfs_entry rdev_errors = | |
1725 | __ATTR(errors, 0644, errors_show, errors_store); | |
1726 | ||
1727 | static ssize_t | |
1728 | slot_show(mdk_rdev_t *rdev, char *page) | |
1729 | { | |
1730 | if (rdev->raid_disk < 0) | |
1731 | return sprintf(page, "none\n"); | |
1732 | else | |
1733 | return sprintf(page, "%d\n", rdev->raid_disk); | |
1734 | } | |
1735 | ||
1736 | static ssize_t | |
1737 | slot_store(mdk_rdev_t *rdev, const char *buf, size_t len) | |
1738 | { | |
1739 | char *e; | |
1740 | int slot = simple_strtoul(buf, &e, 10); | |
1741 | if (strncmp(buf, "none", 4)==0) | |
1742 | slot = -1; | |
1743 | else if (e==buf || (*e && *e!= '\n')) | |
1744 | return -EINVAL; | |
1745 | if (rdev->mddev->pers) | |
1746 | /* Cannot set slot in active array (yet) */ | |
1747 | return -EBUSY; | |
1748 | if (slot >= rdev->mddev->raid_disks) | |
1749 | return -ENOSPC; | |
1750 | rdev->raid_disk = slot; | |
1751 | /* assume it is working */ | |
1752 | rdev->flags = 0; | |
1753 | set_bit(In_sync, &rdev->flags); | |
1754 | return len; | |
1755 | } | |
1756 | ||
1757 | ||
1758 | static struct rdev_sysfs_entry rdev_slot = | |
1759 | __ATTR(slot, 0644, slot_show, slot_store); | |
1760 | ||
1761 | static ssize_t | |
1762 | offset_show(mdk_rdev_t *rdev, char *page) | |
1763 | { | |
1764 | return sprintf(page, "%llu\n", (unsigned long long)rdev->data_offset); | |
1765 | } | |
1766 | ||
1767 | static ssize_t | |
1768 | offset_store(mdk_rdev_t *rdev, const char *buf, size_t len) | |
1769 | { | |
1770 | char *e; | |
1771 | unsigned long long offset = simple_strtoull(buf, &e, 10); | |
1772 | if (e==buf || (*e && *e != '\n')) | |
1773 | return -EINVAL; | |
1774 | if (rdev->mddev->pers) | |
1775 | return -EBUSY; | |
1776 | rdev->data_offset = offset; | |
1777 | return len; | |
1778 | } | |
1779 | ||
1780 | static struct rdev_sysfs_entry rdev_offset = | |
1781 | __ATTR(offset, 0644, offset_show, offset_store); | |
1782 | ||
1783 | static ssize_t | |
1784 | rdev_size_show(mdk_rdev_t *rdev, char *page) | |
1785 | { | |
1786 | return sprintf(page, "%llu\n", (unsigned long long)rdev->size); | |
1787 | } | |
1788 | ||
1789 | static ssize_t | |
1790 | rdev_size_store(mdk_rdev_t *rdev, const char *buf, size_t len) | |
1791 | { | |
1792 | char *e; | |
1793 | unsigned long long size = simple_strtoull(buf, &e, 10); | |
1794 | if (e==buf || (*e && *e != '\n')) | |
1795 | return -EINVAL; | |
1796 | if (rdev->mddev->pers) | |
1797 | return -EBUSY; | |
1798 | rdev->size = size; | |
1799 | if (size < rdev->mddev->size || rdev->mddev->size == 0) | |
1800 | rdev->mddev->size = size; | |
1801 | return len; | |
1802 | } | |
1803 | ||
1804 | static struct rdev_sysfs_entry rdev_size = | |
1805 | __ATTR(size, 0644, rdev_size_show, rdev_size_store); | |
1806 | ||
1807 | static struct attribute *rdev_default_attrs[] = { | |
1808 | &rdev_state.attr, | |
1809 | &rdev_super.attr, | |
1810 | &rdev_errors.attr, | |
1811 | &rdev_slot.attr, | |
1812 | &rdev_offset.attr, | |
1813 | &rdev_size.attr, | |
1814 | NULL, | |
1815 | }; | |
1816 | static ssize_t | |
1817 | rdev_attr_show(struct kobject *kobj, struct attribute *attr, char *page) | |
1818 | { | |
1819 | struct rdev_sysfs_entry *entry = container_of(attr, struct rdev_sysfs_entry, attr); | |
1820 | mdk_rdev_t *rdev = container_of(kobj, mdk_rdev_t, kobj); | |
1821 | ||
1822 | if (!entry->show) | |
1823 | return -EIO; | |
1824 | return entry->show(rdev, page); | |
1825 | } | |
1826 | ||
1827 | static ssize_t | |
1828 | rdev_attr_store(struct kobject *kobj, struct attribute *attr, | |
1829 | const char *page, size_t length) | |
1830 | { | |
1831 | struct rdev_sysfs_entry *entry = container_of(attr, struct rdev_sysfs_entry, attr); | |
1832 | mdk_rdev_t *rdev = container_of(kobj, mdk_rdev_t, kobj); | |
1833 | ||
1834 | if (!entry->store) | |
1835 | return -EIO; | |
1836 | return entry->store(rdev, page, length); | |
1837 | } | |
1838 | ||
1839 | static void rdev_free(struct kobject *ko) | |
1840 | { | |
1841 | mdk_rdev_t *rdev = container_of(ko, mdk_rdev_t, kobj); | |
1842 | kfree(rdev); | |
1843 | } | |
1844 | static struct sysfs_ops rdev_sysfs_ops = { | |
1845 | .show = rdev_attr_show, | |
1846 | .store = rdev_attr_store, | |
1847 | }; | |
1848 | static struct kobj_type rdev_ktype = { | |
1849 | .release = rdev_free, | |
1850 | .sysfs_ops = &rdev_sysfs_ops, | |
1851 | .default_attrs = rdev_default_attrs, | |
1852 | }; | |
1853 | ||
1854 | /* | |
1855 | * Import a device. If 'super_format' >= 0, then sanity check the superblock | |
1856 | * | |
1857 | * mark the device faulty if: | |
1858 | * | |
1859 | * - the device is nonexistent (zero size) | |
1860 | * - the device has no valid superblock | |
1861 | * | |
1862 | * a faulty rdev _never_ has rdev->sb set. | |
1863 | */ | |
1864 | static mdk_rdev_t *md_import_device(dev_t newdev, int super_format, int super_minor) | |
1865 | { | |
1866 | char b[BDEVNAME_SIZE]; | |
1867 | int err; | |
1868 | mdk_rdev_t *rdev; | |
1869 | sector_t size; | |
1870 | ||
1871 | rdev = kzalloc(sizeof(*rdev), GFP_KERNEL); | |
1872 | if (!rdev) { | |
1873 | printk(KERN_ERR "md: could not alloc mem for new device!\n"); | |
1874 | return ERR_PTR(-ENOMEM); | |
1875 | } | |
1876 | ||
1877 | if ((err = alloc_disk_sb(rdev))) | |
1878 | goto abort_free; | |
1879 | ||
1880 | err = lock_rdev(rdev, newdev); | |
1881 | if (err) | |
1882 | goto abort_free; | |
1883 | ||
1884 | rdev->kobj.parent = NULL; | |
1885 | rdev->kobj.ktype = &rdev_ktype; | |
1886 | kobject_init(&rdev->kobj); | |
1887 | ||
1888 | rdev->desc_nr = -1; | |
1889 | rdev->flags = 0; | |
1890 | rdev->data_offset = 0; | |
1891 | atomic_set(&rdev->nr_pending, 0); | |
1892 | atomic_set(&rdev->read_errors, 0); | |
1893 | atomic_set(&rdev->corrected_errors, 0); | |
1894 | ||
1895 | size = rdev->bdev->bd_inode->i_size >> BLOCK_SIZE_BITS; | |
1896 | if (!size) { | |
1897 | printk(KERN_WARNING | |
1898 | "md: %s has zero or unknown size, marking faulty!\n", | |
1899 | bdevname(rdev->bdev,b)); | |
1900 | err = -EINVAL; | |
1901 | goto abort_free; | |
1902 | } | |
1903 | ||
1904 | if (super_format >= 0) { | |
1905 | err = super_types[super_format]. | |
1906 | load_super(rdev, NULL, super_minor); | |
1907 | if (err == -EINVAL) { | |
1908 | printk(KERN_WARNING | |
1909 | "md: %s has invalid sb, not importing!\n", | |
1910 | bdevname(rdev->bdev,b)); | |
1911 | goto abort_free; | |
1912 | } | |
1913 | if (err < 0) { | |
1914 | printk(KERN_WARNING | |
1915 | "md: could not read %s's sb, not importing!\n", | |
1916 | bdevname(rdev->bdev,b)); | |
1917 | goto abort_free; | |
1918 | } | |
1919 | } | |
1920 | INIT_LIST_HEAD(&rdev->same_set); | |
1921 | ||
1922 | return rdev; | |
1923 | ||
1924 | abort_free: | |
1925 | if (rdev->sb_page) { | |
1926 | if (rdev->bdev) | |
1927 | unlock_rdev(rdev); | |
1928 | free_disk_sb(rdev); | |
1929 | } | |
1930 | kfree(rdev); | |
1931 | return ERR_PTR(err); | |
1932 | } | |
1933 | ||
1934 | /* | |
1935 | * Check a full RAID array for plausibility | |
1936 | */ | |
1937 | ||
1938 | ||
1939 | static void analyze_sbs(mddev_t * mddev) | |
1940 | { | |
1941 | int i; | |
1942 | struct list_head *tmp; | |
1943 | mdk_rdev_t *rdev, *freshest; | |
1944 | char b[BDEVNAME_SIZE]; | |
1945 | ||
1946 | freshest = NULL; | |
1947 | ITERATE_RDEV(mddev,rdev,tmp) | |
1948 | switch (super_types[mddev->major_version]. | |
1949 | load_super(rdev, freshest, mddev->minor_version)) { | |
1950 | case 1: | |
1951 | freshest = rdev; | |
1952 | break; | |
1953 | case 0: | |
1954 | break; | |
1955 | default: | |
1956 | printk( KERN_ERR \ | |
1957 | "md: fatal superblock inconsistency in %s" | |
1958 | " -- removing from array\n", | |
1959 | bdevname(rdev->bdev,b)); | |
1960 | kick_rdev_from_array(rdev); | |
1961 | } | |
1962 | ||
1963 | ||
1964 | super_types[mddev->major_version]. | |
1965 | validate_super(mddev, freshest); | |
1966 | ||
1967 | i = 0; | |
1968 | ITERATE_RDEV(mddev,rdev,tmp) { | |
1969 | if (rdev != freshest) | |
1970 | if (super_types[mddev->major_version]. | |
1971 | validate_super(mddev, rdev)) { | |
1972 | printk(KERN_WARNING "md: kicking non-fresh %s" | |
1973 | " from array!\n", | |
1974 | bdevname(rdev->bdev,b)); | |
1975 | kick_rdev_from_array(rdev); | |
1976 | continue; | |
1977 | } | |
1978 | if (mddev->level == LEVEL_MULTIPATH) { | |
1979 | rdev->desc_nr = i++; | |
1980 | rdev->raid_disk = rdev->desc_nr; | |
1981 | set_bit(In_sync, &rdev->flags); | |
1982 | } | |
1983 | } | |
1984 | ||
1985 | ||
1986 | ||
1987 | if (mddev->recovery_cp != MaxSector && | |
1988 | mddev->level >= 1) | |
1989 | printk(KERN_ERR "md: %s: raid array is not clean" | |
1990 | " -- starting background reconstruction\n", | |
1991 | mdname(mddev)); | |
1992 | ||
1993 | } | |
1994 | ||
1995 | static ssize_t | |
1996 | safe_delay_show(mddev_t *mddev, char *page) | |
1997 | { | |
1998 | int msec = (mddev->safemode_delay*1000)/HZ; | |
1999 | return sprintf(page, "%d.%03d\n", msec/1000, msec%1000); | |
2000 | } | |
2001 | static ssize_t | |
2002 | safe_delay_store(mddev_t *mddev, const char *cbuf, size_t len) | |
2003 | { | |
2004 | int scale=1; | |
2005 | int dot=0; | |
2006 | int i; | |
2007 | unsigned long msec; | |
2008 | char buf[30]; | |
2009 | char *e; | |
2010 | /* remove a period, and count digits after it */ | |
2011 | if (len >= sizeof(buf)) | |
2012 | return -EINVAL; | |
2013 | strlcpy(buf, cbuf, len); | |
2014 | buf[len] = 0; | |
2015 | for (i=0; i<len; i++) { | |
2016 | if (dot) { | |
2017 | if (isdigit(buf[i])) { | |
2018 | buf[i-1] = buf[i]; | |
2019 | scale *= 10; | |
2020 | } | |
2021 | buf[i] = 0; | |
2022 | } else if (buf[i] == '.') { | |
2023 | dot=1; | |
2024 | buf[i] = 0; | |
2025 | } | |
2026 | } | |
2027 | msec = simple_strtoul(buf, &e, 10); | |
2028 | if (e == buf || (*e && *e != '\n')) | |
2029 | return -EINVAL; | |
2030 | msec = (msec * 1000) / scale; | |
2031 | if (msec == 0) | |
2032 | mddev->safemode_delay = 0; | |
2033 | else { | |
2034 | mddev->safemode_delay = (msec*HZ)/1000; | |
2035 | if (mddev->safemode_delay == 0) | |
2036 | mddev->safemode_delay = 1; | |
2037 | } | |
2038 | return len; | |
2039 | } | |
2040 | static struct md_sysfs_entry md_safe_delay = | |
2041 | __ATTR(safe_mode_delay, 0644,safe_delay_show, safe_delay_store); | |
2042 | ||
2043 | static ssize_t | |
2044 | level_show(mddev_t *mddev, char *page) | |
2045 | { | |
2046 | struct mdk_personality *p = mddev->pers; | |
2047 | if (p) | |
2048 | return sprintf(page, "%s\n", p->name); | |
2049 | else if (mddev->clevel[0]) | |
2050 | return sprintf(page, "%s\n", mddev->clevel); | |
2051 | else if (mddev->level != LEVEL_NONE) | |
2052 | return sprintf(page, "%d\n", mddev->level); | |
2053 | else | |
2054 | return 0; | |
2055 | } | |
2056 | ||
2057 | static ssize_t | |
2058 | level_store(mddev_t *mddev, const char *buf, size_t len) | |
2059 | { | |
2060 | int rv = len; | |
2061 | if (mddev->pers) | |
2062 | return -EBUSY; | |
2063 | if (len == 0) | |
2064 | return 0; | |
2065 | if (len >= sizeof(mddev->clevel)) | |
2066 | return -ENOSPC; | |
2067 | strncpy(mddev->clevel, buf, len); | |
2068 | if (mddev->clevel[len-1] == '\n') | |
2069 | len--; | |
2070 | mddev->clevel[len] = 0; | |
2071 | mddev->level = LEVEL_NONE; | |
2072 | return rv; | |
2073 | } | |
2074 | ||
2075 | static struct md_sysfs_entry md_level = | |
2076 | __ATTR(level, 0644, level_show, level_store); | |
2077 | ||
2078 | static ssize_t | |
2079 | raid_disks_show(mddev_t *mddev, char *page) | |
2080 | { | |
2081 | if (mddev->raid_disks == 0) | |
2082 | return 0; | |
2083 | return sprintf(page, "%d\n", mddev->raid_disks); | |
2084 | } | |
2085 | ||
2086 | static int update_raid_disks(mddev_t *mddev, int raid_disks); | |
2087 | ||
2088 | static ssize_t | |
2089 | raid_disks_store(mddev_t *mddev, const char *buf, size_t len) | |
2090 | { | |
2091 | /* can only set raid_disks if array is not yet active */ | |
2092 | char *e; | |
2093 | int rv = 0; | |
2094 | unsigned long n = simple_strtoul(buf, &e, 10); | |
2095 | ||
2096 | if (!*buf || (*e && *e != '\n')) | |
2097 | return -EINVAL; | |
2098 | ||
2099 | if (mddev->pers) | |
2100 | rv = update_raid_disks(mddev, n); | |
2101 | else | |
2102 | mddev->raid_disks = n; | |
2103 | return rv ? rv : len; | |
2104 | } | |
2105 | static struct md_sysfs_entry md_raid_disks = | |
2106 | __ATTR(raid_disks, 0644, raid_disks_show, raid_disks_store); | |
2107 | ||
2108 | static ssize_t | |
2109 | chunk_size_show(mddev_t *mddev, char *page) | |
2110 | { | |
2111 | return sprintf(page, "%d\n", mddev->chunk_size); | |
2112 | } | |
2113 | ||
2114 | static ssize_t | |
2115 | chunk_size_store(mddev_t *mddev, const char *buf, size_t len) | |
2116 | { | |
2117 | /* can only set chunk_size if array is not yet active */ | |
2118 | char *e; | |
2119 | unsigned long n = simple_strtoul(buf, &e, 10); | |
2120 | ||
2121 | if (mddev->pers) | |
2122 | return -EBUSY; | |
2123 | if (!*buf || (*e && *e != '\n')) | |
2124 | return -EINVAL; | |
2125 | ||
2126 | mddev->chunk_size = n; | |
2127 | return len; | |
2128 | } | |
2129 | static struct md_sysfs_entry md_chunk_size = | |
2130 | __ATTR(chunk_size, 0644, chunk_size_show, chunk_size_store); | |
2131 | ||
2132 | static ssize_t | |
2133 | null_show(mddev_t *mddev, char *page) | |
2134 | { | |
2135 | return -EINVAL; | |
2136 | } | |
2137 | ||
2138 | static ssize_t | |
2139 | new_dev_store(mddev_t *mddev, const char *buf, size_t len) | |
2140 | { | |
2141 | /* buf must be %d:%d\n? giving major and minor numbers */ | |
2142 | /* The new device is added to the array. | |
2143 | * If the array has a persistent superblock, we read the | |
2144 | * superblock to initialise info and check validity. | |
2145 | * Otherwise, only checking done is that in bind_rdev_to_array, | |
2146 | * which mainly checks size. | |
2147 | */ | |
2148 | char *e; | |
2149 | int major = simple_strtoul(buf, &e, 10); | |
2150 | int minor; | |
2151 | dev_t dev; | |
2152 | mdk_rdev_t *rdev; | |
2153 | int err; | |
2154 | ||
2155 | if (!*buf || *e != ':' || !e[1] || e[1] == '\n') | |
2156 | return -EINVAL; | |
2157 | minor = simple_strtoul(e+1, &e, 10); | |
2158 | if (*e && *e != '\n') | |
2159 | return -EINVAL; | |
2160 | dev = MKDEV(major, minor); | |
2161 | if (major != MAJOR(dev) || | |
2162 | minor != MINOR(dev)) | |
2163 | return -EOVERFLOW; | |
2164 | ||
2165 | ||
2166 | if (mddev->persistent) { | |
2167 | rdev = md_import_device(dev, mddev->major_version, | |
2168 | mddev->minor_version); | |
2169 | if (!IS_ERR(rdev) && !list_empty(&mddev->disks)) { | |
2170 | mdk_rdev_t *rdev0 = list_entry(mddev->disks.next, | |
2171 | mdk_rdev_t, same_set); | |
2172 | err = super_types[mddev->major_version] | |
2173 | .load_super(rdev, rdev0, mddev->minor_version); | |
2174 | if (err < 0) | |
2175 | goto out; | |
2176 | } | |
2177 | } else | |
2178 | rdev = md_import_device(dev, -1, -1); | |
2179 | ||
2180 | if (IS_ERR(rdev)) | |
2181 | return PTR_ERR(rdev); | |
2182 | err = bind_rdev_to_array(rdev, mddev); | |
2183 | out: | |
2184 | if (err) | |
2185 | export_rdev(rdev); | |
2186 | return err ? err : len; | |
2187 | } | |
2188 | ||
2189 | static struct md_sysfs_entry md_new_device = | |
2190 | __ATTR(new_dev, 0200, null_show, new_dev_store); | |
2191 | ||
2192 | static ssize_t | |
2193 | size_show(mddev_t *mddev, char *page) | |
2194 | { | |
2195 | return sprintf(page, "%llu\n", (unsigned long long)mddev->size); | |
2196 | } | |
2197 | ||
2198 | static int update_size(mddev_t *mddev, unsigned long size); | |
2199 | ||
2200 | static ssize_t | |
2201 | size_store(mddev_t *mddev, const char *buf, size_t len) | |
2202 | { | |
2203 | /* If array is inactive, we can reduce the component size, but | |
2204 | * not increase it (except from 0). | |
2205 | * If array is active, we can try an on-line resize | |
2206 | */ | |
2207 | char *e; | |
2208 | int err = 0; | |
2209 | unsigned long long size = simple_strtoull(buf, &e, 10); | |
2210 | if (!*buf || *buf == '\n' || | |
2211 | (*e && *e != '\n')) | |
2212 | return -EINVAL; | |
2213 | ||
2214 | if (mddev->pers) { | |
2215 | err = update_size(mddev, size); | |
2216 | md_update_sb(mddev); | |
2217 | } else { | |
2218 | if (mddev->size == 0 || | |
2219 | mddev->size > size) | |
2220 | mddev->size = size; | |
2221 | else | |
2222 | err = -ENOSPC; | |
2223 | } | |
2224 | return err ? err : len; | |
2225 | } | |
2226 | ||
2227 | static struct md_sysfs_entry md_size = | |
2228 | __ATTR(component_size, 0644, size_show, size_store); | |
2229 | ||
2230 | ||
2231 | /* Metdata version. | |
2232 | * This is either 'none' for arrays with externally managed metadata, | |
2233 | * or N.M for internally known formats | |
2234 | */ | |
2235 | static ssize_t | |
2236 | metadata_show(mddev_t *mddev, char *page) | |
2237 | { | |
2238 | if (mddev->persistent) | |
2239 | return sprintf(page, "%d.%d\n", | |
2240 | mddev->major_version, mddev->minor_version); | |
2241 | else | |
2242 | return sprintf(page, "none\n"); | |
2243 | } | |
2244 | ||
2245 | static ssize_t | |
2246 | metadata_store(mddev_t *mddev, const char *buf, size_t len) | |
2247 | { | |
2248 | int major, minor; | |
2249 | char *e; | |
2250 | if (!list_empty(&mddev->disks)) | |
2251 | return -EBUSY; | |
2252 | ||
2253 | if (cmd_match(buf, "none")) { | |
2254 | mddev->persistent = 0; | |
2255 | mddev->major_version = 0; | |
2256 | mddev->minor_version = 90; | |
2257 | return len; | |
2258 | } | |
2259 | major = simple_strtoul(buf, &e, 10); | |
2260 | if (e==buf || *e != '.') | |
2261 | return -EINVAL; | |
2262 | buf = e+1; | |
2263 | minor = simple_strtoul(buf, &e, 10); | |
2264 | if (e==buf || *e != '\n') | |
2265 | return -EINVAL; | |
2266 | if (major >= sizeof(super_types)/sizeof(super_types[0]) || | |
2267 | super_types[major].name == NULL) | |
2268 | return -ENOENT; | |
2269 | mddev->major_version = major; | |
2270 | mddev->minor_version = minor; | |
2271 | mddev->persistent = 1; | |
2272 | return len; | |
2273 | } | |
2274 | ||
2275 | static struct md_sysfs_entry md_metadata = | |
2276 | __ATTR(metadata_version, 0644, metadata_show, metadata_store); | |
2277 | ||
2278 | static ssize_t | |
2279 | action_show(mddev_t *mddev, char *page) | |
2280 | { | |
2281 | char *type = "idle"; | |
2282 | if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) || | |
2283 | test_bit(MD_RECOVERY_NEEDED, &mddev->recovery)) { | |
2284 | if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)) | |
2285 | type = "reshape"; | |
2286 | else if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) { | |
2287 | if (!test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery)) | |
2288 | type = "resync"; | |
2289 | else if (test_bit(MD_RECOVERY_CHECK, &mddev->recovery)) | |
2290 | type = "check"; | |
2291 | else | |
2292 | type = "repair"; | |
2293 | } else | |
2294 | type = "recover"; | |
2295 | } | |
2296 | return sprintf(page, "%s\n", type); | |
2297 | } | |
2298 | ||
2299 | static ssize_t | |
2300 | action_store(mddev_t *mddev, const char *page, size_t len) | |
2301 | { | |
2302 | if (!mddev->pers || !mddev->pers->sync_request) | |
2303 | return -EINVAL; | |
2304 | ||
2305 | if (cmd_match(page, "idle")) { | |
2306 | if (mddev->sync_thread) { | |
2307 | set_bit(MD_RECOVERY_INTR, &mddev->recovery); | |
2308 | md_unregister_thread(mddev->sync_thread); | |
2309 | mddev->sync_thread = NULL; | |
2310 | mddev->recovery = 0; | |
2311 | } | |
2312 | } else if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) || | |
2313 | test_bit(MD_RECOVERY_NEEDED, &mddev->recovery)) | |
2314 | return -EBUSY; | |
2315 | else if (cmd_match(page, "resync") || cmd_match(page, "recover")) | |
2316 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
2317 | else if (cmd_match(page, "reshape")) { | |
2318 | int err; | |
2319 | if (mddev->pers->start_reshape == NULL) | |
2320 | return -EINVAL; | |
2321 | err = mddev->pers->start_reshape(mddev); | |
2322 | if (err) | |
2323 | return err; | |
2324 | } else { | |
2325 | if (cmd_match(page, "check")) | |
2326 | set_bit(MD_RECOVERY_CHECK, &mddev->recovery); | |
2327 | else if (!cmd_match(page, "repair")) | |
2328 | return -EINVAL; | |
2329 | set_bit(MD_RECOVERY_REQUESTED, &mddev->recovery); | |
2330 | set_bit(MD_RECOVERY_SYNC, &mddev->recovery); | |
2331 | } | |
2332 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
2333 | md_wakeup_thread(mddev->thread); | |
2334 | return len; | |
2335 | } | |
2336 | ||
2337 | static ssize_t | |
2338 | mismatch_cnt_show(mddev_t *mddev, char *page) | |
2339 | { | |
2340 | return sprintf(page, "%llu\n", | |
2341 | (unsigned long long) mddev->resync_mismatches); | |
2342 | } | |
2343 | ||
2344 | static struct md_sysfs_entry | |
2345 | md_scan_mode = __ATTR(sync_action, S_IRUGO|S_IWUSR, action_show, action_store); | |
2346 | ||
2347 | ||
2348 | static struct md_sysfs_entry | |
2349 | md_mismatches = __ATTR_RO(mismatch_cnt); | |
2350 | ||
2351 | static ssize_t | |
2352 | sync_min_show(mddev_t *mddev, char *page) | |
2353 | { | |
2354 | return sprintf(page, "%d (%s)\n", speed_min(mddev), | |
2355 | mddev->sync_speed_min ? "local": "system"); | |
2356 | } | |
2357 | ||
2358 | static ssize_t | |
2359 | sync_min_store(mddev_t *mddev, const char *buf, size_t len) | |
2360 | { | |
2361 | int min; | |
2362 | char *e; | |
2363 | if (strncmp(buf, "system", 6)==0) { | |
2364 | mddev->sync_speed_min = 0; | |
2365 | return len; | |
2366 | } | |
2367 | min = simple_strtoul(buf, &e, 10); | |
2368 | if (buf == e || (*e && *e != '\n') || min <= 0) | |
2369 | return -EINVAL; | |
2370 | mddev->sync_speed_min = min; | |
2371 | return len; | |
2372 | } | |
2373 | ||
2374 | static struct md_sysfs_entry md_sync_min = | |
2375 | __ATTR(sync_speed_min, S_IRUGO|S_IWUSR, sync_min_show, sync_min_store); | |
2376 | ||
2377 | static ssize_t | |
2378 | sync_max_show(mddev_t *mddev, char *page) | |
2379 | { | |
2380 | return sprintf(page, "%d (%s)\n", speed_max(mddev), | |
2381 | mddev->sync_speed_max ? "local": "system"); | |
2382 | } | |
2383 | ||
2384 | static ssize_t | |
2385 | sync_max_store(mddev_t *mddev, const char *buf, size_t len) | |
2386 | { | |
2387 | int max; | |
2388 | char *e; | |
2389 | if (strncmp(buf, "system", 6)==0) { | |
2390 | mddev->sync_speed_max = 0; | |
2391 | return len; | |
2392 | } | |
2393 | max = simple_strtoul(buf, &e, 10); | |
2394 | if (buf == e || (*e && *e != '\n') || max <= 0) | |
2395 | return -EINVAL; | |
2396 | mddev->sync_speed_max = max; | |
2397 | return len; | |
2398 | } | |
2399 | ||
2400 | static struct md_sysfs_entry md_sync_max = | |
2401 | __ATTR(sync_speed_max, S_IRUGO|S_IWUSR, sync_max_show, sync_max_store); | |
2402 | ||
2403 | ||
2404 | static ssize_t | |
2405 | sync_speed_show(mddev_t *mddev, char *page) | |
2406 | { | |
2407 | unsigned long resync, dt, db; | |
2408 | resync = (mddev->curr_resync - atomic_read(&mddev->recovery_active)); | |
2409 | dt = ((jiffies - mddev->resync_mark) / HZ); | |
2410 | if (!dt) dt++; | |
2411 | db = resync - (mddev->resync_mark_cnt); | |
2412 | return sprintf(page, "%ld\n", db/dt/2); /* K/sec */ | |
2413 | } | |
2414 | ||
2415 | static struct md_sysfs_entry | |
2416 | md_sync_speed = __ATTR_RO(sync_speed); | |
2417 | ||
2418 | static ssize_t | |
2419 | sync_completed_show(mddev_t *mddev, char *page) | |
2420 | { | |
2421 | unsigned long max_blocks, resync; | |
2422 | ||
2423 | if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) | |
2424 | max_blocks = mddev->resync_max_sectors; | |
2425 | else | |
2426 | max_blocks = mddev->size << 1; | |
2427 | ||
2428 | resync = (mddev->curr_resync - atomic_read(&mddev->recovery_active)); | |
2429 | return sprintf(page, "%lu / %lu\n", resync, max_blocks); | |
2430 | } | |
2431 | ||
2432 | static struct md_sysfs_entry | |
2433 | md_sync_completed = __ATTR_RO(sync_completed); | |
2434 | ||
2435 | static ssize_t | |
2436 | suspend_lo_show(mddev_t *mddev, char *page) | |
2437 | { | |
2438 | return sprintf(page, "%llu\n", (unsigned long long)mddev->suspend_lo); | |
2439 | } | |
2440 | ||
2441 | static ssize_t | |
2442 | suspend_lo_store(mddev_t *mddev, const char *buf, size_t len) | |
2443 | { | |
2444 | char *e; | |
2445 | unsigned long long new = simple_strtoull(buf, &e, 10); | |
2446 | ||
2447 | if (mddev->pers->quiesce == NULL) | |
2448 | return -EINVAL; | |
2449 | if (buf == e || (*e && *e != '\n')) | |
2450 | return -EINVAL; | |
2451 | if (new >= mddev->suspend_hi || | |
2452 | (new > mddev->suspend_lo && new < mddev->suspend_hi)) { | |
2453 | mddev->suspend_lo = new; | |
2454 | mddev->pers->quiesce(mddev, 2); | |
2455 | return len; | |
2456 | } else | |
2457 | return -EINVAL; | |
2458 | } | |
2459 | static struct md_sysfs_entry md_suspend_lo = | |
2460 | __ATTR(suspend_lo, S_IRUGO|S_IWUSR, suspend_lo_show, suspend_lo_store); | |
2461 | ||
2462 | ||
2463 | static ssize_t | |
2464 | suspend_hi_show(mddev_t *mddev, char *page) | |
2465 | { | |
2466 | return sprintf(page, "%llu\n", (unsigned long long)mddev->suspend_hi); | |
2467 | } | |
2468 | ||
2469 | static ssize_t | |
2470 | suspend_hi_store(mddev_t *mddev, const char *buf, size_t len) | |
2471 | { | |
2472 | char *e; | |
2473 | unsigned long long new = simple_strtoull(buf, &e, 10); | |
2474 | ||
2475 | if (mddev->pers->quiesce == NULL) | |
2476 | return -EINVAL; | |
2477 | if (buf == e || (*e && *e != '\n')) | |
2478 | return -EINVAL; | |
2479 | if ((new <= mddev->suspend_lo && mddev->suspend_lo >= mddev->suspend_hi) || | |
2480 | (new > mddev->suspend_lo && new > mddev->suspend_hi)) { | |
2481 | mddev->suspend_hi = new; | |
2482 | mddev->pers->quiesce(mddev, 1); | |
2483 | mddev->pers->quiesce(mddev, 0); | |
2484 | return len; | |
2485 | } else | |
2486 | return -EINVAL; | |
2487 | } | |
2488 | static struct md_sysfs_entry md_suspend_hi = | |
2489 | __ATTR(suspend_hi, S_IRUGO|S_IWUSR, suspend_hi_show, suspend_hi_store); | |
2490 | ||
2491 | ||
2492 | static struct attribute *md_default_attrs[] = { | |
2493 | &md_level.attr, | |
2494 | &md_raid_disks.attr, | |
2495 | &md_chunk_size.attr, | |
2496 | &md_size.attr, | |
2497 | &md_metadata.attr, | |
2498 | &md_new_device.attr, | |
2499 | &md_safe_delay.attr, | |
2500 | NULL, | |
2501 | }; | |
2502 | ||
2503 | static struct attribute *md_redundancy_attrs[] = { | |
2504 | &md_scan_mode.attr, | |
2505 | &md_mismatches.attr, | |
2506 | &md_sync_min.attr, | |
2507 | &md_sync_max.attr, | |
2508 | &md_sync_speed.attr, | |
2509 | &md_sync_completed.attr, | |
2510 | &md_suspend_lo.attr, | |
2511 | &md_suspend_hi.attr, | |
2512 | NULL, | |
2513 | }; | |
2514 | static struct attribute_group md_redundancy_group = { | |
2515 | .name = NULL, | |
2516 | .attrs = md_redundancy_attrs, | |
2517 | }; | |
2518 | ||
2519 | ||
2520 | static ssize_t | |
2521 | md_attr_show(struct kobject *kobj, struct attribute *attr, char *page) | |
2522 | { | |
2523 | struct md_sysfs_entry *entry = container_of(attr, struct md_sysfs_entry, attr); | |
2524 | mddev_t *mddev = container_of(kobj, struct mddev_s, kobj); | |
2525 | ssize_t rv; | |
2526 | ||
2527 | if (!entry->show) | |
2528 | return -EIO; | |
2529 | rv = mddev_lock(mddev); | |
2530 | if (!rv) { | |
2531 | rv = entry->show(mddev, page); | |
2532 | mddev_unlock(mddev); | |
2533 | } | |
2534 | return rv; | |
2535 | } | |
2536 | ||
2537 | static ssize_t | |
2538 | md_attr_store(struct kobject *kobj, struct attribute *attr, | |
2539 | const char *page, size_t length) | |
2540 | { | |
2541 | struct md_sysfs_entry *entry = container_of(attr, struct md_sysfs_entry, attr); | |
2542 | mddev_t *mddev = container_of(kobj, struct mddev_s, kobj); | |
2543 | ssize_t rv; | |
2544 | ||
2545 | if (!entry->store) | |
2546 | return -EIO; | |
2547 | rv = mddev_lock(mddev); | |
2548 | if (!rv) { | |
2549 | rv = entry->store(mddev, page, length); | |
2550 | mddev_unlock(mddev); | |
2551 | } | |
2552 | return rv; | |
2553 | } | |
2554 | ||
2555 | static void md_free(struct kobject *ko) | |
2556 | { | |
2557 | mddev_t *mddev = container_of(ko, mddev_t, kobj); | |
2558 | kfree(mddev); | |
2559 | } | |
2560 | ||
2561 | static struct sysfs_ops md_sysfs_ops = { | |
2562 | .show = md_attr_show, | |
2563 | .store = md_attr_store, | |
2564 | }; | |
2565 | static struct kobj_type md_ktype = { | |
2566 | .release = md_free, | |
2567 | .sysfs_ops = &md_sysfs_ops, | |
2568 | .default_attrs = md_default_attrs, | |
2569 | }; | |
2570 | ||
2571 | int mdp_major = 0; | |
2572 | ||
2573 | static struct kobject *md_probe(dev_t dev, int *part, void *data) | |
2574 | { | |
2575 | static DEFINE_MUTEX(disks_mutex); | |
2576 | mddev_t *mddev = mddev_find(dev); | |
2577 | struct gendisk *disk; | |
2578 | int partitioned = (MAJOR(dev) != MD_MAJOR); | |
2579 | int shift = partitioned ? MdpMinorShift : 0; | |
2580 | int unit = MINOR(dev) >> shift; | |
2581 | ||
2582 | if (!mddev) | |
2583 | return NULL; | |
2584 | ||
2585 | mutex_lock(&disks_mutex); | |
2586 | if (mddev->gendisk) { | |
2587 | mutex_unlock(&disks_mutex); | |
2588 | mddev_put(mddev); | |
2589 | return NULL; | |
2590 | } | |
2591 | disk = alloc_disk(1 << shift); | |
2592 | if (!disk) { | |
2593 | mutex_unlock(&disks_mutex); | |
2594 | mddev_put(mddev); | |
2595 | return NULL; | |
2596 | } | |
2597 | disk->major = MAJOR(dev); | |
2598 | disk->first_minor = unit << shift; | |
2599 | if (partitioned) { | |
2600 | sprintf(disk->disk_name, "md_d%d", unit); | |
2601 | sprintf(disk->devfs_name, "md/d%d", unit); | |
2602 | } else { | |
2603 | sprintf(disk->disk_name, "md%d", unit); | |
2604 | sprintf(disk->devfs_name, "md/%d", unit); | |
2605 | } | |
2606 | disk->fops = &md_fops; | |
2607 | disk->private_data = mddev; | |
2608 | disk->queue = mddev->queue; | |
2609 | add_disk(disk); | |
2610 | mddev->gendisk = disk; | |
2611 | mutex_unlock(&disks_mutex); | |
2612 | mddev->kobj.parent = &disk->kobj; | |
2613 | mddev->kobj.k_name = NULL; | |
2614 | snprintf(mddev->kobj.name, KOBJ_NAME_LEN, "%s", "md"); | |
2615 | mddev->kobj.ktype = &md_ktype; | |
2616 | kobject_register(&mddev->kobj); | |
2617 | return NULL; | |
2618 | } | |
2619 | ||
2620 | static void md_safemode_timeout(unsigned long data) | |
2621 | { | |
2622 | mddev_t *mddev = (mddev_t *) data; | |
2623 | ||
2624 | mddev->safemode = 1; | |
2625 | md_wakeup_thread(mddev->thread); | |
2626 | } | |
2627 | ||
2628 | static int start_dirty_degraded; | |
2629 | ||
2630 | static int do_md_run(mddev_t * mddev) | |
2631 | { | |
2632 | int err; | |
2633 | int chunk_size; | |
2634 | struct list_head *tmp; | |
2635 | mdk_rdev_t *rdev; | |
2636 | struct gendisk *disk; | |
2637 | struct mdk_personality *pers; | |
2638 | char b[BDEVNAME_SIZE]; | |
2639 | ||
2640 | if (list_empty(&mddev->disks)) | |
2641 | /* cannot run an array with no devices.. */ | |
2642 | return -EINVAL; | |
2643 | ||
2644 | if (mddev->pers) | |
2645 | return -EBUSY; | |
2646 | ||
2647 | /* | |
2648 | * Analyze all RAID superblock(s) | |
2649 | */ | |
2650 | if (!mddev->raid_disks) | |
2651 | analyze_sbs(mddev); | |
2652 | ||
2653 | chunk_size = mddev->chunk_size; | |
2654 | ||
2655 | if (chunk_size) { | |
2656 | if (chunk_size > MAX_CHUNK_SIZE) { | |
2657 | printk(KERN_ERR "too big chunk_size: %d > %d\n", | |
2658 | chunk_size, MAX_CHUNK_SIZE); | |
2659 | return -EINVAL; | |
2660 | } | |
2661 | /* | |
2662 | * chunk-size has to be a power of 2 and multiples of PAGE_SIZE | |
2663 | */ | |
2664 | if ( (1 << ffz(~chunk_size)) != chunk_size) { | |
2665 | printk(KERN_ERR "chunk_size of %d not valid\n", chunk_size); | |
2666 | return -EINVAL; | |
2667 | } | |
2668 | if (chunk_size < PAGE_SIZE) { | |
2669 | printk(KERN_ERR "too small chunk_size: %d < %ld\n", | |
2670 | chunk_size, PAGE_SIZE); | |
2671 | return -EINVAL; | |
2672 | } | |
2673 | ||
2674 | /* devices must have minimum size of one chunk */ | |
2675 | ITERATE_RDEV(mddev,rdev,tmp) { | |
2676 | if (test_bit(Faulty, &rdev->flags)) | |
2677 | continue; | |
2678 | if (rdev->size < chunk_size / 1024) { | |
2679 | printk(KERN_WARNING | |
2680 | "md: Dev %s smaller than chunk_size:" | |
2681 | " %lluk < %dk\n", | |
2682 | bdevname(rdev->bdev,b), | |
2683 | (unsigned long long)rdev->size, | |
2684 | chunk_size / 1024); | |
2685 | return -EINVAL; | |
2686 | } | |
2687 | } | |
2688 | } | |
2689 | ||
2690 | #ifdef CONFIG_KMOD | |
2691 | if (mddev->level != LEVEL_NONE) | |
2692 | request_module("md-level-%d", mddev->level); | |
2693 | else if (mddev->clevel[0]) | |
2694 | request_module("md-%s", mddev->clevel); | |
2695 | #endif | |
2696 | ||
2697 | /* | |
2698 | * Drop all container device buffers, from now on | |
2699 | * the only valid external interface is through the md | |
2700 | * device. | |
2701 | * Also find largest hardsector size | |
2702 | */ | |
2703 | ITERATE_RDEV(mddev,rdev,tmp) { | |
2704 | if (test_bit(Faulty, &rdev->flags)) | |
2705 | continue; | |
2706 | sync_blockdev(rdev->bdev); | |
2707 | invalidate_bdev(rdev->bdev, 0); | |
2708 | } | |
2709 | ||
2710 | md_probe(mddev->unit, NULL, NULL); | |
2711 | disk = mddev->gendisk; | |
2712 | if (!disk) | |
2713 | return -ENOMEM; | |
2714 | ||
2715 | spin_lock(&pers_lock); | |
2716 | pers = find_pers(mddev->level, mddev->clevel); | |
2717 | if (!pers || !try_module_get(pers->owner)) { | |
2718 | spin_unlock(&pers_lock); | |
2719 | if (mddev->level != LEVEL_NONE) | |
2720 | printk(KERN_WARNING "md: personality for level %d is not loaded!\n", | |
2721 | mddev->level); | |
2722 | else | |
2723 | printk(KERN_WARNING "md: personality for level %s is not loaded!\n", | |
2724 | mddev->clevel); | |
2725 | return -EINVAL; | |
2726 | } | |
2727 | mddev->pers = pers; | |
2728 | spin_unlock(&pers_lock); | |
2729 | mddev->level = pers->level; | |
2730 | strlcpy(mddev->clevel, pers->name, sizeof(mddev->clevel)); | |
2731 | ||
2732 | if (mddev->reshape_position != MaxSector && | |
2733 | pers->start_reshape == NULL) { | |
2734 | /* This personality cannot handle reshaping... */ | |
2735 | mddev->pers = NULL; | |
2736 | module_put(pers->owner); | |
2737 | return -EINVAL; | |
2738 | } | |
2739 | ||
2740 | mddev->recovery = 0; | |
2741 | mddev->resync_max_sectors = mddev->size << 1; /* may be over-ridden by personality */ | |
2742 | mddev->barriers_work = 1; | |
2743 | mddev->ok_start_degraded = start_dirty_degraded; | |
2744 | ||
2745 | if (start_readonly) | |
2746 | mddev->ro = 2; /* read-only, but switch on first write */ | |
2747 | ||
2748 | err = mddev->pers->run(mddev); | |
2749 | if (!err && mddev->pers->sync_request) { | |
2750 | err = bitmap_create(mddev); | |
2751 | if (err) { | |
2752 | printk(KERN_ERR "%s: failed to create bitmap (%d)\n", | |
2753 | mdname(mddev), err); | |
2754 | mddev->pers->stop(mddev); | |
2755 | } | |
2756 | } | |
2757 | if (err) { | |
2758 | printk(KERN_ERR "md: pers->run() failed ...\n"); | |
2759 | module_put(mddev->pers->owner); | |
2760 | mddev->pers = NULL; | |
2761 | bitmap_destroy(mddev); | |
2762 | return err; | |
2763 | } | |
2764 | if (mddev->pers->sync_request) | |
2765 | sysfs_create_group(&mddev->kobj, &md_redundancy_group); | |
2766 | else if (mddev->ro == 2) /* auto-readonly not meaningful */ | |
2767 | mddev->ro = 0; | |
2768 | ||
2769 | atomic_set(&mddev->writes_pending,0); | |
2770 | mddev->safemode = 0; | |
2771 | mddev->safemode_timer.function = md_safemode_timeout; | |
2772 | mddev->safemode_timer.data = (unsigned long) mddev; | |
2773 | mddev->safemode_delay = (200 * HZ)/1000 +1; /* 200 msec delay */ | |
2774 | mddev->in_sync = 1; | |
2775 | ||
2776 | ITERATE_RDEV(mddev,rdev,tmp) | |
2777 | if (rdev->raid_disk >= 0) { | |
2778 | char nm[20]; | |
2779 | sprintf(nm, "rd%d", rdev->raid_disk); | |
2780 | sysfs_create_link(&mddev->kobj, &rdev->kobj, nm); | |
2781 | } | |
2782 | ||
2783 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
2784 | md_wakeup_thread(mddev->thread); | |
2785 | ||
2786 | if (mddev->sb_dirty) | |
2787 | md_update_sb(mddev); | |
2788 | ||
2789 | set_capacity(disk, mddev->array_size<<1); | |
2790 | ||
2791 | /* If we call blk_queue_make_request here, it will | |
2792 | * re-initialise max_sectors etc which may have been | |
2793 | * refined inside -> run. So just set the bits we need to set. | |
2794 | * Most initialisation happended when we called | |
2795 | * blk_queue_make_request(..., md_fail_request) | |
2796 | * earlier. | |
2797 | */ | |
2798 | mddev->queue->queuedata = mddev; | |
2799 | mddev->queue->make_request_fn = mddev->pers->make_request; | |
2800 | ||
2801 | /* If there is a partially-recovered drive we need to | |
2802 | * start recovery here. If we leave it to md_check_recovery, | |
2803 | * it will remove the drives and not do the right thing | |
2804 | */ | |
2805 | if (mddev->degraded) { | |
2806 | struct list_head *rtmp; | |
2807 | int spares = 0; | |
2808 | ITERATE_RDEV(mddev,rdev,rtmp) | |
2809 | if (rdev->raid_disk >= 0 && | |
2810 | !test_bit(In_sync, &rdev->flags) && | |
2811 | !test_bit(Faulty, &rdev->flags)) | |
2812 | /* complete an interrupted recovery */ | |
2813 | spares++; | |
2814 | if (spares && mddev->pers->sync_request) { | |
2815 | mddev->recovery = 0; | |
2816 | set_bit(MD_RECOVERY_RUNNING, &mddev->recovery); | |
2817 | mddev->sync_thread = md_register_thread(md_do_sync, | |
2818 | mddev, | |
2819 | "%s_resync"); | |
2820 | if (!mddev->sync_thread) { | |
2821 | printk(KERN_ERR "%s: could not start resync" | |
2822 | " thread...\n", | |
2823 | mdname(mddev)); | |
2824 | /* leave the spares where they are, it shouldn't hurt */ | |
2825 | mddev->recovery = 0; | |
2826 | } else | |
2827 | md_wakeup_thread(mddev->sync_thread); | |
2828 | } | |
2829 | } | |
2830 | ||
2831 | mddev->changed = 1; | |
2832 | md_new_event(mddev); | |
2833 | return 0; | |
2834 | } | |
2835 | ||
2836 | static int restart_array(mddev_t *mddev) | |
2837 | { | |
2838 | struct gendisk *disk = mddev->gendisk; | |
2839 | int err; | |
2840 | ||
2841 | /* | |
2842 | * Complain if it has no devices | |
2843 | */ | |
2844 | err = -ENXIO; | |
2845 | if (list_empty(&mddev->disks)) | |
2846 | goto out; | |
2847 | ||
2848 | if (mddev->pers) { | |
2849 | err = -EBUSY; | |
2850 | if (!mddev->ro) | |
2851 | goto out; | |
2852 | ||
2853 | mddev->safemode = 0; | |
2854 | mddev->ro = 0; | |
2855 | set_disk_ro(disk, 0); | |
2856 | ||
2857 | printk(KERN_INFO "md: %s switched to read-write mode.\n", | |
2858 | mdname(mddev)); | |
2859 | /* | |
2860 | * Kick recovery or resync if necessary | |
2861 | */ | |
2862 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
2863 | md_wakeup_thread(mddev->thread); | |
2864 | md_wakeup_thread(mddev->sync_thread); | |
2865 | err = 0; | |
2866 | } else { | |
2867 | printk(KERN_ERR "md: %s has no personality assigned.\n", | |
2868 | mdname(mddev)); | |
2869 | err = -EINVAL; | |
2870 | } | |
2871 | ||
2872 | out: | |
2873 | return err; | |
2874 | } | |
2875 | ||
2876 | static int do_md_stop(mddev_t * mddev, int ro) | |
2877 | { | |
2878 | int err = 0; | |
2879 | struct gendisk *disk = mddev->gendisk; | |
2880 | ||
2881 | if (mddev->pers) { | |
2882 | if (atomic_read(&mddev->active)>2) { | |
2883 | printk("md: %s still in use.\n",mdname(mddev)); | |
2884 | return -EBUSY; | |
2885 | } | |
2886 | ||
2887 | if (mddev->sync_thread) { | |
2888 | set_bit(MD_RECOVERY_FROZEN, &mddev->recovery); | |
2889 | set_bit(MD_RECOVERY_INTR, &mddev->recovery); | |
2890 | md_unregister_thread(mddev->sync_thread); | |
2891 | mddev->sync_thread = NULL; | |
2892 | } | |
2893 | ||
2894 | del_timer_sync(&mddev->safemode_timer); | |
2895 | ||
2896 | invalidate_partition(disk, 0); | |
2897 | ||
2898 | if (ro) { | |
2899 | err = -ENXIO; | |
2900 | if (mddev->ro==1) | |
2901 | goto out; | |
2902 | mddev->ro = 1; | |
2903 | } else { | |
2904 | bitmap_flush(mddev); | |
2905 | md_super_wait(mddev); | |
2906 | if (mddev->ro) | |
2907 | set_disk_ro(disk, 0); | |
2908 | blk_queue_make_request(mddev->queue, md_fail_request); | |
2909 | mddev->pers->stop(mddev); | |
2910 | if (mddev->pers->sync_request) | |
2911 | sysfs_remove_group(&mddev->kobj, &md_redundancy_group); | |
2912 | ||
2913 | module_put(mddev->pers->owner); | |
2914 | mddev->pers = NULL; | |
2915 | if (mddev->ro) | |
2916 | mddev->ro = 0; | |
2917 | } | |
2918 | if (!mddev->in_sync || mddev->sb_dirty) { | |
2919 | /* mark array as shutdown cleanly */ | |
2920 | mddev->in_sync = 1; | |
2921 | md_update_sb(mddev); | |
2922 | } | |
2923 | if (ro) | |
2924 | set_disk_ro(disk, 1); | |
2925 | clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery); | |
2926 | } | |
2927 | ||
2928 | /* | |
2929 | * Free resources if final stop | |
2930 | */ | |
2931 | if (!ro) { | |
2932 | mdk_rdev_t *rdev; | |
2933 | struct list_head *tmp; | |
2934 | struct gendisk *disk; | |
2935 | printk(KERN_INFO "md: %s stopped.\n", mdname(mddev)); | |
2936 | ||
2937 | bitmap_destroy(mddev); | |
2938 | if (mddev->bitmap_file) { | |
2939 | atomic_set(&mddev->bitmap_file->f_dentry->d_inode->i_writecount, 1); | |
2940 | fput(mddev->bitmap_file); | |
2941 | mddev->bitmap_file = NULL; | |
2942 | } | |
2943 | mddev->bitmap_offset = 0; | |
2944 | ||
2945 | ITERATE_RDEV(mddev,rdev,tmp) | |
2946 | if (rdev->raid_disk >= 0) { | |
2947 | char nm[20]; | |
2948 | sprintf(nm, "rd%d", rdev->raid_disk); | |
2949 | sysfs_remove_link(&mddev->kobj, nm); | |
2950 | } | |
2951 | ||
2952 | export_array(mddev); | |
2953 | ||
2954 | mddev->array_size = 0; | |
2955 | disk = mddev->gendisk; | |
2956 | if (disk) | |
2957 | set_capacity(disk, 0); | |
2958 | mddev->changed = 1; | |
2959 | } else if (mddev->pers) | |
2960 | printk(KERN_INFO "md: %s switched to read-only mode.\n", | |
2961 | mdname(mddev)); | |
2962 | err = 0; | |
2963 | md_new_event(mddev); | |
2964 | out: | |
2965 | return err; | |
2966 | } | |
2967 | ||
2968 | static void autorun_array(mddev_t *mddev) | |
2969 | { | |
2970 | mdk_rdev_t *rdev; | |
2971 | struct list_head *tmp; | |
2972 | int err; | |
2973 | ||
2974 | if (list_empty(&mddev->disks)) | |
2975 | return; | |
2976 | ||
2977 | printk(KERN_INFO "md: running: "); | |
2978 | ||
2979 | ITERATE_RDEV(mddev,rdev,tmp) { | |
2980 | char b[BDEVNAME_SIZE]; | |
2981 | printk("<%s>", bdevname(rdev->bdev,b)); | |
2982 | } | |
2983 | printk("\n"); | |
2984 | ||
2985 | err = do_md_run (mddev); | |
2986 | if (err) { | |
2987 | printk(KERN_WARNING "md: do_md_run() returned %d\n", err); | |
2988 | do_md_stop (mddev, 0); | |
2989 | } | |
2990 | } | |
2991 | ||
2992 | /* | |
2993 | * lets try to run arrays based on all disks that have arrived | |
2994 | * until now. (those are in pending_raid_disks) | |
2995 | * | |
2996 | * the method: pick the first pending disk, collect all disks with | |
2997 | * the same UUID, remove all from the pending list and put them into | |
2998 | * the 'same_array' list. Then order this list based on superblock | |
2999 | * update time (freshest comes first), kick out 'old' disks and | |
3000 | * compare superblocks. If everything's fine then run it. | |
3001 | * | |
3002 | * If "unit" is allocated, then bump its reference count | |
3003 | */ | |
3004 | static void autorun_devices(int part) | |
3005 | { | |
3006 | struct list_head *tmp; | |
3007 | mdk_rdev_t *rdev0, *rdev; | |
3008 | mddev_t *mddev; | |
3009 | char b[BDEVNAME_SIZE]; | |
3010 | ||
3011 | printk(KERN_INFO "md: autorun ...\n"); | |
3012 | while (!list_empty(&pending_raid_disks)) { | |
3013 | dev_t dev; | |
3014 | LIST_HEAD(candidates); | |
3015 | rdev0 = list_entry(pending_raid_disks.next, | |
3016 | mdk_rdev_t, same_set); | |
3017 | ||
3018 | printk(KERN_INFO "md: considering %s ...\n", | |
3019 | bdevname(rdev0->bdev,b)); | |
3020 | INIT_LIST_HEAD(&candidates); | |
3021 | ITERATE_RDEV_PENDING(rdev,tmp) | |
3022 | if (super_90_load(rdev, rdev0, 0) >= 0) { | |
3023 | printk(KERN_INFO "md: adding %s ...\n", | |
3024 | bdevname(rdev->bdev,b)); | |
3025 | list_move(&rdev->same_set, &candidates); | |
3026 | } | |
3027 | /* | |
3028 | * now we have a set of devices, with all of them having | |
3029 | * mostly sane superblocks. It's time to allocate the | |
3030 | * mddev. | |
3031 | */ | |
3032 | if (rdev0->preferred_minor < 0 || rdev0->preferred_minor >= MAX_MD_DEVS) { | |
3033 | printk(KERN_INFO "md: unit number in %s is bad: %d\n", | |
3034 | bdevname(rdev0->bdev, b), rdev0->preferred_minor); | |
3035 | break; | |
3036 | } | |
3037 | if (part) | |
3038 | dev = MKDEV(mdp_major, | |
3039 | rdev0->preferred_minor << MdpMinorShift); | |
3040 | else | |
3041 | dev = MKDEV(MD_MAJOR, rdev0->preferred_minor); | |
3042 | ||
3043 | md_probe(dev, NULL, NULL); | |
3044 | mddev = mddev_find(dev); | |
3045 | if (!mddev) { | |
3046 | printk(KERN_ERR | |
3047 | "md: cannot allocate memory for md drive.\n"); | |
3048 | break; | |
3049 | } | |
3050 | if (mddev_lock(mddev)) | |
3051 | printk(KERN_WARNING "md: %s locked, cannot run\n", | |
3052 | mdname(mddev)); | |
3053 | else if (mddev->raid_disks || mddev->major_version | |
3054 | || !list_empty(&mddev->disks)) { | |
3055 | printk(KERN_WARNING | |
3056 | "md: %s already running, cannot run %s\n", | |
3057 | mdname(mddev), bdevname(rdev0->bdev,b)); | |
3058 | mddev_unlock(mddev); | |
3059 | } else { | |
3060 | printk(KERN_INFO "md: created %s\n", mdname(mddev)); | |
3061 | ITERATE_RDEV_GENERIC(candidates,rdev,tmp) { | |
3062 | list_del_init(&rdev->same_set); | |
3063 | if (bind_rdev_to_array(rdev, mddev)) | |
3064 | export_rdev(rdev); | |
3065 | } | |
3066 | autorun_array(mddev); | |
3067 | mddev_unlock(mddev); | |
3068 | } | |
3069 | /* on success, candidates will be empty, on error | |
3070 | * it won't... | |
3071 | */ | |
3072 | ITERATE_RDEV_GENERIC(candidates,rdev,tmp) | |
3073 | export_rdev(rdev); | |
3074 | mddev_put(mddev); | |
3075 | } | |
3076 | printk(KERN_INFO "md: ... autorun DONE.\n"); | |
3077 | } | |
3078 | ||
3079 | /* | |
3080 | * import RAID devices based on one partition | |
3081 | * if possible, the array gets run as well. | |
3082 | */ | |
3083 | ||
3084 | static int autostart_array(dev_t startdev) | |
3085 | { | |
3086 | char b[BDEVNAME_SIZE]; | |
3087 | int err = -EINVAL, i; | |
3088 | mdp_super_t *sb = NULL; | |
3089 | mdk_rdev_t *start_rdev = NULL, *rdev; | |
3090 | ||
3091 | start_rdev = md_import_device(startdev, 0, 0); | |
3092 | if (IS_ERR(start_rdev)) | |
3093 | return err; | |
3094 | ||
3095 | ||
3096 | /* NOTE: this can only work for 0.90.0 superblocks */ | |
3097 | sb = (mdp_super_t*)page_address(start_rdev->sb_page); | |
3098 | if (sb->major_version != 0 || | |
3099 | sb->minor_version != 90 ) { | |
3100 | printk(KERN_WARNING "md: can only autostart 0.90.0 arrays\n"); | |
3101 | export_rdev(start_rdev); | |
3102 | return err; | |
3103 | } | |
3104 | ||
3105 | if (test_bit(Faulty, &start_rdev->flags)) { | |
3106 | printk(KERN_WARNING | |
3107 | "md: can not autostart based on faulty %s!\n", | |
3108 | bdevname(start_rdev->bdev,b)); | |
3109 | export_rdev(start_rdev); | |
3110 | return err; | |
3111 | } | |
3112 | list_add(&start_rdev->same_set, &pending_raid_disks); | |
3113 | ||
3114 | for (i = 0; i < MD_SB_DISKS; i++) { | |
3115 | mdp_disk_t *desc = sb->disks + i; | |
3116 | dev_t dev = MKDEV(desc->major, desc->minor); | |
3117 | ||
3118 | if (!dev) | |
3119 | continue; | |
3120 | if (dev == startdev) | |
3121 | continue; | |
3122 | if (MAJOR(dev) != desc->major || MINOR(dev) != desc->minor) | |
3123 | continue; | |
3124 | rdev = md_import_device(dev, 0, 0); | |
3125 | if (IS_ERR(rdev)) | |
3126 | continue; | |
3127 | ||
3128 | list_add(&rdev->same_set, &pending_raid_disks); | |
3129 | } | |
3130 | ||
3131 | /* | |
3132 | * possibly return codes | |
3133 | */ | |
3134 | autorun_devices(0); | |
3135 | return 0; | |
3136 | ||
3137 | } | |
3138 | ||
3139 | ||
3140 | static int get_version(void __user * arg) | |
3141 | { | |
3142 | mdu_version_t ver; | |
3143 | ||
3144 | ver.major = MD_MAJOR_VERSION; | |
3145 | ver.minor = MD_MINOR_VERSION; | |
3146 | ver.patchlevel = MD_PATCHLEVEL_VERSION; | |
3147 | ||
3148 | if (copy_to_user(arg, &ver, sizeof(ver))) | |
3149 | return -EFAULT; | |
3150 | ||
3151 | return 0; | |
3152 | } | |
3153 | ||
3154 | static int get_array_info(mddev_t * mddev, void __user * arg) | |
3155 | { | |
3156 | mdu_array_info_t info; | |
3157 | int nr,working,active,failed,spare; | |
3158 | mdk_rdev_t *rdev; | |
3159 | struct list_head *tmp; | |
3160 | ||
3161 | nr=working=active=failed=spare=0; | |
3162 | ITERATE_RDEV(mddev,rdev,tmp) { | |
3163 | nr++; | |
3164 | if (test_bit(Faulty, &rdev->flags)) | |
3165 | failed++; | |
3166 | else { | |
3167 | working++; | |
3168 | if (test_bit(In_sync, &rdev->flags)) | |
3169 | active++; | |
3170 | else | |
3171 | spare++; | |
3172 | } | |
3173 | } | |
3174 | ||
3175 | info.major_version = mddev->major_version; | |
3176 | info.minor_version = mddev->minor_version; | |
3177 | info.patch_version = MD_PATCHLEVEL_VERSION; | |
3178 | info.ctime = mddev->ctime; | |
3179 | info.level = mddev->level; | |
3180 | info.size = mddev->size; | |
3181 | if (info.size != mddev->size) /* overflow */ | |
3182 | info.size = -1; | |
3183 | info.nr_disks = nr; | |
3184 | info.raid_disks = mddev->raid_disks; | |
3185 | info.md_minor = mddev->md_minor; | |
3186 | info.not_persistent= !mddev->persistent; | |
3187 | ||
3188 | info.utime = mddev->utime; | |
3189 | info.state = 0; | |
3190 | if (mddev->in_sync) | |
3191 | info.state = (1<<MD_SB_CLEAN); | |
3192 | if (mddev->bitmap && mddev->bitmap_offset) | |
3193 | info.state = (1<<MD_SB_BITMAP_PRESENT); | |
3194 | info.active_disks = active; | |
3195 | info.working_disks = working; | |
3196 | info.failed_disks = failed; | |
3197 | info.spare_disks = spare; | |
3198 | ||
3199 | info.layout = mddev->layout; | |
3200 | info.chunk_size = mddev->chunk_size; | |
3201 | ||
3202 | if (copy_to_user(arg, &info, sizeof(info))) | |
3203 | return -EFAULT; | |
3204 | ||
3205 | return 0; | |
3206 | } | |
3207 | ||
3208 | static int get_bitmap_file(mddev_t * mddev, void __user * arg) | |
3209 | { | |
3210 | mdu_bitmap_file_t *file = NULL; /* too big for stack allocation */ | |
3211 | char *ptr, *buf = NULL; | |
3212 | int err = -ENOMEM; | |
3213 | ||
3214 | file = kmalloc(sizeof(*file), GFP_KERNEL); | |
3215 | if (!file) | |
3216 | goto out; | |
3217 | ||
3218 | /* bitmap disabled, zero the first byte and copy out */ | |
3219 | if (!mddev->bitmap || !mddev->bitmap->file) { | |
3220 | file->pathname[0] = '\0'; | |
3221 | goto copy_out; | |
3222 | } | |
3223 | ||
3224 | buf = kmalloc(sizeof(file->pathname), GFP_KERNEL); | |
3225 | if (!buf) | |
3226 | goto out; | |
3227 | ||
3228 | ptr = file_path(mddev->bitmap->file, buf, sizeof(file->pathname)); | |
3229 | if (!ptr) | |
3230 | goto out; | |
3231 | ||
3232 | strcpy(file->pathname, ptr); | |
3233 | ||
3234 | copy_out: | |
3235 | err = 0; | |
3236 | if (copy_to_user(arg, file, sizeof(*file))) | |
3237 | err = -EFAULT; | |
3238 | out: | |
3239 | kfree(buf); | |
3240 | kfree(file); | |
3241 | return err; | |
3242 | } | |
3243 | ||
3244 | static int get_disk_info(mddev_t * mddev, void __user * arg) | |
3245 | { | |
3246 | mdu_disk_info_t info; | |
3247 | unsigned int nr; | |
3248 | mdk_rdev_t *rdev; | |
3249 | ||
3250 | if (copy_from_user(&info, arg, sizeof(info))) | |
3251 | return -EFAULT; | |
3252 | ||
3253 | nr = info.number; | |
3254 | ||
3255 | rdev = find_rdev_nr(mddev, nr); | |
3256 | if (rdev) { | |
3257 | info.major = MAJOR(rdev->bdev->bd_dev); | |
3258 | info.minor = MINOR(rdev->bdev->bd_dev); | |
3259 | info.raid_disk = rdev->raid_disk; | |
3260 | info.state = 0; | |
3261 | if (test_bit(Faulty, &rdev->flags)) | |
3262 | info.state |= (1<<MD_DISK_FAULTY); | |
3263 | else if (test_bit(In_sync, &rdev->flags)) { | |
3264 | info.state |= (1<<MD_DISK_ACTIVE); | |
3265 | info.state |= (1<<MD_DISK_SYNC); | |
3266 | } | |
3267 | if (test_bit(WriteMostly, &rdev->flags)) | |
3268 | info.state |= (1<<MD_DISK_WRITEMOSTLY); | |
3269 | } else { | |
3270 | info.major = info.minor = 0; | |
3271 | info.raid_disk = -1; | |
3272 | info.state = (1<<MD_DISK_REMOVED); | |
3273 | } | |
3274 | ||
3275 | if (copy_to_user(arg, &info, sizeof(info))) | |
3276 | return -EFAULT; | |
3277 | ||
3278 | return 0; | |
3279 | } | |
3280 | ||
3281 | static int add_new_disk(mddev_t * mddev, mdu_disk_info_t *info) | |
3282 | { | |
3283 | char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE]; | |
3284 | mdk_rdev_t *rdev; | |
3285 | dev_t dev = MKDEV(info->major,info->minor); | |
3286 | ||
3287 | if (info->major != MAJOR(dev) || info->minor != MINOR(dev)) | |
3288 | return -EOVERFLOW; | |
3289 | ||
3290 | if (!mddev->raid_disks) { | |
3291 | int err; | |
3292 | /* expecting a device which has a superblock */ | |
3293 | rdev = md_import_device(dev, mddev->major_version, mddev->minor_version); | |
3294 | if (IS_ERR(rdev)) { | |
3295 | printk(KERN_WARNING | |
3296 | "md: md_import_device returned %ld\n", | |
3297 | PTR_ERR(rdev)); | |
3298 | return PTR_ERR(rdev); | |
3299 | } | |
3300 | if (!list_empty(&mddev->disks)) { | |
3301 | mdk_rdev_t *rdev0 = list_entry(mddev->disks.next, | |
3302 | mdk_rdev_t, same_set); | |
3303 | int err = super_types[mddev->major_version] | |
3304 | .load_super(rdev, rdev0, mddev->minor_version); | |
3305 | if (err < 0) { | |
3306 | printk(KERN_WARNING | |
3307 | "md: %s has different UUID to %s\n", | |
3308 | bdevname(rdev->bdev,b), | |
3309 | bdevname(rdev0->bdev,b2)); | |
3310 | export_rdev(rdev); | |
3311 | return -EINVAL; | |
3312 | } | |
3313 | } | |
3314 | err = bind_rdev_to_array(rdev, mddev); | |
3315 | if (err) | |
3316 | export_rdev(rdev); | |
3317 | return err; | |
3318 | } | |
3319 | ||
3320 | /* | |
3321 | * add_new_disk can be used once the array is assembled | |
3322 | * to add "hot spares". They must already have a superblock | |
3323 | * written | |
3324 | */ | |
3325 | if (mddev->pers) { | |
3326 | int err; | |
3327 | if (!mddev->pers->hot_add_disk) { | |
3328 | printk(KERN_WARNING | |
3329 | "%s: personality does not support diskops!\n", | |
3330 | mdname(mddev)); | |
3331 | return -EINVAL; | |
3332 | } | |
3333 | if (mddev->persistent) | |
3334 | rdev = md_import_device(dev, mddev->major_version, | |
3335 | mddev->minor_version); | |
3336 | else | |
3337 | rdev = md_import_device(dev, -1, -1); | |
3338 | if (IS_ERR(rdev)) { | |
3339 | printk(KERN_WARNING | |
3340 | "md: md_import_device returned %ld\n", | |
3341 | PTR_ERR(rdev)); | |
3342 | return PTR_ERR(rdev); | |
3343 | } | |
3344 | /* set save_raid_disk if appropriate */ | |
3345 | if (!mddev->persistent) { | |
3346 | if (info->state & (1<<MD_DISK_SYNC) && | |
3347 | info->raid_disk < mddev->raid_disks) | |
3348 | rdev->raid_disk = info->raid_disk; | |
3349 | else | |
3350 | rdev->raid_disk = -1; | |
3351 | } else | |
3352 | super_types[mddev->major_version]. | |
3353 | validate_super(mddev, rdev); | |
3354 | rdev->saved_raid_disk = rdev->raid_disk; | |
3355 | ||
3356 | clear_bit(In_sync, &rdev->flags); /* just to be sure */ | |
3357 | if (info->state & (1<<MD_DISK_WRITEMOSTLY)) | |
3358 | set_bit(WriteMostly, &rdev->flags); | |
3359 | ||
3360 | rdev->raid_disk = -1; | |
3361 | err = bind_rdev_to_array(rdev, mddev); | |
3362 | if (!err && !mddev->pers->hot_remove_disk) { | |
3363 | /* If there is hot_add_disk but no hot_remove_disk | |
3364 | * then added disks for geometry changes, | |
3365 | * and should be added immediately. | |
3366 | */ | |
3367 | super_types[mddev->major_version]. | |
3368 | validate_super(mddev, rdev); | |
3369 | err = mddev->pers->hot_add_disk(mddev, rdev); | |
3370 | if (err) | |
3371 | unbind_rdev_from_array(rdev); | |
3372 | } | |
3373 | if (err) | |
3374 | export_rdev(rdev); | |
3375 | ||
3376 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
3377 | md_wakeup_thread(mddev->thread); | |
3378 | return err; | |
3379 | } | |
3380 | ||
3381 | /* otherwise, add_new_disk is only allowed | |
3382 | * for major_version==0 superblocks | |
3383 | */ | |
3384 | if (mddev->major_version != 0) { | |
3385 | printk(KERN_WARNING "%s: ADD_NEW_DISK not supported\n", | |
3386 | mdname(mddev)); | |
3387 | return -EINVAL; | |
3388 | } | |
3389 | ||
3390 | if (!(info->state & (1<<MD_DISK_FAULTY))) { | |
3391 | int err; | |
3392 | rdev = md_import_device (dev, -1, 0); | |
3393 | if (IS_ERR(rdev)) { | |
3394 | printk(KERN_WARNING | |
3395 | "md: error, md_import_device() returned %ld\n", | |
3396 | PTR_ERR(rdev)); | |
3397 | return PTR_ERR(rdev); | |
3398 | } | |
3399 | rdev->desc_nr = info->number; | |
3400 | if (info->raid_disk < mddev->raid_disks) | |
3401 | rdev->raid_disk = info->raid_disk; | |
3402 | else | |
3403 | rdev->raid_disk = -1; | |
3404 | ||
3405 | rdev->flags = 0; | |
3406 | ||
3407 | if (rdev->raid_disk < mddev->raid_disks) | |
3408 | if (info->state & (1<<MD_DISK_SYNC)) | |
3409 | set_bit(In_sync, &rdev->flags); | |
3410 | ||
3411 | if (info->state & (1<<MD_DISK_WRITEMOSTLY)) | |
3412 | set_bit(WriteMostly, &rdev->flags); | |
3413 | ||
3414 | if (!mddev->persistent) { | |
3415 | printk(KERN_INFO "md: nonpersistent superblock ...\n"); | |
3416 | rdev->sb_offset = rdev->bdev->bd_inode->i_size >> BLOCK_SIZE_BITS; | |
3417 | } else | |
3418 | rdev->sb_offset = calc_dev_sboffset(rdev->bdev); | |
3419 | rdev->size = calc_dev_size(rdev, mddev->chunk_size); | |
3420 | ||
3421 | err = bind_rdev_to_array(rdev, mddev); | |
3422 | if (err) { | |
3423 | export_rdev(rdev); | |
3424 | return err; | |
3425 | } | |
3426 | } | |
3427 | ||
3428 | return 0; | |
3429 | } | |
3430 | ||
3431 | static int hot_remove_disk(mddev_t * mddev, dev_t dev) | |
3432 | { | |
3433 | char b[BDEVNAME_SIZE]; | |
3434 | mdk_rdev_t *rdev; | |
3435 | ||
3436 | if (!mddev->pers) | |
3437 | return -ENODEV; | |
3438 | ||
3439 | rdev = find_rdev(mddev, dev); | |
3440 | if (!rdev) | |
3441 | return -ENXIO; | |
3442 | ||
3443 | if (rdev->raid_disk >= 0) | |
3444 | goto busy; | |
3445 | ||
3446 | kick_rdev_from_array(rdev); | |
3447 | md_update_sb(mddev); | |
3448 | md_new_event(mddev); | |
3449 | ||
3450 | return 0; | |
3451 | busy: | |
3452 | printk(KERN_WARNING "md: cannot remove active disk %s from %s ... \n", | |
3453 | bdevname(rdev->bdev,b), mdname(mddev)); | |
3454 | return -EBUSY; | |
3455 | } | |
3456 | ||
3457 | static int hot_add_disk(mddev_t * mddev, dev_t dev) | |
3458 | { | |
3459 | char b[BDEVNAME_SIZE]; | |
3460 | int err; | |
3461 | unsigned int size; | |
3462 | mdk_rdev_t *rdev; | |
3463 | ||
3464 | if (!mddev->pers) | |
3465 | return -ENODEV; | |
3466 | ||
3467 | if (mddev->major_version != 0) { | |
3468 | printk(KERN_WARNING "%s: HOT_ADD may only be used with" | |
3469 | " version-0 superblocks.\n", | |
3470 | mdname(mddev)); | |
3471 | return -EINVAL; | |
3472 | } | |
3473 | if (!mddev->pers->hot_add_disk) { | |
3474 | printk(KERN_WARNING | |
3475 | "%s: personality does not support diskops!\n", | |
3476 | mdname(mddev)); | |
3477 | return -EINVAL; | |
3478 | } | |
3479 | ||
3480 | rdev = md_import_device (dev, -1, 0); | |
3481 | if (IS_ERR(rdev)) { | |
3482 | printk(KERN_WARNING | |
3483 | "md: error, md_import_device() returned %ld\n", | |
3484 | PTR_ERR(rdev)); | |
3485 | return -EINVAL; | |
3486 | } | |
3487 | ||
3488 | if (mddev->persistent) | |
3489 | rdev->sb_offset = calc_dev_sboffset(rdev->bdev); | |
3490 | else | |
3491 | rdev->sb_offset = | |
3492 | rdev->bdev->bd_inode->i_size >> BLOCK_SIZE_BITS; | |
3493 | ||
3494 | size = calc_dev_size(rdev, mddev->chunk_size); | |
3495 | rdev->size = size; | |
3496 | ||
3497 | if (test_bit(Faulty, &rdev->flags)) { | |
3498 | printk(KERN_WARNING | |
3499 | "md: can not hot-add faulty %s disk to %s!\n", | |
3500 | bdevname(rdev->bdev,b), mdname(mddev)); | |
3501 | err = -EINVAL; | |
3502 | goto abort_export; | |
3503 | } | |
3504 | clear_bit(In_sync, &rdev->flags); | |
3505 | rdev->desc_nr = -1; | |
3506 | err = bind_rdev_to_array(rdev, mddev); | |
3507 | if (err) | |
3508 | goto abort_export; | |
3509 | ||
3510 | /* | |
3511 | * The rest should better be atomic, we can have disk failures | |
3512 | * noticed in interrupt contexts ... | |
3513 | */ | |
3514 | ||
3515 | if (rdev->desc_nr == mddev->max_disks) { | |
3516 | printk(KERN_WARNING "%s: can not hot-add to full array!\n", | |
3517 | mdname(mddev)); | |
3518 | err = -EBUSY; | |
3519 | goto abort_unbind_export; | |
3520 | } | |
3521 | ||
3522 | rdev->raid_disk = -1; | |
3523 | ||
3524 | md_update_sb(mddev); | |
3525 | ||
3526 | /* | |
3527 | * Kick recovery, maybe this spare has to be added to the | |
3528 | * array immediately. | |
3529 | */ | |
3530 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
3531 | md_wakeup_thread(mddev->thread); | |
3532 | md_new_event(mddev); | |
3533 | return 0; | |
3534 | ||
3535 | abort_unbind_export: | |
3536 | unbind_rdev_from_array(rdev); | |
3537 | ||
3538 | abort_export: | |
3539 | export_rdev(rdev); | |
3540 | return err; | |
3541 | } | |
3542 | ||
3543 | /* similar to deny_write_access, but accounts for our holding a reference | |
3544 | * to the file ourselves */ | |
3545 | static int deny_bitmap_write_access(struct file * file) | |
3546 | { | |
3547 | struct inode *inode = file->f_mapping->host; | |
3548 | ||
3549 | spin_lock(&inode->i_lock); | |
3550 | if (atomic_read(&inode->i_writecount) > 1) { | |
3551 | spin_unlock(&inode->i_lock); | |
3552 | return -ETXTBSY; | |
3553 | } | |
3554 | atomic_set(&inode->i_writecount, -1); | |
3555 | spin_unlock(&inode->i_lock); | |
3556 | ||
3557 | return 0; | |
3558 | } | |
3559 | ||
3560 | static int set_bitmap_file(mddev_t *mddev, int fd) | |
3561 | { | |
3562 | int err; | |
3563 | ||
3564 | if (mddev->pers) { | |
3565 | if (!mddev->pers->quiesce) | |
3566 | return -EBUSY; | |
3567 | if (mddev->recovery || mddev->sync_thread) | |
3568 | return -EBUSY; | |
3569 | /* we should be able to change the bitmap.. */ | |
3570 | } | |
3571 | ||
3572 | ||
3573 | if (fd >= 0) { | |
3574 | if (mddev->bitmap) | |
3575 | return -EEXIST; /* cannot add when bitmap is present */ | |
3576 | mddev->bitmap_file = fget(fd); | |
3577 | ||
3578 | if (mddev->bitmap_file == NULL) { | |
3579 | printk(KERN_ERR "%s: error: failed to get bitmap file\n", | |
3580 | mdname(mddev)); | |
3581 | return -EBADF; | |
3582 | } | |
3583 | ||
3584 | err = deny_bitmap_write_access(mddev->bitmap_file); | |
3585 | if (err) { | |
3586 | printk(KERN_ERR "%s: error: bitmap file is already in use\n", | |
3587 | mdname(mddev)); | |
3588 | fput(mddev->bitmap_file); | |
3589 | mddev->bitmap_file = NULL; | |
3590 | return err; | |
3591 | } | |
3592 | mddev->bitmap_offset = 0; /* file overrides offset */ | |
3593 | } else if (mddev->bitmap == NULL) | |
3594 | return -ENOENT; /* cannot remove what isn't there */ | |
3595 | err = 0; | |
3596 | if (mddev->pers) { | |
3597 | mddev->pers->quiesce(mddev, 1); | |
3598 | if (fd >= 0) | |
3599 | err = bitmap_create(mddev); | |
3600 | if (fd < 0 || err) | |
3601 | bitmap_destroy(mddev); | |
3602 | mddev->pers->quiesce(mddev, 0); | |
3603 | } else if (fd < 0) { | |
3604 | if (mddev->bitmap_file) | |
3605 | fput(mddev->bitmap_file); | |
3606 | mddev->bitmap_file = NULL; | |
3607 | } | |
3608 | ||
3609 | return err; | |
3610 | } | |
3611 | ||
3612 | /* | |
3613 | * set_array_info is used two different ways | |
3614 | * The original usage is when creating a new array. | |
3615 | * In this usage, raid_disks is > 0 and it together with | |
3616 | * level, size, not_persistent,layout,chunksize determine the | |
3617 | * shape of the array. | |
3618 | * This will always create an array with a type-0.90.0 superblock. | |
3619 | * The newer usage is when assembling an array. | |
3620 | * In this case raid_disks will be 0, and the major_version field is | |
3621 | * use to determine which style super-blocks are to be found on the devices. | |
3622 | * The minor and patch _version numbers are also kept incase the | |
3623 | * super_block handler wishes to interpret them. | |
3624 | */ | |
3625 | static int set_array_info(mddev_t * mddev, mdu_array_info_t *info) | |
3626 | { | |
3627 | ||
3628 | if (info->raid_disks == 0) { | |
3629 | /* just setting version number for superblock loading */ | |
3630 | if (info->major_version < 0 || | |
3631 | info->major_version >= sizeof(super_types)/sizeof(super_types[0]) || | |
3632 | super_types[info->major_version].name == NULL) { | |
3633 | /* maybe try to auto-load a module? */ | |
3634 | printk(KERN_INFO | |
3635 | "md: superblock version %d not known\n", | |
3636 | info->major_version); | |
3637 | return -EINVAL; | |
3638 | } | |
3639 | mddev->major_version = info->major_version; | |
3640 | mddev->minor_version = info->minor_version; | |
3641 | mddev->patch_version = info->patch_version; | |
3642 | return 0; | |
3643 | } | |
3644 | mddev->major_version = MD_MAJOR_VERSION; | |
3645 | mddev->minor_version = MD_MINOR_VERSION; | |
3646 | mddev->patch_version = MD_PATCHLEVEL_VERSION; | |
3647 | mddev->ctime = get_seconds(); | |
3648 | ||
3649 | mddev->level = info->level; | |
3650 | mddev->clevel[0] = 0; | |
3651 | mddev->size = info->size; | |
3652 | mddev->raid_disks = info->raid_disks; | |
3653 | /* don't set md_minor, it is determined by which /dev/md* was | |
3654 | * openned | |
3655 | */ | |
3656 | if (info->state & (1<<MD_SB_CLEAN)) | |
3657 | mddev->recovery_cp = MaxSector; | |
3658 | else | |
3659 | mddev->recovery_cp = 0; | |
3660 | mddev->persistent = ! info->not_persistent; | |
3661 | ||
3662 | mddev->layout = info->layout; | |
3663 | mddev->chunk_size = info->chunk_size; | |
3664 | ||
3665 | mddev->max_disks = MD_SB_DISKS; | |
3666 | ||
3667 | mddev->sb_dirty = 1; | |
3668 | ||
3669 | mddev->default_bitmap_offset = MD_SB_BYTES >> 9; | |
3670 | mddev->bitmap_offset = 0; | |
3671 | ||
3672 | mddev->reshape_position = MaxSector; | |
3673 | ||
3674 | /* | |
3675 | * Generate a 128 bit UUID | |
3676 | */ | |
3677 | get_random_bytes(mddev->uuid, 16); | |
3678 | ||
3679 | mddev->new_level = mddev->level; | |
3680 | mddev->new_chunk = mddev->chunk_size; | |
3681 | mddev->new_layout = mddev->layout; | |
3682 | mddev->delta_disks = 0; | |
3683 | ||
3684 | return 0; | |
3685 | } | |
3686 | ||
3687 | static int update_size(mddev_t *mddev, unsigned long size) | |
3688 | { | |
3689 | mdk_rdev_t * rdev; | |
3690 | int rv; | |
3691 | struct list_head *tmp; | |
3692 | int fit = (size == 0); | |
3693 | ||
3694 | if (mddev->pers->resize == NULL) | |
3695 | return -EINVAL; | |
3696 | /* The "size" is the amount of each device that is used. | |
3697 | * This can only make sense for arrays with redundancy. | |
3698 | * linear and raid0 always use whatever space is available | |
3699 | * We can only consider changing the size if no resync | |
3700 | * or reconstruction is happening, and if the new size | |
3701 | * is acceptable. It must fit before the sb_offset or, | |
3702 | * if that is <data_offset, it must fit before the | |
3703 | * size of each device. | |
3704 | * If size is zero, we find the largest size that fits. | |
3705 | */ | |
3706 | if (mddev->sync_thread) | |
3707 | return -EBUSY; | |
3708 | ITERATE_RDEV(mddev,rdev,tmp) { | |
3709 | sector_t avail; | |
3710 | if (rdev->sb_offset > rdev->data_offset) | |
3711 | avail = (rdev->sb_offset*2) - rdev->data_offset; | |
3712 | else | |
3713 | avail = get_capacity(rdev->bdev->bd_disk) | |
3714 | - rdev->data_offset; | |
3715 | if (fit && (size == 0 || size > avail/2)) | |
3716 | size = avail/2; | |
3717 | if (avail < ((sector_t)size << 1)) | |
3718 | return -ENOSPC; | |
3719 | } | |
3720 | rv = mddev->pers->resize(mddev, (sector_t)size *2); | |
3721 | if (!rv) { | |
3722 | struct block_device *bdev; | |
3723 | ||
3724 | bdev = bdget_disk(mddev->gendisk, 0); | |
3725 | if (bdev) { | |
3726 | mutex_lock(&bdev->bd_inode->i_mutex); | |
3727 | i_size_write(bdev->bd_inode, (loff_t)mddev->array_size << 10); | |
3728 | mutex_unlock(&bdev->bd_inode->i_mutex); | |
3729 | bdput(bdev); | |
3730 | } | |
3731 | } | |
3732 | return rv; | |
3733 | } | |
3734 | ||
3735 | static int update_raid_disks(mddev_t *mddev, int raid_disks) | |
3736 | { | |
3737 | int rv; | |
3738 | /* change the number of raid disks */ | |
3739 | if (mddev->pers->check_reshape == NULL) | |
3740 | return -EINVAL; | |
3741 | if (raid_disks <= 0 || | |
3742 | raid_disks >= mddev->max_disks) | |
3743 | return -EINVAL; | |
3744 | if (mddev->sync_thread || mddev->reshape_position != MaxSector) | |
3745 | return -EBUSY; | |
3746 | mddev->delta_disks = raid_disks - mddev->raid_disks; | |
3747 | ||
3748 | rv = mddev->pers->check_reshape(mddev); | |
3749 | return rv; | |
3750 | } | |
3751 | ||
3752 | ||
3753 | /* | |
3754 | * update_array_info is used to change the configuration of an | |
3755 | * on-line array. | |
3756 | * The version, ctime,level,size,raid_disks,not_persistent, layout,chunk_size | |
3757 | * fields in the info are checked against the array. | |
3758 | * Any differences that cannot be handled will cause an error. | |
3759 | * Normally, only one change can be managed at a time. | |
3760 | */ | |
3761 | static int update_array_info(mddev_t *mddev, mdu_array_info_t *info) | |
3762 | { | |
3763 | int rv = 0; | |
3764 | int cnt = 0; | |
3765 | int state = 0; | |
3766 | ||
3767 | /* calculate expected state,ignoring low bits */ | |
3768 | if (mddev->bitmap && mddev->bitmap_offset) | |
3769 | state |= (1 << MD_SB_BITMAP_PRESENT); | |
3770 | ||
3771 | if (mddev->major_version != info->major_version || | |
3772 | mddev->minor_version != info->minor_version || | |
3773 | /* mddev->patch_version != info->patch_version || */ | |
3774 | mddev->ctime != info->ctime || | |
3775 | mddev->level != info->level || | |
3776 | /* mddev->layout != info->layout || */ | |
3777 | !mddev->persistent != info->not_persistent|| | |
3778 | mddev->chunk_size != info->chunk_size || | |
3779 | /* ignore bottom 8 bits of state, and allow SB_BITMAP_PRESENT to change */ | |
3780 | ((state^info->state) & 0xfffffe00) | |
3781 | ) | |
3782 | return -EINVAL; | |
3783 | /* Check there is only one change */ | |
3784 | if (info->size >= 0 && mddev->size != info->size) cnt++; | |
3785 | if (mddev->raid_disks != info->raid_disks) cnt++; | |
3786 | if (mddev->layout != info->layout) cnt++; | |
3787 | if ((state ^ info->state) & (1<<MD_SB_BITMAP_PRESENT)) cnt++; | |
3788 | if (cnt == 0) return 0; | |
3789 | if (cnt > 1) return -EINVAL; | |
3790 | ||
3791 | if (mddev->layout != info->layout) { | |
3792 | /* Change layout | |
3793 | * we don't need to do anything at the md level, the | |
3794 | * personality will take care of it all. | |
3795 | */ | |
3796 | if (mddev->pers->reconfig == NULL) | |
3797 | return -EINVAL; | |
3798 | else | |
3799 | return mddev->pers->reconfig(mddev, info->layout, -1); | |
3800 | } | |
3801 | if (info->size >= 0 && mddev->size != info->size) | |
3802 | rv = update_size(mddev, info->size); | |
3803 | ||
3804 | if (mddev->raid_disks != info->raid_disks) | |
3805 | rv = update_raid_disks(mddev, info->raid_disks); | |
3806 | ||
3807 | if ((state ^ info->state) & (1<<MD_SB_BITMAP_PRESENT)) { | |
3808 | if (mddev->pers->quiesce == NULL) | |
3809 | return -EINVAL; | |
3810 | if (mddev->recovery || mddev->sync_thread) | |
3811 | return -EBUSY; | |
3812 | if (info->state & (1<<MD_SB_BITMAP_PRESENT)) { | |
3813 | /* add the bitmap */ | |
3814 | if (mddev->bitmap) | |
3815 | return -EEXIST; | |
3816 | if (mddev->default_bitmap_offset == 0) | |
3817 | return -EINVAL; | |
3818 | mddev->bitmap_offset = mddev->default_bitmap_offset; | |
3819 | mddev->pers->quiesce(mddev, 1); | |
3820 | rv = bitmap_create(mddev); | |
3821 | if (rv) | |
3822 | bitmap_destroy(mddev); | |
3823 | mddev->pers->quiesce(mddev, 0); | |
3824 | } else { | |
3825 | /* remove the bitmap */ | |
3826 | if (!mddev->bitmap) | |
3827 | return -ENOENT; | |
3828 | if (mddev->bitmap->file) | |
3829 | return -EINVAL; | |
3830 | mddev->pers->quiesce(mddev, 1); | |
3831 | bitmap_destroy(mddev); | |
3832 | mddev->pers->quiesce(mddev, 0); | |
3833 | mddev->bitmap_offset = 0; | |
3834 | } | |
3835 | } | |
3836 | md_update_sb(mddev); | |
3837 | return rv; | |
3838 | } | |
3839 | ||
3840 | static int set_disk_faulty(mddev_t *mddev, dev_t dev) | |
3841 | { | |
3842 | mdk_rdev_t *rdev; | |
3843 | ||
3844 | if (mddev->pers == NULL) | |
3845 | return -ENODEV; | |
3846 | ||
3847 | rdev = find_rdev(mddev, dev); | |
3848 | if (!rdev) | |
3849 | return -ENODEV; | |
3850 | ||
3851 | md_error(mddev, rdev); | |
3852 | return 0; | |
3853 | } | |
3854 | ||
3855 | static int md_getgeo(struct block_device *bdev, struct hd_geometry *geo) | |
3856 | { | |
3857 | mddev_t *mddev = bdev->bd_disk->private_data; | |
3858 | ||
3859 | geo->heads = 2; | |
3860 | geo->sectors = 4; | |
3861 | geo->cylinders = get_capacity(mddev->gendisk) / 8; | |
3862 | return 0; | |
3863 | } | |
3864 | ||
3865 | static int md_ioctl(struct inode *inode, struct file *file, | |
3866 | unsigned int cmd, unsigned long arg) | |
3867 | { | |
3868 | int err = 0; | |
3869 | void __user *argp = (void __user *)arg; | |
3870 | mddev_t *mddev = NULL; | |
3871 | ||
3872 | if (!capable(CAP_SYS_ADMIN)) | |
3873 | return -EACCES; | |
3874 | ||
3875 | /* | |
3876 | * Commands dealing with the RAID driver but not any | |
3877 | * particular array: | |
3878 | */ | |
3879 | switch (cmd) | |
3880 | { | |
3881 | case RAID_VERSION: | |
3882 | err = get_version(argp); | |
3883 | goto done; | |
3884 | ||
3885 | case PRINT_RAID_DEBUG: | |
3886 | err = 0; | |
3887 | md_print_devices(); | |
3888 | goto done; | |
3889 | ||
3890 | #ifndef MODULE | |
3891 | case RAID_AUTORUN: | |
3892 | err = 0; | |
3893 | autostart_arrays(arg); | |
3894 | goto done; | |
3895 | #endif | |
3896 | default:; | |
3897 | } | |
3898 | ||
3899 | /* | |
3900 | * Commands creating/starting a new array: | |
3901 | */ | |
3902 | ||
3903 | mddev = inode->i_bdev->bd_disk->private_data; | |
3904 | ||
3905 | if (!mddev) { | |
3906 | BUG(); | |
3907 | goto abort; | |
3908 | } | |
3909 | ||
3910 | ||
3911 | if (cmd == START_ARRAY) { | |
3912 | /* START_ARRAY doesn't need to lock the array as autostart_array | |
3913 | * does the locking, and it could even be a different array | |
3914 | */ | |
3915 | static int cnt = 3; | |
3916 | if (cnt > 0 ) { | |
3917 | printk(KERN_WARNING | |
3918 | "md: %s(pid %d) used deprecated START_ARRAY ioctl. " | |
3919 | "This will not be supported beyond July 2006\n", | |
3920 | current->comm, current->pid); | |
3921 | cnt--; | |
3922 | } | |
3923 | err = autostart_array(new_decode_dev(arg)); | |
3924 | if (err) { | |
3925 | printk(KERN_WARNING "md: autostart failed!\n"); | |
3926 | goto abort; | |
3927 | } | |
3928 | goto done; | |
3929 | } | |
3930 | ||
3931 | err = mddev_lock(mddev); | |
3932 | if (err) { | |
3933 | printk(KERN_INFO | |
3934 | "md: ioctl lock interrupted, reason %d, cmd %d\n", | |
3935 | err, cmd); | |
3936 | goto abort; | |
3937 | } | |
3938 | ||
3939 | switch (cmd) | |
3940 | { | |
3941 | case SET_ARRAY_INFO: | |
3942 | { | |
3943 | mdu_array_info_t info; | |
3944 | if (!arg) | |
3945 | memset(&info, 0, sizeof(info)); | |
3946 | else if (copy_from_user(&info, argp, sizeof(info))) { | |
3947 | err = -EFAULT; | |
3948 | goto abort_unlock; | |
3949 | } | |
3950 | if (mddev->pers) { | |
3951 | err = update_array_info(mddev, &info); | |
3952 | if (err) { | |
3953 | printk(KERN_WARNING "md: couldn't update" | |
3954 | " array info. %d\n", err); | |
3955 | goto abort_unlock; | |
3956 | } | |
3957 | goto done_unlock; | |
3958 | } | |
3959 | if (!list_empty(&mddev->disks)) { | |
3960 | printk(KERN_WARNING | |
3961 | "md: array %s already has disks!\n", | |
3962 | mdname(mddev)); | |
3963 | err = -EBUSY; | |
3964 | goto abort_unlock; | |
3965 | } | |
3966 | if (mddev->raid_disks) { | |
3967 | printk(KERN_WARNING | |
3968 | "md: array %s already initialised!\n", | |
3969 | mdname(mddev)); | |
3970 | err = -EBUSY; | |
3971 | goto abort_unlock; | |
3972 | } | |
3973 | err = set_array_info(mddev, &info); | |
3974 | if (err) { | |
3975 | printk(KERN_WARNING "md: couldn't set" | |
3976 | " array info. %d\n", err); | |
3977 | goto abort_unlock; | |
3978 | } | |
3979 | } | |
3980 | goto done_unlock; | |
3981 | ||
3982 | default:; | |
3983 | } | |
3984 | ||
3985 | /* | |
3986 | * Commands querying/configuring an existing array: | |
3987 | */ | |
3988 | /* if we are not initialised yet, only ADD_NEW_DISK, STOP_ARRAY, | |
3989 | * RUN_ARRAY, and SET_BITMAP_FILE are allowed */ | |
3990 | if (!mddev->raid_disks && cmd != ADD_NEW_DISK && cmd != STOP_ARRAY | |
3991 | && cmd != RUN_ARRAY && cmd != SET_BITMAP_FILE) { | |
3992 | err = -ENODEV; | |
3993 | goto abort_unlock; | |
3994 | } | |
3995 | ||
3996 | /* | |
3997 | * Commands even a read-only array can execute: | |
3998 | */ | |
3999 | switch (cmd) | |
4000 | { | |
4001 | case GET_ARRAY_INFO: | |
4002 | err = get_array_info(mddev, argp); | |
4003 | goto done_unlock; | |
4004 | ||
4005 | case GET_BITMAP_FILE: | |
4006 | err = get_bitmap_file(mddev, argp); | |
4007 | goto done_unlock; | |
4008 | ||
4009 | case GET_DISK_INFO: | |
4010 | err = get_disk_info(mddev, argp); | |
4011 | goto done_unlock; | |
4012 | ||
4013 | case RESTART_ARRAY_RW: | |
4014 | err = restart_array(mddev); | |
4015 | goto done_unlock; | |
4016 | ||
4017 | case STOP_ARRAY: | |
4018 | err = do_md_stop (mddev, 0); | |
4019 | goto done_unlock; | |
4020 | ||
4021 | case STOP_ARRAY_RO: | |
4022 | err = do_md_stop (mddev, 1); | |
4023 | goto done_unlock; | |
4024 | ||
4025 | /* | |
4026 | * We have a problem here : there is no easy way to give a CHS | |
4027 | * virtual geometry. We currently pretend that we have a 2 heads | |
4028 | * 4 sectors (with a BIG number of cylinders...). This drives | |
4029 | * dosfs just mad... ;-) | |
4030 | */ | |
4031 | } | |
4032 | ||
4033 | /* | |
4034 | * The remaining ioctls are changing the state of the | |
4035 | * superblock, so we do not allow them on read-only arrays. | |
4036 | * However non-MD ioctls (e.g. get-size) will still come through | |
4037 | * here and hit the 'default' below, so only disallow | |
4038 | * 'md' ioctls, and switch to rw mode if started auto-readonly. | |
4039 | */ | |
4040 | if (_IOC_TYPE(cmd) == MD_MAJOR && | |
4041 | mddev->ro && mddev->pers) { | |
4042 | if (mddev->ro == 2) { | |
4043 | mddev->ro = 0; | |
4044 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
4045 | md_wakeup_thread(mddev->thread); | |
4046 | ||
4047 | } else { | |
4048 | err = -EROFS; | |
4049 | goto abort_unlock; | |
4050 | } | |
4051 | } | |
4052 | ||
4053 | switch (cmd) | |
4054 | { | |
4055 | case ADD_NEW_DISK: | |
4056 | { | |
4057 | mdu_disk_info_t info; | |
4058 | if (copy_from_user(&info, argp, sizeof(info))) | |
4059 | err = -EFAULT; | |
4060 | else | |
4061 | err = add_new_disk(mddev, &info); | |
4062 | goto done_unlock; | |
4063 | } | |
4064 | ||
4065 | case HOT_REMOVE_DISK: | |
4066 | err = hot_remove_disk(mddev, new_decode_dev(arg)); | |
4067 | goto done_unlock; | |
4068 | ||
4069 | case HOT_ADD_DISK: | |
4070 | err = hot_add_disk(mddev, new_decode_dev(arg)); | |
4071 | goto done_unlock; | |
4072 | ||
4073 | case SET_DISK_FAULTY: | |
4074 | err = set_disk_faulty(mddev, new_decode_dev(arg)); | |
4075 | goto done_unlock; | |
4076 | ||
4077 | case RUN_ARRAY: | |
4078 | err = do_md_run (mddev); | |
4079 | goto done_unlock; | |
4080 | ||
4081 | case SET_BITMAP_FILE: | |
4082 | err = set_bitmap_file(mddev, (int)arg); | |
4083 | goto done_unlock; | |
4084 | ||
4085 | default: | |
4086 | err = -EINVAL; | |
4087 | goto abort_unlock; | |
4088 | } | |
4089 | ||
4090 | done_unlock: | |
4091 | abort_unlock: | |
4092 | mddev_unlock(mddev); | |
4093 | ||
4094 | return err; | |
4095 | done: | |
4096 | if (err) | |
4097 | MD_BUG(); | |
4098 | abort: | |
4099 | return err; | |
4100 | } | |
4101 | ||
4102 | static int md_open(struct inode *inode, struct file *file) | |
4103 | { | |
4104 | /* | |
4105 | * Succeed if we can lock the mddev, which confirms that | |
4106 | * it isn't being stopped right now. | |
4107 | */ | |
4108 | mddev_t *mddev = inode->i_bdev->bd_disk->private_data; | |
4109 | int err; | |
4110 | ||
4111 | if ((err = mddev_lock(mddev))) | |
4112 | goto out; | |
4113 | ||
4114 | err = 0; | |
4115 | mddev_get(mddev); | |
4116 | mddev_unlock(mddev); | |
4117 | ||
4118 | check_disk_change(inode->i_bdev); | |
4119 | out: | |
4120 | return err; | |
4121 | } | |
4122 | ||
4123 | static int md_release(struct inode *inode, struct file * file) | |
4124 | { | |
4125 | mddev_t *mddev = inode->i_bdev->bd_disk->private_data; | |
4126 | ||
4127 | if (!mddev) | |
4128 | BUG(); | |
4129 | mddev_put(mddev); | |
4130 | ||
4131 | return 0; | |
4132 | } | |
4133 | ||
4134 | static int md_media_changed(struct gendisk *disk) | |
4135 | { | |
4136 | mddev_t *mddev = disk->private_data; | |
4137 | ||
4138 | return mddev->changed; | |
4139 | } | |
4140 | ||
4141 | static int md_revalidate(struct gendisk *disk) | |
4142 | { | |
4143 | mddev_t *mddev = disk->private_data; | |
4144 | ||
4145 | mddev->changed = 0; | |
4146 | return 0; | |
4147 | } | |
4148 | static struct block_device_operations md_fops = | |
4149 | { | |
4150 | .owner = THIS_MODULE, | |
4151 | .open = md_open, | |
4152 | .release = md_release, | |
4153 | .ioctl = md_ioctl, | |
4154 | .getgeo = md_getgeo, | |
4155 | .media_changed = md_media_changed, | |
4156 | .revalidate_disk= md_revalidate, | |
4157 | }; | |
4158 | ||
4159 | static int md_thread(void * arg) | |
4160 | { | |
4161 | mdk_thread_t *thread = arg; | |
4162 | ||
4163 | /* | |
4164 | * md_thread is a 'system-thread', it's priority should be very | |
4165 | * high. We avoid resource deadlocks individually in each | |
4166 | * raid personality. (RAID5 does preallocation) We also use RR and | |
4167 | * the very same RT priority as kswapd, thus we will never get | |
4168 | * into a priority inversion deadlock. | |
4169 | * | |
4170 | * we definitely have to have equal or higher priority than | |
4171 | * bdflush, otherwise bdflush will deadlock if there are too | |
4172 | * many dirty RAID5 blocks. | |
4173 | */ | |
4174 | ||
4175 | allow_signal(SIGKILL); | |
4176 | while (!kthread_should_stop()) { | |
4177 | ||
4178 | /* We need to wait INTERRUPTIBLE so that | |
4179 | * we don't add to the load-average. | |
4180 | * That means we need to be sure no signals are | |
4181 | * pending | |
4182 | */ | |
4183 | if (signal_pending(current)) | |
4184 | flush_signals(current); | |
4185 | ||
4186 | wait_event_interruptible_timeout | |
4187 | (thread->wqueue, | |
4188 | test_bit(THREAD_WAKEUP, &thread->flags) | |
4189 | || kthread_should_stop(), | |
4190 | thread->timeout); | |
4191 | try_to_freeze(); | |
4192 | ||
4193 | clear_bit(THREAD_WAKEUP, &thread->flags); | |
4194 | ||
4195 | thread->run(thread->mddev); | |
4196 | } | |
4197 | ||
4198 | return 0; | |
4199 | } | |
4200 | ||
4201 | void md_wakeup_thread(mdk_thread_t *thread) | |
4202 | { | |
4203 | if (thread) { | |
4204 | dprintk("md: waking up MD thread %s.\n", thread->tsk->comm); | |
4205 | set_bit(THREAD_WAKEUP, &thread->flags); | |
4206 | wake_up(&thread->wqueue); | |
4207 | } | |
4208 | } | |
4209 | ||
4210 | mdk_thread_t *md_register_thread(void (*run) (mddev_t *), mddev_t *mddev, | |
4211 | const char *name) | |
4212 | { | |
4213 | mdk_thread_t *thread; | |
4214 | ||
4215 | thread = kzalloc(sizeof(mdk_thread_t), GFP_KERNEL); | |
4216 | if (!thread) | |
4217 | return NULL; | |
4218 | ||
4219 | init_waitqueue_head(&thread->wqueue); | |
4220 | ||
4221 | thread->run = run; | |
4222 | thread->mddev = mddev; | |
4223 | thread->timeout = MAX_SCHEDULE_TIMEOUT; | |
4224 | thread->tsk = kthread_run(md_thread, thread, name, mdname(thread->mddev)); | |
4225 | if (IS_ERR(thread->tsk)) { | |
4226 | kfree(thread); | |
4227 | return NULL; | |
4228 | } | |
4229 | return thread; | |
4230 | } | |
4231 | ||
4232 | void md_unregister_thread(mdk_thread_t *thread) | |
4233 | { | |
4234 | dprintk("interrupting MD-thread pid %d\n", thread->tsk->pid); | |
4235 | ||
4236 | kthread_stop(thread->tsk); | |
4237 | kfree(thread); | |
4238 | } | |
4239 | ||
4240 | void md_error(mddev_t *mddev, mdk_rdev_t *rdev) | |
4241 | { | |
4242 | if (!mddev) { | |
4243 | MD_BUG(); | |
4244 | return; | |
4245 | } | |
4246 | ||
4247 | if (!rdev || test_bit(Faulty, &rdev->flags)) | |
4248 | return; | |
4249 | /* | |
4250 | dprintk("md_error dev:%s, rdev:(%d:%d), (caller: %p,%p,%p,%p).\n", | |
4251 | mdname(mddev), | |
4252 | MAJOR(rdev->bdev->bd_dev), MINOR(rdev->bdev->bd_dev), | |
4253 | __builtin_return_address(0),__builtin_return_address(1), | |
4254 | __builtin_return_address(2),__builtin_return_address(3)); | |
4255 | */ | |
4256 | if (!mddev->pers->error_handler) | |
4257 | return; | |
4258 | mddev->pers->error_handler(mddev,rdev); | |
4259 | set_bit(MD_RECOVERY_INTR, &mddev->recovery); | |
4260 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
4261 | md_wakeup_thread(mddev->thread); | |
4262 | md_new_event_inintr(mddev); | |
4263 | } | |
4264 | ||
4265 | /* seq_file implementation /proc/mdstat */ | |
4266 | ||
4267 | static void status_unused(struct seq_file *seq) | |
4268 | { | |
4269 | int i = 0; | |
4270 | mdk_rdev_t *rdev; | |
4271 | struct list_head *tmp; | |
4272 | ||
4273 | seq_printf(seq, "unused devices: "); | |
4274 | ||
4275 | ITERATE_RDEV_PENDING(rdev,tmp) { | |
4276 | char b[BDEVNAME_SIZE]; | |
4277 | i++; | |
4278 | seq_printf(seq, "%s ", | |
4279 | bdevname(rdev->bdev,b)); | |
4280 | } | |
4281 | if (!i) | |
4282 | seq_printf(seq, "<none>"); | |
4283 | ||
4284 | seq_printf(seq, "\n"); | |
4285 | } | |
4286 | ||
4287 | ||
4288 | static void status_resync(struct seq_file *seq, mddev_t * mddev) | |
4289 | { | |
4290 | sector_t max_blocks, resync, res; | |
4291 | unsigned long dt, db, rt; | |
4292 | int scale; | |
4293 | unsigned int per_milli; | |
4294 | ||
4295 | resync = (mddev->curr_resync - atomic_read(&mddev->recovery_active))/2; | |
4296 | ||
4297 | if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) | |
4298 | max_blocks = mddev->resync_max_sectors >> 1; | |
4299 | else | |
4300 | max_blocks = mddev->size; | |
4301 | ||
4302 | /* | |
4303 | * Should not happen. | |
4304 | */ | |
4305 | if (!max_blocks) { | |
4306 | MD_BUG(); | |
4307 | return; | |
4308 | } | |
4309 | /* Pick 'scale' such that (resync>>scale)*1000 will fit | |
4310 | * in a sector_t, and (max_blocks>>scale) will fit in a | |
4311 | * u32, as those are the requirements for sector_div. | |
4312 | * Thus 'scale' must be at least 10 | |
4313 | */ | |
4314 | scale = 10; | |
4315 | if (sizeof(sector_t) > sizeof(unsigned long)) { | |
4316 | while ( max_blocks/2 > (1ULL<<(scale+32))) | |
4317 | scale++; | |
4318 | } | |
4319 | res = (resync>>scale)*1000; | |
4320 | sector_div(res, (u32)((max_blocks>>scale)+1)); | |
4321 | ||
4322 | per_milli = res; | |
4323 | { | |
4324 | int i, x = per_milli/50, y = 20-x; | |
4325 | seq_printf(seq, "["); | |
4326 | for (i = 0; i < x; i++) | |
4327 | seq_printf(seq, "="); | |
4328 | seq_printf(seq, ">"); | |
4329 | for (i = 0; i < y; i++) | |
4330 | seq_printf(seq, "."); | |
4331 | seq_printf(seq, "] "); | |
4332 | } | |
4333 | seq_printf(seq, " %s =%3u.%u%% (%llu/%llu)", | |
4334 | (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)? | |
4335 | "reshape" : | |
4336 | (test_bit(MD_RECOVERY_SYNC, &mddev->recovery) ? | |
4337 | "resync" : "recovery")), | |
4338 | per_milli/10, per_milli % 10, | |
4339 | (unsigned long long) resync, | |
4340 | (unsigned long long) max_blocks); | |
4341 | ||
4342 | /* | |
4343 | * We do not want to overflow, so the order of operands and | |
4344 | * the * 100 / 100 trick are important. We do a +1 to be | |
4345 | * safe against division by zero. We only estimate anyway. | |
4346 | * | |
4347 | * dt: time from mark until now | |
4348 | * db: blocks written from mark until now | |
4349 | * rt: remaining time | |
4350 | */ | |
4351 | dt = ((jiffies - mddev->resync_mark) / HZ); | |
4352 | if (!dt) dt++; | |
4353 | db = resync - (mddev->resync_mark_cnt/2); | |
4354 | rt = (dt * ((unsigned long)(max_blocks-resync) / (db/100+1)))/100; | |
4355 | ||
4356 | seq_printf(seq, " finish=%lu.%lumin", rt / 60, (rt % 60)/6); | |
4357 | ||
4358 | seq_printf(seq, " speed=%ldK/sec", db/dt); | |
4359 | } | |
4360 | ||
4361 | static void *md_seq_start(struct seq_file *seq, loff_t *pos) | |
4362 | { | |
4363 | struct list_head *tmp; | |
4364 | loff_t l = *pos; | |
4365 | mddev_t *mddev; | |
4366 | ||
4367 | if (l >= 0x10000) | |
4368 | return NULL; | |
4369 | if (!l--) | |
4370 | /* header */ | |
4371 | return (void*)1; | |
4372 | ||
4373 | spin_lock(&all_mddevs_lock); | |
4374 | list_for_each(tmp,&all_mddevs) | |
4375 | if (!l--) { | |
4376 | mddev = list_entry(tmp, mddev_t, all_mddevs); | |
4377 | mddev_get(mddev); | |
4378 | spin_unlock(&all_mddevs_lock); | |
4379 | return mddev; | |
4380 | } | |
4381 | spin_unlock(&all_mddevs_lock); | |
4382 | if (!l--) | |
4383 | return (void*)2;/* tail */ | |
4384 | return NULL; | |
4385 | } | |
4386 | ||
4387 | static void *md_seq_next(struct seq_file *seq, void *v, loff_t *pos) | |
4388 | { | |
4389 | struct list_head *tmp; | |
4390 | mddev_t *next_mddev, *mddev = v; | |
4391 | ||
4392 | ++*pos; | |
4393 | if (v == (void*)2) | |
4394 | return NULL; | |
4395 | ||
4396 | spin_lock(&all_mddevs_lock); | |
4397 | if (v == (void*)1) | |
4398 | tmp = all_mddevs.next; | |
4399 | else | |
4400 | tmp = mddev->all_mddevs.next; | |
4401 | if (tmp != &all_mddevs) | |
4402 | next_mddev = mddev_get(list_entry(tmp,mddev_t,all_mddevs)); | |
4403 | else { | |
4404 | next_mddev = (void*)2; | |
4405 | *pos = 0x10000; | |
4406 | } | |
4407 | spin_unlock(&all_mddevs_lock); | |
4408 | ||
4409 | if (v != (void*)1) | |
4410 | mddev_put(mddev); | |
4411 | return next_mddev; | |
4412 | ||
4413 | } | |
4414 | ||
4415 | static void md_seq_stop(struct seq_file *seq, void *v) | |
4416 | { | |
4417 | mddev_t *mddev = v; | |
4418 | ||
4419 | if (mddev && v != (void*)1 && v != (void*)2) | |
4420 | mddev_put(mddev); | |
4421 | } | |
4422 | ||
4423 | struct mdstat_info { | |
4424 | int event; | |
4425 | }; | |
4426 | ||
4427 | static int md_seq_show(struct seq_file *seq, void *v) | |
4428 | { | |
4429 | mddev_t *mddev = v; | |
4430 | sector_t size; | |
4431 | struct list_head *tmp2; | |
4432 | mdk_rdev_t *rdev; | |
4433 | struct mdstat_info *mi = seq->private; | |
4434 | struct bitmap *bitmap; | |
4435 | ||
4436 | if (v == (void*)1) { | |
4437 | struct mdk_personality *pers; | |
4438 | seq_printf(seq, "Personalities : "); | |
4439 | spin_lock(&pers_lock); | |
4440 | list_for_each_entry(pers, &pers_list, list) | |
4441 | seq_printf(seq, "[%s] ", pers->name); | |
4442 | ||
4443 | spin_unlock(&pers_lock); | |
4444 | seq_printf(seq, "\n"); | |
4445 | mi->event = atomic_read(&md_event_count); | |
4446 | return 0; | |
4447 | } | |
4448 | if (v == (void*)2) { | |
4449 | status_unused(seq); | |
4450 | return 0; | |
4451 | } | |
4452 | ||
4453 | if (mddev_lock(mddev) < 0) | |
4454 | return -EINTR; | |
4455 | ||
4456 | if (mddev->pers || mddev->raid_disks || !list_empty(&mddev->disks)) { | |
4457 | seq_printf(seq, "%s : %sactive", mdname(mddev), | |
4458 | mddev->pers ? "" : "in"); | |
4459 | if (mddev->pers) { | |
4460 | if (mddev->ro==1) | |
4461 | seq_printf(seq, " (read-only)"); | |
4462 | if (mddev->ro==2) | |
4463 | seq_printf(seq, "(auto-read-only)"); | |
4464 | seq_printf(seq, " %s", mddev->pers->name); | |
4465 | } | |
4466 | ||
4467 | size = 0; | |
4468 | ITERATE_RDEV(mddev,rdev,tmp2) { | |
4469 | char b[BDEVNAME_SIZE]; | |
4470 | seq_printf(seq, " %s[%d]", | |
4471 | bdevname(rdev->bdev,b), rdev->desc_nr); | |
4472 | if (test_bit(WriteMostly, &rdev->flags)) | |
4473 | seq_printf(seq, "(W)"); | |
4474 | if (test_bit(Faulty, &rdev->flags)) { | |
4475 | seq_printf(seq, "(F)"); | |
4476 | continue; | |
4477 | } else if (rdev->raid_disk < 0) | |
4478 | seq_printf(seq, "(S)"); /* spare */ | |
4479 | size += rdev->size; | |
4480 | } | |
4481 | ||
4482 | if (!list_empty(&mddev->disks)) { | |
4483 | if (mddev->pers) | |
4484 | seq_printf(seq, "\n %llu blocks", | |
4485 | (unsigned long long)mddev->array_size); | |
4486 | else | |
4487 | seq_printf(seq, "\n %llu blocks", | |
4488 | (unsigned long long)size); | |
4489 | } | |
4490 | if (mddev->persistent) { | |
4491 | if (mddev->major_version != 0 || | |
4492 | mddev->minor_version != 90) { | |
4493 | seq_printf(seq," super %d.%d", | |
4494 | mddev->major_version, | |
4495 | mddev->minor_version); | |
4496 | } | |
4497 | } else | |
4498 | seq_printf(seq, " super non-persistent"); | |
4499 | ||
4500 | if (mddev->pers) { | |
4501 | mddev->pers->status (seq, mddev); | |
4502 | seq_printf(seq, "\n "); | |
4503 | if (mddev->pers->sync_request) { | |
4504 | if (mddev->curr_resync > 2) { | |
4505 | status_resync (seq, mddev); | |
4506 | seq_printf(seq, "\n "); | |
4507 | } else if (mddev->curr_resync == 1 || mddev->curr_resync == 2) | |
4508 | seq_printf(seq, "\tresync=DELAYED\n "); | |
4509 | else if (mddev->recovery_cp < MaxSector) | |
4510 | seq_printf(seq, "\tresync=PENDING\n "); | |
4511 | } | |
4512 | } else | |
4513 | seq_printf(seq, "\n "); | |
4514 | ||
4515 | if ((bitmap = mddev->bitmap)) { | |
4516 | unsigned long chunk_kb; | |
4517 | unsigned long flags; | |
4518 | spin_lock_irqsave(&bitmap->lock, flags); | |
4519 | chunk_kb = bitmap->chunksize >> 10; | |
4520 | seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], " | |
4521 | "%lu%s chunk", | |
4522 | bitmap->pages - bitmap->missing_pages, | |
4523 | bitmap->pages, | |
4524 | (bitmap->pages - bitmap->missing_pages) | |
4525 | << (PAGE_SHIFT - 10), | |
4526 | chunk_kb ? chunk_kb : bitmap->chunksize, | |
4527 | chunk_kb ? "KB" : "B"); | |
4528 | if (bitmap->file) { | |
4529 | seq_printf(seq, ", file: "); | |
4530 | seq_path(seq, bitmap->file->f_vfsmnt, | |
4531 | bitmap->file->f_dentry," \t\n"); | |
4532 | } | |
4533 | ||
4534 | seq_printf(seq, "\n"); | |
4535 | spin_unlock_irqrestore(&bitmap->lock, flags); | |
4536 | } | |
4537 | ||
4538 | seq_printf(seq, "\n"); | |
4539 | } | |
4540 | mddev_unlock(mddev); | |
4541 | ||
4542 | return 0; | |
4543 | } | |
4544 | ||
4545 | static struct seq_operations md_seq_ops = { | |
4546 | .start = md_seq_start, | |
4547 | .next = md_seq_next, | |
4548 | .stop = md_seq_stop, | |
4549 | .show = md_seq_show, | |
4550 | }; | |
4551 | ||
4552 | static int md_seq_open(struct inode *inode, struct file *file) | |
4553 | { | |
4554 | int error; | |
4555 | struct mdstat_info *mi = kmalloc(sizeof(*mi), GFP_KERNEL); | |
4556 | if (mi == NULL) | |
4557 | return -ENOMEM; | |
4558 | ||
4559 | error = seq_open(file, &md_seq_ops); | |
4560 | if (error) | |
4561 | kfree(mi); | |
4562 | else { | |
4563 | struct seq_file *p = file->private_data; | |
4564 | p->private = mi; | |
4565 | mi->event = atomic_read(&md_event_count); | |
4566 | } | |
4567 | return error; | |
4568 | } | |
4569 | ||
4570 | static int md_seq_release(struct inode *inode, struct file *file) | |
4571 | { | |
4572 | struct seq_file *m = file->private_data; | |
4573 | struct mdstat_info *mi = m->private; | |
4574 | m->private = NULL; | |
4575 | kfree(mi); | |
4576 | return seq_release(inode, file); | |
4577 | } | |
4578 | ||
4579 | static unsigned int mdstat_poll(struct file *filp, poll_table *wait) | |
4580 | { | |
4581 | struct seq_file *m = filp->private_data; | |
4582 | struct mdstat_info *mi = m->private; | |
4583 | int mask; | |
4584 | ||
4585 | poll_wait(filp, &md_event_waiters, wait); | |
4586 | ||
4587 | /* always allow read */ | |
4588 | mask = POLLIN | POLLRDNORM; | |
4589 | ||
4590 | if (mi->event != atomic_read(&md_event_count)) | |
4591 | mask |= POLLERR | POLLPRI; | |
4592 | return mask; | |
4593 | } | |
4594 | ||
4595 | static struct file_operations md_seq_fops = { | |
4596 | .open = md_seq_open, | |
4597 | .read = seq_read, | |
4598 | .llseek = seq_lseek, | |
4599 | .release = md_seq_release, | |
4600 | .poll = mdstat_poll, | |
4601 | }; | |
4602 | ||
4603 | int register_md_personality(struct mdk_personality *p) | |
4604 | { | |
4605 | spin_lock(&pers_lock); | |
4606 | list_add_tail(&p->list, &pers_list); | |
4607 | printk(KERN_INFO "md: %s personality registered for level %d\n", p->name, p->level); | |
4608 | spin_unlock(&pers_lock); | |
4609 | return 0; | |
4610 | } | |
4611 | ||
4612 | int unregister_md_personality(struct mdk_personality *p) | |
4613 | { | |
4614 | printk(KERN_INFO "md: %s personality unregistered\n", p->name); | |
4615 | spin_lock(&pers_lock); | |
4616 | list_del_init(&p->list); | |
4617 | spin_unlock(&pers_lock); | |
4618 | return 0; | |
4619 | } | |
4620 | ||
4621 | static int is_mddev_idle(mddev_t *mddev) | |
4622 | { | |
4623 | mdk_rdev_t * rdev; | |
4624 | struct list_head *tmp; | |
4625 | int idle; | |
4626 | unsigned long curr_events; | |
4627 | ||
4628 | idle = 1; | |
4629 | ITERATE_RDEV(mddev,rdev,tmp) { | |
4630 | struct gendisk *disk = rdev->bdev->bd_contains->bd_disk; | |
4631 | curr_events = disk_stat_read(disk, sectors[0]) + | |
4632 | disk_stat_read(disk, sectors[1]) - | |
4633 | atomic_read(&disk->sync_io); | |
4634 | /* The difference between curr_events and last_events | |
4635 | * will be affected by any new non-sync IO (making | |
4636 | * curr_events bigger) and any difference in the amount of | |
4637 | * in-flight syncio (making current_events bigger or smaller) | |
4638 | * The amount in-flight is currently limited to | |
4639 | * 32*64K in raid1/10 and 256*PAGE_SIZE in raid5/6 | |
4640 | * which is at most 4096 sectors. | |
4641 | * These numbers are fairly fragile and should be made | |
4642 | * more robust, probably by enforcing the | |
4643 | * 'window size' that md_do_sync sort-of uses. | |
4644 | * | |
4645 | * Note: the following is an unsigned comparison. | |
4646 | */ | |
4647 | if ((curr_events - rdev->last_events + 4096) > 8192) { | |
4648 | rdev->last_events = curr_events; | |
4649 | idle = 0; | |
4650 | } | |
4651 | } | |
4652 | return idle; | |
4653 | } | |
4654 | ||
4655 | void md_done_sync(mddev_t *mddev, int blocks, int ok) | |
4656 | { | |
4657 | /* another "blocks" (512byte) blocks have been synced */ | |
4658 | atomic_sub(blocks, &mddev->recovery_active); | |
4659 | wake_up(&mddev->recovery_wait); | |
4660 | if (!ok) { | |
4661 | set_bit(MD_RECOVERY_ERR, &mddev->recovery); | |
4662 | md_wakeup_thread(mddev->thread); | |
4663 | // stop recovery, signal do_sync .... | |
4664 | } | |
4665 | } | |
4666 | ||
4667 | ||
4668 | /* md_write_start(mddev, bi) | |
4669 | * If we need to update some array metadata (e.g. 'active' flag | |
4670 | * in superblock) before writing, schedule a superblock update | |
4671 | * and wait for it to complete. | |
4672 | */ | |
4673 | void md_write_start(mddev_t *mddev, struct bio *bi) | |
4674 | { | |
4675 | if (bio_data_dir(bi) != WRITE) | |
4676 | return; | |
4677 | ||
4678 | BUG_ON(mddev->ro == 1); | |
4679 | if (mddev->ro == 2) { | |
4680 | /* need to switch to read/write */ | |
4681 | mddev->ro = 0; | |
4682 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
4683 | md_wakeup_thread(mddev->thread); | |
4684 | } | |
4685 | atomic_inc(&mddev->writes_pending); | |
4686 | if (mddev->in_sync) { | |
4687 | spin_lock_irq(&mddev->write_lock); | |
4688 | if (mddev->in_sync) { | |
4689 | mddev->in_sync = 0; | |
4690 | mddev->sb_dirty = 1; | |
4691 | md_wakeup_thread(mddev->thread); | |
4692 | } | |
4693 | spin_unlock_irq(&mddev->write_lock); | |
4694 | } | |
4695 | wait_event(mddev->sb_wait, mddev->sb_dirty==0); | |
4696 | } | |
4697 | ||
4698 | void md_write_end(mddev_t *mddev) | |
4699 | { | |
4700 | if (atomic_dec_and_test(&mddev->writes_pending)) { | |
4701 | if (mddev->safemode == 2) | |
4702 | md_wakeup_thread(mddev->thread); | |
4703 | else if (mddev->safemode_delay) | |
4704 | mod_timer(&mddev->safemode_timer, jiffies + mddev->safemode_delay); | |
4705 | } | |
4706 | } | |
4707 | ||
4708 | static DECLARE_WAIT_QUEUE_HEAD(resync_wait); | |
4709 | ||
4710 | #define SYNC_MARKS 10 | |
4711 | #define SYNC_MARK_STEP (3*HZ) | |
4712 | void md_do_sync(mddev_t *mddev) | |
4713 | { | |
4714 | mddev_t *mddev2; | |
4715 | unsigned int currspeed = 0, | |
4716 | window; | |
4717 | sector_t max_sectors,j, io_sectors; | |
4718 | unsigned long mark[SYNC_MARKS]; | |
4719 | sector_t mark_cnt[SYNC_MARKS]; | |
4720 | int last_mark,m; | |
4721 | struct list_head *tmp; | |
4722 | sector_t last_check; | |
4723 | int skipped = 0; | |
4724 | struct list_head *rtmp; | |
4725 | mdk_rdev_t *rdev; | |
4726 | ||
4727 | /* just incase thread restarts... */ | |
4728 | if (test_bit(MD_RECOVERY_DONE, &mddev->recovery)) | |
4729 | return; | |
4730 | if (mddev->ro) /* never try to sync a read-only array */ | |
4731 | return; | |
4732 | ||
4733 | /* we overload curr_resync somewhat here. | |
4734 | * 0 == not engaged in resync at all | |
4735 | * 2 == checking that there is no conflict with another sync | |
4736 | * 1 == like 2, but have yielded to allow conflicting resync to | |
4737 | * commense | |
4738 | * other == active in resync - this many blocks | |
4739 | * | |
4740 | * Before starting a resync we must have set curr_resync to | |
4741 | * 2, and then checked that every "conflicting" array has curr_resync | |
4742 | * less than ours. When we find one that is the same or higher | |
4743 | * we wait on resync_wait. To avoid deadlock, we reduce curr_resync | |
4744 | * to 1 if we choose to yield (based arbitrarily on address of mddev structure). | |
4745 | * This will mean we have to start checking from the beginning again. | |
4746 | * | |
4747 | */ | |
4748 | ||
4749 | do { | |
4750 | mddev->curr_resync = 2; | |
4751 | ||
4752 | try_again: | |
4753 | if (kthread_should_stop()) { | |
4754 | set_bit(MD_RECOVERY_INTR, &mddev->recovery); | |
4755 | goto skip; | |
4756 | } | |
4757 | ITERATE_MDDEV(mddev2,tmp) { | |
4758 | if (mddev2 == mddev) | |
4759 | continue; | |
4760 | if (mddev2->curr_resync && | |
4761 | match_mddev_units(mddev,mddev2)) { | |
4762 | DEFINE_WAIT(wq); | |
4763 | if (mddev < mddev2 && mddev->curr_resync == 2) { | |
4764 | /* arbitrarily yield */ | |
4765 | mddev->curr_resync = 1; | |
4766 | wake_up(&resync_wait); | |
4767 | } | |
4768 | if (mddev > mddev2 && mddev->curr_resync == 1) | |
4769 | /* no need to wait here, we can wait the next | |
4770 | * time 'round when curr_resync == 2 | |
4771 | */ | |
4772 | continue; | |
4773 | prepare_to_wait(&resync_wait, &wq, TASK_UNINTERRUPTIBLE); | |
4774 | if (!kthread_should_stop() && | |
4775 | mddev2->curr_resync >= mddev->curr_resync) { | |
4776 | printk(KERN_INFO "md: delaying resync of %s" | |
4777 | " until %s has finished resync (they" | |
4778 | " share one or more physical units)\n", | |
4779 | mdname(mddev), mdname(mddev2)); | |
4780 | mddev_put(mddev2); | |
4781 | schedule(); | |
4782 | finish_wait(&resync_wait, &wq); | |
4783 | goto try_again; | |
4784 | } | |
4785 | finish_wait(&resync_wait, &wq); | |
4786 | } | |
4787 | } | |
4788 | } while (mddev->curr_resync < 2); | |
4789 | ||
4790 | j = 0; | |
4791 | if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) { | |
4792 | /* resync follows the size requested by the personality, | |
4793 | * which defaults to physical size, but can be virtual size | |
4794 | */ | |
4795 | max_sectors = mddev->resync_max_sectors; | |
4796 | mddev->resync_mismatches = 0; | |
4797 | /* we don't use the checkpoint if there's a bitmap */ | |
4798 | if (!mddev->bitmap && | |
4799 | !test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery)) | |
4800 | j = mddev->recovery_cp; | |
4801 | } else if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)) | |
4802 | max_sectors = mddev->size << 1; | |
4803 | else { | |
4804 | /* recovery follows the physical size of devices */ | |
4805 | max_sectors = mddev->size << 1; | |
4806 | j = MaxSector; | |
4807 | ITERATE_RDEV(mddev,rdev,rtmp) | |
4808 | if (rdev->raid_disk >= 0 && | |
4809 | !test_bit(Faulty, &rdev->flags) && | |
4810 | !test_bit(In_sync, &rdev->flags) && | |
4811 | rdev->recovery_offset < j) | |
4812 | j = rdev->recovery_offset; | |
4813 | } | |
4814 | ||
4815 | printk(KERN_INFO "md: syncing RAID array %s\n", mdname(mddev)); | |
4816 | printk(KERN_INFO "md: minimum _guaranteed_ reconstruction speed:" | |
4817 | " %d KB/sec/disc.\n", speed_min(mddev)); | |
4818 | printk(KERN_INFO "md: using maximum available idle IO bandwidth " | |
4819 | "(but not more than %d KB/sec) for reconstruction.\n", | |
4820 | speed_max(mddev)); | |
4821 | ||
4822 | is_mddev_idle(mddev); /* this also initializes IO event counters */ | |
4823 | ||
4824 | io_sectors = 0; | |
4825 | for (m = 0; m < SYNC_MARKS; m++) { | |
4826 | mark[m] = jiffies; | |
4827 | mark_cnt[m] = io_sectors; | |
4828 | } | |
4829 | last_mark = 0; | |
4830 | mddev->resync_mark = mark[last_mark]; | |
4831 | mddev->resync_mark_cnt = mark_cnt[last_mark]; | |
4832 | ||
4833 | /* | |
4834 | * Tune reconstruction: | |
4835 | */ | |
4836 | window = 32*(PAGE_SIZE/512); | |
4837 | printk(KERN_INFO "md: using %dk window, over a total of %llu blocks.\n", | |
4838 | window/2,(unsigned long long) max_sectors/2); | |
4839 | ||
4840 | atomic_set(&mddev->recovery_active, 0); | |
4841 | init_waitqueue_head(&mddev->recovery_wait); | |
4842 | last_check = 0; | |
4843 | ||
4844 | if (j>2) { | |
4845 | printk(KERN_INFO | |
4846 | "md: resuming recovery of %s from checkpoint.\n", | |
4847 | mdname(mddev)); | |
4848 | mddev->curr_resync = j; | |
4849 | } | |
4850 | ||
4851 | while (j < max_sectors) { | |
4852 | sector_t sectors; | |
4853 | ||
4854 | skipped = 0; | |
4855 | sectors = mddev->pers->sync_request(mddev, j, &skipped, | |
4856 | currspeed < speed_min(mddev)); | |
4857 | if (sectors == 0) { | |
4858 | set_bit(MD_RECOVERY_ERR, &mddev->recovery); | |
4859 | goto out; | |
4860 | } | |
4861 | ||
4862 | if (!skipped) { /* actual IO requested */ | |
4863 | io_sectors += sectors; | |
4864 | atomic_add(sectors, &mddev->recovery_active); | |
4865 | } | |
4866 | ||
4867 | j += sectors; | |
4868 | if (j>1) mddev->curr_resync = j; | |
4869 | if (last_check == 0) | |
4870 | /* this is the earliers that rebuilt will be | |
4871 | * visible in /proc/mdstat | |
4872 | */ | |
4873 | md_new_event(mddev); | |
4874 | ||
4875 | if (last_check + window > io_sectors || j == max_sectors) | |
4876 | continue; | |
4877 | ||
4878 | last_check = io_sectors; | |
4879 | ||
4880 | if (test_bit(MD_RECOVERY_INTR, &mddev->recovery) || | |
4881 | test_bit(MD_RECOVERY_ERR, &mddev->recovery)) | |
4882 | break; | |
4883 | ||
4884 | repeat: | |
4885 | if (time_after_eq(jiffies, mark[last_mark] + SYNC_MARK_STEP )) { | |
4886 | /* step marks */ | |
4887 | int next = (last_mark+1) % SYNC_MARKS; | |
4888 | ||
4889 | mddev->resync_mark = mark[next]; | |
4890 | mddev->resync_mark_cnt = mark_cnt[next]; | |
4891 | mark[next] = jiffies; | |
4892 | mark_cnt[next] = io_sectors - atomic_read(&mddev->recovery_active); | |
4893 | last_mark = next; | |
4894 | } | |
4895 | ||
4896 | ||
4897 | if (kthread_should_stop()) { | |
4898 | /* | |
4899 | * got a signal, exit. | |
4900 | */ | |
4901 | printk(KERN_INFO | |
4902 | "md: md_do_sync() got signal ... exiting\n"); | |
4903 | set_bit(MD_RECOVERY_INTR, &mddev->recovery); | |
4904 | goto out; | |
4905 | } | |
4906 | ||
4907 | /* | |
4908 | * this loop exits only if either when we are slower than | |
4909 | * the 'hard' speed limit, or the system was IO-idle for | |
4910 | * a jiffy. | |
4911 | * the system might be non-idle CPU-wise, but we only care | |
4912 | * about not overloading the IO subsystem. (things like an | |
4913 | * e2fsck being done on the RAID array should execute fast) | |
4914 | */ | |
4915 | mddev->queue->unplug_fn(mddev->queue); | |
4916 | cond_resched(); | |
4917 | ||
4918 | currspeed = ((unsigned long)(io_sectors-mddev->resync_mark_cnt))/2 | |
4919 | /((jiffies-mddev->resync_mark)/HZ +1) +1; | |
4920 | ||
4921 | if (currspeed > speed_min(mddev)) { | |
4922 | if ((currspeed > speed_max(mddev)) || | |
4923 | !is_mddev_idle(mddev)) { | |
4924 | msleep(500); | |
4925 | goto repeat; | |
4926 | } | |
4927 | } | |
4928 | } | |
4929 | printk(KERN_INFO "md: %s: sync done.\n",mdname(mddev)); | |
4930 | /* | |
4931 | * this also signals 'finished resyncing' to md_stop | |
4932 | */ | |
4933 | out: | |
4934 | mddev->queue->unplug_fn(mddev->queue); | |
4935 | ||
4936 | wait_event(mddev->recovery_wait, !atomic_read(&mddev->recovery_active)); | |
4937 | ||
4938 | /* tell personality that we are finished */ | |
4939 | mddev->pers->sync_request(mddev, max_sectors, &skipped, 1); | |
4940 | ||
4941 | if (!test_bit(MD_RECOVERY_ERR, &mddev->recovery) && | |
4942 | test_bit(MD_RECOVERY_SYNC, &mddev->recovery) && | |
4943 | !test_bit(MD_RECOVERY_CHECK, &mddev->recovery) && | |
4944 | mddev->curr_resync > 2) { | |
4945 | if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) { | |
4946 | if (test_bit(MD_RECOVERY_INTR, &mddev->recovery)) { | |
4947 | if (mddev->curr_resync >= mddev->recovery_cp) { | |
4948 | printk(KERN_INFO | |
4949 | "md: checkpointing recovery of %s.\n", | |
4950 | mdname(mddev)); | |
4951 | mddev->recovery_cp = mddev->curr_resync; | |
4952 | } | |
4953 | } else | |
4954 | mddev->recovery_cp = MaxSector; | |
4955 | } else { | |
4956 | if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery)) | |
4957 | mddev->curr_resync = MaxSector; | |
4958 | ITERATE_RDEV(mddev,rdev,rtmp) | |
4959 | if (rdev->raid_disk >= 0 && | |
4960 | !test_bit(Faulty, &rdev->flags) && | |
4961 | !test_bit(In_sync, &rdev->flags) && | |
4962 | rdev->recovery_offset < mddev->curr_resync) | |
4963 | rdev->recovery_offset = mddev->curr_resync; | |
4964 | mddev->sb_dirty = 1; | |
4965 | } | |
4966 | } | |
4967 | ||
4968 | skip: | |
4969 | mddev->curr_resync = 0; | |
4970 | wake_up(&resync_wait); | |
4971 | set_bit(MD_RECOVERY_DONE, &mddev->recovery); | |
4972 | md_wakeup_thread(mddev->thread); | |
4973 | } | |
4974 | EXPORT_SYMBOL_GPL(md_do_sync); | |
4975 | ||
4976 | ||
4977 | /* | |
4978 | * This routine is regularly called by all per-raid-array threads to | |
4979 | * deal with generic issues like resync and super-block update. | |
4980 | * Raid personalities that don't have a thread (linear/raid0) do not | |
4981 | * need this as they never do any recovery or update the superblock. | |
4982 | * | |
4983 | * It does not do any resync itself, but rather "forks" off other threads | |
4984 | * to do that as needed. | |
4985 | * When it is determined that resync is needed, we set MD_RECOVERY_RUNNING in | |
4986 | * "->recovery" and create a thread at ->sync_thread. | |
4987 | * When the thread finishes it sets MD_RECOVERY_DONE (and might set MD_RECOVERY_ERR) | |
4988 | * and wakeups up this thread which will reap the thread and finish up. | |
4989 | * This thread also removes any faulty devices (with nr_pending == 0). | |
4990 | * | |
4991 | * The overall approach is: | |
4992 | * 1/ if the superblock needs updating, update it. | |
4993 | * 2/ If a recovery thread is running, don't do anything else. | |
4994 | * 3/ If recovery has finished, clean up, possibly marking spares active. | |
4995 | * 4/ If there are any faulty devices, remove them. | |
4996 | * 5/ If array is degraded, try to add spares devices | |
4997 | * 6/ If array has spares or is not in-sync, start a resync thread. | |
4998 | */ | |
4999 | void md_check_recovery(mddev_t *mddev) | |
5000 | { | |
5001 | mdk_rdev_t *rdev; | |
5002 | struct list_head *rtmp; | |
5003 | ||
5004 | ||
5005 | if (mddev->bitmap) | |
5006 | bitmap_daemon_work(mddev->bitmap); | |
5007 | ||
5008 | if (mddev->ro) | |
5009 | return; | |
5010 | ||
5011 | if (signal_pending(current)) { | |
5012 | if (mddev->pers->sync_request) { | |
5013 | printk(KERN_INFO "md: %s in immediate safe mode\n", | |
5014 | mdname(mddev)); | |
5015 | mddev->safemode = 2; | |
5016 | } | |
5017 | flush_signals(current); | |
5018 | } | |
5019 | ||
5020 | if ( ! ( | |
5021 | mddev->sb_dirty || | |
5022 | test_bit(MD_RECOVERY_NEEDED, &mddev->recovery) || | |
5023 | test_bit(MD_RECOVERY_DONE, &mddev->recovery) || | |
5024 | (mddev->safemode == 1) || | |
5025 | (mddev->safemode == 2 && ! atomic_read(&mddev->writes_pending) | |
5026 | && !mddev->in_sync && mddev->recovery_cp == MaxSector) | |
5027 | )) | |
5028 | return; | |
5029 | ||
5030 | if (mddev_trylock(mddev)) { | |
5031 | int spares =0; | |
5032 | ||
5033 | spin_lock_irq(&mddev->write_lock); | |
5034 | if (mddev->safemode && !atomic_read(&mddev->writes_pending) && | |
5035 | !mddev->in_sync && mddev->recovery_cp == MaxSector) { | |
5036 | mddev->in_sync = 1; | |
5037 | mddev->sb_dirty = 1; | |
5038 | } | |
5039 | if (mddev->safemode == 1) | |
5040 | mddev->safemode = 0; | |
5041 | spin_unlock_irq(&mddev->write_lock); | |
5042 | ||
5043 | if (mddev->sb_dirty) | |
5044 | md_update_sb(mddev); | |
5045 | ||
5046 | ||
5047 | if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) && | |
5048 | !test_bit(MD_RECOVERY_DONE, &mddev->recovery)) { | |
5049 | /* resync/recovery still happening */ | |
5050 | clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
5051 | goto unlock; | |
5052 | } | |
5053 | if (mddev->sync_thread) { | |
5054 | /* resync has finished, collect result */ | |
5055 | md_unregister_thread(mddev->sync_thread); | |
5056 | mddev->sync_thread = NULL; | |
5057 | if (!test_bit(MD_RECOVERY_ERR, &mddev->recovery) && | |
5058 | !test_bit(MD_RECOVERY_INTR, &mddev->recovery)) { | |
5059 | /* success...*/ | |
5060 | /* activate any spares */ | |
5061 | mddev->pers->spare_active(mddev); | |
5062 | } | |
5063 | md_update_sb(mddev); | |
5064 | ||
5065 | /* if array is no-longer degraded, then any saved_raid_disk | |
5066 | * information must be scrapped | |
5067 | */ | |
5068 | if (!mddev->degraded) | |
5069 | ITERATE_RDEV(mddev,rdev,rtmp) | |
5070 | rdev->saved_raid_disk = -1; | |
5071 | ||
5072 | mddev->recovery = 0; | |
5073 | /* flag recovery needed just to double check */ | |
5074 | set_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
5075 | md_new_event(mddev); | |
5076 | goto unlock; | |
5077 | } | |
5078 | /* Clear some bits that don't mean anything, but | |
5079 | * might be left set | |
5080 | */ | |
5081 | clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery); | |
5082 | clear_bit(MD_RECOVERY_ERR, &mddev->recovery); | |
5083 | clear_bit(MD_RECOVERY_INTR, &mddev->recovery); | |
5084 | clear_bit(MD_RECOVERY_DONE, &mddev->recovery); | |
5085 | ||
5086 | if (test_bit(MD_RECOVERY_FROZEN, &mddev->recovery)) | |
5087 | goto unlock; | |
5088 | /* no recovery is running. | |
5089 | * remove any failed drives, then | |
5090 | * add spares if possible. | |
5091 | * Spare are also removed and re-added, to allow | |
5092 | * the personality to fail the re-add. | |
5093 | */ | |
5094 | ITERATE_RDEV(mddev,rdev,rtmp) | |
5095 | if (rdev->raid_disk >= 0 && | |
5096 | (test_bit(Faulty, &rdev->flags) || ! test_bit(In_sync, &rdev->flags)) && | |
5097 | atomic_read(&rdev->nr_pending)==0) { | |
5098 | if (mddev->pers->hot_remove_disk(mddev, rdev->raid_disk)==0) { | |
5099 | char nm[20]; | |
5100 | sprintf(nm,"rd%d", rdev->raid_disk); | |
5101 | sysfs_remove_link(&mddev->kobj, nm); | |
5102 | rdev->raid_disk = -1; | |
5103 | } | |
5104 | } | |
5105 | ||
5106 | if (mddev->degraded) { | |
5107 | ITERATE_RDEV(mddev,rdev,rtmp) | |
5108 | if (rdev->raid_disk < 0 | |
5109 | && !test_bit(Faulty, &rdev->flags)) { | |
5110 | rdev->recovery_offset = 0; | |
5111 | if (mddev->pers->hot_add_disk(mddev,rdev)) { | |
5112 | char nm[20]; | |
5113 | sprintf(nm, "rd%d", rdev->raid_disk); | |
5114 | sysfs_create_link(&mddev->kobj, &rdev->kobj, nm); | |
5115 | spares++; | |
5116 | md_new_event(mddev); | |
5117 | } else | |
5118 | break; | |
5119 | } | |
5120 | } | |
5121 | ||
5122 | if (spares) { | |
5123 | clear_bit(MD_RECOVERY_SYNC, &mddev->recovery); | |
5124 | clear_bit(MD_RECOVERY_CHECK, &mddev->recovery); | |
5125 | } else if (mddev->recovery_cp < MaxSector) { | |
5126 | set_bit(MD_RECOVERY_SYNC, &mddev->recovery); | |
5127 | } else if (!test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) | |
5128 | /* nothing to be done ... */ | |
5129 | goto unlock; | |
5130 | ||
5131 | if (mddev->pers->sync_request) { | |
5132 | set_bit(MD_RECOVERY_RUNNING, &mddev->recovery); | |
5133 | if (spares && mddev->bitmap && ! mddev->bitmap->file) { | |
5134 | /* We are adding a device or devices to an array | |
5135 | * which has the bitmap stored on all devices. | |
5136 | * So make sure all bitmap pages get written | |
5137 | */ | |
5138 | bitmap_write_all(mddev->bitmap); | |
5139 | } | |
5140 | mddev->sync_thread = md_register_thread(md_do_sync, | |
5141 | mddev, | |
5142 | "%s_resync"); | |
5143 | if (!mddev->sync_thread) { | |
5144 | printk(KERN_ERR "%s: could not start resync" | |
5145 | " thread...\n", | |
5146 | mdname(mddev)); | |
5147 | /* leave the spares where they are, it shouldn't hurt */ | |
5148 | mddev->recovery = 0; | |
5149 | } else | |
5150 | md_wakeup_thread(mddev->sync_thread); | |
5151 | md_new_event(mddev); | |
5152 | } | |
5153 | unlock: | |
5154 | mddev_unlock(mddev); | |
5155 | } | |
5156 | } | |
5157 | ||
5158 | static int md_notify_reboot(struct notifier_block *this, | |
5159 | unsigned long code, void *x) | |
5160 | { | |
5161 | struct list_head *tmp; | |
5162 | mddev_t *mddev; | |
5163 | ||
5164 | if ((code == SYS_DOWN) || (code == SYS_HALT) || (code == SYS_POWER_OFF)) { | |
5165 | ||
5166 | printk(KERN_INFO "md: stopping all md devices.\n"); | |
5167 | ||
5168 | ITERATE_MDDEV(mddev,tmp) | |
5169 | if (mddev_trylock(mddev)) { | |
5170 | do_md_stop (mddev, 1); | |
5171 | mddev_unlock(mddev); | |
5172 | } | |
5173 | /* | |
5174 | * certain more exotic SCSI devices are known to be | |
5175 | * volatile wrt too early system reboots. While the | |
5176 | * right place to handle this issue is the given | |
5177 | * driver, we do want to have a safe RAID driver ... | |
5178 | */ | |
5179 | mdelay(1000*1); | |
5180 | } | |
5181 | return NOTIFY_DONE; | |
5182 | } | |
5183 | ||
5184 | static struct notifier_block md_notifier = { | |
5185 | .notifier_call = md_notify_reboot, | |
5186 | .next = NULL, | |
5187 | .priority = INT_MAX, /* before any real devices */ | |
5188 | }; | |
5189 | ||
5190 | static void md_geninit(void) | |
5191 | { | |
5192 | struct proc_dir_entry *p; | |
5193 | ||
5194 | dprintk("md: sizeof(mdp_super_t) = %d\n", (int)sizeof(mdp_super_t)); | |
5195 | ||
5196 | p = create_proc_entry("mdstat", S_IRUGO, NULL); | |
5197 | if (p) | |
5198 | p->proc_fops = &md_seq_fops; | |
5199 | } | |
5200 | ||
5201 | static int __init md_init(void) | |
5202 | { | |
5203 | int minor; | |
5204 | ||
5205 | printk(KERN_INFO "md: md driver %d.%d.%d MAX_MD_DEVS=%d," | |
5206 | " MD_SB_DISKS=%d\n", | |
5207 | MD_MAJOR_VERSION, MD_MINOR_VERSION, | |
5208 | MD_PATCHLEVEL_VERSION, MAX_MD_DEVS, MD_SB_DISKS); | |
5209 | printk(KERN_INFO "md: bitmap version %d.%d\n", BITMAP_MAJOR_HI, | |
5210 | BITMAP_MINOR); | |
5211 | ||
5212 | if (register_blkdev(MAJOR_NR, "md")) | |
5213 | return -1; | |
5214 | if ((mdp_major=register_blkdev(0, "mdp"))<=0) { | |
5215 | unregister_blkdev(MAJOR_NR, "md"); | |
5216 | return -1; | |
5217 | } | |
5218 | devfs_mk_dir("md"); | |
5219 | blk_register_region(MKDEV(MAJOR_NR, 0), MAX_MD_DEVS, THIS_MODULE, | |
5220 | md_probe, NULL, NULL); | |
5221 | blk_register_region(MKDEV(mdp_major, 0), MAX_MD_DEVS<<MdpMinorShift, THIS_MODULE, | |
5222 | md_probe, NULL, NULL); | |
5223 | ||
5224 | for (minor=0; minor < MAX_MD_DEVS; ++minor) | |
5225 | devfs_mk_bdev(MKDEV(MAJOR_NR, minor), | |
5226 | S_IFBLK|S_IRUSR|S_IWUSR, | |
5227 | "md/%d", minor); | |
5228 | ||
5229 | for (minor=0; minor < MAX_MD_DEVS; ++minor) | |
5230 | devfs_mk_bdev(MKDEV(mdp_major, minor<<MdpMinorShift), | |
5231 | S_IFBLK|S_IRUSR|S_IWUSR, | |
5232 | "md/mdp%d", minor); | |
5233 | ||
5234 | ||
5235 | register_reboot_notifier(&md_notifier); | |
5236 | raid_table_header = register_sysctl_table(raid_root_table, 1); | |
5237 | ||
5238 | md_geninit(); | |
5239 | return (0); | |
5240 | } | |
5241 | ||
5242 | ||
5243 | #ifndef MODULE | |
5244 | ||
5245 | /* | |
5246 | * Searches all registered partitions for autorun RAID arrays | |
5247 | * at boot time. | |
5248 | */ | |
5249 | static dev_t detected_devices[128]; | |
5250 | static int dev_cnt; | |
5251 | ||
5252 | void md_autodetect_dev(dev_t dev) | |
5253 | { | |
5254 | if (dev_cnt >= 0 && dev_cnt < 127) | |
5255 | detected_devices[dev_cnt++] = dev; | |
5256 | } | |
5257 | ||
5258 | ||
5259 | static void autostart_arrays(int part) | |
5260 | { | |
5261 | mdk_rdev_t *rdev; | |
5262 | int i; | |
5263 | ||
5264 | printk(KERN_INFO "md: Autodetecting RAID arrays.\n"); | |
5265 | ||
5266 | for (i = 0; i < dev_cnt; i++) { | |
5267 | dev_t dev = detected_devices[i]; | |
5268 | ||
5269 | rdev = md_import_device(dev,0, 0); | |
5270 | if (IS_ERR(rdev)) | |
5271 | continue; | |
5272 | ||
5273 | if (test_bit(Faulty, &rdev->flags)) { | |
5274 | MD_BUG(); | |
5275 | continue; | |
5276 | } | |
5277 | list_add(&rdev->same_set, &pending_raid_disks); | |
5278 | } | |
5279 | dev_cnt = 0; | |
5280 | ||
5281 | autorun_devices(part); | |
5282 | } | |
5283 | ||
5284 | #endif | |
5285 | ||
5286 | static __exit void md_exit(void) | |
5287 | { | |
5288 | mddev_t *mddev; | |
5289 | struct list_head *tmp; | |
5290 | int i; | |
5291 | blk_unregister_region(MKDEV(MAJOR_NR,0), MAX_MD_DEVS); | |
5292 | blk_unregister_region(MKDEV(mdp_major,0), MAX_MD_DEVS << MdpMinorShift); | |
5293 | for (i=0; i < MAX_MD_DEVS; i++) | |
5294 | devfs_remove("md/%d", i); | |
5295 | for (i=0; i < MAX_MD_DEVS; i++) | |
5296 | devfs_remove("md/d%d", i); | |
5297 | ||
5298 | devfs_remove("md"); | |
5299 | ||
5300 | unregister_blkdev(MAJOR_NR,"md"); | |
5301 | unregister_blkdev(mdp_major, "mdp"); | |
5302 | unregister_reboot_notifier(&md_notifier); | |
5303 | unregister_sysctl_table(raid_table_header); | |
5304 | remove_proc_entry("mdstat", NULL); | |
5305 | ITERATE_MDDEV(mddev,tmp) { | |
5306 | struct gendisk *disk = mddev->gendisk; | |
5307 | if (!disk) | |
5308 | continue; | |
5309 | export_array(mddev); | |
5310 | del_gendisk(disk); | |
5311 | put_disk(disk); | |
5312 | mddev->gendisk = NULL; | |
5313 | mddev_put(mddev); | |
5314 | } | |
5315 | } | |
5316 | ||
5317 | module_init(md_init) | |
5318 | module_exit(md_exit) | |
5319 | ||
5320 | static int get_ro(char *buffer, struct kernel_param *kp) | |
5321 | { | |
5322 | return sprintf(buffer, "%d", start_readonly); | |
5323 | } | |
5324 | static int set_ro(const char *val, struct kernel_param *kp) | |
5325 | { | |
5326 | char *e; | |
5327 | int num = simple_strtoul(val, &e, 10); | |
5328 | if (*val && (*e == '\0' || *e == '\n')) { | |
5329 | start_readonly = num; | |
5330 | return 0; | |
5331 | } | |
5332 | return -EINVAL; | |
5333 | } | |
5334 | ||
5335 | module_param_call(start_ro, set_ro, get_ro, NULL, 0600); | |
5336 | module_param(start_dirty_degraded, int, 0644); | |
5337 | ||
5338 | ||
5339 | EXPORT_SYMBOL(register_md_personality); | |
5340 | EXPORT_SYMBOL(unregister_md_personality); | |
5341 | EXPORT_SYMBOL(md_error); | |
5342 | EXPORT_SYMBOL(md_done_sync); | |
5343 | EXPORT_SYMBOL(md_write_start); | |
5344 | EXPORT_SYMBOL(md_write_end); | |
5345 | EXPORT_SYMBOL(md_register_thread); | |
5346 | EXPORT_SYMBOL(md_unregister_thread); | |
5347 | EXPORT_SYMBOL(md_wakeup_thread); | |
5348 | EXPORT_SYMBOL(md_print_devices); | |
5349 | EXPORT_SYMBOL(md_check_recovery); | |
5350 | MODULE_LICENSE("GPL"); | |
5351 | MODULE_ALIAS("md"); | |
5352 | MODULE_ALIAS_BLOCKDEV_MAJOR(MD_MAJOR); |