md.c 226 KB

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