md.c 133 KB

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