scrub.c 116 KB

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