md.c 224 KB

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