md.c 224 KB

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