md.c 98 KB

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