md.c 95 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015
  1. /*
  2. md.c : Multiple Devices driver for Linux
  3. Copyright (C) 1998, 1999, 2000 Ingo Molnar
  4. completely rewritten, based on the MD driver code from Marc Zyngier
  5. Changes:
  6. - RAID-1/RAID-5 extensions by Miguel de Icaza, Gadi Oxman, Ingo Molnar
  7. - RAID-6 extensions by H. Peter Anvin <hpa@zytor.com>
  8. - boot support for linear and striped mode by Harald Hoyer <HarryH@Royal.Net>
  9. - kerneld support by Boris Tobotras <boris@xtalk.msk.su>
  10. - kmod support by: Cyrus Durgin
  11. - RAID0 bugfixes: Mark Anthony Lisher <markal@iname.com>
  12. - Devfs support by Richard Gooch <rgooch@atnf.csiro.au>
  13. - lots of fixes and improvements to the RAID1/RAID5 and generic
  14. RAID code (such as request based resynchronization):
  15. Neil Brown <neilb@cse.unsw.edu.au>.
  16. - persistent bitmap code
  17. Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.
  18. This program is free software; you can redistribute it and/or modify
  19. it under the terms of the GNU General Public License as published by
  20. the Free Software Foundation; either version 2, or (at your option)
  21. any later version.
  22. You should have received a copy of the GNU General Public License
  23. (for example /usr/src/linux/COPYING); if not, write to the Free
  24. Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  25. */
  26. #include <linux/module.h>
  27. #include <linux/config.h>
  28. #include <linux/linkage.h>
  29. #include <linux/raid/md.h>
  30. #include <linux/raid/bitmap.h>
  31. #include <linux/sysctl.h>
  32. #include <linux/devfs_fs_kernel.h>
  33. #include <linux/buffer_head.h> /* for invalidate_bdev */
  34. #include <linux/suspend.h>
  35. #include <linux/init.h>
  36. #include <linux/file.h>
  37. #ifdef CONFIG_KMOD
  38. #include <linux/kmod.h>
  39. #endif
  40. #include <asm/unaligned.h>
  41. #define MAJOR_NR MD_MAJOR
  42. #define MD_DRIVER
  43. /* 63 partitions with the alternate major number (mdp) */
  44. #define MdpMinorShift 6
  45. #define DEBUG 0
  46. #define dprintk(x...) ((void)(DEBUG && printk(x)))
  47. #ifndef MODULE
  48. static void autostart_arrays (int part);
  49. #endif
  50. static mdk_personality_t *pers[MAX_PERSONALITY];
  51. static DEFINE_SPINLOCK(pers_lock);
  52. /*
  53. * Current RAID-1,4,5 parallel reconstruction 'guaranteed speed limit'
  54. * is 1000 KB/sec, so the extra system load does not show up that much.
  55. * Increase it if you want to have more _guaranteed_ speed. Note that
  56. * the RAID driver will use the maximum available bandwith if the IO
  57. * subsystem is idle. There is also an 'absolute maximum' reconstruction
  58. * speed limit - in case reconstruction slows down your system despite
  59. * idle IO detection.
  60. *
  61. * you can change it via /proc/sys/dev/raid/speed_limit_min and _max.
  62. */
  63. static int sysctl_speed_limit_min = 1000;
  64. static int sysctl_speed_limit_max = 200000;
  65. static struct ctl_table_header *raid_table_header;
  66. static ctl_table raid_table[] = {
  67. {
  68. .ctl_name = DEV_RAID_SPEED_LIMIT_MIN,
  69. .procname = "speed_limit_min",
  70. .data = &sysctl_speed_limit_min,
  71. .maxlen = sizeof(int),
  72. .mode = 0644,
  73. .proc_handler = &proc_dointvec,
  74. },
  75. {
  76. .ctl_name = DEV_RAID_SPEED_LIMIT_MAX,
  77. .procname = "speed_limit_max",
  78. .data = &sysctl_speed_limit_max,
  79. .maxlen = sizeof(int),
  80. .mode = 0644,
  81. .proc_handler = &proc_dointvec,
  82. },
  83. { .ctl_name = 0 }
  84. };
  85. static ctl_table raid_dir_table[] = {
  86. {
  87. .ctl_name = DEV_RAID,
  88. .procname = "raid",
  89. .maxlen = 0,
  90. .mode = 0555,
  91. .child = raid_table,
  92. },
  93. { .ctl_name = 0 }
  94. };
  95. static ctl_table raid_root_table[] = {
  96. {
  97. .ctl_name = CTL_DEV,
  98. .procname = "dev",
  99. .maxlen = 0,
  100. .mode = 0555,
  101. .child = raid_dir_table,
  102. },
  103. { .ctl_name = 0 }
  104. };
  105. static struct block_device_operations md_fops;
  106. /*
  107. * Enables to iterate over all existing md arrays
  108. * all_mddevs_lock protects this list.
  109. */
  110. static LIST_HEAD(all_mddevs);
  111. static DEFINE_SPINLOCK(all_mddevs_lock);
  112. /*
  113. * iterates through all used mddevs in the system.
  114. * We take care to grab the all_mddevs_lock whenever navigating
  115. * the list, and to always hold a refcount when unlocked.
  116. * Any code which breaks out of this loop while own
  117. * a reference to the current mddev and must mddev_put it.
  118. */
  119. #define ITERATE_MDDEV(mddev,tmp) \
  120. \
  121. for (({ spin_lock(&all_mddevs_lock); \
  122. tmp = all_mddevs.next; \
  123. mddev = NULL;}); \
  124. ({ if (tmp != &all_mddevs) \
  125. mddev_get(list_entry(tmp, mddev_t, all_mddevs));\
  126. spin_unlock(&all_mddevs_lock); \
  127. if (mddev) mddev_put(mddev); \
  128. mddev = list_entry(tmp, mddev_t, all_mddevs); \
  129. tmp != &all_mddevs;}); \
  130. ({ spin_lock(&all_mddevs_lock); \
  131. tmp = tmp->next;}) \
  132. )
  133. static int md_fail_request (request_queue_t *q, struct bio *bio)
  134. {
  135. bio_io_error(bio, bio->bi_size);
  136. return 0;
  137. }
  138. static inline mddev_t *mddev_get(mddev_t *mddev)
  139. {
  140. atomic_inc(&mddev->active);
  141. return mddev;
  142. }
  143. static void mddev_put(mddev_t *mddev)
  144. {
  145. if (!atomic_dec_and_lock(&mddev->active, &all_mddevs_lock))
  146. return;
  147. if (!mddev->raid_disks && list_empty(&mddev->disks)) {
  148. list_del(&mddev->all_mddevs);
  149. blk_put_queue(mddev->queue);
  150. kfree(mddev);
  151. }
  152. spin_unlock(&all_mddevs_lock);
  153. }
  154. static mddev_t * mddev_find(dev_t unit)
  155. {
  156. mddev_t *mddev, *new = NULL;
  157. retry:
  158. spin_lock(&all_mddevs_lock);
  159. list_for_each_entry(mddev, &all_mddevs, all_mddevs)
  160. if (mddev->unit == unit) {
  161. mddev_get(mddev);
  162. spin_unlock(&all_mddevs_lock);
  163. kfree(new);
  164. return mddev;
  165. }
  166. if (new) {
  167. list_add(&new->all_mddevs, &all_mddevs);
  168. spin_unlock(&all_mddevs_lock);
  169. return new;
  170. }
  171. spin_unlock(&all_mddevs_lock);
  172. new = (mddev_t *) kmalloc(sizeof(*new), GFP_KERNEL);
  173. if (!new)
  174. return NULL;
  175. memset(new, 0, sizeof(*new));
  176. new->unit = unit;
  177. if (MAJOR(unit) == MD_MAJOR)
  178. new->md_minor = MINOR(unit);
  179. else
  180. new->md_minor = MINOR(unit) >> MdpMinorShift;
  181. init_MUTEX(&new->reconfig_sem);
  182. INIT_LIST_HEAD(&new->disks);
  183. INIT_LIST_HEAD(&new->all_mddevs);
  184. init_timer(&new->safemode_timer);
  185. atomic_set(&new->active, 1);
  186. spin_lock_init(&new->write_lock);
  187. init_waitqueue_head(&new->sb_wait);
  188. new->queue = blk_alloc_queue(GFP_KERNEL);
  189. if (!new->queue) {
  190. kfree(new);
  191. return NULL;
  192. }
  193. blk_queue_make_request(new->queue, md_fail_request);
  194. goto retry;
  195. }
  196. static inline int mddev_lock(mddev_t * mddev)
  197. {
  198. return down_interruptible(&mddev->reconfig_sem);
  199. }
  200. static inline void mddev_lock_uninterruptible(mddev_t * mddev)
  201. {
  202. down(&mddev->reconfig_sem);
  203. }
  204. static inline int mddev_trylock(mddev_t * mddev)
  205. {
  206. return down_trylock(&mddev->reconfig_sem);
  207. }
  208. static inline void mddev_unlock(mddev_t * mddev)
  209. {
  210. up(&mddev->reconfig_sem);
  211. md_wakeup_thread(mddev->thread);
  212. }
  213. mdk_rdev_t * find_rdev_nr(mddev_t *mddev, int nr)
  214. {
  215. mdk_rdev_t * rdev;
  216. struct list_head *tmp;
  217. ITERATE_RDEV(mddev,rdev,tmp) {
  218. if (rdev->desc_nr == nr)
  219. return rdev;
  220. }
  221. return NULL;
  222. }
  223. static mdk_rdev_t * find_rdev(mddev_t * mddev, dev_t dev)
  224. {
  225. struct list_head *tmp;
  226. mdk_rdev_t *rdev;
  227. ITERATE_RDEV(mddev,rdev,tmp) {
  228. if (rdev->bdev->bd_dev == dev)
  229. return rdev;
  230. }
  231. return NULL;
  232. }
  233. static inline sector_t calc_dev_sboffset(struct block_device *bdev)
  234. {
  235. sector_t size = bdev->bd_inode->i_size >> BLOCK_SIZE_BITS;
  236. return MD_NEW_SIZE_BLOCKS(size);
  237. }
  238. static sector_t calc_dev_size(mdk_rdev_t *rdev, unsigned chunk_size)
  239. {
  240. sector_t size;
  241. size = rdev->sb_offset;
  242. if (chunk_size)
  243. size &= ~((sector_t)chunk_size/1024 - 1);
  244. return size;
  245. }
  246. static int alloc_disk_sb(mdk_rdev_t * rdev)
  247. {
  248. if (rdev->sb_page)
  249. MD_BUG();
  250. rdev->sb_page = alloc_page(GFP_KERNEL);
  251. if (!rdev->sb_page) {
  252. printk(KERN_ALERT "md: out of memory.\n");
  253. return -EINVAL;
  254. }
  255. return 0;
  256. }
  257. static void free_disk_sb(mdk_rdev_t * rdev)
  258. {
  259. if (rdev->sb_page) {
  260. page_cache_release(rdev->sb_page);
  261. rdev->sb_loaded = 0;
  262. rdev->sb_page = NULL;
  263. rdev->sb_offset = 0;
  264. rdev->size = 0;
  265. }
  266. }
  267. static int super_written(struct bio *bio, unsigned int bytes_done, int error)
  268. {
  269. mdk_rdev_t *rdev = bio->bi_private;
  270. if (bio->bi_size)
  271. return 1;
  272. if (error || !test_bit(BIO_UPTODATE, &bio->bi_flags))
  273. md_error(rdev->mddev, rdev);
  274. if (atomic_dec_and_test(&rdev->mddev->pending_writes))
  275. wake_up(&rdev->mddev->sb_wait);
  276. bio_put(bio);
  277. return 0;
  278. }
  279. void md_super_write(mddev_t *mddev, mdk_rdev_t *rdev,
  280. sector_t sector, int size, struct page *page)
  281. {
  282. /* write first size bytes of page to sector of rdev
  283. * Increment mddev->pending_writes before returning
  284. * and decrement it on completion, waking up sb_wait
  285. * if zero is reached.
  286. * If an error occurred, call md_error
  287. */
  288. struct bio *bio = bio_alloc(GFP_NOIO, 1);
  289. bio->bi_bdev = rdev->bdev;
  290. bio->bi_sector = sector;
  291. bio_add_page(bio, page, size, 0);
  292. bio->bi_private = rdev;
  293. bio->bi_end_io = super_written;
  294. atomic_inc(&mddev->pending_writes);
  295. submit_bio((1<<BIO_RW)|(1<<BIO_RW_SYNC), bio);
  296. }
  297. static int bi_complete(struct bio *bio, unsigned int bytes_done, int error)
  298. {
  299. if (bio->bi_size)
  300. return 1;
  301. complete((struct completion*)bio->bi_private);
  302. return 0;
  303. }
  304. int sync_page_io(struct block_device *bdev, sector_t sector, int size,
  305. struct page *page, int rw)
  306. {
  307. struct bio *bio = bio_alloc(GFP_NOIO, 1);
  308. struct completion event;
  309. int ret;
  310. rw |= (1 << BIO_RW_SYNC);
  311. bio->bi_bdev = bdev;
  312. bio->bi_sector = sector;
  313. bio_add_page(bio, page, size, 0);
  314. init_completion(&event);
  315. bio->bi_private = &event;
  316. bio->bi_end_io = bi_complete;
  317. submit_bio(rw, bio);
  318. wait_for_completion(&event);
  319. ret = test_bit(BIO_UPTODATE, &bio->bi_flags);
  320. bio_put(bio);
  321. return ret;
  322. }
  323. static int read_disk_sb(mdk_rdev_t * rdev)
  324. {
  325. char b[BDEVNAME_SIZE];
  326. if (!rdev->sb_page) {
  327. MD_BUG();
  328. return -EINVAL;
  329. }
  330. if (rdev->sb_loaded)
  331. return 0;
  332. if (!sync_page_io(rdev->bdev, rdev->sb_offset<<1, MD_SB_BYTES, rdev->sb_page, READ))
  333. goto fail;
  334. rdev->sb_loaded = 1;
  335. return 0;
  336. fail:
  337. printk(KERN_WARNING "md: disabled device %s, could not read superblock.\n",
  338. bdevname(rdev->bdev,b));
  339. return -EINVAL;
  340. }
  341. static int uuid_equal(mdp_super_t *sb1, mdp_super_t *sb2)
  342. {
  343. if ( (sb1->set_uuid0 == sb2->set_uuid0) &&
  344. (sb1->set_uuid1 == sb2->set_uuid1) &&
  345. (sb1->set_uuid2 == sb2->set_uuid2) &&
  346. (sb1->set_uuid3 == sb2->set_uuid3))
  347. return 1;
  348. return 0;
  349. }
  350. static int sb_equal(mdp_super_t *sb1, mdp_super_t *sb2)
  351. {
  352. int ret;
  353. mdp_super_t *tmp1, *tmp2;
  354. tmp1 = kmalloc(sizeof(*tmp1),GFP_KERNEL);
  355. tmp2 = kmalloc(sizeof(*tmp2),GFP_KERNEL);
  356. if (!tmp1 || !tmp2) {
  357. ret = 0;
  358. printk(KERN_INFO "md.c: sb1 is not equal to sb2!\n");
  359. goto abort;
  360. }
  361. *tmp1 = *sb1;
  362. *tmp2 = *sb2;
  363. /*
  364. * nr_disks is not constant
  365. */
  366. tmp1->nr_disks = 0;
  367. tmp2->nr_disks = 0;
  368. if (memcmp(tmp1, tmp2, MD_SB_GENERIC_CONSTANT_WORDS * 4))
  369. ret = 0;
  370. else
  371. ret = 1;
  372. abort:
  373. kfree(tmp1);
  374. kfree(tmp2);
  375. return ret;
  376. }
  377. static unsigned int calc_sb_csum(mdp_super_t * sb)
  378. {
  379. unsigned int disk_csum, csum;
  380. disk_csum = sb->sb_csum;
  381. sb->sb_csum = 0;
  382. csum = csum_partial((void *)sb, MD_SB_BYTES, 0);
  383. sb->sb_csum = disk_csum;
  384. return csum;
  385. }
  386. /*
  387. * Handle superblock details.
  388. * We want to be able to handle multiple superblock formats
  389. * so we have a common interface to them all, and an array of
  390. * different handlers.
  391. * We rely on user-space to write the initial superblock, and support
  392. * reading and updating of superblocks.
  393. * Interface methods are:
  394. * int load_super(mdk_rdev_t *dev, mdk_rdev_t *refdev, int minor_version)
  395. * loads and validates a superblock on dev.
  396. * if refdev != NULL, compare superblocks on both devices
  397. * Return:
  398. * 0 - dev has a superblock that is compatible with refdev
  399. * 1 - dev has a superblock that is compatible and newer than refdev
  400. * so dev should be used as the refdev in future
  401. * -EINVAL superblock incompatible or invalid
  402. * -othererror e.g. -EIO
  403. *
  404. * int validate_super(mddev_t *mddev, mdk_rdev_t *dev)
  405. * Verify that dev is acceptable into mddev.
  406. * The first time, mddev->raid_disks will be 0, and data from
  407. * dev should be merged in. Subsequent calls check that dev
  408. * is new enough. Return 0 or -EINVAL
  409. *
  410. * void sync_super(mddev_t *mddev, mdk_rdev_t *dev)
  411. * Update the superblock for rdev with data in mddev
  412. * This does not write to disc.
  413. *
  414. */
  415. struct super_type {
  416. char *name;
  417. struct module *owner;
  418. int (*load_super)(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version);
  419. int (*validate_super)(mddev_t *mddev, mdk_rdev_t *rdev);
  420. void (*sync_super)(mddev_t *mddev, mdk_rdev_t *rdev);
  421. };
  422. /*
  423. * load_super for 0.90.0
  424. */
  425. static int super_90_load(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version)
  426. {
  427. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  428. mdp_super_t *sb;
  429. int ret;
  430. sector_t sb_offset;
  431. /*
  432. * Calculate the position of the superblock,
  433. * it's at the end of the disk.
  434. *
  435. * It also happens to be a multiple of 4Kb.
  436. */
  437. sb_offset = calc_dev_sboffset(rdev->bdev);
  438. rdev->sb_offset = sb_offset;
  439. ret = read_disk_sb(rdev);
  440. if (ret) return ret;
  441. ret = -EINVAL;
  442. bdevname(rdev->bdev, b);
  443. sb = (mdp_super_t*)page_address(rdev->sb_page);
  444. if (sb->md_magic != MD_SB_MAGIC) {
  445. printk(KERN_ERR "md: invalid raid superblock magic on %s\n",
  446. b);
  447. goto abort;
  448. }
  449. if (sb->major_version != 0 ||
  450. sb->minor_version != 90) {
  451. printk(KERN_WARNING "Bad version number %d.%d on %s\n",
  452. sb->major_version, sb->minor_version,
  453. b);
  454. goto abort;
  455. }
  456. if (sb->raid_disks <= 0)
  457. goto abort;
  458. if (csum_fold(calc_sb_csum(sb)) != csum_fold(sb->sb_csum)) {
  459. printk(KERN_WARNING "md: invalid superblock checksum on %s\n",
  460. b);
  461. goto abort;
  462. }
  463. rdev->preferred_minor = sb->md_minor;
  464. rdev->data_offset = 0;
  465. if (sb->level == LEVEL_MULTIPATH)
  466. rdev->desc_nr = -1;
  467. else
  468. rdev->desc_nr = sb->this_disk.number;
  469. if (refdev == 0)
  470. ret = 1;
  471. else {
  472. __u64 ev1, ev2;
  473. mdp_super_t *refsb = (mdp_super_t*)page_address(refdev->sb_page);
  474. if (!uuid_equal(refsb, sb)) {
  475. printk(KERN_WARNING "md: %s has different UUID to %s\n",
  476. b, bdevname(refdev->bdev,b2));
  477. goto abort;
  478. }
  479. if (!sb_equal(refsb, sb)) {
  480. printk(KERN_WARNING "md: %s has same UUID"
  481. " but different superblock to %s\n",
  482. b, bdevname(refdev->bdev, b2));
  483. goto abort;
  484. }
  485. ev1 = md_event(sb);
  486. ev2 = md_event(refsb);
  487. if (ev1 > ev2)
  488. ret = 1;
  489. else
  490. ret = 0;
  491. }
  492. rdev->size = calc_dev_size(rdev, sb->chunk_size);
  493. abort:
  494. return ret;
  495. }
  496. /*
  497. * validate_super for 0.90.0
  498. */
  499. static int super_90_validate(mddev_t *mddev, mdk_rdev_t *rdev)
  500. {
  501. mdp_disk_t *desc;
  502. mdp_super_t *sb = (mdp_super_t *)page_address(rdev->sb_page);
  503. rdev->raid_disk = -1;
  504. rdev->in_sync = 0;
  505. if (mddev->raid_disks == 0) {
  506. mddev->major_version = 0;
  507. mddev->minor_version = sb->minor_version;
  508. mddev->patch_version = sb->patch_version;
  509. mddev->persistent = ! sb->not_persistent;
  510. mddev->chunk_size = sb->chunk_size;
  511. mddev->ctime = sb->ctime;
  512. mddev->utime = sb->utime;
  513. mddev->level = sb->level;
  514. mddev->layout = sb->layout;
  515. mddev->raid_disks = sb->raid_disks;
  516. mddev->size = sb->size;
  517. mddev->events = md_event(sb);
  518. mddev->bitmap_offset = 0;
  519. if (sb->state & (1<<MD_SB_CLEAN))
  520. mddev->recovery_cp = MaxSector;
  521. else {
  522. if (sb->events_hi == sb->cp_events_hi &&
  523. sb->events_lo == sb->cp_events_lo) {
  524. mddev->recovery_cp = sb->recovery_cp;
  525. } else
  526. mddev->recovery_cp = 0;
  527. }
  528. memcpy(mddev->uuid+0, &sb->set_uuid0, 4);
  529. memcpy(mddev->uuid+4, &sb->set_uuid1, 4);
  530. memcpy(mddev->uuid+8, &sb->set_uuid2, 4);
  531. memcpy(mddev->uuid+12,&sb->set_uuid3, 4);
  532. mddev->max_disks = MD_SB_DISKS;
  533. if (sb->state & (1<<MD_SB_BITMAP_PRESENT) &&
  534. mddev->bitmap_file == NULL) {
  535. if (mddev->level != 1) {
  536. /* FIXME use a better test */
  537. printk(KERN_WARNING "md: bitmaps only support for raid1\n");
  538. return -EINVAL;
  539. }
  540. mddev->bitmap_offset = (MD_SB_BYTES >> 9);
  541. }
  542. } else if (mddev->pers == NULL) {
  543. /* Insist on good event counter while assembling */
  544. __u64 ev1 = md_event(sb);
  545. ++ev1;
  546. if (ev1 < mddev->events)
  547. return -EINVAL;
  548. } else if (mddev->bitmap) {
  549. /* if adding to array with a bitmap, then we can accept an
  550. * older device ... but not too old.
  551. */
  552. __u64 ev1 = md_event(sb);
  553. if (ev1 < mddev->bitmap->events_cleared)
  554. return 0;
  555. } else /* just a hot-add of a new device, leave raid_disk at -1 */
  556. return 0;
  557. if (mddev->level != LEVEL_MULTIPATH) {
  558. rdev->faulty = 0;
  559. desc = sb->disks + rdev->desc_nr;
  560. if (desc->state & (1<<MD_DISK_FAULTY))
  561. rdev->faulty = 1;
  562. else if (desc->state & (1<<MD_DISK_SYNC) &&
  563. desc->raid_disk < mddev->raid_disks) {
  564. rdev->in_sync = 1;
  565. rdev->raid_disk = desc->raid_disk;
  566. }
  567. } else /* MULTIPATH are always insync */
  568. rdev->in_sync = 1;
  569. return 0;
  570. }
  571. /*
  572. * sync_super for 0.90.0
  573. */
  574. static void super_90_sync(mddev_t *mddev, mdk_rdev_t *rdev)
  575. {
  576. mdp_super_t *sb;
  577. struct list_head *tmp;
  578. mdk_rdev_t *rdev2;
  579. int next_spare = mddev->raid_disks;
  580. /* make rdev->sb match mddev data..
  581. *
  582. * 1/ zero out disks
  583. * 2/ Add info for each disk, keeping track of highest desc_nr (next_spare);
  584. * 3/ any empty disks < next_spare become removed
  585. *
  586. * disks[0] gets initialised to REMOVED because
  587. * we cannot be sure from other fields if it has
  588. * been initialised or not.
  589. */
  590. int i;
  591. int active=0, working=0,failed=0,spare=0,nr_disks=0;
  592. sb = (mdp_super_t*)page_address(rdev->sb_page);
  593. memset(sb, 0, sizeof(*sb));
  594. sb->md_magic = MD_SB_MAGIC;
  595. sb->major_version = mddev->major_version;
  596. sb->minor_version = mddev->minor_version;
  597. sb->patch_version = mddev->patch_version;
  598. sb->gvalid_words = 0; /* ignored */
  599. memcpy(&sb->set_uuid0, mddev->uuid+0, 4);
  600. memcpy(&sb->set_uuid1, mddev->uuid+4, 4);
  601. memcpy(&sb->set_uuid2, mddev->uuid+8, 4);
  602. memcpy(&sb->set_uuid3, mddev->uuid+12,4);
  603. sb->ctime = mddev->ctime;
  604. sb->level = mddev->level;
  605. sb->size = mddev->size;
  606. sb->raid_disks = mddev->raid_disks;
  607. sb->md_minor = mddev->md_minor;
  608. sb->not_persistent = !mddev->persistent;
  609. sb->utime = mddev->utime;
  610. sb->state = 0;
  611. sb->events_hi = (mddev->events>>32);
  612. sb->events_lo = (u32)mddev->events;
  613. if (mddev->in_sync)
  614. {
  615. sb->recovery_cp = mddev->recovery_cp;
  616. sb->cp_events_hi = (mddev->events>>32);
  617. sb->cp_events_lo = (u32)mddev->events;
  618. if (mddev->recovery_cp == MaxSector)
  619. sb->state = (1<< MD_SB_CLEAN);
  620. } else
  621. sb->recovery_cp = 0;
  622. sb->layout = mddev->layout;
  623. sb->chunk_size = mddev->chunk_size;
  624. if (mddev->bitmap && mddev->bitmap_file == NULL)
  625. sb->state |= (1<<MD_SB_BITMAP_PRESENT);
  626. sb->disks[0].state = (1<<MD_DISK_REMOVED);
  627. ITERATE_RDEV(mddev,rdev2,tmp) {
  628. mdp_disk_t *d;
  629. if (rdev2->raid_disk >= 0 && rdev2->in_sync && !rdev2->faulty)
  630. rdev2->desc_nr = rdev2->raid_disk;
  631. else
  632. rdev2->desc_nr = next_spare++;
  633. d = &sb->disks[rdev2->desc_nr];
  634. nr_disks++;
  635. d->number = rdev2->desc_nr;
  636. d->major = MAJOR(rdev2->bdev->bd_dev);
  637. d->minor = MINOR(rdev2->bdev->bd_dev);
  638. if (rdev2->raid_disk >= 0 && rdev->in_sync && !rdev2->faulty)
  639. d->raid_disk = rdev2->raid_disk;
  640. else
  641. d->raid_disk = rdev2->desc_nr; /* compatibility */
  642. if (rdev2->faulty) {
  643. d->state = (1<<MD_DISK_FAULTY);
  644. failed++;
  645. } else if (rdev2->in_sync) {
  646. d->state = (1<<MD_DISK_ACTIVE);
  647. d->state |= (1<<MD_DISK_SYNC);
  648. active++;
  649. working++;
  650. } else {
  651. d->state = 0;
  652. spare++;
  653. working++;
  654. }
  655. }
  656. /* now set the "removed" and "faulty" bits on any missing devices */
  657. for (i=0 ; i < mddev->raid_disks ; i++) {
  658. mdp_disk_t *d = &sb->disks[i];
  659. if (d->state == 0 && d->number == 0) {
  660. d->number = i;
  661. d->raid_disk = i;
  662. d->state = (1<<MD_DISK_REMOVED);
  663. d->state |= (1<<MD_DISK_FAULTY);
  664. failed++;
  665. }
  666. }
  667. sb->nr_disks = nr_disks;
  668. sb->active_disks = active;
  669. sb->working_disks = working;
  670. sb->failed_disks = failed;
  671. sb->spare_disks = spare;
  672. sb->this_disk = sb->disks[rdev->desc_nr];
  673. sb->sb_csum = calc_sb_csum(sb);
  674. }
  675. /*
  676. * version 1 superblock
  677. */
  678. static unsigned int calc_sb_1_csum(struct mdp_superblock_1 * sb)
  679. {
  680. unsigned int disk_csum, csum;
  681. unsigned long long newcsum;
  682. int size = 256 + le32_to_cpu(sb->max_dev)*2;
  683. unsigned int *isuper = (unsigned int*)sb;
  684. int i;
  685. disk_csum = sb->sb_csum;
  686. sb->sb_csum = 0;
  687. newcsum = 0;
  688. for (i=0; size>=4; size -= 4 )
  689. newcsum += le32_to_cpu(*isuper++);
  690. if (size == 2)
  691. newcsum += le16_to_cpu(*(unsigned short*) isuper);
  692. csum = (newcsum & 0xffffffff) + (newcsum >> 32);
  693. sb->sb_csum = disk_csum;
  694. return cpu_to_le32(csum);
  695. }
  696. static int super_1_load(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version)
  697. {
  698. struct mdp_superblock_1 *sb;
  699. int ret;
  700. sector_t sb_offset;
  701. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  702. /*
  703. * Calculate the position of the superblock.
  704. * It is always aligned to a 4K boundary and
  705. * depeding on minor_version, it can be:
  706. * 0: At least 8K, but less than 12K, from end of device
  707. * 1: At start of device
  708. * 2: 4K from start of device.
  709. */
  710. switch(minor_version) {
  711. case 0:
  712. sb_offset = rdev->bdev->bd_inode->i_size >> 9;
  713. sb_offset -= 8*2;
  714. sb_offset &= ~(sector_t)(4*2-1);
  715. /* convert from sectors to K */
  716. sb_offset /= 2;
  717. break;
  718. case 1:
  719. sb_offset = 0;
  720. break;
  721. case 2:
  722. sb_offset = 4;
  723. break;
  724. default:
  725. return -EINVAL;
  726. }
  727. rdev->sb_offset = sb_offset;
  728. ret = read_disk_sb(rdev);
  729. if (ret) return ret;
  730. sb = (struct mdp_superblock_1*)page_address(rdev->sb_page);
  731. if (sb->magic != cpu_to_le32(MD_SB_MAGIC) ||
  732. sb->major_version != cpu_to_le32(1) ||
  733. le32_to_cpu(sb->max_dev) > (4096-256)/2 ||
  734. le64_to_cpu(sb->super_offset) != (rdev->sb_offset<<1) ||
  735. sb->feature_map != 0)
  736. return -EINVAL;
  737. if (calc_sb_1_csum(sb) != sb->sb_csum) {
  738. printk("md: invalid superblock checksum on %s\n",
  739. bdevname(rdev->bdev,b));
  740. return -EINVAL;
  741. }
  742. if (le64_to_cpu(sb->data_size) < 10) {
  743. printk("md: data_size too small on %s\n",
  744. bdevname(rdev->bdev,b));
  745. return -EINVAL;
  746. }
  747. rdev->preferred_minor = 0xffff;
  748. rdev->data_offset = le64_to_cpu(sb->data_offset);
  749. if (refdev == 0)
  750. return 1;
  751. else {
  752. __u64 ev1, ev2;
  753. struct mdp_superblock_1 *refsb =
  754. (struct mdp_superblock_1*)page_address(refdev->sb_page);
  755. if (memcmp(sb->set_uuid, refsb->set_uuid, 16) != 0 ||
  756. sb->level != refsb->level ||
  757. sb->layout != refsb->layout ||
  758. sb->chunksize != refsb->chunksize) {
  759. printk(KERN_WARNING "md: %s has strangely different"
  760. " superblock to %s\n",
  761. bdevname(rdev->bdev,b),
  762. bdevname(refdev->bdev,b2));
  763. return -EINVAL;
  764. }
  765. ev1 = le64_to_cpu(sb->events);
  766. ev2 = le64_to_cpu(refsb->events);
  767. if (ev1 > ev2)
  768. return 1;
  769. }
  770. if (minor_version)
  771. rdev->size = ((rdev->bdev->bd_inode->i_size>>9) - le64_to_cpu(sb->data_offset)) / 2;
  772. else
  773. rdev->size = rdev->sb_offset;
  774. if (rdev->size < le64_to_cpu(sb->data_size)/2)
  775. return -EINVAL;
  776. rdev->size = le64_to_cpu(sb->data_size)/2;
  777. if (le32_to_cpu(sb->chunksize))
  778. rdev->size &= ~((sector_t)le32_to_cpu(sb->chunksize)/2 - 1);
  779. return 0;
  780. }
  781. static int super_1_validate(mddev_t *mddev, mdk_rdev_t *rdev)
  782. {
  783. struct mdp_superblock_1 *sb = (struct mdp_superblock_1*)page_address(rdev->sb_page);
  784. rdev->raid_disk = -1;
  785. rdev->in_sync = 0;
  786. if (mddev->raid_disks == 0) {
  787. mddev->major_version = 1;
  788. mddev->patch_version = 0;
  789. mddev->persistent = 1;
  790. mddev->chunk_size = le32_to_cpu(sb->chunksize) << 9;
  791. mddev->ctime = le64_to_cpu(sb->ctime) & ((1ULL << 32)-1);
  792. mddev->utime = le64_to_cpu(sb->utime) & ((1ULL << 32)-1);
  793. mddev->level = le32_to_cpu(sb->level);
  794. mddev->layout = le32_to_cpu(sb->layout);
  795. mddev->raid_disks = le32_to_cpu(sb->raid_disks);
  796. mddev->size = le64_to_cpu(sb->size)/2;
  797. mddev->events = le64_to_cpu(sb->events);
  798. mddev->bitmap_offset = 0;
  799. mddev->recovery_cp = le64_to_cpu(sb->resync_offset);
  800. memcpy(mddev->uuid, sb->set_uuid, 16);
  801. mddev->max_disks = (4096-256)/2;
  802. if ((le32_to_cpu(sb->feature_map) & 1) &&
  803. mddev->bitmap_file == NULL ) {
  804. if (mddev->level != 1) {
  805. printk(KERN_WARNING "md: bitmaps only supported for raid1\n");
  806. return -EINVAL;
  807. }
  808. mddev->bitmap_offset = (__s32)le32_to_cpu(sb->bitmap_offset);
  809. }
  810. } else if (mddev->pers == NULL) {
  811. /* Insist of good event counter while assembling */
  812. __u64 ev1 = le64_to_cpu(sb->events);
  813. ++ev1;
  814. if (ev1 < mddev->events)
  815. return -EINVAL;
  816. } else if (mddev->bitmap) {
  817. /* If adding to array with a bitmap, then we can accept an
  818. * older device, but not too old.
  819. */
  820. __u64 ev1 = le64_to_cpu(sb->events);
  821. if (ev1 < mddev->bitmap->events_cleared)
  822. return 0;
  823. } else /* just a hot-add of a new device, leave raid_disk at -1 */
  824. return 0;
  825. if (mddev->level != LEVEL_MULTIPATH) {
  826. int role;
  827. rdev->desc_nr = le32_to_cpu(sb->dev_number);
  828. role = le16_to_cpu(sb->dev_roles[rdev->desc_nr]);
  829. switch(role) {
  830. case 0xffff: /* spare */
  831. rdev->faulty = 0;
  832. break;
  833. case 0xfffe: /* faulty */
  834. rdev->faulty = 1;
  835. break;
  836. default:
  837. rdev->in_sync = 1;
  838. rdev->faulty = 0;
  839. rdev->raid_disk = role;
  840. break;
  841. }
  842. } else /* MULTIPATH are always insync */
  843. rdev->in_sync = 1;
  844. return 0;
  845. }
  846. static void super_1_sync(mddev_t *mddev, mdk_rdev_t *rdev)
  847. {
  848. struct mdp_superblock_1 *sb;
  849. struct list_head *tmp;
  850. mdk_rdev_t *rdev2;
  851. int max_dev, i;
  852. /* make rdev->sb match mddev and rdev data. */
  853. sb = (struct mdp_superblock_1*)page_address(rdev->sb_page);
  854. sb->feature_map = 0;
  855. sb->pad0 = 0;
  856. memset(sb->pad1, 0, sizeof(sb->pad1));
  857. memset(sb->pad2, 0, sizeof(sb->pad2));
  858. memset(sb->pad3, 0, sizeof(sb->pad3));
  859. sb->utime = cpu_to_le64((__u64)mddev->utime);
  860. sb->events = cpu_to_le64(mddev->events);
  861. if (mddev->in_sync)
  862. sb->resync_offset = cpu_to_le64(mddev->recovery_cp);
  863. else
  864. sb->resync_offset = cpu_to_le64(0);
  865. if (mddev->bitmap && mddev->bitmap_file == NULL) {
  866. sb->bitmap_offset = cpu_to_le32((__u32)mddev->bitmap_offset);
  867. sb->feature_map = cpu_to_le32(1);
  868. }
  869. max_dev = 0;
  870. ITERATE_RDEV(mddev,rdev2,tmp)
  871. if (rdev2->desc_nr+1 > max_dev)
  872. max_dev = rdev2->desc_nr+1;
  873. sb->max_dev = cpu_to_le32(max_dev);
  874. for (i=0; i<max_dev;i++)
  875. sb->dev_roles[i] = cpu_to_le16(0xfffe);
  876. ITERATE_RDEV(mddev,rdev2,tmp) {
  877. i = rdev2->desc_nr;
  878. if (rdev2->faulty)
  879. sb->dev_roles[i] = cpu_to_le16(0xfffe);
  880. else if (rdev2->in_sync)
  881. sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk);
  882. else
  883. sb->dev_roles[i] = cpu_to_le16(0xffff);
  884. }
  885. sb->recovery_offset = cpu_to_le64(0); /* not supported yet */
  886. sb->sb_csum = calc_sb_1_csum(sb);
  887. }
  888. static struct super_type super_types[] = {
  889. [0] = {
  890. .name = "0.90.0",
  891. .owner = THIS_MODULE,
  892. .load_super = super_90_load,
  893. .validate_super = super_90_validate,
  894. .sync_super = super_90_sync,
  895. },
  896. [1] = {
  897. .name = "md-1",
  898. .owner = THIS_MODULE,
  899. .load_super = super_1_load,
  900. .validate_super = super_1_validate,
  901. .sync_super = super_1_sync,
  902. },
  903. };
  904. static mdk_rdev_t * match_dev_unit(mddev_t *mddev, mdk_rdev_t *dev)
  905. {
  906. struct list_head *tmp;
  907. mdk_rdev_t *rdev;
  908. ITERATE_RDEV(mddev,rdev,tmp)
  909. if (rdev->bdev->bd_contains == dev->bdev->bd_contains)
  910. return rdev;
  911. return NULL;
  912. }
  913. static int match_mddev_units(mddev_t *mddev1, mddev_t *mddev2)
  914. {
  915. struct list_head *tmp;
  916. mdk_rdev_t *rdev;
  917. ITERATE_RDEV(mddev1,rdev,tmp)
  918. if (match_dev_unit(mddev2, rdev))
  919. return 1;
  920. return 0;
  921. }
  922. static LIST_HEAD(pending_raid_disks);
  923. static int bind_rdev_to_array(mdk_rdev_t * rdev, mddev_t * mddev)
  924. {
  925. mdk_rdev_t *same_pdev;
  926. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  927. if (rdev->mddev) {
  928. MD_BUG();
  929. return -EINVAL;
  930. }
  931. same_pdev = match_dev_unit(mddev, rdev);
  932. if (same_pdev)
  933. printk(KERN_WARNING
  934. "%s: WARNING: %s appears to be on the same physical"
  935. " disk as %s. True\n protection against single-disk"
  936. " failure might be compromised.\n",
  937. mdname(mddev), bdevname(rdev->bdev,b),
  938. bdevname(same_pdev->bdev,b2));
  939. /* Verify rdev->desc_nr is unique.
  940. * If it is -1, assign a free number, else
  941. * check number is not in use
  942. */
  943. if (rdev->desc_nr < 0) {
  944. int choice = 0;
  945. if (mddev->pers) choice = mddev->raid_disks;
  946. while (find_rdev_nr(mddev, choice))
  947. choice++;
  948. rdev->desc_nr = choice;
  949. } else {
  950. if (find_rdev_nr(mddev, rdev->desc_nr))
  951. return -EBUSY;
  952. }
  953. list_add(&rdev->same_set, &mddev->disks);
  954. rdev->mddev = mddev;
  955. printk(KERN_INFO "md: bind<%s>\n", bdevname(rdev->bdev,b));
  956. return 0;
  957. }
  958. static void unbind_rdev_from_array(mdk_rdev_t * rdev)
  959. {
  960. char b[BDEVNAME_SIZE];
  961. if (!rdev->mddev) {
  962. MD_BUG();
  963. return;
  964. }
  965. list_del_init(&rdev->same_set);
  966. printk(KERN_INFO "md: unbind<%s>\n", bdevname(rdev->bdev,b));
  967. rdev->mddev = NULL;
  968. }
  969. /*
  970. * prevent the device from being mounted, repartitioned or
  971. * otherwise reused by a RAID array (or any other kernel
  972. * subsystem), by bd_claiming the device.
  973. */
  974. static int lock_rdev(mdk_rdev_t *rdev, dev_t dev)
  975. {
  976. int err = 0;
  977. struct block_device *bdev;
  978. char b[BDEVNAME_SIZE];
  979. bdev = open_by_devnum(dev, FMODE_READ|FMODE_WRITE);
  980. if (IS_ERR(bdev)) {
  981. printk(KERN_ERR "md: could not open %s.\n",
  982. __bdevname(dev, b));
  983. return PTR_ERR(bdev);
  984. }
  985. err = bd_claim(bdev, rdev);
  986. if (err) {
  987. printk(KERN_ERR "md: could not bd_claim %s.\n",
  988. bdevname(bdev, b));
  989. blkdev_put(bdev);
  990. return err;
  991. }
  992. rdev->bdev = bdev;
  993. return err;
  994. }
  995. static void unlock_rdev(mdk_rdev_t *rdev)
  996. {
  997. struct block_device *bdev = rdev->bdev;
  998. rdev->bdev = NULL;
  999. if (!bdev)
  1000. MD_BUG();
  1001. bd_release(bdev);
  1002. blkdev_put(bdev);
  1003. }
  1004. void md_autodetect_dev(dev_t dev);
  1005. static void export_rdev(mdk_rdev_t * rdev)
  1006. {
  1007. char b[BDEVNAME_SIZE];
  1008. printk(KERN_INFO "md: export_rdev(%s)\n",
  1009. bdevname(rdev->bdev,b));
  1010. if (rdev->mddev)
  1011. MD_BUG();
  1012. free_disk_sb(rdev);
  1013. list_del_init(&rdev->same_set);
  1014. #ifndef MODULE
  1015. md_autodetect_dev(rdev->bdev->bd_dev);
  1016. #endif
  1017. unlock_rdev(rdev);
  1018. kfree(rdev);
  1019. }
  1020. static void kick_rdev_from_array(mdk_rdev_t * rdev)
  1021. {
  1022. unbind_rdev_from_array(rdev);
  1023. export_rdev(rdev);
  1024. }
  1025. static void export_array(mddev_t *mddev)
  1026. {
  1027. struct list_head *tmp;
  1028. mdk_rdev_t *rdev;
  1029. ITERATE_RDEV(mddev,rdev,tmp) {
  1030. if (!rdev->mddev) {
  1031. MD_BUG();
  1032. continue;
  1033. }
  1034. kick_rdev_from_array(rdev);
  1035. }
  1036. if (!list_empty(&mddev->disks))
  1037. MD_BUG();
  1038. mddev->raid_disks = 0;
  1039. mddev->major_version = 0;
  1040. }
  1041. static void print_desc(mdp_disk_t *desc)
  1042. {
  1043. printk(" DISK<N:%d,(%d,%d),R:%d,S:%d>\n", desc->number,
  1044. desc->major,desc->minor,desc->raid_disk,desc->state);
  1045. }
  1046. static void print_sb(mdp_super_t *sb)
  1047. {
  1048. int i;
  1049. printk(KERN_INFO
  1050. "md: SB: (V:%d.%d.%d) ID:<%08x.%08x.%08x.%08x> CT:%08x\n",
  1051. sb->major_version, sb->minor_version, sb->patch_version,
  1052. sb->set_uuid0, sb->set_uuid1, sb->set_uuid2, sb->set_uuid3,
  1053. sb->ctime);
  1054. printk(KERN_INFO "md: L%d S%08d ND:%d RD:%d md%d LO:%d CS:%d\n",
  1055. sb->level, sb->size, sb->nr_disks, sb->raid_disks,
  1056. sb->md_minor, sb->layout, sb->chunk_size);
  1057. printk(KERN_INFO "md: UT:%08x ST:%d AD:%d WD:%d"
  1058. " FD:%d SD:%d CSUM:%08x E:%08lx\n",
  1059. sb->utime, sb->state, sb->active_disks, sb->working_disks,
  1060. sb->failed_disks, sb->spare_disks,
  1061. sb->sb_csum, (unsigned long)sb->events_lo);
  1062. printk(KERN_INFO);
  1063. for (i = 0; i < MD_SB_DISKS; i++) {
  1064. mdp_disk_t *desc;
  1065. desc = sb->disks + i;
  1066. if (desc->number || desc->major || desc->minor ||
  1067. desc->raid_disk || (desc->state && (desc->state != 4))) {
  1068. printk(" D %2d: ", i);
  1069. print_desc(desc);
  1070. }
  1071. }
  1072. printk(KERN_INFO "md: THIS: ");
  1073. print_desc(&sb->this_disk);
  1074. }
  1075. static void print_rdev(mdk_rdev_t *rdev)
  1076. {
  1077. char b[BDEVNAME_SIZE];
  1078. printk(KERN_INFO "md: rdev %s, SZ:%08llu F:%d S:%d DN:%u\n",
  1079. bdevname(rdev->bdev,b), (unsigned long long)rdev->size,
  1080. rdev->faulty, rdev->in_sync, rdev->desc_nr);
  1081. if (rdev->sb_loaded) {
  1082. printk(KERN_INFO "md: rdev superblock:\n");
  1083. print_sb((mdp_super_t*)page_address(rdev->sb_page));
  1084. } else
  1085. printk(KERN_INFO "md: no rdev superblock!\n");
  1086. }
  1087. void md_print_devices(void)
  1088. {
  1089. struct list_head *tmp, *tmp2;
  1090. mdk_rdev_t *rdev;
  1091. mddev_t *mddev;
  1092. char b[BDEVNAME_SIZE];
  1093. printk("\n");
  1094. printk("md: **********************************\n");
  1095. printk("md: * <COMPLETE RAID STATE PRINTOUT> *\n");
  1096. printk("md: **********************************\n");
  1097. ITERATE_MDDEV(mddev,tmp) {
  1098. if (mddev->bitmap)
  1099. bitmap_print_sb(mddev->bitmap);
  1100. else
  1101. printk("%s: ", mdname(mddev));
  1102. ITERATE_RDEV(mddev,rdev,tmp2)
  1103. printk("<%s>", bdevname(rdev->bdev,b));
  1104. printk("\n");
  1105. ITERATE_RDEV(mddev,rdev,tmp2)
  1106. print_rdev(rdev);
  1107. }
  1108. printk("md: **********************************\n");
  1109. printk("\n");
  1110. }
  1111. static void sync_sbs(mddev_t * mddev)
  1112. {
  1113. mdk_rdev_t *rdev;
  1114. struct list_head *tmp;
  1115. ITERATE_RDEV(mddev,rdev,tmp) {
  1116. super_types[mddev->major_version].
  1117. sync_super(mddev, rdev);
  1118. rdev->sb_loaded = 1;
  1119. }
  1120. }
  1121. static void md_update_sb(mddev_t * mddev)
  1122. {
  1123. int err;
  1124. struct list_head *tmp;
  1125. mdk_rdev_t *rdev;
  1126. int sync_req;
  1127. repeat:
  1128. spin_lock(&mddev->write_lock);
  1129. sync_req = mddev->in_sync;
  1130. mddev->utime = get_seconds();
  1131. mddev->events ++;
  1132. if (!mddev->events) {
  1133. /*
  1134. * oops, this 64-bit counter should never wrap.
  1135. * Either we are in around ~1 trillion A.C., assuming
  1136. * 1 reboot per second, or we have a bug:
  1137. */
  1138. MD_BUG();
  1139. mddev->events --;
  1140. }
  1141. mddev->sb_dirty = 2;
  1142. sync_sbs(mddev);
  1143. /*
  1144. * do not write anything to disk if using
  1145. * nonpersistent superblocks
  1146. */
  1147. if (!mddev->persistent) {
  1148. mddev->sb_dirty = 0;
  1149. spin_unlock(&mddev->write_lock);
  1150. wake_up(&mddev->sb_wait);
  1151. return;
  1152. }
  1153. spin_unlock(&mddev->write_lock);
  1154. dprintk(KERN_INFO
  1155. "md: updating %s RAID superblock on device (in sync %d)\n",
  1156. mdname(mddev),mddev->in_sync);
  1157. err = bitmap_update_sb(mddev->bitmap);
  1158. ITERATE_RDEV(mddev,rdev,tmp) {
  1159. char b[BDEVNAME_SIZE];
  1160. dprintk(KERN_INFO "md: ");
  1161. if (rdev->faulty)
  1162. dprintk("(skipping faulty ");
  1163. dprintk("%s ", bdevname(rdev->bdev,b));
  1164. if (!rdev->faulty) {
  1165. md_super_write(mddev,rdev,
  1166. rdev->sb_offset<<1, MD_SB_BYTES,
  1167. rdev->sb_page);
  1168. dprintk(KERN_INFO "(write) %s's sb offset: %llu\n",
  1169. bdevname(rdev->bdev,b),
  1170. (unsigned long long)rdev->sb_offset);
  1171. } else
  1172. dprintk(")\n");
  1173. if (mddev->level == LEVEL_MULTIPATH)
  1174. /* only need to write one superblock... */
  1175. break;
  1176. }
  1177. wait_event(mddev->sb_wait, atomic_read(&mddev->pending_writes)==0);
  1178. /* if there was a failure, sb_dirty was set to 1, and we re-write super */
  1179. spin_lock(&mddev->write_lock);
  1180. if (mddev->in_sync != sync_req|| mddev->sb_dirty == 1) {
  1181. /* have to write it out again */
  1182. spin_unlock(&mddev->write_lock);
  1183. goto repeat;
  1184. }
  1185. mddev->sb_dirty = 0;
  1186. spin_unlock(&mddev->write_lock);
  1187. wake_up(&mddev->sb_wait);
  1188. }
  1189. /*
  1190. * Import a device. If 'super_format' >= 0, then sanity check the superblock
  1191. *
  1192. * mark the device faulty if:
  1193. *
  1194. * - the device is nonexistent (zero size)
  1195. * - the device has no valid superblock
  1196. *
  1197. * a faulty rdev _never_ has rdev->sb set.
  1198. */
  1199. static mdk_rdev_t *md_import_device(dev_t newdev, int super_format, int super_minor)
  1200. {
  1201. char b[BDEVNAME_SIZE];
  1202. int err;
  1203. mdk_rdev_t *rdev;
  1204. sector_t size;
  1205. rdev = (mdk_rdev_t *) kmalloc(sizeof(*rdev), GFP_KERNEL);
  1206. if (!rdev) {
  1207. printk(KERN_ERR "md: could not alloc mem for new device!\n");
  1208. return ERR_PTR(-ENOMEM);
  1209. }
  1210. memset(rdev, 0, sizeof(*rdev));
  1211. if ((err = alloc_disk_sb(rdev)))
  1212. goto abort_free;
  1213. err = lock_rdev(rdev, newdev);
  1214. if (err)
  1215. goto abort_free;
  1216. rdev->desc_nr = -1;
  1217. rdev->faulty = 0;
  1218. rdev->in_sync = 0;
  1219. rdev->data_offset = 0;
  1220. atomic_set(&rdev->nr_pending, 0);
  1221. size = rdev->bdev->bd_inode->i_size >> BLOCK_SIZE_BITS;
  1222. if (!size) {
  1223. printk(KERN_WARNING
  1224. "md: %s has zero or unknown size, marking faulty!\n",
  1225. bdevname(rdev->bdev,b));
  1226. err = -EINVAL;
  1227. goto abort_free;
  1228. }
  1229. if (super_format >= 0) {
  1230. err = super_types[super_format].
  1231. load_super(rdev, NULL, super_minor);
  1232. if (err == -EINVAL) {
  1233. printk(KERN_WARNING
  1234. "md: %s has invalid sb, not importing!\n",
  1235. bdevname(rdev->bdev,b));
  1236. goto abort_free;
  1237. }
  1238. if (err < 0) {
  1239. printk(KERN_WARNING
  1240. "md: could not read %s's sb, not importing!\n",
  1241. bdevname(rdev->bdev,b));
  1242. goto abort_free;
  1243. }
  1244. }
  1245. INIT_LIST_HEAD(&rdev->same_set);
  1246. return rdev;
  1247. abort_free:
  1248. if (rdev->sb_page) {
  1249. if (rdev->bdev)
  1250. unlock_rdev(rdev);
  1251. free_disk_sb(rdev);
  1252. }
  1253. kfree(rdev);
  1254. return ERR_PTR(err);
  1255. }
  1256. /*
  1257. * Check a full RAID array for plausibility
  1258. */
  1259. static void analyze_sbs(mddev_t * mddev)
  1260. {
  1261. int i;
  1262. struct list_head *tmp;
  1263. mdk_rdev_t *rdev, *freshest;
  1264. char b[BDEVNAME_SIZE];
  1265. freshest = NULL;
  1266. ITERATE_RDEV(mddev,rdev,tmp)
  1267. switch (super_types[mddev->major_version].
  1268. load_super(rdev, freshest, mddev->minor_version)) {
  1269. case 1:
  1270. freshest = rdev;
  1271. break;
  1272. case 0:
  1273. break;
  1274. default:
  1275. printk( KERN_ERR \
  1276. "md: fatal superblock inconsistency in %s"
  1277. " -- removing from array\n",
  1278. bdevname(rdev->bdev,b));
  1279. kick_rdev_from_array(rdev);
  1280. }
  1281. super_types[mddev->major_version].
  1282. validate_super(mddev, freshest);
  1283. i = 0;
  1284. ITERATE_RDEV(mddev,rdev,tmp) {
  1285. if (rdev != freshest)
  1286. if (super_types[mddev->major_version].
  1287. validate_super(mddev, rdev)) {
  1288. printk(KERN_WARNING "md: kicking non-fresh %s"
  1289. " from array!\n",
  1290. bdevname(rdev->bdev,b));
  1291. kick_rdev_from_array(rdev);
  1292. continue;
  1293. }
  1294. if (mddev->level == LEVEL_MULTIPATH) {
  1295. rdev->desc_nr = i++;
  1296. rdev->raid_disk = rdev->desc_nr;
  1297. rdev->in_sync = 1;
  1298. }
  1299. }
  1300. if (mddev->recovery_cp != MaxSector &&
  1301. mddev->level >= 1)
  1302. printk(KERN_ERR "md: %s: raid array is not clean"
  1303. " -- starting background reconstruction\n",
  1304. mdname(mddev));
  1305. }
  1306. int mdp_major = 0;
  1307. static struct kobject *md_probe(dev_t dev, int *part, void *data)
  1308. {
  1309. static DECLARE_MUTEX(disks_sem);
  1310. mddev_t *mddev = mddev_find(dev);
  1311. struct gendisk *disk;
  1312. int partitioned = (MAJOR(dev) != MD_MAJOR);
  1313. int shift = partitioned ? MdpMinorShift : 0;
  1314. int unit = MINOR(dev) >> shift;
  1315. if (!mddev)
  1316. return NULL;
  1317. down(&disks_sem);
  1318. if (mddev->gendisk) {
  1319. up(&disks_sem);
  1320. mddev_put(mddev);
  1321. return NULL;
  1322. }
  1323. disk = alloc_disk(1 << shift);
  1324. if (!disk) {
  1325. up(&disks_sem);
  1326. mddev_put(mddev);
  1327. return NULL;
  1328. }
  1329. disk->major = MAJOR(dev);
  1330. disk->first_minor = unit << shift;
  1331. if (partitioned) {
  1332. sprintf(disk->disk_name, "md_d%d", unit);
  1333. sprintf(disk->devfs_name, "md/d%d", unit);
  1334. } else {
  1335. sprintf(disk->disk_name, "md%d", unit);
  1336. sprintf(disk->devfs_name, "md/%d", unit);
  1337. }
  1338. disk->fops = &md_fops;
  1339. disk->private_data = mddev;
  1340. disk->queue = mddev->queue;
  1341. add_disk(disk);
  1342. mddev->gendisk = disk;
  1343. up(&disks_sem);
  1344. return NULL;
  1345. }
  1346. void md_wakeup_thread(mdk_thread_t *thread);
  1347. static void md_safemode_timeout(unsigned long data)
  1348. {
  1349. mddev_t *mddev = (mddev_t *) data;
  1350. mddev->safemode = 1;
  1351. md_wakeup_thread(mddev->thread);
  1352. }
  1353. static int do_md_run(mddev_t * mddev)
  1354. {
  1355. int pnum, err;
  1356. int chunk_size;
  1357. struct list_head *tmp;
  1358. mdk_rdev_t *rdev;
  1359. struct gendisk *disk;
  1360. char b[BDEVNAME_SIZE];
  1361. if (list_empty(&mddev->disks))
  1362. /* cannot run an array with no devices.. */
  1363. return -EINVAL;
  1364. if (mddev->pers)
  1365. return -EBUSY;
  1366. /*
  1367. * Analyze all RAID superblock(s)
  1368. */
  1369. if (!mddev->raid_disks)
  1370. analyze_sbs(mddev);
  1371. chunk_size = mddev->chunk_size;
  1372. pnum = level_to_pers(mddev->level);
  1373. if ((pnum != MULTIPATH) && (pnum != RAID1)) {
  1374. if (!chunk_size) {
  1375. /*
  1376. * 'default chunksize' in the old md code used to
  1377. * be PAGE_SIZE, baaad.
  1378. * we abort here to be on the safe side. We don't
  1379. * want to continue the bad practice.
  1380. */
  1381. printk(KERN_ERR
  1382. "no chunksize specified, see 'man raidtab'\n");
  1383. return -EINVAL;
  1384. }
  1385. if (chunk_size > MAX_CHUNK_SIZE) {
  1386. printk(KERN_ERR "too big chunk_size: %d > %d\n",
  1387. chunk_size, MAX_CHUNK_SIZE);
  1388. return -EINVAL;
  1389. }
  1390. /*
  1391. * chunk-size has to be a power of 2 and multiples of PAGE_SIZE
  1392. */
  1393. if ( (1 << ffz(~chunk_size)) != chunk_size) {
  1394. printk(KERN_ERR "chunk_size of %d not valid\n", chunk_size);
  1395. return -EINVAL;
  1396. }
  1397. if (chunk_size < PAGE_SIZE) {
  1398. printk(KERN_ERR "too small chunk_size: %d < %ld\n",
  1399. chunk_size, PAGE_SIZE);
  1400. return -EINVAL;
  1401. }
  1402. /* devices must have minimum size of one chunk */
  1403. ITERATE_RDEV(mddev,rdev,tmp) {
  1404. if (rdev->faulty)
  1405. continue;
  1406. if (rdev->size < chunk_size / 1024) {
  1407. printk(KERN_WARNING
  1408. "md: Dev %s smaller than chunk_size:"
  1409. " %lluk < %dk\n",
  1410. bdevname(rdev->bdev,b),
  1411. (unsigned long long)rdev->size,
  1412. chunk_size / 1024);
  1413. return -EINVAL;
  1414. }
  1415. }
  1416. }
  1417. #ifdef CONFIG_KMOD
  1418. if (!pers[pnum])
  1419. {
  1420. request_module("md-personality-%d", pnum);
  1421. }
  1422. #endif
  1423. /*
  1424. * Drop all container device buffers, from now on
  1425. * the only valid external interface is through the md
  1426. * device.
  1427. * Also find largest hardsector size
  1428. */
  1429. ITERATE_RDEV(mddev,rdev,tmp) {
  1430. if (rdev->faulty)
  1431. continue;
  1432. sync_blockdev(rdev->bdev);
  1433. invalidate_bdev(rdev->bdev, 0);
  1434. }
  1435. md_probe(mddev->unit, NULL, NULL);
  1436. disk = mddev->gendisk;
  1437. if (!disk)
  1438. return -ENOMEM;
  1439. spin_lock(&pers_lock);
  1440. if (!pers[pnum] || !try_module_get(pers[pnum]->owner)) {
  1441. spin_unlock(&pers_lock);
  1442. printk(KERN_WARNING "md: personality %d is not loaded!\n",
  1443. pnum);
  1444. return -EINVAL;
  1445. }
  1446. mddev->pers = pers[pnum];
  1447. spin_unlock(&pers_lock);
  1448. mddev->recovery = 0;
  1449. mddev->resync_max_sectors = mddev->size << 1; /* may be over-ridden by personality */
  1450. /* before we start the array running, initialise the bitmap */
  1451. err = bitmap_create(mddev);
  1452. if (err)
  1453. printk(KERN_ERR "%s: failed to create bitmap (%d)\n",
  1454. mdname(mddev), err);
  1455. else
  1456. err = mddev->pers->run(mddev);
  1457. if (err) {
  1458. printk(KERN_ERR "md: pers->run() failed ...\n");
  1459. module_put(mddev->pers->owner);
  1460. mddev->pers = NULL;
  1461. bitmap_destroy(mddev);
  1462. return err;
  1463. }
  1464. atomic_set(&mddev->writes_pending,0);
  1465. mddev->safemode = 0;
  1466. mddev->safemode_timer.function = md_safemode_timeout;
  1467. mddev->safemode_timer.data = (unsigned long) mddev;
  1468. mddev->safemode_delay = (20 * HZ)/1000 +1; /* 20 msec delay */
  1469. mddev->in_sync = 1;
  1470. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  1471. md_wakeup_thread(mddev->thread);
  1472. if (mddev->sb_dirty)
  1473. md_update_sb(mddev);
  1474. set_capacity(disk, mddev->array_size<<1);
  1475. /* If we call blk_queue_make_request here, it will
  1476. * re-initialise max_sectors etc which may have been
  1477. * refined inside -> run. So just set the bits we need to set.
  1478. * Most initialisation happended when we called
  1479. * blk_queue_make_request(..., md_fail_request)
  1480. * earlier.
  1481. */
  1482. mddev->queue->queuedata = mddev;
  1483. mddev->queue->make_request_fn = mddev->pers->make_request;
  1484. mddev->changed = 1;
  1485. return 0;
  1486. }
  1487. static int restart_array(mddev_t *mddev)
  1488. {
  1489. struct gendisk *disk = mddev->gendisk;
  1490. int err;
  1491. /*
  1492. * Complain if it has no devices
  1493. */
  1494. err = -ENXIO;
  1495. if (list_empty(&mddev->disks))
  1496. goto out;
  1497. if (mddev->pers) {
  1498. err = -EBUSY;
  1499. if (!mddev->ro)
  1500. goto out;
  1501. mddev->safemode = 0;
  1502. mddev->ro = 0;
  1503. set_disk_ro(disk, 0);
  1504. printk(KERN_INFO "md: %s switched to read-write mode.\n",
  1505. mdname(mddev));
  1506. /*
  1507. * Kick recovery or resync if necessary
  1508. */
  1509. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  1510. md_wakeup_thread(mddev->thread);
  1511. err = 0;
  1512. } else {
  1513. printk(KERN_ERR "md: %s has no personality assigned.\n",
  1514. mdname(mddev));
  1515. err = -EINVAL;
  1516. }
  1517. out:
  1518. return err;
  1519. }
  1520. static int do_md_stop(mddev_t * mddev, int ro)
  1521. {
  1522. int err = 0;
  1523. struct gendisk *disk = mddev->gendisk;
  1524. if (mddev->pers) {
  1525. if (atomic_read(&mddev->active)>2) {
  1526. printk("md: %s still in use.\n",mdname(mddev));
  1527. return -EBUSY;
  1528. }
  1529. if (mddev->sync_thread) {
  1530. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  1531. md_unregister_thread(mddev->sync_thread);
  1532. mddev->sync_thread = NULL;
  1533. }
  1534. del_timer_sync(&mddev->safemode_timer);
  1535. invalidate_partition(disk, 0);
  1536. if (ro) {
  1537. err = -ENXIO;
  1538. if (mddev->ro)
  1539. goto out;
  1540. mddev->ro = 1;
  1541. } else {
  1542. bitmap_flush(mddev);
  1543. wait_event(mddev->sb_wait, atomic_read(&mddev->pending_writes)==0);
  1544. if (mddev->ro)
  1545. set_disk_ro(disk, 0);
  1546. blk_queue_make_request(mddev->queue, md_fail_request);
  1547. mddev->pers->stop(mddev);
  1548. module_put(mddev->pers->owner);
  1549. mddev->pers = NULL;
  1550. if (mddev->ro)
  1551. mddev->ro = 0;
  1552. }
  1553. if (!mddev->in_sync) {
  1554. /* mark array as shutdown cleanly */
  1555. mddev->in_sync = 1;
  1556. md_update_sb(mddev);
  1557. }
  1558. if (ro)
  1559. set_disk_ro(disk, 1);
  1560. }
  1561. bitmap_destroy(mddev);
  1562. if (mddev->bitmap_file) {
  1563. atomic_set(&mddev->bitmap_file->f_dentry->d_inode->i_writecount, 1);
  1564. fput(mddev->bitmap_file);
  1565. mddev->bitmap_file = NULL;
  1566. }
  1567. mddev->bitmap_offset = 0;
  1568. /*
  1569. * Free resources if final stop
  1570. */
  1571. if (!ro) {
  1572. struct gendisk *disk;
  1573. printk(KERN_INFO "md: %s stopped.\n", mdname(mddev));
  1574. export_array(mddev);
  1575. mddev->array_size = 0;
  1576. disk = mddev->gendisk;
  1577. if (disk)
  1578. set_capacity(disk, 0);
  1579. mddev->changed = 1;
  1580. } else
  1581. printk(KERN_INFO "md: %s switched to read-only mode.\n",
  1582. mdname(mddev));
  1583. err = 0;
  1584. out:
  1585. return err;
  1586. }
  1587. static void autorun_array(mddev_t *mddev)
  1588. {
  1589. mdk_rdev_t *rdev;
  1590. struct list_head *tmp;
  1591. int err;
  1592. if (list_empty(&mddev->disks))
  1593. return;
  1594. printk(KERN_INFO "md: running: ");
  1595. ITERATE_RDEV(mddev,rdev,tmp) {
  1596. char b[BDEVNAME_SIZE];
  1597. printk("<%s>", bdevname(rdev->bdev,b));
  1598. }
  1599. printk("\n");
  1600. err = do_md_run (mddev);
  1601. if (err) {
  1602. printk(KERN_WARNING "md: do_md_run() returned %d\n", err);
  1603. do_md_stop (mddev, 0);
  1604. }
  1605. }
  1606. /*
  1607. * lets try to run arrays based on all disks that have arrived
  1608. * until now. (those are in pending_raid_disks)
  1609. *
  1610. * the method: pick the first pending disk, collect all disks with
  1611. * the same UUID, remove all from the pending list and put them into
  1612. * the 'same_array' list. Then order this list based on superblock
  1613. * update time (freshest comes first), kick out 'old' disks and
  1614. * compare superblocks. If everything's fine then run it.
  1615. *
  1616. * If "unit" is allocated, then bump its reference count
  1617. */
  1618. static void autorun_devices(int part)
  1619. {
  1620. struct list_head candidates;
  1621. struct list_head *tmp;
  1622. mdk_rdev_t *rdev0, *rdev;
  1623. mddev_t *mddev;
  1624. char b[BDEVNAME_SIZE];
  1625. printk(KERN_INFO "md: autorun ...\n");
  1626. while (!list_empty(&pending_raid_disks)) {
  1627. dev_t dev;
  1628. rdev0 = list_entry(pending_raid_disks.next,
  1629. mdk_rdev_t, same_set);
  1630. printk(KERN_INFO "md: considering %s ...\n",
  1631. bdevname(rdev0->bdev,b));
  1632. INIT_LIST_HEAD(&candidates);
  1633. ITERATE_RDEV_PENDING(rdev,tmp)
  1634. if (super_90_load(rdev, rdev0, 0) >= 0) {
  1635. printk(KERN_INFO "md: adding %s ...\n",
  1636. bdevname(rdev->bdev,b));
  1637. list_move(&rdev->same_set, &candidates);
  1638. }
  1639. /*
  1640. * now we have a set of devices, with all of them having
  1641. * mostly sane superblocks. It's time to allocate the
  1642. * mddev.
  1643. */
  1644. if (rdev0->preferred_minor < 0 || rdev0->preferred_minor >= MAX_MD_DEVS) {
  1645. printk(KERN_INFO "md: unit number in %s is bad: %d\n",
  1646. bdevname(rdev0->bdev, b), rdev0->preferred_minor);
  1647. break;
  1648. }
  1649. if (part)
  1650. dev = MKDEV(mdp_major,
  1651. rdev0->preferred_minor << MdpMinorShift);
  1652. else
  1653. dev = MKDEV(MD_MAJOR, rdev0->preferred_minor);
  1654. md_probe(dev, NULL, NULL);
  1655. mddev = mddev_find(dev);
  1656. if (!mddev) {
  1657. printk(KERN_ERR
  1658. "md: cannot allocate memory for md drive.\n");
  1659. break;
  1660. }
  1661. if (mddev_lock(mddev))
  1662. printk(KERN_WARNING "md: %s locked, cannot run\n",
  1663. mdname(mddev));
  1664. else if (mddev->raid_disks || mddev->major_version
  1665. || !list_empty(&mddev->disks)) {
  1666. printk(KERN_WARNING
  1667. "md: %s already running, cannot run %s\n",
  1668. mdname(mddev), bdevname(rdev0->bdev,b));
  1669. mddev_unlock(mddev);
  1670. } else {
  1671. printk(KERN_INFO "md: created %s\n", mdname(mddev));
  1672. ITERATE_RDEV_GENERIC(candidates,rdev,tmp) {
  1673. list_del_init(&rdev->same_set);
  1674. if (bind_rdev_to_array(rdev, mddev))
  1675. export_rdev(rdev);
  1676. }
  1677. autorun_array(mddev);
  1678. mddev_unlock(mddev);
  1679. }
  1680. /* on success, candidates will be empty, on error
  1681. * it won't...
  1682. */
  1683. ITERATE_RDEV_GENERIC(candidates,rdev,tmp)
  1684. export_rdev(rdev);
  1685. mddev_put(mddev);
  1686. }
  1687. printk(KERN_INFO "md: ... autorun DONE.\n");
  1688. }
  1689. /*
  1690. * import RAID devices based on one partition
  1691. * if possible, the array gets run as well.
  1692. */
  1693. static int autostart_array(dev_t startdev)
  1694. {
  1695. char b[BDEVNAME_SIZE];
  1696. int err = -EINVAL, i;
  1697. mdp_super_t *sb = NULL;
  1698. mdk_rdev_t *start_rdev = NULL, *rdev;
  1699. start_rdev = md_import_device(startdev, 0, 0);
  1700. if (IS_ERR(start_rdev))
  1701. return err;
  1702. /* NOTE: this can only work for 0.90.0 superblocks */
  1703. sb = (mdp_super_t*)page_address(start_rdev->sb_page);
  1704. if (sb->major_version != 0 ||
  1705. sb->minor_version != 90 ) {
  1706. printk(KERN_WARNING "md: can only autostart 0.90.0 arrays\n");
  1707. export_rdev(start_rdev);
  1708. return err;
  1709. }
  1710. if (start_rdev->faulty) {
  1711. printk(KERN_WARNING
  1712. "md: can not autostart based on faulty %s!\n",
  1713. bdevname(start_rdev->bdev,b));
  1714. export_rdev(start_rdev);
  1715. return err;
  1716. }
  1717. list_add(&start_rdev->same_set, &pending_raid_disks);
  1718. for (i = 0; i < MD_SB_DISKS; i++) {
  1719. mdp_disk_t *desc = sb->disks + i;
  1720. dev_t dev = MKDEV(desc->major, desc->minor);
  1721. if (!dev)
  1722. continue;
  1723. if (dev == startdev)
  1724. continue;
  1725. if (MAJOR(dev) != desc->major || MINOR(dev) != desc->minor)
  1726. continue;
  1727. rdev = md_import_device(dev, 0, 0);
  1728. if (IS_ERR(rdev))
  1729. continue;
  1730. list_add(&rdev->same_set, &pending_raid_disks);
  1731. }
  1732. /*
  1733. * possibly return codes
  1734. */
  1735. autorun_devices(0);
  1736. return 0;
  1737. }
  1738. static int get_version(void __user * arg)
  1739. {
  1740. mdu_version_t ver;
  1741. ver.major = MD_MAJOR_VERSION;
  1742. ver.minor = MD_MINOR_VERSION;
  1743. ver.patchlevel = MD_PATCHLEVEL_VERSION;
  1744. if (copy_to_user(arg, &ver, sizeof(ver)))
  1745. return -EFAULT;
  1746. return 0;
  1747. }
  1748. static int get_array_info(mddev_t * mddev, void __user * arg)
  1749. {
  1750. mdu_array_info_t info;
  1751. int nr,working,active,failed,spare;
  1752. mdk_rdev_t *rdev;
  1753. struct list_head *tmp;
  1754. nr=working=active=failed=spare=0;
  1755. ITERATE_RDEV(mddev,rdev,tmp) {
  1756. nr++;
  1757. if (rdev->faulty)
  1758. failed++;
  1759. else {
  1760. working++;
  1761. if (rdev->in_sync)
  1762. active++;
  1763. else
  1764. spare++;
  1765. }
  1766. }
  1767. info.major_version = mddev->major_version;
  1768. info.minor_version = mddev->minor_version;
  1769. info.patch_version = MD_PATCHLEVEL_VERSION;
  1770. info.ctime = mddev->ctime;
  1771. info.level = mddev->level;
  1772. info.size = mddev->size;
  1773. info.nr_disks = nr;
  1774. info.raid_disks = mddev->raid_disks;
  1775. info.md_minor = mddev->md_minor;
  1776. info.not_persistent= !mddev->persistent;
  1777. info.utime = mddev->utime;
  1778. info.state = 0;
  1779. if (mddev->in_sync)
  1780. info.state = (1<<MD_SB_CLEAN);
  1781. info.active_disks = active;
  1782. info.working_disks = working;
  1783. info.failed_disks = failed;
  1784. info.spare_disks = spare;
  1785. info.layout = mddev->layout;
  1786. info.chunk_size = mddev->chunk_size;
  1787. if (copy_to_user(arg, &info, sizeof(info)))
  1788. return -EFAULT;
  1789. return 0;
  1790. }
  1791. static int get_bitmap_file(mddev_t * mddev, void * arg)
  1792. {
  1793. mdu_bitmap_file_t *file = NULL; /* too big for stack allocation */
  1794. char *ptr, *buf = NULL;
  1795. int err = -ENOMEM;
  1796. file = kmalloc(sizeof(*file), GFP_KERNEL);
  1797. if (!file)
  1798. goto out;
  1799. /* bitmap disabled, zero the first byte and copy out */
  1800. if (!mddev->bitmap || !mddev->bitmap->file) {
  1801. file->pathname[0] = '\0';
  1802. goto copy_out;
  1803. }
  1804. buf = kmalloc(sizeof(file->pathname), GFP_KERNEL);
  1805. if (!buf)
  1806. goto out;
  1807. ptr = file_path(mddev->bitmap->file, buf, sizeof(file->pathname));
  1808. if (!ptr)
  1809. goto out;
  1810. strcpy(file->pathname, ptr);
  1811. copy_out:
  1812. err = 0;
  1813. if (copy_to_user(arg, file, sizeof(*file)))
  1814. err = -EFAULT;
  1815. out:
  1816. kfree(buf);
  1817. kfree(file);
  1818. return err;
  1819. }
  1820. static int get_disk_info(mddev_t * mddev, void __user * arg)
  1821. {
  1822. mdu_disk_info_t info;
  1823. unsigned int nr;
  1824. mdk_rdev_t *rdev;
  1825. if (copy_from_user(&info, arg, sizeof(info)))
  1826. return -EFAULT;
  1827. nr = info.number;
  1828. rdev = find_rdev_nr(mddev, nr);
  1829. if (rdev) {
  1830. info.major = MAJOR(rdev->bdev->bd_dev);
  1831. info.minor = MINOR(rdev->bdev->bd_dev);
  1832. info.raid_disk = rdev->raid_disk;
  1833. info.state = 0;
  1834. if (rdev->faulty)
  1835. info.state |= (1<<MD_DISK_FAULTY);
  1836. else if (rdev->in_sync) {
  1837. info.state |= (1<<MD_DISK_ACTIVE);
  1838. info.state |= (1<<MD_DISK_SYNC);
  1839. }
  1840. } else {
  1841. info.major = info.minor = 0;
  1842. info.raid_disk = -1;
  1843. info.state = (1<<MD_DISK_REMOVED);
  1844. }
  1845. if (copy_to_user(arg, &info, sizeof(info)))
  1846. return -EFAULT;
  1847. return 0;
  1848. }
  1849. static int add_new_disk(mddev_t * mddev, mdu_disk_info_t *info)
  1850. {
  1851. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  1852. mdk_rdev_t *rdev;
  1853. dev_t dev = MKDEV(info->major,info->minor);
  1854. if (info->major != MAJOR(dev) || info->minor != MINOR(dev))
  1855. return -EOVERFLOW;
  1856. if (!mddev->raid_disks) {
  1857. int err;
  1858. /* expecting a device which has a superblock */
  1859. rdev = md_import_device(dev, mddev->major_version, mddev->minor_version);
  1860. if (IS_ERR(rdev)) {
  1861. printk(KERN_WARNING
  1862. "md: md_import_device returned %ld\n",
  1863. PTR_ERR(rdev));
  1864. return PTR_ERR(rdev);
  1865. }
  1866. if (!list_empty(&mddev->disks)) {
  1867. mdk_rdev_t *rdev0 = list_entry(mddev->disks.next,
  1868. mdk_rdev_t, same_set);
  1869. int err = super_types[mddev->major_version]
  1870. .load_super(rdev, rdev0, mddev->minor_version);
  1871. if (err < 0) {
  1872. printk(KERN_WARNING
  1873. "md: %s has different UUID to %s\n",
  1874. bdevname(rdev->bdev,b),
  1875. bdevname(rdev0->bdev,b2));
  1876. export_rdev(rdev);
  1877. return -EINVAL;
  1878. }
  1879. }
  1880. err = bind_rdev_to_array(rdev, mddev);
  1881. if (err)
  1882. export_rdev(rdev);
  1883. return err;
  1884. }
  1885. /*
  1886. * add_new_disk can be used once the array is assembled
  1887. * to add "hot spares". They must already have a superblock
  1888. * written
  1889. */
  1890. if (mddev->pers) {
  1891. int err;
  1892. if (!mddev->pers->hot_add_disk) {
  1893. printk(KERN_WARNING
  1894. "%s: personality does not support diskops!\n",
  1895. mdname(mddev));
  1896. return -EINVAL;
  1897. }
  1898. rdev = md_import_device(dev, mddev->major_version,
  1899. mddev->minor_version);
  1900. if (IS_ERR(rdev)) {
  1901. printk(KERN_WARNING
  1902. "md: md_import_device returned %ld\n",
  1903. PTR_ERR(rdev));
  1904. return PTR_ERR(rdev);
  1905. }
  1906. /* set save_raid_disk if appropriate */
  1907. if (!mddev->persistent) {
  1908. if (info->state & (1<<MD_DISK_SYNC) &&
  1909. info->raid_disk < mddev->raid_disks)
  1910. rdev->raid_disk = info->raid_disk;
  1911. else
  1912. rdev->raid_disk = -1;
  1913. } else
  1914. super_types[mddev->major_version].
  1915. validate_super(mddev, rdev);
  1916. rdev->saved_raid_disk = rdev->raid_disk;
  1917. rdev->in_sync = 0; /* just to be sure */
  1918. rdev->raid_disk = -1;
  1919. err = bind_rdev_to_array(rdev, mddev);
  1920. if (err)
  1921. export_rdev(rdev);
  1922. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  1923. md_wakeup_thread(mddev->thread);
  1924. return err;
  1925. }
  1926. /* otherwise, add_new_disk is only allowed
  1927. * for major_version==0 superblocks
  1928. */
  1929. if (mddev->major_version != 0) {
  1930. printk(KERN_WARNING "%s: ADD_NEW_DISK not supported\n",
  1931. mdname(mddev));
  1932. return -EINVAL;
  1933. }
  1934. if (!(info->state & (1<<MD_DISK_FAULTY))) {
  1935. int err;
  1936. rdev = md_import_device (dev, -1, 0);
  1937. if (IS_ERR(rdev)) {
  1938. printk(KERN_WARNING
  1939. "md: error, md_import_device() returned %ld\n",
  1940. PTR_ERR(rdev));
  1941. return PTR_ERR(rdev);
  1942. }
  1943. rdev->desc_nr = info->number;
  1944. if (info->raid_disk < mddev->raid_disks)
  1945. rdev->raid_disk = info->raid_disk;
  1946. else
  1947. rdev->raid_disk = -1;
  1948. rdev->faulty = 0;
  1949. if (rdev->raid_disk < mddev->raid_disks)
  1950. rdev->in_sync = (info->state & (1<<MD_DISK_SYNC));
  1951. else
  1952. rdev->in_sync = 0;
  1953. err = bind_rdev_to_array(rdev, mddev);
  1954. if (err) {
  1955. export_rdev(rdev);
  1956. return err;
  1957. }
  1958. if (!mddev->persistent) {
  1959. printk(KERN_INFO "md: nonpersistent superblock ...\n");
  1960. rdev->sb_offset = rdev->bdev->bd_inode->i_size >> BLOCK_SIZE_BITS;
  1961. } else
  1962. rdev->sb_offset = calc_dev_sboffset(rdev->bdev);
  1963. rdev->size = calc_dev_size(rdev, mddev->chunk_size);
  1964. if (!mddev->size || (mddev->size > rdev->size))
  1965. mddev->size = rdev->size;
  1966. }
  1967. return 0;
  1968. }
  1969. static int hot_remove_disk(mddev_t * mddev, dev_t dev)
  1970. {
  1971. char b[BDEVNAME_SIZE];
  1972. mdk_rdev_t *rdev;
  1973. if (!mddev->pers)
  1974. return -ENODEV;
  1975. rdev = find_rdev(mddev, dev);
  1976. if (!rdev)
  1977. return -ENXIO;
  1978. if (rdev->raid_disk >= 0)
  1979. goto busy;
  1980. kick_rdev_from_array(rdev);
  1981. md_update_sb(mddev);
  1982. return 0;
  1983. busy:
  1984. printk(KERN_WARNING "md: cannot remove active disk %s from %s ... \n",
  1985. bdevname(rdev->bdev,b), mdname(mddev));
  1986. return -EBUSY;
  1987. }
  1988. static int hot_add_disk(mddev_t * mddev, dev_t dev)
  1989. {
  1990. char b[BDEVNAME_SIZE];
  1991. int err;
  1992. unsigned int size;
  1993. mdk_rdev_t *rdev;
  1994. if (!mddev->pers)
  1995. return -ENODEV;
  1996. if (mddev->major_version != 0) {
  1997. printk(KERN_WARNING "%s: HOT_ADD may only be used with"
  1998. " version-0 superblocks.\n",
  1999. mdname(mddev));
  2000. return -EINVAL;
  2001. }
  2002. if (!mddev->pers->hot_add_disk) {
  2003. printk(KERN_WARNING
  2004. "%s: personality does not support diskops!\n",
  2005. mdname(mddev));
  2006. return -EINVAL;
  2007. }
  2008. rdev = md_import_device (dev, -1, 0);
  2009. if (IS_ERR(rdev)) {
  2010. printk(KERN_WARNING
  2011. "md: error, md_import_device() returned %ld\n",
  2012. PTR_ERR(rdev));
  2013. return -EINVAL;
  2014. }
  2015. if (mddev->persistent)
  2016. rdev->sb_offset = calc_dev_sboffset(rdev->bdev);
  2017. else
  2018. rdev->sb_offset =
  2019. rdev->bdev->bd_inode->i_size >> BLOCK_SIZE_BITS;
  2020. size = calc_dev_size(rdev, mddev->chunk_size);
  2021. rdev->size = size;
  2022. if (size < mddev->size) {
  2023. printk(KERN_WARNING
  2024. "%s: disk size %llu blocks < array size %llu\n",
  2025. mdname(mddev), (unsigned long long)size,
  2026. (unsigned long long)mddev->size);
  2027. err = -ENOSPC;
  2028. goto abort_export;
  2029. }
  2030. if (rdev->faulty) {
  2031. printk(KERN_WARNING
  2032. "md: can not hot-add faulty %s disk to %s!\n",
  2033. bdevname(rdev->bdev,b), mdname(mddev));
  2034. err = -EINVAL;
  2035. goto abort_export;
  2036. }
  2037. rdev->in_sync = 0;
  2038. rdev->desc_nr = -1;
  2039. bind_rdev_to_array(rdev, mddev);
  2040. /*
  2041. * The rest should better be atomic, we can have disk failures
  2042. * noticed in interrupt contexts ...
  2043. */
  2044. if (rdev->desc_nr == mddev->max_disks) {
  2045. printk(KERN_WARNING "%s: can not hot-add to full array!\n",
  2046. mdname(mddev));
  2047. err = -EBUSY;
  2048. goto abort_unbind_export;
  2049. }
  2050. rdev->raid_disk = -1;
  2051. md_update_sb(mddev);
  2052. /*
  2053. * Kick recovery, maybe this spare has to be added to the
  2054. * array immediately.
  2055. */
  2056. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  2057. md_wakeup_thread(mddev->thread);
  2058. return 0;
  2059. abort_unbind_export:
  2060. unbind_rdev_from_array(rdev);
  2061. abort_export:
  2062. export_rdev(rdev);
  2063. return err;
  2064. }
  2065. /* similar to deny_write_access, but accounts for our holding a reference
  2066. * to the file ourselves */
  2067. static int deny_bitmap_write_access(struct file * file)
  2068. {
  2069. struct inode *inode = file->f_mapping->host;
  2070. spin_lock(&inode->i_lock);
  2071. if (atomic_read(&inode->i_writecount) > 1) {
  2072. spin_unlock(&inode->i_lock);
  2073. return -ETXTBSY;
  2074. }
  2075. atomic_set(&inode->i_writecount, -1);
  2076. spin_unlock(&inode->i_lock);
  2077. return 0;
  2078. }
  2079. static int set_bitmap_file(mddev_t *mddev, int fd)
  2080. {
  2081. int err;
  2082. if (mddev->pers)
  2083. return -EBUSY;
  2084. mddev->bitmap_file = fget(fd);
  2085. if (mddev->bitmap_file == NULL) {
  2086. printk(KERN_ERR "%s: error: failed to get bitmap file\n",
  2087. mdname(mddev));
  2088. return -EBADF;
  2089. }
  2090. err = deny_bitmap_write_access(mddev->bitmap_file);
  2091. if (err) {
  2092. printk(KERN_ERR "%s: error: bitmap file is already in use\n",
  2093. mdname(mddev));
  2094. fput(mddev->bitmap_file);
  2095. mddev->bitmap_file = NULL;
  2096. } else
  2097. mddev->bitmap_offset = 0; /* file overrides offset */
  2098. return err;
  2099. }
  2100. /*
  2101. * set_array_info is used two different ways
  2102. * The original usage is when creating a new array.
  2103. * In this usage, raid_disks is > 0 and it together with
  2104. * level, size, not_persistent,layout,chunksize determine the
  2105. * shape of the array.
  2106. * This will always create an array with a type-0.90.0 superblock.
  2107. * The newer usage is when assembling an array.
  2108. * In this case raid_disks will be 0, and the major_version field is
  2109. * use to determine which style super-blocks are to be found on the devices.
  2110. * The minor and patch _version numbers are also kept incase the
  2111. * super_block handler wishes to interpret them.
  2112. */
  2113. static int set_array_info(mddev_t * mddev, mdu_array_info_t *info)
  2114. {
  2115. if (info->raid_disks == 0) {
  2116. /* just setting version number for superblock loading */
  2117. if (info->major_version < 0 ||
  2118. info->major_version >= sizeof(super_types)/sizeof(super_types[0]) ||
  2119. super_types[info->major_version].name == NULL) {
  2120. /* maybe try to auto-load a module? */
  2121. printk(KERN_INFO
  2122. "md: superblock version %d not known\n",
  2123. info->major_version);
  2124. return -EINVAL;
  2125. }
  2126. mddev->major_version = info->major_version;
  2127. mddev->minor_version = info->minor_version;
  2128. mddev->patch_version = info->patch_version;
  2129. return 0;
  2130. }
  2131. mddev->major_version = MD_MAJOR_VERSION;
  2132. mddev->minor_version = MD_MINOR_VERSION;
  2133. mddev->patch_version = MD_PATCHLEVEL_VERSION;
  2134. mddev->ctime = get_seconds();
  2135. mddev->level = info->level;
  2136. mddev->size = info->size;
  2137. mddev->raid_disks = info->raid_disks;
  2138. /* don't set md_minor, it is determined by which /dev/md* was
  2139. * openned
  2140. */
  2141. if (info->state & (1<<MD_SB_CLEAN))
  2142. mddev->recovery_cp = MaxSector;
  2143. else
  2144. mddev->recovery_cp = 0;
  2145. mddev->persistent = ! info->not_persistent;
  2146. mddev->layout = info->layout;
  2147. mddev->chunk_size = info->chunk_size;
  2148. mddev->max_disks = MD_SB_DISKS;
  2149. mddev->sb_dirty = 1;
  2150. /*
  2151. * Generate a 128 bit UUID
  2152. */
  2153. get_random_bytes(mddev->uuid, 16);
  2154. return 0;
  2155. }
  2156. /*
  2157. * update_array_info is used to change the configuration of an
  2158. * on-line array.
  2159. * The version, ctime,level,size,raid_disks,not_persistent, layout,chunk_size
  2160. * fields in the info are checked against the array.
  2161. * Any differences that cannot be handled will cause an error.
  2162. * Normally, only one change can be managed at a time.
  2163. */
  2164. static int update_array_info(mddev_t *mddev, mdu_array_info_t *info)
  2165. {
  2166. int rv = 0;
  2167. int cnt = 0;
  2168. if (mddev->major_version != info->major_version ||
  2169. mddev->minor_version != info->minor_version ||
  2170. /* mddev->patch_version != info->patch_version || */
  2171. mddev->ctime != info->ctime ||
  2172. mddev->level != info->level ||
  2173. /* mddev->layout != info->layout || */
  2174. !mddev->persistent != info->not_persistent||
  2175. mddev->chunk_size != info->chunk_size )
  2176. return -EINVAL;
  2177. /* Check there is only one change */
  2178. if (mddev->size != info->size) cnt++;
  2179. if (mddev->raid_disks != info->raid_disks) cnt++;
  2180. if (mddev->layout != info->layout) cnt++;
  2181. if (cnt == 0) return 0;
  2182. if (cnt > 1) return -EINVAL;
  2183. if (mddev->layout != info->layout) {
  2184. /* Change layout
  2185. * we don't need to do anything at the md level, the
  2186. * personality will take care of it all.
  2187. */
  2188. if (mddev->pers->reconfig == NULL)
  2189. return -EINVAL;
  2190. else
  2191. return mddev->pers->reconfig(mddev, info->layout, -1);
  2192. }
  2193. if (mddev->size != info->size) {
  2194. mdk_rdev_t * rdev;
  2195. struct list_head *tmp;
  2196. if (mddev->pers->resize == NULL)
  2197. return -EINVAL;
  2198. /* The "size" is the amount of each device that is used.
  2199. * This can only make sense for arrays with redundancy.
  2200. * linear and raid0 always use whatever space is available
  2201. * We can only consider changing the size if no resync
  2202. * or reconstruction is happening, and if the new size
  2203. * is acceptable. It must fit before the sb_offset or,
  2204. * if that is <data_offset, it must fit before the
  2205. * size of each device.
  2206. * If size is zero, we find the largest size that fits.
  2207. */
  2208. if (mddev->sync_thread)
  2209. return -EBUSY;
  2210. ITERATE_RDEV(mddev,rdev,tmp) {
  2211. sector_t avail;
  2212. int fit = (info->size == 0);
  2213. if (rdev->sb_offset > rdev->data_offset)
  2214. avail = (rdev->sb_offset*2) - rdev->data_offset;
  2215. else
  2216. avail = get_capacity(rdev->bdev->bd_disk)
  2217. - rdev->data_offset;
  2218. if (fit && (info->size == 0 || info->size > avail/2))
  2219. info->size = avail/2;
  2220. if (avail < ((sector_t)info->size << 1))
  2221. return -ENOSPC;
  2222. }
  2223. rv = mddev->pers->resize(mddev, (sector_t)info->size *2);
  2224. if (!rv) {
  2225. struct block_device *bdev;
  2226. bdev = bdget_disk(mddev->gendisk, 0);
  2227. if (bdev) {
  2228. down(&bdev->bd_inode->i_sem);
  2229. i_size_write(bdev->bd_inode, mddev->array_size << 10);
  2230. up(&bdev->bd_inode->i_sem);
  2231. bdput(bdev);
  2232. }
  2233. }
  2234. }
  2235. if (mddev->raid_disks != info->raid_disks) {
  2236. /* change the number of raid disks */
  2237. if (mddev->pers->reshape == NULL)
  2238. return -EINVAL;
  2239. if (info->raid_disks <= 0 ||
  2240. info->raid_disks >= mddev->max_disks)
  2241. return -EINVAL;
  2242. if (mddev->sync_thread)
  2243. return -EBUSY;
  2244. rv = mddev->pers->reshape(mddev, info->raid_disks);
  2245. if (!rv) {
  2246. struct block_device *bdev;
  2247. bdev = bdget_disk(mddev->gendisk, 0);
  2248. if (bdev) {
  2249. down(&bdev->bd_inode->i_sem);
  2250. i_size_write(bdev->bd_inode, mddev->array_size << 10);
  2251. up(&bdev->bd_inode->i_sem);
  2252. bdput(bdev);
  2253. }
  2254. }
  2255. }
  2256. md_update_sb(mddev);
  2257. return rv;
  2258. }
  2259. static int set_disk_faulty(mddev_t *mddev, dev_t dev)
  2260. {
  2261. mdk_rdev_t *rdev;
  2262. if (mddev->pers == NULL)
  2263. return -ENODEV;
  2264. rdev = find_rdev(mddev, dev);
  2265. if (!rdev)
  2266. return -ENODEV;
  2267. md_error(mddev, rdev);
  2268. return 0;
  2269. }
  2270. static int md_ioctl(struct inode *inode, struct file *file,
  2271. unsigned int cmd, unsigned long arg)
  2272. {
  2273. int err = 0;
  2274. void __user *argp = (void __user *)arg;
  2275. struct hd_geometry __user *loc = argp;
  2276. mddev_t *mddev = NULL;
  2277. if (!capable(CAP_SYS_ADMIN))
  2278. return -EACCES;
  2279. /*
  2280. * Commands dealing with the RAID driver but not any
  2281. * particular array:
  2282. */
  2283. switch (cmd)
  2284. {
  2285. case RAID_VERSION:
  2286. err = get_version(argp);
  2287. goto done;
  2288. case PRINT_RAID_DEBUG:
  2289. err = 0;
  2290. md_print_devices();
  2291. goto done;
  2292. #ifndef MODULE
  2293. case RAID_AUTORUN:
  2294. err = 0;
  2295. autostart_arrays(arg);
  2296. goto done;
  2297. #endif
  2298. default:;
  2299. }
  2300. /*
  2301. * Commands creating/starting a new array:
  2302. */
  2303. mddev = inode->i_bdev->bd_disk->private_data;
  2304. if (!mddev) {
  2305. BUG();
  2306. goto abort;
  2307. }
  2308. if (cmd == START_ARRAY) {
  2309. /* START_ARRAY doesn't need to lock the array as autostart_array
  2310. * does the locking, and it could even be a different array
  2311. */
  2312. static int cnt = 3;
  2313. if (cnt > 0 ) {
  2314. printk(KERN_WARNING
  2315. "md: %s(pid %d) used deprecated START_ARRAY ioctl. "
  2316. "This will not be supported beyond 2.6\n",
  2317. current->comm, current->pid);
  2318. cnt--;
  2319. }
  2320. err = autostart_array(new_decode_dev(arg));
  2321. if (err) {
  2322. printk(KERN_WARNING "md: autostart failed!\n");
  2323. goto abort;
  2324. }
  2325. goto done;
  2326. }
  2327. err = mddev_lock(mddev);
  2328. if (err) {
  2329. printk(KERN_INFO
  2330. "md: ioctl lock interrupted, reason %d, cmd %d\n",
  2331. err, cmd);
  2332. goto abort;
  2333. }
  2334. switch (cmd)
  2335. {
  2336. case SET_ARRAY_INFO:
  2337. {
  2338. mdu_array_info_t info;
  2339. if (!arg)
  2340. memset(&info, 0, sizeof(info));
  2341. else if (copy_from_user(&info, argp, sizeof(info))) {
  2342. err = -EFAULT;
  2343. goto abort_unlock;
  2344. }
  2345. if (mddev->pers) {
  2346. err = update_array_info(mddev, &info);
  2347. if (err) {
  2348. printk(KERN_WARNING "md: couldn't update"
  2349. " array info. %d\n", err);
  2350. goto abort_unlock;
  2351. }
  2352. goto done_unlock;
  2353. }
  2354. if (!list_empty(&mddev->disks)) {
  2355. printk(KERN_WARNING
  2356. "md: array %s already has disks!\n",
  2357. mdname(mddev));
  2358. err = -EBUSY;
  2359. goto abort_unlock;
  2360. }
  2361. if (mddev->raid_disks) {
  2362. printk(KERN_WARNING
  2363. "md: array %s already initialised!\n",
  2364. mdname(mddev));
  2365. err = -EBUSY;
  2366. goto abort_unlock;
  2367. }
  2368. err = set_array_info(mddev, &info);
  2369. if (err) {
  2370. printk(KERN_WARNING "md: couldn't set"
  2371. " array info. %d\n", err);
  2372. goto abort_unlock;
  2373. }
  2374. }
  2375. goto done_unlock;
  2376. default:;
  2377. }
  2378. /*
  2379. * Commands querying/configuring an existing array:
  2380. */
  2381. /* if we are not initialised yet, only ADD_NEW_DISK, STOP_ARRAY,
  2382. * RUN_ARRAY, and SET_BITMAP_FILE are allowed */
  2383. if (!mddev->raid_disks && cmd != ADD_NEW_DISK && cmd != STOP_ARRAY
  2384. && cmd != RUN_ARRAY && cmd != SET_BITMAP_FILE) {
  2385. err = -ENODEV;
  2386. goto abort_unlock;
  2387. }
  2388. /*
  2389. * Commands even a read-only array can execute:
  2390. */
  2391. switch (cmd)
  2392. {
  2393. case GET_ARRAY_INFO:
  2394. err = get_array_info(mddev, argp);
  2395. goto done_unlock;
  2396. case GET_BITMAP_FILE:
  2397. err = get_bitmap_file(mddev, (void *)arg);
  2398. goto done_unlock;
  2399. case GET_DISK_INFO:
  2400. err = get_disk_info(mddev, argp);
  2401. goto done_unlock;
  2402. case RESTART_ARRAY_RW:
  2403. err = restart_array(mddev);
  2404. goto done_unlock;
  2405. case STOP_ARRAY:
  2406. err = do_md_stop (mddev, 0);
  2407. goto done_unlock;
  2408. case STOP_ARRAY_RO:
  2409. err = do_md_stop (mddev, 1);
  2410. goto done_unlock;
  2411. /*
  2412. * We have a problem here : there is no easy way to give a CHS
  2413. * virtual geometry. We currently pretend that we have a 2 heads
  2414. * 4 sectors (with a BIG number of cylinders...). This drives
  2415. * dosfs just mad... ;-)
  2416. */
  2417. case HDIO_GETGEO:
  2418. if (!loc) {
  2419. err = -EINVAL;
  2420. goto abort_unlock;
  2421. }
  2422. err = put_user (2, (char __user *) &loc->heads);
  2423. if (err)
  2424. goto abort_unlock;
  2425. err = put_user (4, (char __user *) &loc->sectors);
  2426. if (err)
  2427. goto abort_unlock;
  2428. err = put_user(get_capacity(mddev->gendisk)/8,
  2429. (short __user *) &loc->cylinders);
  2430. if (err)
  2431. goto abort_unlock;
  2432. err = put_user (get_start_sect(inode->i_bdev),
  2433. (long __user *) &loc->start);
  2434. goto done_unlock;
  2435. }
  2436. /*
  2437. * The remaining ioctls are changing the state of the
  2438. * superblock, so we do not allow read-only arrays
  2439. * here:
  2440. */
  2441. if (mddev->ro) {
  2442. err = -EROFS;
  2443. goto abort_unlock;
  2444. }
  2445. switch (cmd)
  2446. {
  2447. case ADD_NEW_DISK:
  2448. {
  2449. mdu_disk_info_t info;
  2450. if (copy_from_user(&info, argp, sizeof(info)))
  2451. err = -EFAULT;
  2452. else
  2453. err = add_new_disk(mddev, &info);
  2454. goto done_unlock;
  2455. }
  2456. case HOT_REMOVE_DISK:
  2457. err = hot_remove_disk(mddev, new_decode_dev(arg));
  2458. goto done_unlock;
  2459. case HOT_ADD_DISK:
  2460. err = hot_add_disk(mddev, new_decode_dev(arg));
  2461. goto done_unlock;
  2462. case SET_DISK_FAULTY:
  2463. err = set_disk_faulty(mddev, new_decode_dev(arg));
  2464. goto done_unlock;
  2465. case RUN_ARRAY:
  2466. err = do_md_run (mddev);
  2467. goto done_unlock;
  2468. case SET_BITMAP_FILE:
  2469. err = set_bitmap_file(mddev, (int)arg);
  2470. goto done_unlock;
  2471. default:
  2472. if (_IOC_TYPE(cmd) == MD_MAJOR)
  2473. printk(KERN_WARNING "md: %s(pid %d) used"
  2474. " obsolete MD ioctl, upgrade your"
  2475. " software to use new ictls.\n",
  2476. current->comm, current->pid);
  2477. err = -EINVAL;
  2478. goto abort_unlock;
  2479. }
  2480. done_unlock:
  2481. abort_unlock:
  2482. mddev_unlock(mddev);
  2483. return err;
  2484. done:
  2485. if (err)
  2486. MD_BUG();
  2487. abort:
  2488. return err;
  2489. }
  2490. static int md_open(struct inode *inode, struct file *file)
  2491. {
  2492. /*
  2493. * Succeed if we can lock the mddev, which confirms that
  2494. * it isn't being stopped right now.
  2495. */
  2496. mddev_t *mddev = inode->i_bdev->bd_disk->private_data;
  2497. int err;
  2498. if ((err = mddev_lock(mddev)))
  2499. goto out;
  2500. err = 0;
  2501. mddev_get(mddev);
  2502. mddev_unlock(mddev);
  2503. check_disk_change(inode->i_bdev);
  2504. out:
  2505. return err;
  2506. }
  2507. static int md_release(struct inode *inode, struct file * file)
  2508. {
  2509. mddev_t *mddev = inode->i_bdev->bd_disk->private_data;
  2510. if (!mddev)
  2511. BUG();
  2512. mddev_put(mddev);
  2513. return 0;
  2514. }
  2515. static int md_media_changed(struct gendisk *disk)
  2516. {
  2517. mddev_t *mddev = disk->private_data;
  2518. return mddev->changed;
  2519. }
  2520. static int md_revalidate(struct gendisk *disk)
  2521. {
  2522. mddev_t *mddev = disk->private_data;
  2523. mddev->changed = 0;
  2524. return 0;
  2525. }
  2526. static struct block_device_operations md_fops =
  2527. {
  2528. .owner = THIS_MODULE,
  2529. .open = md_open,
  2530. .release = md_release,
  2531. .ioctl = md_ioctl,
  2532. .media_changed = md_media_changed,
  2533. .revalidate_disk= md_revalidate,
  2534. };
  2535. static int md_thread(void * arg)
  2536. {
  2537. mdk_thread_t *thread = arg;
  2538. lock_kernel();
  2539. /*
  2540. * Detach thread
  2541. */
  2542. daemonize(thread->name, mdname(thread->mddev));
  2543. current->exit_signal = SIGCHLD;
  2544. allow_signal(SIGKILL);
  2545. thread->tsk = current;
  2546. /*
  2547. * md_thread is a 'system-thread', it's priority should be very
  2548. * high. We avoid resource deadlocks individually in each
  2549. * raid personality. (RAID5 does preallocation) We also use RR and
  2550. * the very same RT priority as kswapd, thus we will never get
  2551. * into a priority inversion deadlock.
  2552. *
  2553. * we definitely have to have equal or higher priority than
  2554. * bdflush, otherwise bdflush will deadlock if there are too
  2555. * many dirty RAID5 blocks.
  2556. */
  2557. unlock_kernel();
  2558. complete(thread->event);
  2559. while (thread->run) {
  2560. void (*run)(mddev_t *);
  2561. wait_event_interruptible_timeout(thread->wqueue,
  2562. test_bit(THREAD_WAKEUP, &thread->flags),
  2563. thread->timeout);
  2564. try_to_freeze();
  2565. clear_bit(THREAD_WAKEUP, &thread->flags);
  2566. run = thread->run;
  2567. if (run)
  2568. run(thread->mddev);
  2569. if (signal_pending(current))
  2570. flush_signals(current);
  2571. }
  2572. complete(thread->event);
  2573. return 0;
  2574. }
  2575. void md_wakeup_thread(mdk_thread_t *thread)
  2576. {
  2577. if (thread) {
  2578. dprintk("md: waking up MD thread %s.\n", thread->tsk->comm);
  2579. set_bit(THREAD_WAKEUP, &thread->flags);
  2580. wake_up(&thread->wqueue);
  2581. }
  2582. }
  2583. mdk_thread_t *md_register_thread(void (*run) (mddev_t *), mddev_t *mddev,
  2584. const char *name)
  2585. {
  2586. mdk_thread_t *thread;
  2587. int ret;
  2588. struct completion event;
  2589. thread = (mdk_thread_t *) kmalloc
  2590. (sizeof(mdk_thread_t), GFP_KERNEL);
  2591. if (!thread)
  2592. return NULL;
  2593. memset(thread, 0, sizeof(mdk_thread_t));
  2594. init_waitqueue_head(&thread->wqueue);
  2595. init_completion(&event);
  2596. thread->event = &event;
  2597. thread->run = run;
  2598. thread->mddev = mddev;
  2599. thread->name = name;
  2600. thread->timeout = MAX_SCHEDULE_TIMEOUT;
  2601. ret = kernel_thread(md_thread, thread, 0);
  2602. if (ret < 0) {
  2603. kfree(thread);
  2604. return NULL;
  2605. }
  2606. wait_for_completion(&event);
  2607. return thread;
  2608. }
  2609. void md_unregister_thread(mdk_thread_t *thread)
  2610. {
  2611. struct completion event;
  2612. init_completion(&event);
  2613. thread->event = &event;
  2614. /* As soon as ->run is set to NULL, the task could disappear,
  2615. * so we need to hold tasklist_lock until we have sent the signal
  2616. */
  2617. dprintk("interrupting MD-thread pid %d\n", thread->tsk->pid);
  2618. read_lock(&tasklist_lock);
  2619. thread->run = NULL;
  2620. send_sig(SIGKILL, thread->tsk, 1);
  2621. read_unlock(&tasklist_lock);
  2622. wait_for_completion(&event);
  2623. kfree(thread);
  2624. }
  2625. void md_error(mddev_t *mddev, mdk_rdev_t *rdev)
  2626. {
  2627. if (!mddev) {
  2628. MD_BUG();
  2629. return;
  2630. }
  2631. if (!rdev || rdev->faulty)
  2632. return;
  2633. /*
  2634. dprintk("md_error dev:%s, rdev:(%d:%d), (caller: %p,%p,%p,%p).\n",
  2635. mdname(mddev),
  2636. MAJOR(rdev->bdev->bd_dev), MINOR(rdev->bdev->bd_dev),
  2637. __builtin_return_address(0),__builtin_return_address(1),
  2638. __builtin_return_address(2),__builtin_return_address(3));
  2639. */
  2640. if (!mddev->pers->error_handler)
  2641. return;
  2642. mddev->pers->error_handler(mddev,rdev);
  2643. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  2644. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  2645. md_wakeup_thread(mddev->thread);
  2646. }
  2647. /* seq_file implementation /proc/mdstat */
  2648. static void status_unused(struct seq_file *seq)
  2649. {
  2650. int i = 0;
  2651. mdk_rdev_t *rdev;
  2652. struct list_head *tmp;
  2653. seq_printf(seq, "unused devices: ");
  2654. ITERATE_RDEV_PENDING(rdev,tmp) {
  2655. char b[BDEVNAME_SIZE];
  2656. i++;
  2657. seq_printf(seq, "%s ",
  2658. bdevname(rdev->bdev,b));
  2659. }
  2660. if (!i)
  2661. seq_printf(seq, "<none>");
  2662. seq_printf(seq, "\n");
  2663. }
  2664. static void status_resync(struct seq_file *seq, mddev_t * mddev)
  2665. {
  2666. unsigned long max_blocks, resync, res, dt, db, rt;
  2667. resync = (mddev->curr_resync - atomic_read(&mddev->recovery_active))/2;
  2668. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  2669. max_blocks = mddev->resync_max_sectors >> 1;
  2670. else
  2671. max_blocks = mddev->size;
  2672. /*
  2673. * Should not happen.
  2674. */
  2675. if (!max_blocks) {
  2676. MD_BUG();
  2677. return;
  2678. }
  2679. res = (resync/1024)*1000/(max_blocks/1024 + 1);
  2680. {
  2681. int i, x = res/50, y = 20-x;
  2682. seq_printf(seq, "[");
  2683. for (i = 0; i < x; i++)
  2684. seq_printf(seq, "=");
  2685. seq_printf(seq, ">");
  2686. for (i = 0; i < y; i++)
  2687. seq_printf(seq, ".");
  2688. seq_printf(seq, "] ");
  2689. }
  2690. seq_printf(seq, " %s =%3lu.%lu%% (%lu/%lu)",
  2691. (test_bit(MD_RECOVERY_SYNC, &mddev->recovery) ?
  2692. "resync" : "recovery"),
  2693. res/10, res % 10, resync, max_blocks);
  2694. /*
  2695. * We do not want to overflow, so the order of operands and
  2696. * the * 100 / 100 trick are important. We do a +1 to be
  2697. * safe against division by zero. We only estimate anyway.
  2698. *
  2699. * dt: time from mark until now
  2700. * db: blocks written from mark until now
  2701. * rt: remaining time
  2702. */
  2703. dt = ((jiffies - mddev->resync_mark) / HZ);
  2704. if (!dt) dt++;
  2705. db = resync - (mddev->resync_mark_cnt/2);
  2706. rt = (dt * ((max_blocks-resync) / (db/100+1)))/100;
  2707. seq_printf(seq, " finish=%lu.%lumin", rt / 60, (rt % 60)/6);
  2708. seq_printf(seq, " speed=%ldK/sec", db/dt);
  2709. }
  2710. static void *md_seq_start(struct seq_file *seq, loff_t *pos)
  2711. {
  2712. struct list_head *tmp;
  2713. loff_t l = *pos;
  2714. mddev_t *mddev;
  2715. if (l >= 0x10000)
  2716. return NULL;
  2717. if (!l--)
  2718. /* header */
  2719. return (void*)1;
  2720. spin_lock(&all_mddevs_lock);
  2721. list_for_each(tmp,&all_mddevs)
  2722. if (!l--) {
  2723. mddev = list_entry(tmp, mddev_t, all_mddevs);
  2724. mddev_get(mddev);
  2725. spin_unlock(&all_mddevs_lock);
  2726. return mddev;
  2727. }
  2728. spin_unlock(&all_mddevs_lock);
  2729. if (!l--)
  2730. return (void*)2;/* tail */
  2731. return NULL;
  2732. }
  2733. static void *md_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  2734. {
  2735. struct list_head *tmp;
  2736. mddev_t *next_mddev, *mddev = v;
  2737. ++*pos;
  2738. if (v == (void*)2)
  2739. return NULL;
  2740. spin_lock(&all_mddevs_lock);
  2741. if (v == (void*)1)
  2742. tmp = all_mddevs.next;
  2743. else
  2744. tmp = mddev->all_mddevs.next;
  2745. if (tmp != &all_mddevs)
  2746. next_mddev = mddev_get(list_entry(tmp,mddev_t,all_mddevs));
  2747. else {
  2748. next_mddev = (void*)2;
  2749. *pos = 0x10000;
  2750. }
  2751. spin_unlock(&all_mddevs_lock);
  2752. if (v != (void*)1)
  2753. mddev_put(mddev);
  2754. return next_mddev;
  2755. }
  2756. static void md_seq_stop(struct seq_file *seq, void *v)
  2757. {
  2758. mddev_t *mddev = v;
  2759. if (mddev && v != (void*)1 && v != (void*)2)
  2760. mddev_put(mddev);
  2761. }
  2762. static int md_seq_show(struct seq_file *seq, void *v)
  2763. {
  2764. mddev_t *mddev = v;
  2765. sector_t size;
  2766. struct list_head *tmp2;
  2767. mdk_rdev_t *rdev;
  2768. int i;
  2769. struct bitmap *bitmap;
  2770. if (v == (void*)1) {
  2771. seq_printf(seq, "Personalities : ");
  2772. spin_lock(&pers_lock);
  2773. for (i = 0; i < MAX_PERSONALITY; i++)
  2774. if (pers[i])
  2775. seq_printf(seq, "[%s] ", pers[i]->name);
  2776. spin_unlock(&pers_lock);
  2777. seq_printf(seq, "\n");
  2778. return 0;
  2779. }
  2780. if (v == (void*)2) {
  2781. status_unused(seq);
  2782. return 0;
  2783. }
  2784. if (mddev_lock(mddev)!=0)
  2785. return -EINTR;
  2786. if (mddev->pers || mddev->raid_disks || !list_empty(&mddev->disks)) {
  2787. seq_printf(seq, "%s : %sactive", mdname(mddev),
  2788. mddev->pers ? "" : "in");
  2789. if (mddev->pers) {
  2790. if (mddev->ro)
  2791. seq_printf(seq, " (read-only)");
  2792. seq_printf(seq, " %s", mddev->pers->name);
  2793. }
  2794. size = 0;
  2795. ITERATE_RDEV(mddev,rdev,tmp2) {
  2796. char b[BDEVNAME_SIZE];
  2797. seq_printf(seq, " %s[%d]",
  2798. bdevname(rdev->bdev,b), rdev->desc_nr);
  2799. if (rdev->faulty) {
  2800. seq_printf(seq, "(F)");
  2801. continue;
  2802. }
  2803. size += rdev->size;
  2804. }
  2805. if (!list_empty(&mddev->disks)) {
  2806. if (mddev->pers)
  2807. seq_printf(seq, "\n %llu blocks",
  2808. (unsigned long long)mddev->array_size);
  2809. else
  2810. seq_printf(seq, "\n %llu blocks",
  2811. (unsigned long long)size);
  2812. }
  2813. if (mddev->pers) {
  2814. mddev->pers->status (seq, mddev);
  2815. seq_printf(seq, "\n ");
  2816. if (mddev->curr_resync > 2) {
  2817. status_resync (seq, mddev);
  2818. seq_printf(seq, "\n ");
  2819. } else if (mddev->curr_resync == 1 || mddev->curr_resync == 2)
  2820. seq_printf(seq, " resync=DELAYED\n ");
  2821. } else
  2822. seq_printf(seq, "\n ");
  2823. if ((bitmap = mddev->bitmap)) {
  2824. unsigned long chunk_kb;
  2825. unsigned long flags;
  2826. spin_lock_irqsave(&bitmap->lock, flags);
  2827. chunk_kb = bitmap->chunksize >> 10;
  2828. seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
  2829. "%lu%s chunk",
  2830. bitmap->pages - bitmap->missing_pages,
  2831. bitmap->pages,
  2832. (bitmap->pages - bitmap->missing_pages)
  2833. << (PAGE_SHIFT - 10),
  2834. chunk_kb ? chunk_kb : bitmap->chunksize,
  2835. chunk_kb ? "KB" : "B");
  2836. if (bitmap->file) {
  2837. seq_printf(seq, ", file: ");
  2838. seq_path(seq, bitmap->file->f_vfsmnt,
  2839. bitmap->file->f_dentry," \t\n");
  2840. }
  2841. seq_printf(seq, "\n");
  2842. spin_unlock_irqrestore(&bitmap->lock, flags);
  2843. }
  2844. seq_printf(seq, "\n");
  2845. }
  2846. mddev_unlock(mddev);
  2847. return 0;
  2848. }
  2849. static struct seq_operations md_seq_ops = {
  2850. .start = md_seq_start,
  2851. .next = md_seq_next,
  2852. .stop = md_seq_stop,
  2853. .show = md_seq_show,
  2854. };
  2855. static int md_seq_open(struct inode *inode, struct file *file)
  2856. {
  2857. int error;
  2858. error = seq_open(file, &md_seq_ops);
  2859. return error;
  2860. }
  2861. static struct file_operations md_seq_fops = {
  2862. .open = md_seq_open,
  2863. .read = seq_read,
  2864. .llseek = seq_lseek,
  2865. .release = seq_release,
  2866. };
  2867. int register_md_personality(int pnum, mdk_personality_t *p)
  2868. {
  2869. if (pnum >= MAX_PERSONALITY) {
  2870. printk(KERN_ERR
  2871. "md: tried to install personality %s as nr %d, but max is %lu\n",
  2872. p->name, pnum, MAX_PERSONALITY-1);
  2873. return -EINVAL;
  2874. }
  2875. spin_lock(&pers_lock);
  2876. if (pers[pnum]) {
  2877. spin_unlock(&pers_lock);
  2878. return -EBUSY;
  2879. }
  2880. pers[pnum] = p;
  2881. printk(KERN_INFO "md: %s personality registered as nr %d\n", p->name, pnum);
  2882. spin_unlock(&pers_lock);
  2883. return 0;
  2884. }
  2885. int unregister_md_personality(int pnum)
  2886. {
  2887. if (pnum >= MAX_PERSONALITY)
  2888. return -EINVAL;
  2889. printk(KERN_INFO "md: %s personality unregistered\n", pers[pnum]->name);
  2890. spin_lock(&pers_lock);
  2891. pers[pnum] = NULL;
  2892. spin_unlock(&pers_lock);
  2893. return 0;
  2894. }
  2895. static int is_mddev_idle(mddev_t *mddev)
  2896. {
  2897. mdk_rdev_t * rdev;
  2898. struct list_head *tmp;
  2899. int idle;
  2900. unsigned long curr_events;
  2901. idle = 1;
  2902. ITERATE_RDEV(mddev,rdev,tmp) {
  2903. struct gendisk *disk = rdev->bdev->bd_contains->bd_disk;
  2904. curr_events = disk_stat_read(disk, read_sectors) +
  2905. disk_stat_read(disk, write_sectors) -
  2906. atomic_read(&disk->sync_io);
  2907. /* Allow some slack between valud of curr_events and last_events,
  2908. * as there are some uninteresting races.
  2909. * Note: the following is an unsigned comparison.
  2910. */
  2911. if ((curr_events - rdev->last_events + 32) > 64) {
  2912. rdev->last_events = curr_events;
  2913. idle = 0;
  2914. }
  2915. }
  2916. return idle;
  2917. }
  2918. void md_done_sync(mddev_t *mddev, int blocks, int ok)
  2919. {
  2920. /* another "blocks" (512byte) blocks have been synced */
  2921. atomic_sub(blocks, &mddev->recovery_active);
  2922. wake_up(&mddev->recovery_wait);
  2923. if (!ok) {
  2924. set_bit(MD_RECOVERY_ERR, &mddev->recovery);
  2925. md_wakeup_thread(mddev->thread);
  2926. // stop recovery, signal do_sync ....
  2927. }
  2928. }
  2929. /* md_write_start(mddev, bi)
  2930. * If we need to update some array metadata (e.g. 'active' flag
  2931. * in superblock) before writing, schedule a superblock update
  2932. * and wait for it to complete.
  2933. */
  2934. void md_write_start(mddev_t *mddev, struct bio *bi)
  2935. {
  2936. DEFINE_WAIT(w);
  2937. if (bio_data_dir(bi) != WRITE)
  2938. return;
  2939. atomic_inc(&mddev->writes_pending);
  2940. if (mddev->in_sync) {
  2941. spin_lock(&mddev->write_lock);
  2942. if (mddev->in_sync) {
  2943. mddev->in_sync = 0;
  2944. mddev->sb_dirty = 1;
  2945. md_wakeup_thread(mddev->thread);
  2946. }
  2947. spin_unlock(&mddev->write_lock);
  2948. }
  2949. wait_event(mddev->sb_wait, mddev->sb_dirty==0);
  2950. }
  2951. void md_write_end(mddev_t *mddev)
  2952. {
  2953. if (atomic_dec_and_test(&mddev->writes_pending)) {
  2954. if (mddev->safemode == 2)
  2955. md_wakeup_thread(mddev->thread);
  2956. else
  2957. mod_timer(&mddev->safemode_timer, jiffies + mddev->safemode_delay);
  2958. }
  2959. }
  2960. static DECLARE_WAIT_QUEUE_HEAD(resync_wait);
  2961. #define SYNC_MARKS 10
  2962. #define SYNC_MARK_STEP (3*HZ)
  2963. static void md_do_sync(mddev_t *mddev)
  2964. {
  2965. mddev_t *mddev2;
  2966. unsigned int currspeed = 0,
  2967. window;
  2968. sector_t max_sectors,j, io_sectors;
  2969. unsigned long mark[SYNC_MARKS];
  2970. sector_t mark_cnt[SYNC_MARKS];
  2971. int last_mark,m;
  2972. struct list_head *tmp;
  2973. sector_t last_check;
  2974. int skipped = 0;
  2975. /* just incase thread restarts... */
  2976. if (test_bit(MD_RECOVERY_DONE, &mddev->recovery))
  2977. return;
  2978. /* we overload curr_resync somewhat here.
  2979. * 0 == not engaged in resync at all
  2980. * 2 == checking that there is no conflict with another sync
  2981. * 1 == like 2, but have yielded to allow conflicting resync to
  2982. * commense
  2983. * other == active in resync - this many blocks
  2984. *
  2985. * Before starting a resync we must have set curr_resync to
  2986. * 2, and then checked that every "conflicting" array has curr_resync
  2987. * less than ours. When we find one that is the same or higher
  2988. * we wait on resync_wait. To avoid deadlock, we reduce curr_resync
  2989. * to 1 if we choose to yield (based arbitrarily on address of mddev structure).
  2990. * This will mean we have to start checking from the beginning again.
  2991. *
  2992. */
  2993. do {
  2994. mddev->curr_resync = 2;
  2995. try_again:
  2996. if (signal_pending(current)) {
  2997. flush_signals(current);
  2998. goto skip;
  2999. }
  3000. ITERATE_MDDEV(mddev2,tmp) {
  3001. if (mddev2 == mddev)
  3002. continue;
  3003. if (mddev2->curr_resync &&
  3004. match_mddev_units(mddev,mddev2)) {
  3005. DEFINE_WAIT(wq);
  3006. if (mddev < mddev2 && mddev->curr_resync == 2) {
  3007. /* arbitrarily yield */
  3008. mddev->curr_resync = 1;
  3009. wake_up(&resync_wait);
  3010. }
  3011. if (mddev > mddev2 && mddev->curr_resync == 1)
  3012. /* no need to wait here, we can wait the next
  3013. * time 'round when curr_resync == 2
  3014. */
  3015. continue;
  3016. prepare_to_wait(&resync_wait, &wq, TASK_INTERRUPTIBLE);
  3017. if (!signal_pending(current)
  3018. && mddev2->curr_resync >= mddev->curr_resync) {
  3019. printk(KERN_INFO "md: delaying resync of %s"
  3020. " until %s has finished resync (they"
  3021. " share one or more physical units)\n",
  3022. mdname(mddev), mdname(mddev2));
  3023. mddev_put(mddev2);
  3024. schedule();
  3025. finish_wait(&resync_wait, &wq);
  3026. goto try_again;
  3027. }
  3028. finish_wait(&resync_wait, &wq);
  3029. }
  3030. }
  3031. } while (mddev->curr_resync < 2);
  3032. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  3033. /* resync follows the size requested by the personality,
  3034. * which defaults to physical size, but can be virtual size
  3035. */
  3036. max_sectors = mddev->resync_max_sectors;
  3037. else
  3038. /* recovery follows the physical size of devices */
  3039. max_sectors = mddev->size << 1;
  3040. printk(KERN_INFO "md: syncing RAID array %s\n", mdname(mddev));
  3041. printk(KERN_INFO "md: minimum _guaranteed_ reconstruction speed:"
  3042. " %d KB/sec/disc.\n", sysctl_speed_limit_min);
  3043. printk(KERN_INFO "md: using maximum available idle IO bandwith "
  3044. "(but not more than %d KB/sec) for reconstruction.\n",
  3045. sysctl_speed_limit_max);
  3046. is_mddev_idle(mddev); /* this also initializes IO event counters */
  3047. /* we don't use the checkpoint if there's a bitmap */
  3048. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery) && !mddev->bitmap)
  3049. j = mddev->recovery_cp;
  3050. else
  3051. j = 0;
  3052. io_sectors = 0;
  3053. for (m = 0; m < SYNC_MARKS; m++) {
  3054. mark[m] = jiffies;
  3055. mark_cnt[m] = io_sectors;
  3056. }
  3057. last_mark = 0;
  3058. mddev->resync_mark = mark[last_mark];
  3059. mddev->resync_mark_cnt = mark_cnt[last_mark];
  3060. /*
  3061. * Tune reconstruction:
  3062. */
  3063. window = 32*(PAGE_SIZE/512);
  3064. printk(KERN_INFO "md: using %dk window, over a total of %llu blocks.\n",
  3065. window/2,(unsigned long long) max_sectors/2);
  3066. atomic_set(&mddev->recovery_active, 0);
  3067. init_waitqueue_head(&mddev->recovery_wait);
  3068. last_check = 0;
  3069. if (j>2) {
  3070. printk(KERN_INFO
  3071. "md: resuming recovery of %s from checkpoint.\n",
  3072. mdname(mddev));
  3073. mddev->curr_resync = j;
  3074. }
  3075. while (j < max_sectors) {
  3076. sector_t sectors;
  3077. skipped = 0;
  3078. sectors = mddev->pers->sync_request(mddev, j, &skipped,
  3079. currspeed < sysctl_speed_limit_min);
  3080. if (sectors == 0) {
  3081. set_bit(MD_RECOVERY_ERR, &mddev->recovery);
  3082. goto out;
  3083. }
  3084. if (!skipped) { /* actual IO requested */
  3085. io_sectors += sectors;
  3086. atomic_add(sectors, &mddev->recovery_active);
  3087. }
  3088. j += sectors;
  3089. if (j>1) mddev->curr_resync = j;
  3090. if (last_check + window > io_sectors || j == max_sectors)
  3091. continue;
  3092. last_check = io_sectors;
  3093. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery) ||
  3094. test_bit(MD_RECOVERY_ERR, &mddev->recovery))
  3095. break;
  3096. repeat:
  3097. if (time_after_eq(jiffies, mark[last_mark] + SYNC_MARK_STEP )) {
  3098. /* step marks */
  3099. int next = (last_mark+1) % SYNC_MARKS;
  3100. mddev->resync_mark = mark[next];
  3101. mddev->resync_mark_cnt = mark_cnt[next];
  3102. mark[next] = jiffies;
  3103. mark_cnt[next] = io_sectors - atomic_read(&mddev->recovery_active);
  3104. last_mark = next;
  3105. }
  3106. if (signal_pending(current)) {
  3107. /*
  3108. * got a signal, exit.
  3109. */
  3110. printk(KERN_INFO
  3111. "md: md_do_sync() got signal ... exiting\n");
  3112. flush_signals(current);
  3113. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  3114. goto out;
  3115. }
  3116. /*
  3117. * this loop exits only if either when we are slower than
  3118. * the 'hard' speed limit, or the system was IO-idle for
  3119. * a jiffy.
  3120. * the system might be non-idle CPU-wise, but we only care
  3121. * about not overloading the IO subsystem. (things like an
  3122. * e2fsck being done on the RAID array should execute fast)
  3123. */
  3124. mddev->queue->unplug_fn(mddev->queue);
  3125. cond_resched();
  3126. currspeed = ((unsigned long)(io_sectors-mddev->resync_mark_cnt))/2
  3127. /((jiffies-mddev->resync_mark)/HZ +1) +1;
  3128. if (currspeed > sysctl_speed_limit_min) {
  3129. if ((currspeed > sysctl_speed_limit_max) ||
  3130. !is_mddev_idle(mddev)) {
  3131. msleep_interruptible(250);
  3132. goto repeat;
  3133. }
  3134. }
  3135. }
  3136. printk(KERN_INFO "md: %s: sync done.\n",mdname(mddev));
  3137. /*
  3138. * this also signals 'finished resyncing' to md_stop
  3139. */
  3140. out:
  3141. mddev->queue->unplug_fn(mddev->queue);
  3142. wait_event(mddev->recovery_wait, !atomic_read(&mddev->recovery_active));
  3143. /* tell personality that we are finished */
  3144. mddev->pers->sync_request(mddev, max_sectors, &skipped, 1);
  3145. if (!test_bit(MD_RECOVERY_ERR, &mddev->recovery) &&
  3146. mddev->curr_resync > 2 &&
  3147. mddev->curr_resync >= mddev->recovery_cp) {
  3148. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
  3149. printk(KERN_INFO
  3150. "md: checkpointing recovery of %s.\n",
  3151. mdname(mddev));
  3152. mddev->recovery_cp = mddev->curr_resync;
  3153. } else
  3154. mddev->recovery_cp = MaxSector;
  3155. }
  3156. skip:
  3157. mddev->curr_resync = 0;
  3158. wake_up(&resync_wait);
  3159. set_bit(MD_RECOVERY_DONE, &mddev->recovery);
  3160. md_wakeup_thread(mddev->thread);
  3161. }
  3162. /*
  3163. * This routine is regularly called by all per-raid-array threads to
  3164. * deal with generic issues like resync and super-block update.
  3165. * Raid personalities that don't have a thread (linear/raid0) do not
  3166. * need this as they never do any recovery or update the superblock.
  3167. *
  3168. * It does not do any resync itself, but rather "forks" off other threads
  3169. * to do that as needed.
  3170. * When it is determined that resync is needed, we set MD_RECOVERY_RUNNING in
  3171. * "->recovery" and create a thread at ->sync_thread.
  3172. * When the thread finishes it sets MD_RECOVERY_DONE (and might set MD_RECOVERY_ERR)
  3173. * and wakeups up this thread which will reap the thread and finish up.
  3174. * This thread also removes any faulty devices (with nr_pending == 0).
  3175. *
  3176. * The overall approach is:
  3177. * 1/ if the superblock needs updating, update it.
  3178. * 2/ If a recovery thread is running, don't do anything else.
  3179. * 3/ If recovery has finished, clean up, possibly marking spares active.
  3180. * 4/ If there are any faulty devices, remove them.
  3181. * 5/ If array is degraded, try to add spares devices
  3182. * 6/ If array has spares or is not in-sync, start a resync thread.
  3183. */
  3184. void md_check_recovery(mddev_t *mddev)
  3185. {
  3186. mdk_rdev_t *rdev;
  3187. struct list_head *rtmp;
  3188. if (mddev->bitmap)
  3189. bitmap_daemon_work(mddev->bitmap);
  3190. if (mddev->ro)
  3191. return;
  3192. if (signal_pending(current)) {
  3193. if (mddev->pers->sync_request) {
  3194. printk(KERN_INFO "md: %s in immediate safe mode\n",
  3195. mdname(mddev));
  3196. mddev->safemode = 2;
  3197. }
  3198. flush_signals(current);
  3199. }
  3200. if ( ! (
  3201. mddev->sb_dirty ||
  3202. test_bit(MD_RECOVERY_NEEDED, &mddev->recovery) ||
  3203. test_bit(MD_RECOVERY_DONE, &mddev->recovery) ||
  3204. (mddev->safemode == 1) ||
  3205. (mddev->safemode == 2 && ! atomic_read(&mddev->writes_pending)
  3206. && !mddev->in_sync && mddev->recovery_cp == MaxSector)
  3207. ))
  3208. return;
  3209. if (mddev_trylock(mddev)==0) {
  3210. int spares =0;
  3211. spin_lock(&mddev->write_lock);
  3212. if (mddev->safemode && !atomic_read(&mddev->writes_pending) &&
  3213. !mddev->in_sync && mddev->recovery_cp == MaxSector) {
  3214. mddev->in_sync = 1;
  3215. mddev->sb_dirty = 1;
  3216. }
  3217. if (mddev->safemode == 1)
  3218. mddev->safemode = 0;
  3219. spin_unlock(&mddev->write_lock);
  3220. if (mddev->sb_dirty)
  3221. md_update_sb(mddev);
  3222. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) &&
  3223. !test_bit(MD_RECOVERY_DONE, &mddev->recovery)) {
  3224. /* resync/recovery still happening */
  3225. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3226. goto unlock;
  3227. }
  3228. if (mddev->sync_thread) {
  3229. /* resync has finished, collect result */
  3230. md_unregister_thread(mddev->sync_thread);
  3231. mddev->sync_thread = NULL;
  3232. if (!test_bit(MD_RECOVERY_ERR, &mddev->recovery) &&
  3233. !test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
  3234. /* success...*/
  3235. /* activate any spares */
  3236. mddev->pers->spare_active(mddev);
  3237. }
  3238. md_update_sb(mddev);
  3239. /* if array is no-longer degraded, then any saved_raid_disk
  3240. * information must be scrapped
  3241. */
  3242. if (!mddev->degraded)
  3243. ITERATE_RDEV(mddev,rdev,rtmp)
  3244. rdev->saved_raid_disk = -1;
  3245. mddev->recovery = 0;
  3246. /* flag recovery needed just to double check */
  3247. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3248. goto unlock;
  3249. }
  3250. if (mddev->recovery)
  3251. /* probably just the RECOVERY_NEEDED flag */
  3252. mddev->recovery = 0;
  3253. /* no recovery is running.
  3254. * remove any failed drives, then
  3255. * add spares if possible.
  3256. * Spare are also removed and re-added, to allow
  3257. * the personality to fail the re-add.
  3258. */
  3259. ITERATE_RDEV(mddev,rdev,rtmp)
  3260. if (rdev->raid_disk >= 0 &&
  3261. (rdev->faulty || ! rdev->in_sync) &&
  3262. atomic_read(&rdev->nr_pending)==0) {
  3263. if (mddev->pers->hot_remove_disk(mddev, rdev->raid_disk)==0)
  3264. rdev->raid_disk = -1;
  3265. }
  3266. if (mddev->degraded) {
  3267. ITERATE_RDEV(mddev,rdev,rtmp)
  3268. if (rdev->raid_disk < 0
  3269. && !rdev->faulty) {
  3270. if (mddev->pers->hot_add_disk(mddev,rdev))
  3271. spares++;
  3272. else
  3273. break;
  3274. }
  3275. }
  3276. if (!spares && (mddev->recovery_cp == MaxSector )) {
  3277. /* nothing we can do ... */
  3278. goto unlock;
  3279. }
  3280. if (mddev->pers->sync_request) {
  3281. set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  3282. if (!spares)
  3283. set_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  3284. if (spares && mddev->bitmap && ! mddev->bitmap->file) {
  3285. /* We are adding a device or devices to an array
  3286. * which has the bitmap stored on all devices.
  3287. * So make sure all bitmap pages get written
  3288. */
  3289. bitmap_write_all(mddev->bitmap);
  3290. }
  3291. mddev->sync_thread = md_register_thread(md_do_sync,
  3292. mddev,
  3293. "%s_resync");
  3294. if (!mddev->sync_thread) {
  3295. printk(KERN_ERR "%s: could not start resync"
  3296. " thread...\n",
  3297. mdname(mddev));
  3298. /* leave the spares where they are, it shouldn't hurt */
  3299. mddev->recovery = 0;
  3300. } else {
  3301. md_wakeup_thread(mddev->sync_thread);
  3302. }
  3303. }
  3304. unlock:
  3305. mddev_unlock(mddev);
  3306. }
  3307. }
  3308. static int md_notify_reboot(struct notifier_block *this,
  3309. unsigned long code, void *x)
  3310. {
  3311. struct list_head *tmp;
  3312. mddev_t *mddev;
  3313. if ((code == SYS_DOWN) || (code == SYS_HALT) || (code == SYS_POWER_OFF)) {
  3314. printk(KERN_INFO "md: stopping all md devices.\n");
  3315. ITERATE_MDDEV(mddev,tmp)
  3316. if (mddev_trylock(mddev)==0)
  3317. do_md_stop (mddev, 1);
  3318. /*
  3319. * certain more exotic SCSI devices are known to be
  3320. * volatile wrt too early system reboots. While the
  3321. * right place to handle this issue is the given
  3322. * driver, we do want to have a safe RAID driver ...
  3323. */
  3324. mdelay(1000*1);
  3325. }
  3326. return NOTIFY_DONE;
  3327. }
  3328. static struct notifier_block md_notifier = {
  3329. .notifier_call = md_notify_reboot,
  3330. .next = NULL,
  3331. .priority = INT_MAX, /* before any real devices */
  3332. };
  3333. static void md_geninit(void)
  3334. {
  3335. struct proc_dir_entry *p;
  3336. dprintk("md: sizeof(mdp_super_t) = %d\n", (int)sizeof(mdp_super_t));
  3337. p = create_proc_entry("mdstat", S_IRUGO, NULL);
  3338. if (p)
  3339. p->proc_fops = &md_seq_fops;
  3340. }
  3341. static int __init md_init(void)
  3342. {
  3343. int minor;
  3344. printk(KERN_INFO "md: md driver %d.%d.%d MAX_MD_DEVS=%d,"
  3345. " MD_SB_DISKS=%d\n",
  3346. MD_MAJOR_VERSION, MD_MINOR_VERSION,
  3347. MD_PATCHLEVEL_VERSION, MAX_MD_DEVS, MD_SB_DISKS);
  3348. printk(KERN_INFO "md: bitmap version %d.%d\n", BITMAP_MAJOR,
  3349. BITMAP_MINOR);
  3350. if (register_blkdev(MAJOR_NR, "md"))
  3351. return -1;
  3352. if ((mdp_major=register_blkdev(0, "mdp"))<=0) {
  3353. unregister_blkdev(MAJOR_NR, "md");
  3354. return -1;
  3355. }
  3356. devfs_mk_dir("md");
  3357. blk_register_region(MKDEV(MAJOR_NR, 0), MAX_MD_DEVS, THIS_MODULE,
  3358. md_probe, NULL, NULL);
  3359. blk_register_region(MKDEV(mdp_major, 0), MAX_MD_DEVS<<MdpMinorShift, THIS_MODULE,
  3360. md_probe, NULL, NULL);
  3361. for (minor=0; minor < MAX_MD_DEVS; ++minor)
  3362. devfs_mk_bdev(MKDEV(MAJOR_NR, minor),
  3363. S_IFBLK|S_IRUSR|S_IWUSR,
  3364. "md/%d", minor);
  3365. for (minor=0; minor < MAX_MD_DEVS; ++minor)
  3366. devfs_mk_bdev(MKDEV(mdp_major, minor<<MdpMinorShift),
  3367. S_IFBLK|S_IRUSR|S_IWUSR,
  3368. "md/mdp%d", minor);
  3369. register_reboot_notifier(&md_notifier);
  3370. raid_table_header = register_sysctl_table(raid_root_table, 1);
  3371. md_geninit();
  3372. return (0);
  3373. }
  3374. #ifndef MODULE
  3375. /*
  3376. * Searches all registered partitions for autorun RAID arrays
  3377. * at boot time.
  3378. */
  3379. static dev_t detected_devices[128];
  3380. static int dev_cnt;
  3381. void md_autodetect_dev(dev_t dev)
  3382. {
  3383. if (dev_cnt >= 0 && dev_cnt < 127)
  3384. detected_devices[dev_cnt++] = dev;
  3385. }
  3386. static void autostart_arrays(int part)
  3387. {
  3388. mdk_rdev_t *rdev;
  3389. int i;
  3390. printk(KERN_INFO "md: Autodetecting RAID arrays.\n");
  3391. for (i = 0; i < dev_cnt; i++) {
  3392. dev_t dev = detected_devices[i];
  3393. rdev = md_import_device(dev,0, 0);
  3394. if (IS_ERR(rdev))
  3395. continue;
  3396. if (rdev->faulty) {
  3397. MD_BUG();
  3398. continue;
  3399. }
  3400. list_add(&rdev->same_set, &pending_raid_disks);
  3401. }
  3402. dev_cnt = 0;
  3403. autorun_devices(part);
  3404. }
  3405. #endif
  3406. static __exit void md_exit(void)
  3407. {
  3408. mddev_t *mddev;
  3409. struct list_head *tmp;
  3410. int i;
  3411. blk_unregister_region(MKDEV(MAJOR_NR,0), MAX_MD_DEVS);
  3412. blk_unregister_region(MKDEV(mdp_major,0), MAX_MD_DEVS << MdpMinorShift);
  3413. for (i=0; i < MAX_MD_DEVS; i++)
  3414. devfs_remove("md/%d", i);
  3415. for (i=0; i < MAX_MD_DEVS; i++)
  3416. devfs_remove("md/d%d", i);
  3417. devfs_remove("md");
  3418. unregister_blkdev(MAJOR_NR,"md");
  3419. unregister_blkdev(mdp_major, "mdp");
  3420. unregister_reboot_notifier(&md_notifier);
  3421. unregister_sysctl_table(raid_table_header);
  3422. remove_proc_entry("mdstat", NULL);
  3423. ITERATE_MDDEV(mddev,tmp) {
  3424. struct gendisk *disk = mddev->gendisk;
  3425. if (!disk)
  3426. continue;
  3427. export_array(mddev);
  3428. del_gendisk(disk);
  3429. put_disk(disk);
  3430. mddev->gendisk = NULL;
  3431. mddev_put(mddev);
  3432. }
  3433. }
  3434. module_init(md_init)
  3435. module_exit(md_exit)
  3436. EXPORT_SYMBOL(register_md_personality);
  3437. EXPORT_SYMBOL(unregister_md_personality);
  3438. EXPORT_SYMBOL(md_error);
  3439. EXPORT_SYMBOL(md_done_sync);
  3440. EXPORT_SYMBOL(md_write_start);
  3441. EXPORT_SYMBOL(md_write_end);
  3442. EXPORT_SYMBOL(md_register_thread);
  3443. EXPORT_SYMBOL(md_unregister_thread);
  3444. EXPORT_SYMBOL(md_wakeup_thread);
  3445. EXPORT_SYMBOL(md_print_devices);
  3446. EXPORT_SYMBOL(md_check_recovery);
  3447. MODULE_LICENSE("GPL");
  3448. MODULE_ALIAS("md");
  3449. MODULE_ALIAS_BLOCKDEV_MAJOR(MD_MAJOR);