md.c 122 KB

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