md.c 140 KB

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