dm-integrity.c 159 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (C) 2016-2017 Red Hat, Inc. All rights reserved.
  4. * Copyright (C) 2016-2017 Milan Broz
  5. * Copyright (C) 2016-2017 Mikulas Patocka
  6. *
  7. * This file is released under the GPL.
  8. */
  9. #include "dm-bio-record.h"
  10. #include <linux/compiler.h>
  11. #include <linux/module.h>
  12. #include <linux/device-mapper.h>
  13. #include <linux/dm-io.h>
  14. #include <linux/vmalloc.h>
  15. #include <linux/sort.h>
  16. #include <linux/rbtree.h>
  17. #include <linux/delay.h>
  18. #include <linux/hex.h>
  19. #include <linux/random.h>
  20. #include <linux/reboot.h>
  21. #include <crypto/hash.h>
  22. #include <crypto/skcipher.h>
  23. #include <crypto/utils.h>
  24. #include <linux/async_tx.h>
  25. #include <linux/dm-bufio.h>
  26. #include "dm-audit.h"
  27. #define DM_MSG_PREFIX "integrity"
  28. #define DEFAULT_INTERLEAVE_SECTORS 32768
  29. #define DEFAULT_JOURNAL_SIZE_FACTOR 7
  30. #define DEFAULT_SECTORS_PER_BITMAP_BIT 32768
  31. #define DEFAULT_BUFFER_SECTORS 128
  32. #define DEFAULT_JOURNAL_WATERMARK 50
  33. #define DEFAULT_SYNC_MSEC 10000
  34. #define DEFAULT_MAX_JOURNAL_SECTORS (IS_ENABLED(CONFIG_64BIT) ? 131072 : 8192)
  35. #define MIN_LOG2_INTERLEAVE_SECTORS 3
  36. #define MAX_LOG2_INTERLEAVE_SECTORS 31
  37. #define METADATA_WORKQUEUE_MAX_ACTIVE 16
  38. #define RECALC_SECTORS (IS_ENABLED(CONFIG_64BIT) ? 32768 : 2048)
  39. #define RECALC_WRITE_SUPER 16
  40. #define BITMAP_BLOCK_SIZE 4096 /* don't change it */
  41. #define BITMAP_FLUSH_INTERVAL (10 * HZ)
  42. #define DISCARD_FILLER 0xf6
  43. #define SALT_SIZE 16
  44. #define RECHECK_POOL_SIZE 256
  45. /*
  46. * Warning - DEBUG_PRINT prints security-sensitive data to the log,
  47. * so it should not be enabled in the official kernel
  48. */
  49. //#define DEBUG_PRINT
  50. //#define INTERNAL_VERIFY
  51. /*
  52. * On disk structures
  53. */
  54. #define SB_MAGIC "integrt"
  55. #define SB_VERSION_1 1
  56. #define SB_VERSION_2 2
  57. #define SB_VERSION_3 3
  58. #define SB_VERSION_4 4
  59. #define SB_VERSION_5 5
  60. #define SB_VERSION_6 6
  61. #define SB_SECTORS 8
  62. #define MAX_SECTORS_PER_BLOCK 8
  63. struct superblock {
  64. __u8 magic[8];
  65. __u8 version;
  66. __u8 log2_interleave_sectors;
  67. __le16 integrity_tag_size;
  68. __le32 journal_sections;
  69. __le64 provided_data_sectors; /* userspace uses this value */
  70. __le32 flags;
  71. __u8 log2_sectors_per_block;
  72. __u8 log2_blocks_per_bitmap_bit;
  73. __u8 pad[2];
  74. __le64 recalc_sector;
  75. __u8 pad2[8];
  76. __u8 salt[SALT_SIZE];
  77. };
  78. #define SB_FLAG_HAVE_JOURNAL_MAC 0x1
  79. #define SB_FLAG_RECALCULATING 0x2
  80. #define SB_FLAG_DIRTY_BITMAP 0x4
  81. #define SB_FLAG_FIXED_PADDING 0x8
  82. #define SB_FLAG_FIXED_HMAC 0x10
  83. #define SB_FLAG_INLINE 0x20
  84. #define JOURNAL_ENTRY_ROUNDUP 8
  85. typedef __le64 commit_id_t;
  86. #define JOURNAL_MAC_PER_SECTOR 8
  87. struct journal_entry {
  88. union {
  89. struct {
  90. __le32 sector_lo;
  91. __le32 sector_hi;
  92. } s;
  93. __le64 sector;
  94. } u;
  95. commit_id_t last_bytes[];
  96. /* __u8 tag[0]; */
  97. };
  98. #define journal_entry_tag(ic, je) ((__u8 *)&(je)->last_bytes[(ic)->sectors_per_block])
  99. #if BITS_PER_LONG == 64
  100. #define journal_entry_set_sector(je, x) do { smp_wmb(); WRITE_ONCE((je)->u.sector, cpu_to_le64(x)); } while (0)
  101. #else
  102. #define journal_entry_set_sector(je, x) do { (je)->u.s.sector_lo = cpu_to_le32(x); smp_wmb(); WRITE_ONCE((je)->u.s.sector_hi, cpu_to_le32((x) >> 32)); } while (0)
  103. #endif
  104. #define journal_entry_get_sector(je) le64_to_cpu((je)->u.sector)
  105. #define journal_entry_is_unused(je) ((je)->u.s.sector_hi == cpu_to_le32(-1))
  106. #define journal_entry_set_unused(je) ((je)->u.s.sector_hi = cpu_to_le32(-1))
  107. #define journal_entry_is_inprogress(je) ((je)->u.s.sector_hi == cpu_to_le32(-2))
  108. #define journal_entry_set_inprogress(je) ((je)->u.s.sector_hi = cpu_to_le32(-2))
  109. #define JOURNAL_BLOCK_SECTORS 8
  110. #define JOURNAL_SECTOR_DATA ((1 << SECTOR_SHIFT) - sizeof(commit_id_t))
  111. #define JOURNAL_MAC_SIZE (JOURNAL_MAC_PER_SECTOR * JOURNAL_BLOCK_SECTORS)
  112. struct journal_sector {
  113. struct_group(sectors,
  114. __u8 entries[JOURNAL_SECTOR_DATA - JOURNAL_MAC_PER_SECTOR];
  115. __u8 mac[JOURNAL_MAC_PER_SECTOR];
  116. );
  117. commit_id_t commit_id;
  118. };
  119. #define MAX_TAG_SIZE 255
  120. #define METADATA_PADDING_SECTORS 8
  121. #define N_COMMIT_IDS 4
  122. static unsigned char prev_commit_seq(unsigned char seq)
  123. {
  124. return (seq + N_COMMIT_IDS - 1) % N_COMMIT_IDS;
  125. }
  126. static unsigned char next_commit_seq(unsigned char seq)
  127. {
  128. return (seq + 1) % N_COMMIT_IDS;
  129. }
  130. /*
  131. * In-memory structures
  132. */
  133. struct journal_node {
  134. struct rb_node node;
  135. sector_t sector;
  136. };
  137. struct alg_spec {
  138. char *alg_string;
  139. char *key_string;
  140. __u8 *key;
  141. unsigned int key_size;
  142. };
  143. struct dm_integrity_c {
  144. struct dm_dev *dev;
  145. struct dm_dev *meta_dev;
  146. unsigned int tag_size;
  147. __s8 log2_tag_size;
  148. unsigned int tuple_size;
  149. sector_t start;
  150. mempool_t journal_io_mempool;
  151. struct dm_io_client *io;
  152. struct dm_bufio_client *bufio;
  153. struct workqueue_struct *metadata_wq;
  154. struct superblock *sb;
  155. unsigned int journal_pages;
  156. unsigned int n_bitmap_blocks;
  157. struct page_list *journal;
  158. struct page_list *journal_io;
  159. struct page_list *journal_xor;
  160. struct page_list *recalc_bitmap;
  161. struct page_list *may_write_bitmap;
  162. struct bitmap_block_status *bbs;
  163. unsigned int bitmap_flush_interval;
  164. int synchronous_mode;
  165. struct bio_list synchronous_bios;
  166. struct delayed_work bitmap_flush_work;
  167. struct crypto_skcipher *journal_crypt;
  168. struct scatterlist **journal_scatterlist;
  169. struct scatterlist **journal_io_scatterlist;
  170. struct skcipher_request **sk_requests;
  171. struct crypto_shash *journal_mac;
  172. struct journal_node *journal_tree;
  173. struct rb_root journal_tree_root;
  174. sector_t provided_data_sectors;
  175. unsigned short journal_entry_size;
  176. unsigned char journal_entries_per_sector;
  177. unsigned char journal_section_entries;
  178. unsigned short journal_section_sectors;
  179. unsigned int journal_sections;
  180. unsigned int journal_entries;
  181. sector_t data_device_sectors;
  182. sector_t meta_device_sectors;
  183. unsigned int initial_sectors;
  184. unsigned int metadata_run;
  185. __s8 log2_metadata_run;
  186. __u8 log2_buffer_sectors;
  187. __u8 sectors_per_block;
  188. __u8 log2_blocks_per_bitmap_bit;
  189. unsigned char mode;
  190. bool internal_hash;
  191. int failed;
  192. struct crypto_shash *internal_shash;
  193. struct crypto_ahash *internal_ahash;
  194. unsigned int internal_hash_digestsize;
  195. struct dm_target *ti;
  196. /* these variables are locked with endio_wait.lock */
  197. struct rb_root in_progress;
  198. struct list_head wait_list;
  199. wait_queue_head_t endio_wait;
  200. struct workqueue_struct *wait_wq;
  201. struct workqueue_struct *offload_wq;
  202. unsigned char commit_seq;
  203. commit_id_t commit_ids[N_COMMIT_IDS];
  204. unsigned int committed_section;
  205. unsigned int n_committed_sections;
  206. unsigned int uncommitted_section;
  207. unsigned int n_uncommitted_sections;
  208. unsigned int free_section;
  209. unsigned char free_section_entry;
  210. unsigned int free_sectors;
  211. unsigned int free_sectors_threshold;
  212. struct workqueue_struct *commit_wq;
  213. struct work_struct commit_work;
  214. struct workqueue_struct *writer_wq;
  215. struct work_struct writer_work;
  216. struct workqueue_struct *recalc_wq;
  217. struct work_struct recalc_work;
  218. struct bio_list flush_bio_list;
  219. unsigned long autocommit_jiffies;
  220. struct timer_list autocommit_timer;
  221. unsigned int autocommit_msec;
  222. wait_queue_head_t copy_to_journal_wait;
  223. struct completion crypto_backoff;
  224. bool wrote_to_journal;
  225. bool journal_uptodate;
  226. bool just_formatted;
  227. bool recalculate_flag;
  228. bool reset_recalculate_flag;
  229. bool discard;
  230. bool fix_padding;
  231. bool fix_hmac;
  232. bool legacy_recalculate;
  233. mempool_t ahash_req_pool;
  234. struct ahash_request *journal_ahash_req;
  235. struct alg_spec internal_hash_alg;
  236. struct alg_spec journal_crypt_alg;
  237. struct alg_spec journal_mac_alg;
  238. atomic64_t number_of_mismatches;
  239. mempool_t recheck_pool;
  240. struct bio_set recheck_bios;
  241. struct bio_set recalc_bios;
  242. struct notifier_block reboot_notifier;
  243. };
  244. struct dm_integrity_range {
  245. sector_t logical_sector;
  246. sector_t n_sectors;
  247. bool waiting;
  248. union {
  249. struct rb_node node;
  250. struct {
  251. struct task_struct *task;
  252. struct list_head wait_entry;
  253. };
  254. };
  255. };
  256. struct dm_integrity_io {
  257. struct work_struct work;
  258. struct dm_integrity_c *ic;
  259. enum req_op op;
  260. bool fua;
  261. struct dm_integrity_range range;
  262. sector_t metadata_block;
  263. unsigned int metadata_offset;
  264. atomic_t in_flight;
  265. blk_status_t bi_status;
  266. struct completion *completion;
  267. struct dm_bio_details bio_details;
  268. char *integrity_payload;
  269. unsigned payload_len;
  270. bool integrity_payload_from_mempool;
  271. bool integrity_range_locked;
  272. struct ahash_request *ahash_req;
  273. };
  274. struct journal_completion {
  275. struct dm_integrity_c *ic;
  276. atomic_t in_flight;
  277. struct completion comp;
  278. };
  279. struct journal_io {
  280. struct dm_integrity_range range;
  281. struct journal_completion *comp;
  282. };
  283. struct bitmap_block_status {
  284. struct work_struct work;
  285. struct dm_integrity_c *ic;
  286. unsigned int idx;
  287. unsigned long *bitmap;
  288. struct bio_list bio_queue;
  289. spinlock_t bio_queue_lock;
  290. };
  291. static struct kmem_cache *journal_io_cache;
  292. #define JOURNAL_IO_MEMPOOL 32
  293. #define AHASH_MEMPOOL 32
  294. #ifdef DEBUG_PRINT
  295. #define DEBUG_print(x, ...) printk(KERN_DEBUG x, ##__VA_ARGS__)
  296. #define DEBUG_bytes(bytes, len, msg, ...) printk(KERN_DEBUG msg "%s%*ph\n", ##__VA_ARGS__, \
  297. len ? ": " : "", len, bytes)
  298. #else
  299. #define DEBUG_print(x, ...) do { } while (0)
  300. #define DEBUG_bytes(bytes, len, msg, ...) do { } while (0)
  301. #endif
  302. static void dm_integrity_map_continue(struct dm_integrity_io *dio, bool from_map);
  303. static int dm_integrity_map_inline(struct dm_integrity_io *dio, bool from_map);
  304. static void integrity_bio_wait(struct work_struct *w);
  305. static void dm_integrity_dtr(struct dm_target *ti);
  306. static void dm_integrity_io_error(struct dm_integrity_c *ic, const char *msg, int err)
  307. {
  308. if (err == -EILSEQ)
  309. atomic64_inc(&ic->number_of_mismatches);
  310. if (!cmpxchg(&ic->failed, 0, err))
  311. DMERR("Error on %s: %d", msg, err);
  312. }
  313. static int dm_integrity_failed(struct dm_integrity_c *ic)
  314. {
  315. return READ_ONCE(ic->failed);
  316. }
  317. static bool dm_integrity_disable_recalculate(struct dm_integrity_c *ic)
  318. {
  319. if (ic->legacy_recalculate)
  320. return false;
  321. if (!(ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) ?
  322. ic->internal_hash_alg.key || ic->journal_mac_alg.key :
  323. ic->internal_hash_alg.key && !ic->journal_mac_alg.key)
  324. return true;
  325. return false;
  326. }
  327. static commit_id_t dm_integrity_commit_id(struct dm_integrity_c *ic, unsigned int i,
  328. unsigned int j, unsigned char seq)
  329. {
  330. /*
  331. * Xor the number with section and sector, so that if a piece of
  332. * journal is written at wrong place, it is detected.
  333. */
  334. return ic->commit_ids[seq] ^ cpu_to_le64(((__u64)i << 32) ^ j);
  335. }
  336. static void get_area_and_offset(struct dm_integrity_c *ic, sector_t data_sector,
  337. sector_t *area, sector_t *offset)
  338. {
  339. if (!ic->meta_dev) {
  340. __u8 log2_interleave_sectors = ic->sb->log2_interleave_sectors;
  341. *area = data_sector >> log2_interleave_sectors;
  342. *offset = (unsigned int)data_sector & ((1U << log2_interleave_sectors) - 1);
  343. } else {
  344. *area = 0;
  345. *offset = data_sector;
  346. }
  347. }
  348. #define sector_to_block(ic, n) \
  349. do { \
  350. BUG_ON((n) & (unsigned int)((ic)->sectors_per_block - 1)); \
  351. (n) >>= (ic)->sb->log2_sectors_per_block; \
  352. } while (0)
  353. static __u64 get_metadata_sector_and_offset(struct dm_integrity_c *ic, sector_t area,
  354. sector_t offset, unsigned int *metadata_offset)
  355. {
  356. __u64 ms;
  357. unsigned int mo;
  358. ms = area << ic->sb->log2_interleave_sectors;
  359. if (likely(ic->log2_metadata_run >= 0))
  360. ms += area << ic->log2_metadata_run;
  361. else
  362. ms += area * ic->metadata_run;
  363. ms >>= ic->log2_buffer_sectors;
  364. sector_to_block(ic, offset);
  365. if (likely(ic->log2_tag_size >= 0)) {
  366. ms += offset >> (SECTOR_SHIFT + ic->log2_buffer_sectors - ic->log2_tag_size);
  367. mo = (offset << ic->log2_tag_size) & ((1U << SECTOR_SHIFT << ic->log2_buffer_sectors) - 1);
  368. } else {
  369. ms += (__u64)offset * ic->tag_size >> (SECTOR_SHIFT + ic->log2_buffer_sectors);
  370. mo = (offset * ic->tag_size) & ((1U << SECTOR_SHIFT << ic->log2_buffer_sectors) - 1);
  371. }
  372. *metadata_offset = mo;
  373. return ms;
  374. }
  375. static sector_t get_data_sector(struct dm_integrity_c *ic, sector_t area, sector_t offset)
  376. {
  377. sector_t result;
  378. if (ic->meta_dev)
  379. return offset;
  380. result = area << ic->sb->log2_interleave_sectors;
  381. if (likely(ic->log2_metadata_run >= 0))
  382. result += (area + 1) << ic->log2_metadata_run;
  383. else
  384. result += (area + 1) * ic->metadata_run;
  385. result += (sector_t)ic->initial_sectors + offset;
  386. result += ic->start;
  387. return result;
  388. }
  389. static void wraparound_section(struct dm_integrity_c *ic, unsigned int *sec_ptr)
  390. {
  391. if (unlikely(*sec_ptr >= ic->journal_sections))
  392. *sec_ptr -= ic->journal_sections;
  393. }
  394. static void sb_set_version(struct dm_integrity_c *ic)
  395. {
  396. if (ic->sb->flags & cpu_to_le32(SB_FLAG_INLINE))
  397. ic->sb->version = SB_VERSION_6;
  398. else if (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC))
  399. ic->sb->version = SB_VERSION_5;
  400. else if (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_PADDING))
  401. ic->sb->version = SB_VERSION_4;
  402. else if (ic->mode == 'B' || ic->sb->flags & cpu_to_le32(SB_FLAG_DIRTY_BITMAP))
  403. ic->sb->version = SB_VERSION_3;
  404. else if (ic->meta_dev || ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING))
  405. ic->sb->version = SB_VERSION_2;
  406. else
  407. ic->sb->version = SB_VERSION_1;
  408. }
  409. static int sb_mac(struct dm_integrity_c *ic, bool wr)
  410. {
  411. SHASH_DESC_ON_STACK(desc, ic->journal_mac);
  412. int r;
  413. unsigned int mac_size = crypto_shash_digestsize(ic->journal_mac);
  414. __u8 *sb = (__u8 *)ic->sb;
  415. __u8 *mac = sb + (1 << SECTOR_SHIFT) - mac_size;
  416. if (sizeof(struct superblock) + mac_size > 1 << SECTOR_SHIFT ||
  417. mac_size > HASH_MAX_DIGESTSIZE) {
  418. dm_integrity_io_error(ic, "digest is too long", -EINVAL);
  419. return -EINVAL;
  420. }
  421. desc->tfm = ic->journal_mac;
  422. if (likely(wr)) {
  423. r = crypto_shash_digest(desc, sb, mac - sb, mac);
  424. if (unlikely(r < 0)) {
  425. dm_integrity_io_error(ic, "crypto_shash_digest", r);
  426. return r;
  427. }
  428. } else {
  429. __u8 actual_mac[HASH_MAX_DIGESTSIZE];
  430. r = crypto_shash_digest(desc, sb, mac - sb, actual_mac);
  431. if (unlikely(r < 0)) {
  432. dm_integrity_io_error(ic, "crypto_shash_digest", r);
  433. return r;
  434. }
  435. if (crypto_memneq(mac, actual_mac, mac_size)) {
  436. dm_integrity_io_error(ic, "superblock mac", -EILSEQ);
  437. dm_audit_log_target(DM_MSG_PREFIX, "mac-superblock", ic->ti, 0);
  438. return -EILSEQ;
  439. }
  440. }
  441. return 0;
  442. }
  443. static int sync_rw_sb(struct dm_integrity_c *ic, blk_opf_t opf)
  444. {
  445. struct dm_io_request io_req;
  446. struct dm_io_region io_loc;
  447. const enum req_op op = opf & REQ_OP_MASK;
  448. int r;
  449. io_req.bi_opf = opf;
  450. io_req.mem.type = DM_IO_KMEM;
  451. io_req.mem.ptr.addr = ic->sb;
  452. io_req.notify.fn = NULL;
  453. io_req.client = ic->io;
  454. io_loc.bdev = ic->meta_dev ? ic->meta_dev->bdev : ic->dev->bdev;
  455. io_loc.sector = ic->start;
  456. io_loc.count = SB_SECTORS;
  457. if (op == REQ_OP_WRITE) {
  458. sb_set_version(ic);
  459. if (ic->journal_mac && ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) {
  460. r = sb_mac(ic, true);
  461. if (unlikely(r))
  462. return r;
  463. }
  464. }
  465. r = dm_io(&io_req, 1, &io_loc, NULL, IOPRIO_DEFAULT);
  466. if (unlikely(r))
  467. return r;
  468. if (op == REQ_OP_READ) {
  469. if (ic->mode != 'R' && ic->journal_mac && ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) {
  470. r = sb_mac(ic, false);
  471. if (unlikely(r))
  472. return r;
  473. }
  474. }
  475. return 0;
  476. }
  477. #define BITMAP_OP_TEST_ALL_SET 0
  478. #define BITMAP_OP_TEST_ALL_CLEAR 1
  479. #define BITMAP_OP_SET 2
  480. #define BITMAP_OP_CLEAR 3
  481. static bool block_bitmap_op(struct dm_integrity_c *ic, struct page_list *bitmap,
  482. sector_t sector, sector_t n_sectors, int mode)
  483. {
  484. unsigned long bit, end_bit, this_end_bit, page, end_page;
  485. unsigned long *data;
  486. if (unlikely(((sector | n_sectors) & ((1 << ic->sb->log2_sectors_per_block) - 1)) != 0)) {
  487. DMCRIT("invalid bitmap access (%llx,%llx,%d,%d,%d)",
  488. sector,
  489. n_sectors,
  490. ic->sb->log2_sectors_per_block,
  491. ic->log2_blocks_per_bitmap_bit,
  492. mode);
  493. BUG();
  494. }
  495. if (unlikely(!n_sectors))
  496. return true;
  497. bit = sector >> (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit);
  498. end_bit = (sector + n_sectors - 1) >>
  499. (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit);
  500. page = bit / (PAGE_SIZE * 8);
  501. bit %= PAGE_SIZE * 8;
  502. end_page = end_bit / (PAGE_SIZE * 8);
  503. end_bit %= PAGE_SIZE * 8;
  504. repeat:
  505. if (page < end_page)
  506. this_end_bit = PAGE_SIZE * 8 - 1;
  507. else
  508. this_end_bit = end_bit;
  509. data = lowmem_page_address(bitmap[page].page);
  510. if (mode == BITMAP_OP_TEST_ALL_SET) {
  511. while (bit <= this_end_bit) {
  512. if (!(bit % BITS_PER_LONG) && this_end_bit >= bit + BITS_PER_LONG - 1) {
  513. do {
  514. if (data[bit / BITS_PER_LONG] != -1)
  515. return false;
  516. bit += BITS_PER_LONG;
  517. } while (this_end_bit >= bit + BITS_PER_LONG - 1);
  518. continue;
  519. }
  520. if (!test_bit(bit, data))
  521. return false;
  522. bit++;
  523. }
  524. } else if (mode == BITMAP_OP_TEST_ALL_CLEAR) {
  525. while (bit <= this_end_bit) {
  526. if (!(bit % BITS_PER_LONG) && this_end_bit >= bit + BITS_PER_LONG - 1) {
  527. do {
  528. if (data[bit / BITS_PER_LONG] != 0)
  529. return false;
  530. bit += BITS_PER_LONG;
  531. } while (this_end_bit >= bit + BITS_PER_LONG - 1);
  532. continue;
  533. }
  534. if (test_bit(bit, data))
  535. return false;
  536. bit++;
  537. }
  538. } else if (mode == BITMAP_OP_SET) {
  539. while (bit <= this_end_bit) {
  540. if (!(bit % BITS_PER_LONG) && this_end_bit >= bit + BITS_PER_LONG - 1) {
  541. do {
  542. data[bit / BITS_PER_LONG] = -1;
  543. bit += BITS_PER_LONG;
  544. } while (this_end_bit >= bit + BITS_PER_LONG - 1);
  545. continue;
  546. }
  547. __set_bit(bit, data);
  548. bit++;
  549. }
  550. } else if (mode == BITMAP_OP_CLEAR) {
  551. if (!bit && this_end_bit == PAGE_SIZE * 8 - 1)
  552. clear_page(data);
  553. else {
  554. while (bit <= this_end_bit) {
  555. if (!(bit % BITS_PER_LONG) && this_end_bit >= bit + BITS_PER_LONG - 1) {
  556. do {
  557. data[bit / BITS_PER_LONG] = 0;
  558. bit += BITS_PER_LONG;
  559. } while (this_end_bit >= bit + BITS_PER_LONG - 1);
  560. continue;
  561. }
  562. __clear_bit(bit, data);
  563. bit++;
  564. }
  565. }
  566. } else {
  567. BUG();
  568. }
  569. if (unlikely(page < end_page)) {
  570. bit = 0;
  571. page++;
  572. goto repeat;
  573. }
  574. return true;
  575. }
  576. static void block_bitmap_copy(struct dm_integrity_c *ic, struct page_list *dst, struct page_list *src)
  577. {
  578. unsigned int n_bitmap_pages = DIV_ROUND_UP(ic->n_bitmap_blocks, PAGE_SIZE / BITMAP_BLOCK_SIZE);
  579. unsigned int i;
  580. for (i = 0; i < n_bitmap_pages; i++) {
  581. unsigned long *dst_data = lowmem_page_address(dst[i].page);
  582. unsigned long *src_data = lowmem_page_address(src[i].page);
  583. copy_page(dst_data, src_data);
  584. }
  585. }
  586. static struct bitmap_block_status *sector_to_bitmap_block(struct dm_integrity_c *ic, sector_t sector)
  587. {
  588. unsigned int bit = sector >> (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit);
  589. unsigned int bitmap_block = bit / (BITMAP_BLOCK_SIZE * 8);
  590. BUG_ON(bitmap_block >= ic->n_bitmap_blocks);
  591. return &ic->bbs[bitmap_block];
  592. }
  593. static void access_journal_check(struct dm_integrity_c *ic, unsigned int section, unsigned int offset,
  594. bool e, const char *function)
  595. {
  596. #if defined(CONFIG_DM_DEBUG) || defined(INTERNAL_VERIFY)
  597. unsigned int limit = e ? ic->journal_section_entries : ic->journal_section_sectors;
  598. if (unlikely(section >= ic->journal_sections) ||
  599. unlikely(offset >= limit)) {
  600. DMCRIT("%s: invalid access at (%u,%u), limit (%u,%u)",
  601. function, section, offset, ic->journal_sections, limit);
  602. BUG();
  603. }
  604. #endif
  605. }
  606. static void page_list_location(struct dm_integrity_c *ic, unsigned int section, unsigned int offset,
  607. unsigned int *pl_index, unsigned int *pl_offset)
  608. {
  609. unsigned int sector;
  610. access_journal_check(ic, section, offset, false, "page_list_location");
  611. sector = section * ic->journal_section_sectors + offset;
  612. *pl_index = sector >> (PAGE_SHIFT - SECTOR_SHIFT);
  613. *pl_offset = (sector << SECTOR_SHIFT) & (PAGE_SIZE - 1);
  614. }
  615. static struct journal_sector *access_page_list(struct dm_integrity_c *ic, struct page_list *pl,
  616. unsigned int section, unsigned int offset, unsigned int *n_sectors)
  617. {
  618. unsigned int pl_index, pl_offset;
  619. char *va;
  620. page_list_location(ic, section, offset, &pl_index, &pl_offset);
  621. if (n_sectors)
  622. *n_sectors = (PAGE_SIZE - pl_offset) >> SECTOR_SHIFT;
  623. va = lowmem_page_address(pl[pl_index].page);
  624. return (struct journal_sector *)(va + pl_offset);
  625. }
  626. static struct journal_sector *access_journal(struct dm_integrity_c *ic, unsigned int section, unsigned int offset)
  627. {
  628. return access_page_list(ic, ic->journal, section, offset, NULL);
  629. }
  630. static struct journal_entry *access_journal_entry(struct dm_integrity_c *ic, unsigned int section, unsigned int n)
  631. {
  632. unsigned int rel_sector, offset;
  633. struct journal_sector *js;
  634. access_journal_check(ic, section, n, true, "access_journal_entry");
  635. rel_sector = n % JOURNAL_BLOCK_SECTORS;
  636. offset = n / JOURNAL_BLOCK_SECTORS;
  637. js = access_journal(ic, section, rel_sector);
  638. return (struct journal_entry *)((char *)js + offset * ic->journal_entry_size);
  639. }
  640. static struct journal_sector *access_journal_data(struct dm_integrity_c *ic, unsigned int section, unsigned int n)
  641. {
  642. n <<= ic->sb->log2_sectors_per_block;
  643. n += JOURNAL_BLOCK_SECTORS;
  644. access_journal_check(ic, section, n, false, "access_journal_data");
  645. return access_journal(ic, section, n);
  646. }
  647. static void section_mac(struct dm_integrity_c *ic, unsigned int section, __u8 result[JOURNAL_MAC_SIZE])
  648. {
  649. SHASH_DESC_ON_STACK(desc, ic->journal_mac);
  650. int r;
  651. unsigned int j, size;
  652. desc->tfm = ic->journal_mac;
  653. r = crypto_shash_init(desc);
  654. if (unlikely(r < 0)) {
  655. dm_integrity_io_error(ic, "crypto_shash_init", r);
  656. goto err;
  657. }
  658. if (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) {
  659. __le64 section_le;
  660. r = crypto_shash_update(desc, (__u8 *)&ic->sb->salt, SALT_SIZE);
  661. if (unlikely(r < 0)) {
  662. dm_integrity_io_error(ic, "crypto_shash_update", r);
  663. goto err;
  664. }
  665. section_le = cpu_to_le64(section);
  666. r = crypto_shash_update(desc, (__u8 *)&section_le, sizeof(section_le));
  667. if (unlikely(r < 0)) {
  668. dm_integrity_io_error(ic, "crypto_shash_update", r);
  669. goto err;
  670. }
  671. }
  672. for (j = 0; j < ic->journal_section_entries; j++) {
  673. struct journal_entry *je = access_journal_entry(ic, section, j);
  674. r = crypto_shash_update(desc, (__u8 *)&je->u.sector, sizeof(je->u.sector));
  675. if (unlikely(r < 0)) {
  676. dm_integrity_io_error(ic, "crypto_shash_update", r);
  677. goto err;
  678. }
  679. }
  680. size = crypto_shash_digestsize(ic->journal_mac);
  681. if (likely(size <= JOURNAL_MAC_SIZE)) {
  682. r = crypto_shash_final(desc, result);
  683. if (unlikely(r < 0)) {
  684. dm_integrity_io_error(ic, "crypto_shash_final", r);
  685. goto err;
  686. }
  687. memset(result + size, 0, JOURNAL_MAC_SIZE - size);
  688. } else {
  689. __u8 digest[HASH_MAX_DIGESTSIZE];
  690. if (WARN_ON(size > sizeof(digest))) {
  691. dm_integrity_io_error(ic, "digest_size", -EINVAL);
  692. goto err;
  693. }
  694. r = crypto_shash_final(desc, digest);
  695. if (unlikely(r < 0)) {
  696. dm_integrity_io_error(ic, "crypto_shash_final", r);
  697. goto err;
  698. }
  699. memcpy(result, digest, JOURNAL_MAC_SIZE);
  700. }
  701. return;
  702. err:
  703. memset(result, 0, JOURNAL_MAC_SIZE);
  704. }
  705. static void rw_section_mac(struct dm_integrity_c *ic, unsigned int section, bool wr)
  706. {
  707. __u8 result[JOURNAL_MAC_SIZE];
  708. unsigned int j;
  709. if (!ic->journal_mac)
  710. return;
  711. section_mac(ic, section, result);
  712. for (j = 0; j < JOURNAL_BLOCK_SECTORS; j++) {
  713. struct journal_sector *js = access_journal(ic, section, j);
  714. if (likely(wr))
  715. memcpy(&js->mac, result + (j * JOURNAL_MAC_PER_SECTOR), JOURNAL_MAC_PER_SECTOR);
  716. else {
  717. if (crypto_memneq(&js->mac, result + (j * JOURNAL_MAC_PER_SECTOR), JOURNAL_MAC_PER_SECTOR)) {
  718. dm_integrity_io_error(ic, "journal mac", -EILSEQ);
  719. dm_audit_log_target(DM_MSG_PREFIX, "mac-journal", ic->ti, 0);
  720. }
  721. }
  722. }
  723. }
  724. static void complete_journal_op(void *context)
  725. {
  726. struct journal_completion *comp = context;
  727. BUG_ON(!atomic_read(&comp->in_flight));
  728. if (likely(atomic_dec_and_test(&comp->in_flight)))
  729. complete(&comp->comp);
  730. }
  731. static void xor_journal(struct dm_integrity_c *ic, bool encrypt, unsigned int section,
  732. unsigned int n_sections, struct journal_completion *comp)
  733. {
  734. struct async_submit_ctl submit;
  735. size_t n_bytes = (size_t)(n_sections * ic->journal_section_sectors) << SECTOR_SHIFT;
  736. unsigned int pl_index, pl_offset, section_index;
  737. struct page_list *source_pl, *target_pl;
  738. if (likely(encrypt)) {
  739. source_pl = ic->journal;
  740. target_pl = ic->journal_io;
  741. } else {
  742. source_pl = ic->journal_io;
  743. target_pl = ic->journal;
  744. }
  745. page_list_location(ic, section, 0, &pl_index, &pl_offset);
  746. atomic_add(roundup(pl_offset + n_bytes, PAGE_SIZE) >> PAGE_SHIFT, &comp->in_flight);
  747. init_async_submit(&submit, ASYNC_TX_XOR_ZERO_DST, NULL, complete_journal_op, comp, NULL);
  748. section_index = pl_index;
  749. do {
  750. size_t this_step;
  751. struct page *src_pages[2];
  752. struct page *dst_page;
  753. while (unlikely(pl_index == section_index)) {
  754. unsigned int dummy;
  755. if (likely(encrypt))
  756. rw_section_mac(ic, section, true);
  757. section++;
  758. n_sections--;
  759. if (!n_sections)
  760. break;
  761. page_list_location(ic, section, 0, &section_index, &dummy);
  762. }
  763. this_step = min(n_bytes, (size_t)PAGE_SIZE - pl_offset);
  764. dst_page = target_pl[pl_index].page;
  765. src_pages[0] = source_pl[pl_index].page;
  766. src_pages[1] = ic->journal_xor[pl_index].page;
  767. async_xor(dst_page, src_pages, pl_offset, 2, this_step, &submit);
  768. pl_index++;
  769. pl_offset = 0;
  770. n_bytes -= this_step;
  771. } while (n_bytes);
  772. BUG_ON(n_sections);
  773. async_tx_issue_pending_all();
  774. }
  775. static void complete_journal_encrypt(void *data, int err)
  776. {
  777. struct journal_completion *comp = data;
  778. if (unlikely(err)) {
  779. if (likely(err == -EINPROGRESS)) {
  780. complete(&comp->ic->crypto_backoff);
  781. return;
  782. }
  783. dm_integrity_io_error(comp->ic, "asynchronous encrypt", err);
  784. }
  785. complete_journal_op(comp);
  786. }
  787. static bool do_crypt(bool encrypt, struct skcipher_request *req, struct journal_completion *comp)
  788. {
  789. int r;
  790. skcipher_request_set_callback(req, CRYPTO_TFM_REQ_MAY_BACKLOG,
  791. complete_journal_encrypt, comp);
  792. if (likely(encrypt))
  793. r = crypto_skcipher_encrypt(req);
  794. else
  795. r = crypto_skcipher_decrypt(req);
  796. if (likely(!r))
  797. return false;
  798. if (likely(r == -EINPROGRESS))
  799. return true;
  800. if (likely(r == -EBUSY)) {
  801. wait_for_completion(&comp->ic->crypto_backoff);
  802. reinit_completion(&comp->ic->crypto_backoff);
  803. return true;
  804. }
  805. dm_integrity_io_error(comp->ic, "encrypt", r);
  806. return false;
  807. }
  808. static void crypt_journal(struct dm_integrity_c *ic, bool encrypt, unsigned int section,
  809. unsigned int n_sections, struct journal_completion *comp)
  810. {
  811. struct scatterlist **source_sg;
  812. struct scatterlist **target_sg;
  813. atomic_add(2, &comp->in_flight);
  814. if (likely(encrypt)) {
  815. source_sg = ic->journal_scatterlist;
  816. target_sg = ic->journal_io_scatterlist;
  817. } else {
  818. source_sg = ic->journal_io_scatterlist;
  819. target_sg = ic->journal_scatterlist;
  820. }
  821. do {
  822. struct skcipher_request *req;
  823. unsigned int ivsize;
  824. char *iv;
  825. if (likely(encrypt))
  826. rw_section_mac(ic, section, true);
  827. req = ic->sk_requests[section];
  828. ivsize = crypto_skcipher_ivsize(ic->journal_crypt);
  829. iv = req->iv;
  830. memcpy(iv, iv + ivsize, ivsize);
  831. req->src = source_sg[section];
  832. req->dst = target_sg[section];
  833. if (unlikely(do_crypt(encrypt, req, comp)))
  834. atomic_inc(&comp->in_flight);
  835. section++;
  836. n_sections--;
  837. } while (n_sections);
  838. atomic_dec(&comp->in_flight);
  839. complete_journal_op(comp);
  840. }
  841. static void encrypt_journal(struct dm_integrity_c *ic, bool encrypt, unsigned int section,
  842. unsigned int n_sections, struct journal_completion *comp)
  843. {
  844. if (ic->journal_xor)
  845. return xor_journal(ic, encrypt, section, n_sections, comp);
  846. else
  847. return crypt_journal(ic, encrypt, section, n_sections, comp);
  848. }
  849. static void complete_journal_io(unsigned long error, void *context)
  850. {
  851. struct journal_completion *comp = context;
  852. if (unlikely(error != 0))
  853. dm_integrity_io_error(comp->ic, "writing journal", -EIO);
  854. complete_journal_op(comp);
  855. }
  856. static void rw_journal_sectors(struct dm_integrity_c *ic, blk_opf_t opf,
  857. unsigned int sector, unsigned int n_sectors,
  858. struct journal_completion *comp)
  859. {
  860. struct dm_io_request io_req;
  861. struct dm_io_region io_loc;
  862. unsigned int pl_index, pl_offset;
  863. int r;
  864. if (unlikely(dm_integrity_failed(ic))) {
  865. if (comp)
  866. complete_journal_io(-1UL, comp);
  867. return;
  868. }
  869. pl_index = sector >> (PAGE_SHIFT - SECTOR_SHIFT);
  870. pl_offset = (sector << SECTOR_SHIFT) & (PAGE_SIZE - 1);
  871. io_req.bi_opf = opf;
  872. io_req.mem.type = DM_IO_PAGE_LIST;
  873. if (ic->journal_io)
  874. io_req.mem.ptr.pl = &ic->journal_io[pl_index];
  875. else
  876. io_req.mem.ptr.pl = &ic->journal[pl_index];
  877. io_req.mem.offset = pl_offset;
  878. if (likely(comp != NULL)) {
  879. io_req.notify.fn = complete_journal_io;
  880. io_req.notify.context = comp;
  881. } else {
  882. io_req.notify.fn = NULL;
  883. }
  884. io_req.client = ic->io;
  885. io_loc.bdev = ic->meta_dev ? ic->meta_dev->bdev : ic->dev->bdev;
  886. io_loc.sector = ic->start + SB_SECTORS + sector;
  887. io_loc.count = n_sectors;
  888. r = dm_io(&io_req, 1, &io_loc, NULL, IOPRIO_DEFAULT);
  889. if (unlikely(r)) {
  890. dm_integrity_io_error(ic, (opf & REQ_OP_MASK) == REQ_OP_READ ?
  891. "reading journal" : "writing journal", r);
  892. if (comp) {
  893. WARN_ONCE(1, "asynchronous dm_io failed: %d", r);
  894. complete_journal_io(-1UL, comp);
  895. }
  896. }
  897. }
  898. static void rw_journal(struct dm_integrity_c *ic, blk_opf_t opf,
  899. unsigned int section, unsigned int n_sections,
  900. struct journal_completion *comp)
  901. {
  902. unsigned int sector, n_sectors;
  903. sector = section * ic->journal_section_sectors;
  904. n_sectors = n_sections * ic->journal_section_sectors;
  905. rw_journal_sectors(ic, opf, sector, n_sectors, comp);
  906. }
  907. static void write_journal(struct dm_integrity_c *ic, unsigned int commit_start, unsigned int commit_sections)
  908. {
  909. struct journal_completion io_comp;
  910. struct journal_completion crypt_comp_1;
  911. struct journal_completion crypt_comp_2;
  912. unsigned int i;
  913. io_comp.ic = ic;
  914. init_completion(&io_comp.comp);
  915. if (commit_start + commit_sections <= ic->journal_sections) {
  916. io_comp.in_flight = (atomic_t)ATOMIC_INIT(1);
  917. if (ic->journal_io) {
  918. crypt_comp_1.ic = ic;
  919. init_completion(&crypt_comp_1.comp);
  920. crypt_comp_1.in_flight = (atomic_t)ATOMIC_INIT(0);
  921. encrypt_journal(ic, true, commit_start, commit_sections, &crypt_comp_1);
  922. wait_for_completion_io(&crypt_comp_1.comp);
  923. } else {
  924. for (i = 0; i < commit_sections; i++)
  925. rw_section_mac(ic, commit_start + i, true);
  926. }
  927. rw_journal(ic, REQ_OP_WRITE | REQ_FUA | REQ_SYNC, commit_start,
  928. commit_sections, &io_comp);
  929. } else {
  930. unsigned int to_end;
  931. io_comp.in_flight = (atomic_t)ATOMIC_INIT(2);
  932. to_end = ic->journal_sections - commit_start;
  933. if (ic->journal_io) {
  934. crypt_comp_1.ic = ic;
  935. init_completion(&crypt_comp_1.comp);
  936. crypt_comp_1.in_flight = (atomic_t)ATOMIC_INIT(0);
  937. encrypt_journal(ic, true, commit_start, to_end, &crypt_comp_1);
  938. if (try_wait_for_completion(&crypt_comp_1.comp)) {
  939. rw_journal(ic, REQ_OP_WRITE | REQ_FUA,
  940. commit_start, to_end, &io_comp);
  941. reinit_completion(&crypt_comp_1.comp);
  942. crypt_comp_1.in_flight = (atomic_t)ATOMIC_INIT(0);
  943. encrypt_journal(ic, true, 0, commit_sections - to_end, &crypt_comp_1);
  944. wait_for_completion_io(&crypt_comp_1.comp);
  945. } else {
  946. crypt_comp_2.ic = ic;
  947. init_completion(&crypt_comp_2.comp);
  948. crypt_comp_2.in_flight = (atomic_t)ATOMIC_INIT(0);
  949. encrypt_journal(ic, true, 0, commit_sections - to_end, &crypt_comp_2);
  950. wait_for_completion_io(&crypt_comp_1.comp);
  951. rw_journal(ic, REQ_OP_WRITE | REQ_FUA, commit_start, to_end, &io_comp);
  952. wait_for_completion_io(&crypt_comp_2.comp);
  953. }
  954. } else {
  955. for (i = 0; i < to_end; i++)
  956. rw_section_mac(ic, commit_start + i, true);
  957. rw_journal(ic, REQ_OP_WRITE | REQ_FUA, commit_start, to_end, &io_comp);
  958. for (i = 0; i < commit_sections - to_end; i++)
  959. rw_section_mac(ic, i, true);
  960. }
  961. rw_journal(ic, REQ_OP_WRITE | REQ_FUA, 0, commit_sections - to_end, &io_comp);
  962. }
  963. wait_for_completion_io(&io_comp.comp);
  964. }
  965. static void copy_from_journal(struct dm_integrity_c *ic, unsigned int section, unsigned int offset,
  966. unsigned int n_sectors, sector_t target, io_notify_fn fn, void *data)
  967. {
  968. struct dm_io_request io_req;
  969. struct dm_io_region io_loc;
  970. int r;
  971. unsigned int sector, pl_index, pl_offset;
  972. BUG_ON((target | n_sectors | offset) & (unsigned int)(ic->sectors_per_block - 1));
  973. if (unlikely(dm_integrity_failed(ic))) {
  974. fn(-1UL, data);
  975. return;
  976. }
  977. sector = section * ic->journal_section_sectors + JOURNAL_BLOCK_SECTORS + offset;
  978. pl_index = sector >> (PAGE_SHIFT - SECTOR_SHIFT);
  979. pl_offset = (sector << SECTOR_SHIFT) & (PAGE_SIZE - 1);
  980. io_req.bi_opf = REQ_OP_WRITE;
  981. io_req.mem.type = DM_IO_PAGE_LIST;
  982. io_req.mem.ptr.pl = &ic->journal[pl_index];
  983. io_req.mem.offset = pl_offset;
  984. io_req.notify.fn = fn;
  985. io_req.notify.context = data;
  986. io_req.client = ic->io;
  987. io_loc.bdev = ic->dev->bdev;
  988. io_loc.sector = target;
  989. io_loc.count = n_sectors;
  990. r = dm_io(&io_req, 1, &io_loc, NULL, IOPRIO_DEFAULT);
  991. if (unlikely(r)) {
  992. WARN_ONCE(1, "asynchronous dm_io failed: %d", r);
  993. fn(-1UL, data);
  994. }
  995. }
  996. static bool ranges_overlap(struct dm_integrity_range *range1, struct dm_integrity_range *range2)
  997. {
  998. return range1->logical_sector < range2->logical_sector + range2->n_sectors &&
  999. range1->logical_sector + range1->n_sectors > range2->logical_sector;
  1000. }
  1001. static bool add_new_range(struct dm_integrity_c *ic, struct dm_integrity_range *new_range, bool check_waiting)
  1002. {
  1003. struct rb_node **n = &ic->in_progress.rb_node;
  1004. struct rb_node *parent;
  1005. BUG_ON((new_range->logical_sector | new_range->n_sectors) & (unsigned int)(ic->sectors_per_block - 1));
  1006. if (likely(check_waiting)) {
  1007. struct dm_integrity_range *range;
  1008. list_for_each_entry(range, &ic->wait_list, wait_entry) {
  1009. if (unlikely(ranges_overlap(range, new_range)))
  1010. return false;
  1011. }
  1012. }
  1013. parent = NULL;
  1014. while (*n) {
  1015. struct dm_integrity_range *range = container_of(*n, struct dm_integrity_range, node);
  1016. parent = *n;
  1017. if (new_range->logical_sector + new_range->n_sectors <= range->logical_sector)
  1018. n = &range->node.rb_left;
  1019. else if (new_range->logical_sector >= range->logical_sector + range->n_sectors)
  1020. n = &range->node.rb_right;
  1021. else
  1022. return false;
  1023. }
  1024. rb_link_node(&new_range->node, parent, n);
  1025. rb_insert_color(&new_range->node, &ic->in_progress);
  1026. return true;
  1027. }
  1028. static void remove_range_unlocked(struct dm_integrity_c *ic, struct dm_integrity_range *range)
  1029. {
  1030. rb_erase(&range->node, &ic->in_progress);
  1031. while (unlikely(!list_empty(&ic->wait_list))) {
  1032. struct dm_integrity_range *last_range =
  1033. list_first_entry(&ic->wait_list, struct dm_integrity_range, wait_entry);
  1034. struct task_struct *last_range_task;
  1035. last_range_task = last_range->task;
  1036. list_del(&last_range->wait_entry);
  1037. if (!add_new_range(ic, last_range, false)) {
  1038. last_range->task = last_range_task;
  1039. list_add(&last_range->wait_entry, &ic->wait_list);
  1040. break;
  1041. }
  1042. last_range->waiting = false;
  1043. wake_up_process(last_range_task);
  1044. }
  1045. }
  1046. static void remove_range(struct dm_integrity_c *ic, struct dm_integrity_range *range)
  1047. {
  1048. unsigned long flags;
  1049. spin_lock_irqsave(&ic->endio_wait.lock, flags);
  1050. remove_range_unlocked(ic, range);
  1051. spin_unlock_irqrestore(&ic->endio_wait.lock, flags);
  1052. }
  1053. static void wait_and_add_new_range(struct dm_integrity_c *ic, struct dm_integrity_range *new_range)
  1054. {
  1055. new_range->waiting = true;
  1056. list_add_tail(&new_range->wait_entry, &ic->wait_list);
  1057. new_range->task = current;
  1058. do {
  1059. __set_current_state(TASK_UNINTERRUPTIBLE);
  1060. spin_unlock_irq(&ic->endio_wait.lock);
  1061. io_schedule();
  1062. spin_lock_irq(&ic->endio_wait.lock);
  1063. } while (unlikely(new_range->waiting));
  1064. }
  1065. static void add_new_range_and_wait(struct dm_integrity_c *ic, struct dm_integrity_range *new_range)
  1066. {
  1067. if (unlikely(!add_new_range(ic, new_range, true)))
  1068. wait_and_add_new_range(ic, new_range);
  1069. }
  1070. static void init_journal_node(struct journal_node *node)
  1071. {
  1072. RB_CLEAR_NODE(&node->node);
  1073. node->sector = (sector_t)-1;
  1074. }
  1075. static void add_journal_node(struct dm_integrity_c *ic, struct journal_node *node, sector_t sector)
  1076. {
  1077. struct rb_node **link;
  1078. struct rb_node *parent;
  1079. node->sector = sector;
  1080. BUG_ON(!RB_EMPTY_NODE(&node->node));
  1081. link = &ic->journal_tree_root.rb_node;
  1082. parent = NULL;
  1083. while (*link) {
  1084. struct journal_node *j;
  1085. parent = *link;
  1086. j = container_of(parent, struct journal_node, node);
  1087. if (sector < j->sector)
  1088. link = &j->node.rb_left;
  1089. else
  1090. link = &j->node.rb_right;
  1091. }
  1092. rb_link_node(&node->node, parent, link);
  1093. rb_insert_color(&node->node, &ic->journal_tree_root);
  1094. }
  1095. static void remove_journal_node(struct dm_integrity_c *ic, struct journal_node *node)
  1096. {
  1097. BUG_ON(RB_EMPTY_NODE(&node->node));
  1098. rb_erase(&node->node, &ic->journal_tree_root);
  1099. init_journal_node(node);
  1100. }
  1101. #define NOT_FOUND (-1U)
  1102. static unsigned int find_journal_node(struct dm_integrity_c *ic, sector_t sector, sector_t *next_sector)
  1103. {
  1104. struct rb_node *n = ic->journal_tree_root.rb_node;
  1105. unsigned int found = NOT_FOUND;
  1106. *next_sector = (sector_t)-1;
  1107. while (n) {
  1108. struct journal_node *j = container_of(n, struct journal_node, node);
  1109. if (sector == j->sector)
  1110. found = j - ic->journal_tree;
  1111. if (sector < j->sector) {
  1112. *next_sector = j->sector;
  1113. n = j->node.rb_left;
  1114. } else
  1115. n = j->node.rb_right;
  1116. }
  1117. return found;
  1118. }
  1119. static bool test_journal_node(struct dm_integrity_c *ic, unsigned int pos, sector_t sector)
  1120. {
  1121. struct journal_node *node, *next_node;
  1122. struct rb_node *next;
  1123. if (unlikely(pos >= ic->journal_entries))
  1124. return false;
  1125. node = &ic->journal_tree[pos];
  1126. if (unlikely(RB_EMPTY_NODE(&node->node)))
  1127. return false;
  1128. if (unlikely(node->sector != sector))
  1129. return false;
  1130. next = rb_next(&node->node);
  1131. if (unlikely(!next))
  1132. return true;
  1133. next_node = container_of(next, struct journal_node, node);
  1134. return next_node->sector != sector;
  1135. }
  1136. static bool find_newer_committed_node(struct dm_integrity_c *ic, struct journal_node *node)
  1137. {
  1138. struct rb_node *next;
  1139. struct journal_node *next_node;
  1140. unsigned int next_section;
  1141. BUG_ON(RB_EMPTY_NODE(&node->node));
  1142. next = rb_next(&node->node);
  1143. if (unlikely(!next))
  1144. return false;
  1145. next_node = container_of(next, struct journal_node, node);
  1146. if (next_node->sector != node->sector)
  1147. return false;
  1148. next_section = (unsigned int)(next_node - ic->journal_tree) / ic->journal_section_entries;
  1149. if (next_section >= ic->committed_section &&
  1150. next_section < ic->committed_section + ic->n_committed_sections)
  1151. return true;
  1152. if (next_section + ic->journal_sections < ic->committed_section + ic->n_committed_sections)
  1153. return true;
  1154. return false;
  1155. }
  1156. #define TAG_READ 0
  1157. #define TAG_WRITE 1
  1158. #define TAG_CMP 2
  1159. static int dm_integrity_rw_tag(struct dm_integrity_c *ic, unsigned char *tag, sector_t *metadata_block,
  1160. unsigned int *metadata_offset, unsigned int total_size, int op)
  1161. {
  1162. unsigned int hash_offset = 0;
  1163. unsigned char mismatch_hash = 0;
  1164. unsigned char mismatch_filler = !ic->discard;
  1165. do {
  1166. unsigned char *data, *dp;
  1167. struct dm_buffer *b;
  1168. unsigned int to_copy;
  1169. int r;
  1170. r = dm_integrity_failed(ic);
  1171. if (unlikely(r))
  1172. return r;
  1173. data = dm_bufio_read(ic->bufio, *metadata_block, &b);
  1174. if (IS_ERR(data))
  1175. return PTR_ERR(data);
  1176. to_copy = min((1U << SECTOR_SHIFT << ic->log2_buffer_sectors) - *metadata_offset, total_size);
  1177. dp = data + *metadata_offset;
  1178. if (op == TAG_READ) {
  1179. memcpy(tag, dp, to_copy);
  1180. } else if (op == TAG_WRITE) {
  1181. if (crypto_memneq(dp, tag, to_copy)) {
  1182. memcpy(dp, tag, to_copy);
  1183. dm_bufio_mark_partial_buffer_dirty(b, *metadata_offset, *metadata_offset + to_copy);
  1184. }
  1185. } else {
  1186. /* e.g.: op == TAG_CMP */
  1187. if (likely(is_power_of_2(ic->tag_size))) {
  1188. if (unlikely(crypto_memneq(dp, tag, to_copy)))
  1189. goto thorough_test;
  1190. } else {
  1191. unsigned int i, ts;
  1192. thorough_test:
  1193. ts = total_size;
  1194. for (i = 0; i < to_copy; i++, ts--) {
  1195. /*
  1196. * Warning: the control flow must not be
  1197. * dependent on match/mismatch of
  1198. * individual bytes.
  1199. */
  1200. mismatch_hash |= dp[i] ^ tag[i];
  1201. mismatch_filler |= dp[i] ^ DISCARD_FILLER;
  1202. hash_offset++;
  1203. if (unlikely(hash_offset == ic->tag_size)) {
  1204. if (unlikely(mismatch_hash) && unlikely(mismatch_filler)) {
  1205. dm_bufio_release(b);
  1206. return ts;
  1207. }
  1208. hash_offset = 0;
  1209. mismatch_hash = 0;
  1210. mismatch_filler = !ic->discard;
  1211. }
  1212. }
  1213. }
  1214. }
  1215. dm_bufio_release(b);
  1216. tag += to_copy;
  1217. *metadata_offset += to_copy;
  1218. if (unlikely(*metadata_offset == 1U << SECTOR_SHIFT << ic->log2_buffer_sectors)) {
  1219. (*metadata_block)++;
  1220. *metadata_offset = 0;
  1221. }
  1222. if (unlikely(!is_power_of_2(ic->tag_size)))
  1223. hash_offset = (hash_offset + to_copy) % ic->tag_size;
  1224. total_size -= to_copy;
  1225. } while (unlikely(total_size));
  1226. return 0;
  1227. }
  1228. struct flush_request {
  1229. struct dm_io_request io_req;
  1230. struct dm_io_region io_reg;
  1231. struct dm_integrity_c *ic;
  1232. struct completion comp;
  1233. };
  1234. static void flush_notify(unsigned long error, void *fr_)
  1235. {
  1236. struct flush_request *fr = fr_;
  1237. if (unlikely(error != 0))
  1238. dm_integrity_io_error(fr->ic, "flushing disk cache", -EIO);
  1239. complete(&fr->comp);
  1240. }
  1241. static void dm_integrity_flush_buffers(struct dm_integrity_c *ic, bool flush_data)
  1242. {
  1243. int r;
  1244. struct flush_request fr;
  1245. if (!ic->meta_dev)
  1246. flush_data = false;
  1247. if (flush_data) {
  1248. fr.io_req.bi_opf = REQ_OP_WRITE | REQ_PREFLUSH | REQ_SYNC;
  1249. fr.io_req.mem.type = DM_IO_KMEM;
  1250. fr.io_req.mem.ptr.addr = NULL;
  1251. fr.io_req.notify.fn = flush_notify;
  1252. fr.io_req.notify.context = &fr;
  1253. fr.io_req.client = dm_bufio_get_dm_io_client(ic->bufio);
  1254. fr.io_reg.bdev = ic->dev->bdev;
  1255. fr.io_reg.sector = 0;
  1256. fr.io_reg.count = 0;
  1257. fr.ic = ic;
  1258. init_completion(&fr.comp);
  1259. r = dm_io(&fr.io_req, 1, &fr.io_reg, NULL, IOPRIO_DEFAULT);
  1260. BUG_ON(r);
  1261. }
  1262. r = dm_bufio_write_dirty_buffers(ic->bufio);
  1263. if (unlikely(r))
  1264. dm_integrity_io_error(ic, "writing tags", r);
  1265. if (flush_data)
  1266. wait_for_completion(&fr.comp);
  1267. }
  1268. static void sleep_on_endio_wait(struct dm_integrity_c *ic)
  1269. {
  1270. DECLARE_WAITQUEUE(wait, current);
  1271. __add_wait_queue(&ic->endio_wait, &wait);
  1272. __set_current_state(TASK_UNINTERRUPTIBLE);
  1273. spin_unlock_irq(&ic->endio_wait.lock);
  1274. io_schedule();
  1275. spin_lock_irq(&ic->endio_wait.lock);
  1276. __remove_wait_queue(&ic->endio_wait, &wait);
  1277. }
  1278. static void autocommit_fn(struct timer_list *t)
  1279. {
  1280. struct dm_integrity_c *ic = timer_container_of(ic, t,
  1281. autocommit_timer);
  1282. if (likely(!dm_integrity_failed(ic)))
  1283. queue_work(ic->commit_wq, &ic->commit_work);
  1284. }
  1285. static void schedule_autocommit(struct dm_integrity_c *ic)
  1286. {
  1287. if (!timer_pending(&ic->autocommit_timer))
  1288. mod_timer(&ic->autocommit_timer, jiffies + ic->autocommit_jiffies);
  1289. }
  1290. static void submit_flush_bio(struct dm_integrity_c *ic, struct dm_integrity_io *dio)
  1291. {
  1292. struct bio *bio;
  1293. unsigned long flags;
  1294. spin_lock_irqsave(&ic->endio_wait.lock, flags);
  1295. bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  1296. bio_list_add(&ic->flush_bio_list, bio);
  1297. spin_unlock_irqrestore(&ic->endio_wait.lock, flags);
  1298. queue_work(ic->commit_wq, &ic->commit_work);
  1299. }
  1300. static void do_endio(struct dm_integrity_c *ic, struct bio *bio)
  1301. {
  1302. int r;
  1303. r = dm_integrity_failed(ic);
  1304. if (unlikely(r) && !bio->bi_status)
  1305. bio->bi_status = errno_to_blk_status(r);
  1306. if (unlikely(ic->synchronous_mode) && bio_op(bio) == REQ_OP_WRITE) {
  1307. unsigned long flags;
  1308. spin_lock_irqsave(&ic->endio_wait.lock, flags);
  1309. bio_list_add(&ic->synchronous_bios, bio);
  1310. queue_delayed_work(ic->commit_wq, &ic->bitmap_flush_work, 0);
  1311. spin_unlock_irqrestore(&ic->endio_wait.lock, flags);
  1312. return;
  1313. }
  1314. bio_endio(bio);
  1315. }
  1316. static void do_endio_flush(struct dm_integrity_c *ic, struct dm_integrity_io *dio)
  1317. {
  1318. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  1319. if (unlikely(dio->fua) && likely(!bio->bi_status) && likely(!dm_integrity_failed(ic)))
  1320. submit_flush_bio(ic, dio);
  1321. else
  1322. do_endio(ic, bio);
  1323. }
  1324. static void dec_in_flight(struct dm_integrity_io *dio)
  1325. {
  1326. if (atomic_dec_and_test(&dio->in_flight)) {
  1327. struct dm_integrity_c *ic = dio->ic;
  1328. struct bio *bio;
  1329. remove_range(ic, &dio->range);
  1330. if (dio->op == REQ_OP_WRITE || unlikely(dio->op == REQ_OP_DISCARD))
  1331. schedule_autocommit(ic);
  1332. bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  1333. if (unlikely(dio->bi_status) && !bio->bi_status)
  1334. bio->bi_status = dio->bi_status;
  1335. if (likely(!bio->bi_status) && unlikely(bio_sectors(bio) != dio->range.n_sectors)) {
  1336. dio->range.logical_sector += dio->range.n_sectors;
  1337. bio_advance(bio, dio->range.n_sectors << SECTOR_SHIFT);
  1338. INIT_WORK(&dio->work, integrity_bio_wait);
  1339. queue_work(ic->offload_wq, &dio->work);
  1340. return;
  1341. }
  1342. do_endio_flush(ic, dio);
  1343. }
  1344. }
  1345. static void integrity_end_io(struct bio *bio)
  1346. {
  1347. struct dm_integrity_io *dio = dm_per_bio_data(bio, sizeof(struct dm_integrity_io));
  1348. dm_bio_restore(&dio->bio_details, bio);
  1349. if (bio->bi_integrity)
  1350. bio->bi_opf |= REQ_INTEGRITY;
  1351. if (dio->completion)
  1352. complete(dio->completion);
  1353. dec_in_flight(dio);
  1354. }
  1355. static void integrity_sector_checksum_shash(struct dm_integrity_c *ic, sector_t sector,
  1356. const char *data, unsigned offset, char *result)
  1357. {
  1358. __le64 sector_le = cpu_to_le64(sector);
  1359. SHASH_DESC_ON_STACK(req, ic->internal_shash);
  1360. int r;
  1361. unsigned int digest_size;
  1362. req->tfm = ic->internal_shash;
  1363. r = crypto_shash_init(req);
  1364. if (unlikely(r < 0)) {
  1365. dm_integrity_io_error(ic, "crypto_shash_init", r);
  1366. goto failed;
  1367. }
  1368. if (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) {
  1369. r = crypto_shash_update(req, (__u8 *)&ic->sb->salt, SALT_SIZE);
  1370. if (unlikely(r < 0)) {
  1371. dm_integrity_io_error(ic, "crypto_shash_update", r);
  1372. goto failed;
  1373. }
  1374. }
  1375. r = crypto_shash_update(req, (const __u8 *)&sector_le, sizeof(sector_le));
  1376. if (unlikely(r < 0)) {
  1377. dm_integrity_io_error(ic, "crypto_shash_update", r);
  1378. goto failed;
  1379. }
  1380. r = crypto_shash_update(req, data + offset, ic->sectors_per_block << SECTOR_SHIFT);
  1381. if (unlikely(r < 0)) {
  1382. dm_integrity_io_error(ic, "crypto_shash_update", r);
  1383. goto failed;
  1384. }
  1385. r = crypto_shash_final(req, result);
  1386. if (unlikely(r < 0)) {
  1387. dm_integrity_io_error(ic, "crypto_shash_final", r);
  1388. goto failed;
  1389. }
  1390. digest_size = ic->internal_hash_digestsize;
  1391. if (unlikely(digest_size < ic->tag_size))
  1392. memset(result + digest_size, 0, ic->tag_size - digest_size);
  1393. return;
  1394. failed:
  1395. /* this shouldn't happen anyway, the hash functions have no reason to fail */
  1396. get_random_bytes(result, ic->tag_size);
  1397. }
  1398. static void integrity_sector_checksum_ahash(struct dm_integrity_c *ic, struct ahash_request **ahash_req,
  1399. sector_t sector, struct page *page, unsigned offset, char *result)
  1400. {
  1401. __le64 sector_le = cpu_to_le64(sector);
  1402. struct ahash_request *req;
  1403. DECLARE_CRYPTO_WAIT(wait);
  1404. struct scatterlist sg[3], *s = sg;
  1405. int r;
  1406. unsigned int digest_size;
  1407. unsigned int nbytes = 0;
  1408. might_sleep();
  1409. req = *ahash_req;
  1410. if (unlikely(!req)) {
  1411. req = mempool_alloc(&ic->ahash_req_pool, GFP_NOIO);
  1412. *ahash_req = req;
  1413. }
  1414. ahash_request_set_tfm(req, ic->internal_ahash);
  1415. ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_SLEEP, crypto_req_done, &wait);
  1416. if (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) {
  1417. sg_init_table(sg, 3);
  1418. sg_set_buf(s, (const __u8 *)&ic->sb->salt, SALT_SIZE);
  1419. nbytes += SALT_SIZE;
  1420. s++;
  1421. } else {
  1422. sg_init_table(sg, 2);
  1423. }
  1424. if (likely(!is_vmalloc_addr(&sector_le))) {
  1425. sg_set_buf(s, &sector_le, sizeof(sector_le));
  1426. } else {
  1427. struct page *sec_page = vmalloc_to_page(&sector_le);
  1428. unsigned int sec_off = offset_in_page(&sector_le);
  1429. sg_set_page(s, sec_page, sizeof(sector_le), sec_off);
  1430. }
  1431. nbytes += sizeof(sector_le);
  1432. s++;
  1433. sg_set_page(s, page, ic->sectors_per_block << SECTOR_SHIFT, offset);
  1434. nbytes += ic->sectors_per_block << SECTOR_SHIFT;
  1435. ahash_request_set_crypt(req, sg, result, nbytes);
  1436. r = crypto_wait_req(crypto_ahash_digest(req), &wait);
  1437. if (unlikely(r)) {
  1438. dm_integrity_io_error(ic, "crypto_ahash_digest", r);
  1439. goto failed;
  1440. }
  1441. digest_size = ic->internal_hash_digestsize;
  1442. if (unlikely(digest_size < ic->tag_size))
  1443. memset(result + digest_size, 0, ic->tag_size - digest_size);
  1444. return;
  1445. failed:
  1446. /* this shouldn't happen anyway, the hash functions have no reason to fail */
  1447. get_random_bytes(result, ic->tag_size);
  1448. }
  1449. static void integrity_sector_checksum(struct dm_integrity_c *ic, struct ahash_request **ahash_req,
  1450. sector_t sector, const char *data, unsigned offset, char *result)
  1451. {
  1452. if (likely(ic->internal_shash != NULL))
  1453. integrity_sector_checksum_shash(ic, sector, data, offset, result);
  1454. else
  1455. integrity_sector_checksum_ahash(ic, ahash_req, sector, (struct page *)data, offset, result);
  1456. }
  1457. static void *integrity_kmap(struct dm_integrity_c *ic, struct page *p)
  1458. {
  1459. if (likely(ic->internal_shash != NULL))
  1460. return kmap_local_page(p);
  1461. else
  1462. return p;
  1463. }
  1464. static void integrity_kunmap(struct dm_integrity_c *ic, const void *ptr)
  1465. {
  1466. if (likely(ic->internal_shash != NULL))
  1467. kunmap_local(ptr);
  1468. }
  1469. static void *integrity_identity(struct dm_integrity_c *ic, void *data)
  1470. {
  1471. #ifdef CONFIG_DEBUG_SG
  1472. BUG_ON(offset_in_page(data));
  1473. BUG_ON(!virt_addr_valid(data));
  1474. #endif
  1475. if (likely(ic->internal_shash != NULL))
  1476. return data;
  1477. else
  1478. return virt_to_page(data);
  1479. }
  1480. static noinline void integrity_recheck(struct dm_integrity_io *dio, char *checksum)
  1481. {
  1482. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  1483. struct dm_integrity_c *ic = dio->ic;
  1484. struct bvec_iter iter;
  1485. struct bio_vec bv;
  1486. sector_t sector, logical_sector, area, offset;
  1487. struct page *page;
  1488. get_area_and_offset(ic, dio->range.logical_sector, &area, &offset);
  1489. dio->metadata_block = get_metadata_sector_and_offset(ic, area, offset,
  1490. &dio->metadata_offset);
  1491. sector = get_data_sector(ic, area, offset);
  1492. logical_sector = dio->range.logical_sector;
  1493. page = mempool_alloc(&ic->recheck_pool, GFP_NOIO);
  1494. __bio_for_each_segment(bv, bio, iter, dio->bio_details.bi_iter) {
  1495. unsigned pos = 0;
  1496. do {
  1497. sector_t alignment;
  1498. char *mem;
  1499. char *buffer = page_to_virt(page);
  1500. unsigned int buffer_offset;
  1501. int r;
  1502. struct dm_io_request io_req;
  1503. struct dm_io_region io_loc;
  1504. io_req.bi_opf = REQ_OP_READ;
  1505. io_req.mem.type = DM_IO_KMEM;
  1506. io_req.mem.ptr.addr = buffer;
  1507. io_req.notify.fn = NULL;
  1508. io_req.client = ic->io;
  1509. io_loc.bdev = ic->dev->bdev;
  1510. io_loc.sector = sector;
  1511. io_loc.count = ic->sectors_per_block;
  1512. /* Align the bio to logical block size */
  1513. alignment = dio->range.logical_sector | bio_sectors(bio) | (PAGE_SIZE >> SECTOR_SHIFT);
  1514. alignment &= -alignment;
  1515. io_loc.sector = round_down(io_loc.sector, alignment);
  1516. io_loc.count += sector - io_loc.sector;
  1517. buffer_offset = (sector - io_loc.sector) << SECTOR_SHIFT;
  1518. io_loc.count = round_up(io_loc.count, alignment);
  1519. r = dm_io(&io_req, 1, &io_loc, NULL, IOPRIO_DEFAULT);
  1520. if (unlikely(r)) {
  1521. dio->bi_status = errno_to_blk_status(r);
  1522. goto free_ret;
  1523. }
  1524. integrity_sector_checksum(ic, &dio->ahash_req, logical_sector, integrity_identity(ic, buffer), buffer_offset, checksum);
  1525. r = dm_integrity_rw_tag(ic, checksum, &dio->metadata_block,
  1526. &dio->metadata_offset, ic->tag_size, TAG_CMP);
  1527. if (r) {
  1528. if (r > 0) {
  1529. DMERR_LIMIT("%pg: Checksum failed at sector 0x%llx",
  1530. bio->bi_bdev, logical_sector);
  1531. atomic64_inc(&ic->number_of_mismatches);
  1532. dm_audit_log_bio(DM_MSG_PREFIX, "integrity-checksum",
  1533. bio, logical_sector, 0);
  1534. r = -EILSEQ;
  1535. }
  1536. dio->bi_status = errno_to_blk_status(r);
  1537. goto free_ret;
  1538. }
  1539. mem = bvec_kmap_local(&bv);
  1540. memcpy(mem + pos, buffer + buffer_offset, ic->sectors_per_block << SECTOR_SHIFT);
  1541. kunmap_local(mem);
  1542. pos += ic->sectors_per_block << SECTOR_SHIFT;
  1543. sector += ic->sectors_per_block;
  1544. logical_sector += ic->sectors_per_block;
  1545. } while (pos < bv.bv_len);
  1546. }
  1547. free_ret:
  1548. mempool_free(page, &ic->recheck_pool);
  1549. }
  1550. static void integrity_metadata(struct work_struct *w)
  1551. {
  1552. struct dm_integrity_io *dio = container_of(w, struct dm_integrity_io, work);
  1553. struct dm_integrity_c *ic = dio->ic;
  1554. int r;
  1555. if (ic->internal_hash) {
  1556. struct bvec_iter iter;
  1557. struct bio_vec bv;
  1558. unsigned int digest_size = ic->internal_hash_digestsize;
  1559. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  1560. char *checksums;
  1561. unsigned int extra_space = unlikely(digest_size > ic->tag_size) ? digest_size - ic->tag_size : 0;
  1562. char checksums_onstack[MAX_T(size_t, HASH_MAX_DIGESTSIZE, MAX_TAG_SIZE)];
  1563. sector_t sector;
  1564. unsigned int sectors_to_process;
  1565. if (unlikely(ic->mode == 'R'))
  1566. goto skip_io;
  1567. if (likely(dio->op != REQ_OP_DISCARD))
  1568. checksums = kmalloc((PAGE_SIZE >> SECTOR_SHIFT >> ic->sb->log2_sectors_per_block) * ic->tag_size + extra_space,
  1569. GFP_NOIO | __GFP_NORETRY | __GFP_NOWARN);
  1570. else
  1571. checksums = kmalloc(PAGE_SIZE, GFP_NOIO | __GFP_NORETRY | __GFP_NOWARN);
  1572. if (!checksums) {
  1573. checksums = checksums_onstack;
  1574. if (WARN_ON(extra_space &&
  1575. digest_size > sizeof(checksums_onstack))) {
  1576. r = -EINVAL;
  1577. goto error;
  1578. }
  1579. }
  1580. if (unlikely(dio->op == REQ_OP_DISCARD)) {
  1581. unsigned int bi_size = dio->bio_details.bi_iter.bi_size;
  1582. unsigned int max_size = likely(checksums != checksums_onstack) ? PAGE_SIZE : HASH_MAX_DIGESTSIZE;
  1583. unsigned int max_blocks = max_size / ic->tag_size;
  1584. memset(checksums, DISCARD_FILLER, max_size);
  1585. while (bi_size) {
  1586. unsigned int this_step_blocks = bi_size >> (SECTOR_SHIFT + ic->sb->log2_sectors_per_block);
  1587. this_step_blocks = min(this_step_blocks, max_blocks);
  1588. r = dm_integrity_rw_tag(ic, checksums, &dio->metadata_block, &dio->metadata_offset,
  1589. this_step_blocks * ic->tag_size, TAG_WRITE);
  1590. if (unlikely(r)) {
  1591. if (likely(checksums != checksums_onstack))
  1592. kfree(checksums);
  1593. goto error;
  1594. }
  1595. bi_size -= this_step_blocks << (SECTOR_SHIFT + ic->sb->log2_sectors_per_block);
  1596. }
  1597. if (likely(checksums != checksums_onstack))
  1598. kfree(checksums);
  1599. goto skip_io;
  1600. }
  1601. sector = dio->range.logical_sector;
  1602. sectors_to_process = dio->range.n_sectors;
  1603. __bio_for_each_segment(bv, bio, iter, dio->bio_details.bi_iter) {
  1604. struct bio_vec bv_copy = bv;
  1605. unsigned int pos;
  1606. char *mem, *checksums_ptr;
  1607. again:
  1608. mem = integrity_kmap(ic, bv_copy.bv_page);
  1609. pos = 0;
  1610. checksums_ptr = checksums;
  1611. do {
  1612. integrity_sector_checksum(ic, &dio->ahash_req, sector, mem, bv_copy.bv_offset + pos, checksums_ptr);
  1613. checksums_ptr += ic->tag_size;
  1614. sectors_to_process -= ic->sectors_per_block;
  1615. pos += ic->sectors_per_block << SECTOR_SHIFT;
  1616. sector += ic->sectors_per_block;
  1617. } while (pos < bv_copy.bv_len && sectors_to_process && checksums != checksums_onstack);
  1618. integrity_kunmap(ic, mem);
  1619. r = dm_integrity_rw_tag(ic, checksums, &dio->metadata_block, &dio->metadata_offset,
  1620. checksums_ptr - checksums, dio->op == REQ_OP_READ ? TAG_CMP : TAG_WRITE);
  1621. if (unlikely(r)) {
  1622. if (likely(checksums != checksums_onstack))
  1623. kfree(checksums);
  1624. if (r > 0) {
  1625. integrity_recheck(dio, checksums_onstack);
  1626. goto skip_io;
  1627. }
  1628. goto error;
  1629. }
  1630. if (!sectors_to_process)
  1631. break;
  1632. if (unlikely(pos < bv_copy.bv_len)) {
  1633. bv_copy.bv_offset += pos;
  1634. bv_copy.bv_len -= pos;
  1635. goto again;
  1636. }
  1637. }
  1638. if (likely(checksums != checksums_onstack))
  1639. kfree(checksums);
  1640. } else {
  1641. struct bio_integrity_payload *bip = dio->bio_details.bi_integrity;
  1642. if (bip) {
  1643. struct bio_vec biv;
  1644. struct bvec_iter iter;
  1645. unsigned int data_to_process = dio->range.n_sectors;
  1646. sector_to_block(ic, data_to_process);
  1647. data_to_process *= ic->tag_size;
  1648. bip_for_each_vec(biv, bip, iter) {
  1649. unsigned char *tag;
  1650. unsigned int this_len;
  1651. BUG_ON(PageHighMem(biv.bv_page));
  1652. tag = bvec_virt(&biv);
  1653. this_len = min(biv.bv_len, data_to_process);
  1654. r = dm_integrity_rw_tag(ic, tag, &dio->metadata_block, &dio->metadata_offset,
  1655. this_len, dio->op == REQ_OP_READ ? TAG_READ : TAG_WRITE);
  1656. if (unlikely(r))
  1657. goto error;
  1658. data_to_process -= this_len;
  1659. if (!data_to_process)
  1660. break;
  1661. }
  1662. }
  1663. }
  1664. skip_io:
  1665. dec_in_flight(dio);
  1666. return;
  1667. error:
  1668. dio->bi_status = errno_to_blk_status(r);
  1669. dec_in_flight(dio);
  1670. }
  1671. static inline bool dm_integrity_check_limits(struct dm_integrity_c *ic, sector_t logical_sector, struct bio *bio)
  1672. {
  1673. if (unlikely(logical_sector + bio_sectors(bio) > ic->provided_data_sectors)) {
  1674. DMERR("Too big sector number: 0x%llx + 0x%x > 0x%llx",
  1675. logical_sector, bio_sectors(bio),
  1676. ic->provided_data_sectors);
  1677. return false;
  1678. }
  1679. if (unlikely((logical_sector | bio_sectors(bio)) & (unsigned int)(ic->sectors_per_block - 1))) {
  1680. DMERR("Bio not aligned on %u sectors: 0x%llx, 0x%x",
  1681. ic->sectors_per_block,
  1682. logical_sector, bio_sectors(bio));
  1683. return false;
  1684. }
  1685. if (ic->sectors_per_block > 1 && likely(bio_op(bio) != REQ_OP_DISCARD)) {
  1686. struct bvec_iter iter;
  1687. struct bio_vec bv;
  1688. bio_for_each_segment(bv, bio, iter) {
  1689. if (unlikely(bv.bv_len & ((ic->sectors_per_block << SECTOR_SHIFT) - 1))) {
  1690. DMERR("Bio vector (%u,%u) is not aligned on %u-sector boundary",
  1691. bv.bv_offset, bv.bv_len, ic->sectors_per_block);
  1692. return false;
  1693. }
  1694. }
  1695. }
  1696. return true;
  1697. }
  1698. static int dm_integrity_map(struct dm_target *ti, struct bio *bio)
  1699. {
  1700. struct dm_integrity_c *ic = ti->private;
  1701. struct dm_integrity_io *dio = dm_per_bio_data(bio, sizeof(struct dm_integrity_io));
  1702. struct bio_integrity_payload *bip;
  1703. sector_t area, offset;
  1704. dio->ic = ic;
  1705. dio->bi_status = 0;
  1706. dio->op = bio_op(bio);
  1707. dio->ahash_req = NULL;
  1708. if (ic->mode == 'I') {
  1709. bio->bi_iter.bi_sector = dm_target_offset(ic->ti, bio->bi_iter.bi_sector);
  1710. dio->integrity_payload = NULL;
  1711. dio->integrity_payload_from_mempool = false;
  1712. dio->integrity_range_locked = false;
  1713. return dm_integrity_map_inline(dio, true);
  1714. }
  1715. if (unlikely(dio->op == REQ_OP_DISCARD)) {
  1716. if (ti->max_io_len) {
  1717. sector_t sec = dm_target_offset(ti, bio->bi_iter.bi_sector);
  1718. unsigned int log2_max_io_len = __fls(ti->max_io_len);
  1719. sector_t start_boundary = sec >> log2_max_io_len;
  1720. sector_t end_boundary = (sec + bio_sectors(bio) - 1) >> log2_max_io_len;
  1721. if (start_boundary < end_boundary) {
  1722. sector_t len = ti->max_io_len - (sec & (ti->max_io_len - 1));
  1723. dm_accept_partial_bio(bio, len);
  1724. }
  1725. }
  1726. }
  1727. if (unlikely(bio->bi_opf & REQ_PREFLUSH)) {
  1728. submit_flush_bio(ic, dio);
  1729. return DM_MAPIO_SUBMITTED;
  1730. }
  1731. dio->range.logical_sector = dm_target_offset(ti, bio->bi_iter.bi_sector);
  1732. dio->fua = dio->op == REQ_OP_WRITE && bio->bi_opf & REQ_FUA;
  1733. if (unlikely(dio->fua)) {
  1734. /*
  1735. * Don't pass down the FUA flag because we have to flush
  1736. * disk cache anyway.
  1737. */
  1738. bio->bi_opf &= ~REQ_FUA;
  1739. }
  1740. if (unlikely(!dm_integrity_check_limits(ic, dio->range.logical_sector, bio)))
  1741. return DM_MAPIO_KILL;
  1742. bip = bio_integrity(bio);
  1743. if (!ic->internal_hash) {
  1744. if (bip) {
  1745. unsigned int wanted_tag_size = bio_sectors(bio) >> ic->sb->log2_sectors_per_block;
  1746. if (ic->log2_tag_size >= 0)
  1747. wanted_tag_size <<= ic->log2_tag_size;
  1748. else
  1749. wanted_tag_size *= ic->tag_size;
  1750. if (unlikely(wanted_tag_size != bip->bip_iter.bi_size)) {
  1751. DMERR("Invalid integrity data size %u, expected %u",
  1752. bip->bip_iter.bi_size, wanted_tag_size);
  1753. return DM_MAPIO_KILL;
  1754. }
  1755. }
  1756. } else {
  1757. if (unlikely(bip != NULL)) {
  1758. DMERR("Unexpected integrity data when using internal hash");
  1759. return DM_MAPIO_KILL;
  1760. }
  1761. }
  1762. if (unlikely(ic->mode == 'R') && unlikely(dio->op != REQ_OP_READ))
  1763. return DM_MAPIO_KILL;
  1764. get_area_and_offset(ic, dio->range.logical_sector, &area, &offset);
  1765. dio->metadata_block = get_metadata_sector_and_offset(ic, area, offset, &dio->metadata_offset);
  1766. bio->bi_iter.bi_sector = get_data_sector(ic, area, offset);
  1767. dm_integrity_map_continue(dio, true);
  1768. return DM_MAPIO_SUBMITTED;
  1769. }
  1770. static bool __journal_read_write(struct dm_integrity_io *dio, struct bio *bio,
  1771. unsigned int journal_section, unsigned int journal_entry)
  1772. {
  1773. struct dm_integrity_c *ic = dio->ic;
  1774. sector_t logical_sector;
  1775. unsigned int n_sectors;
  1776. logical_sector = dio->range.logical_sector;
  1777. n_sectors = dio->range.n_sectors;
  1778. do {
  1779. struct bio_vec bv = bio_iovec(bio);
  1780. char *mem;
  1781. if (unlikely(bv.bv_len >> SECTOR_SHIFT > n_sectors))
  1782. bv.bv_len = n_sectors << SECTOR_SHIFT;
  1783. n_sectors -= bv.bv_len >> SECTOR_SHIFT;
  1784. bio_advance_iter(bio, &bio->bi_iter, bv.bv_len);
  1785. retry_kmap:
  1786. mem = kmap_local_page(bv.bv_page);
  1787. if (likely(dio->op == REQ_OP_WRITE))
  1788. flush_dcache_page(bv.bv_page);
  1789. do {
  1790. struct journal_entry *je = access_journal_entry(ic, journal_section, journal_entry);
  1791. if (unlikely(dio->op == REQ_OP_READ)) {
  1792. struct journal_sector *js;
  1793. char *mem_ptr;
  1794. unsigned int s;
  1795. if (unlikely(journal_entry_is_inprogress(je))) {
  1796. flush_dcache_page(bv.bv_page);
  1797. kunmap_local(mem);
  1798. __io_wait_event(ic->copy_to_journal_wait, !journal_entry_is_inprogress(je));
  1799. goto retry_kmap;
  1800. }
  1801. smp_rmb();
  1802. BUG_ON(journal_entry_get_sector(je) != logical_sector);
  1803. js = access_journal_data(ic, journal_section, journal_entry);
  1804. mem_ptr = mem + bv.bv_offset;
  1805. s = 0;
  1806. do {
  1807. memcpy(mem_ptr, js, JOURNAL_SECTOR_DATA);
  1808. *(commit_id_t *)(mem_ptr + JOURNAL_SECTOR_DATA) = je->last_bytes[s];
  1809. js++;
  1810. mem_ptr += 1 << SECTOR_SHIFT;
  1811. } while (++s < ic->sectors_per_block);
  1812. }
  1813. if (!ic->internal_hash) {
  1814. struct bio_integrity_payload *bip = bio_integrity(bio);
  1815. unsigned int tag_todo = ic->tag_size;
  1816. char *tag_ptr = journal_entry_tag(ic, je);
  1817. if (bip) {
  1818. do {
  1819. struct bio_vec biv = bvec_iter_bvec(bip->bip_vec, bip->bip_iter);
  1820. unsigned int tag_now = min(biv.bv_len, tag_todo);
  1821. char *tag_addr;
  1822. BUG_ON(PageHighMem(biv.bv_page));
  1823. tag_addr = bvec_virt(&biv);
  1824. if (likely(dio->op == REQ_OP_WRITE))
  1825. memcpy(tag_ptr, tag_addr, tag_now);
  1826. else
  1827. memcpy(tag_addr, tag_ptr, tag_now);
  1828. bvec_iter_advance(bip->bip_vec, &bip->bip_iter, tag_now);
  1829. tag_ptr += tag_now;
  1830. tag_todo -= tag_now;
  1831. } while (unlikely(tag_todo));
  1832. } else if (likely(dio->op == REQ_OP_WRITE))
  1833. memset(tag_ptr, 0, tag_todo);
  1834. }
  1835. if (likely(dio->op == REQ_OP_WRITE)) {
  1836. struct journal_sector *js;
  1837. unsigned int s;
  1838. js = access_journal_data(ic, journal_section, journal_entry);
  1839. memcpy(js, mem + bv.bv_offset, ic->sectors_per_block << SECTOR_SHIFT);
  1840. s = 0;
  1841. do {
  1842. je->last_bytes[s] = js[s].commit_id;
  1843. } while (++s < ic->sectors_per_block);
  1844. if (ic->internal_hash) {
  1845. unsigned int digest_size = ic->internal_hash_digestsize;
  1846. void *js_page = integrity_identity(ic, (char *)js - offset_in_page(js));
  1847. unsigned js_offset = offset_in_page(js);
  1848. if (unlikely(digest_size > ic->tag_size)) {
  1849. char checksums_onstack[HASH_MAX_DIGESTSIZE];
  1850. integrity_sector_checksum(ic, &dio->ahash_req, logical_sector, js_page, js_offset, checksums_onstack);
  1851. memcpy(journal_entry_tag(ic, je), checksums_onstack, ic->tag_size);
  1852. } else
  1853. integrity_sector_checksum(ic, &dio->ahash_req, logical_sector, js_page, js_offset, journal_entry_tag(ic, je));
  1854. }
  1855. journal_entry_set_sector(je, logical_sector);
  1856. }
  1857. logical_sector += ic->sectors_per_block;
  1858. journal_entry++;
  1859. if (unlikely(journal_entry == ic->journal_section_entries)) {
  1860. journal_entry = 0;
  1861. journal_section++;
  1862. wraparound_section(ic, &journal_section);
  1863. }
  1864. bv.bv_offset += ic->sectors_per_block << SECTOR_SHIFT;
  1865. } while (bv.bv_len -= ic->sectors_per_block << SECTOR_SHIFT);
  1866. if (unlikely(dio->op == REQ_OP_READ))
  1867. flush_dcache_page(bv.bv_page);
  1868. kunmap_local(mem);
  1869. } while (n_sectors);
  1870. if (likely(dio->op == REQ_OP_WRITE)) {
  1871. smp_mb();
  1872. if (unlikely(waitqueue_active(&ic->copy_to_journal_wait)))
  1873. wake_up(&ic->copy_to_journal_wait);
  1874. if (READ_ONCE(ic->free_sectors) <= ic->free_sectors_threshold)
  1875. queue_work(ic->commit_wq, &ic->commit_work);
  1876. else
  1877. schedule_autocommit(ic);
  1878. } else
  1879. remove_range(ic, &dio->range);
  1880. if (unlikely(bio->bi_iter.bi_size)) {
  1881. sector_t area, offset;
  1882. dio->range.logical_sector = logical_sector;
  1883. get_area_and_offset(ic, dio->range.logical_sector, &area, &offset);
  1884. dio->metadata_block = get_metadata_sector_and_offset(ic, area, offset, &dio->metadata_offset);
  1885. return true;
  1886. }
  1887. return false;
  1888. }
  1889. static void dm_integrity_map_continue(struct dm_integrity_io *dio, bool from_map)
  1890. {
  1891. struct dm_integrity_c *ic = dio->ic;
  1892. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  1893. unsigned int journal_section, journal_entry;
  1894. unsigned int journal_read_pos;
  1895. sector_t recalc_sector;
  1896. struct completion read_comp;
  1897. bool discard_retried = false;
  1898. bool need_sync_io = ic->internal_hash && dio->op == REQ_OP_READ;
  1899. if (unlikely(dio->op == REQ_OP_DISCARD) && ic->mode != 'D')
  1900. need_sync_io = true;
  1901. if (need_sync_io && from_map) {
  1902. INIT_WORK(&dio->work, integrity_bio_wait);
  1903. queue_work(ic->offload_wq, &dio->work);
  1904. return;
  1905. }
  1906. lock_retry:
  1907. spin_lock_irq(&ic->endio_wait.lock);
  1908. retry:
  1909. if (unlikely(dm_integrity_failed(ic))) {
  1910. spin_unlock_irq(&ic->endio_wait.lock);
  1911. do_endio(ic, bio);
  1912. return;
  1913. }
  1914. dio->range.n_sectors = bio_sectors(bio);
  1915. journal_read_pos = NOT_FOUND;
  1916. if (ic->mode == 'J' && likely(dio->op != REQ_OP_DISCARD)) {
  1917. if (dio->op == REQ_OP_WRITE) {
  1918. unsigned int next_entry, i, pos;
  1919. unsigned int ws, we, range_sectors;
  1920. dio->range.n_sectors = min(dio->range.n_sectors,
  1921. (sector_t)ic->free_sectors << ic->sb->log2_sectors_per_block);
  1922. if (unlikely(!dio->range.n_sectors)) {
  1923. if (from_map)
  1924. goto offload_to_thread;
  1925. sleep_on_endio_wait(ic);
  1926. goto retry;
  1927. }
  1928. range_sectors = dio->range.n_sectors >> ic->sb->log2_sectors_per_block;
  1929. ic->free_sectors -= range_sectors;
  1930. journal_section = ic->free_section;
  1931. journal_entry = ic->free_section_entry;
  1932. next_entry = ic->free_section_entry + range_sectors;
  1933. ic->free_section_entry = next_entry % ic->journal_section_entries;
  1934. ic->free_section += next_entry / ic->journal_section_entries;
  1935. ic->n_uncommitted_sections += next_entry / ic->journal_section_entries;
  1936. wraparound_section(ic, &ic->free_section);
  1937. pos = journal_section * ic->journal_section_entries + journal_entry;
  1938. ws = journal_section;
  1939. we = journal_entry;
  1940. i = 0;
  1941. do {
  1942. struct journal_entry *je;
  1943. add_journal_node(ic, &ic->journal_tree[pos], dio->range.logical_sector + i);
  1944. pos++;
  1945. if (unlikely(pos >= ic->journal_entries))
  1946. pos = 0;
  1947. je = access_journal_entry(ic, ws, we);
  1948. BUG_ON(!journal_entry_is_unused(je));
  1949. journal_entry_set_inprogress(je);
  1950. we++;
  1951. if (unlikely(we == ic->journal_section_entries)) {
  1952. we = 0;
  1953. ws++;
  1954. wraparound_section(ic, &ws);
  1955. }
  1956. } while ((i += ic->sectors_per_block) < dio->range.n_sectors);
  1957. spin_unlock_irq(&ic->endio_wait.lock);
  1958. goto journal_read_write;
  1959. } else {
  1960. sector_t next_sector;
  1961. journal_read_pos = find_journal_node(ic, dio->range.logical_sector, &next_sector);
  1962. if (likely(journal_read_pos == NOT_FOUND)) {
  1963. if (unlikely(dio->range.n_sectors > next_sector - dio->range.logical_sector))
  1964. dio->range.n_sectors = next_sector - dio->range.logical_sector;
  1965. } else {
  1966. unsigned int i;
  1967. unsigned int jp = journal_read_pos + 1;
  1968. for (i = ic->sectors_per_block; i < dio->range.n_sectors; i += ic->sectors_per_block, jp++) {
  1969. if (!test_journal_node(ic, jp, dio->range.logical_sector + i))
  1970. break;
  1971. }
  1972. dio->range.n_sectors = i;
  1973. }
  1974. }
  1975. }
  1976. if (unlikely(!add_new_range(ic, &dio->range, true))) {
  1977. /*
  1978. * We must not sleep in the request routine because it could
  1979. * stall bios on current->bio_list.
  1980. * So, we offload the bio to a workqueue if we have to sleep.
  1981. */
  1982. if (from_map) {
  1983. offload_to_thread:
  1984. spin_unlock_irq(&ic->endio_wait.lock);
  1985. INIT_WORK(&dio->work, integrity_bio_wait);
  1986. queue_work(ic->wait_wq, &dio->work);
  1987. return;
  1988. }
  1989. if (journal_read_pos != NOT_FOUND)
  1990. dio->range.n_sectors = ic->sectors_per_block;
  1991. wait_and_add_new_range(ic, &dio->range);
  1992. /*
  1993. * wait_and_add_new_range drops the spinlock, so the journal
  1994. * may have been changed arbitrarily. We need to recheck.
  1995. * To simplify the code, we restrict I/O size to just one block.
  1996. */
  1997. if (journal_read_pos != NOT_FOUND) {
  1998. sector_t next_sector;
  1999. unsigned int new_pos;
  2000. new_pos = find_journal_node(ic, dio->range.logical_sector, &next_sector);
  2001. if (unlikely(new_pos != journal_read_pos)) {
  2002. remove_range_unlocked(ic, &dio->range);
  2003. goto retry;
  2004. }
  2005. }
  2006. }
  2007. if (ic->mode == 'J' && likely(dio->op == REQ_OP_DISCARD) && !discard_retried) {
  2008. sector_t next_sector;
  2009. unsigned int new_pos;
  2010. new_pos = find_journal_node(ic, dio->range.logical_sector, &next_sector);
  2011. if (unlikely(new_pos != NOT_FOUND) ||
  2012. unlikely(next_sector < dio->range.logical_sector + dio->range.n_sectors)) {
  2013. remove_range_unlocked(ic, &dio->range);
  2014. spin_unlock_irq(&ic->endio_wait.lock);
  2015. queue_work(ic->commit_wq, &ic->commit_work);
  2016. flush_workqueue(ic->commit_wq);
  2017. queue_work(ic->writer_wq, &ic->writer_work);
  2018. flush_workqueue(ic->writer_wq);
  2019. discard_retried = true;
  2020. goto lock_retry;
  2021. }
  2022. }
  2023. recalc_sector = le64_to_cpu(ic->sb->recalc_sector);
  2024. spin_unlock_irq(&ic->endio_wait.lock);
  2025. if (unlikely(journal_read_pos != NOT_FOUND)) {
  2026. journal_section = journal_read_pos / ic->journal_section_entries;
  2027. journal_entry = journal_read_pos % ic->journal_section_entries;
  2028. goto journal_read_write;
  2029. }
  2030. if (ic->mode == 'B' && (dio->op == REQ_OP_WRITE || unlikely(dio->op == REQ_OP_DISCARD))) {
  2031. if (!block_bitmap_op(ic, ic->may_write_bitmap, dio->range.logical_sector,
  2032. dio->range.n_sectors, BITMAP_OP_TEST_ALL_SET)) {
  2033. struct bitmap_block_status *bbs;
  2034. bbs = sector_to_bitmap_block(ic, dio->range.logical_sector);
  2035. spin_lock(&bbs->bio_queue_lock);
  2036. bio_list_add(&bbs->bio_queue, bio);
  2037. spin_unlock(&bbs->bio_queue_lock);
  2038. queue_work(ic->writer_wq, &bbs->work);
  2039. return;
  2040. }
  2041. }
  2042. dio->in_flight = (atomic_t)ATOMIC_INIT(2);
  2043. if (need_sync_io) {
  2044. init_completion(&read_comp);
  2045. dio->completion = &read_comp;
  2046. } else
  2047. dio->completion = NULL;
  2048. dm_bio_record(&dio->bio_details, bio);
  2049. bio_set_dev(bio, ic->dev->bdev);
  2050. bio->bi_integrity = NULL;
  2051. bio->bi_opf &= ~REQ_INTEGRITY;
  2052. bio->bi_end_io = integrity_end_io;
  2053. bio->bi_iter.bi_size = dio->range.n_sectors << SECTOR_SHIFT;
  2054. if (unlikely(dio->op == REQ_OP_DISCARD) && likely(ic->mode != 'D')) {
  2055. integrity_metadata(&dio->work);
  2056. dm_integrity_flush_buffers(ic, false);
  2057. dio->in_flight = (atomic_t)ATOMIC_INIT(1);
  2058. dio->completion = NULL;
  2059. submit_bio_noacct(bio);
  2060. return;
  2061. }
  2062. submit_bio_noacct(bio);
  2063. if (need_sync_io) {
  2064. wait_for_completion_io(&read_comp);
  2065. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING) &&
  2066. dio->range.logical_sector + dio->range.n_sectors > recalc_sector)
  2067. goto skip_check;
  2068. if (ic->mode == 'B') {
  2069. if (!block_bitmap_op(ic, ic->recalc_bitmap, dio->range.logical_sector,
  2070. dio->range.n_sectors, BITMAP_OP_TEST_ALL_CLEAR))
  2071. goto skip_check;
  2072. }
  2073. if (likely(!bio->bi_status))
  2074. integrity_metadata(&dio->work);
  2075. else
  2076. skip_check:
  2077. dec_in_flight(dio);
  2078. } else {
  2079. INIT_WORK(&dio->work, integrity_metadata);
  2080. queue_work(ic->metadata_wq, &dio->work);
  2081. }
  2082. return;
  2083. journal_read_write:
  2084. if (unlikely(__journal_read_write(dio, bio, journal_section, journal_entry)))
  2085. goto lock_retry;
  2086. do_endio_flush(ic, dio);
  2087. }
  2088. static int dm_integrity_map_inline(struct dm_integrity_io *dio, bool from_map)
  2089. {
  2090. struct dm_integrity_c *ic = dio->ic;
  2091. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  2092. struct bio_integrity_payload *bip;
  2093. unsigned ret;
  2094. sector_t recalc_sector;
  2095. if (unlikely(bio_integrity(bio))) {
  2096. bio->bi_status = BLK_STS_NOTSUPP;
  2097. bio_endio(bio);
  2098. return DM_MAPIO_SUBMITTED;
  2099. }
  2100. bio_set_dev(bio, ic->dev->bdev);
  2101. if (unlikely((bio->bi_opf & REQ_PREFLUSH) != 0))
  2102. return DM_MAPIO_REMAPPED;
  2103. retry:
  2104. if (!dio->integrity_payload) {
  2105. unsigned digest_size, extra_size;
  2106. dio->payload_len = ic->tuple_size * (bio_sectors(bio) >> ic->sb->log2_sectors_per_block);
  2107. digest_size = ic->internal_hash_digestsize;
  2108. extra_size = unlikely(digest_size > ic->tag_size) ? digest_size - ic->tag_size : 0;
  2109. dio->payload_len += extra_size;
  2110. dio->integrity_payload = kmalloc(dio->payload_len, GFP_NOIO | __GFP_NORETRY | __GFP_NOMEMALLOC | __GFP_NOWARN);
  2111. if (unlikely(!dio->integrity_payload)) {
  2112. const unsigned x_size = PAGE_SIZE << 1;
  2113. if (dio->payload_len > x_size) {
  2114. unsigned sectors = ((x_size - extra_size) / ic->tuple_size) << ic->sb->log2_sectors_per_block;
  2115. if (WARN_ON(!sectors || sectors >= bio_sectors(bio))) {
  2116. bio->bi_status = BLK_STS_NOTSUPP;
  2117. bio_endio(bio);
  2118. return DM_MAPIO_SUBMITTED;
  2119. }
  2120. dm_accept_partial_bio(bio, sectors);
  2121. goto retry;
  2122. }
  2123. }
  2124. }
  2125. dio->range.logical_sector = bio->bi_iter.bi_sector;
  2126. dio->range.n_sectors = bio_sectors(bio);
  2127. if (!(ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING)))
  2128. goto skip_spinlock;
  2129. #ifdef CONFIG_64BIT
  2130. /*
  2131. * On 64-bit CPUs we can optimize the lock away (so that it won't cause
  2132. * cache line bouncing) and use acquire/release barriers instead.
  2133. *
  2134. * Paired with smp_store_release in integrity_recalc_inline.
  2135. */
  2136. recalc_sector = le64_to_cpu(smp_load_acquire(&ic->sb->recalc_sector));
  2137. if (likely(dio->range.logical_sector + dio->range.n_sectors <= recalc_sector))
  2138. goto skip_spinlock;
  2139. #endif
  2140. spin_lock_irq(&ic->endio_wait.lock);
  2141. recalc_sector = le64_to_cpu(ic->sb->recalc_sector);
  2142. if (dio->range.logical_sector + dio->range.n_sectors <= recalc_sector)
  2143. goto skip_unlock;
  2144. if (unlikely(!add_new_range(ic, &dio->range, true))) {
  2145. if (from_map) {
  2146. spin_unlock_irq(&ic->endio_wait.lock);
  2147. INIT_WORK(&dio->work, integrity_bio_wait);
  2148. queue_work(ic->wait_wq, &dio->work);
  2149. return DM_MAPIO_SUBMITTED;
  2150. }
  2151. wait_and_add_new_range(ic, &dio->range);
  2152. }
  2153. dio->integrity_range_locked = true;
  2154. skip_unlock:
  2155. spin_unlock_irq(&ic->endio_wait.lock);
  2156. skip_spinlock:
  2157. if (unlikely(!dio->integrity_payload)) {
  2158. dio->integrity_payload = page_to_virt((struct page *)mempool_alloc(&ic->recheck_pool, GFP_NOIO));
  2159. dio->integrity_payload_from_mempool = true;
  2160. }
  2161. dio->bio_details.bi_iter = bio->bi_iter;
  2162. if (unlikely(!dm_integrity_check_limits(ic, bio->bi_iter.bi_sector, bio))) {
  2163. return DM_MAPIO_KILL;
  2164. }
  2165. bio->bi_iter.bi_sector += ic->start + SB_SECTORS;
  2166. bip = bio_integrity_alloc(bio, GFP_NOIO, 1);
  2167. if (IS_ERR(bip)) {
  2168. bio->bi_status = errno_to_blk_status(PTR_ERR(bip));
  2169. bio_endio(bio);
  2170. return DM_MAPIO_SUBMITTED;
  2171. }
  2172. if (dio->op == REQ_OP_WRITE) {
  2173. unsigned pos = 0;
  2174. while (dio->bio_details.bi_iter.bi_size) {
  2175. struct bio_vec bv = bio_iter_iovec(bio, dio->bio_details.bi_iter);
  2176. const char *mem = integrity_kmap(ic, bv.bv_page);
  2177. if (ic->tag_size < ic->tuple_size)
  2178. memset(dio->integrity_payload + pos + ic->tag_size, 0, ic->tuple_size - ic->tuple_size);
  2179. integrity_sector_checksum(ic, &dio->ahash_req, dio->bio_details.bi_iter.bi_sector, mem, bv.bv_offset, dio->integrity_payload + pos);
  2180. integrity_kunmap(ic, mem);
  2181. pos += ic->tuple_size;
  2182. bio_advance_iter_single(bio, &dio->bio_details.bi_iter, ic->sectors_per_block << SECTOR_SHIFT);
  2183. }
  2184. }
  2185. ret = bio_integrity_add_page(bio, virt_to_page(dio->integrity_payload),
  2186. dio->payload_len, offset_in_page(dio->integrity_payload));
  2187. if (unlikely(ret != dio->payload_len)) {
  2188. bio->bi_status = BLK_STS_RESOURCE;
  2189. bio_endio(bio);
  2190. return DM_MAPIO_SUBMITTED;
  2191. }
  2192. return DM_MAPIO_REMAPPED;
  2193. }
  2194. static inline void dm_integrity_free_payload(struct dm_integrity_io *dio)
  2195. {
  2196. struct dm_integrity_c *ic = dio->ic;
  2197. if (unlikely(dio->integrity_payload_from_mempool))
  2198. mempool_free(virt_to_page(dio->integrity_payload), &ic->recheck_pool);
  2199. else
  2200. kfree(dio->integrity_payload);
  2201. dio->integrity_payload = NULL;
  2202. dio->integrity_payload_from_mempool = false;
  2203. }
  2204. static void dm_integrity_inline_recheck(struct work_struct *w)
  2205. {
  2206. struct dm_integrity_io *dio = container_of(w, struct dm_integrity_io, work);
  2207. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  2208. struct dm_integrity_c *ic = dio->ic;
  2209. struct bio *outgoing_bio;
  2210. void *outgoing_data;
  2211. dio->integrity_payload = page_to_virt((struct page *)mempool_alloc(&ic->recheck_pool, GFP_NOIO));
  2212. dio->integrity_payload_from_mempool = true;
  2213. outgoing_data = dio->integrity_payload + PAGE_SIZE;
  2214. while (dio->bio_details.bi_iter.bi_size) {
  2215. char digest[HASH_MAX_DIGESTSIZE];
  2216. int r;
  2217. struct bio_integrity_payload *bip;
  2218. struct bio_vec bv;
  2219. char *mem;
  2220. outgoing_bio = bio_alloc_bioset(ic->dev->bdev, 1, REQ_OP_READ, GFP_NOIO, &ic->recheck_bios);
  2221. bio_add_virt_nofail(outgoing_bio, outgoing_data,
  2222. ic->sectors_per_block << SECTOR_SHIFT);
  2223. bip = bio_integrity_alloc(outgoing_bio, GFP_NOIO, 1);
  2224. if (IS_ERR(bip)) {
  2225. bio_put(outgoing_bio);
  2226. bio->bi_status = errno_to_blk_status(PTR_ERR(bip));
  2227. bio_endio(bio);
  2228. return;
  2229. }
  2230. r = bio_integrity_add_page(outgoing_bio, virt_to_page(dio->integrity_payload), ic->tuple_size, 0);
  2231. if (unlikely(r != ic->tuple_size)) {
  2232. bio_put(outgoing_bio);
  2233. bio->bi_status = BLK_STS_RESOURCE;
  2234. bio_endio(bio);
  2235. return;
  2236. }
  2237. outgoing_bio->bi_iter.bi_sector = dio->bio_details.bi_iter.bi_sector + ic->start + SB_SECTORS;
  2238. r = submit_bio_wait(outgoing_bio);
  2239. if (unlikely(r != 0)) {
  2240. bio_put(outgoing_bio);
  2241. bio->bi_status = errno_to_blk_status(r);
  2242. bio_endio(bio);
  2243. return;
  2244. }
  2245. bio_put(outgoing_bio);
  2246. integrity_sector_checksum(ic, &dio->ahash_req, dio->bio_details.bi_iter.bi_sector, integrity_identity(ic, outgoing_data), 0, digest);
  2247. if (unlikely(crypto_memneq(digest, dio->integrity_payload, min(ic->internal_hash_digestsize, ic->tag_size)))) {
  2248. DMERR_LIMIT("%pg: Checksum failed at sector 0x%llx",
  2249. ic->dev->bdev, dio->bio_details.bi_iter.bi_sector);
  2250. atomic64_inc(&ic->number_of_mismatches);
  2251. dm_audit_log_bio(DM_MSG_PREFIX, "integrity-checksum",
  2252. bio, dio->bio_details.bi_iter.bi_sector, 0);
  2253. bio->bi_status = BLK_STS_PROTECTION;
  2254. bio_endio(bio);
  2255. return;
  2256. }
  2257. bv = bio_iter_iovec(bio, dio->bio_details.bi_iter);
  2258. mem = bvec_kmap_local(&bv);
  2259. memcpy(mem, outgoing_data, ic->sectors_per_block << SECTOR_SHIFT);
  2260. kunmap_local(mem);
  2261. bio_advance_iter_single(bio, &dio->bio_details.bi_iter, ic->sectors_per_block << SECTOR_SHIFT);
  2262. }
  2263. bio_endio(bio);
  2264. }
  2265. static inline bool dm_integrity_check(struct dm_integrity_c *ic, struct dm_integrity_io *dio)
  2266. {
  2267. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  2268. unsigned pos = 0;
  2269. while (dio->bio_details.bi_iter.bi_size) {
  2270. char digest[HASH_MAX_DIGESTSIZE];
  2271. struct bio_vec bv = bio_iter_iovec(bio, dio->bio_details.bi_iter);
  2272. char *mem = integrity_kmap(ic, bv.bv_page);
  2273. integrity_sector_checksum(ic, &dio->ahash_req, dio->bio_details.bi_iter.bi_sector, mem, bv.bv_offset, digest);
  2274. if (unlikely(crypto_memneq(digest, dio->integrity_payload + pos,
  2275. min(ic->internal_hash_digestsize, ic->tag_size)))) {
  2276. integrity_kunmap(ic, mem);
  2277. dm_integrity_free_payload(dio);
  2278. INIT_WORK(&dio->work, dm_integrity_inline_recheck);
  2279. queue_work(ic->offload_wq, &dio->work);
  2280. return false;
  2281. }
  2282. integrity_kunmap(ic, mem);
  2283. pos += ic->tuple_size;
  2284. bio_advance_iter_single(bio, &dio->bio_details.bi_iter, ic->sectors_per_block << SECTOR_SHIFT);
  2285. }
  2286. return true;
  2287. }
  2288. static void dm_integrity_inline_async_check(struct work_struct *w)
  2289. {
  2290. struct dm_integrity_io *dio = container_of(w, struct dm_integrity_io, work);
  2291. struct dm_integrity_c *ic = dio->ic;
  2292. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  2293. if (likely(dm_integrity_check(ic, dio)))
  2294. bio_endio(bio);
  2295. }
  2296. static int dm_integrity_end_io(struct dm_target *ti, struct bio *bio, blk_status_t *status)
  2297. {
  2298. struct dm_integrity_c *ic = ti->private;
  2299. struct dm_integrity_io *dio = dm_per_bio_data(bio, sizeof(struct dm_integrity_io));
  2300. if (ic->mode == 'I') {
  2301. if (dio->op == REQ_OP_READ && likely(*status == BLK_STS_OK) && likely(dio->bio_details.bi_iter.bi_size != 0)) {
  2302. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING) &&
  2303. unlikely(dio->integrity_range_locked))
  2304. goto skip_check;
  2305. if (likely(ic->internal_shash != NULL)) {
  2306. if (unlikely(!dm_integrity_check(ic, dio)))
  2307. return DM_ENDIO_INCOMPLETE;
  2308. } else {
  2309. INIT_WORK(&dio->work, dm_integrity_inline_async_check);
  2310. queue_work(ic->offload_wq, &dio->work);
  2311. return DM_ENDIO_INCOMPLETE;
  2312. }
  2313. }
  2314. skip_check:
  2315. dm_integrity_free_payload(dio);
  2316. if (unlikely(dio->integrity_range_locked))
  2317. remove_range(ic, &dio->range);
  2318. }
  2319. if (unlikely(dio->ahash_req))
  2320. mempool_free(dio->ahash_req, &ic->ahash_req_pool);
  2321. return DM_ENDIO_DONE;
  2322. }
  2323. static void integrity_bio_wait(struct work_struct *w)
  2324. {
  2325. struct dm_integrity_io *dio = container_of(w, struct dm_integrity_io, work);
  2326. struct dm_integrity_c *ic = dio->ic;
  2327. if (ic->mode == 'I') {
  2328. struct bio *bio = dm_bio_from_per_bio_data(dio, sizeof(struct dm_integrity_io));
  2329. int r = dm_integrity_map_inline(dio, false);
  2330. switch (r) {
  2331. case DM_MAPIO_KILL:
  2332. bio->bi_status = BLK_STS_IOERR;
  2333. fallthrough;
  2334. case DM_MAPIO_REMAPPED:
  2335. submit_bio_noacct(bio);
  2336. fallthrough;
  2337. case DM_MAPIO_SUBMITTED:
  2338. return;
  2339. default:
  2340. BUG();
  2341. }
  2342. } else {
  2343. dm_integrity_map_continue(dio, false);
  2344. }
  2345. }
  2346. static void pad_uncommitted(struct dm_integrity_c *ic)
  2347. {
  2348. if (ic->free_section_entry) {
  2349. ic->free_sectors -= ic->journal_section_entries - ic->free_section_entry;
  2350. ic->free_section_entry = 0;
  2351. ic->free_section++;
  2352. wraparound_section(ic, &ic->free_section);
  2353. ic->n_uncommitted_sections++;
  2354. }
  2355. if (WARN_ON(ic->journal_sections * ic->journal_section_entries !=
  2356. (ic->n_uncommitted_sections + ic->n_committed_sections) *
  2357. ic->journal_section_entries + ic->free_sectors)) {
  2358. DMCRIT("journal_sections %u, journal_section_entries %u, "
  2359. "n_uncommitted_sections %u, n_committed_sections %u, "
  2360. "journal_section_entries %u, free_sectors %u",
  2361. ic->journal_sections, ic->journal_section_entries,
  2362. ic->n_uncommitted_sections, ic->n_committed_sections,
  2363. ic->journal_section_entries, ic->free_sectors);
  2364. }
  2365. }
  2366. static void integrity_commit(struct work_struct *w)
  2367. {
  2368. struct dm_integrity_c *ic = container_of(w, struct dm_integrity_c, commit_work);
  2369. unsigned int commit_start, commit_sections;
  2370. unsigned int i, j, n;
  2371. struct bio *flushes;
  2372. timer_delete(&ic->autocommit_timer);
  2373. if (ic->mode == 'I')
  2374. return;
  2375. spin_lock_irq(&ic->endio_wait.lock);
  2376. flushes = bio_list_get(&ic->flush_bio_list);
  2377. if (unlikely(ic->mode != 'J')) {
  2378. spin_unlock_irq(&ic->endio_wait.lock);
  2379. dm_integrity_flush_buffers(ic, true);
  2380. goto release_flush_bios;
  2381. }
  2382. pad_uncommitted(ic);
  2383. commit_start = ic->uncommitted_section;
  2384. commit_sections = ic->n_uncommitted_sections;
  2385. spin_unlock_irq(&ic->endio_wait.lock);
  2386. if (!commit_sections)
  2387. goto release_flush_bios;
  2388. ic->wrote_to_journal = true;
  2389. i = commit_start;
  2390. for (n = 0; n < commit_sections; n++) {
  2391. for (j = 0; j < ic->journal_section_entries; j++) {
  2392. struct journal_entry *je;
  2393. je = access_journal_entry(ic, i, j);
  2394. io_wait_event(ic->copy_to_journal_wait, !journal_entry_is_inprogress(je));
  2395. }
  2396. for (j = 0; j < ic->journal_section_sectors; j++) {
  2397. struct journal_sector *js;
  2398. js = access_journal(ic, i, j);
  2399. js->commit_id = dm_integrity_commit_id(ic, i, j, ic->commit_seq);
  2400. }
  2401. i++;
  2402. if (unlikely(i >= ic->journal_sections))
  2403. ic->commit_seq = next_commit_seq(ic->commit_seq);
  2404. wraparound_section(ic, &i);
  2405. }
  2406. smp_rmb();
  2407. write_journal(ic, commit_start, commit_sections);
  2408. spin_lock_irq(&ic->endio_wait.lock);
  2409. ic->uncommitted_section += commit_sections;
  2410. wraparound_section(ic, &ic->uncommitted_section);
  2411. ic->n_uncommitted_sections -= commit_sections;
  2412. ic->n_committed_sections += commit_sections;
  2413. spin_unlock_irq(&ic->endio_wait.lock);
  2414. if (READ_ONCE(ic->free_sectors) <= ic->free_sectors_threshold)
  2415. queue_work(ic->writer_wq, &ic->writer_work);
  2416. release_flush_bios:
  2417. while (flushes) {
  2418. struct bio *next = flushes->bi_next;
  2419. flushes->bi_next = NULL;
  2420. do_endio(ic, flushes);
  2421. flushes = next;
  2422. }
  2423. }
  2424. static void complete_copy_from_journal(unsigned long error, void *context)
  2425. {
  2426. struct journal_io *io = context;
  2427. struct journal_completion *comp = io->comp;
  2428. struct dm_integrity_c *ic = comp->ic;
  2429. remove_range(ic, &io->range);
  2430. mempool_free(io, &ic->journal_io_mempool);
  2431. if (unlikely(error != 0))
  2432. dm_integrity_io_error(ic, "copying from journal", -EIO);
  2433. complete_journal_op(comp);
  2434. }
  2435. static void restore_last_bytes(struct dm_integrity_c *ic, struct journal_sector *js,
  2436. struct journal_entry *je)
  2437. {
  2438. unsigned int s = 0;
  2439. do {
  2440. js->commit_id = je->last_bytes[s];
  2441. js++;
  2442. } while (++s < ic->sectors_per_block);
  2443. }
  2444. static void do_journal_write(struct dm_integrity_c *ic, unsigned int write_start,
  2445. unsigned int write_sections, bool from_replay)
  2446. {
  2447. unsigned int i, j, n;
  2448. struct journal_completion comp;
  2449. struct blk_plug plug;
  2450. blk_start_plug(&plug);
  2451. comp.ic = ic;
  2452. comp.in_flight = (atomic_t)ATOMIC_INIT(1);
  2453. init_completion(&comp.comp);
  2454. i = write_start;
  2455. for (n = 0; n < write_sections; n++, i++, wraparound_section(ic, &i)) {
  2456. #ifndef INTERNAL_VERIFY
  2457. if (unlikely(from_replay))
  2458. #endif
  2459. rw_section_mac(ic, i, false);
  2460. for (j = 0; j < ic->journal_section_entries; j++) {
  2461. struct journal_entry *je = access_journal_entry(ic, i, j);
  2462. sector_t sec, area, offset;
  2463. unsigned int k, l, next_loop;
  2464. sector_t metadata_block;
  2465. unsigned int metadata_offset;
  2466. struct journal_io *io;
  2467. if (journal_entry_is_unused(je))
  2468. continue;
  2469. BUG_ON(unlikely(journal_entry_is_inprogress(je)) && !from_replay);
  2470. sec = journal_entry_get_sector(je);
  2471. if (unlikely(from_replay)) {
  2472. if (unlikely(sec & (unsigned int)(ic->sectors_per_block - 1))) {
  2473. dm_integrity_io_error(ic, "invalid sector in journal", -EIO);
  2474. sec &= ~(sector_t)(ic->sectors_per_block - 1);
  2475. }
  2476. if (unlikely(sec >= ic->provided_data_sectors)) {
  2477. journal_entry_set_unused(je);
  2478. continue;
  2479. }
  2480. }
  2481. get_area_and_offset(ic, sec, &area, &offset);
  2482. restore_last_bytes(ic, access_journal_data(ic, i, j), je);
  2483. for (k = j + 1; k < ic->journal_section_entries; k++) {
  2484. struct journal_entry *je2 = access_journal_entry(ic, i, k);
  2485. sector_t sec2, area2, offset2;
  2486. if (journal_entry_is_unused(je2))
  2487. break;
  2488. BUG_ON(unlikely(journal_entry_is_inprogress(je2)) && !from_replay);
  2489. sec2 = journal_entry_get_sector(je2);
  2490. if (unlikely(sec2 >= ic->provided_data_sectors))
  2491. break;
  2492. get_area_and_offset(ic, sec2, &area2, &offset2);
  2493. if (area2 != area || offset2 != offset + ((k - j) << ic->sb->log2_sectors_per_block))
  2494. break;
  2495. restore_last_bytes(ic, access_journal_data(ic, i, k), je2);
  2496. }
  2497. next_loop = k - 1;
  2498. io = mempool_alloc(&ic->journal_io_mempool, GFP_NOIO);
  2499. io->comp = &comp;
  2500. io->range.logical_sector = sec;
  2501. io->range.n_sectors = (k - j) << ic->sb->log2_sectors_per_block;
  2502. spin_lock_irq(&ic->endio_wait.lock);
  2503. add_new_range_and_wait(ic, &io->range);
  2504. if (likely(!from_replay)) {
  2505. struct journal_node *section_node = &ic->journal_tree[i * ic->journal_section_entries];
  2506. /* don't write if there is newer committed sector */
  2507. while (j < k && find_newer_committed_node(ic, &section_node[j])) {
  2508. struct journal_entry *je2 = access_journal_entry(ic, i, j);
  2509. journal_entry_set_unused(je2);
  2510. remove_journal_node(ic, &section_node[j]);
  2511. j++;
  2512. sec += ic->sectors_per_block;
  2513. offset += ic->sectors_per_block;
  2514. }
  2515. while (j < k && find_newer_committed_node(ic, &section_node[k - 1])) {
  2516. struct journal_entry *je2 = access_journal_entry(ic, i, k - 1);
  2517. journal_entry_set_unused(je2);
  2518. remove_journal_node(ic, &section_node[k - 1]);
  2519. k--;
  2520. }
  2521. if (j == k) {
  2522. remove_range_unlocked(ic, &io->range);
  2523. spin_unlock_irq(&ic->endio_wait.lock);
  2524. mempool_free(io, &ic->journal_io_mempool);
  2525. goto skip_io;
  2526. }
  2527. for (l = j; l < k; l++)
  2528. remove_journal_node(ic, &section_node[l]);
  2529. }
  2530. spin_unlock_irq(&ic->endio_wait.lock);
  2531. metadata_block = get_metadata_sector_and_offset(ic, area, offset, &metadata_offset);
  2532. for (l = j; l < k; l++) {
  2533. int r;
  2534. struct journal_entry *je2 = access_journal_entry(ic, i, l);
  2535. if (
  2536. #ifndef INTERNAL_VERIFY
  2537. unlikely(from_replay) &&
  2538. #endif
  2539. ic->internal_hash) {
  2540. char test_tag[MAX_T(size_t, HASH_MAX_DIGESTSIZE, MAX_TAG_SIZE)];
  2541. struct journal_sector *js = access_journal_data(ic, i, l);
  2542. void *js_page = integrity_identity(ic, (char *)js - offset_in_page(js));
  2543. unsigned js_offset = offset_in_page(js);
  2544. integrity_sector_checksum(ic, &ic->journal_ahash_req, sec + ((l - j) << ic->sb->log2_sectors_per_block),
  2545. js_page, js_offset, test_tag);
  2546. if (unlikely(crypto_memneq(test_tag, journal_entry_tag(ic, je2), ic->tag_size))) {
  2547. dm_integrity_io_error(ic, "tag mismatch when replaying journal", -EILSEQ);
  2548. dm_audit_log_target(DM_MSG_PREFIX, "integrity-replay-journal", ic->ti, 0);
  2549. }
  2550. }
  2551. journal_entry_set_unused(je2);
  2552. r = dm_integrity_rw_tag(ic, journal_entry_tag(ic, je2), &metadata_block, &metadata_offset,
  2553. ic->tag_size, TAG_WRITE);
  2554. if (unlikely(r))
  2555. dm_integrity_io_error(ic, "reading tags", r);
  2556. }
  2557. atomic_inc(&comp.in_flight);
  2558. copy_from_journal(ic, i, j << ic->sb->log2_sectors_per_block,
  2559. (k - j) << ic->sb->log2_sectors_per_block,
  2560. get_data_sector(ic, area, offset),
  2561. complete_copy_from_journal, io);
  2562. skip_io:
  2563. j = next_loop;
  2564. }
  2565. }
  2566. dm_bufio_write_dirty_buffers_async(ic->bufio);
  2567. blk_finish_plug(&plug);
  2568. complete_journal_op(&comp);
  2569. wait_for_completion_io(&comp.comp);
  2570. dm_integrity_flush_buffers(ic, true);
  2571. }
  2572. static void integrity_writer(struct work_struct *w)
  2573. {
  2574. struct dm_integrity_c *ic = container_of(w, struct dm_integrity_c, writer_work);
  2575. unsigned int write_start, write_sections;
  2576. unsigned int prev_free_sectors;
  2577. spin_lock_irq(&ic->endio_wait.lock);
  2578. write_start = ic->committed_section;
  2579. write_sections = ic->n_committed_sections;
  2580. spin_unlock_irq(&ic->endio_wait.lock);
  2581. if (!write_sections)
  2582. return;
  2583. do_journal_write(ic, write_start, write_sections, false);
  2584. spin_lock_irq(&ic->endio_wait.lock);
  2585. ic->committed_section += write_sections;
  2586. wraparound_section(ic, &ic->committed_section);
  2587. ic->n_committed_sections -= write_sections;
  2588. prev_free_sectors = ic->free_sectors;
  2589. ic->free_sectors += write_sections * ic->journal_section_entries;
  2590. if (unlikely(!prev_free_sectors))
  2591. wake_up_locked(&ic->endio_wait);
  2592. spin_unlock_irq(&ic->endio_wait.lock);
  2593. }
  2594. static void recalc_write_super(struct dm_integrity_c *ic)
  2595. {
  2596. int r;
  2597. dm_integrity_flush_buffers(ic, false);
  2598. if (dm_integrity_failed(ic))
  2599. return;
  2600. r = sync_rw_sb(ic, REQ_OP_WRITE);
  2601. if (unlikely(r))
  2602. dm_integrity_io_error(ic, "writing superblock", r);
  2603. }
  2604. static void integrity_recalc(struct work_struct *w)
  2605. {
  2606. struct dm_integrity_c *ic = container_of(w, struct dm_integrity_c, recalc_work);
  2607. size_t recalc_tags_size;
  2608. u8 *recalc_buffer = NULL;
  2609. u8 *recalc_tags = NULL;
  2610. struct ahash_request *ahash_req = NULL;
  2611. struct dm_integrity_range range;
  2612. struct dm_io_request io_req;
  2613. struct dm_io_region io_loc;
  2614. sector_t area, offset;
  2615. sector_t metadata_block;
  2616. unsigned int metadata_offset;
  2617. sector_t logical_sector, n_sectors;
  2618. __u8 *t;
  2619. unsigned int i;
  2620. int r;
  2621. unsigned int super_counter = 0;
  2622. unsigned recalc_sectors = RECALC_SECTORS;
  2623. retry:
  2624. recalc_buffer = kmalloc(recalc_sectors << SECTOR_SHIFT, GFP_NOIO | __GFP_NOWARN);
  2625. if (!recalc_buffer) {
  2626. oom:
  2627. recalc_sectors >>= 1;
  2628. if (recalc_sectors >= 1U << ic->sb->log2_sectors_per_block)
  2629. goto retry;
  2630. DMCRIT("out of memory for recalculate buffer - recalculation disabled");
  2631. goto free_ret;
  2632. }
  2633. recalc_tags_size = (recalc_sectors >> ic->sb->log2_sectors_per_block) * ic->tag_size;
  2634. if (ic->internal_hash_digestsize > ic->tag_size)
  2635. recalc_tags_size += ic->internal_hash_digestsize - ic->tag_size;
  2636. recalc_tags = kvmalloc(recalc_tags_size, GFP_NOIO);
  2637. if (!recalc_tags) {
  2638. kfree(recalc_buffer);
  2639. recalc_buffer = NULL;
  2640. goto oom;
  2641. }
  2642. DEBUG_print("start recalculation... (position %llx)\n", le64_to_cpu(ic->sb->recalc_sector));
  2643. spin_lock_irq(&ic->endio_wait.lock);
  2644. next_chunk:
  2645. if (unlikely(dm_post_suspending(ic->ti)))
  2646. goto unlock_ret;
  2647. range.logical_sector = le64_to_cpu(ic->sb->recalc_sector);
  2648. if (unlikely(range.logical_sector >= ic->provided_data_sectors)) {
  2649. if (ic->mode == 'B') {
  2650. block_bitmap_op(ic, ic->recalc_bitmap, 0, ic->provided_data_sectors, BITMAP_OP_CLEAR);
  2651. DEBUG_print("queue_delayed_work: bitmap_flush_work\n");
  2652. queue_delayed_work(ic->commit_wq, &ic->bitmap_flush_work, 0);
  2653. }
  2654. goto unlock_ret;
  2655. }
  2656. get_area_and_offset(ic, range.logical_sector, &area, &offset);
  2657. range.n_sectors = min((sector_t)recalc_sectors, ic->provided_data_sectors - range.logical_sector);
  2658. if (!ic->meta_dev)
  2659. range.n_sectors = min(range.n_sectors, ((sector_t)1U << ic->sb->log2_interleave_sectors) - (unsigned int)offset);
  2660. add_new_range_and_wait(ic, &range);
  2661. spin_unlock_irq(&ic->endio_wait.lock);
  2662. logical_sector = range.logical_sector;
  2663. n_sectors = range.n_sectors;
  2664. if (ic->mode == 'B') {
  2665. if (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector, n_sectors, BITMAP_OP_TEST_ALL_CLEAR))
  2666. goto advance_and_next;
  2667. while (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector,
  2668. ic->sectors_per_block, BITMAP_OP_TEST_ALL_CLEAR)) {
  2669. logical_sector += ic->sectors_per_block;
  2670. n_sectors -= ic->sectors_per_block;
  2671. cond_resched();
  2672. }
  2673. while (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector + n_sectors - ic->sectors_per_block,
  2674. ic->sectors_per_block, BITMAP_OP_TEST_ALL_CLEAR)) {
  2675. n_sectors -= ic->sectors_per_block;
  2676. cond_resched();
  2677. }
  2678. get_area_and_offset(ic, logical_sector, &area, &offset);
  2679. }
  2680. DEBUG_print("recalculating: %llx, %llx\n", logical_sector, n_sectors);
  2681. if (unlikely(++super_counter == RECALC_WRITE_SUPER)) {
  2682. recalc_write_super(ic);
  2683. if (ic->mode == 'B')
  2684. queue_delayed_work(ic->commit_wq, &ic->bitmap_flush_work, ic->bitmap_flush_interval);
  2685. super_counter = 0;
  2686. }
  2687. if (unlikely(dm_integrity_failed(ic)))
  2688. goto err;
  2689. io_req.bi_opf = REQ_OP_READ;
  2690. io_req.mem.type = DM_IO_KMEM;
  2691. io_req.mem.ptr.addr = recalc_buffer;
  2692. io_req.notify.fn = NULL;
  2693. io_req.client = ic->io;
  2694. io_loc.bdev = ic->dev->bdev;
  2695. io_loc.sector = get_data_sector(ic, area, offset);
  2696. io_loc.count = n_sectors;
  2697. r = dm_io(&io_req, 1, &io_loc, NULL, IOPRIO_DEFAULT);
  2698. if (unlikely(r)) {
  2699. dm_integrity_io_error(ic, "reading data", r);
  2700. goto err;
  2701. }
  2702. t = recalc_tags;
  2703. for (i = 0; i < n_sectors; i += ic->sectors_per_block) {
  2704. void *ptr = recalc_buffer + (i << SECTOR_SHIFT);
  2705. void *ptr_page = integrity_identity(ic, (char *)ptr - offset_in_page(ptr));
  2706. unsigned ptr_offset = offset_in_page(ptr);
  2707. integrity_sector_checksum(ic, &ahash_req, logical_sector + i, ptr_page, ptr_offset, t);
  2708. t += ic->tag_size;
  2709. }
  2710. metadata_block = get_metadata_sector_and_offset(ic, area, offset, &metadata_offset);
  2711. r = dm_integrity_rw_tag(ic, recalc_tags, &metadata_block, &metadata_offset, t - recalc_tags, TAG_WRITE);
  2712. if (unlikely(r)) {
  2713. dm_integrity_io_error(ic, "writing tags", r);
  2714. goto err;
  2715. }
  2716. if (ic->mode == 'B') {
  2717. sector_t start, end;
  2718. start = (range.logical_sector >>
  2719. (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit)) <<
  2720. (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit);
  2721. end = ((range.logical_sector + range.n_sectors) >>
  2722. (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit)) <<
  2723. (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit);
  2724. block_bitmap_op(ic, ic->recalc_bitmap, start, end - start, BITMAP_OP_CLEAR);
  2725. }
  2726. advance_and_next:
  2727. cond_resched();
  2728. spin_lock_irq(&ic->endio_wait.lock);
  2729. remove_range_unlocked(ic, &range);
  2730. ic->sb->recalc_sector = cpu_to_le64(range.logical_sector + range.n_sectors);
  2731. goto next_chunk;
  2732. err:
  2733. remove_range(ic, &range);
  2734. goto free_ret;
  2735. unlock_ret:
  2736. spin_unlock_irq(&ic->endio_wait.lock);
  2737. recalc_write_super(ic);
  2738. free_ret:
  2739. kfree(recalc_buffer);
  2740. kvfree(recalc_tags);
  2741. mempool_free(ahash_req, &ic->ahash_req_pool);
  2742. }
  2743. static void integrity_recalc_inline(struct work_struct *w)
  2744. {
  2745. struct dm_integrity_c *ic = container_of(w, struct dm_integrity_c, recalc_work);
  2746. size_t recalc_tags_size;
  2747. u8 *recalc_buffer = NULL;
  2748. u8 *recalc_tags = NULL;
  2749. struct ahash_request *ahash_req = NULL;
  2750. struct dm_integrity_range range;
  2751. struct bio *bio;
  2752. struct bio_integrity_payload *bip;
  2753. __u8 *t;
  2754. unsigned int i;
  2755. int r;
  2756. unsigned ret;
  2757. unsigned int super_counter = 0;
  2758. unsigned recalc_sectors = RECALC_SECTORS;
  2759. retry:
  2760. recalc_buffer = kmalloc(recalc_sectors << SECTOR_SHIFT, GFP_NOIO | __GFP_NOWARN);
  2761. if (!recalc_buffer) {
  2762. oom:
  2763. recalc_sectors >>= 1;
  2764. if (recalc_sectors >= 1U << ic->sb->log2_sectors_per_block)
  2765. goto retry;
  2766. DMCRIT("out of memory for recalculate buffer - recalculation disabled");
  2767. goto free_ret;
  2768. }
  2769. recalc_tags_size = (recalc_sectors >> ic->sb->log2_sectors_per_block) * ic->tuple_size;
  2770. if (ic->internal_hash_digestsize > ic->tuple_size)
  2771. recalc_tags_size += ic->internal_hash_digestsize - ic->tuple_size;
  2772. recalc_tags = kmalloc(recalc_tags_size, GFP_NOIO | __GFP_NOWARN);
  2773. if (!recalc_tags) {
  2774. kfree(recalc_buffer);
  2775. recalc_buffer = NULL;
  2776. goto oom;
  2777. }
  2778. spin_lock_irq(&ic->endio_wait.lock);
  2779. next_chunk:
  2780. if (unlikely(dm_post_suspending(ic->ti)))
  2781. goto unlock_ret;
  2782. range.logical_sector = le64_to_cpu(ic->sb->recalc_sector);
  2783. if (unlikely(range.logical_sector >= ic->provided_data_sectors))
  2784. goto unlock_ret;
  2785. range.n_sectors = min((sector_t)recalc_sectors, ic->provided_data_sectors - range.logical_sector);
  2786. add_new_range_and_wait(ic, &range);
  2787. spin_unlock_irq(&ic->endio_wait.lock);
  2788. if (unlikely(++super_counter == RECALC_WRITE_SUPER)) {
  2789. recalc_write_super(ic);
  2790. super_counter = 0;
  2791. }
  2792. if (unlikely(dm_integrity_failed(ic)))
  2793. goto err;
  2794. DEBUG_print("recalculating: %llx - %llx\n", range.logical_sector, range.n_sectors);
  2795. bio = bio_alloc_bioset(ic->dev->bdev, 1, REQ_OP_READ, GFP_NOIO, &ic->recalc_bios);
  2796. bio->bi_iter.bi_sector = ic->start + SB_SECTORS + range.logical_sector;
  2797. bio_add_virt_nofail(bio, recalc_buffer,
  2798. range.n_sectors << SECTOR_SHIFT);
  2799. r = submit_bio_wait(bio);
  2800. bio_put(bio);
  2801. if (unlikely(r)) {
  2802. dm_integrity_io_error(ic, "reading data", r);
  2803. goto err;
  2804. }
  2805. t = recalc_tags;
  2806. for (i = 0; i < range.n_sectors; i += ic->sectors_per_block) {
  2807. void *ptr = recalc_buffer + (i << SECTOR_SHIFT);
  2808. void *ptr_page = integrity_identity(ic, (char *)ptr - offset_in_page(ptr));
  2809. unsigned ptr_offset = offset_in_page(ptr);
  2810. memset(t, 0, ic->tuple_size);
  2811. integrity_sector_checksum(ic, &ahash_req, range.logical_sector + i, ptr_page, ptr_offset, t);
  2812. t += ic->tuple_size;
  2813. }
  2814. bio = bio_alloc_bioset(ic->dev->bdev, 1, REQ_OP_WRITE, GFP_NOIO, &ic->recalc_bios);
  2815. bio->bi_iter.bi_sector = ic->start + SB_SECTORS + range.logical_sector;
  2816. bio_add_virt_nofail(bio, recalc_buffer,
  2817. range.n_sectors << SECTOR_SHIFT);
  2818. bip = bio_integrity_alloc(bio, GFP_NOIO, 1);
  2819. if (unlikely(IS_ERR(bip))) {
  2820. bio_put(bio);
  2821. DMCRIT("out of memory for bio integrity payload - recalculation disabled");
  2822. goto err;
  2823. }
  2824. ret = bio_integrity_add_page(bio, virt_to_page(recalc_tags), t - recalc_tags, offset_in_page(recalc_tags));
  2825. if (unlikely(ret != t - recalc_tags)) {
  2826. bio_put(bio);
  2827. dm_integrity_io_error(ic, "attaching integrity tags", -ENOMEM);
  2828. goto err;
  2829. }
  2830. r = submit_bio_wait(bio);
  2831. bio_put(bio);
  2832. if (unlikely(r)) {
  2833. dm_integrity_io_error(ic, "writing data", r);
  2834. goto err;
  2835. }
  2836. cond_resched();
  2837. spin_lock_irq(&ic->endio_wait.lock);
  2838. remove_range_unlocked(ic, &range);
  2839. #ifdef CONFIG_64BIT
  2840. /* Paired with smp_load_acquire in dm_integrity_map_inline. */
  2841. smp_store_release(&ic->sb->recalc_sector, cpu_to_le64(range.logical_sector + range.n_sectors));
  2842. #else
  2843. ic->sb->recalc_sector = cpu_to_le64(range.logical_sector + range.n_sectors);
  2844. #endif
  2845. goto next_chunk;
  2846. err:
  2847. remove_range(ic, &range);
  2848. goto free_ret;
  2849. unlock_ret:
  2850. spin_unlock_irq(&ic->endio_wait.lock);
  2851. recalc_write_super(ic);
  2852. free_ret:
  2853. kfree(recalc_buffer);
  2854. kfree(recalc_tags);
  2855. mempool_free(ahash_req, &ic->ahash_req_pool);
  2856. }
  2857. static void bitmap_block_work(struct work_struct *w)
  2858. {
  2859. struct bitmap_block_status *bbs = container_of(w, struct bitmap_block_status, work);
  2860. struct dm_integrity_c *ic = bbs->ic;
  2861. struct bio *bio;
  2862. struct bio_list bio_queue;
  2863. struct bio_list waiting;
  2864. bio_list_init(&waiting);
  2865. spin_lock(&bbs->bio_queue_lock);
  2866. bio_queue = bbs->bio_queue;
  2867. bio_list_init(&bbs->bio_queue);
  2868. spin_unlock(&bbs->bio_queue_lock);
  2869. while ((bio = bio_list_pop(&bio_queue))) {
  2870. struct dm_integrity_io *dio;
  2871. dio = dm_per_bio_data(bio, sizeof(struct dm_integrity_io));
  2872. if (block_bitmap_op(ic, ic->may_write_bitmap, dio->range.logical_sector,
  2873. dio->range.n_sectors, BITMAP_OP_TEST_ALL_SET)) {
  2874. remove_range(ic, &dio->range);
  2875. INIT_WORK(&dio->work, integrity_bio_wait);
  2876. queue_work(ic->offload_wq, &dio->work);
  2877. } else {
  2878. block_bitmap_op(ic, ic->journal, dio->range.logical_sector,
  2879. dio->range.n_sectors, BITMAP_OP_SET);
  2880. bio_list_add(&waiting, bio);
  2881. }
  2882. }
  2883. if (bio_list_empty(&waiting))
  2884. return;
  2885. rw_journal_sectors(ic, REQ_OP_WRITE | REQ_FUA | REQ_SYNC,
  2886. bbs->idx * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT),
  2887. BITMAP_BLOCK_SIZE >> SECTOR_SHIFT, NULL);
  2888. while ((bio = bio_list_pop(&waiting))) {
  2889. struct dm_integrity_io *dio = dm_per_bio_data(bio, sizeof(struct dm_integrity_io));
  2890. block_bitmap_op(ic, ic->may_write_bitmap, dio->range.logical_sector,
  2891. dio->range.n_sectors, BITMAP_OP_SET);
  2892. remove_range(ic, &dio->range);
  2893. INIT_WORK(&dio->work, integrity_bio_wait);
  2894. queue_work(ic->offload_wq, &dio->work);
  2895. }
  2896. queue_delayed_work(ic->commit_wq, &ic->bitmap_flush_work, ic->bitmap_flush_interval);
  2897. }
  2898. static void bitmap_flush_work(struct work_struct *work)
  2899. {
  2900. struct dm_integrity_c *ic = container_of(work, struct dm_integrity_c, bitmap_flush_work.work);
  2901. struct dm_integrity_range range;
  2902. unsigned long limit;
  2903. struct bio *bio;
  2904. dm_integrity_flush_buffers(ic, false);
  2905. range.logical_sector = 0;
  2906. range.n_sectors = ic->provided_data_sectors;
  2907. spin_lock_irq(&ic->endio_wait.lock);
  2908. add_new_range_and_wait(ic, &range);
  2909. spin_unlock_irq(&ic->endio_wait.lock);
  2910. dm_integrity_flush_buffers(ic, true);
  2911. limit = ic->provided_data_sectors;
  2912. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING)) {
  2913. limit = le64_to_cpu(ic->sb->recalc_sector)
  2914. >> (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit)
  2915. << (ic->sb->log2_sectors_per_block + ic->log2_blocks_per_bitmap_bit);
  2916. }
  2917. /*DEBUG_print("zeroing journal\n");*/
  2918. block_bitmap_op(ic, ic->journal, 0, limit, BITMAP_OP_CLEAR);
  2919. block_bitmap_op(ic, ic->may_write_bitmap, 0, limit, BITMAP_OP_CLEAR);
  2920. rw_journal_sectors(ic, REQ_OP_WRITE | REQ_FUA | REQ_SYNC, 0,
  2921. ic->n_bitmap_blocks * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT), NULL);
  2922. spin_lock_irq(&ic->endio_wait.lock);
  2923. remove_range_unlocked(ic, &range);
  2924. while (unlikely((bio = bio_list_pop(&ic->synchronous_bios)) != NULL)) {
  2925. bio_endio(bio);
  2926. spin_unlock_irq(&ic->endio_wait.lock);
  2927. spin_lock_irq(&ic->endio_wait.lock);
  2928. }
  2929. spin_unlock_irq(&ic->endio_wait.lock);
  2930. }
  2931. static void init_journal(struct dm_integrity_c *ic, unsigned int start_section,
  2932. unsigned int n_sections, unsigned char commit_seq)
  2933. {
  2934. unsigned int i, j, n;
  2935. if (!n_sections)
  2936. return;
  2937. for (n = 0; n < n_sections; n++) {
  2938. i = start_section + n;
  2939. wraparound_section(ic, &i);
  2940. for (j = 0; j < ic->journal_section_sectors; j++) {
  2941. struct journal_sector *js = access_journal(ic, i, j);
  2942. BUILD_BUG_ON(sizeof(js->sectors) != JOURNAL_SECTOR_DATA);
  2943. memset(&js->sectors, 0, sizeof(js->sectors));
  2944. js->commit_id = dm_integrity_commit_id(ic, i, j, commit_seq);
  2945. }
  2946. for (j = 0; j < ic->journal_section_entries; j++) {
  2947. struct journal_entry *je = access_journal_entry(ic, i, j);
  2948. journal_entry_set_unused(je);
  2949. }
  2950. }
  2951. write_journal(ic, start_section, n_sections);
  2952. }
  2953. static int find_commit_seq(struct dm_integrity_c *ic, unsigned int i, unsigned int j, commit_id_t id)
  2954. {
  2955. unsigned char k;
  2956. for (k = 0; k < N_COMMIT_IDS; k++) {
  2957. if (dm_integrity_commit_id(ic, i, j, k) == id)
  2958. return k;
  2959. }
  2960. dm_integrity_io_error(ic, "journal commit id", -EIO);
  2961. return -EIO;
  2962. }
  2963. static void replay_journal(struct dm_integrity_c *ic)
  2964. {
  2965. unsigned int i, j;
  2966. bool used_commit_ids[N_COMMIT_IDS];
  2967. unsigned int max_commit_id_sections[N_COMMIT_IDS];
  2968. unsigned int write_start, write_sections;
  2969. unsigned int continue_section;
  2970. bool journal_empty;
  2971. unsigned char unused, last_used, want_commit_seq;
  2972. if (ic->mode == 'R')
  2973. return;
  2974. if (ic->journal_uptodate)
  2975. return;
  2976. last_used = 0;
  2977. write_start = 0;
  2978. if (!ic->just_formatted) {
  2979. DEBUG_print("reading journal\n");
  2980. rw_journal(ic, REQ_OP_READ, 0, ic->journal_sections, NULL);
  2981. if (ic->journal_io)
  2982. DEBUG_bytes(lowmem_page_address(ic->journal_io[0].page), 64, "read journal");
  2983. if (ic->journal_io) {
  2984. struct journal_completion crypt_comp;
  2985. crypt_comp.ic = ic;
  2986. init_completion(&crypt_comp.comp);
  2987. crypt_comp.in_flight = (atomic_t)ATOMIC_INIT(0);
  2988. encrypt_journal(ic, false, 0, ic->journal_sections, &crypt_comp);
  2989. wait_for_completion(&crypt_comp.comp);
  2990. }
  2991. DEBUG_bytes(lowmem_page_address(ic->journal[0].page), 64, "decrypted journal");
  2992. }
  2993. if (dm_integrity_failed(ic))
  2994. goto clear_journal;
  2995. journal_empty = true;
  2996. memset(used_commit_ids, 0, sizeof(used_commit_ids));
  2997. memset(max_commit_id_sections, 0, sizeof(max_commit_id_sections));
  2998. for (i = 0; i < ic->journal_sections; i++) {
  2999. for (j = 0; j < ic->journal_section_sectors; j++) {
  3000. int k;
  3001. struct journal_sector *js = access_journal(ic, i, j);
  3002. k = find_commit_seq(ic, i, j, js->commit_id);
  3003. if (k < 0)
  3004. goto clear_journal;
  3005. used_commit_ids[k] = true;
  3006. max_commit_id_sections[k] = i;
  3007. }
  3008. if (journal_empty) {
  3009. for (j = 0; j < ic->journal_section_entries; j++) {
  3010. struct journal_entry *je = access_journal_entry(ic, i, j);
  3011. if (!journal_entry_is_unused(je)) {
  3012. journal_empty = false;
  3013. break;
  3014. }
  3015. }
  3016. }
  3017. }
  3018. if (!used_commit_ids[N_COMMIT_IDS - 1]) {
  3019. unused = N_COMMIT_IDS - 1;
  3020. while (unused && !used_commit_ids[unused - 1])
  3021. unused--;
  3022. } else {
  3023. for (unused = 0; unused < N_COMMIT_IDS; unused++)
  3024. if (!used_commit_ids[unused])
  3025. break;
  3026. if (unused == N_COMMIT_IDS) {
  3027. dm_integrity_io_error(ic, "journal commit ids", -EIO);
  3028. goto clear_journal;
  3029. }
  3030. }
  3031. DEBUG_print("first unused commit seq %d [%d,%d,%d,%d]\n",
  3032. unused, used_commit_ids[0], used_commit_ids[1],
  3033. used_commit_ids[2], used_commit_ids[3]);
  3034. last_used = prev_commit_seq(unused);
  3035. want_commit_seq = prev_commit_seq(last_used);
  3036. if (!used_commit_ids[want_commit_seq] && used_commit_ids[prev_commit_seq(want_commit_seq)])
  3037. journal_empty = true;
  3038. write_start = max_commit_id_sections[last_used] + 1;
  3039. if (unlikely(write_start >= ic->journal_sections))
  3040. want_commit_seq = next_commit_seq(want_commit_seq);
  3041. wraparound_section(ic, &write_start);
  3042. i = write_start;
  3043. for (write_sections = 0; write_sections < ic->journal_sections; write_sections++) {
  3044. for (j = 0; j < ic->journal_section_sectors; j++) {
  3045. struct journal_sector *js = access_journal(ic, i, j);
  3046. if (js->commit_id != dm_integrity_commit_id(ic, i, j, want_commit_seq)) {
  3047. /*
  3048. * This could be caused by crash during writing.
  3049. * We won't replay the inconsistent part of the
  3050. * journal.
  3051. */
  3052. DEBUG_print("commit id mismatch at position (%u, %u): %d != %d\n",
  3053. i, j, find_commit_seq(ic, i, j, js->commit_id), want_commit_seq);
  3054. goto brk;
  3055. }
  3056. }
  3057. i++;
  3058. if (unlikely(i >= ic->journal_sections))
  3059. want_commit_seq = next_commit_seq(want_commit_seq);
  3060. wraparound_section(ic, &i);
  3061. }
  3062. brk:
  3063. if (!journal_empty) {
  3064. DEBUG_print("replaying %u sections, starting at %u, commit seq %d\n",
  3065. write_sections, write_start, want_commit_seq);
  3066. do_journal_write(ic, write_start, write_sections, true);
  3067. }
  3068. if (write_sections == ic->journal_sections && (ic->mode == 'J' || journal_empty)) {
  3069. continue_section = write_start;
  3070. ic->commit_seq = want_commit_seq;
  3071. DEBUG_print("continuing from section %u, commit seq %d\n", write_start, ic->commit_seq);
  3072. } else {
  3073. unsigned int s;
  3074. unsigned char erase_seq;
  3075. clear_journal:
  3076. DEBUG_print("clearing journal\n");
  3077. erase_seq = prev_commit_seq(prev_commit_seq(last_used));
  3078. s = write_start;
  3079. init_journal(ic, s, 1, erase_seq);
  3080. s++;
  3081. wraparound_section(ic, &s);
  3082. if (ic->journal_sections >= 2) {
  3083. init_journal(ic, s, ic->journal_sections - 2, erase_seq);
  3084. s += ic->journal_sections - 2;
  3085. wraparound_section(ic, &s);
  3086. init_journal(ic, s, 1, erase_seq);
  3087. }
  3088. continue_section = 0;
  3089. ic->commit_seq = next_commit_seq(erase_seq);
  3090. }
  3091. ic->committed_section = continue_section;
  3092. ic->n_committed_sections = 0;
  3093. ic->uncommitted_section = continue_section;
  3094. ic->n_uncommitted_sections = 0;
  3095. ic->free_section = continue_section;
  3096. ic->free_section_entry = 0;
  3097. ic->free_sectors = ic->journal_entries;
  3098. ic->journal_tree_root = RB_ROOT;
  3099. for (i = 0; i < ic->journal_entries; i++)
  3100. init_journal_node(&ic->journal_tree[i]);
  3101. }
  3102. static void dm_integrity_enter_synchronous_mode(struct dm_integrity_c *ic)
  3103. {
  3104. DEBUG_print("%s\n", __func__);
  3105. if (ic->mode == 'B') {
  3106. ic->bitmap_flush_interval = msecs_to_jiffies(10) + 1;
  3107. ic->synchronous_mode = 1;
  3108. cancel_delayed_work_sync(&ic->bitmap_flush_work);
  3109. queue_delayed_work(ic->commit_wq, &ic->bitmap_flush_work, 0);
  3110. flush_workqueue(ic->commit_wq);
  3111. }
  3112. }
  3113. static int dm_integrity_reboot(struct notifier_block *n, unsigned long code, void *x)
  3114. {
  3115. struct dm_integrity_c *ic = container_of(n, struct dm_integrity_c, reboot_notifier);
  3116. DEBUG_print("%s\n", __func__);
  3117. dm_integrity_enter_synchronous_mode(ic);
  3118. return NOTIFY_DONE;
  3119. }
  3120. static void dm_integrity_postsuspend(struct dm_target *ti)
  3121. {
  3122. struct dm_integrity_c *ic = ti->private;
  3123. int r;
  3124. WARN_ON(unregister_reboot_notifier(&ic->reboot_notifier));
  3125. timer_delete_sync(&ic->autocommit_timer);
  3126. if (ic->recalc_wq)
  3127. drain_workqueue(ic->recalc_wq);
  3128. if (ic->mode == 'B')
  3129. cancel_delayed_work_sync(&ic->bitmap_flush_work);
  3130. queue_work(ic->commit_wq, &ic->commit_work);
  3131. drain_workqueue(ic->commit_wq);
  3132. if (ic->mode == 'J') {
  3133. queue_work(ic->writer_wq, &ic->writer_work);
  3134. drain_workqueue(ic->writer_wq);
  3135. dm_integrity_flush_buffers(ic, true);
  3136. if (ic->wrote_to_journal) {
  3137. init_journal(ic, ic->free_section,
  3138. ic->journal_sections - ic->free_section, ic->commit_seq);
  3139. if (ic->free_section) {
  3140. init_journal(ic, 0, ic->free_section,
  3141. next_commit_seq(ic->commit_seq));
  3142. }
  3143. }
  3144. }
  3145. if (ic->mode == 'B') {
  3146. dm_integrity_flush_buffers(ic, true);
  3147. #if 1
  3148. /* set to 0 to test bitmap replay code */
  3149. init_journal(ic, 0, ic->journal_sections, 0);
  3150. ic->sb->flags &= ~cpu_to_le32(SB_FLAG_DIRTY_BITMAP);
  3151. r = sync_rw_sb(ic, REQ_OP_WRITE | REQ_FUA);
  3152. if (unlikely(r))
  3153. dm_integrity_io_error(ic, "writing superblock", r);
  3154. #endif
  3155. }
  3156. BUG_ON(!RB_EMPTY_ROOT(&ic->in_progress));
  3157. ic->journal_uptodate = true;
  3158. }
  3159. static void dm_integrity_resume(struct dm_target *ti)
  3160. {
  3161. struct dm_integrity_c *ic = ti->private;
  3162. __u64 old_provided_data_sectors = le64_to_cpu(ic->sb->provided_data_sectors);
  3163. int r;
  3164. __le32 flags;
  3165. DEBUG_print("resume\n");
  3166. ic->wrote_to_journal = false;
  3167. flags = ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING);
  3168. r = sync_rw_sb(ic, REQ_OP_READ);
  3169. if (r)
  3170. dm_integrity_io_error(ic, "reading superblock", r);
  3171. if ((ic->sb->flags & flags) != flags) {
  3172. ic->sb->flags |= flags;
  3173. r = sync_rw_sb(ic, REQ_OP_WRITE | REQ_FUA);
  3174. if (unlikely(r))
  3175. dm_integrity_io_error(ic, "writing superblock", r);
  3176. }
  3177. if (ic->provided_data_sectors != old_provided_data_sectors) {
  3178. if (ic->provided_data_sectors > old_provided_data_sectors &&
  3179. ic->mode == 'B' &&
  3180. ic->sb->flags & cpu_to_le32(SB_FLAG_DIRTY_BITMAP) &&
  3181. ic->sb->log2_blocks_per_bitmap_bit == ic->log2_blocks_per_bitmap_bit) {
  3182. rw_journal_sectors(ic, REQ_OP_READ, 0,
  3183. ic->n_bitmap_blocks * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT), NULL);
  3184. block_bitmap_op(ic, ic->journal, old_provided_data_sectors,
  3185. ic->provided_data_sectors - old_provided_data_sectors, BITMAP_OP_SET);
  3186. rw_journal_sectors(ic, REQ_OP_WRITE | REQ_FUA | REQ_SYNC, 0,
  3187. ic->n_bitmap_blocks * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT), NULL);
  3188. }
  3189. ic->sb->provided_data_sectors = cpu_to_le64(ic->provided_data_sectors);
  3190. r = sync_rw_sb(ic, REQ_OP_WRITE | REQ_FUA);
  3191. if (unlikely(r))
  3192. dm_integrity_io_error(ic, "writing superblock", r);
  3193. }
  3194. if (ic->sb->flags & cpu_to_le32(SB_FLAG_DIRTY_BITMAP)) {
  3195. DEBUG_print("resume dirty_bitmap\n");
  3196. rw_journal_sectors(ic, REQ_OP_READ, 0,
  3197. ic->n_bitmap_blocks * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT), NULL);
  3198. if (ic->mode == 'B') {
  3199. if (ic->sb->log2_blocks_per_bitmap_bit == ic->log2_blocks_per_bitmap_bit &&
  3200. !ic->reset_recalculate_flag) {
  3201. block_bitmap_copy(ic, ic->recalc_bitmap, ic->journal);
  3202. block_bitmap_copy(ic, ic->may_write_bitmap, ic->journal);
  3203. if (!block_bitmap_op(ic, ic->journal, 0, ic->provided_data_sectors,
  3204. BITMAP_OP_TEST_ALL_CLEAR)) {
  3205. ic->sb->flags |= cpu_to_le32(SB_FLAG_RECALCULATING);
  3206. ic->sb->recalc_sector = cpu_to_le64(0);
  3207. }
  3208. } else {
  3209. DEBUG_print("non-matching blocks_per_bitmap_bit: %u, %u\n",
  3210. ic->sb->log2_blocks_per_bitmap_bit, ic->log2_blocks_per_bitmap_bit);
  3211. ic->sb->log2_blocks_per_bitmap_bit = ic->log2_blocks_per_bitmap_bit;
  3212. block_bitmap_op(ic, ic->recalc_bitmap, 0, ic->provided_data_sectors, BITMAP_OP_SET);
  3213. block_bitmap_op(ic, ic->may_write_bitmap, 0, ic->provided_data_sectors, BITMAP_OP_SET);
  3214. block_bitmap_op(ic, ic->journal, 0, ic->provided_data_sectors, BITMAP_OP_SET);
  3215. rw_journal_sectors(ic, REQ_OP_WRITE | REQ_FUA | REQ_SYNC, 0,
  3216. ic->n_bitmap_blocks * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT), NULL);
  3217. ic->sb->flags |= cpu_to_le32(SB_FLAG_RECALCULATING);
  3218. ic->sb->recalc_sector = cpu_to_le64(0);
  3219. }
  3220. } else {
  3221. if (!(ic->sb->log2_blocks_per_bitmap_bit == ic->log2_blocks_per_bitmap_bit &&
  3222. block_bitmap_op(ic, ic->journal, 0, ic->provided_data_sectors, BITMAP_OP_TEST_ALL_CLEAR)) ||
  3223. ic->reset_recalculate_flag) {
  3224. ic->sb->flags |= cpu_to_le32(SB_FLAG_RECALCULATING);
  3225. ic->sb->recalc_sector = cpu_to_le64(0);
  3226. }
  3227. init_journal(ic, 0, ic->journal_sections, 0);
  3228. replay_journal(ic);
  3229. ic->sb->flags &= ~cpu_to_le32(SB_FLAG_DIRTY_BITMAP);
  3230. }
  3231. r = sync_rw_sb(ic, REQ_OP_WRITE | REQ_FUA);
  3232. if (unlikely(r))
  3233. dm_integrity_io_error(ic, "writing superblock", r);
  3234. } else {
  3235. replay_journal(ic);
  3236. if (ic->reset_recalculate_flag) {
  3237. ic->sb->flags |= cpu_to_le32(SB_FLAG_RECALCULATING);
  3238. ic->sb->recalc_sector = cpu_to_le64(0);
  3239. }
  3240. if (ic->mode == 'B') {
  3241. ic->sb->flags |= cpu_to_le32(SB_FLAG_DIRTY_BITMAP);
  3242. ic->sb->log2_blocks_per_bitmap_bit = ic->log2_blocks_per_bitmap_bit;
  3243. r = sync_rw_sb(ic, REQ_OP_WRITE | REQ_FUA);
  3244. if (unlikely(r))
  3245. dm_integrity_io_error(ic, "writing superblock", r);
  3246. block_bitmap_op(ic, ic->journal, 0, ic->provided_data_sectors, BITMAP_OP_CLEAR);
  3247. block_bitmap_op(ic, ic->recalc_bitmap, 0, ic->provided_data_sectors, BITMAP_OP_CLEAR);
  3248. block_bitmap_op(ic, ic->may_write_bitmap, 0, ic->provided_data_sectors, BITMAP_OP_CLEAR);
  3249. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING) &&
  3250. le64_to_cpu(ic->sb->recalc_sector) < ic->provided_data_sectors) {
  3251. block_bitmap_op(ic, ic->journal, le64_to_cpu(ic->sb->recalc_sector),
  3252. ic->provided_data_sectors - le64_to_cpu(ic->sb->recalc_sector), BITMAP_OP_SET);
  3253. block_bitmap_op(ic, ic->recalc_bitmap, le64_to_cpu(ic->sb->recalc_sector),
  3254. ic->provided_data_sectors - le64_to_cpu(ic->sb->recalc_sector), BITMAP_OP_SET);
  3255. block_bitmap_op(ic, ic->may_write_bitmap, le64_to_cpu(ic->sb->recalc_sector),
  3256. ic->provided_data_sectors - le64_to_cpu(ic->sb->recalc_sector), BITMAP_OP_SET);
  3257. }
  3258. rw_journal_sectors(ic, REQ_OP_WRITE | REQ_FUA | REQ_SYNC, 0,
  3259. ic->n_bitmap_blocks * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT), NULL);
  3260. }
  3261. }
  3262. DEBUG_print("testing recalc: %x\n", ic->sb->flags);
  3263. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING)) {
  3264. __u64 recalc_pos = le64_to_cpu(ic->sb->recalc_sector);
  3265. DEBUG_print("recalc pos: %llx / %llx\n", recalc_pos, ic->provided_data_sectors);
  3266. if (recalc_pos < ic->provided_data_sectors) {
  3267. queue_work(ic->recalc_wq, &ic->recalc_work);
  3268. } else if (recalc_pos > ic->provided_data_sectors) {
  3269. ic->sb->recalc_sector = cpu_to_le64(ic->provided_data_sectors);
  3270. recalc_write_super(ic);
  3271. }
  3272. }
  3273. ic->reboot_notifier.notifier_call = dm_integrity_reboot;
  3274. ic->reboot_notifier.next = NULL;
  3275. ic->reboot_notifier.priority = INT_MAX - 1; /* be notified after md and before hardware drivers */
  3276. WARN_ON(register_reboot_notifier(&ic->reboot_notifier));
  3277. #if 0
  3278. /* set to 1 to stress test synchronous mode */
  3279. dm_integrity_enter_synchronous_mode(ic);
  3280. #endif
  3281. }
  3282. static void dm_integrity_status(struct dm_target *ti, status_type_t type,
  3283. unsigned int status_flags, char *result, unsigned int maxlen)
  3284. {
  3285. struct dm_integrity_c *ic = ti->private;
  3286. unsigned int arg_count;
  3287. size_t sz = 0;
  3288. switch (type) {
  3289. case STATUSTYPE_INFO:
  3290. DMEMIT("%llu %llu",
  3291. (unsigned long long)atomic64_read(&ic->number_of_mismatches),
  3292. ic->provided_data_sectors);
  3293. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING))
  3294. DMEMIT(" %llu", le64_to_cpu(ic->sb->recalc_sector));
  3295. else
  3296. DMEMIT(" -");
  3297. break;
  3298. case STATUSTYPE_TABLE: {
  3299. arg_count = 1; /* buffer_sectors */
  3300. arg_count += !!ic->meta_dev;
  3301. arg_count += ic->sectors_per_block != 1;
  3302. arg_count += !!(ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING));
  3303. arg_count += ic->reset_recalculate_flag;
  3304. arg_count += ic->discard;
  3305. arg_count += ic->mode != 'I'; /* interleave_sectors */
  3306. arg_count += ic->mode == 'J'; /* journal_sectors */
  3307. arg_count += ic->mode == 'J'; /* journal_watermark */
  3308. arg_count += ic->mode == 'J'; /* commit_time */
  3309. arg_count += ic->mode == 'B'; /* sectors_per_bit */
  3310. arg_count += ic->mode == 'B'; /* bitmap_flush_interval */
  3311. arg_count += !!ic->internal_hash_alg.alg_string;
  3312. arg_count += !!ic->journal_crypt_alg.alg_string;
  3313. arg_count += !!ic->journal_mac_alg.alg_string;
  3314. arg_count += (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_PADDING)) != 0;
  3315. arg_count += (ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) != 0;
  3316. arg_count += ic->legacy_recalculate;
  3317. DMEMIT("%s %llu %u %c %u", ic->dev->name, ic->start,
  3318. ic->tag_size, ic->mode, arg_count);
  3319. if (ic->meta_dev)
  3320. DMEMIT(" meta_device:%s", ic->meta_dev->name);
  3321. if (ic->sectors_per_block != 1)
  3322. DMEMIT(" block_size:%u", ic->sectors_per_block << SECTOR_SHIFT);
  3323. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING))
  3324. DMEMIT(" recalculate");
  3325. if (ic->reset_recalculate_flag)
  3326. DMEMIT(" reset_recalculate");
  3327. if (ic->discard)
  3328. DMEMIT(" allow_discards");
  3329. if (ic->mode != 'I')
  3330. DMEMIT(" interleave_sectors:%u", 1U << ic->sb->log2_interleave_sectors);
  3331. DMEMIT(" buffer_sectors:%u", 1U << ic->log2_buffer_sectors);
  3332. if (ic->mode == 'J') {
  3333. __u64 watermark_percentage = (__u64)(ic->journal_entries - ic->free_sectors_threshold) * 100;
  3334. watermark_percentage += ic->journal_entries / 2;
  3335. do_div(watermark_percentage, ic->journal_entries);
  3336. DMEMIT(" journal_sectors:%u", ic->initial_sectors - SB_SECTORS);
  3337. DMEMIT(" journal_watermark:%u", (unsigned int)watermark_percentage);
  3338. DMEMIT(" commit_time:%u", ic->autocommit_msec);
  3339. }
  3340. if (ic->mode == 'B') {
  3341. DMEMIT(" sectors_per_bit:%llu", (sector_t)ic->sectors_per_block << ic->log2_blocks_per_bitmap_bit);
  3342. DMEMIT(" bitmap_flush_interval:%u", jiffies_to_msecs(ic->bitmap_flush_interval));
  3343. }
  3344. if ((ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_PADDING)) != 0)
  3345. DMEMIT(" fix_padding");
  3346. if ((ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) != 0)
  3347. DMEMIT(" fix_hmac");
  3348. if (ic->legacy_recalculate)
  3349. DMEMIT(" legacy_recalculate");
  3350. #define EMIT_ALG(a, n) \
  3351. do { \
  3352. if (ic->a.alg_string) { \
  3353. DMEMIT(" %s:%s", n, ic->a.alg_string); \
  3354. if (ic->a.key_string) \
  3355. DMEMIT(":%s", ic->a.key_string);\
  3356. } \
  3357. } while (0)
  3358. EMIT_ALG(internal_hash_alg, "internal_hash");
  3359. EMIT_ALG(journal_crypt_alg, "journal_crypt");
  3360. EMIT_ALG(journal_mac_alg, "journal_mac");
  3361. break;
  3362. }
  3363. case STATUSTYPE_IMA:
  3364. DMEMIT_TARGET_NAME_VERSION(ti->type);
  3365. DMEMIT(",dev_name=%s,start=%llu,tag_size=%u,mode=%c",
  3366. ic->dev->name, ic->start, ic->tag_size, ic->mode);
  3367. if (ic->meta_dev)
  3368. DMEMIT(",meta_device=%s", ic->meta_dev->name);
  3369. if (ic->sectors_per_block != 1)
  3370. DMEMIT(",block_size=%u", ic->sectors_per_block << SECTOR_SHIFT);
  3371. DMEMIT(",recalculate=%c", (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING)) ?
  3372. 'y' : 'n');
  3373. DMEMIT(",allow_discards=%c", ic->discard ? 'y' : 'n');
  3374. DMEMIT(",fix_padding=%c",
  3375. ((ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_PADDING)) != 0) ? 'y' : 'n');
  3376. DMEMIT(",fix_hmac=%c",
  3377. ((ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_HMAC)) != 0) ? 'y' : 'n');
  3378. DMEMIT(",legacy_recalculate=%c", ic->legacy_recalculate ? 'y' : 'n');
  3379. DMEMIT(",journal_sectors=%u", ic->initial_sectors - SB_SECTORS);
  3380. DMEMIT(",interleave_sectors=%u", 1U << ic->sb->log2_interleave_sectors);
  3381. DMEMIT(",buffer_sectors=%u", 1U << ic->log2_buffer_sectors);
  3382. DMEMIT(";");
  3383. break;
  3384. }
  3385. }
  3386. static int dm_integrity_iterate_devices(struct dm_target *ti,
  3387. iterate_devices_callout_fn fn, void *data)
  3388. {
  3389. struct dm_integrity_c *ic = ti->private;
  3390. if (!ic->meta_dev)
  3391. return fn(ti, ic->dev, ic->start + ic->initial_sectors + ic->metadata_run, ti->len, data);
  3392. else
  3393. return fn(ti, ic->dev, 0, ti->len, data);
  3394. }
  3395. static void dm_integrity_io_hints(struct dm_target *ti, struct queue_limits *limits)
  3396. {
  3397. struct dm_integrity_c *ic = ti->private;
  3398. if (ic->sectors_per_block > 1) {
  3399. limits->logical_block_size = ic->sectors_per_block << SECTOR_SHIFT;
  3400. limits->physical_block_size = ic->sectors_per_block << SECTOR_SHIFT;
  3401. limits->io_min = ic->sectors_per_block << SECTOR_SHIFT;
  3402. limits->dma_alignment = limits->logical_block_size - 1;
  3403. limits->discard_granularity = ic->sectors_per_block << SECTOR_SHIFT;
  3404. }
  3405. if (!ic->internal_hash) {
  3406. struct blk_integrity *bi = &limits->integrity;
  3407. memset(bi, 0, sizeof(*bi));
  3408. bi->metadata_size = ic->tag_size;
  3409. bi->tag_size = bi->metadata_size;
  3410. bi->interval_exp =
  3411. ic->sb->log2_sectors_per_block + SECTOR_SHIFT;
  3412. }
  3413. limits->max_integrity_segments = USHRT_MAX;
  3414. }
  3415. static void calculate_journal_section_size(struct dm_integrity_c *ic)
  3416. {
  3417. unsigned int sector_space = JOURNAL_SECTOR_DATA;
  3418. ic->journal_sections = le32_to_cpu(ic->sb->journal_sections);
  3419. ic->journal_entry_size = roundup(offsetof(struct journal_entry, last_bytes[ic->sectors_per_block]) + ic->tag_size,
  3420. JOURNAL_ENTRY_ROUNDUP);
  3421. if (ic->sb->flags & cpu_to_le32(SB_FLAG_HAVE_JOURNAL_MAC))
  3422. sector_space -= JOURNAL_MAC_PER_SECTOR;
  3423. ic->journal_entries_per_sector = sector_space / ic->journal_entry_size;
  3424. ic->journal_section_entries = ic->journal_entries_per_sector * JOURNAL_BLOCK_SECTORS;
  3425. ic->journal_section_sectors = (ic->journal_section_entries << ic->sb->log2_sectors_per_block) + JOURNAL_BLOCK_SECTORS;
  3426. ic->journal_entries = ic->journal_section_entries * ic->journal_sections;
  3427. }
  3428. static int calculate_device_limits(struct dm_integrity_c *ic)
  3429. {
  3430. __u64 initial_sectors;
  3431. calculate_journal_section_size(ic);
  3432. initial_sectors = SB_SECTORS + (__u64)ic->journal_section_sectors * ic->journal_sections;
  3433. if (initial_sectors + METADATA_PADDING_SECTORS >= ic->meta_device_sectors || initial_sectors > UINT_MAX)
  3434. return -EINVAL;
  3435. ic->initial_sectors = initial_sectors;
  3436. if (ic->mode == 'I') {
  3437. if (ic->initial_sectors + ic->provided_data_sectors > ic->meta_device_sectors)
  3438. return -EINVAL;
  3439. } else if (!ic->meta_dev) {
  3440. sector_t last_sector, last_area, last_offset;
  3441. /* we have to maintain excessive padding for compatibility with existing volumes */
  3442. __u64 metadata_run_padding =
  3443. ic->sb->flags & cpu_to_le32(SB_FLAG_FIXED_PADDING) ?
  3444. (__u64)(METADATA_PADDING_SECTORS << SECTOR_SHIFT) :
  3445. (__u64)(1 << SECTOR_SHIFT << METADATA_PADDING_SECTORS);
  3446. ic->metadata_run = round_up((__u64)ic->tag_size << (ic->sb->log2_interleave_sectors - ic->sb->log2_sectors_per_block),
  3447. metadata_run_padding) >> SECTOR_SHIFT;
  3448. if (!(ic->metadata_run & (ic->metadata_run - 1)))
  3449. ic->log2_metadata_run = __ffs(ic->metadata_run);
  3450. else
  3451. ic->log2_metadata_run = -1;
  3452. get_area_and_offset(ic, ic->provided_data_sectors - 1, &last_area, &last_offset);
  3453. last_sector = get_data_sector(ic, last_area, last_offset);
  3454. if (last_sector < ic->start || last_sector >= ic->meta_device_sectors)
  3455. return -EINVAL;
  3456. } else {
  3457. __u64 meta_size = (ic->provided_data_sectors >> ic->sb->log2_sectors_per_block) * ic->tag_size;
  3458. meta_size = (meta_size + ((1U << (ic->log2_buffer_sectors + SECTOR_SHIFT)) - 1))
  3459. >> (ic->log2_buffer_sectors + SECTOR_SHIFT);
  3460. meta_size <<= ic->log2_buffer_sectors;
  3461. if (ic->initial_sectors + meta_size < ic->initial_sectors ||
  3462. ic->initial_sectors + meta_size > ic->meta_device_sectors)
  3463. return -EINVAL;
  3464. ic->metadata_run = 1;
  3465. ic->log2_metadata_run = 0;
  3466. }
  3467. return 0;
  3468. }
  3469. static void get_provided_data_sectors(struct dm_integrity_c *ic)
  3470. {
  3471. if (!ic->meta_dev) {
  3472. int test_bit;
  3473. ic->provided_data_sectors = 0;
  3474. for (test_bit = fls64(ic->meta_device_sectors) - 1; test_bit >= 3; test_bit--) {
  3475. __u64 prev_data_sectors = ic->provided_data_sectors;
  3476. ic->provided_data_sectors |= (sector_t)1 << test_bit;
  3477. if (calculate_device_limits(ic))
  3478. ic->provided_data_sectors = prev_data_sectors;
  3479. }
  3480. } else {
  3481. ic->provided_data_sectors = ic->data_device_sectors;
  3482. ic->provided_data_sectors &= ~(sector_t)(ic->sectors_per_block - 1);
  3483. }
  3484. }
  3485. static int initialize_superblock(struct dm_integrity_c *ic,
  3486. unsigned int journal_sectors, unsigned int interleave_sectors)
  3487. {
  3488. unsigned int journal_sections;
  3489. int test_bit;
  3490. memset(ic->sb, 0, SB_SECTORS << SECTOR_SHIFT);
  3491. memcpy(ic->sb->magic, SB_MAGIC, 8);
  3492. if (ic->mode == 'I')
  3493. ic->sb->flags |= cpu_to_le32(SB_FLAG_INLINE);
  3494. ic->sb->integrity_tag_size = cpu_to_le16(ic->tag_size);
  3495. ic->sb->log2_sectors_per_block = __ffs(ic->sectors_per_block);
  3496. if (ic->journal_mac_alg.alg_string)
  3497. ic->sb->flags |= cpu_to_le32(SB_FLAG_HAVE_JOURNAL_MAC);
  3498. calculate_journal_section_size(ic);
  3499. journal_sections = journal_sectors / ic->journal_section_sectors;
  3500. if (!journal_sections)
  3501. journal_sections = 1;
  3502. if (ic->mode == 'I')
  3503. journal_sections = 0;
  3504. if (ic->fix_hmac && (ic->internal_hash_alg.alg_string || ic->journal_mac_alg.alg_string)) {
  3505. ic->sb->flags |= cpu_to_le32(SB_FLAG_FIXED_HMAC);
  3506. get_random_bytes(ic->sb->salt, SALT_SIZE);
  3507. }
  3508. if (!ic->meta_dev) {
  3509. if (ic->fix_padding)
  3510. ic->sb->flags |= cpu_to_le32(SB_FLAG_FIXED_PADDING);
  3511. ic->sb->journal_sections = cpu_to_le32(journal_sections);
  3512. if (!interleave_sectors)
  3513. interleave_sectors = DEFAULT_INTERLEAVE_SECTORS;
  3514. ic->sb->log2_interleave_sectors = __fls(interleave_sectors);
  3515. ic->sb->log2_interleave_sectors = max_t(__u8, MIN_LOG2_INTERLEAVE_SECTORS, ic->sb->log2_interleave_sectors);
  3516. ic->sb->log2_interleave_sectors = min_t(__u8, MAX_LOG2_INTERLEAVE_SECTORS, ic->sb->log2_interleave_sectors);
  3517. get_provided_data_sectors(ic);
  3518. if (!ic->provided_data_sectors)
  3519. return -EINVAL;
  3520. } else {
  3521. ic->sb->log2_interleave_sectors = 0;
  3522. get_provided_data_sectors(ic);
  3523. if (!ic->provided_data_sectors)
  3524. return -EINVAL;
  3525. try_smaller_buffer:
  3526. ic->sb->journal_sections = cpu_to_le32(0);
  3527. for (test_bit = fls(journal_sections) - 1; test_bit >= 0; test_bit--) {
  3528. __u32 prev_journal_sections = le32_to_cpu(ic->sb->journal_sections);
  3529. __u32 test_journal_sections = prev_journal_sections | (1U << test_bit);
  3530. if (test_journal_sections > journal_sections)
  3531. continue;
  3532. ic->sb->journal_sections = cpu_to_le32(test_journal_sections);
  3533. if (calculate_device_limits(ic))
  3534. ic->sb->journal_sections = cpu_to_le32(prev_journal_sections);
  3535. }
  3536. if (!le32_to_cpu(ic->sb->journal_sections)) {
  3537. if (ic->log2_buffer_sectors > 3) {
  3538. ic->log2_buffer_sectors--;
  3539. goto try_smaller_buffer;
  3540. }
  3541. return -EINVAL;
  3542. }
  3543. }
  3544. ic->sb->provided_data_sectors = cpu_to_le64(ic->provided_data_sectors);
  3545. sb_set_version(ic);
  3546. return 0;
  3547. }
  3548. static void dm_integrity_free_page_list(struct page_list *pl)
  3549. {
  3550. unsigned int i;
  3551. if (!pl)
  3552. return;
  3553. for (i = 0; pl[i].page; i++)
  3554. __free_page(pl[i].page);
  3555. kvfree(pl);
  3556. }
  3557. static struct page_list *dm_integrity_alloc_page_list(unsigned int n_pages)
  3558. {
  3559. struct page_list *pl;
  3560. unsigned int i;
  3561. pl = kvmalloc_objs(struct page_list, n_pages + 1,
  3562. GFP_KERNEL | __GFP_ZERO);
  3563. if (!pl)
  3564. return NULL;
  3565. for (i = 0; i < n_pages; i++) {
  3566. pl[i].page = alloc_page(GFP_KERNEL);
  3567. if (!pl[i].page) {
  3568. dm_integrity_free_page_list(pl);
  3569. return NULL;
  3570. }
  3571. if (i)
  3572. pl[i - 1].next = &pl[i];
  3573. }
  3574. pl[i].page = NULL;
  3575. pl[i].next = NULL;
  3576. return pl;
  3577. }
  3578. static void dm_integrity_free_journal_scatterlist(struct dm_integrity_c *ic, struct scatterlist **sl)
  3579. {
  3580. unsigned int i;
  3581. for (i = 0; i < ic->journal_sections; i++)
  3582. kvfree(sl[i]);
  3583. kvfree(sl);
  3584. }
  3585. static struct scatterlist **dm_integrity_alloc_journal_scatterlist(struct dm_integrity_c *ic,
  3586. struct page_list *pl)
  3587. {
  3588. struct scatterlist **sl;
  3589. unsigned int i;
  3590. sl = kvmalloc_objs(struct scatterlist *, ic->journal_sections,
  3591. GFP_KERNEL | __GFP_ZERO);
  3592. if (!sl)
  3593. return NULL;
  3594. for (i = 0; i < ic->journal_sections; i++) {
  3595. struct scatterlist *s;
  3596. unsigned int start_index, start_offset;
  3597. unsigned int end_index, end_offset;
  3598. unsigned int n_pages;
  3599. unsigned int idx;
  3600. page_list_location(ic, i, 0, &start_index, &start_offset);
  3601. page_list_location(ic, i, ic->journal_section_sectors - 1,
  3602. &end_index, &end_offset);
  3603. n_pages = (end_index - start_index + 1);
  3604. s = kvmalloc_objs(struct scatterlist, n_pages);
  3605. if (!s) {
  3606. dm_integrity_free_journal_scatterlist(ic, sl);
  3607. return NULL;
  3608. }
  3609. sg_init_table(s, n_pages);
  3610. for (idx = start_index; idx <= end_index; idx++) {
  3611. char *va = lowmem_page_address(pl[idx].page);
  3612. unsigned int start = 0, end = PAGE_SIZE;
  3613. if (idx == start_index)
  3614. start = start_offset;
  3615. if (idx == end_index)
  3616. end = end_offset + (1 << SECTOR_SHIFT);
  3617. sg_set_buf(&s[idx - start_index], va + start, end - start);
  3618. }
  3619. sl[i] = s;
  3620. }
  3621. return sl;
  3622. }
  3623. static void free_alg(struct alg_spec *a)
  3624. {
  3625. kfree_sensitive(a->alg_string);
  3626. kfree_sensitive(a->key);
  3627. memset(a, 0, sizeof(*a));
  3628. }
  3629. static int get_alg_and_key(const char *arg, struct alg_spec *a, char **error, char *error_inval)
  3630. {
  3631. char *k;
  3632. free_alg(a);
  3633. a->alg_string = kstrdup(strchr(arg, ':') + 1, GFP_KERNEL);
  3634. if (!a->alg_string)
  3635. goto nomem;
  3636. k = strchr(a->alg_string, ':');
  3637. if (k) {
  3638. *k = 0;
  3639. a->key_string = k + 1;
  3640. if (strlen(a->key_string) & 1)
  3641. goto inval;
  3642. a->key_size = strlen(a->key_string) / 2;
  3643. a->key = kmalloc(a->key_size, GFP_KERNEL);
  3644. if (!a->key)
  3645. goto nomem;
  3646. if (hex2bin(a->key, a->key_string, a->key_size))
  3647. goto inval;
  3648. }
  3649. return 0;
  3650. inval:
  3651. *error = error_inval;
  3652. return -EINVAL;
  3653. nomem:
  3654. *error = "Out of memory for an argument";
  3655. return -ENOMEM;
  3656. }
  3657. static int get_mac(struct crypto_shash **shash, struct crypto_ahash **ahash,
  3658. struct alg_spec *a, char **error, char *error_alg, char *error_key)
  3659. {
  3660. int r;
  3661. if (a->alg_string) {
  3662. if (shash) {
  3663. *shash = crypto_alloc_shash(a->alg_string, 0, CRYPTO_ALG_ALLOCATES_MEMORY);
  3664. if (IS_ERR(*shash)) {
  3665. *shash = NULL;
  3666. goto try_ahash;
  3667. }
  3668. if (a->key) {
  3669. r = crypto_shash_setkey(*shash, a->key, a->key_size);
  3670. if (r) {
  3671. *error = error_key;
  3672. return r;
  3673. }
  3674. } else if (crypto_shash_get_flags(*shash) & CRYPTO_TFM_NEED_KEY) {
  3675. *error = error_key;
  3676. return -ENOKEY;
  3677. }
  3678. return 0;
  3679. }
  3680. try_ahash:
  3681. if (ahash) {
  3682. *ahash = crypto_alloc_ahash(a->alg_string, 0, CRYPTO_ALG_ALLOCATES_MEMORY);
  3683. if (IS_ERR(*ahash)) {
  3684. *error = error_alg;
  3685. r = PTR_ERR(*ahash);
  3686. *ahash = NULL;
  3687. return r;
  3688. }
  3689. if (a->key) {
  3690. r = crypto_ahash_setkey(*ahash, a->key, a->key_size);
  3691. if (r) {
  3692. *error = error_key;
  3693. return r;
  3694. }
  3695. } else if (crypto_ahash_get_flags(*ahash) & CRYPTO_TFM_NEED_KEY) {
  3696. *error = error_key;
  3697. return -ENOKEY;
  3698. }
  3699. return 0;
  3700. }
  3701. *error = error_alg;
  3702. return -ENOENT;
  3703. }
  3704. return 0;
  3705. }
  3706. static int create_journal(struct dm_integrity_c *ic, char **error)
  3707. {
  3708. int r = 0;
  3709. unsigned int i;
  3710. __u64 journal_pages, journal_desc_size, journal_tree_size;
  3711. unsigned char *crypt_data = NULL, *crypt_iv = NULL;
  3712. struct skcipher_request *req = NULL;
  3713. ic->commit_ids[0] = cpu_to_le64(0x1111111111111111ULL);
  3714. ic->commit_ids[1] = cpu_to_le64(0x2222222222222222ULL);
  3715. ic->commit_ids[2] = cpu_to_le64(0x3333333333333333ULL);
  3716. ic->commit_ids[3] = cpu_to_le64(0x4444444444444444ULL);
  3717. journal_pages = roundup((__u64)ic->journal_sections * ic->journal_section_sectors,
  3718. PAGE_SIZE >> SECTOR_SHIFT) >> (PAGE_SHIFT - SECTOR_SHIFT);
  3719. journal_desc_size = journal_pages * sizeof(struct page_list);
  3720. if (journal_pages >= totalram_pages() - totalhigh_pages() || journal_desc_size > ULONG_MAX) {
  3721. *error = "Journal doesn't fit into memory";
  3722. r = -ENOMEM;
  3723. goto bad;
  3724. }
  3725. ic->journal_pages = journal_pages;
  3726. ic->journal = dm_integrity_alloc_page_list(ic->journal_pages);
  3727. if (!ic->journal) {
  3728. *error = "Could not allocate memory for journal";
  3729. r = -ENOMEM;
  3730. goto bad;
  3731. }
  3732. if (ic->journal_crypt_alg.alg_string) {
  3733. unsigned int ivsize, blocksize;
  3734. struct journal_completion comp;
  3735. comp.ic = ic;
  3736. ic->journal_crypt = crypto_alloc_skcipher(ic->journal_crypt_alg.alg_string, 0, CRYPTO_ALG_ALLOCATES_MEMORY);
  3737. if (IS_ERR(ic->journal_crypt)) {
  3738. *error = "Invalid journal cipher";
  3739. r = PTR_ERR(ic->journal_crypt);
  3740. ic->journal_crypt = NULL;
  3741. goto bad;
  3742. }
  3743. ivsize = crypto_skcipher_ivsize(ic->journal_crypt);
  3744. blocksize = crypto_skcipher_blocksize(ic->journal_crypt);
  3745. if (ic->journal_crypt_alg.key) {
  3746. r = crypto_skcipher_setkey(ic->journal_crypt, ic->journal_crypt_alg.key,
  3747. ic->journal_crypt_alg.key_size);
  3748. if (r) {
  3749. *error = "Error setting encryption key";
  3750. goto bad;
  3751. }
  3752. }
  3753. DEBUG_print("cipher %s, block size %u iv size %u\n",
  3754. ic->journal_crypt_alg.alg_string, blocksize, ivsize);
  3755. ic->journal_io = dm_integrity_alloc_page_list(ic->journal_pages);
  3756. if (!ic->journal_io) {
  3757. *error = "Could not allocate memory for journal io";
  3758. r = -ENOMEM;
  3759. goto bad;
  3760. }
  3761. if (blocksize == 1) {
  3762. struct scatterlist *sg;
  3763. req = skcipher_request_alloc(ic->journal_crypt, GFP_KERNEL);
  3764. if (!req) {
  3765. *error = "Could not allocate crypt request";
  3766. r = -ENOMEM;
  3767. goto bad;
  3768. }
  3769. crypt_iv = kzalloc(ivsize, GFP_KERNEL);
  3770. if (!crypt_iv) {
  3771. *error = "Could not allocate iv";
  3772. r = -ENOMEM;
  3773. goto bad;
  3774. }
  3775. ic->journal_xor = dm_integrity_alloc_page_list(ic->journal_pages);
  3776. if (!ic->journal_xor) {
  3777. *error = "Could not allocate memory for journal xor";
  3778. r = -ENOMEM;
  3779. goto bad;
  3780. }
  3781. sg = kvmalloc_objs(struct scatterlist,
  3782. ic->journal_pages + 1);
  3783. if (!sg) {
  3784. *error = "Unable to allocate sg list";
  3785. r = -ENOMEM;
  3786. goto bad;
  3787. }
  3788. sg_init_table(sg, ic->journal_pages + 1);
  3789. for (i = 0; i < ic->journal_pages; i++) {
  3790. char *va = lowmem_page_address(ic->journal_xor[i].page);
  3791. clear_page(va);
  3792. sg_set_buf(&sg[i], va, PAGE_SIZE);
  3793. }
  3794. sg_set_buf(&sg[i], &ic->commit_ids, sizeof(ic->commit_ids));
  3795. skcipher_request_set_crypt(req, sg, sg,
  3796. PAGE_SIZE * ic->journal_pages + sizeof(ic->commit_ids), crypt_iv);
  3797. init_completion(&comp.comp);
  3798. comp.in_flight = (atomic_t)ATOMIC_INIT(1);
  3799. if (do_crypt(true, req, &comp))
  3800. wait_for_completion(&comp.comp);
  3801. kvfree(sg);
  3802. r = dm_integrity_failed(ic);
  3803. if (r) {
  3804. *error = "Unable to encrypt journal";
  3805. goto bad;
  3806. }
  3807. DEBUG_bytes(lowmem_page_address(ic->journal_xor[0].page), 64, "xor data");
  3808. crypto_free_skcipher(ic->journal_crypt);
  3809. ic->journal_crypt = NULL;
  3810. } else {
  3811. unsigned int crypt_len = roundup(ivsize, blocksize);
  3812. req = skcipher_request_alloc(ic->journal_crypt, GFP_KERNEL);
  3813. if (!req) {
  3814. *error = "Could not allocate crypt request";
  3815. r = -ENOMEM;
  3816. goto bad;
  3817. }
  3818. crypt_iv = kmalloc(ivsize, GFP_KERNEL);
  3819. if (!crypt_iv) {
  3820. *error = "Could not allocate iv";
  3821. r = -ENOMEM;
  3822. goto bad;
  3823. }
  3824. crypt_data = kmalloc(crypt_len, GFP_KERNEL);
  3825. if (!crypt_data) {
  3826. *error = "Unable to allocate crypt data";
  3827. r = -ENOMEM;
  3828. goto bad;
  3829. }
  3830. ic->journal_scatterlist = dm_integrity_alloc_journal_scatterlist(ic, ic->journal);
  3831. if (!ic->journal_scatterlist) {
  3832. *error = "Unable to allocate sg list";
  3833. r = -ENOMEM;
  3834. goto bad;
  3835. }
  3836. ic->journal_io_scatterlist = dm_integrity_alloc_journal_scatterlist(ic, ic->journal_io);
  3837. if (!ic->journal_io_scatterlist) {
  3838. *error = "Unable to allocate sg list";
  3839. r = -ENOMEM;
  3840. goto bad;
  3841. }
  3842. ic->sk_requests = kvmalloc_objs(struct skcipher_request *,
  3843. ic->journal_sections,
  3844. GFP_KERNEL | __GFP_ZERO);
  3845. if (!ic->sk_requests) {
  3846. *error = "Unable to allocate sk requests";
  3847. r = -ENOMEM;
  3848. goto bad;
  3849. }
  3850. for (i = 0; i < ic->journal_sections; i++) {
  3851. struct scatterlist sg;
  3852. struct skcipher_request *section_req;
  3853. __le32 section_le = cpu_to_le32(i);
  3854. memset(crypt_iv, 0x00, ivsize);
  3855. memset(crypt_data, 0x00, crypt_len);
  3856. memcpy(crypt_data, &section_le, min_t(size_t, crypt_len, sizeof(section_le)));
  3857. sg_init_one(&sg, crypt_data, crypt_len);
  3858. skcipher_request_set_crypt(req, &sg, &sg, crypt_len, crypt_iv);
  3859. init_completion(&comp.comp);
  3860. comp.in_flight = (atomic_t)ATOMIC_INIT(1);
  3861. if (do_crypt(true, req, &comp))
  3862. wait_for_completion(&comp.comp);
  3863. r = dm_integrity_failed(ic);
  3864. if (r) {
  3865. *error = "Unable to generate iv";
  3866. goto bad;
  3867. }
  3868. section_req = skcipher_request_alloc(ic->journal_crypt, GFP_KERNEL);
  3869. if (!section_req) {
  3870. *error = "Unable to allocate crypt request";
  3871. r = -ENOMEM;
  3872. goto bad;
  3873. }
  3874. section_req->iv = kmalloc_array(ivsize, 2,
  3875. GFP_KERNEL);
  3876. if (!section_req->iv) {
  3877. skcipher_request_free(section_req);
  3878. *error = "Unable to allocate iv";
  3879. r = -ENOMEM;
  3880. goto bad;
  3881. }
  3882. memcpy(section_req->iv + ivsize, crypt_data, ivsize);
  3883. section_req->cryptlen = (size_t)ic->journal_section_sectors << SECTOR_SHIFT;
  3884. ic->sk_requests[i] = section_req;
  3885. DEBUG_bytes(crypt_data, ivsize, "iv(%u)", i);
  3886. }
  3887. }
  3888. }
  3889. for (i = 0; i < N_COMMIT_IDS; i++) {
  3890. unsigned int j;
  3891. retest_commit_id:
  3892. for (j = 0; j < i; j++) {
  3893. if (ic->commit_ids[j] == ic->commit_ids[i]) {
  3894. ic->commit_ids[i] = cpu_to_le64(le64_to_cpu(ic->commit_ids[i]) + 1);
  3895. goto retest_commit_id;
  3896. }
  3897. }
  3898. DEBUG_print("commit id %u: %016llx\n", i, ic->commit_ids[i]);
  3899. }
  3900. journal_tree_size = (__u64)ic->journal_entries * sizeof(struct journal_node);
  3901. if (journal_tree_size > ULONG_MAX) {
  3902. *error = "Journal doesn't fit into memory";
  3903. r = -ENOMEM;
  3904. goto bad;
  3905. }
  3906. ic->journal_tree = kvmalloc(journal_tree_size, GFP_KERNEL);
  3907. if (!ic->journal_tree) {
  3908. *error = "Could not allocate memory for journal tree";
  3909. r = -ENOMEM;
  3910. }
  3911. bad:
  3912. kfree(crypt_data);
  3913. kfree(crypt_iv);
  3914. skcipher_request_free(req);
  3915. return r;
  3916. }
  3917. /*
  3918. * Construct a integrity mapping
  3919. *
  3920. * Arguments:
  3921. * device
  3922. * offset from the start of the device
  3923. * tag size
  3924. * D - direct writes, J - journal writes, B - bitmap mode, R - recovery mode
  3925. * number of optional arguments
  3926. * optional arguments:
  3927. * journal_sectors
  3928. * interleave_sectors
  3929. * buffer_sectors
  3930. * journal_watermark
  3931. * commit_time
  3932. * meta_device
  3933. * block_size
  3934. * sectors_per_bit
  3935. * bitmap_flush_interval
  3936. * internal_hash
  3937. * journal_crypt
  3938. * journal_mac
  3939. * recalculate
  3940. */
  3941. static int dm_integrity_ctr(struct dm_target *ti, unsigned int argc, char **argv)
  3942. {
  3943. struct dm_integrity_c *ic;
  3944. char dummy;
  3945. int r;
  3946. unsigned int extra_args;
  3947. struct dm_arg_set as;
  3948. static const struct dm_arg _args[] = {
  3949. {0, 18, "Invalid number of feature args"},
  3950. };
  3951. unsigned int journal_sectors, interleave_sectors, buffer_sectors, journal_watermark, sync_msec;
  3952. bool should_write_sb;
  3953. __u64 threshold;
  3954. unsigned long long start;
  3955. __s8 log2_sectors_per_bitmap_bit = -1;
  3956. __s8 log2_blocks_per_bitmap_bit;
  3957. __u64 bits_in_journal;
  3958. __u64 n_bitmap_bits;
  3959. #define DIRECT_ARGUMENTS 4
  3960. if (argc <= DIRECT_ARGUMENTS) {
  3961. ti->error = "Invalid argument count";
  3962. return -EINVAL;
  3963. }
  3964. ic = kzalloc_obj(struct dm_integrity_c);
  3965. if (!ic) {
  3966. ti->error = "Cannot allocate integrity context";
  3967. return -ENOMEM;
  3968. }
  3969. ti->private = ic;
  3970. ti->per_io_data_size = sizeof(struct dm_integrity_io);
  3971. ic->ti = ti;
  3972. ic->in_progress = RB_ROOT;
  3973. INIT_LIST_HEAD(&ic->wait_list);
  3974. init_waitqueue_head(&ic->endio_wait);
  3975. bio_list_init(&ic->flush_bio_list);
  3976. init_waitqueue_head(&ic->copy_to_journal_wait);
  3977. init_completion(&ic->crypto_backoff);
  3978. atomic64_set(&ic->number_of_mismatches, 0);
  3979. ic->bitmap_flush_interval = BITMAP_FLUSH_INTERVAL;
  3980. r = dm_get_device(ti, argv[0], dm_table_get_mode(ti->table), &ic->dev);
  3981. if (r) {
  3982. ti->error = "Device lookup failed";
  3983. goto bad;
  3984. }
  3985. if (sscanf(argv[1], "%llu%c", &start, &dummy) != 1 || start != (sector_t)start) {
  3986. ti->error = "Invalid starting offset";
  3987. r = -EINVAL;
  3988. goto bad;
  3989. }
  3990. ic->start = start;
  3991. if (strcmp(argv[2], "-")) {
  3992. if (sscanf(argv[2], "%u%c", &ic->tag_size, &dummy) != 1 || !ic->tag_size) {
  3993. ti->error = "Invalid tag size";
  3994. r = -EINVAL;
  3995. goto bad;
  3996. }
  3997. }
  3998. if (!strcmp(argv[3], "J") || !strcmp(argv[3], "B") ||
  3999. !strcmp(argv[3], "D") || !strcmp(argv[3], "R") ||
  4000. !strcmp(argv[3], "I")) {
  4001. ic->mode = argv[3][0];
  4002. } else {
  4003. ti->error = "Invalid mode (expecting J, B, D, R, I)";
  4004. r = -EINVAL;
  4005. goto bad;
  4006. }
  4007. journal_sectors = 0;
  4008. interleave_sectors = DEFAULT_INTERLEAVE_SECTORS;
  4009. buffer_sectors = DEFAULT_BUFFER_SECTORS;
  4010. journal_watermark = DEFAULT_JOURNAL_WATERMARK;
  4011. sync_msec = DEFAULT_SYNC_MSEC;
  4012. ic->sectors_per_block = 1;
  4013. as.argc = argc - DIRECT_ARGUMENTS;
  4014. as.argv = argv + DIRECT_ARGUMENTS;
  4015. r = dm_read_arg_group(_args, &as, &extra_args, &ti->error);
  4016. if (r)
  4017. goto bad;
  4018. while (extra_args--) {
  4019. const char *opt_string;
  4020. unsigned int val;
  4021. unsigned long long llval;
  4022. opt_string = dm_shift_arg(&as);
  4023. if (!opt_string) {
  4024. r = -EINVAL;
  4025. ti->error = "Not enough feature arguments";
  4026. goto bad;
  4027. }
  4028. if (sscanf(opt_string, "journal_sectors:%u%c", &val, &dummy) == 1)
  4029. journal_sectors = val ? val : 1;
  4030. else if (sscanf(opt_string, "interleave_sectors:%u%c", &val, &dummy) == 1)
  4031. interleave_sectors = val;
  4032. else if (sscanf(opt_string, "buffer_sectors:%u%c", &val, &dummy) == 1)
  4033. buffer_sectors = val;
  4034. else if (sscanf(opt_string, "journal_watermark:%u%c", &val, &dummy) == 1 && val <= 100)
  4035. journal_watermark = val;
  4036. else if (sscanf(opt_string, "commit_time:%u%c", &val, &dummy) == 1)
  4037. sync_msec = val;
  4038. else if (!strncmp(opt_string, "meta_device:", strlen("meta_device:"))) {
  4039. if (ic->meta_dev) {
  4040. dm_put_device(ti, ic->meta_dev);
  4041. ic->meta_dev = NULL;
  4042. }
  4043. r = dm_get_device(ti, strchr(opt_string, ':') + 1,
  4044. dm_table_get_mode(ti->table), &ic->meta_dev);
  4045. if (r) {
  4046. ti->error = "Device lookup failed";
  4047. goto bad;
  4048. }
  4049. } else if (sscanf(opt_string, "block_size:%u%c", &val, &dummy) == 1) {
  4050. if (val < 1 << SECTOR_SHIFT ||
  4051. val > MAX_SECTORS_PER_BLOCK << SECTOR_SHIFT ||
  4052. (val & (val - 1))) {
  4053. r = -EINVAL;
  4054. ti->error = "Invalid block_size argument";
  4055. goto bad;
  4056. }
  4057. ic->sectors_per_block = val >> SECTOR_SHIFT;
  4058. } else if (sscanf(opt_string, "sectors_per_bit:%llu%c", &llval, &dummy) == 1) {
  4059. log2_sectors_per_bitmap_bit = !llval ? 0 : __ilog2_u64(llval);
  4060. } else if (sscanf(opt_string, "bitmap_flush_interval:%u%c", &val, &dummy) == 1) {
  4061. if ((uint64_t)val >= (uint64_t)UINT_MAX * 1000 / HZ) {
  4062. r = -EINVAL;
  4063. ti->error = "Invalid bitmap_flush_interval argument";
  4064. goto bad;
  4065. }
  4066. ic->bitmap_flush_interval = msecs_to_jiffies(val);
  4067. } else if (!strncmp(opt_string, "internal_hash:", strlen("internal_hash:"))) {
  4068. r = get_alg_and_key(opt_string, &ic->internal_hash_alg, &ti->error,
  4069. "Invalid internal_hash argument");
  4070. if (r)
  4071. goto bad;
  4072. } else if (!strncmp(opt_string, "journal_crypt:", strlen("journal_crypt:"))) {
  4073. r = get_alg_and_key(opt_string, &ic->journal_crypt_alg, &ti->error,
  4074. "Invalid journal_crypt argument");
  4075. if (r)
  4076. goto bad;
  4077. } else if (!strncmp(opt_string, "journal_mac:", strlen("journal_mac:"))) {
  4078. r = get_alg_and_key(opt_string, &ic->journal_mac_alg, &ti->error,
  4079. "Invalid journal_mac argument");
  4080. if (r)
  4081. goto bad;
  4082. } else if (!strcmp(opt_string, "recalculate")) {
  4083. ic->recalculate_flag = true;
  4084. } else if (!strcmp(opt_string, "reset_recalculate")) {
  4085. ic->recalculate_flag = true;
  4086. ic->reset_recalculate_flag = true;
  4087. } else if (!strcmp(opt_string, "allow_discards")) {
  4088. ic->discard = true;
  4089. } else if (!strcmp(opt_string, "fix_padding")) {
  4090. ic->fix_padding = true;
  4091. } else if (!strcmp(opt_string, "fix_hmac")) {
  4092. ic->fix_hmac = true;
  4093. } else if (!strcmp(opt_string, "legacy_recalculate")) {
  4094. ic->legacy_recalculate = true;
  4095. } else {
  4096. r = -EINVAL;
  4097. ti->error = "Invalid argument";
  4098. goto bad;
  4099. }
  4100. }
  4101. ic->data_device_sectors = bdev_nr_sectors(ic->dev->bdev);
  4102. if (!ic->meta_dev)
  4103. ic->meta_device_sectors = ic->data_device_sectors;
  4104. else
  4105. ic->meta_device_sectors = bdev_nr_sectors(ic->meta_dev->bdev);
  4106. if (!journal_sectors) {
  4107. journal_sectors = min((sector_t)DEFAULT_MAX_JOURNAL_SECTORS,
  4108. ic->data_device_sectors >> DEFAULT_JOURNAL_SIZE_FACTOR);
  4109. }
  4110. if (!buffer_sectors)
  4111. buffer_sectors = 1;
  4112. ic->log2_buffer_sectors = min((int)__fls(buffer_sectors), 31 - SECTOR_SHIFT);
  4113. r = get_mac(&ic->internal_shash, &ic->internal_ahash, &ic->internal_hash_alg, &ti->error,
  4114. "Invalid internal hash", "Error setting internal hash key");
  4115. if (r)
  4116. goto bad;
  4117. if (ic->internal_shash) {
  4118. ic->internal_hash = true;
  4119. ic->internal_hash_digestsize = crypto_shash_digestsize(ic->internal_shash);
  4120. }
  4121. if (ic->internal_ahash) {
  4122. ic->internal_hash = true;
  4123. ic->internal_hash_digestsize = crypto_ahash_digestsize(ic->internal_ahash);
  4124. r = mempool_init_kmalloc_pool(&ic->ahash_req_pool, AHASH_MEMPOOL,
  4125. sizeof(struct ahash_request) + crypto_ahash_reqsize(ic->internal_ahash));
  4126. if (r) {
  4127. ti->error = "Cannot allocate mempool";
  4128. goto bad;
  4129. }
  4130. }
  4131. r = get_mac(&ic->journal_mac, NULL, &ic->journal_mac_alg, &ti->error,
  4132. "Invalid journal mac", "Error setting journal mac key");
  4133. if (r)
  4134. goto bad;
  4135. if (!ic->tag_size) {
  4136. if (!ic->internal_hash) {
  4137. ti->error = "Unknown tag size";
  4138. r = -EINVAL;
  4139. goto bad;
  4140. }
  4141. ic->tag_size = ic->internal_hash_digestsize;
  4142. }
  4143. if (ic->tag_size > MAX_TAG_SIZE) {
  4144. ti->error = "Too big tag size";
  4145. r = -EINVAL;
  4146. goto bad;
  4147. }
  4148. if (!(ic->tag_size & (ic->tag_size - 1)))
  4149. ic->log2_tag_size = __ffs(ic->tag_size);
  4150. else
  4151. ic->log2_tag_size = -1;
  4152. if (ic->mode == 'I') {
  4153. struct blk_integrity *bi;
  4154. if (ic->meta_dev) {
  4155. r = -EINVAL;
  4156. ti->error = "Metadata device not supported in inline mode";
  4157. goto bad;
  4158. }
  4159. if (!ic->internal_hash_alg.alg_string) {
  4160. r = -EINVAL;
  4161. ti->error = "Internal hash not set in inline mode";
  4162. goto bad;
  4163. }
  4164. if (ic->journal_crypt_alg.alg_string || ic->journal_mac_alg.alg_string) {
  4165. r = -EINVAL;
  4166. ti->error = "Journal crypt not supported in inline mode";
  4167. goto bad;
  4168. }
  4169. if (ic->discard) {
  4170. r = -EINVAL;
  4171. ti->error = "Discards not supported in inline mode";
  4172. goto bad;
  4173. }
  4174. bi = blk_get_integrity(ic->dev->bdev->bd_disk);
  4175. if (!bi || bi->csum_type != BLK_INTEGRITY_CSUM_NONE) {
  4176. r = -EINVAL;
  4177. ti->error = "Integrity profile not supported";
  4178. goto bad;
  4179. }
  4180. /*printk("tag_size: %u, metadata_size: %u\n", bi->tag_size, bi->metadata_size);*/
  4181. if (bi->metadata_size < ic->tag_size) {
  4182. r = -EINVAL;
  4183. ti->error = "The integrity profile is smaller than tag size";
  4184. goto bad;
  4185. }
  4186. if ((unsigned long)bi->metadata_size > PAGE_SIZE / 2) {
  4187. r = -EINVAL;
  4188. ti->error = "Too big tuple size";
  4189. goto bad;
  4190. }
  4191. ic->tuple_size = bi->metadata_size;
  4192. if (1 << bi->interval_exp != ic->sectors_per_block << SECTOR_SHIFT) {
  4193. r = -EINVAL;
  4194. ti->error = "Integrity profile sector size mismatch";
  4195. goto bad;
  4196. }
  4197. }
  4198. if (ic->mode == 'B' && !ic->internal_hash) {
  4199. r = -EINVAL;
  4200. ti->error = "Bitmap mode can be only used with internal hash";
  4201. goto bad;
  4202. }
  4203. if (ic->discard && !ic->internal_hash) {
  4204. r = -EINVAL;
  4205. ti->error = "Discard can be only used with internal hash";
  4206. goto bad;
  4207. }
  4208. ic->autocommit_jiffies = msecs_to_jiffies(sync_msec);
  4209. ic->autocommit_msec = sync_msec;
  4210. timer_setup(&ic->autocommit_timer, autocommit_fn, 0);
  4211. ic->io = dm_io_client_create();
  4212. if (IS_ERR(ic->io)) {
  4213. r = PTR_ERR(ic->io);
  4214. ic->io = NULL;
  4215. ti->error = "Cannot allocate dm io";
  4216. goto bad;
  4217. }
  4218. r = mempool_init_slab_pool(&ic->journal_io_mempool, JOURNAL_IO_MEMPOOL, journal_io_cache);
  4219. if (r) {
  4220. ti->error = "Cannot allocate mempool";
  4221. goto bad;
  4222. }
  4223. r = mempool_init_page_pool(&ic->recheck_pool, 1, ic->mode == 'I' ? 1 : 0);
  4224. if (r) {
  4225. ti->error = "Cannot allocate mempool";
  4226. goto bad;
  4227. }
  4228. if (ic->mode == 'I') {
  4229. r = bioset_init(&ic->recheck_bios, RECHECK_POOL_SIZE, 0, BIOSET_NEED_BVECS);
  4230. if (r) {
  4231. ti->error = "Cannot allocate bio set";
  4232. goto bad;
  4233. }
  4234. r = bioset_init(&ic->recalc_bios, 1, 0, BIOSET_NEED_BVECS);
  4235. if (r) {
  4236. ti->error = "Cannot allocate bio set";
  4237. goto bad;
  4238. }
  4239. }
  4240. ic->metadata_wq = alloc_workqueue("dm-integrity-metadata",
  4241. WQ_MEM_RECLAIM | WQ_PERCPU,
  4242. METADATA_WORKQUEUE_MAX_ACTIVE);
  4243. if (!ic->metadata_wq) {
  4244. ti->error = "Cannot allocate workqueue";
  4245. r = -ENOMEM;
  4246. goto bad;
  4247. }
  4248. /*
  4249. * If this workqueue weren't ordered, it would cause bio reordering
  4250. * and reduced performance.
  4251. */
  4252. ic->wait_wq = alloc_ordered_workqueue("dm-integrity-wait", WQ_MEM_RECLAIM);
  4253. if (!ic->wait_wq) {
  4254. ti->error = "Cannot allocate workqueue";
  4255. r = -ENOMEM;
  4256. goto bad;
  4257. }
  4258. ic->offload_wq = alloc_workqueue("dm-integrity-offload",
  4259. WQ_MEM_RECLAIM | WQ_PERCPU,
  4260. METADATA_WORKQUEUE_MAX_ACTIVE);
  4261. if (!ic->offload_wq) {
  4262. ti->error = "Cannot allocate workqueue";
  4263. r = -ENOMEM;
  4264. goto bad;
  4265. }
  4266. ic->commit_wq = alloc_workqueue("dm-integrity-commit",
  4267. WQ_MEM_RECLAIM | WQ_PERCPU, 1);
  4268. if (!ic->commit_wq) {
  4269. ti->error = "Cannot allocate workqueue";
  4270. r = -ENOMEM;
  4271. goto bad;
  4272. }
  4273. INIT_WORK(&ic->commit_work, integrity_commit);
  4274. if (ic->mode == 'J' || ic->mode == 'B') {
  4275. ic->writer_wq = alloc_workqueue("dm-integrity-writer",
  4276. WQ_MEM_RECLAIM | WQ_PERCPU, 1);
  4277. if (!ic->writer_wq) {
  4278. ti->error = "Cannot allocate workqueue";
  4279. r = -ENOMEM;
  4280. goto bad;
  4281. }
  4282. INIT_WORK(&ic->writer_work, integrity_writer);
  4283. }
  4284. ic->sb = alloc_pages_exact(SB_SECTORS << SECTOR_SHIFT, GFP_KERNEL);
  4285. if (!ic->sb) {
  4286. r = -ENOMEM;
  4287. ti->error = "Cannot allocate superblock area";
  4288. goto bad;
  4289. }
  4290. r = sync_rw_sb(ic, REQ_OP_READ);
  4291. if (r) {
  4292. ti->error = "Error reading superblock";
  4293. goto bad;
  4294. }
  4295. should_write_sb = false;
  4296. if (memcmp(ic->sb->magic, SB_MAGIC, 8)) {
  4297. if (ic->mode != 'R') {
  4298. if (memchr_inv(ic->sb, 0, SB_SECTORS << SECTOR_SHIFT)) {
  4299. r = -EINVAL;
  4300. ti->error = "The device is not initialized";
  4301. goto bad;
  4302. }
  4303. }
  4304. r = initialize_superblock(ic, journal_sectors, interleave_sectors);
  4305. if (r) {
  4306. ti->error = "Could not initialize superblock";
  4307. goto bad;
  4308. }
  4309. if (ic->mode != 'R')
  4310. should_write_sb = true;
  4311. }
  4312. if (!ic->sb->version || ic->sb->version > SB_VERSION_6) {
  4313. r = -EINVAL;
  4314. ti->error = "Unknown version";
  4315. goto bad;
  4316. }
  4317. if (!!(ic->sb->flags & cpu_to_le32(SB_FLAG_INLINE)) != (ic->mode == 'I')) {
  4318. r = -EINVAL;
  4319. ti->error = "Inline flag mismatch";
  4320. goto bad;
  4321. }
  4322. if (le16_to_cpu(ic->sb->integrity_tag_size) != ic->tag_size) {
  4323. r = -EINVAL;
  4324. ti->error = "Tag size doesn't match the information in superblock";
  4325. goto bad;
  4326. }
  4327. if (ic->sb->log2_sectors_per_block != __ffs(ic->sectors_per_block)) {
  4328. r = -EINVAL;
  4329. ti->error = "Block size doesn't match the information in superblock";
  4330. goto bad;
  4331. }
  4332. if (ic->mode != 'I') {
  4333. if (!le32_to_cpu(ic->sb->journal_sections)) {
  4334. r = -EINVAL;
  4335. ti->error = "Corrupted superblock, journal_sections is 0";
  4336. goto bad;
  4337. }
  4338. } else {
  4339. if (le32_to_cpu(ic->sb->journal_sections)) {
  4340. r = -EINVAL;
  4341. ti->error = "Corrupted superblock, journal_sections is not 0";
  4342. goto bad;
  4343. }
  4344. }
  4345. /* make sure that ti->max_io_len doesn't overflow */
  4346. if (!ic->meta_dev) {
  4347. if (ic->sb->log2_interleave_sectors < MIN_LOG2_INTERLEAVE_SECTORS ||
  4348. ic->sb->log2_interleave_sectors > MAX_LOG2_INTERLEAVE_SECTORS) {
  4349. r = -EINVAL;
  4350. ti->error = "Invalid interleave_sectors in the superblock";
  4351. goto bad;
  4352. }
  4353. } else {
  4354. if (ic->sb->log2_interleave_sectors) {
  4355. r = -EINVAL;
  4356. ti->error = "Invalid interleave_sectors in the superblock";
  4357. goto bad;
  4358. }
  4359. }
  4360. if (!!(ic->sb->flags & cpu_to_le32(SB_FLAG_HAVE_JOURNAL_MAC)) != !!ic->journal_mac_alg.alg_string) {
  4361. r = -EINVAL;
  4362. ti->error = "Journal mac mismatch";
  4363. goto bad;
  4364. }
  4365. get_provided_data_sectors(ic);
  4366. if (!ic->provided_data_sectors) {
  4367. r = -EINVAL;
  4368. ti->error = "The device is too small";
  4369. goto bad;
  4370. }
  4371. try_smaller_buffer:
  4372. r = calculate_device_limits(ic);
  4373. if (r) {
  4374. if (ic->meta_dev) {
  4375. if (ic->log2_buffer_sectors > 3) {
  4376. ic->log2_buffer_sectors--;
  4377. goto try_smaller_buffer;
  4378. }
  4379. }
  4380. ti->error = "The device is too small";
  4381. goto bad;
  4382. }
  4383. if (log2_sectors_per_bitmap_bit < 0)
  4384. log2_sectors_per_bitmap_bit = __fls(DEFAULT_SECTORS_PER_BITMAP_BIT);
  4385. if (log2_sectors_per_bitmap_bit < ic->sb->log2_sectors_per_block)
  4386. log2_sectors_per_bitmap_bit = ic->sb->log2_sectors_per_block;
  4387. bits_in_journal = ((__u64)ic->journal_section_sectors * ic->journal_sections) << (SECTOR_SHIFT + 3);
  4388. if (bits_in_journal > UINT_MAX)
  4389. bits_in_journal = UINT_MAX;
  4390. if (bits_in_journal)
  4391. while (bits_in_journal < (ic->provided_data_sectors + ((sector_t)1 << log2_sectors_per_bitmap_bit) - 1) >> log2_sectors_per_bitmap_bit)
  4392. log2_sectors_per_bitmap_bit++;
  4393. log2_blocks_per_bitmap_bit = log2_sectors_per_bitmap_bit - ic->sb->log2_sectors_per_block;
  4394. ic->log2_blocks_per_bitmap_bit = log2_blocks_per_bitmap_bit;
  4395. if (should_write_sb)
  4396. ic->sb->log2_blocks_per_bitmap_bit = log2_blocks_per_bitmap_bit;
  4397. n_bitmap_bits = ((ic->provided_data_sectors >> ic->sb->log2_sectors_per_block)
  4398. + (((sector_t)1 << log2_blocks_per_bitmap_bit) - 1)) >> log2_blocks_per_bitmap_bit;
  4399. ic->n_bitmap_blocks = DIV_ROUND_UP(n_bitmap_bits, BITMAP_BLOCK_SIZE * 8);
  4400. if (!ic->meta_dev)
  4401. ic->log2_buffer_sectors = min(ic->log2_buffer_sectors, (__u8)__ffs(ic->metadata_run));
  4402. if (ti->len > ic->provided_data_sectors) {
  4403. r = -EINVAL;
  4404. ti->error = "Not enough provided sectors for requested mapping size";
  4405. goto bad;
  4406. }
  4407. threshold = (__u64)ic->journal_entries * (100 - journal_watermark);
  4408. threshold += 50;
  4409. do_div(threshold, 100);
  4410. ic->free_sectors_threshold = threshold;
  4411. DEBUG_print("initialized:\n");
  4412. DEBUG_print(" integrity_tag_size %u\n", le16_to_cpu(ic->sb->integrity_tag_size));
  4413. DEBUG_print(" journal_entry_size %u\n", ic->journal_entry_size);
  4414. DEBUG_print(" journal_entries_per_sector %u\n", ic->journal_entries_per_sector);
  4415. DEBUG_print(" journal_section_entries %u\n", ic->journal_section_entries);
  4416. DEBUG_print(" journal_section_sectors %u\n", ic->journal_section_sectors);
  4417. DEBUG_print(" journal_sections %u\n", (unsigned int)le32_to_cpu(ic->sb->journal_sections));
  4418. DEBUG_print(" journal_entries %u\n", ic->journal_entries);
  4419. DEBUG_print(" log2_interleave_sectors %d\n", ic->sb->log2_interleave_sectors);
  4420. DEBUG_print(" data_device_sectors 0x%llx\n", bdev_nr_sectors(ic->dev->bdev));
  4421. DEBUG_print(" initial_sectors 0x%x\n", ic->initial_sectors);
  4422. DEBUG_print(" metadata_run 0x%x\n", ic->metadata_run);
  4423. DEBUG_print(" log2_metadata_run %d\n", ic->log2_metadata_run);
  4424. DEBUG_print(" provided_data_sectors 0x%llx (%llu)\n", ic->provided_data_sectors, ic->provided_data_sectors);
  4425. DEBUG_print(" log2_buffer_sectors %u\n", ic->log2_buffer_sectors);
  4426. DEBUG_print(" bits_in_journal %llu\n", bits_in_journal);
  4427. if (ic->recalculate_flag && !(ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING))) {
  4428. ic->sb->flags |= cpu_to_le32(SB_FLAG_RECALCULATING);
  4429. ic->sb->recalc_sector = cpu_to_le64(0);
  4430. }
  4431. if (ic->internal_hash) {
  4432. ic->recalc_wq = alloc_workqueue("dm-integrity-recalc",
  4433. WQ_MEM_RECLAIM | WQ_PERCPU, 1);
  4434. if (!ic->recalc_wq) {
  4435. ti->error = "Cannot allocate workqueue";
  4436. r = -ENOMEM;
  4437. goto bad;
  4438. }
  4439. INIT_WORK(&ic->recalc_work, ic->mode == 'I' ? integrity_recalc_inline : integrity_recalc);
  4440. } else {
  4441. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING)) {
  4442. ti->error = "Recalculate can only be specified with internal_hash";
  4443. r = -EINVAL;
  4444. goto bad;
  4445. }
  4446. }
  4447. if (ic->sb->flags & cpu_to_le32(SB_FLAG_RECALCULATING) &&
  4448. le64_to_cpu(ic->sb->recalc_sector) < ic->provided_data_sectors &&
  4449. dm_integrity_disable_recalculate(ic)) {
  4450. ti->error = "Recalculating with HMAC is disabled for security reasons - if you really need it, use the argument \"legacy_recalculate\"";
  4451. r = -EOPNOTSUPP;
  4452. goto bad;
  4453. }
  4454. ic->bufio = dm_bufio_client_create(ic->meta_dev ? ic->meta_dev->bdev : ic->dev->bdev,
  4455. 1U << (SECTOR_SHIFT + ic->log2_buffer_sectors), 1, 0, NULL, NULL, 0);
  4456. if (IS_ERR(ic->bufio)) {
  4457. r = PTR_ERR(ic->bufio);
  4458. ti->error = "Cannot initialize dm-bufio";
  4459. ic->bufio = NULL;
  4460. goto bad;
  4461. }
  4462. dm_bufio_set_sector_offset(ic->bufio, ic->start + ic->initial_sectors);
  4463. if (ic->mode != 'R' && ic->mode != 'I') {
  4464. r = create_journal(ic, &ti->error);
  4465. if (r)
  4466. goto bad;
  4467. }
  4468. if (ic->mode == 'B') {
  4469. unsigned int i;
  4470. unsigned int n_bitmap_pages = DIV_ROUND_UP(ic->n_bitmap_blocks, PAGE_SIZE / BITMAP_BLOCK_SIZE);
  4471. ic->recalc_bitmap = dm_integrity_alloc_page_list(n_bitmap_pages);
  4472. if (!ic->recalc_bitmap) {
  4473. ti->error = "Could not allocate memory for bitmap";
  4474. r = -ENOMEM;
  4475. goto bad;
  4476. }
  4477. ic->may_write_bitmap = dm_integrity_alloc_page_list(n_bitmap_pages);
  4478. if (!ic->may_write_bitmap) {
  4479. ti->error = "Could not allocate memory for bitmap";
  4480. r = -ENOMEM;
  4481. goto bad;
  4482. }
  4483. ic->bbs = kvmalloc_objs(struct bitmap_block_status,
  4484. ic->n_bitmap_blocks);
  4485. if (!ic->bbs) {
  4486. ti->error = "Could not allocate memory for bitmap";
  4487. r = -ENOMEM;
  4488. goto bad;
  4489. }
  4490. INIT_DELAYED_WORK(&ic->bitmap_flush_work, bitmap_flush_work);
  4491. for (i = 0; i < ic->n_bitmap_blocks; i++) {
  4492. struct bitmap_block_status *bbs = &ic->bbs[i];
  4493. unsigned int sector, pl_index, pl_offset;
  4494. INIT_WORK(&bbs->work, bitmap_block_work);
  4495. bbs->ic = ic;
  4496. bbs->idx = i;
  4497. bio_list_init(&bbs->bio_queue);
  4498. spin_lock_init(&bbs->bio_queue_lock);
  4499. sector = i * (BITMAP_BLOCK_SIZE >> SECTOR_SHIFT);
  4500. pl_index = sector >> (PAGE_SHIFT - SECTOR_SHIFT);
  4501. pl_offset = (sector << SECTOR_SHIFT) & (PAGE_SIZE - 1);
  4502. bbs->bitmap = lowmem_page_address(ic->journal[pl_index].page) + pl_offset;
  4503. }
  4504. }
  4505. if (should_write_sb) {
  4506. init_journal(ic, 0, ic->journal_sections, 0);
  4507. r = dm_integrity_failed(ic);
  4508. if (unlikely(r)) {
  4509. ti->error = "Error initializing journal";
  4510. goto bad;
  4511. }
  4512. r = sync_rw_sb(ic, REQ_OP_WRITE | REQ_FUA);
  4513. if (r) {
  4514. ti->error = "Error initializing superblock";
  4515. goto bad;
  4516. }
  4517. ic->just_formatted = true;
  4518. }
  4519. if (!ic->meta_dev && ic->mode != 'I') {
  4520. r = dm_set_target_max_io_len(ti, 1U << ic->sb->log2_interleave_sectors);
  4521. if (r)
  4522. goto bad;
  4523. }
  4524. if (ic->mode == 'B') {
  4525. unsigned int max_io_len;
  4526. max_io_len = ((sector_t)ic->sectors_per_block << ic->log2_blocks_per_bitmap_bit) * (BITMAP_BLOCK_SIZE * 8);
  4527. if (!max_io_len)
  4528. max_io_len = 1U << 31;
  4529. DEBUG_print("max_io_len: old %u, new %u\n", ti->max_io_len, max_io_len);
  4530. if (!ti->max_io_len || ti->max_io_len > max_io_len) {
  4531. r = dm_set_target_max_io_len(ti, max_io_len);
  4532. if (r)
  4533. goto bad;
  4534. }
  4535. }
  4536. ti->num_flush_bios = 1;
  4537. ti->flush_supported = true;
  4538. if (ic->discard)
  4539. ti->num_discard_bios = 1;
  4540. if (ic->mode == 'I')
  4541. ti->mempool_needs_integrity = true;
  4542. dm_audit_log_ctr(DM_MSG_PREFIX, ti, 1);
  4543. return 0;
  4544. bad:
  4545. dm_audit_log_ctr(DM_MSG_PREFIX, ti, 0);
  4546. dm_integrity_dtr(ti);
  4547. return r;
  4548. }
  4549. static void dm_integrity_dtr(struct dm_target *ti)
  4550. {
  4551. struct dm_integrity_c *ic = ti->private;
  4552. BUG_ON(!RB_EMPTY_ROOT(&ic->in_progress));
  4553. BUG_ON(!list_empty(&ic->wait_list));
  4554. if (ic->mode == 'B' && ic->bitmap_flush_work.work.func)
  4555. cancel_delayed_work_sync(&ic->bitmap_flush_work);
  4556. if (ic->metadata_wq)
  4557. destroy_workqueue(ic->metadata_wq);
  4558. if (ic->wait_wq)
  4559. destroy_workqueue(ic->wait_wq);
  4560. if (ic->offload_wq)
  4561. destroy_workqueue(ic->offload_wq);
  4562. if (ic->commit_wq)
  4563. destroy_workqueue(ic->commit_wq);
  4564. if (ic->writer_wq)
  4565. destroy_workqueue(ic->writer_wq);
  4566. if (ic->recalc_wq)
  4567. destroy_workqueue(ic->recalc_wq);
  4568. kvfree(ic->bbs);
  4569. if (ic->bufio)
  4570. dm_bufio_client_destroy(ic->bufio);
  4571. mempool_free(ic->journal_ahash_req, &ic->ahash_req_pool);
  4572. mempool_exit(&ic->ahash_req_pool);
  4573. bioset_exit(&ic->recalc_bios);
  4574. bioset_exit(&ic->recheck_bios);
  4575. mempool_exit(&ic->recheck_pool);
  4576. mempool_exit(&ic->journal_io_mempool);
  4577. if (ic->io)
  4578. dm_io_client_destroy(ic->io);
  4579. if (ic->dev)
  4580. dm_put_device(ti, ic->dev);
  4581. if (ic->meta_dev)
  4582. dm_put_device(ti, ic->meta_dev);
  4583. dm_integrity_free_page_list(ic->journal);
  4584. dm_integrity_free_page_list(ic->journal_io);
  4585. dm_integrity_free_page_list(ic->journal_xor);
  4586. dm_integrity_free_page_list(ic->recalc_bitmap);
  4587. dm_integrity_free_page_list(ic->may_write_bitmap);
  4588. if (ic->journal_scatterlist)
  4589. dm_integrity_free_journal_scatterlist(ic, ic->journal_scatterlist);
  4590. if (ic->journal_io_scatterlist)
  4591. dm_integrity_free_journal_scatterlist(ic, ic->journal_io_scatterlist);
  4592. if (ic->sk_requests) {
  4593. unsigned int i;
  4594. for (i = 0; i < ic->journal_sections; i++) {
  4595. struct skcipher_request *req;
  4596. req = ic->sk_requests[i];
  4597. if (req) {
  4598. kfree_sensitive(req->iv);
  4599. skcipher_request_free(req);
  4600. }
  4601. }
  4602. kvfree(ic->sk_requests);
  4603. }
  4604. kvfree(ic->journal_tree);
  4605. if (ic->sb)
  4606. free_pages_exact(ic->sb, SB_SECTORS << SECTOR_SHIFT);
  4607. if (ic->internal_shash)
  4608. crypto_free_shash(ic->internal_shash);
  4609. if (ic->internal_ahash)
  4610. crypto_free_ahash(ic->internal_ahash);
  4611. free_alg(&ic->internal_hash_alg);
  4612. if (ic->journal_crypt)
  4613. crypto_free_skcipher(ic->journal_crypt);
  4614. free_alg(&ic->journal_crypt_alg);
  4615. if (ic->journal_mac)
  4616. crypto_free_shash(ic->journal_mac);
  4617. free_alg(&ic->journal_mac_alg);
  4618. kfree(ic);
  4619. dm_audit_log_dtr(DM_MSG_PREFIX, ti, 1);
  4620. }
  4621. static struct target_type integrity_target = {
  4622. .name = "integrity",
  4623. .version = {1, 14, 0},
  4624. .module = THIS_MODULE,
  4625. .features = DM_TARGET_SINGLETON | DM_TARGET_INTEGRITY,
  4626. .ctr = dm_integrity_ctr,
  4627. .dtr = dm_integrity_dtr,
  4628. .map = dm_integrity_map,
  4629. .end_io = dm_integrity_end_io,
  4630. .postsuspend = dm_integrity_postsuspend,
  4631. .resume = dm_integrity_resume,
  4632. .status = dm_integrity_status,
  4633. .iterate_devices = dm_integrity_iterate_devices,
  4634. .io_hints = dm_integrity_io_hints,
  4635. };
  4636. static int __init dm_integrity_init(void)
  4637. {
  4638. int r;
  4639. journal_io_cache = kmem_cache_create("integrity_journal_io",
  4640. sizeof(struct journal_io), 0, 0, NULL);
  4641. if (!journal_io_cache) {
  4642. DMERR("can't allocate journal io cache");
  4643. return -ENOMEM;
  4644. }
  4645. r = dm_register_target(&integrity_target);
  4646. if (r < 0) {
  4647. kmem_cache_destroy(journal_io_cache);
  4648. return r;
  4649. }
  4650. return 0;
  4651. }
  4652. static void __exit dm_integrity_exit(void)
  4653. {
  4654. dm_unregister_target(&integrity_target);
  4655. kmem_cache_destroy(journal_io_cache);
  4656. }
  4657. module_init(dm_integrity_init);
  4658. module_exit(dm_integrity_exit);
  4659. MODULE_AUTHOR("Milan Broz");
  4660. MODULE_AUTHOR("Mikulas Patocka");
  4661. MODULE_DESCRIPTION(DM_NAME " target for integrity tags extension");
  4662. MODULE_LICENSE("GPL");