md.c 214 KB

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