md.c 122 KB

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