md.c 139 KB

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