md.c 95 KB

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