md.c 117 KB

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