md.c 131 KB

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