md.c 116 KB

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