md.c 122 KB

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