md.c 139 KB

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