md.c 152 KB

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