md.c 213 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287
  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/kthread.h>
  27. #include <linux/blkdev.h>
  28. #include <linux/sysctl.h>
  29. #include <linux/seq_file.h>
  30. #include <linux/mutex.h>
  31. #include <linux/buffer_head.h> /* for invalidate_bdev */
  32. #include <linux/poll.h>
  33. #include <linux/ctype.h>
  34. #include <linux/string.h>
  35. #include <linux/hdreg.h>
  36. #include <linux/proc_fs.h>
  37. #include <linux/random.h>
  38. #include <linux/module.h>
  39. #include <linux/reboot.h>
  40. #include <linux/file.h>
  41. #include <linux/compat.h>
  42. #include <linux/delay.h>
  43. #include <linux/raid/md_p.h>
  44. #include <linux/raid/md_u.h>
  45. #include <linux/slab.h>
  46. #include "md.h"
  47. #include "bitmap.h"
  48. #ifndef MODULE
  49. static void autostart_arrays(int part);
  50. #endif
  51. /* pers_list is a list of registered personalities protected
  52. * by pers_lock.
  53. * pers_lock does extra service to protect accesses to
  54. * mddev->thread when the mutex cannot be held.
  55. */
  56. static LIST_HEAD(pers_list);
  57. static DEFINE_SPINLOCK(pers_lock);
  58. static void md_print_devices(void);
  59. static DECLARE_WAIT_QUEUE_HEAD(resync_wait);
  60. static struct workqueue_struct *md_wq;
  61. static struct workqueue_struct *md_misc_wq;
  62. #define MD_BUG(x...) { printk("md: bug in file %s, line %d\n", __FILE__, __LINE__); md_print_devices(); }
  63. /*
  64. * Default number of read corrections we'll attempt on an rdev
  65. * before ejecting it from the array. We divide the read error
  66. * count by 2 for every hour elapsed between read errors.
  67. */
  68. #define MD_DEFAULT_MAX_CORRECTED_READ_ERRORS 20
  69. /*
  70. * Current RAID-1,4,5 parallel reconstruction 'guaranteed speed limit'
  71. * is 1000 KB/sec, so the extra system load does not show up that much.
  72. * Increase it if you want to have more _guaranteed_ speed. Note that
  73. * the RAID driver will use the maximum available bandwidth if the IO
  74. * subsystem is idle. There is also an 'absolute maximum' reconstruction
  75. * speed limit - in case reconstruction slows down your system despite
  76. * idle IO detection.
  77. *
  78. * you can change it via /proc/sys/dev/raid/speed_limit_min and _max.
  79. * or /sys/block/mdX/md/sync_speed_{min,max}
  80. */
  81. static int sysctl_speed_limit_min = 1000;
  82. static int sysctl_speed_limit_max = 200000;
  83. static inline int speed_min(struct mddev *mddev)
  84. {
  85. return mddev->sync_speed_min ?
  86. mddev->sync_speed_min : sysctl_speed_limit_min;
  87. }
  88. static inline int speed_max(struct mddev *mddev)
  89. {
  90. return mddev->sync_speed_max ?
  91. mddev->sync_speed_max : sysctl_speed_limit_max;
  92. }
  93. static struct ctl_table_header *raid_table_header;
  94. static ctl_table raid_table[] = {
  95. {
  96. .procname = "speed_limit_min",
  97. .data = &sysctl_speed_limit_min,
  98. .maxlen = sizeof(int),
  99. .mode = S_IRUGO|S_IWUSR,
  100. .proc_handler = proc_dointvec,
  101. },
  102. {
  103. .procname = "speed_limit_max",
  104. .data = &sysctl_speed_limit_max,
  105. .maxlen = sizeof(int),
  106. .mode = S_IRUGO|S_IWUSR,
  107. .proc_handler = proc_dointvec,
  108. },
  109. { }
  110. };
  111. static ctl_table raid_dir_table[] = {
  112. {
  113. .procname = "raid",
  114. .maxlen = 0,
  115. .mode = S_IRUGO|S_IXUGO,
  116. .child = raid_table,
  117. },
  118. { }
  119. };
  120. static ctl_table raid_root_table[] = {
  121. {
  122. .procname = "dev",
  123. .maxlen = 0,
  124. .mode = 0555,
  125. .child = raid_dir_table,
  126. },
  127. { }
  128. };
  129. static const struct block_device_operations md_fops;
  130. static int start_readonly;
  131. /* bio_clone_mddev
  132. * like bio_clone, but with a local bio set
  133. */
  134. static void mddev_bio_destructor(struct bio *bio)
  135. {
  136. struct mddev *mddev, **mddevp;
  137. mddevp = (void*)bio;
  138. mddev = mddevp[-1];
  139. bio_free(bio, mddev->bio_set);
  140. }
  141. struct bio *bio_alloc_mddev(gfp_t gfp_mask, int nr_iovecs,
  142. struct mddev *mddev)
  143. {
  144. struct bio *b;
  145. struct mddev **mddevp;
  146. if (!mddev || !mddev->bio_set)
  147. return bio_alloc(gfp_mask, nr_iovecs);
  148. b = bio_alloc_bioset(gfp_mask, nr_iovecs,
  149. mddev->bio_set);
  150. if (!b)
  151. return NULL;
  152. mddevp = (void*)b;
  153. mddevp[-1] = mddev;
  154. b->bi_destructor = mddev_bio_destructor;
  155. return b;
  156. }
  157. EXPORT_SYMBOL_GPL(bio_alloc_mddev);
  158. struct bio *bio_clone_mddev(struct bio *bio, gfp_t gfp_mask,
  159. struct mddev *mddev)
  160. {
  161. struct bio *b;
  162. struct mddev **mddevp;
  163. if (!mddev || !mddev->bio_set)
  164. return bio_clone(bio, gfp_mask);
  165. b = bio_alloc_bioset(gfp_mask, bio->bi_max_vecs,
  166. mddev->bio_set);
  167. if (!b)
  168. return NULL;
  169. mddevp = (void*)b;
  170. mddevp[-1] = mddev;
  171. b->bi_destructor = mddev_bio_destructor;
  172. __bio_clone(b, bio);
  173. if (bio_integrity(bio)) {
  174. int ret;
  175. ret = bio_integrity_clone(b, bio, gfp_mask, mddev->bio_set);
  176. if (ret < 0) {
  177. bio_put(b);
  178. return NULL;
  179. }
  180. }
  181. return b;
  182. }
  183. EXPORT_SYMBOL_GPL(bio_clone_mddev);
  184. void md_trim_bio(struct bio *bio, int offset, int size)
  185. {
  186. /* 'bio' is a cloned bio which we need to trim to match
  187. * the given offset and size.
  188. * This requires adjusting bi_sector, bi_size, and bi_io_vec
  189. */
  190. int i;
  191. struct bio_vec *bvec;
  192. int sofar = 0;
  193. size <<= 9;
  194. if (offset == 0 && size == bio->bi_size)
  195. return;
  196. bio->bi_sector += offset;
  197. bio->bi_size = size;
  198. offset <<= 9;
  199. clear_bit(BIO_SEG_VALID, &bio->bi_flags);
  200. while (bio->bi_idx < bio->bi_vcnt &&
  201. bio->bi_io_vec[bio->bi_idx].bv_len <= offset) {
  202. /* remove this whole bio_vec */
  203. offset -= bio->bi_io_vec[bio->bi_idx].bv_len;
  204. bio->bi_idx++;
  205. }
  206. if (bio->bi_idx < bio->bi_vcnt) {
  207. bio->bi_io_vec[bio->bi_idx].bv_offset += offset;
  208. bio->bi_io_vec[bio->bi_idx].bv_len -= offset;
  209. }
  210. /* avoid any complications with bi_idx being non-zero*/
  211. if (bio->bi_idx) {
  212. memmove(bio->bi_io_vec, bio->bi_io_vec+bio->bi_idx,
  213. (bio->bi_vcnt - bio->bi_idx) * sizeof(struct bio_vec));
  214. bio->bi_vcnt -= bio->bi_idx;
  215. bio->bi_idx = 0;
  216. }
  217. /* Make sure vcnt and last bv are not too big */
  218. bio_for_each_segment(bvec, bio, i) {
  219. if (sofar + bvec->bv_len > size)
  220. bvec->bv_len = size - sofar;
  221. if (bvec->bv_len == 0) {
  222. bio->bi_vcnt = i;
  223. break;
  224. }
  225. sofar += bvec->bv_len;
  226. }
  227. }
  228. EXPORT_SYMBOL_GPL(md_trim_bio);
  229. /*
  230. * We have a system wide 'event count' that is incremented
  231. * on any 'interesting' event, and readers of /proc/mdstat
  232. * can use 'poll' or 'select' to find out when the event
  233. * count increases.
  234. *
  235. * Events are:
  236. * start array, stop array, error, add device, remove device,
  237. * start build, activate spare
  238. */
  239. static DECLARE_WAIT_QUEUE_HEAD(md_event_waiters);
  240. static atomic_t md_event_count;
  241. void md_new_event(struct mddev *mddev)
  242. {
  243. atomic_inc(&md_event_count);
  244. wake_up(&md_event_waiters);
  245. }
  246. EXPORT_SYMBOL_GPL(md_new_event);
  247. /* Alternate version that can be called from interrupts
  248. * when calling sysfs_notify isn't needed.
  249. */
  250. static void md_new_event_inintr(struct mddev *mddev)
  251. {
  252. atomic_inc(&md_event_count);
  253. wake_up(&md_event_waiters);
  254. }
  255. /*
  256. * Enables to iterate over all existing md arrays
  257. * all_mddevs_lock protects this list.
  258. */
  259. static LIST_HEAD(all_mddevs);
  260. static DEFINE_SPINLOCK(all_mddevs_lock);
  261. /*
  262. * iterates through all used mddevs in the system.
  263. * We take care to grab the all_mddevs_lock whenever navigating
  264. * the list, and to always hold a refcount when unlocked.
  265. * Any code which breaks out of this loop while own
  266. * a reference to the current mddev and must mddev_put it.
  267. */
  268. #define for_each_mddev(_mddev,_tmp) \
  269. \
  270. for (({ spin_lock(&all_mddevs_lock); \
  271. _tmp = all_mddevs.next; \
  272. _mddev = NULL;}); \
  273. ({ if (_tmp != &all_mddevs) \
  274. mddev_get(list_entry(_tmp, struct mddev, all_mddevs));\
  275. spin_unlock(&all_mddevs_lock); \
  276. if (_mddev) mddev_put(_mddev); \
  277. _mddev = list_entry(_tmp, struct mddev, all_mddevs); \
  278. _tmp != &all_mddevs;}); \
  279. ({ spin_lock(&all_mddevs_lock); \
  280. _tmp = _tmp->next;}) \
  281. )
  282. /* Rather than calling directly into the personality make_request function,
  283. * IO requests come here first so that we can check if the device is
  284. * being suspended pending a reconfiguration.
  285. * We hold a refcount over the call to ->make_request. By the time that
  286. * call has finished, the bio has been linked into some internal structure
  287. * and so is visible to ->quiesce(), so we don't need the refcount any more.
  288. */
  289. static void md_make_request(struct request_queue *q, struct bio *bio)
  290. {
  291. const int rw = bio_data_dir(bio);
  292. struct mddev *mddev = q->queuedata;
  293. int cpu;
  294. unsigned int sectors;
  295. if (mddev == NULL || mddev->pers == NULL
  296. || !mddev->ready) {
  297. bio_io_error(bio);
  298. return;
  299. }
  300. smp_rmb(); /* Ensure implications of 'active' are visible */
  301. rcu_read_lock();
  302. if (mddev->suspended) {
  303. DEFINE_WAIT(__wait);
  304. for (;;) {
  305. prepare_to_wait(&mddev->sb_wait, &__wait,
  306. TASK_UNINTERRUPTIBLE);
  307. if (!mddev->suspended)
  308. break;
  309. rcu_read_unlock();
  310. schedule();
  311. rcu_read_lock();
  312. }
  313. finish_wait(&mddev->sb_wait, &__wait);
  314. }
  315. atomic_inc(&mddev->active_io);
  316. rcu_read_unlock();
  317. /*
  318. * save the sectors now since our bio can
  319. * go away inside make_request
  320. */
  321. sectors = bio_sectors(bio);
  322. mddev->pers->make_request(mddev, bio);
  323. cpu = part_stat_lock();
  324. part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
  325. part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw], sectors);
  326. part_stat_unlock();
  327. if (atomic_dec_and_test(&mddev->active_io) && mddev->suspended)
  328. wake_up(&mddev->sb_wait);
  329. }
  330. /* mddev_suspend makes sure no new requests are submitted
  331. * to the device, and that any requests that have been submitted
  332. * are completely handled.
  333. * Once ->stop is called and completes, the module will be completely
  334. * unused.
  335. */
  336. void mddev_suspend(struct mddev *mddev)
  337. {
  338. BUG_ON(mddev->suspended);
  339. mddev->suspended = 1;
  340. synchronize_rcu();
  341. wait_event(mddev->sb_wait, atomic_read(&mddev->active_io) == 0);
  342. mddev->pers->quiesce(mddev, 1);
  343. }
  344. EXPORT_SYMBOL_GPL(mddev_suspend);
  345. void mddev_resume(struct mddev *mddev)
  346. {
  347. mddev->suspended = 0;
  348. wake_up(&mddev->sb_wait);
  349. mddev->pers->quiesce(mddev, 0);
  350. md_wakeup_thread(mddev->thread);
  351. md_wakeup_thread(mddev->sync_thread); /* possibly kick off a reshape */
  352. }
  353. EXPORT_SYMBOL_GPL(mddev_resume);
  354. int mddev_congested(struct mddev *mddev, int bits)
  355. {
  356. return mddev->suspended;
  357. }
  358. EXPORT_SYMBOL(mddev_congested);
  359. /*
  360. * Generic flush handling for md
  361. */
  362. static void md_end_flush(struct bio *bio, int err)
  363. {
  364. struct md_rdev *rdev = bio->bi_private;
  365. struct mddev *mddev = rdev->mddev;
  366. rdev_dec_pending(rdev, mddev);
  367. if (atomic_dec_and_test(&mddev->flush_pending)) {
  368. /* The pre-request flush has finished */
  369. queue_work(md_wq, &mddev->flush_work);
  370. }
  371. bio_put(bio);
  372. }
  373. static void md_submit_flush_data(struct work_struct *ws);
  374. static void submit_flushes(struct work_struct *ws)
  375. {
  376. struct mddev *mddev = container_of(ws, struct mddev, flush_work);
  377. struct md_rdev *rdev;
  378. INIT_WORK(&mddev->flush_work, md_submit_flush_data);
  379. atomic_set(&mddev->flush_pending, 1);
  380. rcu_read_lock();
  381. list_for_each_entry_rcu(rdev, &mddev->disks, same_set)
  382. if (rdev->raid_disk >= 0 &&
  383. !test_bit(Faulty, &rdev->flags)) {
  384. /* Take two references, one is dropped
  385. * when request finishes, one after
  386. * we reclaim rcu_read_lock
  387. */
  388. struct bio *bi;
  389. atomic_inc(&rdev->nr_pending);
  390. atomic_inc(&rdev->nr_pending);
  391. rcu_read_unlock();
  392. bi = bio_alloc_mddev(GFP_KERNEL, 0, mddev);
  393. bi->bi_end_io = md_end_flush;
  394. bi->bi_private = rdev;
  395. bi->bi_bdev = rdev->bdev;
  396. atomic_inc(&mddev->flush_pending);
  397. submit_bio(WRITE_FLUSH, bi);
  398. rcu_read_lock();
  399. rdev_dec_pending(rdev, mddev);
  400. }
  401. rcu_read_unlock();
  402. if (atomic_dec_and_test(&mddev->flush_pending))
  403. queue_work(md_wq, &mddev->flush_work);
  404. }
  405. static void md_submit_flush_data(struct work_struct *ws)
  406. {
  407. struct mddev *mddev = container_of(ws, struct mddev, flush_work);
  408. struct bio *bio = mddev->flush_bio;
  409. if (bio->bi_size == 0)
  410. /* an empty barrier - all done */
  411. bio_endio(bio, 0);
  412. else {
  413. bio->bi_rw &= ~REQ_FLUSH;
  414. mddev->pers->make_request(mddev, bio);
  415. }
  416. mddev->flush_bio = NULL;
  417. wake_up(&mddev->sb_wait);
  418. }
  419. void md_flush_request(struct mddev *mddev, struct bio *bio)
  420. {
  421. spin_lock_irq(&mddev->write_lock);
  422. wait_event_lock_irq(mddev->sb_wait,
  423. !mddev->flush_bio,
  424. mddev->write_lock, /*nothing*/);
  425. mddev->flush_bio = bio;
  426. spin_unlock_irq(&mddev->write_lock);
  427. INIT_WORK(&mddev->flush_work, submit_flushes);
  428. queue_work(md_wq, &mddev->flush_work);
  429. }
  430. EXPORT_SYMBOL(md_flush_request);
  431. /* Support for plugging.
  432. * This mirrors the plugging support in request_queue, but does not
  433. * require having a whole queue or request structures.
  434. * We allocate an md_plug_cb for each md device and each thread it gets
  435. * plugged on. This links tot the private plug_handle structure in the
  436. * personality data where we keep a count of the number of outstanding
  437. * plugs so other code can see if a plug is active.
  438. */
  439. struct md_plug_cb {
  440. struct blk_plug_cb cb;
  441. struct mddev *mddev;
  442. };
  443. static void plugger_unplug(struct blk_plug_cb *cb)
  444. {
  445. struct md_plug_cb *mdcb = container_of(cb, struct md_plug_cb, cb);
  446. if (atomic_dec_and_test(&mdcb->mddev->plug_cnt))
  447. md_wakeup_thread(mdcb->mddev->thread);
  448. kfree(mdcb);
  449. }
  450. /* Check that an unplug wakeup will come shortly.
  451. * If not, wakeup the md thread immediately
  452. */
  453. int mddev_check_plugged(struct mddev *mddev)
  454. {
  455. struct blk_plug *plug = current->plug;
  456. struct md_plug_cb *mdcb;
  457. if (!plug)
  458. return 0;
  459. list_for_each_entry(mdcb, &plug->cb_list, cb.list) {
  460. if (mdcb->cb.callback == plugger_unplug &&
  461. mdcb->mddev == mddev) {
  462. /* Already on the list, move to top */
  463. if (mdcb != list_first_entry(&plug->cb_list,
  464. struct md_plug_cb,
  465. cb.list))
  466. list_move(&mdcb->cb.list, &plug->cb_list);
  467. return 1;
  468. }
  469. }
  470. /* Not currently on the callback list */
  471. mdcb = kmalloc(sizeof(*mdcb), GFP_ATOMIC);
  472. if (!mdcb)
  473. return 0;
  474. mdcb->mddev = mddev;
  475. mdcb->cb.callback = plugger_unplug;
  476. atomic_inc(&mddev->plug_cnt);
  477. list_add(&mdcb->cb.list, &plug->cb_list);
  478. return 1;
  479. }
  480. EXPORT_SYMBOL_GPL(mddev_check_plugged);
  481. static inline struct mddev *mddev_get(struct mddev *mddev)
  482. {
  483. atomic_inc(&mddev->active);
  484. return mddev;
  485. }
  486. static void mddev_delayed_delete(struct work_struct *ws);
  487. static void mddev_put(struct mddev *mddev)
  488. {
  489. struct bio_set *bs = NULL;
  490. if (!atomic_dec_and_lock(&mddev->active, &all_mddevs_lock))
  491. return;
  492. if (!mddev->raid_disks && list_empty(&mddev->disks) &&
  493. mddev->ctime == 0 && !mddev->hold_active) {
  494. /* Array is not configured at all, and not held active,
  495. * so destroy it */
  496. list_del(&mddev->all_mddevs);
  497. bs = mddev->bio_set;
  498. mddev->bio_set = NULL;
  499. if (mddev->gendisk) {
  500. /* We did a probe so need to clean up. Call
  501. * queue_work inside the spinlock so that
  502. * flush_workqueue() after mddev_find will
  503. * succeed in waiting for the work to be done.
  504. */
  505. INIT_WORK(&mddev->del_work, mddev_delayed_delete);
  506. queue_work(md_misc_wq, &mddev->del_work);
  507. } else
  508. kfree(mddev);
  509. }
  510. spin_unlock(&all_mddevs_lock);
  511. if (bs)
  512. bioset_free(bs);
  513. }
  514. void mddev_init(struct mddev *mddev)
  515. {
  516. mutex_init(&mddev->open_mutex);
  517. mutex_init(&mddev->reconfig_mutex);
  518. mutex_init(&mddev->bitmap_info.mutex);
  519. INIT_LIST_HEAD(&mddev->disks);
  520. INIT_LIST_HEAD(&mddev->all_mddevs);
  521. init_timer(&mddev->safemode_timer);
  522. atomic_set(&mddev->active, 1);
  523. atomic_set(&mddev->openers, 0);
  524. atomic_set(&mddev->active_io, 0);
  525. atomic_set(&mddev->plug_cnt, 0);
  526. spin_lock_init(&mddev->write_lock);
  527. atomic_set(&mddev->flush_pending, 0);
  528. init_waitqueue_head(&mddev->sb_wait);
  529. init_waitqueue_head(&mddev->recovery_wait);
  530. mddev->reshape_position = MaxSector;
  531. mddev->resync_min = 0;
  532. mddev->resync_max = MaxSector;
  533. mddev->level = LEVEL_NONE;
  534. }
  535. EXPORT_SYMBOL_GPL(mddev_init);
  536. static struct mddev * mddev_find(dev_t unit)
  537. {
  538. struct mddev *mddev, *new = NULL;
  539. if (unit && MAJOR(unit) != MD_MAJOR)
  540. unit &= ~((1<<MdpMinorShift)-1);
  541. retry:
  542. spin_lock(&all_mddevs_lock);
  543. if (unit) {
  544. list_for_each_entry(mddev, &all_mddevs, all_mddevs)
  545. if (mddev->unit == unit) {
  546. mddev_get(mddev);
  547. spin_unlock(&all_mddevs_lock);
  548. kfree(new);
  549. return mddev;
  550. }
  551. if (new) {
  552. list_add(&new->all_mddevs, &all_mddevs);
  553. spin_unlock(&all_mddevs_lock);
  554. new->hold_active = UNTIL_IOCTL;
  555. return new;
  556. }
  557. } else if (new) {
  558. /* find an unused unit number */
  559. static int next_minor = 512;
  560. int start = next_minor;
  561. int is_free = 0;
  562. int dev = 0;
  563. while (!is_free) {
  564. dev = MKDEV(MD_MAJOR, next_minor);
  565. next_minor++;
  566. if (next_minor > MINORMASK)
  567. next_minor = 0;
  568. if (next_minor == start) {
  569. /* Oh dear, all in use. */
  570. spin_unlock(&all_mddevs_lock);
  571. kfree(new);
  572. return NULL;
  573. }
  574. is_free = 1;
  575. list_for_each_entry(mddev, &all_mddevs, all_mddevs)
  576. if (mddev->unit == dev) {
  577. is_free = 0;
  578. break;
  579. }
  580. }
  581. new->unit = dev;
  582. new->md_minor = MINOR(dev);
  583. new->hold_active = UNTIL_STOP;
  584. list_add(&new->all_mddevs, &all_mddevs);
  585. spin_unlock(&all_mddevs_lock);
  586. return new;
  587. }
  588. spin_unlock(&all_mddevs_lock);
  589. new = kzalloc(sizeof(*new), GFP_KERNEL);
  590. if (!new)
  591. return NULL;
  592. new->unit = unit;
  593. if (MAJOR(unit) == MD_MAJOR)
  594. new->md_minor = MINOR(unit);
  595. else
  596. new->md_minor = MINOR(unit) >> MdpMinorShift;
  597. mddev_init(new);
  598. goto retry;
  599. }
  600. static inline int mddev_lock(struct mddev * mddev)
  601. {
  602. return mutex_lock_interruptible(&mddev->reconfig_mutex);
  603. }
  604. static inline int mddev_is_locked(struct mddev *mddev)
  605. {
  606. return mutex_is_locked(&mddev->reconfig_mutex);
  607. }
  608. static inline int mddev_trylock(struct mddev * mddev)
  609. {
  610. return mutex_trylock(&mddev->reconfig_mutex);
  611. }
  612. static struct attribute_group md_redundancy_group;
  613. static void mddev_unlock(struct mddev * mddev)
  614. {
  615. if (mddev->to_remove) {
  616. /* These cannot be removed under reconfig_mutex as
  617. * an access to the files will try to take reconfig_mutex
  618. * while holding the file unremovable, which leads to
  619. * a deadlock.
  620. * So hold set sysfs_active while the remove in happeing,
  621. * and anything else which might set ->to_remove or my
  622. * otherwise change the sysfs namespace will fail with
  623. * -EBUSY if sysfs_active is still set.
  624. * We set sysfs_active under reconfig_mutex and elsewhere
  625. * test it under the same mutex to ensure its correct value
  626. * is seen.
  627. */
  628. struct attribute_group *to_remove = mddev->to_remove;
  629. mddev->to_remove = NULL;
  630. mddev->sysfs_active = 1;
  631. mutex_unlock(&mddev->reconfig_mutex);
  632. if (mddev->kobj.sd) {
  633. if (to_remove != &md_redundancy_group)
  634. sysfs_remove_group(&mddev->kobj, to_remove);
  635. if (mddev->pers == NULL ||
  636. mddev->pers->sync_request == NULL) {
  637. sysfs_remove_group(&mddev->kobj, &md_redundancy_group);
  638. if (mddev->sysfs_action)
  639. sysfs_put(mddev->sysfs_action);
  640. mddev->sysfs_action = NULL;
  641. }
  642. }
  643. mddev->sysfs_active = 0;
  644. } else
  645. mutex_unlock(&mddev->reconfig_mutex);
  646. /* As we've dropped the mutex we need a spinlock to
  647. * make sure the thread doesn't disappear
  648. */
  649. spin_lock(&pers_lock);
  650. md_wakeup_thread(mddev->thread);
  651. spin_unlock(&pers_lock);
  652. }
  653. static struct md_rdev * find_rdev_nr(struct mddev *mddev, int nr)
  654. {
  655. struct md_rdev *rdev;
  656. list_for_each_entry(rdev, &mddev->disks, same_set)
  657. if (rdev->desc_nr == nr)
  658. return rdev;
  659. return NULL;
  660. }
  661. static struct md_rdev * find_rdev(struct mddev * mddev, dev_t dev)
  662. {
  663. struct md_rdev *rdev;
  664. list_for_each_entry(rdev, &mddev->disks, same_set)
  665. if (rdev->bdev->bd_dev == dev)
  666. return rdev;
  667. return NULL;
  668. }
  669. static struct md_personality *find_pers(int level, char *clevel)
  670. {
  671. struct md_personality *pers;
  672. list_for_each_entry(pers, &pers_list, list) {
  673. if (level != LEVEL_NONE && pers->level == level)
  674. return pers;
  675. if (strcmp(pers->name, clevel)==0)
  676. return pers;
  677. }
  678. return NULL;
  679. }
  680. /* return the offset of the super block in 512byte sectors */
  681. static inline sector_t calc_dev_sboffset(struct md_rdev *rdev)
  682. {
  683. sector_t num_sectors = i_size_read(rdev->bdev->bd_inode) / 512;
  684. return MD_NEW_SIZE_SECTORS(num_sectors);
  685. }
  686. static int alloc_disk_sb(struct md_rdev * rdev)
  687. {
  688. if (rdev->sb_page)
  689. MD_BUG();
  690. rdev->sb_page = alloc_page(GFP_KERNEL);
  691. if (!rdev->sb_page) {
  692. printk(KERN_ALERT "md: out of memory.\n");
  693. return -ENOMEM;
  694. }
  695. return 0;
  696. }
  697. static void free_disk_sb(struct md_rdev * rdev)
  698. {
  699. if (rdev->sb_page) {
  700. put_page(rdev->sb_page);
  701. rdev->sb_loaded = 0;
  702. rdev->sb_page = NULL;
  703. rdev->sb_start = 0;
  704. rdev->sectors = 0;
  705. }
  706. if (rdev->bb_page) {
  707. put_page(rdev->bb_page);
  708. rdev->bb_page = NULL;
  709. }
  710. }
  711. static void super_written(struct bio *bio, int error)
  712. {
  713. struct md_rdev *rdev = bio->bi_private;
  714. struct mddev *mddev = rdev->mddev;
  715. if (error || !test_bit(BIO_UPTODATE, &bio->bi_flags)) {
  716. printk("md: super_written gets error=%d, uptodate=%d\n",
  717. error, test_bit(BIO_UPTODATE, &bio->bi_flags));
  718. WARN_ON(test_bit(BIO_UPTODATE, &bio->bi_flags));
  719. md_error(mddev, rdev);
  720. }
  721. if (atomic_dec_and_test(&mddev->pending_writes))
  722. wake_up(&mddev->sb_wait);
  723. bio_put(bio);
  724. }
  725. void md_super_write(struct mddev *mddev, struct md_rdev *rdev,
  726. sector_t sector, int size, struct page *page)
  727. {
  728. /* write first size bytes of page to sector of rdev
  729. * Increment mddev->pending_writes before returning
  730. * and decrement it on completion, waking up sb_wait
  731. * if zero is reached.
  732. * If an error occurred, call md_error
  733. */
  734. struct bio *bio = bio_alloc_mddev(GFP_NOIO, 1, mddev);
  735. bio->bi_bdev = rdev->meta_bdev ? rdev->meta_bdev : rdev->bdev;
  736. bio->bi_sector = sector;
  737. bio_add_page(bio, page, size, 0);
  738. bio->bi_private = rdev;
  739. bio->bi_end_io = super_written;
  740. atomic_inc(&mddev->pending_writes);
  741. submit_bio(WRITE_FLUSH_FUA, bio);
  742. }
  743. void md_super_wait(struct mddev *mddev)
  744. {
  745. /* wait for all superblock writes that were scheduled to complete */
  746. DEFINE_WAIT(wq);
  747. for(;;) {
  748. prepare_to_wait(&mddev->sb_wait, &wq, TASK_UNINTERRUPTIBLE);
  749. if (atomic_read(&mddev->pending_writes)==0)
  750. break;
  751. schedule();
  752. }
  753. finish_wait(&mddev->sb_wait, &wq);
  754. }
  755. static void bi_complete(struct bio *bio, int error)
  756. {
  757. complete((struct completion*)bio->bi_private);
  758. }
  759. int sync_page_io(struct md_rdev *rdev, sector_t sector, int size,
  760. struct page *page, int rw, bool metadata_op)
  761. {
  762. struct bio *bio = bio_alloc_mddev(GFP_NOIO, 1, rdev->mddev);
  763. struct completion event;
  764. int ret;
  765. rw |= REQ_SYNC;
  766. bio->bi_bdev = (metadata_op && rdev->meta_bdev) ?
  767. rdev->meta_bdev : rdev->bdev;
  768. if (metadata_op)
  769. bio->bi_sector = sector + rdev->sb_start;
  770. else
  771. bio->bi_sector = sector + rdev->data_offset;
  772. bio_add_page(bio, page, size, 0);
  773. init_completion(&event);
  774. bio->bi_private = &event;
  775. bio->bi_end_io = bi_complete;
  776. submit_bio(rw, bio);
  777. wait_for_completion(&event);
  778. ret = test_bit(BIO_UPTODATE, &bio->bi_flags);
  779. bio_put(bio);
  780. return ret;
  781. }
  782. EXPORT_SYMBOL_GPL(sync_page_io);
  783. static int read_disk_sb(struct md_rdev * rdev, int size)
  784. {
  785. char b[BDEVNAME_SIZE];
  786. if (!rdev->sb_page) {
  787. MD_BUG();
  788. return -EINVAL;
  789. }
  790. if (rdev->sb_loaded)
  791. return 0;
  792. if (!sync_page_io(rdev, 0, size, rdev->sb_page, READ, true))
  793. goto fail;
  794. rdev->sb_loaded = 1;
  795. return 0;
  796. fail:
  797. printk(KERN_WARNING "md: disabled device %s, could not read superblock.\n",
  798. bdevname(rdev->bdev,b));
  799. return -EINVAL;
  800. }
  801. static int uuid_equal(mdp_super_t *sb1, mdp_super_t *sb2)
  802. {
  803. return sb1->set_uuid0 == sb2->set_uuid0 &&
  804. sb1->set_uuid1 == sb2->set_uuid1 &&
  805. sb1->set_uuid2 == sb2->set_uuid2 &&
  806. sb1->set_uuid3 == sb2->set_uuid3;
  807. }
  808. static int sb_equal(mdp_super_t *sb1, mdp_super_t *sb2)
  809. {
  810. int ret;
  811. mdp_super_t *tmp1, *tmp2;
  812. tmp1 = kmalloc(sizeof(*tmp1),GFP_KERNEL);
  813. tmp2 = kmalloc(sizeof(*tmp2),GFP_KERNEL);
  814. if (!tmp1 || !tmp2) {
  815. ret = 0;
  816. printk(KERN_INFO "md.c sb_equal(): failed to allocate memory!\n");
  817. goto abort;
  818. }
  819. *tmp1 = *sb1;
  820. *tmp2 = *sb2;
  821. /*
  822. * nr_disks is not constant
  823. */
  824. tmp1->nr_disks = 0;
  825. tmp2->nr_disks = 0;
  826. ret = (memcmp(tmp1, tmp2, MD_SB_GENERIC_CONSTANT_WORDS * 4) == 0);
  827. abort:
  828. kfree(tmp1);
  829. kfree(tmp2);
  830. return ret;
  831. }
  832. static u32 md_csum_fold(u32 csum)
  833. {
  834. csum = (csum & 0xffff) + (csum >> 16);
  835. return (csum & 0xffff) + (csum >> 16);
  836. }
  837. static unsigned int calc_sb_csum(mdp_super_t * sb)
  838. {
  839. u64 newcsum = 0;
  840. u32 *sb32 = (u32*)sb;
  841. int i;
  842. unsigned int disk_csum, csum;
  843. disk_csum = sb->sb_csum;
  844. sb->sb_csum = 0;
  845. for (i = 0; i < MD_SB_BYTES/4 ; i++)
  846. newcsum += sb32[i];
  847. csum = (newcsum & 0xffffffff) + (newcsum>>32);
  848. #ifdef CONFIG_ALPHA
  849. /* This used to use csum_partial, which was wrong for several
  850. * reasons including that different results are returned on
  851. * different architectures. It isn't critical that we get exactly
  852. * the same return value as before (we always csum_fold before
  853. * testing, and that removes any differences). However as we
  854. * know that csum_partial always returned a 16bit value on
  855. * alphas, do a fold to maximise conformity to previous behaviour.
  856. */
  857. sb->sb_csum = md_csum_fold(disk_csum);
  858. #else
  859. sb->sb_csum = disk_csum;
  860. #endif
  861. return csum;
  862. }
  863. /*
  864. * Handle superblock details.
  865. * We want to be able to handle multiple superblock formats
  866. * so we have a common interface to them all, and an array of
  867. * different handlers.
  868. * We rely on user-space to write the initial superblock, and support
  869. * reading and updating of superblocks.
  870. * Interface methods are:
  871. * int load_super(struct md_rdev *dev, struct md_rdev *refdev, int minor_version)
  872. * loads and validates a superblock on dev.
  873. * if refdev != NULL, compare superblocks on both devices
  874. * Return:
  875. * 0 - dev has a superblock that is compatible with refdev
  876. * 1 - dev has a superblock that is compatible and newer than refdev
  877. * so dev should be used as the refdev in future
  878. * -EINVAL superblock incompatible or invalid
  879. * -othererror e.g. -EIO
  880. *
  881. * int validate_super(struct mddev *mddev, struct md_rdev *dev)
  882. * Verify that dev is acceptable into mddev.
  883. * The first time, mddev->raid_disks will be 0, and data from
  884. * dev should be merged in. Subsequent calls check that dev
  885. * is new enough. Return 0 or -EINVAL
  886. *
  887. * void sync_super(struct mddev *mddev, struct md_rdev *dev)
  888. * Update the superblock for rdev with data in mddev
  889. * This does not write to disc.
  890. *
  891. */
  892. struct super_type {
  893. char *name;
  894. struct module *owner;
  895. int (*load_super)(struct md_rdev *rdev, struct md_rdev *refdev,
  896. int minor_version);
  897. int (*validate_super)(struct mddev *mddev, struct md_rdev *rdev);
  898. void (*sync_super)(struct mddev *mddev, struct md_rdev *rdev);
  899. unsigned long long (*rdev_size_change)(struct md_rdev *rdev,
  900. sector_t num_sectors);
  901. };
  902. /*
  903. * Check that the given mddev has no bitmap.
  904. *
  905. * This function is called from the run method of all personalities that do not
  906. * support bitmaps. It prints an error message and returns non-zero if mddev
  907. * has a bitmap. Otherwise, it returns 0.
  908. *
  909. */
  910. int md_check_no_bitmap(struct mddev *mddev)
  911. {
  912. if (!mddev->bitmap_info.file && !mddev->bitmap_info.offset)
  913. return 0;
  914. printk(KERN_ERR "%s: bitmaps are not supported for %s\n",
  915. mdname(mddev), mddev->pers->name);
  916. return 1;
  917. }
  918. EXPORT_SYMBOL(md_check_no_bitmap);
  919. /*
  920. * load_super for 0.90.0
  921. */
  922. static int super_90_load(struct md_rdev *rdev, struct md_rdev *refdev, int minor_version)
  923. {
  924. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  925. mdp_super_t *sb;
  926. int ret;
  927. /*
  928. * Calculate the position of the superblock (512byte sectors),
  929. * it's at the end of the disk.
  930. *
  931. * It also happens to be a multiple of 4Kb.
  932. */
  933. rdev->sb_start = calc_dev_sboffset(rdev);
  934. ret = read_disk_sb(rdev, MD_SB_BYTES);
  935. if (ret) return ret;
  936. ret = -EINVAL;
  937. bdevname(rdev->bdev, b);
  938. sb = page_address(rdev->sb_page);
  939. if (sb->md_magic != MD_SB_MAGIC) {
  940. printk(KERN_ERR "md: invalid raid superblock magic on %s\n",
  941. b);
  942. goto abort;
  943. }
  944. if (sb->major_version != 0 ||
  945. sb->minor_version < 90 ||
  946. sb->minor_version > 91) {
  947. printk(KERN_WARNING "Bad version number %d.%d on %s\n",
  948. sb->major_version, sb->minor_version,
  949. b);
  950. goto abort;
  951. }
  952. if (sb->raid_disks <= 0)
  953. goto abort;
  954. if (md_csum_fold(calc_sb_csum(sb)) != md_csum_fold(sb->sb_csum)) {
  955. printk(KERN_WARNING "md: invalid superblock checksum on %s\n",
  956. b);
  957. goto abort;
  958. }
  959. rdev->preferred_minor = sb->md_minor;
  960. rdev->data_offset = 0;
  961. rdev->sb_size = MD_SB_BYTES;
  962. rdev->badblocks.shift = -1;
  963. if (sb->level == LEVEL_MULTIPATH)
  964. rdev->desc_nr = -1;
  965. else
  966. rdev->desc_nr = sb->this_disk.number;
  967. if (!refdev) {
  968. ret = 1;
  969. } else {
  970. __u64 ev1, ev2;
  971. mdp_super_t *refsb = page_address(refdev->sb_page);
  972. if (!uuid_equal(refsb, sb)) {
  973. printk(KERN_WARNING "md: %s has different UUID to %s\n",
  974. b, bdevname(refdev->bdev,b2));
  975. goto abort;
  976. }
  977. if (!sb_equal(refsb, sb)) {
  978. printk(KERN_WARNING "md: %s has same UUID"
  979. " but different superblock to %s\n",
  980. b, bdevname(refdev->bdev, b2));
  981. goto abort;
  982. }
  983. ev1 = md_event(sb);
  984. ev2 = md_event(refsb);
  985. if (ev1 > ev2)
  986. ret = 1;
  987. else
  988. ret = 0;
  989. }
  990. rdev->sectors = rdev->sb_start;
  991. /* Limit to 4TB as metadata cannot record more than that */
  992. if (rdev->sectors >= (2ULL << 32))
  993. rdev->sectors = (2ULL << 32) - 2;
  994. if (rdev->sectors < ((sector_t)sb->size) * 2 && sb->level >= 1)
  995. /* "this cannot possibly happen" ... */
  996. ret = -EINVAL;
  997. abort:
  998. return ret;
  999. }
  1000. /*
  1001. * validate_super for 0.90.0
  1002. */
  1003. static int super_90_validate(struct mddev *mddev, struct md_rdev *rdev)
  1004. {
  1005. mdp_disk_t *desc;
  1006. mdp_super_t *sb = page_address(rdev->sb_page);
  1007. __u64 ev1 = md_event(sb);
  1008. rdev->raid_disk = -1;
  1009. clear_bit(Faulty, &rdev->flags);
  1010. clear_bit(In_sync, &rdev->flags);
  1011. clear_bit(WriteMostly, &rdev->flags);
  1012. if (mddev->raid_disks == 0) {
  1013. mddev->major_version = 0;
  1014. mddev->minor_version = sb->minor_version;
  1015. mddev->patch_version = sb->patch_version;
  1016. mddev->external = 0;
  1017. mddev->chunk_sectors = sb->chunk_size >> 9;
  1018. mddev->ctime = sb->ctime;
  1019. mddev->utime = sb->utime;
  1020. mddev->level = sb->level;
  1021. mddev->clevel[0] = 0;
  1022. mddev->layout = sb->layout;
  1023. mddev->raid_disks = sb->raid_disks;
  1024. mddev->dev_sectors = ((sector_t)sb->size) * 2;
  1025. mddev->events = ev1;
  1026. mddev->bitmap_info.offset = 0;
  1027. mddev->bitmap_info.default_offset = MD_SB_BYTES >> 9;
  1028. if (mddev->minor_version >= 91) {
  1029. mddev->reshape_position = sb->reshape_position;
  1030. mddev->delta_disks = sb->delta_disks;
  1031. mddev->new_level = sb->new_level;
  1032. mddev->new_layout = sb->new_layout;
  1033. mddev->new_chunk_sectors = sb->new_chunk >> 9;
  1034. } else {
  1035. mddev->reshape_position = MaxSector;
  1036. mddev->delta_disks = 0;
  1037. mddev->new_level = mddev->level;
  1038. mddev->new_layout = mddev->layout;
  1039. mddev->new_chunk_sectors = mddev->chunk_sectors;
  1040. }
  1041. if (sb->state & (1<<MD_SB_CLEAN))
  1042. mddev->recovery_cp = MaxSector;
  1043. else {
  1044. if (sb->events_hi == sb->cp_events_hi &&
  1045. sb->events_lo == sb->cp_events_lo) {
  1046. mddev->recovery_cp = sb->recovery_cp;
  1047. } else
  1048. mddev->recovery_cp = 0;
  1049. }
  1050. memcpy(mddev->uuid+0, &sb->set_uuid0, 4);
  1051. memcpy(mddev->uuid+4, &sb->set_uuid1, 4);
  1052. memcpy(mddev->uuid+8, &sb->set_uuid2, 4);
  1053. memcpy(mddev->uuid+12,&sb->set_uuid3, 4);
  1054. mddev->max_disks = MD_SB_DISKS;
  1055. if (sb->state & (1<<MD_SB_BITMAP_PRESENT) &&
  1056. mddev->bitmap_info.file == NULL)
  1057. mddev->bitmap_info.offset =
  1058. mddev->bitmap_info.default_offset;
  1059. } else if (mddev->pers == NULL) {
  1060. /* Insist on good event counter while assembling, except
  1061. * for spares (which don't need an event count) */
  1062. ++ev1;
  1063. if (sb->disks[rdev->desc_nr].state & (
  1064. (1<<MD_DISK_SYNC) | (1 << MD_DISK_ACTIVE)))
  1065. if (ev1 < mddev->events)
  1066. return -EINVAL;
  1067. } else if (mddev->bitmap) {
  1068. /* if adding to array with a bitmap, then we can accept an
  1069. * older device ... but not too old.
  1070. */
  1071. if (ev1 < mddev->bitmap->events_cleared)
  1072. return 0;
  1073. } else {
  1074. if (ev1 < mddev->events)
  1075. /* just a hot-add of a new device, leave raid_disk at -1 */
  1076. return 0;
  1077. }
  1078. if (mddev->level != LEVEL_MULTIPATH) {
  1079. desc = sb->disks + rdev->desc_nr;
  1080. if (desc->state & (1<<MD_DISK_FAULTY))
  1081. set_bit(Faulty, &rdev->flags);
  1082. else if (desc->state & (1<<MD_DISK_SYNC) /* &&
  1083. desc->raid_disk < mddev->raid_disks */) {
  1084. set_bit(In_sync, &rdev->flags);
  1085. rdev->raid_disk = desc->raid_disk;
  1086. } else if (desc->state & (1<<MD_DISK_ACTIVE)) {
  1087. /* active but not in sync implies recovery up to
  1088. * reshape position. We don't know exactly where
  1089. * that is, so set to zero for now */
  1090. if (mddev->minor_version >= 91) {
  1091. rdev->recovery_offset = 0;
  1092. rdev->raid_disk = desc->raid_disk;
  1093. }
  1094. }
  1095. if (desc->state & (1<<MD_DISK_WRITEMOSTLY))
  1096. set_bit(WriteMostly, &rdev->flags);
  1097. } else /* MULTIPATH are always insync */
  1098. set_bit(In_sync, &rdev->flags);
  1099. return 0;
  1100. }
  1101. /*
  1102. * sync_super for 0.90.0
  1103. */
  1104. static void super_90_sync(struct mddev *mddev, struct md_rdev *rdev)
  1105. {
  1106. mdp_super_t *sb;
  1107. struct md_rdev *rdev2;
  1108. int next_spare = mddev->raid_disks;
  1109. /* make rdev->sb match mddev data..
  1110. *
  1111. * 1/ zero out disks
  1112. * 2/ Add info for each disk, keeping track of highest desc_nr (next_spare);
  1113. * 3/ any empty disks < next_spare become removed
  1114. *
  1115. * disks[0] gets initialised to REMOVED because
  1116. * we cannot be sure from other fields if it has
  1117. * been initialised or not.
  1118. */
  1119. int i;
  1120. int active=0, working=0,failed=0,spare=0,nr_disks=0;
  1121. rdev->sb_size = MD_SB_BYTES;
  1122. sb = page_address(rdev->sb_page);
  1123. memset(sb, 0, sizeof(*sb));
  1124. sb->md_magic = MD_SB_MAGIC;
  1125. sb->major_version = mddev->major_version;
  1126. sb->patch_version = mddev->patch_version;
  1127. sb->gvalid_words = 0; /* ignored */
  1128. memcpy(&sb->set_uuid0, mddev->uuid+0, 4);
  1129. memcpy(&sb->set_uuid1, mddev->uuid+4, 4);
  1130. memcpy(&sb->set_uuid2, mddev->uuid+8, 4);
  1131. memcpy(&sb->set_uuid3, mddev->uuid+12,4);
  1132. sb->ctime = mddev->ctime;
  1133. sb->level = mddev->level;
  1134. sb->size = mddev->dev_sectors / 2;
  1135. sb->raid_disks = mddev->raid_disks;
  1136. sb->md_minor = mddev->md_minor;
  1137. sb->not_persistent = 0;
  1138. sb->utime = mddev->utime;
  1139. sb->state = 0;
  1140. sb->events_hi = (mddev->events>>32);
  1141. sb->events_lo = (u32)mddev->events;
  1142. if (mddev->reshape_position == MaxSector)
  1143. sb->minor_version = 90;
  1144. else {
  1145. sb->minor_version = 91;
  1146. sb->reshape_position = mddev->reshape_position;
  1147. sb->new_level = mddev->new_level;
  1148. sb->delta_disks = mddev->delta_disks;
  1149. sb->new_layout = mddev->new_layout;
  1150. sb->new_chunk = mddev->new_chunk_sectors << 9;
  1151. }
  1152. mddev->minor_version = sb->minor_version;
  1153. if (mddev->in_sync)
  1154. {
  1155. sb->recovery_cp = mddev->recovery_cp;
  1156. sb->cp_events_hi = (mddev->events>>32);
  1157. sb->cp_events_lo = (u32)mddev->events;
  1158. if (mddev->recovery_cp == MaxSector)
  1159. sb->state = (1<< MD_SB_CLEAN);
  1160. } else
  1161. sb->recovery_cp = 0;
  1162. sb->layout = mddev->layout;
  1163. sb->chunk_size = mddev->chunk_sectors << 9;
  1164. if (mddev->bitmap && mddev->bitmap_info.file == NULL)
  1165. sb->state |= (1<<MD_SB_BITMAP_PRESENT);
  1166. sb->disks[0].state = (1<<MD_DISK_REMOVED);
  1167. list_for_each_entry(rdev2, &mddev->disks, same_set) {
  1168. mdp_disk_t *d;
  1169. int desc_nr;
  1170. int is_active = test_bit(In_sync, &rdev2->flags);
  1171. if (rdev2->raid_disk >= 0 &&
  1172. sb->minor_version >= 91)
  1173. /* we have nowhere to store the recovery_offset,
  1174. * but if it is not below the reshape_position,
  1175. * we can piggy-back on that.
  1176. */
  1177. is_active = 1;
  1178. if (rdev2->raid_disk < 0 ||
  1179. test_bit(Faulty, &rdev2->flags))
  1180. is_active = 0;
  1181. if (is_active)
  1182. desc_nr = rdev2->raid_disk;
  1183. else
  1184. desc_nr = next_spare++;
  1185. rdev2->desc_nr = desc_nr;
  1186. d = &sb->disks[rdev2->desc_nr];
  1187. nr_disks++;
  1188. d->number = rdev2->desc_nr;
  1189. d->major = MAJOR(rdev2->bdev->bd_dev);
  1190. d->minor = MINOR(rdev2->bdev->bd_dev);
  1191. if (is_active)
  1192. d->raid_disk = rdev2->raid_disk;
  1193. else
  1194. d->raid_disk = rdev2->desc_nr; /* compatibility */
  1195. if (test_bit(Faulty, &rdev2->flags))
  1196. d->state = (1<<MD_DISK_FAULTY);
  1197. else if (is_active) {
  1198. d->state = (1<<MD_DISK_ACTIVE);
  1199. if (test_bit(In_sync, &rdev2->flags))
  1200. d->state |= (1<<MD_DISK_SYNC);
  1201. active++;
  1202. working++;
  1203. } else {
  1204. d->state = 0;
  1205. spare++;
  1206. working++;
  1207. }
  1208. if (test_bit(WriteMostly, &rdev2->flags))
  1209. d->state |= (1<<MD_DISK_WRITEMOSTLY);
  1210. }
  1211. /* now set the "removed" and "faulty" bits on any missing devices */
  1212. for (i=0 ; i < mddev->raid_disks ; i++) {
  1213. mdp_disk_t *d = &sb->disks[i];
  1214. if (d->state == 0 && d->number == 0) {
  1215. d->number = i;
  1216. d->raid_disk = i;
  1217. d->state = (1<<MD_DISK_REMOVED);
  1218. d->state |= (1<<MD_DISK_FAULTY);
  1219. failed++;
  1220. }
  1221. }
  1222. sb->nr_disks = nr_disks;
  1223. sb->active_disks = active;
  1224. sb->working_disks = working;
  1225. sb->failed_disks = failed;
  1226. sb->spare_disks = spare;
  1227. sb->this_disk = sb->disks[rdev->desc_nr];
  1228. sb->sb_csum = calc_sb_csum(sb);
  1229. }
  1230. /*
  1231. * rdev_size_change for 0.90.0
  1232. */
  1233. static unsigned long long
  1234. super_90_rdev_size_change(struct md_rdev *rdev, sector_t num_sectors)
  1235. {
  1236. if (num_sectors && num_sectors < rdev->mddev->dev_sectors)
  1237. return 0; /* component must fit device */
  1238. if (rdev->mddev->bitmap_info.offset)
  1239. return 0; /* can't move bitmap */
  1240. rdev->sb_start = calc_dev_sboffset(rdev);
  1241. if (!num_sectors || num_sectors > rdev->sb_start)
  1242. num_sectors = rdev->sb_start;
  1243. /* Limit to 4TB as metadata cannot record more than that.
  1244. * 4TB == 2^32 KB, or 2*2^32 sectors.
  1245. */
  1246. if (num_sectors >= (2ULL << 32))
  1247. num_sectors = (2ULL << 32) - 2;
  1248. md_super_write(rdev->mddev, rdev, rdev->sb_start, rdev->sb_size,
  1249. rdev->sb_page);
  1250. md_super_wait(rdev->mddev);
  1251. return num_sectors;
  1252. }
  1253. /*
  1254. * version 1 superblock
  1255. */
  1256. static __le32 calc_sb_1_csum(struct mdp_superblock_1 * sb)
  1257. {
  1258. __le32 disk_csum;
  1259. u32 csum;
  1260. unsigned long long newcsum;
  1261. int size = 256 + le32_to_cpu(sb->max_dev)*2;
  1262. __le32 *isuper = (__le32*)sb;
  1263. int i;
  1264. disk_csum = sb->sb_csum;
  1265. sb->sb_csum = 0;
  1266. newcsum = 0;
  1267. for (i=0; size>=4; size -= 4 )
  1268. newcsum += le32_to_cpu(*isuper++);
  1269. if (size == 2)
  1270. newcsum += le16_to_cpu(*(__le16*) isuper);
  1271. csum = (newcsum & 0xffffffff) + (newcsum >> 32);
  1272. sb->sb_csum = disk_csum;
  1273. return cpu_to_le32(csum);
  1274. }
  1275. static int md_set_badblocks(struct badblocks *bb, sector_t s, int sectors,
  1276. int acknowledged);
  1277. static int super_1_load(struct md_rdev *rdev, struct md_rdev *refdev, int minor_version)
  1278. {
  1279. struct mdp_superblock_1 *sb;
  1280. int ret;
  1281. sector_t sb_start;
  1282. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  1283. int bmask;
  1284. /*
  1285. * Calculate the position of the superblock in 512byte sectors.
  1286. * It is always aligned to a 4K boundary and
  1287. * depeding on minor_version, it can be:
  1288. * 0: At least 8K, but less than 12K, from end of device
  1289. * 1: At start of device
  1290. * 2: 4K from start of device.
  1291. */
  1292. switch(minor_version) {
  1293. case 0:
  1294. sb_start = i_size_read(rdev->bdev->bd_inode) >> 9;
  1295. sb_start -= 8*2;
  1296. sb_start &= ~(sector_t)(4*2-1);
  1297. break;
  1298. case 1:
  1299. sb_start = 0;
  1300. break;
  1301. case 2:
  1302. sb_start = 8;
  1303. break;
  1304. default:
  1305. return -EINVAL;
  1306. }
  1307. rdev->sb_start = sb_start;
  1308. /* superblock is rarely larger than 1K, but it can be larger,
  1309. * and it is safe to read 4k, so we do that
  1310. */
  1311. ret = read_disk_sb(rdev, 4096);
  1312. if (ret) return ret;
  1313. sb = page_address(rdev->sb_page);
  1314. if (sb->magic != cpu_to_le32(MD_SB_MAGIC) ||
  1315. sb->major_version != cpu_to_le32(1) ||
  1316. le32_to_cpu(sb->max_dev) > (4096-256)/2 ||
  1317. le64_to_cpu(sb->super_offset) != rdev->sb_start ||
  1318. (le32_to_cpu(sb->feature_map) & ~MD_FEATURE_ALL) != 0)
  1319. return -EINVAL;
  1320. if (calc_sb_1_csum(sb) != sb->sb_csum) {
  1321. printk("md: invalid superblock checksum on %s\n",
  1322. bdevname(rdev->bdev,b));
  1323. return -EINVAL;
  1324. }
  1325. if (le64_to_cpu(sb->data_size) < 10) {
  1326. printk("md: data_size too small on %s\n",
  1327. bdevname(rdev->bdev,b));
  1328. return -EINVAL;
  1329. }
  1330. rdev->preferred_minor = 0xffff;
  1331. rdev->data_offset = le64_to_cpu(sb->data_offset);
  1332. atomic_set(&rdev->corrected_errors, le32_to_cpu(sb->cnt_corrected_read));
  1333. rdev->sb_size = le32_to_cpu(sb->max_dev) * 2 + 256;
  1334. bmask = queue_logical_block_size(rdev->bdev->bd_disk->queue)-1;
  1335. if (rdev->sb_size & bmask)
  1336. rdev->sb_size = (rdev->sb_size | bmask) + 1;
  1337. if (minor_version
  1338. && rdev->data_offset < sb_start + (rdev->sb_size/512))
  1339. return -EINVAL;
  1340. if (sb->level == cpu_to_le32(LEVEL_MULTIPATH))
  1341. rdev->desc_nr = -1;
  1342. else
  1343. rdev->desc_nr = le32_to_cpu(sb->dev_number);
  1344. if (!rdev->bb_page) {
  1345. rdev->bb_page = alloc_page(GFP_KERNEL);
  1346. if (!rdev->bb_page)
  1347. return -ENOMEM;
  1348. }
  1349. if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_BAD_BLOCKS) &&
  1350. rdev->badblocks.count == 0) {
  1351. /* need to load the bad block list.
  1352. * Currently we limit it to one page.
  1353. */
  1354. s32 offset;
  1355. sector_t bb_sector;
  1356. u64 *bbp;
  1357. int i;
  1358. int sectors = le16_to_cpu(sb->bblog_size);
  1359. if (sectors > (PAGE_SIZE / 512))
  1360. return -EINVAL;
  1361. offset = le32_to_cpu(sb->bblog_offset);
  1362. if (offset == 0)
  1363. return -EINVAL;
  1364. bb_sector = (long long)offset;
  1365. if (!sync_page_io(rdev, bb_sector, sectors << 9,
  1366. rdev->bb_page, READ, true))
  1367. return -EIO;
  1368. bbp = (u64 *)page_address(rdev->bb_page);
  1369. rdev->badblocks.shift = sb->bblog_shift;
  1370. for (i = 0 ; i < (sectors << (9-3)) ; i++, bbp++) {
  1371. u64 bb = le64_to_cpu(*bbp);
  1372. int count = bb & (0x3ff);
  1373. u64 sector = bb >> 10;
  1374. sector <<= sb->bblog_shift;
  1375. count <<= sb->bblog_shift;
  1376. if (bb + 1 == 0)
  1377. break;
  1378. if (md_set_badblocks(&rdev->badblocks,
  1379. sector, count, 1) == 0)
  1380. return -EINVAL;
  1381. }
  1382. } else if (sb->bblog_offset == 0)
  1383. rdev->badblocks.shift = -1;
  1384. if (!refdev) {
  1385. ret = 1;
  1386. } else {
  1387. __u64 ev1, ev2;
  1388. struct mdp_superblock_1 *refsb = page_address(refdev->sb_page);
  1389. if (memcmp(sb->set_uuid, refsb->set_uuid, 16) != 0 ||
  1390. sb->level != refsb->level ||
  1391. sb->layout != refsb->layout ||
  1392. sb->chunksize != refsb->chunksize) {
  1393. printk(KERN_WARNING "md: %s has strangely different"
  1394. " superblock to %s\n",
  1395. bdevname(rdev->bdev,b),
  1396. bdevname(refdev->bdev,b2));
  1397. return -EINVAL;
  1398. }
  1399. ev1 = le64_to_cpu(sb->events);
  1400. ev2 = le64_to_cpu(refsb->events);
  1401. if (ev1 > ev2)
  1402. ret = 1;
  1403. else
  1404. ret = 0;
  1405. }
  1406. if (minor_version)
  1407. rdev->sectors = (i_size_read(rdev->bdev->bd_inode) >> 9) -
  1408. le64_to_cpu(sb->data_offset);
  1409. else
  1410. rdev->sectors = rdev->sb_start;
  1411. if (rdev->sectors < le64_to_cpu(sb->data_size))
  1412. return -EINVAL;
  1413. rdev->sectors = le64_to_cpu(sb->data_size);
  1414. if (le64_to_cpu(sb->size) > rdev->sectors)
  1415. return -EINVAL;
  1416. return ret;
  1417. }
  1418. static int super_1_validate(struct mddev *mddev, struct md_rdev *rdev)
  1419. {
  1420. struct mdp_superblock_1 *sb = page_address(rdev->sb_page);
  1421. __u64 ev1 = le64_to_cpu(sb->events);
  1422. rdev->raid_disk = -1;
  1423. clear_bit(Faulty, &rdev->flags);
  1424. clear_bit(In_sync, &rdev->flags);
  1425. clear_bit(WriteMostly, &rdev->flags);
  1426. if (mddev->raid_disks == 0) {
  1427. mddev->major_version = 1;
  1428. mddev->patch_version = 0;
  1429. mddev->external = 0;
  1430. mddev->chunk_sectors = le32_to_cpu(sb->chunksize);
  1431. mddev->ctime = le64_to_cpu(sb->ctime) & ((1ULL << 32)-1);
  1432. mddev->utime = le64_to_cpu(sb->utime) & ((1ULL << 32)-1);
  1433. mddev->level = le32_to_cpu(sb->level);
  1434. mddev->clevel[0] = 0;
  1435. mddev->layout = le32_to_cpu(sb->layout);
  1436. mddev->raid_disks = le32_to_cpu(sb->raid_disks);
  1437. mddev->dev_sectors = le64_to_cpu(sb->size);
  1438. mddev->events = ev1;
  1439. mddev->bitmap_info.offset = 0;
  1440. mddev->bitmap_info.default_offset = 1024 >> 9;
  1441. mddev->recovery_cp = le64_to_cpu(sb->resync_offset);
  1442. memcpy(mddev->uuid, sb->set_uuid, 16);
  1443. mddev->max_disks = (4096-256)/2;
  1444. if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_BITMAP_OFFSET) &&
  1445. mddev->bitmap_info.file == NULL )
  1446. mddev->bitmap_info.offset =
  1447. (__s32)le32_to_cpu(sb->bitmap_offset);
  1448. if ((le32_to_cpu(sb->feature_map) & MD_FEATURE_RESHAPE_ACTIVE)) {
  1449. mddev->reshape_position = le64_to_cpu(sb->reshape_position);
  1450. mddev->delta_disks = le32_to_cpu(sb->delta_disks);
  1451. mddev->new_level = le32_to_cpu(sb->new_level);
  1452. mddev->new_layout = le32_to_cpu(sb->new_layout);
  1453. mddev->new_chunk_sectors = le32_to_cpu(sb->new_chunk);
  1454. } else {
  1455. mddev->reshape_position = MaxSector;
  1456. mddev->delta_disks = 0;
  1457. mddev->new_level = mddev->level;
  1458. mddev->new_layout = mddev->layout;
  1459. mddev->new_chunk_sectors = mddev->chunk_sectors;
  1460. }
  1461. } else if (mddev->pers == NULL) {
  1462. /* Insist of good event counter while assembling, except for
  1463. * spares (which don't need an event count) */
  1464. ++ev1;
  1465. if (rdev->desc_nr >= 0 &&
  1466. rdev->desc_nr < le32_to_cpu(sb->max_dev) &&
  1467. le16_to_cpu(sb->dev_roles[rdev->desc_nr]) < 0xfffe)
  1468. if (ev1 < mddev->events)
  1469. return -EINVAL;
  1470. } else if (mddev->bitmap) {
  1471. /* If adding to array with a bitmap, then we can accept an
  1472. * older device, but not too old.
  1473. */
  1474. if (ev1 < mddev->bitmap->events_cleared)
  1475. return 0;
  1476. } else {
  1477. if (ev1 < mddev->events)
  1478. /* just a hot-add of a new device, leave raid_disk at -1 */
  1479. return 0;
  1480. }
  1481. if (mddev->level != LEVEL_MULTIPATH) {
  1482. int role;
  1483. if (rdev->desc_nr < 0 ||
  1484. rdev->desc_nr >= le32_to_cpu(sb->max_dev)) {
  1485. role = 0xffff;
  1486. rdev->desc_nr = -1;
  1487. } else
  1488. role = le16_to_cpu(sb->dev_roles[rdev->desc_nr]);
  1489. switch(role) {
  1490. case 0xffff: /* spare */
  1491. break;
  1492. case 0xfffe: /* faulty */
  1493. set_bit(Faulty, &rdev->flags);
  1494. break;
  1495. default:
  1496. if ((le32_to_cpu(sb->feature_map) &
  1497. MD_FEATURE_RECOVERY_OFFSET))
  1498. rdev->recovery_offset = le64_to_cpu(sb->recovery_offset);
  1499. else
  1500. set_bit(In_sync, &rdev->flags);
  1501. rdev->raid_disk = role;
  1502. break;
  1503. }
  1504. if (sb->devflags & WriteMostly1)
  1505. set_bit(WriteMostly, &rdev->flags);
  1506. } else /* MULTIPATH are always insync */
  1507. set_bit(In_sync, &rdev->flags);
  1508. return 0;
  1509. }
  1510. static void super_1_sync(struct mddev *mddev, struct md_rdev *rdev)
  1511. {
  1512. struct mdp_superblock_1 *sb;
  1513. struct md_rdev *rdev2;
  1514. int max_dev, i;
  1515. /* make rdev->sb match mddev and rdev data. */
  1516. sb = page_address(rdev->sb_page);
  1517. sb->feature_map = 0;
  1518. sb->pad0 = 0;
  1519. sb->recovery_offset = cpu_to_le64(0);
  1520. memset(sb->pad1, 0, sizeof(sb->pad1));
  1521. memset(sb->pad3, 0, sizeof(sb->pad3));
  1522. sb->utime = cpu_to_le64((__u64)mddev->utime);
  1523. sb->events = cpu_to_le64(mddev->events);
  1524. if (mddev->in_sync)
  1525. sb->resync_offset = cpu_to_le64(mddev->recovery_cp);
  1526. else
  1527. sb->resync_offset = cpu_to_le64(0);
  1528. sb->cnt_corrected_read = cpu_to_le32(atomic_read(&rdev->corrected_errors));
  1529. sb->raid_disks = cpu_to_le32(mddev->raid_disks);
  1530. sb->size = cpu_to_le64(mddev->dev_sectors);
  1531. sb->chunksize = cpu_to_le32(mddev->chunk_sectors);
  1532. sb->level = cpu_to_le32(mddev->level);
  1533. sb->layout = cpu_to_le32(mddev->layout);
  1534. if (test_bit(WriteMostly, &rdev->flags))
  1535. sb->devflags |= WriteMostly1;
  1536. else
  1537. sb->devflags &= ~WriteMostly1;
  1538. if (mddev->bitmap && mddev->bitmap_info.file == NULL) {
  1539. sb->bitmap_offset = cpu_to_le32((__u32)mddev->bitmap_info.offset);
  1540. sb->feature_map = cpu_to_le32(MD_FEATURE_BITMAP_OFFSET);
  1541. }
  1542. if (rdev->raid_disk >= 0 &&
  1543. !test_bit(In_sync, &rdev->flags)) {
  1544. sb->feature_map |=
  1545. cpu_to_le32(MD_FEATURE_RECOVERY_OFFSET);
  1546. sb->recovery_offset =
  1547. cpu_to_le64(rdev->recovery_offset);
  1548. }
  1549. if (mddev->reshape_position != MaxSector) {
  1550. sb->feature_map |= cpu_to_le32(MD_FEATURE_RESHAPE_ACTIVE);
  1551. sb->reshape_position = cpu_to_le64(mddev->reshape_position);
  1552. sb->new_layout = cpu_to_le32(mddev->new_layout);
  1553. sb->delta_disks = cpu_to_le32(mddev->delta_disks);
  1554. sb->new_level = cpu_to_le32(mddev->new_level);
  1555. sb->new_chunk = cpu_to_le32(mddev->new_chunk_sectors);
  1556. }
  1557. if (rdev->badblocks.count == 0)
  1558. /* Nothing to do for bad blocks*/ ;
  1559. else if (sb->bblog_offset == 0)
  1560. /* Cannot record bad blocks on this device */
  1561. md_error(mddev, rdev);
  1562. else {
  1563. struct badblocks *bb = &rdev->badblocks;
  1564. u64 *bbp = (u64 *)page_address(rdev->bb_page);
  1565. u64 *p = bb->page;
  1566. sb->feature_map |= cpu_to_le32(MD_FEATURE_BAD_BLOCKS);
  1567. if (bb->changed) {
  1568. unsigned seq;
  1569. retry:
  1570. seq = read_seqbegin(&bb->lock);
  1571. memset(bbp, 0xff, PAGE_SIZE);
  1572. for (i = 0 ; i < bb->count ; i++) {
  1573. u64 internal_bb = *p++;
  1574. u64 store_bb = ((BB_OFFSET(internal_bb) << 10)
  1575. | BB_LEN(internal_bb));
  1576. *bbp++ = cpu_to_le64(store_bb);
  1577. }
  1578. if (read_seqretry(&bb->lock, seq))
  1579. goto retry;
  1580. bb->sector = (rdev->sb_start +
  1581. (int)le32_to_cpu(sb->bblog_offset));
  1582. bb->size = le16_to_cpu(sb->bblog_size);
  1583. bb->changed = 0;
  1584. }
  1585. }
  1586. max_dev = 0;
  1587. list_for_each_entry(rdev2, &mddev->disks, same_set)
  1588. if (rdev2->desc_nr+1 > max_dev)
  1589. max_dev = rdev2->desc_nr+1;
  1590. if (max_dev > le32_to_cpu(sb->max_dev)) {
  1591. int bmask;
  1592. sb->max_dev = cpu_to_le32(max_dev);
  1593. rdev->sb_size = max_dev * 2 + 256;
  1594. bmask = queue_logical_block_size(rdev->bdev->bd_disk->queue)-1;
  1595. if (rdev->sb_size & bmask)
  1596. rdev->sb_size = (rdev->sb_size | bmask) + 1;
  1597. } else
  1598. max_dev = le32_to_cpu(sb->max_dev);
  1599. for (i=0; i<max_dev;i++)
  1600. sb->dev_roles[i] = cpu_to_le16(0xfffe);
  1601. list_for_each_entry(rdev2, &mddev->disks, same_set) {
  1602. i = rdev2->desc_nr;
  1603. if (test_bit(Faulty, &rdev2->flags))
  1604. sb->dev_roles[i] = cpu_to_le16(0xfffe);
  1605. else if (test_bit(In_sync, &rdev2->flags))
  1606. sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk);
  1607. else if (rdev2->raid_disk >= 0)
  1608. sb->dev_roles[i] = cpu_to_le16(rdev2->raid_disk);
  1609. else
  1610. sb->dev_roles[i] = cpu_to_le16(0xffff);
  1611. }
  1612. sb->sb_csum = calc_sb_1_csum(sb);
  1613. }
  1614. static unsigned long long
  1615. super_1_rdev_size_change(struct md_rdev *rdev, sector_t num_sectors)
  1616. {
  1617. struct mdp_superblock_1 *sb;
  1618. sector_t max_sectors;
  1619. if (num_sectors && num_sectors < rdev->mddev->dev_sectors)
  1620. return 0; /* component must fit device */
  1621. if (rdev->sb_start < rdev->data_offset) {
  1622. /* minor versions 1 and 2; superblock before data */
  1623. max_sectors = i_size_read(rdev->bdev->bd_inode) >> 9;
  1624. max_sectors -= rdev->data_offset;
  1625. if (!num_sectors || num_sectors > max_sectors)
  1626. num_sectors = max_sectors;
  1627. } else if (rdev->mddev->bitmap_info.offset) {
  1628. /* minor version 0 with bitmap we can't move */
  1629. return 0;
  1630. } else {
  1631. /* minor version 0; superblock after data */
  1632. sector_t sb_start;
  1633. sb_start = (i_size_read(rdev->bdev->bd_inode) >> 9) - 8*2;
  1634. sb_start &= ~(sector_t)(4*2 - 1);
  1635. max_sectors = rdev->sectors + sb_start - rdev->sb_start;
  1636. if (!num_sectors || num_sectors > max_sectors)
  1637. num_sectors = max_sectors;
  1638. rdev->sb_start = sb_start;
  1639. }
  1640. sb = page_address(rdev->sb_page);
  1641. sb->data_size = cpu_to_le64(num_sectors);
  1642. sb->super_offset = rdev->sb_start;
  1643. sb->sb_csum = calc_sb_1_csum(sb);
  1644. md_super_write(rdev->mddev, rdev, rdev->sb_start, rdev->sb_size,
  1645. rdev->sb_page);
  1646. md_super_wait(rdev->mddev);
  1647. return num_sectors;
  1648. }
  1649. static struct super_type super_types[] = {
  1650. [0] = {
  1651. .name = "0.90.0",
  1652. .owner = THIS_MODULE,
  1653. .load_super = super_90_load,
  1654. .validate_super = super_90_validate,
  1655. .sync_super = super_90_sync,
  1656. .rdev_size_change = super_90_rdev_size_change,
  1657. },
  1658. [1] = {
  1659. .name = "md-1",
  1660. .owner = THIS_MODULE,
  1661. .load_super = super_1_load,
  1662. .validate_super = super_1_validate,
  1663. .sync_super = super_1_sync,
  1664. .rdev_size_change = super_1_rdev_size_change,
  1665. },
  1666. };
  1667. static void sync_super(struct mddev *mddev, struct md_rdev *rdev)
  1668. {
  1669. if (mddev->sync_super) {
  1670. mddev->sync_super(mddev, rdev);
  1671. return;
  1672. }
  1673. BUG_ON(mddev->major_version >= ARRAY_SIZE(super_types));
  1674. super_types[mddev->major_version].sync_super(mddev, rdev);
  1675. }
  1676. static int match_mddev_units(struct mddev *mddev1, struct mddev *mddev2)
  1677. {
  1678. struct md_rdev *rdev, *rdev2;
  1679. rcu_read_lock();
  1680. rdev_for_each_rcu(rdev, mddev1)
  1681. rdev_for_each_rcu(rdev2, mddev2)
  1682. if (rdev->bdev->bd_contains ==
  1683. rdev2->bdev->bd_contains) {
  1684. rcu_read_unlock();
  1685. return 1;
  1686. }
  1687. rcu_read_unlock();
  1688. return 0;
  1689. }
  1690. static LIST_HEAD(pending_raid_disks);
  1691. /*
  1692. * Try to register data integrity profile for an mddev
  1693. *
  1694. * This is called when an array is started and after a disk has been kicked
  1695. * from the array. It only succeeds if all working and active component devices
  1696. * are integrity capable with matching profiles.
  1697. */
  1698. int md_integrity_register(struct mddev *mddev)
  1699. {
  1700. struct md_rdev *rdev, *reference = NULL;
  1701. if (list_empty(&mddev->disks))
  1702. return 0; /* nothing to do */
  1703. if (!mddev->gendisk || blk_get_integrity(mddev->gendisk))
  1704. return 0; /* shouldn't register, or already is */
  1705. list_for_each_entry(rdev, &mddev->disks, same_set) {
  1706. /* skip spares and non-functional disks */
  1707. if (test_bit(Faulty, &rdev->flags))
  1708. continue;
  1709. if (rdev->raid_disk < 0)
  1710. continue;
  1711. if (!reference) {
  1712. /* Use the first rdev as the reference */
  1713. reference = rdev;
  1714. continue;
  1715. }
  1716. /* does this rdev's profile match the reference profile? */
  1717. if (blk_integrity_compare(reference->bdev->bd_disk,
  1718. rdev->bdev->bd_disk) < 0)
  1719. return -EINVAL;
  1720. }
  1721. if (!reference || !bdev_get_integrity(reference->bdev))
  1722. return 0;
  1723. /*
  1724. * All component devices are integrity capable and have matching
  1725. * profiles, register the common profile for the md device.
  1726. */
  1727. if (blk_integrity_register(mddev->gendisk,
  1728. bdev_get_integrity(reference->bdev)) != 0) {
  1729. printk(KERN_ERR "md: failed to register integrity for %s\n",
  1730. mdname(mddev));
  1731. return -EINVAL;
  1732. }
  1733. printk(KERN_NOTICE "md: data integrity enabled on %s\n", mdname(mddev));
  1734. if (bioset_integrity_create(mddev->bio_set, BIO_POOL_SIZE)) {
  1735. printk(KERN_ERR "md: failed to create integrity pool for %s\n",
  1736. mdname(mddev));
  1737. return -EINVAL;
  1738. }
  1739. return 0;
  1740. }
  1741. EXPORT_SYMBOL(md_integrity_register);
  1742. /* Disable data integrity if non-capable/non-matching disk is being added */
  1743. void md_integrity_add_rdev(struct md_rdev *rdev, struct mddev *mddev)
  1744. {
  1745. struct blk_integrity *bi_rdev = bdev_get_integrity(rdev->bdev);
  1746. struct blk_integrity *bi_mddev = blk_get_integrity(mddev->gendisk);
  1747. if (!bi_mddev) /* nothing to do */
  1748. return;
  1749. if (rdev->raid_disk < 0) /* skip spares */
  1750. return;
  1751. if (bi_rdev && blk_integrity_compare(mddev->gendisk,
  1752. rdev->bdev->bd_disk) >= 0)
  1753. return;
  1754. printk(KERN_NOTICE "disabling data integrity on %s\n", mdname(mddev));
  1755. blk_integrity_unregister(mddev->gendisk);
  1756. }
  1757. EXPORT_SYMBOL(md_integrity_add_rdev);
  1758. static int bind_rdev_to_array(struct md_rdev * rdev, struct mddev * mddev)
  1759. {
  1760. char b[BDEVNAME_SIZE];
  1761. struct kobject *ko;
  1762. char *s;
  1763. int err;
  1764. if (rdev->mddev) {
  1765. MD_BUG();
  1766. return -EINVAL;
  1767. }
  1768. /* prevent duplicates */
  1769. if (find_rdev(mddev, rdev->bdev->bd_dev))
  1770. return -EEXIST;
  1771. /* make sure rdev->sectors exceeds mddev->dev_sectors */
  1772. if (rdev->sectors && (mddev->dev_sectors == 0 ||
  1773. rdev->sectors < mddev->dev_sectors)) {
  1774. if (mddev->pers) {
  1775. /* Cannot change size, so fail
  1776. * If mddev->level <= 0, then we don't care
  1777. * about aligning sizes (e.g. linear)
  1778. */
  1779. if (mddev->level > 0)
  1780. return -ENOSPC;
  1781. } else
  1782. mddev->dev_sectors = rdev->sectors;
  1783. }
  1784. /* Verify rdev->desc_nr is unique.
  1785. * If it is -1, assign a free number, else
  1786. * check number is not in use
  1787. */
  1788. if (rdev->desc_nr < 0) {
  1789. int choice = 0;
  1790. if (mddev->pers) choice = mddev->raid_disks;
  1791. while (find_rdev_nr(mddev, choice))
  1792. choice++;
  1793. rdev->desc_nr = choice;
  1794. } else {
  1795. if (find_rdev_nr(mddev, rdev->desc_nr))
  1796. return -EBUSY;
  1797. }
  1798. if (mddev->max_disks && rdev->desc_nr >= mddev->max_disks) {
  1799. printk(KERN_WARNING "md: %s: array is limited to %d devices\n",
  1800. mdname(mddev), mddev->max_disks);
  1801. return -EBUSY;
  1802. }
  1803. bdevname(rdev->bdev,b);
  1804. while ( (s=strchr(b, '/')) != NULL)
  1805. *s = '!';
  1806. rdev->mddev = mddev;
  1807. printk(KERN_INFO "md: bind<%s>\n", b);
  1808. if ((err = kobject_add(&rdev->kobj, &mddev->kobj, "dev-%s", b)))
  1809. goto fail;
  1810. ko = &part_to_dev(rdev->bdev->bd_part)->kobj;
  1811. if (sysfs_create_link(&rdev->kobj, ko, "block"))
  1812. /* failure here is OK */;
  1813. rdev->sysfs_state = sysfs_get_dirent_safe(rdev->kobj.sd, "state");
  1814. list_add_rcu(&rdev->same_set, &mddev->disks);
  1815. bd_link_disk_holder(rdev->bdev, mddev->gendisk);
  1816. /* May as well allow recovery to be retried once */
  1817. mddev->recovery_disabled++;
  1818. return 0;
  1819. fail:
  1820. printk(KERN_WARNING "md: failed to register dev-%s for %s\n",
  1821. b, mdname(mddev));
  1822. return err;
  1823. }
  1824. static void md_delayed_delete(struct work_struct *ws)
  1825. {
  1826. struct md_rdev *rdev = container_of(ws, struct md_rdev, del_work);
  1827. kobject_del(&rdev->kobj);
  1828. kobject_put(&rdev->kobj);
  1829. }
  1830. static void unbind_rdev_from_array(struct md_rdev * rdev)
  1831. {
  1832. char b[BDEVNAME_SIZE];
  1833. if (!rdev->mddev) {
  1834. MD_BUG();
  1835. return;
  1836. }
  1837. bd_unlink_disk_holder(rdev->bdev, rdev->mddev->gendisk);
  1838. list_del_rcu(&rdev->same_set);
  1839. printk(KERN_INFO "md: unbind<%s>\n", bdevname(rdev->bdev,b));
  1840. rdev->mddev = NULL;
  1841. sysfs_remove_link(&rdev->kobj, "block");
  1842. sysfs_put(rdev->sysfs_state);
  1843. rdev->sysfs_state = NULL;
  1844. kfree(rdev->badblocks.page);
  1845. rdev->badblocks.count = 0;
  1846. rdev->badblocks.page = NULL;
  1847. /* We need to delay this, otherwise we can deadlock when
  1848. * writing to 'remove' to "dev/state". We also need
  1849. * to delay it due to rcu usage.
  1850. */
  1851. synchronize_rcu();
  1852. INIT_WORK(&rdev->del_work, md_delayed_delete);
  1853. kobject_get(&rdev->kobj);
  1854. queue_work(md_misc_wq, &rdev->del_work);
  1855. }
  1856. /*
  1857. * prevent the device from being mounted, repartitioned or
  1858. * otherwise reused by a RAID array (or any other kernel
  1859. * subsystem), by bd_claiming the device.
  1860. */
  1861. static int lock_rdev(struct md_rdev *rdev, dev_t dev, int shared)
  1862. {
  1863. int err = 0;
  1864. struct block_device *bdev;
  1865. char b[BDEVNAME_SIZE];
  1866. bdev = blkdev_get_by_dev(dev, FMODE_READ|FMODE_WRITE|FMODE_EXCL,
  1867. shared ? (struct md_rdev *)lock_rdev : rdev);
  1868. if (IS_ERR(bdev)) {
  1869. printk(KERN_ERR "md: could not open %s.\n",
  1870. __bdevname(dev, b));
  1871. return PTR_ERR(bdev);
  1872. }
  1873. rdev->bdev = bdev;
  1874. return err;
  1875. }
  1876. static void unlock_rdev(struct md_rdev *rdev)
  1877. {
  1878. struct block_device *bdev = rdev->bdev;
  1879. rdev->bdev = NULL;
  1880. if (!bdev)
  1881. MD_BUG();
  1882. blkdev_put(bdev, FMODE_READ|FMODE_WRITE|FMODE_EXCL);
  1883. }
  1884. void md_autodetect_dev(dev_t dev);
  1885. static void export_rdev(struct md_rdev * rdev)
  1886. {
  1887. char b[BDEVNAME_SIZE];
  1888. printk(KERN_INFO "md: export_rdev(%s)\n",
  1889. bdevname(rdev->bdev,b));
  1890. if (rdev->mddev)
  1891. MD_BUG();
  1892. free_disk_sb(rdev);
  1893. #ifndef MODULE
  1894. if (test_bit(AutoDetected, &rdev->flags))
  1895. md_autodetect_dev(rdev->bdev->bd_dev);
  1896. #endif
  1897. unlock_rdev(rdev);
  1898. kobject_put(&rdev->kobj);
  1899. }
  1900. static void kick_rdev_from_array(struct md_rdev * rdev)
  1901. {
  1902. unbind_rdev_from_array(rdev);
  1903. export_rdev(rdev);
  1904. }
  1905. static void export_array(struct mddev *mddev)
  1906. {
  1907. struct md_rdev *rdev, *tmp;
  1908. rdev_for_each(rdev, tmp, mddev) {
  1909. if (!rdev->mddev) {
  1910. MD_BUG();
  1911. continue;
  1912. }
  1913. kick_rdev_from_array(rdev);
  1914. }
  1915. if (!list_empty(&mddev->disks))
  1916. MD_BUG();
  1917. mddev->raid_disks = 0;
  1918. mddev->major_version = 0;
  1919. }
  1920. static void print_desc(mdp_disk_t *desc)
  1921. {
  1922. printk(" DISK<N:%d,(%d,%d),R:%d,S:%d>\n", desc->number,
  1923. desc->major,desc->minor,desc->raid_disk,desc->state);
  1924. }
  1925. static void print_sb_90(mdp_super_t *sb)
  1926. {
  1927. int i;
  1928. printk(KERN_INFO
  1929. "md: SB: (V:%d.%d.%d) ID:<%08x.%08x.%08x.%08x> CT:%08x\n",
  1930. sb->major_version, sb->minor_version, sb->patch_version,
  1931. sb->set_uuid0, sb->set_uuid1, sb->set_uuid2, sb->set_uuid3,
  1932. sb->ctime);
  1933. printk(KERN_INFO "md: L%d S%08d ND:%d RD:%d md%d LO:%d CS:%d\n",
  1934. sb->level, sb->size, sb->nr_disks, sb->raid_disks,
  1935. sb->md_minor, sb->layout, sb->chunk_size);
  1936. printk(KERN_INFO "md: UT:%08x ST:%d AD:%d WD:%d"
  1937. " FD:%d SD:%d CSUM:%08x E:%08lx\n",
  1938. sb->utime, sb->state, sb->active_disks, sb->working_disks,
  1939. sb->failed_disks, sb->spare_disks,
  1940. sb->sb_csum, (unsigned long)sb->events_lo);
  1941. printk(KERN_INFO);
  1942. for (i = 0; i < MD_SB_DISKS; i++) {
  1943. mdp_disk_t *desc;
  1944. desc = sb->disks + i;
  1945. if (desc->number || desc->major || desc->minor ||
  1946. desc->raid_disk || (desc->state && (desc->state != 4))) {
  1947. printk(" D %2d: ", i);
  1948. print_desc(desc);
  1949. }
  1950. }
  1951. printk(KERN_INFO "md: THIS: ");
  1952. print_desc(&sb->this_disk);
  1953. }
  1954. static void print_sb_1(struct mdp_superblock_1 *sb)
  1955. {
  1956. __u8 *uuid;
  1957. uuid = sb->set_uuid;
  1958. printk(KERN_INFO
  1959. "md: SB: (V:%u) (F:0x%08x) Array-ID:<%pU>\n"
  1960. "md: Name: \"%s\" CT:%llu\n",
  1961. le32_to_cpu(sb->major_version),
  1962. le32_to_cpu(sb->feature_map),
  1963. uuid,
  1964. sb->set_name,
  1965. (unsigned long long)le64_to_cpu(sb->ctime)
  1966. & MD_SUPERBLOCK_1_TIME_SEC_MASK);
  1967. uuid = sb->device_uuid;
  1968. printk(KERN_INFO
  1969. "md: L%u SZ%llu RD:%u LO:%u CS:%u DO:%llu DS:%llu SO:%llu"
  1970. " RO:%llu\n"
  1971. "md: Dev:%08x UUID: %pU\n"
  1972. "md: (F:0x%08x) UT:%llu Events:%llu ResyncOffset:%llu CSUM:0x%08x\n"
  1973. "md: (MaxDev:%u) \n",
  1974. le32_to_cpu(sb->level),
  1975. (unsigned long long)le64_to_cpu(sb->size),
  1976. le32_to_cpu(sb->raid_disks),
  1977. le32_to_cpu(sb->layout),
  1978. le32_to_cpu(sb->chunksize),
  1979. (unsigned long long)le64_to_cpu(sb->data_offset),
  1980. (unsigned long long)le64_to_cpu(sb->data_size),
  1981. (unsigned long long)le64_to_cpu(sb->super_offset),
  1982. (unsigned long long)le64_to_cpu(sb->recovery_offset),
  1983. le32_to_cpu(sb->dev_number),
  1984. uuid,
  1985. sb->devflags,
  1986. (unsigned long long)le64_to_cpu(sb->utime) & MD_SUPERBLOCK_1_TIME_SEC_MASK,
  1987. (unsigned long long)le64_to_cpu(sb->events),
  1988. (unsigned long long)le64_to_cpu(sb->resync_offset),
  1989. le32_to_cpu(sb->sb_csum),
  1990. le32_to_cpu(sb->max_dev)
  1991. );
  1992. }
  1993. static void print_rdev(struct md_rdev *rdev, int major_version)
  1994. {
  1995. char b[BDEVNAME_SIZE];
  1996. printk(KERN_INFO "md: rdev %s, Sect:%08llu F:%d S:%d DN:%u\n",
  1997. bdevname(rdev->bdev, b), (unsigned long long)rdev->sectors,
  1998. test_bit(Faulty, &rdev->flags), test_bit(In_sync, &rdev->flags),
  1999. rdev->desc_nr);
  2000. if (rdev->sb_loaded) {
  2001. printk(KERN_INFO "md: rdev superblock (MJ:%d):\n", major_version);
  2002. switch (major_version) {
  2003. case 0:
  2004. print_sb_90(page_address(rdev->sb_page));
  2005. break;
  2006. case 1:
  2007. print_sb_1(page_address(rdev->sb_page));
  2008. break;
  2009. }
  2010. } else
  2011. printk(KERN_INFO "md: no rdev superblock!\n");
  2012. }
  2013. static void md_print_devices(void)
  2014. {
  2015. struct list_head *tmp;
  2016. struct md_rdev *rdev;
  2017. struct mddev *mddev;
  2018. char b[BDEVNAME_SIZE];
  2019. printk("\n");
  2020. printk("md: **********************************\n");
  2021. printk("md: * <COMPLETE RAID STATE PRINTOUT> *\n");
  2022. printk("md: **********************************\n");
  2023. for_each_mddev(mddev, tmp) {
  2024. if (mddev->bitmap)
  2025. bitmap_print_sb(mddev->bitmap);
  2026. else
  2027. printk("%s: ", mdname(mddev));
  2028. list_for_each_entry(rdev, &mddev->disks, same_set)
  2029. printk("<%s>", bdevname(rdev->bdev,b));
  2030. printk("\n");
  2031. list_for_each_entry(rdev, &mddev->disks, same_set)
  2032. print_rdev(rdev, mddev->major_version);
  2033. }
  2034. printk("md: **********************************\n");
  2035. printk("\n");
  2036. }
  2037. static void sync_sbs(struct mddev * mddev, int nospares)
  2038. {
  2039. /* Update each superblock (in-memory image), but
  2040. * if we are allowed to, skip spares which already
  2041. * have the right event counter, or have one earlier
  2042. * (which would mean they aren't being marked as dirty
  2043. * with the rest of the array)
  2044. */
  2045. struct md_rdev *rdev;
  2046. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2047. if (rdev->sb_events == mddev->events ||
  2048. (nospares &&
  2049. rdev->raid_disk < 0 &&
  2050. rdev->sb_events+1 == mddev->events)) {
  2051. /* Don't update this superblock */
  2052. rdev->sb_loaded = 2;
  2053. } else {
  2054. sync_super(mddev, rdev);
  2055. rdev->sb_loaded = 1;
  2056. }
  2057. }
  2058. }
  2059. static void md_update_sb(struct mddev * mddev, int force_change)
  2060. {
  2061. struct md_rdev *rdev;
  2062. int sync_req;
  2063. int nospares = 0;
  2064. int any_badblocks_changed = 0;
  2065. repeat:
  2066. /* First make sure individual recovery_offsets are correct */
  2067. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2068. if (rdev->raid_disk >= 0 &&
  2069. mddev->delta_disks >= 0 &&
  2070. !test_bit(In_sync, &rdev->flags) &&
  2071. mddev->curr_resync_completed > rdev->recovery_offset)
  2072. rdev->recovery_offset = mddev->curr_resync_completed;
  2073. }
  2074. if (!mddev->persistent) {
  2075. clear_bit(MD_CHANGE_CLEAN, &mddev->flags);
  2076. clear_bit(MD_CHANGE_DEVS, &mddev->flags);
  2077. if (!mddev->external) {
  2078. clear_bit(MD_CHANGE_PENDING, &mddev->flags);
  2079. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2080. if (rdev->badblocks.changed) {
  2081. md_ack_all_badblocks(&rdev->badblocks);
  2082. md_error(mddev, rdev);
  2083. }
  2084. clear_bit(Blocked, &rdev->flags);
  2085. clear_bit(BlockedBadBlocks, &rdev->flags);
  2086. wake_up(&rdev->blocked_wait);
  2087. }
  2088. }
  2089. wake_up(&mddev->sb_wait);
  2090. return;
  2091. }
  2092. spin_lock_irq(&mddev->write_lock);
  2093. mddev->utime = get_seconds();
  2094. if (test_and_clear_bit(MD_CHANGE_DEVS, &mddev->flags))
  2095. force_change = 1;
  2096. if (test_and_clear_bit(MD_CHANGE_CLEAN, &mddev->flags))
  2097. /* just a clean<-> dirty transition, possibly leave spares alone,
  2098. * though if events isn't the right even/odd, we will have to do
  2099. * spares after all
  2100. */
  2101. nospares = 1;
  2102. if (force_change)
  2103. nospares = 0;
  2104. if (mddev->degraded)
  2105. /* If the array is degraded, then skipping spares is both
  2106. * dangerous and fairly pointless.
  2107. * Dangerous because a device that was removed from the array
  2108. * might have a event_count that still looks up-to-date,
  2109. * so it can be re-added without a resync.
  2110. * Pointless because if there are any spares to skip,
  2111. * then a recovery will happen and soon that array won't
  2112. * be degraded any more and the spare can go back to sleep then.
  2113. */
  2114. nospares = 0;
  2115. sync_req = mddev->in_sync;
  2116. /* If this is just a dirty<->clean transition, and the array is clean
  2117. * and 'events' is odd, we can roll back to the previous clean state */
  2118. if (nospares
  2119. && (mddev->in_sync && mddev->recovery_cp == MaxSector)
  2120. && mddev->can_decrease_events
  2121. && mddev->events != 1) {
  2122. mddev->events--;
  2123. mddev->can_decrease_events = 0;
  2124. } else {
  2125. /* otherwise we have to go forward and ... */
  2126. mddev->events ++;
  2127. mddev->can_decrease_events = nospares;
  2128. }
  2129. if (!mddev->events) {
  2130. /*
  2131. * oops, this 64-bit counter should never wrap.
  2132. * Either we are in around ~1 trillion A.C., assuming
  2133. * 1 reboot per second, or we have a bug:
  2134. */
  2135. MD_BUG();
  2136. mddev->events --;
  2137. }
  2138. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2139. if (rdev->badblocks.changed)
  2140. any_badblocks_changed++;
  2141. if (test_bit(Faulty, &rdev->flags))
  2142. set_bit(FaultRecorded, &rdev->flags);
  2143. }
  2144. sync_sbs(mddev, nospares);
  2145. spin_unlock_irq(&mddev->write_lock);
  2146. pr_debug("md: updating %s RAID superblock on device (in sync %d)\n",
  2147. mdname(mddev), mddev->in_sync);
  2148. bitmap_update_sb(mddev->bitmap);
  2149. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2150. char b[BDEVNAME_SIZE];
  2151. if (rdev->sb_loaded != 1)
  2152. continue; /* no noise on spare devices */
  2153. if (!test_bit(Faulty, &rdev->flags) &&
  2154. rdev->saved_raid_disk == -1) {
  2155. md_super_write(mddev,rdev,
  2156. rdev->sb_start, rdev->sb_size,
  2157. rdev->sb_page);
  2158. pr_debug("md: (write) %s's sb offset: %llu\n",
  2159. bdevname(rdev->bdev, b),
  2160. (unsigned long long)rdev->sb_start);
  2161. rdev->sb_events = mddev->events;
  2162. if (rdev->badblocks.size) {
  2163. md_super_write(mddev, rdev,
  2164. rdev->badblocks.sector,
  2165. rdev->badblocks.size << 9,
  2166. rdev->bb_page);
  2167. rdev->badblocks.size = 0;
  2168. }
  2169. } else if (test_bit(Faulty, &rdev->flags))
  2170. pr_debug("md: %s (skipping faulty)\n",
  2171. bdevname(rdev->bdev, b));
  2172. else
  2173. pr_debug("(skipping incremental s/r ");
  2174. if (mddev->level == LEVEL_MULTIPATH)
  2175. /* only need to write one superblock... */
  2176. break;
  2177. }
  2178. md_super_wait(mddev);
  2179. /* if there was a failure, MD_CHANGE_DEVS was set, and we re-write super */
  2180. spin_lock_irq(&mddev->write_lock);
  2181. if (mddev->in_sync != sync_req ||
  2182. test_bit(MD_CHANGE_DEVS, &mddev->flags)) {
  2183. /* have to write it out again */
  2184. spin_unlock_irq(&mddev->write_lock);
  2185. goto repeat;
  2186. }
  2187. clear_bit(MD_CHANGE_PENDING, &mddev->flags);
  2188. spin_unlock_irq(&mddev->write_lock);
  2189. wake_up(&mddev->sb_wait);
  2190. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  2191. sysfs_notify(&mddev->kobj, NULL, "sync_completed");
  2192. list_for_each_entry(rdev, &mddev->disks, same_set) {
  2193. if (test_and_clear_bit(FaultRecorded, &rdev->flags))
  2194. clear_bit(Blocked, &rdev->flags);
  2195. if (any_badblocks_changed)
  2196. md_ack_all_badblocks(&rdev->badblocks);
  2197. clear_bit(BlockedBadBlocks, &rdev->flags);
  2198. wake_up(&rdev->blocked_wait);
  2199. }
  2200. }
  2201. /* words written to sysfs files may, or may not, be \n terminated.
  2202. * We want to accept with case. For this we use cmd_match.
  2203. */
  2204. static int cmd_match(const char *cmd, const char *str)
  2205. {
  2206. /* See if cmd, written into a sysfs file, matches
  2207. * str. They must either be the same, or cmd can
  2208. * have a trailing newline
  2209. */
  2210. while (*cmd && *str && *cmd == *str) {
  2211. cmd++;
  2212. str++;
  2213. }
  2214. if (*cmd == '\n')
  2215. cmd++;
  2216. if (*str || *cmd)
  2217. return 0;
  2218. return 1;
  2219. }
  2220. struct rdev_sysfs_entry {
  2221. struct attribute attr;
  2222. ssize_t (*show)(struct md_rdev *, char *);
  2223. ssize_t (*store)(struct md_rdev *, const char *, size_t);
  2224. };
  2225. static ssize_t
  2226. state_show(struct md_rdev *rdev, char *page)
  2227. {
  2228. char *sep = "";
  2229. size_t len = 0;
  2230. if (test_bit(Faulty, &rdev->flags) ||
  2231. rdev->badblocks.unacked_exist) {
  2232. len+= sprintf(page+len, "%sfaulty",sep);
  2233. sep = ",";
  2234. }
  2235. if (test_bit(In_sync, &rdev->flags)) {
  2236. len += sprintf(page+len, "%sin_sync",sep);
  2237. sep = ",";
  2238. }
  2239. if (test_bit(WriteMostly, &rdev->flags)) {
  2240. len += sprintf(page+len, "%swrite_mostly",sep);
  2241. sep = ",";
  2242. }
  2243. if (test_bit(Blocked, &rdev->flags) ||
  2244. rdev->badblocks.unacked_exist) {
  2245. len += sprintf(page+len, "%sblocked", sep);
  2246. sep = ",";
  2247. }
  2248. if (!test_bit(Faulty, &rdev->flags) &&
  2249. !test_bit(In_sync, &rdev->flags)) {
  2250. len += sprintf(page+len, "%sspare", sep);
  2251. sep = ",";
  2252. }
  2253. if (test_bit(WriteErrorSeen, &rdev->flags)) {
  2254. len += sprintf(page+len, "%swrite_error", sep);
  2255. sep = ",";
  2256. }
  2257. return len+sprintf(page+len, "\n");
  2258. }
  2259. static ssize_t
  2260. state_store(struct md_rdev *rdev, const char *buf, size_t len)
  2261. {
  2262. /* can write
  2263. * faulty - simulates an error
  2264. * remove - disconnects the device
  2265. * writemostly - sets write_mostly
  2266. * -writemostly - clears write_mostly
  2267. * blocked - sets the Blocked flags
  2268. * -blocked - clears the Blocked and possibly simulates an error
  2269. * insync - sets Insync providing device isn't active
  2270. * write_error - sets WriteErrorSeen
  2271. * -write_error - clears WriteErrorSeen
  2272. */
  2273. int err = -EINVAL;
  2274. if (cmd_match(buf, "faulty") && rdev->mddev->pers) {
  2275. md_error(rdev->mddev, rdev);
  2276. if (test_bit(Faulty, &rdev->flags))
  2277. err = 0;
  2278. else
  2279. err = -EBUSY;
  2280. } else if (cmd_match(buf, "remove")) {
  2281. if (rdev->raid_disk >= 0)
  2282. err = -EBUSY;
  2283. else {
  2284. struct mddev *mddev = rdev->mddev;
  2285. kick_rdev_from_array(rdev);
  2286. if (mddev->pers)
  2287. md_update_sb(mddev, 1);
  2288. md_new_event(mddev);
  2289. err = 0;
  2290. }
  2291. } else if (cmd_match(buf, "writemostly")) {
  2292. set_bit(WriteMostly, &rdev->flags);
  2293. err = 0;
  2294. } else if (cmd_match(buf, "-writemostly")) {
  2295. clear_bit(WriteMostly, &rdev->flags);
  2296. err = 0;
  2297. } else if (cmd_match(buf, "blocked")) {
  2298. set_bit(Blocked, &rdev->flags);
  2299. err = 0;
  2300. } else if (cmd_match(buf, "-blocked")) {
  2301. if (!test_bit(Faulty, &rdev->flags) &&
  2302. rdev->badblocks.unacked_exist) {
  2303. /* metadata handler doesn't understand badblocks,
  2304. * so we need to fail the device
  2305. */
  2306. md_error(rdev->mddev, rdev);
  2307. }
  2308. clear_bit(Blocked, &rdev->flags);
  2309. clear_bit(BlockedBadBlocks, &rdev->flags);
  2310. wake_up(&rdev->blocked_wait);
  2311. set_bit(MD_RECOVERY_NEEDED, &rdev->mddev->recovery);
  2312. md_wakeup_thread(rdev->mddev->thread);
  2313. err = 0;
  2314. } else if (cmd_match(buf, "insync") && rdev->raid_disk == -1) {
  2315. set_bit(In_sync, &rdev->flags);
  2316. err = 0;
  2317. } else if (cmd_match(buf, "write_error")) {
  2318. set_bit(WriteErrorSeen, &rdev->flags);
  2319. err = 0;
  2320. } else if (cmd_match(buf, "-write_error")) {
  2321. clear_bit(WriteErrorSeen, &rdev->flags);
  2322. err = 0;
  2323. }
  2324. if (!err)
  2325. sysfs_notify_dirent_safe(rdev->sysfs_state);
  2326. return err ? err : len;
  2327. }
  2328. static struct rdev_sysfs_entry rdev_state =
  2329. __ATTR(state, S_IRUGO|S_IWUSR, state_show, state_store);
  2330. static ssize_t
  2331. errors_show(struct md_rdev *rdev, char *page)
  2332. {
  2333. return sprintf(page, "%d\n", atomic_read(&rdev->corrected_errors));
  2334. }
  2335. static ssize_t
  2336. errors_store(struct md_rdev *rdev, const char *buf, size_t len)
  2337. {
  2338. char *e;
  2339. unsigned long n = simple_strtoul(buf, &e, 10);
  2340. if (*buf && (*e == 0 || *e == '\n')) {
  2341. atomic_set(&rdev->corrected_errors, n);
  2342. return len;
  2343. }
  2344. return -EINVAL;
  2345. }
  2346. static struct rdev_sysfs_entry rdev_errors =
  2347. __ATTR(errors, S_IRUGO|S_IWUSR, errors_show, errors_store);
  2348. static ssize_t
  2349. slot_show(struct md_rdev *rdev, char *page)
  2350. {
  2351. if (rdev->raid_disk < 0)
  2352. return sprintf(page, "none\n");
  2353. else
  2354. return sprintf(page, "%d\n", rdev->raid_disk);
  2355. }
  2356. static ssize_t
  2357. slot_store(struct md_rdev *rdev, const char *buf, size_t len)
  2358. {
  2359. char *e;
  2360. int err;
  2361. int slot = simple_strtoul(buf, &e, 10);
  2362. if (strncmp(buf, "none", 4)==0)
  2363. slot = -1;
  2364. else if (e==buf || (*e && *e!= '\n'))
  2365. return -EINVAL;
  2366. if (rdev->mddev->pers && slot == -1) {
  2367. /* Setting 'slot' on an active array requires also
  2368. * updating the 'rd%d' link, and communicating
  2369. * with the personality with ->hot_*_disk.
  2370. * For now we only support removing
  2371. * failed/spare devices. This normally happens automatically,
  2372. * but not when the metadata is externally managed.
  2373. */
  2374. if (rdev->raid_disk == -1)
  2375. return -EEXIST;
  2376. /* personality does all needed checks */
  2377. if (rdev->mddev->pers->hot_remove_disk == NULL)
  2378. return -EINVAL;
  2379. err = rdev->mddev->pers->
  2380. hot_remove_disk(rdev->mddev, rdev->raid_disk);
  2381. if (err)
  2382. return err;
  2383. sysfs_unlink_rdev(rdev->mddev, rdev);
  2384. rdev->raid_disk = -1;
  2385. set_bit(MD_RECOVERY_NEEDED, &rdev->mddev->recovery);
  2386. md_wakeup_thread(rdev->mddev->thread);
  2387. } else if (rdev->mddev->pers) {
  2388. struct md_rdev *rdev2;
  2389. /* Activating a spare .. or possibly reactivating
  2390. * if we ever get bitmaps working here.
  2391. */
  2392. if (rdev->raid_disk != -1)
  2393. return -EBUSY;
  2394. if (test_bit(MD_RECOVERY_RUNNING, &rdev->mddev->recovery))
  2395. return -EBUSY;
  2396. if (rdev->mddev->pers->hot_add_disk == NULL)
  2397. return -EINVAL;
  2398. list_for_each_entry(rdev2, &rdev->mddev->disks, same_set)
  2399. if (rdev2->raid_disk == slot)
  2400. return -EEXIST;
  2401. if (slot >= rdev->mddev->raid_disks &&
  2402. slot >= rdev->mddev->raid_disks + rdev->mddev->delta_disks)
  2403. return -ENOSPC;
  2404. rdev->raid_disk = slot;
  2405. if (test_bit(In_sync, &rdev->flags))
  2406. rdev->saved_raid_disk = slot;
  2407. else
  2408. rdev->saved_raid_disk = -1;
  2409. clear_bit(In_sync, &rdev->flags);
  2410. err = rdev->mddev->pers->
  2411. hot_add_disk(rdev->mddev, rdev);
  2412. if (err) {
  2413. rdev->raid_disk = -1;
  2414. return err;
  2415. } else
  2416. sysfs_notify_dirent_safe(rdev->sysfs_state);
  2417. if (sysfs_link_rdev(rdev->mddev, rdev))
  2418. /* failure here is OK */;
  2419. /* don't wakeup anyone, leave that to userspace. */
  2420. } else {
  2421. if (slot >= rdev->mddev->raid_disks &&
  2422. slot >= rdev->mddev->raid_disks + rdev->mddev->delta_disks)
  2423. return -ENOSPC;
  2424. rdev->raid_disk = slot;
  2425. /* assume it is working */
  2426. clear_bit(Faulty, &rdev->flags);
  2427. clear_bit(WriteMostly, &rdev->flags);
  2428. set_bit(In_sync, &rdev->flags);
  2429. sysfs_notify_dirent_safe(rdev->sysfs_state);
  2430. }
  2431. return len;
  2432. }
  2433. static struct rdev_sysfs_entry rdev_slot =
  2434. __ATTR(slot, S_IRUGO|S_IWUSR, slot_show, slot_store);
  2435. static ssize_t
  2436. offset_show(struct md_rdev *rdev, char *page)
  2437. {
  2438. return sprintf(page, "%llu\n", (unsigned long long)rdev->data_offset);
  2439. }
  2440. static ssize_t
  2441. offset_store(struct md_rdev *rdev, const char *buf, size_t len)
  2442. {
  2443. char *e;
  2444. unsigned long long offset = simple_strtoull(buf, &e, 10);
  2445. if (e==buf || (*e && *e != '\n'))
  2446. return -EINVAL;
  2447. if (rdev->mddev->pers && rdev->raid_disk >= 0)
  2448. return -EBUSY;
  2449. if (rdev->sectors && rdev->mddev->external)
  2450. /* Must set offset before size, so overlap checks
  2451. * can be sane */
  2452. return -EBUSY;
  2453. rdev->data_offset = offset;
  2454. return len;
  2455. }
  2456. static struct rdev_sysfs_entry rdev_offset =
  2457. __ATTR(offset, S_IRUGO|S_IWUSR, offset_show, offset_store);
  2458. static ssize_t
  2459. rdev_size_show(struct md_rdev *rdev, char *page)
  2460. {
  2461. return sprintf(page, "%llu\n", (unsigned long long)rdev->sectors / 2);
  2462. }
  2463. static int overlaps(sector_t s1, sector_t l1, sector_t s2, sector_t l2)
  2464. {
  2465. /* check if two start/length pairs overlap */
  2466. if (s1+l1 <= s2)
  2467. return 0;
  2468. if (s2+l2 <= s1)
  2469. return 0;
  2470. return 1;
  2471. }
  2472. static int strict_blocks_to_sectors(const char *buf, sector_t *sectors)
  2473. {
  2474. unsigned long long blocks;
  2475. sector_t new;
  2476. if (strict_strtoull(buf, 10, &blocks) < 0)
  2477. return -EINVAL;
  2478. if (blocks & 1ULL << (8 * sizeof(blocks) - 1))
  2479. return -EINVAL; /* sector conversion overflow */
  2480. new = blocks * 2;
  2481. if (new != blocks * 2)
  2482. return -EINVAL; /* unsigned long long to sector_t overflow */
  2483. *sectors = new;
  2484. return 0;
  2485. }
  2486. static ssize_t
  2487. rdev_size_store(struct md_rdev *rdev, const char *buf, size_t len)
  2488. {
  2489. struct mddev *my_mddev = rdev->mddev;
  2490. sector_t oldsectors = rdev->sectors;
  2491. sector_t sectors;
  2492. if (strict_blocks_to_sectors(buf, &sectors) < 0)
  2493. return -EINVAL;
  2494. if (my_mddev->pers && rdev->raid_disk >= 0) {
  2495. if (my_mddev->persistent) {
  2496. sectors = super_types[my_mddev->major_version].
  2497. rdev_size_change(rdev, sectors);
  2498. if (!sectors)
  2499. return -EBUSY;
  2500. } else if (!sectors)
  2501. sectors = (i_size_read(rdev->bdev->bd_inode) >> 9) -
  2502. rdev->data_offset;
  2503. }
  2504. if (sectors < my_mddev->dev_sectors)
  2505. return -EINVAL; /* component must fit device */
  2506. rdev->sectors = sectors;
  2507. if (sectors > oldsectors && my_mddev->external) {
  2508. /* need to check that all other rdevs with the same ->bdev
  2509. * do not overlap. We need to unlock the mddev to avoid
  2510. * a deadlock. We have already changed rdev->sectors, and if
  2511. * we have to change it back, we will have the lock again.
  2512. */
  2513. struct mddev *mddev;
  2514. int overlap = 0;
  2515. struct list_head *tmp;
  2516. mddev_unlock(my_mddev);
  2517. for_each_mddev(mddev, tmp) {
  2518. struct md_rdev *rdev2;
  2519. mddev_lock(mddev);
  2520. list_for_each_entry(rdev2, &mddev->disks, same_set)
  2521. if (rdev->bdev == rdev2->bdev &&
  2522. rdev != rdev2 &&
  2523. overlaps(rdev->data_offset, rdev->sectors,
  2524. rdev2->data_offset,
  2525. rdev2->sectors)) {
  2526. overlap = 1;
  2527. break;
  2528. }
  2529. mddev_unlock(mddev);
  2530. if (overlap) {
  2531. mddev_put(mddev);
  2532. break;
  2533. }
  2534. }
  2535. mddev_lock(my_mddev);
  2536. if (overlap) {
  2537. /* Someone else could have slipped in a size
  2538. * change here, but doing so is just silly.
  2539. * We put oldsectors back because we *know* it is
  2540. * safe, and trust userspace not to race with
  2541. * itself
  2542. */
  2543. rdev->sectors = oldsectors;
  2544. return -EBUSY;
  2545. }
  2546. }
  2547. return len;
  2548. }
  2549. static struct rdev_sysfs_entry rdev_size =
  2550. __ATTR(size, S_IRUGO|S_IWUSR, rdev_size_show, rdev_size_store);
  2551. static ssize_t recovery_start_show(struct md_rdev *rdev, char *page)
  2552. {
  2553. unsigned long long recovery_start = rdev->recovery_offset;
  2554. if (test_bit(In_sync, &rdev->flags) ||
  2555. recovery_start == MaxSector)
  2556. return sprintf(page, "none\n");
  2557. return sprintf(page, "%llu\n", recovery_start);
  2558. }
  2559. static ssize_t recovery_start_store(struct md_rdev *rdev, const char *buf, size_t len)
  2560. {
  2561. unsigned long long recovery_start;
  2562. if (cmd_match(buf, "none"))
  2563. recovery_start = MaxSector;
  2564. else if (strict_strtoull(buf, 10, &recovery_start))
  2565. return -EINVAL;
  2566. if (rdev->mddev->pers &&
  2567. rdev->raid_disk >= 0)
  2568. return -EBUSY;
  2569. rdev->recovery_offset = recovery_start;
  2570. if (recovery_start == MaxSector)
  2571. set_bit(In_sync, &rdev->flags);
  2572. else
  2573. clear_bit(In_sync, &rdev->flags);
  2574. return len;
  2575. }
  2576. static struct rdev_sysfs_entry rdev_recovery_start =
  2577. __ATTR(recovery_start, S_IRUGO|S_IWUSR, recovery_start_show, recovery_start_store);
  2578. static ssize_t
  2579. badblocks_show(struct badblocks *bb, char *page, int unack);
  2580. static ssize_t
  2581. badblocks_store(struct badblocks *bb, const char *page, size_t len, int unack);
  2582. static ssize_t bb_show(struct md_rdev *rdev, char *page)
  2583. {
  2584. return badblocks_show(&rdev->badblocks, page, 0);
  2585. }
  2586. static ssize_t bb_store(struct md_rdev *rdev, const char *page, size_t len)
  2587. {
  2588. int rv = badblocks_store(&rdev->badblocks, page, len, 0);
  2589. /* Maybe that ack was all we needed */
  2590. if (test_and_clear_bit(BlockedBadBlocks, &rdev->flags))
  2591. wake_up(&rdev->blocked_wait);
  2592. return rv;
  2593. }
  2594. static struct rdev_sysfs_entry rdev_bad_blocks =
  2595. __ATTR(bad_blocks, S_IRUGO|S_IWUSR, bb_show, bb_store);
  2596. static ssize_t ubb_show(struct md_rdev *rdev, char *page)
  2597. {
  2598. return badblocks_show(&rdev->badblocks, page, 1);
  2599. }
  2600. static ssize_t ubb_store(struct md_rdev *rdev, const char *page, size_t len)
  2601. {
  2602. return badblocks_store(&rdev->badblocks, page, len, 1);
  2603. }
  2604. static struct rdev_sysfs_entry rdev_unack_bad_blocks =
  2605. __ATTR(unacknowledged_bad_blocks, S_IRUGO|S_IWUSR, ubb_show, ubb_store);
  2606. static struct attribute *rdev_default_attrs[] = {
  2607. &rdev_state.attr,
  2608. &rdev_errors.attr,
  2609. &rdev_slot.attr,
  2610. &rdev_offset.attr,
  2611. &rdev_size.attr,
  2612. &rdev_recovery_start.attr,
  2613. &rdev_bad_blocks.attr,
  2614. &rdev_unack_bad_blocks.attr,
  2615. NULL,
  2616. };
  2617. static ssize_t
  2618. rdev_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  2619. {
  2620. struct rdev_sysfs_entry *entry = container_of(attr, struct rdev_sysfs_entry, attr);
  2621. struct md_rdev *rdev = container_of(kobj, struct md_rdev, kobj);
  2622. struct mddev *mddev = rdev->mddev;
  2623. ssize_t rv;
  2624. if (!entry->show)
  2625. return -EIO;
  2626. rv = mddev ? mddev_lock(mddev) : -EBUSY;
  2627. if (!rv) {
  2628. if (rdev->mddev == NULL)
  2629. rv = -EBUSY;
  2630. else
  2631. rv = entry->show(rdev, page);
  2632. mddev_unlock(mddev);
  2633. }
  2634. return rv;
  2635. }
  2636. static ssize_t
  2637. rdev_attr_store(struct kobject *kobj, struct attribute *attr,
  2638. const char *page, size_t length)
  2639. {
  2640. struct rdev_sysfs_entry *entry = container_of(attr, struct rdev_sysfs_entry, attr);
  2641. struct md_rdev *rdev = container_of(kobj, struct md_rdev, kobj);
  2642. ssize_t rv;
  2643. struct mddev *mddev = rdev->mddev;
  2644. if (!entry->store)
  2645. return -EIO;
  2646. if (!capable(CAP_SYS_ADMIN))
  2647. return -EACCES;
  2648. rv = mddev ? mddev_lock(mddev): -EBUSY;
  2649. if (!rv) {
  2650. if (rdev->mddev == NULL)
  2651. rv = -EBUSY;
  2652. else
  2653. rv = entry->store(rdev, page, length);
  2654. mddev_unlock(mddev);
  2655. }
  2656. return rv;
  2657. }
  2658. static void rdev_free(struct kobject *ko)
  2659. {
  2660. struct md_rdev *rdev = container_of(ko, struct md_rdev, kobj);
  2661. kfree(rdev);
  2662. }
  2663. static const struct sysfs_ops rdev_sysfs_ops = {
  2664. .show = rdev_attr_show,
  2665. .store = rdev_attr_store,
  2666. };
  2667. static struct kobj_type rdev_ktype = {
  2668. .release = rdev_free,
  2669. .sysfs_ops = &rdev_sysfs_ops,
  2670. .default_attrs = rdev_default_attrs,
  2671. };
  2672. int md_rdev_init(struct md_rdev *rdev)
  2673. {
  2674. rdev->desc_nr = -1;
  2675. rdev->saved_raid_disk = -1;
  2676. rdev->raid_disk = -1;
  2677. rdev->flags = 0;
  2678. rdev->data_offset = 0;
  2679. rdev->sb_events = 0;
  2680. rdev->last_read_error.tv_sec = 0;
  2681. rdev->last_read_error.tv_nsec = 0;
  2682. rdev->sb_loaded = 0;
  2683. rdev->bb_page = NULL;
  2684. atomic_set(&rdev->nr_pending, 0);
  2685. atomic_set(&rdev->read_errors, 0);
  2686. atomic_set(&rdev->corrected_errors, 0);
  2687. INIT_LIST_HEAD(&rdev->same_set);
  2688. init_waitqueue_head(&rdev->blocked_wait);
  2689. /* Add space to store bad block list.
  2690. * This reserves the space even on arrays where it cannot
  2691. * be used - I wonder if that matters
  2692. */
  2693. rdev->badblocks.count = 0;
  2694. rdev->badblocks.shift = 0;
  2695. rdev->badblocks.page = kmalloc(PAGE_SIZE, GFP_KERNEL);
  2696. seqlock_init(&rdev->badblocks.lock);
  2697. if (rdev->badblocks.page == NULL)
  2698. return -ENOMEM;
  2699. return 0;
  2700. }
  2701. EXPORT_SYMBOL_GPL(md_rdev_init);
  2702. /*
  2703. * Import a device. If 'super_format' >= 0, then sanity check the superblock
  2704. *
  2705. * mark the device faulty if:
  2706. *
  2707. * - the device is nonexistent (zero size)
  2708. * - the device has no valid superblock
  2709. *
  2710. * a faulty rdev _never_ has rdev->sb set.
  2711. */
  2712. static struct md_rdev *md_import_device(dev_t newdev, int super_format, int super_minor)
  2713. {
  2714. char b[BDEVNAME_SIZE];
  2715. int err;
  2716. struct md_rdev *rdev;
  2717. sector_t size;
  2718. rdev = kzalloc(sizeof(*rdev), GFP_KERNEL);
  2719. if (!rdev) {
  2720. printk(KERN_ERR "md: could not alloc mem for new device!\n");
  2721. return ERR_PTR(-ENOMEM);
  2722. }
  2723. err = md_rdev_init(rdev);
  2724. if (err)
  2725. goto abort_free;
  2726. err = alloc_disk_sb(rdev);
  2727. if (err)
  2728. goto abort_free;
  2729. err = lock_rdev(rdev, newdev, super_format == -2);
  2730. if (err)
  2731. goto abort_free;
  2732. kobject_init(&rdev->kobj, &rdev_ktype);
  2733. size = i_size_read(rdev->bdev->bd_inode) >> BLOCK_SIZE_BITS;
  2734. if (!size) {
  2735. printk(KERN_WARNING
  2736. "md: %s has zero or unknown size, marking faulty!\n",
  2737. bdevname(rdev->bdev,b));
  2738. err = -EINVAL;
  2739. goto abort_free;
  2740. }
  2741. if (super_format >= 0) {
  2742. err = super_types[super_format].
  2743. load_super(rdev, NULL, super_minor);
  2744. if (err == -EINVAL) {
  2745. printk(KERN_WARNING
  2746. "md: %s does not have a valid v%d.%d "
  2747. "superblock, not importing!\n",
  2748. bdevname(rdev->bdev,b),
  2749. super_format, super_minor);
  2750. goto abort_free;
  2751. }
  2752. if (err < 0) {
  2753. printk(KERN_WARNING
  2754. "md: could not read %s's sb, not importing!\n",
  2755. bdevname(rdev->bdev,b));
  2756. goto abort_free;
  2757. }
  2758. }
  2759. if (super_format == -1)
  2760. /* hot-add for 0.90, or non-persistent: so no badblocks */
  2761. rdev->badblocks.shift = -1;
  2762. return rdev;
  2763. abort_free:
  2764. if (rdev->bdev)
  2765. unlock_rdev(rdev);
  2766. free_disk_sb(rdev);
  2767. kfree(rdev->badblocks.page);
  2768. kfree(rdev);
  2769. return ERR_PTR(err);
  2770. }
  2771. /*
  2772. * Check a full RAID array for plausibility
  2773. */
  2774. static void analyze_sbs(struct mddev * mddev)
  2775. {
  2776. int i;
  2777. struct md_rdev *rdev, *freshest, *tmp;
  2778. char b[BDEVNAME_SIZE];
  2779. freshest = NULL;
  2780. rdev_for_each(rdev, tmp, mddev)
  2781. switch (super_types[mddev->major_version].
  2782. load_super(rdev, freshest, mddev->minor_version)) {
  2783. case 1:
  2784. freshest = rdev;
  2785. break;
  2786. case 0:
  2787. break;
  2788. default:
  2789. printk( KERN_ERR \
  2790. "md: fatal superblock inconsistency in %s"
  2791. " -- removing from array\n",
  2792. bdevname(rdev->bdev,b));
  2793. kick_rdev_from_array(rdev);
  2794. }
  2795. super_types[mddev->major_version].
  2796. validate_super(mddev, freshest);
  2797. i = 0;
  2798. rdev_for_each(rdev, tmp, mddev) {
  2799. if (mddev->max_disks &&
  2800. (rdev->desc_nr >= mddev->max_disks ||
  2801. i > mddev->max_disks)) {
  2802. printk(KERN_WARNING
  2803. "md: %s: %s: only %d devices permitted\n",
  2804. mdname(mddev), bdevname(rdev->bdev, b),
  2805. mddev->max_disks);
  2806. kick_rdev_from_array(rdev);
  2807. continue;
  2808. }
  2809. if (rdev != freshest)
  2810. if (super_types[mddev->major_version].
  2811. validate_super(mddev, rdev)) {
  2812. printk(KERN_WARNING "md: kicking non-fresh %s"
  2813. " from array!\n",
  2814. bdevname(rdev->bdev,b));
  2815. kick_rdev_from_array(rdev);
  2816. continue;
  2817. }
  2818. if (mddev->level == LEVEL_MULTIPATH) {
  2819. rdev->desc_nr = i++;
  2820. rdev->raid_disk = rdev->desc_nr;
  2821. set_bit(In_sync, &rdev->flags);
  2822. } else if (rdev->raid_disk >= (mddev->raid_disks - min(0, mddev->delta_disks))) {
  2823. rdev->raid_disk = -1;
  2824. clear_bit(In_sync, &rdev->flags);
  2825. }
  2826. }
  2827. }
  2828. /* Read a fixed-point number.
  2829. * Numbers in sysfs attributes should be in "standard" units where
  2830. * possible, so time should be in seconds.
  2831. * However we internally use a a much smaller unit such as
  2832. * milliseconds or jiffies.
  2833. * This function takes a decimal number with a possible fractional
  2834. * component, and produces an integer which is the result of
  2835. * multiplying that number by 10^'scale'.
  2836. * all without any floating-point arithmetic.
  2837. */
  2838. int strict_strtoul_scaled(const char *cp, unsigned long *res, int scale)
  2839. {
  2840. unsigned long result = 0;
  2841. long decimals = -1;
  2842. while (isdigit(*cp) || (*cp == '.' && decimals < 0)) {
  2843. if (*cp == '.')
  2844. decimals = 0;
  2845. else if (decimals < scale) {
  2846. unsigned int value;
  2847. value = *cp - '0';
  2848. result = result * 10 + value;
  2849. if (decimals >= 0)
  2850. decimals++;
  2851. }
  2852. cp++;
  2853. }
  2854. if (*cp == '\n')
  2855. cp++;
  2856. if (*cp)
  2857. return -EINVAL;
  2858. if (decimals < 0)
  2859. decimals = 0;
  2860. while (decimals < scale) {
  2861. result *= 10;
  2862. decimals ++;
  2863. }
  2864. *res = result;
  2865. return 0;
  2866. }
  2867. static void md_safemode_timeout(unsigned long data);
  2868. static ssize_t
  2869. safe_delay_show(struct mddev *mddev, char *page)
  2870. {
  2871. int msec = (mddev->safemode_delay*1000)/HZ;
  2872. return sprintf(page, "%d.%03d\n", msec/1000, msec%1000);
  2873. }
  2874. static ssize_t
  2875. safe_delay_store(struct mddev *mddev, const char *cbuf, size_t len)
  2876. {
  2877. unsigned long msec;
  2878. if (strict_strtoul_scaled(cbuf, &msec, 3) < 0)
  2879. return -EINVAL;
  2880. if (msec == 0)
  2881. mddev->safemode_delay = 0;
  2882. else {
  2883. unsigned long old_delay = mddev->safemode_delay;
  2884. mddev->safemode_delay = (msec*HZ)/1000;
  2885. if (mddev->safemode_delay == 0)
  2886. mddev->safemode_delay = 1;
  2887. if (mddev->safemode_delay < old_delay)
  2888. md_safemode_timeout((unsigned long)mddev);
  2889. }
  2890. return len;
  2891. }
  2892. static struct md_sysfs_entry md_safe_delay =
  2893. __ATTR(safe_mode_delay, S_IRUGO|S_IWUSR,safe_delay_show, safe_delay_store);
  2894. static ssize_t
  2895. level_show(struct mddev *mddev, char *page)
  2896. {
  2897. struct md_personality *p = mddev->pers;
  2898. if (p)
  2899. return sprintf(page, "%s\n", p->name);
  2900. else if (mddev->clevel[0])
  2901. return sprintf(page, "%s\n", mddev->clevel);
  2902. else if (mddev->level != LEVEL_NONE)
  2903. return sprintf(page, "%d\n", mddev->level);
  2904. else
  2905. return 0;
  2906. }
  2907. static ssize_t
  2908. level_store(struct mddev *mddev, const char *buf, size_t len)
  2909. {
  2910. char clevel[16];
  2911. ssize_t rv = len;
  2912. struct md_personality *pers;
  2913. long level;
  2914. void *priv;
  2915. struct md_rdev *rdev;
  2916. if (mddev->pers == NULL) {
  2917. if (len == 0)
  2918. return 0;
  2919. if (len >= sizeof(mddev->clevel))
  2920. return -ENOSPC;
  2921. strncpy(mddev->clevel, buf, len);
  2922. if (mddev->clevel[len-1] == '\n')
  2923. len--;
  2924. mddev->clevel[len] = 0;
  2925. mddev->level = LEVEL_NONE;
  2926. return rv;
  2927. }
  2928. /* request to change the personality. Need to ensure:
  2929. * - array is not engaged in resync/recovery/reshape
  2930. * - old personality can be suspended
  2931. * - new personality will access other array.
  2932. */
  2933. if (mddev->sync_thread ||
  2934. mddev->reshape_position != MaxSector ||
  2935. mddev->sysfs_active)
  2936. return -EBUSY;
  2937. if (!mddev->pers->quiesce) {
  2938. printk(KERN_WARNING "md: %s: %s does not support online personality change\n",
  2939. mdname(mddev), mddev->pers->name);
  2940. return -EINVAL;
  2941. }
  2942. /* Now find the new personality */
  2943. if (len == 0 || len >= sizeof(clevel))
  2944. return -EINVAL;
  2945. strncpy(clevel, buf, len);
  2946. if (clevel[len-1] == '\n')
  2947. len--;
  2948. clevel[len] = 0;
  2949. if (strict_strtol(clevel, 10, &level))
  2950. level = LEVEL_NONE;
  2951. if (request_module("md-%s", clevel) != 0)
  2952. request_module("md-level-%s", clevel);
  2953. spin_lock(&pers_lock);
  2954. pers = find_pers(level, clevel);
  2955. if (!pers || !try_module_get(pers->owner)) {
  2956. spin_unlock(&pers_lock);
  2957. printk(KERN_WARNING "md: personality %s not loaded\n", clevel);
  2958. return -EINVAL;
  2959. }
  2960. spin_unlock(&pers_lock);
  2961. if (pers == mddev->pers) {
  2962. /* Nothing to do! */
  2963. module_put(pers->owner);
  2964. return rv;
  2965. }
  2966. if (!pers->takeover) {
  2967. module_put(pers->owner);
  2968. printk(KERN_WARNING "md: %s: %s does not support personality takeover\n",
  2969. mdname(mddev), clevel);
  2970. return -EINVAL;
  2971. }
  2972. list_for_each_entry(rdev, &mddev->disks, same_set)
  2973. rdev->new_raid_disk = rdev->raid_disk;
  2974. /* ->takeover must set new_* and/or delta_disks
  2975. * if it succeeds, and may set them when it fails.
  2976. */
  2977. priv = pers->takeover(mddev);
  2978. if (IS_ERR(priv)) {
  2979. mddev->new_level = mddev->level;
  2980. mddev->new_layout = mddev->layout;
  2981. mddev->new_chunk_sectors = mddev->chunk_sectors;
  2982. mddev->raid_disks -= mddev->delta_disks;
  2983. mddev->delta_disks = 0;
  2984. module_put(pers->owner);
  2985. printk(KERN_WARNING "md: %s: %s would not accept array\n",
  2986. mdname(mddev), clevel);
  2987. return PTR_ERR(priv);
  2988. }
  2989. /* Looks like we have a winner */
  2990. mddev_suspend(mddev);
  2991. mddev->pers->stop(mddev);
  2992. if (mddev->pers->sync_request == NULL &&
  2993. pers->sync_request != NULL) {
  2994. /* need to add the md_redundancy_group */
  2995. if (sysfs_create_group(&mddev->kobj, &md_redundancy_group))
  2996. printk(KERN_WARNING
  2997. "md: cannot register extra attributes for %s\n",
  2998. mdname(mddev));
  2999. mddev->sysfs_action = sysfs_get_dirent(mddev->kobj.sd, NULL, "sync_action");
  3000. }
  3001. if (mddev->pers->sync_request != NULL &&
  3002. pers->sync_request == NULL) {
  3003. /* need to remove the md_redundancy_group */
  3004. if (mddev->to_remove == NULL)
  3005. mddev->to_remove = &md_redundancy_group;
  3006. }
  3007. if (mddev->pers->sync_request == NULL &&
  3008. mddev->external) {
  3009. /* We are converting from a no-redundancy array
  3010. * to a redundancy array and metadata is managed
  3011. * externally so we need to be sure that writes
  3012. * won't block due to a need to transition
  3013. * clean->dirty
  3014. * until external management is started.
  3015. */
  3016. mddev->in_sync = 0;
  3017. mddev->safemode_delay = 0;
  3018. mddev->safemode = 0;
  3019. }
  3020. list_for_each_entry(rdev, &mddev->disks, same_set) {
  3021. if (rdev->raid_disk < 0)
  3022. continue;
  3023. if (rdev->new_raid_disk >= mddev->raid_disks)
  3024. rdev->new_raid_disk = -1;
  3025. if (rdev->new_raid_disk == rdev->raid_disk)
  3026. continue;
  3027. sysfs_unlink_rdev(mddev, rdev);
  3028. }
  3029. list_for_each_entry(rdev, &mddev->disks, same_set) {
  3030. if (rdev->raid_disk < 0)
  3031. continue;
  3032. if (rdev->new_raid_disk == rdev->raid_disk)
  3033. continue;
  3034. rdev->raid_disk = rdev->new_raid_disk;
  3035. if (rdev->raid_disk < 0)
  3036. clear_bit(In_sync, &rdev->flags);
  3037. else {
  3038. if (sysfs_link_rdev(mddev, rdev))
  3039. printk(KERN_WARNING "md: cannot register rd%d"
  3040. " for %s after level change\n",
  3041. rdev->raid_disk, mdname(mddev));
  3042. }
  3043. }
  3044. module_put(mddev->pers->owner);
  3045. mddev->pers = pers;
  3046. mddev->private = priv;
  3047. strlcpy(mddev->clevel, pers->name, sizeof(mddev->clevel));
  3048. mddev->level = mddev->new_level;
  3049. mddev->layout = mddev->new_layout;
  3050. mddev->chunk_sectors = mddev->new_chunk_sectors;
  3051. mddev->delta_disks = 0;
  3052. mddev->degraded = 0;
  3053. if (mddev->pers->sync_request == NULL) {
  3054. /* this is now an array without redundancy, so
  3055. * it must always be in_sync
  3056. */
  3057. mddev->in_sync = 1;
  3058. del_timer_sync(&mddev->safemode_timer);
  3059. }
  3060. pers->run(mddev);
  3061. mddev_resume(mddev);
  3062. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  3063. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3064. md_wakeup_thread(mddev->thread);
  3065. sysfs_notify(&mddev->kobj, NULL, "level");
  3066. md_new_event(mddev);
  3067. return rv;
  3068. }
  3069. static struct md_sysfs_entry md_level =
  3070. __ATTR(level, S_IRUGO|S_IWUSR, level_show, level_store);
  3071. static ssize_t
  3072. layout_show(struct mddev *mddev, char *page)
  3073. {
  3074. /* just a number, not meaningful for all levels */
  3075. if (mddev->reshape_position != MaxSector &&
  3076. mddev->layout != mddev->new_layout)
  3077. return sprintf(page, "%d (%d)\n",
  3078. mddev->new_layout, mddev->layout);
  3079. return sprintf(page, "%d\n", mddev->layout);
  3080. }
  3081. static ssize_t
  3082. layout_store(struct mddev *mddev, const char *buf, size_t len)
  3083. {
  3084. char *e;
  3085. unsigned long n = simple_strtoul(buf, &e, 10);
  3086. if (!*buf || (*e && *e != '\n'))
  3087. return -EINVAL;
  3088. if (mddev->pers) {
  3089. int err;
  3090. if (mddev->pers->check_reshape == NULL)
  3091. return -EBUSY;
  3092. mddev->new_layout = n;
  3093. err = mddev->pers->check_reshape(mddev);
  3094. if (err) {
  3095. mddev->new_layout = mddev->layout;
  3096. return err;
  3097. }
  3098. } else {
  3099. mddev->new_layout = n;
  3100. if (mddev->reshape_position == MaxSector)
  3101. mddev->layout = n;
  3102. }
  3103. return len;
  3104. }
  3105. static struct md_sysfs_entry md_layout =
  3106. __ATTR(layout, S_IRUGO|S_IWUSR, layout_show, layout_store);
  3107. static ssize_t
  3108. raid_disks_show(struct mddev *mddev, char *page)
  3109. {
  3110. if (mddev->raid_disks == 0)
  3111. return 0;
  3112. if (mddev->reshape_position != MaxSector &&
  3113. mddev->delta_disks != 0)
  3114. return sprintf(page, "%d (%d)\n", mddev->raid_disks,
  3115. mddev->raid_disks - mddev->delta_disks);
  3116. return sprintf(page, "%d\n", mddev->raid_disks);
  3117. }
  3118. static int update_raid_disks(struct mddev *mddev, int raid_disks);
  3119. static ssize_t
  3120. raid_disks_store(struct mddev *mddev, const char *buf, size_t len)
  3121. {
  3122. char *e;
  3123. int rv = 0;
  3124. unsigned long n = simple_strtoul(buf, &e, 10);
  3125. if (!*buf || (*e && *e != '\n'))
  3126. return -EINVAL;
  3127. if (mddev->pers)
  3128. rv = update_raid_disks(mddev, n);
  3129. else if (mddev->reshape_position != MaxSector) {
  3130. int olddisks = mddev->raid_disks - mddev->delta_disks;
  3131. mddev->delta_disks = n - olddisks;
  3132. mddev->raid_disks = n;
  3133. } else
  3134. mddev->raid_disks = n;
  3135. return rv ? rv : len;
  3136. }
  3137. static struct md_sysfs_entry md_raid_disks =
  3138. __ATTR(raid_disks, S_IRUGO|S_IWUSR, raid_disks_show, raid_disks_store);
  3139. static ssize_t
  3140. chunk_size_show(struct mddev *mddev, char *page)
  3141. {
  3142. if (mddev->reshape_position != MaxSector &&
  3143. mddev->chunk_sectors != mddev->new_chunk_sectors)
  3144. return sprintf(page, "%d (%d)\n",
  3145. mddev->new_chunk_sectors << 9,
  3146. mddev->chunk_sectors << 9);
  3147. return sprintf(page, "%d\n", mddev->chunk_sectors << 9);
  3148. }
  3149. static ssize_t
  3150. chunk_size_store(struct mddev *mddev, const char *buf, size_t len)
  3151. {
  3152. char *e;
  3153. unsigned long n = simple_strtoul(buf, &e, 10);
  3154. if (!*buf || (*e && *e != '\n'))
  3155. return -EINVAL;
  3156. if (mddev->pers) {
  3157. int err;
  3158. if (mddev->pers->check_reshape == NULL)
  3159. return -EBUSY;
  3160. mddev->new_chunk_sectors = n >> 9;
  3161. err = mddev->pers->check_reshape(mddev);
  3162. if (err) {
  3163. mddev->new_chunk_sectors = mddev->chunk_sectors;
  3164. return err;
  3165. }
  3166. } else {
  3167. mddev->new_chunk_sectors = n >> 9;
  3168. if (mddev->reshape_position == MaxSector)
  3169. mddev->chunk_sectors = n >> 9;
  3170. }
  3171. return len;
  3172. }
  3173. static struct md_sysfs_entry md_chunk_size =
  3174. __ATTR(chunk_size, S_IRUGO|S_IWUSR, chunk_size_show, chunk_size_store);
  3175. static ssize_t
  3176. resync_start_show(struct mddev *mddev, char *page)
  3177. {
  3178. if (mddev->recovery_cp == MaxSector)
  3179. return sprintf(page, "none\n");
  3180. return sprintf(page, "%llu\n", (unsigned long long)mddev->recovery_cp);
  3181. }
  3182. static ssize_t
  3183. resync_start_store(struct mddev *mddev, const char *buf, size_t len)
  3184. {
  3185. char *e;
  3186. unsigned long long n = simple_strtoull(buf, &e, 10);
  3187. if (mddev->pers && !test_bit(MD_RECOVERY_FROZEN, &mddev->recovery))
  3188. return -EBUSY;
  3189. if (cmd_match(buf, "none"))
  3190. n = MaxSector;
  3191. else if (!*buf || (*e && *e != '\n'))
  3192. return -EINVAL;
  3193. mddev->recovery_cp = n;
  3194. return len;
  3195. }
  3196. static struct md_sysfs_entry md_resync_start =
  3197. __ATTR(resync_start, S_IRUGO|S_IWUSR, resync_start_show, resync_start_store);
  3198. /*
  3199. * The array state can be:
  3200. *
  3201. * clear
  3202. * No devices, no size, no level
  3203. * Equivalent to STOP_ARRAY ioctl
  3204. * inactive
  3205. * May have some settings, but array is not active
  3206. * all IO results in error
  3207. * When written, doesn't tear down array, but just stops it
  3208. * suspended (not supported yet)
  3209. * All IO requests will block. The array can be reconfigured.
  3210. * Writing this, if accepted, will block until array is quiescent
  3211. * readonly
  3212. * no resync can happen. no superblocks get written.
  3213. * write requests fail
  3214. * read-auto
  3215. * like readonly, but behaves like 'clean' on a write request.
  3216. *
  3217. * clean - no pending writes, but otherwise active.
  3218. * When written to inactive array, starts without resync
  3219. * If a write request arrives then
  3220. * if metadata is known, mark 'dirty' and switch to 'active'.
  3221. * if not known, block and switch to write-pending
  3222. * If written to an active array that has pending writes, then fails.
  3223. * active
  3224. * fully active: IO and resync can be happening.
  3225. * When written to inactive array, starts with resync
  3226. *
  3227. * write-pending
  3228. * clean, but writes are blocked waiting for 'active' to be written.
  3229. *
  3230. * active-idle
  3231. * like active, but no writes have been seen for a while (100msec).
  3232. *
  3233. */
  3234. enum array_state { clear, inactive, suspended, readonly, read_auto, clean, active,
  3235. write_pending, active_idle, bad_word};
  3236. static char *array_states[] = {
  3237. "clear", "inactive", "suspended", "readonly", "read-auto", "clean", "active",
  3238. "write-pending", "active-idle", NULL };
  3239. static int match_word(const char *word, char **list)
  3240. {
  3241. int n;
  3242. for (n=0; list[n]; n++)
  3243. if (cmd_match(word, list[n]))
  3244. break;
  3245. return n;
  3246. }
  3247. static ssize_t
  3248. array_state_show(struct mddev *mddev, char *page)
  3249. {
  3250. enum array_state st = inactive;
  3251. if (mddev->pers)
  3252. switch(mddev->ro) {
  3253. case 1:
  3254. st = readonly;
  3255. break;
  3256. case 2:
  3257. st = read_auto;
  3258. break;
  3259. case 0:
  3260. if (mddev->in_sync)
  3261. st = clean;
  3262. else if (test_bit(MD_CHANGE_PENDING, &mddev->flags))
  3263. st = write_pending;
  3264. else if (mddev->safemode)
  3265. st = active_idle;
  3266. else
  3267. st = active;
  3268. }
  3269. else {
  3270. if (list_empty(&mddev->disks) &&
  3271. mddev->raid_disks == 0 &&
  3272. mddev->dev_sectors == 0)
  3273. st = clear;
  3274. else
  3275. st = inactive;
  3276. }
  3277. return sprintf(page, "%s\n", array_states[st]);
  3278. }
  3279. static int do_md_stop(struct mddev * mddev, int ro, int is_open);
  3280. static int md_set_readonly(struct mddev * mddev, int is_open);
  3281. static int do_md_run(struct mddev * mddev);
  3282. static int restart_array(struct mddev *mddev);
  3283. static ssize_t
  3284. array_state_store(struct mddev *mddev, const char *buf, size_t len)
  3285. {
  3286. int err = -EINVAL;
  3287. enum array_state st = match_word(buf, array_states);
  3288. switch(st) {
  3289. case bad_word:
  3290. break;
  3291. case clear:
  3292. /* stopping an active array */
  3293. if (atomic_read(&mddev->openers) > 0)
  3294. return -EBUSY;
  3295. err = do_md_stop(mddev, 0, 0);
  3296. break;
  3297. case inactive:
  3298. /* stopping an active array */
  3299. if (mddev->pers) {
  3300. if (atomic_read(&mddev->openers) > 0)
  3301. return -EBUSY;
  3302. err = do_md_stop(mddev, 2, 0);
  3303. } else
  3304. err = 0; /* already inactive */
  3305. break;
  3306. case suspended:
  3307. break; /* not supported yet */
  3308. case readonly:
  3309. if (mddev->pers)
  3310. err = md_set_readonly(mddev, 0);
  3311. else {
  3312. mddev->ro = 1;
  3313. set_disk_ro(mddev->gendisk, 1);
  3314. err = do_md_run(mddev);
  3315. }
  3316. break;
  3317. case read_auto:
  3318. if (mddev->pers) {
  3319. if (mddev->ro == 0)
  3320. err = md_set_readonly(mddev, 0);
  3321. else if (mddev->ro == 1)
  3322. err = restart_array(mddev);
  3323. if (err == 0) {
  3324. mddev->ro = 2;
  3325. set_disk_ro(mddev->gendisk, 0);
  3326. }
  3327. } else {
  3328. mddev->ro = 2;
  3329. err = do_md_run(mddev);
  3330. }
  3331. break;
  3332. case clean:
  3333. if (mddev->pers) {
  3334. restart_array(mddev);
  3335. spin_lock_irq(&mddev->write_lock);
  3336. if (atomic_read(&mddev->writes_pending) == 0) {
  3337. if (mddev->in_sync == 0) {
  3338. mddev->in_sync = 1;
  3339. if (mddev->safemode == 1)
  3340. mddev->safemode = 0;
  3341. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  3342. }
  3343. err = 0;
  3344. } else
  3345. err = -EBUSY;
  3346. spin_unlock_irq(&mddev->write_lock);
  3347. } else
  3348. err = -EINVAL;
  3349. break;
  3350. case active:
  3351. if (mddev->pers) {
  3352. restart_array(mddev);
  3353. clear_bit(MD_CHANGE_PENDING, &mddev->flags);
  3354. wake_up(&mddev->sb_wait);
  3355. err = 0;
  3356. } else {
  3357. mddev->ro = 0;
  3358. set_disk_ro(mddev->gendisk, 0);
  3359. err = do_md_run(mddev);
  3360. }
  3361. break;
  3362. case write_pending:
  3363. case active_idle:
  3364. /* these cannot be set */
  3365. break;
  3366. }
  3367. if (err)
  3368. return err;
  3369. else {
  3370. sysfs_notify_dirent_safe(mddev->sysfs_state);
  3371. return len;
  3372. }
  3373. }
  3374. static struct md_sysfs_entry md_array_state =
  3375. __ATTR(array_state, S_IRUGO|S_IWUSR, array_state_show, array_state_store);
  3376. static ssize_t
  3377. max_corrected_read_errors_show(struct mddev *mddev, char *page) {
  3378. return sprintf(page, "%d\n",
  3379. atomic_read(&mddev->max_corr_read_errors));
  3380. }
  3381. static ssize_t
  3382. max_corrected_read_errors_store(struct mddev *mddev, const char *buf, size_t len)
  3383. {
  3384. char *e;
  3385. unsigned long n = simple_strtoul(buf, &e, 10);
  3386. if (*buf && (*e == 0 || *e == '\n')) {
  3387. atomic_set(&mddev->max_corr_read_errors, n);
  3388. return len;
  3389. }
  3390. return -EINVAL;
  3391. }
  3392. static struct md_sysfs_entry max_corr_read_errors =
  3393. __ATTR(max_read_errors, S_IRUGO|S_IWUSR, max_corrected_read_errors_show,
  3394. max_corrected_read_errors_store);
  3395. static ssize_t
  3396. null_show(struct mddev *mddev, char *page)
  3397. {
  3398. return -EINVAL;
  3399. }
  3400. static ssize_t
  3401. new_dev_store(struct mddev *mddev, const char *buf, size_t len)
  3402. {
  3403. /* buf must be %d:%d\n? giving major and minor numbers */
  3404. /* The new device is added to the array.
  3405. * If the array has a persistent superblock, we read the
  3406. * superblock to initialise info and check validity.
  3407. * Otherwise, only checking done is that in bind_rdev_to_array,
  3408. * which mainly checks size.
  3409. */
  3410. char *e;
  3411. int major = simple_strtoul(buf, &e, 10);
  3412. int minor;
  3413. dev_t dev;
  3414. struct md_rdev *rdev;
  3415. int err;
  3416. if (!*buf || *e != ':' || !e[1] || e[1] == '\n')
  3417. return -EINVAL;
  3418. minor = simple_strtoul(e+1, &e, 10);
  3419. if (*e && *e != '\n')
  3420. return -EINVAL;
  3421. dev = MKDEV(major, minor);
  3422. if (major != MAJOR(dev) ||
  3423. minor != MINOR(dev))
  3424. return -EOVERFLOW;
  3425. if (mddev->persistent) {
  3426. rdev = md_import_device(dev, mddev->major_version,
  3427. mddev->minor_version);
  3428. if (!IS_ERR(rdev) && !list_empty(&mddev->disks)) {
  3429. struct md_rdev *rdev0
  3430. = list_entry(mddev->disks.next,
  3431. struct md_rdev, same_set);
  3432. err = super_types[mddev->major_version]
  3433. .load_super(rdev, rdev0, mddev->minor_version);
  3434. if (err < 0)
  3435. goto out;
  3436. }
  3437. } else if (mddev->external)
  3438. rdev = md_import_device(dev, -2, -1);
  3439. else
  3440. rdev = md_import_device(dev, -1, -1);
  3441. if (IS_ERR(rdev))
  3442. return PTR_ERR(rdev);
  3443. err = bind_rdev_to_array(rdev, mddev);
  3444. out:
  3445. if (err)
  3446. export_rdev(rdev);
  3447. return err ? err : len;
  3448. }
  3449. static struct md_sysfs_entry md_new_device =
  3450. __ATTR(new_dev, S_IWUSR, null_show, new_dev_store);
  3451. static ssize_t
  3452. bitmap_store(struct mddev *mddev, const char *buf, size_t len)
  3453. {
  3454. char *end;
  3455. unsigned long chunk, end_chunk;
  3456. if (!mddev->bitmap)
  3457. goto out;
  3458. /* buf should be <chunk> <chunk> ... or <chunk>-<chunk> ... (range) */
  3459. while (*buf) {
  3460. chunk = end_chunk = simple_strtoul(buf, &end, 0);
  3461. if (buf == end) break;
  3462. if (*end == '-') { /* range */
  3463. buf = end + 1;
  3464. end_chunk = simple_strtoul(buf, &end, 0);
  3465. if (buf == end) break;
  3466. }
  3467. if (*end && !isspace(*end)) break;
  3468. bitmap_dirty_bits(mddev->bitmap, chunk, end_chunk);
  3469. buf = skip_spaces(end);
  3470. }
  3471. bitmap_unplug(mddev->bitmap); /* flush the bits to disk */
  3472. out:
  3473. return len;
  3474. }
  3475. static struct md_sysfs_entry md_bitmap =
  3476. __ATTR(bitmap_set_bits, S_IWUSR, null_show, bitmap_store);
  3477. static ssize_t
  3478. size_show(struct mddev *mddev, char *page)
  3479. {
  3480. return sprintf(page, "%llu\n",
  3481. (unsigned long long)mddev->dev_sectors / 2);
  3482. }
  3483. static int update_size(struct mddev *mddev, sector_t num_sectors);
  3484. static ssize_t
  3485. size_store(struct mddev *mddev, const char *buf, size_t len)
  3486. {
  3487. /* If array is inactive, we can reduce the component size, but
  3488. * not increase it (except from 0).
  3489. * If array is active, we can try an on-line resize
  3490. */
  3491. sector_t sectors;
  3492. int err = strict_blocks_to_sectors(buf, &sectors);
  3493. if (err < 0)
  3494. return err;
  3495. if (mddev->pers) {
  3496. err = update_size(mddev, sectors);
  3497. md_update_sb(mddev, 1);
  3498. } else {
  3499. if (mddev->dev_sectors == 0 ||
  3500. mddev->dev_sectors > sectors)
  3501. mddev->dev_sectors = sectors;
  3502. else
  3503. err = -ENOSPC;
  3504. }
  3505. return err ? err : len;
  3506. }
  3507. static struct md_sysfs_entry md_size =
  3508. __ATTR(component_size, S_IRUGO|S_IWUSR, size_show, size_store);
  3509. /* Metdata version.
  3510. * This is one of
  3511. * 'none' for arrays with no metadata (good luck...)
  3512. * 'external' for arrays with externally managed metadata,
  3513. * or N.M for internally known formats
  3514. */
  3515. static ssize_t
  3516. metadata_show(struct mddev *mddev, char *page)
  3517. {
  3518. if (mddev->persistent)
  3519. return sprintf(page, "%d.%d\n",
  3520. mddev->major_version, mddev->minor_version);
  3521. else if (mddev->external)
  3522. return sprintf(page, "external:%s\n", mddev->metadata_type);
  3523. else
  3524. return sprintf(page, "none\n");
  3525. }
  3526. static ssize_t
  3527. metadata_store(struct mddev *mddev, const char *buf, size_t len)
  3528. {
  3529. int major, minor;
  3530. char *e;
  3531. /* Changing the details of 'external' metadata is
  3532. * always permitted. Otherwise there must be
  3533. * no devices attached to the array.
  3534. */
  3535. if (mddev->external && strncmp(buf, "external:", 9) == 0)
  3536. ;
  3537. else if (!list_empty(&mddev->disks))
  3538. return -EBUSY;
  3539. if (cmd_match(buf, "none")) {
  3540. mddev->persistent = 0;
  3541. mddev->external = 0;
  3542. mddev->major_version = 0;
  3543. mddev->minor_version = 90;
  3544. return len;
  3545. }
  3546. if (strncmp(buf, "external:", 9) == 0) {
  3547. size_t namelen = len-9;
  3548. if (namelen >= sizeof(mddev->metadata_type))
  3549. namelen = sizeof(mddev->metadata_type)-1;
  3550. strncpy(mddev->metadata_type, buf+9, namelen);
  3551. mddev->metadata_type[namelen] = 0;
  3552. if (namelen && mddev->metadata_type[namelen-1] == '\n')
  3553. mddev->metadata_type[--namelen] = 0;
  3554. mddev->persistent = 0;
  3555. mddev->external = 1;
  3556. mddev->major_version = 0;
  3557. mddev->minor_version = 90;
  3558. return len;
  3559. }
  3560. major = simple_strtoul(buf, &e, 10);
  3561. if (e==buf || *e != '.')
  3562. return -EINVAL;
  3563. buf = e+1;
  3564. minor = simple_strtoul(buf, &e, 10);
  3565. if (e==buf || (*e && *e != '\n') )
  3566. return -EINVAL;
  3567. if (major >= ARRAY_SIZE(super_types) || super_types[major].name == NULL)
  3568. return -ENOENT;
  3569. mddev->major_version = major;
  3570. mddev->minor_version = minor;
  3571. mddev->persistent = 1;
  3572. mddev->external = 0;
  3573. return len;
  3574. }
  3575. static struct md_sysfs_entry md_metadata =
  3576. __ATTR(metadata_version, S_IRUGO|S_IWUSR, metadata_show, metadata_store);
  3577. static ssize_t
  3578. action_show(struct mddev *mddev, char *page)
  3579. {
  3580. char *type = "idle";
  3581. if (test_bit(MD_RECOVERY_FROZEN, &mddev->recovery))
  3582. type = "frozen";
  3583. else if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) ||
  3584. (!mddev->ro && test_bit(MD_RECOVERY_NEEDED, &mddev->recovery))) {
  3585. if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  3586. type = "reshape";
  3587. else if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  3588. if (!test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  3589. type = "resync";
  3590. else if (test_bit(MD_RECOVERY_CHECK, &mddev->recovery))
  3591. type = "check";
  3592. else
  3593. type = "repair";
  3594. } else if (test_bit(MD_RECOVERY_RECOVER, &mddev->recovery))
  3595. type = "recover";
  3596. }
  3597. return sprintf(page, "%s\n", type);
  3598. }
  3599. static void reap_sync_thread(struct mddev *mddev);
  3600. static ssize_t
  3601. action_store(struct mddev *mddev, const char *page, size_t len)
  3602. {
  3603. if (!mddev->pers || !mddev->pers->sync_request)
  3604. return -EINVAL;
  3605. if (cmd_match(page, "frozen"))
  3606. set_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  3607. else
  3608. clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  3609. if (cmd_match(page, "idle") || cmd_match(page, "frozen")) {
  3610. if (mddev->sync_thread) {
  3611. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  3612. reap_sync_thread(mddev);
  3613. }
  3614. } else if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) ||
  3615. test_bit(MD_RECOVERY_NEEDED, &mddev->recovery))
  3616. return -EBUSY;
  3617. else if (cmd_match(page, "resync"))
  3618. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3619. else if (cmd_match(page, "recover")) {
  3620. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  3621. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3622. } else if (cmd_match(page, "reshape")) {
  3623. int err;
  3624. if (mddev->pers->start_reshape == NULL)
  3625. return -EINVAL;
  3626. err = mddev->pers->start_reshape(mddev);
  3627. if (err)
  3628. return err;
  3629. sysfs_notify(&mddev->kobj, NULL, "degraded");
  3630. } else {
  3631. if (cmd_match(page, "check"))
  3632. set_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  3633. else if (!cmd_match(page, "repair"))
  3634. return -EINVAL;
  3635. set_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  3636. set_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  3637. }
  3638. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3639. md_wakeup_thread(mddev->thread);
  3640. sysfs_notify_dirent_safe(mddev->sysfs_action);
  3641. return len;
  3642. }
  3643. static ssize_t
  3644. mismatch_cnt_show(struct mddev *mddev, char *page)
  3645. {
  3646. return sprintf(page, "%llu\n",
  3647. (unsigned long long) mddev->resync_mismatches);
  3648. }
  3649. static struct md_sysfs_entry md_scan_mode =
  3650. __ATTR(sync_action, S_IRUGO|S_IWUSR, action_show, action_store);
  3651. static struct md_sysfs_entry md_mismatches = __ATTR_RO(mismatch_cnt);
  3652. static ssize_t
  3653. sync_min_show(struct mddev *mddev, char *page)
  3654. {
  3655. return sprintf(page, "%d (%s)\n", speed_min(mddev),
  3656. mddev->sync_speed_min ? "local": "system");
  3657. }
  3658. static ssize_t
  3659. sync_min_store(struct mddev *mddev, const char *buf, size_t len)
  3660. {
  3661. int min;
  3662. char *e;
  3663. if (strncmp(buf, "system", 6)==0) {
  3664. mddev->sync_speed_min = 0;
  3665. return len;
  3666. }
  3667. min = simple_strtoul(buf, &e, 10);
  3668. if (buf == e || (*e && *e != '\n') || min <= 0)
  3669. return -EINVAL;
  3670. mddev->sync_speed_min = min;
  3671. return len;
  3672. }
  3673. static struct md_sysfs_entry md_sync_min =
  3674. __ATTR(sync_speed_min, S_IRUGO|S_IWUSR, sync_min_show, sync_min_store);
  3675. static ssize_t
  3676. sync_max_show(struct mddev *mddev, char *page)
  3677. {
  3678. return sprintf(page, "%d (%s)\n", speed_max(mddev),
  3679. mddev->sync_speed_max ? "local": "system");
  3680. }
  3681. static ssize_t
  3682. sync_max_store(struct mddev *mddev, const char *buf, size_t len)
  3683. {
  3684. int max;
  3685. char *e;
  3686. if (strncmp(buf, "system", 6)==0) {
  3687. mddev->sync_speed_max = 0;
  3688. return len;
  3689. }
  3690. max = simple_strtoul(buf, &e, 10);
  3691. if (buf == e || (*e && *e != '\n') || max <= 0)
  3692. return -EINVAL;
  3693. mddev->sync_speed_max = max;
  3694. return len;
  3695. }
  3696. static struct md_sysfs_entry md_sync_max =
  3697. __ATTR(sync_speed_max, S_IRUGO|S_IWUSR, sync_max_show, sync_max_store);
  3698. static ssize_t
  3699. degraded_show(struct mddev *mddev, char *page)
  3700. {
  3701. return sprintf(page, "%d\n", mddev->degraded);
  3702. }
  3703. static struct md_sysfs_entry md_degraded = __ATTR_RO(degraded);
  3704. static ssize_t
  3705. sync_force_parallel_show(struct mddev *mddev, char *page)
  3706. {
  3707. return sprintf(page, "%d\n", mddev->parallel_resync);
  3708. }
  3709. static ssize_t
  3710. sync_force_parallel_store(struct mddev *mddev, const char *buf, size_t len)
  3711. {
  3712. long n;
  3713. if (strict_strtol(buf, 10, &n))
  3714. return -EINVAL;
  3715. if (n != 0 && n != 1)
  3716. return -EINVAL;
  3717. mddev->parallel_resync = n;
  3718. if (mddev->sync_thread)
  3719. wake_up(&resync_wait);
  3720. return len;
  3721. }
  3722. /* force parallel resync, even with shared block devices */
  3723. static struct md_sysfs_entry md_sync_force_parallel =
  3724. __ATTR(sync_force_parallel, S_IRUGO|S_IWUSR,
  3725. sync_force_parallel_show, sync_force_parallel_store);
  3726. static ssize_t
  3727. sync_speed_show(struct mddev *mddev, char *page)
  3728. {
  3729. unsigned long resync, dt, db;
  3730. if (mddev->curr_resync == 0)
  3731. return sprintf(page, "none\n");
  3732. resync = mddev->curr_mark_cnt - atomic_read(&mddev->recovery_active);
  3733. dt = (jiffies - mddev->resync_mark) / HZ;
  3734. if (!dt) dt++;
  3735. db = resync - mddev->resync_mark_cnt;
  3736. return sprintf(page, "%lu\n", db/dt/2); /* K/sec */
  3737. }
  3738. static struct md_sysfs_entry md_sync_speed = __ATTR_RO(sync_speed);
  3739. static ssize_t
  3740. sync_completed_show(struct mddev *mddev, char *page)
  3741. {
  3742. unsigned long long max_sectors, resync;
  3743. if (!test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3744. return sprintf(page, "none\n");
  3745. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  3746. max_sectors = mddev->resync_max_sectors;
  3747. else
  3748. max_sectors = mddev->dev_sectors;
  3749. resync = mddev->curr_resync_completed;
  3750. return sprintf(page, "%llu / %llu\n", resync, max_sectors);
  3751. }
  3752. static struct md_sysfs_entry md_sync_completed = __ATTR_RO(sync_completed);
  3753. static ssize_t
  3754. min_sync_show(struct mddev *mddev, char *page)
  3755. {
  3756. return sprintf(page, "%llu\n",
  3757. (unsigned long long)mddev->resync_min);
  3758. }
  3759. static ssize_t
  3760. min_sync_store(struct mddev *mddev, const char *buf, size_t len)
  3761. {
  3762. unsigned long long min;
  3763. if (strict_strtoull(buf, 10, &min))
  3764. return -EINVAL;
  3765. if (min > mddev->resync_max)
  3766. return -EINVAL;
  3767. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3768. return -EBUSY;
  3769. /* Must be a multiple of chunk_size */
  3770. if (mddev->chunk_sectors) {
  3771. sector_t temp = min;
  3772. if (sector_div(temp, mddev->chunk_sectors))
  3773. return -EINVAL;
  3774. }
  3775. mddev->resync_min = min;
  3776. return len;
  3777. }
  3778. static struct md_sysfs_entry md_min_sync =
  3779. __ATTR(sync_min, S_IRUGO|S_IWUSR, min_sync_show, min_sync_store);
  3780. static ssize_t
  3781. max_sync_show(struct mddev *mddev, char *page)
  3782. {
  3783. if (mddev->resync_max == MaxSector)
  3784. return sprintf(page, "max\n");
  3785. else
  3786. return sprintf(page, "%llu\n",
  3787. (unsigned long long)mddev->resync_max);
  3788. }
  3789. static ssize_t
  3790. max_sync_store(struct mddev *mddev, const char *buf, size_t len)
  3791. {
  3792. if (strncmp(buf, "max", 3) == 0)
  3793. mddev->resync_max = MaxSector;
  3794. else {
  3795. unsigned long long max;
  3796. if (strict_strtoull(buf, 10, &max))
  3797. return -EINVAL;
  3798. if (max < mddev->resync_min)
  3799. return -EINVAL;
  3800. if (max < mddev->resync_max &&
  3801. mddev->ro == 0 &&
  3802. test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3803. return -EBUSY;
  3804. /* Must be a multiple of chunk_size */
  3805. if (mddev->chunk_sectors) {
  3806. sector_t temp = max;
  3807. if (sector_div(temp, mddev->chunk_sectors))
  3808. return -EINVAL;
  3809. }
  3810. mddev->resync_max = max;
  3811. }
  3812. wake_up(&mddev->recovery_wait);
  3813. return len;
  3814. }
  3815. static struct md_sysfs_entry md_max_sync =
  3816. __ATTR(sync_max, S_IRUGO|S_IWUSR, max_sync_show, max_sync_store);
  3817. static ssize_t
  3818. suspend_lo_show(struct mddev *mddev, char *page)
  3819. {
  3820. return sprintf(page, "%llu\n", (unsigned long long)mddev->suspend_lo);
  3821. }
  3822. static ssize_t
  3823. suspend_lo_store(struct mddev *mddev, const char *buf, size_t len)
  3824. {
  3825. char *e;
  3826. unsigned long long new = simple_strtoull(buf, &e, 10);
  3827. unsigned long long old = mddev->suspend_lo;
  3828. if (mddev->pers == NULL ||
  3829. mddev->pers->quiesce == NULL)
  3830. return -EINVAL;
  3831. if (buf == e || (*e && *e != '\n'))
  3832. return -EINVAL;
  3833. mddev->suspend_lo = new;
  3834. if (new >= old)
  3835. /* Shrinking suspended region */
  3836. mddev->pers->quiesce(mddev, 2);
  3837. else {
  3838. /* Expanding suspended region - need to wait */
  3839. mddev->pers->quiesce(mddev, 1);
  3840. mddev->pers->quiesce(mddev, 0);
  3841. }
  3842. return len;
  3843. }
  3844. static struct md_sysfs_entry md_suspend_lo =
  3845. __ATTR(suspend_lo, S_IRUGO|S_IWUSR, suspend_lo_show, suspend_lo_store);
  3846. static ssize_t
  3847. suspend_hi_show(struct mddev *mddev, char *page)
  3848. {
  3849. return sprintf(page, "%llu\n", (unsigned long long)mddev->suspend_hi);
  3850. }
  3851. static ssize_t
  3852. suspend_hi_store(struct mddev *mddev, const char *buf, size_t len)
  3853. {
  3854. char *e;
  3855. unsigned long long new = simple_strtoull(buf, &e, 10);
  3856. unsigned long long old = mddev->suspend_hi;
  3857. if (mddev->pers == NULL ||
  3858. mddev->pers->quiesce == NULL)
  3859. return -EINVAL;
  3860. if (buf == e || (*e && *e != '\n'))
  3861. return -EINVAL;
  3862. mddev->suspend_hi = new;
  3863. if (new <= old)
  3864. /* Shrinking suspended region */
  3865. mddev->pers->quiesce(mddev, 2);
  3866. else {
  3867. /* Expanding suspended region - need to wait */
  3868. mddev->pers->quiesce(mddev, 1);
  3869. mddev->pers->quiesce(mddev, 0);
  3870. }
  3871. return len;
  3872. }
  3873. static struct md_sysfs_entry md_suspend_hi =
  3874. __ATTR(suspend_hi, S_IRUGO|S_IWUSR, suspend_hi_show, suspend_hi_store);
  3875. static ssize_t
  3876. reshape_position_show(struct mddev *mddev, char *page)
  3877. {
  3878. if (mddev->reshape_position != MaxSector)
  3879. return sprintf(page, "%llu\n",
  3880. (unsigned long long)mddev->reshape_position);
  3881. strcpy(page, "none\n");
  3882. return 5;
  3883. }
  3884. static ssize_t
  3885. reshape_position_store(struct mddev *mddev, const char *buf, size_t len)
  3886. {
  3887. char *e;
  3888. unsigned long long new = simple_strtoull(buf, &e, 10);
  3889. if (mddev->pers)
  3890. return -EBUSY;
  3891. if (buf == e || (*e && *e != '\n'))
  3892. return -EINVAL;
  3893. mddev->reshape_position = new;
  3894. mddev->delta_disks = 0;
  3895. mddev->new_level = mddev->level;
  3896. mddev->new_layout = mddev->layout;
  3897. mddev->new_chunk_sectors = mddev->chunk_sectors;
  3898. return len;
  3899. }
  3900. static struct md_sysfs_entry md_reshape_position =
  3901. __ATTR(reshape_position, S_IRUGO|S_IWUSR, reshape_position_show,
  3902. reshape_position_store);
  3903. static ssize_t
  3904. array_size_show(struct mddev *mddev, char *page)
  3905. {
  3906. if (mddev->external_size)
  3907. return sprintf(page, "%llu\n",
  3908. (unsigned long long)mddev->array_sectors/2);
  3909. else
  3910. return sprintf(page, "default\n");
  3911. }
  3912. static ssize_t
  3913. array_size_store(struct mddev *mddev, const char *buf, size_t len)
  3914. {
  3915. sector_t sectors;
  3916. if (strncmp(buf, "default", 7) == 0) {
  3917. if (mddev->pers)
  3918. sectors = mddev->pers->size(mddev, 0, 0);
  3919. else
  3920. sectors = mddev->array_sectors;
  3921. mddev->external_size = 0;
  3922. } else {
  3923. if (strict_blocks_to_sectors(buf, &sectors) < 0)
  3924. return -EINVAL;
  3925. if (mddev->pers && mddev->pers->size(mddev, 0, 0) < sectors)
  3926. return -E2BIG;
  3927. mddev->external_size = 1;
  3928. }
  3929. mddev->array_sectors = sectors;
  3930. if (mddev->pers) {
  3931. set_capacity(mddev->gendisk, mddev->array_sectors);
  3932. revalidate_disk(mddev->gendisk);
  3933. }
  3934. return len;
  3935. }
  3936. static struct md_sysfs_entry md_array_size =
  3937. __ATTR(array_size, S_IRUGO|S_IWUSR, array_size_show,
  3938. array_size_store);
  3939. static struct attribute *md_default_attrs[] = {
  3940. &md_level.attr,
  3941. &md_layout.attr,
  3942. &md_raid_disks.attr,
  3943. &md_chunk_size.attr,
  3944. &md_size.attr,
  3945. &md_resync_start.attr,
  3946. &md_metadata.attr,
  3947. &md_new_device.attr,
  3948. &md_safe_delay.attr,
  3949. &md_array_state.attr,
  3950. &md_reshape_position.attr,
  3951. &md_array_size.attr,
  3952. &max_corr_read_errors.attr,
  3953. NULL,
  3954. };
  3955. static struct attribute *md_redundancy_attrs[] = {
  3956. &md_scan_mode.attr,
  3957. &md_mismatches.attr,
  3958. &md_sync_min.attr,
  3959. &md_sync_max.attr,
  3960. &md_sync_speed.attr,
  3961. &md_sync_force_parallel.attr,
  3962. &md_sync_completed.attr,
  3963. &md_min_sync.attr,
  3964. &md_max_sync.attr,
  3965. &md_suspend_lo.attr,
  3966. &md_suspend_hi.attr,
  3967. &md_bitmap.attr,
  3968. &md_degraded.attr,
  3969. NULL,
  3970. };
  3971. static struct attribute_group md_redundancy_group = {
  3972. .name = NULL,
  3973. .attrs = md_redundancy_attrs,
  3974. };
  3975. static ssize_t
  3976. md_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  3977. {
  3978. struct md_sysfs_entry *entry = container_of(attr, struct md_sysfs_entry, attr);
  3979. struct mddev *mddev = container_of(kobj, struct mddev, kobj);
  3980. ssize_t rv;
  3981. if (!entry->show)
  3982. return -EIO;
  3983. rv = mddev_lock(mddev);
  3984. if (!rv) {
  3985. rv = entry->show(mddev, page);
  3986. mddev_unlock(mddev);
  3987. }
  3988. return rv;
  3989. }
  3990. static ssize_t
  3991. md_attr_store(struct kobject *kobj, struct attribute *attr,
  3992. const char *page, size_t length)
  3993. {
  3994. struct md_sysfs_entry *entry = container_of(attr, struct md_sysfs_entry, attr);
  3995. struct mddev *mddev = container_of(kobj, struct mddev, kobj);
  3996. ssize_t rv;
  3997. if (!entry->store)
  3998. return -EIO;
  3999. if (!capable(CAP_SYS_ADMIN))
  4000. return -EACCES;
  4001. rv = mddev_lock(mddev);
  4002. if (mddev->hold_active == UNTIL_IOCTL)
  4003. mddev->hold_active = 0;
  4004. if (!rv) {
  4005. rv = entry->store(mddev, page, length);
  4006. mddev_unlock(mddev);
  4007. }
  4008. return rv;
  4009. }
  4010. static void md_free(struct kobject *ko)
  4011. {
  4012. struct mddev *mddev = container_of(ko, struct mddev, kobj);
  4013. if (mddev->sysfs_state)
  4014. sysfs_put(mddev->sysfs_state);
  4015. if (mddev->gendisk) {
  4016. del_gendisk(mddev->gendisk);
  4017. put_disk(mddev->gendisk);
  4018. }
  4019. if (mddev->queue)
  4020. blk_cleanup_queue(mddev->queue);
  4021. kfree(mddev);
  4022. }
  4023. static const struct sysfs_ops md_sysfs_ops = {
  4024. .show = md_attr_show,
  4025. .store = md_attr_store,
  4026. };
  4027. static struct kobj_type md_ktype = {
  4028. .release = md_free,
  4029. .sysfs_ops = &md_sysfs_ops,
  4030. .default_attrs = md_default_attrs,
  4031. };
  4032. int mdp_major = 0;
  4033. static void mddev_delayed_delete(struct work_struct *ws)
  4034. {
  4035. struct mddev *mddev = container_of(ws, struct mddev, del_work);
  4036. sysfs_remove_group(&mddev->kobj, &md_bitmap_group);
  4037. kobject_del(&mddev->kobj);
  4038. kobject_put(&mddev->kobj);
  4039. }
  4040. static int md_alloc(dev_t dev, char *name)
  4041. {
  4042. static DEFINE_MUTEX(disks_mutex);
  4043. struct mddev *mddev = mddev_find(dev);
  4044. struct gendisk *disk;
  4045. int partitioned;
  4046. int shift;
  4047. int unit;
  4048. int error;
  4049. if (!mddev)
  4050. return -ENODEV;
  4051. partitioned = (MAJOR(mddev->unit) != MD_MAJOR);
  4052. shift = partitioned ? MdpMinorShift : 0;
  4053. unit = MINOR(mddev->unit) >> shift;
  4054. /* wait for any previous instance of this device to be
  4055. * completely removed (mddev_delayed_delete).
  4056. */
  4057. flush_workqueue(md_misc_wq);
  4058. mutex_lock(&disks_mutex);
  4059. error = -EEXIST;
  4060. if (mddev->gendisk)
  4061. goto abort;
  4062. if (name) {
  4063. /* Need to ensure that 'name' is not a duplicate.
  4064. */
  4065. struct mddev *mddev2;
  4066. spin_lock(&all_mddevs_lock);
  4067. list_for_each_entry(mddev2, &all_mddevs, all_mddevs)
  4068. if (mddev2->gendisk &&
  4069. strcmp(mddev2->gendisk->disk_name, name) == 0) {
  4070. spin_unlock(&all_mddevs_lock);
  4071. goto abort;
  4072. }
  4073. spin_unlock(&all_mddevs_lock);
  4074. }
  4075. error = -ENOMEM;
  4076. mddev->queue = blk_alloc_queue(GFP_KERNEL);
  4077. if (!mddev->queue)
  4078. goto abort;
  4079. mddev->queue->queuedata = mddev;
  4080. blk_queue_make_request(mddev->queue, md_make_request);
  4081. disk = alloc_disk(1 << shift);
  4082. if (!disk) {
  4083. blk_cleanup_queue(mddev->queue);
  4084. mddev->queue = NULL;
  4085. goto abort;
  4086. }
  4087. disk->major = MAJOR(mddev->unit);
  4088. disk->first_minor = unit << shift;
  4089. if (name)
  4090. strcpy(disk->disk_name, name);
  4091. else if (partitioned)
  4092. sprintf(disk->disk_name, "md_d%d", unit);
  4093. else
  4094. sprintf(disk->disk_name, "md%d", unit);
  4095. disk->fops = &md_fops;
  4096. disk->private_data = mddev;
  4097. disk->queue = mddev->queue;
  4098. blk_queue_flush(mddev->queue, REQ_FLUSH | REQ_FUA);
  4099. /* Allow extended partitions. This makes the
  4100. * 'mdp' device redundant, but we can't really
  4101. * remove it now.
  4102. */
  4103. disk->flags |= GENHD_FL_EXT_DEVT;
  4104. mddev->gendisk = disk;
  4105. /* As soon as we call add_disk(), another thread could get
  4106. * through to md_open, so make sure it doesn't get too far
  4107. */
  4108. mutex_lock(&mddev->open_mutex);
  4109. add_disk(disk);
  4110. error = kobject_init_and_add(&mddev->kobj, &md_ktype,
  4111. &disk_to_dev(disk)->kobj, "%s", "md");
  4112. if (error) {
  4113. /* This isn't possible, but as kobject_init_and_add is marked
  4114. * __must_check, we must do something with the result
  4115. */
  4116. printk(KERN_WARNING "md: cannot register %s/md - name in use\n",
  4117. disk->disk_name);
  4118. error = 0;
  4119. }
  4120. if (mddev->kobj.sd &&
  4121. sysfs_create_group(&mddev->kobj, &md_bitmap_group))
  4122. printk(KERN_DEBUG "pointless warning\n");
  4123. mutex_unlock(&mddev->open_mutex);
  4124. abort:
  4125. mutex_unlock(&disks_mutex);
  4126. if (!error && mddev->kobj.sd) {
  4127. kobject_uevent(&mddev->kobj, KOBJ_ADD);
  4128. mddev->sysfs_state = sysfs_get_dirent_safe(mddev->kobj.sd, "array_state");
  4129. }
  4130. mddev_put(mddev);
  4131. return error;
  4132. }
  4133. static struct kobject *md_probe(dev_t dev, int *part, void *data)
  4134. {
  4135. md_alloc(dev, NULL);
  4136. return NULL;
  4137. }
  4138. static int add_named_array(const char *val, struct kernel_param *kp)
  4139. {
  4140. /* val must be "md_*" where * is not all digits.
  4141. * We allocate an array with a large free minor number, and
  4142. * set the name to val. val must not already be an active name.
  4143. */
  4144. int len = strlen(val);
  4145. char buf[DISK_NAME_LEN];
  4146. while (len && val[len-1] == '\n')
  4147. len--;
  4148. if (len >= DISK_NAME_LEN)
  4149. return -E2BIG;
  4150. strlcpy(buf, val, len+1);
  4151. if (strncmp(buf, "md_", 3) != 0)
  4152. return -EINVAL;
  4153. return md_alloc(0, buf);
  4154. }
  4155. static void md_safemode_timeout(unsigned long data)
  4156. {
  4157. struct mddev *mddev = (struct mddev *) data;
  4158. if (!atomic_read(&mddev->writes_pending)) {
  4159. mddev->safemode = 1;
  4160. if (mddev->external)
  4161. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4162. }
  4163. md_wakeup_thread(mddev->thread);
  4164. }
  4165. static int start_dirty_degraded;
  4166. int md_run(struct mddev *mddev)
  4167. {
  4168. int err;
  4169. struct md_rdev *rdev;
  4170. struct md_personality *pers;
  4171. if (list_empty(&mddev->disks))
  4172. /* cannot run an array with no devices.. */
  4173. return -EINVAL;
  4174. if (mddev->pers)
  4175. return -EBUSY;
  4176. /* Cannot run until previous stop completes properly */
  4177. if (mddev->sysfs_active)
  4178. return -EBUSY;
  4179. /*
  4180. * Analyze all RAID superblock(s)
  4181. */
  4182. if (!mddev->raid_disks) {
  4183. if (!mddev->persistent)
  4184. return -EINVAL;
  4185. analyze_sbs(mddev);
  4186. }
  4187. if (mddev->level != LEVEL_NONE)
  4188. request_module("md-level-%d", mddev->level);
  4189. else if (mddev->clevel[0])
  4190. request_module("md-%s", mddev->clevel);
  4191. /*
  4192. * Drop all container device buffers, from now on
  4193. * the only valid external interface is through the md
  4194. * device.
  4195. */
  4196. list_for_each_entry(rdev, &mddev->disks, same_set) {
  4197. if (test_bit(Faulty, &rdev->flags))
  4198. continue;
  4199. sync_blockdev(rdev->bdev);
  4200. invalidate_bdev(rdev->bdev);
  4201. /* perform some consistency tests on the device.
  4202. * We don't want the data to overlap the metadata,
  4203. * Internal Bitmap issues have been handled elsewhere.
  4204. */
  4205. if (rdev->meta_bdev) {
  4206. /* Nothing to check */;
  4207. } else if (rdev->data_offset < rdev->sb_start) {
  4208. if (mddev->dev_sectors &&
  4209. rdev->data_offset + mddev->dev_sectors
  4210. > rdev->sb_start) {
  4211. printk("md: %s: data overlaps metadata\n",
  4212. mdname(mddev));
  4213. return -EINVAL;
  4214. }
  4215. } else {
  4216. if (rdev->sb_start + rdev->sb_size/512
  4217. > rdev->data_offset) {
  4218. printk("md: %s: metadata overlaps data\n",
  4219. mdname(mddev));
  4220. return -EINVAL;
  4221. }
  4222. }
  4223. sysfs_notify_dirent_safe(rdev->sysfs_state);
  4224. }
  4225. if (mddev->bio_set == NULL)
  4226. mddev->bio_set = bioset_create(BIO_POOL_SIZE,
  4227. sizeof(struct mddev *));
  4228. spin_lock(&pers_lock);
  4229. pers = find_pers(mddev->level, mddev->clevel);
  4230. if (!pers || !try_module_get(pers->owner)) {
  4231. spin_unlock(&pers_lock);
  4232. if (mddev->level != LEVEL_NONE)
  4233. printk(KERN_WARNING "md: personality for level %d is not loaded!\n",
  4234. mddev->level);
  4235. else
  4236. printk(KERN_WARNING "md: personality for level %s is not loaded!\n",
  4237. mddev->clevel);
  4238. return -EINVAL;
  4239. }
  4240. mddev->pers = pers;
  4241. spin_unlock(&pers_lock);
  4242. if (mddev->level != pers->level) {
  4243. mddev->level = pers->level;
  4244. mddev->new_level = pers->level;
  4245. }
  4246. strlcpy(mddev->clevel, pers->name, sizeof(mddev->clevel));
  4247. if (mddev->reshape_position != MaxSector &&
  4248. pers->start_reshape == NULL) {
  4249. /* This personality cannot handle reshaping... */
  4250. mddev->pers = NULL;
  4251. module_put(pers->owner);
  4252. return -EINVAL;
  4253. }
  4254. if (pers->sync_request) {
  4255. /* Warn if this is a potentially silly
  4256. * configuration.
  4257. */
  4258. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  4259. struct md_rdev *rdev2;
  4260. int warned = 0;
  4261. list_for_each_entry(rdev, &mddev->disks, same_set)
  4262. list_for_each_entry(rdev2, &mddev->disks, same_set) {
  4263. if (rdev < rdev2 &&
  4264. rdev->bdev->bd_contains ==
  4265. rdev2->bdev->bd_contains) {
  4266. printk(KERN_WARNING
  4267. "%s: WARNING: %s appears to be"
  4268. " on the same physical disk as"
  4269. " %s.\n",
  4270. mdname(mddev),
  4271. bdevname(rdev->bdev,b),
  4272. bdevname(rdev2->bdev,b2));
  4273. warned = 1;
  4274. }
  4275. }
  4276. if (warned)
  4277. printk(KERN_WARNING
  4278. "True protection against single-disk"
  4279. " failure might be compromised.\n");
  4280. }
  4281. mddev->recovery = 0;
  4282. /* may be over-ridden by personality */
  4283. mddev->resync_max_sectors = mddev->dev_sectors;
  4284. mddev->ok_start_degraded = start_dirty_degraded;
  4285. if (start_readonly && mddev->ro == 0)
  4286. mddev->ro = 2; /* read-only, but switch on first write */
  4287. err = mddev->pers->run(mddev);
  4288. if (err)
  4289. printk(KERN_ERR "md: pers->run() failed ...\n");
  4290. else if (mddev->pers->size(mddev, 0, 0) < mddev->array_sectors) {
  4291. WARN_ONCE(!mddev->external_size, "%s: default size too small,"
  4292. " but 'external_size' not in effect?\n", __func__);
  4293. printk(KERN_ERR
  4294. "md: invalid array_size %llu > default size %llu\n",
  4295. (unsigned long long)mddev->array_sectors / 2,
  4296. (unsigned long long)mddev->pers->size(mddev, 0, 0) / 2);
  4297. err = -EINVAL;
  4298. mddev->pers->stop(mddev);
  4299. }
  4300. if (err == 0 && mddev->pers->sync_request) {
  4301. err = bitmap_create(mddev);
  4302. if (err) {
  4303. printk(KERN_ERR "%s: failed to create bitmap (%d)\n",
  4304. mdname(mddev), err);
  4305. mddev->pers->stop(mddev);
  4306. }
  4307. }
  4308. if (err) {
  4309. module_put(mddev->pers->owner);
  4310. mddev->pers = NULL;
  4311. bitmap_destroy(mddev);
  4312. return err;
  4313. }
  4314. if (mddev->pers->sync_request) {
  4315. if (mddev->kobj.sd &&
  4316. sysfs_create_group(&mddev->kobj, &md_redundancy_group))
  4317. printk(KERN_WARNING
  4318. "md: cannot register extra attributes for %s\n",
  4319. mdname(mddev));
  4320. mddev->sysfs_action = sysfs_get_dirent_safe(mddev->kobj.sd, "sync_action");
  4321. } else if (mddev->ro == 2) /* auto-readonly not meaningful */
  4322. mddev->ro = 0;
  4323. atomic_set(&mddev->writes_pending,0);
  4324. atomic_set(&mddev->max_corr_read_errors,
  4325. MD_DEFAULT_MAX_CORRECTED_READ_ERRORS);
  4326. mddev->safemode = 0;
  4327. mddev->safemode_timer.function = md_safemode_timeout;
  4328. mddev->safemode_timer.data = (unsigned long) mddev;
  4329. mddev->safemode_delay = (200 * HZ)/1000 +1; /* 200 msec delay */
  4330. mddev->in_sync = 1;
  4331. smp_wmb();
  4332. mddev->ready = 1;
  4333. list_for_each_entry(rdev, &mddev->disks, same_set)
  4334. if (rdev->raid_disk >= 0)
  4335. if (sysfs_link_rdev(mddev, rdev))
  4336. /* failure here is OK */;
  4337. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  4338. if (mddev->flags)
  4339. md_update_sb(mddev, 0);
  4340. md_new_event(mddev);
  4341. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4342. sysfs_notify_dirent_safe(mddev->sysfs_action);
  4343. sysfs_notify(&mddev->kobj, NULL, "degraded");
  4344. return 0;
  4345. }
  4346. EXPORT_SYMBOL_GPL(md_run);
  4347. static int do_md_run(struct mddev *mddev)
  4348. {
  4349. int err;
  4350. err = md_run(mddev);
  4351. if (err)
  4352. goto out;
  4353. err = bitmap_load(mddev);
  4354. if (err) {
  4355. bitmap_destroy(mddev);
  4356. goto out;
  4357. }
  4358. md_wakeup_thread(mddev->thread);
  4359. md_wakeup_thread(mddev->sync_thread); /* possibly kick off a reshape */
  4360. set_capacity(mddev->gendisk, mddev->array_sectors);
  4361. revalidate_disk(mddev->gendisk);
  4362. mddev->changed = 1;
  4363. kobject_uevent(&disk_to_dev(mddev->gendisk)->kobj, KOBJ_CHANGE);
  4364. out:
  4365. return err;
  4366. }
  4367. static int restart_array(struct mddev *mddev)
  4368. {
  4369. struct gendisk *disk = mddev->gendisk;
  4370. /* Complain if it has no devices */
  4371. if (list_empty(&mddev->disks))
  4372. return -ENXIO;
  4373. if (!mddev->pers)
  4374. return -EINVAL;
  4375. if (!mddev->ro)
  4376. return -EBUSY;
  4377. mddev->safemode = 0;
  4378. mddev->ro = 0;
  4379. set_disk_ro(disk, 0);
  4380. printk(KERN_INFO "md: %s switched to read-write mode.\n",
  4381. mdname(mddev));
  4382. /* Kick recovery or resync if necessary */
  4383. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  4384. md_wakeup_thread(mddev->thread);
  4385. md_wakeup_thread(mddev->sync_thread);
  4386. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4387. return 0;
  4388. }
  4389. /* similar to deny_write_access, but accounts for our holding a reference
  4390. * to the file ourselves */
  4391. static int deny_bitmap_write_access(struct file * file)
  4392. {
  4393. struct inode *inode = file->f_mapping->host;
  4394. spin_lock(&inode->i_lock);
  4395. if (atomic_read(&inode->i_writecount) > 1) {
  4396. spin_unlock(&inode->i_lock);
  4397. return -ETXTBSY;
  4398. }
  4399. atomic_set(&inode->i_writecount, -1);
  4400. spin_unlock(&inode->i_lock);
  4401. return 0;
  4402. }
  4403. void restore_bitmap_write_access(struct file *file)
  4404. {
  4405. struct inode *inode = file->f_mapping->host;
  4406. spin_lock(&inode->i_lock);
  4407. atomic_set(&inode->i_writecount, 1);
  4408. spin_unlock(&inode->i_lock);
  4409. }
  4410. static void md_clean(struct mddev *mddev)
  4411. {
  4412. mddev->array_sectors = 0;
  4413. mddev->external_size = 0;
  4414. mddev->dev_sectors = 0;
  4415. mddev->raid_disks = 0;
  4416. mddev->recovery_cp = 0;
  4417. mddev->resync_min = 0;
  4418. mddev->resync_max = MaxSector;
  4419. mddev->reshape_position = MaxSector;
  4420. mddev->external = 0;
  4421. mddev->persistent = 0;
  4422. mddev->level = LEVEL_NONE;
  4423. mddev->clevel[0] = 0;
  4424. mddev->flags = 0;
  4425. mddev->ro = 0;
  4426. mddev->metadata_type[0] = 0;
  4427. mddev->chunk_sectors = 0;
  4428. mddev->ctime = mddev->utime = 0;
  4429. mddev->layout = 0;
  4430. mddev->max_disks = 0;
  4431. mddev->events = 0;
  4432. mddev->can_decrease_events = 0;
  4433. mddev->delta_disks = 0;
  4434. mddev->new_level = LEVEL_NONE;
  4435. mddev->new_layout = 0;
  4436. mddev->new_chunk_sectors = 0;
  4437. mddev->curr_resync = 0;
  4438. mddev->resync_mismatches = 0;
  4439. mddev->suspend_lo = mddev->suspend_hi = 0;
  4440. mddev->sync_speed_min = mddev->sync_speed_max = 0;
  4441. mddev->recovery = 0;
  4442. mddev->in_sync = 0;
  4443. mddev->changed = 0;
  4444. mddev->degraded = 0;
  4445. mddev->safemode = 0;
  4446. mddev->bitmap_info.offset = 0;
  4447. mddev->bitmap_info.default_offset = 0;
  4448. mddev->bitmap_info.chunksize = 0;
  4449. mddev->bitmap_info.daemon_sleep = 0;
  4450. mddev->bitmap_info.max_write_behind = 0;
  4451. }
  4452. static void __md_stop_writes(struct mddev *mddev)
  4453. {
  4454. if (mddev->sync_thread) {
  4455. set_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  4456. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  4457. reap_sync_thread(mddev);
  4458. }
  4459. del_timer_sync(&mddev->safemode_timer);
  4460. bitmap_flush(mddev);
  4461. md_super_wait(mddev);
  4462. if (!mddev->in_sync || mddev->flags) {
  4463. /* mark array as shutdown cleanly */
  4464. mddev->in_sync = 1;
  4465. md_update_sb(mddev, 1);
  4466. }
  4467. }
  4468. void md_stop_writes(struct mddev *mddev)
  4469. {
  4470. mddev_lock(mddev);
  4471. __md_stop_writes(mddev);
  4472. mddev_unlock(mddev);
  4473. }
  4474. EXPORT_SYMBOL_GPL(md_stop_writes);
  4475. void md_stop(struct mddev *mddev)
  4476. {
  4477. mddev->ready = 0;
  4478. mddev->pers->stop(mddev);
  4479. if (mddev->pers->sync_request && mddev->to_remove == NULL)
  4480. mddev->to_remove = &md_redundancy_group;
  4481. module_put(mddev->pers->owner);
  4482. mddev->pers = NULL;
  4483. clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  4484. }
  4485. EXPORT_SYMBOL_GPL(md_stop);
  4486. static int md_set_readonly(struct mddev *mddev, int is_open)
  4487. {
  4488. int err = 0;
  4489. mutex_lock(&mddev->open_mutex);
  4490. if (atomic_read(&mddev->openers) > is_open) {
  4491. printk("md: %s still in use.\n",mdname(mddev));
  4492. err = -EBUSY;
  4493. goto out;
  4494. }
  4495. if (mddev->pers) {
  4496. __md_stop_writes(mddev);
  4497. err = -ENXIO;
  4498. if (mddev->ro==1)
  4499. goto out;
  4500. mddev->ro = 1;
  4501. set_disk_ro(mddev->gendisk, 1);
  4502. clear_bit(MD_RECOVERY_FROZEN, &mddev->recovery);
  4503. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4504. err = 0;
  4505. }
  4506. out:
  4507. mutex_unlock(&mddev->open_mutex);
  4508. return err;
  4509. }
  4510. /* mode:
  4511. * 0 - completely stop and dis-assemble array
  4512. * 2 - stop but do not disassemble array
  4513. */
  4514. static int do_md_stop(struct mddev * mddev, int mode, int is_open)
  4515. {
  4516. struct gendisk *disk = mddev->gendisk;
  4517. struct md_rdev *rdev;
  4518. mutex_lock(&mddev->open_mutex);
  4519. if (atomic_read(&mddev->openers) > is_open ||
  4520. mddev->sysfs_active) {
  4521. printk("md: %s still in use.\n",mdname(mddev));
  4522. mutex_unlock(&mddev->open_mutex);
  4523. return -EBUSY;
  4524. }
  4525. if (mddev->pers) {
  4526. if (mddev->ro)
  4527. set_disk_ro(disk, 0);
  4528. __md_stop_writes(mddev);
  4529. md_stop(mddev);
  4530. mddev->queue->merge_bvec_fn = NULL;
  4531. mddev->queue->backing_dev_info.congested_fn = NULL;
  4532. /* tell userspace to handle 'inactive' */
  4533. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4534. list_for_each_entry(rdev, &mddev->disks, same_set)
  4535. if (rdev->raid_disk >= 0)
  4536. sysfs_unlink_rdev(mddev, rdev);
  4537. set_capacity(disk, 0);
  4538. mutex_unlock(&mddev->open_mutex);
  4539. mddev->changed = 1;
  4540. revalidate_disk(disk);
  4541. if (mddev->ro)
  4542. mddev->ro = 0;
  4543. } else
  4544. mutex_unlock(&mddev->open_mutex);
  4545. /*
  4546. * Free resources if final stop
  4547. */
  4548. if (mode == 0) {
  4549. printk(KERN_INFO "md: %s stopped.\n", mdname(mddev));
  4550. bitmap_destroy(mddev);
  4551. if (mddev->bitmap_info.file) {
  4552. restore_bitmap_write_access(mddev->bitmap_info.file);
  4553. fput(mddev->bitmap_info.file);
  4554. mddev->bitmap_info.file = NULL;
  4555. }
  4556. mddev->bitmap_info.offset = 0;
  4557. export_array(mddev);
  4558. md_clean(mddev);
  4559. kobject_uevent(&disk_to_dev(mddev->gendisk)->kobj, KOBJ_CHANGE);
  4560. if (mddev->hold_active == UNTIL_STOP)
  4561. mddev->hold_active = 0;
  4562. }
  4563. blk_integrity_unregister(disk);
  4564. md_new_event(mddev);
  4565. sysfs_notify_dirent_safe(mddev->sysfs_state);
  4566. return 0;
  4567. }
  4568. #ifndef MODULE
  4569. static void autorun_array(struct mddev *mddev)
  4570. {
  4571. struct md_rdev *rdev;
  4572. int err;
  4573. if (list_empty(&mddev->disks))
  4574. return;
  4575. printk(KERN_INFO "md: running: ");
  4576. list_for_each_entry(rdev, &mddev->disks, same_set) {
  4577. char b[BDEVNAME_SIZE];
  4578. printk("<%s>", bdevname(rdev->bdev,b));
  4579. }
  4580. printk("\n");
  4581. err = do_md_run(mddev);
  4582. if (err) {
  4583. printk(KERN_WARNING "md: do_md_run() returned %d\n", err);
  4584. do_md_stop(mddev, 0, 0);
  4585. }
  4586. }
  4587. /*
  4588. * lets try to run arrays based on all disks that have arrived
  4589. * until now. (those are in pending_raid_disks)
  4590. *
  4591. * the method: pick the first pending disk, collect all disks with
  4592. * the same UUID, remove all from the pending list and put them into
  4593. * the 'same_array' list. Then order this list based on superblock
  4594. * update time (freshest comes first), kick out 'old' disks and
  4595. * compare superblocks. If everything's fine then run it.
  4596. *
  4597. * If "unit" is allocated, then bump its reference count
  4598. */
  4599. static void autorun_devices(int part)
  4600. {
  4601. struct md_rdev *rdev0, *rdev, *tmp;
  4602. struct mddev *mddev;
  4603. char b[BDEVNAME_SIZE];
  4604. printk(KERN_INFO "md: autorun ...\n");
  4605. while (!list_empty(&pending_raid_disks)) {
  4606. int unit;
  4607. dev_t dev;
  4608. LIST_HEAD(candidates);
  4609. rdev0 = list_entry(pending_raid_disks.next,
  4610. struct md_rdev, same_set);
  4611. printk(KERN_INFO "md: considering %s ...\n",
  4612. bdevname(rdev0->bdev,b));
  4613. INIT_LIST_HEAD(&candidates);
  4614. rdev_for_each_list(rdev, tmp, &pending_raid_disks)
  4615. if (super_90_load(rdev, rdev0, 0) >= 0) {
  4616. printk(KERN_INFO "md: adding %s ...\n",
  4617. bdevname(rdev->bdev,b));
  4618. list_move(&rdev->same_set, &candidates);
  4619. }
  4620. /*
  4621. * now we have a set of devices, with all of them having
  4622. * mostly sane superblocks. It's time to allocate the
  4623. * mddev.
  4624. */
  4625. if (part) {
  4626. dev = MKDEV(mdp_major,
  4627. rdev0->preferred_minor << MdpMinorShift);
  4628. unit = MINOR(dev) >> MdpMinorShift;
  4629. } else {
  4630. dev = MKDEV(MD_MAJOR, rdev0->preferred_minor);
  4631. unit = MINOR(dev);
  4632. }
  4633. if (rdev0->preferred_minor != unit) {
  4634. printk(KERN_INFO "md: unit number in %s is bad: %d\n",
  4635. bdevname(rdev0->bdev, b), rdev0->preferred_minor);
  4636. break;
  4637. }
  4638. md_probe(dev, NULL, NULL);
  4639. mddev = mddev_find(dev);
  4640. if (!mddev || !mddev->gendisk) {
  4641. if (mddev)
  4642. mddev_put(mddev);
  4643. printk(KERN_ERR
  4644. "md: cannot allocate memory for md drive.\n");
  4645. break;
  4646. }
  4647. if (mddev_lock(mddev))
  4648. printk(KERN_WARNING "md: %s locked, cannot run\n",
  4649. mdname(mddev));
  4650. else if (mddev->raid_disks || mddev->major_version
  4651. || !list_empty(&mddev->disks)) {
  4652. printk(KERN_WARNING
  4653. "md: %s already running, cannot run %s\n",
  4654. mdname(mddev), bdevname(rdev0->bdev,b));
  4655. mddev_unlock(mddev);
  4656. } else {
  4657. printk(KERN_INFO "md: created %s\n", mdname(mddev));
  4658. mddev->persistent = 1;
  4659. rdev_for_each_list(rdev, tmp, &candidates) {
  4660. list_del_init(&rdev->same_set);
  4661. if (bind_rdev_to_array(rdev, mddev))
  4662. export_rdev(rdev);
  4663. }
  4664. autorun_array(mddev);
  4665. mddev_unlock(mddev);
  4666. }
  4667. /* on success, candidates will be empty, on error
  4668. * it won't...
  4669. */
  4670. rdev_for_each_list(rdev, tmp, &candidates) {
  4671. list_del_init(&rdev->same_set);
  4672. export_rdev(rdev);
  4673. }
  4674. mddev_put(mddev);
  4675. }
  4676. printk(KERN_INFO "md: ... autorun DONE.\n");
  4677. }
  4678. #endif /* !MODULE */
  4679. static int get_version(void __user * arg)
  4680. {
  4681. mdu_version_t ver;
  4682. ver.major = MD_MAJOR_VERSION;
  4683. ver.minor = MD_MINOR_VERSION;
  4684. ver.patchlevel = MD_PATCHLEVEL_VERSION;
  4685. if (copy_to_user(arg, &ver, sizeof(ver)))
  4686. return -EFAULT;
  4687. return 0;
  4688. }
  4689. static int get_array_info(struct mddev * mddev, void __user * arg)
  4690. {
  4691. mdu_array_info_t info;
  4692. int nr,working,insync,failed,spare;
  4693. struct md_rdev *rdev;
  4694. nr=working=insync=failed=spare=0;
  4695. list_for_each_entry(rdev, &mddev->disks, same_set) {
  4696. nr++;
  4697. if (test_bit(Faulty, &rdev->flags))
  4698. failed++;
  4699. else {
  4700. working++;
  4701. if (test_bit(In_sync, &rdev->flags))
  4702. insync++;
  4703. else
  4704. spare++;
  4705. }
  4706. }
  4707. info.major_version = mddev->major_version;
  4708. info.minor_version = mddev->minor_version;
  4709. info.patch_version = MD_PATCHLEVEL_VERSION;
  4710. info.ctime = mddev->ctime;
  4711. info.level = mddev->level;
  4712. info.size = mddev->dev_sectors / 2;
  4713. if (info.size != mddev->dev_sectors / 2) /* overflow */
  4714. info.size = -1;
  4715. info.nr_disks = nr;
  4716. info.raid_disks = mddev->raid_disks;
  4717. info.md_minor = mddev->md_minor;
  4718. info.not_persistent= !mddev->persistent;
  4719. info.utime = mddev->utime;
  4720. info.state = 0;
  4721. if (mddev->in_sync)
  4722. info.state = (1<<MD_SB_CLEAN);
  4723. if (mddev->bitmap && mddev->bitmap_info.offset)
  4724. info.state = (1<<MD_SB_BITMAP_PRESENT);
  4725. info.active_disks = insync;
  4726. info.working_disks = working;
  4727. info.failed_disks = failed;
  4728. info.spare_disks = spare;
  4729. info.layout = mddev->layout;
  4730. info.chunk_size = mddev->chunk_sectors << 9;
  4731. if (copy_to_user(arg, &info, sizeof(info)))
  4732. return -EFAULT;
  4733. return 0;
  4734. }
  4735. static int get_bitmap_file(struct mddev * mddev, void __user * arg)
  4736. {
  4737. mdu_bitmap_file_t *file = NULL; /* too big for stack allocation */
  4738. char *ptr, *buf = NULL;
  4739. int err = -ENOMEM;
  4740. if (md_allow_write(mddev))
  4741. file = kmalloc(sizeof(*file), GFP_NOIO);
  4742. else
  4743. file = kmalloc(sizeof(*file), GFP_KERNEL);
  4744. if (!file)
  4745. goto out;
  4746. /* bitmap disabled, zero the first byte and copy out */
  4747. if (!mddev->bitmap || !mddev->bitmap->file) {
  4748. file->pathname[0] = '\0';
  4749. goto copy_out;
  4750. }
  4751. buf = kmalloc(sizeof(file->pathname), GFP_KERNEL);
  4752. if (!buf)
  4753. goto out;
  4754. ptr = d_path(&mddev->bitmap->file->f_path, buf, sizeof(file->pathname));
  4755. if (IS_ERR(ptr))
  4756. goto out;
  4757. strcpy(file->pathname, ptr);
  4758. copy_out:
  4759. err = 0;
  4760. if (copy_to_user(arg, file, sizeof(*file)))
  4761. err = -EFAULT;
  4762. out:
  4763. kfree(buf);
  4764. kfree(file);
  4765. return err;
  4766. }
  4767. static int get_disk_info(struct mddev * mddev, void __user * arg)
  4768. {
  4769. mdu_disk_info_t info;
  4770. struct md_rdev *rdev;
  4771. if (copy_from_user(&info, arg, sizeof(info)))
  4772. return -EFAULT;
  4773. rdev = find_rdev_nr(mddev, info.number);
  4774. if (rdev) {
  4775. info.major = MAJOR(rdev->bdev->bd_dev);
  4776. info.minor = MINOR(rdev->bdev->bd_dev);
  4777. info.raid_disk = rdev->raid_disk;
  4778. info.state = 0;
  4779. if (test_bit(Faulty, &rdev->flags))
  4780. info.state |= (1<<MD_DISK_FAULTY);
  4781. else if (test_bit(In_sync, &rdev->flags)) {
  4782. info.state |= (1<<MD_DISK_ACTIVE);
  4783. info.state |= (1<<MD_DISK_SYNC);
  4784. }
  4785. if (test_bit(WriteMostly, &rdev->flags))
  4786. info.state |= (1<<MD_DISK_WRITEMOSTLY);
  4787. } else {
  4788. info.major = info.minor = 0;
  4789. info.raid_disk = -1;
  4790. info.state = (1<<MD_DISK_REMOVED);
  4791. }
  4792. if (copy_to_user(arg, &info, sizeof(info)))
  4793. return -EFAULT;
  4794. return 0;
  4795. }
  4796. static int add_new_disk(struct mddev * mddev, mdu_disk_info_t *info)
  4797. {
  4798. char b[BDEVNAME_SIZE], b2[BDEVNAME_SIZE];
  4799. struct md_rdev *rdev;
  4800. dev_t dev = MKDEV(info->major,info->minor);
  4801. if (info->major != MAJOR(dev) || info->minor != MINOR(dev))
  4802. return -EOVERFLOW;
  4803. if (!mddev->raid_disks) {
  4804. int err;
  4805. /* expecting a device which has a superblock */
  4806. rdev = md_import_device(dev, mddev->major_version, mddev->minor_version);
  4807. if (IS_ERR(rdev)) {
  4808. printk(KERN_WARNING
  4809. "md: md_import_device returned %ld\n",
  4810. PTR_ERR(rdev));
  4811. return PTR_ERR(rdev);
  4812. }
  4813. if (!list_empty(&mddev->disks)) {
  4814. struct md_rdev *rdev0
  4815. = list_entry(mddev->disks.next,
  4816. struct md_rdev, same_set);
  4817. err = super_types[mddev->major_version]
  4818. .load_super(rdev, rdev0, mddev->minor_version);
  4819. if (err < 0) {
  4820. printk(KERN_WARNING
  4821. "md: %s has different UUID to %s\n",
  4822. bdevname(rdev->bdev,b),
  4823. bdevname(rdev0->bdev,b2));
  4824. export_rdev(rdev);
  4825. return -EINVAL;
  4826. }
  4827. }
  4828. err = bind_rdev_to_array(rdev, mddev);
  4829. if (err)
  4830. export_rdev(rdev);
  4831. return err;
  4832. }
  4833. /*
  4834. * add_new_disk can be used once the array is assembled
  4835. * to add "hot spares". They must already have a superblock
  4836. * written
  4837. */
  4838. if (mddev->pers) {
  4839. int err;
  4840. if (!mddev->pers->hot_add_disk) {
  4841. printk(KERN_WARNING
  4842. "%s: personality does not support diskops!\n",
  4843. mdname(mddev));
  4844. return -EINVAL;
  4845. }
  4846. if (mddev->persistent)
  4847. rdev = md_import_device(dev, mddev->major_version,
  4848. mddev->minor_version);
  4849. else
  4850. rdev = md_import_device(dev, -1, -1);
  4851. if (IS_ERR(rdev)) {
  4852. printk(KERN_WARNING
  4853. "md: md_import_device returned %ld\n",
  4854. PTR_ERR(rdev));
  4855. return PTR_ERR(rdev);
  4856. }
  4857. /* set saved_raid_disk if appropriate */
  4858. if (!mddev->persistent) {
  4859. if (info->state & (1<<MD_DISK_SYNC) &&
  4860. info->raid_disk < mddev->raid_disks) {
  4861. rdev->raid_disk = info->raid_disk;
  4862. set_bit(In_sync, &rdev->flags);
  4863. } else
  4864. rdev->raid_disk = -1;
  4865. } else
  4866. super_types[mddev->major_version].
  4867. validate_super(mddev, rdev);
  4868. if ((info->state & (1<<MD_DISK_SYNC)) &&
  4869. (!test_bit(In_sync, &rdev->flags) ||
  4870. rdev->raid_disk != info->raid_disk)) {
  4871. /* This was a hot-add request, but events doesn't
  4872. * match, so reject it.
  4873. */
  4874. export_rdev(rdev);
  4875. return -EINVAL;
  4876. }
  4877. if (test_bit(In_sync, &rdev->flags))
  4878. rdev->saved_raid_disk = rdev->raid_disk;
  4879. else
  4880. rdev->saved_raid_disk = -1;
  4881. clear_bit(In_sync, &rdev->flags); /* just to be sure */
  4882. if (info->state & (1<<MD_DISK_WRITEMOSTLY))
  4883. set_bit(WriteMostly, &rdev->flags);
  4884. else
  4885. clear_bit(WriteMostly, &rdev->flags);
  4886. rdev->raid_disk = -1;
  4887. err = bind_rdev_to_array(rdev, mddev);
  4888. if (!err && !mddev->pers->hot_remove_disk) {
  4889. /* If there is hot_add_disk but no hot_remove_disk
  4890. * then added disks for geometry changes,
  4891. * and should be added immediately.
  4892. */
  4893. super_types[mddev->major_version].
  4894. validate_super(mddev, rdev);
  4895. err = mddev->pers->hot_add_disk(mddev, rdev);
  4896. if (err)
  4897. unbind_rdev_from_array(rdev);
  4898. }
  4899. if (err)
  4900. export_rdev(rdev);
  4901. else
  4902. sysfs_notify_dirent_safe(rdev->sysfs_state);
  4903. md_update_sb(mddev, 1);
  4904. if (mddev->degraded)
  4905. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  4906. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  4907. if (!err)
  4908. md_new_event(mddev);
  4909. md_wakeup_thread(mddev->thread);
  4910. return err;
  4911. }
  4912. /* otherwise, add_new_disk is only allowed
  4913. * for major_version==0 superblocks
  4914. */
  4915. if (mddev->major_version != 0) {
  4916. printk(KERN_WARNING "%s: ADD_NEW_DISK not supported\n",
  4917. mdname(mddev));
  4918. return -EINVAL;
  4919. }
  4920. if (!(info->state & (1<<MD_DISK_FAULTY))) {
  4921. int err;
  4922. rdev = md_import_device(dev, -1, 0);
  4923. if (IS_ERR(rdev)) {
  4924. printk(KERN_WARNING
  4925. "md: error, md_import_device() returned %ld\n",
  4926. PTR_ERR(rdev));
  4927. return PTR_ERR(rdev);
  4928. }
  4929. rdev->desc_nr = info->number;
  4930. if (info->raid_disk < mddev->raid_disks)
  4931. rdev->raid_disk = info->raid_disk;
  4932. else
  4933. rdev->raid_disk = -1;
  4934. if (rdev->raid_disk < mddev->raid_disks)
  4935. if (info->state & (1<<MD_DISK_SYNC))
  4936. set_bit(In_sync, &rdev->flags);
  4937. if (info->state & (1<<MD_DISK_WRITEMOSTLY))
  4938. set_bit(WriteMostly, &rdev->flags);
  4939. if (!mddev->persistent) {
  4940. printk(KERN_INFO "md: nonpersistent superblock ...\n");
  4941. rdev->sb_start = i_size_read(rdev->bdev->bd_inode) / 512;
  4942. } else
  4943. rdev->sb_start = calc_dev_sboffset(rdev);
  4944. rdev->sectors = rdev->sb_start;
  4945. err = bind_rdev_to_array(rdev, mddev);
  4946. if (err) {
  4947. export_rdev(rdev);
  4948. return err;
  4949. }
  4950. }
  4951. return 0;
  4952. }
  4953. static int hot_remove_disk(struct mddev * mddev, dev_t dev)
  4954. {
  4955. char b[BDEVNAME_SIZE];
  4956. struct md_rdev *rdev;
  4957. rdev = find_rdev(mddev, dev);
  4958. if (!rdev)
  4959. return -ENXIO;
  4960. if (rdev->raid_disk >= 0)
  4961. goto busy;
  4962. kick_rdev_from_array(rdev);
  4963. md_update_sb(mddev, 1);
  4964. md_new_event(mddev);
  4965. return 0;
  4966. busy:
  4967. printk(KERN_WARNING "md: cannot remove active disk %s from %s ...\n",
  4968. bdevname(rdev->bdev,b), mdname(mddev));
  4969. return -EBUSY;
  4970. }
  4971. static int hot_add_disk(struct mddev * mddev, dev_t dev)
  4972. {
  4973. char b[BDEVNAME_SIZE];
  4974. int err;
  4975. struct md_rdev *rdev;
  4976. if (!mddev->pers)
  4977. return -ENODEV;
  4978. if (mddev->major_version != 0) {
  4979. printk(KERN_WARNING "%s: HOT_ADD may only be used with"
  4980. " version-0 superblocks.\n",
  4981. mdname(mddev));
  4982. return -EINVAL;
  4983. }
  4984. if (!mddev->pers->hot_add_disk) {
  4985. printk(KERN_WARNING
  4986. "%s: personality does not support diskops!\n",
  4987. mdname(mddev));
  4988. return -EINVAL;
  4989. }
  4990. rdev = md_import_device(dev, -1, 0);
  4991. if (IS_ERR(rdev)) {
  4992. printk(KERN_WARNING
  4993. "md: error, md_import_device() returned %ld\n",
  4994. PTR_ERR(rdev));
  4995. return -EINVAL;
  4996. }
  4997. if (mddev->persistent)
  4998. rdev->sb_start = calc_dev_sboffset(rdev);
  4999. else
  5000. rdev->sb_start = i_size_read(rdev->bdev->bd_inode) / 512;
  5001. rdev->sectors = rdev->sb_start;
  5002. if (test_bit(Faulty, &rdev->flags)) {
  5003. printk(KERN_WARNING
  5004. "md: can not hot-add faulty %s disk to %s!\n",
  5005. bdevname(rdev->bdev,b), mdname(mddev));
  5006. err = -EINVAL;
  5007. goto abort_export;
  5008. }
  5009. clear_bit(In_sync, &rdev->flags);
  5010. rdev->desc_nr = -1;
  5011. rdev->saved_raid_disk = -1;
  5012. err = bind_rdev_to_array(rdev, mddev);
  5013. if (err)
  5014. goto abort_export;
  5015. /*
  5016. * The rest should better be atomic, we can have disk failures
  5017. * noticed in interrupt contexts ...
  5018. */
  5019. rdev->raid_disk = -1;
  5020. md_update_sb(mddev, 1);
  5021. /*
  5022. * Kick recovery, maybe this spare has to be added to the
  5023. * array immediately.
  5024. */
  5025. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  5026. md_wakeup_thread(mddev->thread);
  5027. md_new_event(mddev);
  5028. return 0;
  5029. abort_export:
  5030. export_rdev(rdev);
  5031. return err;
  5032. }
  5033. static int set_bitmap_file(struct mddev *mddev, int fd)
  5034. {
  5035. int err;
  5036. if (mddev->pers) {
  5037. if (!mddev->pers->quiesce)
  5038. return -EBUSY;
  5039. if (mddev->recovery || mddev->sync_thread)
  5040. return -EBUSY;
  5041. /* we should be able to change the bitmap.. */
  5042. }
  5043. if (fd >= 0) {
  5044. if (mddev->bitmap)
  5045. return -EEXIST; /* cannot add when bitmap is present */
  5046. mddev->bitmap_info.file = fget(fd);
  5047. if (mddev->bitmap_info.file == NULL) {
  5048. printk(KERN_ERR "%s: error: failed to get bitmap file\n",
  5049. mdname(mddev));
  5050. return -EBADF;
  5051. }
  5052. err = deny_bitmap_write_access(mddev->bitmap_info.file);
  5053. if (err) {
  5054. printk(KERN_ERR "%s: error: bitmap file is already in use\n",
  5055. mdname(mddev));
  5056. fput(mddev->bitmap_info.file);
  5057. mddev->bitmap_info.file = NULL;
  5058. return err;
  5059. }
  5060. mddev->bitmap_info.offset = 0; /* file overrides offset */
  5061. } else if (mddev->bitmap == NULL)
  5062. return -ENOENT; /* cannot remove what isn't there */
  5063. err = 0;
  5064. if (mddev->pers) {
  5065. mddev->pers->quiesce(mddev, 1);
  5066. if (fd >= 0) {
  5067. err = bitmap_create(mddev);
  5068. if (!err)
  5069. err = bitmap_load(mddev);
  5070. }
  5071. if (fd < 0 || err) {
  5072. bitmap_destroy(mddev);
  5073. fd = -1; /* make sure to put the file */
  5074. }
  5075. mddev->pers->quiesce(mddev, 0);
  5076. }
  5077. if (fd < 0) {
  5078. if (mddev->bitmap_info.file) {
  5079. restore_bitmap_write_access(mddev->bitmap_info.file);
  5080. fput(mddev->bitmap_info.file);
  5081. }
  5082. mddev->bitmap_info.file = NULL;
  5083. }
  5084. return err;
  5085. }
  5086. /*
  5087. * set_array_info is used two different ways
  5088. * The original usage is when creating a new array.
  5089. * In this usage, raid_disks is > 0 and it together with
  5090. * level, size, not_persistent,layout,chunksize determine the
  5091. * shape of the array.
  5092. * This will always create an array with a type-0.90.0 superblock.
  5093. * The newer usage is when assembling an array.
  5094. * In this case raid_disks will be 0, and the major_version field is
  5095. * use to determine which style super-blocks are to be found on the devices.
  5096. * The minor and patch _version numbers are also kept incase the
  5097. * super_block handler wishes to interpret them.
  5098. */
  5099. static int set_array_info(struct mddev * mddev, mdu_array_info_t *info)
  5100. {
  5101. if (info->raid_disks == 0) {
  5102. /* just setting version number for superblock loading */
  5103. if (info->major_version < 0 ||
  5104. info->major_version >= ARRAY_SIZE(super_types) ||
  5105. super_types[info->major_version].name == NULL) {
  5106. /* maybe try to auto-load a module? */
  5107. printk(KERN_INFO
  5108. "md: superblock version %d not known\n",
  5109. info->major_version);
  5110. return -EINVAL;
  5111. }
  5112. mddev->major_version = info->major_version;
  5113. mddev->minor_version = info->minor_version;
  5114. mddev->patch_version = info->patch_version;
  5115. mddev->persistent = !info->not_persistent;
  5116. /* ensure mddev_put doesn't delete this now that there
  5117. * is some minimal configuration.
  5118. */
  5119. mddev->ctime = get_seconds();
  5120. return 0;
  5121. }
  5122. mddev->major_version = MD_MAJOR_VERSION;
  5123. mddev->minor_version = MD_MINOR_VERSION;
  5124. mddev->patch_version = MD_PATCHLEVEL_VERSION;
  5125. mddev->ctime = get_seconds();
  5126. mddev->level = info->level;
  5127. mddev->clevel[0] = 0;
  5128. mddev->dev_sectors = 2 * (sector_t)info->size;
  5129. mddev->raid_disks = info->raid_disks;
  5130. /* don't set md_minor, it is determined by which /dev/md* was
  5131. * openned
  5132. */
  5133. if (info->state & (1<<MD_SB_CLEAN))
  5134. mddev->recovery_cp = MaxSector;
  5135. else
  5136. mddev->recovery_cp = 0;
  5137. mddev->persistent = ! info->not_persistent;
  5138. mddev->external = 0;
  5139. mddev->layout = info->layout;
  5140. mddev->chunk_sectors = info->chunk_size >> 9;
  5141. mddev->max_disks = MD_SB_DISKS;
  5142. if (mddev->persistent)
  5143. mddev->flags = 0;
  5144. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  5145. mddev->bitmap_info.default_offset = MD_SB_BYTES >> 9;
  5146. mddev->bitmap_info.offset = 0;
  5147. mddev->reshape_position = MaxSector;
  5148. /*
  5149. * Generate a 128 bit UUID
  5150. */
  5151. get_random_bytes(mddev->uuid, 16);
  5152. mddev->new_level = mddev->level;
  5153. mddev->new_chunk_sectors = mddev->chunk_sectors;
  5154. mddev->new_layout = mddev->layout;
  5155. mddev->delta_disks = 0;
  5156. return 0;
  5157. }
  5158. void md_set_array_sectors(struct mddev *mddev, sector_t array_sectors)
  5159. {
  5160. WARN(!mddev_is_locked(mddev), "%s: unlocked mddev!\n", __func__);
  5161. if (mddev->external_size)
  5162. return;
  5163. mddev->array_sectors = array_sectors;
  5164. }
  5165. EXPORT_SYMBOL(md_set_array_sectors);
  5166. static int update_size(struct mddev *mddev, sector_t num_sectors)
  5167. {
  5168. struct md_rdev *rdev;
  5169. int rv;
  5170. int fit = (num_sectors == 0);
  5171. if (mddev->pers->resize == NULL)
  5172. return -EINVAL;
  5173. /* The "num_sectors" is the number of sectors of each device that
  5174. * is used. This can only make sense for arrays with redundancy.
  5175. * linear and raid0 always use whatever space is available. We can only
  5176. * consider changing this number if no resync or reconstruction is
  5177. * happening, and if the new size is acceptable. It must fit before the
  5178. * sb_start or, if that is <data_offset, it must fit before the size
  5179. * of each device. If num_sectors is zero, we find the largest size
  5180. * that fits.
  5181. */
  5182. if (mddev->sync_thread)
  5183. return -EBUSY;
  5184. if (mddev->bitmap)
  5185. /* Sorry, cannot grow a bitmap yet, just remove it,
  5186. * grow, and re-add.
  5187. */
  5188. return -EBUSY;
  5189. list_for_each_entry(rdev, &mddev->disks, same_set) {
  5190. sector_t avail = rdev->sectors;
  5191. if (fit && (num_sectors == 0 || num_sectors > avail))
  5192. num_sectors = avail;
  5193. if (avail < num_sectors)
  5194. return -ENOSPC;
  5195. }
  5196. rv = mddev->pers->resize(mddev, num_sectors);
  5197. if (!rv)
  5198. revalidate_disk(mddev->gendisk);
  5199. return rv;
  5200. }
  5201. static int update_raid_disks(struct mddev *mddev, int raid_disks)
  5202. {
  5203. int rv;
  5204. /* change the number of raid disks */
  5205. if (mddev->pers->check_reshape == NULL)
  5206. return -EINVAL;
  5207. if (raid_disks <= 0 ||
  5208. (mddev->max_disks && raid_disks >= mddev->max_disks))
  5209. return -EINVAL;
  5210. if (mddev->sync_thread || mddev->reshape_position != MaxSector)
  5211. return -EBUSY;
  5212. mddev->delta_disks = raid_disks - mddev->raid_disks;
  5213. rv = mddev->pers->check_reshape(mddev);
  5214. if (rv < 0)
  5215. mddev->delta_disks = 0;
  5216. return rv;
  5217. }
  5218. /*
  5219. * update_array_info is used to change the configuration of an
  5220. * on-line array.
  5221. * The version, ctime,level,size,raid_disks,not_persistent, layout,chunk_size
  5222. * fields in the info are checked against the array.
  5223. * Any differences that cannot be handled will cause an error.
  5224. * Normally, only one change can be managed at a time.
  5225. */
  5226. static int update_array_info(struct mddev *mddev, mdu_array_info_t *info)
  5227. {
  5228. int rv = 0;
  5229. int cnt = 0;
  5230. int state = 0;
  5231. /* calculate expected state,ignoring low bits */
  5232. if (mddev->bitmap && mddev->bitmap_info.offset)
  5233. state |= (1 << MD_SB_BITMAP_PRESENT);
  5234. if (mddev->major_version != info->major_version ||
  5235. mddev->minor_version != info->minor_version ||
  5236. /* mddev->patch_version != info->patch_version || */
  5237. mddev->ctime != info->ctime ||
  5238. mddev->level != info->level ||
  5239. /* mddev->layout != info->layout || */
  5240. !mddev->persistent != info->not_persistent||
  5241. mddev->chunk_sectors != info->chunk_size >> 9 ||
  5242. /* ignore bottom 8 bits of state, and allow SB_BITMAP_PRESENT to change */
  5243. ((state^info->state) & 0xfffffe00)
  5244. )
  5245. return -EINVAL;
  5246. /* Check there is only one change */
  5247. if (info->size >= 0 && mddev->dev_sectors / 2 != info->size)
  5248. cnt++;
  5249. if (mddev->raid_disks != info->raid_disks)
  5250. cnt++;
  5251. if (mddev->layout != info->layout)
  5252. cnt++;
  5253. if ((state ^ info->state) & (1<<MD_SB_BITMAP_PRESENT))
  5254. cnt++;
  5255. if (cnt == 0)
  5256. return 0;
  5257. if (cnt > 1)
  5258. return -EINVAL;
  5259. if (mddev->layout != info->layout) {
  5260. /* Change layout
  5261. * we don't need to do anything at the md level, the
  5262. * personality will take care of it all.
  5263. */
  5264. if (mddev->pers->check_reshape == NULL)
  5265. return -EINVAL;
  5266. else {
  5267. mddev->new_layout = info->layout;
  5268. rv = mddev->pers->check_reshape(mddev);
  5269. if (rv)
  5270. mddev->new_layout = mddev->layout;
  5271. return rv;
  5272. }
  5273. }
  5274. if (info->size >= 0 && mddev->dev_sectors / 2 != info->size)
  5275. rv = update_size(mddev, (sector_t)info->size * 2);
  5276. if (mddev->raid_disks != info->raid_disks)
  5277. rv = update_raid_disks(mddev, info->raid_disks);
  5278. if ((state ^ info->state) & (1<<MD_SB_BITMAP_PRESENT)) {
  5279. if (mddev->pers->quiesce == NULL)
  5280. return -EINVAL;
  5281. if (mddev->recovery || mddev->sync_thread)
  5282. return -EBUSY;
  5283. if (info->state & (1<<MD_SB_BITMAP_PRESENT)) {
  5284. /* add the bitmap */
  5285. if (mddev->bitmap)
  5286. return -EEXIST;
  5287. if (mddev->bitmap_info.default_offset == 0)
  5288. return -EINVAL;
  5289. mddev->bitmap_info.offset =
  5290. mddev->bitmap_info.default_offset;
  5291. mddev->pers->quiesce(mddev, 1);
  5292. rv = bitmap_create(mddev);
  5293. if (!rv)
  5294. rv = bitmap_load(mddev);
  5295. if (rv)
  5296. bitmap_destroy(mddev);
  5297. mddev->pers->quiesce(mddev, 0);
  5298. } else {
  5299. /* remove the bitmap */
  5300. if (!mddev->bitmap)
  5301. return -ENOENT;
  5302. if (mddev->bitmap->file)
  5303. return -EINVAL;
  5304. mddev->pers->quiesce(mddev, 1);
  5305. bitmap_destroy(mddev);
  5306. mddev->pers->quiesce(mddev, 0);
  5307. mddev->bitmap_info.offset = 0;
  5308. }
  5309. }
  5310. md_update_sb(mddev, 1);
  5311. return rv;
  5312. }
  5313. static int set_disk_faulty(struct mddev *mddev, dev_t dev)
  5314. {
  5315. struct md_rdev *rdev;
  5316. if (mddev->pers == NULL)
  5317. return -ENODEV;
  5318. rdev = find_rdev(mddev, dev);
  5319. if (!rdev)
  5320. return -ENODEV;
  5321. md_error(mddev, rdev);
  5322. if (!test_bit(Faulty, &rdev->flags))
  5323. return -EBUSY;
  5324. return 0;
  5325. }
  5326. /*
  5327. * We have a problem here : there is no easy way to give a CHS
  5328. * virtual geometry. We currently pretend that we have a 2 heads
  5329. * 4 sectors (with a BIG number of cylinders...). This drives
  5330. * dosfs just mad... ;-)
  5331. */
  5332. static int md_getgeo(struct block_device *bdev, struct hd_geometry *geo)
  5333. {
  5334. struct mddev *mddev = bdev->bd_disk->private_data;
  5335. geo->heads = 2;
  5336. geo->sectors = 4;
  5337. geo->cylinders = mddev->array_sectors / 8;
  5338. return 0;
  5339. }
  5340. static int md_ioctl(struct block_device *bdev, fmode_t mode,
  5341. unsigned int cmd, unsigned long arg)
  5342. {
  5343. int err = 0;
  5344. void __user *argp = (void __user *)arg;
  5345. struct mddev *mddev = NULL;
  5346. int ro;
  5347. if (!capable(CAP_SYS_ADMIN))
  5348. return -EACCES;
  5349. /*
  5350. * Commands dealing with the RAID driver but not any
  5351. * particular array:
  5352. */
  5353. switch (cmd)
  5354. {
  5355. case RAID_VERSION:
  5356. err = get_version(argp);
  5357. goto done;
  5358. case PRINT_RAID_DEBUG:
  5359. err = 0;
  5360. md_print_devices();
  5361. goto done;
  5362. #ifndef MODULE
  5363. case RAID_AUTORUN:
  5364. err = 0;
  5365. autostart_arrays(arg);
  5366. goto done;
  5367. #endif
  5368. default:;
  5369. }
  5370. /*
  5371. * Commands creating/starting a new array:
  5372. */
  5373. mddev = bdev->bd_disk->private_data;
  5374. if (!mddev) {
  5375. BUG();
  5376. goto abort;
  5377. }
  5378. err = mddev_lock(mddev);
  5379. if (err) {
  5380. printk(KERN_INFO
  5381. "md: ioctl lock interrupted, reason %d, cmd %d\n",
  5382. err, cmd);
  5383. goto abort;
  5384. }
  5385. switch (cmd)
  5386. {
  5387. case SET_ARRAY_INFO:
  5388. {
  5389. mdu_array_info_t info;
  5390. if (!arg)
  5391. memset(&info, 0, sizeof(info));
  5392. else if (copy_from_user(&info, argp, sizeof(info))) {
  5393. err = -EFAULT;
  5394. goto abort_unlock;
  5395. }
  5396. if (mddev->pers) {
  5397. err = update_array_info(mddev, &info);
  5398. if (err) {
  5399. printk(KERN_WARNING "md: couldn't update"
  5400. " array info. %d\n", err);
  5401. goto abort_unlock;
  5402. }
  5403. goto done_unlock;
  5404. }
  5405. if (!list_empty(&mddev->disks)) {
  5406. printk(KERN_WARNING
  5407. "md: array %s already has disks!\n",
  5408. mdname(mddev));
  5409. err = -EBUSY;
  5410. goto abort_unlock;
  5411. }
  5412. if (mddev->raid_disks) {
  5413. printk(KERN_WARNING
  5414. "md: array %s already initialised!\n",
  5415. mdname(mddev));
  5416. err = -EBUSY;
  5417. goto abort_unlock;
  5418. }
  5419. err = set_array_info(mddev, &info);
  5420. if (err) {
  5421. printk(KERN_WARNING "md: couldn't set"
  5422. " array info. %d\n", err);
  5423. goto abort_unlock;
  5424. }
  5425. }
  5426. goto done_unlock;
  5427. default:;
  5428. }
  5429. /*
  5430. * Commands querying/configuring an existing array:
  5431. */
  5432. /* if we are not initialised yet, only ADD_NEW_DISK, STOP_ARRAY,
  5433. * RUN_ARRAY, and GET_ and SET_BITMAP_FILE are allowed */
  5434. if ((!mddev->raid_disks && !mddev->external)
  5435. && cmd != ADD_NEW_DISK && cmd != STOP_ARRAY
  5436. && cmd != RUN_ARRAY && cmd != SET_BITMAP_FILE
  5437. && cmd != GET_BITMAP_FILE) {
  5438. err = -ENODEV;
  5439. goto abort_unlock;
  5440. }
  5441. /*
  5442. * Commands even a read-only array can execute:
  5443. */
  5444. switch (cmd)
  5445. {
  5446. case GET_ARRAY_INFO:
  5447. err = get_array_info(mddev, argp);
  5448. goto done_unlock;
  5449. case GET_BITMAP_FILE:
  5450. err = get_bitmap_file(mddev, argp);
  5451. goto done_unlock;
  5452. case GET_DISK_INFO:
  5453. err = get_disk_info(mddev, argp);
  5454. goto done_unlock;
  5455. case RESTART_ARRAY_RW:
  5456. err = restart_array(mddev);
  5457. goto done_unlock;
  5458. case STOP_ARRAY:
  5459. err = do_md_stop(mddev, 0, 1);
  5460. goto done_unlock;
  5461. case STOP_ARRAY_RO:
  5462. err = md_set_readonly(mddev, 1);
  5463. goto done_unlock;
  5464. case BLKROSET:
  5465. if (get_user(ro, (int __user *)(arg))) {
  5466. err = -EFAULT;
  5467. goto done_unlock;
  5468. }
  5469. err = -EINVAL;
  5470. /* if the bdev is going readonly the value of mddev->ro
  5471. * does not matter, no writes are coming
  5472. */
  5473. if (ro)
  5474. goto done_unlock;
  5475. /* are we are already prepared for writes? */
  5476. if (mddev->ro != 1)
  5477. goto done_unlock;
  5478. /* transitioning to readauto need only happen for
  5479. * arrays that call md_write_start
  5480. */
  5481. if (mddev->pers) {
  5482. err = restart_array(mddev);
  5483. if (err == 0) {
  5484. mddev->ro = 2;
  5485. set_disk_ro(mddev->gendisk, 0);
  5486. }
  5487. }
  5488. goto done_unlock;
  5489. }
  5490. /*
  5491. * The remaining ioctls are changing the state of the
  5492. * superblock, so we do not allow them on read-only arrays.
  5493. * However non-MD ioctls (e.g. get-size) will still come through
  5494. * here and hit the 'default' below, so only disallow
  5495. * 'md' ioctls, and switch to rw mode if started auto-readonly.
  5496. */
  5497. if (_IOC_TYPE(cmd) == MD_MAJOR && mddev->ro && mddev->pers) {
  5498. if (mddev->ro == 2) {
  5499. mddev->ro = 0;
  5500. sysfs_notify_dirent_safe(mddev->sysfs_state);
  5501. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  5502. md_wakeup_thread(mddev->thread);
  5503. } else {
  5504. err = -EROFS;
  5505. goto abort_unlock;
  5506. }
  5507. }
  5508. switch (cmd)
  5509. {
  5510. case ADD_NEW_DISK:
  5511. {
  5512. mdu_disk_info_t info;
  5513. if (copy_from_user(&info, argp, sizeof(info)))
  5514. err = -EFAULT;
  5515. else
  5516. err = add_new_disk(mddev, &info);
  5517. goto done_unlock;
  5518. }
  5519. case HOT_REMOVE_DISK:
  5520. err = hot_remove_disk(mddev, new_decode_dev(arg));
  5521. goto done_unlock;
  5522. case HOT_ADD_DISK:
  5523. err = hot_add_disk(mddev, new_decode_dev(arg));
  5524. goto done_unlock;
  5525. case SET_DISK_FAULTY:
  5526. err = set_disk_faulty(mddev, new_decode_dev(arg));
  5527. goto done_unlock;
  5528. case RUN_ARRAY:
  5529. err = do_md_run(mddev);
  5530. goto done_unlock;
  5531. case SET_BITMAP_FILE:
  5532. err = set_bitmap_file(mddev, (int)arg);
  5533. goto done_unlock;
  5534. default:
  5535. err = -EINVAL;
  5536. goto abort_unlock;
  5537. }
  5538. done_unlock:
  5539. abort_unlock:
  5540. if (mddev->hold_active == UNTIL_IOCTL &&
  5541. err != -EINVAL)
  5542. mddev->hold_active = 0;
  5543. mddev_unlock(mddev);
  5544. return err;
  5545. done:
  5546. if (err)
  5547. MD_BUG();
  5548. abort:
  5549. return err;
  5550. }
  5551. #ifdef CONFIG_COMPAT
  5552. static int md_compat_ioctl(struct block_device *bdev, fmode_t mode,
  5553. unsigned int cmd, unsigned long arg)
  5554. {
  5555. switch (cmd) {
  5556. case HOT_REMOVE_DISK:
  5557. case HOT_ADD_DISK:
  5558. case SET_DISK_FAULTY:
  5559. case SET_BITMAP_FILE:
  5560. /* These take in integer arg, do not convert */
  5561. break;
  5562. default:
  5563. arg = (unsigned long)compat_ptr(arg);
  5564. break;
  5565. }
  5566. return md_ioctl(bdev, mode, cmd, arg);
  5567. }
  5568. #endif /* CONFIG_COMPAT */
  5569. static int md_open(struct block_device *bdev, fmode_t mode)
  5570. {
  5571. /*
  5572. * Succeed if we can lock the mddev, which confirms that
  5573. * it isn't being stopped right now.
  5574. */
  5575. struct mddev *mddev = mddev_find(bdev->bd_dev);
  5576. int err;
  5577. if (mddev->gendisk != bdev->bd_disk) {
  5578. /* we are racing with mddev_put which is discarding this
  5579. * bd_disk.
  5580. */
  5581. mddev_put(mddev);
  5582. /* Wait until bdev->bd_disk is definitely gone */
  5583. flush_workqueue(md_misc_wq);
  5584. /* Then retry the open from the top */
  5585. return -ERESTARTSYS;
  5586. }
  5587. BUG_ON(mddev != bdev->bd_disk->private_data);
  5588. if ((err = mutex_lock_interruptible(&mddev->open_mutex)))
  5589. goto out;
  5590. err = 0;
  5591. atomic_inc(&mddev->openers);
  5592. mutex_unlock(&mddev->open_mutex);
  5593. check_disk_change(bdev);
  5594. out:
  5595. return err;
  5596. }
  5597. static int md_release(struct gendisk *disk, fmode_t mode)
  5598. {
  5599. struct mddev *mddev = disk->private_data;
  5600. BUG_ON(!mddev);
  5601. atomic_dec(&mddev->openers);
  5602. mddev_put(mddev);
  5603. return 0;
  5604. }
  5605. static int md_media_changed(struct gendisk *disk)
  5606. {
  5607. struct mddev *mddev = disk->private_data;
  5608. return mddev->changed;
  5609. }
  5610. static int md_revalidate(struct gendisk *disk)
  5611. {
  5612. struct mddev *mddev = disk->private_data;
  5613. mddev->changed = 0;
  5614. return 0;
  5615. }
  5616. static const struct block_device_operations md_fops =
  5617. {
  5618. .owner = THIS_MODULE,
  5619. .open = md_open,
  5620. .release = md_release,
  5621. .ioctl = md_ioctl,
  5622. #ifdef CONFIG_COMPAT
  5623. .compat_ioctl = md_compat_ioctl,
  5624. #endif
  5625. .getgeo = md_getgeo,
  5626. .media_changed = md_media_changed,
  5627. .revalidate_disk= md_revalidate,
  5628. };
  5629. static int md_thread(void * arg)
  5630. {
  5631. struct md_thread *thread = arg;
  5632. /*
  5633. * md_thread is a 'system-thread', it's priority should be very
  5634. * high. We avoid resource deadlocks individually in each
  5635. * raid personality. (RAID5 does preallocation) We also use RR and
  5636. * the very same RT priority as kswapd, thus we will never get
  5637. * into a priority inversion deadlock.
  5638. *
  5639. * we definitely have to have equal or higher priority than
  5640. * bdflush, otherwise bdflush will deadlock if there are too
  5641. * many dirty RAID5 blocks.
  5642. */
  5643. allow_signal(SIGKILL);
  5644. while (!kthread_should_stop()) {
  5645. /* We need to wait INTERRUPTIBLE so that
  5646. * we don't add to the load-average.
  5647. * That means we need to be sure no signals are
  5648. * pending
  5649. */
  5650. if (signal_pending(current))
  5651. flush_signals(current);
  5652. wait_event_interruptible_timeout
  5653. (thread->wqueue,
  5654. test_bit(THREAD_WAKEUP, &thread->flags)
  5655. || kthread_should_stop(),
  5656. thread->timeout);
  5657. clear_bit(THREAD_WAKEUP, &thread->flags);
  5658. if (!kthread_should_stop())
  5659. thread->run(thread->mddev);
  5660. }
  5661. return 0;
  5662. }
  5663. void md_wakeup_thread(struct md_thread *thread)
  5664. {
  5665. if (thread) {
  5666. pr_debug("md: waking up MD thread %s.\n", thread->tsk->comm);
  5667. set_bit(THREAD_WAKEUP, &thread->flags);
  5668. wake_up(&thread->wqueue);
  5669. }
  5670. }
  5671. struct md_thread *md_register_thread(void (*run) (struct mddev *), struct mddev *mddev,
  5672. const char *name)
  5673. {
  5674. struct md_thread *thread;
  5675. thread = kzalloc(sizeof(struct md_thread), GFP_KERNEL);
  5676. if (!thread)
  5677. return NULL;
  5678. init_waitqueue_head(&thread->wqueue);
  5679. thread->run = run;
  5680. thread->mddev = mddev;
  5681. thread->timeout = MAX_SCHEDULE_TIMEOUT;
  5682. thread->tsk = kthread_run(md_thread, thread,
  5683. "%s_%s",
  5684. mdname(thread->mddev),
  5685. name ?: mddev->pers->name);
  5686. if (IS_ERR(thread->tsk)) {
  5687. kfree(thread);
  5688. return NULL;
  5689. }
  5690. return thread;
  5691. }
  5692. void md_unregister_thread(struct md_thread **threadp)
  5693. {
  5694. struct md_thread *thread = *threadp;
  5695. if (!thread)
  5696. return;
  5697. pr_debug("interrupting MD-thread pid %d\n", task_pid_nr(thread->tsk));
  5698. /* Locking ensures that mddev_unlock does not wake_up a
  5699. * non-existent thread
  5700. */
  5701. spin_lock(&pers_lock);
  5702. *threadp = NULL;
  5703. spin_unlock(&pers_lock);
  5704. kthread_stop(thread->tsk);
  5705. kfree(thread);
  5706. }
  5707. void md_error(struct mddev *mddev, struct md_rdev *rdev)
  5708. {
  5709. if (!mddev) {
  5710. MD_BUG();
  5711. return;
  5712. }
  5713. if (!rdev || test_bit(Faulty, &rdev->flags))
  5714. return;
  5715. if (!mddev->pers || !mddev->pers->error_handler)
  5716. return;
  5717. mddev->pers->error_handler(mddev,rdev);
  5718. if (mddev->degraded)
  5719. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  5720. sysfs_notify_dirent_safe(rdev->sysfs_state);
  5721. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  5722. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  5723. md_wakeup_thread(mddev->thread);
  5724. if (mddev->event_work.func)
  5725. queue_work(md_misc_wq, &mddev->event_work);
  5726. md_new_event_inintr(mddev);
  5727. }
  5728. /* seq_file implementation /proc/mdstat */
  5729. static void status_unused(struct seq_file *seq)
  5730. {
  5731. int i = 0;
  5732. struct md_rdev *rdev;
  5733. seq_printf(seq, "unused devices: ");
  5734. list_for_each_entry(rdev, &pending_raid_disks, same_set) {
  5735. char b[BDEVNAME_SIZE];
  5736. i++;
  5737. seq_printf(seq, "%s ",
  5738. bdevname(rdev->bdev,b));
  5739. }
  5740. if (!i)
  5741. seq_printf(seq, "<none>");
  5742. seq_printf(seq, "\n");
  5743. }
  5744. static void status_resync(struct seq_file *seq, struct mddev * mddev)
  5745. {
  5746. sector_t max_sectors, resync, res;
  5747. unsigned long dt, db;
  5748. sector_t rt;
  5749. int scale;
  5750. unsigned int per_milli;
  5751. resync = mddev->curr_resync - atomic_read(&mddev->recovery_active);
  5752. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  5753. max_sectors = mddev->resync_max_sectors;
  5754. else
  5755. max_sectors = mddev->dev_sectors;
  5756. /*
  5757. * Should not happen.
  5758. */
  5759. if (!max_sectors) {
  5760. MD_BUG();
  5761. return;
  5762. }
  5763. /* Pick 'scale' such that (resync>>scale)*1000 will fit
  5764. * in a sector_t, and (max_sectors>>scale) will fit in a
  5765. * u32, as those are the requirements for sector_div.
  5766. * Thus 'scale' must be at least 10
  5767. */
  5768. scale = 10;
  5769. if (sizeof(sector_t) > sizeof(unsigned long)) {
  5770. while ( max_sectors/2 > (1ULL<<(scale+32)))
  5771. scale++;
  5772. }
  5773. res = (resync>>scale)*1000;
  5774. sector_div(res, (u32)((max_sectors>>scale)+1));
  5775. per_milli = res;
  5776. {
  5777. int i, x = per_milli/50, y = 20-x;
  5778. seq_printf(seq, "[");
  5779. for (i = 0; i < x; i++)
  5780. seq_printf(seq, "=");
  5781. seq_printf(seq, ">");
  5782. for (i = 0; i < y; i++)
  5783. seq_printf(seq, ".");
  5784. seq_printf(seq, "] ");
  5785. }
  5786. seq_printf(seq, " %s =%3u.%u%% (%llu/%llu)",
  5787. (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)?
  5788. "reshape" :
  5789. (test_bit(MD_RECOVERY_CHECK, &mddev->recovery)?
  5790. "check" :
  5791. (test_bit(MD_RECOVERY_SYNC, &mddev->recovery) ?
  5792. "resync" : "recovery"))),
  5793. per_milli/10, per_milli % 10,
  5794. (unsigned long long) resync/2,
  5795. (unsigned long long) max_sectors/2);
  5796. /*
  5797. * dt: time from mark until now
  5798. * db: blocks written from mark until now
  5799. * rt: remaining time
  5800. *
  5801. * rt is a sector_t, so could be 32bit or 64bit.
  5802. * So we divide before multiply in case it is 32bit and close
  5803. * to the limit.
  5804. * We scale the divisor (db) by 32 to avoid losing precision
  5805. * near the end of resync when the number of remaining sectors
  5806. * is close to 'db'.
  5807. * We then divide rt by 32 after multiplying by db to compensate.
  5808. * The '+1' avoids division by zero if db is very small.
  5809. */
  5810. dt = ((jiffies - mddev->resync_mark) / HZ);
  5811. if (!dt) dt++;
  5812. db = (mddev->curr_mark_cnt - atomic_read(&mddev->recovery_active))
  5813. - mddev->resync_mark_cnt;
  5814. rt = max_sectors - resync; /* number of remaining sectors */
  5815. sector_div(rt, db/32+1);
  5816. rt *= dt;
  5817. rt >>= 5;
  5818. seq_printf(seq, " finish=%lu.%lumin", (unsigned long)rt / 60,
  5819. ((unsigned long)rt % 60)/6);
  5820. seq_printf(seq, " speed=%ldK/sec", db/2/dt);
  5821. }
  5822. static void *md_seq_start(struct seq_file *seq, loff_t *pos)
  5823. {
  5824. struct list_head *tmp;
  5825. loff_t l = *pos;
  5826. struct mddev *mddev;
  5827. if (l >= 0x10000)
  5828. return NULL;
  5829. if (!l--)
  5830. /* header */
  5831. return (void*)1;
  5832. spin_lock(&all_mddevs_lock);
  5833. list_for_each(tmp,&all_mddevs)
  5834. if (!l--) {
  5835. mddev = list_entry(tmp, struct mddev, all_mddevs);
  5836. mddev_get(mddev);
  5837. spin_unlock(&all_mddevs_lock);
  5838. return mddev;
  5839. }
  5840. spin_unlock(&all_mddevs_lock);
  5841. if (!l--)
  5842. return (void*)2;/* tail */
  5843. return NULL;
  5844. }
  5845. static void *md_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  5846. {
  5847. struct list_head *tmp;
  5848. struct mddev *next_mddev, *mddev = v;
  5849. ++*pos;
  5850. if (v == (void*)2)
  5851. return NULL;
  5852. spin_lock(&all_mddevs_lock);
  5853. if (v == (void*)1)
  5854. tmp = all_mddevs.next;
  5855. else
  5856. tmp = mddev->all_mddevs.next;
  5857. if (tmp != &all_mddevs)
  5858. next_mddev = mddev_get(list_entry(tmp,struct mddev,all_mddevs));
  5859. else {
  5860. next_mddev = (void*)2;
  5861. *pos = 0x10000;
  5862. }
  5863. spin_unlock(&all_mddevs_lock);
  5864. if (v != (void*)1)
  5865. mddev_put(mddev);
  5866. return next_mddev;
  5867. }
  5868. static void md_seq_stop(struct seq_file *seq, void *v)
  5869. {
  5870. struct mddev *mddev = v;
  5871. if (mddev && v != (void*)1 && v != (void*)2)
  5872. mddev_put(mddev);
  5873. }
  5874. static int md_seq_show(struct seq_file *seq, void *v)
  5875. {
  5876. struct mddev *mddev = v;
  5877. sector_t sectors;
  5878. struct md_rdev *rdev;
  5879. struct bitmap *bitmap;
  5880. if (v == (void*)1) {
  5881. struct md_personality *pers;
  5882. seq_printf(seq, "Personalities : ");
  5883. spin_lock(&pers_lock);
  5884. list_for_each_entry(pers, &pers_list, list)
  5885. seq_printf(seq, "[%s] ", pers->name);
  5886. spin_unlock(&pers_lock);
  5887. seq_printf(seq, "\n");
  5888. seq->poll_event = atomic_read(&md_event_count);
  5889. return 0;
  5890. }
  5891. if (v == (void*)2) {
  5892. status_unused(seq);
  5893. return 0;
  5894. }
  5895. if (mddev_lock(mddev) < 0)
  5896. return -EINTR;
  5897. if (mddev->pers || mddev->raid_disks || !list_empty(&mddev->disks)) {
  5898. seq_printf(seq, "%s : %sactive", mdname(mddev),
  5899. mddev->pers ? "" : "in");
  5900. if (mddev->pers) {
  5901. if (mddev->ro==1)
  5902. seq_printf(seq, " (read-only)");
  5903. if (mddev->ro==2)
  5904. seq_printf(seq, " (auto-read-only)");
  5905. seq_printf(seq, " %s", mddev->pers->name);
  5906. }
  5907. sectors = 0;
  5908. list_for_each_entry(rdev, &mddev->disks, same_set) {
  5909. char b[BDEVNAME_SIZE];
  5910. seq_printf(seq, " %s[%d]",
  5911. bdevname(rdev->bdev,b), rdev->desc_nr);
  5912. if (test_bit(WriteMostly, &rdev->flags))
  5913. seq_printf(seq, "(W)");
  5914. if (test_bit(Faulty, &rdev->flags)) {
  5915. seq_printf(seq, "(F)");
  5916. continue;
  5917. } else if (rdev->raid_disk < 0)
  5918. seq_printf(seq, "(S)"); /* spare */
  5919. sectors += rdev->sectors;
  5920. }
  5921. if (!list_empty(&mddev->disks)) {
  5922. if (mddev->pers)
  5923. seq_printf(seq, "\n %llu blocks",
  5924. (unsigned long long)
  5925. mddev->array_sectors / 2);
  5926. else
  5927. seq_printf(seq, "\n %llu blocks",
  5928. (unsigned long long)sectors / 2);
  5929. }
  5930. if (mddev->persistent) {
  5931. if (mddev->major_version != 0 ||
  5932. mddev->minor_version != 90) {
  5933. seq_printf(seq," super %d.%d",
  5934. mddev->major_version,
  5935. mddev->minor_version);
  5936. }
  5937. } else if (mddev->external)
  5938. seq_printf(seq, " super external:%s",
  5939. mddev->metadata_type);
  5940. else
  5941. seq_printf(seq, " super non-persistent");
  5942. if (mddev->pers) {
  5943. mddev->pers->status(seq, mddev);
  5944. seq_printf(seq, "\n ");
  5945. if (mddev->pers->sync_request) {
  5946. if (mddev->curr_resync > 2) {
  5947. status_resync(seq, mddev);
  5948. seq_printf(seq, "\n ");
  5949. } else if (mddev->curr_resync == 1 || mddev->curr_resync == 2)
  5950. seq_printf(seq, "\tresync=DELAYED\n ");
  5951. else if (mddev->recovery_cp < MaxSector)
  5952. seq_printf(seq, "\tresync=PENDING\n ");
  5953. }
  5954. } else
  5955. seq_printf(seq, "\n ");
  5956. if ((bitmap = mddev->bitmap)) {
  5957. unsigned long chunk_kb;
  5958. unsigned long flags;
  5959. spin_lock_irqsave(&bitmap->lock, flags);
  5960. chunk_kb = mddev->bitmap_info.chunksize >> 10;
  5961. seq_printf(seq, "bitmap: %lu/%lu pages [%luKB], "
  5962. "%lu%s chunk",
  5963. bitmap->pages - bitmap->missing_pages,
  5964. bitmap->pages,
  5965. (bitmap->pages - bitmap->missing_pages)
  5966. << (PAGE_SHIFT - 10),
  5967. chunk_kb ? chunk_kb : mddev->bitmap_info.chunksize,
  5968. chunk_kb ? "KB" : "B");
  5969. if (bitmap->file) {
  5970. seq_printf(seq, ", file: ");
  5971. seq_path(seq, &bitmap->file->f_path, " \t\n");
  5972. }
  5973. seq_printf(seq, "\n");
  5974. spin_unlock_irqrestore(&bitmap->lock, flags);
  5975. }
  5976. seq_printf(seq, "\n");
  5977. }
  5978. mddev_unlock(mddev);
  5979. return 0;
  5980. }
  5981. static const struct seq_operations md_seq_ops = {
  5982. .start = md_seq_start,
  5983. .next = md_seq_next,
  5984. .stop = md_seq_stop,
  5985. .show = md_seq_show,
  5986. };
  5987. static int md_seq_open(struct inode *inode, struct file *file)
  5988. {
  5989. struct seq_file *seq;
  5990. int error;
  5991. error = seq_open(file, &md_seq_ops);
  5992. if (error)
  5993. return error;
  5994. seq = file->private_data;
  5995. seq->poll_event = atomic_read(&md_event_count);
  5996. return error;
  5997. }
  5998. static unsigned int mdstat_poll(struct file *filp, poll_table *wait)
  5999. {
  6000. struct seq_file *seq = filp->private_data;
  6001. int mask;
  6002. poll_wait(filp, &md_event_waiters, wait);
  6003. /* always allow read */
  6004. mask = POLLIN | POLLRDNORM;
  6005. if (seq->poll_event != atomic_read(&md_event_count))
  6006. mask |= POLLERR | POLLPRI;
  6007. return mask;
  6008. }
  6009. static const struct file_operations md_seq_fops = {
  6010. .owner = THIS_MODULE,
  6011. .open = md_seq_open,
  6012. .read = seq_read,
  6013. .llseek = seq_lseek,
  6014. .release = seq_release_private,
  6015. .poll = mdstat_poll,
  6016. };
  6017. int register_md_personality(struct md_personality *p)
  6018. {
  6019. spin_lock(&pers_lock);
  6020. list_add_tail(&p->list, &pers_list);
  6021. printk(KERN_INFO "md: %s personality registered for level %d\n", p->name, p->level);
  6022. spin_unlock(&pers_lock);
  6023. return 0;
  6024. }
  6025. int unregister_md_personality(struct md_personality *p)
  6026. {
  6027. printk(KERN_INFO "md: %s personality unregistered\n", p->name);
  6028. spin_lock(&pers_lock);
  6029. list_del_init(&p->list);
  6030. spin_unlock(&pers_lock);
  6031. return 0;
  6032. }
  6033. static int is_mddev_idle(struct mddev *mddev, int init)
  6034. {
  6035. struct md_rdev * rdev;
  6036. int idle;
  6037. int curr_events;
  6038. idle = 1;
  6039. rcu_read_lock();
  6040. rdev_for_each_rcu(rdev, mddev) {
  6041. struct gendisk *disk = rdev->bdev->bd_contains->bd_disk;
  6042. curr_events = (int)part_stat_read(&disk->part0, sectors[0]) +
  6043. (int)part_stat_read(&disk->part0, sectors[1]) -
  6044. atomic_read(&disk->sync_io);
  6045. /* sync IO will cause sync_io to increase before the disk_stats
  6046. * as sync_io is counted when a request starts, and
  6047. * disk_stats is counted when it completes.
  6048. * So resync activity will cause curr_events to be smaller than
  6049. * when there was no such activity.
  6050. * non-sync IO will cause disk_stat to increase without
  6051. * increasing sync_io so curr_events will (eventually)
  6052. * be larger than it was before. Once it becomes
  6053. * substantially larger, the test below will cause
  6054. * the array to appear non-idle, and resync will slow
  6055. * down.
  6056. * If there is a lot of outstanding resync activity when
  6057. * we set last_event to curr_events, then all that activity
  6058. * completing might cause the array to appear non-idle
  6059. * and resync will be slowed down even though there might
  6060. * not have been non-resync activity. This will only
  6061. * happen once though. 'last_events' will soon reflect
  6062. * the state where there is little or no outstanding
  6063. * resync requests, and further resync activity will
  6064. * always make curr_events less than last_events.
  6065. *
  6066. */
  6067. if (init || curr_events - rdev->last_events > 64) {
  6068. rdev->last_events = curr_events;
  6069. idle = 0;
  6070. }
  6071. }
  6072. rcu_read_unlock();
  6073. return idle;
  6074. }
  6075. void md_done_sync(struct mddev *mddev, int blocks, int ok)
  6076. {
  6077. /* another "blocks" (512byte) blocks have been synced */
  6078. atomic_sub(blocks, &mddev->recovery_active);
  6079. wake_up(&mddev->recovery_wait);
  6080. if (!ok) {
  6081. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6082. md_wakeup_thread(mddev->thread);
  6083. // stop recovery, signal do_sync ....
  6084. }
  6085. }
  6086. /* md_write_start(mddev, bi)
  6087. * If we need to update some array metadata (e.g. 'active' flag
  6088. * in superblock) before writing, schedule a superblock update
  6089. * and wait for it to complete.
  6090. */
  6091. void md_write_start(struct mddev *mddev, struct bio *bi)
  6092. {
  6093. int did_change = 0;
  6094. if (bio_data_dir(bi) != WRITE)
  6095. return;
  6096. BUG_ON(mddev->ro == 1);
  6097. if (mddev->ro == 2) {
  6098. /* need to switch to read/write */
  6099. mddev->ro = 0;
  6100. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6101. md_wakeup_thread(mddev->thread);
  6102. md_wakeup_thread(mddev->sync_thread);
  6103. did_change = 1;
  6104. }
  6105. atomic_inc(&mddev->writes_pending);
  6106. if (mddev->safemode == 1)
  6107. mddev->safemode = 0;
  6108. if (mddev->in_sync) {
  6109. spin_lock_irq(&mddev->write_lock);
  6110. if (mddev->in_sync) {
  6111. mddev->in_sync = 0;
  6112. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6113. set_bit(MD_CHANGE_PENDING, &mddev->flags);
  6114. md_wakeup_thread(mddev->thread);
  6115. did_change = 1;
  6116. }
  6117. spin_unlock_irq(&mddev->write_lock);
  6118. }
  6119. if (did_change)
  6120. sysfs_notify_dirent_safe(mddev->sysfs_state);
  6121. wait_event(mddev->sb_wait,
  6122. !test_bit(MD_CHANGE_PENDING, &mddev->flags));
  6123. }
  6124. void md_write_end(struct mddev *mddev)
  6125. {
  6126. if (atomic_dec_and_test(&mddev->writes_pending)) {
  6127. if (mddev->safemode == 2)
  6128. md_wakeup_thread(mddev->thread);
  6129. else if (mddev->safemode_delay)
  6130. mod_timer(&mddev->safemode_timer, jiffies + mddev->safemode_delay);
  6131. }
  6132. }
  6133. /* md_allow_write(mddev)
  6134. * Calling this ensures that the array is marked 'active' so that writes
  6135. * may proceed without blocking. It is important to call this before
  6136. * attempting a GFP_KERNEL allocation while holding the mddev lock.
  6137. * Must be called with mddev_lock held.
  6138. *
  6139. * In the ->external case MD_CHANGE_CLEAN can not be cleared until mddev->lock
  6140. * is dropped, so return -EAGAIN after notifying userspace.
  6141. */
  6142. int md_allow_write(struct mddev *mddev)
  6143. {
  6144. if (!mddev->pers)
  6145. return 0;
  6146. if (mddev->ro)
  6147. return 0;
  6148. if (!mddev->pers->sync_request)
  6149. return 0;
  6150. spin_lock_irq(&mddev->write_lock);
  6151. if (mddev->in_sync) {
  6152. mddev->in_sync = 0;
  6153. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6154. set_bit(MD_CHANGE_PENDING, &mddev->flags);
  6155. if (mddev->safemode_delay &&
  6156. mddev->safemode == 0)
  6157. mddev->safemode = 1;
  6158. spin_unlock_irq(&mddev->write_lock);
  6159. md_update_sb(mddev, 0);
  6160. sysfs_notify_dirent_safe(mddev->sysfs_state);
  6161. } else
  6162. spin_unlock_irq(&mddev->write_lock);
  6163. if (test_bit(MD_CHANGE_PENDING, &mddev->flags))
  6164. return -EAGAIN;
  6165. else
  6166. return 0;
  6167. }
  6168. EXPORT_SYMBOL_GPL(md_allow_write);
  6169. #define SYNC_MARKS 10
  6170. #define SYNC_MARK_STEP (3*HZ)
  6171. void md_do_sync(struct mddev *mddev)
  6172. {
  6173. struct mddev *mddev2;
  6174. unsigned int currspeed = 0,
  6175. window;
  6176. sector_t max_sectors,j, io_sectors;
  6177. unsigned long mark[SYNC_MARKS];
  6178. sector_t mark_cnt[SYNC_MARKS];
  6179. int last_mark,m;
  6180. struct list_head *tmp;
  6181. sector_t last_check;
  6182. int skipped = 0;
  6183. struct md_rdev *rdev;
  6184. char *desc;
  6185. /* just incase thread restarts... */
  6186. if (test_bit(MD_RECOVERY_DONE, &mddev->recovery))
  6187. return;
  6188. if (mddev->ro) /* never try to sync a read-only array */
  6189. return;
  6190. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  6191. if (test_bit(MD_RECOVERY_CHECK, &mddev->recovery))
  6192. desc = "data-check";
  6193. else if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6194. desc = "requested-resync";
  6195. else
  6196. desc = "resync";
  6197. } else if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  6198. desc = "reshape";
  6199. else
  6200. desc = "recovery";
  6201. /* we overload curr_resync somewhat here.
  6202. * 0 == not engaged in resync at all
  6203. * 2 == checking that there is no conflict with another sync
  6204. * 1 == like 2, but have yielded to allow conflicting resync to
  6205. * commense
  6206. * other == active in resync - this many blocks
  6207. *
  6208. * Before starting a resync we must have set curr_resync to
  6209. * 2, and then checked that every "conflicting" array has curr_resync
  6210. * less than ours. When we find one that is the same or higher
  6211. * we wait on resync_wait. To avoid deadlock, we reduce curr_resync
  6212. * to 1 if we choose to yield (based arbitrarily on address of mddev structure).
  6213. * This will mean we have to start checking from the beginning again.
  6214. *
  6215. */
  6216. do {
  6217. mddev->curr_resync = 2;
  6218. try_again:
  6219. if (kthread_should_stop())
  6220. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6221. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery))
  6222. goto skip;
  6223. for_each_mddev(mddev2, tmp) {
  6224. if (mddev2 == mddev)
  6225. continue;
  6226. if (!mddev->parallel_resync
  6227. && mddev2->curr_resync
  6228. && match_mddev_units(mddev, mddev2)) {
  6229. DEFINE_WAIT(wq);
  6230. if (mddev < mddev2 && mddev->curr_resync == 2) {
  6231. /* arbitrarily yield */
  6232. mddev->curr_resync = 1;
  6233. wake_up(&resync_wait);
  6234. }
  6235. if (mddev > mddev2 && mddev->curr_resync == 1)
  6236. /* no need to wait here, we can wait the next
  6237. * time 'round when curr_resync == 2
  6238. */
  6239. continue;
  6240. /* We need to wait 'interruptible' so as not to
  6241. * contribute to the load average, and not to
  6242. * be caught by 'softlockup'
  6243. */
  6244. prepare_to_wait(&resync_wait, &wq, TASK_INTERRUPTIBLE);
  6245. if (!kthread_should_stop() &&
  6246. mddev2->curr_resync >= mddev->curr_resync) {
  6247. printk(KERN_INFO "md: delaying %s of %s"
  6248. " until %s has finished (they"
  6249. " share one or more physical units)\n",
  6250. desc, mdname(mddev), mdname(mddev2));
  6251. mddev_put(mddev2);
  6252. if (signal_pending(current))
  6253. flush_signals(current);
  6254. schedule();
  6255. finish_wait(&resync_wait, &wq);
  6256. goto try_again;
  6257. }
  6258. finish_wait(&resync_wait, &wq);
  6259. }
  6260. }
  6261. } while (mddev->curr_resync < 2);
  6262. j = 0;
  6263. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  6264. /* resync follows the size requested by the personality,
  6265. * which defaults to physical size, but can be virtual size
  6266. */
  6267. max_sectors = mddev->resync_max_sectors;
  6268. mddev->resync_mismatches = 0;
  6269. /* we don't use the checkpoint if there's a bitmap */
  6270. if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6271. j = mddev->resync_min;
  6272. else if (!mddev->bitmap)
  6273. j = mddev->recovery_cp;
  6274. } else if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  6275. max_sectors = mddev->dev_sectors;
  6276. else {
  6277. /* recovery follows the physical size of devices */
  6278. max_sectors = mddev->dev_sectors;
  6279. j = MaxSector;
  6280. rcu_read_lock();
  6281. list_for_each_entry_rcu(rdev, &mddev->disks, same_set)
  6282. if (rdev->raid_disk >= 0 &&
  6283. !test_bit(Faulty, &rdev->flags) &&
  6284. !test_bit(In_sync, &rdev->flags) &&
  6285. rdev->recovery_offset < j)
  6286. j = rdev->recovery_offset;
  6287. rcu_read_unlock();
  6288. }
  6289. printk(KERN_INFO "md: %s of RAID array %s\n", desc, mdname(mddev));
  6290. printk(KERN_INFO "md: minimum _guaranteed_ speed:"
  6291. " %d KB/sec/disk.\n", speed_min(mddev));
  6292. printk(KERN_INFO "md: using maximum available idle IO bandwidth "
  6293. "(but not more than %d KB/sec) for %s.\n",
  6294. speed_max(mddev), desc);
  6295. is_mddev_idle(mddev, 1); /* this initializes IO event counters */
  6296. io_sectors = 0;
  6297. for (m = 0; m < SYNC_MARKS; m++) {
  6298. mark[m] = jiffies;
  6299. mark_cnt[m] = io_sectors;
  6300. }
  6301. last_mark = 0;
  6302. mddev->resync_mark = mark[last_mark];
  6303. mddev->resync_mark_cnt = mark_cnt[last_mark];
  6304. /*
  6305. * Tune reconstruction:
  6306. */
  6307. window = 32*(PAGE_SIZE/512);
  6308. printk(KERN_INFO "md: using %dk window, over a total of %lluk.\n",
  6309. window/2, (unsigned long long)max_sectors/2);
  6310. atomic_set(&mddev->recovery_active, 0);
  6311. last_check = 0;
  6312. if (j>2) {
  6313. printk(KERN_INFO
  6314. "md: resuming %s of %s from checkpoint.\n",
  6315. desc, mdname(mddev));
  6316. mddev->curr_resync = j;
  6317. }
  6318. mddev->curr_resync_completed = j;
  6319. while (j < max_sectors) {
  6320. sector_t sectors;
  6321. skipped = 0;
  6322. if (!test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery) &&
  6323. ((mddev->curr_resync > mddev->curr_resync_completed &&
  6324. (mddev->curr_resync - mddev->curr_resync_completed)
  6325. > (max_sectors >> 4)) ||
  6326. (j - mddev->curr_resync_completed)*2
  6327. >= mddev->resync_max - mddev->curr_resync_completed
  6328. )) {
  6329. /* time to update curr_resync_completed */
  6330. wait_event(mddev->recovery_wait,
  6331. atomic_read(&mddev->recovery_active) == 0);
  6332. mddev->curr_resync_completed = j;
  6333. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6334. sysfs_notify(&mddev->kobj, NULL, "sync_completed");
  6335. }
  6336. while (j >= mddev->resync_max && !kthread_should_stop()) {
  6337. /* As this condition is controlled by user-space,
  6338. * we can block indefinitely, so use '_interruptible'
  6339. * to avoid triggering warnings.
  6340. */
  6341. flush_signals(current); /* just in case */
  6342. wait_event_interruptible(mddev->recovery_wait,
  6343. mddev->resync_max > j
  6344. || kthread_should_stop());
  6345. }
  6346. if (kthread_should_stop())
  6347. goto interrupted;
  6348. sectors = mddev->pers->sync_request(mddev, j, &skipped,
  6349. currspeed < speed_min(mddev));
  6350. if (sectors == 0) {
  6351. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6352. goto out;
  6353. }
  6354. if (!skipped) { /* actual IO requested */
  6355. io_sectors += sectors;
  6356. atomic_add(sectors, &mddev->recovery_active);
  6357. }
  6358. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery))
  6359. break;
  6360. j += sectors;
  6361. if (j>1) mddev->curr_resync = j;
  6362. mddev->curr_mark_cnt = io_sectors;
  6363. if (last_check == 0)
  6364. /* this is the earliest that rebuild will be
  6365. * visible in /proc/mdstat
  6366. */
  6367. md_new_event(mddev);
  6368. if (last_check + window > io_sectors || j == max_sectors)
  6369. continue;
  6370. last_check = io_sectors;
  6371. repeat:
  6372. if (time_after_eq(jiffies, mark[last_mark] + SYNC_MARK_STEP )) {
  6373. /* step marks */
  6374. int next = (last_mark+1) % SYNC_MARKS;
  6375. mddev->resync_mark = mark[next];
  6376. mddev->resync_mark_cnt = mark_cnt[next];
  6377. mark[next] = jiffies;
  6378. mark_cnt[next] = io_sectors - atomic_read(&mddev->recovery_active);
  6379. last_mark = next;
  6380. }
  6381. if (kthread_should_stop())
  6382. goto interrupted;
  6383. /*
  6384. * this loop exits only if either when we are slower than
  6385. * the 'hard' speed limit, or the system was IO-idle for
  6386. * a jiffy.
  6387. * the system might be non-idle CPU-wise, but we only care
  6388. * about not overloading the IO subsystem. (things like an
  6389. * e2fsck being done on the RAID array should execute fast)
  6390. */
  6391. cond_resched();
  6392. currspeed = ((unsigned long)(io_sectors-mddev->resync_mark_cnt))/2
  6393. /((jiffies-mddev->resync_mark)/HZ +1) +1;
  6394. if (currspeed > speed_min(mddev)) {
  6395. if ((currspeed > speed_max(mddev)) ||
  6396. !is_mddev_idle(mddev, 0)) {
  6397. msleep(500);
  6398. goto repeat;
  6399. }
  6400. }
  6401. }
  6402. printk(KERN_INFO "md: %s: %s done.\n",mdname(mddev), desc);
  6403. /*
  6404. * this also signals 'finished resyncing' to md_stop
  6405. */
  6406. out:
  6407. wait_event(mddev->recovery_wait, !atomic_read(&mddev->recovery_active));
  6408. /* tell personality that we are finished */
  6409. mddev->pers->sync_request(mddev, max_sectors, &skipped, 1);
  6410. if (!test_bit(MD_RECOVERY_CHECK, &mddev->recovery) &&
  6411. mddev->curr_resync > 2) {
  6412. if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  6413. if (test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
  6414. if (mddev->curr_resync >= mddev->recovery_cp) {
  6415. printk(KERN_INFO
  6416. "md: checkpointing %s of %s.\n",
  6417. desc, mdname(mddev));
  6418. mddev->recovery_cp = mddev->curr_resync;
  6419. }
  6420. } else
  6421. mddev->recovery_cp = MaxSector;
  6422. } else {
  6423. if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery))
  6424. mddev->curr_resync = MaxSector;
  6425. rcu_read_lock();
  6426. list_for_each_entry_rcu(rdev, &mddev->disks, same_set)
  6427. if (rdev->raid_disk >= 0 &&
  6428. mddev->delta_disks >= 0 &&
  6429. !test_bit(Faulty, &rdev->flags) &&
  6430. !test_bit(In_sync, &rdev->flags) &&
  6431. rdev->recovery_offset < mddev->curr_resync)
  6432. rdev->recovery_offset = mddev->curr_resync;
  6433. rcu_read_unlock();
  6434. }
  6435. }
  6436. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  6437. skip:
  6438. if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
  6439. /* We completed so min/max setting can be forgotten if used. */
  6440. if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6441. mddev->resync_min = 0;
  6442. mddev->resync_max = MaxSector;
  6443. } else if (test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery))
  6444. mddev->resync_min = mddev->curr_resync_completed;
  6445. mddev->curr_resync = 0;
  6446. wake_up(&resync_wait);
  6447. set_bit(MD_RECOVERY_DONE, &mddev->recovery);
  6448. md_wakeup_thread(mddev->thread);
  6449. return;
  6450. interrupted:
  6451. /*
  6452. * got a signal, exit.
  6453. */
  6454. printk(KERN_INFO
  6455. "md: md_do_sync() got signal ... exiting\n");
  6456. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6457. goto out;
  6458. }
  6459. EXPORT_SYMBOL_GPL(md_do_sync);
  6460. static int remove_and_add_spares(struct mddev *mddev)
  6461. {
  6462. struct md_rdev *rdev;
  6463. int spares = 0;
  6464. mddev->curr_resync_completed = 0;
  6465. list_for_each_entry(rdev, &mddev->disks, same_set)
  6466. if (rdev->raid_disk >= 0 &&
  6467. !test_bit(Blocked, &rdev->flags) &&
  6468. (test_bit(Faulty, &rdev->flags) ||
  6469. ! test_bit(In_sync, &rdev->flags)) &&
  6470. atomic_read(&rdev->nr_pending)==0) {
  6471. if (mddev->pers->hot_remove_disk(
  6472. mddev, rdev->raid_disk)==0) {
  6473. sysfs_unlink_rdev(mddev, rdev);
  6474. rdev->raid_disk = -1;
  6475. }
  6476. }
  6477. if (mddev->degraded) {
  6478. list_for_each_entry(rdev, &mddev->disks, same_set) {
  6479. if (rdev->raid_disk >= 0 &&
  6480. !test_bit(In_sync, &rdev->flags) &&
  6481. !test_bit(Faulty, &rdev->flags))
  6482. spares++;
  6483. if (rdev->raid_disk < 0
  6484. && !test_bit(Faulty, &rdev->flags)) {
  6485. rdev->recovery_offset = 0;
  6486. if (mddev->pers->
  6487. hot_add_disk(mddev, rdev) == 0) {
  6488. if (sysfs_link_rdev(mddev, rdev))
  6489. /* failure here is OK */;
  6490. spares++;
  6491. md_new_event(mddev);
  6492. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  6493. } else
  6494. break;
  6495. }
  6496. }
  6497. }
  6498. return spares;
  6499. }
  6500. static void reap_sync_thread(struct mddev *mddev)
  6501. {
  6502. struct md_rdev *rdev;
  6503. /* resync has finished, collect result */
  6504. md_unregister_thread(&mddev->sync_thread);
  6505. if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery) &&
  6506. !test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery)) {
  6507. /* success...*/
  6508. /* activate any spares */
  6509. if (mddev->pers->spare_active(mddev))
  6510. sysfs_notify(&mddev->kobj, NULL,
  6511. "degraded");
  6512. }
  6513. if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery) &&
  6514. mddev->pers->finish_reshape)
  6515. mddev->pers->finish_reshape(mddev);
  6516. /* If array is no-longer degraded, then any saved_raid_disk
  6517. * information must be scrapped. Also if any device is now
  6518. * In_sync we must scrape the saved_raid_disk for that device
  6519. * do the superblock for an incrementally recovered device
  6520. * written out.
  6521. */
  6522. list_for_each_entry(rdev, &mddev->disks, same_set)
  6523. if (!mddev->degraded ||
  6524. test_bit(In_sync, &rdev->flags))
  6525. rdev->saved_raid_disk = -1;
  6526. md_update_sb(mddev, 1);
  6527. clear_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6528. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6529. clear_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  6530. clear_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  6531. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  6532. /* flag recovery needed just to double check */
  6533. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6534. sysfs_notify_dirent_safe(mddev->sysfs_action);
  6535. md_new_event(mddev);
  6536. if (mddev->event_work.func)
  6537. queue_work(md_misc_wq, &mddev->event_work);
  6538. }
  6539. /*
  6540. * This routine is regularly called by all per-raid-array threads to
  6541. * deal with generic issues like resync and super-block update.
  6542. * Raid personalities that don't have a thread (linear/raid0) do not
  6543. * need this as they never do any recovery or update the superblock.
  6544. *
  6545. * It does not do any resync itself, but rather "forks" off other threads
  6546. * to do that as needed.
  6547. * When it is determined that resync is needed, we set MD_RECOVERY_RUNNING in
  6548. * "->recovery" and create a thread at ->sync_thread.
  6549. * When the thread finishes it sets MD_RECOVERY_DONE
  6550. * and wakeups up this thread which will reap the thread and finish up.
  6551. * This thread also removes any faulty devices (with nr_pending == 0).
  6552. *
  6553. * The overall approach is:
  6554. * 1/ if the superblock needs updating, update it.
  6555. * 2/ If a recovery thread is running, don't do anything else.
  6556. * 3/ If recovery has finished, clean up, possibly marking spares active.
  6557. * 4/ If there are any faulty devices, remove them.
  6558. * 5/ If array is degraded, try to add spares devices
  6559. * 6/ If array has spares or is not in-sync, start a resync thread.
  6560. */
  6561. void md_check_recovery(struct mddev *mddev)
  6562. {
  6563. if (mddev->suspended)
  6564. return;
  6565. if (mddev->bitmap)
  6566. bitmap_daemon_work(mddev);
  6567. if (signal_pending(current)) {
  6568. if (mddev->pers->sync_request && !mddev->external) {
  6569. printk(KERN_INFO "md: %s in immediate safe mode\n",
  6570. mdname(mddev));
  6571. mddev->safemode = 2;
  6572. }
  6573. flush_signals(current);
  6574. }
  6575. if (mddev->ro && !test_bit(MD_RECOVERY_NEEDED, &mddev->recovery))
  6576. return;
  6577. if ( ! (
  6578. (mddev->flags & ~ (1<<MD_CHANGE_PENDING)) ||
  6579. test_bit(MD_RECOVERY_NEEDED, &mddev->recovery) ||
  6580. test_bit(MD_RECOVERY_DONE, &mddev->recovery) ||
  6581. (mddev->external == 0 && mddev->safemode == 1) ||
  6582. (mddev->safemode == 2 && ! atomic_read(&mddev->writes_pending)
  6583. && !mddev->in_sync && mddev->recovery_cp == MaxSector)
  6584. ))
  6585. return;
  6586. if (mddev_trylock(mddev)) {
  6587. int spares = 0;
  6588. if (mddev->ro) {
  6589. /* Only thing we do on a ro array is remove
  6590. * failed devices.
  6591. */
  6592. struct md_rdev *rdev;
  6593. list_for_each_entry(rdev, &mddev->disks, same_set)
  6594. if (rdev->raid_disk >= 0 &&
  6595. !test_bit(Blocked, &rdev->flags) &&
  6596. test_bit(Faulty, &rdev->flags) &&
  6597. atomic_read(&rdev->nr_pending)==0) {
  6598. if (mddev->pers->hot_remove_disk(
  6599. mddev, rdev->raid_disk)==0) {
  6600. sysfs_unlink_rdev(mddev, rdev);
  6601. rdev->raid_disk = -1;
  6602. }
  6603. }
  6604. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6605. goto unlock;
  6606. }
  6607. if (!mddev->external) {
  6608. int did_change = 0;
  6609. spin_lock_irq(&mddev->write_lock);
  6610. if (mddev->safemode &&
  6611. !atomic_read(&mddev->writes_pending) &&
  6612. !mddev->in_sync &&
  6613. mddev->recovery_cp == MaxSector) {
  6614. mddev->in_sync = 1;
  6615. did_change = 1;
  6616. set_bit(MD_CHANGE_CLEAN, &mddev->flags);
  6617. }
  6618. if (mddev->safemode == 1)
  6619. mddev->safemode = 0;
  6620. spin_unlock_irq(&mddev->write_lock);
  6621. if (did_change)
  6622. sysfs_notify_dirent_safe(mddev->sysfs_state);
  6623. }
  6624. if (mddev->flags)
  6625. md_update_sb(mddev, 0);
  6626. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery) &&
  6627. !test_bit(MD_RECOVERY_DONE, &mddev->recovery)) {
  6628. /* resync/recovery still happening */
  6629. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6630. goto unlock;
  6631. }
  6632. if (mddev->sync_thread) {
  6633. reap_sync_thread(mddev);
  6634. goto unlock;
  6635. }
  6636. /* Set RUNNING before clearing NEEDED to avoid
  6637. * any transients in the value of "sync_action".
  6638. */
  6639. set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6640. clear_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  6641. /* Clear some bits that don't mean anything, but
  6642. * might be left set
  6643. */
  6644. clear_bit(MD_RECOVERY_INTR, &mddev->recovery);
  6645. clear_bit(MD_RECOVERY_DONE, &mddev->recovery);
  6646. if (test_bit(MD_RECOVERY_FROZEN, &mddev->recovery))
  6647. goto unlock;
  6648. /* no recovery is running.
  6649. * remove any failed drives, then
  6650. * add spares if possible.
  6651. * Spare are also removed and re-added, to allow
  6652. * the personality to fail the re-add.
  6653. */
  6654. if (mddev->reshape_position != MaxSector) {
  6655. if (mddev->pers->check_reshape == NULL ||
  6656. mddev->pers->check_reshape(mddev) != 0)
  6657. /* Cannot proceed */
  6658. goto unlock;
  6659. set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  6660. clear_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  6661. } else if ((spares = remove_and_add_spares(mddev))) {
  6662. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6663. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  6664. clear_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  6665. set_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  6666. } else if (mddev->recovery_cp < MaxSector) {
  6667. set_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6668. clear_bit(MD_RECOVERY_RECOVER, &mddev->recovery);
  6669. } else if (!test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
  6670. /* nothing to be done ... */
  6671. goto unlock;
  6672. if (mddev->pers->sync_request) {
  6673. if (spares && mddev->bitmap && ! mddev->bitmap->file) {
  6674. /* We are adding a device or devices to an array
  6675. * which has the bitmap stored on all devices.
  6676. * So make sure all bitmap pages get written
  6677. */
  6678. bitmap_write_all(mddev->bitmap);
  6679. }
  6680. mddev->sync_thread = md_register_thread(md_do_sync,
  6681. mddev,
  6682. "resync");
  6683. if (!mddev->sync_thread) {
  6684. printk(KERN_ERR "%s: could not start resync"
  6685. " thread...\n",
  6686. mdname(mddev));
  6687. /* leave the spares where they are, it shouldn't hurt */
  6688. clear_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6689. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  6690. clear_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  6691. clear_bit(MD_RECOVERY_REQUESTED, &mddev->recovery);
  6692. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  6693. } else
  6694. md_wakeup_thread(mddev->sync_thread);
  6695. sysfs_notify_dirent_safe(mddev->sysfs_action);
  6696. md_new_event(mddev);
  6697. }
  6698. unlock:
  6699. if (!mddev->sync_thread) {
  6700. clear_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  6701. if (test_and_clear_bit(MD_RECOVERY_RECOVER,
  6702. &mddev->recovery))
  6703. if (mddev->sysfs_action)
  6704. sysfs_notify_dirent_safe(mddev->sysfs_action);
  6705. }
  6706. mddev_unlock(mddev);
  6707. }
  6708. }
  6709. void md_wait_for_blocked_rdev(struct md_rdev *rdev, struct mddev *mddev)
  6710. {
  6711. sysfs_notify_dirent_safe(rdev->sysfs_state);
  6712. wait_event_timeout(rdev->blocked_wait,
  6713. !test_bit(Blocked, &rdev->flags) &&
  6714. !test_bit(BlockedBadBlocks, &rdev->flags),
  6715. msecs_to_jiffies(5000));
  6716. rdev_dec_pending(rdev, mddev);
  6717. }
  6718. EXPORT_SYMBOL(md_wait_for_blocked_rdev);
  6719. /* Bad block management.
  6720. * We can record which blocks on each device are 'bad' and so just
  6721. * fail those blocks, or that stripe, rather than the whole device.
  6722. * Entries in the bad-block table are 64bits wide. This comprises:
  6723. * Length of bad-range, in sectors: 0-511 for lengths 1-512
  6724. * Start of bad-range, sector offset, 54 bits (allows 8 exbibytes)
  6725. * A 'shift' can be set so that larger blocks are tracked and
  6726. * consequently larger devices can be covered.
  6727. * 'Acknowledged' flag - 1 bit. - the most significant bit.
  6728. *
  6729. * Locking of the bad-block table uses a seqlock so md_is_badblock
  6730. * might need to retry if it is very unlucky.
  6731. * We will sometimes want to check for bad blocks in a bi_end_io function,
  6732. * so we use the write_seqlock_irq variant.
  6733. *
  6734. * When looking for a bad block we specify a range and want to
  6735. * know if any block in the range is bad. So we binary-search
  6736. * to the last range that starts at-or-before the given endpoint,
  6737. * (or "before the sector after the target range")
  6738. * then see if it ends after the given start.
  6739. * We return
  6740. * 0 if there are no known bad blocks in the range
  6741. * 1 if there are known bad block which are all acknowledged
  6742. * -1 if there are bad blocks which have not yet been acknowledged in metadata.
  6743. * plus the start/length of the first bad section we overlap.
  6744. */
  6745. int md_is_badblock(struct badblocks *bb, sector_t s, int sectors,
  6746. sector_t *first_bad, int *bad_sectors)
  6747. {
  6748. int hi;
  6749. int lo = 0;
  6750. u64 *p = bb->page;
  6751. int rv = 0;
  6752. sector_t target = s + sectors;
  6753. unsigned seq;
  6754. if (bb->shift > 0) {
  6755. /* round the start down, and the end up */
  6756. s >>= bb->shift;
  6757. target += (1<<bb->shift) - 1;
  6758. target >>= bb->shift;
  6759. sectors = target - s;
  6760. }
  6761. /* 'target' is now the first block after the bad range */
  6762. retry:
  6763. seq = read_seqbegin(&bb->lock);
  6764. hi = bb->count;
  6765. /* Binary search between lo and hi for 'target'
  6766. * i.e. for the last range that starts before 'target'
  6767. */
  6768. /* INVARIANT: ranges before 'lo' and at-or-after 'hi'
  6769. * are known not to be the last range before target.
  6770. * VARIANT: hi-lo is the number of possible
  6771. * ranges, and decreases until it reaches 1
  6772. */
  6773. while (hi - lo > 1) {
  6774. int mid = (lo + hi) / 2;
  6775. sector_t a = BB_OFFSET(p[mid]);
  6776. if (a < target)
  6777. /* This could still be the one, earlier ranges
  6778. * could not. */
  6779. lo = mid;
  6780. else
  6781. /* This and later ranges are definitely out. */
  6782. hi = mid;
  6783. }
  6784. /* 'lo' might be the last that started before target, but 'hi' isn't */
  6785. if (hi > lo) {
  6786. /* need to check all range that end after 's' to see if
  6787. * any are unacknowledged.
  6788. */
  6789. while (lo >= 0 &&
  6790. BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > s) {
  6791. if (BB_OFFSET(p[lo]) < target) {
  6792. /* starts before the end, and finishes after
  6793. * the start, so they must overlap
  6794. */
  6795. if (rv != -1 && BB_ACK(p[lo]))
  6796. rv = 1;
  6797. else
  6798. rv = -1;
  6799. *first_bad = BB_OFFSET(p[lo]);
  6800. *bad_sectors = BB_LEN(p[lo]);
  6801. }
  6802. lo--;
  6803. }
  6804. }
  6805. if (read_seqretry(&bb->lock, seq))
  6806. goto retry;
  6807. return rv;
  6808. }
  6809. EXPORT_SYMBOL_GPL(md_is_badblock);
  6810. /*
  6811. * Add a range of bad blocks to the table.
  6812. * This might extend the table, or might contract it
  6813. * if two adjacent ranges can be merged.
  6814. * We binary-search to find the 'insertion' point, then
  6815. * decide how best to handle it.
  6816. */
  6817. static int md_set_badblocks(struct badblocks *bb, sector_t s, int sectors,
  6818. int acknowledged)
  6819. {
  6820. u64 *p;
  6821. int lo, hi;
  6822. int rv = 1;
  6823. if (bb->shift < 0)
  6824. /* badblocks are disabled */
  6825. return 0;
  6826. if (bb->shift) {
  6827. /* round the start down, and the end up */
  6828. sector_t next = s + sectors;
  6829. s >>= bb->shift;
  6830. next += (1<<bb->shift) - 1;
  6831. next >>= bb->shift;
  6832. sectors = next - s;
  6833. }
  6834. write_seqlock_irq(&bb->lock);
  6835. p = bb->page;
  6836. lo = 0;
  6837. hi = bb->count;
  6838. /* Find the last range that starts at-or-before 's' */
  6839. while (hi - lo > 1) {
  6840. int mid = (lo + hi) / 2;
  6841. sector_t a = BB_OFFSET(p[mid]);
  6842. if (a <= s)
  6843. lo = mid;
  6844. else
  6845. hi = mid;
  6846. }
  6847. if (hi > lo && BB_OFFSET(p[lo]) > s)
  6848. hi = lo;
  6849. if (hi > lo) {
  6850. /* we found a range that might merge with the start
  6851. * of our new range
  6852. */
  6853. sector_t a = BB_OFFSET(p[lo]);
  6854. sector_t e = a + BB_LEN(p[lo]);
  6855. int ack = BB_ACK(p[lo]);
  6856. if (e >= s) {
  6857. /* Yes, we can merge with a previous range */
  6858. if (s == a && s + sectors >= e)
  6859. /* new range covers old */
  6860. ack = acknowledged;
  6861. else
  6862. ack = ack && acknowledged;
  6863. if (e < s + sectors)
  6864. e = s + sectors;
  6865. if (e - a <= BB_MAX_LEN) {
  6866. p[lo] = BB_MAKE(a, e-a, ack);
  6867. s = e;
  6868. } else {
  6869. /* does not all fit in one range,
  6870. * make p[lo] maximal
  6871. */
  6872. if (BB_LEN(p[lo]) != BB_MAX_LEN)
  6873. p[lo] = BB_MAKE(a, BB_MAX_LEN, ack);
  6874. s = a + BB_MAX_LEN;
  6875. }
  6876. sectors = e - s;
  6877. }
  6878. }
  6879. if (sectors && hi < bb->count) {
  6880. /* 'hi' points to the first range that starts after 's'.
  6881. * Maybe we can merge with the start of that range */
  6882. sector_t a = BB_OFFSET(p[hi]);
  6883. sector_t e = a + BB_LEN(p[hi]);
  6884. int ack = BB_ACK(p[hi]);
  6885. if (a <= s + sectors) {
  6886. /* merging is possible */
  6887. if (e <= s + sectors) {
  6888. /* full overlap */
  6889. e = s + sectors;
  6890. ack = acknowledged;
  6891. } else
  6892. ack = ack && acknowledged;
  6893. a = s;
  6894. if (e - a <= BB_MAX_LEN) {
  6895. p[hi] = BB_MAKE(a, e-a, ack);
  6896. s = e;
  6897. } else {
  6898. p[hi] = BB_MAKE(a, BB_MAX_LEN, ack);
  6899. s = a + BB_MAX_LEN;
  6900. }
  6901. sectors = e - s;
  6902. lo = hi;
  6903. hi++;
  6904. }
  6905. }
  6906. if (sectors == 0 && hi < bb->count) {
  6907. /* we might be able to combine lo and hi */
  6908. /* Note: 's' is at the end of 'lo' */
  6909. sector_t a = BB_OFFSET(p[hi]);
  6910. int lolen = BB_LEN(p[lo]);
  6911. int hilen = BB_LEN(p[hi]);
  6912. int newlen = lolen + hilen - (s - a);
  6913. if (s >= a && newlen < BB_MAX_LEN) {
  6914. /* yes, we can combine them */
  6915. int ack = BB_ACK(p[lo]) && BB_ACK(p[hi]);
  6916. p[lo] = BB_MAKE(BB_OFFSET(p[lo]), newlen, ack);
  6917. memmove(p + hi, p + hi + 1,
  6918. (bb->count - hi - 1) * 8);
  6919. bb->count--;
  6920. }
  6921. }
  6922. while (sectors) {
  6923. /* didn't merge (it all).
  6924. * Need to add a range just before 'hi' */
  6925. if (bb->count >= MD_MAX_BADBLOCKS) {
  6926. /* No room for more */
  6927. rv = 0;
  6928. break;
  6929. } else {
  6930. int this_sectors = sectors;
  6931. memmove(p + hi + 1, p + hi,
  6932. (bb->count - hi) * 8);
  6933. bb->count++;
  6934. if (this_sectors > BB_MAX_LEN)
  6935. this_sectors = BB_MAX_LEN;
  6936. p[hi] = BB_MAKE(s, this_sectors, acknowledged);
  6937. sectors -= this_sectors;
  6938. s += this_sectors;
  6939. }
  6940. }
  6941. bb->changed = 1;
  6942. if (!acknowledged)
  6943. bb->unacked_exist = 1;
  6944. write_sequnlock_irq(&bb->lock);
  6945. return rv;
  6946. }
  6947. int rdev_set_badblocks(struct md_rdev *rdev, sector_t s, int sectors,
  6948. int acknowledged)
  6949. {
  6950. int rv = md_set_badblocks(&rdev->badblocks,
  6951. s + rdev->data_offset, sectors, acknowledged);
  6952. if (rv) {
  6953. /* Make sure they get written out promptly */
  6954. set_bit(MD_CHANGE_CLEAN, &rdev->mddev->flags);
  6955. md_wakeup_thread(rdev->mddev->thread);
  6956. }
  6957. return rv;
  6958. }
  6959. EXPORT_SYMBOL_GPL(rdev_set_badblocks);
  6960. /*
  6961. * Remove a range of bad blocks from the table.
  6962. * This may involve extending the table if we spilt a region,
  6963. * but it must not fail. So if the table becomes full, we just
  6964. * drop the remove request.
  6965. */
  6966. static int md_clear_badblocks(struct badblocks *bb, sector_t s, int sectors)
  6967. {
  6968. u64 *p;
  6969. int lo, hi;
  6970. sector_t target = s + sectors;
  6971. int rv = 0;
  6972. if (bb->shift > 0) {
  6973. /* When clearing we round the start up and the end down.
  6974. * This should not matter as the shift should align with
  6975. * the block size and no rounding should ever be needed.
  6976. * However it is better the think a block is bad when it
  6977. * isn't than to think a block is not bad when it is.
  6978. */
  6979. s += (1<<bb->shift) - 1;
  6980. s >>= bb->shift;
  6981. target >>= bb->shift;
  6982. sectors = target - s;
  6983. }
  6984. write_seqlock_irq(&bb->lock);
  6985. p = bb->page;
  6986. lo = 0;
  6987. hi = bb->count;
  6988. /* Find the last range that starts before 'target' */
  6989. while (hi - lo > 1) {
  6990. int mid = (lo + hi) / 2;
  6991. sector_t a = BB_OFFSET(p[mid]);
  6992. if (a < target)
  6993. lo = mid;
  6994. else
  6995. hi = mid;
  6996. }
  6997. if (hi > lo) {
  6998. /* p[lo] is the last range that could overlap the
  6999. * current range. Earlier ranges could also overlap,
  7000. * but only this one can overlap the end of the range.
  7001. */
  7002. if (BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > target) {
  7003. /* Partial overlap, leave the tail of this range */
  7004. int ack = BB_ACK(p[lo]);
  7005. sector_t a = BB_OFFSET(p[lo]);
  7006. sector_t end = a + BB_LEN(p[lo]);
  7007. if (a < s) {
  7008. /* we need to split this range */
  7009. if (bb->count >= MD_MAX_BADBLOCKS) {
  7010. rv = 0;
  7011. goto out;
  7012. }
  7013. memmove(p+lo+1, p+lo, (bb->count - lo) * 8);
  7014. bb->count++;
  7015. p[lo] = BB_MAKE(a, s-a, ack);
  7016. lo++;
  7017. }
  7018. p[lo] = BB_MAKE(target, end - target, ack);
  7019. /* there is no longer an overlap */
  7020. hi = lo;
  7021. lo--;
  7022. }
  7023. while (lo >= 0 &&
  7024. BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > s) {
  7025. /* This range does overlap */
  7026. if (BB_OFFSET(p[lo]) < s) {
  7027. /* Keep the early parts of this range. */
  7028. int ack = BB_ACK(p[lo]);
  7029. sector_t start = BB_OFFSET(p[lo]);
  7030. p[lo] = BB_MAKE(start, s - start, ack);
  7031. /* now low doesn't overlap, so.. */
  7032. break;
  7033. }
  7034. lo--;
  7035. }
  7036. /* 'lo' is strictly before, 'hi' is strictly after,
  7037. * anything between needs to be discarded
  7038. */
  7039. if (hi - lo > 1) {
  7040. memmove(p+lo+1, p+hi, (bb->count - hi) * 8);
  7041. bb->count -= (hi - lo - 1);
  7042. }
  7043. }
  7044. bb->changed = 1;
  7045. out:
  7046. write_sequnlock_irq(&bb->lock);
  7047. return rv;
  7048. }
  7049. int rdev_clear_badblocks(struct md_rdev *rdev, sector_t s, int sectors)
  7050. {
  7051. return md_clear_badblocks(&rdev->badblocks,
  7052. s + rdev->data_offset,
  7053. sectors);
  7054. }
  7055. EXPORT_SYMBOL_GPL(rdev_clear_badblocks);
  7056. /*
  7057. * Acknowledge all bad blocks in a list.
  7058. * This only succeeds if ->changed is clear. It is used by
  7059. * in-kernel metadata updates
  7060. */
  7061. void md_ack_all_badblocks(struct badblocks *bb)
  7062. {
  7063. if (bb->page == NULL || bb->changed)
  7064. /* no point even trying */
  7065. return;
  7066. write_seqlock_irq(&bb->lock);
  7067. if (bb->changed == 0) {
  7068. u64 *p = bb->page;
  7069. int i;
  7070. for (i = 0; i < bb->count ; i++) {
  7071. if (!BB_ACK(p[i])) {
  7072. sector_t start = BB_OFFSET(p[i]);
  7073. int len = BB_LEN(p[i]);
  7074. p[i] = BB_MAKE(start, len, 1);
  7075. }
  7076. }
  7077. bb->unacked_exist = 0;
  7078. }
  7079. write_sequnlock_irq(&bb->lock);
  7080. }
  7081. EXPORT_SYMBOL_GPL(md_ack_all_badblocks);
  7082. /* sysfs access to bad-blocks list.
  7083. * We present two files.
  7084. * 'bad-blocks' lists sector numbers and lengths of ranges that
  7085. * are recorded as bad. The list is truncated to fit within
  7086. * the one-page limit of sysfs.
  7087. * Writing "sector length" to this file adds an acknowledged
  7088. * bad block list.
  7089. * 'unacknowledged-bad-blocks' lists bad blocks that have not yet
  7090. * been acknowledged. Writing to this file adds bad blocks
  7091. * without acknowledging them. This is largely for testing.
  7092. */
  7093. static ssize_t
  7094. badblocks_show(struct badblocks *bb, char *page, int unack)
  7095. {
  7096. size_t len;
  7097. int i;
  7098. u64 *p = bb->page;
  7099. unsigned seq;
  7100. if (bb->shift < 0)
  7101. return 0;
  7102. retry:
  7103. seq = read_seqbegin(&bb->lock);
  7104. len = 0;
  7105. i = 0;
  7106. while (len < PAGE_SIZE && i < bb->count) {
  7107. sector_t s = BB_OFFSET(p[i]);
  7108. unsigned int length = BB_LEN(p[i]);
  7109. int ack = BB_ACK(p[i]);
  7110. i++;
  7111. if (unack && ack)
  7112. continue;
  7113. len += snprintf(page+len, PAGE_SIZE-len, "%llu %u\n",
  7114. (unsigned long long)s << bb->shift,
  7115. length << bb->shift);
  7116. }
  7117. if (unack && len == 0)
  7118. bb->unacked_exist = 0;
  7119. if (read_seqretry(&bb->lock, seq))
  7120. goto retry;
  7121. return len;
  7122. }
  7123. #define DO_DEBUG 1
  7124. static ssize_t
  7125. badblocks_store(struct badblocks *bb, const char *page, size_t len, int unack)
  7126. {
  7127. unsigned long long sector;
  7128. int length;
  7129. char newline;
  7130. #ifdef DO_DEBUG
  7131. /* Allow clearing via sysfs *only* for testing/debugging.
  7132. * Normally only a successful write may clear a badblock
  7133. */
  7134. int clear = 0;
  7135. if (page[0] == '-') {
  7136. clear = 1;
  7137. page++;
  7138. }
  7139. #endif /* DO_DEBUG */
  7140. switch (sscanf(page, "%llu %d%c", &sector, &length, &newline)) {
  7141. case 3:
  7142. if (newline != '\n')
  7143. return -EINVAL;
  7144. case 2:
  7145. if (length <= 0)
  7146. return -EINVAL;
  7147. break;
  7148. default:
  7149. return -EINVAL;
  7150. }
  7151. #ifdef DO_DEBUG
  7152. if (clear) {
  7153. md_clear_badblocks(bb, sector, length);
  7154. return len;
  7155. }
  7156. #endif /* DO_DEBUG */
  7157. if (md_set_badblocks(bb, sector, length, !unack))
  7158. return len;
  7159. else
  7160. return -ENOSPC;
  7161. }
  7162. static int md_notify_reboot(struct notifier_block *this,
  7163. unsigned long code, void *x)
  7164. {
  7165. struct list_head *tmp;
  7166. struct mddev *mddev;
  7167. int need_delay = 0;
  7168. if ((code == SYS_DOWN) || (code == SYS_HALT) || (code == SYS_POWER_OFF)) {
  7169. printk(KERN_INFO "md: stopping all md devices.\n");
  7170. for_each_mddev(mddev, tmp) {
  7171. if (mddev_trylock(mddev)) {
  7172. /* Force a switch to readonly even array
  7173. * appears to still be in use. Hence
  7174. * the '100'.
  7175. */
  7176. md_set_readonly(mddev, 100);
  7177. mddev_unlock(mddev);
  7178. }
  7179. need_delay = 1;
  7180. }
  7181. /*
  7182. * certain more exotic SCSI devices are known to be
  7183. * volatile wrt too early system reboots. While the
  7184. * right place to handle this issue is the given
  7185. * driver, we do want to have a safe RAID driver ...
  7186. */
  7187. if (need_delay)
  7188. mdelay(1000*1);
  7189. }
  7190. return NOTIFY_DONE;
  7191. }
  7192. static struct notifier_block md_notifier = {
  7193. .notifier_call = md_notify_reboot,
  7194. .next = NULL,
  7195. .priority = INT_MAX, /* before any real devices */
  7196. };
  7197. static void md_geninit(void)
  7198. {
  7199. pr_debug("md: sizeof(mdp_super_t) = %d\n", (int)sizeof(mdp_super_t));
  7200. proc_create("mdstat", S_IRUGO, NULL, &md_seq_fops);
  7201. }
  7202. static int __init md_init(void)
  7203. {
  7204. int ret = -ENOMEM;
  7205. md_wq = alloc_workqueue("md", WQ_MEM_RECLAIM, 0);
  7206. if (!md_wq)
  7207. goto err_wq;
  7208. md_misc_wq = alloc_workqueue("md_misc", 0, 0);
  7209. if (!md_misc_wq)
  7210. goto err_misc_wq;
  7211. if ((ret = register_blkdev(MD_MAJOR, "md")) < 0)
  7212. goto err_md;
  7213. if ((ret = register_blkdev(0, "mdp")) < 0)
  7214. goto err_mdp;
  7215. mdp_major = ret;
  7216. blk_register_region(MKDEV(MD_MAJOR, 0), 1UL<<MINORBITS, THIS_MODULE,
  7217. md_probe, NULL, NULL);
  7218. blk_register_region(MKDEV(mdp_major, 0), 1UL<<MINORBITS, THIS_MODULE,
  7219. md_probe, NULL, NULL);
  7220. register_reboot_notifier(&md_notifier);
  7221. raid_table_header = register_sysctl_table(raid_root_table);
  7222. md_geninit();
  7223. return 0;
  7224. err_mdp:
  7225. unregister_blkdev(MD_MAJOR, "md");
  7226. err_md:
  7227. destroy_workqueue(md_misc_wq);
  7228. err_misc_wq:
  7229. destroy_workqueue(md_wq);
  7230. err_wq:
  7231. return ret;
  7232. }
  7233. #ifndef MODULE
  7234. /*
  7235. * Searches all registered partitions for autorun RAID arrays
  7236. * at boot time.
  7237. */
  7238. static LIST_HEAD(all_detected_devices);
  7239. struct detected_devices_node {
  7240. struct list_head list;
  7241. dev_t dev;
  7242. };
  7243. void md_autodetect_dev(dev_t dev)
  7244. {
  7245. struct detected_devices_node *node_detected_dev;
  7246. node_detected_dev = kzalloc(sizeof(*node_detected_dev), GFP_KERNEL);
  7247. if (node_detected_dev) {
  7248. node_detected_dev->dev = dev;
  7249. list_add_tail(&node_detected_dev->list, &all_detected_devices);
  7250. } else {
  7251. printk(KERN_CRIT "md: md_autodetect_dev: kzalloc failed"
  7252. ", skipping dev(%d,%d)\n", MAJOR(dev), MINOR(dev));
  7253. }
  7254. }
  7255. static void autostart_arrays(int part)
  7256. {
  7257. struct md_rdev *rdev;
  7258. struct detected_devices_node *node_detected_dev;
  7259. dev_t dev;
  7260. int i_scanned, i_passed;
  7261. i_scanned = 0;
  7262. i_passed = 0;
  7263. printk(KERN_INFO "md: Autodetecting RAID arrays.\n");
  7264. while (!list_empty(&all_detected_devices) && i_scanned < INT_MAX) {
  7265. i_scanned++;
  7266. node_detected_dev = list_entry(all_detected_devices.next,
  7267. struct detected_devices_node, list);
  7268. list_del(&node_detected_dev->list);
  7269. dev = node_detected_dev->dev;
  7270. kfree(node_detected_dev);
  7271. rdev = md_import_device(dev,0, 90);
  7272. if (IS_ERR(rdev))
  7273. continue;
  7274. if (test_bit(Faulty, &rdev->flags)) {
  7275. MD_BUG();
  7276. continue;
  7277. }
  7278. set_bit(AutoDetected, &rdev->flags);
  7279. list_add(&rdev->same_set, &pending_raid_disks);
  7280. i_passed++;
  7281. }
  7282. printk(KERN_INFO "md: Scanned %d and added %d devices.\n",
  7283. i_scanned, i_passed);
  7284. autorun_devices(part);
  7285. }
  7286. #endif /* !MODULE */
  7287. static __exit void md_exit(void)
  7288. {
  7289. struct mddev *mddev;
  7290. struct list_head *tmp;
  7291. blk_unregister_region(MKDEV(MD_MAJOR,0), 1U << MINORBITS);
  7292. blk_unregister_region(MKDEV(mdp_major,0), 1U << MINORBITS);
  7293. unregister_blkdev(MD_MAJOR,"md");
  7294. unregister_blkdev(mdp_major, "mdp");
  7295. unregister_reboot_notifier(&md_notifier);
  7296. unregister_sysctl_table(raid_table_header);
  7297. remove_proc_entry("mdstat", NULL);
  7298. for_each_mddev(mddev, tmp) {
  7299. export_array(mddev);
  7300. mddev->hold_active = 0;
  7301. }
  7302. destroy_workqueue(md_misc_wq);
  7303. destroy_workqueue(md_wq);
  7304. }
  7305. subsys_initcall(md_init);
  7306. module_exit(md_exit)
  7307. static int get_ro(char *buffer, struct kernel_param *kp)
  7308. {
  7309. return sprintf(buffer, "%d", start_readonly);
  7310. }
  7311. static int set_ro(const char *val, struct kernel_param *kp)
  7312. {
  7313. char *e;
  7314. int num = simple_strtoul(val, &e, 10);
  7315. if (*val && (*e == '\0' || *e == '\n')) {
  7316. start_readonly = num;
  7317. return 0;
  7318. }
  7319. return -EINVAL;
  7320. }
  7321. module_param_call(start_ro, set_ro, get_ro, NULL, S_IRUSR|S_IWUSR);
  7322. module_param(start_dirty_degraded, int, S_IRUGO|S_IWUSR);
  7323. module_param_call(new_array, add_named_array, NULL, NULL, S_IWUSR);
  7324. EXPORT_SYMBOL(register_md_personality);
  7325. EXPORT_SYMBOL(unregister_md_personality);
  7326. EXPORT_SYMBOL(md_error);
  7327. EXPORT_SYMBOL(md_done_sync);
  7328. EXPORT_SYMBOL(md_write_start);
  7329. EXPORT_SYMBOL(md_write_end);
  7330. EXPORT_SYMBOL(md_register_thread);
  7331. EXPORT_SYMBOL(md_unregister_thread);
  7332. EXPORT_SYMBOL(md_wakeup_thread);
  7333. EXPORT_SYMBOL(md_check_recovery);
  7334. MODULE_LICENSE("GPL");
  7335. MODULE_DESCRIPTION("MD RAID framework");
  7336. MODULE_ALIAS("md");
  7337. MODULE_ALIAS_BLOCKDEV_MAJOR(MD_MAJOR);