md.c 122 KB

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