md.c 152 KB

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