md.c 139 KB

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