md.c 155 KB

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