md.c 138 KB

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