md.c 128 KB

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