md.c 139 KB

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