md.c 141 KB

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