md.c 152 KB

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