md.c 224 KB

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