md.c 122 KB

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