LCOV - code coverage report
Current view: top level - src/backend/access/index - genam.c (source / functions) Hit Total Coverage
Test: PostgreSQL 15devel Lines: 160 192 83.3 %
Date: 2021-12-03 04:09:03 Functions: 11 12 91.7 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : /*-------------------------------------------------------------------------
       2             :  *
       3             :  * genam.c
       4             :  *    general index access method routines
       5             :  *
       6             :  * Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
       7             :  * Portions Copyright (c) 1994, Regents of the University of California
       8             :  *
       9             :  *
      10             :  * IDENTIFICATION
      11             :  *    src/backend/access/index/genam.c
      12             :  *
      13             :  * NOTES
      14             :  *    many of the old access method routines have been turned into
      15             :  *    macros and moved to genam.h -cim 4/30/91
      16             :  *
      17             :  *-------------------------------------------------------------------------
      18             :  */
      19             : 
      20             : #include "postgres.h"
      21             : 
      22             : #include "access/genam.h"
      23             : #include "access/heapam.h"
      24             : #include "access/relscan.h"
      25             : #include "access/tableam.h"
      26             : #include "access/transam.h"
      27             : #include "catalog/index.h"
      28             : #include "lib/stringinfo.h"
      29             : #include "miscadmin.h"
      30             : #include "storage/bufmgr.h"
      31             : #include "storage/procarray.h"
      32             : #include "utils/acl.h"
      33             : #include "utils/builtins.h"
      34             : #include "utils/lsyscache.h"
      35             : #include "utils/rel.h"
      36             : #include "utils/rls.h"
      37             : #include "utils/ruleutils.h"
      38             : #include "utils/snapmgr.h"
      39             : #include "utils/syscache.h"
      40             : 
      41             : 
      42             : /* ----------------------------------------------------------------
      43             :  *      general access method routines
      44             :  *
      45             :  *      All indexed access methods use an identical scan structure.
      46             :  *      We don't know how the various AMs do locking, however, so we don't
      47             :  *      do anything about that here.
      48             :  *
      49             :  *      The intent is that an AM implementor will define a beginscan routine
      50             :  *      that calls RelationGetIndexScan, to fill in the scan, and then does
      51             :  *      whatever kind of locking he wants.
      52             :  *
      53             :  *      At the end of a scan, the AM's endscan routine undoes the locking,
      54             :  *      but does *not* call IndexScanEnd --- the higher-level index_endscan
      55             :  *      routine does that.  (We can't do it in the AM because index_endscan
      56             :  *      still needs to touch the IndexScanDesc after calling the AM.)
      57             :  *
      58             :  *      Because of this, the AM does not have a choice whether to call
      59             :  *      RelationGetIndexScan or not; its beginscan routine must return an
      60             :  *      object made by RelationGetIndexScan.  This is kinda ugly but not
      61             :  *      worth cleaning up now.
      62             :  * ----------------------------------------------------------------
      63             :  */
      64             : 
      65             : /* ----------------
      66             :  *  RelationGetIndexScan -- Create and fill an IndexScanDesc.
      67             :  *
      68             :  *      This routine creates an index scan structure and sets up initial
      69             :  *      contents for it.
      70             :  *
      71             :  *      Parameters:
      72             :  *              indexRelation -- index relation for scan.
      73             :  *              nkeys -- count of scan keys (index qual conditions).
      74             :  *              norderbys -- count of index order-by operators.
      75             :  *
      76             :  *      Returns:
      77             :  *              An initialized IndexScanDesc.
      78             :  * ----------------
      79             :  */
      80             : IndexScanDesc
      81    11069948 : RelationGetIndexScan(Relation indexRelation, int nkeys, int norderbys)
      82             : {
      83             :     IndexScanDesc scan;
      84             : 
      85    11069948 :     scan = (IndexScanDesc) palloc(sizeof(IndexScanDescData));
      86             : 
      87    11069948 :     scan->heapRelation = NULL;   /* may be set later */
      88    11069948 :     scan->xs_heapfetch = NULL;
      89    11069948 :     scan->indexRelation = indexRelation;
      90    11069948 :     scan->xs_snapshot = InvalidSnapshot; /* caller must initialize this */
      91    11069948 :     scan->numberOfKeys = nkeys;
      92    11069948 :     scan->numberOfOrderBys = norderbys;
      93             : 
      94             :     /*
      95             :      * We allocate key workspace here, but it won't get filled until amrescan.
      96             :      */
      97    11069948 :     if (nkeys > 0)
      98    11063506 :         scan->keyData = (ScanKey) palloc(sizeof(ScanKeyData) * nkeys);
      99             :     else
     100        6442 :         scan->keyData = NULL;
     101    11069948 :     if (norderbys > 0)
     102         138 :         scan->orderByData = (ScanKey) palloc(sizeof(ScanKeyData) * norderbys);
     103             :     else
     104    11069810 :         scan->orderByData = NULL;
     105             : 
     106    11069948 :     scan->xs_want_itup = false; /* may be set later */
     107             : 
     108             :     /*
     109             :      * During recovery we ignore killed tuples and don't bother to kill them
     110             :      * either. We do this because the xmin on the primary node could easily be
     111             :      * later than the xmin on the standby node, so that what the primary
     112             :      * thinks is killed is supposed to be visible on standby. So for correct
     113             :      * MVCC for queries during recovery we must ignore these hints and check
     114             :      * all tuples. Do *not* set ignore_killed_tuples to true when running in a
     115             :      * transaction that was started during recovery. xactStartedInRecovery
     116             :      * should not be altered by index AMs.
     117             :      */
     118    11069948 :     scan->kill_prior_tuple = false;
     119    11069948 :     scan->xactStartedInRecovery = TransactionStartedDuringRecovery();
     120    11069948 :     scan->ignore_killed_tuples = !scan->xactStartedInRecovery;
     121             : 
     122    11069948 :     scan->opaque = NULL;
     123             : 
     124    11069948 :     scan->xs_itup = NULL;
     125    11069948 :     scan->xs_itupdesc = NULL;
     126    11069948 :     scan->xs_hitup = NULL;
     127    11069948 :     scan->xs_hitupdesc = NULL;
     128             : 
     129    11069948 :     return scan;
     130             : }
     131             : 
     132             : /* ----------------
     133             :  *  IndexScanEnd -- End an index scan.
     134             :  *
     135             :  *      This routine just releases the storage acquired by
     136             :  *      RelationGetIndexScan().  Any AM-level resources are
     137             :  *      assumed to already have been released by the AM's
     138             :  *      endscan routine.
     139             :  *
     140             :  *  Returns:
     141             :  *      None.
     142             :  * ----------------
     143             :  */
     144             : void
     145    11068986 : IndexScanEnd(IndexScanDesc scan)
     146             : {
     147    11068986 :     if (scan->keyData != NULL)
     148    11062612 :         pfree(scan->keyData);
     149    11068986 :     if (scan->orderByData != NULL)
     150         138 :         pfree(scan->orderByData);
     151             : 
     152    11068986 :     pfree(scan);
     153    11068986 : }
     154             : 
     155             : /*
     156             :  * BuildIndexValueDescription
     157             :  *
     158             :  * Construct a string describing the contents of an index entry, in the
     159             :  * form "(key_name, ...)=(key_value, ...)".  This is currently used
     160             :  * for building unique-constraint and exclusion-constraint error messages,
     161             :  * so only key columns of the index are checked and printed.
     162             :  *
     163             :  * Note that if the user does not have permissions to view all of the
     164             :  * columns involved then a NULL is returned.  Returning a partial key seems
     165             :  * unlikely to be useful and we have no way to know which of the columns the
     166             :  * user provided (unlike in ExecBuildSlotValueDescription).
     167             :  *
     168             :  * The passed-in values/nulls arrays are the "raw" input to the index AM,
     169             :  * e.g. results of FormIndexDatum --- this is not necessarily what is stored
     170             :  * in the index, but it's what the user perceives to be stored.
     171             :  *
     172             :  * Note: if you change anything here, check whether
     173             :  * ExecBuildSlotPartitionKeyDescription() in execMain.c needs a similar
     174             :  * change.
     175             :  */
     176             : char *
     177         840 : BuildIndexValueDescription(Relation indexRelation,
     178             :                            Datum *values, bool *isnull)
     179             : {
     180             :     StringInfoData buf;
     181             :     Form_pg_index idxrec;
     182             :     int         indnkeyatts;
     183             :     int         i;
     184             :     int         keyno;
     185         840 :     Oid         indexrelid = RelationGetRelid(indexRelation);
     186             :     Oid         indrelid;
     187             :     AclResult   aclresult;
     188             : 
     189         840 :     indnkeyatts = IndexRelationGetNumberOfKeyAttributes(indexRelation);
     190             : 
     191             :     /*
     192             :      * Check permissions- if the user does not have access to view all of the
     193             :      * key columns then return NULL to avoid leaking data.
     194             :      *
     195             :      * First check if RLS is enabled for the relation.  If so, return NULL to
     196             :      * avoid leaking data.
     197             :      *
     198             :      * Next we need to check table-level SELECT access and then, if there is
     199             :      * no access there, check column-level permissions.
     200             :      */
     201         840 :     idxrec = indexRelation->rd_index;
     202         840 :     indrelid = idxrec->indrelid;
     203             :     Assert(indexrelid == idxrec->indexrelid);
     204             : 
     205             :     /* RLS check- if RLS is enabled then we don't return anything. */
     206         840 :     if (check_enable_rls(indrelid, InvalidOid, true) == RLS_ENABLED)
     207           4 :         return NULL;
     208             : 
     209             :     /* Table-level SELECT is enough, if the user has it */
     210         836 :     aclresult = pg_class_aclcheck(indrelid, GetUserId(), ACL_SELECT);
     211         836 :     if (aclresult != ACLCHECK_OK)
     212             :     {
     213             :         /*
     214             :          * No table-level access, so step through the columns in the index and
     215             :          * make sure the user has SELECT rights on all of them.
     216             :          */
     217          16 :         for (keyno = 0; keyno < indnkeyatts; keyno++)
     218             :         {
     219          16 :             AttrNumber  attnum = idxrec->indkey.values[keyno];
     220             : 
     221             :             /*
     222             :              * Note that if attnum == InvalidAttrNumber, then this is an index
     223             :              * based on an expression and we return no detail rather than try
     224             :              * to figure out what column(s) the expression includes and if the
     225             :              * user has SELECT rights on them.
     226             :              */
     227          32 :             if (attnum == InvalidAttrNumber ||
     228          16 :                 pg_attribute_aclcheck(indrelid, attnum, GetUserId(),
     229             :                                       ACL_SELECT) != ACLCHECK_OK)
     230             :             {
     231             :                 /* No access, so clean up and return */
     232           8 :                 return NULL;
     233             :             }
     234             :         }
     235             :     }
     236             : 
     237         828 :     initStringInfo(&buf);
     238         828 :     appendStringInfo(&buf, "(%s)=(",
     239             :                      pg_get_indexdef_columns(indexrelid, true));
     240             : 
     241        1748 :     for (i = 0; i < indnkeyatts; i++)
     242             :     {
     243             :         char       *val;
     244             : 
     245         920 :         if (isnull[i])
     246           0 :             val = "null";
     247             :         else
     248             :         {
     249             :             Oid         foutoid;
     250             :             bool        typisvarlena;
     251             : 
     252             :             /*
     253             :              * The provided data is not necessarily of the type stored in the
     254             :              * index; rather it is of the index opclass's input type. So look
     255             :              * at rd_opcintype not the index tupdesc.
     256             :              *
     257             :              * Note: this is a bit shaky for opclasses that have pseudotype
     258             :              * input types such as ANYARRAY or RECORD.  Currently, the
     259             :              * typoutput functions associated with the pseudotypes will work
     260             :              * okay, but we might have to try harder in future.
     261             :              */
     262         920 :             getTypeOutputInfo(indexRelation->rd_opcintype[i],
     263             :                               &foutoid, &typisvarlena);
     264         920 :             val = OidOutputFunctionCall(foutoid, values[i]);
     265             :         }
     266             : 
     267         920 :         if (i > 0)
     268          92 :             appendStringInfoString(&buf, ", ");
     269         920 :         appendStringInfoString(&buf, val);
     270             :     }
     271             : 
     272         828 :     appendStringInfoChar(&buf, ')');
     273             : 
     274         828 :     return buf.data;
     275             : }
     276             : 
     277             : /*
     278             :  * Get the latestRemovedXid from the table entries pointed at by the index
     279             :  * tuples being deleted using an AM-generic approach.
     280             :  *
     281             :  * This is a table_index_delete_tuples() shim used by index AMs that have
     282             :  * simple requirements.  These callers only need to consult the tableam to get
     283             :  * a latestRemovedXid value, and only expect to delete tuples that are already
     284             :  * known deletable.  When a latestRemovedXid value isn't needed in index AM's
     285             :  * deletion WAL record, it is safe for it to skip calling here entirely.
     286             :  *
     287             :  * We assume that caller index AM uses the standard IndexTuple representation,
     288             :  * with table TIDs stored in the t_tid field.  We also expect (and assert)
     289             :  * that the line pointers on page for 'itemnos' offsets are already marked
     290             :  * LP_DEAD.
     291             :  */
     292             : TransactionId
     293           0 : index_compute_xid_horizon_for_tuples(Relation irel,
     294             :                                      Relation hrel,
     295             :                                      Buffer ibuf,
     296             :                                      OffsetNumber *itemnos,
     297             :                                      int nitems)
     298             : {
     299             :     TM_IndexDeleteOp delstate;
     300           0 :     TransactionId latestRemovedXid = InvalidTransactionId;
     301           0 :     Page        ipage = BufferGetPage(ibuf);
     302             :     IndexTuple  itup;
     303             : 
     304             :     Assert(nitems > 0);
     305             : 
     306           0 :     delstate.irel = irel;
     307           0 :     delstate.iblknum = BufferGetBlockNumber(ibuf);
     308           0 :     delstate.bottomup = false;
     309           0 :     delstate.bottomupfreespace = 0;
     310           0 :     delstate.ndeltids = 0;
     311           0 :     delstate.deltids = palloc(nitems * sizeof(TM_IndexDelete));
     312           0 :     delstate.status = palloc(nitems * sizeof(TM_IndexStatus));
     313             : 
     314             :     /* identify what the index tuples about to be deleted point to */
     315           0 :     for (int i = 0; i < nitems; i++)
     316             :     {
     317           0 :         OffsetNumber offnum = itemnos[i];
     318             :         ItemId      iitemid;
     319             : 
     320           0 :         iitemid = PageGetItemId(ipage, offnum);
     321           0 :         itup = (IndexTuple) PageGetItem(ipage, iitemid);
     322             : 
     323             :         Assert(ItemIdIsDead(iitemid));
     324             : 
     325           0 :         ItemPointerCopy(&itup->t_tid, &delstate.deltids[i].tid);
     326           0 :         delstate.deltids[i].id = delstate.ndeltids;
     327           0 :         delstate.status[i].idxoffnum = offnum;
     328           0 :         delstate.status[i].knowndeletable = true;   /* LP_DEAD-marked */
     329           0 :         delstate.status[i].promising = false;   /* unused */
     330           0 :         delstate.status[i].freespace = 0;   /* unused */
     331             : 
     332           0 :         delstate.ndeltids++;
     333             :     }
     334             : 
     335             :     /* determine the actual xid horizon */
     336           0 :     latestRemovedXid = table_index_delete_tuples(hrel, &delstate);
     337             : 
     338             :     /* assert tableam agrees that all items are deletable */
     339             :     Assert(delstate.ndeltids == nitems);
     340             : 
     341           0 :     pfree(delstate.deltids);
     342           0 :     pfree(delstate.status);
     343             : 
     344           0 :     return latestRemovedXid;
     345             : }
     346             : 
     347             : 
     348             : /* ----------------------------------------------------------------
     349             :  *      heap-or-index-scan access to system catalogs
     350             :  *
     351             :  *      These functions support system catalog accesses that normally use
     352             :  *      an index but need to be capable of being switched to heap scans
     353             :  *      if the system indexes are unavailable.
     354             :  *
     355             :  *      The specified scan keys must be compatible with the named index.
     356             :  *      Generally this means that they must constrain either all columns
     357             :  *      of the index, or the first K columns of an N-column index.
     358             :  *
     359             :  *      These routines could work with non-system tables, actually,
     360             :  *      but they're only useful when there is a known index to use with
     361             :  *      the given scan keys; so in practice they're only good for
     362             :  *      predetermined types of scans of system catalogs.
     363             :  * ----------------------------------------------------------------
     364             :  */
     365             : 
     366             : /*
     367             :  * systable_beginscan --- set up for heap-or-index scan
     368             :  *
     369             :  *  rel: catalog to scan, already opened and suitably locked
     370             :  *  indexId: OID of index to conditionally use
     371             :  *  indexOK: if false, forces a heap scan (see notes below)
     372             :  *  snapshot: time qual to use (NULL for a recent catalog snapshot)
     373             :  *  nkeys, key: scan keys
     374             :  *
     375             :  * The attribute numbers in the scan key should be set for the heap case.
     376             :  * If we choose to index, we reset them to 1..n to reference the index
     377             :  * columns.  Note this means there must be one scankey qualification per
     378             :  * index column!  This is checked by the Asserts in the normal, index-using
     379             :  * case, but won't be checked if the heapscan path is taken.
     380             :  *
     381             :  * The routine checks the normal cases for whether an indexscan is safe,
     382             :  * but caller can make additional checks and pass indexOK=false if needed.
     383             :  * In standard case indexOK can simply be constant TRUE.
     384             :  */
     385             : SysScanDesc
     386    11307728 : systable_beginscan(Relation heapRelation,
     387             :                    Oid indexId,
     388             :                    bool indexOK,
     389             :                    Snapshot snapshot,
     390             :                    int nkeys, ScanKey key)
     391             : {
     392             :     SysScanDesc sysscan;
     393             :     Relation    irel;
     394             : 
     395    11307728 :     if (indexOK &&
     396    10943916 :         !IgnoreSystemIndexes &&
     397    10514454 :         !ReindexIsProcessingIndex(indexId))
     398    10508428 :         irel = index_open(indexId, AccessShareLock);
     399             :     else
     400      799300 :         irel = NULL;
     401             : 
     402    11307722 :     sysscan = (SysScanDesc) palloc(sizeof(SysScanDescData));
     403             : 
     404    11307722 :     sysscan->heap_rel = heapRelation;
     405    11307722 :     sysscan->irel = irel;
     406    11307722 :     sysscan->slot = table_slot_create(heapRelation, NULL);
     407             : 
     408    11307722 :     if (snapshot == NULL)
     409             :     {
     410    10160670 :         Oid         relid = RelationGetRelid(heapRelation);
     411             : 
     412    10160670 :         snapshot = RegisterSnapshot(GetCatalogSnapshot(relid));
     413    10160670 :         sysscan->snapshot = snapshot;
     414             :     }
     415             :     else
     416             :     {
     417             :         /* Caller is responsible for any snapshot. */
     418     1147052 :         sysscan->snapshot = NULL;
     419             :     }
     420             : 
     421    11307722 :     if (irel)
     422             :     {
     423             :         int         i;
     424             : 
     425             :         /* Change attribute numbers to be index column numbers. */
     426    27661902 :         for (i = 0; i < nkeys; i++)
     427             :         {
     428             :             int         j;
     429             : 
     430    25092802 :             for (j = 0; j < IndexRelationGetNumberOfAttributes(irel); j++)
     431             :             {
     432    25092802 :                 if (key[i].sk_attno == irel->rd_index->indkey.values[j])
     433             :                 {
     434    17153480 :                     key[i].sk_attno = j + 1;
     435    17153480 :                     break;
     436             :                 }
     437             :             }
     438    17153480 :             if (j == IndexRelationGetNumberOfAttributes(irel))
     439           0 :                 elog(ERROR, "column is not in index");
     440             :         }
     441             : 
     442    10508422 :         sysscan->iscan = index_beginscan(heapRelation, irel,
     443             :                                          snapshot, nkeys, 0);
     444    10508422 :         index_rescan(sysscan->iscan, key, nkeys, NULL, 0);
     445    10508422 :         sysscan->scan = NULL;
     446             :     }
     447             :     else
     448             :     {
     449             :         /*
     450             :          * We disallow synchronized scans when forced to use a heapscan on a
     451             :          * catalog.  In most cases the desired rows are near the front, so
     452             :          * that the unpredictable start point of a syncscan is a serious
     453             :          * disadvantage; and there are no compensating advantages, because
     454             :          * it's unlikely that such scans will occur in parallel.
     455             :          */
     456      799300 :         sysscan->scan = table_beginscan_strat(heapRelation, snapshot,
     457             :                                               nkeys, key,
     458             :                                               true, false);
     459      799300 :         sysscan->iscan = NULL;
     460             :     }
     461             : 
     462             :     /*
     463             :      * If CheckXidAlive is set then set a flag to indicate that system table
     464             :      * scan is in-progress.  See detailed comments in xact.c where these
     465             :      * variables are declared.
     466             :      */
     467    11307722 :     if (TransactionIdIsValid(CheckXidAlive))
     468        1154 :         bsysscan = true;
     469             : 
     470    11307722 :     return sysscan;
     471             : }
     472             : 
     473             : /*
     474             :  * HandleConcurrentAbort - Handle concurrent abort of the CheckXidAlive.
     475             :  *
     476             :  * Error out, if CheckXidAlive is aborted. We can't directly use
     477             :  * TransactionIdDidAbort as after crash such transaction might not have been
     478             :  * marked as aborted.  See detailed comments in xact.c where the variable
     479             :  * is declared.
     480             :  */
     481             : static inline void
     482    28864758 : HandleConcurrentAbort()
     483             : {
     484    28864758 :     if (TransactionIdIsValid(CheckXidAlive) &&
     485        1692 :         !TransactionIdIsInProgress(CheckXidAlive) &&
     486          12 :         !TransactionIdDidCommit(CheckXidAlive))
     487          12 :         ereport(ERROR,
     488             :                 (errcode(ERRCODE_TRANSACTION_ROLLBACK),
     489             :                  errmsg("transaction aborted during system catalog scan")));
     490    28864746 : }
     491             : 
     492             : /*
     493             :  * systable_getnext --- get next tuple in a heap-or-index scan
     494             :  *
     495             :  * Returns NULL if no more tuples available.
     496             :  *
     497             :  * Note that returned tuple is a reference to data in a disk buffer;
     498             :  * it must not be modified, and should be presumed inaccessible after
     499             :  * next getnext() or endscan() call.
     500             :  *
     501             :  * XXX: It'd probably make sense to offer a slot based interface, at least
     502             :  * optionally.
     503             :  */
     504             : HeapTuple
     505    28361362 : systable_getnext(SysScanDesc sysscan)
     506             : {
     507    28361362 :     HeapTuple   htup = NULL;
     508             : 
     509    28361362 :     if (sysscan->irel)
     510             :     {
     511    24943596 :         if (index_getnext_slot(sysscan->iscan, ForwardScanDirection, sysscan->slot))
     512             :         {
     513             :             bool        shouldFree;
     514             : 
     515    19855160 :             htup = ExecFetchSlotHeapTuple(sysscan->slot, false, &shouldFree);
     516             :             Assert(!shouldFree);
     517             : 
     518             :             /*
     519             :              * We currently don't need to support lossy index operators for
     520             :              * any system catalog scan.  It could be done here, using the scan
     521             :              * keys to drive the operator calls, if we arranged to save the
     522             :              * heap attnums during systable_beginscan(); this is practical
     523             :              * because we still wouldn't need to support indexes on
     524             :              * expressions.
     525             :              */
     526    19855160 :             if (sysscan->iscan->xs_recheck)
     527           0 :                 elog(ERROR, "system catalog scans with lossy index conditions are not implemented");
     528             :         }
     529             :     }
     530             :     else
     531             :     {
     532     3417766 :         if (table_scan_getnextslot(sysscan->scan, ForwardScanDirection, sysscan->slot))
     533             :         {
     534             :             bool        shouldFree;
     535             : 
     536     3142644 :             htup = ExecFetchSlotHeapTuple(sysscan->slot, false, &shouldFree);
     537             :             Assert(!shouldFree);
     538             :         }
     539             :     }
     540             : 
     541             :     /*
     542             :      * Handle the concurrent abort while fetching the catalog tuple during
     543             :      * logical streaming of a transaction.
     544             :      */
     545    28361360 :     HandleConcurrentAbort();
     546             : 
     547    28361348 :     return htup;
     548             : }
     549             : 
     550             : /*
     551             :  * systable_recheck_tuple --- recheck visibility of most-recently-fetched tuple
     552             :  *
     553             :  * In particular, determine if this tuple would be visible to a catalog scan
     554             :  * that started now.  We don't handle the case of a non-MVCC scan snapshot,
     555             :  * because no caller needs that yet.
     556             :  *
     557             :  * This is useful to test whether an object was deleted while we waited to
     558             :  * acquire lock on it.
     559             :  *
     560             :  * Note: we don't actually *need* the tuple to be passed in, but it's a
     561             :  * good crosscheck that the caller is interested in the right tuple.
     562             :  */
     563             : bool
     564      114580 : systable_recheck_tuple(SysScanDesc sysscan, HeapTuple tup)
     565             : {
     566             :     Snapshot    freshsnap;
     567             :     bool        result;
     568             : 
     569             :     Assert(tup == ExecFetchSlotHeapTuple(sysscan->slot, false, NULL));
     570             : 
     571             :     /*
     572             :      * Trust that table_tuple_satisfies_snapshot() and its subsidiaries
     573             :      * (commonly LockBuffer() and HeapTupleSatisfiesMVCC()) do not themselves
     574             :      * acquire snapshots, so we need not register the snapshot.  Those
     575             :      * facilities are too low-level to have any business scanning tables.
     576             :      */
     577      114580 :     freshsnap = GetCatalogSnapshot(RelationGetRelid(sysscan->heap_rel));
     578             : 
     579      114580 :     result = table_tuple_satisfies_snapshot(sysscan->heap_rel,
     580      114580 :                                             sysscan->slot,
     581             :                                             freshsnap);
     582             : 
     583             :     /*
     584             :      * Handle the concurrent abort while fetching the catalog tuple during
     585             :      * logical streaming of a transaction.
     586             :      */
     587      114580 :     HandleConcurrentAbort();
     588             : 
     589      114580 :     return result;
     590             : }
     591             : 
     592             : /*
     593             :  * systable_endscan --- close scan, release resources
     594             :  *
     595             :  * Note that it's still up to the caller to close the heap relation.
     596             :  */
     597             : void
     598    11307396 : systable_endscan(SysScanDesc sysscan)
     599             : {
     600    11307396 :     if (sysscan->slot)
     601             :     {
     602    11307396 :         ExecDropSingleTupleTableSlot(sysscan->slot);
     603    11307396 :         sysscan->slot = NULL;
     604             :     }
     605             : 
     606    11307396 :     if (sysscan->irel)
     607             :     {
     608    10508108 :         index_endscan(sysscan->iscan);
     609    10508108 :         index_close(sysscan->irel, AccessShareLock);
     610             :     }
     611             :     else
     612      799288 :         table_endscan(sysscan->scan);
     613             : 
     614    11307396 :     if (sysscan->snapshot)
     615    10160344 :         UnregisterSnapshot(sysscan->snapshot);
     616             : 
     617             :     /*
     618             :      * Reset the bsysscan flag at the end of the systable scan.  See detailed
     619             :      * comments in xact.c where these variables are declared.
     620             :      */
     621    11307396 :     if (TransactionIdIsValid(CheckXidAlive))
     622        1142 :         bsysscan = false;
     623             : 
     624    11307396 :     pfree(sysscan);
     625    11307396 : }
     626             : 
     627             : 
     628             : /*
     629             :  * systable_beginscan_ordered --- set up for ordered catalog scan
     630             :  *
     631             :  * These routines have essentially the same API as systable_beginscan etc,
     632             :  * except that they guarantee to return multiple matching tuples in
     633             :  * index order.  Also, for largely historical reasons, the index to use
     634             :  * is opened and locked by the caller, not here.
     635             :  *
     636             :  * Currently we do not support non-index-based scans here.  (In principle
     637             :  * we could do a heapscan and sort, but the uses are in places that
     638             :  * probably don't need to still work with corrupted catalog indexes.)
     639             :  * For the moment, therefore, these functions are merely the thinest of
     640             :  * wrappers around index_beginscan/index_getnext_slot.  The main reason for
     641             :  * their existence is to centralize possible future support of lossy operators
     642             :  * in catalog scans.
     643             :  */
     644             : SysScanDesc
     645       91680 : systable_beginscan_ordered(Relation heapRelation,
     646             :                            Relation indexRelation,
     647             :                            Snapshot snapshot,
     648             :                            int nkeys, ScanKey key)
     649             : {
     650             :     SysScanDesc sysscan;
     651             :     int         i;
     652             : 
     653             :     /* REINDEX can probably be a hard error here ... */
     654       91680 :     if (ReindexIsProcessingIndex(RelationGetRelid(indexRelation)))
     655           0 :         elog(ERROR, "cannot do ordered scan on index \"%s\", because it is being reindexed",
     656             :              RelationGetRelationName(indexRelation));
     657             :     /* ... but we only throw a warning about violating IgnoreSystemIndexes */
     658       91680 :     if (IgnoreSystemIndexes)
     659           0 :         elog(WARNING, "using index \"%s\" despite IgnoreSystemIndexes",
     660             :              RelationGetRelationName(indexRelation));
     661             : 
     662       91680 :     sysscan = (SysScanDesc) palloc(sizeof(SysScanDescData));
     663             : 
     664       91680 :     sysscan->heap_rel = heapRelation;
     665       91680 :     sysscan->irel = indexRelation;
     666       91680 :     sysscan->slot = table_slot_create(heapRelation, NULL);
     667             : 
     668       91680 :     if (snapshot == NULL)
     669             :     {
     670        5292 :         Oid         relid = RelationGetRelid(heapRelation);
     671             : 
     672        5292 :         snapshot = RegisterSnapshot(GetCatalogSnapshot(relid));
     673        5292 :         sysscan->snapshot = snapshot;
     674             :     }
     675             :     else
     676             :     {
     677             :         /* Caller is responsible for any snapshot. */
     678       86388 :         sysscan->snapshot = NULL;
     679             :     }
     680             : 
     681             :     /* Change attribute numbers to be index column numbers. */
     682      181286 :     for (i = 0; i < nkeys; i++)
     683             :     {
     684             :         int         j;
     685             : 
     686       91586 :         for (j = 0; j < IndexRelationGetNumberOfAttributes(indexRelation); j++)
     687             :         {
     688       91586 :             if (key[i].sk_attno == indexRelation->rd_index->indkey.values[j])
     689             :             {
     690       89606 :                 key[i].sk_attno = j + 1;
     691       89606 :                 break;
     692             :             }
     693             :         }
     694       89606 :         if (j == IndexRelationGetNumberOfAttributes(indexRelation))
     695           0 :             elog(ERROR, "column is not in index");
     696             :     }
     697             : 
     698       91680 :     sysscan->iscan = index_beginscan(heapRelation, indexRelation,
     699             :                                      snapshot, nkeys, 0);
     700       91680 :     index_rescan(sysscan->iscan, key, nkeys, NULL, 0);
     701       91680 :     sysscan->scan = NULL;
     702             : 
     703       91680 :     return sysscan;
     704             : }
     705             : 
     706             : /*
     707             :  * systable_getnext_ordered --- get next tuple in an ordered catalog scan
     708             :  */
     709             : HeapTuple
     710      388824 : systable_getnext_ordered(SysScanDesc sysscan, ScanDirection direction)
     711             : {
     712      388824 :     HeapTuple   htup = NULL;
     713             : 
     714             :     Assert(sysscan->irel);
     715      388824 :     if (index_getnext_slot(sysscan->iscan, direction, sysscan->slot))
     716      297968 :         htup = ExecFetchSlotHeapTuple(sysscan->slot, false, NULL);
     717             : 
     718             :     /* See notes in systable_getnext */
     719      388818 :     if (htup && sysscan->iscan->xs_recheck)
     720           0 :         elog(ERROR, "system catalog scans with lossy index conditions are not implemented");
     721             : 
     722             :     /*
     723             :      * Handle the concurrent abort while fetching the catalog tuple during
     724             :      * logical streaming of a transaction.
     725             :      */
     726      388818 :     HandleConcurrentAbort();
     727             : 
     728      388818 :     return htup;
     729             : }
     730             : 
     731             : /*
     732             :  * systable_endscan_ordered --- close scan, release resources
     733             :  */
     734             : void
     735       91662 : systable_endscan_ordered(SysScanDesc sysscan)
     736             : {
     737       91662 :     if (sysscan->slot)
     738             :     {
     739       91662 :         ExecDropSingleTupleTableSlot(sysscan->slot);
     740       91662 :         sysscan->slot = NULL;
     741             :     }
     742             : 
     743             :     Assert(sysscan->irel);
     744       91662 :     index_endscan(sysscan->iscan);
     745       91662 :     if (sysscan->snapshot)
     746        5280 :         UnregisterSnapshot(sysscan->snapshot);
     747       91662 :     pfree(sysscan);
     748       91662 : }

Generated by: LCOV version 1.14