md.c 116 KB

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