md.c 122 KB

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