md.c 98 KB

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