md.c 137 KB

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