md.c 110 KB

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