md.c 125 KB

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