md.c 127 KB

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