md.c 138 KB

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