md.c 127 KB

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