raid5.c 132 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735
  1. /*
  2. * raid5.c : Multiple Devices driver for Linux
  3. * Copyright (C) 1996, 1997 Ingo Molnar, Miguel de Icaza, Gadi Oxman
  4. * Copyright (C) 1999, 2000 Ingo Molnar
  5. * Copyright (C) 2002, 2003 H. Peter Anvin
  6. *
  7. * RAID-4/5/6 management functions.
  8. * Thanks to Penguin Computing for making the RAID-6 development possible
  9. * by donating a test server!
  10. *
  11. * This program is free software; you can redistribute it and/or modify
  12. * it under the terms of the GNU General Public License as published by
  13. * the Free Software Foundation; either version 2, or (at your option)
  14. * any later version.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * (for example /usr/src/linux/COPYING); if not, write to the Free
  18. * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  19. */
  20. /*
  21. * BITMAP UNPLUGGING:
  22. *
  23. * The sequencing for updating the bitmap reliably is a little
  24. * subtle (and I got it wrong the first time) so it deserves some
  25. * explanation.
  26. *
  27. * We group bitmap updates into batches. Each batch has a number.
  28. * We may write out several batches at once, but that isn't very important.
  29. * conf->bm_write is the number of the last batch successfully written.
  30. * conf->bm_flush is the number of the last batch that was closed to
  31. * new additions.
  32. * When we discover that we will need to write to any block in a stripe
  33. * (in add_stripe_bio) we update the in-memory bitmap and record in sh->bm_seq
  34. * the number of the batch it will be in. This is bm_flush+1.
  35. * When we are ready to do a write, if that batch hasn't been written yet,
  36. * we plug the array and queue the stripe for later.
  37. * When an unplug happens, we increment bm_flush, thus closing the current
  38. * batch.
  39. * When we notice that bm_flush > bm_write, we write out all pending updates
  40. * to the bitmap, and advance bm_write to where bm_flush was.
  41. * This may occasionally write a bit out twice, but is sure never to
  42. * miss any bits.
  43. */
  44. #include <linux/module.h>
  45. #include <linux/slab.h>
  46. #include <linux/highmem.h>
  47. #include <linux/bitops.h>
  48. #include <linux/kthread.h>
  49. #include <asm/atomic.h>
  50. #include "raid6.h"
  51. #include <linux/raid/bitmap.h>
  52. #include <linux/async_tx.h>
  53. /*
  54. * Stripe cache
  55. */
  56. #define NR_STRIPES 256
  57. #define STRIPE_SIZE PAGE_SIZE
  58. #define STRIPE_SHIFT (PAGE_SHIFT - 9)
  59. #define STRIPE_SECTORS (STRIPE_SIZE>>9)
  60. #define IO_THRESHOLD 1
  61. #define BYPASS_THRESHOLD 1
  62. #define NR_HASH (PAGE_SIZE / sizeof(struct hlist_head))
  63. #define HASH_MASK (NR_HASH - 1)
  64. #define stripe_hash(conf, sect) (&((conf)->stripe_hashtbl[((sect) >> STRIPE_SHIFT) & HASH_MASK]))
  65. /* bio's attached to a stripe+device for I/O are linked together in bi_sector
  66. * order without overlap. There may be several bio's per stripe+device, and
  67. * a bio could span several devices.
  68. * When walking this list for a particular stripe+device, we must never proceed
  69. * beyond a bio that extends past this device, as the next bio might no longer
  70. * be valid.
  71. * This macro is used to determine the 'next' bio in the list, given the sector
  72. * of the current stripe+device
  73. */
  74. #define r5_next_bio(bio, sect) ( ( (bio)->bi_sector + ((bio)->bi_size>>9) < sect + STRIPE_SECTORS) ? (bio)->bi_next : NULL)
  75. /*
  76. * The following can be used to debug the driver
  77. */
  78. #define RAID5_PARANOIA 1
  79. #if RAID5_PARANOIA && defined(CONFIG_SMP)
  80. # define CHECK_DEVLOCK() assert_spin_locked(&conf->device_lock)
  81. #else
  82. # define CHECK_DEVLOCK()
  83. #endif
  84. #ifdef DEBUG
  85. #define inline
  86. #define __inline__
  87. #endif
  88. #define printk_rl(args...) ((void) (printk_ratelimit() && printk(args)))
  89. #if !RAID6_USE_EMPTY_ZERO_PAGE
  90. /* In .bss so it's zeroed */
  91. const char raid6_empty_zero_page[PAGE_SIZE] __attribute__((aligned(256)));
  92. #endif
  93. static inline int raid6_next_disk(int disk, int raid_disks)
  94. {
  95. disk++;
  96. return (disk < raid_disks) ? disk : 0;
  97. }
  98. static void return_io(struct bio *return_bi)
  99. {
  100. struct bio *bi = return_bi;
  101. while (bi) {
  102. return_bi = bi->bi_next;
  103. bi->bi_next = NULL;
  104. bi->bi_size = 0;
  105. bio_endio(bi, 0);
  106. bi = return_bi;
  107. }
  108. }
  109. static void print_raid5_conf (raid5_conf_t *conf);
  110. static int stripe_operations_active(struct stripe_head *sh)
  111. {
  112. return sh->check_state || sh->reconstruct_state ||
  113. test_bit(STRIPE_BIOFILL_RUN, &sh->state) ||
  114. test_bit(STRIPE_COMPUTE_RUN, &sh->state);
  115. }
  116. static void __release_stripe(raid5_conf_t *conf, struct stripe_head *sh)
  117. {
  118. if (atomic_dec_and_test(&sh->count)) {
  119. BUG_ON(!list_empty(&sh->lru));
  120. BUG_ON(atomic_read(&conf->active_stripes)==0);
  121. if (test_bit(STRIPE_HANDLE, &sh->state)) {
  122. if (test_bit(STRIPE_DELAYED, &sh->state)) {
  123. list_add_tail(&sh->lru, &conf->delayed_list);
  124. blk_plug_device(conf->mddev->queue);
  125. } else if (test_bit(STRIPE_BIT_DELAY, &sh->state) &&
  126. sh->bm_seq - conf->seq_write > 0) {
  127. list_add_tail(&sh->lru, &conf->bitmap_list);
  128. blk_plug_device(conf->mddev->queue);
  129. } else {
  130. clear_bit(STRIPE_BIT_DELAY, &sh->state);
  131. list_add_tail(&sh->lru, &conf->handle_list);
  132. }
  133. md_wakeup_thread(conf->mddev->thread);
  134. } else {
  135. BUG_ON(stripe_operations_active(sh));
  136. if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
  137. atomic_dec(&conf->preread_active_stripes);
  138. if (atomic_read(&conf->preread_active_stripes) < IO_THRESHOLD)
  139. md_wakeup_thread(conf->mddev->thread);
  140. }
  141. atomic_dec(&conf->active_stripes);
  142. if (!test_bit(STRIPE_EXPANDING, &sh->state)) {
  143. list_add_tail(&sh->lru, &conf->inactive_list);
  144. wake_up(&conf->wait_for_stripe);
  145. if (conf->retry_read_aligned)
  146. md_wakeup_thread(conf->mddev->thread);
  147. }
  148. }
  149. }
  150. }
  151. static void release_stripe(struct stripe_head *sh)
  152. {
  153. raid5_conf_t *conf = sh->raid_conf;
  154. unsigned long flags;
  155. spin_lock_irqsave(&conf->device_lock, flags);
  156. __release_stripe(conf, sh);
  157. spin_unlock_irqrestore(&conf->device_lock, flags);
  158. }
  159. static inline void remove_hash(struct stripe_head *sh)
  160. {
  161. pr_debug("remove_hash(), stripe %llu\n",
  162. (unsigned long long)sh->sector);
  163. hlist_del_init(&sh->hash);
  164. }
  165. static inline void insert_hash(raid5_conf_t *conf, struct stripe_head *sh)
  166. {
  167. struct hlist_head *hp = stripe_hash(conf, sh->sector);
  168. pr_debug("insert_hash(), stripe %llu\n",
  169. (unsigned long long)sh->sector);
  170. CHECK_DEVLOCK();
  171. hlist_add_head(&sh->hash, hp);
  172. }
  173. /* find an idle stripe, make sure it is unhashed, and return it. */
  174. static struct stripe_head *get_free_stripe(raid5_conf_t *conf)
  175. {
  176. struct stripe_head *sh = NULL;
  177. struct list_head *first;
  178. CHECK_DEVLOCK();
  179. if (list_empty(&conf->inactive_list))
  180. goto out;
  181. first = conf->inactive_list.next;
  182. sh = list_entry(first, struct stripe_head, lru);
  183. list_del_init(first);
  184. remove_hash(sh);
  185. atomic_inc(&conf->active_stripes);
  186. out:
  187. return sh;
  188. }
  189. static void shrink_buffers(struct stripe_head *sh, int num)
  190. {
  191. struct page *p;
  192. int i;
  193. for (i=0; i<num ; i++) {
  194. p = sh->dev[i].page;
  195. if (!p)
  196. continue;
  197. sh->dev[i].page = NULL;
  198. put_page(p);
  199. }
  200. }
  201. static int grow_buffers(struct stripe_head *sh, int num)
  202. {
  203. int i;
  204. for (i=0; i<num; i++) {
  205. struct page *page;
  206. if (!(page = alloc_page(GFP_KERNEL))) {
  207. return 1;
  208. }
  209. sh->dev[i].page = page;
  210. }
  211. return 0;
  212. }
  213. static void raid5_build_block (struct stripe_head *sh, int i);
  214. static void init_stripe(struct stripe_head *sh, sector_t sector, int pd_idx, int disks)
  215. {
  216. raid5_conf_t *conf = sh->raid_conf;
  217. int i;
  218. BUG_ON(atomic_read(&sh->count) != 0);
  219. BUG_ON(test_bit(STRIPE_HANDLE, &sh->state));
  220. BUG_ON(stripe_operations_active(sh));
  221. CHECK_DEVLOCK();
  222. pr_debug("init_stripe called, stripe %llu\n",
  223. (unsigned long long)sh->sector);
  224. remove_hash(sh);
  225. sh->sector = sector;
  226. sh->pd_idx = pd_idx;
  227. sh->state = 0;
  228. sh->disks = disks;
  229. for (i = sh->disks; i--; ) {
  230. struct r5dev *dev = &sh->dev[i];
  231. if (dev->toread || dev->read || dev->towrite || dev->written ||
  232. test_bit(R5_LOCKED, &dev->flags)) {
  233. printk(KERN_ERR "sector=%llx i=%d %p %p %p %p %d\n",
  234. (unsigned long long)sh->sector, i, dev->toread,
  235. dev->read, dev->towrite, dev->written,
  236. test_bit(R5_LOCKED, &dev->flags));
  237. BUG();
  238. }
  239. dev->flags = 0;
  240. raid5_build_block(sh, i);
  241. }
  242. insert_hash(conf, sh);
  243. }
  244. static struct stripe_head *__find_stripe(raid5_conf_t *conf, sector_t sector, int disks)
  245. {
  246. struct stripe_head *sh;
  247. struct hlist_node *hn;
  248. CHECK_DEVLOCK();
  249. pr_debug("__find_stripe, sector %llu\n", (unsigned long long)sector);
  250. hlist_for_each_entry(sh, hn, stripe_hash(conf, sector), hash)
  251. if (sh->sector == sector && sh->disks == disks)
  252. return sh;
  253. pr_debug("__stripe %llu not in cache\n", (unsigned long long)sector);
  254. return NULL;
  255. }
  256. static void unplug_slaves(mddev_t *mddev);
  257. static void raid5_unplug_device(struct request_queue *q);
  258. static struct stripe_head *get_active_stripe(raid5_conf_t *conf, sector_t sector, int disks,
  259. int pd_idx, int noblock)
  260. {
  261. struct stripe_head *sh;
  262. pr_debug("get_stripe, sector %llu\n", (unsigned long long)sector);
  263. spin_lock_irq(&conf->device_lock);
  264. do {
  265. wait_event_lock_irq(conf->wait_for_stripe,
  266. conf->quiesce == 0,
  267. conf->device_lock, /* nothing */);
  268. sh = __find_stripe(conf, sector, disks);
  269. if (!sh) {
  270. if (!conf->inactive_blocked)
  271. sh = get_free_stripe(conf);
  272. if (noblock && sh == NULL)
  273. break;
  274. if (!sh) {
  275. conf->inactive_blocked = 1;
  276. wait_event_lock_irq(conf->wait_for_stripe,
  277. !list_empty(&conf->inactive_list) &&
  278. (atomic_read(&conf->active_stripes)
  279. < (conf->max_nr_stripes *3/4)
  280. || !conf->inactive_blocked),
  281. conf->device_lock,
  282. raid5_unplug_device(conf->mddev->queue)
  283. );
  284. conf->inactive_blocked = 0;
  285. } else
  286. init_stripe(sh, sector, pd_idx, disks);
  287. } else {
  288. if (atomic_read(&sh->count)) {
  289. BUG_ON(!list_empty(&sh->lru));
  290. } else {
  291. if (!test_bit(STRIPE_HANDLE, &sh->state))
  292. atomic_inc(&conf->active_stripes);
  293. if (list_empty(&sh->lru) &&
  294. !test_bit(STRIPE_EXPANDING, &sh->state))
  295. BUG();
  296. list_del_init(&sh->lru);
  297. }
  298. }
  299. } while (sh == NULL);
  300. if (sh)
  301. atomic_inc(&sh->count);
  302. spin_unlock_irq(&conf->device_lock);
  303. return sh;
  304. }
  305. static void
  306. raid5_end_read_request(struct bio *bi, int error);
  307. static void
  308. raid5_end_write_request(struct bio *bi, int error);
  309. static void ops_run_io(struct stripe_head *sh, struct stripe_head_state *s)
  310. {
  311. raid5_conf_t *conf = sh->raid_conf;
  312. int i, disks = sh->disks;
  313. might_sleep();
  314. for (i = disks; i--; ) {
  315. int rw;
  316. struct bio *bi;
  317. mdk_rdev_t *rdev;
  318. if (test_and_clear_bit(R5_Wantwrite, &sh->dev[i].flags))
  319. rw = WRITE;
  320. else if (test_and_clear_bit(R5_Wantread, &sh->dev[i].flags))
  321. rw = READ;
  322. else
  323. continue;
  324. bi = &sh->dev[i].req;
  325. bi->bi_rw = rw;
  326. if (rw == WRITE)
  327. bi->bi_end_io = raid5_end_write_request;
  328. else
  329. bi->bi_end_io = raid5_end_read_request;
  330. rcu_read_lock();
  331. rdev = rcu_dereference(conf->disks[i].rdev);
  332. if (rdev && test_bit(Faulty, &rdev->flags))
  333. rdev = NULL;
  334. if (rdev)
  335. atomic_inc(&rdev->nr_pending);
  336. rcu_read_unlock();
  337. if (rdev) {
  338. if (s->syncing || s->expanding || s->expanded)
  339. md_sync_acct(rdev->bdev, STRIPE_SECTORS);
  340. set_bit(STRIPE_IO_STARTED, &sh->state);
  341. bi->bi_bdev = rdev->bdev;
  342. pr_debug("%s: for %llu schedule op %ld on disc %d\n",
  343. __func__, (unsigned long long)sh->sector,
  344. bi->bi_rw, i);
  345. atomic_inc(&sh->count);
  346. bi->bi_sector = sh->sector + rdev->data_offset;
  347. bi->bi_flags = 1 << BIO_UPTODATE;
  348. bi->bi_vcnt = 1;
  349. bi->bi_max_vecs = 1;
  350. bi->bi_idx = 0;
  351. bi->bi_io_vec = &sh->dev[i].vec;
  352. bi->bi_io_vec[0].bv_len = STRIPE_SIZE;
  353. bi->bi_io_vec[0].bv_offset = 0;
  354. bi->bi_size = STRIPE_SIZE;
  355. bi->bi_next = NULL;
  356. if (rw == WRITE &&
  357. test_bit(R5_ReWrite, &sh->dev[i].flags))
  358. atomic_add(STRIPE_SECTORS,
  359. &rdev->corrected_errors);
  360. generic_make_request(bi);
  361. } else {
  362. if (rw == WRITE)
  363. set_bit(STRIPE_DEGRADED, &sh->state);
  364. pr_debug("skip op %ld on disc %d for sector %llu\n",
  365. bi->bi_rw, i, (unsigned long long)sh->sector);
  366. clear_bit(R5_LOCKED, &sh->dev[i].flags);
  367. set_bit(STRIPE_HANDLE, &sh->state);
  368. }
  369. }
  370. }
  371. static struct dma_async_tx_descriptor *
  372. async_copy_data(int frombio, struct bio *bio, struct page *page,
  373. sector_t sector, struct dma_async_tx_descriptor *tx)
  374. {
  375. struct bio_vec *bvl;
  376. struct page *bio_page;
  377. int i;
  378. int page_offset;
  379. if (bio->bi_sector >= sector)
  380. page_offset = (signed)(bio->bi_sector - sector) * 512;
  381. else
  382. page_offset = (signed)(sector - bio->bi_sector) * -512;
  383. bio_for_each_segment(bvl, bio, i) {
  384. int len = bio_iovec_idx(bio, i)->bv_len;
  385. int clen;
  386. int b_offset = 0;
  387. if (page_offset < 0) {
  388. b_offset = -page_offset;
  389. page_offset += b_offset;
  390. len -= b_offset;
  391. }
  392. if (len > 0 && page_offset + len > STRIPE_SIZE)
  393. clen = STRIPE_SIZE - page_offset;
  394. else
  395. clen = len;
  396. if (clen > 0) {
  397. b_offset += bio_iovec_idx(bio, i)->bv_offset;
  398. bio_page = bio_iovec_idx(bio, i)->bv_page;
  399. if (frombio)
  400. tx = async_memcpy(page, bio_page, page_offset,
  401. b_offset, clen,
  402. ASYNC_TX_DEP_ACK,
  403. tx, NULL, NULL);
  404. else
  405. tx = async_memcpy(bio_page, page, b_offset,
  406. page_offset, clen,
  407. ASYNC_TX_DEP_ACK,
  408. tx, NULL, NULL);
  409. }
  410. if (clen < len) /* hit end of page */
  411. break;
  412. page_offset += len;
  413. }
  414. return tx;
  415. }
  416. static void ops_complete_biofill(void *stripe_head_ref)
  417. {
  418. struct stripe_head *sh = stripe_head_ref;
  419. struct bio *return_bi = NULL;
  420. raid5_conf_t *conf = sh->raid_conf;
  421. int i;
  422. pr_debug("%s: stripe %llu\n", __func__,
  423. (unsigned long long)sh->sector);
  424. /* clear completed biofills */
  425. spin_lock_irq(&conf->device_lock);
  426. for (i = sh->disks; i--; ) {
  427. struct r5dev *dev = &sh->dev[i];
  428. /* acknowledge completion of a biofill operation */
  429. /* and check if we need to reply to a read request,
  430. * new R5_Wantfill requests are held off until
  431. * !STRIPE_BIOFILL_RUN
  432. */
  433. if (test_and_clear_bit(R5_Wantfill, &dev->flags)) {
  434. struct bio *rbi, *rbi2;
  435. BUG_ON(!dev->read);
  436. rbi = dev->read;
  437. dev->read = NULL;
  438. while (rbi && rbi->bi_sector <
  439. dev->sector + STRIPE_SECTORS) {
  440. rbi2 = r5_next_bio(rbi, dev->sector);
  441. if (--rbi->bi_phys_segments == 0) {
  442. rbi->bi_next = return_bi;
  443. return_bi = rbi;
  444. }
  445. rbi = rbi2;
  446. }
  447. }
  448. }
  449. spin_unlock_irq(&conf->device_lock);
  450. clear_bit(STRIPE_BIOFILL_RUN, &sh->state);
  451. return_io(return_bi);
  452. set_bit(STRIPE_HANDLE, &sh->state);
  453. release_stripe(sh);
  454. }
  455. static void ops_run_biofill(struct stripe_head *sh)
  456. {
  457. struct dma_async_tx_descriptor *tx = NULL;
  458. raid5_conf_t *conf = sh->raid_conf;
  459. int i;
  460. pr_debug("%s: stripe %llu\n", __func__,
  461. (unsigned long long)sh->sector);
  462. for (i = sh->disks; i--; ) {
  463. struct r5dev *dev = &sh->dev[i];
  464. if (test_bit(R5_Wantfill, &dev->flags)) {
  465. struct bio *rbi;
  466. spin_lock_irq(&conf->device_lock);
  467. dev->read = rbi = dev->toread;
  468. dev->toread = NULL;
  469. spin_unlock_irq(&conf->device_lock);
  470. while (rbi && rbi->bi_sector <
  471. dev->sector + STRIPE_SECTORS) {
  472. tx = async_copy_data(0, rbi, dev->page,
  473. dev->sector, tx);
  474. rbi = r5_next_bio(rbi, dev->sector);
  475. }
  476. }
  477. }
  478. atomic_inc(&sh->count);
  479. async_trigger_callback(ASYNC_TX_DEP_ACK | ASYNC_TX_ACK, tx,
  480. ops_complete_biofill, sh);
  481. }
  482. static void ops_complete_compute5(void *stripe_head_ref)
  483. {
  484. struct stripe_head *sh = stripe_head_ref;
  485. int target = sh->ops.target;
  486. struct r5dev *tgt = &sh->dev[target];
  487. pr_debug("%s: stripe %llu\n", __func__,
  488. (unsigned long long)sh->sector);
  489. set_bit(R5_UPTODATE, &tgt->flags);
  490. BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
  491. clear_bit(R5_Wantcompute, &tgt->flags);
  492. clear_bit(STRIPE_COMPUTE_RUN, &sh->state);
  493. if (sh->check_state == check_state_compute_run)
  494. sh->check_state = check_state_compute_result;
  495. set_bit(STRIPE_HANDLE, &sh->state);
  496. release_stripe(sh);
  497. }
  498. static struct dma_async_tx_descriptor *ops_run_compute5(struct stripe_head *sh)
  499. {
  500. /* kernel stack size limits the total number of disks */
  501. int disks = sh->disks;
  502. struct page *xor_srcs[disks];
  503. int target = sh->ops.target;
  504. struct r5dev *tgt = &sh->dev[target];
  505. struct page *xor_dest = tgt->page;
  506. int count = 0;
  507. struct dma_async_tx_descriptor *tx;
  508. int i;
  509. pr_debug("%s: stripe %llu block: %d\n",
  510. __func__, (unsigned long long)sh->sector, target);
  511. BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
  512. for (i = disks; i--; )
  513. if (i != target)
  514. xor_srcs[count++] = sh->dev[i].page;
  515. atomic_inc(&sh->count);
  516. if (unlikely(count == 1))
  517. tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE,
  518. 0, NULL, ops_complete_compute5, sh);
  519. else
  520. tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
  521. ASYNC_TX_XOR_ZERO_DST, NULL,
  522. ops_complete_compute5, sh);
  523. return tx;
  524. }
  525. static void ops_complete_prexor(void *stripe_head_ref)
  526. {
  527. struct stripe_head *sh = stripe_head_ref;
  528. pr_debug("%s: stripe %llu\n", __func__,
  529. (unsigned long long)sh->sector);
  530. }
  531. static struct dma_async_tx_descriptor *
  532. ops_run_prexor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
  533. {
  534. /* kernel stack size limits the total number of disks */
  535. int disks = sh->disks;
  536. struct page *xor_srcs[disks];
  537. int count = 0, pd_idx = sh->pd_idx, i;
  538. /* existing parity data subtracted */
  539. struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
  540. pr_debug("%s: stripe %llu\n", __func__,
  541. (unsigned long long)sh->sector);
  542. for (i = disks; i--; ) {
  543. struct r5dev *dev = &sh->dev[i];
  544. /* Only process blocks that are known to be uptodate */
  545. if (test_bit(R5_Wantdrain, &dev->flags))
  546. xor_srcs[count++] = dev->page;
  547. }
  548. tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
  549. ASYNC_TX_DEP_ACK | ASYNC_TX_XOR_DROP_DST, tx,
  550. ops_complete_prexor, sh);
  551. return tx;
  552. }
  553. static struct dma_async_tx_descriptor *
  554. ops_run_biodrain(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
  555. {
  556. int disks = sh->disks;
  557. int i;
  558. pr_debug("%s: stripe %llu\n", __func__,
  559. (unsigned long long)sh->sector);
  560. for (i = disks; i--; ) {
  561. struct r5dev *dev = &sh->dev[i];
  562. struct bio *chosen;
  563. if (test_and_clear_bit(R5_Wantdrain, &dev->flags)) {
  564. struct bio *wbi;
  565. spin_lock(&sh->lock);
  566. chosen = dev->towrite;
  567. dev->towrite = NULL;
  568. BUG_ON(dev->written);
  569. wbi = dev->written = chosen;
  570. spin_unlock(&sh->lock);
  571. while (wbi && wbi->bi_sector <
  572. dev->sector + STRIPE_SECTORS) {
  573. tx = async_copy_data(1, wbi, dev->page,
  574. dev->sector, tx);
  575. wbi = r5_next_bio(wbi, dev->sector);
  576. }
  577. }
  578. }
  579. return tx;
  580. }
  581. static void ops_complete_postxor(void *stripe_head_ref)
  582. {
  583. struct stripe_head *sh = stripe_head_ref;
  584. int disks = sh->disks, i, pd_idx = sh->pd_idx;
  585. pr_debug("%s: stripe %llu\n", __func__,
  586. (unsigned long long)sh->sector);
  587. for (i = disks; i--; ) {
  588. struct r5dev *dev = &sh->dev[i];
  589. if (dev->written || i == pd_idx)
  590. set_bit(R5_UPTODATE, &dev->flags);
  591. }
  592. if (sh->reconstruct_state == reconstruct_state_drain_run)
  593. sh->reconstruct_state = reconstruct_state_drain_result;
  594. else if (sh->reconstruct_state == reconstruct_state_prexor_drain_run)
  595. sh->reconstruct_state = reconstruct_state_prexor_drain_result;
  596. else {
  597. BUG_ON(sh->reconstruct_state != reconstruct_state_run);
  598. sh->reconstruct_state = reconstruct_state_result;
  599. }
  600. set_bit(STRIPE_HANDLE, &sh->state);
  601. release_stripe(sh);
  602. }
  603. static void
  604. ops_run_postxor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
  605. {
  606. /* kernel stack size limits the total number of disks */
  607. int disks = sh->disks;
  608. struct page *xor_srcs[disks];
  609. int count = 0, pd_idx = sh->pd_idx, i;
  610. struct page *xor_dest;
  611. int prexor = 0;
  612. unsigned long flags;
  613. pr_debug("%s: stripe %llu\n", __func__,
  614. (unsigned long long)sh->sector);
  615. /* check if prexor is active which means only process blocks
  616. * that are part of a read-modify-write (written)
  617. */
  618. if (sh->reconstruct_state == reconstruct_state_prexor_drain_run) {
  619. prexor = 1;
  620. xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
  621. for (i = disks; i--; ) {
  622. struct r5dev *dev = &sh->dev[i];
  623. if (dev->written)
  624. xor_srcs[count++] = dev->page;
  625. }
  626. } else {
  627. xor_dest = sh->dev[pd_idx].page;
  628. for (i = disks; i--; ) {
  629. struct r5dev *dev = &sh->dev[i];
  630. if (i != pd_idx)
  631. xor_srcs[count++] = dev->page;
  632. }
  633. }
  634. /* 1/ if we prexor'd then the dest is reused as a source
  635. * 2/ if we did not prexor then we are redoing the parity
  636. * set ASYNC_TX_XOR_DROP_DST and ASYNC_TX_XOR_ZERO_DST
  637. * for the synchronous xor case
  638. */
  639. flags = ASYNC_TX_DEP_ACK | ASYNC_TX_ACK |
  640. (prexor ? ASYNC_TX_XOR_DROP_DST : ASYNC_TX_XOR_ZERO_DST);
  641. atomic_inc(&sh->count);
  642. if (unlikely(count == 1)) {
  643. flags &= ~(ASYNC_TX_XOR_DROP_DST | ASYNC_TX_XOR_ZERO_DST);
  644. tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE,
  645. flags, tx, ops_complete_postxor, sh);
  646. } else
  647. tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
  648. flags, tx, ops_complete_postxor, sh);
  649. }
  650. static void ops_complete_check(void *stripe_head_ref)
  651. {
  652. struct stripe_head *sh = stripe_head_ref;
  653. pr_debug("%s: stripe %llu\n", __func__,
  654. (unsigned long long)sh->sector);
  655. sh->check_state = check_state_check_result;
  656. set_bit(STRIPE_HANDLE, &sh->state);
  657. release_stripe(sh);
  658. }
  659. static void ops_run_check(struct stripe_head *sh)
  660. {
  661. /* kernel stack size limits the total number of disks */
  662. int disks = sh->disks;
  663. struct page *xor_srcs[disks];
  664. struct dma_async_tx_descriptor *tx;
  665. int count = 0, pd_idx = sh->pd_idx, i;
  666. struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
  667. pr_debug("%s: stripe %llu\n", __func__,
  668. (unsigned long long)sh->sector);
  669. for (i = disks; i--; ) {
  670. struct r5dev *dev = &sh->dev[i];
  671. if (i != pd_idx)
  672. xor_srcs[count++] = dev->page;
  673. }
  674. tx = async_xor_zero_sum(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
  675. &sh->ops.zero_sum_result, 0, NULL, NULL, NULL);
  676. atomic_inc(&sh->count);
  677. tx = async_trigger_callback(ASYNC_TX_DEP_ACK | ASYNC_TX_ACK, tx,
  678. ops_complete_check, sh);
  679. }
  680. static void raid5_run_ops(struct stripe_head *sh, unsigned long ops_request)
  681. {
  682. int overlap_clear = 0, i, disks = sh->disks;
  683. struct dma_async_tx_descriptor *tx = NULL;
  684. if (test_bit(STRIPE_OP_BIOFILL, &ops_request)) {
  685. ops_run_biofill(sh);
  686. overlap_clear++;
  687. }
  688. if (test_bit(STRIPE_OP_COMPUTE_BLK, &ops_request)) {
  689. tx = ops_run_compute5(sh);
  690. /* terminate the chain if postxor is not set to be run */
  691. if (tx && !test_bit(STRIPE_OP_POSTXOR, &ops_request))
  692. async_tx_ack(tx);
  693. }
  694. if (test_bit(STRIPE_OP_PREXOR, &ops_request))
  695. tx = ops_run_prexor(sh, tx);
  696. if (test_bit(STRIPE_OP_BIODRAIN, &ops_request)) {
  697. tx = ops_run_biodrain(sh, tx);
  698. overlap_clear++;
  699. }
  700. if (test_bit(STRIPE_OP_POSTXOR, &ops_request))
  701. ops_run_postxor(sh, tx);
  702. if (test_bit(STRIPE_OP_CHECK, &ops_request))
  703. ops_run_check(sh);
  704. if (overlap_clear)
  705. for (i = disks; i--; ) {
  706. struct r5dev *dev = &sh->dev[i];
  707. if (test_and_clear_bit(R5_Overlap, &dev->flags))
  708. wake_up(&sh->raid_conf->wait_for_overlap);
  709. }
  710. }
  711. static int grow_one_stripe(raid5_conf_t *conf)
  712. {
  713. struct stripe_head *sh;
  714. sh = kmem_cache_alloc(conf->slab_cache, GFP_KERNEL);
  715. if (!sh)
  716. return 0;
  717. memset(sh, 0, sizeof(*sh) + (conf->raid_disks-1)*sizeof(struct r5dev));
  718. sh->raid_conf = conf;
  719. spin_lock_init(&sh->lock);
  720. if (grow_buffers(sh, conf->raid_disks)) {
  721. shrink_buffers(sh, conf->raid_disks);
  722. kmem_cache_free(conf->slab_cache, sh);
  723. return 0;
  724. }
  725. sh->disks = conf->raid_disks;
  726. /* we just created an active stripe so... */
  727. atomic_set(&sh->count, 1);
  728. atomic_inc(&conf->active_stripes);
  729. INIT_LIST_HEAD(&sh->lru);
  730. release_stripe(sh);
  731. return 1;
  732. }
  733. static int grow_stripes(raid5_conf_t *conf, int num)
  734. {
  735. struct kmem_cache *sc;
  736. int devs = conf->raid_disks;
  737. sprintf(conf->cache_name[0], "raid5-%s", mdname(conf->mddev));
  738. sprintf(conf->cache_name[1], "raid5-%s-alt", mdname(conf->mddev));
  739. conf->active_name = 0;
  740. sc = kmem_cache_create(conf->cache_name[conf->active_name],
  741. sizeof(struct stripe_head)+(devs-1)*sizeof(struct r5dev),
  742. 0, 0, NULL);
  743. if (!sc)
  744. return 1;
  745. conf->slab_cache = sc;
  746. conf->pool_size = devs;
  747. while (num--)
  748. if (!grow_one_stripe(conf))
  749. return 1;
  750. return 0;
  751. }
  752. #ifdef CONFIG_MD_RAID5_RESHAPE
  753. static int resize_stripes(raid5_conf_t *conf, int newsize)
  754. {
  755. /* Make all the stripes able to hold 'newsize' devices.
  756. * New slots in each stripe get 'page' set to a new page.
  757. *
  758. * This happens in stages:
  759. * 1/ create a new kmem_cache and allocate the required number of
  760. * stripe_heads.
  761. * 2/ gather all the old stripe_heads and tranfer the pages across
  762. * to the new stripe_heads. This will have the side effect of
  763. * freezing the array as once all stripe_heads have been collected,
  764. * no IO will be possible. Old stripe heads are freed once their
  765. * pages have been transferred over, and the old kmem_cache is
  766. * freed when all stripes are done.
  767. * 3/ reallocate conf->disks to be suitable bigger. If this fails,
  768. * we simple return a failre status - no need to clean anything up.
  769. * 4/ allocate new pages for the new slots in the new stripe_heads.
  770. * If this fails, we don't bother trying the shrink the
  771. * stripe_heads down again, we just leave them as they are.
  772. * As each stripe_head is processed the new one is released into
  773. * active service.
  774. *
  775. * Once step2 is started, we cannot afford to wait for a write,
  776. * so we use GFP_NOIO allocations.
  777. */
  778. struct stripe_head *osh, *nsh;
  779. LIST_HEAD(newstripes);
  780. struct disk_info *ndisks;
  781. int err;
  782. struct kmem_cache *sc;
  783. int i;
  784. if (newsize <= conf->pool_size)
  785. return 0; /* never bother to shrink */
  786. err = md_allow_write(conf->mddev);
  787. if (err)
  788. return err;
  789. /* Step 1 */
  790. sc = kmem_cache_create(conf->cache_name[1-conf->active_name],
  791. sizeof(struct stripe_head)+(newsize-1)*sizeof(struct r5dev),
  792. 0, 0, NULL);
  793. if (!sc)
  794. return -ENOMEM;
  795. for (i = conf->max_nr_stripes; i; i--) {
  796. nsh = kmem_cache_alloc(sc, GFP_KERNEL);
  797. if (!nsh)
  798. break;
  799. memset(nsh, 0, sizeof(*nsh) + (newsize-1)*sizeof(struct r5dev));
  800. nsh->raid_conf = conf;
  801. spin_lock_init(&nsh->lock);
  802. list_add(&nsh->lru, &newstripes);
  803. }
  804. if (i) {
  805. /* didn't get enough, give up */
  806. while (!list_empty(&newstripes)) {
  807. nsh = list_entry(newstripes.next, struct stripe_head, lru);
  808. list_del(&nsh->lru);
  809. kmem_cache_free(sc, nsh);
  810. }
  811. kmem_cache_destroy(sc);
  812. return -ENOMEM;
  813. }
  814. /* Step 2 - Must use GFP_NOIO now.
  815. * OK, we have enough stripes, start collecting inactive
  816. * stripes and copying them over
  817. */
  818. list_for_each_entry(nsh, &newstripes, lru) {
  819. spin_lock_irq(&conf->device_lock);
  820. wait_event_lock_irq(conf->wait_for_stripe,
  821. !list_empty(&conf->inactive_list),
  822. conf->device_lock,
  823. unplug_slaves(conf->mddev)
  824. );
  825. osh = get_free_stripe(conf);
  826. spin_unlock_irq(&conf->device_lock);
  827. atomic_set(&nsh->count, 1);
  828. for(i=0; i<conf->pool_size; i++)
  829. nsh->dev[i].page = osh->dev[i].page;
  830. for( ; i<newsize; i++)
  831. nsh->dev[i].page = NULL;
  832. kmem_cache_free(conf->slab_cache, osh);
  833. }
  834. kmem_cache_destroy(conf->slab_cache);
  835. /* Step 3.
  836. * At this point, we are holding all the stripes so the array
  837. * is completely stalled, so now is a good time to resize
  838. * conf->disks.
  839. */
  840. ndisks = kzalloc(newsize * sizeof(struct disk_info), GFP_NOIO);
  841. if (ndisks) {
  842. for (i=0; i<conf->raid_disks; i++)
  843. ndisks[i] = conf->disks[i];
  844. kfree(conf->disks);
  845. conf->disks = ndisks;
  846. } else
  847. err = -ENOMEM;
  848. /* Step 4, return new stripes to service */
  849. while(!list_empty(&newstripes)) {
  850. nsh = list_entry(newstripes.next, struct stripe_head, lru);
  851. list_del_init(&nsh->lru);
  852. for (i=conf->raid_disks; i < newsize; i++)
  853. if (nsh->dev[i].page == NULL) {
  854. struct page *p = alloc_page(GFP_NOIO);
  855. nsh->dev[i].page = p;
  856. if (!p)
  857. err = -ENOMEM;
  858. }
  859. release_stripe(nsh);
  860. }
  861. /* critical section pass, GFP_NOIO no longer needed */
  862. conf->slab_cache = sc;
  863. conf->active_name = 1-conf->active_name;
  864. conf->pool_size = newsize;
  865. return err;
  866. }
  867. #endif
  868. static int drop_one_stripe(raid5_conf_t *conf)
  869. {
  870. struct stripe_head *sh;
  871. spin_lock_irq(&conf->device_lock);
  872. sh = get_free_stripe(conf);
  873. spin_unlock_irq(&conf->device_lock);
  874. if (!sh)
  875. return 0;
  876. BUG_ON(atomic_read(&sh->count));
  877. shrink_buffers(sh, conf->pool_size);
  878. kmem_cache_free(conf->slab_cache, sh);
  879. atomic_dec(&conf->active_stripes);
  880. return 1;
  881. }
  882. static void shrink_stripes(raid5_conf_t *conf)
  883. {
  884. while (drop_one_stripe(conf))
  885. ;
  886. if (conf->slab_cache)
  887. kmem_cache_destroy(conf->slab_cache);
  888. conf->slab_cache = NULL;
  889. }
  890. static void raid5_end_read_request(struct bio * bi, int error)
  891. {
  892. struct stripe_head *sh = bi->bi_private;
  893. raid5_conf_t *conf = sh->raid_conf;
  894. int disks = sh->disks, i;
  895. int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
  896. char b[BDEVNAME_SIZE];
  897. mdk_rdev_t *rdev;
  898. for (i=0 ; i<disks; i++)
  899. if (bi == &sh->dev[i].req)
  900. break;
  901. pr_debug("end_read_request %llu/%d, count: %d, uptodate %d.\n",
  902. (unsigned long long)sh->sector, i, atomic_read(&sh->count),
  903. uptodate);
  904. if (i == disks) {
  905. BUG();
  906. return;
  907. }
  908. if (uptodate) {
  909. set_bit(R5_UPTODATE, &sh->dev[i].flags);
  910. if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
  911. rdev = conf->disks[i].rdev;
  912. printk_rl(KERN_INFO "raid5:%s: read error corrected"
  913. " (%lu sectors at %llu on %s)\n",
  914. mdname(conf->mddev), STRIPE_SECTORS,
  915. (unsigned long long)(sh->sector
  916. + rdev->data_offset),
  917. bdevname(rdev->bdev, b));
  918. clear_bit(R5_ReadError, &sh->dev[i].flags);
  919. clear_bit(R5_ReWrite, &sh->dev[i].flags);
  920. }
  921. if (atomic_read(&conf->disks[i].rdev->read_errors))
  922. atomic_set(&conf->disks[i].rdev->read_errors, 0);
  923. } else {
  924. const char *bdn = bdevname(conf->disks[i].rdev->bdev, b);
  925. int retry = 0;
  926. rdev = conf->disks[i].rdev;
  927. clear_bit(R5_UPTODATE, &sh->dev[i].flags);
  928. atomic_inc(&rdev->read_errors);
  929. if (conf->mddev->degraded)
  930. printk_rl(KERN_WARNING
  931. "raid5:%s: read error not correctable "
  932. "(sector %llu on %s).\n",
  933. mdname(conf->mddev),
  934. (unsigned long long)(sh->sector
  935. + rdev->data_offset),
  936. bdn);
  937. else if (test_bit(R5_ReWrite, &sh->dev[i].flags))
  938. /* Oh, no!!! */
  939. printk_rl(KERN_WARNING
  940. "raid5:%s: read error NOT corrected!! "
  941. "(sector %llu on %s).\n",
  942. mdname(conf->mddev),
  943. (unsigned long long)(sh->sector
  944. + rdev->data_offset),
  945. bdn);
  946. else if (atomic_read(&rdev->read_errors)
  947. > conf->max_nr_stripes)
  948. printk(KERN_WARNING
  949. "raid5:%s: Too many read errors, failing device %s.\n",
  950. mdname(conf->mddev), bdn);
  951. else
  952. retry = 1;
  953. if (retry)
  954. set_bit(R5_ReadError, &sh->dev[i].flags);
  955. else {
  956. clear_bit(R5_ReadError, &sh->dev[i].flags);
  957. clear_bit(R5_ReWrite, &sh->dev[i].flags);
  958. md_error(conf->mddev, rdev);
  959. }
  960. }
  961. rdev_dec_pending(conf->disks[i].rdev, conf->mddev);
  962. clear_bit(R5_LOCKED, &sh->dev[i].flags);
  963. set_bit(STRIPE_HANDLE, &sh->state);
  964. release_stripe(sh);
  965. }
  966. static void raid5_end_write_request (struct bio *bi, int error)
  967. {
  968. struct stripe_head *sh = bi->bi_private;
  969. raid5_conf_t *conf = sh->raid_conf;
  970. int disks = sh->disks, i;
  971. int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
  972. for (i=0 ; i<disks; i++)
  973. if (bi == &sh->dev[i].req)
  974. break;
  975. pr_debug("end_write_request %llu/%d, count %d, uptodate: %d.\n",
  976. (unsigned long long)sh->sector, i, atomic_read(&sh->count),
  977. uptodate);
  978. if (i == disks) {
  979. BUG();
  980. return;
  981. }
  982. if (!uptodate)
  983. md_error(conf->mddev, conf->disks[i].rdev);
  984. rdev_dec_pending(conf->disks[i].rdev, conf->mddev);
  985. clear_bit(R5_LOCKED, &sh->dev[i].flags);
  986. set_bit(STRIPE_HANDLE, &sh->state);
  987. release_stripe(sh);
  988. }
  989. static sector_t compute_blocknr(struct stripe_head *sh, int i);
  990. static void raid5_build_block (struct stripe_head *sh, int i)
  991. {
  992. struct r5dev *dev = &sh->dev[i];
  993. bio_init(&dev->req);
  994. dev->req.bi_io_vec = &dev->vec;
  995. dev->req.bi_vcnt++;
  996. dev->req.bi_max_vecs++;
  997. dev->vec.bv_page = dev->page;
  998. dev->vec.bv_len = STRIPE_SIZE;
  999. dev->vec.bv_offset = 0;
  1000. dev->req.bi_sector = sh->sector;
  1001. dev->req.bi_private = sh;
  1002. dev->flags = 0;
  1003. dev->sector = compute_blocknr(sh, i);
  1004. }
  1005. static void error(mddev_t *mddev, mdk_rdev_t *rdev)
  1006. {
  1007. char b[BDEVNAME_SIZE];
  1008. raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
  1009. pr_debug("raid5: error called\n");
  1010. if (!test_bit(Faulty, &rdev->flags)) {
  1011. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  1012. if (test_and_clear_bit(In_sync, &rdev->flags)) {
  1013. unsigned long flags;
  1014. spin_lock_irqsave(&conf->device_lock, flags);
  1015. mddev->degraded++;
  1016. spin_unlock_irqrestore(&conf->device_lock, flags);
  1017. /*
  1018. * if recovery was running, make sure it aborts.
  1019. */
  1020. set_bit(MD_RECOVERY_INTR, &mddev->recovery);
  1021. }
  1022. set_bit(Faulty, &rdev->flags);
  1023. printk (KERN_ALERT
  1024. "raid5: Disk failure on %s, disabling device.\n"
  1025. "raid5: Operation continuing on %d devices.\n",
  1026. bdevname(rdev->bdev,b), conf->raid_disks - mddev->degraded);
  1027. }
  1028. }
  1029. /*
  1030. * Input: a 'big' sector number,
  1031. * Output: index of the data and parity disk, and the sector # in them.
  1032. */
  1033. static sector_t raid5_compute_sector(sector_t r_sector, unsigned int raid_disks,
  1034. unsigned int data_disks, unsigned int * dd_idx,
  1035. unsigned int * pd_idx, raid5_conf_t *conf)
  1036. {
  1037. long stripe;
  1038. unsigned long chunk_number;
  1039. unsigned int chunk_offset;
  1040. sector_t new_sector;
  1041. int sectors_per_chunk = conf->chunk_size >> 9;
  1042. /* First compute the information on this sector */
  1043. /*
  1044. * Compute the chunk number and the sector offset inside the chunk
  1045. */
  1046. chunk_offset = sector_div(r_sector, sectors_per_chunk);
  1047. chunk_number = r_sector;
  1048. BUG_ON(r_sector != chunk_number);
  1049. /*
  1050. * Compute the stripe number
  1051. */
  1052. stripe = chunk_number / data_disks;
  1053. /*
  1054. * Compute the data disk and parity disk indexes inside the stripe
  1055. */
  1056. *dd_idx = chunk_number % data_disks;
  1057. /*
  1058. * Select the parity disk based on the user selected algorithm.
  1059. */
  1060. switch(conf->level) {
  1061. case 4:
  1062. *pd_idx = data_disks;
  1063. break;
  1064. case 5:
  1065. switch (conf->algorithm) {
  1066. case ALGORITHM_LEFT_ASYMMETRIC:
  1067. *pd_idx = data_disks - stripe % raid_disks;
  1068. if (*dd_idx >= *pd_idx)
  1069. (*dd_idx)++;
  1070. break;
  1071. case ALGORITHM_RIGHT_ASYMMETRIC:
  1072. *pd_idx = stripe % raid_disks;
  1073. if (*dd_idx >= *pd_idx)
  1074. (*dd_idx)++;
  1075. break;
  1076. case ALGORITHM_LEFT_SYMMETRIC:
  1077. *pd_idx = data_disks - stripe % raid_disks;
  1078. *dd_idx = (*pd_idx + 1 + *dd_idx) % raid_disks;
  1079. break;
  1080. case ALGORITHM_RIGHT_SYMMETRIC:
  1081. *pd_idx = stripe % raid_disks;
  1082. *dd_idx = (*pd_idx + 1 + *dd_idx) % raid_disks;
  1083. break;
  1084. default:
  1085. printk(KERN_ERR "raid5: unsupported algorithm %d\n",
  1086. conf->algorithm);
  1087. }
  1088. break;
  1089. case 6:
  1090. /**** FIX THIS ****/
  1091. switch (conf->algorithm) {
  1092. case ALGORITHM_LEFT_ASYMMETRIC:
  1093. *pd_idx = raid_disks - 1 - (stripe % raid_disks);
  1094. if (*pd_idx == raid_disks-1)
  1095. (*dd_idx)++; /* Q D D D P */
  1096. else if (*dd_idx >= *pd_idx)
  1097. (*dd_idx) += 2; /* D D P Q D */
  1098. break;
  1099. case ALGORITHM_RIGHT_ASYMMETRIC:
  1100. *pd_idx = stripe % raid_disks;
  1101. if (*pd_idx == raid_disks-1)
  1102. (*dd_idx)++; /* Q D D D P */
  1103. else if (*dd_idx >= *pd_idx)
  1104. (*dd_idx) += 2; /* D D P Q D */
  1105. break;
  1106. case ALGORITHM_LEFT_SYMMETRIC:
  1107. *pd_idx = raid_disks - 1 - (stripe % raid_disks);
  1108. *dd_idx = (*pd_idx + 2 + *dd_idx) % raid_disks;
  1109. break;
  1110. case ALGORITHM_RIGHT_SYMMETRIC:
  1111. *pd_idx = stripe % raid_disks;
  1112. *dd_idx = (*pd_idx + 2 + *dd_idx) % raid_disks;
  1113. break;
  1114. default:
  1115. printk (KERN_CRIT "raid6: unsupported algorithm %d\n",
  1116. conf->algorithm);
  1117. }
  1118. break;
  1119. }
  1120. /*
  1121. * Finally, compute the new sector number
  1122. */
  1123. new_sector = (sector_t)stripe * sectors_per_chunk + chunk_offset;
  1124. return new_sector;
  1125. }
  1126. static sector_t compute_blocknr(struct stripe_head *sh, int i)
  1127. {
  1128. raid5_conf_t *conf = sh->raid_conf;
  1129. int raid_disks = sh->disks;
  1130. int data_disks = raid_disks - conf->max_degraded;
  1131. sector_t new_sector = sh->sector, check;
  1132. int sectors_per_chunk = conf->chunk_size >> 9;
  1133. sector_t stripe;
  1134. int chunk_offset;
  1135. int chunk_number, dummy1, dummy2, dd_idx = i;
  1136. sector_t r_sector;
  1137. chunk_offset = sector_div(new_sector, sectors_per_chunk);
  1138. stripe = new_sector;
  1139. BUG_ON(new_sector != stripe);
  1140. if (i == sh->pd_idx)
  1141. return 0;
  1142. switch(conf->level) {
  1143. case 4: break;
  1144. case 5:
  1145. switch (conf->algorithm) {
  1146. case ALGORITHM_LEFT_ASYMMETRIC:
  1147. case ALGORITHM_RIGHT_ASYMMETRIC:
  1148. if (i > sh->pd_idx)
  1149. i--;
  1150. break;
  1151. case ALGORITHM_LEFT_SYMMETRIC:
  1152. case ALGORITHM_RIGHT_SYMMETRIC:
  1153. if (i < sh->pd_idx)
  1154. i += raid_disks;
  1155. i -= (sh->pd_idx + 1);
  1156. break;
  1157. default:
  1158. printk(KERN_ERR "raid5: unsupported algorithm %d\n",
  1159. conf->algorithm);
  1160. }
  1161. break;
  1162. case 6:
  1163. if (i == raid6_next_disk(sh->pd_idx, raid_disks))
  1164. return 0; /* It is the Q disk */
  1165. switch (conf->algorithm) {
  1166. case ALGORITHM_LEFT_ASYMMETRIC:
  1167. case ALGORITHM_RIGHT_ASYMMETRIC:
  1168. if (sh->pd_idx == raid_disks-1)
  1169. i--; /* Q D D D P */
  1170. else if (i > sh->pd_idx)
  1171. i -= 2; /* D D P Q D */
  1172. break;
  1173. case ALGORITHM_LEFT_SYMMETRIC:
  1174. case ALGORITHM_RIGHT_SYMMETRIC:
  1175. if (sh->pd_idx == raid_disks-1)
  1176. i--; /* Q D D D P */
  1177. else {
  1178. /* D D P Q D */
  1179. if (i < sh->pd_idx)
  1180. i += raid_disks;
  1181. i -= (sh->pd_idx + 2);
  1182. }
  1183. break;
  1184. default:
  1185. printk (KERN_CRIT "raid6: unsupported algorithm %d\n",
  1186. conf->algorithm);
  1187. }
  1188. break;
  1189. }
  1190. chunk_number = stripe * data_disks + i;
  1191. r_sector = (sector_t)chunk_number * sectors_per_chunk + chunk_offset;
  1192. check = raid5_compute_sector (r_sector, raid_disks, data_disks, &dummy1, &dummy2, conf);
  1193. if (check != sh->sector || dummy1 != dd_idx || dummy2 != sh->pd_idx) {
  1194. printk(KERN_ERR "compute_blocknr: map not correct\n");
  1195. return 0;
  1196. }
  1197. return r_sector;
  1198. }
  1199. /*
  1200. * Copy data between a page in the stripe cache, and one or more bion
  1201. * The page could align with the middle of the bio, or there could be
  1202. * several bion, each with several bio_vecs, which cover part of the page
  1203. * Multiple bion are linked together on bi_next. There may be extras
  1204. * at the end of this list. We ignore them.
  1205. */
  1206. static void copy_data(int frombio, struct bio *bio,
  1207. struct page *page,
  1208. sector_t sector)
  1209. {
  1210. char *pa = page_address(page);
  1211. struct bio_vec *bvl;
  1212. int i;
  1213. int page_offset;
  1214. if (bio->bi_sector >= sector)
  1215. page_offset = (signed)(bio->bi_sector - sector) * 512;
  1216. else
  1217. page_offset = (signed)(sector - bio->bi_sector) * -512;
  1218. bio_for_each_segment(bvl, bio, i) {
  1219. int len = bio_iovec_idx(bio,i)->bv_len;
  1220. int clen;
  1221. int b_offset = 0;
  1222. if (page_offset < 0) {
  1223. b_offset = -page_offset;
  1224. page_offset += b_offset;
  1225. len -= b_offset;
  1226. }
  1227. if (len > 0 && page_offset + len > STRIPE_SIZE)
  1228. clen = STRIPE_SIZE - page_offset;
  1229. else clen = len;
  1230. if (clen > 0) {
  1231. char *ba = __bio_kmap_atomic(bio, i, KM_USER0);
  1232. if (frombio)
  1233. memcpy(pa+page_offset, ba+b_offset, clen);
  1234. else
  1235. memcpy(ba+b_offset, pa+page_offset, clen);
  1236. __bio_kunmap_atomic(ba, KM_USER0);
  1237. }
  1238. if (clen < len) /* hit end of page */
  1239. break;
  1240. page_offset += len;
  1241. }
  1242. }
  1243. #define check_xor() do { \
  1244. if (count == MAX_XOR_BLOCKS) { \
  1245. xor_blocks(count, STRIPE_SIZE, dest, ptr);\
  1246. count = 0; \
  1247. } \
  1248. } while(0)
  1249. static void compute_parity6(struct stripe_head *sh, int method)
  1250. {
  1251. raid6_conf_t *conf = sh->raid_conf;
  1252. int i, pd_idx = sh->pd_idx, qd_idx, d0_idx, disks = sh->disks, count;
  1253. struct bio *chosen;
  1254. /**** FIX THIS: This could be very bad if disks is close to 256 ****/
  1255. void *ptrs[disks];
  1256. qd_idx = raid6_next_disk(pd_idx, disks);
  1257. d0_idx = raid6_next_disk(qd_idx, disks);
  1258. pr_debug("compute_parity, stripe %llu, method %d\n",
  1259. (unsigned long long)sh->sector, method);
  1260. switch(method) {
  1261. case READ_MODIFY_WRITE:
  1262. BUG(); /* READ_MODIFY_WRITE N/A for RAID-6 */
  1263. case RECONSTRUCT_WRITE:
  1264. for (i= disks; i-- ;)
  1265. if ( i != pd_idx && i != qd_idx && sh->dev[i].towrite ) {
  1266. chosen = sh->dev[i].towrite;
  1267. sh->dev[i].towrite = NULL;
  1268. if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
  1269. wake_up(&conf->wait_for_overlap);
  1270. BUG_ON(sh->dev[i].written);
  1271. sh->dev[i].written = chosen;
  1272. }
  1273. break;
  1274. case CHECK_PARITY:
  1275. BUG(); /* Not implemented yet */
  1276. }
  1277. for (i = disks; i--;)
  1278. if (sh->dev[i].written) {
  1279. sector_t sector = sh->dev[i].sector;
  1280. struct bio *wbi = sh->dev[i].written;
  1281. while (wbi && wbi->bi_sector < sector + STRIPE_SECTORS) {
  1282. copy_data(1, wbi, sh->dev[i].page, sector);
  1283. wbi = r5_next_bio(wbi, sector);
  1284. }
  1285. set_bit(R5_LOCKED, &sh->dev[i].flags);
  1286. set_bit(R5_UPTODATE, &sh->dev[i].flags);
  1287. }
  1288. // switch(method) {
  1289. // case RECONSTRUCT_WRITE:
  1290. // case CHECK_PARITY:
  1291. // case UPDATE_PARITY:
  1292. /* Note that unlike RAID-5, the ordering of the disks matters greatly. */
  1293. /* FIX: Is this ordering of drives even remotely optimal? */
  1294. count = 0;
  1295. i = d0_idx;
  1296. do {
  1297. ptrs[count++] = page_address(sh->dev[i].page);
  1298. if (count <= disks-2 && !test_bit(R5_UPTODATE, &sh->dev[i].flags))
  1299. printk("block %d/%d not uptodate on parity calc\n", i,count);
  1300. i = raid6_next_disk(i, disks);
  1301. } while ( i != d0_idx );
  1302. // break;
  1303. // }
  1304. raid6_call.gen_syndrome(disks, STRIPE_SIZE, ptrs);
  1305. switch(method) {
  1306. case RECONSTRUCT_WRITE:
  1307. set_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
  1308. set_bit(R5_UPTODATE, &sh->dev[qd_idx].flags);
  1309. set_bit(R5_LOCKED, &sh->dev[pd_idx].flags);
  1310. set_bit(R5_LOCKED, &sh->dev[qd_idx].flags);
  1311. break;
  1312. case UPDATE_PARITY:
  1313. set_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
  1314. set_bit(R5_UPTODATE, &sh->dev[qd_idx].flags);
  1315. break;
  1316. }
  1317. }
  1318. /* Compute one missing block */
  1319. static void compute_block_1(struct stripe_head *sh, int dd_idx, int nozero)
  1320. {
  1321. int i, count, disks = sh->disks;
  1322. void *ptr[MAX_XOR_BLOCKS], *dest, *p;
  1323. int pd_idx = sh->pd_idx;
  1324. int qd_idx = raid6_next_disk(pd_idx, disks);
  1325. pr_debug("compute_block_1, stripe %llu, idx %d\n",
  1326. (unsigned long long)sh->sector, dd_idx);
  1327. if ( dd_idx == qd_idx ) {
  1328. /* We're actually computing the Q drive */
  1329. compute_parity6(sh, UPDATE_PARITY);
  1330. } else {
  1331. dest = page_address(sh->dev[dd_idx].page);
  1332. if (!nozero) memset(dest, 0, STRIPE_SIZE);
  1333. count = 0;
  1334. for (i = disks ; i--; ) {
  1335. if (i == dd_idx || i == qd_idx)
  1336. continue;
  1337. p = page_address(sh->dev[i].page);
  1338. if (test_bit(R5_UPTODATE, &sh->dev[i].flags))
  1339. ptr[count++] = p;
  1340. else
  1341. printk("compute_block() %d, stripe %llu, %d"
  1342. " not present\n", dd_idx,
  1343. (unsigned long long)sh->sector, i);
  1344. check_xor();
  1345. }
  1346. if (count)
  1347. xor_blocks(count, STRIPE_SIZE, dest, ptr);
  1348. if (!nozero) set_bit(R5_UPTODATE, &sh->dev[dd_idx].flags);
  1349. else clear_bit(R5_UPTODATE, &sh->dev[dd_idx].flags);
  1350. }
  1351. }
  1352. /* Compute two missing blocks */
  1353. static void compute_block_2(struct stripe_head *sh, int dd_idx1, int dd_idx2)
  1354. {
  1355. int i, count, disks = sh->disks;
  1356. int pd_idx = sh->pd_idx;
  1357. int qd_idx = raid6_next_disk(pd_idx, disks);
  1358. int d0_idx = raid6_next_disk(qd_idx, disks);
  1359. int faila, failb;
  1360. /* faila and failb are disk numbers relative to d0_idx */
  1361. /* pd_idx become disks-2 and qd_idx become disks-1 */
  1362. faila = (dd_idx1 < d0_idx) ? dd_idx1+(disks-d0_idx) : dd_idx1-d0_idx;
  1363. failb = (dd_idx2 < d0_idx) ? dd_idx2+(disks-d0_idx) : dd_idx2-d0_idx;
  1364. BUG_ON(faila == failb);
  1365. if ( failb < faila ) { int tmp = faila; faila = failb; failb = tmp; }
  1366. pr_debug("compute_block_2, stripe %llu, idx %d,%d (%d,%d)\n",
  1367. (unsigned long long)sh->sector, dd_idx1, dd_idx2, faila, failb);
  1368. if ( failb == disks-1 ) {
  1369. /* Q disk is one of the missing disks */
  1370. if ( faila == disks-2 ) {
  1371. /* Missing P+Q, just recompute */
  1372. compute_parity6(sh, UPDATE_PARITY);
  1373. return;
  1374. } else {
  1375. /* We're missing D+Q; recompute D from P */
  1376. compute_block_1(sh, (dd_idx1 == qd_idx) ? dd_idx2 : dd_idx1, 0);
  1377. compute_parity6(sh, UPDATE_PARITY); /* Is this necessary? */
  1378. return;
  1379. }
  1380. }
  1381. /* We're missing D+P or D+D; build pointer table */
  1382. {
  1383. /**** FIX THIS: This could be very bad if disks is close to 256 ****/
  1384. void *ptrs[disks];
  1385. count = 0;
  1386. i = d0_idx;
  1387. do {
  1388. ptrs[count++] = page_address(sh->dev[i].page);
  1389. i = raid6_next_disk(i, disks);
  1390. if (i != dd_idx1 && i != dd_idx2 &&
  1391. !test_bit(R5_UPTODATE, &sh->dev[i].flags))
  1392. printk("compute_2 with missing block %d/%d\n", count, i);
  1393. } while ( i != d0_idx );
  1394. if ( failb == disks-2 ) {
  1395. /* We're missing D+P. */
  1396. raid6_datap_recov(disks, STRIPE_SIZE, faila, ptrs);
  1397. } else {
  1398. /* We're missing D+D. */
  1399. raid6_2data_recov(disks, STRIPE_SIZE, faila, failb, ptrs);
  1400. }
  1401. /* Both the above update both missing blocks */
  1402. set_bit(R5_UPTODATE, &sh->dev[dd_idx1].flags);
  1403. set_bit(R5_UPTODATE, &sh->dev[dd_idx2].flags);
  1404. }
  1405. }
  1406. static void
  1407. schedule_reconstruction5(struct stripe_head *sh, struct stripe_head_state *s,
  1408. int rcw, int expand)
  1409. {
  1410. int i, pd_idx = sh->pd_idx, disks = sh->disks;
  1411. if (rcw) {
  1412. /* if we are not expanding this is a proper write request, and
  1413. * there will be bios with new data to be drained into the
  1414. * stripe cache
  1415. */
  1416. if (!expand) {
  1417. sh->reconstruct_state = reconstruct_state_drain_run;
  1418. set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
  1419. } else
  1420. sh->reconstruct_state = reconstruct_state_run;
  1421. set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
  1422. for (i = disks; i--; ) {
  1423. struct r5dev *dev = &sh->dev[i];
  1424. if (dev->towrite) {
  1425. set_bit(R5_LOCKED, &dev->flags);
  1426. set_bit(R5_Wantdrain, &dev->flags);
  1427. if (!expand)
  1428. clear_bit(R5_UPTODATE, &dev->flags);
  1429. s->locked++;
  1430. }
  1431. }
  1432. if (s->locked + 1 == disks)
  1433. if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
  1434. atomic_inc(&sh->raid_conf->pending_full_writes);
  1435. } else {
  1436. BUG_ON(!(test_bit(R5_UPTODATE, &sh->dev[pd_idx].flags) ||
  1437. test_bit(R5_Wantcompute, &sh->dev[pd_idx].flags)));
  1438. sh->reconstruct_state = reconstruct_state_prexor_drain_run;
  1439. set_bit(STRIPE_OP_PREXOR, &s->ops_request);
  1440. set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
  1441. set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
  1442. for (i = disks; i--; ) {
  1443. struct r5dev *dev = &sh->dev[i];
  1444. if (i == pd_idx)
  1445. continue;
  1446. if (dev->towrite &&
  1447. (test_bit(R5_UPTODATE, &dev->flags) ||
  1448. test_bit(R5_Wantcompute, &dev->flags))) {
  1449. set_bit(R5_Wantdrain, &dev->flags);
  1450. set_bit(R5_LOCKED, &dev->flags);
  1451. clear_bit(R5_UPTODATE, &dev->flags);
  1452. s->locked++;
  1453. }
  1454. }
  1455. }
  1456. /* keep the parity disk locked while asynchronous operations
  1457. * are in flight
  1458. */
  1459. set_bit(R5_LOCKED, &sh->dev[pd_idx].flags);
  1460. clear_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
  1461. s->locked++;
  1462. pr_debug("%s: stripe %llu locked: %d ops_request: %lx\n",
  1463. __func__, (unsigned long long)sh->sector,
  1464. s->locked, s->ops_request);
  1465. }
  1466. /*
  1467. * Each stripe/dev can have one or more bion attached.
  1468. * toread/towrite point to the first in a chain.
  1469. * The bi_next chain must be in order.
  1470. */
  1471. static int add_stripe_bio(struct stripe_head *sh, struct bio *bi, int dd_idx, int forwrite)
  1472. {
  1473. struct bio **bip;
  1474. raid5_conf_t *conf = sh->raid_conf;
  1475. int firstwrite=0;
  1476. pr_debug("adding bh b#%llu to stripe s#%llu\n",
  1477. (unsigned long long)bi->bi_sector,
  1478. (unsigned long long)sh->sector);
  1479. spin_lock(&sh->lock);
  1480. spin_lock_irq(&conf->device_lock);
  1481. if (forwrite) {
  1482. bip = &sh->dev[dd_idx].towrite;
  1483. if (*bip == NULL && sh->dev[dd_idx].written == NULL)
  1484. firstwrite = 1;
  1485. } else
  1486. bip = &sh->dev[dd_idx].toread;
  1487. while (*bip && (*bip)->bi_sector < bi->bi_sector) {
  1488. if ((*bip)->bi_sector + ((*bip)->bi_size >> 9) > bi->bi_sector)
  1489. goto overlap;
  1490. bip = & (*bip)->bi_next;
  1491. }
  1492. if (*bip && (*bip)->bi_sector < bi->bi_sector + ((bi->bi_size)>>9))
  1493. goto overlap;
  1494. BUG_ON(*bip && bi->bi_next && (*bip) != bi->bi_next);
  1495. if (*bip)
  1496. bi->bi_next = *bip;
  1497. *bip = bi;
  1498. bi->bi_phys_segments ++;
  1499. spin_unlock_irq(&conf->device_lock);
  1500. spin_unlock(&sh->lock);
  1501. pr_debug("added bi b#%llu to stripe s#%llu, disk %d.\n",
  1502. (unsigned long long)bi->bi_sector,
  1503. (unsigned long long)sh->sector, dd_idx);
  1504. if (conf->mddev->bitmap && firstwrite) {
  1505. bitmap_startwrite(conf->mddev->bitmap, sh->sector,
  1506. STRIPE_SECTORS, 0);
  1507. sh->bm_seq = conf->seq_flush+1;
  1508. set_bit(STRIPE_BIT_DELAY, &sh->state);
  1509. }
  1510. if (forwrite) {
  1511. /* check if page is covered */
  1512. sector_t sector = sh->dev[dd_idx].sector;
  1513. for (bi=sh->dev[dd_idx].towrite;
  1514. sector < sh->dev[dd_idx].sector + STRIPE_SECTORS &&
  1515. bi && bi->bi_sector <= sector;
  1516. bi = r5_next_bio(bi, sh->dev[dd_idx].sector)) {
  1517. if (bi->bi_sector + (bi->bi_size>>9) >= sector)
  1518. sector = bi->bi_sector + (bi->bi_size>>9);
  1519. }
  1520. if (sector >= sh->dev[dd_idx].sector + STRIPE_SECTORS)
  1521. set_bit(R5_OVERWRITE, &sh->dev[dd_idx].flags);
  1522. }
  1523. return 1;
  1524. overlap:
  1525. set_bit(R5_Overlap, &sh->dev[dd_idx].flags);
  1526. spin_unlock_irq(&conf->device_lock);
  1527. spin_unlock(&sh->lock);
  1528. return 0;
  1529. }
  1530. static void end_reshape(raid5_conf_t *conf);
  1531. static int page_is_zero(struct page *p)
  1532. {
  1533. char *a = page_address(p);
  1534. return ((*(u32*)a) == 0 &&
  1535. memcmp(a, a+4, STRIPE_SIZE-4)==0);
  1536. }
  1537. static int stripe_to_pdidx(sector_t stripe, raid5_conf_t *conf, int disks)
  1538. {
  1539. int sectors_per_chunk = conf->chunk_size >> 9;
  1540. int pd_idx, dd_idx;
  1541. int chunk_offset = sector_div(stripe, sectors_per_chunk);
  1542. raid5_compute_sector(stripe * (disks - conf->max_degraded)
  1543. *sectors_per_chunk + chunk_offset,
  1544. disks, disks - conf->max_degraded,
  1545. &dd_idx, &pd_idx, conf);
  1546. return pd_idx;
  1547. }
  1548. static void
  1549. handle_failed_stripe(raid5_conf_t *conf, struct stripe_head *sh,
  1550. struct stripe_head_state *s, int disks,
  1551. struct bio **return_bi)
  1552. {
  1553. int i;
  1554. for (i = disks; i--; ) {
  1555. struct bio *bi;
  1556. int bitmap_end = 0;
  1557. if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
  1558. mdk_rdev_t *rdev;
  1559. rcu_read_lock();
  1560. rdev = rcu_dereference(conf->disks[i].rdev);
  1561. if (rdev && test_bit(In_sync, &rdev->flags))
  1562. /* multiple read failures in one stripe */
  1563. md_error(conf->mddev, rdev);
  1564. rcu_read_unlock();
  1565. }
  1566. spin_lock_irq(&conf->device_lock);
  1567. /* fail all writes first */
  1568. bi = sh->dev[i].towrite;
  1569. sh->dev[i].towrite = NULL;
  1570. if (bi) {
  1571. s->to_write--;
  1572. bitmap_end = 1;
  1573. }
  1574. if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
  1575. wake_up(&conf->wait_for_overlap);
  1576. while (bi && bi->bi_sector <
  1577. sh->dev[i].sector + STRIPE_SECTORS) {
  1578. struct bio *nextbi = r5_next_bio(bi, sh->dev[i].sector);
  1579. clear_bit(BIO_UPTODATE, &bi->bi_flags);
  1580. if (--bi->bi_phys_segments == 0) {
  1581. md_write_end(conf->mddev);
  1582. bi->bi_next = *return_bi;
  1583. *return_bi = bi;
  1584. }
  1585. bi = nextbi;
  1586. }
  1587. /* and fail all 'written' */
  1588. bi = sh->dev[i].written;
  1589. sh->dev[i].written = NULL;
  1590. if (bi) bitmap_end = 1;
  1591. while (bi && bi->bi_sector <
  1592. sh->dev[i].sector + STRIPE_SECTORS) {
  1593. struct bio *bi2 = r5_next_bio(bi, sh->dev[i].sector);
  1594. clear_bit(BIO_UPTODATE, &bi->bi_flags);
  1595. if (--bi->bi_phys_segments == 0) {
  1596. md_write_end(conf->mddev);
  1597. bi->bi_next = *return_bi;
  1598. *return_bi = bi;
  1599. }
  1600. bi = bi2;
  1601. }
  1602. /* fail any reads if this device is non-operational and
  1603. * the data has not reached the cache yet.
  1604. */
  1605. if (!test_bit(R5_Wantfill, &sh->dev[i].flags) &&
  1606. (!test_bit(R5_Insync, &sh->dev[i].flags) ||
  1607. test_bit(R5_ReadError, &sh->dev[i].flags))) {
  1608. bi = sh->dev[i].toread;
  1609. sh->dev[i].toread = NULL;
  1610. if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
  1611. wake_up(&conf->wait_for_overlap);
  1612. if (bi) s->to_read--;
  1613. while (bi && bi->bi_sector <
  1614. sh->dev[i].sector + STRIPE_SECTORS) {
  1615. struct bio *nextbi =
  1616. r5_next_bio(bi, sh->dev[i].sector);
  1617. clear_bit(BIO_UPTODATE, &bi->bi_flags);
  1618. if (--bi->bi_phys_segments == 0) {
  1619. bi->bi_next = *return_bi;
  1620. *return_bi = bi;
  1621. }
  1622. bi = nextbi;
  1623. }
  1624. }
  1625. spin_unlock_irq(&conf->device_lock);
  1626. if (bitmap_end)
  1627. bitmap_endwrite(conf->mddev->bitmap, sh->sector,
  1628. STRIPE_SECTORS, 0, 0);
  1629. }
  1630. if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
  1631. if (atomic_dec_and_test(&conf->pending_full_writes))
  1632. md_wakeup_thread(conf->mddev->thread);
  1633. }
  1634. /* fetch_block5 - checks the given member device to see if its data needs
  1635. * to be read or computed to satisfy a request.
  1636. *
  1637. * Returns 1 when no more member devices need to be checked, otherwise returns
  1638. * 0 to tell the loop in handle_stripe_fill5 to continue
  1639. */
  1640. static int fetch_block5(struct stripe_head *sh, struct stripe_head_state *s,
  1641. int disk_idx, int disks)
  1642. {
  1643. struct r5dev *dev = &sh->dev[disk_idx];
  1644. struct r5dev *failed_dev = &sh->dev[s->failed_num];
  1645. /* is the data in this block needed, and can we get it? */
  1646. if (!test_bit(R5_LOCKED, &dev->flags) &&
  1647. !test_bit(R5_UPTODATE, &dev->flags) &&
  1648. (dev->toread ||
  1649. (dev->towrite && !test_bit(R5_OVERWRITE, &dev->flags)) ||
  1650. s->syncing || s->expanding ||
  1651. (s->failed &&
  1652. (failed_dev->toread ||
  1653. (failed_dev->towrite &&
  1654. !test_bit(R5_OVERWRITE, &failed_dev->flags)))))) {
  1655. /* We would like to get this block, possibly by computing it,
  1656. * otherwise read it if the backing disk is insync
  1657. */
  1658. if ((s->uptodate == disks - 1) &&
  1659. (s->failed && disk_idx == s->failed_num)) {
  1660. set_bit(STRIPE_COMPUTE_RUN, &sh->state);
  1661. set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
  1662. set_bit(R5_Wantcompute, &dev->flags);
  1663. sh->ops.target = disk_idx;
  1664. s->req_compute = 1;
  1665. /* Careful: from this point on 'uptodate' is in the eye
  1666. * of raid5_run_ops which services 'compute' operations
  1667. * before writes. R5_Wantcompute flags a block that will
  1668. * be R5_UPTODATE by the time it is needed for a
  1669. * subsequent operation.
  1670. */
  1671. s->uptodate++;
  1672. return 1; /* uptodate + compute == disks */
  1673. } else if (test_bit(R5_Insync, &dev->flags)) {
  1674. set_bit(R5_LOCKED, &dev->flags);
  1675. set_bit(R5_Wantread, &dev->flags);
  1676. s->locked++;
  1677. pr_debug("Reading block %d (sync=%d)\n", disk_idx,
  1678. s->syncing);
  1679. }
  1680. }
  1681. return 0;
  1682. }
  1683. /**
  1684. * handle_stripe_fill5 - read or compute data to satisfy pending requests.
  1685. */
  1686. static void handle_stripe_fill5(struct stripe_head *sh,
  1687. struct stripe_head_state *s, int disks)
  1688. {
  1689. int i;
  1690. /* look for blocks to read/compute, skip this if a compute
  1691. * is already in flight, or if the stripe contents are in the
  1692. * midst of changing due to a write
  1693. */
  1694. if (!test_bit(STRIPE_COMPUTE_RUN, &sh->state) && !sh->check_state &&
  1695. !sh->reconstruct_state)
  1696. for (i = disks; i--; )
  1697. if (fetch_block5(sh, s, i, disks))
  1698. break;
  1699. set_bit(STRIPE_HANDLE, &sh->state);
  1700. }
  1701. static void handle_stripe_fill6(struct stripe_head *sh,
  1702. struct stripe_head_state *s, struct r6_state *r6s,
  1703. int disks)
  1704. {
  1705. int i;
  1706. for (i = disks; i--; ) {
  1707. struct r5dev *dev = &sh->dev[i];
  1708. if (!test_bit(R5_LOCKED, &dev->flags) &&
  1709. !test_bit(R5_UPTODATE, &dev->flags) &&
  1710. (dev->toread || (dev->towrite &&
  1711. !test_bit(R5_OVERWRITE, &dev->flags)) ||
  1712. s->syncing || s->expanding ||
  1713. (s->failed >= 1 &&
  1714. (sh->dev[r6s->failed_num[0]].toread ||
  1715. s->to_write)) ||
  1716. (s->failed >= 2 &&
  1717. (sh->dev[r6s->failed_num[1]].toread ||
  1718. s->to_write)))) {
  1719. /* we would like to get this block, possibly
  1720. * by computing it, but we might not be able to
  1721. */
  1722. if ((s->uptodate == disks - 1) &&
  1723. (s->failed && (i == r6s->failed_num[0] ||
  1724. i == r6s->failed_num[1]))) {
  1725. pr_debug("Computing stripe %llu block %d\n",
  1726. (unsigned long long)sh->sector, i);
  1727. compute_block_1(sh, i, 0);
  1728. s->uptodate++;
  1729. } else if ( s->uptodate == disks-2 && s->failed >= 2 ) {
  1730. /* Computing 2-failure is *very* expensive; only
  1731. * do it if failed >= 2
  1732. */
  1733. int other;
  1734. for (other = disks; other--; ) {
  1735. if (other == i)
  1736. continue;
  1737. if (!test_bit(R5_UPTODATE,
  1738. &sh->dev[other].flags))
  1739. break;
  1740. }
  1741. BUG_ON(other < 0);
  1742. pr_debug("Computing stripe %llu blocks %d,%d\n",
  1743. (unsigned long long)sh->sector,
  1744. i, other);
  1745. compute_block_2(sh, i, other);
  1746. s->uptodate += 2;
  1747. } else if (test_bit(R5_Insync, &dev->flags)) {
  1748. set_bit(R5_LOCKED, &dev->flags);
  1749. set_bit(R5_Wantread, &dev->flags);
  1750. s->locked++;
  1751. pr_debug("Reading block %d (sync=%d)\n",
  1752. i, s->syncing);
  1753. }
  1754. }
  1755. }
  1756. set_bit(STRIPE_HANDLE, &sh->state);
  1757. }
  1758. /* handle_stripe_clean_event
  1759. * any written block on an uptodate or failed drive can be returned.
  1760. * Note that if we 'wrote' to a failed drive, it will be UPTODATE, but
  1761. * never LOCKED, so we don't need to test 'failed' directly.
  1762. */
  1763. static void handle_stripe_clean_event(raid5_conf_t *conf,
  1764. struct stripe_head *sh, int disks, struct bio **return_bi)
  1765. {
  1766. int i;
  1767. struct r5dev *dev;
  1768. for (i = disks; i--; )
  1769. if (sh->dev[i].written) {
  1770. dev = &sh->dev[i];
  1771. if (!test_bit(R5_LOCKED, &dev->flags) &&
  1772. test_bit(R5_UPTODATE, &dev->flags)) {
  1773. /* We can return any write requests */
  1774. struct bio *wbi, *wbi2;
  1775. int bitmap_end = 0;
  1776. pr_debug("Return write for disc %d\n", i);
  1777. spin_lock_irq(&conf->device_lock);
  1778. wbi = dev->written;
  1779. dev->written = NULL;
  1780. while (wbi && wbi->bi_sector <
  1781. dev->sector + STRIPE_SECTORS) {
  1782. wbi2 = r5_next_bio(wbi, dev->sector);
  1783. if (--wbi->bi_phys_segments == 0) {
  1784. md_write_end(conf->mddev);
  1785. wbi->bi_next = *return_bi;
  1786. *return_bi = wbi;
  1787. }
  1788. wbi = wbi2;
  1789. }
  1790. if (dev->towrite == NULL)
  1791. bitmap_end = 1;
  1792. spin_unlock_irq(&conf->device_lock);
  1793. if (bitmap_end)
  1794. bitmap_endwrite(conf->mddev->bitmap,
  1795. sh->sector,
  1796. STRIPE_SECTORS,
  1797. !test_bit(STRIPE_DEGRADED, &sh->state),
  1798. 0);
  1799. }
  1800. }
  1801. if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
  1802. if (atomic_dec_and_test(&conf->pending_full_writes))
  1803. md_wakeup_thread(conf->mddev->thread);
  1804. }
  1805. static void handle_stripe_dirtying5(raid5_conf_t *conf,
  1806. struct stripe_head *sh, struct stripe_head_state *s, int disks)
  1807. {
  1808. int rmw = 0, rcw = 0, i;
  1809. for (i = disks; i--; ) {
  1810. /* would I have to read this buffer for read_modify_write */
  1811. struct r5dev *dev = &sh->dev[i];
  1812. if ((dev->towrite || i == sh->pd_idx) &&
  1813. !test_bit(R5_LOCKED, &dev->flags) &&
  1814. !(test_bit(R5_UPTODATE, &dev->flags) ||
  1815. test_bit(R5_Wantcompute, &dev->flags))) {
  1816. if (test_bit(R5_Insync, &dev->flags))
  1817. rmw++;
  1818. else
  1819. rmw += 2*disks; /* cannot read it */
  1820. }
  1821. /* Would I have to read this buffer for reconstruct_write */
  1822. if (!test_bit(R5_OVERWRITE, &dev->flags) && i != sh->pd_idx &&
  1823. !test_bit(R5_LOCKED, &dev->flags) &&
  1824. !(test_bit(R5_UPTODATE, &dev->flags) ||
  1825. test_bit(R5_Wantcompute, &dev->flags))) {
  1826. if (test_bit(R5_Insync, &dev->flags)) rcw++;
  1827. else
  1828. rcw += 2*disks;
  1829. }
  1830. }
  1831. pr_debug("for sector %llu, rmw=%d rcw=%d\n",
  1832. (unsigned long long)sh->sector, rmw, rcw);
  1833. set_bit(STRIPE_HANDLE, &sh->state);
  1834. if (rmw < rcw && rmw > 0)
  1835. /* prefer read-modify-write, but need to get some data */
  1836. for (i = disks; i--; ) {
  1837. struct r5dev *dev = &sh->dev[i];
  1838. if ((dev->towrite || i == sh->pd_idx) &&
  1839. !test_bit(R5_LOCKED, &dev->flags) &&
  1840. !(test_bit(R5_UPTODATE, &dev->flags) ||
  1841. test_bit(R5_Wantcompute, &dev->flags)) &&
  1842. test_bit(R5_Insync, &dev->flags)) {
  1843. if (
  1844. test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
  1845. pr_debug("Read_old block "
  1846. "%d for r-m-w\n", i);
  1847. set_bit(R5_LOCKED, &dev->flags);
  1848. set_bit(R5_Wantread, &dev->flags);
  1849. s->locked++;
  1850. } else {
  1851. set_bit(STRIPE_DELAYED, &sh->state);
  1852. set_bit(STRIPE_HANDLE, &sh->state);
  1853. }
  1854. }
  1855. }
  1856. if (rcw <= rmw && rcw > 0)
  1857. /* want reconstruct write, but need to get some data */
  1858. for (i = disks; i--; ) {
  1859. struct r5dev *dev = &sh->dev[i];
  1860. if (!test_bit(R5_OVERWRITE, &dev->flags) &&
  1861. i != sh->pd_idx &&
  1862. !test_bit(R5_LOCKED, &dev->flags) &&
  1863. !(test_bit(R5_UPTODATE, &dev->flags) ||
  1864. test_bit(R5_Wantcompute, &dev->flags)) &&
  1865. test_bit(R5_Insync, &dev->flags)) {
  1866. if (
  1867. test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
  1868. pr_debug("Read_old block "
  1869. "%d for Reconstruct\n", i);
  1870. set_bit(R5_LOCKED, &dev->flags);
  1871. set_bit(R5_Wantread, &dev->flags);
  1872. s->locked++;
  1873. } else {
  1874. set_bit(STRIPE_DELAYED, &sh->state);
  1875. set_bit(STRIPE_HANDLE, &sh->state);
  1876. }
  1877. }
  1878. }
  1879. /* now if nothing is locked, and if we have enough data,
  1880. * we can start a write request
  1881. */
  1882. /* since handle_stripe can be called at any time we need to handle the
  1883. * case where a compute block operation has been submitted and then a
  1884. * subsequent call wants to start a write request. raid5_run_ops only
  1885. * handles the case where compute block and postxor are requested
  1886. * simultaneously. If this is not the case then new writes need to be
  1887. * held off until the compute completes.
  1888. */
  1889. if ((s->req_compute || !test_bit(STRIPE_COMPUTE_RUN, &sh->state)) &&
  1890. (s->locked == 0 && (rcw == 0 || rmw == 0) &&
  1891. !test_bit(STRIPE_BIT_DELAY, &sh->state)))
  1892. schedule_reconstruction5(sh, s, rcw == 0, 0);
  1893. }
  1894. static void handle_stripe_dirtying6(raid5_conf_t *conf,
  1895. struct stripe_head *sh, struct stripe_head_state *s,
  1896. struct r6_state *r6s, int disks)
  1897. {
  1898. int rcw = 0, must_compute = 0, pd_idx = sh->pd_idx, i;
  1899. int qd_idx = r6s->qd_idx;
  1900. for (i = disks; i--; ) {
  1901. struct r5dev *dev = &sh->dev[i];
  1902. /* Would I have to read this buffer for reconstruct_write */
  1903. if (!test_bit(R5_OVERWRITE, &dev->flags)
  1904. && i != pd_idx && i != qd_idx
  1905. && (!test_bit(R5_LOCKED, &dev->flags)
  1906. ) &&
  1907. !test_bit(R5_UPTODATE, &dev->flags)) {
  1908. if (test_bit(R5_Insync, &dev->flags)) rcw++;
  1909. else {
  1910. pr_debug("raid6: must_compute: "
  1911. "disk %d flags=%#lx\n", i, dev->flags);
  1912. must_compute++;
  1913. }
  1914. }
  1915. }
  1916. pr_debug("for sector %llu, rcw=%d, must_compute=%d\n",
  1917. (unsigned long long)sh->sector, rcw, must_compute);
  1918. set_bit(STRIPE_HANDLE, &sh->state);
  1919. if (rcw > 0)
  1920. /* want reconstruct write, but need to get some data */
  1921. for (i = disks; i--; ) {
  1922. struct r5dev *dev = &sh->dev[i];
  1923. if (!test_bit(R5_OVERWRITE, &dev->flags)
  1924. && !(s->failed == 0 && (i == pd_idx || i == qd_idx))
  1925. && !test_bit(R5_LOCKED, &dev->flags) &&
  1926. !test_bit(R5_UPTODATE, &dev->flags) &&
  1927. test_bit(R5_Insync, &dev->flags)) {
  1928. if (
  1929. test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
  1930. pr_debug("Read_old stripe %llu "
  1931. "block %d for Reconstruct\n",
  1932. (unsigned long long)sh->sector, i);
  1933. set_bit(R5_LOCKED, &dev->flags);
  1934. set_bit(R5_Wantread, &dev->flags);
  1935. s->locked++;
  1936. } else {
  1937. pr_debug("Request delayed stripe %llu "
  1938. "block %d for Reconstruct\n",
  1939. (unsigned long long)sh->sector, i);
  1940. set_bit(STRIPE_DELAYED, &sh->state);
  1941. set_bit(STRIPE_HANDLE, &sh->state);
  1942. }
  1943. }
  1944. }
  1945. /* now if nothing is locked, and if we have enough data, we can start a
  1946. * write request
  1947. */
  1948. if (s->locked == 0 && rcw == 0 &&
  1949. !test_bit(STRIPE_BIT_DELAY, &sh->state)) {
  1950. if (must_compute > 0) {
  1951. /* We have failed blocks and need to compute them */
  1952. switch (s->failed) {
  1953. case 0:
  1954. BUG();
  1955. case 1:
  1956. compute_block_1(sh, r6s->failed_num[0], 0);
  1957. break;
  1958. case 2:
  1959. compute_block_2(sh, r6s->failed_num[0],
  1960. r6s->failed_num[1]);
  1961. break;
  1962. default: /* This request should have been failed? */
  1963. BUG();
  1964. }
  1965. }
  1966. pr_debug("Computing parity for stripe %llu\n",
  1967. (unsigned long long)sh->sector);
  1968. compute_parity6(sh, RECONSTRUCT_WRITE);
  1969. /* now every locked buffer is ready to be written */
  1970. for (i = disks; i--; )
  1971. if (test_bit(R5_LOCKED, &sh->dev[i].flags)) {
  1972. pr_debug("Writing stripe %llu block %d\n",
  1973. (unsigned long long)sh->sector, i);
  1974. s->locked++;
  1975. set_bit(R5_Wantwrite, &sh->dev[i].flags);
  1976. }
  1977. if (s->locked == disks)
  1978. if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
  1979. atomic_inc(&conf->pending_full_writes);
  1980. /* after a RECONSTRUCT_WRITE, the stripe MUST be in-sync */
  1981. set_bit(STRIPE_INSYNC, &sh->state);
  1982. if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
  1983. atomic_dec(&conf->preread_active_stripes);
  1984. if (atomic_read(&conf->preread_active_stripes) <
  1985. IO_THRESHOLD)
  1986. md_wakeup_thread(conf->mddev->thread);
  1987. }
  1988. }
  1989. }
  1990. static void handle_parity_checks5(raid5_conf_t *conf, struct stripe_head *sh,
  1991. struct stripe_head_state *s, int disks)
  1992. {
  1993. struct r5dev *dev = NULL;
  1994. set_bit(STRIPE_HANDLE, &sh->state);
  1995. switch (sh->check_state) {
  1996. case check_state_idle:
  1997. /* start a new check operation if there are no failures */
  1998. if (s->failed == 0) {
  1999. BUG_ON(s->uptodate != disks);
  2000. sh->check_state = check_state_run;
  2001. set_bit(STRIPE_OP_CHECK, &s->ops_request);
  2002. clear_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags);
  2003. s->uptodate--;
  2004. break;
  2005. }
  2006. dev = &sh->dev[s->failed_num];
  2007. /* fall through */
  2008. case check_state_compute_result:
  2009. sh->check_state = check_state_idle;
  2010. if (!dev)
  2011. dev = &sh->dev[sh->pd_idx];
  2012. /* check that a write has not made the stripe insync */
  2013. if (test_bit(STRIPE_INSYNC, &sh->state))
  2014. break;
  2015. /* either failed parity check, or recovery is happening */
  2016. BUG_ON(!test_bit(R5_UPTODATE, &dev->flags));
  2017. BUG_ON(s->uptodate != disks);
  2018. set_bit(R5_LOCKED, &dev->flags);
  2019. s->locked++;
  2020. set_bit(R5_Wantwrite, &dev->flags);
  2021. clear_bit(STRIPE_DEGRADED, &sh->state);
  2022. set_bit(STRIPE_INSYNC, &sh->state);
  2023. break;
  2024. case check_state_run:
  2025. break; /* we will be called again upon completion */
  2026. case check_state_check_result:
  2027. sh->check_state = check_state_idle;
  2028. /* if a failure occurred during the check operation, leave
  2029. * STRIPE_INSYNC not set and let the stripe be handled again
  2030. */
  2031. if (s->failed)
  2032. break;
  2033. /* handle a successful check operation, if parity is correct
  2034. * we are done. Otherwise update the mismatch count and repair
  2035. * parity if !MD_RECOVERY_CHECK
  2036. */
  2037. if (sh->ops.zero_sum_result == 0)
  2038. /* parity is correct (on disc,
  2039. * not in buffer any more)
  2040. */
  2041. set_bit(STRIPE_INSYNC, &sh->state);
  2042. else {
  2043. conf->mddev->resync_mismatches += STRIPE_SECTORS;
  2044. if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
  2045. /* don't try to repair!! */
  2046. set_bit(STRIPE_INSYNC, &sh->state);
  2047. else {
  2048. sh->check_state = check_state_compute_run;
  2049. set_bit(STRIPE_COMPUTE_RUN, &sh->state);
  2050. set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
  2051. set_bit(R5_Wantcompute,
  2052. &sh->dev[sh->pd_idx].flags);
  2053. sh->ops.target = sh->pd_idx;
  2054. s->uptodate++;
  2055. }
  2056. }
  2057. break;
  2058. case check_state_compute_run:
  2059. break;
  2060. default:
  2061. printk(KERN_ERR "%s: unknown check_state: %d sector: %llu\n",
  2062. __func__, sh->check_state,
  2063. (unsigned long long) sh->sector);
  2064. BUG();
  2065. }
  2066. }
  2067. static void handle_parity_checks6(raid5_conf_t *conf, struct stripe_head *sh,
  2068. struct stripe_head_state *s,
  2069. struct r6_state *r6s, struct page *tmp_page,
  2070. int disks)
  2071. {
  2072. int update_p = 0, update_q = 0;
  2073. struct r5dev *dev;
  2074. int pd_idx = sh->pd_idx;
  2075. int qd_idx = r6s->qd_idx;
  2076. set_bit(STRIPE_HANDLE, &sh->state);
  2077. BUG_ON(s->failed > 2);
  2078. BUG_ON(s->uptodate < disks);
  2079. /* Want to check and possibly repair P and Q.
  2080. * However there could be one 'failed' device, in which
  2081. * case we can only check one of them, possibly using the
  2082. * other to generate missing data
  2083. */
  2084. /* If !tmp_page, we cannot do the calculations,
  2085. * but as we have set STRIPE_HANDLE, we will soon be called
  2086. * by stripe_handle with a tmp_page - just wait until then.
  2087. */
  2088. if (tmp_page) {
  2089. if (s->failed == r6s->q_failed) {
  2090. /* The only possible failed device holds 'Q', so it
  2091. * makes sense to check P (If anything else were failed,
  2092. * we would have used P to recreate it).
  2093. */
  2094. compute_block_1(sh, pd_idx, 1);
  2095. if (!page_is_zero(sh->dev[pd_idx].page)) {
  2096. compute_block_1(sh, pd_idx, 0);
  2097. update_p = 1;
  2098. }
  2099. }
  2100. if (!r6s->q_failed && s->failed < 2) {
  2101. /* q is not failed, and we didn't use it to generate
  2102. * anything, so it makes sense to check it
  2103. */
  2104. memcpy(page_address(tmp_page),
  2105. page_address(sh->dev[qd_idx].page),
  2106. STRIPE_SIZE);
  2107. compute_parity6(sh, UPDATE_PARITY);
  2108. if (memcmp(page_address(tmp_page),
  2109. page_address(sh->dev[qd_idx].page),
  2110. STRIPE_SIZE) != 0) {
  2111. clear_bit(STRIPE_INSYNC, &sh->state);
  2112. update_q = 1;
  2113. }
  2114. }
  2115. if (update_p || update_q) {
  2116. conf->mddev->resync_mismatches += STRIPE_SECTORS;
  2117. if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
  2118. /* don't try to repair!! */
  2119. update_p = update_q = 0;
  2120. }
  2121. /* now write out any block on a failed drive,
  2122. * or P or Q if they need it
  2123. */
  2124. if (s->failed == 2) {
  2125. dev = &sh->dev[r6s->failed_num[1]];
  2126. s->locked++;
  2127. set_bit(R5_LOCKED, &dev->flags);
  2128. set_bit(R5_Wantwrite, &dev->flags);
  2129. }
  2130. if (s->failed >= 1) {
  2131. dev = &sh->dev[r6s->failed_num[0]];
  2132. s->locked++;
  2133. set_bit(R5_LOCKED, &dev->flags);
  2134. set_bit(R5_Wantwrite, &dev->flags);
  2135. }
  2136. if (update_p) {
  2137. dev = &sh->dev[pd_idx];
  2138. s->locked++;
  2139. set_bit(R5_LOCKED, &dev->flags);
  2140. set_bit(R5_Wantwrite, &dev->flags);
  2141. }
  2142. if (update_q) {
  2143. dev = &sh->dev[qd_idx];
  2144. s->locked++;
  2145. set_bit(R5_LOCKED, &dev->flags);
  2146. set_bit(R5_Wantwrite, &dev->flags);
  2147. }
  2148. clear_bit(STRIPE_DEGRADED, &sh->state);
  2149. set_bit(STRIPE_INSYNC, &sh->state);
  2150. }
  2151. }
  2152. static void handle_stripe_expansion(raid5_conf_t *conf, struct stripe_head *sh,
  2153. struct r6_state *r6s)
  2154. {
  2155. int i;
  2156. /* We have read all the blocks in this stripe and now we need to
  2157. * copy some of them into a target stripe for expand.
  2158. */
  2159. struct dma_async_tx_descriptor *tx = NULL;
  2160. clear_bit(STRIPE_EXPAND_SOURCE, &sh->state);
  2161. for (i = 0; i < sh->disks; i++)
  2162. if (i != sh->pd_idx && (!r6s || i != r6s->qd_idx)) {
  2163. int dd_idx, pd_idx, j;
  2164. struct stripe_head *sh2;
  2165. sector_t bn = compute_blocknr(sh, i);
  2166. sector_t s = raid5_compute_sector(bn, conf->raid_disks,
  2167. conf->raid_disks -
  2168. conf->max_degraded, &dd_idx,
  2169. &pd_idx, conf);
  2170. sh2 = get_active_stripe(conf, s, conf->raid_disks,
  2171. pd_idx, 1);
  2172. if (sh2 == NULL)
  2173. /* so far only the early blocks of this stripe
  2174. * have been requested. When later blocks
  2175. * get requested, we will try again
  2176. */
  2177. continue;
  2178. if (!test_bit(STRIPE_EXPANDING, &sh2->state) ||
  2179. test_bit(R5_Expanded, &sh2->dev[dd_idx].flags)) {
  2180. /* must have already done this block */
  2181. release_stripe(sh2);
  2182. continue;
  2183. }
  2184. /* place all the copies on one channel */
  2185. tx = async_memcpy(sh2->dev[dd_idx].page,
  2186. sh->dev[i].page, 0, 0, STRIPE_SIZE,
  2187. ASYNC_TX_DEP_ACK, tx, NULL, NULL);
  2188. set_bit(R5_Expanded, &sh2->dev[dd_idx].flags);
  2189. set_bit(R5_UPTODATE, &sh2->dev[dd_idx].flags);
  2190. for (j = 0; j < conf->raid_disks; j++)
  2191. if (j != sh2->pd_idx &&
  2192. (!r6s || j != raid6_next_disk(sh2->pd_idx,
  2193. sh2->disks)) &&
  2194. !test_bit(R5_Expanded, &sh2->dev[j].flags))
  2195. break;
  2196. if (j == conf->raid_disks) {
  2197. set_bit(STRIPE_EXPAND_READY, &sh2->state);
  2198. set_bit(STRIPE_HANDLE, &sh2->state);
  2199. }
  2200. release_stripe(sh2);
  2201. }
  2202. /* done submitting copies, wait for them to complete */
  2203. if (tx) {
  2204. async_tx_ack(tx);
  2205. dma_wait_for_async_tx(tx);
  2206. }
  2207. }
  2208. /*
  2209. * handle_stripe - do things to a stripe.
  2210. *
  2211. * We lock the stripe and then examine the state of various bits
  2212. * to see what needs to be done.
  2213. * Possible results:
  2214. * return some read request which now have data
  2215. * return some write requests which are safely on disc
  2216. * schedule a read on some buffers
  2217. * schedule a write of some buffers
  2218. * return confirmation of parity correctness
  2219. *
  2220. * buffers are taken off read_list or write_list, and bh_cache buffers
  2221. * get BH_Lock set before the stripe lock is released.
  2222. *
  2223. */
  2224. static bool handle_stripe5(struct stripe_head *sh)
  2225. {
  2226. raid5_conf_t *conf = sh->raid_conf;
  2227. int disks = sh->disks, i;
  2228. struct bio *return_bi = NULL;
  2229. struct stripe_head_state s;
  2230. struct r5dev *dev;
  2231. mdk_rdev_t *blocked_rdev = NULL;
  2232. int prexor;
  2233. memset(&s, 0, sizeof(s));
  2234. pr_debug("handling stripe %llu, state=%#lx cnt=%d, pd_idx=%d check:%d "
  2235. "reconstruct:%d\n", (unsigned long long)sh->sector, sh->state,
  2236. atomic_read(&sh->count), sh->pd_idx, sh->check_state,
  2237. sh->reconstruct_state);
  2238. spin_lock(&sh->lock);
  2239. clear_bit(STRIPE_HANDLE, &sh->state);
  2240. clear_bit(STRIPE_DELAYED, &sh->state);
  2241. s.syncing = test_bit(STRIPE_SYNCING, &sh->state);
  2242. s.expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state);
  2243. s.expanded = test_bit(STRIPE_EXPAND_READY, &sh->state);
  2244. /* Now to look around and see what can be done */
  2245. rcu_read_lock();
  2246. for (i=disks; i--; ) {
  2247. mdk_rdev_t *rdev;
  2248. struct r5dev *dev = &sh->dev[i];
  2249. clear_bit(R5_Insync, &dev->flags);
  2250. pr_debug("check %d: state 0x%lx toread %p read %p write %p "
  2251. "written %p\n", i, dev->flags, dev->toread, dev->read,
  2252. dev->towrite, dev->written);
  2253. /* maybe we can request a biofill operation
  2254. *
  2255. * new wantfill requests are only permitted while
  2256. * ops_complete_biofill is guaranteed to be inactive
  2257. */
  2258. if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread &&
  2259. !test_bit(STRIPE_BIOFILL_RUN, &sh->state))
  2260. set_bit(R5_Wantfill, &dev->flags);
  2261. /* now count some things */
  2262. if (test_bit(R5_LOCKED, &dev->flags)) s.locked++;
  2263. if (test_bit(R5_UPTODATE, &dev->flags)) s.uptodate++;
  2264. if (test_bit(R5_Wantcompute, &dev->flags)) s.compute++;
  2265. if (test_bit(R5_Wantfill, &dev->flags))
  2266. s.to_fill++;
  2267. else if (dev->toread)
  2268. s.to_read++;
  2269. if (dev->towrite) {
  2270. s.to_write++;
  2271. if (!test_bit(R5_OVERWRITE, &dev->flags))
  2272. s.non_overwrite++;
  2273. }
  2274. if (dev->written)
  2275. s.written++;
  2276. rdev = rcu_dereference(conf->disks[i].rdev);
  2277. if (blocked_rdev == NULL &&
  2278. rdev && unlikely(test_bit(Blocked, &rdev->flags))) {
  2279. blocked_rdev = rdev;
  2280. atomic_inc(&rdev->nr_pending);
  2281. }
  2282. if (!rdev || !test_bit(In_sync, &rdev->flags)) {
  2283. /* The ReadError flag will just be confusing now */
  2284. clear_bit(R5_ReadError, &dev->flags);
  2285. clear_bit(R5_ReWrite, &dev->flags);
  2286. }
  2287. if (!rdev || !test_bit(In_sync, &rdev->flags)
  2288. || test_bit(R5_ReadError, &dev->flags)) {
  2289. s.failed++;
  2290. s.failed_num = i;
  2291. } else
  2292. set_bit(R5_Insync, &dev->flags);
  2293. }
  2294. rcu_read_unlock();
  2295. if (unlikely(blocked_rdev)) {
  2296. if (s.syncing || s.expanding || s.expanded ||
  2297. s.to_write || s.written) {
  2298. set_bit(STRIPE_HANDLE, &sh->state);
  2299. goto unlock;
  2300. }
  2301. /* There is nothing for the blocked_rdev to block */
  2302. rdev_dec_pending(blocked_rdev, conf->mddev);
  2303. blocked_rdev = NULL;
  2304. }
  2305. if (s.to_fill && !test_bit(STRIPE_BIOFILL_RUN, &sh->state)) {
  2306. set_bit(STRIPE_OP_BIOFILL, &s.ops_request);
  2307. set_bit(STRIPE_BIOFILL_RUN, &sh->state);
  2308. }
  2309. pr_debug("locked=%d uptodate=%d to_read=%d"
  2310. " to_write=%d failed=%d failed_num=%d\n",
  2311. s.locked, s.uptodate, s.to_read, s.to_write,
  2312. s.failed, s.failed_num);
  2313. /* check if the array has lost two devices and, if so, some requests might
  2314. * need to be failed
  2315. */
  2316. if (s.failed > 1 && s.to_read+s.to_write+s.written)
  2317. handle_failed_stripe(conf, sh, &s, disks, &return_bi);
  2318. if (s.failed > 1 && s.syncing) {
  2319. md_done_sync(conf->mddev, STRIPE_SECTORS,0);
  2320. clear_bit(STRIPE_SYNCING, &sh->state);
  2321. s.syncing = 0;
  2322. }
  2323. /* might be able to return some write requests if the parity block
  2324. * is safe, or on a failed drive
  2325. */
  2326. dev = &sh->dev[sh->pd_idx];
  2327. if ( s.written &&
  2328. ((test_bit(R5_Insync, &dev->flags) &&
  2329. !test_bit(R5_LOCKED, &dev->flags) &&
  2330. test_bit(R5_UPTODATE, &dev->flags)) ||
  2331. (s.failed == 1 && s.failed_num == sh->pd_idx)))
  2332. handle_stripe_clean_event(conf, sh, disks, &return_bi);
  2333. /* Now we might consider reading some blocks, either to check/generate
  2334. * parity, or to satisfy requests
  2335. * or to load a block that is being partially written.
  2336. */
  2337. if (s.to_read || s.non_overwrite ||
  2338. (s.syncing && (s.uptodate + s.compute < disks)) || s.expanding)
  2339. handle_stripe_fill5(sh, &s, disks);
  2340. /* Now we check to see if any write operations have recently
  2341. * completed
  2342. */
  2343. prexor = 0;
  2344. if (sh->reconstruct_state == reconstruct_state_prexor_drain_result)
  2345. prexor = 1;
  2346. if (sh->reconstruct_state == reconstruct_state_drain_result ||
  2347. sh->reconstruct_state == reconstruct_state_prexor_drain_result) {
  2348. sh->reconstruct_state = reconstruct_state_idle;
  2349. /* All the 'written' buffers and the parity block are ready to
  2350. * be written back to disk
  2351. */
  2352. BUG_ON(!test_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags));
  2353. for (i = disks; i--; ) {
  2354. dev = &sh->dev[i];
  2355. if (test_bit(R5_LOCKED, &dev->flags) &&
  2356. (i == sh->pd_idx || dev->written)) {
  2357. pr_debug("Writing block %d\n", i);
  2358. set_bit(R5_Wantwrite, &dev->flags);
  2359. if (prexor)
  2360. continue;
  2361. if (!test_bit(R5_Insync, &dev->flags) ||
  2362. (i == sh->pd_idx && s.failed == 0))
  2363. set_bit(STRIPE_INSYNC, &sh->state);
  2364. }
  2365. }
  2366. if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
  2367. atomic_dec(&conf->preread_active_stripes);
  2368. if (atomic_read(&conf->preread_active_stripes) <
  2369. IO_THRESHOLD)
  2370. md_wakeup_thread(conf->mddev->thread);
  2371. }
  2372. }
  2373. /* Now to consider new write requests and what else, if anything
  2374. * should be read. We do not handle new writes when:
  2375. * 1/ A 'write' operation (copy+xor) is already in flight.
  2376. * 2/ A 'check' operation is in flight, as it may clobber the parity
  2377. * block.
  2378. */
  2379. if (s.to_write && !sh->reconstruct_state && !sh->check_state)
  2380. handle_stripe_dirtying5(conf, sh, &s, disks);
  2381. /* maybe we need to check and possibly fix the parity for this stripe
  2382. * Any reads will already have been scheduled, so we just see if enough
  2383. * data is available. The parity check is held off while parity
  2384. * dependent operations are in flight.
  2385. */
  2386. if (sh->check_state ||
  2387. (s.syncing && s.locked == 0 &&
  2388. !test_bit(STRIPE_COMPUTE_RUN, &sh->state) &&
  2389. !test_bit(STRIPE_INSYNC, &sh->state)))
  2390. handle_parity_checks5(conf, sh, &s, disks);
  2391. if (s.syncing && s.locked == 0 && test_bit(STRIPE_INSYNC, &sh->state)) {
  2392. md_done_sync(conf->mddev, STRIPE_SECTORS,1);
  2393. clear_bit(STRIPE_SYNCING, &sh->state);
  2394. }
  2395. /* If the failed drive is just a ReadError, then we might need to progress
  2396. * the repair/check process
  2397. */
  2398. if (s.failed == 1 && !conf->mddev->ro &&
  2399. test_bit(R5_ReadError, &sh->dev[s.failed_num].flags)
  2400. && !test_bit(R5_LOCKED, &sh->dev[s.failed_num].flags)
  2401. && test_bit(R5_UPTODATE, &sh->dev[s.failed_num].flags)
  2402. ) {
  2403. dev = &sh->dev[s.failed_num];
  2404. if (!test_bit(R5_ReWrite, &dev->flags)) {
  2405. set_bit(R5_Wantwrite, &dev->flags);
  2406. set_bit(R5_ReWrite, &dev->flags);
  2407. set_bit(R5_LOCKED, &dev->flags);
  2408. s.locked++;
  2409. } else {
  2410. /* let's read it back */
  2411. set_bit(R5_Wantread, &dev->flags);
  2412. set_bit(R5_LOCKED, &dev->flags);
  2413. s.locked++;
  2414. }
  2415. }
  2416. /* Finish reconstruct operations initiated by the expansion process */
  2417. if (sh->reconstruct_state == reconstruct_state_result) {
  2418. sh->reconstruct_state = reconstruct_state_idle;
  2419. clear_bit(STRIPE_EXPANDING, &sh->state);
  2420. for (i = conf->raid_disks; i--; ) {
  2421. set_bit(R5_Wantwrite, &sh->dev[i].flags);
  2422. set_bit(R5_LOCKED, &sh->dev[i].flags);
  2423. s.locked++;
  2424. }
  2425. }
  2426. if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state) &&
  2427. !sh->reconstruct_state) {
  2428. /* Need to write out all blocks after computing parity */
  2429. sh->disks = conf->raid_disks;
  2430. sh->pd_idx = stripe_to_pdidx(sh->sector, conf,
  2431. conf->raid_disks);
  2432. schedule_reconstruction5(sh, &s, 1, 1);
  2433. } else if (s.expanded && !sh->reconstruct_state && s.locked == 0) {
  2434. clear_bit(STRIPE_EXPAND_READY, &sh->state);
  2435. atomic_dec(&conf->reshape_stripes);
  2436. wake_up(&conf->wait_for_overlap);
  2437. md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
  2438. }
  2439. if (s.expanding && s.locked == 0 &&
  2440. !test_bit(STRIPE_COMPUTE_RUN, &sh->state))
  2441. handle_stripe_expansion(conf, sh, NULL);
  2442. unlock:
  2443. spin_unlock(&sh->lock);
  2444. /* wait for this device to become unblocked */
  2445. if (unlikely(blocked_rdev))
  2446. md_wait_for_blocked_rdev(blocked_rdev, conf->mddev);
  2447. if (s.ops_request)
  2448. raid5_run_ops(sh, s.ops_request);
  2449. ops_run_io(sh, &s);
  2450. return_io(return_bi);
  2451. return blocked_rdev == NULL;
  2452. }
  2453. static bool handle_stripe6(struct stripe_head *sh, struct page *tmp_page)
  2454. {
  2455. raid6_conf_t *conf = sh->raid_conf;
  2456. int disks = sh->disks;
  2457. struct bio *return_bi = NULL;
  2458. int i, pd_idx = sh->pd_idx;
  2459. struct stripe_head_state s;
  2460. struct r6_state r6s;
  2461. struct r5dev *dev, *pdev, *qdev;
  2462. mdk_rdev_t *blocked_rdev = NULL;
  2463. r6s.qd_idx = raid6_next_disk(pd_idx, disks);
  2464. pr_debug("handling stripe %llu, state=%#lx cnt=%d, "
  2465. "pd_idx=%d, qd_idx=%d\n",
  2466. (unsigned long long)sh->sector, sh->state,
  2467. atomic_read(&sh->count), pd_idx, r6s.qd_idx);
  2468. memset(&s, 0, sizeof(s));
  2469. spin_lock(&sh->lock);
  2470. clear_bit(STRIPE_HANDLE, &sh->state);
  2471. clear_bit(STRIPE_DELAYED, &sh->state);
  2472. s.syncing = test_bit(STRIPE_SYNCING, &sh->state);
  2473. s.expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state);
  2474. s.expanded = test_bit(STRIPE_EXPAND_READY, &sh->state);
  2475. /* Now to look around and see what can be done */
  2476. rcu_read_lock();
  2477. for (i=disks; i--; ) {
  2478. mdk_rdev_t *rdev;
  2479. dev = &sh->dev[i];
  2480. clear_bit(R5_Insync, &dev->flags);
  2481. pr_debug("check %d: state 0x%lx read %p write %p written %p\n",
  2482. i, dev->flags, dev->toread, dev->towrite, dev->written);
  2483. /* maybe we can reply to a read */
  2484. if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread) {
  2485. struct bio *rbi, *rbi2;
  2486. pr_debug("Return read for disc %d\n", i);
  2487. spin_lock_irq(&conf->device_lock);
  2488. rbi = dev->toread;
  2489. dev->toread = NULL;
  2490. if (test_and_clear_bit(R5_Overlap, &dev->flags))
  2491. wake_up(&conf->wait_for_overlap);
  2492. spin_unlock_irq(&conf->device_lock);
  2493. while (rbi && rbi->bi_sector < dev->sector + STRIPE_SECTORS) {
  2494. copy_data(0, rbi, dev->page, dev->sector);
  2495. rbi2 = r5_next_bio(rbi, dev->sector);
  2496. spin_lock_irq(&conf->device_lock);
  2497. if (--rbi->bi_phys_segments == 0) {
  2498. rbi->bi_next = return_bi;
  2499. return_bi = rbi;
  2500. }
  2501. spin_unlock_irq(&conf->device_lock);
  2502. rbi = rbi2;
  2503. }
  2504. }
  2505. /* now count some things */
  2506. if (test_bit(R5_LOCKED, &dev->flags)) s.locked++;
  2507. if (test_bit(R5_UPTODATE, &dev->flags)) s.uptodate++;
  2508. if (dev->toread)
  2509. s.to_read++;
  2510. if (dev->towrite) {
  2511. s.to_write++;
  2512. if (!test_bit(R5_OVERWRITE, &dev->flags))
  2513. s.non_overwrite++;
  2514. }
  2515. if (dev->written)
  2516. s.written++;
  2517. rdev = rcu_dereference(conf->disks[i].rdev);
  2518. if (blocked_rdev == NULL &&
  2519. rdev && unlikely(test_bit(Blocked, &rdev->flags))) {
  2520. blocked_rdev = rdev;
  2521. atomic_inc(&rdev->nr_pending);
  2522. }
  2523. if (!rdev || !test_bit(In_sync, &rdev->flags)) {
  2524. /* The ReadError flag will just be confusing now */
  2525. clear_bit(R5_ReadError, &dev->flags);
  2526. clear_bit(R5_ReWrite, &dev->flags);
  2527. }
  2528. if (!rdev || !test_bit(In_sync, &rdev->flags)
  2529. || test_bit(R5_ReadError, &dev->flags)) {
  2530. if (s.failed < 2)
  2531. r6s.failed_num[s.failed] = i;
  2532. s.failed++;
  2533. } else
  2534. set_bit(R5_Insync, &dev->flags);
  2535. }
  2536. rcu_read_unlock();
  2537. if (unlikely(blocked_rdev)) {
  2538. if (s.syncing || s.expanding || s.expanded ||
  2539. s.to_write || s.written) {
  2540. set_bit(STRIPE_HANDLE, &sh->state);
  2541. goto unlock;
  2542. }
  2543. /* There is nothing for the blocked_rdev to block */
  2544. rdev_dec_pending(blocked_rdev, conf->mddev);
  2545. blocked_rdev = NULL;
  2546. }
  2547. pr_debug("locked=%d uptodate=%d to_read=%d"
  2548. " to_write=%d failed=%d failed_num=%d,%d\n",
  2549. s.locked, s.uptodate, s.to_read, s.to_write, s.failed,
  2550. r6s.failed_num[0], r6s.failed_num[1]);
  2551. /* check if the array has lost >2 devices and, if so, some requests
  2552. * might need to be failed
  2553. */
  2554. if (s.failed > 2 && s.to_read+s.to_write+s.written)
  2555. handle_failed_stripe(conf, sh, &s, disks, &return_bi);
  2556. if (s.failed > 2 && s.syncing) {
  2557. md_done_sync(conf->mddev, STRIPE_SECTORS,0);
  2558. clear_bit(STRIPE_SYNCING, &sh->state);
  2559. s.syncing = 0;
  2560. }
  2561. /*
  2562. * might be able to return some write requests if the parity blocks
  2563. * are safe, or on a failed drive
  2564. */
  2565. pdev = &sh->dev[pd_idx];
  2566. r6s.p_failed = (s.failed >= 1 && r6s.failed_num[0] == pd_idx)
  2567. || (s.failed >= 2 && r6s.failed_num[1] == pd_idx);
  2568. qdev = &sh->dev[r6s.qd_idx];
  2569. r6s.q_failed = (s.failed >= 1 && r6s.failed_num[0] == r6s.qd_idx)
  2570. || (s.failed >= 2 && r6s.failed_num[1] == r6s.qd_idx);
  2571. if ( s.written &&
  2572. ( r6s.p_failed || ((test_bit(R5_Insync, &pdev->flags)
  2573. && !test_bit(R5_LOCKED, &pdev->flags)
  2574. && test_bit(R5_UPTODATE, &pdev->flags)))) &&
  2575. ( r6s.q_failed || ((test_bit(R5_Insync, &qdev->flags)
  2576. && !test_bit(R5_LOCKED, &qdev->flags)
  2577. && test_bit(R5_UPTODATE, &qdev->flags)))))
  2578. handle_stripe_clean_event(conf, sh, disks, &return_bi);
  2579. /* Now we might consider reading some blocks, either to check/generate
  2580. * parity, or to satisfy requests
  2581. * or to load a block that is being partially written.
  2582. */
  2583. if (s.to_read || s.non_overwrite || (s.to_write && s.failed) ||
  2584. (s.syncing && (s.uptodate < disks)) || s.expanding)
  2585. handle_stripe_fill6(sh, &s, &r6s, disks);
  2586. /* now to consider writing and what else, if anything should be read */
  2587. if (s.to_write)
  2588. handle_stripe_dirtying6(conf, sh, &s, &r6s, disks);
  2589. /* maybe we need to check and possibly fix the parity for this stripe
  2590. * Any reads will already have been scheduled, so we just see if enough
  2591. * data is available
  2592. */
  2593. if (s.syncing && s.locked == 0 && !test_bit(STRIPE_INSYNC, &sh->state))
  2594. handle_parity_checks6(conf, sh, &s, &r6s, tmp_page, disks);
  2595. if (s.syncing && s.locked == 0 && test_bit(STRIPE_INSYNC, &sh->state)) {
  2596. md_done_sync(conf->mddev, STRIPE_SECTORS,1);
  2597. clear_bit(STRIPE_SYNCING, &sh->state);
  2598. }
  2599. /* If the failed drives are just a ReadError, then we might need
  2600. * to progress the repair/check process
  2601. */
  2602. if (s.failed <= 2 && !conf->mddev->ro)
  2603. for (i = 0; i < s.failed; i++) {
  2604. dev = &sh->dev[r6s.failed_num[i]];
  2605. if (test_bit(R5_ReadError, &dev->flags)
  2606. && !test_bit(R5_LOCKED, &dev->flags)
  2607. && test_bit(R5_UPTODATE, &dev->flags)
  2608. ) {
  2609. if (!test_bit(R5_ReWrite, &dev->flags)) {
  2610. set_bit(R5_Wantwrite, &dev->flags);
  2611. set_bit(R5_ReWrite, &dev->flags);
  2612. set_bit(R5_LOCKED, &dev->flags);
  2613. } else {
  2614. /* let's read it back */
  2615. set_bit(R5_Wantread, &dev->flags);
  2616. set_bit(R5_LOCKED, &dev->flags);
  2617. }
  2618. }
  2619. }
  2620. if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state)) {
  2621. /* Need to write out all blocks after computing P&Q */
  2622. sh->disks = conf->raid_disks;
  2623. sh->pd_idx = stripe_to_pdidx(sh->sector, conf,
  2624. conf->raid_disks);
  2625. compute_parity6(sh, RECONSTRUCT_WRITE);
  2626. for (i = conf->raid_disks ; i-- ; ) {
  2627. set_bit(R5_LOCKED, &sh->dev[i].flags);
  2628. s.locked++;
  2629. set_bit(R5_Wantwrite, &sh->dev[i].flags);
  2630. }
  2631. clear_bit(STRIPE_EXPANDING, &sh->state);
  2632. } else if (s.expanded) {
  2633. clear_bit(STRIPE_EXPAND_READY, &sh->state);
  2634. atomic_dec(&conf->reshape_stripes);
  2635. wake_up(&conf->wait_for_overlap);
  2636. md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
  2637. }
  2638. if (s.expanding && s.locked == 0 &&
  2639. !test_bit(STRIPE_COMPUTE_RUN, &sh->state))
  2640. handle_stripe_expansion(conf, sh, &r6s);
  2641. unlock:
  2642. spin_unlock(&sh->lock);
  2643. /* wait for this device to become unblocked */
  2644. if (unlikely(blocked_rdev))
  2645. md_wait_for_blocked_rdev(blocked_rdev, conf->mddev);
  2646. ops_run_io(sh, &s);
  2647. return_io(return_bi);
  2648. return blocked_rdev == NULL;
  2649. }
  2650. /* returns true if the stripe was handled */
  2651. static bool handle_stripe(struct stripe_head *sh, struct page *tmp_page)
  2652. {
  2653. if (sh->raid_conf->level == 6)
  2654. return handle_stripe6(sh, tmp_page);
  2655. else
  2656. return handle_stripe5(sh);
  2657. }
  2658. static void raid5_activate_delayed(raid5_conf_t *conf)
  2659. {
  2660. if (atomic_read(&conf->preread_active_stripes) < IO_THRESHOLD) {
  2661. while (!list_empty(&conf->delayed_list)) {
  2662. struct list_head *l = conf->delayed_list.next;
  2663. struct stripe_head *sh;
  2664. sh = list_entry(l, struct stripe_head, lru);
  2665. list_del_init(l);
  2666. clear_bit(STRIPE_DELAYED, &sh->state);
  2667. if (!test_and_set_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
  2668. atomic_inc(&conf->preread_active_stripes);
  2669. list_add_tail(&sh->lru, &conf->hold_list);
  2670. }
  2671. } else
  2672. blk_plug_device(conf->mddev->queue);
  2673. }
  2674. static void activate_bit_delay(raid5_conf_t *conf)
  2675. {
  2676. /* device_lock is held */
  2677. struct list_head head;
  2678. list_add(&head, &conf->bitmap_list);
  2679. list_del_init(&conf->bitmap_list);
  2680. while (!list_empty(&head)) {
  2681. struct stripe_head *sh = list_entry(head.next, struct stripe_head, lru);
  2682. list_del_init(&sh->lru);
  2683. atomic_inc(&sh->count);
  2684. __release_stripe(conf, sh);
  2685. }
  2686. }
  2687. static void unplug_slaves(mddev_t *mddev)
  2688. {
  2689. raid5_conf_t *conf = mddev_to_conf(mddev);
  2690. int i;
  2691. rcu_read_lock();
  2692. for (i=0; i<mddev->raid_disks; i++) {
  2693. mdk_rdev_t *rdev = rcu_dereference(conf->disks[i].rdev);
  2694. if (rdev && !test_bit(Faulty, &rdev->flags) && atomic_read(&rdev->nr_pending)) {
  2695. struct request_queue *r_queue = bdev_get_queue(rdev->bdev);
  2696. atomic_inc(&rdev->nr_pending);
  2697. rcu_read_unlock();
  2698. blk_unplug(r_queue);
  2699. rdev_dec_pending(rdev, mddev);
  2700. rcu_read_lock();
  2701. }
  2702. }
  2703. rcu_read_unlock();
  2704. }
  2705. static void raid5_unplug_device(struct request_queue *q)
  2706. {
  2707. mddev_t *mddev = q->queuedata;
  2708. raid5_conf_t *conf = mddev_to_conf(mddev);
  2709. unsigned long flags;
  2710. spin_lock_irqsave(&conf->device_lock, flags);
  2711. if (blk_remove_plug(q)) {
  2712. conf->seq_flush++;
  2713. raid5_activate_delayed(conf);
  2714. }
  2715. md_wakeup_thread(mddev->thread);
  2716. spin_unlock_irqrestore(&conf->device_lock, flags);
  2717. unplug_slaves(mddev);
  2718. }
  2719. static int raid5_congested(void *data, int bits)
  2720. {
  2721. mddev_t *mddev = data;
  2722. raid5_conf_t *conf = mddev_to_conf(mddev);
  2723. /* No difference between reads and writes. Just check
  2724. * how busy the stripe_cache is
  2725. */
  2726. if (conf->inactive_blocked)
  2727. return 1;
  2728. if (conf->quiesce)
  2729. return 1;
  2730. if (list_empty_careful(&conf->inactive_list))
  2731. return 1;
  2732. return 0;
  2733. }
  2734. /* We want read requests to align with chunks where possible,
  2735. * but write requests don't need to.
  2736. */
  2737. static int raid5_mergeable_bvec(struct request_queue *q,
  2738. struct bvec_merge_data *bvm,
  2739. struct bio_vec *biovec)
  2740. {
  2741. mddev_t *mddev = q->queuedata;
  2742. sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
  2743. int max;
  2744. unsigned int chunk_sectors = mddev->chunk_size >> 9;
  2745. unsigned int bio_sectors = bvm->bi_size >> 9;
  2746. if ((bvm->bi_rw & 1) == WRITE)
  2747. return biovec->bv_len; /* always allow writes to be mergeable */
  2748. max = (chunk_sectors - ((sector & (chunk_sectors - 1)) + bio_sectors)) << 9;
  2749. if (max < 0) max = 0;
  2750. if (max <= biovec->bv_len && bio_sectors == 0)
  2751. return biovec->bv_len;
  2752. else
  2753. return max;
  2754. }
  2755. static int in_chunk_boundary(mddev_t *mddev, struct bio *bio)
  2756. {
  2757. sector_t sector = bio->bi_sector + get_start_sect(bio->bi_bdev);
  2758. unsigned int chunk_sectors = mddev->chunk_size >> 9;
  2759. unsigned int bio_sectors = bio->bi_size >> 9;
  2760. return chunk_sectors >=
  2761. ((sector & (chunk_sectors - 1)) + bio_sectors);
  2762. }
  2763. /*
  2764. * add bio to the retry LIFO ( in O(1) ... we are in interrupt )
  2765. * later sampled by raid5d.
  2766. */
  2767. static void add_bio_to_retry(struct bio *bi,raid5_conf_t *conf)
  2768. {
  2769. unsigned long flags;
  2770. spin_lock_irqsave(&conf->device_lock, flags);
  2771. bi->bi_next = conf->retry_read_aligned_list;
  2772. conf->retry_read_aligned_list = bi;
  2773. spin_unlock_irqrestore(&conf->device_lock, flags);
  2774. md_wakeup_thread(conf->mddev->thread);
  2775. }
  2776. static struct bio *remove_bio_from_retry(raid5_conf_t *conf)
  2777. {
  2778. struct bio *bi;
  2779. bi = conf->retry_read_aligned;
  2780. if (bi) {
  2781. conf->retry_read_aligned = NULL;
  2782. return bi;
  2783. }
  2784. bi = conf->retry_read_aligned_list;
  2785. if(bi) {
  2786. conf->retry_read_aligned_list = bi->bi_next;
  2787. bi->bi_next = NULL;
  2788. bi->bi_phys_segments = 1; /* biased count of active stripes */
  2789. bi->bi_hw_segments = 0; /* count of processed stripes */
  2790. }
  2791. return bi;
  2792. }
  2793. /*
  2794. * The "raid5_align_endio" should check if the read succeeded and if it
  2795. * did, call bio_endio on the original bio (having bio_put the new bio
  2796. * first).
  2797. * If the read failed..
  2798. */
  2799. static void raid5_align_endio(struct bio *bi, int error)
  2800. {
  2801. struct bio* raid_bi = bi->bi_private;
  2802. mddev_t *mddev;
  2803. raid5_conf_t *conf;
  2804. int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
  2805. mdk_rdev_t *rdev;
  2806. bio_put(bi);
  2807. mddev = raid_bi->bi_bdev->bd_disk->queue->queuedata;
  2808. conf = mddev_to_conf(mddev);
  2809. rdev = (void*)raid_bi->bi_next;
  2810. raid_bi->bi_next = NULL;
  2811. rdev_dec_pending(rdev, conf->mddev);
  2812. if (!error && uptodate) {
  2813. bio_endio(raid_bi, 0);
  2814. if (atomic_dec_and_test(&conf->active_aligned_reads))
  2815. wake_up(&conf->wait_for_stripe);
  2816. return;
  2817. }
  2818. pr_debug("raid5_align_endio : io error...handing IO for a retry\n");
  2819. add_bio_to_retry(raid_bi, conf);
  2820. }
  2821. static int bio_fits_rdev(struct bio *bi)
  2822. {
  2823. struct request_queue *q = bdev_get_queue(bi->bi_bdev);
  2824. if ((bi->bi_size>>9) > q->max_sectors)
  2825. return 0;
  2826. blk_recount_segments(q, bi);
  2827. if (bi->bi_phys_segments > q->max_phys_segments ||
  2828. bi->bi_hw_segments > q->max_hw_segments)
  2829. return 0;
  2830. if (q->merge_bvec_fn)
  2831. /* it's too hard to apply the merge_bvec_fn at this stage,
  2832. * just just give up
  2833. */
  2834. return 0;
  2835. return 1;
  2836. }
  2837. static int chunk_aligned_read(struct request_queue *q, struct bio * raid_bio)
  2838. {
  2839. mddev_t *mddev = q->queuedata;
  2840. raid5_conf_t *conf = mddev_to_conf(mddev);
  2841. const unsigned int raid_disks = conf->raid_disks;
  2842. const unsigned int data_disks = raid_disks - conf->max_degraded;
  2843. unsigned int dd_idx, pd_idx;
  2844. struct bio* align_bi;
  2845. mdk_rdev_t *rdev;
  2846. if (!in_chunk_boundary(mddev, raid_bio)) {
  2847. pr_debug("chunk_aligned_read : non aligned\n");
  2848. return 0;
  2849. }
  2850. /*
  2851. * use bio_clone to make a copy of the bio
  2852. */
  2853. align_bi = bio_clone(raid_bio, GFP_NOIO);
  2854. if (!align_bi)
  2855. return 0;
  2856. /*
  2857. * set bi_end_io to a new function, and set bi_private to the
  2858. * original bio.
  2859. */
  2860. align_bi->bi_end_io = raid5_align_endio;
  2861. align_bi->bi_private = raid_bio;
  2862. /*
  2863. * compute position
  2864. */
  2865. align_bi->bi_sector = raid5_compute_sector(raid_bio->bi_sector,
  2866. raid_disks,
  2867. data_disks,
  2868. &dd_idx,
  2869. &pd_idx,
  2870. conf);
  2871. rcu_read_lock();
  2872. rdev = rcu_dereference(conf->disks[dd_idx].rdev);
  2873. if (rdev && test_bit(In_sync, &rdev->flags)) {
  2874. atomic_inc(&rdev->nr_pending);
  2875. rcu_read_unlock();
  2876. raid_bio->bi_next = (void*)rdev;
  2877. align_bi->bi_bdev = rdev->bdev;
  2878. align_bi->bi_flags &= ~(1 << BIO_SEG_VALID);
  2879. align_bi->bi_sector += rdev->data_offset;
  2880. if (!bio_fits_rdev(align_bi)) {
  2881. /* too big in some way */
  2882. bio_put(align_bi);
  2883. rdev_dec_pending(rdev, mddev);
  2884. return 0;
  2885. }
  2886. spin_lock_irq(&conf->device_lock);
  2887. wait_event_lock_irq(conf->wait_for_stripe,
  2888. conf->quiesce == 0,
  2889. conf->device_lock, /* nothing */);
  2890. atomic_inc(&conf->active_aligned_reads);
  2891. spin_unlock_irq(&conf->device_lock);
  2892. generic_make_request(align_bi);
  2893. return 1;
  2894. } else {
  2895. rcu_read_unlock();
  2896. bio_put(align_bi);
  2897. return 0;
  2898. }
  2899. }
  2900. /* __get_priority_stripe - get the next stripe to process
  2901. *
  2902. * Full stripe writes are allowed to pass preread active stripes up until
  2903. * the bypass_threshold is exceeded. In general the bypass_count
  2904. * increments when the handle_list is handled before the hold_list; however, it
  2905. * will not be incremented when STRIPE_IO_STARTED is sampled set signifying a
  2906. * stripe with in flight i/o. The bypass_count will be reset when the
  2907. * head of the hold_list has changed, i.e. the head was promoted to the
  2908. * handle_list.
  2909. */
  2910. static struct stripe_head *__get_priority_stripe(raid5_conf_t *conf)
  2911. {
  2912. struct stripe_head *sh;
  2913. pr_debug("%s: handle: %s hold: %s full_writes: %d bypass_count: %d\n",
  2914. __func__,
  2915. list_empty(&conf->handle_list) ? "empty" : "busy",
  2916. list_empty(&conf->hold_list) ? "empty" : "busy",
  2917. atomic_read(&conf->pending_full_writes), conf->bypass_count);
  2918. if (!list_empty(&conf->handle_list)) {
  2919. sh = list_entry(conf->handle_list.next, typeof(*sh), lru);
  2920. if (list_empty(&conf->hold_list))
  2921. conf->bypass_count = 0;
  2922. else if (!test_bit(STRIPE_IO_STARTED, &sh->state)) {
  2923. if (conf->hold_list.next == conf->last_hold)
  2924. conf->bypass_count++;
  2925. else {
  2926. conf->last_hold = conf->hold_list.next;
  2927. conf->bypass_count -= conf->bypass_threshold;
  2928. if (conf->bypass_count < 0)
  2929. conf->bypass_count = 0;
  2930. }
  2931. }
  2932. } else if (!list_empty(&conf->hold_list) &&
  2933. ((conf->bypass_threshold &&
  2934. conf->bypass_count > conf->bypass_threshold) ||
  2935. atomic_read(&conf->pending_full_writes) == 0)) {
  2936. sh = list_entry(conf->hold_list.next,
  2937. typeof(*sh), lru);
  2938. conf->bypass_count -= conf->bypass_threshold;
  2939. if (conf->bypass_count < 0)
  2940. conf->bypass_count = 0;
  2941. } else
  2942. return NULL;
  2943. list_del_init(&sh->lru);
  2944. atomic_inc(&sh->count);
  2945. BUG_ON(atomic_read(&sh->count) != 1);
  2946. return sh;
  2947. }
  2948. static int make_request(struct request_queue *q, struct bio * bi)
  2949. {
  2950. mddev_t *mddev = q->queuedata;
  2951. raid5_conf_t *conf = mddev_to_conf(mddev);
  2952. unsigned int dd_idx, pd_idx;
  2953. sector_t new_sector;
  2954. sector_t logical_sector, last_sector;
  2955. struct stripe_head *sh;
  2956. const int rw = bio_data_dir(bi);
  2957. int remaining;
  2958. if (unlikely(bio_barrier(bi))) {
  2959. bio_endio(bi, -EOPNOTSUPP);
  2960. return 0;
  2961. }
  2962. md_write_start(mddev, bi);
  2963. disk_stat_inc(mddev->gendisk, ios[rw]);
  2964. disk_stat_add(mddev->gendisk, sectors[rw], bio_sectors(bi));
  2965. if (rw == READ &&
  2966. mddev->reshape_position == MaxSector &&
  2967. chunk_aligned_read(q,bi))
  2968. return 0;
  2969. logical_sector = bi->bi_sector & ~((sector_t)STRIPE_SECTORS-1);
  2970. last_sector = bi->bi_sector + (bi->bi_size>>9);
  2971. bi->bi_next = NULL;
  2972. bi->bi_phys_segments = 1; /* over-loaded to count active stripes */
  2973. for (;logical_sector < last_sector; logical_sector += STRIPE_SECTORS) {
  2974. DEFINE_WAIT(w);
  2975. int disks, data_disks;
  2976. retry:
  2977. prepare_to_wait(&conf->wait_for_overlap, &w, TASK_UNINTERRUPTIBLE);
  2978. if (likely(conf->expand_progress == MaxSector))
  2979. disks = conf->raid_disks;
  2980. else {
  2981. /* spinlock is needed as expand_progress may be
  2982. * 64bit on a 32bit platform, and so it might be
  2983. * possible to see a half-updated value
  2984. * Ofcourse expand_progress could change after
  2985. * the lock is dropped, so once we get a reference
  2986. * to the stripe that we think it is, we will have
  2987. * to check again.
  2988. */
  2989. spin_lock_irq(&conf->device_lock);
  2990. disks = conf->raid_disks;
  2991. if (logical_sector >= conf->expand_progress)
  2992. disks = conf->previous_raid_disks;
  2993. else {
  2994. if (logical_sector >= conf->expand_lo) {
  2995. spin_unlock_irq(&conf->device_lock);
  2996. schedule();
  2997. goto retry;
  2998. }
  2999. }
  3000. spin_unlock_irq(&conf->device_lock);
  3001. }
  3002. data_disks = disks - conf->max_degraded;
  3003. new_sector = raid5_compute_sector(logical_sector, disks, data_disks,
  3004. &dd_idx, &pd_idx, conf);
  3005. pr_debug("raid5: make_request, sector %llu logical %llu\n",
  3006. (unsigned long long)new_sector,
  3007. (unsigned long long)logical_sector);
  3008. sh = get_active_stripe(conf, new_sector, disks, pd_idx, (bi->bi_rw&RWA_MASK));
  3009. if (sh) {
  3010. if (unlikely(conf->expand_progress != MaxSector)) {
  3011. /* expansion might have moved on while waiting for a
  3012. * stripe, so we must do the range check again.
  3013. * Expansion could still move past after this
  3014. * test, but as we are holding a reference to
  3015. * 'sh', we know that if that happens,
  3016. * STRIPE_EXPANDING will get set and the expansion
  3017. * won't proceed until we finish with the stripe.
  3018. */
  3019. int must_retry = 0;
  3020. spin_lock_irq(&conf->device_lock);
  3021. if (logical_sector < conf->expand_progress &&
  3022. disks == conf->previous_raid_disks)
  3023. /* mismatch, need to try again */
  3024. must_retry = 1;
  3025. spin_unlock_irq(&conf->device_lock);
  3026. if (must_retry) {
  3027. release_stripe(sh);
  3028. goto retry;
  3029. }
  3030. }
  3031. /* FIXME what if we get a false positive because these
  3032. * are being updated.
  3033. */
  3034. if (logical_sector >= mddev->suspend_lo &&
  3035. logical_sector < mddev->suspend_hi) {
  3036. release_stripe(sh);
  3037. schedule();
  3038. goto retry;
  3039. }
  3040. if (test_bit(STRIPE_EXPANDING, &sh->state) ||
  3041. !add_stripe_bio(sh, bi, dd_idx, (bi->bi_rw&RW_MASK))) {
  3042. /* Stripe is busy expanding or
  3043. * add failed due to overlap. Flush everything
  3044. * and wait a while
  3045. */
  3046. raid5_unplug_device(mddev->queue);
  3047. release_stripe(sh);
  3048. schedule();
  3049. goto retry;
  3050. }
  3051. finish_wait(&conf->wait_for_overlap, &w);
  3052. set_bit(STRIPE_HANDLE, &sh->state);
  3053. clear_bit(STRIPE_DELAYED, &sh->state);
  3054. release_stripe(sh);
  3055. } else {
  3056. /* cannot get stripe for read-ahead, just give-up */
  3057. clear_bit(BIO_UPTODATE, &bi->bi_flags);
  3058. finish_wait(&conf->wait_for_overlap, &w);
  3059. break;
  3060. }
  3061. }
  3062. spin_lock_irq(&conf->device_lock);
  3063. remaining = --bi->bi_phys_segments;
  3064. spin_unlock_irq(&conf->device_lock);
  3065. if (remaining == 0) {
  3066. if ( rw == WRITE )
  3067. md_write_end(mddev);
  3068. bio_endio(bi, 0);
  3069. }
  3070. return 0;
  3071. }
  3072. static sector_t reshape_request(mddev_t *mddev, sector_t sector_nr, int *skipped)
  3073. {
  3074. /* reshaping is quite different to recovery/resync so it is
  3075. * handled quite separately ... here.
  3076. *
  3077. * On each call to sync_request, we gather one chunk worth of
  3078. * destination stripes and flag them as expanding.
  3079. * Then we find all the source stripes and request reads.
  3080. * As the reads complete, handle_stripe will copy the data
  3081. * into the destination stripe and release that stripe.
  3082. */
  3083. raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
  3084. struct stripe_head *sh;
  3085. int pd_idx;
  3086. sector_t first_sector, last_sector;
  3087. int raid_disks = conf->previous_raid_disks;
  3088. int data_disks = raid_disks - conf->max_degraded;
  3089. int new_data_disks = conf->raid_disks - conf->max_degraded;
  3090. int i;
  3091. int dd_idx;
  3092. sector_t writepos, safepos, gap;
  3093. if (sector_nr == 0 &&
  3094. conf->expand_progress != 0) {
  3095. /* restarting in the middle, skip the initial sectors */
  3096. sector_nr = conf->expand_progress;
  3097. sector_div(sector_nr, new_data_disks);
  3098. *skipped = 1;
  3099. return sector_nr;
  3100. }
  3101. /* we update the metadata when there is more than 3Meg
  3102. * in the block range (that is rather arbitrary, should
  3103. * probably be time based) or when the data about to be
  3104. * copied would over-write the source of the data at
  3105. * the front of the range.
  3106. * i.e. one new_stripe forward from expand_progress new_maps
  3107. * to after where expand_lo old_maps to
  3108. */
  3109. writepos = conf->expand_progress +
  3110. conf->chunk_size/512*(new_data_disks);
  3111. sector_div(writepos, new_data_disks);
  3112. safepos = conf->expand_lo;
  3113. sector_div(safepos, data_disks);
  3114. gap = conf->expand_progress - conf->expand_lo;
  3115. if (writepos >= safepos ||
  3116. gap > (new_data_disks)*3000*2 /*3Meg*/) {
  3117. /* Cannot proceed until we've updated the superblock... */
  3118. wait_event(conf->wait_for_overlap,
  3119. atomic_read(&conf->reshape_stripes)==0);
  3120. mddev->reshape_position = conf->expand_progress;
  3121. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  3122. md_wakeup_thread(mddev->thread);
  3123. wait_event(mddev->sb_wait, mddev->flags == 0 ||
  3124. kthread_should_stop());
  3125. spin_lock_irq(&conf->device_lock);
  3126. conf->expand_lo = mddev->reshape_position;
  3127. spin_unlock_irq(&conf->device_lock);
  3128. wake_up(&conf->wait_for_overlap);
  3129. }
  3130. for (i=0; i < conf->chunk_size/512; i+= STRIPE_SECTORS) {
  3131. int j;
  3132. int skipped = 0;
  3133. pd_idx = stripe_to_pdidx(sector_nr+i, conf, conf->raid_disks);
  3134. sh = get_active_stripe(conf, sector_nr+i,
  3135. conf->raid_disks, pd_idx, 0);
  3136. set_bit(STRIPE_EXPANDING, &sh->state);
  3137. atomic_inc(&conf->reshape_stripes);
  3138. /* If any of this stripe is beyond the end of the old
  3139. * array, then we need to zero those blocks
  3140. */
  3141. for (j=sh->disks; j--;) {
  3142. sector_t s;
  3143. if (j == sh->pd_idx)
  3144. continue;
  3145. if (conf->level == 6 &&
  3146. j == raid6_next_disk(sh->pd_idx, sh->disks))
  3147. continue;
  3148. s = compute_blocknr(sh, j);
  3149. if (s < mddev->array_sectors) {
  3150. skipped = 1;
  3151. continue;
  3152. }
  3153. memset(page_address(sh->dev[j].page), 0, STRIPE_SIZE);
  3154. set_bit(R5_Expanded, &sh->dev[j].flags);
  3155. set_bit(R5_UPTODATE, &sh->dev[j].flags);
  3156. }
  3157. if (!skipped) {
  3158. set_bit(STRIPE_EXPAND_READY, &sh->state);
  3159. set_bit(STRIPE_HANDLE, &sh->state);
  3160. }
  3161. release_stripe(sh);
  3162. }
  3163. spin_lock_irq(&conf->device_lock);
  3164. conf->expand_progress = (sector_nr + i) * new_data_disks;
  3165. spin_unlock_irq(&conf->device_lock);
  3166. /* Ok, those stripe are ready. We can start scheduling
  3167. * reads on the source stripes.
  3168. * The source stripes are determined by mapping the first and last
  3169. * block on the destination stripes.
  3170. */
  3171. first_sector =
  3172. raid5_compute_sector(sector_nr*(new_data_disks),
  3173. raid_disks, data_disks,
  3174. &dd_idx, &pd_idx, conf);
  3175. last_sector =
  3176. raid5_compute_sector((sector_nr+conf->chunk_size/512)
  3177. *(new_data_disks) -1,
  3178. raid_disks, data_disks,
  3179. &dd_idx, &pd_idx, conf);
  3180. if (last_sector >= (mddev->size<<1))
  3181. last_sector = (mddev->size<<1)-1;
  3182. while (first_sector <= last_sector) {
  3183. pd_idx = stripe_to_pdidx(first_sector, conf,
  3184. conf->previous_raid_disks);
  3185. sh = get_active_stripe(conf, first_sector,
  3186. conf->previous_raid_disks, pd_idx, 0);
  3187. set_bit(STRIPE_EXPAND_SOURCE, &sh->state);
  3188. set_bit(STRIPE_HANDLE, &sh->state);
  3189. release_stripe(sh);
  3190. first_sector += STRIPE_SECTORS;
  3191. }
  3192. /* If this takes us to the resync_max point where we have to pause,
  3193. * then we need to write out the superblock.
  3194. */
  3195. sector_nr += conf->chunk_size>>9;
  3196. if (sector_nr >= mddev->resync_max) {
  3197. /* Cannot proceed until we've updated the superblock... */
  3198. wait_event(conf->wait_for_overlap,
  3199. atomic_read(&conf->reshape_stripes) == 0);
  3200. mddev->reshape_position = conf->expand_progress;
  3201. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  3202. md_wakeup_thread(mddev->thread);
  3203. wait_event(mddev->sb_wait,
  3204. !test_bit(MD_CHANGE_DEVS, &mddev->flags)
  3205. || kthread_should_stop());
  3206. spin_lock_irq(&conf->device_lock);
  3207. conf->expand_lo = mddev->reshape_position;
  3208. spin_unlock_irq(&conf->device_lock);
  3209. wake_up(&conf->wait_for_overlap);
  3210. }
  3211. return conf->chunk_size>>9;
  3212. }
  3213. /* FIXME go_faster isn't used */
  3214. static inline sector_t sync_request(mddev_t *mddev, sector_t sector_nr, int *skipped, int go_faster)
  3215. {
  3216. raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
  3217. struct stripe_head *sh;
  3218. int pd_idx;
  3219. int raid_disks = conf->raid_disks;
  3220. sector_t max_sector = mddev->size << 1;
  3221. int sync_blocks;
  3222. int still_degraded = 0;
  3223. int i;
  3224. if (sector_nr >= max_sector) {
  3225. /* just being told to finish up .. nothing much to do */
  3226. unplug_slaves(mddev);
  3227. if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)) {
  3228. end_reshape(conf);
  3229. return 0;
  3230. }
  3231. if (mddev->curr_resync < max_sector) /* aborted */
  3232. bitmap_end_sync(mddev->bitmap, mddev->curr_resync,
  3233. &sync_blocks, 1);
  3234. else /* completed sync */
  3235. conf->fullsync = 0;
  3236. bitmap_close_sync(mddev->bitmap);
  3237. return 0;
  3238. }
  3239. if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
  3240. return reshape_request(mddev, sector_nr, skipped);
  3241. /* No need to check resync_max as we never do more than one
  3242. * stripe, and as resync_max will always be on a chunk boundary,
  3243. * if the check in md_do_sync didn't fire, there is no chance
  3244. * of overstepping resync_max here
  3245. */
  3246. /* if there is too many failed drives and we are trying
  3247. * to resync, then assert that we are finished, because there is
  3248. * nothing we can do.
  3249. */
  3250. if (mddev->degraded >= conf->max_degraded &&
  3251. test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
  3252. sector_t rv = (mddev->size << 1) - sector_nr;
  3253. *skipped = 1;
  3254. return rv;
  3255. }
  3256. if (!bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, 1) &&
  3257. !test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery) &&
  3258. !conf->fullsync && sync_blocks >= STRIPE_SECTORS) {
  3259. /* we can skip this block, and probably more */
  3260. sync_blocks /= STRIPE_SECTORS;
  3261. *skipped = 1;
  3262. return sync_blocks * STRIPE_SECTORS; /* keep things rounded to whole stripes */
  3263. }
  3264. bitmap_cond_end_sync(mddev->bitmap, sector_nr);
  3265. pd_idx = stripe_to_pdidx(sector_nr, conf, raid_disks);
  3266. sh = get_active_stripe(conf, sector_nr, raid_disks, pd_idx, 1);
  3267. if (sh == NULL) {
  3268. sh = get_active_stripe(conf, sector_nr, raid_disks, pd_idx, 0);
  3269. /* make sure we don't swamp the stripe cache if someone else
  3270. * is trying to get access
  3271. */
  3272. schedule_timeout_uninterruptible(1);
  3273. }
  3274. /* Need to check if array will still be degraded after recovery/resync
  3275. * We don't need to check the 'failed' flag as when that gets set,
  3276. * recovery aborts.
  3277. */
  3278. for (i=0; i<mddev->raid_disks; i++)
  3279. if (conf->disks[i].rdev == NULL)
  3280. still_degraded = 1;
  3281. bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, still_degraded);
  3282. spin_lock(&sh->lock);
  3283. set_bit(STRIPE_SYNCING, &sh->state);
  3284. clear_bit(STRIPE_INSYNC, &sh->state);
  3285. spin_unlock(&sh->lock);
  3286. /* wait for any blocked device to be handled */
  3287. while(unlikely(!handle_stripe(sh, NULL)))
  3288. ;
  3289. release_stripe(sh);
  3290. return STRIPE_SECTORS;
  3291. }
  3292. static int retry_aligned_read(raid5_conf_t *conf, struct bio *raid_bio)
  3293. {
  3294. /* We may not be able to submit a whole bio at once as there
  3295. * may not be enough stripe_heads available.
  3296. * We cannot pre-allocate enough stripe_heads as we may need
  3297. * more than exist in the cache (if we allow ever large chunks).
  3298. * So we do one stripe head at a time and record in
  3299. * ->bi_hw_segments how many have been done.
  3300. *
  3301. * We *know* that this entire raid_bio is in one chunk, so
  3302. * it will be only one 'dd_idx' and only need one call to raid5_compute_sector.
  3303. */
  3304. struct stripe_head *sh;
  3305. int dd_idx, pd_idx;
  3306. sector_t sector, logical_sector, last_sector;
  3307. int scnt = 0;
  3308. int remaining;
  3309. int handled = 0;
  3310. logical_sector = raid_bio->bi_sector & ~((sector_t)STRIPE_SECTORS-1);
  3311. sector = raid5_compute_sector( logical_sector,
  3312. conf->raid_disks,
  3313. conf->raid_disks - conf->max_degraded,
  3314. &dd_idx,
  3315. &pd_idx,
  3316. conf);
  3317. last_sector = raid_bio->bi_sector + (raid_bio->bi_size>>9);
  3318. for (; logical_sector < last_sector;
  3319. logical_sector += STRIPE_SECTORS,
  3320. sector += STRIPE_SECTORS,
  3321. scnt++) {
  3322. if (scnt < raid_bio->bi_hw_segments)
  3323. /* already done this stripe */
  3324. continue;
  3325. sh = get_active_stripe(conf, sector, conf->raid_disks, pd_idx, 1);
  3326. if (!sh) {
  3327. /* failed to get a stripe - must wait */
  3328. raid_bio->bi_hw_segments = scnt;
  3329. conf->retry_read_aligned = raid_bio;
  3330. return handled;
  3331. }
  3332. set_bit(R5_ReadError, &sh->dev[dd_idx].flags);
  3333. if (!add_stripe_bio(sh, raid_bio, dd_idx, 0)) {
  3334. release_stripe(sh);
  3335. raid_bio->bi_hw_segments = scnt;
  3336. conf->retry_read_aligned = raid_bio;
  3337. return handled;
  3338. }
  3339. handle_stripe(sh, NULL);
  3340. release_stripe(sh);
  3341. handled++;
  3342. }
  3343. spin_lock_irq(&conf->device_lock);
  3344. remaining = --raid_bio->bi_phys_segments;
  3345. spin_unlock_irq(&conf->device_lock);
  3346. if (remaining == 0)
  3347. bio_endio(raid_bio, 0);
  3348. if (atomic_dec_and_test(&conf->active_aligned_reads))
  3349. wake_up(&conf->wait_for_stripe);
  3350. return handled;
  3351. }
  3352. /*
  3353. * This is our raid5 kernel thread.
  3354. *
  3355. * We scan the hash table for stripes which can be handled now.
  3356. * During the scan, completed stripes are saved for us by the interrupt
  3357. * handler, so that they will not have to wait for our next wakeup.
  3358. */
  3359. static void raid5d(mddev_t *mddev)
  3360. {
  3361. struct stripe_head *sh;
  3362. raid5_conf_t *conf = mddev_to_conf(mddev);
  3363. int handled;
  3364. pr_debug("+++ raid5d active\n");
  3365. md_check_recovery(mddev);
  3366. handled = 0;
  3367. spin_lock_irq(&conf->device_lock);
  3368. while (1) {
  3369. struct bio *bio;
  3370. if (conf->seq_flush != conf->seq_write) {
  3371. int seq = conf->seq_flush;
  3372. spin_unlock_irq(&conf->device_lock);
  3373. bitmap_unplug(mddev->bitmap);
  3374. spin_lock_irq(&conf->device_lock);
  3375. conf->seq_write = seq;
  3376. activate_bit_delay(conf);
  3377. }
  3378. while ((bio = remove_bio_from_retry(conf))) {
  3379. int ok;
  3380. spin_unlock_irq(&conf->device_lock);
  3381. ok = retry_aligned_read(conf, bio);
  3382. spin_lock_irq(&conf->device_lock);
  3383. if (!ok)
  3384. break;
  3385. handled++;
  3386. }
  3387. sh = __get_priority_stripe(conf);
  3388. if (!sh)
  3389. break;
  3390. spin_unlock_irq(&conf->device_lock);
  3391. handled++;
  3392. handle_stripe(sh, conf->spare_page);
  3393. release_stripe(sh);
  3394. spin_lock_irq(&conf->device_lock);
  3395. }
  3396. pr_debug("%d stripes handled\n", handled);
  3397. spin_unlock_irq(&conf->device_lock);
  3398. async_tx_issue_pending_all();
  3399. unplug_slaves(mddev);
  3400. pr_debug("--- raid5d inactive\n");
  3401. }
  3402. static ssize_t
  3403. raid5_show_stripe_cache_size(mddev_t *mddev, char *page)
  3404. {
  3405. raid5_conf_t *conf = mddev_to_conf(mddev);
  3406. if (conf)
  3407. return sprintf(page, "%d\n", conf->max_nr_stripes);
  3408. else
  3409. return 0;
  3410. }
  3411. static ssize_t
  3412. raid5_store_stripe_cache_size(mddev_t *mddev, const char *page, size_t len)
  3413. {
  3414. raid5_conf_t *conf = mddev_to_conf(mddev);
  3415. unsigned long new;
  3416. int err;
  3417. if (len >= PAGE_SIZE)
  3418. return -EINVAL;
  3419. if (!conf)
  3420. return -ENODEV;
  3421. if (strict_strtoul(page, 10, &new))
  3422. return -EINVAL;
  3423. if (new <= 16 || new > 32768)
  3424. return -EINVAL;
  3425. while (new < conf->max_nr_stripes) {
  3426. if (drop_one_stripe(conf))
  3427. conf->max_nr_stripes--;
  3428. else
  3429. break;
  3430. }
  3431. err = md_allow_write(mddev);
  3432. if (err)
  3433. return err;
  3434. while (new > conf->max_nr_stripes) {
  3435. if (grow_one_stripe(conf))
  3436. conf->max_nr_stripes++;
  3437. else break;
  3438. }
  3439. return len;
  3440. }
  3441. static struct md_sysfs_entry
  3442. raid5_stripecache_size = __ATTR(stripe_cache_size, S_IRUGO | S_IWUSR,
  3443. raid5_show_stripe_cache_size,
  3444. raid5_store_stripe_cache_size);
  3445. static ssize_t
  3446. raid5_show_preread_threshold(mddev_t *mddev, char *page)
  3447. {
  3448. raid5_conf_t *conf = mddev_to_conf(mddev);
  3449. if (conf)
  3450. return sprintf(page, "%d\n", conf->bypass_threshold);
  3451. else
  3452. return 0;
  3453. }
  3454. static ssize_t
  3455. raid5_store_preread_threshold(mddev_t *mddev, const char *page, size_t len)
  3456. {
  3457. raid5_conf_t *conf = mddev_to_conf(mddev);
  3458. unsigned long new;
  3459. if (len >= PAGE_SIZE)
  3460. return -EINVAL;
  3461. if (!conf)
  3462. return -ENODEV;
  3463. if (strict_strtoul(page, 10, &new))
  3464. return -EINVAL;
  3465. if (new > conf->max_nr_stripes)
  3466. return -EINVAL;
  3467. conf->bypass_threshold = new;
  3468. return len;
  3469. }
  3470. static struct md_sysfs_entry
  3471. raid5_preread_bypass_threshold = __ATTR(preread_bypass_threshold,
  3472. S_IRUGO | S_IWUSR,
  3473. raid5_show_preread_threshold,
  3474. raid5_store_preread_threshold);
  3475. static ssize_t
  3476. stripe_cache_active_show(mddev_t *mddev, char *page)
  3477. {
  3478. raid5_conf_t *conf = mddev_to_conf(mddev);
  3479. if (conf)
  3480. return sprintf(page, "%d\n", atomic_read(&conf->active_stripes));
  3481. else
  3482. return 0;
  3483. }
  3484. static struct md_sysfs_entry
  3485. raid5_stripecache_active = __ATTR_RO(stripe_cache_active);
  3486. static struct attribute *raid5_attrs[] = {
  3487. &raid5_stripecache_size.attr,
  3488. &raid5_stripecache_active.attr,
  3489. &raid5_preread_bypass_threshold.attr,
  3490. NULL,
  3491. };
  3492. static struct attribute_group raid5_attrs_group = {
  3493. .name = NULL,
  3494. .attrs = raid5_attrs,
  3495. };
  3496. static int run(mddev_t *mddev)
  3497. {
  3498. raid5_conf_t *conf;
  3499. int raid_disk, memory;
  3500. mdk_rdev_t *rdev;
  3501. struct disk_info *disk;
  3502. struct list_head *tmp;
  3503. int working_disks = 0;
  3504. if (mddev->level != 5 && mddev->level != 4 && mddev->level != 6) {
  3505. printk(KERN_ERR "raid5: %s: raid level not set to 4/5/6 (%d)\n",
  3506. mdname(mddev), mddev->level);
  3507. return -EIO;
  3508. }
  3509. if (mddev->reshape_position != MaxSector) {
  3510. /* Check that we can continue the reshape.
  3511. * Currently only disks can change, it must
  3512. * increase, and we must be past the point where
  3513. * a stripe over-writes itself
  3514. */
  3515. sector_t here_new, here_old;
  3516. int old_disks;
  3517. int max_degraded = (mddev->level == 5 ? 1 : 2);
  3518. if (mddev->new_level != mddev->level ||
  3519. mddev->new_layout != mddev->layout ||
  3520. mddev->new_chunk != mddev->chunk_size) {
  3521. printk(KERN_ERR "raid5: %s: unsupported reshape "
  3522. "required - aborting.\n",
  3523. mdname(mddev));
  3524. return -EINVAL;
  3525. }
  3526. if (mddev->delta_disks <= 0) {
  3527. printk(KERN_ERR "raid5: %s: unsupported reshape "
  3528. "(reduce disks) required - aborting.\n",
  3529. mdname(mddev));
  3530. return -EINVAL;
  3531. }
  3532. old_disks = mddev->raid_disks - mddev->delta_disks;
  3533. /* reshape_position must be on a new-stripe boundary, and one
  3534. * further up in new geometry must map after here in old
  3535. * geometry.
  3536. */
  3537. here_new = mddev->reshape_position;
  3538. if (sector_div(here_new, (mddev->chunk_size>>9)*
  3539. (mddev->raid_disks - max_degraded))) {
  3540. printk(KERN_ERR "raid5: reshape_position not "
  3541. "on a stripe boundary\n");
  3542. return -EINVAL;
  3543. }
  3544. /* here_new is the stripe we will write to */
  3545. here_old = mddev->reshape_position;
  3546. sector_div(here_old, (mddev->chunk_size>>9)*
  3547. (old_disks-max_degraded));
  3548. /* here_old is the first stripe that we might need to read
  3549. * from */
  3550. if (here_new >= here_old) {
  3551. /* Reading from the same stripe as writing to - bad */
  3552. printk(KERN_ERR "raid5: reshape_position too early for "
  3553. "auto-recovery - aborting.\n");
  3554. return -EINVAL;
  3555. }
  3556. printk(KERN_INFO "raid5: reshape will continue\n");
  3557. /* OK, we should be able to continue; */
  3558. }
  3559. mddev->private = kzalloc(sizeof (raid5_conf_t), GFP_KERNEL);
  3560. if ((conf = mddev->private) == NULL)
  3561. goto abort;
  3562. if (mddev->reshape_position == MaxSector) {
  3563. conf->previous_raid_disks = conf->raid_disks = mddev->raid_disks;
  3564. } else {
  3565. conf->raid_disks = mddev->raid_disks;
  3566. conf->previous_raid_disks = mddev->raid_disks - mddev->delta_disks;
  3567. }
  3568. conf->disks = kzalloc(conf->raid_disks * sizeof(struct disk_info),
  3569. GFP_KERNEL);
  3570. if (!conf->disks)
  3571. goto abort;
  3572. conf->mddev = mddev;
  3573. if ((conf->stripe_hashtbl = kzalloc(PAGE_SIZE, GFP_KERNEL)) == NULL)
  3574. goto abort;
  3575. if (mddev->level == 6) {
  3576. conf->spare_page = alloc_page(GFP_KERNEL);
  3577. if (!conf->spare_page)
  3578. goto abort;
  3579. }
  3580. spin_lock_init(&conf->device_lock);
  3581. mddev->queue->queue_lock = &conf->device_lock;
  3582. init_waitqueue_head(&conf->wait_for_stripe);
  3583. init_waitqueue_head(&conf->wait_for_overlap);
  3584. INIT_LIST_HEAD(&conf->handle_list);
  3585. INIT_LIST_HEAD(&conf->hold_list);
  3586. INIT_LIST_HEAD(&conf->delayed_list);
  3587. INIT_LIST_HEAD(&conf->bitmap_list);
  3588. INIT_LIST_HEAD(&conf->inactive_list);
  3589. atomic_set(&conf->active_stripes, 0);
  3590. atomic_set(&conf->preread_active_stripes, 0);
  3591. atomic_set(&conf->active_aligned_reads, 0);
  3592. conf->bypass_threshold = BYPASS_THRESHOLD;
  3593. pr_debug("raid5: run(%s) called.\n", mdname(mddev));
  3594. rdev_for_each(rdev, tmp, mddev) {
  3595. raid_disk = rdev->raid_disk;
  3596. if (raid_disk >= conf->raid_disks
  3597. || raid_disk < 0)
  3598. continue;
  3599. disk = conf->disks + raid_disk;
  3600. disk->rdev = rdev;
  3601. if (test_bit(In_sync, &rdev->flags)) {
  3602. char b[BDEVNAME_SIZE];
  3603. printk(KERN_INFO "raid5: device %s operational as raid"
  3604. " disk %d\n", bdevname(rdev->bdev,b),
  3605. raid_disk);
  3606. working_disks++;
  3607. } else
  3608. /* Cannot rely on bitmap to complete recovery */
  3609. conf->fullsync = 1;
  3610. }
  3611. /*
  3612. * 0 for a fully functional array, 1 or 2 for a degraded array.
  3613. */
  3614. mddev->degraded = conf->raid_disks - working_disks;
  3615. conf->mddev = mddev;
  3616. conf->chunk_size = mddev->chunk_size;
  3617. conf->level = mddev->level;
  3618. if (conf->level == 6)
  3619. conf->max_degraded = 2;
  3620. else
  3621. conf->max_degraded = 1;
  3622. conf->algorithm = mddev->layout;
  3623. conf->max_nr_stripes = NR_STRIPES;
  3624. conf->expand_progress = mddev->reshape_position;
  3625. /* device size must be a multiple of chunk size */
  3626. mddev->size &= ~(mddev->chunk_size/1024 -1);
  3627. mddev->resync_max_sectors = mddev->size << 1;
  3628. if (conf->level == 6 && conf->raid_disks < 4) {
  3629. printk(KERN_ERR "raid6: not enough configured devices for %s (%d, minimum 4)\n",
  3630. mdname(mddev), conf->raid_disks);
  3631. goto abort;
  3632. }
  3633. if (!conf->chunk_size || conf->chunk_size % 4) {
  3634. printk(KERN_ERR "raid5: invalid chunk size %d for %s\n",
  3635. conf->chunk_size, mdname(mddev));
  3636. goto abort;
  3637. }
  3638. if (conf->algorithm > ALGORITHM_RIGHT_SYMMETRIC) {
  3639. printk(KERN_ERR
  3640. "raid5: unsupported parity algorithm %d for %s\n",
  3641. conf->algorithm, mdname(mddev));
  3642. goto abort;
  3643. }
  3644. if (mddev->degraded > conf->max_degraded) {
  3645. printk(KERN_ERR "raid5: not enough operational devices for %s"
  3646. " (%d/%d failed)\n",
  3647. mdname(mddev), mddev->degraded, conf->raid_disks);
  3648. goto abort;
  3649. }
  3650. if (mddev->degraded > 0 &&
  3651. mddev->recovery_cp != MaxSector) {
  3652. if (mddev->ok_start_degraded)
  3653. printk(KERN_WARNING
  3654. "raid5: starting dirty degraded array: %s"
  3655. "- data corruption possible.\n",
  3656. mdname(mddev));
  3657. else {
  3658. printk(KERN_ERR
  3659. "raid5: cannot start dirty degraded array for %s\n",
  3660. mdname(mddev));
  3661. goto abort;
  3662. }
  3663. }
  3664. {
  3665. mddev->thread = md_register_thread(raid5d, mddev, "%s_raid5");
  3666. if (!mddev->thread) {
  3667. printk(KERN_ERR
  3668. "raid5: couldn't allocate thread for %s\n",
  3669. mdname(mddev));
  3670. goto abort;
  3671. }
  3672. }
  3673. memory = conf->max_nr_stripes * (sizeof(struct stripe_head) +
  3674. conf->raid_disks * ((sizeof(struct bio) + PAGE_SIZE))) / 1024;
  3675. if (grow_stripes(conf, conf->max_nr_stripes)) {
  3676. printk(KERN_ERR
  3677. "raid5: couldn't allocate %dkB for buffers\n", memory);
  3678. shrink_stripes(conf);
  3679. md_unregister_thread(mddev->thread);
  3680. goto abort;
  3681. } else
  3682. printk(KERN_INFO "raid5: allocated %dkB for %s\n",
  3683. memory, mdname(mddev));
  3684. if (mddev->degraded == 0)
  3685. printk("raid5: raid level %d set %s active with %d out of %d"
  3686. " devices, algorithm %d\n", conf->level, mdname(mddev),
  3687. mddev->raid_disks-mddev->degraded, mddev->raid_disks,
  3688. conf->algorithm);
  3689. else
  3690. printk(KERN_ALERT "raid5: raid level %d set %s active with %d"
  3691. " out of %d devices, algorithm %d\n", conf->level,
  3692. mdname(mddev), mddev->raid_disks - mddev->degraded,
  3693. mddev->raid_disks, conf->algorithm);
  3694. print_raid5_conf(conf);
  3695. if (conf->expand_progress != MaxSector) {
  3696. printk("...ok start reshape thread\n");
  3697. conf->expand_lo = conf->expand_progress;
  3698. atomic_set(&conf->reshape_stripes, 0);
  3699. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  3700. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  3701. set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  3702. set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  3703. mddev->sync_thread = md_register_thread(md_do_sync, mddev,
  3704. "%s_reshape");
  3705. }
  3706. /* read-ahead size must cover two whole stripes, which is
  3707. * 2 * (datadisks) * chunksize where 'n' is the number of raid devices
  3708. */
  3709. {
  3710. int data_disks = conf->previous_raid_disks - conf->max_degraded;
  3711. int stripe = data_disks *
  3712. (mddev->chunk_size / PAGE_SIZE);
  3713. if (mddev->queue->backing_dev_info.ra_pages < 2 * stripe)
  3714. mddev->queue->backing_dev_info.ra_pages = 2 * stripe;
  3715. }
  3716. /* Ok, everything is just fine now */
  3717. if (sysfs_create_group(&mddev->kobj, &raid5_attrs_group))
  3718. printk(KERN_WARNING
  3719. "raid5: failed to create sysfs attributes for %s\n",
  3720. mdname(mddev));
  3721. mddev->queue->unplug_fn = raid5_unplug_device;
  3722. mddev->queue->backing_dev_info.congested_data = mddev;
  3723. mddev->queue->backing_dev_info.congested_fn = raid5_congested;
  3724. mddev->array_sectors = 2 * mddev->size * (conf->previous_raid_disks -
  3725. conf->max_degraded);
  3726. blk_queue_merge_bvec(mddev->queue, raid5_mergeable_bvec);
  3727. return 0;
  3728. abort:
  3729. if (conf) {
  3730. print_raid5_conf(conf);
  3731. safe_put_page(conf->spare_page);
  3732. kfree(conf->disks);
  3733. kfree(conf->stripe_hashtbl);
  3734. kfree(conf);
  3735. }
  3736. mddev->private = NULL;
  3737. printk(KERN_ALERT "raid5: failed to run raid set %s\n", mdname(mddev));
  3738. return -EIO;
  3739. }
  3740. static int stop(mddev_t *mddev)
  3741. {
  3742. raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
  3743. md_unregister_thread(mddev->thread);
  3744. mddev->thread = NULL;
  3745. shrink_stripes(conf);
  3746. kfree(conf->stripe_hashtbl);
  3747. mddev->queue->backing_dev_info.congested_fn = NULL;
  3748. blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
  3749. sysfs_remove_group(&mddev->kobj, &raid5_attrs_group);
  3750. kfree(conf->disks);
  3751. kfree(conf);
  3752. mddev->private = NULL;
  3753. return 0;
  3754. }
  3755. #ifdef DEBUG
  3756. static void print_sh (struct seq_file *seq, struct stripe_head *sh)
  3757. {
  3758. int i;
  3759. seq_printf(seq, "sh %llu, pd_idx %d, state %ld.\n",
  3760. (unsigned long long)sh->sector, sh->pd_idx, sh->state);
  3761. seq_printf(seq, "sh %llu, count %d.\n",
  3762. (unsigned long long)sh->sector, atomic_read(&sh->count));
  3763. seq_printf(seq, "sh %llu, ", (unsigned long long)sh->sector);
  3764. for (i = 0; i < sh->disks; i++) {
  3765. seq_printf(seq, "(cache%d: %p %ld) ",
  3766. i, sh->dev[i].page, sh->dev[i].flags);
  3767. }
  3768. seq_printf(seq, "\n");
  3769. }
  3770. static void printall (struct seq_file *seq, raid5_conf_t *conf)
  3771. {
  3772. struct stripe_head *sh;
  3773. struct hlist_node *hn;
  3774. int i;
  3775. spin_lock_irq(&conf->device_lock);
  3776. for (i = 0; i < NR_HASH; i++) {
  3777. hlist_for_each_entry(sh, hn, &conf->stripe_hashtbl[i], hash) {
  3778. if (sh->raid_conf != conf)
  3779. continue;
  3780. print_sh(seq, sh);
  3781. }
  3782. }
  3783. spin_unlock_irq(&conf->device_lock);
  3784. }
  3785. #endif
  3786. static void status (struct seq_file *seq, mddev_t *mddev)
  3787. {
  3788. raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
  3789. int i;
  3790. seq_printf (seq, " level %d, %dk chunk, algorithm %d", mddev->level, mddev->chunk_size >> 10, mddev->layout);
  3791. seq_printf (seq, " [%d/%d] [", conf->raid_disks, conf->raid_disks - mddev->degraded);
  3792. for (i = 0; i < conf->raid_disks; i++)
  3793. seq_printf (seq, "%s",
  3794. conf->disks[i].rdev &&
  3795. test_bit(In_sync, &conf->disks[i].rdev->flags) ? "U" : "_");
  3796. seq_printf (seq, "]");
  3797. #ifdef DEBUG
  3798. seq_printf (seq, "\n");
  3799. printall(seq, conf);
  3800. #endif
  3801. }
  3802. static void print_raid5_conf (raid5_conf_t *conf)
  3803. {
  3804. int i;
  3805. struct disk_info *tmp;
  3806. printk("RAID5 conf printout:\n");
  3807. if (!conf) {
  3808. printk("(conf==NULL)\n");
  3809. return;
  3810. }
  3811. printk(" --- rd:%d wd:%d\n", conf->raid_disks,
  3812. conf->raid_disks - conf->mddev->degraded);
  3813. for (i = 0; i < conf->raid_disks; i++) {
  3814. char b[BDEVNAME_SIZE];
  3815. tmp = conf->disks + i;
  3816. if (tmp->rdev)
  3817. printk(" disk %d, o:%d, dev:%s\n",
  3818. i, !test_bit(Faulty, &tmp->rdev->flags),
  3819. bdevname(tmp->rdev->bdev,b));
  3820. }
  3821. }
  3822. static int raid5_spare_active(mddev_t *mddev)
  3823. {
  3824. int i;
  3825. raid5_conf_t *conf = mddev->private;
  3826. struct disk_info *tmp;
  3827. for (i = 0; i < conf->raid_disks; i++) {
  3828. tmp = conf->disks + i;
  3829. if (tmp->rdev
  3830. && !test_bit(Faulty, &tmp->rdev->flags)
  3831. && !test_and_set_bit(In_sync, &tmp->rdev->flags)) {
  3832. unsigned long flags;
  3833. spin_lock_irqsave(&conf->device_lock, flags);
  3834. mddev->degraded--;
  3835. spin_unlock_irqrestore(&conf->device_lock, flags);
  3836. }
  3837. }
  3838. print_raid5_conf(conf);
  3839. return 0;
  3840. }
  3841. static int raid5_remove_disk(mddev_t *mddev, int number)
  3842. {
  3843. raid5_conf_t *conf = mddev->private;
  3844. int err = 0;
  3845. mdk_rdev_t *rdev;
  3846. struct disk_info *p = conf->disks + number;
  3847. print_raid5_conf(conf);
  3848. rdev = p->rdev;
  3849. if (rdev) {
  3850. if (test_bit(In_sync, &rdev->flags) ||
  3851. atomic_read(&rdev->nr_pending)) {
  3852. err = -EBUSY;
  3853. goto abort;
  3854. }
  3855. /* Only remove non-faulty devices if recovery
  3856. * isn't possible.
  3857. */
  3858. if (!test_bit(Faulty, &rdev->flags) &&
  3859. mddev->degraded <= conf->max_degraded) {
  3860. err = -EBUSY;
  3861. goto abort;
  3862. }
  3863. p->rdev = NULL;
  3864. synchronize_rcu();
  3865. if (atomic_read(&rdev->nr_pending)) {
  3866. /* lost the race, try later */
  3867. err = -EBUSY;
  3868. p->rdev = rdev;
  3869. }
  3870. }
  3871. abort:
  3872. print_raid5_conf(conf);
  3873. return err;
  3874. }
  3875. static int raid5_add_disk(mddev_t *mddev, mdk_rdev_t *rdev)
  3876. {
  3877. raid5_conf_t *conf = mddev->private;
  3878. int err = -EEXIST;
  3879. int disk;
  3880. struct disk_info *p;
  3881. int first = 0;
  3882. int last = conf->raid_disks - 1;
  3883. if (mddev->degraded > conf->max_degraded)
  3884. /* no point adding a device */
  3885. return -EINVAL;
  3886. if (rdev->raid_disk >= 0)
  3887. first = last = rdev->raid_disk;
  3888. /*
  3889. * find the disk ... but prefer rdev->saved_raid_disk
  3890. * if possible.
  3891. */
  3892. if (rdev->saved_raid_disk >= 0 &&
  3893. rdev->saved_raid_disk >= first &&
  3894. conf->disks[rdev->saved_raid_disk].rdev == NULL)
  3895. disk = rdev->saved_raid_disk;
  3896. else
  3897. disk = first;
  3898. for ( ; disk <= last ; disk++)
  3899. if ((p=conf->disks + disk)->rdev == NULL) {
  3900. clear_bit(In_sync, &rdev->flags);
  3901. rdev->raid_disk = disk;
  3902. err = 0;
  3903. if (rdev->saved_raid_disk != disk)
  3904. conf->fullsync = 1;
  3905. rcu_assign_pointer(p->rdev, rdev);
  3906. break;
  3907. }
  3908. print_raid5_conf(conf);
  3909. return err;
  3910. }
  3911. static int raid5_resize(mddev_t *mddev, sector_t sectors)
  3912. {
  3913. /* no resync is happening, and there is enough space
  3914. * on all devices, so we can resize.
  3915. * We need to make sure resync covers any new space.
  3916. * If the array is shrinking we should possibly wait until
  3917. * any io in the removed space completes, but it hardly seems
  3918. * worth it.
  3919. */
  3920. raid5_conf_t *conf = mddev_to_conf(mddev);
  3921. sectors &= ~((sector_t)mddev->chunk_size/512 - 1);
  3922. mddev->array_sectors = sectors * (mddev->raid_disks
  3923. - conf->max_degraded);
  3924. set_capacity(mddev->gendisk, mddev->array_sectors);
  3925. mddev->changed = 1;
  3926. if (sectors/2 > mddev->size && mddev->recovery_cp == MaxSector) {
  3927. mddev->recovery_cp = mddev->size << 1;
  3928. set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
  3929. }
  3930. mddev->size = sectors /2;
  3931. mddev->resync_max_sectors = sectors;
  3932. return 0;
  3933. }
  3934. #ifdef CONFIG_MD_RAID5_RESHAPE
  3935. static int raid5_check_reshape(mddev_t *mddev)
  3936. {
  3937. raid5_conf_t *conf = mddev_to_conf(mddev);
  3938. int err;
  3939. if (mddev->delta_disks < 0 ||
  3940. mddev->new_level != mddev->level)
  3941. return -EINVAL; /* Cannot shrink array or change level yet */
  3942. if (mddev->delta_disks == 0)
  3943. return 0; /* nothing to do */
  3944. if (mddev->bitmap)
  3945. /* Cannot grow a bitmap yet */
  3946. return -EBUSY;
  3947. /* Can only proceed if there are plenty of stripe_heads.
  3948. * We need a minimum of one full stripe,, and for sensible progress
  3949. * it is best to have about 4 times that.
  3950. * If we require 4 times, then the default 256 4K stripe_heads will
  3951. * allow for chunk sizes up to 256K, which is probably OK.
  3952. * If the chunk size is greater, user-space should request more
  3953. * stripe_heads first.
  3954. */
  3955. if ((mddev->chunk_size / STRIPE_SIZE) * 4 > conf->max_nr_stripes ||
  3956. (mddev->new_chunk / STRIPE_SIZE) * 4 > conf->max_nr_stripes) {
  3957. printk(KERN_WARNING "raid5: reshape: not enough stripes. Needed %lu\n",
  3958. (mddev->chunk_size / STRIPE_SIZE)*4);
  3959. return -ENOSPC;
  3960. }
  3961. err = resize_stripes(conf, conf->raid_disks + mddev->delta_disks);
  3962. if (err)
  3963. return err;
  3964. if (mddev->degraded > conf->max_degraded)
  3965. return -EINVAL;
  3966. /* looks like we might be able to manage this */
  3967. return 0;
  3968. }
  3969. static int raid5_start_reshape(mddev_t *mddev)
  3970. {
  3971. raid5_conf_t *conf = mddev_to_conf(mddev);
  3972. mdk_rdev_t *rdev;
  3973. struct list_head *rtmp;
  3974. int spares = 0;
  3975. int added_devices = 0;
  3976. unsigned long flags;
  3977. if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
  3978. return -EBUSY;
  3979. rdev_for_each(rdev, rtmp, mddev)
  3980. if (rdev->raid_disk < 0 &&
  3981. !test_bit(Faulty, &rdev->flags))
  3982. spares++;
  3983. if (spares - mddev->degraded < mddev->delta_disks - conf->max_degraded)
  3984. /* Not enough devices even to make a degraded array
  3985. * of that size
  3986. */
  3987. return -EINVAL;
  3988. atomic_set(&conf->reshape_stripes, 0);
  3989. spin_lock_irq(&conf->device_lock);
  3990. conf->previous_raid_disks = conf->raid_disks;
  3991. conf->raid_disks += mddev->delta_disks;
  3992. conf->expand_progress = 0;
  3993. conf->expand_lo = 0;
  3994. spin_unlock_irq(&conf->device_lock);
  3995. /* Add some new drives, as many as will fit.
  3996. * We know there are enough to make the newly sized array work.
  3997. */
  3998. rdev_for_each(rdev, rtmp, mddev)
  3999. if (rdev->raid_disk < 0 &&
  4000. !test_bit(Faulty, &rdev->flags)) {
  4001. if (raid5_add_disk(mddev, rdev) == 0) {
  4002. char nm[20];
  4003. set_bit(In_sync, &rdev->flags);
  4004. added_devices++;
  4005. rdev->recovery_offset = 0;
  4006. sprintf(nm, "rd%d", rdev->raid_disk);
  4007. if (sysfs_create_link(&mddev->kobj,
  4008. &rdev->kobj, nm))
  4009. printk(KERN_WARNING
  4010. "raid5: failed to create "
  4011. " link %s for %s\n",
  4012. nm, mdname(mddev));
  4013. } else
  4014. break;
  4015. }
  4016. spin_lock_irqsave(&conf->device_lock, flags);
  4017. mddev->degraded = (conf->raid_disks - conf->previous_raid_disks) - added_devices;
  4018. spin_unlock_irqrestore(&conf->device_lock, flags);
  4019. mddev->raid_disks = conf->raid_disks;
  4020. mddev->reshape_position = 0;
  4021. set_bit(MD_CHANGE_DEVS, &mddev->flags);
  4022. clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
  4023. clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
  4024. set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
  4025. set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
  4026. mddev->sync_thread = md_register_thread(md_do_sync, mddev,
  4027. "%s_reshape");
  4028. if (!mddev->sync_thread) {
  4029. mddev->recovery = 0;
  4030. spin_lock_irq(&conf->device_lock);
  4031. mddev->raid_disks = conf->raid_disks = conf->previous_raid_disks;
  4032. conf->expand_progress = MaxSector;
  4033. spin_unlock_irq(&conf->device_lock);
  4034. return -EAGAIN;
  4035. }
  4036. md_wakeup_thread(mddev->sync_thread);
  4037. md_new_event(mddev);
  4038. return 0;
  4039. }
  4040. #endif
  4041. static void end_reshape(raid5_conf_t *conf)
  4042. {
  4043. struct block_device *bdev;
  4044. if (!test_bit(MD_RECOVERY_INTR, &conf->mddev->recovery)) {
  4045. conf->mddev->array_sectors = 2 * conf->mddev->size *
  4046. (conf->raid_disks - conf->max_degraded);
  4047. set_capacity(conf->mddev->gendisk, conf->mddev->array_sectors);
  4048. conf->mddev->changed = 1;
  4049. bdev = bdget_disk(conf->mddev->gendisk, 0);
  4050. if (bdev) {
  4051. mutex_lock(&bdev->bd_inode->i_mutex);
  4052. i_size_write(bdev->bd_inode,
  4053. (loff_t)conf->mddev->array_sectors << 9);
  4054. mutex_unlock(&bdev->bd_inode->i_mutex);
  4055. bdput(bdev);
  4056. }
  4057. spin_lock_irq(&conf->device_lock);
  4058. conf->expand_progress = MaxSector;
  4059. spin_unlock_irq(&conf->device_lock);
  4060. conf->mddev->reshape_position = MaxSector;
  4061. /* read-ahead size must cover two whole stripes, which is
  4062. * 2 * (datadisks) * chunksize where 'n' is the number of raid devices
  4063. */
  4064. {
  4065. int data_disks = conf->previous_raid_disks - conf->max_degraded;
  4066. int stripe = data_disks *
  4067. (conf->mddev->chunk_size / PAGE_SIZE);
  4068. if (conf->mddev->queue->backing_dev_info.ra_pages < 2 * stripe)
  4069. conf->mddev->queue->backing_dev_info.ra_pages = 2 * stripe;
  4070. }
  4071. }
  4072. }
  4073. static void raid5_quiesce(mddev_t *mddev, int state)
  4074. {
  4075. raid5_conf_t *conf = mddev_to_conf(mddev);
  4076. switch(state) {
  4077. case 2: /* resume for a suspend */
  4078. wake_up(&conf->wait_for_overlap);
  4079. break;
  4080. case 1: /* stop all writes */
  4081. spin_lock_irq(&conf->device_lock);
  4082. conf->quiesce = 1;
  4083. wait_event_lock_irq(conf->wait_for_stripe,
  4084. atomic_read(&conf->active_stripes) == 0 &&
  4085. atomic_read(&conf->active_aligned_reads) == 0,
  4086. conf->device_lock, /* nothing */);
  4087. spin_unlock_irq(&conf->device_lock);
  4088. break;
  4089. case 0: /* re-enable writes */
  4090. spin_lock_irq(&conf->device_lock);
  4091. conf->quiesce = 0;
  4092. wake_up(&conf->wait_for_stripe);
  4093. wake_up(&conf->wait_for_overlap);
  4094. spin_unlock_irq(&conf->device_lock);
  4095. break;
  4096. }
  4097. }
  4098. static struct mdk_personality raid6_personality =
  4099. {
  4100. .name = "raid6",
  4101. .level = 6,
  4102. .owner = THIS_MODULE,
  4103. .make_request = make_request,
  4104. .run = run,
  4105. .stop = stop,
  4106. .status = status,
  4107. .error_handler = error,
  4108. .hot_add_disk = raid5_add_disk,
  4109. .hot_remove_disk= raid5_remove_disk,
  4110. .spare_active = raid5_spare_active,
  4111. .sync_request = sync_request,
  4112. .resize = raid5_resize,
  4113. #ifdef CONFIG_MD_RAID5_RESHAPE
  4114. .check_reshape = raid5_check_reshape,
  4115. .start_reshape = raid5_start_reshape,
  4116. #endif
  4117. .quiesce = raid5_quiesce,
  4118. };
  4119. static struct mdk_personality raid5_personality =
  4120. {
  4121. .name = "raid5",
  4122. .level = 5,
  4123. .owner = THIS_MODULE,
  4124. .make_request = make_request,
  4125. .run = run,
  4126. .stop = stop,
  4127. .status = status,
  4128. .error_handler = error,
  4129. .hot_add_disk = raid5_add_disk,
  4130. .hot_remove_disk= raid5_remove_disk,
  4131. .spare_active = raid5_spare_active,
  4132. .sync_request = sync_request,
  4133. .resize = raid5_resize,
  4134. #ifdef CONFIG_MD_RAID5_RESHAPE
  4135. .check_reshape = raid5_check_reshape,
  4136. .start_reshape = raid5_start_reshape,
  4137. #endif
  4138. .quiesce = raid5_quiesce,
  4139. };
  4140. static struct mdk_personality raid4_personality =
  4141. {
  4142. .name = "raid4",
  4143. .level = 4,
  4144. .owner = THIS_MODULE,
  4145. .make_request = make_request,
  4146. .run = run,
  4147. .stop = stop,
  4148. .status = status,
  4149. .error_handler = error,
  4150. .hot_add_disk = raid5_add_disk,
  4151. .hot_remove_disk= raid5_remove_disk,
  4152. .spare_active = raid5_spare_active,
  4153. .sync_request = sync_request,
  4154. .resize = raid5_resize,
  4155. #ifdef CONFIG_MD_RAID5_RESHAPE
  4156. .check_reshape = raid5_check_reshape,
  4157. .start_reshape = raid5_start_reshape,
  4158. #endif
  4159. .quiesce = raid5_quiesce,
  4160. };
  4161. static int __init raid5_init(void)
  4162. {
  4163. int e;
  4164. e = raid6_select_algo();
  4165. if ( e )
  4166. return e;
  4167. register_md_personality(&raid6_personality);
  4168. register_md_personality(&raid5_personality);
  4169. register_md_personality(&raid4_personality);
  4170. return 0;
  4171. }
  4172. static void raid5_exit(void)
  4173. {
  4174. unregister_md_personality(&raid6_personality);
  4175. unregister_md_personality(&raid5_personality);
  4176. unregister_md_personality(&raid4_personality);
  4177. }
  4178. module_init(raid5_init);
  4179. module_exit(raid5_exit);
  4180. MODULE_LICENSE("GPL");
  4181. MODULE_ALIAS("md-personality-4"); /* RAID5 */
  4182. MODULE_ALIAS("md-raid5");
  4183. MODULE_ALIAS("md-raid4");
  4184. MODULE_ALIAS("md-level-5");
  4185. MODULE_ALIAS("md-level-4");
  4186. MODULE_ALIAS("md-personality-8"); /* RAID6 */
  4187. MODULE_ALIAS("md-raid6");
  4188. MODULE_ALIAS("md-level-6");
  4189. /* This used to be two separate modules, they were: */
  4190. MODULE_ALIAS("raid5");
  4191. MODULE_ALIAS("raid6");