md.c 153 KB

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