123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826 |
- // SPDX-License-Identifier: GPL-2.0
- /*
- * Copyright (c) 2014 Red Hat, Inc.
- * All Rights Reserved.
- */
- #include "xfs.h"
- #include "xfs_fs.h"
- #include "xfs_shared.h"
- #include "xfs_format.h"
- #include "xfs_log_format.h"
- #include "xfs_trans_resv.h"
- #include "xfs_bit.h"
- #include "xfs_mount.h"
- #include "xfs_sb.h"
- #include "xfs_defer.h"
- #include "xfs_btree.h"
- #include "xfs_trans.h"
- #include "xfs_alloc.h"
- #include "xfs_rmap.h"
- #include "xfs_rmap_btree.h"
- #include "xfs_trace.h"
- #include "xfs_errortag.h"
- #include "xfs_error.h"
- #include "xfs_inode.h"
- #include "xfs_ag.h"
- struct kmem_cache *xfs_rmap_intent_cache;
- /*
- * Lookup the first record less than or equal to [bno, len, owner, offset]
- * in the btree given by cur.
- */
- int
- xfs_rmap_lookup_le(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags,
- struct xfs_rmap_irec *irec,
- int *stat)
- {
- int get_stat = 0;
- int error;
- cur->bc_rec.r.rm_startblock = bno;
- cur->bc_rec.r.rm_blockcount = 0;
- cur->bc_rec.r.rm_owner = owner;
- cur->bc_rec.r.rm_offset = offset;
- cur->bc_rec.r.rm_flags = flags;
- error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat);
- if (error || !(*stat) || !irec)
- return error;
- error = xfs_rmap_get_rec(cur, irec, &get_stat);
- if (error)
- return error;
- if (!get_stat)
- return -EFSCORRUPTED;
- return 0;
- }
- /*
- * Lookup the record exactly matching [bno, len, owner, offset]
- * in the btree given by cur.
- */
- int
- xfs_rmap_lookup_eq(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags,
- int *stat)
- {
- cur->bc_rec.r.rm_startblock = bno;
- cur->bc_rec.r.rm_blockcount = len;
- cur->bc_rec.r.rm_owner = owner;
- cur->bc_rec.r.rm_offset = offset;
- cur->bc_rec.r.rm_flags = flags;
- return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
- }
- /*
- * Update the record referred to by cur to the value given
- * by [bno, len, owner, offset].
- * This either works (return 0) or gets an EFSCORRUPTED error.
- */
- STATIC int
- xfs_rmap_update(
- struct xfs_btree_cur *cur,
- struct xfs_rmap_irec *irec)
- {
- union xfs_btree_rec rec;
- int error;
- trace_xfs_rmap_update(cur->bc_mp, cur->bc_ag.pag->pag_agno,
- irec->rm_startblock, irec->rm_blockcount,
- irec->rm_owner, irec->rm_offset, irec->rm_flags);
- rec.rmap.rm_startblock = cpu_to_be32(irec->rm_startblock);
- rec.rmap.rm_blockcount = cpu_to_be32(irec->rm_blockcount);
- rec.rmap.rm_owner = cpu_to_be64(irec->rm_owner);
- rec.rmap.rm_offset = cpu_to_be64(
- xfs_rmap_irec_offset_pack(irec));
- error = xfs_btree_update(cur, &rec);
- if (error)
- trace_xfs_rmap_update_error(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- int
- xfs_rmap_insert(
- struct xfs_btree_cur *rcur,
- xfs_agblock_t agbno,
- xfs_extlen_t len,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags)
- {
- int i;
- int error;
- trace_xfs_rmap_insert(rcur->bc_mp, rcur->bc_ag.pag->pag_agno, agbno,
- len, owner, offset, flags);
- error = xfs_rmap_lookup_eq(rcur, agbno, len, owner, offset, flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(rcur->bc_mp, i != 0)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- rcur->bc_rec.r.rm_startblock = agbno;
- rcur->bc_rec.r.rm_blockcount = len;
- rcur->bc_rec.r.rm_owner = owner;
- rcur->bc_rec.r.rm_offset = offset;
- rcur->bc_rec.r.rm_flags = flags;
- error = xfs_btree_insert(rcur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- done:
- if (error)
- trace_xfs_rmap_insert_error(rcur->bc_mp,
- rcur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- STATIC int
- xfs_rmap_delete(
- struct xfs_btree_cur *rcur,
- xfs_agblock_t agbno,
- xfs_extlen_t len,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags)
- {
- int i;
- int error;
- trace_xfs_rmap_delete(rcur->bc_mp, rcur->bc_ag.pag->pag_agno, agbno,
- len, owner, offset, flags);
- error = xfs_rmap_lookup_eq(rcur, agbno, len, owner, offset, flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- error = xfs_btree_delete(rcur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- done:
- if (error)
- trace_xfs_rmap_delete_error(rcur->bc_mp,
- rcur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- /* Convert an internal btree record to an rmap record. */
- int
- xfs_rmap_btrec_to_irec(
- const union xfs_btree_rec *rec,
- struct xfs_rmap_irec *irec)
- {
- irec->rm_startblock = be32_to_cpu(rec->rmap.rm_startblock);
- irec->rm_blockcount = be32_to_cpu(rec->rmap.rm_blockcount);
- irec->rm_owner = be64_to_cpu(rec->rmap.rm_owner);
- return xfs_rmap_irec_offset_unpack(be64_to_cpu(rec->rmap.rm_offset),
- irec);
- }
- /*
- * Get the data from the pointed-to record.
- */
- int
- xfs_rmap_get_rec(
- struct xfs_btree_cur *cur,
- struct xfs_rmap_irec *irec,
- int *stat)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_perag *pag = cur->bc_ag.pag;
- union xfs_btree_rec *rec;
- int error;
- error = xfs_btree_get_rec(cur, &rec, stat);
- if (error || !*stat)
- return error;
- if (xfs_rmap_btrec_to_irec(rec, irec))
- goto out_bad_rec;
- if (irec->rm_blockcount == 0)
- goto out_bad_rec;
- if (irec->rm_startblock <= XFS_AGFL_BLOCK(mp)) {
- if (irec->rm_owner != XFS_RMAP_OWN_FS)
- goto out_bad_rec;
- if (irec->rm_blockcount != XFS_AGFL_BLOCK(mp) + 1)
- goto out_bad_rec;
- } else {
- /* check for valid extent range, including overflow */
- if (!xfs_verify_agbext(pag, irec->rm_startblock,
- irec->rm_blockcount))
- goto out_bad_rec;
- }
- if (!(xfs_verify_ino(mp, irec->rm_owner) ||
- (irec->rm_owner <= XFS_RMAP_OWN_FS &&
- irec->rm_owner >= XFS_RMAP_OWN_MIN)))
- goto out_bad_rec;
- return 0;
- out_bad_rec:
- xfs_warn(mp,
- "Reverse Mapping BTree record corruption in AG %d detected!",
- pag->pag_agno);
- xfs_warn(mp,
- "Owner 0x%llx, flags 0x%x, start block 0x%x block count 0x%x",
- irec->rm_owner, irec->rm_flags, irec->rm_startblock,
- irec->rm_blockcount);
- return -EFSCORRUPTED;
- }
- struct xfs_find_left_neighbor_info {
- struct xfs_rmap_irec high;
- struct xfs_rmap_irec *irec;
- };
- /* For each rmap given, figure out if it matches the key we want. */
- STATIC int
- xfs_rmap_find_left_neighbor_helper(
- struct xfs_btree_cur *cur,
- const struct xfs_rmap_irec *rec,
- void *priv)
- {
- struct xfs_find_left_neighbor_info *info = priv;
- trace_xfs_rmap_find_left_neighbor_candidate(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, rec->rm_startblock,
- rec->rm_blockcount, rec->rm_owner, rec->rm_offset,
- rec->rm_flags);
- if (rec->rm_owner != info->high.rm_owner)
- return 0;
- if (!XFS_RMAP_NON_INODE_OWNER(rec->rm_owner) &&
- !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK) &&
- rec->rm_offset + rec->rm_blockcount - 1 != info->high.rm_offset)
- return 0;
- *info->irec = *rec;
- return -ECANCELED;
- }
- /*
- * Find the record to the left of the given extent, being careful only to
- * return a match with the same owner and adjacent physical and logical
- * block ranges.
- */
- STATIC int
- xfs_rmap_find_left_neighbor(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags,
- struct xfs_rmap_irec *irec,
- int *stat)
- {
- struct xfs_find_left_neighbor_info info;
- int found = 0;
- int error;
- *stat = 0;
- if (bno == 0)
- return 0;
- info.high.rm_startblock = bno - 1;
- info.high.rm_owner = owner;
- if (!XFS_RMAP_NON_INODE_OWNER(owner) &&
- !(flags & XFS_RMAP_BMBT_BLOCK)) {
- if (offset == 0)
- return 0;
- info.high.rm_offset = offset - 1;
- } else
- info.high.rm_offset = 0;
- info.high.rm_flags = flags;
- info.high.rm_blockcount = 0;
- info.irec = irec;
- trace_xfs_rmap_find_left_neighbor_query(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, bno, 0, owner, offset, flags);
- /*
- * Historically, we always used the range query to walk every reverse
- * mapping that could possibly overlap the key that the caller asked
- * for, and filter out the ones that don't. That is very slow when
- * there are a lot of records.
- *
- * However, there are two scenarios where the classic btree search can
- * produce correct results -- if the index contains a record that is an
- * exact match for the lookup key; and if there are no other records
- * between the record we want and the key we supplied.
- *
- * As an optimization, try a non-overlapped lookup first. This makes
- * extent conversion and remap operations run a bit faster if the
- * physical extents aren't being shared. If we don't find what we
- * want, we fall back to the overlapped query.
- */
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, irec,
- &found);
- if (error)
- return error;
- if (found)
- error = xfs_rmap_find_left_neighbor_helper(cur, irec, &info);
- if (!error)
- error = xfs_rmap_query_range(cur, &info.high, &info.high,
- xfs_rmap_find_left_neighbor_helper, &info);
- if (error != -ECANCELED)
- return error;
- *stat = 1;
- trace_xfs_rmap_find_left_neighbor_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, irec->rm_startblock,
- irec->rm_blockcount, irec->rm_owner, irec->rm_offset,
- irec->rm_flags);
- return 0;
- }
- /* For each rmap given, figure out if it matches the key we want. */
- STATIC int
- xfs_rmap_lookup_le_range_helper(
- struct xfs_btree_cur *cur,
- const struct xfs_rmap_irec *rec,
- void *priv)
- {
- struct xfs_find_left_neighbor_info *info = priv;
- trace_xfs_rmap_lookup_le_range_candidate(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, rec->rm_startblock,
- rec->rm_blockcount, rec->rm_owner, rec->rm_offset,
- rec->rm_flags);
- if (rec->rm_owner != info->high.rm_owner)
- return 0;
- if (!XFS_RMAP_NON_INODE_OWNER(rec->rm_owner) &&
- !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK) &&
- (rec->rm_offset > info->high.rm_offset ||
- rec->rm_offset + rec->rm_blockcount <= info->high.rm_offset))
- return 0;
- *info->irec = *rec;
- return -ECANCELED;
- }
- /*
- * Find the record to the left of the given extent, being careful only to
- * return a match with the same owner and overlapping physical and logical
- * block ranges. This is the overlapping-interval version of
- * xfs_rmap_lookup_le.
- */
- int
- xfs_rmap_lookup_le_range(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags,
- struct xfs_rmap_irec *irec,
- int *stat)
- {
- struct xfs_find_left_neighbor_info info;
- int found = 0;
- int error;
- info.high.rm_startblock = bno;
- info.high.rm_owner = owner;
- if (!XFS_RMAP_NON_INODE_OWNER(owner) && !(flags & XFS_RMAP_BMBT_BLOCK))
- info.high.rm_offset = offset;
- else
- info.high.rm_offset = 0;
- info.high.rm_flags = flags;
- info.high.rm_blockcount = 0;
- *stat = 0;
- info.irec = irec;
- trace_xfs_rmap_lookup_le_range(cur->bc_mp, cur->bc_ag.pag->pag_agno,
- bno, 0, owner, offset, flags);
- /*
- * Historically, we always used the range query to walk every reverse
- * mapping that could possibly overlap the key that the caller asked
- * for, and filter out the ones that don't. That is very slow when
- * there are a lot of records.
- *
- * However, there are two scenarios where the classic btree search can
- * produce correct results -- if the index contains a record that is an
- * exact match for the lookup key; and if there are no other records
- * between the record we want and the key we supplied.
- *
- * As an optimization, try a non-overlapped lookup first. This makes
- * scrub run much faster on most filesystems because bmbt records are
- * usually an exact match for rmap records. If we don't find what we
- * want, we fall back to the overlapped query.
- */
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, irec,
- &found);
- if (error)
- return error;
- if (found)
- error = xfs_rmap_lookup_le_range_helper(cur, irec, &info);
- if (!error)
- error = xfs_rmap_query_range(cur, &info.high, &info.high,
- xfs_rmap_lookup_le_range_helper, &info);
- if (error != -ECANCELED)
- return error;
- *stat = 1;
- trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, irec->rm_startblock,
- irec->rm_blockcount, irec->rm_owner, irec->rm_offset,
- irec->rm_flags);
- return 0;
- }
- /*
- * Perform all the relevant owner checks for a removal op. If we're doing an
- * unknown-owner removal then we have no owner information to check.
- */
- static int
- xfs_rmap_free_check_owner(
- struct xfs_mount *mp,
- uint64_t ltoff,
- struct xfs_rmap_irec *rec,
- xfs_filblks_t len,
- uint64_t owner,
- uint64_t offset,
- unsigned int flags)
- {
- int error = 0;
- if (owner == XFS_RMAP_OWN_UNKNOWN)
- return 0;
- /* Make sure the unwritten flag matches. */
- if (XFS_IS_CORRUPT(mp,
- (flags & XFS_RMAP_UNWRITTEN) !=
- (rec->rm_flags & XFS_RMAP_UNWRITTEN))) {
- error = -EFSCORRUPTED;
- goto out;
- }
- /* Make sure the owner matches what we expect to find in the tree. */
- if (XFS_IS_CORRUPT(mp, owner != rec->rm_owner)) {
- error = -EFSCORRUPTED;
- goto out;
- }
- /* Check the offset, if necessary. */
- if (XFS_RMAP_NON_INODE_OWNER(owner))
- goto out;
- if (flags & XFS_RMAP_BMBT_BLOCK) {
- if (XFS_IS_CORRUPT(mp,
- !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK))) {
- error = -EFSCORRUPTED;
- goto out;
- }
- } else {
- if (XFS_IS_CORRUPT(mp, rec->rm_offset > offset)) {
- error = -EFSCORRUPTED;
- goto out;
- }
- if (XFS_IS_CORRUPT(mp,
- offset + len > ltoff + rec->rm_blockcount)) {
- error = -EFSCORRUPTED;
- goto out;
- }
- }
- out:
- return error;
- }
- /*
- * Find the extent in the rmap btree and remove it.
- *
- * The record we find should always be an exact match for the extent that we're
- * looking for, since we insert them into the btree without modification.
- *
- * Special Case #1: when growing the filesystem, we "free" an extent when
- * growing the last AG. This extent is new space and so it is not tracked as
- * used space in the btree. The growfs code will pass in an owner of
- * XFS_RMAP_OWN_NULL to indicate that it expected that there is no owner of this
- * extent. We verify that - the extent lookup result in a record that does not
- * overlap.
- *
- * Special Case #2: EFIs do not record the owner of the extent, so when
- * recovering EFIs from the log we pass in XFS_RMAP_OWN_UNKNOWN to tell the rmap
- * btree to ignore the owner (i.e. wildcard match) so we don't trigger
- * corruption checks during log recovery.
- */
- STATIC int
- xfs_rmap_unmap(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool unwritten,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_rmap_irec ltrec;
- uint64_t ltoff;
- int error = 0;
- int i;
- uint64_t owner;
- uint64_t offset;
- unsigned int flags;
- bool ignore_off;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- ignore_off = XFS_RMAP_NON_INODE_OWNER(owner) ||
- (flags & XFS_RMAP_BMBT_BLOCK);
- if (unwritten)
- flags |= XFS_RMAP_UNWRITTEN;
- trace_xfs_rmap_unmap(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- /*
- * We should always have a left record because there's a static record
- * for the AG headers at rm_startblock == 0 created by mkfs/growfs that
- * will not ever be removed from the tree.
- */
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, <rec, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags);
- ltoff = ltrec.rm_offset;
- /*
- * For growfs, the incoming extent must be beyond the left record we
- * just found as it is new space and won't be used by anyone. This is
- * just a corruption check as we don't actually do anything with this
- * extent. Note that we need to use >= instead of > because it might
- * be the case that the "left" extent goes all the way to EOFS.
- */
- if (owner == XFS_RMAP_OWN_NULL) {
- if (XFS_IS_CORRUPT(mp,
- bno <
- ltrec.rm_startblock + ltrec.rm_blockcount)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- goto out_done;
- }
- /*
- * If we're doing an unknown-owner removal for EFI recovery, we expect
- * to find the full range in the rmapbt or nothing at all. If we
- * don't find any rmaps overlapping either end of the range, we're
- * done. Hopefully this means that the EFI creator already queued
- * (and finished) a RUI to remove the rmap.
- */
- if (owner == XFS_RMAP_OWN_UNKNOWN &&
- ltrec.rm_startblock + ltrec.rm_blockcount <= bno) {
- struct xfs_rmap_irec rtrec;
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto out_error;
- if (i == 0)
- goto out_done;
- error = xfs_rmap_get_rec(cur, &rtrec, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- if (rtrec.rm_startblock >= bno + len)
- goto out_done;
- }
- /* Make sure the extent we found covers the entire freeing range. */
- if (XFS_IS_CORRUPT(mp,
- ltrec.rm_startblock > bno ||
- ltrec.rm_startblock + ltrec.rm_blockcount <
- bno + len)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- /* Check owner information. */
- error = xfs_rmap_free_check_owner(mp, ltoff, <rec, len, owner,
- offset, flags);
- if (error)
- goto out_error;
- if (ltrec.rm_startblock == bno && ltrec.rm_blockcount == len) {
- /* exact match, simply remove the record from rmap tree */
- trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
- ltrec.rm_startblock, ltrec.rm_blockcount,
- ltrec.rm_owner, ltrec.rm_offset,
- ltrec.rm_flags);
- error = xfs_btree_delete(cur, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- } else if (ltrec.rm_startblock == bno) {
- /*
- * overlap left hand side of extent: move the start, trim the
- * length and update the current record.
- *
- * ltbno ltlen
- * Orig: |oooooooooooooooooooo|
- * Freeing: |fffffffff|
- * Result: |rrrrrrrrrr|
- * bno len
- */
- ltrec.rm_startblock += len;
- ltrec.rm_blockcount -= len;
- if (!ignore_off)
- ltrec.rm_offset += len;
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- } else if (ltrec.rm_startblock + ltrec.rm_blockcount == bno + len) {
- /*
- * overlap right hand side of extent: trim the length and update
- * the current record.
- *
- * ltbno ltlen
- * Orig: |oooooooooooooooooooo|
- * Freeing: |fffffffff|
- * Result: |rrrrrrrrrr|
- * bno len
- */
- ltrec.rm_blockcount -= len;
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- } else {
- /*
- * overlap middle of extent: trim the length of the existing
- * record to the length of the new left-extent size, increment
- * the insertion position so we can insert a new record
- * containing the remaining right-extent space.
- *
- * ltbno ltlen
- * Orig: |oooooooooooooooooooo|
- * Freeing: |fffffffff|
- * Result: |rrrrr| |rrrr|
- * bno len
- */
- xfs_extlen_t orig_len = ltrec.rm_blockcount;
- ltrec.rm_blockcount = bno - ltrec.rm_startblock;
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto out_error;
- cur->bc_rec.r.rm_startblock = bno + len;
- cur->bc_rec.r.rm_blockcount = orig_len - len -
- ltrec.rm_blockcount;
- cur->bc_rec.r.rm_owner = ltrec.rm_owner;
- if (ignore_off)
- cur->bc_rec.r.rm_offset = 0;
- else
- cur->bc_rec.r.rm_offset = offset + len;
- cur->bc_rec.r.rm_flags = flags;
- trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno,
- cur->bc_rec.r.rm_startblock,
- cur->bc_rec.r.rm_blockcount,
- cur->bc_rec.r.rm_owner,
- cur->bc_rec.r.rm_offset,
- cur->bc_rec.r.rm_flags);
- error = xfs_btree_insert(cur, &i);
- if (error)
- goto out_error;
- }
- out_done:
- trace_xfs_rmap_unmap_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- out_error:
- if (error)
- trace_xfs_rmap_unmap_error(mp, cur->bc_ag.pag->pag_agno,
- error, _RET_IP_);
- return error;
- }
- /*
- * Remove a reference to an extent in the rmap btree.
- */
- int
- xfs_rmap_free(
- struct xfs_trans *tp,
- struct xfs_buf *agbp,
- struct xfs_perag *pag,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = tp->t_mountp;
- struct xfs_btree_cur *cur;
- int error;
- if (!xfs_has_rmapbt(mp))
- return 0;
- cur = xfs_rmapbt_init_cursor(mp, tp, agbp, pag);
- error = xfs_rmap_unmap(cur, bno, len, false, oinfo);
- xfs_btree_del_cursor(cur, error);
- return error;
- }
- /*
- * A mergeable rmap must have the same owner and the same values for
- * the unwritten, attr_fork, and bmbt flags. The startblock and
- * offset are checked separately.
- */
- static bool
- xfs_rmap_is_mergeable(
- struct xfs_rmap_irec *irec,
- uint64_t owner,
- unsigned int flags)
- {
- if (irec->rm_owner == XFS_RMAP_OWN_NULL)
- return false;
- if (irec->rm_owner != owner)
- return false;
- if ((flags & XFS_RMAP_UNWRITTEN) ^
- (irec->rm_flags & XFS_RMAP_UNWRITTEN))
- return false;
- if ((flags & XFS_RMAP_ATTR_FORK) ^
- (irec->rm_flags & XFS_RMAP_ATTR_FORK))
- return false;
- if ((flags & XFS_RMAP_BMBT_BLOCK) ^
- (irec->rm_flags & XFS_RMAP_BMBT_BLOCK))
- return false;
- return true;
- }
- /*
- * When we allocate a new block, the first thing we do is add a reference to
- * the extent in the rmap btree. This takes the form of a [agbno, length,
- * owner, offset] record. Flags are encoded in the high bits of the offset
- * field.
- */
- STATIC int
- xfs_rmap_map(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool unwritten,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_rmap_irec ltrec;
- struct xfs_rmap_irec gtrec;
- int have_gt;
- int have_lt;
- int error = 0;
- int i;
- uint64_t owner;
- uint64_t offset;
- unsigned int flags = 0;
- bool ignore_off;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- ASSERT(owner != 0);
- ignore_off = XFS_RMAP_NON_INODE_OWNER(owner) ||
- (flags & XFS_RMAP_BMBT_BLOCK);
- if (unwritten)
- flags |= XFS_RMAP_UNWRITTEN;
- trace_xfs_rmap_map(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- ASSERT(!xfs_rmap_should_skip_owner_update(oinfo));
- /*
- * For the initial lookup, look for an exact match or the left-adjacent
- * record for our insertion point. This will also give us the record for
- * start block contiguity tests.
- */
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, <rec,
- &have_lt);
- if (error)
- goto out_error;
- if (have_lt) {
- trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags);
- if (!xfs_rmap_is_mergeable(<rec, owner, flags))
- have_lt = 0;
- }
- if (XFS_IS_CORRUPT(mp,
- have_lt != 0 &&
- ltrec.rm_startblock + ltrec.rm_blockcount > bno)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- /*
- * Increment the cursor to see if we have a right-adjacent record to our
- * insertion point. This will give us the record for end block
- * contiguity tests.
- */
- error = xfs_btree_increment(cur, 0, &have_gt);
- if (error)
- goto out_error;
- if (have_gt) {
- error = xfs_rmap_get_rec(cur, >rec, &have_gt);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, have_gt != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- if (XFS_IS_CORRUPT(mp, bno + len > gtrec.rm_startblock)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, gtrec.rm_startblock,
- gtrec.rm_blockcount, gtrec.rm_owner,
- gtrec.rm_offset, gtrec.rm_flags);
- if (!xfs_rmap_is_mergeable(>rec, owner, flags))
- have_gt = 0;
- }
- /*
- * Note: cursor currently points one record to the right of ltrec, even
- * if there is no record in the tree to the right.
- */
- if (have_lt &&
- ltrec.rm_startblock + ltrec.rm_blockcount == bno &&
- (ignore_off || ltrec.rm_offset + ltrec.rm_blockcount == offset)) {
- /*
- * left edge contiguous, merge into left record.
- *
- * ltbno ltlen
- * orig: |ooooooooo|
- * adding: |aaaaaaaaa|
- * result: |rrrrrrrrrrrrrrrrrrr|
- * bno len
- */
- ltrec.rm_blockcount += len;
- if (have_gt &&
- bno + len == gtrec.rm_startblock &&
- (ignore_off || offset + len == gtrec.rm_offset) &&
- (unsigned long)ltrec.rm_blockcount + len +
- gtrec.rm_blockcount <= XFS_RMAP_LEN_MAX) {
- /*
- * right edge also contiguous, delete right record
- * and merge into left record.
- *
- * ltbno ltlen gtbno gtlen
- * orig: |ooooooooo| |ooooooooo|
- * adding: |aaaaaaaaa|
- * result: |rrrrrrrrrrrrrrrrrrrrrrrrrrrrr|
- */
- ltrec.rm_blockcount += gtrec.rm_blockcount;
- trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
- gtrec.rm_startblock,
- gtrec.rm_blockcount,
- gtrec.rm_owner,
- gtrec.rm_offset,
- gtrec.rm_flags);
- error = xfs_btree_delete(cur, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- }
- /* point the cursor back to the left record and update */
- error = xfs_btree_decrement(cur, 0, &have_gt);
- if (error)
- goto out_error;
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- } else if (have_gt &&
- bno + len == gtrec.rm_startblock &&
- (ignore_off || offset + len == gtrec.rm_offset)) {
- /*
- * right edge contiguous, merge into right record.
- *
- * gtbno gtlen
- * Orig: |ooooooooo|
- * adding: |aaaaaaaaa|
- * Result: |rrrrrrrrrrrrrrrrrrr|
- * bno len
- */
- gtrec.rm_startblock = bno;
- gtrec.rm_blockcount += len;
- if (!ignore_off)
- gtrec.rm_offset = offset;
- error = xfs_rmap_update(cur, >rec);
- if (error)
- goto out_error;
- } else {
- /*
- * no contiguous edge with identical owner, insert
- * new record at current cursor position.
- */
- cur->bc_rec.r.rm_startblock = bno;
- cur->bc_rec.r.rm_blockcount = len;
- cur->bc_rec.r.rm_owner = owner;
- cur->bc_rec.r.rm_offset = offset;
- cur->bc_rec.r.rm_flags = flags;
- trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno, len,
- owner, offset, flags);
- error = xfs_btree_insert(cur, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- }
- trace_xfs_rmap_map_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- out_error:
- if (error)
- trace_xfs_rmap_map_error(mp, cur->bc_ag.pag->pag_agno,
- error, _RET_IP_);
- return error;
- }
- /*
- * Add a reference to an extent in the rmap btree.
- */
- int
- xfs_rmap_alloc(
- struct xfs_trans *tp,
- struct xfs_buf *agbp,
- struct xfs_perag *pag,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = tp->t_mountp;
- struct xfs_btree_cur *cur;
- int error;
- if (!xfs_has_rmapbt(mp))
- return 0;
- cur = xfs_rmapbt_init_cursor(mp, tp, agbp, pag);
- error = xfs_rmap_map(cur, bno, len, false, oinfo);
- xfs_btree_del_cursor(cur, error);
- return error;
- }
- #define RMAP_LEFT_CONTIG (1 << 0)
- #define RMAP_RIGHT_CONTIG (1 << 1)
- #define RMAP_LEFT_FILLING (1 << 2)
- #define RMAP_RIGHT_FILLING (1 << 3)
- #define RMAP_LEFT_VALID (1 << 6)
- #define RMAP_RIGHT_VALID (1 << 7)
- #define LEFT r[0]
- #define RIGHT r[1]
- #define PREV r[2]
- #define NEW r[3]
- /*
- * Convert an unwritten extent to a real extent or vice versa.
- * Does not handle overlapping extents.
- */
- STATIC int
- xfs_rmap_convert(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool unwritten,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_rmap_irec r[4]; /* neighbor extent entries */
- /* left is 0, right is 1, */
- /* prev is 2, new is 3 */
- uint64_t owner;
- uint64_t offset;
- uint64_t new_endoff;
- unsigned int oldext;
- unsigned int newext;
- unsigned int flags = 0;
- int i;
- int state = 0;
- int error;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- ASSERT(!(XFS_RMAP_NON_INODE_OWNER(owner) ||
- (flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK))));
- oldext = unwritten ? XFS_RMAP_UNWRITTEN : 0;
- new_endoff = offset + len;
- trace_xfs_rmap_convert(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- /*
- * For the initial lookup, look for an exact match or the left-adjacent
- * record for our insertion point. This will also give us the record for
- * start block contiguity tests.
- */
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, oldext, &PREV, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, PREV.rm_startblock,
- PREV.rm_blockcount, PREV.rm_owner,
- PREV.rm_offset, PREV.rm_flags);
- ASSERT(PREV.rm_offset <= offset);
- ASSERT(PREV.rm_offset + PREV.rm_blockcount >= new_endoff);
- ASSERT((PREV.rm_flags & XFS_RMAP_UNWRITTEN) == oldext);
- newext = ~oldext & XFS_RMAP_UNWRITTEN;
- /*
- * Set flags determining what part of the previous oldext allocation
- * extent is being replaced by a newext allocation.
- */
- if (PREV.rm_offset == offset)
- state |= RMAP_LEFT_FILLING;
- if (PREV.rm_offset + PREV.rm_blockcount == new_endoff)
- state |= RMAP_RIGHT_FILLING;
- /*
- * Decrement the cursor to see if we have a left-adjacent record to our
- * insertion point. This will give us the record for end block
- * contiguity tests.
- */
- error = xfs_btree_decrement(cur, 0, &i);
- if (error)
- goto done;
- if (i) {
- state |= RMAP_LEFT_VALID;
- error = xfs_rmap_get_rec(cur, &LEFT, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- if (XFS_IS_CORRUPT(mp,
- LEFT.rm_startblock + LEFT.rm_blockcount >
- bno)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_find_left_neighbor_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, LEFT.rm_startblock,
- LEFT.rm_blockcount, LEFT.rm_owner,
- LEFT.rm_offset, LEFT.rm_flags);
- if (LEFT.rm_startblock + LEFT.rm_blockcount == bno &&
- LEFT.rm_offset + LEFT.rm_blockcount == offset &&
- xfs_rmap_is_mergeable(&LEFT, owner, newext))
- state |= RMAP_LEFT_CONTIG;
- }
- /*
- * Increment the cursor to see if we have a right-adjacent record to our
- * insertion point. This will give us the record for end block
- * contiguity tests.
- */
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto done;
- if (i) {
- state |= RMAP_RIGHT_VALID;
- error = xfs_rmap_get_rec(cur, &RIGHT, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- if (XFS_IS_CORRUPT(mp, bno + len > RIGHT.rm_startblock)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, RIGHT.rm_startblock,
- RIGHT.rm_blockcount, RIGHT.rm_owner,
- RIGHT.rm_offset, RIGHT.rm_flags);
- if (bno + len == RIGHT.rm_startblock &&
- offset + len == RIGHT.rm_offset &&
- xfs_rmap_is_mergeable(&RIGHT, owner, newext))
- state |= RMAP_RIGHT_CONTIG;
- }
- /* check that left + prev + right is not too long */
- if ((state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) ==
- (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG) &&
- (unsigned long)LEFT.rm_blockcount + len +
- RIGHT.rm_blockcount > XFS_RMAP_LEN_MAX)
- state &= ~RMAP_RIGHT_CONTIG;
- trace_xfs_rmap_convert_state(mp, cur->bc_ag.pag->pag_agno, state,
- _RET_IP_);
- /* reset the cursor back to PREV */
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, oldext, NULL, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- /*
- * Switch out based on the FILLING and CONTIG state bits.
- */
- switch (state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) {
- case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
- /*
- * Setting all of a previous oldext extent to newext.
- * The left and right neighbors are both contiguous with new.
- */
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
- RIGHT.rm_startblock, RIGHT.rm_blockcount,
- RIGHT.rm_owner, RIGHT.rm_offset,
- RIGHT.rm_flags);
- error = xfs_btree_delete(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- error = xfs_btree_decrement(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
- PREV.rm_startblock, PREV.rm_blockcount,
- PREV.rm_owner, PREV.rm_offset,
- PREV.rm_flags);
- error = xfs_btree_delete(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- error = xfs_btree_decrement(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW = LEFT;
- NEW.rm_blockcount += PREV.rm_blockcount + RIGHT.rm_blockcount;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
- /*
- * Setting all of a previous oldext extent to newext.
- * The left neighbor is contiguous, the right is not.
- */
- trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
- PREV.rm_startblock, PREV.rm_blockcount,
- PREV.rm_owner, PREV.rm_offset,
- PREV.rm_flags);
- error = xfs_btree_delete(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- error = xfs_btree_decrement(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW = LEFT;
- NEW.rm_blockcount += PREV.rm_blockcount;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
- /*
- * Setting all of a previous oldext extent to newext.
- * The right neighbor is contiguous, the left is not.
- */
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
- RIGHT.rm_startblock, RIGHT.rm_blockcount,
- RIGHT.rm_owner, RIGHT.rm_offset,
- RIGHT.rm_flags);
- error = xfs_btree_delete(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- error = xfs_btree_decrement(cur, 0, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW = PREV;
- NEW.rm_blockcount = len + RIGHT.rm_blockcount;
- NEW.rm_flags = newext;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING:
- /*
- * Setting all of a previous oldext extent to newext.
- * Neither the left nor right neighbors are contiguous with
- * the new one.
- */
- NEW = PREV;
- NEW.rm_flags = newext;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG:
- /*
- * Setting the first part of a previous oldext extent to newext.
- * The left neighbor is contiguous.
- */
- NEW = PREV;
- NEW.rm_offset += len;
- NEW.rm_startblock += len;
- NEW.rm_blockcount -= len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- error = xfs_btree_decrement(cur, 0, &i);
- if (error)
- goto done;
- NEW = LEFT;
- NEW.rm_blockcount += len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING:
- /*
- * Setting the first part of a previous oldext extent to newext.
- * The left neighbor is not contiguous.
- */
- NEW = PREV;
- NEW.rm_startblock += len;
- NEW.rm_offset += len;
- NEW.rm_blockcount -= len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- NEW.rm_startblock = bno;
- NEW.rm_owner = owner;
- NEW.rm_offset = offset;
- NEW.rm_blockcount = len;
- NEW.rm_flags = newext;
- cur->bc_rec.r = NEW;
- trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno,
- len, owner, offset, newext);
- error = xfs_btree_insert(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- break;
- case RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
- /*
- * Setting the last part of a previous oldext extent to newext.
- * The right neighbor is contiguous with the new allocation.
- */
- NEW = PREV;
- NEW.rm_blockcount -= len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- error = xfs_btree_increment(cur, 0, &i);
- if (error)
- goto done;
- NEW = RIGHT;
- NEW.rm_offset = offset;
- NEW.rm_startblock = bno;
- NEW.rm_blockcount += len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_RIGHT_FILLING:
- /*
- * Setting the last part of a previous oldext extent to newext.
- * The right neighbor is not contiguous.
- */
- NEW = PREV;
- NEW.rm_blockcount -= len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- error = xfs_rmap_lookup_eq(cur, bno, len, owner, offset,
- oldext, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 0)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_startblock = bno;
- NEW.rm_owner = owner;
- NEW.rm_offset = offset;
- NEW.rm_blockcount = len;
- NEW.rm_flags = newext;
- cur->bc_rec.r = NEW;
- trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno,
- len, owner, offset, newext);
- error = xfs_btree_insert(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- break;
- case 0:
- /*
- * Setting the middle part of a previous oldext extent to
- * newext. Contiguity is impossible here.
- * One extent becomes three extents.
- */
- /* new right extent - oldext */
- NEW.rm_startblock = bno + len;
- NEW.rm_owner = owner;
- NEW.rm_offset = new_endoff;
- NEW.rm_blockcount = PREV.rm_offset + PREV.rm_blockcount -
- new_endoff;
- NEW.rm_flags = PREV.rm_flags;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- /* new left extent - oldext */
- NEW = PREV;
- NEW.rm_blockcount = offset - PREV.rm_offset;
- cur->bc_rec.r = NEW;
- trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno,
- NEW.rm_startblock, NEW.rm_blockcount,
- NEW.rm_owner, NEW.rm_offset,
- NEW.rm_flags);
- error = xfs_btree_insert(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- /*
- * Reset the cursor to the position of the new extent
- * we are about to insert as we can't trust it after
- * the previous insert.
- */
- error = xfs_rmap_lookup_eq(cur, bno, len, owner, offset,
- oldext, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 0)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- /* new middle extent - newext */
- cur->bc_rec.r.rm_flags &= ~XFS_RMAP_UNWRITTEN;
- cur->bc_rec.r.rm_flags |= newext;
- trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno, len,
- owner, offset, newext);
- error = xfs_btree_insert(cur, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- break;
- case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
- case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
- case RMAP_LEFT_FILLING | RMAP_RIGHT_CONTIG:
- case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
- case RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
- case RMAP_LEFT_CONTIG:
- case RMAP_RIGHT_CONTIG:
- /*
- * These cases are all impossible.
- */
- ASSERT(0);
- }
- trace_xfs_rmap_convert_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- done:
- if (error)
- trace_xfs_rmap_convert_error(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- /*
- * Convert an unwritten extent to a real extent or vice versa. If there is no
- * possibility of overlapping extents, delegate to the simpler convert
- * function.
- */
- STATIC int
- xfs_rmap_convert_shared(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool unwritten,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_rmap_irec r[4]; /* neighbor extent entries */
- /* left is 0, right is 1, */
- /* prev is 2, new is 3 */
- uint64_t owner;
- uint64_t offset;
- uint64_t new_endoff;
- unsigned int oldext;
- unsigned int newext;
- unsigned int flags = 0;
- int i;
- int state = 0;
- int error;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- ASSERT(!(XFS_RMAP_NON_INODE_OWNER(owner) ||
- (flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK))));
- oldext = unwritten ? XFS_RMAP_UNWRITTEN : 0;
- new_endoff = offset + len;
- trace_xfs_rmap_convert(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- /*
- * For the initial lookup, look for and exact match or the left-adjacent
- * record for our insertion point. This will also give us the record for
- * start block contiguity tests.
- */
- error = xfs_rmap_lookup_le_range(cur, bno, owner, offset, oldext,
- &PREV, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- ASSERT(PREV.rm_offset <= offset);
- ASSERT(PREV.rm_offset + PREV.rm_blockcount >= new_endoff);
- ASSERT((PREV.rm_flags & XFS_RMAP_UNWRITTEN) == oldext);
- newext = ~oldext & XFS_RMAP_UNWRITTEN;
- /*
- * Set flags determining what part of the previous oldext allocation
- * extent is being replaced by a newext allocation.
- */
- if (PREV.rm_offset == offset)
- state |= RMAP_LEFT_FILLING;
- if (PREV.rm_offset + PREV.rm_blockcount == new_endoff)
- state |= RMAP_RIGHT_FILLING;
- /* Is there a left record that abuts our range? */
- error = xfs_rmap_find_left_neighbor(cur, bno, owner, offset, newext,
- &LEFT, &i);
- if (error)
- goto done;
- if (i) {
- state |= RMAP_LEFT_VALID;
- if (XFS_IS_CORRUPT(mp,
- LEFT.rm_startblock + LEFT.rm_blockcount >
- bno)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- if (xfs_rmap_is_mergeable(&LEFT, owner, newext))
- state |= RMAP_LEFT_CONTIG;
- }
- /* Is there a right record that abuts our range? */
- error = xfs_rmap_lookup_eq(cur, bno + len, len, owner, offset + len,
- newext, &i);
- if (error)
- goto done;
- if (i) {
- state |= RMAP_RIGHT_VALID;
- error = xfs_rmap_get_rec(cur, &RIGHT, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- if (XFS_IS_CORRUPT(mp, bno + len > RIGHT.rm_startblock)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, RIGHT.rm_startblock,
- RIGHT.rm_blockcount, RIGHT.rm_owner,
- RIGHT.rm_offset, RIGHT.rm_flags);
- if (xfs_rmap_is_mergeable(&RIGHT, owner, newext))
- state |= RMAP_RIGHT_CONTIG;
- }
- /* check that left + prev + right is not too long */
- if ((state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) ==
- (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG) &&
- (unsigned long)LEFT.rm_blockcount + len +
- RIGHT.rm_blockcount > XFS_RMAP_LEN_MAX)
- state &= ~RMAP_RIGHT_CONTIG;
- trace_xfs_rmap_convert_state(mp, cur->bc_ag.pag->pag_agno, state,
- _RET_IP_);
- /*
- * Switch out based on the FILLING and CONTIG state bits.
- */
- switch (state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) {
- case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
- RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
- /*
- * Setting all of a previous oldext extent to newext.
- * The left and right neighbors are both contiguous with new.
- */
- error = xfs_rmap_delete(cur, RIGHT.rm_startblock,
- RIGHT.rm_blockcount, RIGHT.rm_owner,
- RIGHT.rm_offset, RIGHT.rm_flags);
- if (error)
- goto done;
- error = xfs_rmap_delete(cur, PREV.rm_startblock,
- PREV.rm_blockcount, PREV.rm_owner,
- PREV.rm_offset, PREV.rm_flags);
- if (error)
- goto done;
- NEW = LEFT;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount += PREV.rm_blockcount + RIGHT.rm_blockcount;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
- /*
- * Setting all of a previous oldext extent to newext.
- * The left neighbor is contiguous, the right is not.
- */
- error = xfs_rmap_delete(cur, PREV.rm_startblock,
- PREV.rm_blockcount, PREV.rm_owner,
- PREV.rm_offset, PREV.rm_flags);
- if (error)
- goto done;
- NEW = LEFT;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount += PREV.rm_blockcount;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
- /*
- * Setting all of a previous oldext extent to newext.
- * The right neighbor is contiguous, the left is not.
- */
- error = xfs_rmap_delete(cur, RIGHT.rm_startblock,
- RIGHT.rm_blockcount, RIGHT.rm_owner,
- RIGHT.rm_offset, RIGHT.rm_flags);
- if (error)
- goto done;
- NEW = PREV;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount += RIGHT.rm_blockcount;
- NEW.rm_flags = RIGHT.rm_flags;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING:
- /*
- * Setting all of a previous oldext extent to newext.
- * Neither the left nor right neighbors are contiguous with
- * the new one.
- */
- NEW = PREV;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_flags = newext;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG:
- /*
- * Setting the first part of a previous oldext extent to newext.
- * The left neighbor is contiguous.
- */
- NEW = PREV;
- error = xfs_rmap_delete(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags);
- if (error)
- goto done;
- NEW.rm_offset += len;
- NEW.rm_startblock += len;
- NEW.rm_blockcount -= len;
- error = xfs_rmap_insert(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags);
- if (error)
- goto done;
- NEW = LEFT;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount += len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING:
- /*
- * Setting the first part of a previous oldext extent to newext.
- * The left neighbor is not contiguous.
- */
- NEW = PREV;
- error = xfs_rmap_delete(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags);
- if (error)
- goto done;
- NEW.rm_offset += len;
- NEW.rm_startblock += len;
- NEW.rm_blockcount -= len;
- error = xfs_rmap_insert(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags);
- if (error)
- goto done;
- error = xfs_rmap_insert(cur, bno, len, owner, offset, newext);
- if (error)
- goto done;
- break;
- case RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
- /*
- * Setting the last part of a previous oldext extent to newext.
- * The right neighbor is contiguous with the new allocation.
- */
- NEW = PREV;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount = offset - NEW.rm_offset;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- NEW = RIGHT;
- error = xfs_rmap_delete(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags);
- if (error)
- goto done;
- NEW.rm_offset = offset;
- NEW.rm_startblock = bno;
- NEW.rm_blockcount += len;
- error = xfs_rmap_insert(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags);
- if (error)
- goto done;
- break;
- case RMAP_RIGHT_FILLING:
- /*
- * Setting the last part of a previous oldext extent to newext.
- * The right neighbor is not contiguous.
- */
- NEW = PREV;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount -= len;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- error = xfs_rmap_insert(cur, bno, len, owner, offset, newext);
- if (error)
- goto done;
- break;
- case 0:
- /*
- * Setting the middle part of a previous oldext extent to
- * newext. Contiguity is impossible here.
- * One extent becomes three extents.
- */
- /* new right extent - oldext */
- NEW.rm_startblock = bno + len;
- NEW.rm_owner = owner;
- NEW.rm_offset = new_endoff;
- NEW.rm_blockcount = PREV.rm_offset + PREV.rm_blockcount -
- new_endoff;
- NEW.rm_flags = PREV.rm_flags;
- error = xfs_rmap_insert(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner, NEW.rm_offset,
- NEW.rm_flags);
- if (error)
- goto done;
- /* new left extent - oldext */
- NEW = PREV;
- error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner,
- NEW.rm_offset, NEW.rm_flags, &i);
- if (error)
- goto done;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto done;
- }
- NEW.rm_blockcount = offset - NEW.rm_offset;
- error = xfs_rmap_update(cur, &NEW);
- if (error)
- goto done;
- /* new middle extent - newext */
- NEW.rm_startblock = bno;
- NEW.rm_blockcount = len;
- NEW.rm_owner = owner;
- NEW.rm_offset = offset;
- NEW.rm_flags = newext;
- error = xfs_rmap_insert(cur, NEW.rm_startblock,
- NEW.rm_blockcount, NEW.rm_owner, NEW.rm_offset,
- NEW.rm_flags);
- if (error)
- goto done;
- break;
- case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
- case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
- case RMAP_LEFT_FILLING | RMAP_RIGHT_CONTIG:
- case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
- case RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
- case RMAP_LEFT_CONTIG:
- case RMAP_RIGHT_CONTIG:
- /*
- * These cases are all impossible.
- */
- ASSERT(0);
- }
- trace_xfs_rmap_convert_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- done:
- if (error)
- trace_xfs_rmap_convert_error(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- #undef NEW
- #undef LEFT
- #undef RIGHT
- #undef PREV
- /*
- * Find an extent in the rmap btree and unmap it. For rmap extent types that
- * can overlap (data fork rmaps on reflink filesystems) we must be careful
- * that the prev/next records in the btree might belong to another owner.
- * Therefore we must use delete+insert to alter any of the key fields.
- *
- * For every other situation there can only be one owner for a given extent,
- * so we can call the regular _free function.
- */
- STATIC int
- xfs_rmap_unmap_shared(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool unwritten,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_rmap_irec ltrec;
- uint64_t ltoff;
- int error = 0;
- int i;
- uint64_t owner;
- uint64_t offset;
- unsigned int flags;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- if (unwritten)
- flags |= XFS_RMAP_UNWRITTEN;
- trace_xfs_rmap_unmap(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- /*
- * We should always have a left record because there's a static record
- * for the AG headers at rm_startblock == 0 created by mkfs/growfs that
- * will not ever be removed from the tree.
- */
- error = xfs_rmap_lookup_le_range(cur, bno, owner, offset, flags,
- <rec, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- ltoff = ltrec.rm_offset;
- /* Make sure the extent we found covers the entire freeing range. */
- if (XFS_IS_CORRUPT(mp,
- ltrec.rm_startblock > bno ||
- ltrec.rm_startblock + ltrec.rm_blockcount <
- bno + len)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- /* Make sure the owner matches what we expect to find in the tree. */
- if (XFS_IS_CORRUPT(mp, owner != ltrec.rm_owner)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- /* Make sure the unwritten flag matches. */
- if (XFS_IS_CORRUPT(mp,
- (flags & XFS_RMAP_UNWRITTEN) !=
- (ltrec.rm_flags & XFS_RMAP_UNWRITTEN))) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- /* Check the offset. */
- if (XFS_IS_CORRUPT(mp, ltrec.rm_offset > offset)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- if (XFS_IS_CORRUPT(mp, offset > ltoff + ltrec.rm_blockcount)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- if (ltrec.rm_startblock == bno && ltrec.rm_blockcount == len) {
- /* Exact match, simply remove the record from rmap tree. */
- error = xfs_rmap_delete(cur, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags);
- if (error)
- goto out_error;
- } else if (ltrec.rm_startblock == bno) {
- /*
- * Overlap left hand side of extent: move the start, trim the
- * length and update the current record.
- *
- * ltbno ltlen
- * Orig: |oooooooooooooooooooo|
- * Freeing: |fffffffff|
- * Result: |rrrrrrrrrr|
- * bno len
- */
- /* Delete prev rmap. */
- error = xfs_rmap_delete(cur, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags);
- if (error)
- goto out_error;
- /* Add an rmap at the new offset. */
- ltrec.rm_startblock += len;
- ltrec.rm_blockcount -= len;
- ltrec.rm_offset += len;
- error = xfs_rmap_insert(cur, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags);
- if (error)
- goto out_error;
- } else if (ltrec.rm_startblock + ltrec.rm_blockcount == bno + len) {
- /*
- * Overlap right hand side of extent: trim the length and
- * update the current record.
- *
- * ltbno ltlen
- * Orig: |oooooooooooooooooooo|
- * Freeing: |fffffffff|
- * Result: |rrrrrrrrrr|
- * bno len
- */
- error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- ltrec.rm_blockcount -= len;
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- } else {
- /*
- * Overlap middle of extent: trim the length of the existing
- * record to the length of the new left-extent size, increment
- * the insertion position so we can insert a new record
- * containing the remaining right-extent space.
- *
- * ltbno ltlen
- * Orig: |oooooooooooooooooooo|
- * Freeing: |fffffffff|
- * Result: |rrrrr| |rrrr|
- * bno len
- */
- xfs_extlen_t orig_len = ltrec.rm_blockcount;
- /* Shrink the left side of the rmap */
- error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- ltrec.rm_blockcount = bno - ltrec.rm_startblock;
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- /* Add an rmap at the new offset */
- error = xfs_rmap_insert(cur, bno + len,
- orig_len - len - ltrec.rm_blockcount,
- ltrec.rm_owner, offset + len,
- ltrec.rm_flags);
- if (error)
- goto out_error;
- }
- trace_xfs_rmap_unmap_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- out_error:
- if (error)
- trace_xfs_rmap_unmap_error(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- /*
- * Find an extent in the rmap btree and map it. For rmap extent types that
- * can overlap (data fork rmaps on reflink filesystems) we must be careful
- * that the prev/next records in the btree might belong to another owner.
- * Therefore we must use delete+insert to alter any of the key fields.
- *
- * For every other situation there can only be one owner for a given extent,
- * so we can call the regular _alloc function.
- */
- STATIC int
- xfs_rmap_map_shared(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool unwritten,
- const struct xfs_owner_info *oinfo)
- {
- struct xfs_mount *mp = cur->bc_mp;
- struct xfs_rmap_irec ltrec;
- struct xfs_rmap_irec gtrec;
- int have_gt;
- int have_lt;
- int error = 0;
- int i;
- uint64_t owner;
- uint64_t offset;
- unsigned int flags = 0;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- if (unwritten)
- flags |= XFS_RMAP_UNWRITTEN;
- trace_xfs_rmap_map(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- /* Is there a left record that abuts our range? */
- error = xfs_rmap_find_left_neighbor(cur, bno, owner, offset, flags,
- <rec, &have_lt);
- if (error)
- goto out_error;
- if (have_lt &&
- !xfs_rmap_is_mergeable(<rec, owner, flags))
- have_lt = 0;
- /* Is there a right record that abuts our range? */
- error = xfs_rmap_lookup_eq(cur, bno + len, len, owner, offset + len,
- flags, &have_gt);
- if (error)
- goto out_error;
- if (have_gt) {
- error = xfs_rmap_get_rec(cur, >rec, &have_gt);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, have_gt != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, gtrec.rm_startblock,
- gtrec.rm_blockcount, gtrec.rm_owner,
- gtrec.rm_offset, gtrec.rm_flags);
- if (!xfs_rmap_is_mergeable(>rec, owner, flags))
- have_gt = 0;
- }
- if (have_lt &&
- ltrec.rm_startblock + ltrec.rm_blockcount == bno &&
- ltrec.rm_offset + ltrec.rm_blockcount == offset) {
- /*
- * Left edge contiguous, merge into left record.
- *
- * ltbno ltlen
- * orig: |ooooooooo|
- * adding: |aaaaaaaaa|
- * result: |rrrrrrrrrrrrrrrrrrr|
- * bno len
- */
- ltrec.rm_blockcount += len;
- if (have_gt &&
- bno + len == gtrec.rm_startblock &&
- offset + len == gtrec.rm_offset) {
- /*
- * Right edge also contiguous, delete right record
- * and merge into left record.
- *
- * ltbno ltlen gtbno gtlen
- * orig: |ooooooooo| |ooooooooo|
- * adding: |aaaaaaaaa|
- * result: |rrrrrrrrrrrrrrrrrrrrrrrrrrrrr|
- */
- ltrec.rm_blockcount += gtrec.rm_blockcount;
- error = xfs_rmap_delete(cur, gtrec.rm_startblock,
- gtrec.rm_blockcount, gtrec.rm_owner,
- gtrec.rm_offset, gtrec.rm_flags);
- if (error)
- goto out_error;
- }
- /* Point the cursor back to the left record and update. */
- error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
- ltrec.rm_blockcount, ltrec.rm_owner,
- ltrec.rm_offset, ltrec.rm_flags, &i);
- if (error)
- goto out_error;
- if (XFS_IS_CORRUPT(mp, i != 1)) {
- error = -EFSCORRUPTED;
- goto out_error;
- }
- error = xfs_rmap_update(cur, <rec);
- if (error)
- goto out_error;
- } else if (have_gt &&
- bno + len == gtrec.rm_startblock &&
- offset + len == gtrec.rm_offset) {
- /*
- * Right edge contiguous, merge into right record.
- *
- * gtbno gtlen
- * Orig: |ooooooooo|
- * adding: |aaaaaaaaa|
- * Result: |rrrrrrrrrrrrrrrrrrr|
- * bno len
- */
- /* Delete the old record. */
- error = xfs_rmap_delete(cur, gtrec.rm_startblock,
- gtrec.rm_blockcount, gtrec.rm_owner,
- gtrec.rm_offset, gtrec.rm_flags);
- if (error)
- goto out_error;
- /* Move the start and re-add it. */
- gtrec.rm_startblock = bno;
- gtrec.rm_blockcount += len;
- gtrec.rm_offset = offset;
- error = xfs_rmap_insert(cur, gtrec.rm_startblock,
- gtrec.rm_blockcount, gtrec.rm_owner,
- gtrec.rm_offset, gtrec.rm_flags);
- if (error)
- goto out_error;
- } else {
- /*
- * No contiguous edge with identical owner, insert
- * new record at current cursor position.
- */
- error = xfs_rmap_insert(cur, bno, len, owner, offset, flags);
- if (error)
- goto out_error;
- }
- trace_xfs_rmap_map_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
- unwritten, oinfo);
- out_error:
- if (error)
- trace_xfs_rmap_map_error(cur->bc_mp,
- cur->bc_ag.pag->pag_agno, error, _RET_IP_);
- return error;
- }
- /* Insert a raw rmap into the rmapbt. */
- int
- xfs_rmap_map_raw(
- struct xfs_btree_cur *cur,
- struct xfs_rmap_irec *rmap)
- {
- struct xfs_owner_info oinfo;
- oinfo.oi_owner = rmap->rm_owner;
- oinfo.oi_offset = rmap->rm_offset;
- oinfo.oi_flags = 0;
- if (rmap->rm_flags & XFS_RMAP_ATTR_FORK)
- oinfo.oi_flags |= XFS_OWNER_INFO_ATTR_FORK;
- if (rmap->rm_flags & XFS_RMAP_BMBT_BLOCK)
- oinfo.oi_flags |= XFS_OWNER_INFO_BMBT_BLOCK;
- if (rmap->rm_flags || XFS_RMAP_NON_INODE_OWNER(rmap->rm_owner))
- return xfs_rmap_map(cur, rmap->rm_startblock,
- rmap->rm_blockcount,
- rmap->rm_flags & XFS_RMAP_UNWRITTEN,
- &oinfo);
- return xfs_rmap_map_shared(cur, rmap->rm_startblock,
- rmap->rm_blockcount,
- rmap->rm_flags & XFS_RMAP_UNWRITTEN,
- &oinfo);
- }
- struct xfs_rmap_query_range_info {
- xfs_rmap_query_range_fn fn;
- void *priv;
- };
- /* Format btree record and pass to our callback. */
- STATIC int
- xfs_rmap_query_range_helper(
- struct xfs_btree_cur *cur,
- const union xfs_btree_rec *rec,
- void *priv)
- {
- struct xfs_rmap_query_range_info *query = priv;
- struct xfs_rmap_irec irec;
- int error;
- error = xfs_rmap_btrec_to_irec(rec, &irec);
- if (error)
- return error;
- return query->fn(cur, &irec, query->priv);
- }
- /* Find all rmaps between two keys. */
- int
- xfs_rmap_query_range(
- struct xfs_btree_cur *cur,
- const struct xfs_rmap_irec *low_rec,
- const struct xfs_rmap_irec *high_rec,
- xfs_rmap_query_range_fn fn,
- void *priv)
- {
- union xfs_btree_irec low_brec;
- union xfs_btree_irec high_brec;
- struct xfs_rmap_query_range_info query;
- low_brec.r = *low_rec;
- high_brec.r = *high_rec;
- query.priv = priv;
- query.fn = fn;
- return xfs_btree_query_range(cur, &low_brec, &high_brec,
- xfs_rmap_query_range_helper, &query);
- }
- /* Find all rmaps. */
- int
- xfs_rmap_query_all(
- struct xfs_btree_cur *cur,
- xfs_rmap_query_range_fn fn,
- void *priv)
- {
- struct xfs_rmap_query_range_info query;
- query.priv = priv;
- query.fn = fn;
- return xfs_btree_query_all(cur, xfs_rmap_query_range_helper, &query);
- }
- /* Clean up after calling xfs_rmap_finish_one. */
- void
- xfs_rmap_finish_one_cleanup(
- struct xfs_trans *tp,
- struct xfs_btree_cur *rcur,
- int error)
- {
- struct xfs_buf *agbp;
- if (rcur == NULL)
- return;
- agbp = rcur->bc_ag.agbp;
- xfs_btree_del_cursor(rcur, error);
- if (error)
- xfs_trans_brelse(tp, agbp);
- }
- /*
- * Process one of the deferred rmap operations. We pass back the
- * btree cursor to maintain our lock on the rmapbt between calls.
- * This saves time and eliminates a buffer deadlock between the
- * superblock and the AGF because we'll always grab them in the same
- * order.
- */
- int
- xfs_rmap_finish_one(
- struct xfs_trans *tp,
- enum xfs_rmap_intent_type type,
- uint64_t owner,
- int whichfork,
- xfs_fileoff_t startoff,
- xfs_fsblock_t startblock,
- xfs_filblks_t blockcount,
- xfs_exntst_t state,
- struct xfs_btree_cur **pcur)
- {
- struct xfs_mount *mp = tp->t_mountp;
- struct xfs_perag *pag;
- struct xfs_btree_cur *rcur;
- struct xfs_buf *agbp = NULL;
- int error = 0;
- struct xfs_owner_info oinfo;
- xfs_agblock_t bno;
- bool unwritten;
- pag = xfs_perag_get(mp, XFS_FSB_TO_AGNO(mp, startblock));
- bno = XFS_FSB_TO_AGBNO(mp, startblock);
- trace_xfs_rmap_deferred(mp, pag->pag_agno, type, bno, owner, whichfork,
- startoff, blockcount, state);
- if (XFS_TEST_ERROR(false, mp, XFS_ERRTAG_RMAP_FINISH_ONE)) {
- error = -EIO;
- goto out_drop;
- }
- /*
- * If we haven't gotten a cursor or the cursor AG doesn't match
- * the startblock, get one now.
- */
- rcur = *pcur;
- if (rcur != NULL && rcur->bc_ag.pag != pag) {
- xfs_rmap_finish_one_cleanup(tp, rcur, 0);
- rcur = NULL;
- *pcur = NULL;
- }
- if (rcur == NULL) {
- /*
- * Refresh the freelist before we start changing the
- * rmapbt, because a shape change could cause us to
- * allocate blocks.
- */
- error = xfs_free_extent_fix_freelist(tp, pag, &agbp);
- if (error)
- goto out_drop;
- if (XFS_IS_CORRUPT(tp->t_mountp, !agbp)) {
- error = -EFSCORRUPTED;
- goto out_drop;
- }
- rcur = xfs_rmapbt_init_cursor(mp, tp, agbp, pag);
- }
- *pcur = rcur;
- xfs_rmap_ino_owner(&oinfo, owner, whichfork, startoff);
- unwritten = state == XFS_EXT_UNWRITTEN;
- bno = XFS_FSB_TO_AGBNO(rcur->bc_mp, startblock);
- switch (type) {
- case XFS_RMAP_ALLOC:
- case XFS_RMAP_MAP:
- error = xfs_rmap_map(rcur, bno, blockcount, unwritten, &oinfo);
- break;
- case XFS_RMAP_MAP_SHARED:
- error = xfs_rmap_map_shared(rcur, bno, blockcount, unwritten,
- &oinfo);
- break;
- case XFS_RMAP_FREE:
- case XFS_RMAP_UNMAP:
- error = xfs_rmap_unmap(rcur, bno, blockcount, unwritten,
- &oinfo);
- break;
- case XFS_RMAP_UNMAP_SHARED:
- error = xfs_rmap_unmap_shared(rcur, bno, blockcount, unwritten,
- &oinfo);
- break;
- case XFS_RMAP_CONVERT:
- error = xfs_rmap_convert(rcur, bno, blockcount, !unwritten,
- &oinfo);
- break;
- case XFS_RMAP_CONVERT_SHARED:
- error = xfs_rmap_convert_shared(rcur, bno, blockcount,
- !unwritten, &oinfo);
- break;
- default:
- ASSERT(0);
- error = -EFSCORRUPTED;
- }
- out_drop:
- xfs_perag_put(pag);
- return error;
- }
- /*
- * Don't defer an rmap if we aren't an rmap filesystem.
- */
- static bool
- xfs_rmap_update_is_needed(
- struct xfs_mount *mp,
- int whichfork)
- {
- return xfs_has_rmapbt(mp) && whichfork != XFS_COW_FORK;
- }
- /*
- * Record a rmap intent; the list is kept sorted first by AG and then by
- * increasing age.
- */
- static void
- __xfs_rmap_add(
- struct xfs_trans *tp,
- enum xfs_rmap_intent_type type,
- uint64_t owner,
- int whichfork,
- struct xfs_bmbt_irec *bmap)
- {
- struct xfs_rmap_intent *ri;
- trace_xfs_rmap_defer(tp->t_mountp,
- XFS_FSB_TO_AGNO(tp->t_mountp, bmap->br_startblock),
- type,
- XFS_FSB_TO_AGBNO(tp->t_mountp, bmap->br_startblock),
- owner, whichfork,
- bmap->br_startoff,
- bmap->br_blockcount,
- bmap->br_state);
- ri = kmem_cache_alloc(xfs_rmap_intent_cache, GFP_NOFS | __GFP_NOFAIL);
- INIT_LIST_HEAD(&ri->ri_list);
- ri->ri_type = type;
- ri->ri_owner = owner;
- ri->ri_whichfork = whichfork;
- ri->ri_bmap = *bmap;
- xfs_defer_add(tp, XFS_DEFER_OPS_TYPE_RMAP, &ri->ri_list);
- }
- /* Map an extent into a file. */
- void
- xfs_rmap_map_extent(
- struct xfs_trans *tp,
- struct xfs_inode *ip,
- int whichfork,
- struct xfs_bmbt_irec *PREV)
- {
- enum xfs_rmap_intent_type type = XFS_RMAP_MAP;
- if (!xfs_rmap_update_is_needed(tp->t_mountp, whichfork))
- return;
- if (whichfork != XFS_ATTR_FORK && xfs_is_reflink_inode(ip))
- type = XFS_RMAP_MAP_SHARED;
- __xfs_rmap_add(tp, type, ip->i_ino, whichfork, PREV);
- }
- /* Unmap an extent out of a file. */
- void
- xfs_rmap_unmap_extent(
- struct xfs_trans *tp,
- struct xfs_inode *ip,
- int whichfork,
- struct xfs_bmbt_irec *PREV)
- {
- enum xfs_rmap_intent_type type = XFS_RMAP_UNMAP;
- if (!xfs_rmap_update_is_needed(tp->t_mountp, whichfork))
- return;
- if (whichfork != XFS_ATTR_FORK && xfs_is_reflink_inode(ip))
- type = XFS_RMAP_UNMAP_SHARED;
- __xfs_rmap_add(tp, type, ip->i_ino, whichfork, PREV);
- }
- /*
- * Convert a data fork extent from unwritten to real or vice versa.
- *
- * Note that tp can be NULL here as no transaction is used for COW fork
- * unwritten conversion.
- */
- void
- xfs_rmap_convert_extent(
- struct xfs_mount *mp,
- struct xfs_trans *tp,
- struct xfs_inode *ip,
- int whichfork,
- struct xfs_bmbt_irec *PREV)
- {
- enum xfs_rmap_intent_type type = XFS_RMAP_CONVERT;
- if (!xfs_rmap_update_is_needed(mp, whichfork))
- return;
- if (whichfork != XFS_ATTR_FORK && xfs_is_reflink_inode(ip))
- type = XFS_RMAP_CONVERT_SHARED;
- __xfs_rmap_add(tp, type, ip->i_ino, whichfork, PREV);
- }
- /* Schedule the creation of an rmap for non-file data. */
- void
- xfs_rmap_alloc_extent(
- struct xfs_trans *tp,
- xfs_agnumber_t agno,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- uint64_t owner)
- {
- struct xfs_bmbt_irec bmap;
- if (!xfs_rmap_update_is_needed(tp->t_mountp, XFS_DATA_FORK))
- return;
- bmap.br_startblock = XFS_AGB_TO_FSB(tp->t_mountp, agno, bno);
- bmap.br_blockcount = len;
- bmap.br_startoff = 0;
- bmap.br_state = XFS_EXT_NORM;
- __xfs_rmap_add(tp, XFS_RMAP_ALLOC, owner, XFS_DATA_FORK, &bmap);
- }
- /* Schedule the deletion of an rmap for non-file data. */
- void
- xfs_rmap_free_extent(
- struct xfs_trans *tp,
- xfs_agnumber_t agno,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- uint64_t owner)
- {
- struct xfs_bmbt_irec bmap;
- if (!xfs_rmap_update_is_needed(tp->t_mountp, XFS_DATA_FORK))
- return;
- bmap.br_startblock = XFS_AGB_TO_FSB(tp->t_mountp, agno, bno);
- bmap.br_blockcount = len;
- bmap.br_startoff = 0;
- bmap.br_state = XFS_EXT_NORM;
- __xfs_rmap_add(tp, XFS_RMAP_FREE, owner, XFS_DATA_FORK, &bmap);
- }
- /* Compare rmap records. Returns -1 if a < b, 1 if a > b, and 0 if equal. */
- int
- xfs_rmap_compare(
- const struct xfs_rmap_irec *a,
- const struct xfs_rmap_irec *b)
- {
- __u64 oa;
- __u64 ob;
- oa = xfs_rmap_irec_offset_pack(a);
- ob = xfs_rmap_irec_offset_pack(b);
- if (a->rm_startblock < b->rm_startblock)
- return -1;
- else if (a->rm_startblock > b->rm_startblock)
- return 1;
- else if (a->rm_owner < b->rm_owner)
- return -1;
- else if (a->rm_owner > b->rm_owner)
- return 1;
- else if (oa < ob)
- return -1;
- else if (oa > ob)
- return 1;
- else
- return 0;
- }
- /* Is there a record covering a given extent? */
- int
- xfs_rmap_has_record(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- bool *exists)
- {
- union xfs_btree_irec low;
- union xfs_btree_irec high;
- memset(&low, 0, sizeof(low));
- low.r.rm_startblock = bno;
- memset(&high, 0xFF, sizeof(high));
- high.r.rm_startblock = bno + len - 1;
- return xfs_btree_has_record(cur, &low, &high, exists);
- }
- /*
- * Is there a record for this owner completely covering a given physical
- * extent? If so, *has_rmap will be set to true. If there is no record
- * or the record only covers part of the range, we set *has_rmap to false.
- * This function doesn't perform range lookups or offset checks, so it is
- * not suitable for checking data fork blocks.
- */
- int
- xfs_rmap_record_exists(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- const struct xfs_owner_info *oinfo,
- bool *has_rmap)
- {
- uint64_t owner;
- uint64_t offset;
- unsigned int flags;
- int has_record;
- struct xfs_rmap_irec irec;
- int error;
- xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
- ASSERT(XFS_RMAP_NON_INODE_OWNER(owner) ||
- (flags & XFS_RMAP_BMBT_BLOCK));
- error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, &irec,
- &has_record);
- if (error)
- return error;
- if (!has_record) {
- *has_rmap = false;
- return 0;
- }
- *has_rmap = (irec.rm_owner == owner && irec.rm_startblock <= bno &&
- irec.rm_startblock + irec.rm_blockcount >= bno + len);
- return 0;
- }
- struct xfs_rmap_key_state {
- uint64_t owner;
- uint64_t offset;
- unsigned int flags;
- };
- /* For each rmap given, figure out if it doesn't match the key we want. */
- STATIC int
- xfs_rmap_has_other_keys_helper(
- struct xfs_btree_cur *cur,
- const struct xfs_rmap_irec *rec,
- void *priv)
- {
- struct xfs_rmap_key_state *rks = priv;
- if (rks->owner == rec->rm_owner && rks->offset == rec->rm_offset &&
- ((rks->flags & rec->rm_flags) & XFS_RMAP_KEY_FLAGS) == rks->flags)
- return 0;
- return -ECANCELED;
- }
- /*
- * Given an extent and some owner info, can we find records overlapping
- * the extent whose owner info does not match the given owner?
- */
- int
- xfs_rmap_has_other_keys(
- struct xfs_btree_cur *cur,
- xfs_agblock_t bno,
- xfs_extlen_t len,
- const struct xfs_owner_info *oinfo,
- bool *has_rmap)
- {
- struct xfs_rmap_irec low = {0};
- struct xfs_rmap_irec high;
- struct xfs_rmap_key_state rks;
- int error;
- xfs_owner_info_unpack(oinfo, &rks.owner, &rks.offset, &rks.flags);
- *has_rmap = false;
- low.rm_startblock = bno;
- memset(&high, 0xFF, sizeof(high));
- high.rm_startblock = bno + len - 1;
- error = xfs_rmap_query_range(cur, &low, &high,
- xfs_rmap_has_other_keys_helper, &rks);
- if (error == -ECANCELED) {
- *has_rmap = true;
- return 0;
- }
- return error;
- }
- const struct xfs_owner_info XFS_RMAP_OINFO_SKIP_UPDATE = {
- .oi_owner = XFS_RMAP_OWN_NULL,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_ANY_OWNER = {
- .oi_owner = XFS_RMAP_OWN_UNKNOWN,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_FS = {
- .oi_owner = XFS_RMAP_OWN_FS,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_LOG = {
- .oi_owner = XFS_RMAP_OWN_LOG,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_AG = {
- .oi_owner = XFS_RMAP_OWN_AG,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_INOBT = {
- .oi_owner = XFS_RMAP_OWN_INOBT,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_INODES = {
- .oi_owner = XFS_RMAP_OWN_INODES,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_REFC = {
- .oi_owner = XFS_RMAP_OWN_REFC,
- };
- const struct xfs_owner_info XFS_RMAP_OINFO_COW = {
- .oi_owner = XFS_RMAP_OWN_COW,
- };
- int __init
- xfs_rmap_intent_init_cache(void)
- {
- xfs_rmap_intent_cache = kmem_cache_create("xfs_rmap_intent",
- sizeof(struct xfs_rmap_intent),
- 0, 0, NULL);
- return xfs_rmap_intent_cache != NULL ? 0 : -ENOMEM;
- }
- void
- xfs_rmap_intent_destroy_cache(void)
- {
- kmem_cache_destroy(xfs_rmap_intent_cache);
- xfs_rmap_intent_cache = NULL;
- }
|