md.c 98 KB

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