md.c 146 KB

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