md.c 211 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265
  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/kthread.h>
  27. #include <linux/blkdev.h>
  28. #include <linux/sysctl.h>
  29. #include <linux/seq_file.h>
  30. #include <linux/mutex.h>
  31. #include <linux/buffer_head.h> /* for invalidate_bdev */
  32. #include <linux/poll.h>
  33. #include <linux/ctype.h>
  34. #include <linux/string.h>
  35. #include <linux/hdreg.h>
  36. #include <linux/proc_fs.h>
  37. #include <linux/random.h>
  38. #include <linux/reboot.h>
  39. #include <linux/file.h>
  40. #include <linux/compat.h>
  41. #include <linux/delay.h>
  42. #include <linux/raid/md_p.h>
  43. #include <linux/raid/md_u.h>
  44. #include <linux/slab.h>
  45. #include "md.h"
  46. #include "bitmap.h"
  47. #define DEBUG 0
  48. #define dprintk(x...) ((void)(DEBUG && printk(x)))
  49. #ifndef MODULE
  50. static void autostart_arrays(int part);
  51. #endif
  52. static LIST_HEAD(pers_list);
  53. static DEFINE_SPINLOCK(pers_lock);
  54. static void md_print_devices(void);
  55. static DECLARE_WAIT_QUEUE_HEAD(resync_wait);
  56. static struct workqueue_struct *md_wq;
  57. static struct workqueue_struct *md_misc_wq;
  58. #define MD_BUG(x...) { printk("md: bug in file %s, line %d\n", __FILE__, __LINE__); md_print_devices(); }
  59. /*
  60. * Default number of read corrections we'll attempt on an rdev
  61. * before ejecting it from the array. We divide the read error
  62. * count by 2 for every hour elapsed between read errors.
  63. */
  64. #define MD_DEFAULT_MAX_CORRECTED_READ_ERRORS 20
  65. /*
  66. * Current RAID-1,4,5 parallel reconstruction 'guaranteed speed limit'
  67. * is 1000 KB/sec, so the extra system load does not show up that much.
  68. * Increase it if you want to have more _guaranteed_ speed. Note that
  69. * the RAID driver will use the maximum available bandwidth if the IO
  70. * subsystem is idle. There is also an 'absolute maximum' reconstruction
  71. * speed limit - in case reconstruction slows down your system despite
  72. * idle IO detection.
  73. *
  74. * you can change it via /proc/sys/dev/raid/speed_limit_min and _max.
  75. * or /sys/block/mdX/md/sync_speed_{min,max}
  76. */
  77. static int sysctl_speed_limit_min = 1000;
  78. static int sysctl_speed_limit_max = 200000;
  79. static inline int speed_min(mddev_t *mddev)
  80. {
  81. return mddev->sync_speed_min ?
  82. mddev->sync_speed_min : sysctl_speed_limit_min;
  83. }
  84. static inline int speed_max(mddev_t *mddev)
  85. {
  86. return mddev->sync_speed_max ?
  87. mddev->sync_speed_max : sysctl_speed_limit_max;
  88. }
  89. static struct ctl_table_header *raid_table_header;
  90. static ctl_table raid_table[] = {
  91. {
  92. .procname = "speed_limit_min",
  93. .data = &sysctl_speed_limit_min,
  94. .maxlen = sizeof(int),
  95. .mode = S_IRUGO|S_IWUSR,
  96. .proc_handler = proc_dointvec,
  97. },
  98. {
  99. .procname = "speed_limit_max",
  100. .data = &sysctl_speed_limit_max,
  101. .maxlen = sizeof(int),
  102. .mode = S_IRUGO|S_IWUSR,
  103. .proc_handler = proc_dointvec,
  104. },
  105. { }
  106. };
  107. static ctl_table raid_dir_table[] = {
  108. {
  109. .procname = "raid",
  110. .maxlen = 0,
  111. .mode = S_IRUGO|S_IXUGO,
  112. .child = raid_table,
  113. },
  114. { }
  115. };
  116. static ctl_table raid_root_table[] = {
  117. {
  118. .procname = "dev",
  119. .maxlen = 0,
  120. .mode = 0555,
  121. .child = raid_dir_table,
  122. },
  123. { }
  124. };
  125. static const struct block_device_operations md_fops;
  126. static int start_readonly;
  127. /* bio_clone_mddev
  128. * like bio_clone, but with a local bio set
  129. */
  130. static void mddev_bio_destructor(struct bio *bio)
  131. {
  132. mddev_t *mddev, **mddevp;
  133. mddevp = (void*)bio;
  134. mddev = mddevp[-1];
  135. bio_free(bio, mddev->bio_set);
  136. }
  137. struct bio *bio_alloc_mddev(gfp_t gfp_mask, int nr_iovecs,
  138. mddev_t *mddev)
  139. {
  140. struct bio *b;
  141. mddev_t **mddevp;
  142. if (!mddev || !mddev->bio_set)
  143. return bio_alloc(gfp_mask, nr_iovecs);
  144. b = bio_alloc_bioset(gfp_mask, nr_iovecs,
  145. mddev->bio_set);
  146. if (!b)
  147. return NULL;
  148. mddevp = (void*)b;
  149. mddevp[-1] = mddev;
  150. b->bi_destructor = mddev_bio_destructor;
  151. return b;
  152. }
  153. EXPORT_SYMBOL_GPL(bio_alloc_mddev);
  154. struct bio *bio_clone_mddev(struct bio *bio, gfp_t gfp_mask,
  155. mddev_t *mddev)
  156. {
  157. struct bio *b;
  158. mddev_t **mddevp;
  159. if (!mddev || !mddev->bio_set)
  160. return bio_clone(bio, gfp_mask);
  161. b = bio_alloc_bioset(gfp_mask, bio->bi_max_vecs,
  162. mddev->bio_set);
  163. if (!b)
  164. return NULL;
  165. mddevp = (void*)b;
  166. mddevp[-1] = mddev;
  167. b->bi_destructor = mddev_bio_destructor;
  168. __bio_clone(b, bio);
  169. if (bio_integrity(bio)) {
  170. int ret;
  171. ret = bio_integrity_clone(b, bio, gfp_mask, mddev->bio_set);
  172. if (ret < 0) {
  173. bio_put(b);
  174. return NULL;
  175. }
  176. }
  177. return b;
  178. }
  179. EXPORT_SYMBOL_GPL(bio_clone_mddev);
  180. void md_trim_bio(struct bio *bio, int offset, int size)
  181. {
  182. /* 'bio' is a cloned bio which we need to trim to match
  183. * the given offset and size.
  184. * This requires adjusting bi_sector, bi_size, and bi_io_vec
  185. */
  186. int i;
  187. struct bio_vec *bvec;
  188. int sofar = 0;
  189. size <<= 9;
  190. if (offset == 0 && size == bio->bi_size)
  191. return;
  192. bio->bi_sector += offset;
  193. bio->bi_size = size;
  194. offset <<= 9;
  195. clear_bit(BIO_SEG_VALID, &bio->bi_flags);
  196. while (bio->bi_idx < bio->bi_vcnt &&
  197. bio->bi_io_vec[bio->bi_idx].bv_len <= offset) {
  198. /* remove this whole bio_vec */
  199. offset -= bio->bi_io_vec[bio->bi_idx].bv_len;
  200. bio->bi_idx++;
  201. }
  202. if (bio->bi_idx < bio->bi_vcnt) {
  203. bio->bi_io_vec[bio->bi_idx].bv_offset += offset;
  204. bio->bi_io_vec[bio->bi_idx].bv_len -= offset;
  205. }
  206. /* avoid any complications with bi_idx being non-zero*/
  207. if (bio->bi_idx) {
  208. memmove(bio->bi_io_vec, bio->bi_io_vec+bio->bi_idx,
  209. (bio->bi_vcnt - bio->bi_idx) * sizeof(struct bio_vec));
  210. bio->bi_vcnt -= bio->bi_idx;
  211. bio->bi_idx = 0;
  212. }
  213. /* Make sure vcnt and last bv are not too big */
  214. bio_for_each_segment(bvec, bio, i) {
  215. if (sofar + bvec->bv_len > size)
  216. bvec->bv_len = size - sofar;
  217. if (bvec->bv_len == 0) {
  218. bio->bi_vcnt = i;
  219. break;
  220. }
  221. sofar += bvec->bv_len;
  222. }
  223. }
  224. EXPORT_SYMBOL_GPL(md_trim_bio);
  225. /*
  226. * We have a system wide 'event count' that is incremented
  227. * on any 'interesting' event, and readers of /proc/mdstat
  228. * can use 'poll' or 'select' to find out when the event
  229. * count increases.
  230. *
  231. * Events are:
  232. * start array, stop array, error, add device, remove device,
  233. * start build, activate spare
  234. */
  235. static DECLARE_WAIT_QUEUE_HEAD(md_event_waiters);
  236. static atomic_t md_event_count;
  237. void md_new_event(mddev_t *mddev)
  238. {
  239. atomic_inc(&md_event_count);
  240. wake_up(&md_event_waiters);
  241. }
  242. EXPORT_SYMBOL_GPL(md_new_event);
  243. /* Alternate version that can be called from interrupts
  244. * when calling sysfs_notify isn't needed.
  245. */
  246. static void md_new_event_inintr(mddev_t *mddev)
  247. {
  248. atomic_inc(&md_event_count);
  249. wake_up(&md_event_waiters);
  250. }
  251. /*
  252. * Enables to iterate over all existing md arrays
  253. * all_mddevs_lock protects this list.
  254. */
  255. static LIST_HEAD(all_mddevs);
  256. static DEFINE_SPINLOCK(all_mddevs_lock);
  257. /*
  258. * iterates through all used mddevs in the system.
  259. * We take care to grab the all_mddevs_lock whenever navigating
  260. * the list, and to always hold a refcount when unlocked.
  261. * Any code which breaks out of this loop while own
  262. * a reference to the current mddev and must mddev_put it.
  263. */
  264. #define for_each_mddev(mddev,tmp) \
  265. \
  266. for (({ spin_lock(&all_mddevs_lock); \
  267. tmp = all_mddevs.next; \
  268. mddev = NULL;}); \
  269. ({ if (tmp != &all_mddevs) \
  270. mddev_get(list_entry(tmp, mddev_t, all_mddevs));\
  271. spin_unlock(&all_mddevs_lock); \
  272. if (mddev) mddev_put(mddev); \
  273. mddev = list_entry(tmp, mddev_t, all_mddevs); \
  274. tmp != &all_mddevs;}); \
  275. ({ spin_lock(&all_mddevs_lock); \
  276. tmp = tmp->next;}) \
  277. )
  278. /* Rather than calling directly into the personality make_request function,
  279. * IO requests come here first so that we can check if the device is
  280. * being suspended pending a reconfiguration.
  281. * We hold a refcount over the call to ->make_request. By the time that
  282. * call has finished, the bio has been linked into some internal structure
  283. * and so is visible to ->quiesce(), so we don't need the refcount any more.
  284. */
  285. static int md_make_request(struct request_queue *q, struct bio *bio)
  286. {
  287. const int rw = bio_data_dir(bio);
  288. mddev_t *mddev = q->queuedata;
  289. int rv;
  290. int cpu;
  291. unsigned int sectors;
  292. if (mddev == NULL || mddev->pers == NULL
  293. || !mddev->ready) {
  294. bio_io_error(bio);
  295. return 0;
  296. }
  297. smp_rmb(); /* Ensure implications of 'active' are visible */
  298. rcu_read_lock();
  299. if (mddev->suspended) {
  300. DEFINE_WAIT(__wait);
  301. for (;;) {
  302. prepare_to_wait(&mddev->sb_wait, &__wait,
  303. TASK_UNINTERRUPTIBLE);
  304. if (!mddev->suspended)
  305. break;
  306. rcu_read_unlock();
  307. schedule();
  308. rcu_read_lock();
  309. }
  310. finish_wait(&mddev->sb_wait, &__wait);
  311. }
  312. atomic_inc(&mddev->active_io);
  313. rcu_read_unlock();
  314. /*
  315. * save the sectors now since our bio can
  316. * go away inside make_request
  317. */
  318. sectors = bio_sectors(bio);
  319. rv = mddev->pers->make_request(mddev, bio);
  320. cpu = part_stat_lock();
  321. part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
  322. part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw], sectors);
  323. part_stat_unlock();
  324. if (atomic_dec_and_test(&mddev->active_io) && mddev->suspended)
  325. wake_up(&mddev->sb_wait);
  326. return rv;
  327. }
  328. /* mddev_suspend makes sure no new requests are submitted
  329. * to the device, and that any requests that have been submitted
  330. * are completely handled.
  331. * Once ->stop is called and completes, the module will be completely
  332. * unused.
  333. */
  334. void mddev_suspend(mddev_t *mddev)
  335. {
  336. BUG_ON(mddev->suspended);
  337. mddev->suspended = 1;
  338. synchronize_rcu();
  339. wait_event(mddev->sb_wait, atomic_read(&mddev->active_io) == 0);
  340. mddev->pers->quiesce(mddev, 1);
  341. }
  342. EXPORT_SYMBOL_GPL(mddev_suspend);
  343. void mddev_resume(mddev_t *mddev)
  344. {
  345. mddev->suspended = 0;
  346. wake_up(&mddev->sb_wait);
  347. mddev->pers->quiesce(mddev, 0);
  348. md_wakeup_thread(mddev->thread);
  349. md_wakeup_thread(mddev->sync_thread); /* possibly kick off a reshape */
  350. }
  351. EXPORT_SYMBOL_GPL(mddev_resume);
  352. int mddev_congested(mddev_t *mddev, int bits)
  353. {
  354. return mddev->suspended;
  355. }
  356. EXPORT_SYMBOL(mddev_congested);
  357. /*
  358. * Generic flush handling for md
  359. */
  360. static void md_end_flush(struct bio *bio, int err)
  361. {
  362. mdk_rdev_t *rdev = bio->bi_private;
  363. mddev_t *mddev = rdev->mddev;
  364. rdev_dec_pending(rdev, mddev);
  365. if (atomic_dec_and_test(&mddev->flush_pending)) {
  366. /* The pre-request flush has finished */
  367. queue_work(md_wq, &mddev->flush_work);
  368. }
  369. bio_put(bio);
  370. }
  371. static void md_submit_flush_data(struct work_struct *ws);
  372. static void submit_flushes(struct work_struct *ws)
  373. {
  374. mddev_t *mddev = container_of(ws, mddev_t, flush_work);
  375. mdk_rdev_t *rdev;
  376. INIT_WORK(&mddev->flush_work, md_submit_flush_data);
  377. atomic_set(&mddev->flush_pending, 1);
  378. rcu_read_lock();
  379. list_for_each_entry_rcu(rdev, &mddev->disks, same_set)
  380. if (rdev->raid_disk >= 0 &&
  381. !test_bit(Faulty, &rdev->flags)) {
  382. /* Take two references, one is dropped
  383. * when request finishes, one after
  384. * we reclaim rcu_read_lock
  385. */
  386. struct bio *bi;
  387. atomic_inc(&rdev->nr_pending);
  388. atomic_inc(&rdev->nr_pending);
  389. rcu_read_unlock();
  390. bi = bio_alloc_mddev(GFP_KERNEL, 0, mddev);
  391. bi->bi_end_io = md_end_flush;
  392. bi->bi_private = rdev;
  393. bi->bi_bdev = rdev->bdev;
  394. atomic_inc(&mddev->flush_pending);
  395. submit_bio(WRITE_FLUSH, bi);
  396. rcu_read_lock();
  397. rdev_dec_pending(rdev, mddev);
  398. }
  399. rcu_read_unlock();
  400. if (atomic_dec_and_test(&mddev->flush_pending))
  401. queue_work(md_wq, &mddev->flush_work);
  402. }
  403. static void md_submit_flush_data(struct work_struct *ws)
  404. {
  405. mddev_t *mddev = container_of(ws, mddev_t, flush_work);
  406. struct bio *bio = mddev->flush_bio;
  407. if (bio->bi_size == 0)
  408. /* an empty barrier - all done */
  409. bio_endio(bio, 0);
  410. else {
  411. bio->bi_rw &= ~REQ_FLUSH;
  412. if (mddev->pers->make_request(mddev, bio))
  413. generic_make_request(bio);
  414. }
  415. mddev->flush_bio = NULL;
  416. wake_up(&mddev->sb_wait);
  417. }
  418. void md_flush_request(mddev_t *mddev, struct bio *bio)
  419. {
  420. spin_lock_irq(&mddev->write_lock);
  421. wait_event_lock_irq(mddev->sb_wait,
  422. !mddev->flush_bio,
  423. mddev->write_lock, /*nothing*/);
  424. mddev->flush_bio = bio;
  425. spin_unlock_irq(&mddev->write_lock);
  426. INIT_WORK(&mddev->flush_work, submit_flushes);
  427. queue_work(md_wq, &mddev->flush_work);
  428. }
  429. EXPORT_SYMBOL(md_flush_request);
  430. /* Support for plugging.
  431. * This mirrors the plugging support in request_queue, but does not
  432. * require having a whole queue or request structures.
  433. * We allocate an md_plug_cb for each md device and each thread it gets
  434. * plugged on. This links tot the private plug_handle structure in the
  435. * personality data where we keep a count of the number of outstanding
  436. * plugs so other code can see if a plug is active.
  437. */
  438. struct md_plug_cb {
  439. struct blk_plug_cb cb;
  440. mddev_t *mddev;
  441. };
  442. static void plugger_unplug(struct blk_plug_cb *cb)
  443. {
  444. struct md_plug_cb *mdcb = container_of(cb, struct md_plug_cb, cb);
  445. if (atomic_dec_and_test(&mdcb->mddev->plug_cnt))
  446. md_wakeup_thread(mdcb->mddev->thread);
  447. kfree(mdcb);
  448. }
  449. /* Check that an unplug wakeup will come shortly.
  450. * If not, wakeup the md thread immediately
  451. */
  452. int mddev_check_plugged(mddev_t *mddev)
  453. {
  454. struct blk_plug *plug = current->plug;
  455. struct md_plug_cb *mdcb;
  456. if (!plug)
  457. return 0;
  458. list_for_each_entry(mdcb, &plug->cb_list, cb.list) {
  459. if (mdcb->cb.callback == plugger_unplug &&
  460. mdcb->mddev == mddev) {
  461. /* Already on the list, move to top */
  462. if (mdcb != list_first_entry(&plug->cb_list,
  463. struct md_plug_cb,
  464. cb.list))
  465. list_move(&mdcb->cb.list, &plug->cb_list);
  466. return 1;
  467. }
  468. }
  469. /* Not currently on the callback list */
  470. mdcb = kmalloc(sizeof(*mdcb), GFP_ATOMIC);
  471. if (!mdcb)
  472. return 0;
  473. mdcb->mddev = mddev;
  474. mdcb->cb.callback = plugger_unplug;
  475. atomic_inc(&mddev->plug_cnt);
  476. list_add(&mdcb->cb.list, &plug->cb_list);
  477. return 1;
  478. }
  479. EXPORT_SYMBOL_GPL(mddev_check_plugged);
  480. static inline mddev_t *mddev_get(mddev_t *mddev)
  481. {
  482. atomic_inc(&mddev->active);
  483. return mddev;
  484. }
  485. static void mddev_delayed_delete(struct work_struct *ws);
  486. static void mddev_put(mddev_t *mddev)
  487. {
  488. struct bio_set *bs = NULL;
  489. if (!atomic_dec_and_lock(&mddev->active, &all_mddevs_lock))
  490. return;
  491. if (!mddev->raid_disks && list_empty(&mddev->disks) &&
  492. mddev->ctime == 0 && !mddev->hold_active) {
  493. /* Array is not configured at all, and not held active,
  494. * so destroy it */
  495. list_del(&mddev->all_mddevs);
  496. bs = mddev->bio_set;
  497. mddev->bio_set = NULL;
  498. if (mddev->gendisk) {
  499. /* We did a probe so need to clean up. Call
  500. * queue_work inside the spinlock so that
  501. * flush_workqueue() after mddev_find will
  502. * succeed in waiting for the work to be done.
  503. */
  504. INIT_WORK(&mddev->del_work, mddev_delayed_delete);
  505. queue_work(md_misc_wq, &mddev->del_work);
  506. } else
  507. kfree(mddev);
  508. }
  509. spin_unlock(&all_mddevs_lock);
  510. if (bs)
  511. bioset_free(bs);
  512. }
  513. void mddev_init(mddev_t *mddev)
  514. {
  515. mutex_init(&mddev->open_mutex);
  516. mutex_init(&mddev->reconfig_mutex);
  517. mutex_init(&mddev->bitmap_info.mutex);
  518. INIT_LIST_HEAD(&mddev->disks);
  519. INIT_LIST_HEAD(&mddev->all_mddevs);
  520. init_timer(&mddev->safemode_timer);
  521. atomic_set(&mddev->active, 1);
  522. atomic_set(&mddev->openers, 0);
  523. atomic_set(&mddev->active_io, 0);
  524. atomic_set(&mddev->plug_cnt, 0);
  525. spin_lock_init(&mddev->write_lock);
  526. atomic_set(&mddev->flush_pending, 0);
  527. init_waitqueue_head(&mddev->sb_wait);
  528. init_waitqueue_head(&mddev->recovery_wait);
  529. mddev->reshape_position = MaxSector;
  530. mddev->resync_min = 0;
  531. mddev->resync_max = MaxSector;
  532. mddev->level = LEVEL_NONE;
  533. }
  534. EXPORT_SYMBOL_GPL(mddev_init);
  535. static mddev_t * mddev_find(dev_t unit)
  536. {
  537. mddev_t *mddev, *new = NULL;
  538. if (unit && MAJOR(unit) != MD_MAJOR)
  539. unit &= ~((1<<MdpMinorShift)-1);
  540. retry:
  541. spin_lock(&all_mddevs_lock);
  542. if (unit) {
  543. list_for_each_entry(mddev, &all_mddevs, all_mddevs)
  544. if (mddev->unit == unit) {
  545. mddev_get(mddev);
  546. spin_unlock(&all_mddevs_lock);
  547. kfree(new);
  548. return mddev;
  549. }
  550. if (new) {
  551. list_add(&new->all_mddevs, &all_mddevs);
  552. spin_unlock(&all_mddevs_lock);
  553. new->hold_active = UNTIL_IOCTL;
  554. return new;
  555. }
  556. } else if (new) {
  557. /* find an unused unit number */
  558. static int next_minor = 512;
  559. int start = next_minor;
  560. int is_free = 0;
  561. int dev = 0;
  562. while (!is_free) {
  563. dev = MKDEV(MD_MAJOR, next_minor);
  564. next_minor++;
  565. if (next_minor > MINORMASK)
  566. next_minor = 0;
  567. if (next_minor == start) {
  568. /* Oh dear, all in use. */
  569. spin_unlock(&all_mddevs_lock);
  570. kfree(new);
  571. return NULL;
  572. }
  573. is_free = 1;
  574. list_for_each_entry(mddev, &all_mddevs, all_mddevs)
  575. if (mddev->unit == dev) {
  576. is_free = 0;
  577. break;
  578. }
  579. }
  580. new->unit = dev;
  581. new->md_minor = MINOR(dev);
  582. new->hold_active = UNTIL_STOP;
  583. list_add(&new->all_mddevs, &all_mddevs);
  584. spin_unlock(&all_mddevs_lock);
  585. return new;
  586. }
  587. spin_unlock(&all_mddevs_lock);
  588. new = kzalloc(sizeof(*new), GFP_KERNEL);
  589. if (!new)
  590. return NULL;
  591. new->unit = unit;
  592. if (MAJOR(unit) == MD_MAJOR)
  593. new->md_minor = MINOR(unit);
  594. else
  595. new->md_minor = MINOR(unit) >> MdpMinorShift;
  596. mddev_init(new);
  597. goto retry;
  598. }
  599. static inline int mddev_lock(mddev_t * mddev)
  600. {
  601. return mutex_lock_interruptible(&mddev->reconfig_mutex);
  602. }
  603. static inline int mddev_is_locked(mddev_t *mddev)
  604. {
  605. return mutex_is_locked(&mddev->reconfig_mutex);
  606. }
  607. static inline int mddev_trylock(mddev_t * mddev)
  608. {
  609. return mutex_trylock(&mddev->reconfig_mutex);
  610. }
  611. static struct attribute_group md_redundancy_group;
  612. static void mddev_unlock(mddev_t * mddev)
  613. {
  614. if (mddev->to_remove) {
  615. /* These cannot be removed under reconfig_mutex as
  616. * an access to the files will try to take reconfig_mutex
  617. * while holding the file unremovable, which leads to
  618. * a deadlock.
  619. * So hold set sysfs_active while the remove in happeing,
  620. * and anything else which might set ->to_remove or my
  621. * otherwise change the sysfs namespace will fail with
  622. * -EBUSY if sysfs_active is still set.
  623. * We set sysfs_active under reconfig_mutex and elsewhere
  624. * test it under the same mutex to ensure its correct value
  625. * is seen.
  626. */
  627. struct attribute_group *to_remove = mddev->to_remove;
  628. mddev->to_remove = NULL;
  629. mddev->sysfs_active = 1;
  630. mutex_unlock(&mddev->reconfig_mutex);
  631. if (mddev->kobj.sd) {
  632. if (to_remove != &md_redundancy_group)
  633. sysfs_remove_group(&mddev->kobj, to_remove);
  634. if (mddev->pers == NULL ||
  635. mddev->pers->sync_request == NULL) {
  636. sysfs_remove_group(&mddev->kobj, &md_redundancy_group);
  637. if (mddev->sysfs_action)
  638. sysfs_put(mddev->sysfs_action);
  639. mddev->sysfs_action = NULL;
  640. }
  641. }
  642. mddev->sysfs_active = 0;
  643. } else
  644. mutex_unlock(&mddev->reconfig_mutex);
  645. md_wakeup_thread(mddev->thread);
  646. }
  647. static mdk_rdev_t * find_rdev_nr(mddev_t *mddev, int nr)
  648. {
  649. mdk_rdev_t *rdev;
  650. list_for_each_entry(rdev, &mddev->disks, same_set)
  651. if (rdev->desc_nr == nr)
  652. return rdev;
  653. return NULL;
  654. }
  655. static mdk_rdev_t * find_rdev(mddev_t * mddev, dev_t dev)
  656. {
  657. mdk_rdev_t *rdev;
  658. list_for_each_entry(rdev, &mddev->disks, same_set)
  659. if (rdev->bdev->bd_dev == dev)
  660. return rdev;
  661. return NULL;
  662. }
  663. static struct mdk_personality *find_pers(int level, char *clevel)
  664. {
  665. struct mdk_personality *pers;
  666. list_for_each_entry(pers, &pers_list, list) {
  667. if (level != LEVEL_NONE && pers->level == level)
  668. return pers;
  669. if (strcmp(pers->name, clevel)==0)
  670. return pers;
  671. }
  672. return NULL;
  673. }
  674. /* return the offset of the super block in 512byte sectors */
  675. static inline sector_t calc_dev_sboffset(mdk_rdev_t *rdev)
  676. {
  677. sector_t num_sectors = i_size_read(rdev->bdev->bd_inode) / 512;
  678. return MD_NEW_SIZE_SECTORS(num_sectors);
  679. }
  680. static int alloc_disk_sb(mdk_rdev_t * rdev)
  681. {
  682. if (rdev->sb_page)
  683. MD_BUG();
  684. rdev->sb_page = alloc_page(GFP_KERNEL);
  685. if (!rdev->sb_page) {
  686. printk(KERN_ALERT "md: out of memory.\n");
  687. return -ENOMEM;
  688. }
  689. return 0;
  690. }
  691. static void free_disk_sb(mdk_rdev_t * rdev)
  692. {
  693. if (rdev->sb_page) {
  694. put_page(rdev->sb_page);
  695. rdev->sb_loaded = 0;
  696. rdev->sb_page = NULL;
  697. rdev->sb_start = 0;
  698. rdev->sectors = 0;
  699. }
  700. if (rdev->bb_page) {
  701. put_page(rdev->bb_page);
  702. rdev->bb_page = NULL;
  703. }
  704. }
  705. static void super_written(struct bio *bio, int error)
  706. {
  707. mdk_rdev_t *rdev = bio->bi_private;
  708. mddev_t *mddev = rdev->mddev;
  709. if (error || !test_bit(BIO_UPTODATE, &bio->bi_flags)) {
  710. printk("md: super_written gets error=%d, uptodate=%d\n",
  711. error, test_bit(BIO_UPTODATE, &bio->bi_flags));
  712. WARN_ON(test_bit(BIO_UPTODATE, &bio->bi_flags));
  713. md_error(mddev, rdev);
  714. }
  715. if (atomic_dec_and_test(&mddev->pending_writes))
  716. wake_up(&mddev->sb_wait);
  717. bio_put(bio);
  718. }
  719. void md_super_write(mddev_t *mddev, mdk_rdev_t *rdev,
  720. sector_t sector, int size, struct page *page)
  721. {
  722. /* write first size bytes of page to sector of rdev
  723. * Increment mddev->pending_writes before returning
  724. * and decrement it on completion, waking up sb_wait
  725. * if zero is reached.
  726. * If an error occurred, call md_error
  727. */
  728. struct bio *bio = bio_alloc_mddev(GFP_NOIO, 1, mddev);
  729. bio->bi_bdev = rdev->meta_bdev ? rdev->meta_bdev : rdev->bdev;
  730. bio->bi_sector = sector;
  731. bio_add_page(bio, page, size, 0);
  732. bio->bi_private = rdev;
  733. bio->bi_end_io = super_written;
  734. atomic_inc(&mddev->pending_writes);
  735. submit_bio(WRITE_FLUSH_FUA, bio);
  736. }
  737. void md_super_wait(mddev_t *mddev)
  738. {
  739. /* wait for all superblock writes that were scheduled to complete */
  740. DEFINE_WAIT(wq);
  741. for(;;) {
  742. prepare_to_wait(&mddev->sb_wait, &wq, TASK_UNINTERRUPTIBLE);
  743. if (atomic_read(&mddev->pending_writes)==0)
  744. break;
  745. schedule();
  746. }
  747. finish_wait(&mddev->sb_wait, &wq);
  748. }
  749. static void bi_complete(struct bio *bio, int error)
  750. {
  751. complete((struct completion*)bio->bi_private);
  752. }
  753. int sync_page_io(mdk_rdev_t *rdev, sector_t sector, int size,
  754. struct page *page, int rw, bool metadata_op)
  755. {
  756. struct bio *bio = bio_alloc_mddev(GFP_NOIO, 1, rdev->mddev);
  757. struct completion event;
  758. int ret;
  759. rw |= REQ_SYNC;
  760. bio->bi_bdev = (metadata_op && rdev->meta_bdev) ?
  761. rdev->meta_bdev : rdev->bdev;
  762. if (metadata_op)
  763. bio->bi_sector = sector + rdev->sb_start;
  764. else
  765. bio->bi_sector = sector + rdev->data_offset;
  766. bio_add_page(bio, page, size, 0);
  767. init_completion(&event);
  768. bio->bi_private = &event;
  769. bio->bi_end_io = bi_complete;
  770. submit_bio(rw, bio);
  771. wait_for_completion(&event);
  772. ret = test_bit(BIO_UPTODATE, &bio->bi_flags);
  773. bio_put(bio);
  774. return ret;
  775. }
  776. EXPORT_SYMBOL_GPL(sync_page_io);
  777. static int read_disk_sb(mdk_rdev_t * rdev, int size)
  778. {
  779. char b[BDEVNAME_SIZE];
  780. if (!rdev->sb_page) {
  781. MD_BUG();
  782. return -EINVAL;
  783. }
  784. if (rdev->sb_loaded)
  785. return 0;
  786. if (!sync_page_io(rdev, 0, size, rdev->sb_page, READ, true))
  787. goto fail;
  788. rdev->sb_loaded = 1;
  789. return 0;
  790. fail:
  791. printk(KERN_WARNING "md: disabled device %s, could not read superblock.\n",
  792. bdevname(rdev->bdev,b));
  793. return -EINVAL;
  794. }
  795. static int uuid_equal(mdp_super_t *sb1, mdp_super_t *sb2)
  796. {
  797. return sb1->set_uuid0 == sb2->set_uuid0 &&
  798. sb1->set_uuid1 == sb2->set_uuid1 &&
  799. sb1->set_uuid2 == sb2->set_uuid2 &&
  800. sb1->set_uuid3 == sb2->set_uuid3;
  801. }
  802. static int sb_equal(mdp_super_t *sb1, mdp_super_t *sb2)
  803. {
  804. int ret;
  805. mdp_super_t *tmp1, *tmp2;
  806. tmp1 = kmalloc(sizeof(*tmp1),GFP_KERNEL);
  807. tmp2 = kmalloc(sizeof(*tmp2),GFP_KERNEL);
  808. if (!tmp1 || !tmp2) {
  809. ret = 0;
  810. printk(KERN_INFO "md.c sb_equal(): failed to allocate memory!\n");
  811. goto abort;
  812. }
  813. *tmp1 = *sb1;
  814. *tmp2 = *sb2;
  815. /*
  816. * nr_disks is not constant
  817. */
  818. tmp1->nr_disks = 0;
  819. tmp2->nr_disks = 0;
  820. ret = (memcmp(tmp1, tmp2, MD_SB_GENERIC_CONSTANT_WORDS * 4) == 0);
  821. abort:
  822. kfree(tmp1);
  823. kfree(tmp2);
  824. return ret;
  825. }
  826. static u32 md_csum_fold(u32 csum)
  827. {
  828. csum = (csum & 0xffff) + (csum >> 16);
  829. return (csum & 0xffff) + (csum >> 16);
  830. }
  831. static unsigned int calc_sb_csum(mdp_super_t * sb)
  832. {
  833. u64 newcsum = 0;
  834. u32 *sb32 = (u32*)sb;
  835. int i;
  836. unsigned int disk_csum, csum;
  837. disk_csum = sb->sb_csum;
  838. sb->sb_csum = 0;
  839. for (i = 0; i < MD_SB_BYTES/4 ; i++)
  840. newcsum += sb32[i];
  841. csum = (newcsum & 0xffffffff) + (newcsum>>32);
  842. #ifdef CONFIG_ALPHA
  843. /* This used to use csum_partial, which was wrong for several
  844. * reasons including that different results are returned on
  845. * different architectures. It isn't critical that we get exactly
  846. * the same return value as before (we always csum_fold before
  847. * testing, and that removes any differences). However as we
  848. * know that csum_partial always returned a 16bit value on
  849. * alphas, do a fold to maximise conformity to previous behaviour.
  850. */
  851. sb->sb_csum = md_csum_fold(disk_csum);
  852. #else
  853. sb->sb_csum = disk_csum;
  854. #endif
  855. return csum;
  856. }
  857. /*
  858. * Handle superblock details.
  859. * We want to be able to handle multiple superblock formats
  860. * so we have a common interface to them all, and an array of
  861. * different handlers.
  862. * We rely on user-space to write the initial superblock, and support
  863. * reading and updating of superblocks.
  864. * Interface methods are:
  865. * int load_super(mdk_rdev_t *dev, mdk_rdev_t *refdev, int minor_version)
  866. * loads and validates a superblock on dev.
  867. * if refdev != NULL, compare superblocks on both devices
  868. * Return:
  869. * 0 - dev has a superblock that is compatible with refdev
  870. * 1 - dev has a superblock that is compatible and newer than refdev
  871. * so dev should be used as the refdev in future
  872. * -EINVAL superblock incompatible or invalid
  873. * -othererror e.g. -EIO
  874. *
  875. * int validate_super(mddev_t *mddev, mdk_rdev_t *dev)
  876. * Verify that dev is acceptable into mddev.
  877. * The first time, mddev->raid_disks will be 0, and data from
  878. * dev should be merged in. Subsequent calls check that dev
  879. * is new enough. Return 0 or -EINVAL
  880. *
  881. * void sync_super(mddev_t *mddev, mdk_rdev_t *dev)
  882. * Update the superblock for rdev with data in mddev
  883. * This does not write to disc.
  884. *
  885. */
  886. struct super_type {
  887. char *name;
  888. struct module *owner;
  889. int (*load_super)(mdk_rdev_t *rdev, mdk_rdev_t *refdev,
  890. int minor_version);
  891. int (*validate_super)(mddev_t *mddev, mdk_rdev_t *rdev);
  892. void (*sync_super)(mddev_t *mddev, mdk_rdev_t *rdev);
  893. unsigned long long (*rdev_size_change)(mdk_rdev_t *rdev,
  894. sector_t num_sectors);
  895. };
  896. /*
  897. * Check that the given mddev has no bitmap.
  898. *
  899. * This function is called from the run method of all personalities that do not
  900. * support bitmaps. It prints an error message and returns non-zero if mddev
  901. * has a bitmap. Otherwise, it returns 0.
  902. *
  903. */
  904. int md_check_no_bitmap(mddev_t *mddev)
  905. {
  906. if (!mddev->bitmap_info.file && !mddev->bitmap_info.offset)
  907. return 0;
  908. printk(KERN_ERR "%s: bitmaps are not supported for %s\n",
  909. mdname(mddev), mddev->pers->name);
  910. return 1;
  911. }
  912. EXPORT_SYMBOL(md_check_no_bitmap);
  913. /*
  914. * load_super for 0.90.0
  915. */
  916. static int super_90_load(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version)
  917. {
  918. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  919. mdp_super_t *sb;
  920. int ret;
  921. /*
  922. * Calculate the position of the superblock (512byte sectors),
  923. * it's at the end of the disk.
  924. *
  925. * It also happens to be a multiple of 4Kb.
  926. */
  927. rdev->sb_start = calc_dev_sboffset(rdev);
  928. ret = read_disk_sb(rdev, MD_SB_BYTES);
  929. if (ret) return ret;
  930. ret = -EINVAL;
  931. bdevname(rdev->bdev, b);
  932. sb = page_address(rdev->sb_page);
  933. if (sb->md_magic != MD_SB_MAGIC) {
  934. printk(KERN_ERR "md: invalid raid superblock magic on %s\n",
  935. b);
  936. goto abort;
  937. }
  938. if (sb->major_version != 0 ||
  939. sb->minor_version < 90 ||
  940. sb->minor_version > 91) {
  941. printk(KERN_WARNING "Bad version number %d.%d on %s\n",
  942. sb->major_version, sb->minor_version,
  943. b);
  944. goto abort;
  945. }
  946. if (sb->raid_disks <= 0)
  947. goto abort;
  948. if (md_csum_fold(calc_sb_csum(sb)) != md_csum_fold(sb->sb_csum)) {
  949. printk(KERN_WARNING "md: invalid superblock checksum on %s\n",
  950. b);
  951. goto abort;
  952. }
  953. rdev->preferred_minor = sb->md_minor;
  954. rdev->data_offset = 0;
  955. rdev->sb_size = MD_SB_BYTES;
  956. rdev->badblocks.shift = -1;
  957. if (sb->level == LEVEL_MULTIPATH)
  958. rdev->desc_nr = -1;
  959. else
  960. rdev->desc_nr = sb->this_disk.number;
  961. if (!refdev) {
  962. ret = 1;
  963. } else {
  964. __u64 ev1, ev2;
  965. mdp_super_t *refsb = page_address(refdev->sb_page);
  966. if (!uuid_equal(refsb, sb)) {
  967. printk(KERN_WARNING "md: %s has different UUID to %s\n",
  968. b, bdevname(refdev->bdev,b2));
  969. goto abort;
  970. }
  971. if (!sb_equal(refsb, sb)) {
  972. printk(KERN_WARNING "md: %s has same UUID"
  973. " but different superblock to %s\n",
  974. b, bdevname(refdev->bdev, b2));
  975. goto abort;
  976. }
  977. ev1 = md_event(sb);
  978. ev2 = md_event(refsb);
  979. if (ev1 > ev2)
  980. ret = 1;
  981. else
  982. ret = 0;
  983. }
  984. rdev->sectors = rdev->sb_start;
  985. /* Limit to 4TB as metadata cannot record more than that */
  986. if (rdev->sectors >= (2ULL << 32))
  987. rdev->sectors = (2ULL << 32) - 2;
  988. if (rdev->sectors < ((sector_t)sb->size) * 2 && sb->level >= 1)
  989. /* "this cannot possibly happen" ... */
  990. ret = -EINVAL;
  991. abort:
  992. return ret;
  993. }
  994. /*
  995. * validate_super for 0.90.0
  996. */
  997. static int super_90_validate(mddev_t *mddev, mdk_rdev_t *rdev)
  998. {
  999. mdp_disk_t *desc;
  1000. mdp_super_t *sb = page_address(rdev->sb_page);
  1001. __u64 ev1 = md_event(sb);
  1002. rdev->raid_disk = -1;
  1003. clear_bit(Faulty, &rdev->flags);
  1004. clear_bit(In_sync, &rdev->flags);
  1005. clear_bit(WriteMostly, &rdev->flags);
  1006. if (mddev->raid_disks == 0) {
  1007. mddev->major_version = 0;
  1008. mddev->minor_version = sb->minor_version;
  1009. mddev->patch_version = sb->patch_version;
  1010. mddev->external = 0;
  1011. mddev->chunk_sectors = sb->chunk_size >> 9;
  1012. mddev->ctime = sb->ctime;
  1013. mddev->utime = sb->utime;
  1014. mddev->level = sb->level;
  1015. mddev->clevel[0] = 0;
  1016. mddev->layout = sb->layout;
  1017. mddev->raid_disks = sb->raid_disks;
  1018. mddev->dev_sectors = ((sector_t)sb->size) * 2;
  1019. mddev->events = ev1;
  1020. mddev->bitmap_info.offset = 0;
  1021. mddev->bitmap_info.default_offset = MD_SB_BYTES >> 9;
  1022. if (mddev->minor_version >= 91) {
  1023. mddev->reshape_position = sb->reshape_position;
  1024. mddev->delta_disks = sb->delta_disks;
  1025. mddev->new_level = sb->new_level;
  1026. mddev->new_layout = sb->new_layout;
  1027. mddev->new_chunk_sectors = sb->new_chunk >> 9;
  1028. } else {
  1029. mddev->reshape_position = MaxSector;
  1030. mddev->delta_disks = 0;
  1031. mddev->new_level = mddev->level;
  1032. mddev->new_layout = mddev->layout;
  1033. mddev->new_chunk_sectors = mddev->chunk_sectors;
  1034. }
  1035. if (sb->state & (1<<MD_SB_CLEAN))
  1036. mddev->recovery_cp = MaxSector;
  1037. else {
  1038. if (sb->events_hi == sb->cp_events_hi &&
  1039. sb->events_lo == sb->cp_events_lo) {
  1040. mddev->recovery_cp = sb->recovery_cp;
  1041. } else
  1042. mddev->recovery_cp = 0;
  1043. }
  1044. memcpy(mddev->uuid+0, &sb->set_uuid0, 4);
  1045. memcpy(mddev->uuid+4, &sb->set_uuid1, 4);
  1046. memcpy(mddev->uuid+8, &sb->set_uuid2, 4);
  1047. memcpy(mddev->uuid+12,&sb->set_uuid3, 4);
  1048. mddev->max_disks = MD_SB_DISKS;
  1049. if (sb->state & (1<<MD_SB_BITMAP_PRESENT) &&
  1050. mddev->bitmap_info.file == NULL)
  1051. mddev->bitmap_info.offset =
  1052. mddev->bitmap_info.default_offset;
  1053. } else if (mddev->pers == NULL) {
  1054. /* Insist on good event counter while assembling, except
  1055. * for spares (which don't need an event count) */
  1056. ++ev1;
  1057. if (sb->disks[rdev->desc_nr].state & (
  1058. (1<<MD_DISK_SYNC) | (1 << MD_DISK_ACTIVE)))
  1059. if (ev1 < mddev->events)
  1060. return -EINVAL;
  1061. } else if (mddev->bitmap) {
  1062. /* if adding to array with a bitmap, then we can accept an
  1063. * older device ... but not too old.
  1064. */
  1065. if (ev1 < mddev->bitmap->events_cleared)
  1066. return 0;
  1067. } else {
  1068. if (ev1 < mddev->events)
  1069. /* just a hot-add of a new device, leave raid_disk at -1 */
  1070. return 0;
  1071. }
  1072. if (mddev->level != LEVEL_MULTIPATH) {
  1073. desc = sb->disks + rdev->desc_nr;
  1074. if (desc->state & (1<<MD_DISK_FAULTY))
  1075. set_bit(Faulty, &rdev->flags);
  1076. else if (desc->state & (1<<MD_DISK_SYNC) /* &&
  1077. desc->raid_disk < mddev->raid_disks */) {
  1078. set_bit(In_sync, &rdev->flags);
  1079. rdev->raid_disk = desc->raid_disk;
  1080. } else if (desc->state & (1<<MD_DISK_ACTIVE)) {
  1081. /* active but not in sync implies recovery up to
  1082. * reshape position. We don't know exactly where
  1083. * that is, so set to zero for now */
  1084. if (mddev->minor_version >= 91) {
  1085. rdev->recovery_offset = 0;
  1086. rdev->raid_disk = desc->raid_disk;
  1087. }
  1088. }
  1089. if (desc->state & (1<<MD_DISK_WRITEMOSTLY))
  1090. set_bit(WriteMostly, &rdev->flags);
  1091. } else /* MULTIPATH are always insync */
  1092. set_bit(In_sync, &rdev->flags);
  1093. return 0;
  1094. }
  1095. /*
  1096. * sync_super for 0.90.0
  1097. */
  1098. static void super_90_sync(mddev_t *mddev, mdk_rdev_t *rdev)
  1099. {
  1100. mdp_super_t *sb;
  1101. mdk_rdev_t *rdev2;
  1102. int next_spare = mddev->raid_disks;
  1103. /* make rdev->sb match mddev data..
  1104. *
  1105. * 1/ zero out disks
  1106. * 2/ Add info for each disk, keeping track of highest desc_nr (next_spare);
  1107. * 3/ any empty disks < next_spare become removed
  1108. *
  1109. * disks[0] gets initialised to REMOVED because
  1110. * we cannot be sure from other fields if it has
  1111. * been initialised or not.
  1112. */
  1113. int i;
  1114. int active=0, working=0,failed=0,spare=0,nr_disks=0;
  1115. rdev->sb_size = MD_SB_BYTES;
  1116. sb = page_address(rdev->sb_page);
  1117. memset(sb, 0, sizeof(*sb));
  1118. sb->md_magic = MD_SB_MAGIC;
  1119. sb->major_version = mddev->major_version;
  1120. sb->patch_version = mddev->patch_version;
  1121. sb->gvalid_words = 0; /* ignored */
  1122. memcpy(&sb->set_uuid0, mddev->uuid+0, 4);
  1123. memcpy(&sb->set_uuid1, mddev->uuid+4, 4);
  1124. memcpy(&sb->set_uuid2, mddev->uuid+8, 4);
  1125. memcpy(&sb->set_uuid3, mddev->uuid+12,4);
  1126. sb->ctime = mddev->ctime;
  1127. sb->level = mddev->level;
  1128. sb->size = mddev->dev_sectors / 2;
  1129. sb->raid_disks = mddev->raid_disks;
  1130. sb->md_minor = mddev->md_minor;
  1131. sb->not_persistent = 0;
  1132. sb->utime = mddev->utime;
  1133. sb->state = 0;
  1134. sb->events_hi = (mddev->events>>32);
  1135. sb->events_lo = (u32)mddev->events;
  1136. if (mddev->reshape_position == MaxSector)
  1137. sb->minor_version = 90;
  1138. else {
  1139. sb->minor_version = 91;
  1140. sb->reshape_position = mddev->reshape_position;
  1141. sb->new_level = mddev->new_level;
  1142. sb->delta_disks = mddev->delta_disks;
  1143. sb->new_layout = mddev->new_layout;
  1144. sb->new_chunk = mddev->new_chunk_sectors << 9;
  1145. }
  1146. mddev->minor_version = sb->minor_version;
  1147. if (mddev->in_sync)
  1148. {
  1149. sb->recovery_cp = mddev->recovery_cp;
  1150. sb->cp_events_hi = (mddev->events>>32);
  1151. sb->cp_events_lo = (u32)mddev->events;
  1152. if (mddev->recovery_cp == MaxSector)
  1153. sb->state = (1<< MD_SB_CLEAN);
  1154. } else
  1155. sb->recovery_cp = 0;
  1156. sb->layout = mddev->layout;
  1157. sb->chunk_size = mddev->chunk_sectors << 9;
  1158. if (mddev->bitmap && mddev->bitmap_info.file == NULL)
  1159. sb->state |= (1<<MD_SB_BITMAP_PRESENT);
  1160. sb->disks[0].state = (1<<MD_DISK_REMOVED);
  1161. list_for_each_entry(rdev2, &mddev->disks, same_set) {
  1162. mdp_disk_t *d;
  1163. int desc_nr;
  1164. int is_active = test_bit(In_sync, &rdev2->flags);
  1165. if (rdev2->raid_disk >= 0 &&
  1166. sb->minor_version >= 91)
  1167. /* we have nowhere to store the recovery_offset,
  1168. * but if it is not below the reshape_position,
  1169. * we can piggy-back on that.
  1170. */
  1171. is_active = 1;
  1172. if (rdev2->raid_disk < 0 ||
  1173. test_bit(Faulty, &rdev2->flags))
  1174. is_active = 0;
  1175. if (is_active)
  1176. desc_nr = rdev2->raid_disk;
  1177. else
  1178. desc_nr = next_spare++;
  1179. rdev2->desc_nr = desc_nr;
  1180. d = &sb->disks[rdev2->desc_nr];
  1181. nr_disks++;
  1182. d->number = rdev2->desc_nr;
  1183. d->major = MAJOR(rdev2->bdev->bd_dev);
  1184. d->minor = MINOR(rdev2->bdev->bd_dev);
  1185. if (is_active)
  1186. d->raid_disk = rdev2->raid_disk;
  1187. else
  1188. d->raid_disk = rdev2->desc_nr; /* compatibility */
  1189. if (test_bit(Faulty, &rdev2->flags))
  1190. d->state = (1<<MD_DISK_FAULTY);
  1191. else if (is_active) {
  1192. d->state = (1<<MD_DISK_ACTIVE);
  1193. if (test_bit(In_sync, &rdev2->flags))
  1194. d->state |= (1<<MD_DISK_SYNC);
  1195. active++;
  1196. working++;
  1197. } else {
  1198. d->state = 0;
  1199. spare++;
  1200. working++;
  1201. }
  1202. if (test_bit(WriteMostly, &rdev2->flags))
  1203. d->state |= (1<<MD_DISK_WRITEMOSTLY);
  1204. }
  1205. /* now set the "removed" and "faulty" bits on any missing devices */
  1206. for (i=0 ; i < mddev->raid_disks ; i++) {
  1207. mdp_disk_t *d = &sb->disks[i];
  1208. if (d->state == 0 && d->number == 0) {
  1209. d->number = i;
  1210. d->raid_disk = i;
  1211. d->state = (1<<MD_DISK_REMOVED);
  1212. d->state |= (1<<MD_DISK_FAULTY);
  1213. failed++;
  1214. }
  1215. }
  1216. sb->nr_disks = nr_disks;
  1217. sb->active_disks = active;
  1218. sb->working_disks = working;
  1219. sb->failed_disks = failed;
  1220. sb->spare_disks = spare;
  1221. sb->this_disk = sb->disks[rdev->desc_nr];
  1222. sb->sb_csum = calc_sb_csum(sb);
  1223. }
  1224. /*
  1225. * rdev_size_change for 0.90.0
  1226. */
  1227. static unsigned long long
  1228. super_90_rdev_size_change(mdk_rdev_t *rdev, sector_t num_sectors)
  1229. {
  1230. if (num_sectors && num_sectors < rdev->mddev->dev_sectors)
  1231. return 0; /* component must fit device */
  1232. if (rdev->mddev->bitmap_info.offset)
  1233. return 0; /* can't move bitmap */
  1234. rdev->sb_start = calc_dev_sboffset(rdev);
  1235. if (!num_sectors || num_sectors > rdev->sb_start)
  1236. num_sectors = rdev->sb_start;
  1237. /* Limit to 4TB as metadata cannot record more than that.
  1238. * 4TB == 2^32 KB, or 2*2^32 sectors.
  1239. */
  1240. if (num_sectors >= (2ULL << 32))
  1241. num_sectors = (2ULL << 32) - 2;
  1242. md_super_write(rdev->mddev, rdev, rdev->sb_start, rdev->sb_size,
  1243. rdev->sb_page);
  1244. md_super_wait(rdev->mddev);
  1245. return num_sectors;
  1246. }
  1247. /*
  1248. * version 1 superblock
  1249. */
  1250. static __le32 calc_sb_1_csum(struct mdp_superblock_1 * sb)
  1251. {
  1252. __le32 disk_csum;
  1253. u32 csum;
  1254. unsigned long long newcsum;
  1255. int size = 256 + le32_to_cpu(sb->max_dev)*2;
  1256. __le32 *isuper = (__le32*)sb;
  1257. int i;
  1258. disk_csum = sb->sb_csum;
  1259. sb->sb_csum = 0;
  1260. newcsum = 0;
  1261. for (i=0; size>=4; size -= 4 )
  1262. newcsum += le32_to_cpu(*isuper++);
  1263. if (size == 2)
  1264. newcsum += le16_to_cpu(*(__le16*) isuper);
  1265. csum = (newcsum & 0xffffffff) + (newcsum >> 32);
  1266. sb->sb_csum = disk_csum;
  1267. return cpu_to_le32(csum);
  1268. }
  1269. static int md_set_badblocks(struct badblocks *bb, sector_t s, int sectors,
  1270. int acknowledged);
  1271. static int super_1_load(mdk_rdev_t *rdev, mdk_rdev_t *refdev, int minor_version)
  1272. {
  1273. struct mdp_superblock_1 *sb;
  1274. int ret;
  1275. sector_t sb_start;
  1276. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  1277. int bmask;
  1278. /*
  1279. * Calculate the position of the superblock in 512byte sectors.
  1280. * It is always aligned to a 4K boundary and
  1281. * depeding on minor_version, it can be:
  1282. * 0: At least 8K, but less than 12K, from end of device
  1283. * 1: At start of device
  1284. * 2: 4K from start of device.
  1285. */
  1286. switch(minor_version) {
  1287. case 0:
  1288. sb_start = i_size_read(rdev->bdev->bd_inode) >> 9;
  1289. sb_start -= 8*2;
  1290. sb_start &= ~(sector_t)(4*2-1);
  1291. break;
  1292. case 1:
  1293. sb_start = 0;
  1294. break;
  1295. case 2:
  1296. sb_start = 8;
  1297. break;
  1298. default:
  1299. return -EINVAL;
  1300. }
  1301. rdev->sb_start = sb_start;
  1302. /* superblock is rarely larger than 1K, but it can be larger,
  1303. * and it is safe to read 4k, so we do that
  1304. */
  1305. ret = read_disk_sb(rdev, 4096);
  1306. if (ret) return ret;
  1307. sb = page_address(rdev->sb_page);
  1308. if (sb->magic != cpu_to_le32(MD_SB_MAGIC) ||
  1309. sb->major_version != cpu_to_le32(1) ||
  1310. le32_to_cpu(sb->max_dev) > (4096-256)/2 ||
  1311. le64_to_cpu(sb->super_offset) != rdev->sb_start ||
  1312. (le32_to_cpu(sb->feature_map) & ~MD_FEATURE_ALL) != 0)
  1313. return -EINVAL;
  1314. if (calc_sb_1_csum(sb) != sb->sb_csum) {
  1315. printk("md: invalid superblock checksum on %s\n",
  1316. bdevname(rdev->bdev,b));
  1317. return -EINVAL;
  1318. }
  1319. if (le64_to_cpu(sb->data_size) < 10) {
  1320. printk("md: data_size too small on %s\n",
  1321. bdevname(rdev->bdev,b));
  1322. return -EINVAL;
  1323. }
  1324. rdev->preferred_minor = 0xffff;
  1325. rdev->data_offset = le64_to_cpu(sb->data_offset);
  1326. atomic_set(&rdev->corrected_errors, le32_to_cpu(sb->cnt_corrected_read));
  1327. rdev->sb_size = le32_to_cpu(sb->max_dev) * 2 + 256;
  1328. bmask = queue_logical_block_size(rdev->bdev->bd_disk->queue)-1;
  1329. if (rdev->sb_size & bmask)
  1330. rdev->sb_size = (rdev->sb_size | bmask) + 1;
  1331. if (minor_version
  1332. && rdev->data_offset < sb_start + (rdev->sb_size/512))
  1333. return -EINVAL;
  1334. if (sb->level == cpu_to_le32(LEVEL_MULTIPATH))
  1335. rdev->desc_nr = -1;
  1336. else
  1337. rdev->desc_nr = le32_to_cpu(sb->dev_number);
  1338. if (!rdev->bb_page) {
  1339. rdev->bb_page = alloc_page(GFP_KERNEL);
  1340. if (!rdev->bb_page)
  1341. return -ENOMEM;
  1342. }
  1343. if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_BAD_BLOCKS) &&
  1344. rdev->badblocks.count == 0) {
  1345. /* need to load the bad block list.
  1346. * Currently we limit it to one page.
  1347. */
  1348. s32 offset;
  1349. sector_t bb_sector;
  1350. u64 *bbp;
  1351. int i;
  1352. int sectors = le16_to_cpu(sb->bblog_size);
  1353. if (sectors > (PAGE_SIZE / 512))
  1354. return -EINVAL;
  1355. offset = le32_to_cpu(sb->bblog_offset);
  1356. if (offset == 0)
  1357. return -EINVAL;
  1358. bb_sector = (long long)offset;
  1359. if (!sync_page_io(rdev, bb_sector, sectors << 9,
  1360. rdev->bb_page, READ, true))
  1361. return -EIO;
  1362. bbp = (u64 *)page_address(rdev->bb_page);
  1363. rdev->badblocks.shift = sb->bblog_shift;
  1364. for (i = 0 ; i < (sectors << (9-3)) ; i++, bbp++) {
  1365. u64 bb = le64_to_cpu(*bbp);
  1366. int count = bb & (0x3ff);
  1367. u64 sector = bb >> 10;
  1368. sector <<= sb->bblog_shift;
  1369. count <<= sb->bblog_shift;
  1370. if (bb + 1 == 0)
  1371. break;
  1372. if (md_set_badblocks(&rdev->badblocks,
  1373. sector, count, 1) == 0)
  1374. return -EINVAL;
  1375. }
  1376. } else if (sb->bblog_offset == 0)
  1377. rdev->badblocks.shift = -1;
  1378. if (!refdev) {
  1379. ret = 1;
  1380. } else {
  1381. __u64 ev1, ev2;
  1382. struct mdp_superblock_1 *refsb = page_address(refdev->sb_page);
  1383. if (memcmp(sb->set_uuid, refsb->set_uuid, 16) != 0 ||
  1384. sb->level != refsb->level ||
  1385. sb->layout != refsb->layout ||
  1386. sb->chunksize != refsb->chunksize) {
  1387. printk(KERN_WARNING "md: %s has strangely different"
  1388. " superblock to %s\n",
  1389. bdevname(rdev->bdev,b),
  1390. bdevname(refdev->bdev,b2));
  1391. return -EINVAL;
  1392. }
  1393. ev1 = le64_to_cpu(sb->events);
  1394. ev2 = le64_to_cpu(refsb->events);
  1395. if (ev1 > ev2)
  1396. ret = 1;
  1397. else
  1398. ret = 0;
  1399. }
  1400. if (minor_version)
  1401. rdev->sectors = (i_size_read(rdev->bdev->bd_inode) >> 9) -
  1402. le64_to_cpu(sb->data_offset);
  1403. else
  1404. rdev->sectors = rdev->sb_start;
  1405. if (rdev->sectors < le64_to_cpu(sb->data_size))
  1406. return -EINVAL;
  1407. rdev->sectors = le64_to_cpu(sb->data_size);
  1408. if (le64_to_cpu(sb->size) > rdev->sectors)
  1409. return -EINVAL;
  1410. return ret;
  1411. }
  1412. static int super_1_validate(mddev_t *mddev, mdk_rdev_t *rdev)
  1413. {
  1414. struct mdp_superblock_1 *sb = page_address(rdev->sb_page);
  1415. __u64 ev1 = le64_to_cpu(sb->events);
  1416. rdev->raid_disk = -1;
  1417. clear_bit(Faulty, &rdev->flags);
  1418. clear_bit(In_sync, &rdev->flags);
  1419. clear_bit(WriteMostly, &rdev->flags);
  1420. if (mddev->raid_disks == 0) {
  1421. mddev->major_version = 1;
  1422. mddev->patch_version = 0;
  1423. mddev->external = 0;
  1424. mddev->chunk_sectors = le32_to_cpu(sb->chunksize);
  1425. mddev->ctime = le64_to_cpu(sb->ctime) & ((1ULL << 32)-1);
  1426. mddev->utime = le64_to_cpu(sb->utime) & ((1ULL << 32)-1);
  1427. mddev->level = le32_to_cpu(sb->level);
  1428. mddev->clevel[0] = 0;
  1429. mddev->layout = le32_to_cpu(sb->layout);
  1430. mddev->raid_disks = le32_to_cpu(sb->raid_disks);
  1431. mddev->dev_sectors = le64_to_cpu(sb->size);
  1432. mddev->events = ev1;
  1433. mddev->bitmap_info.offset = 0;
  1434. mddev->bitmap_info.default_offset = 1024 >> 9;
  1435. mddev->recovery_cp = le64_to_cpu(sb->resync_offset);
  1436. memcpy(mddev->uuid, sb->set_uuid, 16);
  1437. mddev->max_disks = (4096-256)/2;
  1438. if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_BITMAP_OFFSET) &&
  1439. mddev->bitmap_info.file == NULL )
  1440. mddev->bitmap_info.offset =
  1441. (__s32)le32_to_cpu(sb->bitmap_offset);
  1442. if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_RESHAPE_ACTIVE)) {
  1443. mddev->reshape_position = le64_to_cpu(sb->reshape_position);
  1444. mddev->delta_disks = le32_to_cpu(sb->delta_disks);
  1445. mddev->new_level = le32_to_cpu(sb->new_level);
  1446. mddev->new_layout = le32_to_cpu(sb->new_layout);
  1447. mddev->new_chunk_sectors = le32_to_cpu(sb->new_chunk);
  1448. } else {
  1449. mddev->reshape_position = MaxSector;
  1450. mddev->delta_disks = 0;
  1451. mddev->new_level = mddev->level;
  1452. mddev->new_layout = mddev->layout;
  1453. mddev->new_chunk_sectors = mddev->chunk_sectors;
  1454. }
  1455. } else if (mddev->pers == NULL) {
  1456. /* Insist of good event counter while assembling, except for
  1457. * spares (which don't need an event count) */
  1458. ++ev1;
  1459. if (rdev->desc_nr >= 0 &&
  1460. rdev->desc_nr < le32_to_cpu(sb->max_dev) &&
  1461. le16_to_cpu(sb->dev_roles[rdev->desc_nr]) < 0xfffe)
  1462. if (ev1 < mddev->events)
  1463. return -EINVAL;
  1464. } else if (mddev->bitmap) {
  1465. /* If adding to array with a bitmap, then we can accept an
  1466. * older device, but not too old.
  1467. */
  1468. if (ev1 < mddev->bitmap->events_cleared)
  1469. return 0;
  1470. } else {
  1471. if (ev1 < mddev->events)
  1472. /* just a hot-add of a new device, leave raid_disk at -1 */
  1473. return 0;
  1474. }
  1475. if (mddev->level != LEVEL_MULTIPATH) {
  1476. int role;
  1477. if (rdev->desc_nr < 0 ||
  1478. rdev->desc_nr >= le32_to_cpu(sb->max_dev)) {
  1479. role = 0xffff;
  1480. rdev->desc_nr = -1;
  1481. } else
  1482. role = le16_to_cpu(sb->dev_roles[rdev->desc_nr]);
  1483. switch(role) {
  1484. case 0xffff: /* spare */
  1485. break;
  1486. case 0xfffe: /* faulty */
  1487. set_bit(Faulty, &rdev->flags);
  1488. break;
  1489. default:
  1490. if ((le32_to_cpu(sb->feature_map) &
  1491. MD_FEATURE_RECOVERY_OFFSET))
  1492. rdev->recovery_offset = le64_to_cpu(sb->recovery_offset);
  1493. else
  1494. set_bit(In_sync, &rdev->flags);
  1495. rdev->raid_disk = role;
  1496. break;
  1497. }
  1498. if (sb->devflags & WriteMostly1)
  1499. set_bit(WriteMostly, &rdev->flags);
  1500. } else /* MULTIPATH are always insync */
  1501. set_bit(In_sync, &rdev->flags);
  1502. return 0;
  1503. }
  1504. static void super_1_sync(mddev_t *mddev, mdk_rdev_t *rdev)
  1505. {
  1506. struct mdp_superblock_1 *sb;
  1507. mdk_rdev_t *rdev2;
  1508. int max_dev, i;
  1509. /* make rdev->sb match mddev and rdev data. */
  1510. sb = page_address(rdev->sb_page);
  1511. sb->feature_map = 0;
  1512. sb->pad0 = 0;
  1513. sb->recovery_offset = cpu_to_le64(0);
  1514. memset(sb->pad1, 0, sizeof(sb->pad1));
  1515. memset(sb->pad3, 0, sizeof(sb->pad3));
  1516. sb->utime = cpu_to_le64((__u64)mddev->utime);
  1517. sb->events = cpu_to_le64(mddev->events);
  1518. if (mddev->in_sync)
  1519. sb->resync_offset = cpu_to_le64(mddev->recovery_cp);
  1520. else
  1521. sb->resync_offset = cpu_to_le64(0);
  1522. sb->cnt_corrected_read = cpu_to_le32(atomic_read(&rdev->corrected_errors));
  1523. sb->raid_disks = cpu_to_le32(mddev->raid_disks);
  1524. sb->size = cpu_to_le64(mddev->dev_sectors);
  1525. sb->chunksize = cpu_to_le32(mddev->chunk_sectors);
  1526. sb->level = cpu_to_le32(mddev->level);
  1527. sb->layout = cpu_to_le32(mddev->layout);
  1528. if (test_bit(WriteMostly, &rdev->flags))
  1529. sb->devflags |= WriteMostly1;
  1530. else
  1531. sb->devflags &= ~WriteMostly1;
  1532. if (mddev->bitmap && mddev->bitmap_info.file == NULL) {
  1533. sb->bitmap_offset = cpu_to_le32((__u32)mddev->bitmap_info.offset);
  1534. sb->feature_map = cpu_to_le32(MD_FEATURE_BITMAP_OFFSET);
  1535. }
  1536. if (rdev->raid_disk >= 0 &&
  1537. !test_bit(In_sync, &rdev->flags)) {
  1538. sb->feature_map |=
  1539. cpu_to_le32(MD_FEATURE_RECOVERY_OFFSET);
  1540. sb->recovery_offset =
  1541. cpu_to_le64(rdev->recovery_offset);
  1542. }
  1543. if (mddev->reshape_position != MaxSector) {
  1544. sb->feature_map |= cpu_to_le32(MD_FEATURE_RESHAPE_ACTIVE);
  1545. sb->reshape_position = cpu_to_le64(mddev->reshape_position);
  1546. sb->new_layout = cpu_to_le32(mddev->new_layout);
  1547. sb->delta_disks = cpu_to_le32(mddev->delta_disks);
  1548. sb->new_level = cpu_to_le32(mddev->new_level);
  1549. sb->new_chunk = cpu_to_le32(mddev->new_chunk_sectors);
  1550. }
  1551. if (rdev->badblocks.count == 0)
  1552. /* Nothing to do for bad blocks*/ ;
  1553. else if (sb->bblog_offset == 0)
  1554. /* Cannot record bad blocks on this device */
  1555. md_error(mddev, rdev);
  1556. else {
  1557. struct badblocks *bb = &rdev->badblocks;
  1558. u64 *bbp = (u64 *)page_address(rdev->bb_page);
  1559. u64 *p = bb->page;
  1560. sb->feature_map |= cpu_to_le32(MD_FEATURE_BAD_BLOCKS);
  1561. if (bb->changed) {
  1562. unsigned seq;
  1563. retry:
  1564. seq = read_seqbegin(&bb->lock);
  1565. memset(bbp, 0xff, PAGE_SIZE);
  1566. for (i = 0 ; i < bb->count ; i++) {
  1567. u64 internal_bb = *p++;
  1568. u64 store_bb = ((BB_OFFSET(internal_bb) << 10)
  1569. | BB_LEN(internal_bb));
  1570. *bbp++ = cpu_to_le64(store_bb);
  1571. }
  1572. if (read_seqretry(&bb->lock, seq))
  1573. goto retry;
  1574. bb->sector = (rdev->sb_start +
  1575. (int)le32_to_cpu(sb->bblog_offset));
  1576. bb->size = le16_to_cpu(sb->bblog_size);
  1577. bb->changed = 0;
  1578. }
  1579. }
  1580. max_dev = 0;
  1581. list_for_each_entry(rdev2, &mddev->disks, same_set)
  1582. if (rdev2->desc_nr+1 > max_dev)
  1583. max_dev = rdev2->desc_nr+1;
  1584. if (max_dev > le32_to_cpu(sb->max_dev)) {
  1585. int bmask;
  1586. sb->max_dev = cpu_to_le32(max_dev);
  1587. rdev->sb_size = max_dev * 2 + 256;
  1588. bmask = queue_logical_block_size(rdev->bdev->bd_disk->queue)-1;
  1589. if (rdev->sb_size & bmask)
  1590. rdev->sb_size = (rdev->sb_size | bmask) + 1;
  1591. } else
  1592. max_dev = le32_to_cpu(sb->max_dev);
  1593. for (i=0; i<max_dev;i++)
  1594. sb->dev_roles[i] = cpu_to_le16(0xfffe);
  1595. list_for_each_entry(rdev2, &mddev->disks, same_set) {
  1596. i = rdev2->desc_nr;
  1597. if (test_bit(Faulty, &rdev2->flags))
  1598. sb->dev_roles[i] = cpu_to_le16(0xfffe);
  1599. else if (test_bit(In_sync, &rdev2->flags))
  1600. sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk);
  1601. else if (rdev2->raid_disk >= 0)
  1602. sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk);
  1603. else
  1604. sb->dev_roles[i] = cpu_to_le16(0xffff);
  1605. }
  1606. sb->sb_csum = calc_sb_1_csum(sb);
  1607. }
  1608. static unsigned long long
  1609. super_1_rdev_size_change(mdk_rdev_t *rdev, sector_t num_sectors)
  1610. {
  1611. struct mdp_superblock_1 *sb;
  1612. sector_t max_sectors;
  1613. if (num_sectors && num_sectors < rdev->mddev->dev_sectors)
  1614. return 0; /* component must fit device */
  1615. if (rdev->sb_start < rdev->data_offset) {
  1616. /* minor versions 1 and 2; superblock before data */
  1617. max_sectors = i_size_read(rdev->bdev->bd_inode) >> 9;
  1618. max_sectors -= rdev->data_offset;
  1619. if (!num_sectors || num_sectors > max_sectors)
  1620. num_sectors = max_sectors;
  1621. } else if (rdev->mddev->bitmap_info.offset) {
  1622. /* minor version 0 with bitmap we can't move */
  1623. return 0;
  1624. } else {
  1625. /* minor version 0; superblock after data */
  1626. sector_t sb_start;
  1627. sb_start = (i_size_read(rdev->bdev->bd_inode) >> 9) - 8*2;
  1628. sb_start &= ~(sector_t)(4*2 - 1);
  1629. max_sectors = rdev->sectors + sb_start - rdev->sb_start;
  1630. if (!num_sectors || num_sectors > max_sectors)
  1631. num_sectors = max_sectors;
  1632. rdev->sb_start = sb_start;
  1633. }
  1634. sb = page_address(rdev->sb_page);
  1635. sb->data_size = cpu_to_le64(num_sectors);
  1636. sb->super_offset = rdev->sb_start;
  1637. sb->sb_csum = calc_sb_1_csum(sb);
  1638. md_super_write(rdev->mddev, rdev, rdev->sb_start, rdev->sb_size,
  1639. rdev->sb_page);
  1640. md_super_wait(rdev->mddev);
  1641. return num_sectors;
  1642. }
  1643. static struct super_type super_types[] = {
  1644. [0] = {
  1645. .name = "0.90.0",
  1646. .owner = THIS_MODULE,
  1647. .load_super = super_90_load,
  1648. .validate_super = super_90_validate,
  1649. .sync_super = super_90_sync,
  1650. .rdev_size_change = super_90_rdev_size_change,
  1651. },
  1652. [1] = {
  1653. .name = "md-1",
  1654. .owner = THIS_MODULE,
  1655. .load_super = super_1_load,
  1656. .validate_super = super_1_validate,
  1657. .sync_super = super_1_sync,
  1658. .rdev_size_change = super_1_rdev_size_change,
  1659. },
  1660. };
  1661. static void sync_super(mddev_t *mddev, mdk_rdev_t *rdev)
  1662. {
  1663. if (mddev->sync_super) {
  1664. mddev->sync_super(mddev, rdev);
  1665. return;
  1666. }
  1667. BUG_ON(mddev->major_version >= ARRAY_SIZE(super_types));
  1668. super_types[mddev->major_version].sync_super(mddev, rdev);
  1669. }
  1670. static int match_mddev_units(mddev_t *mddev1, mddev_t *mddev2)
  1671. {
  1672. mdk_rdev_t *rdev, *rdev2;
  1673. rcu_read_lock();
  1674. rdev_for_each_rcu(rdev, mddev1)
  1675. rdev_for_each_rcu(rdev2, mddev2)
  1676. if (rdev->bdev->bd_contains ==
  1677. rdev2->bdev->bd_contains) {
  1678. rcu_read_unlock();
  1679. return 1;
  1680. }
  1681. rcu_read_unlock();
  1682. return 0;
  1683. }
  1684. static LIST_HEAD(pending_raid_disks);
  1685. /*
  1686. * Try to register data integrity profile for an mddev
  1687. *
  1688. * This is called when an array is started and after a disk has been kicked
  1689. * from the array. It only succeeds if all working and active component devices
  1690. * are integrity capable with matching profiles.
  1691. */
  1692. int md_integrity_register(mddev_t *mddev)
  1693. {
  1694. mdk_rdev_t *rdev, *reference = NULL;
  1695. if (list_empty(&mddev->disks))
  1696. return 0; /* nothing to do */
  1697. if (!mddev->gendisk || blk_get_integrity(mddev->gendisk))
  1698. return 0; /* shouldn't register, or already is */
  1699. list_for_each_entry(rdev, &mddev->disks, same_set) {
  1700. /* skip spares and non-functional disks */
  1701. if (test_bit(Faulty, &rdev->flags))
  1702. continue;
  1703. if (rdev->raid_disk < 0)
  1704. continue;
  1705. if (!reference) {
  1706. /* Use the first rdev as the reference */
  1707. reference = rdev;
  1708. continue;
  1709. }
  1710. /* does this rdev's profile match the reference profile? */
  1711. if (blk_integrity_compare(reference->bdev->bd_disk,
  1712. rdev->bdev->bd_disk) < 0)
  1713. return -EINVAL;
  1714. }
  1715. if (!reference || !bdev_get_integrity(reference->bdev))
  1716. return 0;
  1717. /*
  1718. * All component devices are integrity capable and have matching
  1719. * profiles, register the common profile for the md device.
  1720. */
  1721. if (blk_integrity_register(mddev->gendisk,
  1722. bdev_get_integrity(reference->bdev)) != 0) {
  1723. printk(KERN_ERR "md: failed to register integrity for %s\n",
  1724. mdname(mddev));
  1725. return -EINVAL;
  1726. }
  1727. printk(KERN_NOTICE "md: data integrity enabled on %s\n", mdname(mddev));
  1728. if (bioset_integrity_create(mddev->bio_set, BIO_POOL_SIZE)) {
  1729. printk(KERN_ERR "md: failed to create integrity pool for %s\n",
  1730. mdname(mddev));
  1731. return -EINVAL;
  1732. }
  1733. return 0;
  1734. }
  1735. EXPORT_SYMBOL(md_integrity_register);
  1736. /* Disable data integrity if non-capable/non-matching disk is being added */
  1737. void md_integrity_add_rdev(mdk_rdev_t *rdev, mddev_t *mddev)
  1738. {
  1739. struct blk_integrity *bi_rdev = bdev_get_integrity(rdev->bdev);
  1740. struct blk_integrity *bi_mddev = blk_get_integrity(mddev->gendisk);
  1741. if (!bi_mddev) /* nothing to do */
  1742. return;
  1743. if (rdev->raid_disk < 0) /* skip spares */
  1744. return;
  1745. if (bi_rdev && blk_integrity_compare(mddev->gendisk,
  1746. rdev->bdev->bd_disk) >= 0)
  1747. return;
  1748. printk(KERN_NOTICE "disabling data integrity on %s\n", mdname(mddev));
  1749. blk_integrity_unregister(mddev->gendisk);
  1750. }
  1751. EXPORT_SYMBOL(md_integrity_add_rdev);
  1752. static int bind_rdev_to_array(mdk_rdev_t * rdev, mddev_t * mddev)
  1753. {
  1754. char b[BDEVNAME_SIZE];
  1755. struct kobject *ko;
  1756. char *s;
  1757. int err;
  1758. if (rdev->mddev) {
  1759. MD_BUG();
  1760. return -EINVAL;
  1761. }
  1762. /* prevent duplicates */
  1763. if (find_rdev(mddev, rdev->bdev->bd_dev))
  1764. return -EEXIST;
  1765. /* make sure rdev->sectors exceeds mddev->dev_sectors */
  1766. if (rdev->sectors && (mddev->dev_sectors == 0 ||
  1767. rdev->sectors < mddev->dev_sectors)) {
  1768. if (mddev->pers) {
  1769. /* Cannot change size, so fail
  1770. * If mddev->level <= 0, then we don't care
  1771. * about aligning sizes (e.g. linear)
  1772. */
  1773. if (mddev->level > 0)
  1774. return -ENOSPC;
  1775. } else
  1776. mddev->dev_sectors = rdev->sectors;
  1777. }
  1778. /* Verify rdev->desc_nr is unique.
  1779. * If it is -1, assign a free number, else
  1780. * check number is not in use
  1781. */
  1782. if (rdev->desc_nr < 0) {
  1783. int choice = 0;
  1784. if (mddev->pers) choice = mddev->raid_disks;
  1785. while (find_rdev_nr(mddev, choice))
  1786. choice++;
  1787. rdev->desc_nr = choice;
  1788. } else {
  1789. if (find_rdev_nr(mddev, rdev->desc_nr))
  1790. return -EBUSY;
  1791. }
  1792. if (mddev->max_disks && rdev->desc_nr >= mddev->max_disks) {
  1793. printk(KERN_WARNING "md: %s: array is limited to %d devices\n",
  1794. mdname(mddev), mddev->max_disks);
  1795. return -EBUSY;
  1796. }
  1797. bdevname(rdev->bdev,b);
  1798. while ( (s=strchr(b, '/')) != NULL)
  1799. *s = '!';
  1800. rdev->mddev = mddev;
  1801. printk(KERN_INFO "md: bind<%s>\n", b);
  1802. if ((err = kobject_add(&rdev->kobj, &mddev->kobj, "dev-%s", b)))
  1803. goto fail;
  1804. ko = &part_to_dev(rdev->bdev->bd_part)->kobj;
  1805. if (sysfs_create_link(&rdev->kobj, ko, "block"))
  1806. /* failure here is OK */;
  1807. rdev->sysfs_state = sysfs_get_dirent_safe(rdev->kobj.sd, "state");
  1808. list_add_rcu(&rdev->same_set, &mddev->disks);
  1809. bd_link_disk_holder(rdev->bdev, mddev->gendisk);
  1810. /* May as well allow recovery to be retried once */
  1811. mddev->recovery_disabled++;
  1812. return 0;
  1813. fail:
  1814. printk(KERN_WARNING "md: failed to register dev-%s for %s\n",
  1815. b, mdname(mddev));
  1816. return err;
  1817. }
  1818. static void md_delayed_delete(struct work_struct *ws)
  1819. {
  1820. mdk_rdev_t *rdev = container_of(ws, mdk_rdev_t, del_work);
  1821. kobject_del(&rdev->kobj);
  1822. kobject_put(&rdev->kobj);
  1823. }
  1824. static void unbind_rdev_from_array(mdk_rdev_t * rdev)
  1825. {
  1826. char b[BDEVNAME_SIZE];
  1827. if (!rdev->mddev) {
  1828. MD_BUG();
  1829. return;
  1830. }
  1831. bd_unlink_disk_holder(rdev->bdev, rdev->mddev->gendisk);
  1832. list_del_rcu(&rdev->same_set);
  1833. printk(KERN_INFO "md: unbind<%s>\n", bdevname(rdev->bdev,b));
  1834. rdev->mddev = NULL;
  1835. sysfs_remove_link(&rdev->kobj, "block");
  1836. sysfs_put(rdev->sysfs_state);
  1837. rdev->sysfs_state = NULL;
  1838. kfree(rdev->badblocks.page);
  1839. rdev->badblocks.count = 0;
  1840. rdev->badblocks.page = NULL;
  1841. /* We need to delay this, otherwise we can deadlock when
  1842. * writing to 'remove' to "dev/state". We also need
  1843. * to delay it due to rcu usage.
  1844. */
  1845. synchronize_rcu();
  1846. INIT_WORK(&rdev->del_work, md_delayed_delete);
  1847. kobject_get(&rdev->kobj);
  1848. queue_work(md_misc_wq, &rdev->del_work);
  1849. }
  1850. /*
  1851. * prevent the device from being mounted, repartitioned or
  1852. * otherwise reused by a RAID array (or any other kernel
  1853. * subsystem), by bd_claiming the device.
  1854. */
  1855. static int lock_rdev(mdk_rdev_t *rdev, dev_t dev, int shared)
  1856. {
  1857. int err = 0;
  1858. struct block_device *bdev;
  1859. char b[BDEVNAME_SIZE];
  1860. bdev = blkdev_get_by_dev(dev, FMODE_READ|FMODE_WRITE|FMODE_EXCL,
  1861. shared ? (mdk_rdev_t *)lock_rdev : rdev);
  1862. if (IS_ERR(bdev)) {
  1863. printk(KERN_ERR "md: could not open %s.\n",
  1864. __bdevname(dev, b));
  1865. return PTR_ERR(bdev);
  1866. }
  1867. rdev->bdev = bdev;
  1868. return err;
  1869. }
  1870. static void unlock_rdev(mdk_rdev_t *rdev)
  1871. {
  1872. struct block_device *bdev = rdev->bdev;
  1873. rdev->bdev = NULL;
  1874. if (!bdev)
  1875. MD_BUG();
  1876. blkdev_put(bdev, FMODE_READ|FMODE_WRITE|FMODE_EXCL);
  1877. }
  1878. void md_autodetect_dev(dev_t dev);
  1879. static void export_rdev(mdk_rdev_t * rdev)
  1880. {
  1881. char b[BDEVNAME_SIZE];
  1882. printk(KERN_INFO "md: export_rdev(%s)\n",
  1883. bdevname(rdev->bdev,b));
  1884. if (rdev->mddev)
  1885. MD_BUG();
  1886. free_disk_sb(rdev);
  1887. #ifndef MODULE
  1888. if (test_bit(AutoDetected, &rdev->flags))
  1889. md_autodetect_dev(rdev->bdev->bd_dev);
  1890. #endif
  1891. unlock_rdev(rdev);
  1892. kobject_put(&rdev->kobj);
  1893. }
  1894. static void kick_rdev_from_array(mdk_rdev_t * rdev)
  1895. {
  1896. unbind_rdev_from_array(rdev);
  1897. export_rdev(rdev);
  1898. }
  1899. static void export_array(mddev_t *mddev)
  1900. {
  1901. mdk_rdev_t *rdev, *tmp;
  1902. rdev_for_each(rdev, tmp, mddev) {
  1903. if (!rdev->mddev) {
  1904. MD_BUG();
  1905. continue;
  1906. }
  1907. kick_rdev_from_array(rdev);
  1908. }
  1909. if (!list_empty(&mddev->disks))
  1910. MD_BUG();
  1911. mddev->raid_disks = 0;
  1912. mddev->major_version = 0;
  1913. }
  1914. static void print_desc(mdp_disk_t *desc)
  1915. {
  1916. printk(" DISK<N:%d,(%d,%d),R:%d,S:%d>\n", desc->number,
  1917. desc->major,desc->minor,desc->raid_disk,desc->state);
  1918. }
  1919. static void print_sb_90(mdp_super_t *sb)
  1920. {
  1921. int i;
  1922. printk(KERN_INFO
  1923. "md: SB: (V:%d.%d.%d) ID:<%08x.%08x.%08x.%08x> CT:%08x\n",
  1924. sb->major_version, sb->minor_version, sb->patch_version,
  1925. sb->set_uuid0, sb->set_uuid1, sb->set_uuid2, sb->set_uuid3,
  1926. sb->ctime);
  1927. printk(KERN_INFO "md: L%d S%08d ND:%d RD:%d md%d LO:%d CS:%d\n",
  1928. sb->level, sb->size, sb->nr_disks, sb->raid_disks,
  1929. sb->md_minor, sb->layout, sb->chunk_size);
  1930. printk(KERN_INFO "md: UT:%08x ST:%d AD:%d WD:%d"
  1931. " FD:%d SD:%d CSUM:%08x E:%08lx\n",
  1932. sb->utime, sb->state, sb->active_disks, sb->working_disks,
  1933. sb->failed_disks, sb->spare_disks,
  1934. sb->sb_csum, (unsigned long)sb->events_lo);
  1935. printk(KERN_INFO);
  1936. for (i = 0; i < MD_SB_DISKS; i++) {
  1937. mdp_disk_t *desc;
  1938. desc = sb->disks + i;
  1939. if (desc->number || desc->major || desc->minor ||
  1940. desc->raid_disk || (desc->state && (desc->state != 4))) {
  1941. printk(" D %2d: ", i);
  1942. print_desc(desc);
  1943. }
  1944. }
  1945. printk(KERN_INFO "md: THIS: ");
  1946. print_desc(&sb->this_disk);
  1947. }
  1948. static void print_sb_1(struct mdp_superblock_1 *sb)
  1949. {
  1950. __u8 *uuid;
  1951. uuid = sb->set_uuid;
  1952. printk(KERN_INFO
  1953. "md: SB: (V:%u) (F:0x%08x) Array-ID:<%pU>\n"
  1954. "md: Name: \"%s\" CT:%llu\n",
  1955. le32_to_cpu(sb->major_version),
  1956. le32_to_cpu(sb->feature_map),
  1957. uuid,
  1958. sb->set_name,
  1959. (unsigned long long)le64_to_cpu(sb->ctime)
  1960. & MD_SUPERBLOCK_1_TIME_SEC_MASK);
  1961. uuid = sb->device_uuid;
  1962. printk(KERN_INFO
  1963. "md: L%u SZ%llu RD:%u LO:%u CS:%u DO:%llu DS:%llu SO:%llu"
  1964. " RO:%llu\n"
  1965. "md: Dev:%08x UUID: %pU\n"
  1966. "md: (F:0x%08x) UT:%llu Events:%llu ResyncOffset:%llu CSUM:0x%08x\n"
  1967. "md: (MaxDev:%u) \n",
  1968. le32_to_cpu(sb->level),
  1969. (unsigned long long)le64_to_cpu(sb->size),
  1970. le32_to_cpu(sb->raid_disks),
  1971. le32_to_cpu(sb->layout),
  1972. le32_to_cpu(sb->chunksize),
  1973. (unsigned long long)le64_to_cpu(sb->data_offset),
  1974. (unsigned long long)le64_to_cpu(sb->data_size),
  1975. (unsigned long long)le64_to_cpu(sb->super_offset),
  1976. (unsigned long long)le64_to_cpu(sb->recovery_offset),
  1977. le32_to_cpu(sb->dev_number),
  1978. uuid,
  1979. sb->devflags,
  1980. (unsigned long long)le64_to_cpu(sb->utime) & MD_SUPERBLOCK_1_TIME_SEC_MASK,
  1981. (unsigned long long)le64_to_cpu(sb->events),
  1982. (unsigned long long)le64_to_cpu(sb->resync_offset),
  1983. le32_to_cpu(sb->sb_csum),
  1984. le32_to_cpu(sb->max_dev)
  1985. );
  1986. }
  1987. static void print_rdev(mdk_rdev_t *rdev, int major_version)
  1988. {
  1989. char b[BDEVNAME_SIZE];
  1990. printk(KERN_INFO "md: rdev %s, Sect:%08llu F:%d S:%d DN:%u\n",
  1991. bdevname(rdev->bdev, b), (unsigned long long)rdev->sectors,
  1992. test_bit(Faulty, &rdev->flags), test_bit(In_sync, &rdev->flags),
  1993. rdev->desc_nr);
  1994. if (rdev->sb_loaded) {
  1995. printk(KERN_INFO "md: rdev superblock (MJ:%d):\n", major_version);
  1996. switch (major_version) {
  1997. case 0:
  1998. print_sb_90(page_address(rdev->sb_page));
  1999. break;
  2000. case 1:
  2001. print_sb_1(page_address(rdev->sb_page));
  2002. break;
  2003. }
  2004. } else
  2005. printk(KERN_INFO "md: no rdev superblock!\n");
  2006. }
  2007. static void md_print_devices(void)
  2008. {
  2009. struct list_head *tmp;
  2010. mdk_rdev_t *rdev;
  2011. mddev_t *mddev;
  2012. char b[BDEVNAME_SIZE];
  2013. printk("\n");
  2014. printk("md: **********************************\n");
  2015. printk("md: * <COMPLETE RAID STATE PRINTOUT> *\n");
  2016. printk("md: **********************************\n");
  2017. for_each_mddev(mddev, tmp) {
  2018. if (mddev->bitmap)
  2019. bitmap_print_sb(mddev->bitmap);
  2020. else
  2021. printk("%s: ", mdname(mddev));
  2022. list_for_each_entry(rdev, &mddev->disks, same_set)
  2023. printk("<%s>", bdevname(rdev->bdev,b));
  2024. printk("\n");
  2025. list_for_each_entry(rdev, &mddev->disks, same_set)
  2026. print_rdev(rdev, mddev->major_version);
  2027. }
  2028. printk("md: **********************************\n");
  2029. printk("\n");
  2030. }
  2031. static void sync_sbs(mddev_t * mddev, int nospares)
  2032. {
  2033. /* Update each superblock (in-memory image), but
  2034. * if we are allowed to, skip spares which already
  2035. * have the right event counter, or have one earlier
  2036. * (which would mean they aren't being marked as dirty
  2037. * with the rest of the array)
  2038. */
  2039. mdk_rdev_t *rdev;
  2040. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2041. if (rdev->sb_events == mddev->events ||
  2042. (nospares &&
  2043. rdev->raid_disk < 0 &&
  2044. rdev->sb_events+1 == mddev->events)) {
  2045. /* Don't update this superblock */
  2046. rdev->sb_loaded = 2;
  2047. } else {
  2048. sync_super(mddev, rdev);
  2049. rdev->sb_loaded = 1;
  2050. }
  2051. }
  2052. }
  2053. static void md_update_sb(mddev_t * mddev, int force_change)
  2054. {
  2055. mdk_rdev_t *rdev;
  2056. int sync_req;
  2057. int nospares = 0;
  2058. int any_badblocks_changed = 0;
  2059. repeat:
  2060. /* First make sure individual recovery_offsets are correct */
  2061. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2062. if (rdev->raid_disk >= 0 &&
  2063. mddev->delta_disks >= 0 &&
  2064. !test_bit(In_sync, &rdev->flags) &&
  2065. mddev->curr_resync_completed > rdev->recovery_offset)
  2066. rdev->recovery_offset = mddev->curr_resync_completed;
  2067. }
  2068. if (!mddev->persistent) {
  2069. clear_bit(MD_CHANGE_CLEAN, &mddev->flags);
  2070. clear_bit(MD_CHANGE_DEVS, &mddev->flags);
  2071. if (!mddev->external) {
  2072. clear_bit(MD_CHANGE_PENDING, &mddev->flags);
  2073. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2074. if (rdev->badblocks.changed) {
  2075. md_ack_all_badblocks(&rdev->badblocks);
  2076. md_error(mddev, rdev);
  2077. }
  2078. clear_bit(Blocked, &rdev->flags);
  2079. clear_bit(BlockedBadBlocks, &rdev->flags);
  2080. wake_up(&rdev->blocked_wait);
  2081. }
  2082. }
  2083. wake_up(&mddev->sb_wait);
  2084. return;
  2085. }
  2086. spin_lock_irq(&mddev->write_lock);
  2087. mddev->utime = get_seconds();
  2088. if (test_and_clear_bit(MD_CHANGE_DEVS, &mddev->flags))
  2089. force_change = 1;
  2090. if (test_and_clear_bit(MD_CHANGE_CLEAN, &mddev->flags))
  2091. /* just a clean<-> dirty transition, possibly leave spares alone,
  2092. * though if events isn't the right even/odd, we will have to do
  2093. * spares after all
  2094. */
  2095. nospares = 1;
  2096. if (force_change)
  2097. nospares = 0;
  2098. if (mddev->degraded)
  2099. /* If the array is degraded, then skipping spares is both
  2100. * dangerous and fairly pointless.
  2101. * Dangerous because a device that was removed from the array
  2102. * might have a event_count that still looks up-to-date,
  2103. * so it can be re-added without a resync.
  2104. * Pointless because if there are any spares to skip,
  2105. * then a recovery will happen and soon that array won't
  2106. * be degraded any more and the spare can go back to sleep then.
  2107. */
  2108. nospares = 0;
  2109. sync_req = mddev->in_sync;
  2110. /* If this is just a dirty<->clean transition, and the array is clean
  2111. * and 'events' is odd, we can roll back to the previous clean state */
  2112. if (nospares
  2113. && (mddev->in_sync && mddev->recovery_cp == MaxSector)
  2114. && mddev->can_decrease_events
  2115. && mddev->events != 1) {
  2116. mddev->events--;
  2117. mddev->can_decrease_events = 0;
  2118. } else {
  2119. /* otherwise we have to go forward and ... */
  2120. mddev->events ++;
  2121. mddev->can_decrease_events = nospares;
  2122. }
  2123. if (!mddev->events) {
  2124. /*
  2125. * oops, this 64-bit counter should never wrap.
  2126. * Either we are in around ~1 trillion A.C., assuming
  2127. * 1 reboot per second, or we have a bug:
  2128. */
  2129. MD_BUG();
  2130. mddev->events --;
  2131. }
  2132. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2133. if (rdev->badblocks.changed)
  2134. any_badblocks_changed++;
  2135. if (test_bit(Faulty, &rdev->flags))
  2136. set_bit(FaultRecorded, &rdev->flags);
  2137. }
  2138. sync_sbs(mddev, nospares);
  2139. spin_unlock_irq(&mddev->write_lock);
  2140. dprintk(KERN_INFO
  2141. "md: updating %s RAID superblock on device (in sync %d)\n",
  2142. mdname(mddev),mddev->in_sync);
  2143. bitmap_update_sb(mddev->bitmap);
  2144. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2145. char b[BDEVNAME_SIZE];
  2146. dprintk(KERN_INFO "md: ");
  2147. if (rdev->sb_loaded != 1)
  2148. continue; /* no noise on spare devices */
  2149. if (test_bit(Faulty, &rdev->flags))
  2150. dprintk("(skipping faulty ");
  2151. dprintk("%s ", bdevname(rdev->bdev,b));
  2152. if (!test_bit(Faulty, &rdev->flags)) {
  2153. md_super_write(mddev,rdev,
  2154. rdev->sb_start, rdev->sb_size,
  2155. rdev->sb_page);
  2156. dprintk(KERN_INFO "(write) %s's sb offset: %llu\n",
  2157. bdevname(rdev->bdev,b),
  2158. (unsigned long long)rdev->sb_start);
  2159. rdev->sb_events = mddev->events;
  2160. if (rdev->badblocks.size) {
  2161. md_super_write(mddev, rdev,
  2162. rdev->badblocks.sector,
  2163. rdev->badblocks.size << 9,
  2164. rdev->bb_page);
  2165. rdev->badblocks.size = 0;
  2166. }
  2167. } else
  2168. dprintk(")\n");
  2169. if (mddev->level == LEVEL_MULTIPATH)
  2170. /* only need to write one superblock... */
  2171. break;
  2172. }
  2173. md_super_wait(mddev);
  2174. /* if there was a failure, MD_CHANGE_DEVS was set, and we re-write super */
  2175. spin_lock_irq(&mddev->write_lock);
  2176. if (mddev->in_sync != sync_req ||
  2177. test_bit(MD_CHANGE_DEVS, &mddev->flags)) {
  2178. /* have to write it out again */
  2179. spin_unlock_irq(&mddev->write_lock);
  2180. goto repeat;
  2181. }
  2182. clear_bit(MD_CHANGE_PENDING, &mddev->flags);
  2183. spin_unlock_irq(&mddev->write_lock);
  2184. wake_up(&mddev->sb_wait);
  2185. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  2186. sysfs_notify(&mddev->kobj, NULL, "sync_completed");
  2187. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2188. if (test_and_clear_bit(FaultRecorded, &rdev->flags))
  2189. clear_bit(Blocked, &rdev->flags);
  2190. if (any_badblocks_changed)
  2191. md_ack_all_badblocks(&rdev->badblocks);
  2192. clear_bit(BlockedBadBlocks, &rdev->flags);
  2193. wake_up(&rdev->blocked_wait);
  2194. }
  2195. }
  2196. /* words written to sysfs files may, or may not, be \n terminated.
  2197. * We want to accept with case. For this we use cmd_match.
  2198. */
  2199. static int cmd_match(const char *cmd, const char *str)
  2200. {
  2201. /* See if cmd, written into a sysfs file, matches
  2202. * str. They must either be the same, or cmd can
  2203. * have a trailing newline
  2204. */
  2205. while (*cmd && *str && *cmd == *str) {
  2206. cmd++;
  2207. str++;
  2208. }
  2209. if (*cmd == '\n')
  2210. cmd++;
  2211. if (*str || *cmd)
  2212. return 0;
  2213. return 1;
  2214. }
  2215. struct rdev_sysfs_entry {
  2216. struct attribute attr;
  2217. ssize_t (*show)(mdk_rdev_t *, char *);
  2218. ssize_t (*store)(mdk_rdev_t *, const char *, size_t);
  2219. };
  2220. static ssize_t
  2221. state_show(mdk_rdev_t *rdev, char *page)
  2222. {
  2223. char *sep = "";
  2224. size_t len = 0;
  2225. if (test_bit(Faulty, &rdev->flags) ||
  2226. rdev->badblocks.unacked_exist) {
  2227. len+= sprintf(page+len, "%sfaulty",sep);
  2228. sep = ",";
  2229. }
  2230. if (test_bit(In_sync, &rdev->flags)) {
  2231. len += sprintf(page+len, "%sin_sync",sep);
  2232. sep = ",";
  2233. }
  2234. if (test_bit(WriteMostly, &rdev->flags)) {
  2235. len += sprintf(page+len, "%swrite_mostly",sep);
  2236. sep = ",";
  2237. }
  2238. if (test_bit(Blocked, &rdev->flags) ||
  2239. rdev->badblocks.unacked_exist) {
  2240. len += sprintf(page+len, "%sblocked", sep);
  2241. sep = ",";
  2242. }
  2243. if (!test_bit(Faulty, &rdev->flags) &&
  2244. !test_bit(In_sync, &rdev->flags)) {
  2245. len += sprintf(page+len, "%sspare", sep);
  2246. sep = ",";
  2247. }
  2248. if (test_bit(WriteErrorSeen, &rdev->flags)) {
  2249. len += sprintf(page+len, "%swrite_error", sep);
  2250. sep = ",";
  2251. }
  2252. return len+sprintf(page+len, "\n");
  2253. }
  2254. static ssize_t
  2255. state_store(mdk_rdev_t *rdev, const char *buf, size_t len)
  2256. {
  2257. /* can write
  2258. * faulty - simulates an error
  2259. * remove - disconnects the device
  2260. * writemostly - sets write_mostly
  2261. * -writemostly - clears write_mostly
  2262. * blocked - sets the Blocked flags
  2263. * -blocked - clears the Blocked and possibly simulates an error
  2264. * insync - sets Insync providing device isn't active
  2265. * write_error - sets WriteErrorSeen
  2266. * -write_error - clears WriteErrorSeen
  2267. */
  2268. int err = -EINVAL;
  2269. if (cmd_match(buf, "faulty") && rdev->mddev->pers) {
  2270. md_error(rdev->mddev, rdev);
  2271. if (test_bit(Faulty, &rdev->flags))
  2272. err = 0;
  2273. else
  2274. err = -EBUSY;
  2275. } else if (cmd_match(buf, "remove")) {
  2276. if (rdev->raid_disk >= 0)
  2277. err = -EBUSY;
  2278. else {
  2279. mddev_t *mddev = rdev->mddev;
  2280. kick_rdev_from_array(rdev);
  2281. if (mddev->pers)
  2282. md_update_sb(mddev, 1);
  2283. md_new_event(mddev);
  2284. err = 0;
  2285. }
  2286. } else if (cmd_match(buf, "writemostly")) {
  2287. set_bit(WriteMostly, &rdev->flags);
  2288. err = 0;
  2289. } else if (cmd_match(buf, "-writemostly")) {
  2290. clear_bit(WriteMostly, &rdev->flags);
  2291. err = 0;
  2292. } else if (cmd_match(buf, "blocked")) {
  2293. set_bit(Blocked, &rdev->flags);
  2294. err = 0;
  2295. } else if (cmd_match(buf, "-blocked")) {
  2296. if (!test_bit(Faulty, &rdev->flags) &&
  2297. rdev->badblocks.unacked_exist) {
  2298. /* metadata handler doesn't understand badblocks,
  2299. * so we need to fail the device
  2300. */
  2301. md_error(rdev->mddev, rdev);
  2302. }
  2303. clear_bit(Blocked, &rdev->flags);
  2304. clear_bit(BlockedBadBlocks, &rdev->flags);
  2305. wake_up(&rdev->blocked_wait);
  2306. set_bit(MD_RECOVERY_NEEDED, &rdev->mddev->recovery);
  2307. md_wakeup_thread(rdev->mddev->thread);
  2308. err = 0;
  2309. } else if (cmd_match(buf, "insync") && rdev->raid_disk == -1) {
  2310. set_bit(In_sync, &rdev->flags);
  2311. err = 0;
  2312. } else if (cmd_match(buf, "write_error")) {
  2313. set_bit(WriteErrorSeen, &rdev->flags);
  2314. err = 0;
  2315. } else if (cmd_match(buf, "-write_error")) {
  2316. clear_bit(WriteErrorSeen, &rdev->flags);
  2317. err = 0;
  2318. }
  2319. if (!err)
  2320. sysfs_notify_dirent_safe(rdev->sysfs_state);
  2321. return err ? err : len;
  2322. }
  2323. static struct rdev_sysfs_entry rdev_state =
  2324. __ATTR(state, S_IRUGO|S_IWUSR, state_show, state_store);
  2325. static ssize_t
  2326. errors_show(mdk_rdev_t *rdev, char *page)
  2327. {
  2328. return sprintf(page, "%d\n", atomic_read(&rdev->corrected_errors));
  2329. }
  2330. static ssize_t
  2331. errors_store(mdk_rdev_t *rdev, const char *buf, size_t len)
  2332. {
  2333. char *e;
  2334. unsigned long n = simple_strtoul(buf, &e, 10);
  2335. if (*buf && (*e == 0 || *e == '\n')) {
  2336. atomic_set(&rdev->corrected_errors, n);
  2337. return len;
  2338. }
  2339. return -EINVAL;
  2340. }
  2341. static struct rdev_sysfs_entry rdev_errors =
  2342. __ATTR(errors, S_IRUGO|S_IWUSR, errors_show, errors_store);
  2343. static ssize_t
  2344. slot_show(mdk_rdev_t *rdev, char *page)
  2345. {
  2346. if (rdev->raid_disk < 0)
  2347. return sprintf(page, "none\n");
  2348. else
  2349. return sprintf(page, "%d\n", rdev->raid_disk);
  2350. }
  2351. static ssize_t
  2352. slot_store(mdk_rdev_t *rdev, const char *buf, size_t len)
  2353. {
  2354. char *e;
  2355. int err;
  2356. int slot = simple_strtoul(buf, &e, 10);
  2357. if (strncmp(buf, "none", 4)==0)
  2358. slot = -1;
  2359. else if (e==buf || (*e && *e!= '\n'))
  2360. return -EINVAL;
  2361. if (rdev->mddev->pers && slot == -1) {
  2362. /* Setting 'slot' on an active array requires also
  2363. * updating the 'rd%d' link, and communicating
  2364. * with the personality with ->hot_*_disk.
  2365. * For now we only support removing
  2366. * failed/spare devices. This normally happens automatically,
  2367. * but not when the metadata is externally managed.
  2368. */
  2369. if (rdev->raid_disk == -1)
  2370. return -EEXIST;
  2371. /* personality does all needed checks */
  2372. if (rdev->mddev->pers->hot_remove_disk == NULL)
  2373. return -EINVAL;
  2374. err = rdev->mddev->pers->
  2375. hot_remove_disk(rdev->mddev, rdev->raid_disk);
  2376. if (err)
  2377. return err;
  2378. sysfs_unlink_rdev(rdev->mddev, rdev);
  2379. rdev->raid_disk = -1;
  2380. set_bit(MD_RECOVERY_NEEDED, &rdev->mddev->recovery);
  2381. md_wakeup_thread(rdev->mddev->thread);
  2382. } else if (rdev->mddev->pers) {
  2383. mdk_rdev_t *rdev2;
  2384. /* Activating a spare .. or possibly reactivating
  2385. * if we ever get bitmaps working here.
  2386. */
  2387. if (rdev->raid_disk != -1)
  2388. return -EBUSY;
  2389. if (test_bit(MD_RECOVERY_RUNNING, &rdev->mddev->recovery))
  2390. return -EBUSY;
  2391. if (rdev->mddev->pers->hot_add_disk == NULL)
  2392. return -EINVAL;
  2393. list_for_each_entry(rdev2, &rdev->mddev->disks, same_set)
  2394. if (rdev2->raid_disk == slot)
  2395. return -EEXIST;
  2396. if (slot >= rdev->mddev->raid_disks &&
  2397. slot >= rdev->mddev->raid_disks + rdev->mddev->delta_disks)
  2398. return -ENOSPC;
  2399. rdev->raid_disk = slot;
  2400. if (test_bit(In_sync, &rdev->flags))
  2401. rdev->saved_raid_disk = slot;
  2402. else
  2403. rdev->saved_raid_disk = -1;
  2404. err = rdev->mddev->pers->
  2405. hot_add_disk(rdev->mddev, rdev);
  2406. if (err) {
  2407. rdev->raid_disk = -1;
  2408. return err;
  2409. } else
  2410. sysfs_notify_dirent_safe(rdev->sysfs_state);
  2411. if (sysfs_link_rdev(rdev->mddev, rdev))
  2412. /* failure here is OK */;
  2413. /* don't wakeup anyone, leave that to userspace. */
  2414. } else {
  2415. if (slot >= rdev->mddev->raid_disks &&
  2416. slot >= rdev->mddev->raid_disks + rdev->mddev->delta_disks)
  2417. return -ENOSPC;
  2418. rdev->raid_disk = slot;
  2419. /* assume it is working */
  2420. clear_bit(Faulty, &rdev->flags);
  2421. clear_bit(WriteMostly, &rdev->flags);
  2422. set_bit(In_sync, &rdev->flags);
  2423. sysfs_notify_dirent_safe(rdev->sysfs_state);
  2424. }
  2425. return len;
  2426. }
  2427. static struct rdev_sysfs_entry rdev_slot =
  2428. __ATTR(slot, S_IRUGO|S_IWUSR, slot_show, slot_store);
  2429. static ssize_t
  2430. offset_show(mdk_rdev_t *rdev, char *page)
  2431. {
  2432. return sprintf(page, "%llu\n", (unsigned long long)rdev->data_offset);
  2433. }
  2434. static ssize_t
  2435. offset_store(mdk_rdev_t *rdev, const char *buf, size_t len)
  2436. {
  2437. char *e;
  2438. unsigned long long offset = simple_strtoull(buf, &e, 10);
  2439. if (e==buf || (*e && *e != '\n'))
  2440. return -EINVAL;
  2441. if (rdev->mddev->pers && rdev->raid_disk >= 0)
  2442. return -EBUSY;
  2443. if (rdev->sectors && rdev->mddev->external)
  2444. /* Must set offset before size, so overlap checks
  2445. * can be sane */
  2446. return -EBUSY;
  2447. rdev->data_offset = offset;
  2448. return len;
  2449. }
  2450. static struct rdev_sysfs_entry rdev_offset =
  2451. __ATTR(offset, S_IRUGO|S_IWUSR, offset_show, offset_store);
  2452. static ssize_t
  2453. rdev_size_show(mdk_rdev_t *rdev, char *page)
  2454. {
  2455. return sprintf(page, "%llu\n", (unsigned long long)rdev->sectors / 2);
  2456. }
  2457. static int overlaps(sector_t s1, sector_t l1, sector_t s2, sector_t l2)
  2458. {
  2459. /* check if two start/length pairs overlap */
  2460. if (s1+l1 <= s2)
  2461. return 0;
  2462. if (s2+l2 <= s1)
  2463. return 0;
  2464. return 1;
  2465. }
  2466. static int strict_blocks_to_sectors(const char *buf, sector_t *sectors)
  2467. {
  2468. unsigned long long blocks;
  2469. sector_t new;
  2470. if (strict_strtoull(buf, 10, &blocks) < 0)
  2471. return -EINVAL;
  2472. if (blocks & 1ULL << (8 * sizeof(blocks) - 1))
  2473. return -EINVAL; /* sector conversion overflow */
  2474. new = blocks * 2;
  2475. if (new != blocks * 2)
  2476. return -EINVAL; /* unsigned long long to sector_t overflow */
  2477. *sectors = new;
  2478. return 0;
  2479. }
  2480. static ssize_t
  2481. rdev_size_store(mdk_rdev_t *rdev, const char *buf, size_t len)
  2482. {
  2483. mddev_t *my_mddev = rdev->mddev;
  2484. sector_t oldsectors = rdev->sectors;
  2485. sector_t sectors;
  2486. if (strict_blocks_to_sectors(buf, &sectors) < 0)
  2487. return -EINVAL;
  2488. if (my_mddev->pers && rdev->raid_disk >= 0) {
  2489. if (my_mddev->persistent) {
  2490. sectors = super_types[my_mddev->major_version].
  2491. rdev_size_change(rdev, sectors);
  2492. if (!sectors)
  2493. return -EBUSY;
  2494. } else if (!sectors)
  2495. sectors = (i_size_read(rdev->bdev->bd_inode) >> 9) -
  2496. rdev->data_offset;
  2497. }
  2498. if (sectors < my_mddev->dev_sectors)
  2499. return -EINVAL; /* component must fit device */
  2500. rdev->sectors = sectors;
  2501. if (sectors > oldsectors && my_mddev->external) {
  2502. /* need to check that all other rdevs with the same ->bdev
  2503. * do not overlap. We need to unlock the mddev to avoid
  2504. * a deadlock. We have already changed rdev->sectors, and if
  2505. * we have to change it back, we will have the lock again.
  2506. */
  2507. mddev_t *mddev;
  2508. int overlap = 0;
  2509. struct list_head *tmp;
  2510. mddev_unlock(my_mddev);
  2511. for_each_mddev(mddev, tmp) {
  2512. mdk_rdev_t *rdev2;
  2513. mddev_lock(mddev);
  2514. list_for_each_entry(rdev2, &mddev->disks, same_set)
  2515. if (rdev->bdev == rdev2->bdev &&
  2516. rdev != rdev2 &&
  2517. overlaps(rdev->data_offset, rdev->sectors,
  2518. rdev2->data_offset,
  2519. rdev2->sectors)) {
  2520. overlap = 1;
  2521. break;
  2522. }
  2523. mddev_unlock(mddev);
  2524. if (overlap) {
  2525. mddev_put(mddev);
  2526. break;
  2527. }
  2528. }
  2529. mddev_lock(my_mddev);
  2530. if (overlap) {
  2531. /* Someone else could have slipped in a size
  2532. * change here, but doing so is just silly.
  2533. * We put oldsectors back because we *know* it is
  2534. * safe, and trust userspace not to race with
  2535. * itself
  2536. */
  2537. rdev->sectors = oldsectors;
  2538. return -EBUSY;
  2539. }
  2540. }
  2541. return len;
  2542. }
  2543. static struct rdev_sysfs_entry rdev_size =
  2544. __ATTR(size, S_IRUGO|S_IWUSR, rdev_size_show, rdev_size_store);
  2545. static ssize_t recovery_start_show(mdk_rdev_t *rdev, char *page)
  2546. {
  2547. unsigned long long recovery_start = rdev->recovery_offset;
  2548. if (test_bit(In_sync, &rdev->flags) ||
  2549. recovery_start == MaxSector)
  2550. return sprintf(page, "none\n");
  2551. return sprintf(page, "%llu\n", recovery_start);
  2552. }
  2553. static ssize_t recovery_start_store(mdk_rdev_t *rdev, const char *buf, size_t len)
  2554. {
  2555. unsigned long long recovery_start;
  2556. if (cmd_match(buf, "none"))
  2557. recovery_start = MaxSector;
  2558. else if (strict_strtoull(buf, 10, &recovery_start))
  2559. return -EINVAL;
  2560. if (rdev->mddev->pers &&
  2561. rdev->raid_disk >= 0)
  2562. return -EBUSY;
  2563. rdev->recovery_offset = recovery_start;
  2564. if (recovery_start == MaxSector)
  2565. set_bit(In_sync, &rdev->flags);
  2566. else
  2567. clear_bit(In_sync, &rdev->flags);
  2568. return len;
  2569. }
  2570. static struct rdev_sysfs_entry rdev_recovery_start =
  2571. __ATTR(recovery_start, S_IRUGO|S_IWUSR, recovery_start_show, recovery_start_store);
  2572. static ssize_t
  2573. badblocks_show(struct badblocks *bb, char *page, int unack);
  2574. static ssize_t
  2575. badblocks_store(struct badblocks *bb, const char *page, size_t len, int unack);
  2576. static ssize_t bb_show(mdk_rdev_t *rdev, char *page)
  2577. {
  2578. return badblocks_show(&rdev->badblocks, page, 0);
  2579. }
  2580. static ssize_t bb_store(mdk_rdev_t *rdev, const char *page, size_t len)
  2581. {
  2582. int rv = badblocks_store(&rdev->badblocks, page, len, 0);
  2583. /* Maybe that ack was all we needed */
  2584. if (test_and_clear_bit(BlockedBadBlocks, &rdev->flags))
  2585. wake_up(&rdev->blocked_wait);
  2586. return rv;
  2587. }
  2588. static struct rdev_sysfs_entry rdev_bad_blocks =
  2589. __ATTR(bad_blocks, S_IRUGO|S_IWUSR, bb_show, bb_store);
  2590. static ssize_t ubb_show(mdk_rdev_t *rdev, char *page)
  2591. {
  2592. return badblocks_show(&rdev->badblocks, page, 1);
  2593. }
  2594. static ssize_t ubb_store(mdk_rdev_t *rdev, const char *page, size_t len)
  2595. {
  2596. return badblocks_store(&rdev->badblocks, page, len, 1);
  2597. }
  2598. static struct rdev_sysfs_entry rdev_unack_bad_blocks =
  2599. __ATTR(unacknowledged_bad_blocks, S_IRUGO|S_IWUSR, ubb_show, ubb_store);
  2600. static struct attribute *rdev_default_attrs[] = {
  2601. &rdev_state.attr,
  2602. &rdev_errors.attr,
  2603. &rdev_slot.attr,
  2604. &rdev_offset.attr,
  2605. &rdev_size.attr,
  2606. &rdev_recovery_start.attr,
  2607. &rdev_bad_blocks.attr,
  2608. &rdev_unack_bad_blocks.attr,
  2609. NULL,
  2610. };
  2611. static ssize_t
  2612. rdev_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  2613. {
  2614. struct rdev_sysfs_entry *entry = container_of(attr, struct rdev_sysfs_entry, attr);
  2615. mdk_rdev_t *rdev = container_of(kobj, mdk_rdev_t, kobj);
  2616. mddev_t *mddev = rdev->mddev;
  2617. ssize_t rv;
  2618. if (!entry->show)
  2619. return -EIO;
  2620. rv = mddev ? mddev_lock(mddev) : -EBUSY;
  2621. if (!rv) {
  2622. if (rdev->mddev == NULL)
  2623. rv = -EBUSY;
  2624. else
  2625. rv = entry->show(rdev, page);
  2626. mddev_unlock(mddev);
  2627. }
  2628. return rv;
  2629. }
  2630. static ssize_t
  2631. rdev_attr_store(struct kobject *kobj, struct attribute *attr,
  2632. const char *page, size_t length)
  2633. {
  2634. struct rdev_sysfs_entry *entry = container_of(attr, struct rdev_sysfs_entry, attr);
  2635. mdk_rdev_t *rdev = container_of(kobj, mdk_rdev_t, kobj);
  2636. ssize_t rv;
  2637. mddev_t *mddev = rdev->mddev;
  2638. if (!entry->store)
  2639. return -EIO;
  2640. if (!capable(CAP_SYS_ADMIN))
  2641. return -EACCES;
  2642. rv = mddev ? mddev_lock(mddev): -EBUSY;
  2643. if (!rv) {
  2644. if (rdev->mddev == NULL)
  2645. rv = -EBUSY;
  2646. else
  2647. rv = entry->store(rdev, page, length);
  2648. mddev_unlock(mddev);
  2649. }
  2650. return rv;
  2651. }
  2652. static void rdev_free(struct kobject *ko)
  2653. {
  2654. mdk_rdev_t *rdev = container_of(ko, mdk_rdev_t, kobj);
  2655. kfree(rdev);
  2656. }
  2657. static const struct sysfs_ops rdev_sysfs_ops = {
  2658. .show = rdev_attr_show,
  2659. .store = rdev_attr_store,
  2660. };
  2661. static struct kobj_type rdev_ktype = {
  2662. .release = rdev_free,
  2663. .sysfs_ops = &rdev_sysfs_ops,
  2664. .default_attrs = rdev_default_attrs,
  2665. };
  2666. int md_rdev_init(mdk_rdev_t *rdev)
  2667. {
  2668. rdev->desc_nr = -1;
  2669. rdev->saved_raid_disk = -1;
  2670. rdev->raid_disk = -1;
  2671. rdev->flags = 0;
  2672. rdev->data_offset = 0;
  2673. rdev->sb_events = 0;
  2674. rdev->last_read_error.tv_sec = 0;
  2675. rdev->last_read_error.tv_nsec = 0;
  2676. rdev->sb_loaded = 0;
  2677. rdev->bb_page = NULL;
  2678. atomic_set(&rdev->nr_pending, 0);
  2679. atomic_set(&rdev->read_errors, 0);
  2680. atomic_set(&rdev->corrected_errors, 0);
  2681. INIT_LIST_HEAD(&rdev->same_set);
  2682. init_waitqueue_head(&rdev->blocked_wait);
  2683. /* Add space to store bad block list.
  2684. * This reserves the space even on arrays where it cannot
  2685. * be used - I wonder if that matters
  2686. */
  2687. rdev->badblocks.count = 0;
  2688. rdev->badblocks.shift = 0;
  2689. rdev->badblocks.page = kmalloc(PAGE_SIZE, GFP_KERNEL);
  2690. seqlock_init(&rdev->badblocks.lock);
  2691. if (rdev->badblocks.page == NULL)
  2692. return -ENOMEM;
  2693. return 0;
  2694. }
  2695. EXPORT_SYMBOL_GPL(md_rdev_init);
  2696. /*
  2697. * Import a device. If 'super_format' >= 0, then sanity check the superblock
  2698. *
  2699. * mark the device faulty if:
  2700. *
  2701. * - the device is nonexistent (zero size)
  2702. * - the device has no valid superblock
  2703. *
  2704. * a faulty rdev _never_ has rdev->sb set.
  2705. */
  2706. static mdk_rdev_t *md_import_device(dev_t newdev, int super_format, int super_minor)
  2707. {
  2708. char b[BDEVNAME_SIZE];
  2709. int err;
  2710. mdk_rdev_t *rdev;
  2711. sector_t size;
  2712. rdev = kzalloc(sizeof(*rdev), GFP_KERNEL);
  2713. if (!rdev) {
  2714. printk(KERN_ERR "md: could not alloc mem for new device!\n");
  2715. return ERR_PTR(-ENOMEM);
  2716. }
  2717. err = md_rdev_init(rdev);
  2718. if (err)
  2719. goto abort_free;
  2720. err = alloc_disk_sb(rdev);
  2721. if (err)
  2722. goto abort_free;
  2723. err = lock_rdev(rdev, newdev, super_format == -2);
  2724. if (err)
  2725. goto abort_free;
  2726. kobject_init(&rdev->kobj, &rdev_ktype);
  2727. size = i_size_read(rdev->bdev->bd_inode) >> BLOCK_SIZE_BITS;
  2728. if (!size) {
  2729. printk(KERN_WARNING
  2730. "md: %s has zero or unknown size, marking faulty!\n",
  2731. bdevname(rdev->bdev,b));
  2732. err = -EINVAL;
  2733. goto abort_free;
  2734. }
  2735. if (super_format >= 0) {
  2736. err = super_types[super_format].
  2737. load_super(rdev, NULL, super_minor);
  2738. if (err == -EINVAL) {
  2739. printk(KERN_WARNING
  2740. "md: %s does not have a valid v%d.%d "
  2741. "superblock, not importing!\n",
  2742. bdevname(rdev->bdev,b),
  2743. super_format, super_minor);
  2744. goto abort_free;
  2745. }
  2746. if (err < 0) {
  2747. printk(KERN_WARNING
  2748. "md: could not read %s's sb, not importing!\n",
  2749. bdevname(rdev->bdev,b));
  2750. goto abort_free;
  2751. }
  2752. }
  2753. if (super_format == -1)
  2754. /* hot-add for 0.90, or non-persistent: so no badblocks */
  2755. rdev->badblocks.shift = -1;
  2756. return rdev;
  2757. abort_free:
  2758. if (rdev->bdev)
  2759. unlock_rdev(rdev);
  2760. free_disk_sb(rdev);
  2761. kfree(rdev->badblocks.page);
  2762. kfree(rdev);
  2763. return ERR_PTR(err);
  2764. }
  2765. /*
  2766. * Check a full RAID array for plausibility
  2767. */
  2768. static void analyze_sbs(mddev_t * mddev)
  2769. {
  2770. int i;
  2771. mdk_rdev_t *rdev, *freshest, *tmp;
  2772. char b[BDEVNAME_SIZE];
  2773. freshest = NULL;
  2774. rdev_for_each(rdev, tmp, mddev)
  2775. switch (super_types[mddev->major_version].
  2776. load_super(rdev, freshest, mddev->minor_version)) {
  2777. case 1:
  2778. freshest = rdev;
  2779. break;
  2780. case 0:
  2781. break;
  2782. default:
  2783. printk( KERN_ERR \
  2784. "md: fatal superblock inconsistency in %s"
  2785. " -- removing from array\n",
  2786. bdevname(rdev->bdev,b));
  2787. kick_rdev_from_array(rdev);
  2788. }
  2789. super_types[mddev->major_version].
  2790. validate_super(mddev, freshest);
  2791. i = 0;
  2792. rdev_for_each(rdev, tmp, mddev) {
  2793. if (mddev->max_disks &&
  2794. (rdev->desc_nr >= mddev->max_disks ||
  2795. i > mddev->max_disks)) {
  2796. printk(KERN_WARNING
  2797. "md: %s: %s: only %d devices permitted\n",
  2798. mdname(mddev), bdevname(rdev->bdev, b),
  2799. mddev->max_disks);
  2800. kick_rdev_from_array(rdev);
  2801. continue;
  2802. }
  2803. if (rdev != freshest)
  2804. if (super_types[mddev->major_version].
  2805. validate_super(mddev, rdev)) {
  2806. printk(KERN_WARNING "md: kicking non-fresh %s"
  2807. " from array!\n",
  2808. bdevname(rdev->bdev,b));
  2809. kick_rdev_from_array(rdev);
  2810. continue;
  2811. }
  2812. if (mddev->level == LEVEL_MULTIPATH) {
  2813. rdev->desc_nr = i++;
  2814. rdev->raid_disk = rdev->desc_nr;
  2815. set_bit(In_sync, &rdev->flags);
  2816. } else if (rdev->raid_disk >= (mddev->raid_disks - min(0, mddev->delta_disks))) {
  2817. rdev->raid_disk = -1;
  2818. clear_bit(In_sync, &rdev->flags);
  2819. }
  2820. }
  2821. }
  2822. /* Read a fixed-point number.
  2823. * Numbers in sysfs attributes should be in "standard" units where
  2824. * possible, so time should be in seconds.
  2825. * However we internally use a a much smaller unit such as
  2826. * milliseconds or jiffies.
  2827. * This function takes a decimal number with a possible fractional
  2828. * component, and produces an integer which is the result of
  2829. * multiplying that number by 10^'scale'.
  2830. * all without any floating-point arithmetic.
  2831. */
  2832. int strict_strtoul_scaled(const char *cp, unsigned long *res, int scale)
  2833. {
  2834. unsigned long result = 0;
  2835. long decimals = -1;
  2836. while (isdigit(*cp) || (*cp == '.' && decimals < 0)) {
  2837. if (*cp == '.')
  2838. decimals = 0;
  2839. else if (decimals < scale) {
  2840. unsigned int value;
  2841. value = *cp - '0';
  2842. result = result * 10 + value;
  2843. if (decimals >= 0)
  2844. decimals++;
  2845. }
  2846. cp++;
  2847. }
  2848. if (*cp == '\n')
  2849. cp++;
  2850. if (*cp)
  2851. return -EINVAL;
  2852. if (decimals < 0)
  2853. decimals = 0;
  2854. while (decimals < scale) {
  2855. result *= 10;
  2856. decimals ++;
  2857. }
  2858. *res = result;
  2859. return 0;
  2860. }
  2861. static void md_safemode_timeout(unsigned long data);
  2862. static ssize_t
  2863. safe_delay_show(mddev_t *mddev, char *page)
  2864. {
  2865. int msec = (mddev->safemode_delay*1000)/HZ;
  2866. return sprintf(page, "%d.%03d\n", msec/1000, msec%1000);
  2867. }
  2868. static ssize_t
  2869. safe_delay_store(mddev_t *mddev, const char *cbuf, size_t len)
  2870. {
  2871. unsigned long msec;
  2872. if (strict_strtoul_scaled(cbuf, &msec, 3) < 0)
  2873. return -EINVAL;
  2874. if (msec == 0)
  2875. mddev->safemode_delay = 0;
  2876. else {
  2877. unsigned long old_delay = mddev->safemode_delay;
  2878. mddev->safemode_delay = (msec*HZ)/1000;
  2879. if (mddev->safemode_delay == 0)
  2880. mddev->safemode_delay = 1;
  2881. if (mddev->safemode_delay < old_delay)
  2882. md_safemode_timeout((unsigned long)mddev);
  2883. }
  2884. return len;
  2885. }
  2886. static struct md_sysfs_entry md_safe_delay =
  2887. __ATTR(safe_mode_delay, S_IRUGO|S_IWUSR,safe_delay_show, safe_delay_store);
  2888. static ssize_t
  2889. level_show(mddev_t *mddev, char *page)
  2890. {
  2891. struct mdk_personality *p = mddev->pers;
  2892. if (p)
  2893. return sprintf(page, "%s\n", p->name);
  2894. else if (mddev->clevel[0])
  2895. return sprintf(page, "%s\n", mddev->clevel);
  2896. else if (mddev->level != LEVEL_NONE)
  2897. return sprintf(page, "%d\n", mddev->level);
  2898. else
  2899. return 0;
  2900. }
  2901. static ssize_t
  2902. level_store(mddev_t *mddev, const char *buf, size_t len)
  2903. {
  2904. char clevel[16];
  2905. ssize_t rv = len;
  2906. struct mdk_personality *pers;
  2907. long level;
  2908. void *priv;
  2909. mdk_rdev_t *rdev;
  2910. if (mddev->pers == NULL) {
  2911. if (len == 0)
  2912. return 0;
  2913. if (len >= sizeof(mddev->clevel))
  2914. return -ENOSPC;
  2915. strncpy(mddev->clevel, buf, len);
  2916. if (mddev->clevel[len-1] == '\n')
  2917. len--;
  2918. mddev->clevel[len] = 0;
  2919. mddev->level = LEVEL_NONE;
  2920. return rv;
  2921. }
  2922. /* request to change the personality. Need to ensure:
  2923. * - array is not engaged in resync/recovery/reshape
  2924. * - old personality can be suspended
  2925. * - new personality will access other array.
  2926. */
  2927. if (mddev->sync_thread ||
  2928. mddev->reshape_position != MaxSector ||
  2929. mddev->sysfs_active)
  2930. return -EBUSY;
  2931. if (!mddev->pers->quiesce) {
  2932. printk(KERN_WARNING "md: %s: %s does not support online personality change\n",
  2933. mdname(mddev), mddev->pers->name);
  2934. return -EINVAL;
  2935. }
  2936. /* Now find the new personality */
  2937. if (len == 0 || len >= sizeof(clevel))
  2938. return -EINVAL;
  2939. strncpy(clevel, buf, len);
  2940. if (clevel[len-1] == '\n')
  2941. len--;
  2942. clevel[len] = 0;
  2943. if (strict_strtol(clevel, 10, &level))
  2944. level = LEVEL_NONE;
  2945. if (request_module("md-%s", clevel) != 0)
  2946. request_module("md-level-%s", clevel);
  2947. spin_lock(&pers_lock);
  2948. pers = find_pers(level, clevel);
  2949. if (!pers || !try_module_get(pers->owner)) {
  2950. spin_unlock(&pers_lock);
  2951. printk(KERN_WARNING "md: personality %s not loaded\n", clevel);
  2952. return -EINVAL;
  2953. }
  2954. spin_unlock(&pers_lock);
  2955. if (pers == mddev->pers) {
  2956. /* Nothing to do! */
  2957. module_put(pers->owner);
  2958. return rv;
  2959. }
  2960. if (!pers->takeover) {
  2961. module_put(pers->owner);
  2962. printk(KERN_WARNING "md: %s: %s does not support personality takeover\n",
  2963. mdname(mddev), clevel);
  2964. return -EINVAL;
  2965. }
  2966. list_for_each_entry(rdev, &mddev->disks, same_set)
  2967. rdev->new_raid_disk = rdev->raid_disk;
  2968. /* ->takeover must set new_* and/or delta_disks
  2969. * if it succeeds, and may set them when it fails.
  2970. */
  2971. priv = pers->takeover(mddev);
  2972. if (IS_ERR(priv)) {
  2973. mddev->new_level = mddev->level;
  2974. mddev->new_layout = mddev->layout;
  2975. mddev->new_chunk_sectors = mddev->chunk_sectors;
  2976. mddev->raid_disks -= mddev->delta_disks;
  2977. mddev->delta_disks = 0;
  2978. module_put(pers->owner);
  2979. printk(KERN_WARNING "md: %s: %s would not accept array\n",
  2980. mdname(mddev), clevel);
  2981. return PTR_ERR(priv);
  2982. }
  2983. /* Looks like we have a winner */
  2984. mddev_suspend(mddev);
  2985. mddev->pers->stop(mddev);
  2986. if (mddev->pers->sync_request == NULL &&
  2987. pers->sync_request != NULL) {
  2988. /* need to add the md_redundancy_group */
  2989. if (sysfs_create_group(&mddev->kobj, &md_redundancy_group))
  2990. printk(KERN_WARNING
  2991. "md: cannot register extra attributes for %s\n",
  2992. mdname(mddev));
  2993. mddev->sysfs_action = sysfs_get_dirent(mddev->kobj.sd, NULL, "sync_action");
  2994. }
  2995. if (mddev->pers->sync_request != NULL &&
  2996. pers->sync_request == NULL) {
  2997. /* need to remove the md_redundancy_group */
  2998. if (mddev->to_remove == NULL)
  2999. mddev->to_remove = &md_redundancy_group;
  3000. }
  3001. if (mddev->pers->sync_request == NULL &&
  3002. mddev->external) {
  3003. /* We are converting from a no-redundancy array
  3004. * to a redundancy array and metadata is managed
  3005. * externally so we need to be sure that writes
  3006. * won't block due to a need to transition
  3007. * clean->dirty
  3008. * until external management is started.
  3009. */
  3010. mddev->in_sync = 0;
  3011. mddev->safemode_delay = 0;
  3012. mddev->safemode = 0;
  3013. }
  3014. list_for_each_entry(rdev, &mddev->disks, same_set) {
  3015. if (rdev->raid_disk < 0)
  3016. continue;
  3017. if (rdev->new_raid_disk >= mddev->raid_disks)
  3018. rdev->new_raid_disk = -1;
  3019. if (rdev->new_raid_disk == rdev->raid_disk)
  3020. continue;
  3021. sysfs_unlink_rdev(mddev, rdev);
  3022. }
  3023. list_for_each_entry(rdev, &mddev->disks, same_set) {
  3024. if (rdev->raid_disk < 0)
  3025. continue;
  3026. if (rdev->new_raid_disk == rdev->raid_disk)
  3027. continue;
  3028. rdev->raid_disk = rdev->new_raid_disk;
  3029. if (rdev->raid_disk < 0)
  3030. clear_bit(In_sync, &rdev->flags);
  3031. else {
  3032. if (sysfs_link_rdev(mddev, rdev))
  3033. printk(KERN_WARNING "md: cannot register rd%d"
  3034. " for %s after level change\n",
  3035. rdev->raid_disk, mdname(mddev));
  3036. }
  3037. }
  3038. module_put(mddev->pers->owner);
  3039. mddev->pers = pers;
  3040. mddev->private = priv;
  3041. strlcpy(mddev->clevel, pers->name, sizeof(mddev->clevel));
  3042. mddev->level = mddev->new_level;
  3043. mddev->layout = mddev->new_layout;
  3044. mddev->chunk_sectors = mddev->new_chunk_sectors;
  3045. mddev->delta_disks = 0;
  3046. mddev->degraded = 0;
  3047. if (mddev->pers->sync_request == NULL) {
  3048. /* this is now an array without redundancy, so
  3049. * it must always be in_sync
  3050. */
  3051. mddev->in_sync = 1;
  3052. del_timer_sync(&mddev->safemode_timer);
  3053. }
  3054. pers->run(mddev);
  3055. mddev_resume(mddev);
  3056. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  3057. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3058. md_wakeup_thread(mddev->thread);
  3059. sysfs_notify(&mddev->kobj, NULL, "level");
  3060. md_new_event(mddev);
  3061. return rv;
  3062. }
  3063. static struct md_sysfs_entry md_level =
  3064. __ATTR(level, S_IRUGO|S_IWUSR, level_show, level_store);
  3065. static ssize_t
  3066. layout_show(mddev_t *mddev, char *page)
  3067. {
  3068. /* just a number, not meaningful for all levels */
  3069. if (mddev->reshape_position != MaxSector &&
  3070. mddev->layout != mddev->new_layout)
  3071. return sprintf(page, "%d (%d)\n",
  3072. mddev->new_layout, mddev->layout);
  3073. return sprintf(page, "%d\n", mddev->layout);
  3074. }
  3075. static ssize_t
  3076. layout_store(mddev_t *mddev, const char *buf, size_t len)
  3077. {
  3078. char *e;
  3079. unsigned long n = simple_strtoul(buf, &e, 10);
  3080. if (!*buf || (*e && *e != '\n'))
  3081. return -EINVAL;
  3082. if (mddev->pers) {
  3083. int err;
  3084. if (mddev->pers->check_reshape == NULL)
  3085. return -EBUSY;
  3086. mddev->new_layout = n;
  3087. err = mddev->pers->check_reshape(mddev);
  3088. if (err) {
  3089. mddev->new_layout = mddev->layout;
  3090. return err;
  3091. }
  3092. } else {
  3093. mddev->new_layout = n;
  3094. if (mddev->reshape_position == MaxSector)
  3095. mddev->layout = n;
  3096. }
  3097. return len;
  3098. }
  3099. static struct md_sysfs_entry md_layout =
  3100. __ATTR(layout, S_IRUGO|S_IWUSR, layout_show, layout_store);
  3101. static ssize_t
  3102. raid_disks_show(mddev_t *mddev, char *page)
  3103. {
  3104. if (mddev->raid_disks == 0)
  3105. return 0;
  3106. if (mddev->reshape_position != MaxSector &&
  3107. mddev->delta_disks != 0)
  3108. return sprintf(page, "%d (%d)\n", mddev->raid_disks,
  3109. mddev->raid_disks - mddev->delta_disks);
  3110. return sprintf(page, "%d\n", mddev->raid_disks);
  3111. }
  3112. static int update_raid_disks(mddev_t *mddev, int raid_disks);
  3113. static ssize_t
  3114. raid_disks_store(mddev_t *mddev, const char *buf, size_t len)
  3115. {
  3116. char *e;
  3117. int rv = 0;
  3118. unsigned long n = simple_strtoul(buf, &e, 10);
  3119. if (!*buf || (*e && *e != '\n'))
  3120. return -EINVAL;
  3121. if (mddev->pers)
  3122. rv = update_raid_disks(mddev, n);
  3123. else if (mddev->reshape_position != MaxSector) {
  3124. int olddisks = mddev->raid_disks - mddev->delta_disks;
  3125. mddev->delta_disks = n - olddisks;
  3126. mddev->raid_disks = n;
  3127. } else
  3128. mddev->raid_disks = n;
  3129. return rv ? rv : len;
  3130. }
  3131. static struct md_sysfs_entry md_raid_disks =
  3132. __ATTR(raid_disks, S_IRUGO|S_IWUSR, raid_disks_show, raid_disks_store);
  3133. static ssize_t
  3134. chunk_size_show(mddev_t *mddev, char *page)
  3135. {
  3136. if (mddev->reshape_position != MaxSector &&
  3137. mddev->chunk_sectors != mddev->new_chunk_sectors)
  3138. return sprintf(page, "%d (%d)\n",
  3139. mddev->new_chunk_sectors << 9,
  3140. mddev->chunk_sectors << 9);
  3141. return sprintf(page, "%d\n", mddev->chunk_sectors << 9);
  3142. }
  3143. static ssize_t
  3144. chunk_size_store(mddev_t *mddev, const char *buf, size_t len)
  3145. {
  3146. char *e;
  3147. unsigned long n = simple_strtoul(buf, &e, 10);
  3148. if (!*buf || (*e && *e != '\n'))
  3149. return -EINVAL;
  3150. if (mddev->pers) {
  3151. int err;
  3152. if (mddev->pers->check_reshape == NULL)
  3153. return -EBUSY;
  3154. mddev->new_chunk_sectors = n >> 9;
  3155. err = mddev->pers->check_reshape(mddev);
  3156. if (err) {
  3157. mddev->new_chunk_sectors = mddev->chunk_sectors;
  3158. return err;
  3159. }
  3160. } else {
  3161. mddev->new_chunk_sectors = n >> 9;
  3162. if (mddev->reshape_position == MaxSector)
  3163. mddev->chunk_sectors = n >> 9;
  3164. }
  3165. return len;
  3166. }
  3167. static struct md_sysfs_entry md_chunk_size =
  3168. __ATTR(chunk_size, S_IRUGO|S_IWUSR, chunk_size_show, chunk_size_store);
  3169. static ssize_t
  3170. resync_start_show(mddev_t *mddev, char *page)
  3171. {
  3172. if (mddev->recovery_cp == MaxSector)
  3173. return sprintf(page, "none\n");
  3174. return sprintf(page, "%llu\n", (unsigned long long)mddev->recovery_cp);
  3175. }
  3176. static ssize_t
  3177. resync_start_store(mddev_t *mddev, const char *buf, size_t len)
  3178. {
  3179. char *e;
  3180. unsigned long long n = simple_strtoull(buf, &e, 10);
  3181. if (mddev->pers && !test_bit(MD_RECOVERY_FROZEN, &mddev->recovery))
  3182. return -EBUSY;
  3183. if (cmd_match(buf, "none"))
  3184. n = MaxSector;
  3185. else if (!*buf || (*e && *e != '\n'))
  3186. return -EINVAL;
  3187. mddev->recovery_cp = n;
  3188. return len;
  3189. }
  3190. static struct md_sysfs_entry md_resync_start =
  3191. __ATTR(resync_start, S_IRUGO|S_IWUSR, resync_start_show, resync_start_store);
  3192. /*
  3193. * The array state can be:
  3194. *
  3195. * clear
  3196. * No devices, no size, no level
  3197. * Equivalent to STOP_ARRAY ioctl
  3198. * inactive
  3199. * May have some settings, but array is not active
  3200. * all IO results in error
  3201. * When written, doesn't tear down array, but just stops it
  3202. * suspended (not supported yet)
  3203. * All IO requests will block. The array can be reconfigured.
  3204. * Writing this, if accepted, will block until array is quiescent
  3205. * readonly
  3206. * no resync can happen. no superblocks get written.
  3207. * write requests fail
  3208. * read-auto
  3209. * like readonly, but behaves like 'clean' on a write request.
  3210. *
  3211. * clean - no pending writes, but otherwise active.
  3212. * When written to inactive array, starts without resync
  3213. * If a write request arrives then
  3214. * if metadata is known, mark 'dirty' and switch to 'active'.
  3215. * if not known, block and switch to write-pending
  3216. * If written to an active array that has pending writes, then fails.
  3217. * active
  3218. * fully active: IO and resync can be happening.
  3219. * When written to inactive array, starts with resync
  3220. *
  3221. * write-pending
  3222. * clean, but writes are blocked waiting for 'active' to be written.
  3223. *
  3224. * active-idle
  3225. * like active, but no writes have been seen for a while (100msec).
  3226. *
  3227. */
  3228. enum array_state { clear, inactive, suspended, readonly, read_auto, clean, active,
  3229. write_pending, active_idle, bad_word};
  3230. static char *array_states[] = {
  3231. "clear", "inactive", "suspended", "readonly", "read-auto", "clean", "active",
  3232. "write-pending", "active-idle", NULL };
  3233. static int match_word(const char *word, char **list)
  3234. {
  3235. int n;
  3236. for (n=0; list[n]; n++)
  3237. if (cmd_match(word, list[n]))
  3238. break;
  3239. return n;
  3240. }
  3241. static ssize_t
  3242. array_state_show(mddev_t *mddev, char *page)
  3243. {
  3244. enum array_state st = inactive;
  3245. if (mddev->pers)
  3246. switch(mddev->ro) {
  3247. case 1:
  3248. st = readonly;
  3249. break;
  3250. case 2:
  3251. st = read_auto;
  3252. break;
  3253. case 0:
  3254. if (mddev->in_sync)
  3255. st = clean;
  3256. else if (test_bit(MD_CHANGE_PENDING, &mddev->flags))
  3257. st = write_pending;
  3258. else if (mddev->safemode)
  3259. st = active_idle;
  3260. else
  3261. st = active;
  3262. }
  3263. else {
  3264. if (list_empty(&mddev->disks) &&
  3265. mddev->raid_disks == 0 &&
  3266. mddev->dev_sectors == 0)
  3267. st = clear;
  3268. else
  3269. st = inactive;
  3270. }
  3271. return sprintf(page, "%s\n", array_states[st]);
  3272. }
  3273. static int do_md_stop(mddev_t * mddev, int ro, int is_open);
  3274. static int md_set_readonly(mddev_t * mddev, int is_open);
  3275. static int do_md_run(mddev_t * mddev);
  3276. static int restart_array(mddev_t *mddev);
  3277. static ssize_t
  3278. array_state_store(mddev_t *mddev, const char *buf, size_t len)
  3279. {
  3280. int err = -EINVAL;
  3281. enum array_state st = match_word(buf, array_states);
  3282. switch(st) {
  3283. case bad_word:
  3284. break;
  3285. case clear:
  3286. /* stopping an active array */
  3287. if (atomic_read(&mddev->openers) > 0)
  3288. return -EBUSY;
  3289. err = do_md_stop(mddev, 0, 0);
  3290. break;
  3291. case inactive:
  3292. /* stopping an active array */
  3293. if (mddev->pers) {
  3294. if (atomic_read(&mddev->openers) > 0)
  3295. return -EBUSY;
  3296. err = do_md_stop(mddev, 2, 0);
  3297. } else
  3298. err = 0; /* already inactive */
  3299. break;
  3300. case suspended:
  3301. break; /* not supported yet */
  3302. case readonly:
  3303. if (mddev->pers)
  3304. err = md_set_readonly(mddev, 0);
  3305. else {
  3306. mddev->ro = 1;
  3307. set_disk_ro(mddev->gendisk, 1);
  3308. err = do_md_run(mddev);
  3309. }
  3310. break;
  3311. case read_auto:
  3312. if (mddev->pers) {
  3313. if (mddev->ro == 0)
  3314. err = md_set_readonly(mddev, 0);
  3315. else if (mddev->ro == 1)
  3316. err = restart_array(mddev);
  3317. if (err == 0) {
  3318. mddev->ro = 2;
  3319. set_disk_ro(mddev->gendisk, 0);
  3320. }
  3321. } else {
  3322. mddev->ro = 2;
  3323. err = do_md_run(mddev);
  3324. }
  3325. break;
  3326. case clean:
  3327. if (mddev->pers) {
  3328. restart_array(mddev);
  3329. spin_lock_irq(&mddev->write_lock);
  3330. if (atomic_read(&mddev->writes_pending) == 0) {
  3331. if (mddev->in_sync == 0) {
  3332. mddev->in_sync = 1;
  3333. if (mddev->safemode == 1)
  3334. mddev->safemode = 0;
  3335. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  3336. }
  3337. err = 0;
  3338. } else
  3339. err = -EBUSY;
  3340. spin_unlock_irq(&mddev->write_lock);
  3341. } else
  3342. err = -EINVAL;
  3343. break;
  3344. case active:
  3345. if (mddev->pers) {
  3346. restart_array(mddev);
  3347. clear_bit(MD_CHANGE_PENDING, &mddev->flags);
  3348. wake_up(&mddev->sb_wait);
  3349. err = 0;
  3350. } else {
  3351. mddev->ro = 0;
  3352. set_disk_ro(mddev->gendisk, 0);
  3353. err = do_md_run(mddev);
  3354. }
  3355. break;
  3356. case write_pending:
  3357. case active_idle:
  3358. /* these cannot be set */
  3359. break;
  3360. }
  3361. if (err)
  3362. return err;
  3363. else {
  3364. sysfs_notify_dirent_safe(mddev->sysfs_state);
  3365. return len;
  3366. }
  3367. }
  3368. static struct md_sysfs_entry md_array_state =
  3369. __ATTR(array_state, S_IRUGO|S_IWUSR, array_state_show, array_state_store);
  3370. static ssize_t
  3371. max_corrected_read_errors_show(mddev_t *mddev, char *page) {
  3372. return sprintf(page, "%d\n",
  3373. atomic_read(&mddev->max_corr_read_errors));
  3374. }
  3375. static ssize_t
  3376. max_corrected_read_errors_store(mddev_t *mddev, const char *buf, size_t len)
  3377. {
  3378. char *e;
  3379. unsigned long n = simple_strtoul(buf, &e, 10);
  3380. if (*buf && (*e == 0 || *e == '\n')) {
  3381. atomic_set(&mddev->max_corr_read_errors, n);
  3382. return len;
  3383. }
  3384. return -EINVAL;
  3385. }
  3386. static struct md_sysfs_entry max_corr_read_errors =
  3387. __ATTR(max_read_errors, S_IRUGO|S_IWUSR, max_corrected_read_errors_show,
  3388. max_corrected_read_errors_store);
  3389. static ssize_t
  3390. null_show(mddev_t *mddev, char *page)
  3391. {
  3392. return -EINVAL;
  3393. }
  3394. static ssize_t
  3395. new_dev_store(mddev_t *mddev, const char *buf, size_t len)
  3396. {
  3397. /* buf must be %d:%d\n? giving major and minor numbers */
  3398. /* The new device is added to the array.
  3399. * If the array has a persistent superblock, we read the
  3400. * superblock to initialise info and check validity.
  3401. * Otherwise, only checking done is that in bind_rdev_to_array,
  3402. * which mainly checks size.
  3403. */
  3404. char *e;
  3405. int major = simple_strtoul(buf, &e, 10);
  3406. int minor;
  3407. dev_t dev;
  3408. mdk_rdev_t *rdev;
  3409. int err;
  3410. if (!*buf || *e != ':' || !e[1] || e[1] == '\n')
  3411. return -EINVAL;
  3412. minor = simple_strtoul(e+1, &e, 10);
  3413. if (*e && *e != '\n')
  3414. return -EINVAL;
  3415. dev = MKDEV(major, minor);
  3416. if (major != MAJOR(dev) ||
  3417. minor != MINOR(dev))
  3418. return -EOVERFLOW;
  3419. if (mddev->persistent) {
  3420. rdev = md_import_device(dev, mddev->major_version,
  3421. mddev->minor_version);
  3422. if (!IS_ERR(rdev) && !list_empty(&mddev->disks)) {
  3423. mdk_rdev_t *rdev0 = list_entry(mddev->disks.next,
  3424. mdk_rdev_t, same_set);
  3425. err = super_types[mddev->major_version]
  3426. .load_super(rdev, rdev0, mddev->minor_version);
  3427. if (err < 0)
  3428. goto out;
  3429. }
  3430. } else if (mddev->external)
  3431. rdev = md_import_device(dev, -2, -1);
  3432. else
  3433. rdev = md_import_device(dev, -1, -1);
  3434. if (IS_ERR(rdev))
  3435. return PTR_ERR(rdev);
  3436. err = bind_rdev_to_array(rdev, mddev);
  3437. out:
  3438. if (err)
  3439. export_rdev(rdev);
  3440. return err ? err : len;
  3441. }
  3442. static struct md_sysfs_entry md_new_device =
  3443. __ATTR(new_dev, S_IWUSR, null_show, new_dev_store);
  3444. static ssize_t
  3445. bitmap_store(mddev_t *mddev, const char *buf, size_t len)
  3446. {
  3447. char *end;
  3448. unsigned long chunk, end_chunk;
  3449. if (!mddev->bitmap)
  3450. goto out;
  3451. /* buf should be <chunk> <chunk> ... or <chunk>-<chunk> ... (range) */
  3452. while (*buf) {
  3453. chunk = end_chunk = simple_strtoul(buf, &end, 0);
  3454. if (buf == end) break;
  3455. if (*end == '-') { /* range */
  3456. buf = end + 1;
  3457. end_chunk = simple_strtoul(buf, &end, 0);
  3458. if (buf == end) break;
  3459. }
  3460. if (*end && !isspace(*end)) break;
  3461. bitmap_dirty_bits(mddev->bitmap, chunk, end_chunk);
  3462. buf = skip_spaces(end);
  3463. }
  3464. bitmap_unplug(mddev->bitmap); /* flush the bits to disk */
  3465. out:
  3466. return len;
  3467. }
  3468. static struct md_sysfs_entry md_bitmap =
  3469. __ATTR(bitmap_set_bits, S_IWUSR, null_show, bitmap_store);
  3470. static ssize_t
  3471. size_show(mddev_t *mddev, char *page)
  3472. {
  3473. return sprintf(page, "%llu\n",
  3474. (unsigned long long)mddev->dev_sectors / 2);
  3475. }
  3476. static int update_size(mddev_t *mddev, sector_t num_sectors);
  3477. static ssize_t
  3478. size_store(mddev_t *mddev, const char *buf, size_t len)
  3479. {
  3480. /* If array is inactive, we can reduce the component size, but
  3481. * not increase it (except from 0).
  3482. * If array is active, we can try an on-line resize
  3483. */
  3484. sector_t sectors;
  3485. int err = strict_blocks_to_sectors(buf, &sectors);
  3486. if (err < 0)
  3487. return err;
  3488. if (mddev->pers) {
  3489. err = update_size(mddev, sectors);
  3490. md_update_sb(mddev, 1);
  3491. } else {
  3492. if (mddev->dev_sectors == 0 ||
  3493. mddev->dev_sectors > sectors)
  3494. mddev->dev_sectors = sectors;
  3495. else
  3496. err = -ENOSPC;
  3497. }
  3498. return err ? err : len;
  3499. }
  3500. static struct md_sysfs_entry md_size =
  3501. __ATTR(component_size, S_IRUGO|S_IWUSR, size_show, size_store);
  3502. /* Metdata version.
  3503. * This is one of
  3504. * 'none' for arrays with no metadata (good luck...)
  3505. * 'external' for arrays with externally managed metadata,
  3506. * or N.M for internally known formats
  3507. */
  3508. static ssize_t
  3509. metadata_show(mddev_t *mddev, char *page)
  3510. {
  3511. if (mddev->persistent)
  3512. return sprintf(page, "%d.%d\n",
  3513. mddev->major_version, mddev->minor_version);
  3514. else if (mddev->external)
  3515. return sprintf(page, "external:%s\n", mddev->metadata_type);
  3516. else
  3517. return sprintf(page, "none\n");
  3518. }
  3519. static ssize_t
  3520. metadata_store(mddev_t *mddev, const char *buf, size_t len)
  3521. {
  3522. int major, minor;
  3523. char *e;
  3524. /* Changing the details of 'external' metadata is
  3525. * always permitted. Otherwise there must be
  3526. * no devices attached to the array.
  3527. */
  3528. if (mddev->external && strncmp(buf, "external:", 9) == 0)
  3529. ;
  3530. else if (!list_empty(&mddev->disks))
  3531. return -EBUSY;
  3532. if (cmd_match(buf, "none")) {
  3533. mddev->persistent = 0;
  3534. mddev->external = 0;
  3535. mddev->major_version = 0;
  3536. mddev->minor_version = 90;
  3537. return len;
  3538. }
  3539. if (strncmp(buf, "external:", 9) == 0) {
  3540. size_t namelen = len-9;
  3541. if (namelen >= sizeof(mddev->metadata_type))
  3542. namelen = sizeof(mddev->metadata_type)-1;
  3543. strncpy(mddev->metadata_type, buf+9, namelen);
  3544. mddev->metadata_type[namelen] = 0;
  3545. if (namelen && mddev->metadata_type[namelen-1] == '\n')
  3546. mddev->metadata_type[--namelen] = 0;
  3547. mddev->persistent = 0;
  3548. mddev->external = 1;
  3549. mddev->major_version = 0;
  3550. mddev->minor_version = 90;
  3551. return len;
  3552. }
  3553. major = simple_strtoul(buf, &e, 10);
  3554. if (e==buf || *e != '.')
  3555. return -EINVAL;
  3556. buf = e+1;
  3557. minor = simple_strtoul(buf, &e, 10);
  3558. if (e==buf || (*e && *e != '\n') )
  3559. return -EINVAL;
  3560. if (major >= ARRAY_SIZE(super_types) || super_types[major].name == NULL)
  3561. return -ENOENT;
  3562. mddev->major_version = major;
  3563. mddev->minor_version = minor;
  3564. mddev->persistent = 1;
  3565. mddev->external = 0;
  3566. return len;
  3567. }
  3568. static struct md_sysfs_entry md_metadata =
  3569. __ATTR(metadata_version, S_IRUGO|S_IWUSR, metadata_show, metadata_store);
  3570. static ssize_t
  3571. action_show(mddev_t *mddev, char *page)
  3572. {
  3573. char *type = "idle";
  3574. if (test_bit(MD_RECOVERY_FROZEN, &mddev->recovery))
  3575. type = "frozen";
  3576. else if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) ||
  3577. (!mddev->ro && test_bit(MD_RECOVERY_NEEDED, &mddev->recovery))) {
  3578. if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  3579. type = "reshape";
  3580. else if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  3581. if (!test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  3582. type = "resync";
  3583. else if (test_bit(MD_RECOVERY_CHECK, &mddev->recovery))
  3584. type = "check";
  3585. else
  3586. type = "repair";
  3587. } else if (test_bit(MD_RECOVERY_RECOVER, &mddev->recovery))
  3588. type = "recover";
  3589. }
  3590. return sprintf(page, "%s\n", type);
  3591. }
  3592. static void reap_sync_thread(mddev_t *mddev);
  3593. static ssize_t
  3594. action_store(mddev_t *mddev, const char *page, size_t len)
  3595. {
  3596. if (!mddev->pers || !mddev->pers->sync_request)
  3597. return -EINVAL;
  3598. if (cmd_match(page, "frozen"))
  3599. set_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  3600. else
  3601. clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  3602. if (cmd_match(page, "idle") || cmd_match(page, "frozen")) {
  3603. if (mddev->sync_thread) {
  3604. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  3605. reap_sync_thread(mddev);
  3606. }
  3607. } else if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) ||
  3608. test_bit(MD_RECOVERY_NEEDED, &mddev->recovery))
  3609. return -EBUSY;
  3610. else if (cmd_match(page, "resync"))
  3611. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3612. else if (cmd_match(page, "recover")) {
  3613. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  3614. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3615. } else if (cmd_match(page, "reshape")) {
  3616. int err;
  3617. if (mddev->pers->start_reshape == NULL)
  3618. return -EINVAL;
  3619. err = mddev->pers->start_reshape(mddev);
  3620. if (err)
  3621. return err;
  3622. sysfs_notify(&mddev->kobj, NULL, "degraded");
  3623. } else {
  3624. if (cmd_match(page, "check"))
  3625. set_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  3626. else if (!cmd_match(page, "repair"))
  3627. return -EINVAL;
  3628. set_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  3629. set_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  3630. }
  3631. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3632. md_wakeup_thread(mddev->thread);
  3633. sysfs_notify_dirent_safe(mddev->sysfs_action);
  3634. return len;
  3635. }
  3636. static ssize_t
  3637. mismatch_cnt_show(mddev_t *mddev, char *page)
  3638. {
  3639. return sprintf(page, "%llu\n",
  3640. (unsigned long long) mddev->resync_mismatches);
  3641. }
  3642. static struct md_sysfs_entry md_scan_mode =
  3643. __ATTR(sync_action, S_IRUGO|S_IWUSR, action_show, action_store);
  3644. static struct md_sysfs_entry md_mismatches = __ATTR_RO(mismatch_cnt);
  3645. static ssize_t
  3646. sync_min_show(mddev_t *mddev, char *page)
  3647. {
  3648. return sprintf(page, "%d (%s)\n", speed_min(mddev),
  3649. mddev->sync_speed_min ? "local": "system");
  3650. }
  3651. static ssize_t
  3652. sync_min_store(mddev_t *mddev, const char *buf, size_t len)
  3653. {
  3654. int min;
  3655. char *e;
  3656. if (strncmp(buf, "system", 6)==0) {
  3657. mddev->sync_speed_min = 0;
  3658. return len;
  3659. }
  3660. min = simple_strtoul(buf, &e, 10);
  3661. if (buf == e || (*e && *e != '\n') || min <= 0)
  3662. return -EINVAL;
  3663. mddev->sync_speed_min = min;
  3664. return len;
  3665. }
  3666. static struct md_sysfs_entry md_sync_min =
  3667. __ATTR(sync_speed_min, S_IRUGO|S_IWUSR, sync_min_show, sync_min_store);
  3668. static ssize_t
  3669. sync_max_show(mddev_t *mddev, char *page)
  3670. {
  3671. return sprintf(page, "%d (%s)\n", speed_max(mddev),
  3672. mddev->sync_speed_max ? "local": "system");
  3673. }
  3674. static ssize_t
  3675. sync_max_store(mddev_t *mddev, const char *buf, size_t len)
  3676. {
  3677. int max;
  3678. char *e;
  3679. if (strncmp(buf, "system", 6)==0) {
  3680. mddev->sync_speed_max = 0;
  3681. return len;
  3682. }
  3683. max = simple_strtoul(buf, &e, 10);
  3684. if (buf == e || (*e && *e != '\n') || max <= 0)
  3685. return -EINVAL;
  3686. mddev->sync_speed_max = max;
  3687. return len;
  3688. }
  3689. static struct md_sysfs_entry md_sync_max =
  3690. __ATTR(sync_speed_max, S_IRUGO|S_IWUSR, sync_max_show, sync_max_store);
  3691. static ssize_t
  3692. degraded_show(mddev_t *mddev, char *page)
  3693. {
  3694. return sprintf(page, "%d\n", mddev->degraded);
  3695. }
  3696. static struct md_sysfs_entry md_degraded = __ATTR_RO(degraded);
  3697. static ssize_t
  3698. sync_force_parallel_show(mddev_t *mddev, char *page)
  3699. {
  3700. return sprintf(page, "%d\n", mddev->parallel_resync);
  3701. }
  3702. static ssize_t
  3703. sync_force_parallel_store(mddev_t *mddev, const char *buf, size_t len)
  3704. {
  3705. long n;
  3706. if (strict_strtol(buf, 10, &n))
  3707. return -EINVAL;
  3708. if (n != 0 && n != 1)
  3709. return -EINVAL;
  3710. mddev->parallel_resync = n;
  3711. if (mddev->sync_thread)
  3712. wake_up(&resync_wait);
  3713. return len;
  3714. }
  3715. /* force parallel resync, even with shared block devices */
  3716. static struct md_sysfs_entry md_sync_force_parallel =
  3717. __ATTR(sync_force_parallel, S_IRUGO|S_IWUSR,
  3718. sync_force_parallel_show, sync_force_parallel_store);
  3719. static ssize_t
  3720. sync_speed_show(mddev_t *mddev, char *page)
  3721. {
  3722. unsigned long resync, dt, db;
  3723. if (mddev->curr_resync == 0)
  3724. return sprintf(page, "none\n");
  3725. resync = mddev->curr_mark_cnt - atomic_read(&mddev->recovery_active);
  3726. dt = (jiffies - mddev->resync_mark) / HZ;
  3727. if (!dt) dt++;
  3728. db = resync - mddev->resync_mark_cnt;
  3729. return sprintf(page, "%lu\n", db/dt/2); /* K/sec */
  3730. }
  3731. static struct md_sysfs_entry md_sync_speed = __ATTR_RO(sync_speed);
  3732. static ssize_t
  3733. sync_completed_show(mddev_t *mddev, char *page)
  3734. {
  3735. unsigned long long max_sectors, resync;
  3736. if (!test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3737. return sprintf(page, "none\n");
  3738. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  3739. max_sectors = mddev->resync_max_sectors;
  3740. else
  3741. max_sectors = mddev->dev_sectors;
  3742. resync = mddev->curr_resync_completed;
  3743. return sprintf(page, "%llu / %llu\n", resync, max_sectors);
  3744. }
  3745. static struct md_sysfs_entry md_sync_completed = __ATTR_RO(sync_completed);
  3746. static ssize_t
  3747. min_sync_show(mddev_t *mddev, char *page)
  3748. {
  3749. return sprintf(page, "%llu\n",
  3750. (unsigned long long)mddev->resync_min);
  3751. }
  3752. static ssize_t
  3753. min_sync_store(mddev_t *mddev, const char *buf, size_t len)
  3754. {
  3755. unsigned long long min;
  3756. if (strict_strtoull(buf, 10, &min))
  3757. return -EINVAL;
  3758. if (min > mddev->resync_max)
  3759. return -EINVAL;
  3760. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3761. return -EBUSY;
  3762. /* Must be a multiple of chunk_size */
  3763. if (mddev->chunk_sectors) {
  3764. sector_t temp = min;
  3765. if (sector_div(temp, mddev->chunk_sectors))
  3766. return -EINVAL;
  3767. }
  3768. mddev->resync_min = min;
  3769. return len;
  3770. }
  3771. static struct md_sysfs_entry md_min_sync =
  3772. __ATTR(sync_min, S_IRUGO|S_IWUSR, min_sync_show, min_sync_store);
  3773. static ssize_t
  3774. max_sync_show(mddev_t *mddev, char *page)
  3775. {
  3776. if (mddev->resync_max == MaxSector)
  3777. return sprintf(page, "max\n");
  3778. else
  3779. return sprintf(page, "%llu\n",
  3780. (unsigned long long)mddev->resync_max);
  3781. }
  3782. static ssize_t
  3783. max_sync_store(mddev_t *mddev, const char *buf, size_t len)
  3784. {
  3785. if (strncmp(buf, "max", 3) == 0)
  3786. mddev->resync_max = MaxSector;
  3787. else {
  3788. unsigned long long max;
  3789. if (strict_strtoull(buf, 10, &max))
  3790. return -EINVAL;
  3791. if (max < mddev->resync_min)
  3792. return -EINVAL;
  3793. if (max < mddev->resync_max &&
  3794. mddev->ro == 0 &&
  3795. test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3796. return -EBUSY;
  3797. /* Must be a multiple of chunk_size */
  3798. if (mddev->chunk_sectors) {
  3799. sector_t temp = max;
  3800. if (sector_div(temp, mddev->chunk_sectors))
  3801. return -EINVAL;
  3802. }
  3803. mddev->resync_max = max;
  3804. }
  3805. wake_up(&mddev->recovery_wait);
  3806. return len;
  3807. }
  3808. static struct md_sysfs_entry md_max_sync =
  3809. __ATTR(sync_max, S_IRUGO|S_IWUSR, max_sync_show, max_sync_store);
  3810. static ssize_t
  3811. suspend_lo_show(mddev_t *mddev, char *page)
  3812. {
  3813. return sprintf(page, "%llu\n", (unsigned long long)mddev->suspend_lo);
  3814. }
  3815. static ssize_t
  3816. suspend_lo_store(mddev_t *mddev, const char *buf, size_t len)
  3817. {
  3818. char *e;
  3819. unsigned long long new = simple_strtoull(buf, &e, 10);
  3820. unsigned long long old = mddev->suspend_lo;
  3821. if (mddev->pers == NULL ||
  3822. mddev->pers->quiesce == NULL)
  3823. return -EINVAL;
  3824. if (buf == e || (*e && *e != '\n'))
  3825. return -EINVAL;
  3826. mddev->suspend_lo = new;
  3827. if (new >= old)
  3828. /* Shrinking suspended region */
  3829. mddev->pers->quiesce(mddev, 2);
  3830. else {
  3831. /* Expanding suspended region - need to wait */
  3832. mddev->pers->quiesce(mddev, 1);
  3833. mddev->pers->quiesce(mddev, 0);
  3834. }
  3835. return len;
  3836. }
  3837. static struct md_sysfs_entry md_suspend_lo =
  3838. __ATTR(suspend_lo, S_IRUGO|S_IWUSR, suspend_lo_show, suspend_lo_store);
  3839. static ssize_t
  3840. suspend_hi_show(mddev_t *mddev, char *page)
  3841. {
  3842. return sprintf(page, "%llu\n", (unsigned long long)mddev->suspend_hi);
  3843. }
  3844. static ssize_t
  3845. suspend_hi_store(mddev_t *mddev, const char *buf, size_t len)
  3846. {
  3847. char *e;
  3848. unsigned long long new = simple_strtoull(buf, &e, 10);
  3849. unsigned long long old = mddev->suspend_hi;
  3850. if (mddev->pers == NULL ||
  3851. mddev->pers->quiesce == NULL)
  3852. return -EINVAL;
  3853. if (buf == e || (*e && *e != '\n'))
  3854. return -EINVAL;
  3855. mddev->suspend_hi = new;
  3856. if (new <= old)
  3857. /* Shrinking suspended region */
  3858. mddev->pers->quiesce(mddev, 2);
  3859. else {
  3860. /* Expanding suspended region - need to wait */
  3861. mddev->pers->quiesce(mddev, 1);
  3862. mddev->pers->quiesce(mddev, 0);
  3863. }
  3864. return len;
  3865. }
  3866. static struct md_sysfs_entry md_suspend_hi =
  3867. __ATTR(suspend_hi, S_IRUGO|S_IWUSR, suspend_hi_show, suspend_hi_store);
  3868. static ssize_t
  3869. reshape_position_show(mddev_t *mddev, char *page)
  3870. {
  3871. if (mddev->reshape_position != MaxSector)
  3872. return sprintf(page, "%llu\n",
  3873. (unsigned long long)mddev->reshape_position);
  3874. strcpy(page, "none\n");
  3875. return 5;
  3876. }
  3877. static ssize_t
  3878. reshape_position_store(mddev_t *mddev, const char *buf, size_t len)
  3879. {
  3880. char *e;
  3881. unsigned long long new = simple_strtoull(buf, &e, 10);
  3882. if (mddev->pers)
  3883. return -EBUSY;
  3884. if (buf == e || (*e && *e != '\n'))
  3885. return -EINVAL;
  3886. mddev->reshape_position = new;
  3887. mddev->delta_disks = 0;
  3888. mddev->new_level = mddev->level;
  3889. mddev->new_layout = mddev->layout;
  3890. mddev->new_chunk_sectors = mddev->chunk_sectors;
  3891. return len;
  3892. }
  3893. static struct md_sysfs_entry md_reshape_position =
  3894. __ATTR(reshape_position, S_IRUGO|S_IWUSR, reshape_position_show,
  3895. reshape_position_store);
  3896. static ssize_t
  3897. array_size_show(mddev_t *mddev, char *page)
  3898. {
  3899. if (mddev->external_size)
  3900. return sprintf(page, "%llu\n",
  3901. (unsigned long long)mddev->array_sectors/2);
  3902. else
  3903. return sprintf(page, "default\n");
  3904. }
  3905. static ssize_t
  3906. array_size_store(mddev_t *mddev, const char *buf, size_t len)
  3907. {
  3908. sector_t sectors;
  3909. if (strncmp(buf, "default", 7) == 0) {
  3910. if (mddev->pers)
  3911. sectors = mddev->pers->size(mddev, 0, 0);
  3912. else
  3913. sectors = mddev->array_sectors;
  3914. mddev->external_size = 0;
  3915. } else {
  3916. if (strict_blocks_to_sectors(buf, &sectors) < 0)
  3917. return -EINVAL;
  3918. if (mddev->pers && mddev->pers->size(mddev, 0, 0) < sectors)
  3919. return -E2BIG;
  3920. mddev->external_size = 1;
  3921. }
  3922. mddev->array_sectors = sectors;
  3923. if (mddev->pers) {
  3924. set_capacity(mddev->gendisk, mddev->array_sectors);
  3925. revalidate_disk(mddev->gendisk);
  3926. }
  3927. return len;
  3928. }
  3929. static struct md_sysfs_entry md_array_size =
  3930. __ATTR(array_size, S_IRUGO|S_IWUSR, array_size_show,
  3931. array_size_store);
  3932. static struct attribute *md_default_attrs[] = {
  3933. &md_level.attr,
  3934. &md_layout.attr,
  3935. &md_raid_disks.attr,
  3936. &md_chunk_size.attr,
  3937. &md_size.attr,
  3938. &md_resync_start.attr,
  3939. &md_metadata.attr,
  3940. &md_new_device.attr,
  3941. &md_safe_delay.attr,
  3942. &md_array_state.attr,
  3943. &md_reshape_position.attr,
  3944. &md_array_size.attr,
  3945. &max_corr_read_errors.attr,
  3946. NULL,
  3947. };
  3948. static struct attribute *md_redundancy_attrs[] = {
  3949. &md_scan_mode.attr,
  3950. &md_mismatches.attr,
  3951. &md_sync_min.attr,
  3952. &md_sync_max.attr,
  3953. &md_sync_speed.attr,
  3954. &md_sync_force_parallel.attr,
  3955. &md_sync_completed.attr,
  3956. &md_min_sync.attr,
  3957. &md_max_sync.attr,
  3958. &md_suspend_lo.attr,
  3959. &md_suspend_hi.attr,
  3960. &md_bitmap.attr,
  3961. &md_degraded.attr,
  3962. NULL,
  3963. };
  3964. static struct attribute_group md_redundancy_group = {
  3965. .name = NULL,
  3966. .attrs = md_redundancy_attrs,
  3967. };
  3968. static ssize_t
  3969. md_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  3970. {
  3971. struct md_sysfs_entry *entry = container_of(attr, struct md_sysfs_entry, attr);
  3972. mddev_t *mddev = container_of(kobj, struct mddev_s, kobj);
  3973. ssize_t rv;
  3974. if (!entry->show)
  3975. return -EIO;
  3976. rv = mddev_lock(mddev);
  3977. if (!rv) {
  3978. rv = entry->show(mddev, page);
  3979. mddev_unlock(mddev);
  3980. }
  3981. return rv;
  3982. }
  3983. static ssize_t
  3984. md_attr_store(struct kobject *kobj, struct attribute *attr,
  3985. const char *page, size_t length)
  3986. {
  3987. struct md_sysfs_entry *entry = container_of(attr, struct md_sysfs_entry, attr);
  3988. mddev_t *mddev = container_of(kobj, struct mddev_s, kobj);
  3989. ssize_t rv;
  3990. if (!entry->store)
  3991. return -EIO;
  3992. if (!capable(CAP_SYS_ADMIN))
  3993. return -EACCES;
  3994. rv = mddev_lock(mddev);
  3995. if (mddev->hold_active == UNTIL_IOCTL)
  3996. mddev->hold_active = 0;
  3997. if (!rv) {
  3998. rv = entry->store(mddev, page, length);
  3999. mddev_unlock(mddev);
  4000. }
  4001. return rv;
  4002. }
  4003. static void md_free(struct kobject *ko)
  4004. {
  4005. mddev_t *mddev = container_of(ko, mddev_t, kobj);
  4006. if (mddev->sysfs_state)
  4007. sysfs_put(mddev->sysfs_state);
  4008. if (mddev->gendisk) {
  4009. del_gendisk(mddev->gendisk);
  4010. put_disk(mddev->gendisk);
  4011. }
  4012. if (mddev->queue)
  4013. blk_cleanup_queue(mddev->queue);
  4014. kfree(mddev);
  4015. }
  4016. static const struct sysfs_ops md_sysfs_ops = {
  4017. .show = md_attr_show,
  4018. .store = md_attr_store,
  4019. };
  4020. static struct kobj_type md_ktype = {
  4021. .release = md_free,
  4022. .sysfs_ops = &md_sysfs_ops,
  4023. .default_attrs = md_default_attrs,
  4024. };
  4025. int mdp_major = 0;
  4026. static void mddev_delayed_delete(struct work_struct *ws)
  4027. {
  4028. mddev_t *mddev = container_of(ws, mddev_t, del_work);
  4029. sysfs_remove_group(&mddev->kobj, &md_bitmap_group);
  4030. kobject_del(&mddev->kobj);
  4031. kobject_put(&mddev->kobj);
  4032. }
  4033. static int md_alloc(dev_t dev, char *name)
  4034. {
  4035. static DEFINE_MUTEX(disks_mutex);
  4036. mddev_t *mddev = mddev_find(dev);
  4037. struct gendisk *disk;
  4038. int partitioned;
  4039. int shift;
  4040. int unit;
  4041. int error;
  4042. if (!mddev)
  4043. return -ENODEV;
  4044. partitioned = (MAJOR(mddev->unit) != MD_MAJOR);
  4045. shift = partitioned ? MdpMinorShift : 0;
  4046. unit = MINOR(mddev->unit) >> shift;
  4047. /* wait for any previous instance of this device to be
  4048. * completely removed (mddev_delayed_delete).
  4049. */
  4050. flush_workqueue(md_misc_wq);
  4051. mutex_lock(&disks_mutex);
  4052. error = -EEXIST;
  4053. if (mddev->gendisk)
  4054. goto abort;
  4055. if (name) {
  4056. /* Need to ensure that 'name' is not a duplicate.
  4057. */
  4058. mddev_t *mddev2;
  4059. spin_lock(&all_mddevs_lock);
  4060. list_for_each_entry(mddev2, &all_mddevs, all_mddevs)
  4061. if (mddev2->gendisk &&
  4062. strcmp(mddev2->gendisk->disk_name, name) == 0) {
  4063. spin_unlock(&all_mddevs_lock);
  4064. goto abort;
  4065. }
  4066. spin_unlock(&all_mddevs_lock);
  4067. }
  4068. error = -ENOMEM;
  4069. mddev->queue = blk_alloc_queue(GFP_KERNEL);
  4070. if (!mddev->queue)
  4071. goto abort;
  4072. mddev->queue->queuedata = mddev;
  4073. blk_queue_make_request(mddev->queue, md_make_request);
  4074. disk = alloc_disk(1 << shift);
  4075. if (!disk) {
  4076. blk_cleanup_queue(mddev->queue);
  4077. mddev->queue = NULL;
  4078. goto abort;
  4079. }
  4080. disk->major = MAJOR(mddev->unit);
  4081. disk->first_minor = unit << shift;
  4082. if (name)
  4083. strcpy(disk->disk_name, name);
  4084. else if (partitioned)
  4085. sprintf(disk->disk_name, "md_d%d", unit);
  4086. else
  4087. sprintf(disk->disk_name, "md%d", unit);
  4088. disk->fops = &md_fops;
  4089. disk->private_data = mddev;
  4090. disk->queue = mddev->queue;
  4091. blk_queue_flush(mddev->queue, REQ_FLUSH | REQ_FUA);
  4092. /* Allow extended partitions. This makes the
  4093. * 'mdp' device redundant, but we can't really
  4094. * remove it now.
  4095. */
  4096. disk->flags |= GENHD_FL_EXT_DEVT;
  4097. mddev->gendisk = disk;
  4098. /* As soon as we call add_disk(), another thread could get
  4099. * through to md_open, so make sure it doesn't get too far
  4100. */
  4101. mutex_lock(&mddev->open_mutex);
  4102. add_disk(disk);
  4103. error = kobject_init_and_add(&mddev->kobj, &md_ktype,
  4104. &disk_to_dev(disk)->kobj, "%s", "md");
  4105. if (error) {
  4106. /* This isn't possible, but as kobject_init_and_add is marked
  4107. * __must_check, we must do something with the result
  4108. */
  4109. printk(KERN_WARNING "md: cannot register %s/md - name in use\n",
  4110. disk->disk_name);
  4111. error = 0;
  4112. }
  4113. if (mddev->kobj.sd &&
  4114. sysfs_create_group(&mddev->kobj, &md_bitmap_group))
  4115. printk(KERN_DEBUG "pointless warning\n");
  4116. mutex_unlock(&mddev->open_mutex);
  4117. abort:
  4118. mutex_unlock(&disks_mutex);
  4119. if (!error && mddev->kobj.sd) {
  4120. kobject_uevent(&mddev->kobj, KOBJ_ADD);
  4121. mddev->sysfs_state = sysfs_get_dirent_safe(mddev->kobj.sd, "array_state");
  4122. }
  4123. mddev_put(mddev);
  4124. return error;
  4125. }
  4126. static struct kobject *md_probe(dev_t dev, int *part, void *data)
  4127. {
  4128. md_alloc(dev, NULL);
  4129. return NULL;
  4130. }
  4131. static int add_named_array(const char *val, struct kernel_param *kp)
  4132. {
  4133. /* val must be "md_*" where * is not all digits.
  4134. * We allocate an array with a large free minor number, and
  4135. * set the name to val. val must not already be an active name.
  4136. */
  4137. int len = strlen(val);
  4138. char buf[DISK_NAME_LEN];
  4139. while (len && val[len-1] == '\n')
  4140. len--;
  4141. if (len >= DISK_NAME_LEN)
  4142. return -E2BIG;
  4143. strlcpy(buf, val, len+1);
  4144. if (strncmp(buf, "md_", 3) != 0)
  4145. return -EINVAL;
  4146. return md_alloc(0, buf);
  4147. }
  4148. static void md_safemode_timeout(unsigned long data)
  4149. {
  4150. mddev_t *mddev = (mddev_t *) data;
  4151. if (!atomic_read(&mddev->writes_pending)) {
  4152. mddev->safemode = 1;
  4153. if (mddev->external)
  4154. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4155. }
  4156. md_wakeup_thread(mddev->thread);
  4157. }
  4158. static int start_dirty_degraded;
  4159. int md_run(mddev_t *mddev)
  4160. {
  4161. int err;
  4162. mdk_rdev_t *rdev;
  4163. struct mdk_personality *pers;
  4164. if (list_empty(&mddev->disks))
  4165. /* cannot run an array with no devices.. */
  4166. return -EINVAL;
  4167. if (mddev->pers)
  4168. return -EBUSY;
  4169. /* Cannot run until previous stop completes properly */
  4170. if (mddev->sysfs_active)
  4171. return -EBUSY;
  4172. /*
  4173. * Analyze all RAID superblock(s)
  4174. */
  4175. if (!mddev->raid_disks) {
  4176. if (!mddev->persistent)
  4177. return -EINVAL;
  4178. analyze_sbs(mddev);
  4179. }
  4180. if (mddev->level != LEVEL_NONE)
  4181. request_module("md-level-%d", mddev->level);
  4182. else if (mddev->clevel[0])
  4183. request_module("md-%s", mddev->clevel);
  4184. /*
  4185. * Drop all container device buffers, from now on
  4186. * the only valid external interface is through the md
  4187. * device.
  4188. */
  4189. list_for_each_entry(rdev, &mddev->disks, same_set) {
  4190. if (test_bit(Faulty, &rdev->flags))
  4191. continue;
  4192. sync_blockdev(rdev->bdev);
  4193. invalidate_bdev(rdev->bdev);
  4194. /* perform some consistency tests on the device.
  4195. * We don't want the data to overlap the metadata,
  4196. * Internal Bitmap issues have been handled elsewhere.
  4197. */
  4198. if (rdev->meta_bdev) {
  4199. /* Nothing to check */;
  4200. } else if (rdev->data_offset < rdev->sb_start) {
  4201. if (mddev->dev_sectors &&
  4202. rdev->data_offset + mddev->dev_sectors
  4203. > rdev->sb_start) {
  4204. printk("md: %s: data overlaps metadata\n",
  4205. mdname(mddev));
  4206. return -EINVAL;
  4207. }
  4208. } else {
  4209. if (rdev->sb_start + rdev->sb_size/512
  4210. > rdev->data_offset) {
  4211. printk("md: %s: metadata overlaps data\n",
  4212. mdname(mddev));
  4213. return -EINVAL;
  4214. }
  4215. }
  4216. sysfs_notify_dirent_safe(rdev->sysfs_state);
  4217. }
  4218. if (mddev->bio_set == NULL)
  4219. mddev->bio_set = bioset_create(BIO_POOL_SIZE,
  4220. sizeof(mddev_t *));
  4221. spin_lock(&pers_lock);
  4222. pers = find_pers(mddev->level, mddev->clevel);
  4223. if (!pers || !try_module_get(pers->owner)) {
  4224. spin_unlock(&pers_lock);
  4225. if (mddev->level != LEVEL_NONE)
  4226. printk(KERN_WARNING "md: personality for level %d is not loaded!\n",
  4227. mddev->level);
  4228. else
  4229. printk(KERN_WARNING "md: personality for level %s is not loaded!\n",
  4230. mddev->clevel);
  4231. return -EINVAL;
  4232. }
  4233. mddev->pers = pers;
  4234. spin_unlock(&pers_lock);
  4235. if (mddev->level != pers->level) {
  4236. mddev->level = pers->level;
  4237. mddev->new_level = pers->level;
  4238. }
  4239. strlcpy(mddev->clevel, pers->name, sizeof(mddev->clevel));
  4240. if (mddev->reshape_position != MaxSector &&
  4241. pers->start_reshape == NULL) {
  4242. /* This personality cannot handle reshaping... */
  4243. mddev->pers = NULL;
  4244. module_put(pers->owner);
  4245. return -EINVAL;
  4246. }
  4247. if (pers->sync_request) {
  4248. /* Warn if this is a potentially silly
  4249. * configuration.
  4250. */
  4251. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  4252. mdk_rdev_t *rdev2;
  4253. int warned = 0;
  4254. list_for_each_entry(rdev, &mddev->disks, same_set)
  4255. list_for_each_entry(rdev2, &mddev->disks, same_set) {
  4256. if (rdev < rdev2 &&
  4257. rdev->bdev->bd_contains ==
  4258. rdev2->bdev->bd_contains) {
  4259. printk(KERN_WARNING
  4260. "%s: WARNING: %s appears to be"
  4261. " on the same physical disk as"
  4262. " %s.\n",
  4263. mdname(mddev),
  4264. bdevname(rdev->bdev,b),
  4265. bdevname(rdev2->bdev,b2));
  4266. warned = 1;
  4267. }
  4268. }
  4269. if (warned)
  4270. printk(KERN_WARNING
  4271. "True protection against single-disk"
  4272. " failure might be compromised.\n");
  4273. }
  4274. mddev->recovery = 0;
  4275. /* may be over-ridden by personality */
  4276. mddev->resync_max_sectors = mddev->dev_sectors;
  4277. mddev->ok_start_degraded = start_dirty_degraded;
  4278. if (start_readonly && mddev->ro == 0)
  4279. mddev->ro = 2; /* read-only, but switch on first write */
  4280. err = mddev->pers->run(mddev);
  4281. if (err)
  4282. printk(KERN_ERR "md: pers->run() failed ...\n");
  4283. else if (mddev->pers->size(mddev, 0, 0) < mddev->array_sectors) {
  4284. WARN_ONCE(!mddev->external_size, "%s: default size too small,"
  4285. " but 'external_size' not in effect?\n", __func__);
  4286. printk(KERN_ERR
  4287. "md: invalid array_size %llu > default size %llu\n",
  4288. (unsigned long long)mddev->array_sectors / 2,
  4289. (unsigned long long)mddev->pers->size(mddev, 0, 0) / 2);
  4290. err = -EINVAL;
  4291. mddev->pers->stop(mddev);
  4292. }
  4293. if (err == 0 && mddev->pers->sync_request) {
  4294. err = bitmap_create(mddev);
  4295. if (err) {
  4296. printk(KERN_ERR "%s: failed to create bitmap (%d)\n",
  4297. mdname(mddev), err);
  4298. mddev->pers->stop(mddev);
  4299. }
  4300. }
  4301. if (err) {
  4302. module_put(mddev->pers->owner);
  4303. mddev->pers = NULL;
  4304. bitmap_destroy(mddev);
  4305. return err;
  4306. }
  4307. if (mddev->pers->sync_request) {
  4308. if (mddev->kobj.sd &&
  4309. sysfs_create_group(&mddev->kobj, &md_redundancy_group))
  4310. printk(KERN_WARNING
  4311. "md: cannot register extra attributes for %s\n",
  4312. mdname(mddev));
  4313. mddev->sysfs_action = sysfs_get_dirent_safe(mddev->kobj.sd, "sync_action");
  4314. } else if (mddev->ro == 2) /* auto-readonly not meaningful */
  4315. mddev->ro = 0;
  4316. atomic_set(&mddev->writes_pending,0);
  4317. atomic_set(&mddev->max_corr_read_errors,
  4318. MD_DEFAULT_MAX_CORRECTED_READ_ERRORS);
  4319. mddev->safemode = 0;
  4320. mddev->safemode_timer.function = md_safemode_timeout;
  4321. mddev->safemode_timer.data = (unsigned long) mddev;
  4322. mddev->safemode_delay = (200 * HZ)/1000 +1; /* 200 msec delay */
  4323. mddev->in_sync = 1;
  4324. smp_wmb();
  4325. mddev->ready = 1;
  4326. list_for_each_entry(rdev, &mddev->disks, same_set)
  4327. if (rdev->raid_disk >= 0)
  4328. if (sysfs_link_rdev(mddev, rdev))
  4329. /* failure here is OK */;
  4330. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  4331. if (mddev->flags)
  4332. md_update_sb(mddev, 0);
  4333. md_new_event(mddev);
  4334. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4335. sysfs_notify_dirent_safe(mddev->sysfs_action);
  4336. sysfs_notify(&mddev->kobj, NULL, "degraded");
  4337. return 0;
  4338. }
  4339. EXPORT_SYMBOL_GPL(md_run);
  4340. static int do_md_run(mddev_t *mddev)
  4341. {
  4342. int err;
  4343. err = md_run(mddev);
  4344. if (err)
  4345. goto out;
  4346. err = bitmap_load(mddev);
  4347. if (err) {
  4348. bitmap_destroy(mddev);
  4349. goto out;
  4350. }
  4351. md_wakeup_thread(mddev->thread);
  4352. md_wakeup_thread(mddev->sync_thread); /* possibly kick off a reshape */
  4353. set_capacity(mddev->gendisk, mddev->array_sectors);
  4354. revalidate_disk(mddev->gendisk);
  4355. mddev->changed = 1;
  4356. kobject_uevent(&disk_to_dev(mddev->gendisk)->kobj, KOBJ_CHANGE);
  4357. out:
  4358. return err;
  4359. }
  4360. static int restart_array(mddev_t *mddev)
  4361. {
  4362. struct gendisk *disk = mddev->gendisk;
  4363. /* Complain if it has no devices */
  4364. if (list_empty(&mddev->disks))
  4365. return -ENXIO;
  4366. if (!mddev->pers)
  4367. return -EINVAL;
  4368. if (!mddev->ro)
  4369. return -EBUSY;
  4370. mddev->safemode = 0;
  4371. mddev->ro = 0;
  4372. set_disk_ro(disk, 0);
  4373. printk(KERN_INFO "md: %s switched to read-write mode.\n",
  4374. mdname(mddev));
  4375. /* Kick recovery or resync if necessary */
  4376. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  4377. md_wakeup_thread(mddev->thread);
  4378. md_wakeup_thread(mddev->sync_thread);
  4379. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4380. return 0;
  4381. }
  4382. /* similar to deny_write_access, but accounts for our holding a reference
  4383. * to the file ourselves */
  4384. static int deny_bitmap_write_access(struct file * file)
  4385. {
  4386. struct inode *inode = file->f_mapping->host;
  4387. spin_lock(&inode->i_lock);
  4388. if (atomic_read(&inode->i_writecount) > 1) {
  4389. spin_unlock(&inode->i_lock);
  4390. return -ETXTBSY;
  4391. }
  4392. atomic_set(&inode->i_writecount, -1);
  4393. spin_unlock(&inode->i_lock);
  4394. return 0;
  4395. }
  4396. void restore_bitmap_write_access(struct file *file)
  4397. {
  4398. struct inode *inode = file->f_mapping->host;
  4399. spin_lock(&inode->i_lock);
  4400. atomic_set(&inode->i_writecount, 1);
  4401. spin_unlock(&inode->i_lock);
  4402. }
  4403. static void md_clean(mddev_t *mddev)
  4404. {
  4405. mddev->array_sectors = 0;
  4406. mddev->external_size = 0;
  4407. mddev->dev_sectors = 0;
  4408. mddev->raid_disks = 0;
  4409. mddev->recovery_cp = 0;
  4410. mddev->resync_min = 0;
  4411. mddev->resync_max = MaxSector;
  4412. mddev->reshape_position = MaxSector;
  4413. mddev->external = 0;
  4414. mddev->persistent = 0;
  4415. mddev->level = LEVEL_NONE;
  4416. mddev->clevel[0] = 0;
  4417. mddev->flags = 0;
  4418. mddev->ro = 0;
  4419. mddev->metadata_type[0] = 0;
  4420. mddev->chunk_sectors = 0;
  4421. mddev->ctime = mddev->utime = 0;
  4422. mddev->layout = 0;
  4423. mddev->max_disks = 0;
  4424. mddev->events = 0;
  4425. mddev->can_decrease_events = 0;
  4426. mddev->delta_disks = 0;
  4427. mddev->new_level = LEVEL_NONE;
  4428. mddev->new_layout = 0;
  4429. mddev->new_chunk_sectors = 0;
  4430. mddev->curr_resync = 0;
  4431. mddev->resync_mismatches = 0;
  4432. mddev->suspend_lo = mddev->suspend_hi = 0;
  4433. mddev->sync_speed_min = mddev->sync_speed_max = 0;
  4434. mddev->recovery = 0;
  4435. mddev->in_sync = 0;
  4436. mddev->changed = 0;
  4437. mddev->degraded = 0;
  4438. mddev->safemode = 0;
  4439. mddev->bitmap_info.offset = 0;
  4440. mddev->bitmap_info.default_offset = 0;
  4441. mddev->bitmap_info.chunksize = 0;
  4442. mddev->bitmap_info.daemon_sleep = 0;
  4443. mddev->bitmap_info.max_write_behind = 0;
  4444. }
  4445. static void __md_stop_writes(mddev_t *mddev)
  4446. {
  4447. if (mddev->sync_thread) {
  4448. set_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  4449. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  4450. reap_sync_thread(mddev);
  4451. }
  4452. del_timer_sync(&mddev->safemode_timer);
  4453. bitmap_flush(mddev);
  4454. md_super_wait(mddev);
  4455. if (!mddev->in_sync || mddev->flags) {
  4456. /* mark array as shutdown cleanly */
  4457. mddev->in_sync = 1;
  4458. md_update_sb(mddev, 1);
  4459. }
  4460. }
  4461. void md_stop_writes(mddev_t *mddev)
  4462. {
  4463. mddev_lock(mddev);
  4464. __md_stop_writes(mddev);
  4465. mddev_unlock(mddev);
  4466. }
  4467. EXPORT_SYMBOL_GPL(md_stop_writes);
  4468. void md_stop(mddev_t *mddev)
  4469. {
  4470. mddev->ready = 0;
  4471. mddev->pers->stop(mddev);
  4472. if (mddev->pers->sync_request && mddev->to_remove == NULL)
  4473. mddev->to_remove = &md_redundancy_group;
  4474. module_put(mddev->pers->owner);
  4475. mddev->pers = NULL;
  4476. clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  4477. }
  4478. EXPORT_SYMBOL_GPL(md_stop);
  4479. static int md_set_readonly(mddev_t *mddev, int is_open)
  4480. {
  4481. int err = 0;
  4482. mutex_lock(&mddev->open_mutex);
  4483. if (atomic_read(&mddev->openers) > is_open) {
  4484. printk("md: %s still in use.\n",mdname(mddev));
  4485. err = -EBUSY;
  4486. goto out;
  4487. }
  4488. if (mddev->pers) {
  4489. __md_stop_writes(mddev);
  4490. err = -ENXIO;
  4491. if (mddev->ro==1)
  4492. goto out;
  4493. mddev->ro = 1;
  4494. set_disk_ro(mddev->gendisk, 1);
  4495. clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  4496. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4497. err = 0;
  4498. }
  4499. out:
  4500. mutex_unlock(&mddev->open_mutex);
  4501. return err;
  4502. }
  4503. /* mode:
  4504. * 0 - completely stop and dis-assemble array
  4505. * 2 - stop but do not disassemble array
  4506. */
  4507. static int do_md_stop(mddev_t * mddev, int mode, int is_open)
  4508. {
  4509. struct gendisk *disk = mddev->gendisk;
  4510. mdk_rdev_t *rdev;
  4511. mutex_lock(&mddev->open_mutex);
  4512. if (atomic_read(&mddev->openers) > is_open ||
  4513. mddev->sysfs_active) {
  4514. printk("md: %s still in use.\n",mdname(mddev));
  4515. mutex_unlock(&mddev->open_mutex);
  4516. return -EBUSY;
  4517. }
  4518. if (mddev->pers) {
  4519. if (mddev->ro)
  4520. set_disk_ro(disk, 0);
  4521. __md_stop_writes(mddev);
  4522. md_stop(mddev);
  4523. mddev->queue->merge_bvec_fn = NULL;
  4524. mddev->queue->backing_dev_info.congested_fn = NULL;
  4525. /* tell userspace to handle 'inactive' */
  4526. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4527. list_for_each_entry(rdev, &mddev->disks, same_set)
  4528. if (rdev->raid_disk >= 0)
  4529. sysfs_unlink_rdev(mddev, rdev);
  4530. set_capacity(disk, 0);
  4531. mutex_unlock(&mddev->open_mutex);
  4532. mddev->changed = 1;
  4533. revalidate_disk(disk);
  4534. if (mddev->ro)
  4535. mddev->ro = 0;
  4536. } else
  4537. mutex_unlock(&mddev->open_mutex);
  4538. /*
  4539. * Free resources if final stop
  4540. */
  4541. if (mode == 0) {
  4542. printk(KERN_INFO "md: %s stopped.\n", mdname(mddev));
  4543. bitmap_destroy(mddev);
  4544. if (mddev->bitmap_info.file) {
  4545. restore_bitmap_write_access(mddev->bitmap_info.file);
  4546. fput(mddev->bitmap_info.file);
  4547. mddev->bitmap_info.file = NULL;
  4548. }
  4549. mddev->bitmap_info.offset = 0;
  4550. export_array(mddev);
  4551. md_clean(mddev);
  4552. kobject_uevent(&disk_to_dev(mddev->gendisk)->kobj, KOBJ_CHANGE);
  4553. if (mddev->hold_active == UNTIL_STOP)
  4554. mddev->hold_active = 0;
  4555. }
  4556. blk_integrity_unregister(disk);
  4557. md_new_event(mddev);
  4558. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4559. return 0;
  4560. }
  4561. #ifndef MODULE
  4562. static void autorun_array(mddev_t *mddev)
  4563. {
  4564. mdk_rdev_t *rdev;
  4565. int err;
  4566. if (list_empty(&mddev->disks))
  4567. return;
  4568. printk(KERN_INFO "md: running: ");
  4569. list_for_each_entry(rdev, &mddev->disks, same_set) {
  4570. char b[BDEVNAME_SIZE];
  4571. printk("<%s>", bdevname(rdev->bdev,b));
  4572. }
  4573. printk("\n");
  4574. err = do_md_run(mddev);
  4575. if (err) {
  4576. printk(KERN_WARNING "md: do_md_run() returned %d\n", err);
  4577. do_md_stop(mddev, 0, 0);
  4578. }
  4579. }
  4580. /*
  4581. * lets try to run arrays based on all disks that have arrived
  4582. * until now. (those are in pending_raid_disks)
  4583. *
  4584. * the method: pick the first pending disk, collect all disks with
  4585. * the same UUID, remove all from the pending list and put them into
  4586. * the 'same_array' list. Then order this list based on superblock
  4587. * update time (freshest comes first), kick out 'old' disks and
  4588. * compare superblocks. If everything's fine then run it.
  4589. *
  4590. * If "unit" is allocated, then bump its reference count
  4591. */
  4592. static void autorun_devices(int part)
  4593. {
  4594. mdk_rdev_t *rdev0, *rdev, *tmp;
  4595. mddev_t *mddev;
  4596. char b[BDEVNAME_SIZE];
  4597. printk(KERN_INFO "md: autorun ...\n");
  4598. while (!list_empty(&pending_raid_disks)) {
  4599. int unit;
  4600. dev_t dev;
  4601. LIST_HEAD(candidates);
  4602. rdev0 = list_entry(pending_raid_disks.next,
  4603. mdk_rdev_t, same_set);
  4604. printk(KERN_INFO "md: considering %s ...\n",
  4605. bdevname(rdev0->bdev,b));
  4606. INIT_LIST_HEAD(&candidates);
  4607. rdev_for_each_list(rdev, tmp, &pending_raid_disks)
  4608. if (super_90_load(rdev, rdev0, 0) >= 0) {
  4609. printk(KERN_INFO "md: adding %s ...\n",
  4610. bdevname(rdev->bdev,b));
  4611. list_move(&rdev->same_set, &candidates);
  4612. }
  4613. /*
  4614. * now we have a set of devices, with all of them having
  4615. * mostly sane superblocks. It's time to allocate the
  4616. * mddev.
  4617. */
  4618. if (part) {
  4619. dev = MKDEV(mdp_major,
  4620. rdev0->preferred_minor << MdpMinorShift);
  4621. unit = MINOR(dev) >> MdpMinorShift;
  4622. } else {
  4623. dev = MKDEV(MD_MAJOR, rdev0->preferred_minor);
  4624. unit = MINOR(dev);
  4625. }
  4626. if (rdev0->preferred_minor != unit) {
  4627. printk(KERN_INFO "md: unit number in %s is bad: %d\n",
  4628. bdevname(rdev0->bdev, b), rdev0->preferred_minor);
  4629. break;
  4630. }
  4631. md_probe(dev, NULL, NULL);
  4632. mddev = mddev_find(dev);
  4633. if (!mddev || !mddev->gendisk) {
  4634. if (mddev)
  4635. mddev_put(mddev);
  4636. printk(KERN_ERR
  4637. "md: cannot allocate memory for md drive.\n");
  4638. break;
  4639. }
  4640. if (mddev_lock(mddev))
  4641. printk(KERN_WARNING "md: %s locked, cannot run\n",
  4642. mdname(mddev));
  4643. else if (mddev->raid_disks || mddev->major_version
  4644. || !list_empty(&mddev->disks)) {
  4645. printk(KERN_WARNING
  4646. "md: %s already running, cannot run %s\n",
  4647. mdname(mddev), bdevname(rdev0->bdev,b));
  4648. mddev_unlock(mddev);
  4649. } else {
  4650. printk(KERN_INFO "md: created %s\n", mdname(mddev));
  4651. mddev->persistent = 1;
  4652. rdev_for_each_list(rdev, tmp, &candidates) {
  4653. list_del_init(&rdev->same_set);
  4654. if (bind_rdev_to_array(rdev, mddev))
  4655. export_rdev(rdev);
  4656. }
  4657. autorun_array(mddev);
  4658. mddev_unlock(mddev);
  4659. }
  4660. /* on success, candidates will be empty, on error
  4661. * it won't...
  4662. */
  4663. rdev_for_each_list(rdev, tmp, &candidates) {
  4664. list_del_init(&rdev->same_set);
  4665. export_rdev(rdev);
  4666. }
  4667. mddev_put(mddev);
  4668. }
  4669. printk(KERN_INFO "md: ... autorun DONE.\n");
  4670. }
  4671. #endif /* !MODULE */
  4672. static int get_version(void __user * arg)
  4673. {
  4674. mdu_version_t ver;
  4675. ver.major = MD_MAJOR_VERSION;
  4676. ver.minor = MD_MINOR_VERSION;
  4677. ver.patchlevel = MD_PATCHLEVEL_VERSION;
  4678. if (copy_to_user(arg, &ver, sizeof(ver)))
  4679. return -EFAULT;
  4680. return 0;
  4681. }
  4682. static int get_array_info(mddev_t * mddev, void __user * arg)
  4683. {
  4684. mdu_array_info_t info;
  4685. int nr,working,insync,failed,spare;
  4686. mdk_rdev_t *rdev;
  4687. nr=working=insync=failed=spare=0;
  4688. list_for_each_entry(rdev, &mddev->disks, same_set) {
  4689. nr++;
  4690. if (test_bit(Faulty, &rdev->flags))
  4691. failed++;
  4692. else {
  4693. working++;
  4694. if (test_bit(In_sync, &rdev->flags))
  4695. insync++;
  4696. else
  4697. spare++;
  4698. }
  4699. }
  4700. info.major_version = mddev->major_version;
  4701. info.minor_version = mddev->minor_version;
  4702. info.patch_version = MD_PATCHLEVEL_VERSION;
  4703. info.ctime = mddev->ctime;
  4704. info.level = mddev->level;
  4705. info.size = mddev->dev_sectors / 2;
  4706. if (info.size != mddev->dev_sectors / 2) /* overflow */
  4707. info.size = -1;
  4708. info.nr_disks = nr;
  4709. info.raid_disks = mddev->raid_disks;
  4710. info.md_minor = mddev->md_minor;
  4711. info.not_persistent= !mddev->persistent;
  4712. info.utime = mddev->utime;
  4713. info.state = 0;
  4714. if (mddev->in_sync)
  4715. info.state = (1<<MD_SB_CLEAN);
  4716. if (mddev->bitmap && mddev->bitmap_info.offset)
  4717. info.state = (1<<MD_SB_BITMAP_PRESENT);
  4718. info.active_disks = insync;
  4719. info.working_disks = working;
  4720. info.failed_disks = failed;
  4721. info.spare_disks = spare;
  4722. info.layout = mddev->layout;
  4723. info.chunk_size = mddev->chunk_sectors << 9;
  4724. if (copy_to_user(arg, &info, sizeof(info)))
  4725. return -EFAULT;
  4726. return 0;
  4727. }
  4728. static int get_bitmap_file(mddev_t * mddev, void __user * arg)
  4729. {
  4730. mdu_bitmap_file_t *file = NULL; /* too big for stack allocation */
  4731. char *ptr, *buf = NULL;
  4732. int err = -ENOMEM;
  4733. if (md_allow_write(mddev))
  4734. file = kmalloc(sizeof(*file), GFP_NOIO);
  4735. else
  4736. file = kmalloc(sizeof(*file), GFP_KERNEL);
  4737. if (!file)
  4738. goto out;
  4739. /* bitmap disabled, zero the first byte and copy out */
  4740. if (!mddev->bitmap || !mddev->bitmap->file) {
  4741. file->pathname[0] = '\0';
  4742. goto copy_out;
  4743. }
  4744. buf = kmalloc(sizeof(file->pathname), GFP_KERNEL);
  4745. if (!buf)
  4746. goto out;
  4747. ptr = d_path(&mddev->bitmap->file->f_path, buf, sizeof(file->pathname));
  4748. if (IS_ERR(ptr))
  4749. goto out;
  4750. strcpy(file->pathname, ptr);
  4751. copy_out:
  4752. err = 0;
  4753. if (copy_to_user(arg, file, sizeof(*file)))
  4754. err = -EFAULT;
  4755. out:
  4756. kfree(buf);
  4757. kfree(file);
  4758. return err;
  4759. }
  4760. static int get_disk_info(mddev_t * mddev, void __user * arg)
  4761. {
  4762. mdu_disk_info_t info;
  4763. mdk_rdev_t *rdev;
  4764. if (copy_from_user(&info, arg, sizeof(info)))
  4765. return -EFAULT;
  4766. rdev = find_rdev_nr(mddev, info.number);
  4767. if (rdev) {
  4768. info.major = MAJOR(rdev->bdev->bd_dev);
  4769. info.minor = MINOR(rdev->bdev->bd_dev);
  4770. info.raid_disk = rdev->raid_disk;
  4771. info.state = 0;
  4772. if (test_bit(Faulty, &rdev->flags))
  4773. info.state |= (1<<MD_DISK_FAULTY);
  4774. else if (test_bit(In_sync, &rdev->flags)) {
  4775. info.state |= (1<<MD_DISK_ACTIVE);
  4776. info.state |= (1<<MD_DISK_SYNC);
  4777. }
  4778. if (test_bit(WriteMostly, &rdev->flags))
  4779. info.state |= (1<<MD_DISK_WRITEMOSTLY);
  4780. } else {
  4781. info.major = info.minor = 0;
  4782. info.raid_disk = -1;
  4783. info.state = (1<<MD_DISK_REMOVED);
  4784. }
  4785. if (copy_to_user(arg, &info, sizeof(info)))
  4786. return -EFAULT;
  4787. return 0;
  4788. }
  4789. static int add_new_disk(mddev_t * mddev, mdu_disk_info_t *info)
  4790. {
  4791. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  4792. mdk_rdev_t *rdev;
  4793. dev_t dev = MKDEV(info->major,info->minor);
  4794. if (info->major != MAJOR(dev) || info->minor != MINOR(dev))
  4795. return -EOVERFLOW;
  4796. if (!mddev->raid_disks) {
  4797. int err;
  4798. /* expecting a device which has a superblock */
  4799. rdev = md_import_device(dev, mddev->major_version, mddev->minor_version);
  4800. if (IS_ERR(rdev)) {
  4801. printk(KERN_WARNING
  4802. "md: md_import_device returned %ld\n",
  4803. PTR_ERR(rdev));
  4804. return PTR_ERR(rdev);
  4805. }
  4806. if (!list_empty(&mddev->disks)) {
  4807. mdk_rdev_t *rdev0 = list_entry(mddev->disks.next,
  4808. mdk_rdev_t, same_set);
  4809. err = super_types[mddev->major_version]
  4810. .load_super(rdev, rdev0, mddev->minor_version);
  4811. if (err < 0) {
  4812. printk(KERN_WARNING
  4813. "md: %s has different UUID to %s\n",
  4814. bdevname(rdev->bdev,b),
  4815. bdevname(rdev0->bdev,b2));
  4816. export_rdev(rdev);
  4817. return -EINVAL;
  4818. }
  4819. }
  4820. err = bind_rdev_to_array(rdev, mddev);
  4821. if (err)
  4822. export_rdev(rdev);
  4823. return err;
  4824. }
  4825. /*
  4826. * add_new_disk can be used once the array is assembled
  4827. * to add "hot spares". They must already have a superblock
  4828. * written
  4829. */
  4830. if (mddev->pers) {
  4831. int err;
  4832. if (!mddev->pers->hot_add_disk) {
  4833. printk(KERN_WARNING
  4834. "%s: personality does not support diskops!\n",
  4835. mdname(mddev));
  4836. return -EINVAL;
  4837. }
  4838. if (mddev->persistent)
  4839. rdev = md_import_device(dev, mddev->major_version,
  4840. mddev->minor_version);
  4841. else
  4842. rdev = md_import_device(dev, -1, -1);
  4843. if (IS_ERR(rdev)) {
  4844. printk(KERN_WARNING
  4845. "md: md_import_device returned %ld\n",
  4846. PTR_ERR(rdev));
  4847. return PTR_ERR(rdev);
  4848. }
  4849. /* set saved_raid_disk if appropriate */
  4850. if (!mddev->persistent) {
  4851. if (info->state & (1<<MD_DISK_SYNC) &&
  4852. info->raid_disk < mddev->raid_disks) {
  4853. rdev->raid_disk = info->raid_disk;
  4854. set_bit(In_sync, &rdev->flags);
  4855. } else
  4856. rdev->raid_disk = -1;
  4857. } else
  4858. super_types[mddev->major_version].
  4859. validate_super(mddev, rdev);
  4860. if ((info->state & (1<<MD_DISK_SYNC)) &&
  4861. (!test_bit(In_sync, &rdev->flags) ||
  4862. rdev->raid_disk != info->raid_disk)) {
  4863. /* This was a hot-add request, but events doesn't
  4864. * match, so reject it.
  4865. */
  4866. export_rdev(rdev);
  4867. return -EINVAL;
  4868. }
  4869. if (test_bit(In_sync, &rdev->flags))
  4870. rdev->saved_raid_disk = rdev->raid_disk;
  4871. else
  4872. rdev->saved_raid_disk = -1;
  4873. clear_bit(In_sync, &rdev->flags); /* just to be sure */
  4874. if (info->state & (1<<MD_DISK_WRITEMOSTLY))
  4875. set_bit(WriteMostly, &rdev->flags);
  4876. else
  4877. clear_bit(WriteMostly, &rdev->flags);
  4878. rdev->raid_disk = -1;
  4879. err = bind_rdev_to_array(rdev, mddev);
  4880. if (!err && !mddev->pers->hot_remove_disk) {
  4881. /* If there is hot_add_disk but no hot_remove_disk
  4882. * then added disks for geometry changes,
  4883. * and should be added immediately.
  4884. */
  4885. super_types[mddev->major_version].
  4886. validate_super(mddev, rdev);
  4887. err = mddev->pers->hot_add_disk(mddev, rdev);
  4888. if (err)
  4889. unbind_rdev_from_array(rdev);
  4890. }
  4891. if (err)
  4892. export_rdev(rdev);
  4893. else
  4894. sysfs_notify_dirent_safe(rdev->sysfs_state);
  4895. md_update_sb(mddev, 1);
  4896. if (mddev->degraded)
  4897. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  4898. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  4899. if (!err)
  4900. md_new_event(mddev);
  4901. md_wakeup_thread(mddev->thread);
  4902. return err;
  4903. }
  4904. /* otherwise, add_new_disk is only allowed
  4905. * for major_version==0 superblocks
  4906. */
  4907. if (mddev->major_version != 0) {
  4908. printk(KERN_WARNING "%s: ADD_NEW_DISK not supported\n",
  4909. mdname(mddev));
  4910. return -EINVAL;
  4911. }
  4912. if (!(info->state & (1<<MD_DISK_FAULTY))) {
  4913. int err;
  4914. rdev = md_import_device(dev, -1, 0);
  4915. if (IS_ERR(rdev)) {
  4916. printk(KERN_WARNING
  4917. "md: error, md_import_device() returned %ld\n",
  4918. PTR_ERR(rdev));
  4919. return PTR_ERR(rdev);
  4920. }
  4921. rdev->desc_nr = info->number;
  4922. if (info->raid_disk < mddev->raid_disks)
  4923. rdev->raid_disk = info->raid_disk;
  4924. else
  4925. rdev->raid_disk = -1;
  4926. if (rdev->raid_disk < mddev->raid_disks)
  4927. if (info->state & (1<<MD_DISK_SYNC))
  4928. set_bit(In_sync, &rdev->flags);
  4929. if (info->state & (1<<MD_DISK_WRITEMOSTLY))
  4930. set_bit(WriteMostly, &rdev->flags);
  4931. if (!mddev->persistent) {
  4932. printk(KERN_INFO "md: nonpersistent superblock ...\n");
  4933. rdev->sb_start = i_size_read(rdev->bdev->bd_inode) / 512;
  4934. } else
  4935. rdev->sb_start = calc_dev_sboffset(rdev);
  4936. rdev->sectors = rdev->sb_start;
  4937. err = bind_rdev_to_array(rdev, mddev);
  4938. if (err) {
  4939. export_rdev(rdev);
  4940. return err;
  4941. }
  4942. }
  4943. return 0;
  4944. }
  4945. static int hot_remove_disk(mddev_t * mddev, dev_t dev)
  4946. {
  4947. char b[BDEVNAME_SIZE];
  4948. mdk_rdev_t *rdev;
  4949. rdev = find_rdev(mddev, dev);
  4950. if (!rdev)
  4951. return -ENXIO;
  4952. if (rdev->raid_disk >= 0)
  4953. goto busy;
  4954. kick_rdev_from_array(rdev);
  4955. md_update_sb(mddev, 1);
  4956. md_new_event(mddev);
  4957. return 0;
  4958. busy:
  4959. printk(KERN_WARNING "md: cannot remove active disk %s from %s ...\n",
  4960. bdevname(rdev->bdev,b), mdname(mddev));
  4961. return -EBUSY;
  4962. }
  4963. static int hot_add_disk(mddev_t * mddev, dev_t dev)
  4964. {
  4965. char b[BDEVNAME_SIZE];
  4966. int err;
  4967. mdk_rdev_t *rdev;
  4968. if (!mddev->pers)
  4969. return -ENODEV;
  4970. if (mddev->major_version != 0) {
  4971. printk(KERN_WARNING "%s: HOT_ADD may only be used with"
  4972. " version-0 superblocks.\n",
  4973. mdname(mddev));
  4974. return -EINVAL;
  4975. }
  4976. if (!mddev->pers->hot_add_disk) {
  4977. printk(KERN_WARNING
  4978. "%s: personality does not support diskops!\n",
  4979. mdname(mddev));
  4980. return -EINVAL;
  4981. }
  4982. rdev = md_import_device(dev, -1, 0);
  4983. if (IS_ERR(rdev)) {
  4984. printk(KERN_WARNING
  4985. "md: error, md_import_device() returned %ld\n",
  4986. PTR_ERR(rdev));
  4987. return -EINVAL;
  4988. }
  4989. if (mddev->persistent)
  4990. rdev->sb_start = calc_dev_sboffset(rdev);
  4991. else
  4992. rdev->sb_start = i_size_read(rdev->bdev->bd_inode) / 512;
  4993. rdev->sectors = rdev->sb_start;
  4994. if (test_bit(Faulty, &rdev->flags)) {
  4995. printk(KERN_WARNING
  4996. "md: can not hot-add faulty %s disk to %s!\n",
  4997. bdevname(rdev->bdev,b), mdname(mddev));
  4998. err = -EINVAL;
  4999. goto abort_export;
  5000. }
  5001. clear_bit(In_sync, &rdev->flags);
  5002. rdev->desc_nr = -1;
  5003. rdev->saved_raid_disk = -1;
  5004. err = bind_rdev_to_array(rdev, mddev);
  5005. if (err)
  5006. goto abort_export;
  5007. /*
  5008. * The rest should better be atomic, we can have disk failures
  5009. * noticed in interrupt contexts ...
  5010. */
  5011. rdev->raid_disk = -1;
  5012. md_update_sb(mddev, 1);
  5013. /*
  5014. * Kick recovery, maybe this spare has to be added to the
  5015. * array immediately.
  5016. */
  5017. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  5018. md_wakeup_thread(mddev->thread);
  5019. md_new_event(mddev);
  5020. return 0;
  5021. abort_export:
  5022. export_rdev(rdev);
  5023. return err;
  5024. }
  5025. static int set_bitmap_file(mddev_t *mddev, int fd)
  5026. {
  5027. int err;
  5028. if (mddev->pers) {
  5029. if (!mddev->pers->quiesce)
  5030. return -EBUSY;
  5031. if (mddev->recovery || mddev->sync_thread)
  5032. return -EBUSY;
  5033. /* we should be able to change the bitmap.. */
  5034. }
  5035. if (fd >= 0) {
  5036. if (mddev->bitmap)
  5037. return -EEXIST; /* cannot add when bitmap is present */
  5038. mddev->bitmap_info.file = fget(fd);
  5039. if (mddev->bitmap_info.file == NULL) {
  5040. printk(KERN_ERR "%s: error: failed to get bitmap file\n",
  5041. mdname(mddev));
  5042. return -EBADF;
  5043. }
  5044. err = deny_bitmap_write_access(mddev->bitmap_info.file);
  5045. if (err) {
  5046. printk(KERN_ERR "%s: error: bitmap file is already in use\n",
  5047. mdname(mddev));
  5048. fput(mddev->bitmap_info.file);
  5049. mddev->bitmap_info.file = NULL;
  5050. return err;
  5051. }
  5052. mddev->bitmap_info.offset = 0; /* file overrides offset */
  5053. } else if (mddev->bitmap == NULL)
  5054. return -ENOENT; /* cannot remove what isn't there */
  5055. err = 0;
  5056. if (mddev->pers) {
  5057. mddev->pers->quiesce(mddev, 1);
  5058. if (fd >= 0) {
  5059. err = bitmap_create(mddev);
  5060. if (!err)
  5061. err = bitmap_load(mddev);
  5062. }
  5063. if (fd < 0 || err) {
  5064. bitmap_destroy(mddev);
  5065. fd = -1; /* make sure to put the file */
  5066. }
  5067. mddev->pers->quiesce(mddev, 0);
  5068. }
  5069. if (fd < 0) {
  5070. if (mddev->bitmap_info.file) {
  5071. restore_bitmap_write_access(mddev->bitmap_info.file);
  5072. fput(mddev->bitmap_info.file);
  5073. }
  5074. mddev->bitmap_info.file = NULL;
  5075. }
  5076. return err;
  5077. }
  5078. /*
  5079. * set_array_info is used two different ways
  5080. * The original usage is when creating a new array.
  5081. * In this usage, raid_disks is > 0 and it together with
  5082. * level, size, not_persistent,layout,chunksize determine the
  5083. * shape of the array.
  5084. * This will always create an array with a type-0.90.0 superblock.
  5085. * The newer usage is when assembling an array.
  5086. * In this case raid_disks will be 0, and the major_version field is
  5087. * use to determine which style super-blocks are to be found on the devices.
  5088. * The minor and patch _version numbers are also kept incase the
  5089. * super_block handler wishes to interpret them.
  5090. */
  5091. static int set_array_info(mddev_t * mddev, mdu_array_info_t *info)
  5092. {
  5093. if (info->raid_disks == 0) {
  5094. /* just setting version number for superblock loading */
  5095. if (info->major_version < 0 ||
  5096. info->major_version >= ARRAY_SIZE(super_types) ||
  5097. super_types[info->major_version].name == NULL) {
  5098. /* maybe try to auto-load a module? */
  5099. printk(KERN_INFO
  5100. "md: superblock version %d not known\n",
  5101. info->major_version);
  5102. return -EINVAL;
  5103. }
  5104. mddev->major_version = info->major_version;
  5105. mddev->minor_version = info->minor_version;
  5106. mddev->patch_version = info->patch_version;
  5107. mddev->persistent = !info->not_persistent;
  5108. /* ensure mddev_put doesn't delete this now that there
  5109. * is some minimal configuration.
  5110. */
  5111. mddev->ctime = get_seconds();
  5112. return 0;
  5113. }
  5114. mddev->major_version = MD_MAJOR_VERSION;
  5115. mddev->minor_version = MD_MINOR_VERSION;
  5116. mddev->patch_version = MD_PATCHLEVEL_VERSION;
  5117. mddev->ctime = get_seconds();
  5118. mddev->level = info->level;
  5119. mddev->clevel[0] = 0;
  5120. mddev->dev_sectors = 2 * (sector_t)info->size;
  5121. mddev->raid_disks = info->raid_disks;
  5122. /* don't set md_minor, it is determined by which /dev/md* was
  5123. * openned
  5124. */
  5125. if (info->state & (1<<MD_SB_CLEAN))
  5126. mddev->recovery_cp = MaxSector;
  5127. else
  5128. mddev->recovery_cp = 0;
  5129. mddev->persistent = ! info->not_persistent;
  5130. mddev->external = 0;
  5131. mddev->layout = info->layout;
  5132. mddev->chunk_sectors = info->chunk_size >> 9;
  5133. mddev->max_disks = MD_SB_DISKS;
  5134. if (mddev->persistent)
  5135. mddev->flags = 0;
  5136. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  5137. mddev->bitmap_info.default_offset = MD_SB_BYTES >> 9;
  5138. mddev->bitmap_info.offset = 0;
  5139. mddev->reshape_position = MaxSector;
  5140. /*
  5141. * Generate a 128 bit UUID
  5142. */
  5143. get_random_bytes(mddev->uuid, 16);
  5144. mddev->new_level = mddev->level;
  5145. mddev->new_chunk_sectors = mddev->chunk_sectors;
  5146. mddev->new_layout = mddev->layout;
  5147. mddev->delta_disks = 0;
  5148. return 0;
  5149. }
  5150. void md_set_array_sectors(mddev_t *mddev, sector_t array_sectors)
  5151. {
  5152. WARN(!mddev_is_locked(mddev), "%s: unlocked mddev!\n", __func__);
  5153. if (mddev->external_size)
  5154. return;
  5155. mddev->array_sectors = array_sectors;
  5156. }
  5157. EXPORT_SYMBOL(md_set_array_sectors);
  5158. static int update_size(mddev_t *mddev, sector_t num_sectors)
  5159. {
  5160. mdk_rdev_t *rdev;
  5161. int rv;
  5162. int fit = (num_sectors == 0);
  5163. if (mddev->pers->resize == NULL)
  5164. return -EINVAL;
  5165. /* The "num_sectors" is the number of sectors of each device that
  5166. * is used. This can only make sense for arrays with redundancy.
  5167. * linear and raid0 always use whatever space is available. We can only
  5168. * consider changing this number if no resync or reconstruction is
  5169. * happening, and if the new size is acceptable. It must fit before the
  5170. * sb_start or, if that is <data_offset, it must fit before the size
  5171. * of each device. If num_sectors is zero, we find the largest size
  5172. * that fits.
  5173. */
  5174. if (mddev->sync_thread)
  5175. return -EBUSY;
  5176. if (mddev->bitmap)
  5177. /* Sorry, cannot grow a bitmap yet, just remove it,
  5178. * grow, and re-add.
  5179. */
  5180. return -EBUSY;
  5181. list_for_each_entry(rdev, &mddev->disks, same_set) {
  5182. sector_t avail = rdev->sectors;
  5183. if (fit && (num_sectors == 0 || num_sectors > avail))
  5184. num_sectors = avail;
  5185. if (avail < num_sectors)
  5186. return -ENOSPC;
  5187. }
  5188. rv = mddev->pers->resize(mddev, num_sectors);
  5189. if (!rv)
  5190. revalidate_disk(mddev->gendisk);
  5191. return rv;
  5192. }
  5193. static int update_raid_disks(mddev_t *mddev, int raid_disks)
  5194. {
  5195. int rv;
  5196. /* change the number of raid disks */
  5197. if (mddev->pers->check_reshape == NULL)
  5198. return -EINVAL;
  5199. if (raid_disks <= 0 ||
  5200. (mddev->max_disks && raid_disks >= mddev->max_disks))
  5201. return -EINVAL;
  5202. if (mddev->sync_thread || mddev->reshape_position != MaxSector)
  5203. return -EBUSY;
  5204. mddev->delta_disks = raid_disks - mddev->raid_disks;
  5205. rv = mddev->pers->check_reshape(mddev);
  5206. if (rv < 0)
  5207. mddev->delta_disks = 0;
  5208. return rv;
  5209. }
  5210. /*
  5211. * update_array_info is used to change the configuration of an
  5212. * on-line array.
  5213. * The version, ctime,level,size,raid_disks,not_persistent, layout,chunk_size
  5214. * fields in the info are checked against the array.
  5215. * Any differences that cannot be handled will cause an error.
  5216. * Normally, only one change can be managed at a time.
  5217. */
  5218. static int update_array_info(mddev_t *mddev, mdu_array_info_t *info)
  5219. {
  5220. int rv = 0;
  5221. int cnt = 0;
  5222. int state = 0;
  5223. /* calculate expected state,ignoring low bits */
  5224. if (mddev->bitmap && mddev->bitmap_info.offset)
  5225. state |= (1 << MD_SB_BITMAP_PRESENT);
  5226. if (mddev->major_version != info->major_version ||
  5227. mddev->minor_version != info->minor_version ||
  5228. /* mddev->patch_version != info->patch_version || */
  5229. mddev->ctime != info->ctime ||
  5230. mddev->level != info->level ||
  5231. /* mddev->layout != info->layout || */
  5232. !mddev->persistent != info->not_persistent||
  5233. mddev->chunk_sectors != info->chunk_size >> 9 ||
  5234. /* ignore bottom 8 bits of state, and allow SB_BITMAP_PRESENT to change */
  5235. ((state^info->state) & 0xfffffe00)
  5236. )
  5237. return -EINVAL;
  5238. /* Check there is only one change */
  5239. if (info->size >= 0 && mddev->dev_sectors / 2 != info->size)
  5240. cnt++;
  5241. if (mddev->raid_disks != info->raid_disks)
  5242. cnt++;
  5243. if (mddev->layout != info->layout)
  5244. cnt++;
  5245. if ((state ^ info->state) & (1<<MD_SB_BITMAP_PRESENT))
  5246. cnt++;
  5247. if (cnt == 0)
  5248. return 0;
  5249. if (cnt > 1)
  5250. return -EINVAL;
  5251. if (mddev->layout != info->layout) {
  5252. /* Change layout
  5253. * we don't need to do anything at the md level, the
  5254. * personality will take care of it all.
  5255. */
  5256. if (mddev->pers->check_reshape == NULL)
  5257. return -EINVAL;
  5258. else {
  5259. mddev->new_layout = info->layout;
  5260. rv = mddev->pers->check_reshape(mddev);
  5261. if (rv)
  5262. mddev->new_layout = mddev->layout;
  5263. return rv;
  5264. }
  5265. }
  5266. if (info->size >= 0 && mddev->dev_sectors / 2 != info->size)
  5267. rv = update_size(mddev, (sector_t)info->size * 2);
  5268. if (mddev->raid_disks != info->raid_disks)
  5269. rv = update_raid_disks(mddev, info->raid_disks);
  5270. if ((state ^ info->state) & (1<<MD_SB_BITMAP_PRESENT)) {
  5271. if (mddev->pers->quiesce == NULL)
  5272. return -EINVAL;
  5273. if (mddev->recovery || mddev->sync_thread)
  5274. return -EBUSY;
  5275. if (info->state & (1<<MD_SB_BITMAP_PRESENT)) {
  5276. /* add the bitmap */
  5277. if (mddev->bitmap)
  5278. return -EEXIST;
  5279. if (mddev->bitmap_info.default_offset == 0)
  5280. return -EINVAL;
  5281. mddev->bitmap_info.offset =
  5282. mddev->bitmap_info.default_offset;
  5283. mddev->pers->quiesce(mddev, 1);
  5284. rv = bitmap_create(mddev);
  5285. if (!rv)
  5286. rv = bitmap_load(mddev);
  5287. if (rv)
  5288. bitmap_destroy(mddev);
  5289. mddev->pers->quiesce(mddev, 0);
  5290. } else {
  5291. /* remove the bitmap */
  5292. if (!mddev->bitmap)
  5293. return -ENOENT;
  5294. if (mddev->bitmap->file)
  5295. return -EINVAL;
  5296. mddev->pers->quiesce(mddev, 1);
  5297. bitmap_destroy(mddev);
  5298. mddev->pers->quiesce(mddev, 0);
  5299. mddev->bitmap_info.offset = 0;
  5300. }
  5301. }
  5302. md_update_sb(mddev, 1);
  5303. return rv;
  5304. }
  5305. static int set_disk_faulty(mddev_t *mddev, dev_t dev)
  5306. {
  5307. mdk_rdev_t *rdev;
  5308. if (mddev->pers == NULL)
  5309. return -ENODEV;
  5310. rdev = find_rdev(mddev, dev);
  5311. if (!rdev)
  5312. return -ENODEV;
  5313. md_error(mddev, rdev);
  5314. if (!test_bit(Faulty, &rdev->flags))
  5315. return -EBUSY;
  5316. return 0;
  5317. }
  5318. /*
  5319. * We have a problem here : there is no easy way to give a CHS
  5320. * virtual geometry. We currently pretend that we have a 2 heads
  5321. * 4 sectors (with a BIG number of cylinders...). This drives
  5322. * dosfs just mad... ;-)
  5323. */
  5324. static int md_getgeo(struct block_device *bdev, struct hd_geometry *geo)
  5325. {
  5326. mddev_t *mddev = bdev->bd_disk->private_data;
  5327. geo->heads = 2;
  5328. geo->sectors = 4;
  5329. geo->cylinders = mddev->array_sectors / 8;
  5330. return 0;
  5331. }
  5332. static int md_ioctl(struct block_device *bdev, fmode_t mode,
  5333. unsigned int cmd, unsigned long arg)
  5334. {
  5335. int err = 0;
  5336. void __user *argp = (void __user *)arg;
  5337. mddev_t *mddev = NULL;
  5338. int ro;
  5339. if (!capable(CAP_SYS_ADMIN))
  5340. return -EACCES;
  5341. /*
  5342. * Commands dealing with the RAID driver but not any
  5343. * particular array:
  5344. */
  5345. switch (cmd)
  5346. {
  5347. case RAID_VERSION:
  5348. err = get_version(argp);
  5349. goto done;
  5350. case PRINT_RAID_DEBUG:
  5351. err = 0;
  5352. md_print_devices();
  5353. goto done;
  5354. #ifndef MODULE
  5355. case RAID_AUTORUN:
  5356. err = 0;
  5357. autostart_arrays(arg);
  5358. goto done;
  5359. #endif
  5360. default:;
  5361. }
  5362. /*
  5363. * Commands creating/starting a new array:
  5364. */
  5365. mddev = bdev->bd_disk->private_data;
  5366. if (!mddev) {
  5367. BUG();
  5368. goto abort;
  5369. }
  5370. err = mddev_lock(mddev);
  5371. if (err) {
  5372. printk(KERN_INFO
  5373. "md: ioctl lock interrupted, reason %d, cmd %d\n",
  5374. err, cmd);
  5375. goto abort;
  5376. }
  5377. switch (cmd)
  5378. {
  5379. case SET_ARRAY_INFO:
  5380. {
  5381. mdu_array_info_t info;
  5382. if (!arg)
  5383. memset(&info, 0, sizeof(info));
  5384. else if (copy_from_user(&info, argp, sizeof(info))) {
  5385. err = -EFAULT;
  5386. goto abort_unlock;
  5387. }
  5388. if (mddev->pers) {
  5389. err = update_array_info(mddev, &info);
  5390. if (err) {
  5391. printk(KERN_WARNING "md: couldn't update"
  5392. " array info. %d\n", err);
  5393. goto abort_unlock;
  5394. }
  5395. goto done_unlock;
  5396. }
  5397. if (!list_empty(&mddev->disks)) {
  5398. printk(KERN_WARNING
  5399. "md: array %s already has disks!\n",
  5400. mdname(mddev));
  5401. err = -EBUSY;
  5402. goto abort_unlock;
  5403. }
  5404. if (mddev->raid_disks) {
  5405. printk(KERN_WARNING
  5406. "md: array %s already initialised!\n",
  5407. mdname(mddev));
  5408. err = -EBUSY;
  5409. goto abort_unlock;
  5410. }
  5411. err = set_array_info(mddev, &info);
  5412. if (err) {
  5413. printk(KERN_WARNING "md: couldn't set"
  5414. " array info. %d\n", err);
  5415. goto abort_unlock;
  5416. }
  5417. }
  5418. goto done_unlock;
  5419. default:;
  5420. }
  5421. /*
  5422. * Commands querying/configuring an existing array:
  5423. */
  5424. /* if we are not initialised yet, only ADD_NEW_DISK, STOP_ARRAY,
  5425. * RUN_ARRAY, and GET_ and SET_BITMAP_FILE are allowed */
  5426. if ((!mddev->raid_disks && !mddev->external)
  5427. && cmd != ADD_NEW_DISK && cmd != STOP_ARRAY
  5428. && cmd != RUN_ARRAY && cmd != SET_BITMAP_FILE
  5429. && cmd != GET_BITMAP_FILE) {
  5430. err = -ENODEV;
  5431. goto abort_unlock;
  5432. }
  5433. /*
  5434. * Commands even a read-only array can execute:
  5435. */
  5436. switch (cmd)
  5437. {
  5438. case GET_ARRAY_INFO:
  5439. err = get_array_info(mddev, argp);
  5440. goto done_unlock;
  5441. case GET_BITMAP_FILE:
  5442. err = get_bitmap_file(mddev, argp);
  5443. goto done_unlock;
  5444. case GET_DISK_INFO:
  5445. err = get_disk_info(mddev, argp);
  5446. goto done_unlock;
  5447. case RESTART_ARRAY_RW:
  5448. err = restart_array(mddev);
  5449. goto done_unlock;
  5450. case STOP_ARRAY:
  5451. err = do_md_stop(mddev, 0, 1);
  5452. goto done_unlock;
  5453. case STOP_ARRAY_RO:
  5454. err = md_set_readonly(mddev, 1);
  5455. goto done_unlock;
  5456. case BLKROSET:
  5457. if (get_user(ro, (int __user *)(arg))) {
  5458. err = -EFAULT;
  5459. goto done_unlock;
  5460. }
  5461. err = -EINVAL;
  5462. /* if the bdev is going readonly the value of mddev->ro
  5463. * does not matter, no writes are coming
  5464. */
  5465. if (ro)
  5466. goto done_unlock;
  5467. /* are we are already prepared for writes? */
  5468. if (mddev->ro != 1)
  5469. goto done_unlock;
  5470. /* transitioning to readauto need only happen for
  5471. * arrays that call md_write_start
  5472. */
  5473. if (mddev->pers) {
  5474. err = restart_array(mddev);
  5475. if (err == 0) {
  5476. mddev->ro = 2;
  5477. set_disk_ro(mddev->gendisk, 0);
  5478. }
  5479. }
  5480. goto done_unlock;
  5481. }
  5482. /*
  5483. * The remaining ioctls are changing the state of the
  5484. * superblock, so we do not allow them on read-only arrays.
  5485. * However non-MD ioctls (e.g. get-size) will still come through
  5486. * here and hit the 'default' below, so only disallow
  5487. * 'md' ioctls, and switch to rw mode if started auto-readonly.
  5488. */
  5489. if (_IOC_TYPE(cmd) == MD_MAJOR && mddev->ro && mddev->pers) {
  5490. if (mddev->ro == 2) {
  5491. mddev->ro = 0;
  5492. sysfs_notify_dirent_safe(mddev->sysfs_state);
  5493. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  5494. md_wakeup_thread(mddev->thread);
  5495. } else {
  5496. err = -EROFS;
  5497. goto abort_unlock;
  5498. }
  5499. }
  5500. switch (cmd)
  5501. {
  5502. case ADD_NEW_DISK:
  5503. {
  5504. mdu_disk_info_t info;
  5505. if (copy_from_user(&info, argp, sizeof(info)))
  5506. err = -EFAULT;
  5507. else
  5508. err = add_new_disk(mddev, &info);
  5509. goto done_unlock;
  5510. }
  5511. case HOT_REMOVE_DISK:
  5512. err = hot_remove_disk(mddev, new_decode_dev(arg));
  5513. goto done_unlock;
  5514. case HOT_ADD_DISK:
  5515. err = hot_add_disk(mddev, new_decode_dev(arg));
  5516. goto done_unlock;
  5517. case SET_DISK_FAULTY:
  5518. err = set_disk_faulty(mddev, new_decode_dev(arg));
  5519. goto done_unlock;
  5520. case RUN_ARRAY:
  5521. err = do_md_run(mddev);
  5522. goto done_unlock;
  5523. case SET_BITMAP_FILE:
  5524. err = set_bitmap_file(mddev, (int)arg);
  5525. goto done_unlock;
  5526. default:
  5527. err = -EINVAL;
  5528. goto abort_unlock;
  5529. }
  5530. done_unlock:
  5531. abort_unlock:
  5532. if (mddev->hold_active == UNTIL_IOCTL &&
  5533. err != -EINVAL)
  5534. mddev->hold_active = 0;
  5535. mddev_unlock(mddev);
  5536. return err;
  5537. done:
  5538. if (err)
  5539. MD_BUG();
  5540. abort:
  5541. return err;
  5542. }
  5543. #ifdef CONFIG_COMPAT
  5544. static int md_compat_ioctl(struct block_device *bdev, fmode_t mode,
  5545. unsigned int cmd, unsigned long arg)
  5546. {
  5547. switch (cmd) {
  5548. case HOT_REMOVE_DISK:
  5549. case HOT_ADD_DISK:
  5550. case SET_DISK_FAULTY:
  5551. case SET_BITMAP_FILE:
  5552. /* These take in integer arg, do not convert */
  5553. break;
  5554. default:
  5555. arg = (unsigned long)compat_ptr(arg);
  5556. break;
  5557. }
  5558. return md_ioctl(bdev, mode, cmd, arg);
  5559. }
  5560. #endif /* CONFIG_COMPAT */
  5561. static int md_open(struct block_device *bdev, fmode_t mode)
  5562. {
  5563. /*
  5564. * Succeed if we can lock the mddev, which confirms that
  5565. * it isn't being stopped right now.
  5566. */
  5567. mddev_t *mddev = mddev_find(bdev->bd_dev);
  5568. int err;
  5569. if (mddev->gendisk != bdev->bd_disk) {
  5570. /* we are racing with mddev_put which is discarding this
  5571. * bd_disk.
  5572. */
  5573. mddev_put(mddev);
  5574. /* Wait until bdev->bd_disk is definitely gone */
  5575. flush_workqueue(md_misc_wq);
  5576. /* Then retry the open from the top */
  5577. return -ERESTARTSYS;
  5578. }
  5579. BUG_ON(mddev != bdev->bd_disk->private_data);
  5580. if ((err = mutex_lock_interruptible(&mddev->open_mutex)))
  5581. goto out;
  5582. err = 0;
  5583. atomic_inc(&mddev->openers);
  5584. mutex_unlock(&mddev->open_mutex);
  5585. check_disk_change(bdev);
  5586. out:
  5587. return err;
  5588. }
  5589. static int md_release(struct gendisk *disk, fmode_t mode)
  5590. {
  5591. mddev_t *mddev = disk->private_data;
  5592. BUG_ON(!mddev);
  5593. atomic_dec(&mddev->openers);
  5594. mddev_put(mddev);
  5595. return 0;
  5596. }
  5597. static int md_media_changed(struct gendisk *disk)
  5598. {
  5599. mddev_t *mddev = disk->private_data;
  5600. return mddev->changed;
  5601. }
  5602. static int md_revalidate(struct gendisk *disk)
  5603. {
  5604. mddev_t *mddev = disk->private_data;
  5605. mddev->changed = 0;
  5606. return 0;
  5607. }
  5608. static const struct block_device_operations md_fops =
  5609. {
  5610. .owner = THIS_MODULE,
  5611. .open = md_open,
  5612. .release = md_release,
  5613. .ioctl = md_ioctl,
  5614. #ifdef CONFIG_COMPAT
  5615. .compat_ioctl = md_compat_ioctl,
  5616. #endif
  5617. .getgeo = md_getgeo,
  5618. .media_changed = md_media_changed,
  5619. .revalidate_disk= md_revalidate,
  5620. };
  5621. static int md_thread(void * arg)
  5622. {
  5623. mdk_thread_t *thread = arg;
  5624. /*
  5625. * md_thread is a 'system-thread', it's priority should be very
  5626. * high. We avoid resource deadlocks individually in each
  5627. * raid personality. (RAID5 does preallocation) We also use RR and
  5628. * the very same RT priority as kswapd, thus we will never get
  5629. * into a priority inversion deadlock.
  5630. *
  5631. * we definitely have to have equal or higher priority than
  5632. * bdflush, otherwise bdflush will deadlock if there are too
  5633. * many dirty RAID5 blocks.
  5634. */
  5635. allow_signal(SIGKILL);
  5636. while (!kthread_should_stop()) {
  5637. /* We need to wait INTERRUPTIBLE so that
  5638. * we don't add to the load-average.
  5639. * That means we need to be sure no signals are
  5640. * pending
  5641. */
  5642. if (signal_pending(current))
  5643. flush_signals(current);
  5644. wait_event_interruptible_timeout
  5645. (thread->wqueue,
  5646. test_bit(THREAD_WAKEUP, &thread->flags)
  5647. || kthread_should_stop(),
  5648. thread->timeout);
  5649. clear_bit(THREAD_WAKEUP, &thread->flags);
  5650. if (!kthread_should_stop())
  5651. thread->run(thread->mddev);
  5652. }
  5653. return 0;
  5654. }
  5655. void md_wakeup_thread(mdk_thread_t *thread)
  5656. {
  5657. if (thread) {
  5658. dprintk("md: waking up MD thread %s.\n", thread->tsk->comm);
  5659. set_bit(THREAD_WAKEUP, &thread->flags);
  5660. wake_up(&thread->wqueue);
  5661. }
  5662. }
  5663. mdk_thread_t *md_register_thread(void (*run) (mddev_t *), mddev_t *mddev,
  5664. const char *name)
  5665. {
  5666. mdk_thread_t *thread;
  5667. thread = kzalloc(sizeof(mdk_thread_t), GFP_KERNEL);
  5668. if (!thread)
  5669. return NULL;
  5670. init_waitqueue_head(&thread->wqueue);
  5671. thread->run = run;
  5672. thread->mddev = mddev;
  5673. thread->timeout = MAX_SCHEDULE_TIMEOUT;
  5674. thread->tsk = kthread_run(md_thread, thread,
  5675. "%s_%s",
  5676. mdname(thread->mddev),
  5677. name ?: mddev->pers->name);
  5678. if (IS_ERR(thread->tsk)) {
  5679. kfree(thread);
  5680. return NULL;
  5681. }
  5682. return thread;
  5683. }
  5684. void md_unregister_thread(mdk_thread_t *thread)
  5685. {
  5686. if (!thread)
  5687. return;
  5688. dprintk("interrupting MD-thread pid %d\n", task_pid_nr(thread->tsk));
  5689. kthread_stop(thread->tsk);
  5690. kfree(thread);
  5691. }
  5692. void md_error(mddev_t *mddev, mdk_rdev_t *rdev)
  5693. {
  5694. if (!mddev) {
  5695. MD_BUG();
  5696. return;
  5697. }
  5698. if (!rdev || test_bit(Faulty, &rdev->flags))
  5699. return;
  5700. if (!mddev->pers || !mddev->pers->error_handler)
  5701. return;
  5702. mddev->pers->error_handler(mddev,rdev);
  5703. if (mddev->degraded)
  5704. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  5705. sysfs_notify_dirent_safe(rdev->sysfs_state);
  5706. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  5707. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  5708. md_wakeup_thread(mddev->thread);
  5709. if (mddev->event_work.func)
  5710. queue_work(md_misc_wq, &mddev->event_work);
  5711. md_new_event_inintr(mddev);
  5712. }
  5713. /* seq_file implementation /proc/mdstat */
  5714. static void status_unused(struct seq_file *seq)
  5715. {
  5716. int i = 0;
  5717. mdk_rdev_t *rdev;
  5718. seq_printf(seq, "unused devices: ");
  5719. list_for_each_entry(rdev, &pending_raid_disks, same_set) {
  5720. char b[BDEVNAME_SIZE];
  5721. i++;
  5722. seq_printf(seq, "%s ",
  5723. bdevname(rdev->bdev,b));
  5724. }
  5725. if (!i)
  5726. seq_printf(seq, "<none>");
  5727. seq_printf(seq, "\n");
  5728. }
  5729. static void status_resync(struct seq_file *seq, mddev_t * mddev)
  5730. {
  5731. sector_t max_sectors, resync, res;
  5732. unsigned long dt, db;
  5733. sector_t rt;
  5734. int scale;
  5735. unsigned int per_milli;
  5736. resync = mddev->curr_resync - atomic_read(&mddev->recovery_active);
  5737. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  5738. max_sectors = mddev->resync_max_sectors;
  5739. else
  5740. max_sectors = mddev->dev_sectors;
  5741. /*
  5742. * Should not happen.
  5743. */
  5744. if (!max_sectors) {
  5745. MD_BUG();
  5746. return;
  5747. }
  5748. /* Pick 'scale' such that (resync>>scale)*1000 will fit
  5749. * in a sector_t, and (max_sectors>>scale) will fit in a
  5750. * u32, as those are the requirements for sector_div.
  5751. * Thus 'scale' must be at least 10
  5752. */
  5753. scale = 10;
  5754. if (sizeof(sector_t) > sizeof(unsigned long)) {
  5755. while ( max_sectors/2 > (1ULL<<(scale+32)))
  5756. scale++;
  5757. }
  5758. res = (resync>>scale)*1000;
  5759. sector_div(res, (u32)((max_sectors>>scale)+1));
  5760. per_milli = res;
  5761. {
  5762. int i, x = per_milli/50, y = 20-x;
  5763. seq_printf(seq, "[");
  5764. for (i = 0; i < x; i++)
  5765. seq_printf(seq, "=");
  5766. seq_printf(seq, ">");
  5767. for (i = 0; i < y; i++)
  5768. seq_printf(seq, ".");
  5769. seq_printf(seq, "] ");
  5770. }
  5771. seq_printf(seq, " %s =%3u.%u%% (%llu/%llu)",
  5772. (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)?
  5773. "reshape" :
  5774. (test_bit(MD_RECOVERY_CHECK, &mddev->recovery)?
  5775. "check" :
  5776. (test_bit(MD_RECOVERY_SYNC, &mddev->recovery) ?
  5777. "resync" : "recovery"))),
  5778. per_milli/10, per_milli % 10,
  5779. (unsigned long long) resync/2,
  5780. (unsigned long long) max_sectors/2);
  5781. /*
  5782. * dt: time from mark until now
  5783. * db: blocks written from mark until now
  5784. * rt: remaining time
  5785. *
  5786. * rt is a sector_t, so could be 32bit or 64bit.
  5787. * So we divide before multiply in case it is 32bit and close
  5788. * to the limit.
  5789. * We scale the divisor (db) by 32 to avoid losing precision
  5790. * near the end of resync when the number of remaining sectors
  5791. * is close to 'db'.
  5792. * We then divide rt by 32 after multiplying by db to compensate.
  5793. * The '+1' avoids division by zero if db is very small.
  5794. */
  5795. dt = ((jiffies - mddev->resync_mark) / HZ);
  5796. if (!dt) dt++;
  5797. db = (mddev->curr_mark_cnt - atomic_read(&mddev->recovery_active))
  5798. - mddev->resync_mark_cnt;
  5799. rt = max_sectors - resync; /* number of remaining sectors */
  5800. sector_div(rt, db/32+1);
  5801. rt *= dt;
  5802. rt >>= 5;
  5803. seq_printf(seq, " finish=%lu.%lumin", (unsigned long)rt / 60,
  5804. ((unsigned long)rt % 60)/6);
  5805. seq_printf(seq, " speed=%ldK/sec", db/2/dt);
  5806. }
  5807. static void *md_seq_start(struct seq_file *seq, loff_t *pos)
  5808. {
  5809. struct list_head *tmp;
  5810. loff_t l = *pos;
  5811. mddev_t *mddev;
  5812. if (l >= 0x10000)
  5813. return NULL;
  5814. if (!l--)
  5815. /* header */
  5816. return (void*)1;
  5817. spin_lock(&all_mddevs_lock);
  5818. list_for_each(tmp,&all_mddevs)
  5819. if (!l--) {
  5820. mddev = list_entry(tmp, mddev_t, all_mddevs);
  5821. mddev_get(mddev);
  5822. spin_unlock(&all_mddevs_lock);
  5823. return mddev;
  5824. }
  5825. spin_unlock(&all_mddevs_lock);
  5826. if (!l--)
  5827. return (void*)2;/* tail */
  5828. return NULL;
  5829. }
  5830. static void *md_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  5831. {
  5832. struct list_head *tmp;
  5833. mddev_t *next_mddev, *mddev = v;
  5834. ++*pos;
  5835. if (v == (void*)2)
  5836. return NULL;
  5837. spin_lock(&all_mddevs_lock);
  5838. if (v == (void*)1)
  5839. tmp = all_mddevs.next;
  5840. else
  5841. tmp = mddev->all_mddevs.next;
  5842. if (tmp != &all_mddevs)
  5843. next_mddev = mddev_get(list_entry(tmp,mddev_t,all_mddevs));
  5844. else {
  5845. next_mddev = (void*)2;
  5846. *pos = 0x10000;
  5847. }
  5848. spin_unlock(&all_mddevs_lock);
  5849. if (v != (void*)1)
  5850. mddev_put(mddev);
  5851. return next_mddev;
  5852. }
  5853. static void md_seq_stop(struct seq_file *seq, void *v)
  5854. {
  5855. mddev_t *mddev = v;
  5856. if (mddev && v != (void*)1 && v != (void*)2)
  5857. mddev_put(mddev);
  5858. }
  5859. static int md_seq_show(struct seq_file *seq, void *v)
  5860. {
  5861. mddev_t *mddev = v;
  5862. sector_t sectors;
  5863. mdk_rdev_t *rdev;
  5864. struct bitmap *bitmap;
  5865. if (v == (void*)1) {
  5866. struct mdk_personality *pers;
  5867. seq_printf(seq, "Personalities : ");
  5868. spin_lock(&pers_lock);
  5869. list_for_each_entry(pers, &pers_list, list)
  5870. seq_printf(seq, "[%s] ", pers->name);
  5871. spin_unlock(&pers_lock);
  5872. seq_printf(seq, "\n");
  5873. seq->poll_event = atomic_read(&md_event_count);
  5874. return 0;
  5875. }
  5876. if (v == (void*)2) {
  5877. status_unused(seq);
  5878. return 0;
  5879. }
  5880. if (mddev_lock(mddev) < 0)
  5881. return -EINTR;
  5882. if (mddev->pers || mddev->raid_disks || !list_empty(&mddev->disks)) {
  5883. seq_printf(seq, "%s : %sactive", mdname(mddev),
  5884. mddev->pers ? "" : "in");
  5885. if (mddev->pers) {
  5886. if (mddev->ro==1)
  5887. seq_printf(seq, " (read-only)");
  5888. if (mddev->ro==2)
  5889. seq_printf(seq, " (auto-read-only)");
  5890. seq_printf(seq, " %s", mddev->pers->name);
  5891. }
  5892. sectors = 0;
  5893. list_for_each_entry(rdev, &mddev->disks, same_set) {
  5894. char b[BDEVNAME_SIZE];
  5895. seq_printf(seq, " %s[%d]",
  5896. bdevname(rdev->bdev,b), rdev->desc_nr);
  5897. if (test_bit(WriteMostly, &rdev->flags))
  5898. seq_printf(seq, "(W)");
  5899. if (test_bit(Faulty, &rdev->flags)) {
  5900. seq_printf(seq, "(F)");
  5901. continue;
  5902. } else if (rdev->raid_disk < 0)
  5903. seq_printf(seq, "(S)"); /* spare */
  5904. sectors += rdev->sectors;
  5905. }
  5906. if (!list_empty(&mddev->disks)) {
  5907. if (mddev->pers)
  5908. seq_printf(seq, "\n %llu blocks",
  5909. (unsigned long long)
  5910. mddev->array_sectors / 2);
  5911. else
  5912. seq_printf(seq, "\n %llu blocks",
  5913. (unsigned long long)sectors / 2);
  5914. }
  5915. if (mddev->persistent) {
  5916. if (mddev->major_version != 0 ||
  5917. mddev->minor_version != 90) {
  5918. seq_printf(seq," super %d.%d",
  5919. mddev->major_version,
  5920. mddev->minor_version);
  5921. }
  5922. } else if (mddev->external)
  5923. seq_printf(seq, " super external:%s",
  5924. mddev->metadata_type);
  5925. else
  5926. seq_printf(seq, " super non-persistent");
  5927. if (mddev->pers) {
  5928. mddev->pers->status(seq, mddev);
  5929. seq_printf(seq, "\n ");
  5930. if (mddev->pers->sync_request) {
  5931. if (mddev->curr_resync > 2) {
  5932. status_resync(seq, mddev);
  5933. seq_printf(seq, "\n ");
  5934. } else if (mddev->curr_resync == 1 || mddev->curr_resync == 2)
  5935. seq_printf(seq, "\tresync=DELAYED\n ");
  5936. else if (mddev->recovery_cp < MaxSector)
  5937. seq_printf(seq, "\tresync=PENDING\n ");
  5938. }
  5939. } else
  5940. seq_printf(seq, "\n ");
  5941. if ((bitmap = mddev->bitmap)) {
  5942. unsigned long chunk_kb;
  5943. unsigned long flags;
  5944. spin_lock_irqsave(&bitmap->lock, flags);
  5945. chunk_kb = mddev->bitmap_info.chunksize >> 10;
  5946. seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
  5947. "%lu%s chunk",
  5948. bitmap->pages - bitmap->missing_pages,
  5949. bitmap->pages,
  5950. (bitmap->pages - bitmap->missing_pages)
  5951. << (PAGE_SHIFT - 10),
  5952. chunk_kb ? chunk_kb : mddev->bitmap_info.chunksize,
  5953. chunk_kb ? "KB" : "B");
  5954. if (bitmap->file) {
  5955. seq_printf(seq, ", file: ");
  5956. seq_path(seq, &bitmap->file->f_path, " \t\n");
  5957. }
  5958. seq_printf(seq, "\n");
  5959. spin_unlock_irqrestore(&bitmap->lock, flags);
  5960. }
  5961. seq_printf(seq, "\n");
  5962. }
  5963. mddev_unlock(mddev);
  5964. return 0;
  5965. }
  5966. static const struct seq_operations md_seq_ops = {
  5967. .start = md_seq_start,
  5968. .next = md_seq_next,
  5969. .stop = md_seq_stop,
  5970. .show = md_seq_show,
  5971. };
  5972. static int md_seq_open(struct inode *inode, struct file *file)
  5973. {
  5974. struct seq_file *seq;
  5975. int error;
  5976. error = seq_open(file, &md_seq_ops);
  5977. if (error)
  5978. return error;
  5979. seq = file->private_data;
  5980. seq->poll_event = atomic_read(&md_event_count);
  5981. return error;
  5982. }
  5983. static unsigned int mdstat_poll(struct file *filp, poll_table *wait)
  5984. {
  5985. struct seq_file *seq = filp->private_data;
  5986. int mask;
  5987. poll_wait(filp, &md_event_waiters, wait);
  5988. /* always allow read */
  5989. mask = POLLIN | POLLRDNORM;
  5990. if (seq->poll_event != atomic_read(&md_event_count))
  5991. mask |= POLLERR | POLLPRI;
  5992. return mask;
  5993. }
  5994. static const struct file_operations md_seq_fops = {
  5995. .owner = THIS_MODULE,
  5996. .open = md_seq_open,
  5997. .read = seq_read,
  5998. .llseek = seq_lseek,
  5999. .release = seq_release_private,
  6000. .poll = mdstat_poll,
  6001. };
  6002. int register_md_personality(struct mdk_personality *p)
  6003. {
  6004. spin_lock(&pers_lock);
  6005. list_add_tail(&p->list, &pers_list);
  6006. printk(KERN_INFO "md: %s personality registered for level %d\n", p->name, p->level);
  6007. spin_unlock(&pers_lock);
  6008. return 0;
  6009. }
  6010. int unregister_md_personality(struct mdk_personality *p)
  6011. {
  6012. printk(KERN_INFO "md: %s personality unregistered\n", p->name);
  6013. spin_lock(&pers_lock);
  6014. list_del_init(&p->list);
  6015. spin_unlock(&pers_lock);
  6016. return 0;
  6017. }
  6018. static int is_mddev_idle(mddev_t *mddev, int init)
  6019. {
  6020. mdk_rdev_t * rdev;
  6021. int idle;
  6022. int curr_events;
  6023. idle = 1;
  6024. rcu_read_lock();
  6025. rdev_for_each_rcu(rdev, mddev) {
  6026. struct gendisk *disk = rdev->bdev->bd_contains->bd_disk;
  6027. curr_events = (int)part_stat_read(&disk->part0, sectors[0]) +
  6028. (int)part_stat_read(&disk->part0, sectors[1]) -
  6029. atomic_read(&disk->sync_io);
  6030. /* sync IO will cause sync_io to increase before the disk_stats
  6031. * as sync_io is counted when a request starts, and
  6032. * disk_stats is counted when it completes.
  6033. * So resync activity will cause curr_events to be smaller than
  6034. * when there was no such activity.
  6035. * non-sync IO will cause disk_stat to increase without
  6036. * increasing sync_io so curr_events will (eventually)
  6037. * be larger than it was before. Once it becomes
  6038. * substantially larger, the test below will cause
  6039. * the array to appear non-idle, and resync will slow
  6040. * down.
  6041. * If there is a lot of outstanding resync activity when
  6042. * we set last_event to curr_events, then all that activity
  6043. * completing might cause the array to appear non-idle
  6044. * and resync will be slowed down even though there might
  6045. * not have been non-resync activity. This will only
  6046. * happen once though. 'last_events' will soon reflect
  6047. * the state where there is little or no outstanding
  6048. * resync requests, and further resync activity will
  6049. * always make curr_events less than last_events.
  6050. *
  6051. */
  6052. if (init || curr_events - rdev->last_events > 64) {
  6053. rdev->last_events = curr_events;
  6054. idle = 0;
  6055. }
  6056. }
  6057. rcu_read_unlock();
  6058. return idle;
  6059. }
  6060. void md_done_sync(mddev_t *mddev, int blocks, int ok)
  6061. {
  6062. /* another "blocks" (512byte) blocks have been synced */
  6063. atomic_sub(blocks, &mddev->recovery_active);
  6064. wake_up(&mddev->recovery_wait);
  6065. if (!ok) {
  6066. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6067. md_wakeup_thread(mddev->thread);
  6068. // stop recovery, signal do_sync ....
  6069. }
  6070. }
  6071. /* md_write_start(mddev, bi)
  6072. * If we need to update some array metadata (e.g. 'active' flag
  6073. * in superblock) before writing, schedule a superblock update
  6074. * and wait for it to complete.
  6075. */
  6076. void md_write_start(mddev_t *mddev, struct bio *bi)
  6077. {
  6078. int did_change = 0;
  6079. if (bio_data_dir(bi) != WRITE)
  6080. return;
  6081. BUG_ON(mddev->ro == 1);
  6082. if (mddev->ro == 2) {
  6083. /* need to switch to read/write */
  6084. mddev->ro = 0;
  6085. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6086. md_wakeup_thread(mddev->thread);
  6087. md_wakeup_thread(mddev->sync_thread);
  6088. did_change = 1;
  6089. }
  6090. atomic_inc(&mddev->writes_pending);
  6091. if (mddev->safemode == 1)
  6092. mddev->safemode = 0;
  6093. if (mddev->in_sync) {
  6094. spin_lock_irq(&mddev->write_lock);
  6095. if (mddev->in_sync) {
  6096. mddev->in_sync = 0;
  6097. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6098. set_bit(MD_CHANGE_PENDING, &mddev->flags);
  6099. md_wakeup_thread(mddev->thread);
  6100. did_change = 1;
  6101. }
  6102. spin_unlock_irq(&mddev->write_lock);
  6103. }
  6104. if (did_change)
  6105. sysfs_notify_dirent_safe(mddev->sysfs_state);
  6106. wait_event(mddev->sb_wait,
  6107. !test_bit(MD_CHANGE_PENDING, &mddev->flags));
  6108. }
  6109. void md_write_end(mddev_t *mddev)
  6110. {
  6111. if (atomic_dec_and_test(&mddev->writes_pending)) {
  6112. if (mddev->safemode == 2)
  6113. md_wakeup_thread(mddev->thread);
  6114. else if (mddev->safemode_delay)
  6115. mod_timer(&mddev->safemode_timer, jiffies + mddev->safemode_delay);
  6116. }
  6117. }
  6118. /* md_allow_write(mddev)
  6119. * Calling this ensures that the array is marked 'active' so that writes
  6120. * may proceed without blocking. It is important to call this before
  6121. * attempting a GFP_KERNEL allocation while holding the mddev lock.
  6122. * Must be called with mddev_lock held.
  6123. *
  6124. * In the ->external case MD_CHANGE_CLEAN can not be cleared until mddev->lock
  6125. * is dropped, so return -EAGAIN after notifying userspace.
  6126. */
  6127. int md_allow_write(mddev_t *mddev)
  6128. {
  6129. if (!mddev->pers)
  6130. return 0;
  6131. if (mddev->ro)
  6132. return 0;
  6133. if (!mddev->pers->sync_request)
  6134. return 0;
  6135. spin_lock_irq(&mddev->write_lock);
  6136. if (mddev->in_sync) {
  6137. mddev->in_sync = 0;
  6138. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6139. set_bit(MD_CHANGE_PENDING, &mddev->flags);
  6140. if (mddev->safemode_delay &&
  6141. mddev->safemode == 0)
  6142. mddev->safemode = 1;
  6143. spin_unlock_irq(&mddev->write_lock);
  6144. md_update_sb(mddev, 0);
  6145. sysfs_notify_dirent_safe(mddev->sysfs_state);
  6146. } else
  6147. spin_unlock_irq(&mddev->write_lock);
  6148. if (test_bit(MD_CHANGE_PENDING, &mddev->flags))
  6149. return -EAGAIN;
  6150. else
  6151. return 0;
  6152. }
  6153. EXPORT_SYMBOL_GPL(md_allow_write);
  6154. #define SYNC_MARKS 10
  6155. #define SYNC_MARK_STEP (3*HZ)
  6156. void md_do_sync(mddev_t *mddev)
  6157. {
  6158. mddev_t *mddev2;
  6159. unsigned int currspeed = 0,
  6160. window;
  6161. sector_t max_sectors,j, io_sectors;
  6162. unsigned long mark[SYNC_MARKS];
  6163. sector_t mark_cnt[SYNC_MARKS];
  6164. int last_mark,m;
  6165. struct list_head *tmp;
  6166. sector_t last_check;
  6167. int skipped = 0;
  6168. mdk_rdev_t *rdev;
  6169. char *desc;
  6170. /* just incase thread restarts... */
  6171. if (test_bit(MD_RECOVERY_DONE, &mddev->recovery))
  6172. return;
  6173. if (mddev->ro) /* never try to sync a read-only array */
  6174. return;
  6175. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  6176. if (test_bit(MD_RECOVERY_CHECK, &mddev->recovery))
  6177. desc = "data-check";
  6178. else if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6179. desc = "requested-resync";
  6180. else
  6181. desc = "resync";
  6182. } else if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  6183. desc = "reshape";
  6184. else
  6185. desc = "recovery";
  6186. /* we overload curr_resync somewhat here.
  6187. * 0 == not engaged in resync at all
  6188. * 2 == checking that there is no conflict with another sync
  6189. * 1 == like 2, but have yielded to allow conflicting resync to
  6190. * commense
  6191. * other == active in resync - this many blocks
  6192. *
  6193. * Before starting a resync we must have set curr_resync to
  6194. * 2, and then checked that every "conflicting" array has curr_resync
  6195. * less than ours. When we find one that is the same or higher
  6196. * we wait on resync_wait. To avoid deadlock, we reduce curr_resync
  6197. * to 1 if we choose to yield (based arbitrarily on address of mddev structure).
  6198. * This will mean we have to start checking from the beginning again.
  6199. *
  6200. */
  6201. do {
  6202. mddev->curr_resync = 2;
  6203. try_again:
  6204. if (kthread_should_stop())
  6205. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6206. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery))
  6207. goto skip;
  6208. for_each_mddev(mddev2, tmp) {
  6209. if (mddev2 == mddev)
  6210. continue;
  6211. if (!mddev->parallel_resync
  6212. && mddev2->curr_resync
  6213. && match_mddev_units(mddev, mddev2)) {
  6214. DEFINE_WAIT(wq);
  6215. if (mddev < mddev2 && mddev->curr_resync == 2) {
  6216. /* arbitrarily yield */
  6217. mddev->curr_resync = 1;
  6218. wake_up(&resync_wait);
  6219. }
  6220. if (mddev > mddev2 && mddev->curr_resync == 1)
  6221. /* no need to wait here, we can wait the next
  6222. * time 'round when curr_resync == 2
  6223. */
  6224. continue;
  6225. /* We need to wait 'interruptible' so as not to
  6226. * contribute to the load average, and not to
  6227. * be caught by 'softlockup'
  6228. */
  6229. prepare_to_wait(&resync_wait, &wq, TASK_INTERRUPTIBLE);
  6230. if (!kthread_should_stop() &&
  6231. mddev2->curr_resync >= mddev->curr_resync) {
  6232. printk(KERN_INFO "md: delaying %s of %s"
  6233. " until %s has finished (they"
  6234. " share one or more physical units)\n",
  6235. desc, mdname(mddev), mdname(mddev2));
  6236. mddev_put(mddev2);
  6237. if (signal_pending(current))
  6238. flush_signals(current);
  6239. schedule();
  6240. finish_wait(&resync_wait, &wq);
  6241. goto try_again;
  6242. }
  6243. finish_wait(&resync_wait, &wq);
  6244. }
  6245. }
  6246. } while (mddev->curr_resync < 2);
  6247. j = 0;
  6248. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  6249. /* resync follows the size requested by the personality,
  6250. * which defaults to physical size, but can be virtual size
  6251. */
  6252. max_sectors = mddev->resync_max_sectors;
  6253. mddev->resync_mismatches = 0;
  6254. /* we don't use the checkpoint if there's a bitmap */
  6255. if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6256. j = mddev->resync_min;
  6257. else if (!mddev->bitmap)
  6258. j = mddev->recovery_cp;
  6259. } else if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  6260. max_sectors = mddev->dev_sectors;
  6261. else {
  6262. /* recovery follows the physical size of devices */
  6263. max_sectors = mddev->dev_sectors;
  6264. j = MaxSector;
  6265. rcu_read_lock();
  6266. list_for_each_entry_rcu(rdev, &mddev->disks, same_set)
  6267. if (rdev->raid_disk >= 0 &&
  6268. !test_bit(Faulty, &rdev->flags) &&
  6269. !test_bit(In_sync, &rdev->flags) &&
  6270. rdev->recovery_offset < j)
  6271. j = rdev->recovery_offset;
  6272. rcu_read_unlock();
  6273. }
  6274. printk(KERN_INFO "md: %s of RAID array %s\n", desc, mdname(mddev));
  6275. printk(KERN_INFO "md: minimum _guaranteed_ speed:"
  6276. " %d KB/sec/disk.\n", speed_min(mddev));
  6277. printk(KERN_INFO "md: using maximum available idle IO bandwidth "
  6278. "(but not more than %d KB/sec) for %s.\n",
  6279. speed_max(mddev), desc);
  6280. is_mddev_idle(mddev, 1); /* this initializes IO event counters */
  6281. io_sectors = 0;
  6282. for (m = 0; m < SYNC_MARKS; m++) {
  6283. mark[m] = jiffies;
  6284. mark_cnt[m] = io_sectors;
  6285. }
  6286. last_mark = 0;
  6287. mddev->resync_mark = mark[last_mark];
  6288. mddev->resync_mark_cnt = mark_cnt[last_mark];
  6289. /*
  6290. * Tune reconstruction:
  6291. */
  6292. window = 32*(PAGE_SIZE/512);
  6293. printk(KERN_INFO "md: using %dk window, over a total of %lluk.\n",
  6294. window/2, (unsigned long long)max_sectors/2);
  6295. atomic_set(&mddev->recovery_active, 0);
  6296. last_check = 0;
  6297. if (j>2) {
  6298. printk(KERN_INFO
  6299. "md: resuming %s of %s from checkpoint.\n",
  6300. desc, mdname(mddev));
  6301. mddev->curr_resync = j;
  6302. }
  6303. mddev->curr_resync_completed = j;
  6304. while (j < max_sectors) {
  6305. sector_t sectors;
  6306. skipped = 0;
  6307. if (!test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery) &&
  6308. ((mddev->curr_resync > mddev->curr_resync_completed &&
  6309. (mddev->curr_resync - mddev->curr_resync_completed)
  6310. > (max_sectors >> 4)) ||
  6311. (j - mddev->curr_resync_completed)*2
  6312. >= mddev->resync_max - mddev->curr_resync_completed
  6313. )) {
  6314. /* time to update curr_resync_completed */
  6315. wait_event(mddev->recovery_wait,
  6316. atomic_read(&mddev->recovery_active) == 0);
  6317. mddev->curr_resync_completed = j;
  6318. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6319. sysfs_notify(&mddev->kobj, NULL, "sync_completed");
  6320. }
  6321. while (j >= mddev->resync_max && !kthread_should_stop()) {
  6322. /* As this condition is controlled by user-space,
  6323. * we can block indefinitely, so use '_interruptible'
  6324. * to avoid triggering warnings.
  6325. */
  6326. flush_signals(current); /* just in case */
  6327. wait_event_interruptible(mddev->recovery_wait,
  6328. mddev->resync_max > j
  6329. || kthread_should_stop());
  6330. }
  6331. if (kthread_should_stop())
  6332. goto interrupted;
  6333. sectors = mddev->pers->sync_request(mddev, j, &skipped,
  6334. currspeed < speed_min(mddev));
  6335. if (sectors == 0) {
  6336. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6337. goto out;
  6338. }
  6339. if (!skipped) { /* actual IO requested */
  6340. io_sectors += sectors;
  6341. atomic_add(sectors, &mddev->recovery_active);
  6342. }
  6343. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery))
  6344. break;
  6345. j += sectors;
  6346. if (j>1) mddev->curr_resync = j;
  6347. mddev->curr_mark_cnt = io_sectors;
  6348. if (last_check == 0)
  6349. /* this is the earliest that rebuild will be
  6350. * visible in /proc/mdstat
  6351. */
  6352. md_new_event(mddev);
  6353. if (last_check + window > io_sectors || j == max_sectors)
  6354. continue;
  6355. last_check = io_sectors;
  6356. repeat:
  6357. if (time_after_eq(jiffies, mark[last_mark] + SYNC_MARK_STEP )) {
  6358. /* step marks */
  6359. int next = (last_mark+1) % SYNC_MARKS;
  6360. mddev->resync_mark = mark[next];
  6361. mddev->resync_mark_cnt = mark_cnt[next];
  6362. mark[next] = jiffies;
  6363. mark_cnt[next] = io_sectors - atomic_read(&mddev->recovery_active);
  6364. last_mark = next;
  6365. }
  6366. if (kthread_should_stop())
  6367. goto interrupted;
  6368. /*
  6369. * this loop exits only if either when we are slower than
  6370. * the 'hard' speed limit, or the system was IO-idle for
  6371. * a jiffy.
  6372. * the system might be non-idle CPU-wise, but we only care
  6373. * about not overloading the IO subsystem. (things like an
  6374. * e2fsck being done on the RAID array should execute fast)
  6375. */
  6376. cond_resched();
  6377. currspeed = ((unsigned long)(io_sectors-mddev->resync_mark_cnt))/2
  6378. /((jiffies-mddev->resync_mark)/HZ +1) +1;
  6379. if (currspeed > speed_min(mddev)) {
  6380. if ((currspeed > speed_max(mddev)) ||
  6381. !is_mddev_idle(mddev, 0)) {
  6382. msleep(500);
  6383. goto repeat;
  6384. }
  6385. }
  6386. }
  6387. printk(KERN_INFO "md: %s: %s done.\n",mdname(mddev), desc);
  6388. /*
  6389. * this also signals 'finished resyncing' to md_stop
  6390. */
  6391. out:
  6392. wait_event(mddev->recovery_wait, !atomic_read(&mddev->recovery_active));
  6393. /* tell personality that we are finished */
  6394. mddev->pers->sync_request(mddev, max_sectors, &skipped, 1);
  6395. if (!test_bit(MD_RECOVERY_CHECK, &mddev->recovery) &&
  6396. mddev->curr_resync > 2) {
  6397. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  6398. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
  6399. if (mddev->curr_resync >= mddev->recovery_cp) {
  6400. printk(KERN_INFO
  6401. "md: checkpointing %s of %s.\n",
  6402. desc, mdname(mddev));
  6403. mddev->recovery_cp = mddev->curr_resync;
  6404. }
  6405. } else
  6406. mddev->recovery_cp = MaxSector;
  6407. } else {
  6408. if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery))
  6409. mddev->curr_resync = MaxSector;
  6410. rcu_read_lock();
  6411. list_for_each_entry_rcu(rdev, &mddev->disks, same_set)
  6412. if (rdev->raid_disk >= 0 &&
  6413. mddev->delta_disks >= 0 &&
  6414. !test_bit(Faulty, &rdev->flags) &&
  6415. !test_bit(In_sync, &rdev->flags) &&
  6416. rdev->recovery_offset < mddev->curr_resync)
  6417. rdev->recovery_offset = mddev->curr_resync;
  6418. rcu_read_unlock();
  6419. }
  6420. }
  6421. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  6422. skip:
  6423. if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
  6424. /* We completed so min/max setting can be forgotten if used. */
  6425. if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6426. mddev->resync_min = 0;
  6427. mddev->resync_max = MaxSector;
  6428. } else if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6429. mddev->resync_min = mddev->curr_resync_completed;
  6430. mddev->curr_resync = 0;
  6431. wake_up(&resync_wait);
  6432. set_bit(MD_RECOVERY_DONE, &mddev->recovery);
  6433. md_wakeup_thread(mddev->thread);
  6434. return;
  6435. interrupted:
  6436. /*
  6437. * got a signal, exit.
  6438. */
  6439. printk(KERN_INFO
  6440. "md: md_do_sync() got signal ... exiting\n");
  6441. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6442. goto out;
  6443. }
  6444. EXPORT_SYMBOL_GPL(md_do_sync);
  6445. static int remove_and_add_spares(mddev_t *mddev)
  6446. {
  6447. mdk_rdev_t *rdev;
  6448. int spares = 0;
  6449. mddev->curr_resync_completed = 0;
  6450. list_for_each_entry(rdev, &mddev->disks, same_set)
  6451. if (rdev->raid_disk >= 0 &&
  6452. !test_bit(Blocked, &rdev->flags) &&
  6453. (test_bit(Faulty, &rdev->flags) ||
  6454. ! test_bit(In_sync, &rdev->flags)) &&
  6455. atomic_read(&rdev->nr_pending)==0) {
  6456. if (mddev->pers->hot_remove_disk(
  6457. mddev, rdev->raid_disk)==0) {
  6458. sysfs_unlink_rdev(mddev, rdev);
  6459. rdev->raid_disk = -1;
  6460. }
  6461. }
  6462. if (mddev->degraded) {
  6463. list_for_each_entry(rdev, &mddev->disks, same_set) {
  6464. if (rdev->raid_disk >= 0 &&
  6465. !test_bit(In_sync, &rdev->flags) &&
  6466. !test_bit(Faulty, &rdev->flags))
  6467. spares++;
  6468. if (rdev->raid_disk < 0
  6469. && !test_bit(Faulty, &rdev->flags)) {
  6470. rdev->recovery_offset = 0;
  6471. if (mddev->pers->
  6472. hot_add_disk(mddev, rdev) == 0) {
  6473. if (sysfs_link_rdev(mddev, rdev))
  6474. /* failure here is OK */;
  6475. spares++;
  6476. md_new_event(mddev);
  6477. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  6478. } else
  6479. break;
  6480. }
  6481. }
  6482. }
  6483. return spares;
  6484. }
  6485. static void reap_sync_thread(mddev_t *mddev)
  6486. {
  6487. mdk_rdev_t *rdev;
  6488. /* resync has finished, collect result */
  6489. md_unregister_thread(mddev->sync_thread);
  6490. mddev->sync_thread = NULL;
  6491. if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery) &&
  6492. !test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery)) {
  6493. /* success...*/
  6494. /* activate any spares */
  6495. if (mddev->pers->spare_active(mddev))
  6496. sysfs_notify(&mddev->kobj, NULL,
  6497. "degraded");
  6498. }
  6499. if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery) &&
  6500. mddev->pers->finish_reshape)
  6501. mddev->pers->finish_reshape(mddev);
  6502. md_update_sb(mddev, 1);
  6503. /* if array is no-longer degraded, then any saved_raid_disk
  6504. * information must be scrapped
  6505. */
  6506. if (!mddev->degraded)
  6507. list_for_each_entry(rdev, &mddev->disks, same_set)
  6508. rdev->saved_raid_disk = -1;
  6509. clear_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6510. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6511. clear_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  6512. clear_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  6513. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  6514. /* flag recovery needed just to double check */
  6515. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6516. sysfs_notify_dirent_safe(mddev->sysfs_action);
  6517. md_new_event(mddev);
  6518. if (mddev->event_work.func)
  6519. queue_work(md_misc_wq, &mddev->event_work);
  6520. }
  6521. /*
  6522. * This routine is regularly called by all per-raid-array threads to
  6523. * deal with generic issues like resync and super-block update.
  6524. * Raid personalities that don't have a thread (linear/raid0) do not
  6525. * need this as they never do any recovery or update the superblock.
  6526. *
  6527. * It does not do any resync itself, but rather "forks" off other threads
  6528. * to do that as needed.
  6529. * When it is determined that resync is needed, we set MD_RECOVERY_RUNNING in
  6530. * "->recovery" and create a thread at ->sync_thread.
  6531. * When the thread finishes it sets MD_RECOVERY_DONE
  6532. * and wakeups up this thread which will reap the thread and finish up.
  6533. * This thread also removes any faulty devices (with nr_pending == 0).
  6534. *
  6535. * The overall approach is:
  6536. * 1/ if the superblock needs updating, update it.
  6537. * 2/ If a recovery thread is running, don't do anything else.
  6538. * 3/ If recovery has finished, clean up, possibly marking spares active.
  6539. * 4/ If there are any faulty devices, remove them.
  6540. * 5/ If array is degraded, try to add spares devices
  6541. * 6/ If array has spares or is not in-sync, start a resync thread.
  6542. */
  6543. void md_check_recovery(mddev_t *mddev)
  6544. {
  6545. if (mddev->suspended)
  6546. return;
  6547. if (mddev->bitmap)
  6548. bitmap_daemon_work(mddev);
  6549. if (signal_pending(current)) {
  6550. if (mddev->pers->sync_request && !mddev->external) {
  6551. printk(KERN_INFO "md: %s in immediate safe mode\n",
  6552. mdname(mddev));
  6553. mddev->safemode = 2;
  6554. }
  6555. flush_signals(current);
  6556. }
  6557. if (mddev->ro && !test_bit(MD_RECOVERY_NEEDED, &mddev->recovery))
  6558. return;
  6559. if ( ! (
  6560. (mddev->flags & ~ (1<<MD_CHANGE_PENDING)) ||
  6561. test_bit(MD_RECOVERY_NEEDED, &mddev->recovery) ||
  6562. test_bit(MD_RECOVERY_DONE, &mddev->recovery) ||
  6563. (mddev->external == 0 && mddev->safemode == 1) ||
  6564. (mddev->safemode == 2 && ! atomic_read(&mddev->writes_pending)
  6565. && !mddev->in_sync && mddev->recovery_cp == MaxSector)
  6566. ))
  6567. return;
  6568. if (mddev_trylock(mddev)) {
  6569. int spares = 0;
  6570. if (mddev->ro) {
  6571. /* Only thing we do on a ro array is remove
  6572. * failed devices.
  6573. */
  6574. mdk_rdev_t *rdev;
  6575. list_for_each_entry(rdev, &mddev->disks, same_set)
  6576. if (rdev->raid_disk >= 0 &&
  6577. !test_bit(Blocked, &rdev->flags) &&
  6578. test_bit(Faulty, &rdev->flags) &&
  6579. atomic_read(&rdev->nr_pending)==0) {
  6580. if (mddev->pers->hot_remove_disk(
  6581. mddev, rdev->raid_disk)==0) {
  6582. sysfs_unlink_rdev(mddev, rdev);
  6583. rdev->raid_disk = -1;
  6584. }
  6585. }
  6586. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6587. goto unlock;
  6588. }
  6589. if (!mddev->external) {
  6590. int did_change = 0;
  6591. spin_lock_irq(&mddev->write_lock);
  6592. if (mddev->safemode &&
  6593. !atomic_read(&mddev->writes_pending) &&
  6594. !mddev->in_sync &&
  6595. mddev->recovery_cp == MaxSector) {
  6596. mddev->in_sync = 1;
  6597. did_change = 1;
  6598. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6599. }
  6600. if (mddev->safemode == 1)
  6601. mddev->safemode = 0;
  6602. spin_unlock_irq(&mddev->write_lock);
  6603. if (did_change)
  6604. sysfs_notify_dirent_safe(mddev->sysfs_state);
  6605. }
  6606. if (mddev->flags)
  6607. md_update_sb(mddev, 0);
  6608. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) &&
  6609. !test_bit(MD_RECOVERY_DONE, &mddev->recovery)) {
  6610. /* resync/recovery still happening */
  6611. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6612. goto unlock;
  6613. }
  6614. if (mddev->sync_thread) {
  6615. reap_sync_thread(mddev);
  6616. goto unlock;
  6617. }
  6618. /* Set RUNNING before clearing NEEDED to avoid
  6619. * any transients in the value of "sync_action".
  6620. */
  6621. set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6622. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6623. /* Clear some bits that don't mean anything, but
  6624. * might be left set
  6625. */
  6626. clear_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6627. clear_bit(MD_RECOVERY_DONE, &mddev->recovery);
  6628. if (test_bit(MD_RECOVERY_FROZEN, &mddev->recovery))
  6629. goto unlock;
  6630. /* no recovery is running.
  6631. * remove any failed drives, then
  6632. * add spares if possible.
  6633. * Spare are also removed and re-added, to allow
  6634. * the personality to fail the re-add.
  6635. */
  6636. if (mddev->reshape_position != MaxSector) {
  6637. if (mddev->pers->check_reshape == NULL ||
  6638. mddev->pers->check_reshape(mddev) != 0)
  6639. /* Cannot proceed */
  6640. goto unlock;
  6641. set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  6642. clear_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  6643. } else if ((spares = remove_and_add_spares(mddev))) {
  6644. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6645. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  6646. clear_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  6647. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  6648. } else if (mddev->recovery_cp < MaxSector) {
  6649. set_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6650. clear_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  6651. } else if (!test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  6652. /* nothing to be done ... */
  6653. goto unlock;
  6654. if (mddev->pers->sync_request) {
  6655. if (spares && mddev->bitmap && ! mddev->bitmap->file) {
  6656. /* We are adding a device or devices to an array
  6657. * which has the bitmap stored on all devices.
  6658. * So make sure all bitmap pages get written
  6659. */
  6660. bitmap_write_all(mddev->bitmap);
  6661. }
  6662. mddev->sync_thread = md_register_thread(md_do_sync,
  6663. mddev,
  6664. "resync");
  6665. if (!mddev->sync_thread) {
  6666. printk(KERN_ERR "%s: could not start resync"
  6667. " thread...\n",
  6668. mdname(mddev));
  6669. /* leave the spares where they are, it shouldn't hurt */
  6670. clear_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6671. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6672. clear_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  6673. clear_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  6674. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  6675. } else
  6676. md_wakeup_thread(mddev->sync_thread);
  6677. sysfs_notify_dirent_safe(mddev->sysfs_action);
  6678. md_new_event(mddev);
  6679. }
  6680. unlock:
  6681. if (!mddev->sync_thread) {
  6682. clear_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6683. if (test_and_clear_bit(MD_RECOVERY_RECOVER,
  6684. &mddev->recovery))
  6685. if (mddev->sysfs_action)
  6686. sysfs_notify_dirent_safe(mddev->sysfs_action);
  6687. }
  6688. mddev_unlock(mddev);
  6689. }
  6690. }
  6691. void md_wait_for_blocked_rdev(mdk_rdev_t *rdev, mddev_t *mddev)
  6692. {
  6693. sysfs_notify_dirent_safe(rdev->sysfs_state);
  6694. wait_event_timeout(rdev->blocked_wait,
  6695. !test_bit(Blocked, &rdev->flags) &&
  6696. !test_bit(BlockedBadBlocks, &rdev->flags),
  6697. msecs_to_jiffies(5000));
  6698. rdev_dec_pending(rdev, mddev);
  6699. }
  6700. EXPORT_SYMBOL(md_wait_for_blocked_rdev);
  6701. /* Bad block management.
  6702. * We can record which blocks on each device are 'bad' and so just
  6703. * fail those blocks, or that stripe, rather than the whole device.
  6704. * Entries in the bad-block table are 64bits wide. This comprises:
  6705. * Length of bad-range, in sectors: 0-511 for lengths 1-512
  6706. * Start of bad-range, sector offset, 54 bits (allows 8 exbibytes)
  6707. * A 'shift' can be set so that larger blocks are tracked and
  6708. * consequently larger devices can be covered.
  6709. * 'Acknowledged' flag - 1 bit. - the most significant bit.
  6710. *
  6711. * Locking of the bad-block table uses a seqlock so md_is_badblock
  6712. * might need to retry if it is very unlucky.
  6713. * We will sometimes want to check for bad blocks in a bi_end_io function,
  6714. * so we use the write_seqlock_irq variant.
  6715. *
  6716. * When looking for a bad block we specify a range and want to
  6717. * know if any block in the range is bad. So we binary-search
  6718. * to the last range that starts at-or-before the given endpoint,
  6719. * (or "before the sector after the target range")
  6720. * then see if it ends after the given start.
  6721. * We return
  6722. * 0 if there are no known bad blocks in the range
  6723. * 1 if there are known bad block which are all acknowledged
  6724. * -1 if there are bad blocks which have not yet been acknowledged in metadata.
  6725. * plus the start/length of the first bad section we overlap.
  6726. */
  6727. int md_is_badblock(struct badblocks *bb, sector_t s, int sectors,
  6728. sector_t *first_bad, int *bad_sectors)
  6729. {
  6730. int hi;
  6731. int lo = 0;
  6732. u64 *p = bb->page;
  6733. int rv = 0;
  6734. sector_t target = s + sectors;
  6735. unsigned seq;
  6736. if (bb->shift > 0) {
  6737. /* round the start down, and the end up */
  6738. s >>= bb->shift;
  6739. target += (1<<bb->shift) - 1;
  6740. target >>= bb->shift;
  6741. sectors = target - s;
  6742. }
  6743. /* 'target' is now the first block after the bad range */
  6744. retry:
  6745. seq = read_seqbegin(&bb->lock);
  6746. hi = bb->count;
  6747. /* Binary search between lo and hi for 'target'
  6748. * i.e. for the last range that starts before 'target'
  6749. */
  6750. /* INVARIANT: ranges before 'lo' and at-or-after 'hi'
  6751. * are known not to be the last range before target.
  6752. * VARIANT: hi-lo is the number of possible
  6753. * ranges, and decreases until it reaches 1
  6754. */
  6755. while (hi - lo > 1) {
  6756. int mid = (lo + hi) / 2;
  6757. sector_t a = BB_OFFSET(p[mid]);
  6758. if (a < target)
  6759. /* This could still be the one, earlier ranges
  6760. * could not. */
  6761. lo = mid;
  6762. else
  6763. /* This and later ranges are definitely out. */
  6764. hi = mid;
  6765. }
  6766. /* 'lo' might be the last that started before target, but 'hi' isn't */
  6767. if (hi > lo) {
  6768. /* need to check all range that end after 's' to see if
  6769. * any are unacknowledged.
  6770. */
  6771. while (lo >= 0 &&
  6772. BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > s) {
  6773. if (BB_OFFSET(p[lo]) < target) {
  6774. /* starts before the end, and finishes after
  6775. * the start, so they must overlap
  6776. */
  6777. if (rv != -1 && BB_ACK(p[lo]))
  6778. rv = 1;
  6779. else
  6780. rv = -1;
  6781. *first_bad = BB_OFFSET(p[lo]);
  6782. *bad_sectors = BB_LEN(p[lo]);
  6783. }
  6784. lo--;
  6785. }
  6786. }
  6787. if (read_seqretry(&bb->lock, seq))
  6788. goto retry;
  6789. return rv;
  6790. }
  6791. EXPORT_SYMBOL_GPL(md_is_badblock);
  6792. /*
  6793. * Add a range of bad blocks to the table.
  6794. * This might extend the table, or might contract it
  6795. * if two adjacent ranges can be merged.
  6796. * We binary-search to find the 'insertion' point, then
  6797. * decide how best to handle it.
  6798. */
  6799. static int md_set_badblocks(struct badblocks *bb, sector_t s, int sectors,
  6800. int acknowledged)
  6801. {
  6802. u64 *p;
  6803. int lo, hi;
  6804. int rv = 1;
  6805. if (bb->shift < 0)
  6806. /* badblocks are disabled */
  6807. return 0;
  6808. if (bb->shift) {
  6809. /* round the start down, and the end up */
  6810. sector_t next = s + sectors;
  6811. s >>= bb->shift;
  6812. next += (1<<bb->shift) - 1;
  6813. next >>= bb->shift;
  6814. sectors = next - s;
  6815. }
  6816. write_seqlock_irq(&bb->lock);
  6817. p = bb->page;
  6818. lo = 0;
  6819. hi = bb->count;
  6820. /* Find the last range that starts at-or-before 's' */
  6821. while (hi - lo > 1) {
  6822. int mid = (lo + hi) / 2;
  6823. sector_t a = BB_OFFSET(p[mid]);
  6824. if (a <= s)
  6825. lo = mid;
  6826. else
  6827. hi = mid;
  6828. }
  6829. if (hi > lo && BB_OFFSET(p[lo]) > s)
  6830. hi = lo;
  6831. if (hi > lo) {
  6832. /* we found a range that might merge with the start
  6833. * of our new range
  6834. */
  6835. sector_t a = BB_OFFSET(p[lo]);
  6836. sector_t e = a + BB_LEN(p[lo]);
  6837. int ack = BB_ACK(p[lo]);
  6838. if (e >= s) {
  6839. /* Yes, we can merge with a previous range */
  6840. if (s == a && s + sectors >= e)
  6841. /* new range covers old */
  6842. ack = acknowledged;
  6843. else
  6844. ack = ack && acknowledged;
  6845. if (e < s + sectors)
  6846. e = s + sectors;
  6847. if (e - a <= BB_MAX_LEN) {
  6848. p[lo] = BB_MAKE(a, e-a, ack);
  6849. s = e;
  6850. } else {
  6851. /* does not all fit in one range,
  6852. * make p[lo] maximal
  6853. */
  6854. if (BB_LEN(p[lo]) != BB_MAX_LEN)
  6855. p[lo] = BB_MAKE(a, BB_MAX_LEN, ack);
  6856. s = a + BB_MAX_LEN;
  6857. }
  6858. sectors = e - s;
  6859. }
  6860. }
  6861. if (sectors && hi < bb->count) {
  6862. /* 'hi' points to the first range that starts after 's'.
  6863. * Maybe we can merge with the start of that range */
  6864. sector_t a = BB_OFFSET(p[hi]);
  6865. sector_t e = a + BB_LEN(p[hi]);
  6866. int ack = BB_ACK(p[hi]);
  6867. if (a <= s + sectors) {
  6868. /* merging is possible */
  6869. if (e <= s + sectors) {
  6870. /* full overlap */
  6871. e = s + sectors;
  6872. ack = acknowledged;
  6873. } else
  6874. ack = ack && acknowledged;
  6875. a = s;
  6876. if (e - a <= BB_MAX_LEN) {
  6877. p[hi] = BB_MAKE(a, e-a, ack);
  6878. s = e;
  6879. } else {
  6880. p[hi] = BB_MAKE(a, BB_MAX_LEN, ack);
  6881. s = a + BB_MAX_LEN;
  6882. }
  6883. sectors = e - s;
  6884. lo = hi;
  6885. hi++;
  6886. }
  6887. }
  6888. if (sectors == 0 && hi < bb->count) {
  6889. /* we might be able to combine lo and hi */
  6890. /* Note: 's' is at the end of 'lo' */
  6891. sector_t a = BB_OFFSET(p[hi]);
  6892. int lolen = BB_LEN(p[lo]);
  6893. int hilen = BB_LEN(p[hi]);
  6894. int newlen = lolen + hilen - (s - a);
  6895. if (s >= a && newlen < BB_MAX_LEN) {
  6896. /* yes, we can combine them */
  6897. int ack = BB_ACK(p[lo]) && BB_ACK(p[hi]);
  6898. p[lo] = BB_MAKE(BB_OFFSET(p[lo]), newlen, ack);
  6899. memmove(p + hi, p + hi + 1,
  6900. (bb->count - hi - 1) * 8);
  6901. bb->count--;
  6902. }
  6903. }
  6904. while (sectors) {
  6905. /* didn't merge (it all).
  6906. * Need to add a range just before 'hi' */
  6907. if (bb->count >= MD_MAX_BADBLOCKS) {
  6908. /* No room for more */
  6909. rv = 0;
  6910. break;
  6911. } else {
  6912. int this_sectors = sectors;
  6913. memmove(p + hi + 1, p + hi,
  6914. (bb->count - hi) * 8);
  6915. bb->count++;
  6916. if (this_sectors > BB_MAX_LEN)
  6917. this_sectors = BB_MAX_LEN;
  6918. p[hi] = BB_MAKE(s, this_sectors, acknowledged);
  6919. sectors -= this_sectors;
  6920. s += this_sectors;
  6921. }
  6922. }
  6923. bb->changed = 1;
  6924. if (!acknowledged)
  6925. bb->unacked_exist = 1;
  6926. write_sequnlock_irq(&bb->lock);
  6927. return rv;
  6928. }
  6929. int rdev_set_badblocks(mdk_rdev_t *rdev, sector_t s, int sectors,
  6930. int acknowledged)
  6931. {
  6932. int rv = md_set_badblocks(&rdev->badblocks,
  6933. s + rdev->data_offset, sectors, acknowledged);
  6934. if (rv) {
  6935. /* Make sure they get written out promptly */
  6936. set_bit(MD_CHANGE_CLEAN, &rdev->mddev->flags);
  6937. md_wakeup_thread(rdev->mddev->thread);
  6938. }
  6939. return rv;
  6940. }
  6941. EXPORT_SYMBOL_GPL(rdev_set_badblocks);
  6942. /*
  6943. * Remove a range of bad blocks from the table.
  6944. * This may involve extending the table if we spilt a region,
  6945. * but it must not fail. So if the table becomes full, we just
  6946. * drop the remove request.
  6947. */
  6948. static int md_clear_badblocks(struct badblocks *bb, sector_t s, int sectors)
  6949. {
  6950. u64 *p;
  6951. int lo, hi;
  6952. sector_t target = s + sectors;
  6953. int rv = 0;
  6954. if (bb->shift > 0) {
  6955. /* When clearing we round the start up and the end down.
  6956. * This should not matter as the shift should align with
  6957. * the block size and no rounding should ever be needed.
  6958. * However it is better the think a block is bad when it
  6959. * isn't than to think a block is not bad when it is.
  6960. */
  6961. s += (1<<bb->shift) - 1;
  6962. s >>= bb->shift;
  6963. target >>= bb->shift;
  6964. sectors = target - s;
  6965. }
  6966. write_seqlock_irq(&bb->lock);
  6967. p = bb->page;
  6968. lo = 0;
  6969. hi = bb->count;
  6970. /* Find the last range that starts before 'target' */
  6971. while (hi - lo > 1) {
  6972. int mid = (lo + hi) / 2;
  6973. sector_t a = BB_OFFSET(p[mid]);
  6974. if (a < target)
  6975. lo = mid;
  6976. else
  6977. hi = mid;
  6978. }
  6979. if (hi > lo) {
  6980. /* p[lo] is the last range that could overlap the
  6981. * current range. Earlier ranges could also overlap,
  6982. * but only this one can overlap the end of the range.
  6983. */
  6984. if (BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > target) {
  6985. /* Partial overlap, leave the tail of this range */
  6986. int ack = BB_ACK(p[lo]);
  6987. sector_t a = BB_OFFSET(p[lo]);
  6988. sector_t end = a + BB_LEN(p[lo]);
  6989. if (a < s) {
  6990. /* we need to split this range */
  6991. if (bb->count >= MD_MAX_BADBLOCKS) {
  6992. rv = 0;
  6993. goto out;
  6994. }
  6995. memmove(p+lo+1, p+lo, (bb->count - lo) * 8);
  6996. bb->count++;
  6997. p[lo] = BB_MAKE(a, s-a, ack);
  6998. lo++;
  6999. }
  7000. p[lo] = BB_MAKE(target, end - target, ack);
  7001. /* there is no longer an overlap */
  7002. hi = lo;
  7003. lo--;
  7004. }
  7005. while (lo >= 0 &&
  7006. BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > s) {
  7007. /* This range does overlap */
  7008. if (BB_OFFSET(p[lo]) < s) {
  7009. /* Keep the early parts of this range. */
  7010. int ack = BB_ACK(p[lo]);
  7011. sector_t start = BB_OFFSET(p[lo]);
  7012. p[lo] = BB_MAKE(start, s - start, ack);
  7013. /* now low doesn't overlap, so.. */
  7014. break;
  7015. }
  7016. lo--;
  7017. }
  7018. /* 'lo' is strictly before, 'hi' is strictly after,
  7019. * anything between needs to be discarded
  7020. */
  7021. if (hi - lo > 1) {
  7022. memmove(p+lo+1, p+hi, (bb->count - hi) * 8);
  7023. bb->count -= (hi - lo - 1);
  7024. }
  7025. }
  7026. bb->changed = 1;
  7027. out:
  7028. write_sequnlock_irq(&bb->lock);
  7029. return rv;
  7030. }
  7031. int rdev_clear_badblocks(mdk_rdev_t *rdev, sector_t s, int sectors)
  7032. {
  7033. return md_clear_badblocks(&rdev->badblocks,
  7034. s + rdev->data_offset,
  7035. sectors);
  7036. }
  7037. EXPORT_SYMBOL_GPL(rdev_clear_badblocks);
  7038. /*
  7039. * Acknowledge all bad blocks in a list.
  7040. * This only succeeds if ->changed is clear. It is used by
  7041. * in-kernel metadata updates
  7042. */
  7043. void md_ack_all_badblocks(struct badblocks *bb)
  7044. {
  7045. if (bb->page == NULL || bb->changed)
  7046. /* no point even trying */
  7047. return;
  7048. write_seqlock_irq(&bb->lock);
  7049. if (bb->changed == 0) {
  7050. u64 *p = bb->page;
  7051. int i;
  7052. for (i = 0; i < bb->count ; i++) {
  7053. if (!BB_ACK(p[i])) {
  7054. sector_t start = BB_OFFSET(p[i]);
  7055. int len = BB_LEN(p[i]);
  7056. p[i] = BB_MAKE(start, len, 1);
  7057. }
  7058. }
  7059. bb->unacked_exist = 0;
  7060. }
  7061. write_sequnlock_irq(&bb->lock);
  7062. }
  7063. EXPORT_SYMBOL_GPL(md_ack_all_badblocks);
  7064. /* sysfs access to bad-blocks list.
  7065. * We present two files.
  7066. * 'bad-blocks' lists sector numbers and lengths of ranges that
  7067. * are recorded as bad. The list is truncated to fit within
  7068. * the one-page limit of sysfs.
  7069. * Writing "sector length" to this file adds an acknowledged
  7070. * bad block list.
  7071. * 'unacknowledged-bad-blocks' lists bad blocks that have not yet
  7072. * been acknowledged. Writing to this file adds bad blocks
  7073. * without acknowledging them. This is largely for testing.
  7074. */
  7075. static ssize_t
  7076. badblocks_show(struct badblocks *bb, char *page, int unack)
  7077. {
  7078. size_t len;
  7079. int i;
  7080. u64 *p = bb->page;
  7081. unsigned seq;
  7082. if (bb->shift < 0)
  7083. return 0;
  7084. retry:
  7085. seq = read_seqbegin(&bb->lock);
  7086. len = 0;
  7087. i = 0;
  7088. while (len < PAGE_SIZE && i < bb->count) {
  7089. sector_t s = BB_OFFSET(p[i]);
  7090. unsigned int length = BB_LEN(p[i]);
  7091. int ack = BB_ACK(p[i]);
  7092. i++;
  7093. if (unack && ack)
  7094. continue;
  7095. len += snprintf(page+len, PAGE_SIZE-len, "%llu %u\n",
  7096. (unsigned long long)s << bb->shift,
  7097. length << bb->shift);
  7098. }
  7099. if (unack && len == 0)
  7100. bb->unacked_exist = 0;
  7101. if (read_seqretry(&bb->lock, seq))
  7102. goto retry;
  7103. return len;
  7104. }
  7105. #define DO_DEBUG 1
  7106. static ssize_t
  7107. badblocks_store(struct badblocks *bb, const char *page, size_t len, int unack)
  7108. {
  7109. unsigned long long sector;
  7110. int length;
  7111. char newline;
  7112. #ifdef DO_DEBUG
  7113. /* Allow clearing via sysfs *only* for testing/debugging.
  7114. * Normally only a successful write may clear a badblock
  7115. */
  7116. int clear = 0;
  7117. if (page[0] == '-') {
  7118. clear = 1;
  7119. page++;
  7120. }
  7121. #endif /* DO_DEBUG */
  7122. switch (sscanf(page, "%llu %d%c", &sector, &length, &newline)) {
  7123. case 3:
  7124. if (newline != '\n')
  7125. return -EINVAL;
  7126. case 2:
  7127. if (length <= 0)
  7128. return -EINVAL;
  7129. break;
  7130. default:
  7131. return -EINVAL;
  7132. }
  7133. #ifdef DO_DEBUG
  7134. if (clear) {
  7135. md_clear_badblocks(bb, sector, length);
  7136. return len;
  7137. }
  7138. #endif /* DO_DEBUG */
  7139. if (md_set_badblocks(bb, sector, length, !unack))
  7140. return len;
  7141. else
  7142. return -ENOSPC;
  7143. }
  7144. static int md_notify_reboot(struct notifier_block *this,
  7145. unsigned long code, void *x)
  7146. {
  7147. struct list_head *tmp;
  7148. mddev_t *mddev;
  7149. if ((code == SYS_DOWN) || (code == SYS_HALT) || (code == SYS_POWER_OFF)) {
  7150. printk(KERN_INFO "md: stopping all md devices.\n");
  7151. for_each_mddev(mddev, tmp)
  7152. if (mddev_trylock(mddev)) {
  7153. /* Force a switch to readonly even array
  7154. * appears to still be in use. Hence
  7155. * the '100'.
  7156. */
  7157. md_set_readonly(mddev, 100);
  7158. mddev_unlock(mddev);
  7159. }
  7160. /*
  7161. * certain more exotic SCSI devices are known to be
  7162. * volatile wrt too early system reboots. While the
  7163. * right place to handle this issue is the given
  7164. * driver, we do want to have a safe RAID driver ...
  7165. */
  7166. mdelay(1000*1);
  7167. }
  7168. return NOTIFY_DONE;
  7169. }
  7170. static struct notifier_block md_notifier = {
  7171. .notifier_call = md_notify_reboot,
  7172. .next = NULL,
  7173. .priority = INT_MAX, /* before any real devices */
  7174. };
  7175. static void md_geninit(void)
  7176. {
  7177. dprintk("md: sizeof(mdp_super_t) = %d\n", (int)sizeof(mdp_super_t));
  7178. proc_create("mdstat", S_IRUGO, NULL, &md_seq_fops);
  7179. }
  7180. static int __init md_init(void)
  7181. {
  7182. int ret = -ENOMEM;
  7183. md_wq = alloc_workqueue("md", WQ_MEM_RECLAIM, 0);
  7184. if (!md_wq)
  7185. goto err_wq;
  7186. md_misc_wq = alloc_workqueue("md_misc", 0, 0);
  7187. if (!md_misc_wq)
  7188. goto err_misc_wq;
  7189. if ((ret = register_blkdev(MD_MAJOR, "md")) < 0)
  7190. goto err_md;
  7191. if ((ret = register_blkdev(0, "mdp")) < 0)
  7192. goto err_mdp;
  7193. mdp_major = ret;
  7194. blk_register_region(MKDEV(MD_MAJOR, 0), 1UL<<MINORBITS, THIS_MODULE,
  7195. md_probe, NULL, NULL);
  7196. blk_register_region(MKDEV(mdp_major, 0), 1UL<<MINORBITS, THIS_MODULE,
  7197. md_probe, NULL, NULL);
  7198. register_reboot_notifier(&md_notifier);
  7199. raid_table_header = register_sysctl_table(raid_root_table);
  7200. md_geninit();
  7201. return 0;
  7202. err_mdp:
  7203. unregister_blkdev(MD_MAJOR, "md");
  7204. err_md:
  7205. destroy_workqueue(md_misc_wq);
  7206. err_misc_wq:
  7207. destroy_workqueue(md_wq);
  7208. err_wq:
  7209. return ret;
  7210. }
  7211. #ifndef MODULE
  7212. /*
  7213. * Searches all registered partitions for autorun RAID arrays
  7214. * at boot time.
  7215. */
  7216. static LIST_HEAD(all_detected_devices);
  7217. struct detected_devices_node {
  7218. struct list_head list;
  7219. dev_t dev;
  7220. };
  7221. void md_autodetect_dev(dev_t dev)
  7222. {
  7223. struct detected_devices_node *node_detected_dev;
  7224. node_detected_dev = kzalloc(sizeof(*node_detected_dev), GFP_KERNEL);
  7225. if (node_detected_dev) {
  7226. node_detected_dev->dev = dev;
  7227. list_add_tail(&node_detected_dev->list, &all_detected_devices);
  7228. } else {
  7229. printk(KERN_CRIT "md: md_autodetect_dev: kzalloc failed"
  7230. ", skipping dev(%d,%d)\n", MAJOR(dev), MINOR(dev));
  7231. }
  7232. }
  7233. static void autostart_arrays(int part)
  7234. {
  7235. mdk_rdev_t *rdev;
  7236. struct detected_devices_node *node_detected_dev;
  7237. dev_t dev;
  7238. int i_scanned, i_passed;
  7239. i_scanned = 0;
  7240. i_passed = 0;
  7241. printk(KERN_INFO "md: Autodetecting RAID arrays.\n");
  7242. while (!list_empty(&all_detected_devices) && i_scanned < INT_MAX) {
  7243. i_scanned++;
  7244. node_detected_dev = list_entry(all_detected_devices.next,
  7245. struct detected_devices_node, list);
  7246. list_del(&node_detected_dev->list);
  7247. dev = node_detected_dev->dev;
  7248. kfree(node_detected_dev);
  7249. rdev = md_import_device(dev,0, 90);
  7250. if (IS_ERR(rdev))
  7251. continue;
  7252. if (test_bit(Faulty, &rdev->flags)) {
  7253. MD_BUG();
  7254. continue;
  7255. }
  7256. set_bit(AutoDetected, &rdev->flags);
  7257. list_add(&rdev->same_set, &pending_raid_disks);
  7258. i_passed++;
  7259. }
  7260. printk(KERN_INFO "md: Scanned %d and added %d devices.\n",
  7261. i_scanned, i_passed);
  7262. autorun_devices(part);
  7263. }
  7264. #endif /* !MODULE */
  7265. static __exit void md_exit(void)
  7266. {
  7267. mddev_t *mddev;
  7268. struct list_head *tmp;
  7269. blk_unregister_region(MKDEV(MD_MAJOR,0), 1U << MINORBITS);
  7270. blk_unregister_region(MKDEV(mdp_major,0), 1U << MINORBITS);
  7271. unregister_blkdev(MD_MAJOR,"md");
  7272. unregister_blkdev(mdp_major, "mdp");
  7273. unregister_reboot_notifier(&md_notifier);
  7274. unregister_sysctl_table(raid_table_header);
  7275. remove_proc_entry("mdstat", NULL);
  7276. for_each_mddev(mddev, tmp) {
  7277. export_array(mddev);
  7278. mddev->hold_active = 0;
  7279. }
  7280. destroy_workqueue(md_misc_wq);
  7281. destroy_workqueue(md_wq);
  7282. }
  7283. subsys_initcall(md_init);
  7284. module_exit(md_exit)
  7285. static int get_ro(char *buffer, struct kernel_param *kp)
  7286. {
  7287. return sprintf(buffer, "%d", start_readonly);
  7288. }
  7289. static int set_ro(const char *val, struct kernel_param *kp)
  7290. {
  7291. char *e;
  7292. int num = simple_strtoul(val, &e, 10);
  7293. if (*val && (*e == '\0' || *e == '\n')) {
  7294. start_readonly = num;
  7295. return 0;
  7296. }
  7297. return -EINVAL;
  7298. }
  7299. module_param_call(start_ro, set_ro, get_ro, NULL, S_IRUSR|S_IWUSR);
  7300. module_param(start_dirty_degraded, int, S_IRUGO|S_IWUSR);
  7301. module_param_call(new_array, add_named_array, NULL, NULL, S_IWUSR);
  7302. EXPORT_SYMBOL(register_md_personality);
  7303. EXPORT_SYMBOL(unregister_md_personality);
  7304. EXPORT_SYMBOL(md_error);
  7305. EXPORT_SYMBOL(md_done_sync);
  7306. EXPORT_SYMBOL(md_write_start);
  7307. EXPORT_SYMBOL(md_write_end);
  7308. EXPORT_SYMBOL(md_register_thread);
  7309. EXPORT_SYMBOL(md_unregister_thread);
  7310. EXPORT_SYMBOL(md_wakeup_thread);
  7311. EXPORT_SYMBOL(md_check_recovery);
  7312. MODULE_LICENSE("GPL");
  7313. MODULE_DESCRIPTION("MD RAID framework");
  7314. MODULE_ALIAS("md");
  7315. MODULE_ALIAS_BLOCKDEV_MAJOR(MD_MAJOR);