scrub.c 113 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372
  1. /*
  2. * Copyright (C) 2011, 2012 STRATO. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include <linux/blkdev.h>
  19. #include <linux/ratelimit.h>
  20. #include "ctree.h"
  21. #include "volumes.h"
  22. #include "disk-io.h"
  23. #include "ordered-data.h"
  24. #include "transaction.h"
  25. #include "backref.h"
  26. #include "extent_io.h"
  27. #include "dev-replace.h"
  28. #include "check-integrity.h"
  29. #include "rcu-string.h"
  30. #include "raid56.h"
  31. /*
  32. * This is only the first step towards a full-features scrub. It reads all
  33. * extent and super block and verifies the checksums. In case a bad checksum
  34. * is found or the extent cannot be read, good data will be written back if
  35. * any can be found.
  36. *
  37. * Future enhancements:
  38. * - In case an unrepairable extent is encountered, track which files are
  39. * affected and report them
  40. * - track and record media errors, throw out bad devices
  41. * - add a mode to also read unallocated space
  42. */
  43. struct scrub_block;
  44. struct scrub_ctx;
  45. /*
  46. * the following three values only influence the performance.
  47. * The last one configures the number of parallel and outstanding I/O
  48. * operations. The first two values configure an upper limit for the number
  49. * of (dynamically allocated) pages that are added to a bio.
  50. */
  51. #define SCRUB_PAGES_PER_RD_BIO 32 /* 128k per bio */
  52. #define SCRUB_PAGES_PER_WR_BIO 32 /* 128k per bio */
  53. #define SCRUB_BIOS_PER_SCTX 64 /* 8MB per device in flight */
  54. /*
  55. * the following value times PAGE_SIZE needs to be large enough to match the
  56. * largest node/leaf/sector size that shall be supported.
  57. * Values larger than BTRFS_STRIPE_LEN are not supported.
  58. */
  59. #define SCRUB_MAX_PAGES_PER_BLOCK 16 /* 64k per node/leaf/sector */
  60. struct scrub_recover {
  61. atomic_t refs;
  62. struct btrfs_bio *bbio;
  63. u64 map_length;
  64. };
  65. struct scrub_page {
  66. struct scrub_block *sblock;
  67. struct page *page;
  68. struct btrfs_device *dev;
  69. struct list_head list;
  70. u64 flags; /* extent flags */
  71. u64 generation;
  72. u64 logical;
  73. u64 physical;
  74. u64 physical_for_dev_replace;
  75. atomic_t refs;
  76. struct {
  77. unsigned int mirror_num:8;
  78. unsigned int have_csum:1;
  79. unsigned int io_error:1;
  80. };
  81. u8 csum[BTRFS_CSUM_SIZE];
  82. struct scrub_recover *recover;
  83. };
  84. struct scrub_bio {
  85. int index;
  86. struct scrub_ctx *sctx;
  87. struct btrfs_device *dev;
  88. struct bio *bio;
  89. int err;
  90. u64 logical;
  91. u64 physical;
  92. #if SCRUB_PAGES_PER_WR_BIO >= SCRUB_PAGES_PER_RD_BIO
  93. struct scrub_page *pagev[SCRUB_PAGES_PER_WR_BIO];
  94. #else
  95. struct scrub_page *pagev[SCRUB_PAGES_PER_RD_BIO];
  96. #endif
  97. int page_count;
  98. int next_free;
  99. struct btrfs_work work;
  100. };
  101. struct scrub_block {
  102. struct scrub_page *pagev[SCRUB_MAX_PAGES_PER_BLOCK];
  103. int page_count;
  104. atomic_t outstanding_pages;
  105. atomic_t refs; /* free mem on transition to zero */
  106. struct scrub_ctx *sctx;
  107. struct scrub_parity *sparity;
  108. struct {
  109. unsigned int header_error:1;
  110. unsigned int checksum_error:1;
  111. unsigned int no_io_error_seen:1;
  112. unsigned int generation_error:1; /* also sets header_error */
  113. /* The following is for the data used to check parity */
  114. /* It is for the data with checksum */
  115. unsigned int data_corrected:1;
  116. };
  117. struct btrfs_work work;
  118. };
  119. /* Used for the chunks with parity stripe such RAID5/6 */
  120. struct scrub_parity {
  121. struct scrub_ctx *sctx;
  122. struct btrfs_device *scrub_dev;
  123. u64 logic_start;
  124. u64 logic_end;
  125. int nsectors;
  126. int stripe_len;
  127. atomic_t refs;
  128. struct list_head spages;
  129. /* Work of parity check and repair */
  130. struct btrfs_work work;
  131. /* Mark the parity blocks which have data */
  132. unsigned long *dbitmap;
  133. /*
  134. * Mark the parity blocks which have data, but errors happen when
  135. * read data or check data
  136. */
  137. unsigned long *ebitmap;
  138. unsigned long bitmap[0];
  139. };
  140. struct scrub_wr_ctx {
  141. struct scrub_bio *wr_curr_bio;
  142. struct btrfs_device *tgtdev;
  143. int pages_per_wr_bio; /* <= SCRUB_PAGES_PER_WR_BIO */
  144. atomic_t flush_all_writes;
  145. struct mutex wr_lock;
  146. };
  147. struct scrub_ctx {
  148. struct scrub_bio *bios[SCRUB_BIOS_PER_SCTX];
  149. struct btrfs_root *dev_root;
  150. int first_free;
  151. int curr;
  152. atomic_t bios_in_flight;
  153. atomic_t workers_pending;
  154. spinlock_t list_lock;
  155. wait_queue_head_t list_wait;
  156. u16 csum_size;
  157. struct list_head csum_list;
  158. atomic_t cancel_req;
  159. int readonly;
  160. int pages_per_rd_bio;
  161. u32 sectorsize;
  162. u32 nodesize;
  163. int is_dev_replace;
  164. struct scrub_wr_ctx wr_ctx;
  165. /*
  166. * statistics
  167. */
  168. struct btrfs_scrub_progress stat;
  169. spinlock_t stat_lock;
  170. /*
  171. * Use a ref counter to avoid use-after-free issues. Scrub workers
  172. * decrement bios_in_flight and workers_pending and then do a wakeup
  173. * on the list_wait wait queue. We must ensure the main scrub task
  174. * doesn't free the scrub context before or while the workers are
  175. * doing the wakeup() call.
  176. */
  177. atomic_t refs;
  178. };
  179. struct scrub_fixup_nodatasum {
  180. struct scrub_ctx *sctx;
  181. struct btrfs_device *dev;
  182. u64 logical;
  183. struct btrfs_root *root;
  184. struct btrfs_work work;
  185. int mirror_num;
  186. };
  187. struct scrub_nocow_inode {
  188. u64 inum;
  189. u64 offset;
  190. u64 root;
  191. struct list_head list;
  192. };
  193. struct scrub_copy_nocow_ctx {
  194. struct scrub_ctx *sctx;
  195. u64 logical;
  196. u64 len;
  197. int mirror_num;
  198. u64 physical_for_dev_replace;
  199. struct list_head inodes;
  200. struct btrfs_work work;
  201. };
  202. struct scrub_warning {
  203. struct btrfs_path *path;
  204. u64 extent_item_size;
  205. const char *errstr;
  206. sector_t sector;
  207. u64 logical;
  208. struct btrfs_device *dev;
  209. };
  210. static void scrub_pending_bio_inc(struct scrub_ctx *sctx);
  211. static void scrub_pending_bio_dec(struct scrub_ctx *sctx);
  212. static void scrub_pending_trans_workers_inc(struct scrub_ctx *sctx);
  213. static void scrub_pending_trans_workers_dec(struct scrub_ctx *sctx);
  214. static int scrub_handle_errored_block(struct scrub_block *sblock_to_check);
  215. static int scrub_setup_recheck_block(struct scrub_block *original_sblock,
  216. struct scrub_block *sblocks_for_recheck);
  217. static void scrub_recheck_block(struct btrfs_fs_info *fs_info,
  218. struct scrub_block *sblock,
  219. int retry_failed_mirror);
  220. static void scrub_recheck_block_checksum(struct scrub_block *sblock);
  221. static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad,
  222. struct scrub_block *sblock_good);
  223. static int scrub_repair_page_from_good_copy(struct scrub_block *sblock_bad,
  224. struct scrub_block *sblock_good,
  225. int page_num, int force_write);
  226. static void scrub_write_block_to_dev_replace(struct scrub_block *sblock);
  227. static int scrub_write_page_to_dev_replace(struct scrub_block *sblock,
  228. int page_num);
  229. static int scrub_checksum_data(struct scrub_block *sblock);
  230. static int scrub_checksum_tree_block(struct scrub_block *sblock);
  231. static int scrub_checksum_super(struct scrub_block *sblock);
  232. static void scrub_block_get(struct scrub_block *sblock);
  233. static void scrub_block_put(struct scrub_block *sblock);
  234. static void scrub_page_get(struct scrub_page *spage);
  235. static void scrub_page_put(struct scrub_page *spage);
  236. static void scrub_parity_get(struct scrub_parity *sparity);
  237. static void scrub_parity_put(struct scrub_parity *sparity);
  238. static int scrub_add_page_to_rd_bio(struct scrub_ctx *sctx,
  239. struct scrub_page *spage);
  240. static int scrub_pages(struct scrub_ctx *sctx, u64 logical, u64 len,
  241. u64 physical, struct btrfs_device *dev, u64 flags,
  242. u64 gen, int mirror_num, u8 *csum, int force,
  243. u64 physical_for_dev_replace);
  244. static void scrub_bio_end_io(struct bio *bio);
  245. static void scrub_bio_end_io_worker(struct btrfs_work *work);
  246. static void scrub_block_complete(struct scrub_block *sblock);
  247. static void scrub_remap_extent(struct btrfs_fs_info *fs_info,
  248. u64 extent_logical, u64 extent_len,
  249. u64 *extent_physical,
  250. struct btrfs_device **extent_dev,
  251. int *extent_mirror_num);
  252. static int scrub_setup_wr_ctx(struct scrub_ctx *sctx,
  253. struct scrub_wr_ctx *wr_ctx,
  254. struct btrfs_fs_info *fs_info,
  255. struct btrfs_device *dev,
  256. int is_dev_replace);
  257. static void scrub_free_wr_ctx(struct scrub_wr_ctx *wr_ctx);
  258. static int scrub_add_page_to_wr_bio(struct scrub_ctx *sctx,
  259. struct scrub_page *spage);
  260. static void scrub_wr_submit(struct scrub_ctx *sctx);
  261. static void scrub_wr_bio_end_io(struct bio *bio);
  262. static void scrub_wr_bio_end_io_worker(struct btrfs_work *work);
  263. static int write_page_nocow(struct scrub_ctx *sctx,
  264. u64 physical_for_dev_replace, struct page *page);
  265. static int copy_nocow_pages_for_inode(u64 inum, u64 offset, u64 root,
  266. struct scrub_copy_nocow_ctx *ctx);
  267. static int copy_nocow_pages(struct scrub_ctx *sctx, u64 logical, u64 len,
  268. int mirror_num, u64 physical_for_dev_replace);
  269. static void copy_nocow_pages_worker(struct btrfs_work *work);
  270. static void __scrub_blocked_if_needed(struct btrfs_fs_info *fs_info);
  271. static void scrub_blocked_if_needed(struct btrfs_fs_info *fs_info);
  272. static void scrub_put_ctx(struct scrub_ctx *sctx);
  273. static void scrub_pending_bio_inc(struct scrub_ctx *sctx)
  274. {
  275. atomic_inc(&sctx->refs);
  276. atomic_inc(&sctx->bios_in_flight);
  277. }
  278. static void scrub_pending_bio_dec(struct scrub_ctx *sctx)
  279. {
  280. atomic_dec(&sctx->bios_in_flight);
  281. wake_up(&sctx->list_wait);
  282. scrub_put_ctx(sctx);
  283. }
  284. static void __scrub_blocked_if_needed(struct btrfs_fs_info *fs_info)
  285. {
  286. while (atomic_read(&fs_info->scrub_pause_req)) {
  287. mutex_unlock(&fs_info->scrub_lock);
  288. wait_event(fs_info->scrub_pause_wait,
  289. atomic_read(&fs_info->scrub_pause_req) == 0);
  290. mutex_lock(&fs_info->scrub_lock);
  291. }
  292. }
  293. static void scrub_pause_on(struct btrfs_fs_info *fs_info)
  294. {
  295. atomic_inc(&fs_info->scrubs_paused);
  296. wake_up(&fs_info->scrub_pause_wait);
  297. }
  298. static void scrub_pause_off(struct btrfs_fs_info *fs_info)
  299. {
  300. mutex_lock(&fs_info->scrub_lock);
  301. __scrub_blocked_if_needed(fs_info);
  302. atomic_dec(&fs_info->scrubs_paused);
  303. mutex_unlock(&fs_info->scrub_lock);
  304. wake_up(&fs_info->scrub_pause_wait);
  305. }
  306. static void scrub_blocked_if_needed(struct btrfs_fs_info *fs_info)
  307. {
  308. scrub_pause_on(fs_info);
  309. scrub_pause_off(fs_info);
  310. }
  311. /*
  312. * used for workers that require transaction commits (i.e., for the
  313. * NOCOW case)
  314. */
  315. static void scrub_pending_trans_workers_inc(struct scrub_ctx *sctx)
  316. {
  317. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  318. atomic_inc(&sctx->refs);
  319. /*
  320. * increment scrubs_running to prevent cancel requests from
  321. * completing as long as a worker is running. we must also
  322. * increment scrubs_paused to prevent deadlocking on pause
  323. * requests used for transactions commits (as the worker uses a
  324. * transaction context). it is safe to regard the worker
  325. * as paused for all matters practical. effectively, we only
  326. * avoid cancellation requests from completing.
  327. */
  328. mutex_lock(&fs_info->scrub_lock);
  329. atomic_inc(&fs_info->scrubs_running);
  330. atomic_inc(&fs_info->scrubs_paused);
  331. mutex_unlock(&fs_info->scrub_lock);
  332. /*
  333. * check if @scrubs_running=@scrubs_paused condition
  334. * inside wait_event() is not an atomic operation.
  335. * which means we may inc/dec @scrub_running/paused
  336. * at any time. Let's wake up @scrub_pause_wait as
  337. * much as we can to let commit transaction blocked less.
  338. */
  339. wake_up(&fs_info->scrub_pause_wait);
  340. atomic_inc(&sctx->workers_pending);
  341. }
  342. /* used for workers that require transaction commits */
  343. static void scrub_pending_trans_workers_dec(struct scrub_ctx *sctx)
  344. {
  345. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  346. /*
  347. * see scrub_pending_trans_workers_inc() why we're pretending
  348. * to be paused in the scrub counters
  349. */
  350. mutex_lock(&fs_info->scrub_lock);
  351. atomic_dec(&fs_info->scrubs_running);
  352. atomic_dec(&fs_info->scrubs_paused);
  353. mutex_unlock(&fs_info->scrub_lock);
  354. atomic_dec(&sctx->workers_pending);
  355. wake_up(&fs_info->scrub_pause_wait);
  356. wake_up(&sctx->list_wait);
  357. scrub_put_ctx(sctx);
  358. }
  359. static void scrub_free_csums(struct scrub_ctx *sctx)
  360. {
  361. while (!list_empty(&sctx->csum_list)) {
  362. struct btrfs_ordered_sum *sum;
  363. sum = list_first_entry(&sctx->csum_list,
  364. struct btrfs_ordered_sum, list);
  365. list_del(&sum->list);
  366. kfree(sum);
  367. }
  368. }
  369. static noinline_for_stack void scrub_free_ctx(struct scrub_ctx *sctx)
  370. {
  371. int i;
  372. if (!sctx)
  373. return;
  374. scrub_free_wr_ctx(&sctx->wr_ctx);
  375. /* this can happen when scrub is cancelled */
  376. if (sctx->curr != -1) {
  377. struct scrub_bio *sbio = sctx->bios[sctx->curr];
  378. for (i = 0; i < sbio->page_count; i++) {
  379. WARN_ON(!sbio->pagev[i]->page);
  380. scrub_block_put(sbio->pagev[i]->sblock);
  381. }
  382. bio_put(sbio->bio);
  383. }
  384. for (i = 0; i < SCRUB_BIOS_PER_SCTX; ++i) {
  385. struct scrub_bio *sbio = sctx->bios[i];
  386. if (!sbio)
  387. break;
  388. kfree(sbio);
  389. }
  390. scrub_free_csums(sctx);
  391. kfree(sctx);
  392. }
  393. static void scrub_put_ctx(struct scrub_ctx *sctx)
  394. {
  395. if (atomic_dec_and_test(&sctx->refs))
  396. scrub_free_ctx(sctx);
  397. }
  398. static noinline_for_stack
  399. struct scrub_ctx *scrub_setup_ctx(struct btrfs_device *dev, int is_dev_replace)
  400. {
  401. struct scrub_ctx *sctx;
  402. int i;
  403. struct btrfs_fs_info *fs_info = dev->dev_root->fs_info;
  404. int ret;
  405. sctx = kzalloc(sizeof(*sctx), GFP_NOFS);
  406. if (!sctx)
  407. goto nomem;
  408. atomic_set(&sctx->refs, 1);
  409. sctx->is_dev_replace = is_dev_replace;
  410. sctx->pages_per_rd_bio = SCRUB_PAGES_PER_RD_BIO;
  411. sctx->curr = -1;
  412. sctx->dev_root = dev->dev_root;
  413. for (i = 0; i < SCRUB_BIOS_PER_SCTX; ++i) {
  414. struct scrub_bio *sbio;
  415. sbio = kzalloc(sizeof(*sbio), GFP_NOFS);
  416. if (!sbio)
  417. goto nomem;
  418. sctx->bios[i] = sbio;
  419. sbio->index = i;
  420. sbio->sctx = sctx;
  421. sbio->page_count = 0;
  422. btrfs_init_work(&sbio->work, btrfs_scrub_helper,
  423. scrub_bio_end_io_worker, NULL, NULL);
  424. if (i != SCRUB_BIOS_PER_SCTX - 1)
  425. sctx->bios[i]->next_free = i + 1;
  426. else
  427. sctx->bios[i]->next_free = -1;
  428. }
  429. sctx->first_free = 0;
  430. sctx->nodesize = dev->dev_root->nodesize;
  431. sctx->sectorsize = dev->dev_root->sectorsize;
  432. atomic_set(&sctx->bios_in_flight, 0);
  433. atomic_set(&sctx->workers_pending, 0);
  434. atomic_set(&sctx->cancel_req, 0);
  435. sctx->csum_size = btrfs_super_csum_size(fs_info->super_copy);
  436. INIT_LIST_HEAD(&sctx->csum_list);
  437. spin_lock_init(&sctx->list_lock);
  438. spin_lock_init(&sctx->stat_lock);
  439. init_waitqueue_head(&sctx->list_wait);
  440. ret = scrub_setup_wr_ctx(sctx, &sctx->wr_ctx, fs_info,
  441. fs_info->dev_replace.tgtdev, is_dev_replace);
  442. if (ret) {
  443. scrub_free_ctx(sctx);
  444. return ERR_PTR(ret);
  445. }
  446. return sctx;
  447. nomem:
  448. scrub_free_ctx(sctx);
  449. return ERR_PTR(-ENOMEM);
  450. }
  451. static int scrub_print_warning_inode(u64 inum, u64 offset, u64 root,
  452. void *warn_ctx)
  453. {
  454. u64 isize;
  455. u32 nlink;
  456. int ret;
  457. int i;
  458. struct extent_buffer *eb;
  459. struct btrfs_inode_item *inode_item;
  460. struct scrub_warning *swarn = warn_ctx;
  461. struct btrfs_fs_info *fs_info = swarn->dev->dev_root->fs_info;
  462. struct inode_fs_paths *ipath = NULL;
  463. struct btrfs_root *local_root;
  464. struct btrfs_key root_key;
  465. struct btrfs_key key;
  466. root_key.objectid = root;
  467. root_key.type = BTRFS_ROOT_ITEM_KEY;
  468. root_key.offset = (u64)-1;
  469. local_root = btrfs_read_fs_root_no_name(fs_info, &root_key);
  470. if (IS_ERR(local_root)) {
  471. ret = PTR_ERR(local_root);
  472. goto err;
  473. }
  474. /*
  475. * this makes the path point to (inum INODE_ITEM ioff)
  476. */
  477. key.objectid = inum;
  478. key.type = BTRFS_INODE_ITEM_KEY;
  479. key.offset = 0;
  480. ret = btrfs_search_slot(NULL, local_root, &key, swarn->path, 0, 0);
  481. if (ret) {
  482. btrfs_release_path(swarn->path);
  483. goto err;
  484. }
  485. eb = swarn->path->nodes[0];
  486. inode_item = btrfs_item_ptr(eb, swarn->path->slots[0],
  487. struct btrfs_inode_item);
  488. isize = btrfs_inode_size(eb, inode_item);
  489. nlink = btrfs_inode_nlink(eb, inode_item);
  490. btrfs_release_path(swarn->path);
  491. ipath = init_ipath(4096, local_root, swarn->path);
  492. if (IS_ERR(ipath)) {
  493. ret = PTR_ERR(ipath);
  494. ipath = NULL;
  495. goto err;
  496. }
  497. ret = paths_from_inode(inum, ipath);
  498. if (ret < 0)
  499. goto err;
  500. /*
  501. * we deliberately ignore the bit ipath might have been too small to
  502. * hold all of the paths here
  503. */
  504. for (i = 0; i < ipath->fspath->elem_cnt; ++i)
  505. btrfs_warn_in_rcu(fs_info, "%s at logical %llu on dev "
  506. "%s, sector %llu, root %llu, inode %llu, offset %llu, "
  507. "length %llu, links %u (path: %s)", swarn->errstr,
  508. swarn->logical, rcu_str_deref(swarn->dev->name),
  509. (unsigned long long)swarn->sector, root, inum, offset,
  510. min(isize - offset, (u64)PAGE_SIZE), nlink,
  511. (char *)(unsigned long)ipath->fspath->val[i]);
  512. free_ipath(ipath);
  513. return 0;
  514. err:
  515. btrfs_warn_in_rcu(fs_info, "%s at logical %llu on dev "
  516. "%s, sector %llu, root %llu, inode %llu, offset %llu: path "
  517. "resolving failed with ret=%d", swarn->errstr,
  518. swarn->logical, rcu_str_deref(swarn->dev->name),
  519. (unsigned long long)swarn->sector, root, inum, offset, ret);
  520. free_ipath(ipath);
  521. return 0;
  522. }
  523. static void scrub_print_warning(const char *errstr, struct scrub_block *sblock)
  524. {
  525. struct btrfs_device *dev;
  526. struct btrfs_fs_info *fs_info;
  527. struct btrfs_path *path;
  528. struct btrfs_key found_key;
  529. struct extent_buffer *eb;
  530. struct btrfs_extent_item *ei;
  531. struct scrub_warning swarn;
  532. unsigned long ptr = 0;
  533. u64 extent_item_pos;
  534. u64 flags = 0;
  535. u64 ref_root;
  536. u32 item_size;
  537. u8 ref_level;
  538. int ret;
  539. WARN_ON(sblock->page_count < 1);
  540. dev = sblock->pagev[0]->dev;
  541. fs_info = sblock->sctx->dev_root->fs_info;
  542. path = btrfs_alloc_path();
  543. if (!path)
  544. return;
  545. swarn.sector = (sblock->pagev[0]->physical) >> 9;
  546. swarn.logical = sblock->pagev[0]->logical;
  547. swarn.errstr = errstr;
  548. swarn.dev = NULL;
  549. ret = extent_from_logical(fs_info, swarn.logical, path, &found_key,
  550. &flags);
  551. if (ret < 0)
  552. goto out;
  553. extent_item_pos = swarn.logical - found_key.objectid;
  554. swarn.extent_item_size = found_key.offset;
  555. eb = path->nodes[0];
  556. ei = btrfs_item_ptr(eb, path->slots[0], struct btrfs_extent_item);
  557. item_size = btrfs_item_size_nr(eb, path->slots[0]);
  558. if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
  559. do {
  560. ret = tree_backref_for_extent(&ptr, eb, &found_key, ei,
  561. item_size, &ref_root,
  562. &ref_level);
  563. btrfs_warn_in_rcu(fs_info,
  564. "%s at logical %llu on dev %s, "
  565. "sector %llu: metadata %s (level %d) in tree "
  566. "%llu", errstr, swarn.logical,
  567. rcu_str_deref(dev->name),
  568. (unsigned long long)swarn.sector,
  569. ref_level ? "node" : "leaf",
  570. ret < 0 ? -1 : ref_level,
  571. ret < 0 ? -1 : ref_root);
  572. } while (ret != 1);
  573. btrfs_release_path(path);
  574. } else {
  575. btrfs_release_path(path);
  576. swarn.path = path;
  577. swarn.dev = dev;
  578. iterate_extent_inodes(fs_info, found_key.objectid,
  579. extent_item_pos, 1,
  580. scrub_print_warning_inode, &swarn);
  581. }
  582. out:
  583. btrfs_free_path(path);
  584. }
  585. static int scrub_fixup_readpage(u64 inum, u64 offset, u64 root, void *fixup_ctx)
  586. {
  587. struct page *page = NULL;
  588. unsigned long index;
  589. struct scrub_fixup_nodatasum *fixup = fixup_ctx;
  590. int ret;
  591. int corrected = 0;
  592. struct btrfs_key key;
  593. struct inode *inode = NULL;
  594. struct btrfs_fs_info *fs_info;
  595. u64 end = offset + PAGE_SIZE - 1;
  596. struct btrfs_root *local_root;
  597. int srcu_index;
  598. key.objectid = root;
  599. key.type = BTRFS_ROOT_ITEM_KEY;
  600. key.offset = (u64)-1;
  601. fs_info = fixup->root->fs_info;
  602. srcu_index = srcu_read_lock(&fs_info->subvol_srcu);
  603. local_root = btrfs_read_fs_root_no_name(fs_info, &key);
  604. if (IS_ERR(local_root)) {
  605. srcu_read_unlock(&fs_info->subvol_srcu, srcu_index);
  606. return PTR_ERR(local_root);
  607. }
  608. key.type = BTRFS_INODE_ITEM_KEY;
  609. key.objectid = inum;
  610. key.offset = 0;
  611. inode = btrfs_iget(fs_info->sb, &key, local_root, NULL);
  612. srcu_read_unlock(&fs_info->subvol_srcu, srcu_index);
  613. if (IS_ERR(inode))
  614. return PTR_ERR(inode);
  615. index = offset >> PAGE_CACHE_SHIFT;
  616. page = find_or_create_page(inode->i_mapping, index, GFP_NOFS);
  617. if (!page) {
  618. ret = -ENOMEM;
  619. goto out;
  620. }
  621. if (PageUptodate(page)) {
  622. if (PageDirty(page)) {
  623. /*
  624. * we need to write the data to the defect sector. the
  625. * data that was in that sector is not in memory,
  626. * because the page was modified. we must not write the
  627. * modified page to that sector.
  628. *
  629. * TODO: what could be done here: wait for the delalloc
  630. * runner to write out that page (might involve
  631. * COW) and see whether the sector is still
  632. * referenced afterwards.
  633. *
  634. * For the meantime, we'll treat this error
  635. * incorrectable, although there is a chance that a
  636. * later scrub will find the bad sector again and that
  637. * there's no dirty page in memory, then.
  638. */
  639. ret = -EIO;
  640. goto out;
  641. }
  642. ret = repair_io_failure(inode, offset, PAGE_SIZE,
  643. fixup->logical, page,
  644. offset - page_offset(page),
  645. fixup->mirror_num);
  646. unlock_page(page);
  647. corrected = !ret;
  648. } else {
  649. /*
  650. * we need to get good data first. the general readpage path
  651. * will call repair_io_failure for us, we just have to make
  652. * sure we read the bad mirror.
  653. */
  654. ret = set_extent_bits(&BTRFS_I(inode)->io_tree, offset, end,
  655. EXTENT_DAMAGED, GFP_NOFS);
  656. if (ret) {
  657. /* set_extent_bits should give proper error */
  658. WARN_ON(ret > 0);
  659. if (ret > 0)
  660. ret = -EFAULT;
  661. goto out;
  662. }
  663. ret = extent_read_full_page(&BTRFS_I(inode)->io_tree, page,
  664. btrfs_get_extent,
  665. fixup->mirror_num);
  666. wait_on_page_locked(page);
  667. corrected = !test_range_bit(&BTRFS_I(inode)->io_tree, offset,
  668. end, EXTENT_DAMAGED, 0, NULL);
  669. if (!corrected)
  670. clear_extent_bits(&BTRFS_I(inode)->io_tree, offset, end,
  671. EXTENT_DAMAGED, GFP_NOFS);
  672. }
  673. out:
  674. if (page)
  675. put_page(page);
  676. iput(inode);
  677. if (ret < 0)
  678. return ret;
  679. if (ret == 0 && corrected) {
  680. /*
  681. * we only need to call readpage for one of the inodes belonging
  682. * to this extent. so make iterate_extent_inodes stop
  683. */
  684. return 1;
  685. }
  686. return -EIO;
  687. }
  688. static void scrub_fixup_nodatasum(struct btrfs_work *work)
  689. {
  690. int ret;
  691. struct scrub_fixup_nodatasum *fixup;
  692. struct scrub_ctx *sctx;
  693. struct btrfs_trans_handle *trans = NULL;
  694. struct btrfs_path *path;
  695. int uncorrectable = 0;
  696. fixup = container_of(work, struct scrub_fixup_nodatasum, work);
  697. sctx = fixup->sctx;
  698. path = btrfs_alloc_path();
  699. if (!path) {
  700. spin_lock(&sctx->stat_lock);
  701. ++sctx->stat.malloc_errors;
  702. spin_unlock(&sctx->stat_lock);
  703. uncorrectable = 1;
  704. goto out;
  705. }
  706. trans = btrfs_join_transaction(fixup->root);
  707. if (IS_ERR(trans)) {
  708. uncorrectable = 1;
  709. goto out;
  710. }
  711. /*
  712. * the idea is to trigger a regular read through the standard path. we
  713. * read a page from the (failed) logical address by specifying the
  714. * corresponding copynum of the failed sector. thus, that readpage is
  715. * expected to fail.
  716. * that is the point where on-the-fly error correction will kick in
  717. * (once it's finished) and rewrite the failed sector if a good copy
  718. * can be found.
  719. */
  720. ret = iterate_inodes_from_logical(fixup->logical, fixup->root->fs_info,
  721. path, scrub_fixup_readpage,
  722. fixup);
  723. if (ret < 0) {
  724. uncorrectable = 1;
  725. goto out;
  726. }
  727. WARN_ON(ret != 1);
  728. spin_lock(&sctx->stat_lock);
  729. ++sctx->stat.corrected_errors;
  730. spin_unlock(&sctx->stat_lock);
  731. out:
  732. if (trans && !IS_ERR(trans))
  733. btrfs_end_transaction(trans, fixup->root);
  734. if (uncorrectable) {
  735. spin_lock(&sctx->stat_lock);
  736. ++sctx->stat.uncorrectable_errors;
  737. spin_unlock(&sctx->stat_lock);
  738. btrfs_dev_replace_stats_inc(
  739. &sctx->dev_root->fs_info->dev_replace.
  740. num_uncorrectable_read_errors);
  741. btrfs_err_rl_in_rcu(sctx->dev_root->fs_info,
  742. "unable to fixup (nodatasum) error at logical %llu on dev %s",
  743. fixup->logical, rcu_str_deref(fixup->dev->name));
  744. }
  745. btrfs_free_path(path);
  746. kfree(fixup);
  747. scrub_pending_trans_workers_dec(sctx);
  748. }
  749. static inline void scrub_get_recover(struct scrub_recover *recover)
  750. {
  751. atomic_inc(&recover->refs);
  752. }
  753. static inline void scrub_put_recover(struct scrub_recover *recover)
  754. {
  755. if (atomic_dec_and_test(&recover->refs)) {
  756. btrfs_put_bbio(recover->bbio);
  757. kfree(recover);
  758. }
  759. }
  760. /*
  761. * scrub_handle_errored_block gets called when either verification of the
  762. * pages failed or the bio failed to read, e.g. with EIO. In the latter
  763. * case, this function handles all pages in the bio, even though only one
  764. * may be bad.
  765. * The goal of this function is to repair the errored block by using the
  766. * contents of one of the mirrors.
  767. */
  768. static int scrub_handle_errored_block(struct scrub_block *sblock_to_check)
  769. {
  770. struct scrub_ctx *sctx = sblock_to_check->sctx;
  771. struct btrfs_device *dev;
  772. struct btrfs_fs_info *fs_info;
  773. u64 length;
  774. u64 logical;
  775. unsigned int failed_mirror_index;
  776. unsigned int is_metadata;
  777. unsigned int have_csum;
  778. struct scrub_block *sblocks_for_recheck; /* holds one for each mirror */
  779. struct scrub_block *sblock_bad;
  780. int ret;
  781. int mirror_index;
  782. int page_num;
  783. int success;
  784. static DEFINE_RATELIMIT_STATE(_rs, DEFAULT_RATELIMIT_INTERVAL,
  785. DEFAULT_RATELIMIT_BURST);
  786. BUG_ON(sblock_to_check->page_count < 1);
  787. fs_info = sctx->dev_root->fs_info;
  788. if (sblock_to_check->pagev[0]->flags & BTRFS_EXTENT_FLAG_SUPER) {
  789. /*
  790. * if we find an error in a super block, we just report it.
  791. * They will get written with the next transaction commit
  792. * anyway
  793. */
  794. spin_lock(&sctx->stat_lock);
  795. ++sctx->stat.super_errors;
  796. spin_unlock(&sctx->stat_lock);
  797. return 0;
  798. }
  799. length = sblock_to_check->page_count * PAGE_SIZE;
  800. logical = sblock_to_check->pagev[0]->logical;
  801. BUG_ON(sblock_to_check->pagev[0]->mirror_num < 1);
  802. failed_mirror_index = sblock_to_check->pagev[0]->mirror_num - 1;
  803. is_metadata = !(sblock_to_check->pagev[0]->flags &
  804. BTRFS_EXTENT_FLAG_DATA);
  805. have_csum = sblock_to_check->pagev[0]->have_csum;
  806. dev = sblock_to_check->pagev[0]->dev;
  807. if (sctx->is_dev_replace && !is_metadata && !have_csum) {
  808. sblocks_for_recheck = NULL;
  809. goto nodatasum_case;
  810. }
  811. /*
  812. * read all mirrors one after the other. This includes to
  813. * re-read the extent or metadata block that failed (that was
  814. * the cause that this fixup code is called) another time,
  815. * page by page this time in order to know which pages
  816. * caused I/O errors and which ones are good (for all mirrors).
  817. * It is the goal to handle the situation when more than one
  818. * mirror contains I/O errors, but the errors do not
  819. * overlap, i.e. the data can be repaired by selecting the
  820. * pages from those mirrors without I/O error on the
  821. * particular pages. One example (with blocks >= 2 * PAGE_SIZE)
  822. * would be that mirror #1 has an I/O error on the first page,
  823. * the second page is good, and mirror #2 has an I/O error on
  824. * the second page, but the first page is good.
  825. * Then the first page of the first mirror can be repaired by
  826. * taking the first page of the second mirror, and the
  827. * second page of the second mirror can be repaired by
  828. * copying the contents of the 2nd page of the 1st mirror.
  829. * One more note: if the pages of one mirror contain I/O
  830. * errors, the checksum cannot be verified. In order to get
  831. * the best data for repairing, the first attempt is to find
  832. * a mirror without I/O errors and with a validated checksum.
  833. * Only if this is not possible, the pages are picked from
  834. * mirrors with I/O errors without considering the checksum.
  835. * If the latter is the case, at the end, the checksum of the
  836. * repaired area is verified in order to correctly maintain
  837. * the statistics.
  838. */
  839. sblocks_for_recheck = kcalloc(BTRFS_MAX_MIRRORS,
  840. sizeof(*sblocks_for_recheck), GFP_NOFS);
  841. if (!sblocks_for_recheck) {
  842. spin_lock(&sctx->stat_lock);
  843. sctx->stat.malloc_errors++;
  844. sctx->stat.read_errors++;
  845. sctx->stat.uncorrectable_errors++;
  846. spin_unlock(&sctx->stat_lock);
  847. btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
  848. goto out;
  849. }
  850. /* setup the context, map the logical blocks and alloc the pages */
  851. ret = scrub_setup_recheck_block(sblock_to_check, sblocks_for_recheck);
  852. if (ret) {
  853. spin_lock(&sctx->stat_lock);
  854. sctx->stat.read_errors++;
  855. sctx->stat.uncorrectable_errors++;
  856. spin_unlock(&sctx->stat_lock);
  857. btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
  858. goto out;
  859. }
  860. BUG_ON(failed_mirror_index >= BTRFS_MAX_MIRRORS);
  861. sblock_bad = sblocks_for_recheck + failed_mirror_index;
  862. /* build and submit the bios for the failed mirror, check checksums */
  863. scrub_recheck_block(fs_info, sblock_bad, 1);
  864. if (!sblock_bad->header_error && !sblock_bad->checksum_error &&
  865. sblock_bad->no_io_error_seen) {
  866. /*
  867. * the error disappeared after reading page by page, or
  868. * the area was part of a huge bio and other parts of the
  869. * bio caused I/O errors, or the block layer merged several
  870. * read requests into one and the error is caused by a
  871. * different bio (usually one of the two latter cases is
  872. * the cause)
  873. */
  874. spin_lock(&sctx->stat_lock);
  875. sctx->stat.unverified_errors++;
  876. sblock_to_check->data_corrected = 1;
  877. spin_unlock(&sctx->stat_lock);
  878. if (sctx->is_dev_replace)
  879. scrub_write_block_to_dev_replace(sblock_bad);
  880. goto out;
  881. }
  882. if (!sblock_bad->no_io_error_seen) {
  883. spin_lock(&sctx->stat_lock);
  884. sctx->stat.read_errors++;
  885. spin_unlock(&sctx->stat_lock);
  886. if (__ratelimit(&_rs))
  887. scrub_print_warning("i/o error", sblock_to_check);
  888. btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
  889. } else if (sblock_bad->checksum_error) {
  890. spin_lock(&sctx->stat_lock);
  891. sctx->stat.csum_errors++;
  892. spin_unlock(&sctx->stat_lock);
  893. if (__ratelimit(&_rs))
  894. scrub_print_warning("checksum error", sblock_to_check);
  895. btrfs_dev_stat_inc_and_print(dev,
  896. BTRFS_DEV_STAT_CORRUPTION_ERRS);
  897. } else if (sblock_bad->header_error) {
  898. spin_lock(&sctx->stat_lock);
  899. sctx->stat.verify_errors++;
  900. spin_unlock(&sctx->stat_lock);
  901. if (__ratelimit(&_rs))
  902. scrub_print_warning("checksum/header error",
  903. sblock_to_check);
  904. if (sblock_bad->generation_error)
  905. btrfs_dev_stat_inc_and_print(dev,
  906. BTRFS_DEV_STAT_GENERATION_ERRS);
  907. else
  908. btrfs_dev_stat_inc_and_print(dev,
  909. BTRFS_DEV_STAT_CORRUPTION_ERRS);
  910. }
  911. if (sctx->readonly) {
  912. ASSERT(!sctx->is_dev_replace);
  913. goto out;
  914. }
  915. if (!is_metadata && !have_csum) {
  916. struct scrub_fixup_nodatasum *fixup_nodatasum;
  917. WARN_ON(sctx->is_dev_replace);
  918. nodatasum_case:
  919. /*
  920. * !is_metadata and !have_csum, this means that the data
  921. * might not be COW'ed, that it might be modified
  922. * concurrently. The general strategy to work on the
  923. * commit root does not help in the case when COW is not
  924. * used.
  925. */
  926. fixup_nodatasum = kzalloc(sizeof(*fixup_nodatasum), GFP_NOFS);
  927. if (!fixup_nodatasum)
  928. goto did_not_correct_error;
  929. fixup_nodatasum->sctx = sctx;
  930. fixup_nodatasum->dev = dev;
  931. fixup_nodatasum->logical = logical;
  932. fixup_nodatasum->root = fs_info->extent_root;
  933. fixup_nodatasum->mirror_num = failed_mirror_index + 1;
  934. scrub_pending_trans_workers_inc(sctx);
  935. btrfs_init_work(&fixup_nodatasum->work, btrfs_scrub_helper,
  936. scrub_fixup_nodatasum, NULL, NULL);
  937. btrfs_queue_work(fs_info->scrub_workers,
  938. &fixup_nodatasum->work);
  939. goto out;
  940. }
  941. /*
  942. * now build and submit the bios for the other mirrors, check
  943. * checksums.
  944. * First try to pick the mirror which is completely without I/O
  945. * errors and also does not have a checksum error.
  946. * If one is found, and if a checksum is present, the full block
  947. * that is known to contain an error is rewritten. Afterwards
  948. * the block is known to be corrected.
  949. * If a mirror is found which is completely correct, and no
  950. * checksum is present, only those pages are rewritten that had
  951. * an I/O error in the block to be repaired, since it cannot be
  952. * determined, which copy of the other pages is better (and it
  953. * could happen otherwise that a correct page would be
  954. * overwritten by a bad one).
  955. */
  956. for (mirror_index = 0;
  957. mirror_index < BTRFS_MAX_MIRRORS &&
  958. sblocks_for_recheck[mirror_index].page_count > 0;
  959. mirror_index++) {
  960. struct scrub_block *sblock_other;
  961. if (mirror_index == failed_mirror_index)
  962. continue;
  963. sblock_other = sblocks_for_recheck + mirror_index;
  964. /* build and submit the bios, check checksums */
  965. scrub_recheck_block(fs_info, sblock_other, 0);
  966. if (!sblock_other->header_error &&
  967. !sblock_other->checksum_error &&
  968. sblock_other->no_io_error_seen) {
  969. if (sctx->is_dev_replace) {
  970. scrub_write_block_to_dev_replace(sblock_other);
  971. goto corrected_error;
  972. } else {
  973. ret = scrub_repair_block_from_good_copy(
  974. sblock_bad, sblock_other);
  975. if (!ret)
  976. goto corrected_error;
  977. }
  978. }
  979. }
  980. if (sblock_bad->no_io_error_seen && !sctx->is_dev_replace)
  981. goto did_not_correct_error;
  982. /*
  983. * In case of I/O errors in the area that is supposed to be
  984. * repaired, continue by picking good copies of those pages.
  985. * Select the good pages from mirrors to rewrite bad pages from
  986. * the area to fix. Afterwards verify the checksum of the block
  987. * that is supposed to be repaired. This verification step is
  988. * only done for the purpose of statistic counting and for the
  989. * final scrub report, whether errors remain.
  990. * A perfect algorithm could make use of the checksum and try
  991. * all possible combinations of pages from the different mirrors
  992. * until the checksum verification succeeds. For example, when
  993. * the 2nd page of mirror #1 faces I/O errors, and the 2nd page
  994. * of mirror #2 is readable but the final checksum test fails,
  995. * then the 2nd page of mirror #3 could be tried, whether now
  996. * the final checksum succeedes. But this would be a rare
  997. * exception and is therefore not implemented. At least it is
  998. * avoided that the good copy is overwritten.
  999. * A more useful improvement would be to pick the sectors
  1000. * without I/O error based on sector sizes (512 bytes on legacy
  1001. * disks) instead of on PAGE_SIZE. Then maybe 512 byte of one
  1002. * mirror could be repaired by taking 512 byte of a different
  1003. * mirror, even if other 512 byte sectors in the same PAGE_SIZE
  1004. * area are unreadable.
  1005. */
  1006. success = 1;
  1007. for (page_num = 0; page_num < sblock_bad->page_count;
  1008. page_num++) {
  1009. struct scrub_page *page_bad = sblock_bad->pagev[page_num];
  1010. struct scrub_block *sblock_other = NULL;
  1011. /* skip no-io-error page in scrub */
  1012. if (!page_bad->io_error && !sctx->is_dev_replace)
  1013. continue;
  1014. /* try to find no-io-error page in mirrors */
  1015. if (page_bad->io_error) {
  1016. for (mirror_index = 0;
  1017. mirror_index < BTRFS_MAX_MIRRORS &&
  1018. sblocks_for_recheck[mirror_index].page_count > 0;
  1019. mirror_index++) {
  1020. if (!sblocks_for_recheck[mirror_index].
  1021. pagev[page_num]->io_error) {
  1022. sblock_other = sblocks_for_recheck +
  1023. mirror_index;
  1024. break;
  1025. }
  1026. }
  1027. if (!sblock_other)
  1028. success = 0;
  1029. }
  1030. if (sctx->is_dev_replace) {
  1031. /*
  1032. * did not find a mirror to fetch the page
  1033. * from. scrub_write_page_to_dev_replace()
  1034. * handles this case (page->io_error), by
  1035. * filling the block with zeros before
  1036. * submitting the write request
  1037. */
  1038. if (!sblock_other)
  1039. sblock_other = sblock_bad;
  1040. if (scrub_write_page_to_dev_replace(sblock_other,
  1041. page_num) != 0) {
  1042. btrfs_dev_replace_stats_inc(
  1043. &sctx->dev_root->
  1044. fs_info->dev_replace.
  1045. num_write_errors);
  1046. success = 0;
  1047. }
  1048. } else if (sblock_other) {
  1049. ret = scrub_repair_page_from_good_copy(sblock_bad,
  1050. sblock_other,
  1051. page_num, 0);
  1052. if (0 == ret)
  1053. page_bad->io_error = 0;
  1054. else
  1055. success = 0;
  1056. }
  1057. }
  1058. if (success && !sctx->is_dev_replace) {
  1059. if (is_metadata || have_csum) {
  1060. /*
  1061. * need to verify the checksum now that all
  1062. * sectors on disk are repaired (the write
  1063. * request for data to be repaired is on its way).
  1064. * Just be lazy and use scrub_recheck_block()
  1065. * which re-reads the data before the checksum
  1066. * is verified, but most likely the data comes out
  1067. * of the page cache.
  1068. */
  1069. scrub_recheck_block(fs_info, sblock_bad, 1);
  1070. if (!sblock_bad->header_error &&
  1071. !sblock_bad->checksum_error &&
  1072. sblock_bad->no_io_error_seen)
  1073. goto corrected_error;
  1074. else
  1075. goto did_not_correct_error;
  1076. } else {
  1077. corrected_error:
  1078. spin_lock(&sctx->stat_lock);
  1079. sctx->stat.corrected_errors++;
  1080. sblock_to_check->data_corrected = 1;
  1081. spin_unlock(&sctx->stat_lock);
  1082. btrfs_err_rl_in_rcu(fs_info,
  1083. "fixed up error at logical %llu on dev %s",
  1084. logical, rcu_str_deref(dev->name));
  1085. }
  1086. } else {
  1087. did_not_correct_error:
  1088. spin_lock(&sctx->stat_lock);
  1089. sctx->stat.uncorrectable_errors++;
  1090. spin_unlock(&sctx->stat_lock);
  1091. btrfs_err_rl_in_rcu(fs_info,
  1092. "unable to fixup (regular) error at logical %llu on dev %s",
  1093. logical, rcu_str_deref(dev->name));
  1094. }
  1095. out:
  1096. if (sblocks_for_recheck) {
  1097. for (mirror_index = 0; mirror_index < BTRFS_MAX_MIRRORS;
  1098. mirror_index++) {
  1099. struct scrub_block *sblock = sblocks_for_recheck +
  1100. mirror_index;
  1101. struct scrub_recover *recover;
  1102. int page_index;
  1103. for (page_index = 0; page_index < sblock->page_count;
  1104. page_index++) {
  1105. sblock->pagev[page_index]->sblock = NULL;
  1106. recover = sblock->pagev[page_index]->recover;
  1107. if (recover) {
  1108. scrub_put_recover(recover);
  1109. sblock->pagev[page_index]->recover =
  1110. NULL;
  1111. }
  1112. scrub_page_put(sblock->pagev[page_index]);
  1113. }
  1114. }
  1115. kfree(sblocks_for_recheck);
  1116. }
  1117. return 0;
  1118. }
  1119. static inline int scrub_nr_raid_mirrors(struct btrfs_bio *bbio)
  1120. {
  1121. if (bbio->map_type & BTRFS_BLOCK_GROUP_RAID5)
  1122. return 2;
  1123. else if (bbio->map_type & BTRFS_BLOCK_GROUP_RAID6)
  1124. return 3;
  1125. else
  1126. return (int)bbio->num_stripes;
  1127. }
  1128. static inline void scrub_stripe_index_and_offset(u64 logical, u64 map_type,
  1129. u64 *raid_map,
  1130. u64 mapped_length,
  1131. int nstripes, int mirror,
  1132. int *stripe_index,
  1133. u64 *stripe_offset)
  1134. {
  1135. int i;
  1136. if (map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
  1137. /* RAID5/6 */
  1138. for (i = 0; i < nstripes; i++) {
  1139. if (raid_map[i] == RAID6_Q_STRIPE ||
  1140. raid_map[i] == RAID5_P_STRIPE)
  1141. continue;
  1142. if (logical >= raid_map[i] &&
  1143. logical < raid_map[i] + mapped_length)
  1144. break;
  1145. }
  1146. *stripe_index = i;
  1147. *stripe_offset = logical - raid_map[i];
  1148. } else {
  1149. /* The other RAID type */
  1150. *stripe_index = mirror;
  1151. *stripe_offset = 0;
  1152. }
  1153. }
  1154. static int scrub_setup_recheck_block(struct scrub_block *original_sblock,
  1155. struct scrub_block *sblocks_for_recheck)
  1156. {
  1157. struct scrub_ctx *sctx = original_sblock->sctx;
  1158. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  1159. u64 length = original_sblock->page_count * PAGE_SIZE;
  1160. u64 logical = original_sblock->pagev[0]->logical;
  1161. u64 generation = original_sblock->pagev[0]->generation;
  1162. u64 flags = original_sblock->pagev[0]->flags;
  1163. u64 have_csum = original_sblock->pagev[0]->have_csum;
  1164. struct scrub_recover *recover;
  1165. struct btrfs_bio *bbio;
  1166. u64 sublen;
  1167. u64 mapped_length;
  1168. u64 stripe_offset;
  1169. int stripe_index;
  1170. int page_index = 0;
  1171. int mirror_index;
  1172. int nmirrors;
  1173. int ret;
  1174. /*
  1175. * note: the two members refs and outstanding_pages
  1176. * are not used (and not set) in the blocks that are used for
  1177. * the recheck procedure
  1178. */
  1179. while (length > 0) {
  1180. sublen = min_t(u64, length, PAGE_SIZE);
  1181. mapped_length = sublen;
  1182. bbio = NULL;
  1183. /*
  1184. * with a length of PAGE_SIZE, each returned stripe
  1185. * represents one mirror
  1186. */
  1187. ret = btrfs_map_sblock(fs_info, REQ_GET_READ_MIRRORS, logical,
  1188. &mapped_length, &bbio, 0, 1);
  1189. if (ret || !bbio || mapped_length < sublen) {
  1190. btrfs_put_bbio(bbio);
  1191. return -EIO;
  1192. }
  1193. recover = kzalloc(sizeof(struct scrub_recover), GFP_NOFS);
  1194. if (!recover) {
  1195. btrfs_put_bbio(bbio);
  1196. return -ENOMEM;
  1197. }
  1198. atomic_set(&recover->refs, 1);
  1199. recover->bbio = bbio;
  1200. recover->map_length = mapped_length;
  1201. BUG_ON(page_index >= SCRUB_PAGES_PER_RD_BIO);
  1202. nmirrors = min(scrub_nr_raid_mirrors(bbio), BTRFS_MAX_MIRRORS);
  1203. for (mirror_index = 0; mirror_index < nmirrors;
  1204. mirror_index++) {
  1205. struct scrub_block *sblock;
  1206. struct scrub_page *page;
  1207. sblock = sblocks_for_recheck + mirror_index;
  1208. sblock->sctx = sctx;
  1209. page = kzalloc(sizeof(*page), GFP_NOFS);
  1210. if (!page) {
  1211. leave_nomem:
  1212. spin_lock(&sctx->stat_lock);
  1213. sctx->stat.malloc_errors++;
  1214. spin_unlock(&sctx->stat_lock);
  1215. scrub_put_recover(recover);
  1216. return -ENOMEM;
  1217. }
  1218. scrub_page_get(page);
  1219. sblock->pagev[page_index] = page;
  1220. page->sblock = sblock;
  1221. page->flags = flags;
  1222. page->generation = generation;
  1223. page->logical = logical;
  1224. page->have_csum = have_csum;
  1225. if (have_csum)
  1226. memcpy(page->csum,
  1227. original_sblock->pagev[0]->csum,
  1228. sctx->csum_size);
  1229. scrub_stripe_index_and_offset(logical,
  1230. bbio->map_type,
  1231. bbio->raid_map,
  1232. mapped_length,
  1233. bbio->num_stripes -
  1234. bbio->num_tgtdevs,
  1235. mirror_index,
  1236. &stripe_index,
  1237. &stripe_offset);
  1238. page->physical = bbio->stripes[stripe_index].physical +
  1239. stripe_offset;
  1240. page->dev = bbio->stripes[stripe_index].dev;
  1241. BUG_ON(page_index >= original_sblock->page_count);
  1242. page->physical_for_dev_replace =
  1243. original_sblock->pagev[page_index]->
  1244. physical_for_dev_replace;
  1245. /* for missing devices, dev->bdev is NULL */
  1246. page->mirror_num = mirror_index + 1;
  1247. sblock->page_count++;
  1248. page->page = alloc_page(GFP_NOFS);
  1249. if (!page->page)
  1250. goto leave_nomem;
  1251. scrub_get_recover(recover);
  1252. page->recover = recover;
  1253. }
  1254. scrub_put_recover(recover);
  1255. length -= sublen;
  1256. logical += sublen;
  1257. page_index++;
  1258. }
  1259. return 0;
  1260. }
  1261. struct scrub_bio_ret {
  1262. struct completion event;
  1263. int error;
  1264. };
  1265. static void scrub_bio_wait_endio(struct bio *bio)
  1266. {
  1267. struct scrub_bio_ret *ret = bio->bi_private;
  1268. ret->error = bio->bi_error;
  1269. complete(&ret->event);
  1270. }
  1271. static inline int scrub_is_page_on_raid56(struct scrub_page *page)
  1272. {
  1273. return page->recover &&
  1274. (page->recover->bbio->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK);
  1275. }
  1276. static int scrub_submit_raid56_bio_wait(struct btrfs_fs_info *fs_info,
  1277. struct bio *bio,
  1278. struct scrub_page *page)
  1279. {
  1280. struct scrub_bio_ret done;
  1281. int ret;
  1282. init_completion(&done.event);
  1283. done.error = 0;
  1284. bio->bi_iter.bi_sector = page->logical >> 9;
  1285. bio->bi_private = &done;
  1286. bio->bi_end_io = scrub_bio_wait_endio;
  1287. ret = raid56_parity_recover(fs_info->fs_root, bio, page->recover->bbio,
  1288. page->recover->map_length,
  1289. page->mirror_num, 0);
  1290. if (ret)
  1291. return ret;
  1292. wait_for_completion(&done.event);
  1293. if (done.error)
  1294. return -EIO;
  1295. return 0;
  1296. }
  1297. /*
  1298. * this function will check the on disk data for checksum errors, header
  1299. * errors and read I/O errors. If any I/O errors happen, the exact pages
  1300. * which are errored are marked as being bad. The goal is to enable scrub
  1301. * to take those pages that are not errored from all the mirrors so that
  1302. * the pages that are errored in the just handled mirror can be repaired.
  1303. */
  1304. static void scrub_recheck_block(struct btrfs_fs_info *fs_info,
  1305. struct scrub_block *sblock,
  1306. int retry_failed_mirror)
  1307. {
  1308. int page_num;
  1309. sblock->no_io_error_seen = 1;
  1310. for (page_num = 0; page_num < sblock->page_count; page_num++) {
  1311. struct bio *bio;
  1312. struct scrub_page *page = sblock->pagev[page_num];
  1313. if (page->dev->bdev == NULL) {
  1314. page->io_error = 1;
  1315. sblock->no_io_error_seen = 0;
  1316. continue;
  1317. }
  1318. WARN_ON(!page->page);
  1319. bio = btrfs_io_bio_alloc(GFP_NOFS, 1);
  1320. if (!bio) {
  1321. page->io_error = 1;
  1322. sblock->no_io_error_seen = 0;
  1323. continue;
  1324. }
  1325. bio->bi_bdev = page->dev->bdev;
  1326. bio_add_page(bio, page->page, PAGE_SIZE, 0);
  1327. if (!retry_failed_mirror && scrub_is_page_on_raid56(page)) {
  1328. if (scrub_submit_raid56_bio_wait(fs_info, bio, page))
  1329. sblock->no_io_error_seen = 0;
  1330. } else {
  1331. bio->bi_iter.bi_sector = page->physical >> 9;
  1332. if (btrfsic_submit_bio_wait(READ, bio))
  1333. sblock->no_io_error_seen = 0;
  1334. }
  1335. bio_put(bio);
  1336. }
  1337. if (sblock->no_io_error_seen)
  1338. scrub_recheck_block_checksum(sblock);
  1339. return;
  1340. }
  1341. static inline int scrub_check_fsid(u8 fsid[],
  1342. struct scrub_page *spage)
  1343. {
  1344. struct btrfs_fs_devices *fs_devices = spage->dev->fs_devices;
  1345. int ret;
  1346. ret = memcmp(fsid, fs_devices->fsid, BTRFS_UUID_SIZE);
  1347. return !ret;
  1348. }
  1349. static void scrub_recheck_block_checksum(struct scrub_block *sblock)
  1350. {
  1351. sblock->header_error = 0;
  1352. sblock->checksum_error = 0;
  1353. sblock->generation_error = 0;
  1354. if (sblock->pagev[0]->flags & BTRFS_EXTENT_FLAG_DATA)
  1355. scrub_checksum_data(sblock);
  1356. else
  1357. scrub_checksum_tree_block(sblock);
  1358. }
  1359. static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad,
  1360. struct scrub_block *sblock_good)
  1361. {
  1362. int page_num;
  1363. int ret = 0;
  1364. for (page_num = 0; page_num < sblock_bad->page_count; page_num++) {
  1365. int ret_sub;
  1366. ret_sub = scrub_repair_page_from_good_copy(sblock_bad,
  1367. sblock_good,
  1368. page_num, 1);
  1369. if (ret_sub)
  1370. ret = ret_sub;
  1371. }
  1372. return ret;
  1373. }
  1374. static int scrub_repair_page_from_good_copy(struct scrub_block *sblock_bad,
  1375. struct scrub_block *sblock_good,
  1376. int page_num, int force_write)
  1377. {
  1378. struct scrub_page *page_bad = sblock_bad->pagev[page_num];
  1379. struct scrub_page *page_good = sblock_good->pagev[page_num];
  1380. BUG_ON(page_bad->page == NULL);
  1381. BUG_ON(page_good->page == NULL);
  1382. if (force_write || sblock_bad->header_error ||
  1383. sblock_bad->checksum_error || page_bad->io_error) {
  1384. struct bio *bio;
  1385. int ret;
  1386. if (!page_bad->dev->bdev) {
  1387. btrfs_warn_rl(sblock_bad->sctx->dev_root->fs_info,
  1388. "scrub_repair_page_from_good_copy(bdev == NULL) "
  1389. "is unexpected");
  1390. return -EIO;
  1391. }
  1392. bio = btrfs_io_bio_alloc(GFP_NOFS, 1);
  1393. if (!bio)
  1394. return -EIO;
  1395. bio->bi_bdev = page_bad->dev->bdev;
  1396. bio->bi_iter.bi_sector = page_bad->physical >> 9;
  1397. ret = bio_add_page(bio, page_good->page, PAGE_SIZE, 0);
  1398. if (PAGE_SIZE != ret) {
  1399. bio_put(bio);
  1400. return -EIO;
  1401. }
  1402. if (btrfsic_submit_bio_wait(WRITE, bio)) {
  1403. btrfs_dev_stat_inc_and_print(page_bad->dev,
  1404. BTRFS_DEV_STAT_WRITE_ERRS);
  1405. btrfs_dev_replace_stats_inc(
  1406. &sblock_bad->sctx->dev_root->fs_info->
  1407. dev_replace.num_write_errors);
  1408. bio_put(bio);
  1409. return -EIO;
  1410. }
  1411. bio_put(bio);
  1412. }
  1413. return 0;
  1414. }
  1415. static void scrub_write_block_to_dev_replace(struct scrub_block *sblock)
  1416. {
  1417. int page_num;
  1418. /*
  1419. * This block is used for the check of the parity on the source device,
  1420. * so the data needn't be written into the destination device.
  1421. */
  1422. if (sblock->sparity)
  1423. return;
  1424. for (page_num = 0; page_num < sblock->page_count; page_num++) {
  1425. int ret;
  1426. ret = scrub_write_page_to_dev_replace(sblock, page_num);
  1427. if (ret)
  1428. btrfs_dev_replace_stats_inc(
  1429. &sblock->sctx->dev_root->fs_info->dev_replace.
  1430. num_write_errors);
  1431. }
  1432. }
  1433. static int scrub_write_page_to_dev_replace(struct scrub_block *sblock,
  1434. int page_num)
  1435. {
  1436. struct scrub_page *spage = sblock->pagev[page_num];
  1437. BUG_ON(spage->page == NULL);
  1438. if (spage->io_error) {
  1439. void *mapped_buffer = kmap_atomic(spage->page);
  1440. memset(mapped_buffer, 0, PAGE_CACHE_SIZE);
  1441. flush_dcache_page(spage->page);
  1442. kunmap_atomic(mapped_buffer);
  1443. }
  1444. return scrub_add_page_to_wr_bio(sblock->sctx, spage);
  1445. }
  1446. static int scrub_add_page_to_wr_bio(struct scrub_ctx *sctx,
  1447. struct scrub_page *spage)
  1448. {
  1449. struct scrub_wr_ctx *wr_ctx = &sctx->wr_ctx;
  1450. struct scrub_bio *sbio;
  1451. int ret;
  1452. mutex_lock(&wr_ctx->wr_lock);
  1453. again:
  1454. if (!wr_ctx->wr_curr_bio) {
  1455. wr_ctx->wr_curr_bio = kzalloc(sizeof(*wr_ctx->wr_curr_bio),
  1456. GFP_NOFS);
  1457. if (!wr_ctx->wr_curr_bio) {
  1458. mutex_unlock(&wr_ctx->wr_lock);
  1459. return -ENOMEM;
  1460. }
  1461. wr_ctx->wr_curr_bio->sctx = sctx;
  1462. wr_ctx->wr_curr_bio->page_count = 0;
  1463. }
  1464. sbio = wr_ctx->wr_curr_bio;
  1465. if (sbio->page_count == 0) {
  1466. struct bio *bio;
  1467. sbio->physical = spage->physical_for_dev_replace;
  1468. sbio->logical = spage->logical;
  1469. sbio->dev = wr_ctx->tgtdev;
  1470. bio = sbio->bio;
  1471. if (!bio) {
  1472. bio = btrfs_io_bio_alloc(GFP_NOFS, wr_ctx->pages_per_wr_bio);
  1473. if (!bio) {
  1474. mutex_unlock(&wr_ctx->wr_lock);
  1475. return -ENOMEM;
  1476. }
  1477. sbio->bio = bio;
  1478. }
  1479. bio->bi_private = sbio;
  1480. bio->bi_end_io = scrub_wr_bio_end_io;
  1481. bio->bi_bdev = sbio->dev->bdev;
  1482. bio->bi_iter.bi_sector = sbio->physical >> 9;
  1483. sbio->err = 0;
  1484. } else if (sbio->physical + sbio->page_count * PAGE_SIZE !=
  1485. spage->physical_for_dev_replace ||
  1486. sbio->logical + sbio->page_count * PAGE_SIZE !=
  1487. spage->logical) {
  1488. scrub_wr_submit(sctx);
  1489. goto again;
  1490. }
  1491. ret = bio_add_page(sbio->bio, spage->page, PAGE_SIZE, 0);
  1492. if (ret != PAGE_SIZE) {
  1493. if (sbio->page_count < 1) {
  1494. bio_put(sbio->bio);
  1495. sbio->bio = NULL;
  1496. mutex_unlock(&wr_ctx->wr_lock);
  1497. return -EIO;
  1498. }
  1499. scrub_wr_submit(sctx);
  1500. goto again;
  1501. }
  1502. sbio->pagev[sbio->page_count] = spage;
  1503. scrub_page_get(spage);
  1504. sbio->page_count++;
  1505. if (sbio->page_count == wr_ctx->pages_per_wr_bio)
  1506. scrub_wr_submit(sctx);
  1507. mutex_unlock(&wr_ctx->wr_lock);
  1508. return 0;
  1509. }
  1510. static void scrub_wr_submit(struct scrub_ctx *sctx)
  1511. {
  1512. struct scrub_wr_ctx *wr_ctx = &sctx->wr_ctx;
  1513. struct scrub_bio *sbio;
  1514. if (!wr_ctx->wr_curr_bio)
  1515. return;
  1516. sbio = wr_ctx->wr_curr_bio;
  1517. wr_ctx->wr_curr_bio = NULL;
  1518. WARN_ON(!sbio->bio->bi_bdev);
  1519. scrub_pending_bio_inc(sctx);
  1520. /* process all writes in a single worker thread. Then the block layer
  1521. * orders the requests before sending them to the driver which
  1522. * doubled the write performance on spinning disks when measured
  1523. * with Linux 3.5 */
  1524. btrfsic_submit_bio(WRITE, sbio->bio);
  1525. }
  1526. static void scrub_wr_bio_end_io(struct bio *bio)
  1527. {
  1528. struct scrub_bio *sbio = bio->bi_private;
  1529. struct btrfs_fs_info *fs_info = sbio->dev->dev_root->fs_info;
  1530. sbio->err = bio->bi_error;
  1531. sbio->bio = bio;
  1532. btrfs_init_work(&sbio->work, btrfs_scrubwrc_helper,
  1533. scrub_wr_bio_end_io_worker, NULL, NULL);
  1534. btrfs_queue_work(fs_info->scrub_wr_completion_workers, &sbio->work);
  1535. }
  1536. static void scrub_wr_bio_end_io_worker(struct btrfs_work *work)
  1537. {
  1538. struct scrub_bio *sbio = container_of(work, struct scrub_bio, work);
  1539. struct scrub_ctx *sctx = sbio->sctx;
  1540. int i;
  1541. WARN_ON(sbio->page_count > SCRUB_PAGES_PER_WR_BIO);
  1542. if (sbio->err) {
  1543. struct btrfs_dev_replace *dev_replace =
  1544. &sbio->sctx->dev_root->fs_info->dev_replace;
  1545. for (i = 0; i < sbio->page_count; i++) {
  1546. struct scrub_page *spage = sbio->pagev[i];
  1547. spage->io_error = 1;
  1548. btrfs_dev_replace_stats_inc(&dev_replace->
  1549. num_write_errors);
  1550. }
  1551. }
  1552. for (i = 0; i < sbio->page_count; i++)
  1553. scrub_page_put(sbio->pagev[i]);
  1554. bio_put(sbio->bio);
  1555. kfree(sbio);
  1556. scrub_pending_bio_dec(sctx);
  1557. }
  1558. static int scrub_checksum(struct scrub_block *sblock)
  1559. {
  1560. u64 flags;
  1561. int ret;
  1562. /*
  1563. * No need to initialize these stats currently,
  1564. * because this function only use return value
  1565. * instead of these stats value.
  1566. *
  1567. * Todo:
  1568. * always use stats
  1569. */
  1570. sblock->header_error = 0;
  1571. sblock->generation_error = 0;
  1572. sblock->checksum_error = 0;
  1573. WARN_ON(sblock->page_count < 1);
  1574. flags = sblock->pagev[0]->flags;
  1575. ret = 0;
  1576. if (flags & BTRFS_EXTENT_FLAG_DATA)
  1577. ret = scrub_checksum_data(sblock);
  1578. else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)
  1579. ret = scrub_checksum_tree_block(sblock);
  1580. else if (flags & BTRFS_EXTENT_FLAG_SUPER)
  1581. (void)scrub_checksum_super(sblock);
  1582. else
  1583. WARN_ON(1);
  1584. if (ret)
  1585. scrub_handle_errored_block(sblock);
  1586. return ret;
  1587. }
  1588. static int scrub_checksum_data(struct scrub_block *sblock)
  1589. {
  1590. struct scrub_ctx *sctx = sblock->sctx;
  1591. u8 csum[BTRFS_CSUM_SIZE];
  1592. u8 *on_disk_csum;
  1593. struct page *page;
  1594. void *buffer;
  1595. u32 crc = ~(u32)0;
  1596. u64 len;
  1597. int index;
  1598. BUG_ON(sblock->page_count < 1);
  1599. if (!sblock->pagev[0]->have_csum)
  1600. return 0;
  1601. on_disk_csum = sblock->pagev[0]->csum;
  1602. page = sblock->pagev[0]->page;
  1603. buffer = kmap_atomic(page);
  1604. len = sctx->sectorsize;
  1605. index = 0;
  1606. for (;;) {
  1607. u64 l = min_t(u64, len, PAGE_SIZE);
  1608. crc = btrfs_csum_data(buffer, crc, l);
  1609. kunmap_atomic(buffer);
  1610. len -= l;
  1611. if (len == 0)
  1612. break;
  1613. index++;
  1614. BUG_ON(index >= sblock->page_count);
  1615. BUG_ON(!sblock->pagev[index]->page);
  1616. page = sblock->pagev[index]->page;
  1617. buffer = kmap_atomic(page);
  1618. }
  1619. btrfs_csum_final(crc, csum);
  1620. if (memcmp(csum, on_disk_csum, sctx->csum_size))
  1621. sblock->checksum_error = 1;
  1622. return sblock->checksum_error;
  1623. }
  1624. static int scrub_checksum_tree_block(struct scrub_block *sblock)
  1625. {
  1626. struct scrub_ctx *sctx = sblock->sctx;
  1627. struct btrfs_header *h;
  1628. struct btrfs_root *root = sctx->dev_root;
  1629. struct btrfs_fs_info *fs_info = root->fs_info;
  1630. u8 calculated_csum[BTRFS_CSUM_SIZE];
  1631. u8 on_disk_csum[BTRFS_CSUM_SIZE];
  1632. struct page *page;
  1633. void *mapped_buffer;
  1634. u64 mapped_size;
  1635. void *p;
  1636. u32 crc = ~(u32)0;
  1637. u64 len;
  1638. int index;
  1639. BUG_ON(sblock->page_count < 1);
  1640. page = sblock->pagev[0]->page;
  1641. mapped_buffer = kmap_atomic(page);
  1642. h = (struct btrfs_header *)mapped_buffer;
  1643. memcpy(on_disk_csum, h->csum, sctx->csum_size);
  1644. /*
  1645. * we don't use the getter functions here, as we
  1646. * a) don't have an extent buffer and
  1647. * b) the page is already kmapped
  1648. */
  1649. if (sblock->pagev[0]->logical != btrfs_stack_header_bytenr(h))
  1650. sblock->header_error = 1;
  1651. if (sblock->pagev[0]->generation != btrfs_stack_header_generation(h)) {
  1652. sblock->header_error = 1;
  1653. sblock->generation_error = 1;
  1654. }
  1655. if (!scrub_check_fsid(h->fsid, sblock->pagev[0]))
  1656. sblock->header_error = 1;
  1657. if (memcmp(h->chunk_tree_uuid, fs_info->chunk_tree_uuid,
  1658. BTRFS_UUID_SIZE))
  1659. sblock->header_error = 1;
  1660. len = sctx->nodesize - BTRFS_CSUM_SIZE;
  1661. mapped_size = PAGE_SIZE - BTRFS_CSUM_SIZE;
  1662. p = ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE;
  1663. index = 0;
  1664. for (;;) {
  1665. u64 l = min_t(u64, len, mapped_size);
  1666. crc = btrfs_csum_data(p, crc, l);
  1667. kunmap_atomic(mapped_buffer);
  1668. len -= l;
  1669. if (len == 0)
  1670. break;
  1671. index++;
  1672. BUG_ON(index >= sblock->page_count);
  1673. BUG_ON(!sblock->pagev[index]->page);
  1674. page = sblock->pagev[index]->page;
  1675. mapped_buffer = kmap_atomic(page);
  1676. mapped_size = PAGE_SIZE;
  1677. p = mapped_buffer;
  1678. }
  1679. btrfs_csum_final(crc, calculated_csum);
  1680. if (memcmp(calculated_csum, on_disk_csum, sctx->csum_size))
  1681. sblock->checksum_error = 1;
  1682. return sblock->header_error || sblock->checksum_error;
  1683. }
  1684. static int scrub_checksum_super(struct scrub_block *sblock)
  1685. {
  1686. struct btrfs_super_block *s;
  1687. struct scrub_ctx *sctx = sblock->sctx;
  1688. u8 calculated_csum[BTRFS_CSUM_SIZE];
  1689. u8 on_disk_csum[BTRFS_CSUM_SIZE];
  1690. struct page *page;
  1691. void *mapped_buffer;
  1692. u64 mapped_size;
  1693. void *p;
  1694. u32 crc = ~(u32)0;
  1695. int fail_gen = 0;
  1696. int fail_cor = 0;
  1697. u64 len;
  1698. int index;
  1699. BUG_ON(sblock->page_count < 1);
  1700. page = sblock->pagev[0]->page;
  1701. mapped_buffer = kmap_atomic(page);
  1702. s = (struct btrfs_super_block *)mapped_buffer;
  1703. memcpy(on_disk_csum, s->csum, sctx->csum_size);
  1704. if (sblock->pagev[0]->logical != btrfs_super_bytenr(s))
  1705. ++fail_cor;
  1706. if (sblock->pagev[0]->generation != btrfs_super_generation(s))
  1707. ++fail_gen;
  1708. if (!scrub_check_fsid(s->fsid, sblock->pagev[0]))
  1709. ++fail_cor;
  1710. len = BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE;
  1711. mapped_size = PAGE_SIZE - BTRFS_CSUM_SIZE;
  1712. p = ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE;
  1713. index = 0;
  1714. for (;;) {
  1715. u64 l = min_t(u64, len, mapped_size);
  1716. crc = btrfs_csum_data(p, crc, l);
  1717. kunmap_atomic(mapped_buffer);
  1718. len -= l;
  1719. if (len == 0)
  1720. break;
  1721. index++;
  1722. BUG_ON(index >= sblock->page_count);
  1723. BUG_ON(!sblock->pagev[index]->page);
  1724. page = sblock->pagev[index]->page;
  1725. mapped_buffer = kmap_atomic(page);
  1726. mapped_size = PAGE_SIZE;
  1727. p = mapped_buffer;
  1728. }
  1729. btrfs_csum_final(crc, calculated_csum);
  1730. if (memcmp(calculated_csum, on_disk_csum, sctx->csum_size))
  1731. ++fail_cor;
  1732. if (fail_cor + fail_gen) {
  1733. /*
  1734. * if we find an error in a super block, we just report it.
  1735. * They will get written with the next transaction commit
  1736. * anyway
  1737. */
  1738. spin_lock(&sctx->stat_lock);
  1739. ++sctx->stat.super_errors;
  1740. spin_unlock(&sctx->stat_lock);
  1741. if (fail_cor)
  1742. btrfs_dev_stat_inc_and_print(sblock->pagev[0]->dev,
  1743. BTRFS_DEV_STAT_CORRUPTION_ERRS);
  1744. else
  1745. btrfs_dev_stat_inc_and_print(sblock->pagev[0]->dev,
  1746. BTRFS_DEV_STAT_GENERATION_ERRS);
  1747. }
  1748. return fail_cor + fail_gen;
  1749. }
  1750. static void scrub_block_get(struct scrub_block *sblock)
  1751. {
  1752. atomic_inc(&sblock->refs);
  1753. }
  1754. static void scrub_block_put(struct scrub_block *sblock)
  1755. {
  1756. if (atomic_dec_and_test(&sblock->refs)) {
  1757. int i;
  1758. if (sblock->sparity)
  1759. scrub_parity_put(sblock->sparity);
  1760. for (i = 0; i < sblock->page_count; i++)
  1761. scrub_page_put(sblock->pagev[i]);
  1762. kfree(sblock);
  1763. }
  1764. }
  1765. static void scrub_page_get(struct scrub_page *spage)
  1766. {
  1767. atomic_inc(&spage->refs);
  1768. }
  1769. static void scrub_page_put(struct scrub_page *spage)
  1770. {
  1771. if (atomic_dec_and_test(&spage->refs)) {
  1772. if (spage->page)
  1773. __free_page(spage->page);
  1774. kfree(spage);
  1775. }
  1776. }
  1777. static void scrub_submit(struct scrub_ctx *sctx)
  1778. {
  1779. struct scrub_bio *sbio;
  1780. if (sctx->curr == -1)
  1781. return;
  1782. sbio = sctx->bios[sctx->curr];
  1783. sctx->curr = -1;
  1784. scrub_pending_bio_inc(sctx);
  1785. btrfsic_submit_bio(READ, sbio->bio);
  1786. }
  1787. static int scrub_add_page_to_rd_bio(struct scrub_ctx *sctx,
  1788. struct scrub_page *spage)
  1789. {
  1790. struct scrub_block *sblock = spage->sblock;
  1791. struct scrub_bio *sbio;
  1792. int ret;
  1793. again:
  1794. /*
  1795. * grab a fresh bio or wait for one to become available
  1796. */
  1797. while (sctx->curr == -1) {
  1798. spin_lock(&sctx->list_lock);
  1799. sctx->curr = sctx->first_free;
  1800. if (sctx->curr != -1) {
  1801. sctx->first_free = sctx->bios[sctx->curr]->next_free;
  1802. sctx->bios[sctx->curr]->next_free = -1;
  1803. sctx->bios[sctx->curr]->page_count = 0;
  1804. spin_unlock(&sctx->list_lock);
  1805. } else {
  1806. spin_unlock(&sctx->list_lock);
  1807. wait_event(sctx->list_wait, sctx->first_free != -1);
  1808. }
  1809. }
  1810. sbio = sctx->bios[sctx->curr];
  1811. if (sbio->page_count == 0) {
  1812. struct bio *bio;
  1813. sbio->physical = spage->physical;
  1814. sbio->logical = spage->logical;
  1815. sbio->dev = spage->dev;
  1816. bio = sbio->bio;
  1817. if (!bio) {
  1818. bio = btrfs_io_bio_alloc(GFP_NOFS, sctx->pages_per_rd_bio);
  1819. if (!bio)
  1820. return -ENOMEM;
  1821. sbio->bio = bio;
  1822. }
  1823. bio->bi_private = sbio;
  1824. bio->bi_end_io = scrub_bio_end_io;
  1825. bio->bi_bdev = sbio->dev->bdev;
  1826. bio->bi_iter.bi_sector = sbio->physical >> 9;
  1827. sbio->err = 0;
  1828. } else if (sbio->physical + sbio->page_count * PAGE_SIZE !=
  1829. spage->physical ||
  1830. sbio->logical + sbio->page_count * PAGE_SIZE !=
  1831. spage->logical ||
  1832. sbio->dev != spage->dev) {
  1833. scrub_submit(sctx);
  1834. goto again;
  1835. }
  1836. sbio->pagev[sbio->page_count] = spage;
  1837. ret = bio_add_page(sbio->bio, spage->page, PAGE_SIZE, 0);
  1838. if (ret != PAGE_SIZE) {
  1839. if (sbio->page_count < 1) {
  1840. bio_put(sbio->bio);
  1841. sbio->bio = NULL;
  1842. return -EIO;
  1843. }
  1844. scrub_submit(sctx);
  1845. goto again;
  1846. }
  1847. scrub_block_get(sblock); /* one for the page added to the bio */
  1848. atomic_inc(&sblock->outstanding_pages);
  1849. sbio->page_count++;
  1850. if (sbio->page_count == sctx->pages_per_rd_bio)
  1851. scrub_submit(sctx);
  1852. return 0;
  1853. }
  1854. static void scrub_missing_raid56_end_io(struct bio *bio)
  1855. {
  1856. struct scrub_block *sblock = bio->bi_private;
  1857. struct btrfs_fs_info *fs_info = sblock->sctx->dev_root->fs_info;
  1858. if (bio->bi_error)
  1859. sblock->no_io_error_seen = 0;
  1860. btrfs_queue_work(fs_info->scrub_workers, &sblock->work);
  1861. }
  1862. static void scrub_missing_raid56_worker(struct btrfs_work *work)
  1863. {
  1864. struct scrub_block *sblock = container_of(work, struct scrub_block, work);
  1865. struct scrub_ctx *sctx = sblock->sctx;
  1866. u64 logical;
  1867. struct btrfs_device *dev;
  1868. logical = sblock->pagev[0]->logical;
  1869. dev = sblock->pagev[0]->dev;
  1870. if (sblock->no_io_error_seen)
  1871. scrub_recheck_block_checksum(sblock);
  1872. if (!sblock->no_io_error_seen) {
  1873. spin_lock(&sctx->stat_lock);
  1874. sctx->stat.read_errors++;
  1875. spin_unlock(&sctx->stat_lock);
  1876. btrfs_err_rl_in_rcu(sctx->dev_root->fs_info,
  1877. "IO error rebuilding logical %llu for dev %s",
  1878. logical, rcu_str_deref(dev->name));
  1879. } else if (sblock->header_error || sblock->checksum_error) {
  1880. spin_lock(&sctx->stat_lock);
  1881. sctx->stat.uncorrectable_errors++;
  1882. spin_unlock(&sctx->stat_lock);
  1883. btrfs_err_rl_in_rcu(sctx->dev_root->fs_info,
  1884. "failed to rebuild valid logical %llu for dev %s",
  1885. logical, rcu_str_deref(dev->name));
  1886. } else {
  1887. scrub_write_block_to_dev_replace(sblock);
  1888. }
  1889. scrub_block_put(sblock);
  1890. if (sctx->is_dev_replace &&
  1891. atomic_read(&sctx->wr_ctx.flush_all_writes)) {
  1892. mutex_lock(&sctx->wr_ctx.wr_lock);
  1893. scrub_wr_submit(sctx);
  1894. mutex_unlock(&sctx->wr_ctx.wr_lock);
  1895. }
  1896. scrub_pending_bio_dec(sctx);
  1897. }
  1898. static void scrub_missing_raid56_pages(struct scrub_block *sblock)
  1899. {
  1900. struct scrub_ctx *sctx = sblock->sctx;
  1901. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  1902. u64 length = sblock->page_count * PAGE_SIZE;
  1903. u64 logical = sblock->pagev[0]->logical;
  1904. struct btrfs_bio *bbio;
  1905. struct bio *bio;
  1906. struct btrfs_raid_bio *rbio;
  1907. int ret;
  1908. int i;
  1909. ret = btrfs_map_sblock(fs_info, REQ_GET_READ_MIRRORS, logical, &length,
  1910. &bbio, 0, 1);
  1911. if (ret || !bbio || !bbio->raid_map)
  1912. goto bbio_out;
  1913. if (WARN_ON(!sctx->is_dev_replace ||
  1914. !(bbio->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK))) {
  1915. /*
  1916. * We shouldn't be scrubbing a missing device. Even for dev
  1917. * replace, we should only get here for RAID 5/6. We either
  1918. * managed to mount something with no mirrors remaining or
  1919. * there's a bug in scrub_remap_extent()/btrfs_map_block().
  1920. */
  1921. goto bbio_out;
  1922. }
  1923. bio = btrfs_io_bio_alloc(GFP_NOFS, 0);
  1924. if (!bio)
  1925. goto bbio_out;
  1926. bio->bi_iter.bi_sector = logical >> 9;
  1927. bio->bi_private = sblock;
  1928. bio->bi_end_io = scrub_missing_raid56_end_io;
  1929. rbio = raid56_alloc_missing_rbio(sctx->dev_root, bio, bbio, length);
  1930. if (!rbio)
  1931. goto rbio_out;
  1932. for (i = 0; i < sblock->page_count; i++) {
  1933. struct scrub_page *spage = sblock->pagev[i];
  1934. raid56_add_scrub_pages(rbio, spage->page, spage->logical);
  1935. }
  1936. btrfs_init_work(&sblock->work, btrfs_scrub_helper,
  1937. scrub_missing_raid56_worker, NULL, NULL);
  1938. scrub_block_get(sblock);
  1939. scrub_pending_bio_inc(sctx);
  1940. raid56_submit_missing_rbio(rbio);
  1941. return;
  1942. rbio_out:
  1943. bio_put(bio);
  1944. bbio_out:
  1945. btrfs_put_bbio(bbio);
  1946. spin_lock(&sctx->stat_lock);
  1947. sctx->stat.malloc_errors++;
  1948. spin_unlock(&sctx->stat_lock);
  1949. }
  1950. static int scrub_pages(struct scrub_ctx *sctx, u64 logical, u64 len,
  1951. u64 physical, struct btrfs_device *dev, u64 flags,
  1952. u64 gen, int mirror_num, u8 *csum, int force,
  1953. u64 physical_for_dev_replace)
  1954. {
  1955. struct scrub_block *sblock;
  1956. int index;
  1957. sblock = kzalloc(sizeof(*sblock), GFP_NOFS);
  1958. if (!sblock) {
  1959. spin_lock(&sctx->stat_lock);
  1960. sctx->stat.malloc_errors++;
  1961. spin_unlock(&sctx->stat_lock);
  1962. return -ENOMEM;
  1963. }
  1964. /* one ref inside this function, plus one for each page added to
  1965. * a bio later on */
  1966. atomic_set(&sblock->refs, 1);
  1967. sblock->sctx = sctx;
  1968. sblock->no_io_error_seen = 1;
  1969. for (index = 0; len > 0; index++) {
  1970. struct scrub_page *spage;
  1971. u64 l = min_t(u64, len, PAGE_SIZE);
  1972. spage = kzalloc(sizeof(*spage), GFP_NOFS);
  1973. if (!spage) {
  1974. leave_nomem:
  1975. spin_lock(&sctx->stat_lock);
  1976. sctx->stat.malloc_errors++;
  1977. spin_unlock(&sctx->stat_lock);
  1978. scrub_block_put(sblock);
  1979. return -ENOMEM;
  1980. }
  1981. BUG_ON(index >= SCRUB_MAX_PAGES_PER_BLOCK);
  1982. scrub_page_get(spage);
  1983. sblock->pagev[index] = spage;
  1984. spage->sblock = sblock;
  1985. spage->dev = dev;
  1986. spage->flags = flags;
  1987. spage->generation = gen;
  1988. spage->logical = logical;
  1989. spage->physical = physical;
  1990. spage->physical_for_dev_replace = physical_for_dev_replace;
  1991. spage->mirror_num = mirror_num;
  1992. if (csum) {
  1993. spage->have_csum = 1;
  1994. memcpy(spage->csum, csum, sctx->csum_size);
  1995. } else {
  1996. spage->have_csum = 0;
  1997. }
  1998. sblock->page_count++;
  1999. spage->page = alloc_page(GFP_NOFS);
  2000. if (!spage->page)
  2001. goto leave_nomem;
  2002. len -= l;
  2003. logical += l;
  2004. physical += l;
  2005. physical_for_dev_replace += l;
  2006. }
  2007. WARN_ON(sblock->page_count == 0);
  2008. if (dev->missing) {
  2009. /*
  2010. * This case should only be hit for RAID 5/6 device replace. See
  2011. * the comment in scrub_missing_raid56_pages() for details.
  2012. */
  2013. scrub_missing_raid56_pages(sblock);
  2014. } else {
  2015. for (index = 0; index < sblock->page_count; index++) {
  2016. struct scrub_page *spage = sblock->pagev[index];
  2017. int ret;
  2018. ret = scrub_add_page_to_rd_bio(sctx, spage);
  2019. if (ret) {
  2020. scrub_block_put(sblock);
  2021. return ret;
  2022. }
  2023. }
  2024. if (force)
  2025. scrub_submit(sctx);
  2026. }
  2027. /* last one frees, either here or in bio completion for last page */
  2028. scrub_block_put(sblock);
  2029. return 0;
  2030. }
  2031. static void scrub_bio_end_io(struct bio *bio)
  2032. {
  2033. struct scrub_bio *sbio = bio->bi_private;
  2034. struct btrfs_fs_info *fs_info = sbio->dev->dev_root->fs_info;
  2035. sbio->err = bio->bi_error;
  2036. sbio->bio = bio;
  2037. btrfs_queue_work(fs_info->scrub_workers, &sbio->work);
  2038. }
  2039. static void scrub_bio_end_io_worker(struct btrfs_work *work)
  2040. {
  2041. struct scrub_bio *sbio = container_of(work, struct scrub_bio, work);
  2042. struct scrub_ctx *sctx = sbio->sctx;
  2043. int i;
  2044. BUG_ON(sbio->page_count > SCRUB_PAGES_PER_RD_BIO);
  2045. if (sbio->err) {
  2046. for (i = 0; i < sbio->page_count; i++) {
  2047. struct scrub_page *spage = sbio->pagev[i];
  2048. spage->io_error = 1;
  2049. spage->sblock->no_io_error_seen = 0;
  2050. }
  2051. }
  2052. /* now complete the scrub_block items that have all pages completed */
  2053. for (i = 0; i < sbio->page_count; i++) {
  2054. struct scrub_page *spage = sbio->pagev[i];
  2055. struct scrub_block *sblock = spage->sblock;
  2056. if (atomic_dec_and_test(&sblock->outstanding_pages))
  2057. scrub_block_complete(sblock);
  2058. scrub_block_put(sblock);
  2059. }
  2060. bio_put(sbio->bio);
  2061. sbio->bio = NULL;
  2062. spin_lock(&sctx->list_lock);
  2063. sbio->next_free = sctx->first_free;
  2064. sctx->first_free = sbio->index;
  2065. spin_unlock(&sctx->list_lock);
  2066. if (sctx->is_dev_replace &&
  2067. atomic_read(&sctx->wr_ctx.flush_all_writes)) {
  2068. mutex_lock(&sctx->wr_ctx.wr_lock);
  2069. scrub_wr_submit(sctx);
  2070. mutex_unlock(&sctx->wr_ctx.wr_lock);
  2071. }
  2072. scrub_pending_bio_dec(sctx);
  2073. }
  2074. static inline void __scrub_mark_bitmap(struct scrub_parity *sparity,
  2075. unsigned long *bitmap,
  2076. u64 start, u64 len)
  2077. {
  2078. u32 offset;
  2079. int nsectors;
  2080. int sectorsize = sparity->sctx->dev_root->sectorsize;
  2081. if (len >= sparity->stripe_len) {
  2082. bitmap_set(bitmap, 0, sparity->nsectors);
  2083. return;
  2084. }
  2085. start -= sparity->logic_start;
  2086. start = div_u64_rem(start, sparity->stripe_len, &offset);
  2087. offset /= sectorsize;
  2088. nsectors = (int)len / sectorsize;
  2089. if (offset + nsectors <= sparity->nsectors) {
  2090. bitmap_set(bitmap, offset, nsectors);
  2091. return;
  2092. }
  2093. bitmap_set(bitmap, offset, sparity->nsectors - offset);
  2094. bitmap_set(bitmap, 0, nsectors - (sparity->nsectors - offset));
  2095. }
  2096. static inline void scrub_parity_mark_sectors_error(struct scrub_parity *sparity,
  2097. u64 start, u64 len)
  2098. {
  2099. __scrub_mark_bitmap(sparity, sparity->ebitmap, start, len);
  2100. }
  2101. static inline void scrub_parity_mark_sectors_data(struct scrub_parity *sparity,
  2102. u64 start, u64 len)
  2103. {
  2104. __scrub_mark_bitmap(sparity, sparity->dbitmap, start, len);
  2105. }
  2106. static void scrub_block_complete(struct scrub_block *sblock)
  2107. {
  2108. int corrupted = 0;
  2109. if (!sblock->no_io_error_seen) {
  2110. corrupted = 1;
  2111. scrub_handle_errored_block(sblock);
  2112. } else {
  2113. /*
  2114. * if has checksum error, write via repair mechanism in
  2115. * dev replace case, otherwise write here in dev replace
  2116. * case.
  2117. */
  2118. corrupted = scrub_checksum(sblock);
  2119. if (!corrupted && sblock->sctx->is_dev_replace)
  2120. scrub_write_block_to_dev_replace(sblock);
  2121. }
  2122. if (sblock->sparity && corrupted && !sblock->data_corrected) {
  2123. u64 start = sblock->pagev[0]->logical;
  2124. u64 end = sblock->pagev[sblock->page_count - 1]->logical +
  2125. PAGE_SIZE;
  2126. scrub_parity_mark_sectors_error(sblock->sparity,
  2127. start, end - start);
  2128. }
  2129. }
  2130. static int scrub_find_csum(struct scrub_ctx *sctx, u64 logical, u8 *csum)
  2131. {
  2132. struct btrfs_ordered_sum *sum = NULL;
  2133. unsigned long index;
  2134. unsigned long num_sectors;
  2135. while (!list_empty(&sctx->csum_list)) {
  2136. sum = list_first_entry(&sctx->csum_list,
  2137. struct btrfs_ordered_sum, list);
  2138. if (sum->bytenr > logical)
  2139. return 0;
  2140. if (sum->bytenr + sum->len > logical)
  2141. break;
  2142. ++sctx->stat.csum_discards;
  2143. list_del(&sum->list);
  2144. kfree(sum);
  2145. sum = NULL;
  2146. }
  2147. if (!sum)
  2148. return 0;
  2149. index = ((u32)(logical - sum->bytenr)) / sctx->sectorsize;
  2150. num_sectors = sum->len / sctx->sectorsize;
  2151. memcpy(csum, sum->sums + index, sctx->csum_size);
  2152. if (index == num_sectors - 1) {
  2153. list_del(&sum->list);
  2154. kfree(sum);
  2155. }
  2156. return 1;
  2157. }
  2158. /* scrub extent tries to collect up to 64 kB for each bio */
  2159. static int scrub_extent(struct scrub_ctx *sctx, u64 logical, u64 len,
  2160. u64 physical, struct btrfs_device *dev, u64 flags,
  2161. u64 gen, int mirror_num, u64 physical_for_dev_replace)
  2162. {
  2163. int ret;
  2164. u8 csum[BTRFS_CSUM_SIZE];
  2165. u32 blocksize;
  2166. if (flags & BTRFS_EXTENT_FLAG_DATA) {
  2167. blocksize = sctx->sectorsize;
  2168. spin_lock(&sctx->stat_lock);
  2169. sctx->stat.data_extents_scrubbed++;
  2170. sctx->stat.data_bytes_scrubbed += len;
  2171. spin_unlock(&sctx->stat_lock);
  2172. } else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
  2173. blocksize = sctx->nodesize;
  2174. spin_lock(&sctx->stat_lock);
  2175. sctx->stat.tree_extents_scrubbed++;
  2176. sctx->stat.tree_bytes_scrubbed += len;
  2177. spin_unlock(&sctx->stat_lock);
  2178. } else {
  2179. blocksize = sctx->sectorsize;
  2180. WARN_ON(1);
  2181. }
  2182. while (len) {
  2183. u64 l = min_t(u64, len, blocksize);
  2184. int have_csum = 0;
  2185. if (flags & BTRFS_EXTENT_FLAG_DATA) {
  2186. /* push csums to sbio */
  2187. have_csum = scrub_find_csum(sctx, logical, csum);
  2188. if (have_csum == 0)
  2189. ++sctx->stat.no_csum;
  2190. if (sctx->is_dev_replace && !have_csum) {
  2191. ret = copy_nocow_pages(sctx, logical, l,
  2192. mirror_num,
  2193. physical_for_dev_replace);
  2194. goto behind_scrub_pages;
  2195. }
  2196. }
  2197. ret = scrub_pages(sctx, logical, l, physical, dev, flags, gen,
  2198. mirror_num, have_csum ? csum : NULL, 0,
  2199. physical_for_dev_replace);
  2200. behind_scrub_pages:
  2201. if (ret)
  2202. return ret;
  2203. len -= l;
  2204. logical += l;
  2205. physical += l;
  2206. physical_for_dev_replace += l;
  2207. }
  2208. return 0;
  2209. }
  2210. static int scrub_pages_for_parity(struct scrub_parity *sparity,
  2211. u64 logical, u64 len,
  2212. u64 physical, struct btrfs_device *dev,
  2213. u64 flags, u64 gen, int mirror_num, u8 *csum)
  2214. {
  2215. struct scrub_ctx *sctx = sparity->sctx;
  2216. struct scrub_block *sblock;
  2217. int index;
  2218. sblock = kzalloc(sizeof(*sblock), GFP_NOFS);
  2219. if (!sblock) {
  2220. spin_lock(&sctx->stat_lock);
  2221. sctx->stat.malloc_errors++;
  2222. spin_unlock(&sctx->stat_lock);
  2223. return -ENOMEM;
  2224. }
  2225. /* one ref inside this function, plus one for each page added to
  2226. * a bio later on */
  2227. atomic_set(&sblock->refs, 1);
  2228. sblock->sctx = sctx;
  2229. sblock->no_io_error_seen = 1;
  2230. sblock->sparity = sparity;
  2231. scrub_parity_get(sparity);
  2232. for (index = 0; len > 0; index++) {
  2233. struct scrub_page *spage;
  2234. u64 l = min_t(u64, len, PAGE_SIZE);
  2235. spage = kzalloc(sizeof(*spage), GFP_NOFS);
  2236. if (!spage) {
  2237. leave_nomem:
  2238. spin_lock(&sctx->stat_lock);
  2239. sctx->stat.malloc_errors++;
  2240. spin_unlock(&sctx->stat_lock);
  2241. scrub_block_put(sblock);
  2242. return -ENOMEM;
  2243. }
  2244. BUG_ON(index >= SCRUB_MAX_PAGES_PER_BLOCK);
  2245. /* For scrub block */
  2246. scrub_page_get(spage);
  2247. sblock->pagev[index] = spage;
  2248. /* For scrub parity */
  2249. scrub_page_get(spage);
  2250. list_add_tail(&spage->list, &sparity->spages);
  2251. spage->sblock = sblock;
  2252. spage->dev = dev;
  2253. spage->flags = flags;
  2254. spage->generation = gen;
  2255. spage->logical = logical;
  2256. spage->physical = physical;
  2257. spage->mirror_num = mirror_num;
  2258. if (csum) {
  2259. spage->have_csum = 1;
  2260. memcpy(spage->csum, csum, sctx->csum_size);
  2261. } else {
  2262. spage->have_csum = 0;
  2263. }
  2264. sblock->page_count++;
  2265. spage->page = alloc_page(GFP_NOFS);
  2266. if (!spage->page)
  2267. goto leave_nomem;
  2268. len -= l;
  2269. logical += l;
  2270. physical += l;
  2271. }
  2272. WARN_ON(sblock->page_count == 0);
  2273. for (index = 0; index < sblock->page_count; index++) {
  2274. struct scrub_page *spage = sblock->pagev[index];
  2275. int ret;
  2276. ret = scrub_add_page_to_rd_bio(sctx, spage);
  2277. if (ret) {
  2278. scrub_block_put(sblock);
  2279. return ret;
  2280. }
  2281. }
  2282. /* last one frees, either here or in bio completion for last page */
  2283. scrub_block_put(sblock);
  2284. return 0;
  2285. }
  2286. static int scrub_extent_for_parity(struct scrub_parity *sparity,
  2287. u64 logical, u64 len,
  2288. u64 physical, struct btrfs_device *dev,
  2289. u64 flags, u64 gen, int mirror_num)
  2290. {
  2291. struct scrub_ctx *sctx = sparity->sctx;
  2292. int ret;
  2293. u8 csum[BTRFS_CSUM_SIZE];
  2294. u32 blocksize;
  2295. if (dev->missing) {
  2296. scrub_parity_mark_sectors_error(sparity, logical, len);
  2297. return 0;
  2298. }
  2299. if (flags & BTRFS_EXTENT_FLAG_DATA) {
  2300. blocksize = sctx->sectorsize;
  2301. } else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
  2302. blocksize = sctx->nodesize;
  2303. } else {
  2304. blocksize = sctx->sectorsize;
  2305. WARN_ON(1);
  2306. }
  2307. while (len) {
  2308. u64 l = min_t(u64, len, blocksize);
  2309. int have_csum = 0;
  2310. if (flags & BTRFS_EXTENT_FLAG_DATA) {
  2311. /* push csums to sbio */
  2312. have_csum = scrub_find_csum(sctx, logical, csum);
  2313. if (have_csum == 0)
  2314. goto skip;
  2315. }
  2316. ret = scrub_pages_for_parity(sparity, logical, l, physical, dev,
  2317. flags, gen, mirror_num,
  2318. have_csum ? csum : NULL);
  2319. if (ret)
  2320. return ret;
  2321. skip:
  2322. len -= l;
  2323. logical += l;
  2324. physical += l;
  2325. }
  2326. return 0;
  2327. }
  2328. /*
  2329. * Given a physical address, this will calculate it's
  2330. * logical offset. if this is a parity stripe, it will return
  2331. * the most left data stripe's logical offset.
  2332. *
  2333. * return 0 if it is a data stripe, 1 means parity stripe.
  2334. */
  2335. static int get_raid56_logic_offset(u64 physical, int num,
  2336. struct map_lookup *map, u64 *offset,
  2337. u64 *stripe_start)
  2338. {
  2339. int i;
  2340. int j = 0;
  2341. u64 stripe_nr;
  2342. u64 last_offset;
  2343. u32 stripe_index;
  2344. u32 rot;
  2345. last_offset = (physical - map->stripes[num].physical) *
  2346. nr_data_stripes(map);
  2347. if (stripe_start)
  2348. *stripe_start = last_offset;
  2349. *offset = last_offset;
  2350. for (i = 0; i < nr_data_stripes(map); i++) {
  2351. *offset = last_offset + i * map->stripe_len;
  2352. stripe_nr = div_u64(*offset, map->stripe_len);
  2353. stripe_nr = div_u64(stripe_nr, nr_data_stripes(map));
  2354. /* Work out the disk rotation on this stripe-set */
  2355. stripe_nr = div_u64_rem(stripe_nr, map->num_stripes, &rot);
  2356. /* calculate which stripe this data locates */
  2357. rot += i;
  2358. stripe_index = rot % map->num_stripes;
  2359. if (stripe_index == num)
  2360. return 0;
  2361. if (stripe_index < num)
  2362. j++;
  2363. }
  2364. *offset = last_offset + j * map->stripe_len;
  2365. return 1;
  2366. }
  2367. static void scrub_free_parity(struct scrub_parity *sparity)
  2368. {
  2369. struct scrub_ctx *sctx = sparity->sctx;
  2370. struct scrub_page *curr, *next;
  2371. int nbits;
  2372. nbits = bitmap_weight(sparity->ebitmap, sparity->nsectors);
  2373. if (nbits) {
  2374. spin_lock(&sctx->stat_lock);
  2375. sctx->stat.read_errors += nbits;
  2376. sctx->stat.uncorrectable_errors += nbits;
  2377. spin_unlock(&sctx->stat_lock);
  2378. }
  2379. list_for_each_entry_safe(curr, next, &sparity->spages, list) {
  2380. list_del_init(&curr->list);
  2381. scrub_page_put(curr);
  2382. }
  2383. kfree(sparity);
  2384. }
  2385. static void scrub_parity_bio_endio_worker(struct btrfs_work *work)
  2386. {
  2387. struct scrub_parity *sparity = container_of(work, struct scrub_parity,
  2388. work);
  2389. struct scrub_ctx *sctx = sparity->sctx;
  2390. scrub_free_parity(sparity);
  2391. scrub_pending_bio_dec(sctx);
  2392. }
  2393. static void scrub_parity_bio_endio(struct bio *bio)
  2394. {
  2395. struct scrub_parity *sparity = (struct scrub_parity *)bio->bi_private;
  2396. if (bio->bi_error)
  2397. bitmap_or(sparity->ebitmap, sparity->ebitmap, sparity->dbitmap,
  2398. sparity->nsectors);
  2399. bio_put(bio);
  2400. btrfs_init_work(&sparity->work, btrfs_scrubparity_helper,
  2401. scrub_parity_bio_endio_worker, NULL, NULL);
  2402. btrfs_queue_work(sparity->sctx->dev_root->fs_info->scrub_parity_workers,
  2403. &sparity->work);
  2404. }
  2405. static void scrub_parity_check_and_repair(struct scrub_parity *sparity)
  2406. {
  2407. struct scrub_ctx *sctx = sparity->sctx;
  2408. struct bio *bio;
  2409. struct btrfs_raid_bio *rbio;
  2410. struct scrub_page *spage;
  2411. struct btrfs_bio *bbio = NULL;
  2412. u64 length;
  2413. int ret;
  2414. if (!bitmap_andnot(sparity->dbitmap, sparity->dbitmap, sparity->ebitmap,
  2415. sparity->nsectors))
  2416. goto out;
  2417. length = sparity->logic_end - sparity->logic_start;
  2418. ret = btrfs_map_sblock(sctx->dev_root->fs_info, WRITE,
  2419. sparity->logic_start,
  2420. &length, &bbio, 0, 1);
  2421. if (ret || !bbio || !bbio->raid_map)
  2422. goto bbio_out;
  2423. bio = btrfs_io_bio_alloc(GFP_NOFS, 0);
  2424. if (!bio)
  2425. goto bbio_out;
  2426. bio->bi_iter.bi_sector = sparity->logic_start >> 9;
  2427. bio->bi_private = sparity;
  2428. bio->bi_end_io = scrub_parity_bio_endio;
  2429. rbio = raid56_parity_alloc_scrub_rbio(sctx->dev_root, bio, bbio,
  2430. length, sparity->scrub_dev,
  2431. sparity->dbitmap,
  2432. sparity->nsectors);
  2433. if (!rbio)
  2434. goto rbio_out;
  2435. list_for_each_entry(spage, &sparity->spages, list)
  2436. raid56_add_scrub_pages(rbio, spage->page, spage->logical);
  2437. scrub_pending_bio_inc(sctx);
  2438. raid56_parity_submit_scrub_rbio(rbio);
  2439. return;
  2440. rbio_out:
  2441. bio_put(bio);
  2442. bbio_out:
  2443. btrfs_put_bbio(bbio);
  2444. bitmap_or(sparity->ebitmap, sparity->ebitmap, sparity->dbitmap,
  2445. sparity->nsectors);
  2446. spin_lock(&sctx->stat_lock);
  2447. sctx->stat.malloc_errors++;
  2448. spin_unlock(&sctx->stat_lock);
  2449. out:
  2450. scrub_free_parity(sparity);
  2451. }
  2452. static inline int scrub_calc_parity_bitmap_len(int nsectors)
  2453. {
  2454. return DIV_ROUND_UP(nsectors, BITS_PER_LONG) * (BITS_PER_LONG / 8);
  2455. }
  2456. static void scrub_parity_get(struct scrub_parity *sparity)
  2457. {
  2458. atomic_inc(&sparity->refs);
  2459. }
  2460. static void scrub_parity_put(struct scrub_parity *sparity)
  2461. {
  2462. if (!atomic_dec_and_test(&sparity->refs))
  2463. return;
  2464. scrub_parity_check_and_repair(sparity);
  2465. }
  2466. static noinline_for_stack int scrub_raid56_parity(struct scrub_ctx *sctx,
  2467. struct map_lookup *map,
  2468. struct btrfs_device *sdev,
  2469. struct btrfs_path *path,
  2470. u64 logic_start,
  2471. u64 logic_end)
  2472. {
  2473. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  2474. struct btrfs_root *root = fs_info->extent_root;
  2475. struct btrfs_root *csum_root = fs_info->csum_root;
  2476. struct btrfs_extent_item *extent;
  2477. struct btrfs_bio *bbio = NULL;
  2478. u64 flags;
  2479. int ret;
  2480. int slot;
  2481. struct extent_buffer *l;
  2482. struct btrfs_key key;
  2483. u64 generation;
  2484. u64 extent_logical;
  2485. u64 extent_physical;
  2486. u64 extent_len;
  2487. u64 mapped_length;
  2488. struct btrfs_device *extent_dev;
  2489. struct scrub_parity *sparity;
  2490. int nsectors;
  2491. int bitmap_len;
  2492. int extent_mirror_num;
  2493. int stop_loop = 0;
  2494. nsectors = map->stripe_len / root->sectorsize;
  2495. bitmap_len = scrub_calc_parity_bitmap_len(nsectors);
  2496. sparity = kzalloc(sizeof(struct scrub_parity) + 2 * bitmap_len,
  2497. GFP_NOFS);
  2498. if (!sparity) {
  2499. spin_lock(&sctx->stat_lock);
  2500. sctx->stat.malloc_errors++;
  2501. spin_unlock(&sctx->stat_lock);
  2502. return -ENOMEM;
  2503. }
  2504. sparity->stripe_len = map->stripe_len;
  2505. sparity->nsectors = nsectors;
  2506. sparity->sctx = sctx;
  2507. sparity->scrub_dev = sdev;
  2508. sparity->logic_start = logic_start;
  2509. sparity->logic_end = logic_end;
  2510. atomic_set(&sparity->refs, 1);
  2511. INIT_LIST_HEAD(&sparity->spages);
  2512. sparity->dbitmap = sparity->bitmap;
  2513. sparity->ebitmap = (void *)sparity->bitmap + bitmap_len;
  2514. ret = 0;
  2515. while (logic_start < logic_end) {
  2516. if (btrfs_fs_incompat(fs_info, SKINNY_METADATA))
  2517. key.type = BTRFS_METADATA_ITEM_KEY;
  2518. else
  2519. key.type = BTRFS_EXTENT_ITEM_KEY;
  2520. key.objectid = logic_start;
  2521. key.offset = (u64)-1;
  2522. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  2523. if (ret < 0)
  2524. goto out;
  2525. if (ret > 0) {
  2526. ret = btrfs_previous_extent_item(root, path, 0);
  2527. if (ret < 0)
  2528. goto out;
  2529. if (ret > 0) {
  2530. btrfs_release_path(path);
  2531. ret = btrfs_search_slot(NULL, root, &key,
  2532. path, 0, 0);
  2533. if (ret < 0)
  2534. goto out;
  2535. }
  2536. }
  2537. stop_loop = 0;
  2538. while (1) {
  2539. u64 bytes;
  2540. l = path->nodes[0];
  2541. slot = path->slots[0];
  2542. if (slot >= btrfs_header_nritems(l)) {
  2543. ret = btrfs_next_leaf(root, path);
  2544. if (ret == 0)
  2545. continue;
  2546. if (ret < 0)
  2547. goto out;
  2548. stop_loop = 1;
  2549. break;
  2550. }
  2551. btrfs_item_key_to_cpu(l, &key, slot);
  2552. if (key.type != BTRFS_EXTENT_ITEM_KEY &&
  2553. key.type != BTRFS_METADATA_ITEM_KEY)
  2554. goto next;
  2555. if (key.type == BTRFS_METADATA_ITEM_KEY)
  2556. bytes = root->nodesize;
  2557. else
  2558. bytes = key.offset;
  2559. if (key.objectid + bytes <= logic_start)
  2560. goto next;
  2561. if (key.objectid >= logic_end) {
  2562. stop_loop = 1;
  2563. break;
  2564. }
  2565. while (key.objectid >= logic_start + map->stripe_len)
  2566. logic_start += map->stripe_len;
  2567. extent = btrfs_item_ptr(l, slot,
  2568. struct btrfs_extent_item);
  2569. flags = btrfs_extent_flags(l, extent);
  2570. generation = btrfs_extent_generation(l, extent);
  2571. if ((flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) &&
  2572. (key.objectid < logic_start ||
  2573. key.objectid + bytes >
  2574. logic_start + map->stripe_len)) {
  2575. btrfs_err(fs_info, "scrub: tree block %llu spanning stripes, ignored. logical=%llu",
  2576. key.objectid, logic_start);
  2577. spin_lock(&sctx->stat_lock);
  2578. sctx->stat.uncorrectable_errors++;
  2579. spin_unlock(&sctx->stat_lock);
  2580. goto next;
  2581. }
  2582. again:
  2583. extent_logical = key.objectid;
  2584. extent_len = bytes;
  2585. if (extent_logical < logic_start) {
  2586. extent_len -= logic_start - extent_logical;
  2587. extent_logical = logic_start;
  2588. }
  2589. if (extent_logical + extent_len >
  2590. logic_start + map->stripe_len)
  2591. extent_len = logic_start + map->stripe_len -
  2592. extent_logical;
  2593. scrub_parity_mark_sectors_data(sparity, extent_logical,
  2594. extent_len);
  2595. mapped_length = extent_len;
  2596. ret = btrfs_map_block(fs_info, READ, extent_logical,
  2597. &mapped_length, &bbio, 0);
  2598. if (!ret) {
  2599. if (!bbio || mapped_length < extent_len)
  2600. ret = -EIO;
  2601. }
  2602. if (ret) {
  2603. btrfs_put_bbio(bbio);
  2604. goto out;
  2605. }
  2606. extent_physical = bbio->stripes[0].physical;
  2607. extent_mirror_num = bbio->mirror_num;
  2608. extent_dev = bbio->stripes[0].dev;
  2609. btrfs_put_bbio(bbio);
  2610. ret = btrfs_lookup_csums_range(csum_root,
  2611. extent_logical,
  2612. extent_logical + extent_len - 1,
  2613. &sctx->csum_list, 1);
  2614. if (ret)
  2615. goto out;
  2616. ret = scrub_extent_for_parity(sparity, extent_logical,
  2617. extent_len,
  2618. extent_physical,
  2619. extent_dev, flags,
  2620. generation,
  2621. extent_mirror_num);
  2622. scrub_free_csums(sctx);
  2623. if (ret)
  2624. goto out;
  2625. if (extent_logical + extent_len <
  2626. key.objectid + bytes) {
  2627. logic_start += map->stripe_len;
  2628. if (logic_start >= logic_end) {
  2629. stop_loop = 1;
  2630. break;
  2631. }
  2632. if (logic_start < key.objectid + bytes) {
  2633. cond_resched();
  2634. goto again;
  2635. }
  2636. }
  2637. next:
  2638. path->slots[0]++;
  2639. }
  2640. btrfs_release_path(path);
  2641. if (stop_loop)
  2642. break;
  2643. logic_start += map->stripe_len;
  2644. }
  2645. out:
  2646. if (ret < 0)
  2647. scrub_parity_mark_sectors_error(sparity, logic_start,
  2648. logic_end - logic_start);
  2649. scrub_parity_put(sparity);
  2650. scrub_submit(sctx);
  2651. mutex_lock(&sctx->wr_ctx.wr_lock);
  2652. scrub_wr_submit(sctx);
  2653. mutex_unlock(&sctx->wr_ctx.wr_lock);
  2654. btrfs_release_path(path);
  2655. return ret < 0 ? ret : 0;
  2656. }
  2657. static noinline_for_stack int scrub_stripe(struct scrub_ctx *sctx,
  2658. struct map_lookup *map,
  2659. struct btrfs_device *scrub_dev,
  2660. int num, u64 base, u64 length,
  2661. int is_dev_replace)
  2662. {
  2663. struct btrfs_path *path, *ppath;
  2664. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  2665. struct btrfs_root *root = fs_info->extent_root;
  2666. struct btrfs_root *csum_root = fs_info->csum_root;
  2667. struct btrfs_extent_item *extent;
  2668. struct blk_plug plug;
  2669. u64 flags;
  2670. int ret;
  2671. int slot;
  2672. u64 nstripes;
  2673. struct extent_buffer *l;
  2674. struct btrfs_key key;
  2675. u64 physical;
  2676. u64 logical;
  2677. u64 logic_end;
  2678. u64 physical_end;
  2679. u64 generation;
  2680. int mirror_num;
  2681. struct reada_control *reada1;
  2682. struct reada_control *reada2;
  2683. struct btrfs_key key_start;
  2684. struct btrfs_key key_end;
  2685. u64 increment = map->stripe_len;
  2686. u64 offset;
  2687. u64 extent_logical;
  2688. u64 extent_physical;
  2689. u64 extent_len;
  2690. u64 stripe_logical;
  2691. u64 stripe_end;
  2692. struct btrfs_device *extent_dev;
  2693. int extent_mirror_num;
  2694. int stop_loop = 0;
  2695. physical = map->stripes[num].physical;
  2696. offset = 0;
  2697. nstripes = div_u64(length, map->stripe_len);
  2698. if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
  2699. offset = map->stripe_len * num;
  2700. increment = map->stripe_len * map->num_stripes;
  2701. mirror_num = 1;
  2702. } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
  2703. int factor = map->num_stripes / map->sub_stripes;
  2704. offset = map->stripe_len * (num / map->sub_stripes);
  2705. increment = map->stripe_len * factor;
  2706. mirror_num = num % map->sub_stripes + 1;
  2707. } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) {
  2708. increment = map->stripe_len;
  2709. mirror_num = num % map->num_stripes + 1;
  2710. } else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
  2711. increment = map->stripe_len;
  2712. mirror_num = num % map->num_stripes + 1;
  2713. } else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
  2714. get_raid56_logic_offset(physical, num, map, &offset, NULL);
  2715. increment = map->stripe_len * nr_data_stripes(map);
  2716. mirror_num = 1;
  2717. } else {
  2718. increment = map->stripe_len;
  2719. mirror_num = 1;
  2720. }
  2721. path = btrfs_alloc_path();
  2722. if (!path)
  2723. return -ENOMEM;
  2724. ppath = btrfs_alloc_path();
  2725. if (!ppath) {
  2726. btrfs_free_path(path);
  2727. return -ENOMEM;
  2728. }
  2729. /*
  2730. * work on commit root. The related disk blocks are static as
  2731. * long as COW is applied. This means, it is save to rewrite
  2732. * them to repair disk errors without any race conditions
  2733. */
  2734. path->search_commit_root = 1;
  2735. path->skip_locking = 1;
  2736. ppath->search_commit_root = 1;
  2737. ppath->skip_locking = 1;
  2738. /*
  2739. * trigger the readahead for extent tree csum tree and wait for
  2740. * completion. During readahead, the scrub is officially paused
  2741. * to not hold off transaction commits
  2742. */
  2743. logical = base + offset;
  2744. physical_end = physical + nstripes * map->stripe_len;
  2745. if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
  2746. get_raid56_logic_offset(physical_end, num,
  2747. map, &logic_end, NULL);
  2748. logic_end += base;
  2749. } else {
  2750. logic_end = logical + increment * nstripes;
  2751. }
  2752. wait_event(sctx->list_wait,
  2753. atomic_read(&sctx->bios_in_flight) == 0);
  2754. scrub_blocked_if_needed(fs_info);
  2755. /* FIXME it might be better to start readahead at commit root */
  2756. key_start.objectid = logical;
  2757. key_start.type = BTRFS_EXTENT_ITEM_KEY;
  2758. key_start.offset = (u64)0;
  2759. key_end.objectid = logic_end;
  2760. key_end.type = BTRFS_METADATA_ITEM_KEY;
  2761. key_end.offset = (u64)-1;
  2762. reada1 = btrfs_reada_add(root, &key_start, &key_end);
  2763. key_start.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
  2764. key_start.type = BTRFS_EXTENT_CSUM_KEY;
  2765. key_start.offset = logical;
  2766. key_end.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
  2767. key_end.type = BTRFS_EXTENT_CSUM_KEY;
  2768. key_end.offset = logic_end;
  2769. reada2 = btrfs_reada_add(csum_root, &key_start, &key_end);
  2770. if (!IS_ERR(reada1))
  2771. btrfs_reada_wait(reada1);
  2772. if (!IS_ERR(reada2))
  2773. btrfs_reada_wait(reada2);
  2774. /*
  2775. * collect all data csums for the stripe to avoid seeking during
  2776. * the scrub. This might currently (crc32) end up to be about 1MB
  2777. */
  2778. blk_start_plug(&plug);
  2779. /*
  2780. * now find all extents for each stripe and scrub them
  2781. */
  2782. ret = 0;
  2783. while (physical < physical_end) {
  2784. /*
  2785. * canceled?
  2786. */
  2787. if (atomic_read(&fs_info->scrub_cancel_req) ||
  2788. atomic_read(&sctx->cancel_req)) {
  2789. ret = -ECANCELED;
  2790. goto out;
  2791. }
  2792. /*
  2793. * check to see if we have to pause
  2794. */
  2795. if (atomic_read(&fs_info->scrub_pause_req)) {
  2796. /* push queued extents */
  2797. atomic_set(&sctx->wr_ctx.flush_all_writes, 1);
  2798. scrub_submit(sctx);
  2799. mutex_lock(&sctx->wr_ctx.wr_lock);
  2800. scrub_wr_submit(sctx);
  2801. mutex_unlock(&sctx->wr_ctx.wr_lock);
  2802. wait_event(sctx->list_wait,
  2803. atomic_read(&sctx->bios_in_flight) == 0);
  2804. atomic_set(&sctx->wr_ctx.flush_all_writes, 0);
  2805. scrub_blocked_if_needed(fs_info);
  2806. }
  2807. if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
  2808. ret = get_raid56_logic_offset(physical, num, map,
  2809. &logical,
  2810. &stripe_logical);
  2811. logical += base;
  2812. if (ret) {
  2813. /* it is parity strip */
  2814. stripe_logical += base;
  2815. stripe_end = stripe_logical + increment;
  2816. ret = scrub_raid56_parity(sctx, map, scrub_dev,
  2817. ppath, stripe_logical,
  2818. stripe_end);
  2819. if (ret)
  2820. goto out;
  2821. goto skip;
  2822. }
  2823. }
  2824. if (btrfs_fs_incompat(fs_info, SKINNY_METADATA))
  2825. key.type = BTRFS_METADATA_ITEM_KEY;
  2826. else
  2827. key.type = BTRFS_EXTENT_ITEM_KEY;
  2828. key.objectid = logical;
  2829. key.offset = (u64)-1;
  2830. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  2831. if (ret < 0)
  2832. goto out;
  2833. if (ret > 0) {
  2834. ret = btrfs_previous_extent_item(root, path, 0);
  2835. if (ret < 0)
  2836. goto out;
  2837. if (ret > 0) {
  2838. /* there's no smaller item, so stick with the
  2839. * larger one */
  2840. btrfs_release_path(path);
  2841. ret = btrfs_search_slot(NULL, root, &key,
  2842. path, 0, 0);
  2843. if (ret < 0)
  2844. goto out;
  2845. }
  2846. }
  2847. stop_loop = 0;
  2848. while (1) {
  2849. u64 bytes;
  2850. l = path->nodes[0];
  2851. slot = path->slots[0];
  2852. if (slot >= btrfs_header_nritems(l)) {
  2853. ret = btrfs_next_leaf(root, path);
  2854. if (ret == 0)
  2855. continue;
  2856. if (ret < 0)
  2857. goto out;
  2858. stop_loop = 1;
  2859. break;
  2860. }
  2861. btrfs_item_key_to_cpu(l, &key, slot);
  2862. if (key.type != BTRFS_EXTENT_ITEM_KEY &&
  2863. key.type != BTRFS_METADATA_ITEM_KEY)
  2864. goto next;
  2865. if (key.type == BTRFS_METADATA_ITEM_KEY)
  2866. bytes = root->nodesize;
  2867. else
  2868. bytes = key.offset;
  2869. if (key.objectid + bytes <= logical)
  2870. goto next;
  2871. if (key.objectid >= logical + map->stripe_len) {
  2872. /* out of this device extent */
  2873. if (key.objectid >= logic_end)
  2874. stop_loop = 1;
  2875. break;
  2876. }
  2877. extent = btrfs_item_ptr(l, slot,
  2878. struct btrfs_extent_item);
  2879. flags = btrfs_extent_flags(l, extent);
  2880. generation = btrfs_extent_generation(l, extent);
  2881. if ((flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) &&
  2882. (key.objectid < logical ||
  2883. key.objectid + bytes >
  2884. logical + map->stripe_len)) {
  2885. btrfs_err(fs_info,
  2886. "scrub: tree block %llu spanning "
  2887. "stripes, ignored. logical=%llu",
  2888. key.objectid, logical);
  2889. spin_lock(&sctx->stat_lock);
  2890. sctx->stat.uncorrectable_errors++;
  2891. spin_unlock(&sctx->stat_lock);
  2892. goto next;
  2893. }
  2894. again:
  2895. extent_logical = key.objectid;
  2896. extent_len = bytes;
  2897. /*
  2898. * trim extent to this stripe
  2899. */
  2900. if (extent_logical < logical) {
  2901. extent_len -= logical - extent_logical;
  2902. extent_logical = logical;
  2903. }
  2904. if (extent_logical + extent_len >
  2905. logical + map->stripe_len) {
  2906. extent_len = logical + map->stripe_len -
  2907. extent_logical;
  2908. }
  2909. extent_physical = extent_logical - logical + physical;
  2910. extent_dev = scrub_dev;
  2911. extent_mirror_num = mirror_num;
  2912. if (is_dev_replace)
  2913. scrub_remap_extent(fs_info, extent_logical,
  2914. extent_len, &extent_physical,
  2915. &extent_dev,
  2916. &extent_mirror_num);
  2917. ret = btrfs_lookup_csums_range(csum_root,
  2918. extent_logical,
  2919. extent_logical +
  2920. extent_len - 1,
  2921. &sctx->csum_list, 1);
  2922. if (ret)
  2923. goto out;
  2924. ret = scrub_extent(sctx, extent_logical, extent_len,
  2925. extent_physical, extent_dev, flags,
  2926. generation, extent_mirror_num,
  2927. extent_logical - logical + physical);
  2928. scrub_free_csums(sctx);
  2929. if (ret)
  2930. goto out;
  2931. if (extent_logical + extent_len <
  2932. key.objectid + bytes) {
  2933. if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
  2934. /*
  2935. * loop until we find next data stripe
  2936. * or we have finished all stripes.
  2937. */
  2938. loop:
  2939. physical += map->stripe_len;
  2940. ret = get_raid56_logic_offset(physical,
  2941. num, map, &logical,
  2942. &stripe_logical);
  2943. logical += base;
  2944. if (ret && physical < physical_end) {
  2945. stripe_logical += base;
  2946. stripe_end = stripe_logical +
  2947. increment;
  2948. ret = scrub_raid56_parity(sctx,
  2949. map, scrub_dev, ppath,
  2950. stripe_logical,
  2951. stripe_end);
  2952. if (ret)
  2953. goto out;
  2954. goto loop;
  2955. }
  2956. } else {
  2957. physical += map->stripe_len;
  2958. logical += increment;
  2959. }
  2960. if (logical < key.objectid + bytes) {
  2961. cond_resched();
  2962. goto again;
  2963. }
  2964. if (physical >= physical_end) {
  2965. stop_loop = 1;
  2966. break;
  2967. }
  2968. }
  2969. next:
  2970. path->slots[0]++;
  2971. }
  2972. btrfs_release_path(path);
  2973. skip:
  2974. logical += increment;
  2975. physical += map->stripe_len;
  2976. spin_lock(&sctx->stat_lock);
  2977. if (stop_loop)
  2978. sctx->stat.last_physical = map->stripes[num].physical +
  2979. length;
  2980. else
  2981. sctx->stat.last_physical = physical;
  2982. spin_unlock(&sctx->stat_lock);
  2983. if (stop_loop)
  2984. break;
  2985. }
  2986. out:
  2987. /* push queued extents */
  2988. scrub_submit(sctx);
  2989. mutex_lock(&sctx->wr_ctx.wr_lock);
  2990. scrub_wr_submit(sctx);
  2991. mutex_unlock(&sctx->wr_ctx.wr_lock);
  2992. blk_finish_plug(&plug);
  2993. btrfs_free_path(path);
  2994. btrfs_free_path(ppath);
  2995. return ret < 0 ? ret : 0;
  2996. }
  2997. static noinline_for_stack int scrub_chunk(struct scrub_ctx *sctx,
  2998. struct btrfs_device *scrub_dev,
  2999. u64 chunk_offset, u64 length,
  3000. u64 dev_offset, int is_dev_replace)
  3001. {
  3002. struct btrfs_mapping_tree *map_tree =
  3003. &sctx->dev_root->fs_info->mapping_tree;
  3004. struct map_lookup *map;
  3005. struct extent_map *em;
  3006. int i;
  3007. int ret = 0;
  3008. read_lock(&map_tree->map_tree.lock);
  3009. em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1);
  3010. read_unlock(&map_tree->map_tree.lock);
  3011. if (!em)
  3012. return -EINVAL;
  3013. map = (struct map_lookup *)em->bdev;
  3014. if (em->start != chunk_offset)
  3015. goto out;
  3016. if (em->len < length)
  3017. goto out;
  3018. for (i = 0; i < map->num_stripes; ++i) {
  3019. if (map->stripes[i].dev->bdev == scrub_dev->bdev &&
  3020. map->stripes[i].physical == dev_offset) {
  3021. ret = scrub_stripe(sctx, map, scrub_dev, i,
  3022. chunk_offset, length,
  3023. is_dev_replace);
  3024. if (ret)
  3025. goto out;
  3026. }
  3027. }
  3028. out:
  3029. free_extent_map(em);
  3030. return ret;
  3031. }
  3032. static noinline_for_stack
  3033. int scrub_enumerate_chunks(struct scrub_ctx *sctx,
  3034. struct btrfs_device *scrub_dev, u64 start, u64 end,
  3035. int is_dev_replace)
  3036. {
  3037. struct btrfs_dev_extent *dev_extent = NULL;
  3038. struct btrfs_path *path;
  3039. struct btrfs_root *root = sctx->dev_root;
  3040. struct btrfs_fs_info *fs_info = root->fs_info;
  3041. u64 length;
  3042. u64 chunk_offset;
  3043. int ret = 0;
  3044. int ro_set;
  3045. int slot;
  3046. struct extent_buffer *l;
  3047. struct btrfs_key key;
  3048. struct btrfs_key found_key;
  3049. struct btrfs_block_group_cache *cache;
  3050. struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace;
  3051. path = btrfs_alloc_path();
  3052. if (!path)
  3053. return -ENOMEM;
  3054. path->reada = 2;
  3055. path->search_commit_root = 1;
  3056. path->skip_locking = 1;
  3057. key.objectid = scrub_dev->devid;
  3058. key.offset = 0ull;
  3059. key.type = BTRFS_DEV_EXTENT_KEY;
  3060. while (1) {
  3061. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  3062. if (ret < 0)
  3063. break;
  3064. if (ret > 0) {
  3065. if (path->slots[0] >=
  3066. btrfs_header_nritems(path->nodes[0])) {
  3067. ret = btrfs_next_leaf(root, path);
  3068. if (ret < 0)
  3069. break;
  3070. if (ret > 0) {
  3071. ret = 0;
  3072. break;
  3073. }
  3074. } else {
  3075. ret = 0;
  3076. }
  3077. }
  3078. l = path->nodes[0];
  3079. slot = path->slots[0];
  3080. btrfs_item_key_to_cpu(l, &found_key, slot);
  3081. if (found_key.objectid != scrub_dev->devid)
  3082. break;
  3083. if (found_key.type != BTRFS_DEV_EXTENT_KEY)
  3084. break;
  3085. if (found_key.offset >= end)
  3086. break;
  3087. if (found_key.offset < key.offset)
  3088. break;
  3089. dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
  3090. length = btrfs_dev_extent_length(l, dev_extent);
  3091. if (found_key.offset + length <= start)
  3092. goto skip;
  3093. chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);
  3094. /*
  3095. * get a reference on the corresponding block group to prevent
  3096. * the chunk from going away while we scrub it
  3097. */
  3098. cache = btrfs_lookup_block_group(fs_info, chunk_offset);
  3099. /* some chunks are removed but not committed to disk yet,
  3100. * continue scrubbing */
  3101. if (!cache)
  3102. goto skip;
  3103. /*
  3104. * we need call btrfs_inc_block_group_ro() with scrubs_paused,
  3105. * to avoid deadlock caused by:
  3106. * btrfs_inc_block_group_ro()
  3107. * -> btrfs_wait_for_commit()
  3108. * -> btrfs_commit_transaction()
  3109. * -> btrfs_scrub_pause()
  3110. */
  3111. scrub_pause_on(fs_info);
  3112. ret = btrfs_inc_block_group_ro(root, cache);
  3113. scrub_pause_off(fs_info);
  3114. if (ret == 0) {
  3115. ro_set = 1;
  3116. } else if (ret == -ENOSPC) {
  3117. /*
  3118. * btrfs_inc_block_group_ro return -ENOSPC when it
  3119. * failed in creating new chunk for metadata.
  3120. * It is not a problem for scrub/replace, because
  3121. * metadata are always cowed, and our scrub paused
  3122. * commit_transactions.
  3123. */
  3124. ro_set = 0;
  3125. } else {
  3126. btrfs_warn(fs_info, "failed setting block group ro, ret=%d\n",
  3127. ret);
  3128. btrfs_put_block_group(cache);
  3129. break;
  3130. }
  3131. dev_replace->cursor_right = found_key.offset + length;
  3132. dev_replace->cursor_left = found_key.offset;
  3133. dev_replace->item_needs_writeback = 1;
  3134. ret = scrub_chunk(sctx, scrub_dev, chunk_offset, length,
  3135. found_key.offset, is_dev_replace);
  3136. /*
  3137. * flush, submit all pending read and write bios, afterwards
  3138. * wait for them.
  3139. * Note that in the dev replace case, a read request causes
  3140. * write requests that are submitted in the read completion
  3141. * worker. Therefore in the current situation, it is required
  3142. * that all write requests are flushed, so that all read and
  3143. * write requests are really completed when bios_in_flight
  3144. * changes to 0.
  3145. */
  3146. atomic_set(&sctx->wr_ctx.flush_all_writes, 1);
  3147. scrub_submit(sctx);
  3148. mutex_lock(&sctx->wr_ctx.wr_lock);
  3149. scrub_wr_submit(sctx);
  3150. mutex_unlock(&sctx->wr_ctx.wr_lock);
  3151. wait_event(sctx->list_wait,
  3152. atomic_read(&sctx->bios_in_flight) == 0);
  3153. scrub_pause_on(fs_info);
  3154. /*
  3155. * must be called before we decrease @scrub_paused.
  3156. * make sure we don't block transaction commit while
  3157. * we are waiting pending workers finished.
  3158. */
  3159. wait_event(sctx->list_wait,
  3160. atomic_read(&sctx->workers_pending) == 0);
  3161. atomic_set(&sctx->wr_ctx.flush_all_writes, 0);
  3162. scrub_pause_off(fs_info);
  3163. if (ro_set)
  3164. btrfs_dec_block_group_ro(root, cache);
  3165. btrfs_put_block_group(cache);
  3166. if (ret)
  3167. break;
  3168. if (is_dev_replace &&
  3169. atomic64_read(&dev_replace->num_write_errors) > 0) {
  3170. ret = -EIO;
  3171. break;
  3172. }
  3173. if (sctx->stat.malloc_errors > 0) {
  3174. ret = -ENOMEM;
  3175. break;
  3176. }
  3177. dev_replace->cursor_left = dev_replace->cursor_right;
  3178. dev_replace->item_needs_writeback = 1;
  3179. skip:
  3180. key.offset = found_key.offset + length;
  3181. btrfs_release_path(path);
  3182. }
  3183. btrfs_free_path(path);
  3184. return ret;
  3185. }
  3186. static noinline_for_stack int scrub_supers(struct scrub_ctx *sctx,
  3187. struct btrfs_device *scrub_dev)
  3188. {
  3189. int i;
  3190. u64 bytenr;
  3191. u64 gen;
  3192. int ret;
  3193. struct btrfs_root *root = sctx->dev_root;
  3194. if (test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state))
  3195. return -EIO;
  3196. /* Seed devices of a new filesystem has their own generation. */
  3197. if (scrub_dev->fs_devices != root->fs_info->fs_devices)
  3198. gen = scrub_dev->generation;
  3199. else
  3200. gen = root->fs_info->last_trans_committed;
  3201. for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
  3202. bytenr = btrfs_sb_offset(i);
  3203. if (bytenr + BTRFS_SUPER_INFO_SIZE >
  3204. scrub_dev->commit_total_bytes)
  3205. break;
  3206. ret = scrub_pages(sctx, bytenr, BTRFS_SUPER_INFO_SIZE, bytenr,
  3207. scrub_dev, BTRFS_EXTENT_FLAG_SUPER, gen, i,
  3208. NULL, 1, bytenr);
  3209. if (ret)
  3210. return ret;
  3211. }
  3212. wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
  3213. return 0;
  3214. }
  3215. /*
  3216. * get a reference count on fs_info->scrub_workers. start worker if necessary
  3217. */
  3218. static noinline_for_stack int scrub_workers_get(struct btrfs_fs_info *fs_info,
  3219. int is_dev_replace)
  3220. {
  3221. unsigned int flags = WQ_FREEZABLE | WQ_UNBOUND;
  3222. int max_active = fs_info->thread_pool_size;
  3223. if (fs_info->scrub_workers_refcnt == 0) {
  3224. if (is_dev_replace)
  3225. fs_info->scrub_workers =
  3226. btrfs_alloc_workqueue("btrfs-scrub", flags,
  3227. 1, 4);
  3228. else
  3229. fs_info->scrub_workers =
  3230. btrfs_alloc_workqueue("btrfs-scrub", flags,
  3231. max_active, 4);
  3232. if (!fs_info->scrub_workers)
  3233. goto fail_scrub_workers;
  3234. fs_info->scrub_wr_completion_workers =
  3235. btrfs_alloc_workqueue("btrfs-scrubwrc", flags,
  3236. max_active, 2);
  3237. if (!fs_info->scrub_wr_completion_workers)
  3238. goto fail_scrub_wr_completion_workers;
  3239. fs_info->scrub_nocow_workers =
  3240. btrfs_alloc_workqueue("btrfs-scrubnc", flags, 1, 0);
  3241. if (!fs_info->scrub_nocow_workers)
  3242. goto fail_scrub_nocow_workers;
  3243. fs_info->scrub_parity_workers =
  3244. btrfs_alloc_workqueue("btrfs-scrubparity", flags,
  3245. max_active, 2);
  3246. if (!fs_info->scrub_parity_workers)
  3247. goto fail_scrub_parity_workers;
  3248. }
  3249. ++fs_info->scrub_workers_refcnt;
  3250. return 0;
  3251. fail_scrub_parity_workers:
  3252. btrfs_destroy_workqueue(fs_info->scrub_nocow_workers);
  3253. fail_scrub_nocow_workers:
  3254. btrfs_destroy_workqueue(fs_info->scrub_wr_completion_workers);
  3255. fail_scrub_wr_completion_workers:
  3256. btrfs_destroy_workqueue(fs_info->scrub_workers);
  3257. fail_scrub_workers:
  3258. return -ENOMEM;
  3259. }
  3260. static noinline_for_stack void scrub_workers_put(struct btrfs_fs_info *fs_info)
  3261. {
  3262. if (--fs_info->scrub_workers_refcnt == 0) {
  3263. btrfs_destroy_workqueue(fs_info->scrub_workers);
  3264. btrfs_destroy_workqueue(fs_info->scrub_wr_completion_workers);
  3265. btrfs_destroy_workqueue(fs_info->scrub_nocow_workers);
  3266. btrfs_destroy_workqueue(fs_info->scrub_parity_workers);
  3267. }
  3268. WARN_ON(fs_info->scrub_workers_refcnt < 0);
  3269. }
  3270. int btrfs_scrub_dev(struct btrfs_fs_info *fs_info, u64 devid, u64 start,
  3271. u64 end, struct btrfs_scrub_progress *progress,
  3272. int readonly, int is_dev_replace)
  3273. {
  3274. struct scrub_ctx *sctx;
  3275. int ret;
  3276. struct btrfs_device *dev;
  3277. struct rcu_string *name;
  3278. if (btrfs_fs_closing(fs_info))
  3279. return -EINVAL;
  3280. if (fs_info->chunk_root->nodesize > BTRFS_STRIPE_LEN) {
  3281. /*
  3282. * in this case scrub is unable to calculate the checksum
  3283. * the way scrub is implemented. Do not handle this
  3284. * situation at all because it won't ever happen.
  3285. */
  3286. btrfs_err(fs_info,
  3287. "scrub: size assumption nodesize <= BTRFS_STRIPE_LEN (%d <= %d) fails",
  3288. fs_info->chunk_root->nodesize, BTRFS_STRIPE_LEN);
  3289. return -EINVAL;
  3290. }
  3291. if (fs_info->chunk_root->sectorsize != PAGE_SIZE) {
  3292. /* not supported for data w/o checksums */
  3293. btrfs_err(fs_info,
  3294. "scrub: size assumption sectorsize != PAGE_SIZE "
  3295. "(%d != %lu) fails",
  3296. fs_info->chunk_root->sectorsize, PAGE_SIZE);
  3297. return -EINVAL;
  3298. }
  3299. if (fs_info->chunk_root->nodesize >
  3300. PAGE_SIZE * SCRUB_MAX_PAGES_PER_BLOCK ||
  3301. fs_info->chunk_root->sectorsize >
  3302. PAGE_SIZE * SCRUB_MAX_PAGES_PER_BLOCK) {
  3303. /*
  3304. * would exhaust the array bounds of pagev member in
  3305. * struct scrub_block
  3306. */
  3307. btrfs_err(fs_info, "scrub: size assumption nodesize and sectorsize "
  3308. "<= SCRUB_MAX_PAGES_PER_BLOCK (%d <= %d && %d <= %d) fails",
  3309. fs_info->chunk_root->nodesize,
  3310. SCRUB_MAX_PAGES_PER_BLOCK,
  3311. fs_info->chunk_root->sectorsize,
  3312. SCRUB_MAX_PAGES_PER_BLOCK);
  3313. return -EINVAL;
  3314. }
  3315. mutex_lock(&fs_info->fs_devices->device_list_mutex);
  3316. dev = btrfs_find_device(fs_info, devid, NULL, NULL);
  3317. if (!dev || (dev->missing && !is_dev_replace)) {
  3318. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3319. return -ENODEV;
  3320. }
  3321. if (!is_dev_replace && !readonly && !dev->writeable) {
  3322. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3323. rcu_read_lock();
  3324. name = rcu_dereference(dev->name);
  3325. btrfs_err(fs_info, "scrub: device %s is not writable",
  3326. name->str);
  3327. rcu_read_unlock();
  3328. return -EROFS;
  3329. }
  3330. mutex_lock(&fs_info->scrub_lock);
  3331. if (!dev->in_fs_metadata || dev->is_tgtdev_for_dev_replace) {
  3332. mutex_unlock(&fs_info->scrub_lock);
  3333. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3334. return -EIO;
  3335. }
  3336. btrfs_dev_replace_lock(&fs_info->dev_replace);
  3337. if (dev->scrub_device ||
  3338. (!is_dev_replace &&
  3339. btrfs_dev_replace_is_ongoing(&fs_info->dev_replace))) {
  3340. btrfs_dev_replace_unlock(&fs_info->dev_replace);
  3341. mutex_unlock(&fs_info->scrub_lock);
  3342. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3343. return -EINPROGRESS;
  3344. }
  3345. btrfs_dev_replace_unlock(&fs_info->dev_replace);
  3346. ret = scrub_workers_get(fs_info, is_dev_replace);
  3347. if (ret) {
  3348. mutex_unlock(&fs_info->scrub_lock);
  3349. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3350. return ret;
  3351. }
  3352. sctx = scrub_setup_ctx(dev, is_dev_replace);
  3353. if (IS_ERR(sctx)) {
  3354. mutex_unlock(&fs_info->scrub_lock);
  3355. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3356. scrub_workers_put(fs_info);
  3357. return PTR_ERR(sctx);
  3358. }
  3359. sctx->readonly = readonly;
  3360. dev->scrub_device = sctx;
  3361. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3362. /*
  3363. * checking @scrub_pause_req here, we can avoid
  3364. * race between committing transaction and scrubbing.
  3365. */
  3366. __scrub_blocked_if_needed(fs_info);
  3367. atomic_inc(&fs_info->scrubs_running);
  3368. mutex_unlock(&fs_info->scrub_lock);
  3369. if (!is_dev_replace) {
  3370. /*
  3371. * by holding device list mutex, we can
  3372. * kick off writing super in log tree sync.
  3373. */
  3374. mutex_lock(&fs_info->fs_devices->device_list_mutex);
  3375. ret = scrub_supers(sctx, dev);
  3376. mutex_unlock(&fs_info->fs_devices->device_list_mutex);
  3377. }
  3378. if (!ret)
  3379. ret = scrub_enumerate_chunks(sctx, dev, start, end,
  3380. is_dev_replace);
  3381. wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
  3382. atomic_dec(&fs_info->scrubs_running);
  3383. wake_up(&fs_info->scrub_pause_wait);
  3384. wait_event(sctx->list_wait, atomic_read(&sctx->workers_pending) == 0);
  3385. if (progress)
  3386. memcpy(progress, &sctx->stat, sizeof(*progress));
  3387. mutex_lock(&fs_info->scrub_lock);
  3388. dev->scrub_device = NULL;
  3389. scrub_workers_put(fs_info);
  3390. mutex_unlock(&fs_info->scrub_lock);
  3391. scrub_put_ctx(sctx);
  3392. return ret;
  3393. }
  3394. void btrfs_scrub_pause(struct btrfs_root *root)
  3395. {
  3396. struct btrfs_fs_info *fs_info = root->fs_info;
  3397. mutex_lock(&fs_info->scrub_lock);
  3398. atomic_inc(&fs_info->scrub_pause_req);
  3399. while (atomic_read(&fs_info->scrubs_paused) !=
  3400. atomic_read(&fs_info->scrubs_running)) {
  3401. mutex_unlock(&fs_info->scrub_lock);
  3402. wait_event(fs_info->scrub_pause_wait,
  3403. atomic_read(&fs_info->scrubs_paused) ==
  3404. atomic_read(&fs_info->scrubs_running));
  3405. mutex_lock(&fs_info->scrub_lock);
  3406. }
  3407. mutex_unlock(&fs_info->scrub_lock);
  3408. }
  3409. void btrfs_scrub_continue(struct btrfs_root *root)
  3410. {
  3411. struct btrfs_fs_info *fs_info = root->fs_info;
  3412. atomic_dec(&fs_info->scrub_pause_req);
  3413. wake_up(&fs_info->scrub_pause_wait);
  3414. }
  3415. int btrfs_scrub_cancel(struct btrfs_fs_info *fs_info)
  3416. {
  3417. mutex_lock(&fs_info->scrub_lock);
  3418. if (!atomic_read(&fs_info->scrubs_running)) {
  3419. mutex_unlock(&fs_info->scrub_lock);
  3420. return -ENOTCONN;
  3421. }
  3422. atomic_inc(&fs_info->scrub_cancel_req);
  3423. while (atomic_read(&fs_info->scrubs_running)) {
  3424. mutex_unlock(&fs_info->scrub_lock);
  3425. wait_event(fs_info->scrub_pause_wait,
  3426. atomic_read(&fs_info->scrubs_running) == 0);
  3427. mutex_lock(&fs_info->scrub_lock);
  3428. }
  3429. atomic_dec(&fs_info->scrub_cancel_req);
  3430. mutex_unlock(&fs_info->scrub_lock);
  3431. return 0;
  3432. }
  3433. int btrfs_scrub_cancel_dev(struct btrfs_fs_info *fs_info,
  3434. struct btrfs_device *dev)
  3435. {
  3436. struct scrub_ctx *sctx;
  3437. mutex_lock(&fs_info->scrub_lock);
  3438. sctx = dev->scrub_device;
  3439. if (!sctx) {
  3440. mutex_unlock(&fs_info->scrub_lock);
  3441. return -ENOTCONN;
  3442. }
  3443. atomic_inc(&sctx->cancel_req);
  3444. while (dev->scrub_device) {
  3445. mutex_unlock(&fs_info->scrub_lock);
  3446. wait_event(fs_info->scrub_pause_wait,
  3447. dev->scrub_device == NULL);
  3448. mutex_lock(&fs_info->scrub_lock);
  3449. }
  3450. mutex_unlock(&fs_info->scrub_lock);
  3451. return 0;
  3452. }
  3453. int btrfs_scrub_progress(struct btrfs_root *root, u64 devid,
  3454. struct btrfs_scrub_progress *progress)
  3455. {
  3456. struct btrfs_device *dev;
  3457. struct scrub_ctx *sctx = NULL;
  3458. mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
  3459. dev = btrfs_find_device(root->fs_info, devid, NULL, NULL);
  3460. if (dev)
  3461. sctx = dev->scrub_device;
  3462. if (sctx)
  3463. memcpy(progress, &sctx->stat, sizeof(*progress));
  3464. mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
  3465. return dev ? (sctx ? 0 : -ENOTCONN) : -ENODEV;
  3466. }
  3467. static void scrub_remap_extent(struct btrfs_fs_info *fs_info,
  3468. u64 extent_logical, u64 extent_len,
  3469. u64 *extent_physical,
  3470. struct btrfs_device **extent_dev,
  3471. int *extent_mirror_num)
  3472. {
  3473. u64 mapped_length;
  3474. struct btrfs_bio *bbio = NULL;
  3475. int ret;
  3476. mapped_length = extent_len;
  3477. ret = btrfs_map_block(fs_info, READ, extent_logical,
  3478. &mapped_length, &bbio, 0);
  3479. if (ret || !bbio || mapped_length < extent_len ||
  3480. !bbio->stripes[0].dev->bdev) {
  3481. btrfs_put_bbio(bbio);
  3482. return;
  3483. }
  3484. *extent_physical = bbio->stripes[0].physical;
  3485. *extent_mirror_num = bbio->mirror_num;
  3486. *extent_dev = bbio->stripes[0].dev;
  3487. btrfs_put_bbio(bbio);
  3488. }
  3489. static int scrub_setup_wr_ctx(struct scrub_ctx *sctx,
  3490. struct scrub_wr_ctx *wr_ctx,
  3491. struct btrfs_fs_info *fs_info,
  3492. struct btrfs_device *dev,
  3493. int is_dev_replace)
  3494. {
  3495. WARN_ON(wr_ctx->wr_curr_bio != NULL);
  3496. mutex_init(&wr_ctx->wr_lock);
  3497. wr_ctx->wr_curr_bio = NULL;
  3498. if (!is_dev_replace)
  3499. return 0;
  3500. WARN_ON(!dev->bdev);
  3501. wr_ctx->pages_per_wr_bio = SCRUB_PAGES_PER_WR_BIO;
  3502. wr_ctx->tgtdev = dev;
  3503. atomic_set(&wr_ctx->flush_all_writes, 0);
  3504. return 0;
  3505. }
  3506. static void scrub_free_wr_ctx(struct scrub_wr_ctx *wr_ctx)
  3507. {
  3508. mutex_lock(&wr_ctx->wr_lock);
  3509. kfree(wr_ctx->wr_curr_bio);
  3510. wr_ctx->wr_curr_bio = NULL;
  3511. mutex_unlock(&wr_ctx->wr_lock);
  3512. }
  3513. static int copy_nocow_pages(struct scrub_ctx *sctx, u64 logical, u64 len,
  3514. int mirror_num, u64 physical_for_dev_replace)
  3515. {
  3516. struct scrub_copy_nocow_ctx *nocow_ctx;
  3517. struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
  3518. nocow_ctx = kzalloc(sizeof(*nocow_ctx), GFP_NOFS);
  3519. if (!nocow_ctx) {
  3520. spin_lock(&sctx->stat_lock);
  3521. sctx->stat.malloc_errors++;
  3522. spin_unlock(&sctx->stat_lock);
  3523. return -ENOMEM;
  3524. }
  3525. scrub_pending_trans_workers_inc(sctx);
  3526. nocow_ctx->sctx = sctx;
  3527. nocow_ctx->logical = logical;
  3528. nocow_ctx->len = len;
  3529. nocow_ctx->mirror_num = mirror_num;
  3530. nocow_ctx->physical_for_dev_replace = physical_for_dev_replace;
  3531. btrfs_init_work(&nocow_ctx->work, btrfs_scrubnc_helper,
  3532. copy_nocow_pages_worker, NULL, NULL);
  3533. INIT_LIST_HEAD(&nocow_ctx->inodes);
  3534. btrfs_queue_work(fs_info->scrub_nocow_workers,
  3535. &nocow_ctx->work);
  3536. return 0;
  3537. }
  3538. static int record_inode_for_nocow(u64 inum, u64 offset, u64 root, void *ctx)
  3539. {
  3540. struct scrub_copy_nocow_ctx *nocow_ctx = ctx;
  3541. struct scrub_nocow_inode *nocow_inode;
  3542. nocow_inode = kzalloc(sizeof(*nocow_inode), GFP_NOFS);
  3543. if (!nocow_inode)
  3544. return -ENOMEM;
  3545. nocow_inode->inum = inum;
  3546. nocow_inode->offset = offset;
  3547. nocow_inode->root = root;
  3548. list_add_tail(&nocow_inode->list, &nocow_ctx->inodes);
  3549. return 0;
  3550. }
  3551. #define COPY_COMPLETE 1
  3552. static void copy_nocow_pages_worker(struct btrfs_work *work)
  3553. {
  3554. struct scrub_copy_nocow_ctx *nocow_ctx =
  3555. container_of(work, struct scrub_copy_nocow_ctx, work);
  3556. struct scrub_ctx *sctx = nocow_ctx->sctx;
  3557. u64 logical = nocow_ctx->logical;
  3558. u64 len = nocow_ctx->len;
  3559. int mirror_num = nocow_ctx->mirror_num;
  3560. u64 physical_for_dev_replace = nocow_ctx->physical_for_dev_replace;
  3561. int ret;
  3562. struct btrfs_trans_handle *trans = NULL;
  3563. struct btrfs_fs_info *fs_info;
  3564. struct btrfs_path *path;
  3565. struct btrfs_root *root;
  3566. int not_written = 0;
  3567. fs_info = sctx->dev_root->fs_info;
  3568. root = fs_info->extent_root;
  3569. path = btrfs_alloc_path();
  3570. if (!path) {
  3571. spin_lock(&sctx->stat_lock);
  3572. sctx->stat.malloc_errors++;
  3573. spin_unlock(&sctx->stat_lock);
  3574. not_written = 1;
  3575. goto out;
  3576. }
  3577. trans = btrfs_join_transaction(root);
  3578. if (IS_ERR(trans)) {
  3579. not_written = 1;
  3580. goto out;
  3581. }
  3582. ret = iterate_inodes_from_logical(logical, fs_info, path,
  3583. record_inode_for_nocow, nocow_ctx);
  3584. if (ret != 0 && ret != -ENOENT) {
  3585. btrfs_warn(fs_info, "iterate_inodes_from_logical() failed: log %llu, "
  3586. "phys %llu, len %llu, mir %u, ret %d",
  3587. logical, physical_for_dev_replace, len, mirror_num,
  3588. ret);
  3589. not_written = 1;
  3590. goto out;
  3591. }
  3592. btrfs_end_transaction(trans, root);
  3593. trans = NULL;
  3594. while (!list_empty(&nocow_ctx->inodes)) {
  3595. struct scrub_nocow_inode *entry;
  3596. entry = list_first_entry(&nocow_ctx->inodes,
  3597. struct scrub_nocow_inode,
  3598. list);
  3599. list_del_init(&entry->list);
  3600. ret = copy_nocow_pages_for_inode(entry->inum, entry->offset,
  3601. entry->root, nocow_ctx);
  3602. kfree(entry);
  3603. if (ret == COPY_COMPLETE) {
  3604. ret = 0;
  3605. break;
  3606. } else if (ret) {
  3607. break;
  3608. }
  3609. }
  3610. out:
  3611. while (!list_empty(&nocow_ctx->inodes)) {
  3612. struct scrub_nocow_inode *entry;
  3613. entry = list_first_entry(&nocow_ctx->inodes,
  3614. struct scrub_nocow_inode,
  3615. list);
  3616. list_del_init(&entry->list);
  3617. kfree(entry);
  3618. }
  3619. if (trans && !IS_ERR(trans))
  3620. btrfs_end_transaction(trans, root);
  3621. if (not_written)
  3622. btrfs_dev_replace_stats_inc(&fs_info->dev_replace.
  3623. num_uncorrectable_read_errors);
  3624. btrfs_free_path(path);
  3625. kfree(nocow_ctx);
  3626. scrub_pending_trans_workers_dec(sctx);
  3627. }
  3628. static int check_extent_to_block(struct inode *inode, u64 start, u64 len,
  3629. u64 logical)
  3630. {
  3631. struct extent_state *cached_state = NULL;
  3632. struct btrfs_ordered_extent *ordered;
  3633. struct extent_io_tree *io_tree;
  3634. struct extent_map *em;
  3635. u64 lockstart = start, lockend = start + len - 1;
  3636. int ret = 0;
  3637. io_tree = &BTRFS_I(inode)->io_tree;
  3638. lock_extent_bits(io_tree, lockstart, lockend, 0, &cached_state);
  3639. ordered = btrfs_lookup_ordered_range(inode, lockstart, len);
  3640. if (ordered) {
  3641. btrfs_put_ordered_extent(ordered);
  3642. ret = 1;
  3643. goto out_unlock;
  3644. }
  3645. em = btrfs_get_extent(inode, NULL, 0, start, len, 0);
  3646. if (IS_ERR(em)) {
  3647. ret = PTR_ERR(em);
  3648. goto out_unlock;
  3649. }
  3650. /*
  3651. * This extent does not actually cover the logical extent anymore,
  3652. * move on to the next inode.
  3653. */
  3654. if (em->block_start > logical ||
  3655. em->block_start + em->block_len < logical + len) {
  3656. free_extent_map(em);
  3657. ret = 1;
  3658. goto out_unlock;
  3659. }
  3660. free_extent_map(em);
  3661. out_unlock:
  3662. unlock_extent_cached(io_tree, lockstart, lockend, &cached_state,
  3663. GFP_NOFS);
  3664. return ret;
  3665. }
  3666. static int copy_nocow_pages_for_inode(u64 inum, u64 offset, u64 root,
  3667. struct scrub_copy_nocow_ctx *nocow_ctx)
  3668. {
  3669. struct btrfs_fs_info *fs_info = nocow_ctx->sctx->dev_root->fs_info;
  3670. struct btrfs_key key;
  3671. struct inode *inode;
  3672. struct page *page;
  3673. struct btrfs_root *local_root;
  3674. struct extent_io_tree *io_tree;
  3675. u64 physical_for_dev_replace;
  3676. u64 nocow_ctx_logical;
  3677. u64 len = nocow_ctx->len;
  3678. unsigned long index;
  3679. int srcu_index;
  3680. int ret = 0;
  3681. int err = 0;
  3682. key.objectid = root;
  3683. key.type = BTRFS_ROOT_ITEM_KEY;
  3684. key.offset = (u64)-1;
  3685. srcu_index = srcu_read_lock(&fs_info->subvol_srcu);
  3686. local_root = btrfs_read_fs_root_no_name(fs_info, &key);
  3687. if (IS_ERR(local_root)) {
  3688. srcu_read_unlock(&fs_info->subvol_srcu, srcu_index);
  3689. return PTR_ERR(local_root);
  3690. }
  3691. key.type = BTRFS_INODE_ITEM_KEY;
  3692. key.objectid = inum;
  3693. key.offset = 0;
  3694. inode = btrfs_iget(fs_info->sb, &key, local_root, NULL);
  3695. srcu_read_unlock(&fs_info->subvol_srcu, srcu_index);
  3696. if (IS_ERR(inode))
  3697. return PTR_ERR(inode);
  3698. /* Avoid truncate/dio/punch hole.. */
  3699. mutex_lock(&inode->i_mutex);
  3700. inode_dio_wait(inode);
  3701. physical_for_dev_replace = nocow_ctx->physical_for_dev_replace;
  3702. io_tree = &BTRFS_I(inode)->io_tree;
  3703. nocow_ctx_logical = nocow_ctx->logical;
  3704. ret = check_extent_to_block(inode, offset, len, nocow_ctx_logical);
  3705. if (ret) {
  3706. ret = ret > 0 ? 0 : ret;
  3707. goto out;
  3708. }
  3709. while (len >= PAGE_CACHE_SIZE) {
  3710. index = offset >> PAGE_CACHE_SHIFT;
  3711. again:
  3712. page = find_or_create_page(inode->i_mapping, index, GFP_NOFS);
  3713. if (!page) {
  3714. btrfs_err(fs_info, "find_or_create_page() failed");
  3715. ret = -ENOMEM;
  3716. goto out;
  3717. }
  3718. if (PageUptodate(page)) {
  3719. if (PageDirty(page))
  3720. goto next_page;
  3721. } else {
  3722. ClearPageError(page);
  3723. err = extent_read_full_page(io_tree, page,
  3724. btrfs_get_extent,
  3725. nocow_ctx->mirror_num);
  3726. if (err) {
  3727. ret = err;
  3728. goto next_page;
  3729. }
  3730. lock_page(page);
  3731. /*
  3732. * If the page has been remove from the page cache,
  3733. * the data on it is meaningless, because it may be
  3734. * old one, the new data may be written into the new
  3735. * page in the page cache.
  3736. */
  3737. if (page->mapping != inode->i_mapping) {
  3738. unlock_page(page);
  3739. page_cache_release(page);
  3740. goto again;
  3741. }
  3742. if (!PageUptodate(page)) {
  3743. ret = -EIO;
  3744. goto next_page;
  3745. }
  3746. }
  3747. ret = check_extent_to_block(inode, offset, len,
  3748. nocow_ctx_logical);
  3749. if (ret) {
  3750. ret = ret > 0 ? 0 : ret;
  3751. goto next_page;
  3752. }
  3753. err = write_page_nocow(nocow_ctx->sctx,
  3754. physical_for_dev_replace, page);
  3755. if (err)
  3756. ret = err;
  3757. next_page:
  3758. unlock_page(page);
  3759. page_cache_release(page);
  3760. if (ret)
  3761. break;
  3762. offset += PAGE_CACHE_SIZE;
  3763. physical_for_dev_replace += PAGE_CACHE_SIZE;
  3764. nocow_ctx_logical += PAGE_CACHE_SIZE;
  3765. len -= PAGE_CACHE_SIZE;
  3766. }
  3767. ret = COPY_COMPLETE;
  3768. out:
  3769. mutex_unlock(&inode->i_mutex);
  3770. iput(inode);
  3771. return ret;
  3772. }
  3773. static int write_page_nocow(struct scrub_ctx *sctx,
  3774. u64 physical_for_dev_replace, struct page *page)
  3775. {
  3776. struct bio *bio;
  3777. struct btrfs_device *dev;
  3778. int ret;
  3779. dev = sctx->wr_ctx.tgtdev;
  3780. if (!dev)
  3781. return -EIO;
  3782. if (!dev->bdev) {
  3783. btrfs_warn_rl(dev->dev_root->fs_info,
  3784. "scrub write_page_nocow(bdev == NULL) is unexpected");
  3785. return -EIO;
  3786. }
  3787. bio = btrfs_io_bio_alloc(GFP_NOFS, 1);
  3788. if (!bio) {
  3789. spin_lock(&sctx->stat_lock);
  3790. sctx->stat.malloc_errors++;
  3791. spin_unlock(&sctx->stat_lock);
  3792. return -ENOMEM;
  3793. }
  3794. bio->bi_iter.bi_size = 0;
  3795. bio->bi_iter.bi_sector = physical_for_dev_replace >> 9;
  3796. bio->bi_bdev = dev->bdev;
  3797. ret = bio_add_page(bio, page, PAGE_CACHE_SIZE, 0);
  3798. if (ret != PAGE_CACHE_SIZE) {
  3799. leave_with_eio:
  3800. bio_put(bio);
  3801. btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_WRITE_ERRS);
  3802. return -EIO;
  3803. }
  3804. if (btrfsic_submit_bio_wait(WRITE_SYNC, bio))
  3805. goto leave_with_eio;
  3806. bio_put(bio);
  3807. return 0;
  3808. }