md.c 224 KB

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