md.c 152 KB

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