md.c 127 KB

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