md.c 152 KB

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