dm-cache-target.c 76 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169
  1. /*
  2. * Copyright (C) 2012 Red Hat. All rights reserved.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm.h"
  7. #include "dm-bio-prison.h"
  8. #include "dm-bio-record.h"
  9. #include "dm-cache-metadata.h"
  10. #include <linux/dm-io.h>
  11. #include <linux/dm-kcopyd.h>
  12. #include <linux/init.h>
  13. #include <linux/mempool.h>
  14. #include <linux/module.h>
  15. #include <linux/slab.h>
  16. #include <linux/vmalloc.h>
  17. #define DM_MSG_PREFIX "cache"
  18. DECLARE_DM_KCOPYD_THROTTLE_WITH_MODULE_PARM(cache_copy_throttle,
  19. "A percentage of time allocated for copying to and/or from cache");
  20. /*----------------------------------------------------------------*/
  21. /*
  22. * Glossary:
  23. *
  24. * oblock: index of an origin block
  25. * cblock: index of a cache block
  26. * promotion: movement of a block from origin to cache
  27. * demotion: movement of a block from cache to origin
  28. * migration: movement of a block between the origin and cache device,
  29. * either direction
  30. */
  31. /*----------------------------------------------------------------*/
  32. static size_t bitset_size_in_bytes(unsigned nr_entries)
  33. {
  34. return sizeof(unsigned long) * dm_div_up(nr_entries, BITS_PER_LONG);
  35. }
  36. static unsigned long *alloc_bitset(unsigned nr_entries)
  37. {
  38. size_t s = bitset_size_in_bytes(nr_entries);
  39. return vzalloc(s);
  40. }
  41. static void clear_bitset(void *bitset, unsigned nr_entries)
  42. {
  43. size_t s = bitset_size_in_bytes(nr_entries);
  44. memset(bitset, 0, s);
  45. }
  46. static void free_bitset(unsigned long *bits)
  47. {
  48. vfree(bits);
  49. }
  50. /*----------------------------------------------------------------*/
  51. /*
  52. * There are a couple of places where we let a bio run, but want to do some
  53. * work before calling its endio function. We do this by temporarily
  54. * changing the endio fn.
  55. */
  56. struct dm_hook_info {
  57. bio_end_io_t *bi_end_io;
  58. void *bi_private;
  59. };
  60. static void dm_hook_bio(struct dm_hook_info *h, struct bio *bio,
  61. bio_end_io_t *bi_end_io, void *bi_private)
  62. {
  63. h->bi_end_io = bio->bi_end_io;
  64. h->bi_private = bio->bi_private;
  65. bio->bi_end_io = bi_end_io;
  66. bio->bi_private = bi_private;
  67. }
  68. static void dm_unhook_bio(struct dm_hook_info *h, struct bio *bio)
  69. {
  70. bio->bi_end_io = h->bi_end_io;
  71. bio->bi_private = h->bi_private;
  72. /*
  73. * Must bump bi_remaining to allow bio to complete with
  74. * restored bi_end_io.
  75. */
  76. atomic_inc(&bio->bi_remaining);
  77. }
  78. /*----------------------------------------------------------------*/
  79. #define PRISON_CELLS 1024
  80. #define MIGRATION_POOL_SIZE 128
  81. #define COMMIT_PERIOD HZ
  82. #define MIGRATION_COUNT_WINDOW 10
  83. /*
  84. * The block size of the device holding cache data must be
  85. * between 32KB and 1GB.
  86. */
  87. #define DATA_DEV_BLOCK_SIZE_MIN_SECTORS (32 * 1024 >> SECTOR_SHIFT)
  88. #define DATA_DEV_BLOCK_SIZE_MAX_SECTORS (1024 * 1024 * 1024 >> SECTOR_SHIFT)
  89. /*
  90. * FIXME: the cache is read/write for the time being.
  91. */
  92. enum cache_metadata_mode {
  93. CM_WRITE, /* metadata may be changed */
  94. CM_READ_ONLY, /* metadata may not be changed */
  95. };
  96. enum cache_io_mode {
  97. /*
  98. * Data is written to cached blocks only. These blocks are marked
  99. * dirty. If you lose the cache device you will lose data.
  100. * Potential performance increase for both reads and writes.
  101. */
  102. CM_IO_WRITEBACK,
  103. /*
  104. * Data is written to both cache and origin. Blocks are never
  105. * dirty. Potential performance benfit for reads only.
  106. */
  107. CM_IO_WRITETHROUGH,
  108. /*
  109. * A degraded mode useful for various cache coherency situations
  110. * (eg, rolling back snapshots). Reads and writes always go to the
  111. * origin. If a write goes to a cached oblock, then the cache
  112. * block is invalidated.
  113. */
  114. CM_IO_PASSTHROUGH
  115. };
  116. struct cache_features {
  117. enum cache_metadata_mode mode;
  118. enum cache_io_mode io_mode;
  119. };
  120. struct cache_stats {
  121. atomic_t read_hit;
  122. atomic_t read_miss;
  123. atomic_t write_hit;
  124. atomic_t write_miss;
  125. atomic_t demotion;
  126. atomic_t promotion;
  127. atomic_t copies_avoided;
  128. atomic_t cache_cell_clash;
  129. atomic_t commit_count;
  130. atomic_t discard_count;
  131. };
  132. /*
  133. * Defines a range of cblocks, begin to (end - 1) are in the range. end is
  134. * the one-past-the-end value.
  135. */
  136. struct cblock_range {
  137. dm_cblock_t begin;
  138. dm_cblock_t end;
  139. };
  140. struct invalidation_request {
  141. struct list_head list;
  142. struct cblock_range *cblocks;
  143. atomic_t complete;
  144. int err;
  145. wait_queue_head_t result_wait;
  146. };
  147. struct cache {
  148. struct dm_target *ti;
  149. struct dm_target_callbacks callbacks;
  150. struct dm_cache_metadata *cmd;
  151. /*
  152. * Metadata is written to this device.
  153. */
  154. struct dm_dev *metadata_dev;
  155. /*
  156. * The slower of the two data devices. Typically a spindle.
  157. */
  158. struct dm_dev *origin_dev;
  159. /*
  160. * The faster of the two data devices. Typically an SSD.
  161. */
  162. struct dm_dev *cache_dev;
  163. /*
  164. * Size of the origin device in _complete_ blocks and native sectors.
  165. */
  166. dm_oblock_t origin_blocks;
  167. sector_t origin_sectors;
  168. /*
  169. * Size of the cache device in blocks.
  170. */
  171. dm_cblock_t cache_size;
  172. /*
  173. * Fields for converting from sectors to blocks.
  174. */
  175. uint32_t sectors_per_block;
  176. int sectors_per_block_shift;
  177. spinlock_t lock;
  178. struct bio_list deferred_bios;
  179. struct bio_list deferred_flush_bios;
  180. struct bio_list deferred_writethrough_bios;
  181. struct list_head quiesced_migrations;
  182. struct list_head completed_migrations;
  183. struct list_head need_commit_migrations;
  184. sector_t migration_threshold;
  185. wait_queue_head_t migration_wait;
  186. atomic_t nr_allocated_migrations;
  187. /*
  188. * The number of in flight migrations that are performing
  189. * background io. eg, promotion, writeback.
  190. */
  191. atomic_t nr_io_migrations;
  192. wait_queue_head_t quiescing_wait;
  193. atomic_t quiescing;
  194. atomic_t quiescing_ack;
  195. /*
  196. * cache_size entries, dirty if set
  197. */
  198. atomic_t nr_dirty;
  199. unsigned long *dirty_bitset;
  200. /*
  201. * origin_blocks entries, discarded if set.
  202. */
  203. dm_oblock_t discard_nr_blocks;
  204. unsigned long *discard_bitset;
  205. /*
  206. * Rather than reconstructing the table line for the status we just
  207. * save it and regurgitate.
  208. */
  209. unsigned nr_ctr_args;
  210. const char **ctr_args;
  211. struct dm_kcopyd_client *copier;
  212. struct workqueue_struct *wq;
  213. struct work_struct worker;
  214. struct delayed_work waker;
  215. unsigned long last_commit_jiffies;
  216. struct dm_bio_prison *prison;
  217. struct dm_deferred_set *all_io_ds;
  218. mempool_t *migration_pool;
  219. struct dm_cache_policy *policy;
  220. unsigned policy_nr_args;
  221. bool need_tick_bio:1;
  222. bool sized:1;
  223. bool invalidate:1;
  224. bool commit_requested:1;
  225. bool loaded_mappings:1;
  226. bool loaded_discards:1;
  227. /*
  228. * Cache features such as write-through.
  229. */
  230. struct cache_features features;
  231. struct cache_stats stats;
  232. /*
  233. * Invalidation fields.
  234. */
  235. spinlock_t invalidation_lock;
  236. struct list_head invalidation_requests;
  237. };
  238. struct per_bio_data {
  239. bool tick:1;
  240. unsigned req_nr:2;
  241. struct dm_deferred_entry *all_io_entry;
  242. struct dm_hook_info hook_info;
  243. /*
  244. * writethrough fields. These MUST remain at the end of this
  245. * structure and the 'cache' member must be the first as it
  246. * is used to determine the offset of the writethrough fields.
  247. */
  248. struct cache *cache;
  249. dm_cblock_t cblock;
  250. struct dm_bio_details bio_details;
  251. };
  252. struct dm_cache_migration {
  253. struct list_head list;
  254. struct cache *cache;
  255. unsigned long start_jiffies;
  256. dm_oblock_t old_oblock;
  257. dm_oblock_t new_oblock;
  258. dm_cblock_t cblock;
  259. bool err:1;
  260. bool writeback:1;
  261. bool demote:1;
  262. bool promote:1;
  263. bool requeue_holder:1;
  264. bool invalidate:1;
  265. struct dm_bio_prison_cell *old_ocell;
  266. struct dm_bio_prison_cell *new_ocell;
  267. };
  268. /*
  269. * Processing a bio in the worker thread may require these memory
  270. * allocations. We prealloc to avoid deadlocks (the same worker thread
  271. * frees them back to the mempool).
  272. */
  273. struct prealloc {
  274. struct dm_cache_migration *mg;
  275. struct dm_bio_prison_cell *cell1;
  276. struct dm_bio_prison_cell *cell2;
  277. };
  278. static void wake_worker(struct cache *cache)
  279. {
  280. queue_work(cache->wq, &cache->worker);
  281. }
  282. /*----------------------------------------------------------------*/
  283. static struct dm_bio_prison_cell *alloc_prison_cell(struct cache *cache)
  284. {
  285. /* FIXME: change to use a local slab. */
  286. return dm_bio_prison_alloc_cell(cache->prison, GFP_NOWAIT);
  287. }
  288. static void free_prison_cell(struct cache *cache, struct dm_bio_prison_cell *cell)
  289. {
  290. dm_bio_prison_free_cell(cache->prison, cell);
  291. }
  292. static struct dm_cache_migration *alloc_migration(struct cache *cache)
  293. {
  294. struct dm_cache_migration *mg;
  295. mg = mempool_alloc(cache->migration_pool, GFP_NOWAIT);
  296. if (mg) {
  297. mg->cache = cache;
  298. atomic_inc(&mg->cache->nr_allocated_migrations);
  299. }
  300. return mg;
  301. }
  302. static void free_migration(struct dm_cache_migration *mg)
  303. {
  304. if (atomic_dec_and_test(&mg->cache->nr_allocated_migrations))
  305. wake_up(&mg->cache->migration_wait);
  306. mempool_free(mg, mg->cache->migration_pool);
  307. }
  308. static int prealloc_data_structs(struct cache *cache, struct prealloc *p)
  309. {
  310. if (!p->mg) {
  311. p->mg = alloc_migration(cache);
  312. if (!p->mg)
  313. return -ENOMEM;
  314. }
  315. if (!p->cell1) {
  316. p->cell1 = alloc_prison_cell(cache);
  317. if (!p->cell1)
  318. return -ENOMEM;
  319. }
  320. if (!p->cell2) {
  321. p->cell2 = alloc_prison_cell(cache);
  322. if (!p->cell2)
  323. return -ENOMEM;
  324. }
  325. return 0;
  326. }
  327. static void prealloc_free_structs(struct cache *cache, struct prealloc *p)
  328. {
  329. if (p->cell2)
  330. free_prison_cell(cache, p->cell2);
  331. if (p->cell1)
  332. free_prison_cell(cache, p->cell1);
  333. if (p->mg)
  334. free_migration(p->mg);
  335. }
  336. static struct dm_cache_migration *prealloc_get_migration(struct prealloc *p)
  337. {
  338. struct dm_cache_migration *mg = p->mg;
  339. BUG_ON(!mg);
  340. p->mg = NULL;
  341. return mg;
  342. }
  343. /*
  344. * You must have a cell within the prealloc struct to return. If not this
  345. * function will BUG() rather than returning NULL.
  346. */
  347. static struct dm_bio_prison_cell *prealloc_get_cell(struct prealloc *p)
  348. {
  349. struct dm_bio_prison_cell *r = NULL;
  350. if (p->cell1) {
  351. r = p->cell1;
  352. p->cell1 = NULL;
  353. } else if (p->cell2) {
  354. r = p->cell2;
  355. p->cell2 = NULL;
  356. } else
  357. BUG();
  358. return r;
  359. }
  360. /*
  361. * You can't have more than two cells in a prealloc struct. BUG() will be
  362. * called if you try and overfill.
  363. */
  364. static void prealloc_put_cell(struct prealloc *p, struct dm_bio_prison_cell *cell)
  365. {
  366. if (!p->cell2)
  367. p->cell2 = cell;
  368. else if (!p->cell1)
  369. p->cell1 = cell;
  370. else
  371. BUG();
  372. }
  373. /*----------------------------------------------------------------*/
  374. static void build_key(dm_oblock_t oblock, struct dm_cell_key *key)
  375. {
  376. key->virtual = 0;
  377. key->dev = 0;
  378. key->block = from_oblock(oblock);
  379. }
  380. /*
  381. * The caller hands in a preallocated cell, and a free function for it.
  382. * The cell will be freed if there's an error, or if it wasn't used because
  383. * a cell with that key already exists.
  384. */
  385. typedef void (*cell_free_fn)(void *context, struct dm_bio_prison_cell *cell);
  386. static int bio_detain(struct cache *cache, dm_oblock_t oblock,
  387. struct bio *bio, struct dm_bio_prison_cell *cell_prealloc,
  388. cell_free_fn free_fn, void *free_context,
  389. struct dm_bio_prison_cell **cell_result)
  390. {
  391. int r;
  392. struct dm_cell_key key;
  393. build_key(oblock, &key);
  394. r = dm_bio_detain(cache->prison, &key, bio, cell_prealloc, cell_result);
  395. if (r)
  396. free_fn(free_context, cell_prealloc);
  397. return r;
  398. }
  399. static int get_cell(struct cache *cache,
  400. dm_oblock_t oblock,
  401. struct prealloc *structs,
  402. struct dm_bio_prison_cell **cell_result)
  403. {
  404. int r;
  405. struct dm_cell_key key;
  406. struct dm_bio_prison_cell *cell_prealloc;
  407. cell_prealloc = prealloc_get_cell(structs);
  408. build_key(oblock, &key);
  409. r = dm_get_cell(cache->prison, &key, cell_prealloc, cell_result);
  410. if (r)
  411. prealloc_put_cell(structs, cell_prealloc);
  412. return r;
  413. }
  414. /*----------------------------------------------------------------*/
  415. static bool is_dirty(struct cache *cache, dm_cblock_t b)
  416. {
  417. return test_bit(from_cblock(b), cache->dirty_bitset);
  418. }
  419. static void set_dirty(struct cache *cache, dm_oblock_t oblock, dm_cblock_t cblock)
  420. {
  421. if (!test_and_set_bit(from_cblock(cblock), cache->dirty_bitset)) {
  422. atomic_inc(&cache->nr_dirty);
  423. policy_set_dirty(cache->policy, oblock);
  424. }
  425. }
  426. static void clear_dirty(struct cache *cache, dm_oblock_t oblock, dm_cblock_t cblock)
  427. {
  428. if (test_and_clear_bit(from_cblock(cblock), cache->dirty_bitset)) {
  429. policy_clear_dirty(cache->policy, oblock);
  430. if (atomic_dec_return(&cache->nr_dirty) == 0)
  431. dm_table_event(cache->ti->table);
  432. }
  433. }
  434. /*----------------------------------------------------------------*/
  435. static bool block_size_is_power_of_two(struct cache *cache)
  436. {
  437. return cache->sectors_per_block_shift >= 0;
  438. }
  439. /* gcc on ARM generates spurious references to __udivdi3 and __umoddi3 */
  440. #if defined(CONFIG_ARM) && __GNUC__ == 4 && __GNUC_MINOR__ <= 6
  441. __always_inline
  442. #endif
  443. static dm_block_t block_div(dm_block_t b, uint32_t n)
  444. {
  445. do_div(b, n);
  446. return b;
  447. }
  448. static void set_discard(struct cache *cache, dm_oblock_t b)
  449. {
  450. unsigned long flags;
  451. atomic_inc(&cache->stats.discard_count);
  452. spin_lock_irqsave(&cache->lock, flags);
  453. set_bit(from_oblock(b), cache->discard_bitset);
  454. spin_unlock_irqrestore(&cache->lock, flags);
  455. }
  456. static void clear_discard(struct cache *cache, dm_oblock_t b)
  457. {
  458. unsigned long flags;
  459. spin_lock_irqsave(&cache->lock, flags);
  460. clear_bit(from_oblock(b), cache->discard_bitset);
  461. spin_unlock_irqrestore(&cache->lock, flags);
  462. }
  463. static bool is_discarded(struct cache *cache, dm_oblock_t b)
  464. {
  465. int r;
  466. unsigned long flags;
  467. spin_lock_irqsave(&cache->lock, flags);
  468. r = test_bit(from_oblock(b), cache->discard_bitset);
  469. spin_unlock_irqrestore(&cache->lock, flags);
  470. return r;
  471. }
  472. static bool is_discarded_oblock(struct cache *cache, dm_oblock_t b)
  473. {
  474. int r;
  475. unsigned long flags;
  476. spin_lock_irqsave(&cache->lock, flags);
  477. r = test_bit(from_oblock(b), cache->discard_bitset);
  478. spin_unlock_irqrestore(&cache->lock, flags);
  479. return r;
  480. }
  481. /*----------------------------------------------------------------*/
  482. static void load_stats(struct cache *cache)
  483. {
  484. struct dm_cache_statistics stats;
  485. dm_cache_metadata_get_stats(cache->cmd, &stats);
  486. atomic_set(&cache->stats.read_hit, stats.read_hits);
  487. atomic_set(&cache->stats.read_miss, stats.read_misses);
  488. atomic_set(&cache->stats.write_hit, stats.write_hits);
  489. atomic_set(&cache->stats.write_miss, stats.write_misses);
  490. }
  491. static void save_stats(struct cache *cache)
  492. {
  493. struct dm_cache_statistics stats;
  494. stats.read_hits = atomic_read(&cache->stats.read_hit);
  495. stats.read_misses = atomic_read(&cache->stats.read_miss);
  496. stats.write_hits = atomic_read(&cache->stats.write_hit);
  497. stats.write_misses = atomic_read(&cache->stats.write_miss);
  498. dm_cache_metadata_set_stats(cache->cmd, &stats);
  499. }
  500. /*----------------------------------------------------------------
  501. * Per bio data
  502. *--------------------------------------------------------------*/
  503. /*
  504. * If using writeback, leave out struct per_bio_data's writethrough fields.
  505. */
  506. #define PB_DATA_SIZE_WB (offsetof(struct per_bio_data, cache))
  507. #define PB_DATA_SIZE_WT (sizeof(struct per_bio_data))
  508. static bool writethrough_mode(struct cache_features *f)
  509. {
  510. return f->io_mode == CM_IO_WRITETHROUGH;
  511. }
  512. static bool writeback_mode(struct cache_features *f)
  513. {
  514. return f->io_mode == CM_IO_WRITEBACK;
  515. }
  516. static bool passthrough_mode(struct cache_features *f)
  517. {
  518. return f->io_mode == CM_IO_PASSTHROUGH;
  519. }
  520. static size_t get_per_bio_data_size(struct cache *cache)
  521. {
  522. return writethrough_mode(&cache->features) ? PB_DATA_SIZE_WT : PB_DATA_SIZE_WB;
  523. }
  524. static struct per_bio_data *get_per_bio_data(struct bio *bio, size_t data_size)
  525. {
  526. struct per_bio_data *pb = dm_per_bio_data(bio, data_size);
  527. BUG_ON(!pb);
  528. return pb;
  529. }
  530. static struct per_bio_data *init_per_bio_data(struct bio *bio, size_t data_size)
  531. {
  532. struct per_bio_data *pb = get_per_bio_data(bio, data_size);
  533. pb->tick = false;
  534. pb->req_nr = dm_bio_get_target_bio_nr(bio);
  535. pb->all_io_entry = NULL;
  536. return pb;
  537. }
  538. /*----------------------------------------------------------------
  539. * Remapping
  540. *--------------------------------------------------------------*/
  541. static void remap_to_origin(struct cache *cache, struct bio *bio)
  542. {
  543. bio->bi_bdev = cache->origin_dev->bdev;
  544. }
  545. static void remap_to_cache(struct cache *cache, struct bio *bio,
  546. dm_cblock_t cblock)
  547. {
  548. sector_t bi_sector = bio->bi_iter.bi_sector;
  549. sector_t block = from_cblock(cblock);
  550. bio->bi_bdev = cache->cache_dev->bdev;
  551. if (!block_size_is_power_of_two(cache))
  552. bio->bi_iter.bi_sector =
  553. (block * cache->sectors_per_block) +
  554. sector_div(bi_sector, cache->sectors_per_block);
  555. else
  556. bio->bi_iter.bi_sector =
  557. (block << cache->sectors_per_block_shift) |
  558. (bi_sector & (cache->sectors_per_block - 1));
  559. }
  560. static void check_if_tick_bio_needed(struct cache *cache, struct bio *bio)
  561. {
  562. unsigned long flags;
  563. size_t pb_data_size = get_per_bio_data_size(cache);
  564. struct per_bio_data *pb = get_per_bio_data(bio, pb_data_size);
  565. spin_lock_irqsave(&cache->lock, flags);
  566. if (cache->need_tick_bio &&
  567. !(bio->bi_rw & (REQ_FUA | REQ_FLUSH | REQ_DISCARD))) {
  568. pb->tick = true;
  569. cache->need_tick_bio = false;
  570. }
  571. spin_unlock_irqrestore(&cache->lock, flags);
  572. }
  573. static void remap_to_origin_clear_discard(struct cache *cache, struct bio *bio,
  574. dm_oblock_t oblock)
  575. {
  576. check_if_tick_bio_needed(cache, bio);
  577. remap_to_origin(cache, bio);
  578. if (bio_data_dir(bio) == WRITE)
  579. clear_discard(cache, oblock);
  580. }
  581. static void remap_to_cache_dirty(struct cache *cache, struct bio *bio,
  582. dm_oblock_t oblock, dm_cblock_t cblock)
  583. {
  584. check_if_tick_bio_needed(cache, bio);
  585. remap_to_cache(cache, bio, cblock);
  586. if (bio_data_dir(bio) == WRITE) {
  587. set_dirty(cache, oblock, cblock);
  588. clear_discard(cache, oblock);
  589. }
  590. }
  591. static dm_oblock_t get_bio_block(struct cache *cache, struct bio *bio)
  592. {
  593. sector_t block_nr = bio->bi_iter.bi_sector;
  594. if (!block_size_is_power_of_two(cache))
  595. (void) sector_div(block_nr, cache->sectors_per_block);
  596. else
  597. block_nr >>= cache->sectors_per_block_shift;
  598. return to_oblock(block_nr);
  599. }
  600. static int bio_triggers_commit(struct cache *cache, struct bio *bio)
  601. {
  602. return bio->bi_rw & (REQ_FLUSH | REQ_FUA);
  603. }
  604. /*
  605. * You must increment the deferred set whilst the prison cell is held. To
  606. * encourage this, we ask for 'cell' to be passed in.
  607. */
  608. static void inc_ds(struct cache *cache, struct bio *bio,
  609. struct dm_bio_prison_cell *cell)
  610. {
  611. size_t pb_data_size = get_per_bio_data_size(cache);
  612. struct per_bio_data *pb = get_per_bio_data(bio, pb_data_size);
  613. BUG_ON(!cell);
  614. BUG_ON(pb->all_io_entry);
  615. pb->all_io_entry = dm_deferred_entry_inc(cache->all_io_ds);
  616. }
  617. static void issue(struct cache *cache, struct bio *bio)
  618. {
  619. unsigned long flags;
  620. if (!bio_triggers_commit(cache, bio)) {
  621. generic_make_request(bio);
  622. return;
  623. }
  624. /*
  625. * Batch together any bios that trigger commits and then issue a
  626. * single commit for them in do_worker().
  627. */
  628. spin_lock_irqsave(&cache->lock, flags);
  629. cache->commit_requested = true;
  630. bio_list_add(&cache->deferred_flush_bios, bio);
  631. spin_unlock_irqrestore(&cache->lock, flags);
  632. }
  633. static void inc_and_issue(struct cache *cache, struct bio *bio, struct dm_bio_prison_cell *cell)
  634. {
  635. inc_ds(cache, bio, cell);
  636. issue(cache, bio);
  637. }
  638. static void defer_writethrough_bio(struct cache *cache, struct bio *bio)
  639. {
  640. unsigned long flags;
  641. spin_lock_irqsave(&cache->lock, flags);
  642. bio_list_add(&cache->deferred_writethrough_bios, bio);
  643. spin_unlock_irqrestore(&cache->lock, flags);
  644. wake_worker(cache);
  645. }
  646. static void writethrough_endio(struct bio *bio, int err)
  647. {
  648. struct per_bio_data *pb = get_per_bio_data(bio, PB_DATA_SIZE_WT);
  649. dm_unhook_bio(&pb->hook_info, bio);
  650. if (err) {
  651. bio_endio(bio, err);
  652. return;
  653. }
  654. dm_bio_restore(&pb->bio_details, bio);
  655. remap_to_cache(pb->cache, bio, pb->cblock);
  656. /*
  657. * We can't issue this bio directly, since we're in interrupt
  658. * context. So it gets put on a bio list for processing by the
  659. * worker thread.
  660. */
  661. defer_writethrough_bio(pb->cache, bio);
  662. }
  663. /*
  664. * When running in writethrough mode we need to send writes to clean blocks
  665. * to both the cache and origin devices. In future we'd like to clone the
  666. * bio and send them in parallel, but for now we're doing them in
  667. * series as this is easier.
  668. */
  669. static void remap_to_origin_then_cache(struct cache *cache, struct bio *bio,
  670. dm_oblock_t oblock, dm_cblock_t cblock)
  671. {
  672. struct per_bio_data *pb = get_per_bio_data(bio, PB_DATA_SIZE_WT);
  673. pb->cache = cache;
  674. pb->cblock = cblock;
  675. dm_hook_bio(&pb->hook_info, bio, writethrough_endio, NULL);
  676. dm_bio_record(&pb->bio_details, bio);
  677. remap_to_origin_clear_discard(pb->cache, bio, oblock);
  678. }
  679. /*----------------------------------------------------------------
  680. * Migration processing
  681. *
  682. * Migration covers moving data from the origin device to the cache, or
  683. * vice versa.
  684. *--------------------------------------------------------------*/
  685. static void inc_io_migrations(struct cache *cache)
  686. {
  687. atomic_inc(&cache->nr_io_migrations);
  688. }
  689. static void dec_io_migrations(struct cache *cache)
  690. {
  691. atomic_dec(&cache->nr_io_migrations);
  692. }
  693. static void __cell_defer(struct cache *cache, struct dm_bio_prison_cell *cell,
  694. bool holder)
  695. {
  696. (holder ? dm_cell_release : dm_cell_release_no_holder)
  697. (cache->prison, cell, &cache->deferred_bios);
  698. free_prison_cell(cache, cell);
  699. }
  700. static void cell_defer(struct cache *cache, struct dm_bio_prison_cell *cell,
  701. bool holder)
  702. {
  703. unsigned long flags;
  704. spin_lock_irqsave(&cache->lock, flags);
  705. __cell_defer(cache, cell, holder);
  706. spin_unlock_irqrestore(&cache->lock, flags);
  707. wake_worker(cache);
  708. }
  709. static void free_io_migration(struct dm_cache_migration *mg)
  710. {
  711. dec_io_migrations(mg->cache);
  712. free_migration(mg);
  713. }
  714. static void migration_failure(struct dm_cache_migration *mg)
  715. {
  716. struct cache *cache = mg->cache;
  717. if (mg->writeback) {
  718. DMWARN_LIMIT("writeback failed; couldn't copy block");
  719. set_dirty(cache, mg->old_oblock, mg->cblock);
  720. cell_defer(cache, mg->old_ocell, false);
  721. } else if (mg->demote) {
  722. DMWARN_LIMIT("demotion failed; couldn't copy block");
  723. policy_force_mapping(cache->policy, mg->new_oblock, mg->old_oblock);
  724. cell_defer(cache, mg->old_ocell, mg->promote ? false : true);
  725. if (mg->promote)
  726. cell_defer(cache, mg->new_ocell, true);
  727. } else {
  728. DMWARN_LIMIT("promotion failed; couldn't copy block");
  729. policy_remove_mapping(cache->policy, mg->new_oblock);
  730. cell_defer(cache, mg->new_ocell, true);
  731. }
  732. free_io_migration(mg);
  733. }
  734. static void migration_success_pre_commit(struct dm_cache_migration *mg)
  735. {
  736. unsigned long flags;
  737. struct cache *cache = mg->cache;
  738. if (mg->writeback) {
  739. clear_dirty(cache, mg->old_oblock, mg->cblock);
  740. cell_defer(cache, mg->old_ocell, false);
  741. free_io_migration(mg);
  742. return;
  743. } else if (mg->demote) {
  744. if (dm_cache_remove_mapping(cache->cmd, mg->cblock)) {
  745. DMWARN_LIMIT("demotion failed; couldn't update on disk metadata");
  746. policy_force_mapping(cache->policy, mg->new_oblock,
  747. mg->old_oblock);
  748. if (mg->promote)
  749. cell_defer(cache, mg->new_ocell, true);
  750. free_io_migration(mg);
  751. return;
  752. }
  753. } else {
  754. if (dm_cache_insert_mapping(cache->cmd, mg->cblock, mg->new_oblock)) {
  755. DMWARN_LIMIT("promotion failed; couldn't update on disk metadata");
  756. policy_remove_mapping(cache->policy, mg->new_oblock);
  757. free_io_migration(mg);
  758. return;
  759. }
  760. }
  761. spin_lock_irqsave(&cache->lock, flags);
  762. list_add_tail(&mg->list, &cache->need_commit_migrations);
  763. cache->commit_requested = true;
  764. spin_unlock_irqrestore(&cache->lock, flags);
  765. }
  766. static void migration_success_post_commit(struct dm_cache_migration *mg)
  767. {
  768. unsigned long flags;
  769. struct cache *cache = mg->cache;
  770. if (mg->writeback) {
  771. DMWARN("writeback unexpectedly triggered commit");
  772. return;
  773. } else if (mg->demote) {
  774. cell_defer(cache, mg->old_ocell, mg->promote ? false : true);
  775. if (mg->promote) {
  776. mg->demote = false;
  777. spin_lock_irqsave(&cache->lock, flags);
  778. list_add_tail(&mg->list, &cache->quiesced_migrations);
  779. spin_unlock_irqrestore(&cache->lock, flags);
  780. } else {
  781. if (mg->invalidate)
  782. policy_remove_mapping(cache->policy, mg->old_oblock);
  783. free_io_migration(mg);
  784. }
  785. } else {
  786. if (mg->requeue_holder) {
  787. clear_dirty(cache, mg->new_oblock, mg->cblock);
  788. cell_defer(cache, mg->new_ocell, true);
  789. } else {
  790. /*
  791. * The block was promoted via an overwrite, so it's dirty.
  792. */
  793. set_dirty(cache, mg->new_oblock, mg->cblock);
  794. bio_endio(mg->new_ocell->holder, 0);
  795. cell_defer(cache, mg->new_ocell, false);
  796. }
  797. free_io_migration(mg);
  798. }
  799. }
  800. static void copy_complete(int read_err, unsigned long write_err, void *context)
  801. {
  802. unsigned long flags;
  803. struct dm_cache_migration *mg = (struct dm_cache_migration *) context;
  804. struct cache *cache = mg->cache;
  805. if (read_err || write_err)
  806. mg->err = true;
  807. spin_lock_irqsave(&cache->lock, flags);
  808. list_add_tail(&mg->list, &cache->completed_migrations);
  809. spin_unlock_irqrestore(&cache->lock, flags);
  810. wake_worker(cache);
  811. }
  812. static void issue_copy_real(struct dm_cache_migration *mg)
  813. {
  814. int r;
  815. struct dm_io_region o_region, c_region;
  816. struct cache *cache = mg->cache;
  817. sector_t cblock = from_cblock(mg->cblock);
  818. o_region.bdev = cache->origin_dev->bdev;
  819. o_region.count = cache->sectors_per_block;
  820. c_region.bdev = cache->cache_dev->bdev;
  821. c_region.sector = cblock * cache->sectors_per_block;
  822. c_region.count = cache->sectors_per_block;
  823. if (mg->writeback || mg->demote) {
  824. /* demote */
  825. o_region.sector = from_oblock(mg->old_oblock) * cache->sectors_per_block;
  826. r = dm_kcopyd_copy(cache->copier, &c_region, 1, &o_region, 0, copy_complete, mg);
  827. } else {
  828. /* promote */
  829. o_region.sector = from_oblock(mg->new_oblock) * cache->sectors_per_block;
  830. r = dm_kcopyd_copy(cache->copier, &o_region, 1, &c_region, 0, copy_complete, mg);
  831. }
  832. if (r < 0) {
  833. DMERR_LIMIT("issuing migration failed");
  834. migration_failure(mg);
  835. }
  836. }
  837. static void overwrite_endio(struct bio *bio, int err)
  838. {
  839. struct dm_cache_migration *mg = bio->bi_private;
  840. struct cache *cache = mg->cache;
  841. size_t pb_data_size = get_per_bio_data_size(cache);
  842. struct per_bio_data *pb = get_per_bio_data(bio, pb_data_size);
  843. unsigned long flags;
  844. dm_unhook_bio(&pb->hook_info, bio);
  845. if (err)
  846. mg->err = true;
  847. mg->requeue_holder = false;
  848. spin_lock_irqsave(&cache->lock, flags);
  849. list_add_tail(&mg->list, &cache->completed_migrations);
  850. spin_unlock_irqrestore(&cache->lock, flags);
  851. wake_worker(cache);
  852. }
  853. static void issue_overwrite(struct dm_cache_migration *mg, struct bio *bio)
  854. {
  855. size_t pb_data_size = get_per_bio_data_size(mg->cache);
  856. struct per_bio_data *pb = get_per_bio_data(bio, pb_data_size);
  857. dm_hook_bio(&pb->hook_info, bio, overwrite_endio, mg);
  858. remap_to_cache_dirty(mg->cache, bio, mg->new_oblock, mg->cblock);
  859. /*
  860. * No need to inc_ds() here, since the cell will be held for the
  861. * duration of the io.
  862. */
  863. generic_make_request(bio);
  864. }
  865. static bool bio_writes_complete_block(struct cache *cache, struct bio *bio)
  866. {
  867. return (bio_data_dir(bio) == WRITE) &&
  868. (bio->bi_iter.bi_size == (cache->sectors_per_block << SECTOR_SHIFT));
  869. }
  870. static void avoid_copy(struct dm_cache_migration *mg)
  871. {
  872. atomic_inc(&mg->cache->stats.copies_avoided);
  873. migration_success_pre_commit(mg);
  874. }
  875. static void issue_copy(struct dm_cache_migration *mg)
  876. {
  877. bool avoid;
  878. struct cache *cache = mg->cache;
  879. if (mg->writeback || mg->demote)
  880. avoid = !is_dirty(cache, mg->cblock) ||
  881. is_discarded_oblock(cache, mg->old_oblock);
  882. else {
  883. struct bio *bio = mg->new_ocell->holder;
  884. avoid = is_discarded_oblock(cache, mg->new_oblock);
  885. if (writeback_mode(&cache->features) &&
  886. !avoid && bio_writes_complete_block(cache, bio)) {
  887. issue_overwrite(mg, bio);
  888. return;
  889. }
  890. }
  891. avoid ? avoid_copy(mg) : issue_copy_real(mg);
  892. }
  893. static void complete_migration(struct dm_cache_migration *mg)
  894. {
  895. if (mg->err)
  896. migration_failure(mg);
  897. else
  898. migration_success_pre_commit(mg);
  899. }
  900. static void process_migrations(struct cache *cache, struct list_head *head,
  901. void (*fn)(struct dm_cache_migration *))
  902. {
  903. unsigned long flags;
  904. struct list_head list;
  905. struct dm_cache_migration *mg, *tmp;
  906. INIT_LIST_HEAD(&list);
  907. spin_lock_irqsave(&cache->lock, flags);
  908. list_splice_init(head, &list);
  909. spin_unlock_irqrestore(&cache->lock, flags);
  910. list_for_each_entry_safe(mg, tmp, &list, list)
  911. fn(mg);
  912. }
  913. static void __queue_quiesced_migration(struct dm_cache_migration *mg)
  914. {
  915. list_add_tail(&mg->list, &mg->cache->quiesced_migrations);
  916. }
  917. static void queue_quiesced_migration(struct dm_cache_migration *mg)
  918. {
  919. unsigned long flags;
  920. struct cache *cache = mg->cache;
  921. spin_lock_irqsave(&cache->lock, flags);
  922. __queue_quiesced_migration(mg);
  923. spin_unlock_irqrestore(&cache->lock, flags);
  924. wake_worker(cache);
  925. }
  926. static void queue_quiesced_migrations(struct cache *cache, struct list_head *work)
  927. {
  928. unsigned long flags;
  929. struct dm_cache_migration *mg, *tmp;
  930. spin_lock_irqsave(&cache->lock, flags);
  931. list_for_each_entry_safe(mg, tmp, work, list)
  932. __queue_quiesced_migration(mg);
  933. spin_unlock_irqrestore(&cache->lock, flags);
  934. wake_worker(cache);
  935. }
  936. static void check_for_quiesced_migrations(struct cache *cache,
  937. struct per_bio_data *pb)
  938. {
  939. struct list_head work;
  940. if (!pb->all_io_entry)
  941. return;
  942. INIT_LIST_HEAD(&work);
  943. dm_deferred_entry_dec(pb->all_io_entry, &work);
  944. if (!list_empty(&work))
  945. queue_quiesced_migrations(cache, &work);
  946. }
  947. static void quiesce_migration(struct dm_cache_migration *mg)
  948. {
  949. if (!dm_deferred_set_add_work(mg->cache->all_io_ds, &mg->list))
  950. queue_quiesced_migration(mg);
  951. }
  952. static void promote(struct cache *cache, struct prealloc *structs,
  953. dm_oblock_t oblock, dm_cblock_t cblock,
  954. struct dm_bio_prison_cell *cell)
  955. {
  956. struct dm_cache_migration *mg = prealloc_get_migration(structs);
  957. mg->err = false;
  958. mg->writeback = false;
  959. mg->demote = false;
  960. mg->promote = true;
  961. mg->requeue_holder = true;
  962. mg->invalidate = false;
  963. mg->cache = cache;
  964. mg->new_oblock = oblock;
  965. mg->cblock = cblock;
  966. mg->old_ocell = NULL;
  967. mg->new_ocell = cell;
  968. mg->start_jiffies = jiffies;
  969. inc_io_migrations(cache);
  970. quiesce_migration(mg);
  971. }
  972. static void writeback(struct cache *cache, struct prealloc *structs,
  973. dm_oblock_t oblock, dm_cblock_t cblock,
  974. struct dm_bio_prison_cell *cell)
  975. {
  976. struct dm_cache_migration *mg = prealloc_get_migration(structs);
  977. mg->err = false;
  978. mg->writeback = true;
  979. mg->demote = false;
  980. mg->promote = false;
  981. mg->requeue_holder = true;
  982. mg->invalidate = false;
  983. mg->cache = cache;
  984. mg->old_oblock = oblock;
  985. mg->cblock = cblock;
  986. mg->old_ocell = cell;
  987. mg->new_ocell = NULL;
  988. mg->start_jiffies = jiffies;
  989. inc_io_migrations(cache);
  990. quiesce_migration(mg);
  991. }
  992. static void demote_then_promote(struct cache *cache, struct prealloc *structs,
  993. dm_oblock_t old_oblock, dm_oblock_t new_oblock,
  994. dm_cblock_t cblock,
  995. struct dm_bio_prison_cell *old_ocell,
  996. struct dm_bio_prison_cell *new_ocell)
  997. {
  998. struct dm_cache_migration *mg = prealloc_get_migration(structs);
  999. mg->err = false;
  1000. mg->writeback = false;
  1001. mg->demote = true;
  1002. mg->promote = true;
  1003. mg->requeue_holder = true;
  1004. mg->invalidate = false;
  1005. mg->cache = cache;
  1006. mg->old_oblock = old_oblock;
  1007. mg->new_oblock = new_oblock;
  1008. mg->cblock = cblock;
  1009. mg->old_ocell = old_ocell;
  1010. mg->new_ocell = new_ocell;
  1011. mg->start_jiffies = jiffies;
  1012. inc_io_migrations(cache);
  1013. quiesce_migration(mg);
  1014. }
  1015. /*
  1016. * Invalidate a cache entry. No writeback occurs; any changes in the cache
  1017. * block are thrown away.
  1018. */
  1019. static void invalidate(struct cache *cache, struct prealloc *structs,
  1020. dm_oblock_t oblock, dm_cblock_t cblock,
  1021. struct dm_bio_prison_cell *cell)
  1022. {
  1023. struct dm_cache_migration *mg = prealloc_get_migration(structs);
  1024. mg->err = false;
  1025. mg->writeback = false;
  1026. mg->demote = true;
  1027. mg->promote = false;
  1028. mg->requeue_holder = true;
  1029. mg->invalidate = true;
  1030. mg->cache = cache;
  1031. mg->old_oblock = oblock;
  1032. mg->cblock = cblock;
  1033. mg->old_ocell = cell;
  1034. mg->new_ocell = NULL;
  1035. mg->start_jiffies = jiffies;
  1036. inc_io_migrations(cache);
  1037. quiesce_migration(mg);
  1038. }
  1039. /*----------------------------------------------------------------
  1040. * bio processing
  1041. *--------------------------------------------------------------*/
  1042. static void defer_bio(struct cache *cache, struct bio *bio)
  1043. {
  1044. unsigned long flags;
  1045. spin_lock_irqsave(&cache->lock, flags);
  1046. bio_list_add(&cache->deferred_bios, bio);
  1047. spin_unlock_irqrestore(&cache->lock, flags);
  1048. wake_worker(cache);
  1049. }
  1050. static void process_flush_bio(struct cache *cache, struct bio *bio)
  1051. {
  1052. size_t pb_data_size = get_per_bio_data_size(cache);
  1053. struct per_bio_data *pb = get_per_bio_data(bio, pb_data_size);
  1054. BUG_ON(bio->bi_iter.bi_size);
  1055. if (!pb->req_nr)
  1056. remap_to_origin(cache, bio);
  1057. else
  1058. remap_to_cache(cache, bio, 0);
  1059. /*
  1060. * REQ_FLUSH is not directed at any particular block so we don't
  1061. * need to inc_ds(). REQ_FUA's are split into a write + REQ_FLUSH
  1062. * by dm-core.
  1063. */
  1064. issue(cache, bio);
  1065. }
  1066. /*
  1067. * People generally discard large parts of a device, eg, the whole device
  1068. * when formatting. Splitting these large discards up into cache block
  1069. * sized ios and then quiescing (always neccessary for discard) takes too
  1070. * long.
  1071. *
  1072. * We keep it simple, and allow any size of discard to come in, and just
  1073. * mark off blocks on the discard bitset. No passdown occurs!
  1074. *
  1075. * To implement passdown we need to change the bio_prison such that a cell
  1076. * can have a key that spans many blocks.
  1077. */
  1078. static void process_discard_bio(struct cache *cache, struct bio *bio)
  1079. {
  1080. dm_block_t start_block = dm_sector_div_up(bio->bi_iter.bi_sector,
  1081. cache->sectors_per_block);
  1082. dm_block_t end_block = bio_end_sector(bio);
  1083. dm_block_t b;
  1084. end_block = block_div(end_block, cache->sectors_per_block);
  1085. for (b = start_block; b < end_block; b++)
  1086. set_discard(cache, to_oblock(b));
  1087. bio_endio(bio, 0);
  1088. }
  1089. static bool spare_migration_bandwidth(struct cache *cache)
  1090. {
  1091. sector_t current_volume = (atomic_read(&cache->nr_io_migrations) + 1) *
  1092. cache->sectors_per_block;
  1093. return current_volume < cache->migration_threshold;
  1094. }
  1095. static void inc_hit_counter(struct cache *cache, struct bio *bio)
  1096. {
  1097. atomic_inc(bio_data_dir(bio) == READ ?
  1098. &cache->stats.read_hit : &cache->stats.write_hit);
  1099. }
  1100. static void inc_miss_counter(struct cache *cache, struct bio *bio)
  1101. {
  1102. atomic_inc(bio_data_dir(bio) == READ ?
  1103. &cache->stats.read_miss : &cache->stats.write_miss);
  1104. }
  1105. static void process_bio(struct cache *cache, struct prealloc *structs,
  1106. struct bio *bio)
  1107. {
  1108. int r;
  1109. bool release_cell = true;
  1110. dm_oblock_t block = get_bio_block(cache, bio);
  1111. struct dm_bio_prison_cell *cell_prealloc, *old_ocell, *new_ocell;
  1112. struct policy_result lookup_result;
  1113. bool discarded_block = is_discarded_oblock(cache, block);
  1114. bool passthrough = passthrough_mode(&cache->features);
  1115. bool can_migrate = !passthrough && (discarded_block || spare_migration_bandwidth(cache));
  1116. /*
  1117. * Check to see if that block is currently migrating.
  1118. */
  1119. cell_prealloc = prealloc_get_cell(structs);
  1120. r = bio_detain(cache, block, bio, cell_prealloc,
  1121. (cell_free_fn) prealloc_put_cell,
  1122. structs, &new_ocell);
  1123. if (r > 0)
  1124. return;
  1125. r = policy_map(cache->policy, block, true, can_migrate, discarded_block,
  1126. bio, &lookup_result);
  1127. if (r == -EWOULDBLOCK)
  1128. /* migration has been denied */
  1129. lookup_result.op = POLICY_MISS;
  1130. switch (lookup_result.op) {
  1131. case POLICY_HIT:
  1132. if (passthrough) {
  1133. inc_miss_counter(cache, bio);
  1134. /*
  1135. * Passthrough always maps to the origin,
  1136. * invalidating any cache blocks that are written
  1137. * to.
  1138. */
  1139. if (bio_data_dir(bio) == WRITE) {
  1140. atomic_inc(&cache->stats.demotion);
  1141. invalidate(cache, structs, block, lookup_result.cblock, new_ocell);
  1142. release_cell = false;
  1143. } else {
  1144. /* FIXME: factor out issue_origin() */
  1145. remap_to_origin_clear_discard(cache, bio, block);
  1146. inc_and_issue(cache, bio, new_ocell);
  1147. }
  1148. } else {
  1149. inc_hit_counter(cache, bio);
  1150. if (bio_data_dir(bio) == WRITE &&
  1151. writethrough_mode(&cache->features) &&
  1152. !is_dirty(cache, lookup_result.cblock)) {
  1153. remap_to_origin_then_cache(cache, bio, block, lookup_result.cblock);
  1154. inc_and_issue(cache, bio, new_ocell);
  1155. } else {
  1156. remap_to_cache_dirty(cache, bio, block, lookup_result.cblock);
  1157. inc_and_issue(cache, bio, new_ocell);
  1158. }
  1159. }
  1160. break;
  1161. case POLICY_MISS:
  1162. inc_miss_counter(cache, bio);
  1163. remap_to_origin_clear_discard(cache, bio, block);
  1164. inc_and_issue(cache, bio, new_ocell);
  1165. break;
  1166. case POLICY_NEW:
  1167. atomic_inc(&cache->stats.promotion);
  1168. promote(cache, structs, block, lookup_result.cblock, new_ocell);
  1169. release_cell = false;
  1170. break;
  1171. case POLICY_REPLACE:
  1172. cell_prealloc = prealloc_get_cell(structs);
  1173. r = bio_detain(cache, lookup_result.old_oblock, bio, cell_prealloc,
  1174. (cell_free_fn) prealloc_put_cell,
  1175. structs, &old_ocell);
  1176. if (r > 0) {
  1177. /*
  1178. * We have to be careful to avoid lock inversion of
  1179. * the cells. So we back off, and wait for the
  1180. * old_ocell to become free.
  1181. */
  1182. policy_force_mapping(cache->policy, block,
  1183. lookup_result.old_oblock);
  1184. atomic_inc(&cache->stats.cache_cell_clash);
  1185. break;
  1186. }
  1187. atomic_inc(&cache->stats.demotion);
  1188. atomic_inc(&cache->stats.promotion);
  1189. demote_then_promote(cache, structs, lookup_result.old_oblock,
  1190. block, lookup_result.cblock,
  1191. old_ocell, new_ocell);
  1192. release_cell = false;
  1193. break;
  1194. default:
  1195. DMERR_LIMIT("%s: erroring bio, unknown policy op: %u", __func__,
  1196. (unsigned) lookup_result.op);
  1197. bio_io_error(bio);
  1198. }
  1199. if (release_cell)
  1200. cell_defer(cache, new_ocell, false);
  1201. }
  1202. static int need_commit_due_to_time(struct cache *cache)
  1203. {
  1204. return jiffies < cache->last_commit_jiffies ||
  1205. jiffies > cache->last_commit_jiffies + COMMIT_PERIOD;
  1206. }
  1207. static int commit_if_needed(struct cache *cache)
  1208. {
  1209. int r = 0;
  1210. if ((cache->commit_requested || need_commit_due_to_time(cache)) &&
  1211. dm_cache_changed_this_transaction(cache->cmd)) {
  1212. atomic_inc(&cache->stats.commit_count);
  1213. cache->commit_requested = false;
  1214. r = dm_cache_commit(cache->cmd, false);
  1215. cache->last_commit_jiffies = jiffies;
  1216. }
  1217. return r;
  1218. }
  1219. static void process_deferred_bios(struct cache *cache)
  1220. {
  1221. unsigned long flags;
  1222. struct bio_list bios;
  1223. struct bio *bio;
  1224. struct prealloc structs;
  1225. memset(&structs, 0, sizeof(structs));
  1226. bio_list_init(&bios);
  1227. spin_lock_irqsave(&cache->lock, flags);
  1228. bio_list_merge(&bios, &cache->deferred_bios);
  1229. bio_list_init(&cache->deferred_bios);
  1230. spin_unlock_irqrestore(&cache->lock, flags);
  1231. while (!bio_list_empty(&bios)) {
  1232. /*
  1233. * If we've got no free migration structs, and processing
  1234. * this bio might require one, we pause until there are some
  1235. * prepared mappings to process.
  1236. */
  1237. if (prealloc_data_structs(cache, &structs)) {
  1238. spin_lock_irqsave(&cache->lock, flags);
  1239. bio_list_merge(&cache->deferred_bios, &bios);
  1240. spin_unlock_irqrestore(&cache->lock, flags);
  1241. break;
  1242. }
  1243. bio = bio_list_pop(&bios);
  1244. if (bio->bi_rw & REQ_FLUSH)
  1245. process_flush_bio(cache, bio);
  1246. else if (bio->bi_rw & REQ_DISCARD)
  1247. process_discard_bio(cache, bio);
  1248. else
  1249. process_bio(cache, &structs, bio);
  1250. }
  1251. prealloc_free_structs(cache, &structs);
  1252. }
  1253. static void process_deferred_flush_bios(struct cache *cache, bool submit_bios)
  1254. {
  1255. unsigned long flags;
  1256. struct bio_list bios;
  1257. struct bio *bio;
  1258. bio_list_init(&bios);
  1259. spin_lock_irqsave(&cache->lock, flags);
  1260. bio_list_merge(&bios, &cache->deferred_flush_bios);
  1261. bio_list_init(&cache->deferred_flush_bios);
  1262. spin_unlock_irqrestore(&cache->lock, flags);
  1263. /*
  1264. * These bios have already been through inc_ds()
  1265. */
  1266. while ((bio = bio_list_pop(&bios)))
  1267. submit_bios ? generic_make_request(bio) : bio_io_error(bio);
  1268. }
  1269. static void process_deferred_writethrough_bios(struct cache *cache)
  1270. {
  1271. unsigned long flags;
  1272. struct bio_list bios;
  1273. struct bio *bio;
  1274. bio_list_init(&bios);
  1275. spin_lock_irqsave(&cache->lock, flags);
  1276. bio_list_merge(&bios, &cache->deferred_writethrough_bios);
  1277. bio_list_init(&cache->deferred_writethrough_bios);
  1278. spin_unlock_irqrestore(&cache->lock, flags);
  1279. /*
  1280. * These bios have already been through inc_ds()
  1281. */
  1282. while ((bio = bio_list_pop(&bios)))
  1283. generic_make_request(bio);
  1284. }
  1285. static void writeback_some_dirty_blocks(struct cache *cache)
  1286. {
  1287. int r = 0;
  1288. dm_oblock_t oblock;
  1289. dm_cblock_t cblock;
  1290. struct prealloc structs;
  1291. struct dm_bio_prison_cell *old_ocell;
  1292. memset(&structs, 0, sizeof(structs));
  1293. while (spare_migration_bandwidth(cache)) {
  1294. if (prealloc_data_structs(cache, &structs))
  1295. break;
  1296. r = policy_writeback_work(cache->policy, &oblock, &cblock);
  1297. if (r)
  1298. break;
  1299. r = get_cell(cache, oblock, &structs, &old_ocell);
  1300. if (r) {
  1301. policy_set_dirty(cache->policy, oblock);
  1302. break;
  1303. }
  1304. writeback(cache, &structs, oblock, cblock, old_ocell);
  1305. }
  1306. prealloc_free_structs(cache, &structs);
  1307. }
  1308. /*----------------------------------------------------------------
  1309. * Invalidations.
  1310. * Dropping something from the cache *without* writing back.
  1311. *--------------------------------------------------------------*/
  1312. static void process_invalidation_request(struct cache *cache, struct invalidation_request *req)
  1313. {
  1314. int r = 0;
  1315. uint64_t begin = from_cblock(req->cblocks->begin);
  1316. uint64_t end = from_cblock(req->cblocks->end);
  1317. while (begin != end) {
  1318. r = policy_remove_cblock(cache->policy, to_cblock(begin));
  1319. if (!r) {
  1320. r = dm_cache_remove_mapping(cache->cmd, to_cblock(begin));
  1321. if (r)
  1322. break;
  1323. } else if (r == -ENODATA) {
  1324. /* harmless, already unmapped */
  1325. r = 0;
  1326. } else {
  1327. DMERR("policy_remove_cblock failed");
  1328. break;
  1329. }
  1330. begin++;
  1331. }
  1332. cache->commit_requested = true;
  1333. req->err = r;
  1334. atomic_set(&req->complete, 1);
  1335. wake_up(&req->result_wait);
  1336. }
  1337. static void process_invalidation_requests(struct cache *cache)
  1338. {
  1339. struct list_head list;
  1340. struct invalidation_request *req, *tmp;
  1341. INIT_LIST_HEAD(&list);
  1342. spin_lock(&cache->invalidation_lock);
  1343. list_splice_init(&cache->invalidation_requests, &list);
  1344. spin_unlock(&cache->invalidation_lock);
  1345. list_for_each_entry_safe (req, tmp, &list, list)
  1346. process_invalidation_request(cache, req);
  1347. }
  1348. /*----------------------------------------------------------------
  1349. * Main worker loop
  1350. *--------------------------------------------------------------*/
  1351. static bool is_quiescing(struct cache *cache)
  1352. {
  1353. return atomic_read(&cache->quiescing);
  1354. }
  1355. static void ack_quiescing(struct cache *cache)
  1356. {
  1357. if (is_quiescing(cache)) {
  1358. atomic_inc(&cache->quiescing_ack);
  1359. wake_up(&cache->quiescing_wait);
  1360. }
  1361. }
  1362. static void wait_for_quiescing_ack(struct cache *cache)
  1363. {
  1364. wait_event(cache->quiescing_wait, atomic_read(&cache->quiescing_ack));
  1365. }
  1366. static void start_quiescing(struct cache *cache)
  1367. {
  1368. atomic_inc(&cache->quiescing);
  1369. wait_for_quiescing_ack(cache);
  1370. }
  1371. static void stop_quiescing(struct cache *cache)
  1372. {
  1373. atomic_set(&cache->quiescing, 0);
  1374. atomic_set(&cache->quiescing_ack, 0);
  1375. }
  1376. static void wait_for_migrations(struct cache *cache)
  1377. {
  1378. wait_event(cache->migration_wait, !atomic_read(&cache->nr_allocated_migrations));
  1379. }
  1380. static void stop_worker(struct cache *cache)
  1381. {
  1382. cancel_delayed_work(&cache->waker);
  1383. flush_workqueue(cache->wq);
  1384. }
  1385. static void requeue_deferred_io(struct cache *cache)
  1386. {
  1387. struct bio *bio;
  1388. struct bio_list bios;
  1389. bio_list_init(&bios);
  1390. bio_list_merge(&bios, &cache->deferred_bios);
  1391. bio_list_init(&cache->deferred_bios);
  1392. while ((bio = bio_list_pop(&bios)))
  1393. bio_endio(bio, DM_ENDIO_REQUEUE);
  1394. }
  1395. static int more_work(struct cache *cache)
  1396. {
  1397. if (is_quiescing(cache))
  1398. return !list_empty(&cache->quiesced_migrations) ||
  1399. !list_empty(&cache->completed_migrations) ||
  1400. !list_empty(&cache->need_commit_migrations);
  1401. else
  1402. return !bio_list_empty(&cache->deferred_bios) ||
  1403. !bio_list_empty(&cache->deferred_flush_bios) ||
  1404. !bio_list_empty(&cache->deferred_writethrough_bios) ||
  1405. !list_empty(&cache->quiesced_migrations) ||
  1406. !list_empty(&cache->completed_migrations) ||
  1407. !list_empty(&cache->need_commit_migrations) ||
  1408. cache->invalidate;
  1409. }
  1410. static void do_worker(struct work_struct *ws)
  1411. {
  1412. struct cache *cache = container_of(ws, struct cache, worker);
  1413. do {
  1414. if (!is_quiescing(cache)) {
  1415. writeback_some_dirty_blocks(cache);
  1416. process_deferred_writethrough_bios(cache);
  1417. process_deferred_bios(cache);
  1418. process_invalidation_requests(cache);
  1419. }
  1420. process_migrations(cache, &cache->quiesced_migrations, issue_copy);
  1421. process_migrations(cache, &cache->completed_migrations, complete_migration);
  1422. if (commit_if_needed(cache)) {
  1423. process_deferred_flush_bios(cache, false);
  1424. process_migrations(cache, &cache->need_commit_migrations, migration_failure);
  1425. /*
  1426. * FIXME: rollback metadata or just go into a
  1427. * failure mode and error everything
  1428. */
  1429. } else {
  1430. process_deferred_flush_bios(cache, true);
  1431. process_migrations(cache, &cache->need_commit_migrations,
  1432. migration_success_post_commit);
  1433. }
  1434. ack_quiescing(cache);
  1435. } while (more_work(cache));
  1436. }
  1437. /*
  1438. * We want to commit periodically so that not too much
  1439. * unwritten metadata builds up.
  1440. */
  1441. static void do_waker(struct work_struct *ws)
  1442. {
  1443. struct cache *cache = container_of(to_delayed_work(ws), struct cache, waker);
  1444. policy_tick(cache->policy);
  1445. wake_worker(cache);
  1446. queue_delayed_work(cache->wq, &cache->waker, COMMIT_PERIOD);
  1447. }
  1448. /*----------------------------------------------------------------*/
  1449. static int is_congested(struct dm_dev *dev, int bdi_bits)
  1450. {
  1451. struct request_queue *q = bdev_get_queue(dev->bdev);
  1452. return bdi_congested(&q->backing_dev_info, bdi_bits);
  1453. }
  1454. static int cache_is_congested(struct dm_target_callbacks *cb, int bdi_bits)
  1455. {
  1456. struct cache *cache = container_of(cb, struct cache, callbacks);
  1457. return is_congested(cache->origin_dev, bdi_bits) ||
  1458. is_congested(cache->cache_dev, bdi_bits);
  1459. }
  1460. /*----------------------------------------------------------------
  1461. * Target methods
  1462. *--------------------------------------------------------------*/
  1463. /*
  1464. * This function gets called on the error paths of the constructor, so we
  1465. * have to cope with a partially initialised struct.
  1466. */
  1467. static void destroy(struct cache *cache)
  1468. {
  1469. unsigned i;
  1470. if (cache->migration_pool)
  1471. mempool_destroy(cache->migration_pool);
  1472. if (cache->all_io_ds)
  1473. dm_deferred_set_destroy(cache->all_io_ds);
  1474. if (cache->prison)
  1475. dm_bio_prison_destroy(cache->prison);
  1476. if (cache->wq)
  1477. destroy_workqueue(cache->wq);
  1478. if (cache->dirty_bitset)
  1479. free_bitset(cache->dirty_bitset);
  1480. if (cache->discard_bitset)
  1481. free_bitset(cache->discard_bitset);
  1482. if (cache->copier)
  1483. dm_kcopyd_client_destroy(cache->copier);
  1484. if (cache->cmd)
  1485. dm_cache_metadata_close(cache->cmd);
  1486. if (cache->metadata_dev)
  1487. dm_put_device(cache->ti, cache->metadata_dev);
  1488. if (cache->origin_dev)
  1489. dm_put_device(cache->ti, cache->origin_dev);
  1490. if (cache->cache_dev)
  1491. dm_put_device(cache->ti, cache->cache_dev);
  1492. if (cache->policy)
  1493. dm_cache_policy_destroy(cache->policy);
  1494. for (i = 0; i < cache->nr_ctr_args ; i++)
  1495. kfree(cache->ctr_args[i]);
  1496. kfree(cache->ctr_args);
  1497. kfree(cache);
  1498. }
  1499. static void cache_dtr(struct dm_target *ti)
  1500. {
  1501. struct cache *cache = ti->private;
  1502. destroy(cache);
  1503. }
  1504. static sector_t get_dev_size(struct dm_dev *dev)
  1505. {
  1506. return i_size_read(dev->bdev->bd_inode) >> SECTOR_SHIFT;
  1507. }
  1508. /*----------------------------------------------------------------*/
  1509. /*
  1510. * Construct a cache device mapping.
  1511. *
  1512. * cache <metadata dev> <cache dev> <origin dev> <block size>
  1513. * <#feature args> [<feature arg>]*
  1514. * <policy> <#policy args> [<policy arg>]*
  1515. *
  1516. * metadata dev : fast device holding the persistent metadata
  1517. * cache dev : fast device holding cached data blocks
  1518. * origin dev : slow device holding original data blocks
  1519. * block size : cache unit size in sectors
  1520. *
  1521. * #feature args : number of feature arguments passed
  1522. * feature args : writethrough. (The default is writeback.)
  1523. *
  1524. * policy : the replacement policy to use
  1525. * #policy args : an even number of policy arguments corresponding
  1526. * to key/value pairs passed to the policy
  1527. * policy args : key/value pairs passed to the policy
  1528. * E.g. 'sequential_threshold 1024'
  1529. * See cache-policies.txt for details.
  1530. *
  1531. * Optional feature arguments are:
  1532. * writethrough : write through caching that prohibits cache block
  1533. * content from being different from origin block content.
  1534. * Without this argument, the default behaviour is to write
  1535. * back cache block contents later for performance reasons,
  1536. * so they may differ from the corresponding origin blocks.
  1537. */
  1538. struct cache_args {
  1539. struct dm_target *ti;
  1540. struct dm_dev *metadata_dev;
  1541. struct dm_dev *cache_dev;
  1542. sector_t cache_sectors;
  1543. struct dm_dev *origin_dev;
  1544. sector_t origin_sectors;
  1545. uint32_t block_size;
  1546. const char *policy_name;
  1547. int policy_argc;
  1548. const char **policy_argv;
  1549. struct cache_features features;
  1550. };
  1551. static void destroy_cache_args(struct cache_args *ca)
  1552. {
  1553. if (ca->metadata_dev)
  1554. dm_put_device(ca->ti, ca->metadata_dev);
  1555. if (ca->cache_dev)
  1556. dm_put_device(ca->ti, ca->cache_dev);
  1557. if (ca->origin_dev)
  1558. dm_put_device(ca->ti, ca->origin_dev);
  1559. kfree(ca);
  1560. }
  1561. static bool at_least_one_arg(struct dm_arg_set *as, char **error)
  1562. {
  1563. if (!as->argc) {
  1564. *error = "Insufficient args";
  1565. return false;
  1566. }
  1567. return true;
  1568. }
  1569. static int parse_metadata_dev(struct cache_args *ca, struct dm_arg_set *as,
  1570. char **error)
  1571. {
  1572. int r;
  1573. sector_t metadata_dev_size;
  1574. char b[BDEVNAME_SIZE];
  1575. if (!at_least_one_arg(as, error))
  1576. return -EINVAL;
  1577. r = dm_get_device(ca->ti, dm_shift_arg(as), FMODE_READ | FMODE_WRITE,
  1578. &ca->metadata_dev);
  1579. if (r) {
  1580. *error = "Error opening metadata device";
  1581. return r;
  1582. }
  1583. metadata_dev_size = get_dev_size(ca->metadata_dev);
  1584. if (metadata_dev_size > DM_CACHE_METADATA_MAX_SECTORS_WARNING)
  1585. DMWARN("Metadata device %s is larger than %u sectors: excess space will not be used.",
  1586. bdevname(ca->metadata_dev->bdev, b), THIN_METADATA_MAX_SECTORS);
  1587. return 0;
  1588. }
  1589. static int parse_cache_dev(struct cache_args *ca, struct dm_arg_set *as,
  1590. char **error)
  1591. {
  1592. int r;
  1593. if (!at_least_one_arg(as, error))
  1594. return -EINVAL;
  1595. r = dm_get_device(ca->ti, dm_shift_arg(as), FMODE_READ | FMODE_WRITE,
  1596. &ca->cache_dev);
  1597. if (r) {
  1598. *error = "Error opening cache device";
  1599. return r;
  1600. }
  1601. ca->cache_sectors = get_dev_size(ca->cache_dev);
  1602. return 0;
  1603. }
  1604. static int parse_origin_dev(struct cache_args *ca, struct dm_arg_set *as,
  1605. char **error)
  1606. {
  1607. int r;
  1608. if (!at_least_one_arg(as, error))
  1609. return -EINVAL;
  1610. r = dm_get_device(ca->ti, dm_shift_arg(as), FMODE_READ | FMODE_WRITE,
  1611. &ca->origin_dev);
  1612. if (r) {
  1613. *error = "Error opening origin device";
  1614. return r;
  1615. }
  1616. ca->origin_sectors = get_dev_size(ca->origin_dev);
  1617. if (ca->ti->len > ca->origin_sectors) {
  1618. *error = "Device size larger than cached device";
  1619. return -EINVAL;
  1620. }
  1621. return 0;
  1622. }
  1623. static int parse_block_size(struct cache_args *ca, struct dm_arg_set *as,
  1624. char **error)
  1625. {
  1626. unsigned long block_size;
  1627. if (!at_least_one_arg(as, error))
  1628. return -EINVAL;
  1629. if (kstrtoul(dm_shift_arg(as), 10, &block_size) || !block_size ||
  1630. block_size < DATA_DEV_BLOCK_SIZE_MIN_SECTORS ||
  1631. block_size > DATA_DEV_BLOCK_SIZE_MAX_SECTORS ||
  1632. block_size & (DATA_DEV_BLOCK_SIZE_MIN_SECTORS - 1)) {
  1633. *error = "Invalid data block size";
  1634. return -EINVAL;
  1635. }
  1636. if (block_size > ca->cache_sectors) {
  1637. *error = "Data block size is larger than the cache device";
  1638. return -EINVAL;
  1639. }
  1640. ca->block_size = block_size;
  1641. return 0;
  1642. }
  1643. static void init_features(struct cache_features *cf)
  1644. {
  1645. cf->mode = CM_WRITE;
  1646. cf->io_mode = CM_IO_WRITEBACK;
  1647. }
  1648. static int parse_features(struct cache_args *ca, struct dm_arg_set *as,
  1649. char **error)
  1650. {
  1651. static struct dm_arg _args[] = {
  1652. {0, 1, "Invalid number of cache feature arguments"},
  1653. };
  1654. int r;
  1655. unsigned argc;
  1656. const char *arg;
  1657. struct cache_features *cf = &ca->features;
  1658. init_features(cf);
  1659. r = dm_read_arg_group(_args, as, &argc, error);
  1660. if (r)
  1661. return -EINVAL;
  1662. while (argc--) {
  1663. arg = dm_shift_arg(as);
  1664. if (!strcasecmp(arg, "writeback"))
  1665. cf->io_mode = CM_IO_WRITEBACK;
  1666. else if (!strcasecmp(arg, "writethrough"))
  1667. cf->io_mode = CM_IO_WRITETHROUGH;
  1668. else if (!strcasecmp(arg, "passthrough"))
  1669. cf->io_mode = CM_IO_PASSTHROUGH;
  1670. else {
  1671. *error = "Unrecognised cache feature requested";
  1672. return -EINVAL;
  1673. }
  1674. }
  1675. return 0;
  1676. }
  1677. static int parse_policy(struct cache_args *ca, struct dm_arg_set *as,
  1678. char **error)
  1679. {
  1680. static struct dm_arg _args[] = {
  1681. {0, 1024, "Invalid number of policy arguments"},
  1682. };
  1683. int r;
  1684. if (!at_least_one_arg(as, error))
  1685. return -EINVAL;
  1686. ca->policy_name = dm_shift_arg(as);
  1687. r = dm_read_arg_group(_args, as, &ca->policy_argc, error);
  1688. if (r)
  1689. return -EINVAL;
  1690. ca->policy_argv = (const char **)as->argv;
  1691. dm_consume_args(as, ca->policy_argc);
  1692. return 0;
  1693. }
  1694. static int parse_cache_args(struct cache_args *ca, int argc, char **argv,
  1695. char **error)
  1696. {
  1697. int r;
  1698. struct dm_arg_set as;
  1699. as.argc = argc;
  1700. as.argv = argv;
  1701. r = parse_metadata_dev(ca, &as, error);
  1702. if (r)
  1703. return r;
  1704. r = parse_cache_dev(ca, &as, error);
  1705. if (r)
  1706. return r;
  1707. r = parse_origin_dev(ca, &as, error);
  1708. if (r)
  1709. return r;
  1710. r = parse_block_size(ca, &as, error);
  1711. if (r)
  1712. return r;
  1713. r = parse_features(ca, &as, error);
  1714. if (r)
  1715. return r;
  1716. r = parse_policy(ca, &as, error);
  1717. if (r)
  1718. return r;
  1719. return 0;
  1720. }
  1721. /*----------------------------------------------------------------*/
  1722. static struct kmem_cache *migration_cache;
  1723. #define NOT_CORE_OPTION 1
  1724. static int process_config_option(struct cache *cache, const char *key, const char *value)
  1725. {
  1726. unsigned long tmp;
  1727. if (!strcasecmp(key, "migration_threshold")) {
  1728. if (kstrtoul(value, 10, &tmp))
  1729. return -EINVAL;
  1730. cache->migration_threshold = tmp;
  1731. return 0;
  1732. }
  1733. return NOT_CORE_OPTION;
  1734. }
  1735. static int set_config_value(struct cache *cache, const char *key, const char *value)
  1736. {
  1737. int r = process_config_option(cache, key, value);
  1738. if (r == NOT_CORE_OPTION)
  1739. r = policy_set_config_value(cache->policy, key, value);
  1740. if (r)
  1741. DMWARN("bad config value for %s: %s", key, value);
  1742. return r;
  1743. }
  1744. static int set_config_values(struct cache *cache, int argc, const char **argv)
  1745. {
  1746. int r = 0;
  1747. if (argc & 1) {
  1748. DMWARN("Odd number of policy arguments given but they should be <key> <value> pairs.");
  1749. return -EINVAL;
  1750. }
  1751. while (argc) {
  1752. r = set_config_value(cache, argv[0], argv[1]);
  1753. if (r)
  1754. break;
  1755. argc -= 2;
  1756. argv += 2;
  1757. }
  1758. return r;
  1759. }
  1760. static int create_cache_policy(struct cache *cache, struct cache_args *ca,
  1761. char **error)
  1762. {
  1763. struct dm_cache_policy *p = dm_cache_policy_create(ca->policy_name,
  1764. cache->cache_size,
  1765. cache->origin_sectors,
  1766. cache->sectors_per_block);
  1767. if (IS_ERR(p)) {
  1768. *error = "Error creating cache's policy";
  1769. return PTR_ERR(p);
  1770. }
  1771. cache->policy = p;
  1772. return 0;
  1773. }
  1774. #define DEFAULT_MIGRATION_THRESHOLD 2048
  1775. static int cache_create(struct cache_args *ca, struct cache **result)
  1776. {
  1777. int r = 0;
  1778. char **error = &ca->ti->error;
  1779. struct cache *cache;
  1780. struct dm_target *ti = ca->ti;
  1781. dm_block_t origin_blocks;
  1782. struct dm_cache_metadata *cmd;
  1783. bool may_format = ca->features.mode == CM_WRITE;
  1784. cache = kzalloc(sizeof(*cache), GFP_KERNEL);
  1785. if (!cache)
  1786. return -ENOMEM;
  1787. cache->ti = ca->ti;
  1788. ti->private = cache;
  1789. ti->num_flush_bios = 2;
  1790. ti->flush_supported = true;
  1791. ti->num_discard_bios = 1;
  1792. ti->discards_supported = true;
  1793. ti->discard_zeroes_data_unsupported = true;
  1794. /* Discard bios must be split on a block boundary */
  1795. ti->split_discard_bios = true;
  1796. cache->features = ca->features;
  1797. ti->per_bio_data_size = get_per_bio_data_size(cache);
  1798. cache->callbacks.congested_fn = cache_is_congested;
  1799. dm_table_add_target_callbacks(ti->table, &cache->callbacks);
  1800. cache->metadata_dev = ca->metadata_dev;
  1801. cache->origin_dev = ca->origin_dev;
  1802. cache->cache_dev = ca->cache_dev;
  1803. ca->metadata_dev = ca->origin_dev = ca->cache_dev = NULL;
  1804. /* FIXME: factor out this whole section */
  1805. origin_blocks = cache->origin_sectors = ca->origin_sectors;
  1806. origin_blocks = block_div(origin_blocks, ca->block_size);
  1807. cache->origin_blocks = to_oblock(origin_blocks);
  1808. cache->sectors_per_block = ca->block_size;
  1809. if (dm_set_target_max_io_len(ti, cache->sectors_per_block)) {
  1810. r = -EINVAL;
  1811. goto bad;
  1812. }
  1813. if (ca->block_size & (ca->block_size - 1)) {
  1814. dm_block_t cache_size = ca->cache_sectors;
  1815. cache->sectors_per_block_shift = -1;
  1816. cache_size = block_div(cache_size, ca->block_size);
  1817. cache->cache_size = to_cblock(cache_size);
  1818. } else {
  1819. cache->sectors_per_block_shift = __ffs(ca->block_size);
  1820. cache->cache_size = to_cblock(ca->cache_sectors >> cache->sectors_per_block_shift);
  1821. }
  1822. r = create_cache_policy(cache, ca, error);
  1823. if (r)
  1824. goto bad;
  1825. cache->policy_nr_args = ca->policy_argc;
  1826. cache->migration_threshold = DEFAULT_MIGRATION_THRESHOLD;
  1827. r = set_config_values(cache, ca->policy_argc, ca->policy_argv);
  1828. if (r) {
  1829. *error = "Error setting cache policy's config values";
  1830. goto bad;
  1831. }
  1832. cmd = dm_cache_metadata_open(cache->metadata_dev->bdev,
  1833. ca->block_size, may_format,
  1834. dm_cache_policy_get_hint_size(cache->policy));
  1835. if (IS_ERR(cmd)) {
  1836. *error = "Error creating metadata object";
  1837. r = PTR_ERR(cmd);
  1838. goto bad;
  1839. }
  1840. cache->cmd = cmd;
  1841. if (passthrough_mode(&cache->features)) {
  1842. bool all_clean;
  1843. r = dm_cache_metadata_all_clean(cache->cmd, &all_clean);
  1844. if (r) {
  1845. *error = "dm_cache_metadata_all_clean() failed";
  1846. goto bad;
  1847. }
  1848. if (!all_clean) {
  1849. *error = "Cannot enter passthrough mode unless all blocks are clean";
  1850. r = -EINVAL;
  1851. goto bad;
  1852. }
  1853. }
  1854. spin_lock_init(&cache->lock);
  1855. bio_list_init(&cache->deferred_bios);
  1856. bio_list_init(&cache->deferred_flush_bios);
  1857. bio_list_init(&cache->deferred_writethrough_bios);
  1858. INIT_LIST_HEAD(&cache->quiesced_migrations);
  1859. INIT_LIST_HEAD(&cache->completed_migrations);
  1860. INIT_LIST_HEAD(&cache->need_commit_migrations);
  1861. atomic_set(&cache->nr_allocated_migrations, 0);
  1862. atomic_set(&cache->nr_io_migrations, 0);
  1863. init_waitqueue_head(&cache->migration_wait);
  1864. init_waitqueue_head(&cache->quiescing_wait);
  1865. atomic_set(&cache->quiescing, 0);
  1866. atomic_set(&cache->quiescing_ack, 0);
  1867. r = -ENOMEM;
  1868. atomic_set(&cache->nr_dirty, 0);
  1869. cache->dirty_bitset = alloc_bitset(from_cblock(cache->cache_size));
  1870. if (!cache->dirty_bitset) {
  1871. *error = "could not allocate dirty bitset";
  1872. goto bad;
  1873. }
  1874. clear_bitset(cache->dirty_bitset, from_cblock(cache->cache_size));
  1875. cache->discard_nr_blocks = cache->origin_blocks;
  1876. cache->discard_bitset = alloc_bitset(from_oblock(cache->discard_nr_blocks));
  1877. if (!cache->discard_bitset) {
  1878. *error = "could not allocate discard bitset";
  1879. goto bad;
  1880. }
  1881. clear_bitset(cache->discard_bitset, from_oblock(cache->discard_nr_blocks));
  1882. cache->copier = dm_kcopyd_client_create(&dm_kcopyd_throttle);
  1883. if (IS_ERR(cache->copier)) {
  1884. *error = "could not create kcopyd client";
  1885. r = PTR_ERR(cache->copier);
  1886. goto bad;
  1887. }
  1888. cache->wq = alloc_ordered_workqueue("dm-" DM_MSG_PREFIX, WQ_MEM_RECLAIM);
  1889. if (!cache->wq) {
  1890. *error = "could not create workqueue for metadata object";
  1891. goto bad;
  1892. }
  1893. INIT_WORK(&cache->worker, do_worker);
  1894. INIT_DELAYED_WORK(&cache->waker, do_waker);
  1895. cache->last_commit_jiffies = jiffies;
  1896. cache->prison = dm_bio_prison_create(PRISON_CELLS);
  1897. if (!cache->prison) {
  1898. *error = "could not create bio prison";
  1899. goto bad;
  1900. }
  1901. cache->all_io_ds = dm_deferred_set_create();
  1902. if (!cache->all_io_ds) {
  1903. *error = "could not create all_io deferred set";
  1904. goto bad;
  1905. }
  1906. cache->migration_pool = mempool_create_slab_pool(MIGRATION_POOL_SIZE,
  1907. migration_cache);
  1908. if (!cache->migration_pool) {
  1909. *error = "Error creating cache's migration mempool";
  1910. goto bad;
  1911. }
  1912. cache->need_tick_bio = true;
  1913. cache->sized = false;
  1914. cache->invalidate = false;
  1915. cache->commit_requested = false;
  1916. cache->loaded_mappings = false;
  1917. cache->loaded_discards = false;
  1918. load_stats(cache);
  1919. atomic_set(&cache->stats.demotion, 0);
  1920. atomic_set(&cache->stats.promotion, 0);
  1921. atomic_set(&cache->stats.copies_avoided, 0);
  1922. atomic_set(&cache->stats.cache_cell_clash, 0);
  1923. atomic_set(&cache->stats.commit_count, 0);
  1924. atomic_set(&cache->stats.discard_count, 0);
  1925. spin_lock_init(&cache->invalidation_lock);
  1926. INIT_LIST_HEAD(&cache->invalidation_requests);
  1927. *result = cache;
  1928. return 0;
  1929. bad:
  1930. destroy(cache);
  1931. return r;
  1932. }
  1933. static int copy_ctr_args(struct cache *cache, int argc, const char **argv)
  1934. {
  1935. unsigned i;
  1936. const char **copy;
  1937. copy = kcalloc(argc, sizeof(*copy), GFP_KERNEL);
  1938. if (!copy)
  1939. return -ENOMEM;
  1940. for (i = 0; i < argc; i++) {
  1941. copy[i] = kstrdup(argv[i], GFP_KERNEL);
  1942. if (!copy[i]) {
  1943. while (i--)
  1944. kfree(copy[i]);
  1945. kfree(copy);
  1946. return -ENOMEM;
  1947. }
  1948. }
  1949. cache->nr_ctr_args = argc;
  1950. cache->ctr_args = copy;
  1951. return 0;
  1952. }
  1953. static int cache_ctr(struct dm_target *ti, unsigned argc, char **argv)
  1954. {
  1955. int r = -EINVAL;
  1956. struct cache_args *ca;
  1957. struct cache *cache = NULL;
  1958. ca = kzalloc(sizeof(*ca), GFP_KERNEL);
  1959. if (!ca) {
  1960. ti->error = "Error allocating memory for cache";
  1961. return -ENOMEM;
  1962. }
  1963. ca->ti = ti;
  1964. r = parse_cache_args(ca, argc, argv, &ti->error);
  1965. if (r)
  1966. goto out;
  1967. r = cache_create(ca, &cache);
  1968. if (r)
  1969. goto out;
  1970. r = copy_ctr_args(cache, argc - 3, (const char **)argv + 3);
  1971. if (r) {
  1972. destroy(cache);
  1973. goto out;
  1974. }
  1975. ti->private = cache;
  1976. out:
  1977. destroy_cache_args(ca);
  1978. return r;
  1979. }
  1980. static int __cache_map(struct cache *cache, struct bio *bio, struct dm_bio_prison_cell **cell)
  1981. {
  1982. int r;
  1983. dm_oblock_t block = get_bio_block(cache, bio);
  1984. size_t pb_data_size = get_per_bio_data_size(cache);
  1985. bool can_migrate = false;
  1986. bool discarded_block;
  1987. struct policy_result lookup_result;
  1988. struct per_bio_data *pb = init_per_bio_data(bio, pb_data_size);
  1989. if (unlikely(from_oblock(block) >= from_oblock(cache->origin_blocks))) {
  1990. /*
  1991. * This can only occur if the io goes to a partial block at
  1992. * the end of the origin device. We don't cache these.
  1993. * Just remap to the origin and carry on.
  1994. */
  1995. remap_to_origin(cache, bio);
  1996. return DM_MAPIO_REMAPPED;
  1997. }
  1998. if (bio->bi_rw & (REQ_FLUSH | REQ_FUA | REQ_DISCARD)) {
  1999. defer_bio(cache, bio);
  2000. return DM_MAPIO_SUBMITTED;
  2001. }
  2002. /*
  2003. * Check to see if that block is currently migrating.
  2004. */
  2005. *cell = alloc_prison_cell(cache);
  2006. if (!*cell) {
  2007. defer_bio(cache, bio);
  2008. return DM_MAPIO_SUBMITTED;
  2009. }
  2010. r = bio_detain(cache, block, bio, *cell,
  2011. (cell_free_fn) free_prison_cell,
  2012. cache, cell);
  2013. if (r) {
  2014. if (r < 0)
  2015. defer_bio(cache, bio);
  2016. return DM_MAPIO_SUBMITTED;
  2017. }
  2018. discarded_block = is_discarded_oblock(cache, block);
  2019. r = policy_map(cache->policy, block, false, can_migrate, discarded_block,
  2020. bio, &lookup_result);
  2021. if (r == -EWOULDBLOCK) {
  2022. cell_defer(cache, *cell, true);
  2023. return DM_MAPIO_SUBMITTED;
  2024. } else if (r) {
  2025. DMERR_LIMIT("Unexpected return from cache replacement policy: %d", r);
  2026. cell_defer(cache, *cell, false);
  2027. bio_io_error(bio);
  2028. return DM_MAPIO_SUBMITTED;
  2029. }
  2030. r = DM_MAPIO_REMAPPED;
  2031. switch (lookup_result.op) {
  2032. case POLICY_HIT:
  2033. if (passthrough_mode(&cache->features)) {
  2034. if (bio_data_dir(bio) == WRITE) {
  2035. /*
  2036. * We need to invalidate this block, so
  2037. * defer for the worker thread.
  2038. */
  2039. cell_defer(cache, *cell, true);
  2040. r = DM_MAPIO_SUBMITTED;
  2041. } else {
  2042. inc_miss_counter(cache, bio);
  2043. remap_to_origin_clear_discard(cache, bio, block);
  2044. }
  2045. } else {
  2046. inc_hit_counter(cache, bio);
  2047. if (bio_data_dir(bio) == WRITE && writethrough_mode(&cache->features) &&
  2048. !is_dirty(cache, lookup_result.cblock))
  2049. remap_to_origin_then_cache(cache, bio, block, lookup_result.cblock);
  2050. else
  2051. remap_to_cache_dirty(cache, bio, block, lookup_result.cblock);
  2052. }
  2053. break;
  2054. case POLICY_MISS:
  2055. inc_miss_counter(cache, bio);
  2056. if (pb->req_nr != 0) {
  2057. /*
  2058. * This is a duplicate writethrough io that is no
  2059. * longer needed because the block has been demoted.
  2060. */
  2061. bio_endio(bio, 0);
  2062. cell_defer(cache, *cell, false);
  2063. r = DM_MAPIO_SUBMITTED;
  2064. } else
  2065. remap_to_origin_clear_discard(cache, bio, block);
  2066. break;
  2067. default:
  2068. DMERR_LIMIT("%s: erroring bio: unknown policy op: %u", __func__,
  2069. (unsigned) lookup_result.op);
  2070. cell_defer(cache, *cell, false);
  2071. bio_io_error(bio);
  2072. r = DM_MAPIO_SUBMITTED;
  2073. }
  2074. return r;
  2075. }
  2076. static int cache_map(struct dm_target *ti, struct bio *bio)
  2077. {
  2078. int r;
  2079. struct dm_bio_prison_cell *cell = NULL;
  2080. struct cache *cache = ti->private;
  2081. r = __cache_map(cache, bio, &cell);
  2082. if (r == DM_MAPIO_REMAPPED && cell) {
  2083. inc_ds(cache, bio, cell);
  2084. cell_defer(cache, cell, false);
  2085. }
  2086. return r;
  2087. }
  2088. static int cache_end_io(struct dm_target *ti, struct bio *bio, int error)
  2089. {
  2090. struct cache *cache = ti->private;
  2091. unsigned long flags;
  2092. size_t pb_data_size = get_per_bio_data_size(cache);
  2093. struct per_bio_data *pb = get_per_bio_data(bio, pb_data_size);
  2094. if (pb->tick) {
  2095. policy_tick(cache->policy);
  2096. spin_lock_irqsave(&cache->lock, flags);
  2097. cache->need_tick_bio = true;
  2098. spin_unlock_irqrestore(&cache->lock, flags);
  2099. }
  2100. check_for_quiesced_migrations(cache, pb);
  2101. return 0;
  2102. }
  2103. static int write_dirty_bitset(struct cache *cache)
  2104. {
  2105. unsigned i, r;
  2106. for (i = 0; i < from_cblock(cache->cache_size); i++) {
  2107. r = dm_cache_set_dirty(cache->cmd, to_cblock(i),
  2108. is_dirty(cache, to_cblock(i)));
  2109. if (r)
  2110. return r;
  2111. }
  2112. return 0;
  2113. }
  2114. static int write_discard_bitset(struct cache *cache)
  2115. {
  2116. unsigned i, r;
  2117. r = dm_cache_discard_bitset_resize(cache->cmd, cache->sectors_per_block,
  2118. cache->origin_blocks);
  2119. if (r) {
  2120. DMERR("could not resize on-disk discard bitset");
  2121. return r;
  2122. }
  2123. for (i = 0; i < from_oblock(cache->discard_nr_blocks); i++) {
  2124. r = dm_cache_set_discard(cache->cmd, to_oblock(i),
  2125. is_discarded(cache, to_oblock(i)));
  2126. if (r)
  2127. return r;
  2128. }
  2129. return 0;
  2130. }
  2131. /*
  2132. * returns true on success
  2133. */
  2134. static bool sync_metadata(struct cache *cache)
  2135. {
  2136. int r1, r2, r3, r4;
  2137. r1 = write_dirty_bitset(cache);
  2138. if (r1)
  2139. DMERR("could not write dirty bitset");
  2140. r2 = write_discard_bitset(cache);
  2141. if (r2)
  2142. DMERR("could not write discard bitset");
  2143. save_stats(cache);
  2144. r3 = dm_cache_write_hints(cache->cmd, cache->policy);
  2145. if (r3)
  2146. DMERR("could not write hints");
  2147. /*
  2148. * If writing the above metadata failed, we still commit, but don't
  2149. * set the clean shutdown flag. This will effectively force every
  2150. * dirty bit to be set on reload.
  2151. */
  2152. r4 = dm_cache_commit(cache->cmd, !r1 && !r2 && !r3);
  2153. if (r4)
  2154. DMERR("could not write cache metadata. Data loss may occur.");
  2155. return !r1 && !r2 && !r3 && !r4;
  2156. }
  2157. static void cache_postsuspend(struct dm_target *ti)
  2158. {
  2159. struct cache *cache = ti->private;
  2160. start_quiescing(cache);
  2161. wait_for_migrations(cache);
  2162. stop_worker(cache);
  2163. requeue_deferred_io(cache);
  2164. stop_quiescing(cache);
  2165. (void) sync_metadata(cache);
  2166. }
  2167. static int load_mapping(void *context, dm_oblock_t oblock, dm_cblock_t cblock,
  2168. bool dirty, uint32_t hint, bool hint_valid)
  2169. {
  2170. int r;
  2171. struct cache *cache = context;
  2172. r = policy_load_mapping(cache->policy, oblock, cblock, hint, hint_valid);
  2173. if (r)
  2174. return r;
  2175. if (dirty)
  2176. set_dirty(cache, oblock, cblock);
  2177. else
  2178. clear_dirty(cache, oblock, cblock);
  2179. return 0;
  2180. }
  2181. static int load_discard(void *context, sector_t discard_block_size,
  2182. dm_oblock_t oblock, bool discard)
  2183. {
  2184. struct cache *cache = context;
  2185. if (discard)
  2186. set_discard(cache, oblock);
  2187. else
  2188. clear_discard(cache, oblock);
  2189. return 0;
  2190. }
  2191. static dm_cblock_t get_cache_dev_size(struct cache *cache)
  2192. {
  2193. sector_t size = get_dev_size(cache->cache_dev);
  2194. (void) sector_div(size, cache->sectors_per_block);
  2195. return to_cblock(size);
  2196. }
  2197. static bool can_resize(struct cache *cache, dm_cblock_t new_size)
  2198. {
  2199. if (from_cblock(new_size) > from_cblock(cache->cache_size))
  2200. return true;
  2201. /*
  2202. * We can't drop a dirty block when shrinking the cache.
  2203. */
  2204. while (from_cblock(new_size) < from_cblock(cache->cache_size)) {
  2205. new_size = to_cblock(from_cblock(new_size) + 1);
  2206. if (is_dirty(cache, new_size)) {
  2207. DMERR("unable to shrink cache; cache block %llu is dirty",
  2208. (unsigned long long) from_cblock(new_size));
  2209. return false;
  2210. }
  2211. }
  2212. return true;
  2213. }
  2214. static int resize_cache_dev(struct cache *cache, dm_cblock_t new_size)
  2215. {
  2216. int r;
  2217. r = dm_cache_resize(cache->cmd, new_size);
  2218. if (r) {
  2219. DMERR("could not resize cache metadata");
  2220. return r;
  2221. }
  2222. cache->cache_size = new_size;
  2223. return 0;
  2224. }
  2225. static int cache_preresume(struct dm_target *ti)
  2226. {
  2227. int r = 0;
  2228. struct cache *cache = ti->private;
  2229. dm_cblock_t csize = get_cache_dev_size(cache);
  2230. /*
  2231. * Check to see if the cache has resized.
  2232. */
  2233. if (!cache->sized) {
  2234. r = resize_cache_dev(cache, csize);
  2235. if (r)
  2236. return r;
  2237. cache->sized = true;
  2238. } else if (csize != cache->cache_size) {
  2239. if (!can_resize(cache, csize))
  2240. return -EINVAL;
  2241. r = resize_cache_dev(cache, csize);
  2242. if (r)
  2243. return r;
  2244. }
  2245. if (!cache->loaded_mappings) {
  2246. r = dm_cache_load_mappings(cache->cmd, cache->policy,
  2247. load_mapping, cache);
  2248. if (r) {
  2249. DMERR("could not load cache mappings");
  2250. return r;
  2251. }
  2252. cache->loaded_mappings = true;
  2253. }
  2254. if (!cache->loaded_discards) {
  2255. r = dm_cache_load_discards(cache->cmd, load_discard, cache);
  2256. if (r) {
  2257. DMERR("could not load origin discards");
  2258. return r;
  2259. }
  2260. cache->loaded_discards = true;
  2261. }
  2262. return r;
  2263. }
  2264. static void cache_resume(struct dm_target *ti)
  2265. {
  2266. struct cache *cache = ti->private;
  2267. cache->need_tick_bio = true;
  2268. do_waker(&cache->waker.work);
  2269. }
  2270. /*
  2271. * Status format:
  2272. *
  2273. * <metadata block size> <#used metadata blocks>/<#total metadata blocks>
  2274. * <cache block size> <#used cache blocks>/<#total cache blocks>
  2275. * <#read hits> <#read misses> <#write hits> <#write misses>
  2276. * <#demotions> <#promotions> <#dirty>
  2277. * <#features> <features>*
  2278. * <#core args> <core args>
  2279. * <policy name> <#policy args> <policy args>*
  2280. */
  2281. static void cache_status(struct dm_target *ti, status_type_t type,
  2282. unsigned status_flags, char *result, unsigned maxlen)
  2283. {
  2284. int r = 0;
  2285. unsigned i;
  2286. ssize_t sz = 0;
  2287. dm_block_t nr_free_blocks_metadata = 0;
  2288. dm_block_t nr_blocks_metadata = 0;
  2289. char buf[BDEVNAME_SIZE];
  2290. struct cache *cache = ti->private;
  2291. dm_cblock_t residency;
  2292. switch (type) {
  2293. case STATUSTYPE_INFO:
  2294. /* Commit to ensure statistics aren't out-of-date */
  2295. if (!(status_flags & DM_STATUS_NOFLUSH_FLAG) && !dm_suspended(ti)) {
  2296. r = dm_cache_commit(cache->cmd, false);
  2297. if (r)
  2298. DMERR("could not commit metadata for accurate status");
  2299. }
  2300. r = dm_cache_get_free_metadata_block_count(cache->cmd,
  2301. &nr_free_blocks_metadata);
  2302. if (r) {
  2303. DMERR("could not get metadata free block count");
  2304. goto err;
  2305. }
  2306. r = dm_cache_get_metadata_dev_size(cache->cmd, &nr_blocks_metadata);
  2307. if (r) {
  2308. DMERR("could not get metadata device size");
  2309. goto err;
  2310. }
  2311. residency = policy_residency(cache->policy);
  2312. DMEMIT("%u %llu/%llu %u %llu/%llu %u %u %u %u %u %u %lu ",
  2313. (unsigned)DM_CACHE_METADATA_BLOCK_SIZE,
  2314. (unsigned long long)(nr_blocks_metadata - nr_free_blocks_metadata),
  2315. (unsigned long long)nr_blocks_metadata,
  2316. cache->sectors_per_block,
  2317. (unsigned long long) from_cblock(residency),
  2318. (unsigned long long) from_cblock(cache->cache_size),
  2319. (unsigned) atomic_read(&cache->stats.read_hit),
  2320. (unsigned) atomic_read(&cache->stats.read_miss),
  2321. (unsigned) atomic_read(&cache->stats.write_hit),
  2322. (unsigned) atomic_read(&cache->stats.write_miss),
  2323. (unsigned) atomic_read(&cache->stats.demotion),
  2324. (unsigned) atomic_read(&cache->stats.promotion),
  2325. (unsigned long) atomic_read(&cache->nr_dirty));
  2326. if (writethrough_mode(&cache->features))
  2327. DMEMIT("1 writethrough ");
  2328. else if (passthrough_mode(&cache->features))
  2329. DMEMIT("1 passthrough ");
  2330. else if (writeback_mode(&cache->features))
  2331. DMEMIT("1 writeback ");
  2332. else {
  2333. DMERR("internal error: unknown io mode: %d", (int) cache->features.io_mode);
  2334. goto err;
  2335. }
  2336. DMEMIT("2 migration_threshold %llu ", (unsigned long long) cache->migration_threshold);
  2337. DMEMIT("%s ", dm_cache_policy_get_name(cache->policy));
  2338. if (sz < maxlen) {
  2339. r = policy_emit_config_values(cache->policy, result + sz, maxlen - sz);
  2340. if (r)
  2341. DMERR("policy_emit_config_values returned %d", r);
  2342. }
  2343. break;
  2344. case STATUSTYPE_TABLE:
  2345. format_dev_t(buf, cache->metadata_dev->bdev->bd_dev);
  2346. DMEMIT("%s ", buf);
  2347. format_dev_t(buf, cache->cache_dev->bdev->bd_dev);
  2348. DMEMIT("%s ", buf);
  2349. format_dev_t(buf, cache->origin_dev->bdev->bd_dev);
  2350. DMEMIT("%s", buf);
  2351. for (i = 0; i < cache->nr_ctr_args - 1; i++)
  2352. DMEMIT(" %s", cache->ctr_args[i]);
  2353. if (cache->nr_ctr_args)
  2354. DMEMIT(" %s", cache->ctr_args[cache->nr_ctr_args - 1]);
  2355. }
  2356. return;
  2357. err:
  2358. DMEMIT("Error");
  2359. }
  2360. /*
  2361. * A cache block range can take two forms:
  2362. *
  2363. * i) A single cblock, eg. '3456'
  2364. * ii) A begin and end cblock with dots between, eg. 123-234
  2365. */
  2366. static int parse_cblock_range(struct cache *cache, const char *str,
  2367. struct cblock_range *result)
  2368. {
  2369. char dummy;
  2370. uint64_t b, e;
  2371. int r;
  2372. /*
  2373. * Try and parse form (ii) first.
  2374. */
  2375. r = sscanf(str, "%llu-%llu%c", &b, &e, &dummy);
  2376. if (r < 0)
  2377. return r;
  2378. if (r == 2) {
  2379. result->begin = to_cblock(b);
  2380. result->end = to_cblock(e);
  2381. return 0;
  2382. }
  2383. /*
  2384. * That didn't work, try form (i).
  2385. */
  2386. r = sscanf(str, "%llu%c", &b, &dummy);
  2387. if (r < 0)
  2388. return r;
  2389. if (r == 1) {
  2390. result->begin = to_cblock(b);
  2391. result->end = to_cblock(from_cblock(result->begin) + 1u);
  2392. return 0;
  2393. }
  2394. DMERR("invalid cblock range '%s'", str);
  2395. return -EINVAL;
  2396. }
  2397. static int validate_cblock_range(struct cache *cache, struct cblock_range *range)
  2398. {
  2399. uint64_t b = from_cblock(range->begin);
  2400. uint64_t e = from_cblock(range->end);
  2401. uint64_t n = from_cblock(cache->cache_size);
  2402. if (b >= n) {
  2403. DMERR("begin cblock out of range: %llu >= %llu", b, n);
  2404. return -EINVAL;
  2405. }
  2406. if (e > n) {
  2407. DMERR("end cblock out of range: %llu > %llu", e, n);
  2408. return -EINVAL;
  2409. }
  2410. if (b >= e) {
  2411. DMERR("invalid cblock range: %llu >= %llu", b, e);
  2412. return -EINVAL;
  2413. }
  2414. return 0;
  2415. }
  2416. static int request_invalidation(struct cache *cache, struct cblock_range *range)
  2417. {
  2418. struct invalidation_request req;
  2419. INIT_LIST_HEAD(&req.list);
  2420. req.cblocks = range;
  2421. atomic_set(&req.complete, 0);
  2422. req.err = 0;
  2423. init_waitqueue_head(&req.result_wait);
  2424. spin_lock(&cache->invalidation_lock);
  2425. list_add(&req.list, &cache->invalidation_requests);
  2426. spin_unlock(&cache->invalidation_lock);
  2427. wake_worker(cache);
  2428. wait_event(req.result_wait, atomic_read(&req.complete));
  2429. return req.err;
  2430. }
  2431. static int process_invalidate_cblocks_message(struct cache *cache, unsigned count,
  2432. const char **cblock_ranges)
  2433. {
  2434. int r = 0;
  2435. unsigned i;
  2436. struct cblock_range range;
  2437. if (!passthrough_mode(&cache->features)) {
  2438. DMERR("cache has to be in passthrough mode for invalidation");
  2439. return -EPERM;
  2440. }
  2441. for (i = 0; i < count; i++) {
  2442. r = parse_cblock_range(cache, cblock_ranges[i], &range);
  2443. if (r)
  2444. break;
  2445. r = validate_cblock_range(cache, &range);
  2446. if (r)
  2447. break;
  2448. /*
  2449. * Pass begin and end origin blocks to the worker and wake it.
  2450. */
  2451. r = request_invalidation(cache, &range);
  2452. if (r)
  2453. break;
  2454. }
  2455. return r;
  2456. }
  2457. /*
  2458. * Supports
  2459. * "<key> <value>"
  2460. * and
  2461. * "invalidate_cblocks [(<begin>)|(<begin>-<end>)]*
  2462. *
  2463. * The key migration_threshold is supported by the cache target core.
  2464. */
  2465. static int cache_message(struct dm_target *ti, unsigned argc, char **argv)
  2466. {
  2467. struct cache *cache = ti->private;
  2468. if (!argc)
  2469. return -EINVAL;
  2470. if (!strcasecmp(argv[0], "invalidate_cblocks"))
  2471. return process_invalidate_cblocks_message(cache, argc - 1, (const char **) argv + 1);
  2472. if (argc != 2)
  2473. return -EINVAL;
  2474. return set_config_value(cache, argv[0], argv[1]);
  2475. }
  2476. static int cache_iterate_devices(struct dm_target *ti,
  2477. iterate_devices_callout_fn fn, void *data)
  2478. {
  2479. int r = 0;
  2480. struct cache *cache = ti->private;
  2481. r = fn(ti, cache->cache_dev, 0, get_dev_size(cache->cache_dev), data);
  2482. if (!r)
  2483. r = fn(ti, cache->origin_dev, 0, ti->len, data);
  2484. return r;
  2485. }
  2486. /*
  2487. * We assume I/O is going to the origin (which is the volume
  2488. * more likely to have restrictions e.g. by being striped).
  2489. * (Looking up the exact location of the data would be expensive
  2490. * and could always be out of date by the time the bio is submitted.)
  2491. */
  2492. static int cache_bvec_merge(struct dm_target *ti,
  2493. struct bvec_merge_data *bvm,
  2494. struct bio_vec *biovec, int max_size)
  2495. {
  2496. struct cache *cache = ti->private;
  2497. struct request_queue *q = bdev_get_queue(cache->origin_dev->bdev);
  2498. if (!q->merge_bvec_fn)
  2499. return max_size;
  2500. bvm->bi_bdev = cache->origin_dev->bdev;
  2501. return min(max_size, q->merge_bvec_fn(q, bvm, biovec));
  2502. }
  2503. static void set_discard_limits(struct cache *cache, struct queue_limits *limits)
  2504. {
  2505. /*
  2506. * FIXME: these limits may be incompatible with the cache device
  2507. */
  2508. limits->max_discard_sectors = cache->sectors_per_block;
  2509. limits->discard_granularity = cache->sectors_per_block << SECTOR_SHIFT;
  2510. }
  2511. static void cache_io_hints(struct dm_target *ti, struct queue_limits *limits)
  2512. {
  2513. struct cache *cache = ti->private;
  2514. uint64_t io_opt_sectors = limits->io_opt >> SECTOR_SHIFT;
  2515. /*
  2516. * If the system-determined stacked limits are compatible with the
  2517. * cache's blocksize (io_opt is a factor) do not override them.
  2518. */
  2519. if (io_opt_sectors < cache->sectors_per_block ||
  2520. do_div(io_opt_sectors, cache->sectors_per_block)) {
  2521. blk_limits_io_min(limits, cache->sectors_per_block << SECTOR_SHIFT);
  2522. blk_limits_io_opt(limits, cache->sectors_per_block << SECTOR_SHIFT);
  2523. }
  2524. set_discard_limits(cache, limits);
  2525. }
  2526. /*----------------------------------------------------------------*/
  2527. static struct target_type cache_target = {
  2528. .name = "cache",
  2529. .version = {1, 5, 0},
  2530. .module = THIS_MODULE,
  2531. .ctr = cache_ctr,
  2532. .dtr = cache_dtr,
  2533. .map = cache_map,
  2534. .end_io = cache_end_io,
  2535. .postsuspend = cache_postsuspend,
  2536. .preresume = cache_preresume,
  2537. .resume = cache_resume,
  2538. .status = cache_status,
  2539. .message = cache_message,
  2540. .iterate_devices = cache_iterate_devices,
  2541. .merge = cache_bvec_merge,
  2542. .io_hints = cache_io_hints,
  2543. };
  2544. static int __init dm_cache_init(void)
  2545. {
  2546. int r;
  2547. r = dm_register_target(&cache_target);
  2548. if (r) {
  2549. DMERR("cache target registration failed: %d", r);
  2550. return r;
  2551. }
  2552. migration_cache = KMEM_CACHE(dm_cache_migration, 0);
  2553. if (!migration_cache) {
  2554. dm_unregister_target(&cache_target);
  2555. return -ENOMEM;
  2556. }
  2557. return 0;
  2558. }
  2559. static void __exit dm_cache_exit(void)
  2560. {
  2561. dm_unregister_target(&cache_target);
  2562. kmem_cache_destroy(migration_cache);
  2563. }
  2564. module_init(dm_cache_init);
  2565. module_exit(dm_cache_exit);
  2566. MODULE_DESCRIPTION(DM_NAME " cache target");
  2567. MODULE_AUTHOR("Joe Thornber <ejt@redhat.com>");
  2568. MODULE_LICENSE("GPL");