md.c 208 KB

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