md.c 224 KB

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