PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
heapam.h File Reference
#include "access/sdir.h"
#include "access/skey.h"
#include "nodes/lockoptions.h"
#include "nodes/primnodes.h"
#include "storage/bufpage.h"
#include "storage/lockdefs.h"
#include "utils/relcache.h"
#include "utils/snapshot.h"
Include dependency graph for heapam.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  HeapUpdateFailureData
 

Macros

#define HEAP_INSERT_SKIP_WAL   0x0001
 
#define HEAP_INSERT_SKIP_FSM   0x0002
 
#define HEAP_INSERT_FROZEN   0x0004
 
#define HEAP_INSERT_SPECULATIVE   0x0008
 
#define MaxLockTupleMode   LockTupleExclusive
 
#define heap_close(r, l)   relation_close(r,l)
 
#define HeapScanIsValid(scan)   PointerIsValid(scan)
 

Typedefs

typedef struct
BulkInsertStateData
BulkInsertState
 
typedef enum LockTupleMode LockTupleMode
 
typedef struct
HeapUpdateFailureData 
HeapUpdateFailureData
 
typedef struct HeapScanDescDataHeapScanDesc
 
typedef struct
ParallelHeapScanDescData
ParallelHeapScanDesc
 

Enumerations

enum  LockTupleMode { LockTupleKeyShare, LockTupleShare, LockTupleNoKeyExclusive, LockTupleExclusive }
 

Functions

Relation relation_open (Oid relationId, LOCKMODE lockmode)
 
Relation try_relation_open (Oid relationId, LOCKMODE lockmode)
 
Relation relation_openrv (const RangeVar *relation, LOCKMODE lockmode)
 
Relation relation_openrv_extended (const RangeVar *relation, LOCKMODE lockmode, bool missing_ok)
 
void relation_close (Relation relation, LOCKMODE lockmode)
 
Relation heap_open (Oid relationId, LOCKMODE lockmode)
 
Relation heap_openrv (const RangeVar *relation, LOCKMODE lockmode)
 
Relation heap_openrv_extended (const RangeVar *relation, LOCKMODE lockmode, bool missing_ok)
 
HeapScanDesc heap_beginscan (Relation relation, Snapshot snapshot, int nkeys, ScanKey key)
 
HeapScanDesc heap_beginscan_catalog (Relation relation, int nkeys, ScanKey key)
 
HeapScanDesc heap_beginscan_strat (Relation relation, Snapshot snapshot, int nkeys, ScanKey key, bool allow_strat, bool allow_sync)
 
HeapScanDesc heap_beginscan_bm (Relation relation, Snapshot snapshot, int nkeys, ScanKey key)
 
HeapScanDesc heap_beginscan_sampling (Relation relation, Snapshot snapshot, int nkeys, ScanKey key, bool allow_strat, bool allow_sync, bool allow_pagemode)
 
void heap_setscanlimits (HeapScanDesc scan, BlockNumber startBlk, BlockNumber endBlk)
 
void heapgetpage (HeapScanDesc scan, BlockNumber page)
 
void heap_rescan (HeapScanDesc scan, ScanKey key)
 
void heap_rescan_set_params (HeapScanDesc scan, ScanKey key, bool allow_strat, bool allow_sync, bool allow_pagemode)
 
void heap_endscan (HeapScanDesc scan)
 
HeapTuple heap_getnext (HeapScanDesc scan, ScanDirection direction)
 
Size heap_parallelscan_estimate (Snapshot snapshot)
 
void heap_parallelscan_initialize (ParallelHeapScanDesc target, Relation relation, Snapshot snapshot)
 
HeapScanDesc heap_beginscan_parallel (Relation, ParallelHeapScanDesc)
 
bool heap_fetch (Relation relation, Snapshot snapshot, HeapTuple tuple, Buffer *userbuf, bool keep_buf, Relation stats_relation)
 
bool heap_hot_search_buffer (ItemPointer tid, Relation relation, Buffer buffer, Snapshot snapshot, HeapTuple heapTuple, bool *all_dead, bool first_call)
 
bool heap_hot_search (ItemPointer tid, Relation relation, Snapshot snapshot, bool *all_dead)
 
void heap_get_latest_tid (Relation relation, Snapshot snapshot, ItemPointer tid)
 
void setLastTid (const ItemPointer tid)
 
BulkInsertState GetBulkInsertState (void)
 
void FreeBulkInsertState (BulkInsertState)
 
void ReleaseBulkInsertStatePin (BulkInsertState bistate)
 
Oid heap_insert (Relation relation, HeapTuple tup, CommandId cid, int options, BulkInsertState bistate)
 
void heap_multi_insert (Relation relation, HeapTuple *tuples, int ntuples, CommandId cid, int options, BulkInsertState bistate)
 
HTSU_Result heap_delete (Relation relation, ItemPointer tid, CommandId cid, Snapshot crosscheck, bool wait, HeapUpdateFailureData *hufd)
 
void heap_finish_speculative (Relation relation, HeapTuple tuple)
 
void heap_abort_speculative (Relation relation, HeapTuple tuple)
 
HTSU_Result heap_update (Relation relation, ItemPointer otid, HeapTuple newtup, CommandId cid, Snapshot crosscheck, bool wait, HeapUpdateFailureData *hufd, LockTupleMode *lockmode)
 
HTSU_Result heap_lock_tuple (Relation relation, HeapTuple tuple, CommandId cid, LockTupleMode mode, LockWaitPolicy wait_policy, bool follow_update, Buffer *buffer, HeapUpdateFailureData *hufd)
 
void heap_inplace_update (Relation relation, HeapTuple tuple)
 
bool heap_freeze_tuple (HeapTupleHeader tuple, TransactionId cutoff_xid, TransactionId cutoff_multi)
 
bool heap_tuple_needs_freeze (HeapTupleHeader tuple, TransactionId cutoff_xid, MultiXactId cutoff_multi, Buffer buf)
 
bool heap_tuple_needs_eventual_freeze (HeapTupleHeader tuple)
 
Oid simple_heap_insert (Relation relation, HeapTuple tup)
 
void simple_heap_delete (Relation relation, ItemPointer tid)
 
void simple_heap_update (Relation relation, ItemPointer otid, HeapTuple tup)
 
void heap_sync (Relation relation)
 
void heap_page_prune_opt (Relation relation, Buffer buffer)
 
int heap_page_prune (Relation relation, Buffer buffer, TransactionId OldestXmin, bool report_stats, TransactionId *latestRemovedXid)
 
void heap_page_prune_execute (Buffer buffer, OffsetNumber *redirected, int nredirected, OffsetNumber *nowdead, int ndead, OffsetNumber *nowunused, int nunused)
 
void heap_get_root_tuples (Page page, OffsetNumber *root_offsets)
 
void ss_report_location (Relation rel, BlockNumber location)
 
BlockNumber ss_get_location (Relation rel, BlockNumber relnblocks)
 
void SyncScanShmemInit (void)
 
Size SyncScanShmemSize (void)
 

Macro Definition Documentation

#define heap_close (   r,
 
)    relation_close(r,l)

Definition at line 97 of file heapam.h.

Referenced by acquire_inherited_sample_rows(), AcquireRewriteLocks(), AddEnumLabel(), AddNewAttributeTuples(), addRangeTableEntry(), AddRoleMems(), afterTriggerInvokeEvents(), AfterTriggerSetState(), AggregateCreate(), AlterConstraintNamespaces(), AlterDatabase(), AlterDatabaseOwner(), AlterDomainAddConstraint(), AlterDomainDefault(), AlterDomainDropConstraint(), AlterDomainNotNull(), AlterDomainValidateConstraint(), AlterEventTrigger(), AlterEventTriggerOwner(), AlterEventTriggerOwner_oid(), AlterExtensionNamespace(), AlterForeignDataWrapper(), AlterForeignDataWrapperOwner(), AlterForeignDataWrapperOwner_oid(), AlterForeignServer(), AlterForeignServerOwner(), AlterForeignServerOwner_oid(), AlterFunction(), AlterObjectNamespace_oid(), AlterOperator(), AlterPolicy(), AlterPublication(), AlterPublicationOwner(), AlterPublicationOwner_oid(), AlterRole(), AlterSchemaOwner(), AlterSchemaOwner_oid(), AlterSequence(), AlterSetting(), AlterSubscription(), AlterSubscriptionOwner(), AlterSubscriptionOwner_oid(), AlterTableMoveAll(), AlterTableNamespaceInternal(), AlterTableSpaceOptions(), AlterTSConfiguration(), AlterTSDictionary(), AlterTypeNamespaceInternal(), AlterTypeOwner(), AlterTypeOwner_oid(), AlterTypeOwnerInternal(), AlterUserMapping(), AppendAttributeTuples(), ApplyExtensionUpdates(), AssignTypeArrayOid(), ATAddCheckConstraint(), ATAddForeignKeyConstraint(), ATExecAddColumn(), ATExecAddInherit(), ATExecAddOf(), ATExecAlterColumnGenericOptions(), ATExecAlterColumnType(), ATExecAlterConstraint(), ATExecAttachPartition(), ATExecChangeOwner(), ATExecDetachPartition(), ATExecDisableRowSecurity(), ATExecDropColumn(), ATExecDropConstraint(), ATExecDropInherit(), ATExecDropNotNull(), ATExecDropOf(), ATExecEnableRowSecurity(), ATExecForceNoForceRowSecurity(), ATExecGenericOptions(), ATExecSetNotNull(), ATExecSetOptions(), ATExecSetRelOptions(), ATExecSetStatistics(), ATExecSetStorage(), ATExecSetTableSpace(), ATExecValidateConstraint(), ATPrepChangePersistence(), ATRewriteTable(), ATRewriteTables(), AttrDefaultFetch(), boot_openrel(), BootstrapToastTable(), bringetbitmap(), brinvacuumcleanup(), build_indices(), build_physical_tlist(), CatalogCacheInitializeCache(), change_owner_fix_column_acls(), changeDependencyFor(), changeDependencyOnOwner(), check_db_file_conflict(), check_selective_binary_conversion(), CheckAndCreateToastTable(), CheckConstraintFetch(), checkSharedDependencies(), ChooseConstraintName(), close_lo_relation(), closerel(), CloseTableList(), cluster(), CollationCreate(), ConstraintNameIsUsed(), ConversionCreate(), copy_heap_data(), CopyFrom(), copyTemplateDependencies(), CountDBSubscriptions(), create_proc_lang(), create_toast_table(), CreateAccessMethod(), CreateCast(), CreateComments(), CreateConstraintEntry(), createdb(), CreateForeignDataWrapper(), CreateForeignServer(), CreateForeignTable(), CreateInheritance(), CreateOpFamily(), CreatePolicy(), CreatePublication(), CreateRole(), CreateSharedComments(), CreateSubscription(), CreateTableSpace(), CreateTransform(), CreateTrigger(), CreateUserMapping(), currtid_byrelname(), currtid_byreloid(), currtid_for_view(), database_to_xmlschema_internal(), DefineIndex(), DefineOpClass(), DefineQueryRewrite(), DefineRelation(), DefineSequence(), DefineTSConfiguration(), DefineTSDictionary(), DefineTSParser(), DefineTSTemplate(), DeleteAttributeTuples(), DeleteComments(), deleteDependencyRecordsFor(), deleteDependencyRecordsForClass(), DeleteInitPrivs(), deleteOneObject(), DeleteRelationTuple(), DeleteSecurityLabel(), DeleteSequenceTuple(), DeleteSharedComments(), deleteSharedDependencyRecordsFor(), DeleteSharedSecurityLabel(), DeleteSystemAttributeTuples(), DelRoleMems(), deparseColumnRef(), deparseFromExprForRel(), deparseSelectSql(), do_autovacuum(), DoCopy(), drop_parent_dependency(), DropCastById(), dropDatabaseDependencies(), dropdb(), DropProceduralLanguageById(), DropRole(), DropSetting(), DropSubscription(), DropTableSpace(), DropTransformById(), EnableDisableRule(), EnableDisableTrigger(), enum_endpoint(), enum_range_internal(), EnumValuesCreate(), EnumValuesDelete(), EvalPlanQualEnd(), EventTriggerSQLDropAddObject(), exec_object_restorecon(), ExecAlterExtensionStmt(), ExecAlterObjectDependsStmt(), ExecAlterObjectSchemaStmt(), ExecAlterOwnerStmt(), ExecCloseScanRelation(), ExecEndModifyTable(), ExecEndPlan(), ExecGrant_Database(), ExecGrant_Fdw(), ExecGrant_ForeignServer(), ExecGrant_Function(), ExecGrant_Language(), ExecGrant_Largeobject(), ExecGrant_Namespace(), ExecGrant_Relation(), ExecGrant_Tablespace(), ExecGrant_Type(), ExecRefreshMatView(), ExecRenameStmt(), ExecuteTruncate(), expand_inherited_rtentry(), expand_targetlist(), extension_config_remove(), find_inheritance_children(), find_language_template(), find_typed_table_dependencies(), finish_heap_swap(), fireRIRrules(), free_parsestate(), generate_partition_qual(), get_actual_variable_range(), get_constraint_index(), get_database_list(), get_database_oid(), get_db_info(), get_domain_constraint_oid(), get_extension_name(), get_extension_oid(), get_extension_schema(), get_file_fdw_attribute_options(), get_index_constraint(), get_object_address_relobject(), get_partition_parent(), get_pkey_attnames(), get_primary_key_attnos(), get_rel_oids(), get_relation_constraint_oid(), get_relation_constraints(), get_relation_data_width(), get_relation_info(), get_relation_policy_oid(), get_rewrite_oid_without_relid(), get_row_security_policies(), get_subscription_list(), get_tablespace_name(), get_tablespace_oid(), get_trigger_oid(), GetAllTablesPublicationRelations(), GetAllTablesPublications(), GetComment(), getConstraintTypeDescription(), GetDatabaseTuple(), GetDatabaseTupleByOid(), GetDefaultOpClass(), getExtensionOfObject(), getObjectDescription(), getObjectIdentityParts(), getOwnedSequences(), GetPublicationRelations(), getRelationsInNamespace(), GetSecurityLabel(), GetSharedSecurityLabel(), gettype(), GrantRole(), has_row_triggers(), heap_create_with_catalog(), heap_drop_with_catalog(), heap_sync(), heap_truncate(), heap_truncate_find_FKs(), heap_truncate_one_rel(), index_build(), index_constraint_create(), index_create(), index_drop(), index_set_state_flags(), index_update_stats(), infer_arbiter_indexes(), insert_event_trigger_tuple(), InsertExtensionTuple(), InsertRule(), intorel_shutdown(), isQueryUsingTempRelation_walker(), LargeObjectCreate(), LargeObjectDrop(), LargeObjectExists(), load_domaintype_info(), load_enum_cache_data(), logicalrep_rel_close(), lookup_ts_config_cache(), LookupOpclassInfo(), make_new_heap(), make_viewdef(), makeArrayTypeName(), mark_index_clustered(), MergeAttributes(), MergeAttributesIntoExisting(), MergeConstraintsIntoExisting(), MergeWithExistingConstraint(), movedb(), myLargeObjectExists(), NamespaceCreate(), objectsInSchemaToOids(), OpenTableList(), OperatorCreate(), OperatorShellMake(), OperatorUpd(), performDeletion(), performMultipleDeletions(), pg_event_trigger_ddl_commands(), pg_extension_config_dump(), pg_extension_ownercheck(), pg_get_constraintdef_worker(), pg_get_serial_sequence(), pg_get_triggerdef_worker(), pg_identify_object(), pg_largeobject_aclmask_snapshot(), pg_largeobject_ownercheck(), pgrowlocks(), pgstat_collect_oids(), postgresPlanDirectModify(), postgresPlanForeignModify(), ProcedureCreate(), process_settings(), publication_add_relation(), RangeCreate(), RangeDelete(), rebuild_relation(), recordExtensionInitPrivWorker(), recordMultipleDependencies(), recordSharedDependencyOn(), refresh_by_match_merge(), regclassin(), regoperin(), regprocin(), regtypein(), reindex_index(), reindex_relation(), ReindexMultipleTables(), relation_has_policies(), relation_mark_replica_identity(), RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationBuildTriggers(), RelationBuildTupleDesc(), RelationGetExclusionInfo(), RelationGetFKeyList(), RelationGetIndexList(), RelationGetPartitionDispatchInfo(), RelationRemoveInheritance(), RelationSetNewRelfilenode(), RelidByRelfilenode(), remove_dbtablespaces(), RemoveAccessMethodById(), RemoveAmOpEntryById(), RemoveAmProcEntryById(), RemoveAttrDefault(), RemoveAttrDefaultById(), RemoveAttributeById(), RemoveCollationById(), RemoveConstraintById(), RemoveConversionById(), RemoveDefaultACLById(), RemoveEventTriggerById(), RemoveExtensionById(), RemoveForeignDataWrapperById(), RemoveForeignServerById(), RemoveFunctionById(), RemoveInheritance(), RemoveObjects(), RemoveOpClassById(), RemoveOperatorById(), RemoveOpFamilyById(), RemovePartitionKeyByRelId(), RemovePolicyById(), RemovePublicationById(), RemovePublicationRelById(), RemoveRewriteRuleById(), RemoveRoleFromObjectACL(), RemoveRoleFromObjectPolicy(), RemoveSchemaById(), RemoveStatistics(), RemoveTriggerById(), RemoveTSConfigurationById(), RemoveTSDictionaryById(), RemoveTSParserById(), RemoveTSTemplateById(), RemoveTypeById(), RemoveUserMappingById(), rename_policy(), renameatt_internal(), RenameConstraint(), RenameConstraintById(), RenameDatabase(), RenameEnumLabel(), RenameRelationInternal(), RenameRewriteRule(), RenameRole(), RenameSchema(), RenameTableSpace(), renametrig(), RenameType(), RenameTypeInternal(), replorigin_create(), replorigin_drop(), RewriteQuery(), rewriteTargetView(), RI_FKey_cascade_del(), RI_FKey_cascade_upd(), RI_FKey_check(), RI_FKey_setdefault_del(), RI_FKey_setdefault_upd(), RI_FKey_setnull_del(), RI_FKey_setnull_upd(), ri_restrict_del(), ri_restrict_upd(), ScanPgRelation(), schema_to_xmlschema_internal(), SearchCatCache(), SearchCatCacheList(), sepgsql_attribute_post_create(), sepgsql_database_post_create(), sepgsql_index_modify(), sepgsql_proc_post_create(), sepgsql_proc_setattr(), sepgsql_relation_post_create(), sepgsql_relation_setattr(), sepgsql_schema_post_create(), sequenceIsOwned(), SetDefaultACL(), SetFunctionArgType(), SetFunctionReturnType(), SetMatViewPopulatedState(), SetRelationHasSubclass(), SetRelationNumChecks(), SetRelationRuleStatus(), SetSecurityLabel(), SetSharedSecurityLabel(), setTargetTable(), shdepDropOwned(), shdepReassignOwned(), StoreAttrDefault(), StoreCatalogInheritance(), storeOperators(), StorePartitionBound(), StorePartitionKey(), storeProcedures(), swap_relation_files(), table_to_xml_and_xmlschema(), table_to_xmlschema(), ThereIsAtLeastOneRole(), toast_delete_datum(), toast_fetch_datum(), toast_fetch_datum_slice(), toast_get_valid_index(), toast_save_datum(), toastid_valueid_exists(), transformIndexConstraint(), transformIndexStmt(), transformRuleStmt(), transformTableLikeClause(), transientrel_shutdown(), TypeCreate(), typeInheritsFrom(), TypeShellMake(), update_attstats(), updateAclDependencies(), UpdateIndexRelation(), vac_truncate_clog(), vac_update_datfrozenxid(), vac_update_relstats(), validate_index(), and validateDomainConstraint().

#define HEAP_INSERT_FROZEN   0x0004

Definition at line 30 of file heapam.h.

Referenced by CopyFrom(), heap_prepare_insert(), and transientrel_startup().

#define HEAP_INSERT_SKIP_FSM   0x0002
#define HEAP_INSERT_SPECULATIVE   0x0008

Definition at line 31 of file heapam.h.

Referenced by ExecInsert(), heap_insert(), and toast_insert_or_update().

#define HeapScanIsValid (   scan)    PointerIsValid(scan)

Definition at line 107 of file heapam.h.

#define MaxLockTupleMode   LockTupleExclusive

Definition at line 50 of file heapam.h.

Typedef Documentation

Definition at line 33 of file heapam.h.

Definition at line 100 of file heapam.h.

Definition at line 101 of file heapam.h.

Enumeration Type Documentation

Enumerator
LockTupleKeyShare 
LockTupleShare 
LockTupleNoKeyExclusive 
LockTupleExclusive 

Definition at line 38 of file heapam.h.

39 {
40  /* SELECT FOR KEY SHARE */
42  /* SELECT FOR SHARE */
44  /* SELECT FOR NO KEY UPDATE, and UPDATEs that don't modify key columns */
46  /* SELECT FOR UPDATE, UPDATEs that modify key columns, and DELETE */
LockTupleMode
Definition: heapam.h:38

Function Documentation

void FreeBulkInsertState ( BulkInsertState  )

Definition at line 2320 of file heapam.c.

References BulkInsertStateData::current_buf, FreeAccessStrategy(), InvalidBuffer, pfree(), ReleaseBuffer(), and BulkInsertStateData::strategy.

Referenced by ATRewriteTable(), CopyFrom(), intorel_shutdown(), and transientrel_shutdown().

2321 {
2322  if (bistate->current_buf != InvalidBuffer)
2323  ReleaseBuffer(bistate->current_buf);
2324  FreeAccessStrategy(bistate->strategy);
2325  pfree(bistate);
2326 }
#define InvalidBuffer
Definition: buf.h:25
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
void pfree(void *pointer)
Definition: mcxt.c:992
void FreeAccessStrategy(BufferAccessStrategy strategy)
Definition: freelist.c:580
BulkInsertState GetBulkInsertState ( void  )

Definition at line 2306 of file heapam.c.

References BAS_BULKWRITE, BulkInsertStateData::current_buf, GetAccessStrategy(), InvalidBuffer, palloc(), and BulkInsertStateData::strategy.

Referenced by ATRewriteTable(), CopyFrom(), intorel_startup(), and transientrel_startup().

2307 {
2308  BulkInsertState bistate;
2309 
2310  bistate = (BulkInsertState) palloc(sizeof(BulkInsertStateData));
2312  bistate->current_buf = InvalidBuffer;
2313  return bistate;
2314 }
BufferAccessStrategy GetAccessStrategy(BufferAccessStrategyType btype)
Definition: freelist.c:525
#define InvalidBuffer
Definition: buf.h:25
struct BulkInsertStateData * BulkInsertState
Definition: heapam.h:33
BufferAccessStrategy strategy
Definition: hio.h:33
void * palloc(Size size)
Definition: mcxt.c:891
Buffer current_buf
Definition: hio.h:34
void heap_abort_speculative ( Relation  relation,
HeapTuple  tuple 
)

Definition at line 6092 of file heapam.c.

References Assert, BUFFER_LOCK_EXCLUSIVE, BUFFER_LOCK_UNLOCK, BufferGetPage, compute_infobits(), elog, END_CRIT_SECTION, ERROR, xl_heap_delete::flags, GetCurrentTransactionId(), HEAP_KEYS_UPDATED, HEAP_MOVED, HEAP_XMAX_BITS, HeapTupleHasExternal, HeapTupleHeaderIsHeapOnly, HeapTupleHeaderIsSpeculative, HeapTupleHeaderSetXmin, xl_heap_delete::infobits_set, InvalidTransactionId, IsToastRelation(), ItemIdGetLength, ItemIdIsNormal, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, ItemPointerIsValid, LockBuffer(), MarkBufferDirty(), xl_heap_delete::offnum, PageGetItem, PageGetItemId, PageIsAllVisible, PageSetLSN, PageSetPrunable, pgstat_count_heap_delete(), ReadBuffer(), RecentGlobalXmin, REGBUF_STANDARD, RelationGetRelid, RelationNeedsWAL, ReleaseBuffer(), SizeOfHeapDelete, START_CRIT_SECTION, HeapTupleHeaderData::t_choice, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleHeaderData::t_heap, HeapTupleHeaderData::t_infomask, HeapTupleHeaderData::t_infomask2, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, HeapTupleFields::t_xmin, toast_delete(), TransactionIdIsValid, XLH_DELETE_IS_SUPER, XLOG_HEAP_DELETE, XLogBeginInsert(), XLogInsert(), XLogRegisterBuffer(), XLogRegisterData(), and xl_heap_delete::xmax.

Referenced by ExecInsert(), and toast_delete_datum().

6093 {
6095  ItemPointer tid = &(tuple->t_self);
6096  ItemId lp;
6097  HeapTupleData tp;
6098  Page page;
6099  BlockNumber block;
6100  Buffer buffer;
6101 
6102  Assert(ItemPointerIsValid(tid));
6103 
6104  block = ItemPointerGetBlockNumber(tid);
6105  buffer = ReadBuffer(relation, block);
6106  page = BufferGetPage(buffer);
6107 
6109 
6110  /*
6111  * Page can't be all visible, we just inserted into it, and are still
6112  * running.
6113  */
6114  Assert(!PageIsAllVisible(page));
6115 
6116  lp = PageGetItemId(page, ItemPointerGetOffsetNumber(tid));
6117  Assert(ItemIdIsNormal(lp));
6118 
6119  tp.t_tableOid = RelationGetRelid(relation);
6120  tp.t_data = (HeapTupleHeader) PageGetItem(page, lp);
6121  tp.t_len = ItemIdGetLength(lp);
6122  tp.t_self = *tid;
6123 
6124  /*
6125  * Sanity check that the tuple really is a speculatively inserted tuple,
6126  * inserted by us.
6127  */
6128  if (tp.t_data->t_choice.t_heap.t_xmin != xid)
6129  elog(ERROR, "attempted to kill a tuple inserted by another transaction");
6130  if (!(IsToastRelation(relation) || HeapTupleHeaderIsSpeculative(tp.t_data)))
6131  elog(ERROR, "attempted to kill a non-speculative tuple");
6133 
6134  /*
6135  * No need to check for serializable conflicts here. There is never a
6136  * need for a combocid, either. No need to extract replica identity, or
6137  * do anything special with infomask bits.
6138  */
6139 
6141 
6142  /*
6143  * The tuple will become DEAD immediately. Flag that this page
6144  * immediately is a candidate for pruning by setting xmin to
6145  * RecentGlobalXmin. That's not pretty, but it doesn't seem worth
6146  * inventing a nicer API for this.
6147  */
6150 
6151  /* store transaction information of xact deleting the tuple */
6154 
6155  /*
6156  * Set the tuple header xmin to InvalidTransactionId. This makes the
6157  * tuple immediately invisible everyone. (In particular, to any
6158  * transactions waiting on the speculative token, woken up later.)
6159  */
6161 
6162  /* Clear the speculative insertion token too */
6163  tp.t_data->t_ctid = tp.t_self;
6164 
6165  MarkBufferDirty(buffer);
6166 
6167  /*
6168  * XLOG stuff
6169  *
6170  * The WAL records generated here match heap_delete(). The same recovery
6171  * routines are used.
6172  */
6173  if (RelationNeedsWAL(relation))
6174  {
6175  xl_heap_delete xlrec;
6176  XLogRecPtr recptr;
6177 
6178  xlrec.flags = XLH_DELETE_IS_SUPER;
6180  tp.t_data->t_infomask2);
6182  xlrec.xmax = xid;
6183 
6184  XLogBeginInsert();
6185  XLogRegisterData((char *) &xlrec, SizeOfHeapDelete);
6186  XLogRegisterBuffer(0, buffer, REGBUF_STANDARD);
6187 
6188  /* No replica identity & replication origin logged */
6189 
6190  recptr = XLogInsert(RM_HEAP_ID, XLOG_HEAP_DELETE);
6191 
6192  PageSetLSN(page, recptr);
6193  }
6194 
6195  END_CRIT_SECTION();
6196 
6197  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
6198 
6199  if (HeapTupleHasExternal(&tp))
6200  {
6201  Assert(!IsToastRelation(relation));
6202  toast_delete(relation, &tp, true);
6203  }
6204 
6205  /*
6206  * Never need to mark tuple for invalidation, since catalogs don't support
6207  * speculative insertion
6208  */
6209 
6210  /* Now we can release the buffer */
6211  ReleaseBuffer(buffer);
6212 
6213  /* count deletion, as we counted the insertion too */
6214  pgstat_count_heap_delete(relation);
6215 }
#define ItemPointerIsValid(pointer)
Definition: itemptr.h:59
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
bool IsToastRelation(Relation relation)
Definition: catalog.c:135
#define HEAP_XMAX_BITS
Definition: htup_details.h:256
#define XLH_DELETE_IS_SUPER
Definition: heapam_xlog.h:95
static uint8 compute_infobits(uint16 infomask, uint16 infomask2)
Definition: heapam.c:2939
HeapTupleFields t_heap
Definition: htup_details.h:146
#define PageIsAllVisible(page)
Definition: bufpage.h:382
uint32 TransactionId
Definition: c.h:393
union HeapTupleHeaderData::@38 t_choice
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
#define HeapTupleHeaderIsSpeculative(tup)
Definition: htup_details.h:423
#define PageSetPrunable(page, xid)
Definition: bufpage.h:395
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
OffsetNumber offnum
Definition: heapam_xlog.h:105
HeapTupleHeader t_data
Definition: htup.h:67
#define HeapTupleHeaderIsHeapOnly(tup)
Definition: htup_details.h:502
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
#define ERROR
Definition: elog.h:43
ItemPointerData t_ctid
Definition: htup_details.h:150
ItemPointerData t_self
Definition: htup.h:65
TransactionId xmax
Definition: heapam_xlog.h:104
TransactionId GetCurrentTransactionId(void)
Definition: xact.c:416
uint32 t_len
Definition: htup.h:64
#define SizeOfHeapDelete
Definition: heapam_xlog.h:110
TransactionId RecentGlobalXmin
Definition: snapmgr.c:166
#define REGBUF_STANDARD
Definition: xloginsert.h:35
#define InvalidTransactionId
Definition: transam.h:31
Oid t_tableOid
Definition: htup.h:66
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
TransactionId t_xmin
Definition: htup_details.h:118
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define HEAP_KEYS_UPDATED
Definition: htup_details.h:264
#define HEAP_MOVED
Definition: htup_details.h:202
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:670
uint8 infobits_set
Definition: heapam_xlog.h:106
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define RelationNeedsWAL(relation)
Definition: rel.h:502
void pgstat_count_heap_delete(Relation rel)
Definition: pgstat.c:1851
#define HeapTupleHasExternal(tuple)
Definition: htup_details.h:674
void toast_delete(Relation rel, HeapTuple oldtup, bool is_speculative)
Definition: tuptoaster.c:464
#define elog
Definition: elog.h:219
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
#define TransactionIdIsValid(xid)
Definition: transam.h:41
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
#define XLOG_HEAP_DELETE
Definition: heapam_xlog.h:33
#define RelationGetRelid(relation)
Definition: rel.h:413
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
#define HeapTupleHeaderSetXmin(tup, xid)
Definition: htup_details.h:313
HeapScanDesc heap_beginscan ( Relation  relation,
Snapshot  snapshot,
int  nkeys,
ScanKey  key 
)

Definition at line 1394 of file heapam.c.

References heap_beginscan_internal().

Referenced by AlterDomainNotNull(), ATRewriteTable(), copy_heap_data(), CopyTo(), DefineQueryRewrite(), pgrowlocks(), pgstat_collect_oids(), RelationFindReplTupleSeq(), SeqNext(), validateCheckConstraint(), validateDomainConstraint(), and validateForeignKeyConstraint().

1396 {
1397  return heap_beginscan_internal(relation, snapshot, nkeys, key, NULL,
1398  true, true, true, false, false, false);
1399 }
static HeapScanDesc heap_beginscan_internal(Relation relation, Snapshot snapshot, int nkeys, ScanKey key, ParallelHeapScanDesc parallel_scan, bool allow_strat, bool allow_sync, bool allow_pagemode, bool is_bitmapscan, bool is_samplescan, bool temp_snap)
Definition: heapam.c:1440
#define NULL
Definition: c.h:226
HeapScanDesc heap_beginscan_bm ( Relation  relation,
Snapshot  snapshot,
int  nkeys,
ScanKey  key 
)

Definition at line 1422 of file heapam.c.

References heap_beginscan_internal().

Referenced by ExecInitBitmapHeapScan().

1424 {
1425  return heap_beginscan_internal(relation, snapshot, nkeys, key, NULL,
1426  false, false, true, true, false, false);
1427 }
static HeapScanDesc heap_beginscan_internal(Relation relation, Snapshot snapshot, int nkeys, ScanKey key, ParallelHeapScanDesc parallel_scan, bool allow_strat, bool allow_sync, bool allow_pagemode, bool is_bitmapscan, bool is_samplescan, bool temp_snap)
Definition: heapam.c:1440
#define NULL
Definition: c.h:226
HeapScanDesc heap_beginscan_catalog ( Relation  relation,
int  nkeys,
ScanKey  key 
)

Definition at line 1402 of file heapam.c.

References GetCatalogSnapshot(), heap_beginscan_internal(), RegisterSnapshot(), and RelationGetRelid.

Referenced by AlterTableMoveAll(), AlterTableSpaceOptions(), boot_openrel(), check_db_file_conflict(), createdb(), do_autovacuum(), DropSetting(), DropTableSpace(), find_typed_table_dependencies(), get_database_list(), get_rel_oids(), get_rewrite_oid_without_relid(), get_subscription_list(), get_tables_to_cluster(), get_tablespace_name(), get_tablespace_oid(), GetAllTablesPublicationRelations(), getRelationsInNamespace(), gettype(), index_update_stats(), objectsInSchemaToOids(), ReindexMultipleTables(), remove_dbtablespaces(), RemoveConversionById(), RenameTableSpace(), ThereIsAtLeastOneRole(), and vac_truncate_clog().

1403 {
1404  Oid relid = RelationGetRelid(relation);
1405  Snapshot snapshot = RegisterSnapshot(GetCatalogSnapshot(relid));
1406 
1407  return heap_beginscan_internal(relation, snapshot, nkeys, key, NULL,
1408  true, true, true, false, false, true);
1409 }
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:858
Snapshot GetCatalogSnapshot(Oid relid)
Definition: snapmgr.c:436
unsigned int Oid
Definition: postgres_ext.h:31
static HeapScanDesc heap_beginscan_internal(Relation relation, Snapshot snapshot, int nkeys, ScanKey key, ParallelHeapScanDesc parallel_scan, bool allow_strat, bool allow_sync, bool allow_pagemode, bool is_bitmapscan, bool is_samplescan, bool temp_snap)
Definition: heapam.c:1440
#define NULL
Definition: c.h:226
#define RelationGetRelid(relation)
Definition: rel.h:413
HeapScanDesc heap_beginscan_parallel ( Relation  ,
ParallelHeapScanDesc   
)

Definition at line 1653 of file heapam.c.

References Assert, heap_beginscan_internal(), ParallelHeapScanDescData::phs_relid, ParallelHeapScanDescData::phs_snapshot_data, RegisterSnapshot(), RelationGetRelid, and RestoreSnapshot().

Referenced by ExecSeqScanInitializeDSM(), and ExecSeqScanInitializeWorker().

1654 {
1655  Snapshot snapshot;
1656 
1657  Assert(RelationGetRelid(relation) == parallel_scan->phs_relid);
1658  snapshot = RestoreSnapshot(parallel_scan->phs_snapshot_data);
1659  RegisterSnapshot(snapshot);
1660 
1661  return heap_beginscan_internal(relation, snapshot, 0, NULL, parallel_scan,
1662  true, true, true, false, false, true);
1663 }
Snapshot RestoreSnapshot(char *start_address)
Definition: snapmgr.c:2069
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:858
static HeapScanDesc heap_beginscan_internal(Relation relation, Snapshot snapshot, int nkeys, ScanKey key, ParallelHeapScanDesc parallel_scan, bool allow_strat, bool allow_sync, bool allow_pagemode, bool is_bitmapscan, bool is_samplescan, bool temp_snap)
Definition: heapam.c:1440
#define NULL
Definition: c.h:226
#define Assert(condition)
Definition: c.h:670
#define RelationGetRelid(relation)
Definition: rel.h:413
HeapScanDesc heap_beginscan_sampling ( Relation  relation,
Snapshot  snapshot,
int  nkeys,
ScanKey  key,
bool  allow_strat,
bool  allow_sync,
bool  allow_pagemode 
)

Definition at line 1430 of file heapam.c.

References heap_beginscan_internal().

Referenced by tablesample_init().

1433 {
1434  return heap_beginscan_internal(relation, snapshot, nkeys, key, NULL,
1435  allow_strat, allow_sync, allow_pagemode,
1436  false, true, false);
1437 }
static HeapScanDesc heap_beginscan_internal(Relation relation, Snapshot snapshot, int nkeys, ScanKey key, ParallelHeapScanDesc parallel_scan, bool allow_strat, bool allow_sync, bool allow_pagemode, bool is_bitmapscan, bool is_samplescan, bool temp_snap)
Definition: heapam.c:1440
#define NULL
Definition: c.h:226
HeapScanDesc heap_beginscan_strat ( Relation  relation,
Snapshot  snapshot,
int  nkeys,
ScanKey  key,
bool  allow_strat,
bool  allow_sync 
)

Definition at line 1412 of file heapam.c.

References heap_beginscan_internal().

Referenced by IndexBuildHeapRangeScan(), IndexCheckExclusion(), pgstat_heap(), systable_beginscan(), and validate_index_heapscan().

1415 {
1416  return heap_beginscan_internal(relation, snapshot, nkeys, key, NULL,
1417  allow_strat, allow_sync, true,
1418  false, false, false);
1419 }
static HeapScanDesc heap_beginscan_internal(Relation relation, Snapshot snapshot, int nkeys, ScanKey key, ParallelHeapScanDesc parallel_scan, bool allow_strat, bool allow_sync, bool allow_pagemode, bool is_bitmapscan, bool is_samplescan, bool temp_snap)
Definition: heapam.c:1440
#define NULL
Definition: c.h:226
HTSU_Result heap_delete ( Relation  relation,
ItemPointer  tid,
CommandId  cid,
Snapshot  crosscheck,
bool  wait,
HeapUpdateFailureData hufd 
)

Definition at line 2998 of file heapam.c.

References Assert, BUFFER_LOCK_EXCLUSIVE, BUFFER_LOCK_UNLOCK, BufferGetBlockNumber(), BufferGetPage, CacheInvalidateHeapTuple(), CheckForSerializableConflictIn(), HeapUpdateFailureData::cmax, compute_infobits(), compute_new_xmax_infomask(), HeapUpdateFailureData::ctid, DoesMultiXactIdConflict(), END_CRIT_SECTION, ereport, errcode(), errmsg(), ERROR, ExtractReplicaIdentity(), xl_heap_delete::flags, GetCurrentTransactionId(), heap_acquire_tuplock(), heap_freetuple(), HEAP_KEYS_UPDATED, HEAP_MOVED, HEAP_XMAX_BITS, HEAP_XMAX_INVALID, HEAP_XMAX_IS_LOCKED_ONLY, HEAP_XMAX_IS_MULTI, HeapTupleBeingUpdated, HeapTupleHasExternal, HeapTupleHeaderAdjustCmax(), HeapTupleHeaderClearHotUpdated, HeapTupleHeaderGetCmax(), HeapTupleHeaderGetRawXmax, HeapTupleHeaderGetUpdateXid, HeapTupleHeaderIsOnlyLocked(), HeapTupleHeaderSetCmax, HeapTupleHeaderSetXmax, HeapTupleInvisible, HeapTupleMayBeUpdated, HeapTupleSatisfiesUpdate(), HeapTupleSatisfiesVisibility, HeapTupleSelfUpdated, HeapTupleUpdated, xl_heap_delete::infobits_set, InvalidBuffer, InvalidCommandId, InvalidSnapshot, IsInParallelMode(), ItemIdGetLength, ItemIdIsNormal, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, ItemPointerIsValid, LockBuffer(), LockTupleExclusive, LockWaitBlock, log_heap_new_cid(), MarkBufferDirty(), MultiXactIdSetOldestMember(), MultiXactIdWait(), MultiXactStatusUpdate, NULL, xl_heap_delete::offnum, PageClearAllVisible, PageGetItem, PageGetItemId, PageIsAllVisible, PageSetLSN, PageSetPrunable, pgstat_count_heap_delete(), RelationData::rd_rel, ReadBuffer(), REGBUF_STANDARD, RelationGetRelid, RelationIsAccessibleInLogicalDecoding, RelationNeedsWAL, ReleaseBuffer(), RELKIND_MATVIEW, RELKIND_RELATION, REPLICA_IDENTITY_FULL, SizeOfHeapDelete, SizeOfHeapHeader, SizeofHeapTupleHeader, START_CRIT_SECTION, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, xl_heap_header::t_hoff, HeapTupleHeaderData::t_hoff, xl_heap_header::t_infomask, HeapTupleHeaderData::t_infomask, xl_heap_header::t_infomask2, HeapTupleHeaderData::t_infomask2, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, toast_delete(), TransactionIdEquals, TransactionIdIsCurrentTransactionId(), UnlockReleaseBuffer(), UnlockTupleTuplock, UpdateXmaxHintBits(), visibilitymap_clear(), visibilitymap_pin(), VISIBILITYMAP_VALID_BITS, XactLockTableWait(), XLH_DELETE_ALL_VISIBLE_CLEARED, XLH_DELETE_CONTAINS_OLD_KEY, XLH_DELETE_CONTAINS_OLD_TUPLE, XLOG_HEAP_DELETE, XLOG_INCLUDE_ORIGIN, XLogBeginInsert(), XLogInsert(), XLogRegisterBuffer(), XLogRegisterData(), XLogSetRecordFlags(), XLTW_Delete, HeapUpdateFailureData::xmax, xl_heap_delete::xmax, and xmax_infomask_changed().

Referenced by ExecDelete(), and simple_heap_delete().

3001 {
3002  HTSU_Result result;
3004  ItemId lp;
3005  HeapTupleData tp;
3006  Page page;
3007  BlockNumber block;
3008  Buffer buffer;
3009  Buffer vmbuffer = InvalidBuffer;
3010  TransactionId new_xmax;
3011  uint16 new_infomask,
3012  new_infomask2;
3013  bool have_tuple_lock = false;
3014  bool iscombo;
3015  bool all_visible_cleared = false;
3016  HeapTuple old_key_tuple = NULL; /* replica identity of the tuple */
3017  bool old_key_copied = false;
3018 
3019  Assert(ItemPointerIsValid(tid));
3020 
3021  /*
3022  * Forbid this during a parallel operation, lest it allocate a combocid.
3023  * Other workers might need that combocid for visibility checks, and we
3024  * have no provision for broadcasting it to them.
3025  */
3026  if (IsInParallelMode())
3027  ereport(ERROR,
3028  (errcode(ERRCODE_INVALID_TRANSACTION_STATE),
3029  errmsg("cannot delete tuples during a parallel operation")));
3030 
3031  block = ItemPointerGetBlockNumber(tid);
3032  buffer = ReadBuffer(relation, block);
3033  page = BufferGetPage(buffer);
3034 
3035  /*
3036  * Before locking the buffer, pin the visibility map page if it appears to
3037  * be necessary. Since we haven't got the lock yet, someone else might be
3038  * in the middle of changing this, so we'll need to recheck after we have
3039  * the lock.
3040  */
3041  if (PageIsAllVisible(page))
3042  visibilitymap_pin(relation, block, &vmbuffer);
3043 
3045 
3046  /*
3047  * If we didn't pin the visibility map page and the page has become all
3048  * visible while we were busy locking the buffer, we'll have to unlock and
3049  * re-lock, to avoid holding the buffer lock across an I/O. That's a bit
3050  * unfortunate, but hopefully shouldn't happen often.
3051  */
3052  if (vmbuffer == InvalidBuffer && PageIsAllVisible(page))
3053  {
3054  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
3055  visibilitymap_pin(relation, block, &vmbuffer);
3057  }
3058 
3059  lp = PageGetItemId(page, ItemPointerGetOffsetNumber(tid));
3060  Assert(ItemIdIsNormal(lp));
3061 
3062  tp.t_tableOid = RelationGetRelid(relation);
3063  tp.t_data = (HeapTupleHeader) PageGetItem(page, lp);
3064  tp.t_len = ItemIdGetLength(lp);
3065  tp.t_self = *tid;
3066 
3067 l1:
3068  result = HeapTupleSatisfiesUpdate(&tp, cid, buffer);
3069 
3070  if (result == HeapTupleInvisible)
3071  {
3072  UnlockReleaseBuffer(buffer);
3073  ereport(ERROR,
3074  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
3075  errmsg("attempted to delete invisible tuple")));
3076  }
3077  else if (result == HeapTupleBeingUpdated && wait)
3078  {
3079  TransactionId xwait;
3080  uint16 infomask;
3081 
3082  /* must copy state data before unlocking buffer */
3083  xwait = HeapTupleHeaderGetRawXmax(tp.t_data);
3084  infomask = tp.t_data->t_infomask;
3085 
3086  /*
3087  * Sleep until concurrent transaction ends -- except when there's a
3088  * single locker and it's our own transaction. Note we don't care
3089  * which lock mode the locker has, because we need the strongest one.
3090  *
3091  * Before sleeping, we need to acquire tuple lock to establish our
3092  * priority for the tuple (see heap_lock_tuple). LockTuple will
3093  * release us when we are next-in-line for the tuple.
3094  *
3095  * If we are forced to "start over" below, we keep the tuple lock;
3096  * this arranges that we stay at the head of the line while rechecking
3097  * tuple state.
3098  */
3099  if (infomask & HEAP_XMAX_IS_MULTI)
3100  {
3101  /* wait for multixact */
3102  if (DoesMultiXactIdConflict((MultiXactId) xwait, infomask,
3104  {
3105  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
3106 
3107  /* acquire tuple lock, if necessary */
3109  LockWaitBlock, &have_tuple_lock);
3110 
3111  /* wait for multixact */
3113  relation, &(tp.t_self), XLTW_Delete,
3114  NULL);
3116 
3117  /*
3118  * If xwait had just locked the tuple then some other xact
3119  * could update this tuple before we get to this point. Check
3120  * for xmax change, and start over if so.
3121  */
3122  if (xmax_infomask_changed(tp.t_data->t_infomask, infomask) ||
3124  xwait))
3125  goto l1;
3126  }
3127 
3128  /*
3129  * You might think the multixact is necessarily done here, but not
3130  * so: it could have surviving members, namely our own xact or
3131  * other subxacts of this backend. It is legal for us to delete
3132  * the tuple in either case, however (the latter case is
3133  * essentially a situation of upgrading our former shared lock to
3134  * exclusive). We don't bother changing the on-disk hint bits
3135  * since we are about to overwrite the xmax altogether.
3136  */
3137  }
3138  else if (!TransactionIdIsCurrentTransactionId(xwait))
3139  {
3140  /*
3141  * Wait for regular transaction to end; but first, acquire tuple
3142  * lock.
3143  */
3144  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
3146  LockWaitBlock, &have_tuple_lock);
3147  XactLockTableWait(xwait, relation, &(tp.t_self), XLTW_Delete);
3149 
3150  /*
3151  * xwait is done, but if xwait had just locked the tuple then some
3152  * other xact could update this tuple before we get to this point.
3153  * Check for xmax change, and start over if so.
3154  */
3155  if (xmax_infomask_changed(tp.t_data->t_infomask, infomask) ||
3157  xwait))
3158  goto l1;
3159 
3160  /* Otherwise check if it committed or aborted */
3161  UpdateXmaxHintBits(tp.t_data, buffer, xwait);
3162  }
3163 
3164  /*
3165  * We may overwrite if previous xmax aborted, or if it committed but
3166  * only locked the tuple without updating it.
3167  */
3168  if ((tp.t_data->t_infomask & HEAP_XMAX_INVALID) ||
3171  result = HeapTupleMayBeUpdated;
3172  else
3173  result = HeapTupleUpdated;
3174  }
3175 
3176  if (crosscheck != InvalidSnapshot && result == HeapTupleMayBeUpdated)
3177  {
3178  /* Perform additional check for transaction-snapshot mode RI updates */
3179  if (!HeapTupleSatisfiesVisibility(&tp, crosscheck, buffer))
3180  result = HeapTupleUpdated;
3181  }
3182 
3183  if (result != HeapTupleMayBeUpdated)
3184  {
3185  Assert(result == HeapTupleSelfUpdated ||
3186  result == HeapTupleUpdated ||
3187  result == HeapTupleBeingUpdated);
3189  hufd->ctid = tp.t_data->t_ctid;
3191  if (result == HeapTupleSelfUpdated)
3192  hufd->cmax = HeapTupleHeaderGetCmax(tp.t_data);
3193  else
3194  hufd->cmax = InvalidCommandId;
3195  UnlockReleaseBuffer(buffer);
3196  if (have_tuple_lock)
3197  UnlockTupleTuplock(relation, &(tp.t_self), LockTupleExclusive);
3198  if (vmbuffer != InvalidBuffer)
3199  ReleaseBuffer(vmbuffer);
3200  return result;
3201  }
3202 
3203  /*
3204  * We're about to do the actual delete -- check for conflict first, to
3205  * avoid possibly having to roll back work we've just done.
3206  *
3207  * This is safe without a recheck as long as there is no possibility of
3208  * another process scanning the page between this check and the delete
3209  * being visible to the scan (i.e., an exclusive buffer content lock is
3210  * continuously held from this point until the tuple delete is visible).
3211  */
3212  CheckForSerializableConflictIn(relation, &tp, buffer);
3213 
3214  /* replace cid with a combo cid if necessary */
3215  HeapTupleHeaderAdjustCmax(tp.t_data, &cid, &iscombo);
3216 
3217  /*
3218  * Compute replica identity tuple before entering the critical section so
3219  * we don't PANIC upon a memory allocation failure.
3220  */
3221  old_key_tuple = ExtractReplicaIdentity(relation, &tp, true, &old_key_copied);
3222 
3223  /*
3224  * If this is the first possibly-multixact-able operation in the current
3225  * transaction, set my per-backend OldestMemberMXactId setting. We can be
3226  * certain that the transaction will never become a member of any older
3227  * MultiXactIds than that. (We have to do this even if we end up just
3228  * using our own TransactionId below, since some other backend could
3229  * incorporate our XID into a MultiXact immediately afterwards.)
3230  */
3232 
3235  xid, LockTupleExclusive, true,
3236  &new_xmax, &new_infomask, &new_infomask2);
3237 
3239 
3240  /*
3241  * If this transaction commits, the tuple will become DEAD sooner or
3242  * later. Set flag that this page is a candidate for pruning once our xid
3243  * falls below the OldestXmin horizon. If the transaction finally aborts,
3244  * the subsequent page pruning will be a no-op and the hint will be
3245  * cleared.
3246  */
3247  PageSetPrunable(page, xid);
3248 
3249  if (PageIsAllVisible(page))
3250  {
3251  all_visible_cleared = true;
3252  PageClearAllVisible(page);
3253  visibilitymap_clear(relation, BufferGetBlockNumber(buffer),
3254  vmbuffer, VISIBILITYMAP_VALID_BITS);
3255  }
3256 
3257  /* store transaction information of xact deleting the tuple */
3260  tp.t_data->t_infomask |= new_infomask;
3261  tp.t_data->t_infomask2 |= new_infomask2;
3263  HeapTupleHeaderSetXmax(tp.t_data, new_xmax);
3264  HeapTupleHeaderSetCmax(tp.t_data, cid, iscombo);
3265  /* Make sure there is no forward chain link in t_ctid */
3266  tp.t_data->t_ctid = tp.t_self;
3267 
3268  MarkBufferDirty(buffer);
3269 
3270  /*
3271  * XLOG stuff
3272  *
3273  * NB: heap_abort_speculative() uses the same xlog record and replay
3274  * routines.
3275  */
3276  if (RelationNeedsWAL(relation))
3277  {
3278  xl_heap_delete xlrec;
3279  XLogRecPtr recptr;
3280 
3281  /* For logical decode we need combocids to properly decode the catalog */
3283  log_heap_new_cid(relation, &tp);
3284 
3285  xlrec.flags = all_visible_cleared ? XLH_DELETE_ALL_VISIBLE_CLEARED : 0;
3287  tp.t_data->t_infomask2);
3289  xlrec.xmax = new_xmax;
3290 
3291  if (old_key_tuple != NULL)
3292  {
3293  if (relation->rd_rel->relreplident == REPLICA_IDENTITY_FULL)
3295  else
3297  }
3298 
3299  XLogBeginInsert();
3300  XLogRegisterData((char *) &xlrec, SizeOfHeapDelete);
3301 
3302  XLogRegisterBuffer(0, buffer, REGBUF_STANDARD);
3303 
3304  /*
3305  * Log replica identity of the deleted tuple if there is one
3306  */
3307  if (old_key_tuple != NULL)
3308  {
3309  xl_heap_header xlhdr;
3310 
3311  xlhdr.t_infomask2 = old_key_tuple->t_data->t_infomask2;
3312  xlhdr.t_infomask = old_key_tuple->t_data->t_infomask;
3313  xlhdr.t_hoff = old_key_tuple->t_data->t_hoff;
3314 
3315  XLogRegisterData((char *) &xlhdr, SizeOfHeapHeader);
3316  XLogRegisterData((char *) old_key_tuple->t_data
3318  old_key_tuple->t_len
3320  }
3321 
3322  /* filtering by origin on a row level is much more efficient */
3324 
3325  recptr = XLogInsert(RM_HEAP_ID, XLOG_HEAP_DELETE);
3326 
3327  PageSetLSN(page, recptr);
3328  }
3329 
3330  END_CRIT_SECTION();
3331 
3332  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
3333 
3334  if (vmbuffer != InvalidBuffer)
3335  ReleaseBuffer(vmbuffer);
3336 
3337  /*
3338  * If the tuple has toasted out-of-line attributes, we need to delete
3339  * those items too. We have to do this before releasing the buffer
3340  * because we need to look at the contents of the tuple, but it's OK to
3341  * release the content lock on the buffer first.
3342  */
3343  if (relation->rd_rel->relkind != RELKIND_RELATION &&
3344  relation->rd_rel->relkind != RELKIND_MATVIEW)
3345  {
3346  /* toast table entries should never be recursively toasted */
3348  }
3349  else if (HeapTupleHasExternal(&tp))
3350  toast_delete(relation, &tp, false);
3351 
3352  /*
3353  * Mark tuple for invalidation from system caches at next command
3354  * boundary. We have to do this before releasing the buffer because we
3355  * need to look at the contents of the tuple.
3356  */
3357  CacheInvalidateHeapTuple(relation, &tp, NULL);
3358 
3359  /* Now we can release the buffer */
3360  ReleaseBuffer(buffer);
3361 
3362  /*
3363  * Release the lmgr tuple lock, if we had it.
3364  */
3365  if (have_tuple_lock)
3366  UnlockTupleTuplock(relation, &(tp.t_self), LockTupleExclusive);
3367 
3368  pgstat_count_heap_delete(relation);
3369 
3370  if (old_key_tuple != NULL && old_key_copied)
3371  heap_freetuple(old_key_tuple);
3372 
3373  return HeapTupleMayBeUpdated;
3374 }
#define HeapTupleHeaderGetUpdateXid(tup)
Definition: htup_details.h:359
bool HeapTupleHeaderIsOnlyLocked(HeapTupleHeader tuple)
Definition: tqual.c:1585
#define ItemPointerIsValid(pointer)
Definition: itemptr.h:59
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
#define SizeofHeapTupleHeader
Definition: htup_details.h:170
static XLogRecPtr log_heap_new_cid(Relation relation, HeapTuple tup)
Definition: heapam.c:7732
#define HEAP_XMAX_BITS
Definition: htup_details.h:256
static uint8 compute_infobits(uint16 infomask, uint16 infomask2)
Definition: heapam.c:2939
void CacheInvalidateHeapTuple(Relation relation, HeapTuple tuple, HeapTuple newtuple)
Definition: inval.c:1085
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
#define PageIsAllVisible(page)
Definition: bufpage.h:382
uint32 TransactionId
Definition: c.h:393
HTSU_Result HeapTupleSatisfiesUpdate(HeapTuple htup, CommandId curcid, Buffer buffer)
Definition: tqual.c:460
bool TransactionIdIsCurrentTransactionId(TransactionId xid)
Definition: xact.c:772
void visibilitymap_pin(Relation rel, BlockNumber heapBlk, Buffer *buf)
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
static bool xmax_infomask_changed(uint16 new_infomask, uint16 old_infomask)
Definition: heapam.c:2961
#define HeapTupleHeaderClearHotUpdated(tup)
Definition: htup_details.h:497
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
#define RELKIND_MATVIEW
Definition: pg_class.h:167
#define InvalidBuffer
Definition: buf.h:25
uint16 t_infomask2
Definition: heapam_xlog.h:122
#define PageSetPrunable(page, xid)
Definition: bufpage.h:395
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
int errcode(int sqlerrcode)
Definition: elog.c:575
#define XLOG_INCLUDE_ORIGIN
Definition: xlog.h:192
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
Form_pg_class rd_rel
Definition: rel.h:113
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1374
void CheckForSerializableConflictIn(Relation relation, HeapTuple tuple, Buffer buffer)
Definition: predicate.c:4243
#define UnlockTupleTuplock(rel, tup, mode)
Definition: heapam.c:184
#define HeapTupleSatisfiesVisibility(tuple, snapshot, buffer)
Definition: tqual.h:45
OffsetNumber offnum
Definition: heapam_xlog.h:105
void MultiXactIdSetOldestMember(void)
Definition: multixact.c:623
#define VISIBILITYMAP_VALID_BITS
Definition: visibilitymap.h:28
HeapTupleHeader t_data
Definition: htup.h:67
#define HeapTupleHeaderGetRawXmax(tup)
Definition: htup_details.h:369
unsigned short uint16
Definition: c.h:264
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
bool IsInParallelMode(void)
Definition: xact.c:912
bool visibilitymap_clear(Relation rel, BlockNumber heapBlk, Buffer buf, uint8 flags)
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3315
#define REPLICA_IDENTITY_FULL
Definition: pg_class.h:179
#define ERROR
Definition: elog.h:43
#define HEAP_XMAX_INVALID
Definition: htup_details.h:193
ItemPointerData t_ctid
Definition: htup_details.h:150
ItemPointerData t_self
Definition: htup.h:65
TransactionId xmax
Definition: heapam_xlog.h:104
static void MultiXactIdWait(MultiXactId multi, MultiXactStatus status, uint16 infomask, Relation rel, ItemPointer ctid, XLTW_Oper oper, int *remaining)
Definition: heapam.c:7148
TransactionId GetCurrentTransactionId(void)
Definition: xact.c:416
uint32 t_len
Definition: htup.h:64
#define SizeOfHeapDelete
Definition: heapam_xlog.h:110
#define REGBUF_STANDARD
Definition: xloginsert.h:35
#define XLH_DELETE_CONTAINS_OLD_KEY
Definition: heapam_xlog.h:94
CommandId cmax
Definition: heapam.h:72
#define HeapTupleHeaderSetXmax(tup, xid)
Definition: htup_details.h:374
HTSU_Result
Definition: snapshot.h:118
Oid t_tableOid
Definition: htup.h:66
void XLogSetRecordFlags(uint8 flags)
Definition: xloginsert.c:397
#define HeapTupleHeaderSetCmax(tup, cid, iscombo)
Definition: htup_details.h:399
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define ereport(elevel, rest)
Definition: elog.h:122
static void compute_new_xmax_infomask(TransactionId xmax, uint16 old_infomask, uint16 old_infomask2, TransactionId add_to_xmax, LockTupleMode mode, bool is_update, TransactionId *result_xmax, uint16 *result_infomask, uint16 *result_infomask2)
Definition: heapam.c:5293
TransactionId xmax
Definition: heapam.h:71
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
#define InvalidSnapshot
Definition: snapshot.h:24
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
#define RelationIsAccessibleInLogicalDecoding(relation)
Definition: rel.h:556
#define InvalidCommandId
Definition: c.h:410
#define HEAP_XMAX_IS_LOCKED_ONLY(infomask)
Definition: htup_details.h:216
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define HEAP_KEYS_UPDATED
Definition: htup_details.h:264
#define HEAP_XMAX_IS_MULTI
Definition: htup_details.h:194
static void UpdateXmaxHintBits(HeapTupleHeader tuple, Buffer buffer, TransactionId xid)
Definition: heapam.c:2284
#define HEAP_MOVED
Definition: htup_details.h:202
static bool heap_acquire_tuplock(Relation relation, ItemPointer tid, LockTupleMode mode, LockWaitPolicy wait_policy, bool *have_tuple_lock)
Definition: heapam.c:5244
TransactionId MultiXactId
Definition: c.h:403
#define PageClearAllVisible(page)
Definition: bufpage.h:386
void XactLockTableWait(TransactionId xid, Relation rel, ItemPointer ctid, XLTW_Oper oper)
Definition: lmgr.c:554
#define NULL
Definition: c.h:226
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:670
uint8 infobits_set
Definition: heapam_xlog.h:106
static HeapTuple ExtractReplicaIdentity(Relation rel, HeapTuple tup, bool key_modified, bool *copy)
Definition: heapam.c:7808
CommandId HeapTupleHeaderGetCmax(HeapTupleHeader tup)
Definition: combocid.c:119
static bool DoesMultiXactIdConflict(MultiXactId multi, uint16 infomask, LockTupleMode lockmode)
Definition: heapam.c:6981
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
uint16 t_infomask
Definition: heapam_xlog.h:123
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define RelationNeedsWAL(relation)
Definition: rel.h:502
void pgstat_count_heap_delete(Relation rel)
Definition: pgstat.c:1851
void HeapTupleHeaderAdjustCmax(HeapTupleHeader tup, CommandId *cmax, bool *iscombo)
Definition: combocid.c:154
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2588
#define HeapTupleHasExternal(tuple)
Definition: htup_details.h:674
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define XLH_DELETE_ALL_VISIBLE_CLEARED
Definition: heapam_xlog.h:92
void toast_delete(Relation rel, HeapTuple oldtup, bool is_speculative)
Definition: tuptoaster.c:464
ItemPointerData ctid
Definition: heapam.h:70
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
#define RELKIND_RELATION
Definition: pg_class.h:160
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
#define XLOG_HEAP_DELETE
Definition: heapam_xlog.h:33
#define RelationGetRelid(relation)
Definition: rel.h:413
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
#define SizeOfHeapHeader
Definition: heapam_xlog.h:127
Pointer Page
Definition: bufpage.h:74
#define XLH_DELETE_CONTAINS_OLD_TUPLE
Definition: heapam_xlog.h:93
void heap_endscan ( HeapScanDesc  scan)

Definition at line 1581 of file heapam.c.

References BufferIsValid, FreeAccessStrategy(), pfree(), RelationDecrementReferenceCount(), ReleaseBuffer(), HeapScanDescData::rs_cbuf, HeapScanDescData::rs_key, HeapScanDescData::rs_rd, HeapScanDescData::rs_snapshot, HeapScanDescData::rs_strategy, HeapScanDescData::rs_temp_snap, and UnregisterSnapshot().

Referenced by AlterDomainNotNull(), AlterTableMoveAll(), AlterTableSpaceOptions(), ATRewriteTable(), boot_openrel(), check_db_file_conflict(), copy_heap_data(), CopyTo(), createdb(), DefineQueryRewrite(), do_autovacuum(), DropSetting(), DropTableSpace(), ExecEndBitmapHeapScan(), ExecEndSampleScan(), ExecEndSeqScan(), find_typed_table_dependencies(), get_database_list(), get_rel_oids(), get_rewrite_oid_without_relid(), get_subscription_list(), get_tables_to_cluster(), get_tablespace_name(), get_tablespace_oid(), GetAllTablesPublicationRelations(), getRelationsInNamespace(), gettype(), index_update_stats(), IndexBuildHeapRangeScan(), IndexCheckExclusion(), objectsInSchemaToOids(), pgrowlocks(), pgstat_collect_oids(), pgstat_heap(), ReindexMultipleTables(), RelationFindReplTupleSeq(), remove_dbtablespaces(), RemoveConversionById(), RenameTableSpace(), systable_endscan(), ThereIsAtLeastOneRole(), vac_truncate_clog(), validate_index_heapscan(), validateCheckConstraint(), validateDomainConstraint(), and validateForeignKeyConstraint().

1582 {
1583  /* Note: no locking manipulations needed */
1584 
1585  /*
1586  * unpin scan buffers
1587  */
1588  if (BufferIsValid(scan->rs_cbuf))
1589  ReleaseBuffer(scan->rs_cbuf);
1590 
1591  /*
1592  * decrement relation reference count and free scan descriptor storage
1593  */
1595 
1596  if (scan->rs_key)
1597  pfree(scan->rs_key);
1598 
1599  if (scan->rs_strategy != NULL)
1601 
1602  if (scan->rs_temp_snap)
1604 
1605  pfree(scan);
1606 }
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
void pfree(void *pointer)
Definition: mcxt.c:992
void RelationDecrementReferenceCount(Relation rel)
Definition: relcache.c:2135
Snapshot rs_snapshot
Definition: relscan.h:48
void UnregisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:900
bool rs_temp_snap
Definition: relscan.h:56
BufferAccessStrategy rs_strategy
Definition: relscan.h:63
Relation rs_rd
Definition: relscan.h:47
Buffer rs_cbuf
Definition: relscan.h:70
void FreeAccessStrategy(BufferAccessStrategy strategy)
Definition: freelist.c:580
#define NULL
Definition: c.h:226
#define BufferIsValid(bufnum)
Definition: bufmgr.h:114
ScanKey rs_key
Definition: relscan.h:50
bool heap_fetch ( Relation  relation,
Snapshot  snapshot,
HeapTuple  tuple,
Buffer userbuf,
bool  keep_buf,
Relation  stats_relation 
)

Definition at line 1849 of file heapam.c.

References BUFFER_LOCK_SHARE, BUFFER_LOCK_UNLOCK, BufferGetPage, CheckForSerializableConflictOut(), HeapTupleSatisfiesVisibility, InvalidBuffer, ItemIdGetLength, ItemIdIsNormal, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, LockBuffer(), NULL, PageGetItem, PageGetItemId, PageGetMaxOffsetNumber, pgstat_count_heap_fetch, PredicateLockTuple(), ReadBuffer(), RelationGetRelid, ReleaseBuffer(), HeapTupleData::t_data, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, and TestForOldSnapshot().

Referenced by AfterTriggerExecute(), EvalPlanQualFetch(), EvalPlanQualFetchRowMarks(), ExecCheckTIDVisible(), ExecDelete(), ExecLockRows(), heap_lock_updated_tuple_rec(), and TidNext().

1855 {
1856  ItemPointer tid = &(tuple->t_self);
1857  ItemId lp;
1858  Buffer buffer;
1859  Page page;
1860  OffsetNumber offnum;
1861  bool valid;
1862 
1863  /*
1864  * Fetch and pin the appropriate page of the relation.
1865  */
1866  buffer = ReadBuffer(relation, ItemPointerGetBlockNumber(tid));
1867 
1868  /*
1869  * Need share lock on buffer to examine tuple commit status.
1870  */
1871  LockBuffer(buffer, BUFFER_LOCK_SHARE);
1872  page = BufferGetPage(buffer);
1873  TestForOldSnapshot(snapshot, relation, page);
1874 
1875  /*
1876  * We'd better check for out-of-range offnum in case of VACUUM since the
1877  * TID was obtained.
1878  */
1879  offnum = ItemPointerGetOffsetNumber(tid);
1880  if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(page))
1881  {
1882  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
1883  if (keep_buf)
1884  *userbuf = buffer;
1885  else
1886  {
1887  ReleaseBuffer(buffer);
1888  *userbuf = InvalidBuffer;
1889  }
1890  tuple->t_data = NULL;
1891  return false;
1892  }
1893 
1894  /*
1895  * get the item line pointer corresponding to the requested tid
1896  */
1897  lp = PageGetItemId(page, offnum);
1898 
1899  /*
1900  * Must check for deleted tuple.
1901  */
1902  if (!ItemIdIsNormal(lp))
1903  {
1904  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
1905  if (keep_buf)
1906  *userbuf = buffer;
1907  else
1908  {
1909  ReleaseBuffer(buffer);
1910  *userbuf = InvalidBuffer;
1911  }
1912  tuple->t_data = NULL;
1913  return false;
1914  }
1915 
1916  /*
1917  * fill in *tuple fields
1918  */
1919  tuple->t_data = (HeapTupleHeader) PageGetItem(page, lp);
1920  tuple->t_len = ItemIdGetLength(lp);
1921  tuple->t_tableOid = RelationGetRelid(relation);
1922 
1923  /*
1924  * check time qualification of tuple, then release lock
1925  */
1926  valid = HeapTupleSatisfiesVisibility(tuple, snapshot, buffer);
1927 
1928  if (valid)
1929  PredicateLockTuple(relation, tuple, snapshot);
1930 
1931  CheckForSerializableConflictOut(valid, relation, tuple, buffer, snapshot);
1932 
1933  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
1934 
1935  if (valid)
1936  {
1937  /*
1938  * All checks passed, so return the tuple as valid. Caller is now
1939  * responsible for releasing the buffer.
1940  */
1941  *userbuf = buffer;
1942 
1943  /* Count the successful fetch against appropriate rel, if any */
1944  if (stats_relation != NULL)
1945  pgstat_count_heap_fetch(stats_relation);
1946 
1947  return true;
1948  }
1949 
1950  /* Tuple failed time qual, but maybe caller wants to see it anyway. */
1951  if (keep_buf)
1952  *userbuf = buffer;
1953  else
1954  {
1955  ReleaseBuffer(buffer);
1956  *userbuf = InvalidBuffer;
1957  }
1958 
1959  return false;
1960 }
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
static void TestForOldSnapshot(Snapshot snapshot, Relation relation, Page page)
Definition: bufmgr.h:265
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define InvalidBuffer
Definition: buf.h:25
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
void CheckForSerializableConflictOut(bool visible, Relation relation, HeapTuple tuple, Buffer buffer, Snapshot snapshot)
Definition: predicate.c:3862
#define HeapTupleSatisfiesVisibility(tuple, snapshot, buffer)
Definition: tqual.h:45
uint16 OffsetNumber
Definition: off.h:24
HeapTupleHeader t_data
Definition: htup.h:67
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
ItemPointerData t_self
Definition: htup.h:65
#define pgstat_count_heap_fetch(rel)
Definition: pgstat.h:1150
uint32 t_len
Definition: htup.h:64
Oid t_tableOid
Definition: htup.h:66
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define NULL
Definition: c.h:226
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
void PredicateLockTuple(Relation relation, HeapTuple tuple, Snapshot snapshot)
Definition: predicate.c:2460
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
int Buffer
Definition: buf.h:23
#define RelationGetRelid(relation)
Definition: rel.h:413
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
void heap_finish_speculative ( Relation  relation,
HeapTuple  tuple 
)

Definition at line 6001 of file heapam.c.

References Assert, BUFFER_LOCK_EXCLUSIVE, BufferGetPage, elog, END_CRIT_SECTION, ERROR, HeapTupleHeaderIsSpeculative, ItemIdIsNormal, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, LockBuffer(), MarkBufferDirty(), MaxOffsetNumber, NULL, xl_heap_confirm::offnum, PageGetItem, PageGetItemId, PageGetMaxOffsetNumber, PageSetLSN, ReadBuffer(), REGBUF_STANDARD, RelationNeedsWAL, SizeOfHeapConfirm, SpecTokenOffsetNumber, START_CRIT_SECTION, StaticAssertStmt, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleData::t_self, UnlockReleaseBuffer(), XLOG_HEAP_CONFIRM, XLOG_INCLUDE_ORIGIN, XLogBeginInsert(), XLogInsert(), XLogRegisterBuffer(), XLogRegisterData(), and XLogSetRecordFlags().

Referenced by ExecInsert().

6002 {
6003  Buffer buffer;
6004  Page page;
6005  OffsetNumber offnum;
6006  ItemId lp = NULL;
6007  HeapTupleHeader htup;
6008 
6009  buffer = ReadBuffer(relation, ItemPointerGetBlockNumber(&(tuple->t_self)));
6011  page = (Page) BufferGetPage(buffer);
6012 
6013  offnum = ItemPointerGetOffsetNumber(&(tuple->t_self));
6014  if (PageGetMaxOffsetNumber(page) >= offnum)
6015  lp = PageGetItemId(page, offnum);
6016 
6017  if (PageGetMaxOffsetNumber(page) < offnum || !ItemIdIsNormal(lp))
6018  elog(ERROR, "invalid lp");
6019 
6020  htup = (HeapTupleHeader) PageGetItem(page, lp);
6021 
6022  /* SpecTokenOffsetNumber should be distinguishable from any real offset */
6024  "invalid speculative token constant");
6025 
6026  /* NO EREPORT(ERROR) from here till changes are logged */
6028 
6030 
6031  MarkBufferDirty(buffer);
6032 
6033  /*
6034  * Replace the speculative insertion token with a real t_ctid, pointing to
6035  * itself like it does on regular tuples.
6036  */
6037  htup->t_ctid = tuple->t_self;
6038 
6039  /* XLOG stuff */
6040  if (RelationNeedsWAL(relation))
6041  {
6042  xl_heap_confirm xlrec;
6043  XLogRecPtr recptr;
6044 
6045  xlrec.offnum = ItemPointerGetOffsetNumber(&tuple->t_self);
6046 
6047  XLogBeginInsert();
6048 
6049  /* We want the same filtering on this as on a plain insert */
6051 
6052  XLogRegisterData((char *) &xlrec, SizeOfHeapConfirm);
6053  XLogRegisterBuffer(0, buffer, REGBUF_STANDARD);
6054 
6055  recptr = XLogInsert(RM_HEAP_ID, XLOG_HEAP_CONFIRM);
6056 
6057  PageSetLSN(page, recptr);
6058  }
6059 
6060  END_CRIT_SECTION();
6061 
6062  UnlockReleaseBuffer(buffer);
6063 }
OffsetNumber offnum
Definition: heapam_xlog.h:274
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define MaxOffsetNumber
Definition: off.h:28
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
#define HeapTupleHeaderIsSpeculative(tup)
Definition: htup_details.h:423
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
#define XLOG_INCLUDE_ORIGIN
Definition: xlog.h:192
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
uint16 OffsetNumber
Definition: off.h:24
HeapTupleHeader t_data
Definition: htup.h:67
#define StaticAssertStmt(condition, errmessage)
Definition: c.h:752
#define SpecTokenOffsetNumber
Definition: htup_details.h:285
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3315
#define ERROR
Definition: elog.h:43
ItemPointerData t_ctid
Definition: htup_details.h:150
ItemPointerData t_self
Definition: htup.h:65
#define REGBUF_STANDARD
Definition: xloginsert.h:35
void XLogSetRecordFlags(uint8 flags)
Definition: xloginsert.c:397
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define SizeOfHeapConfirm
Definition: heapam_xlog.h:277
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define NULL
Definition: c.h:226
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:670
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define RelationNeedsWAL(relation)
Definition: rel.h:502
#define elog
Definition: elog.h:219
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
#define XLOG_HEAP_CONFIRM
Definition: heapam_xlog.h:37
bool heap_freeze_tuple ( HeapTupleHeader  tuple,
TransactionId  cutoff_xid,
TransactionId  cutoff_multi 
)

Definition at line 6807 of file heapam.c.

References heap_execute_freeze_tuple(), and heap_prepare_freeze_tuple().

Referenced by rewrite_heap_tuple().

6809 {
6811  bool do_freeze;
6812  bool tuple_totally_frozen;
6813 
6814  do_freeze = heap_prepare_freeze_tuple(tuple, cutoff_xid, cutoff_multi,
6815  &frz, &tuple_totally_frozen);
6816 
6817  /*
6818  * Note that because this is not a WAL-logged operation, we don't need to
6819  * fill in the offset in the freeze record.
6820  */
6821 
6822  if (do_freeze)
6823  heap_execute_freeze_tuple(tuple, &frz);
6824  return do_freeze;
6825 }
void heap_execute_freeze_tuple(HeapTupleHeader tuple, xl_heap_freeze_tuple *frz)
Definition: heapam.c:6786
bool heap_prepare_freeze_tuple(HeapTupleHeader tuple, TransactionId cutoff_xid, TransactionId cutoff_multi, xl_heap_freeze_tuple *frz, bool *totally_frozen_p)
Definition: heapam.c:6608
void heap_get_latest_tid ( Relation  relation,
Snapshot  snapshot,
ItemPointer  tid 
)

Definition at line 2154 of file heapam.c.

References BUFFER_LOCK_SHARE, BufferGetPage, CheckForSerializableConflictOut(), elog, ERROR, HEAP_XMAX_INVALID, HeapTupleHeaderGetUpdateXid, HeapTupleHeaderGetXmin, HeapTupleHeaderIsOnlyLocked(), HeapTupleSatisfiesVisibility, InvalidTransactionId, ItemIdGetLength, ItemIdIsNormal, ItemPointerEquals(), ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, ItemPointerIsValid, LockBuffer(), PageGetItem, PageGetItemId, PageGetMaxOffsetNumber, ReadBuffer(), RelationGetNumberOfBlocks, RelationGetRelationName, RelationGetRelid, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleHeaderData::t_infomask, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, TestForOldSnapshot(), TransactionIdEquals, TransactionIdIsValid, and UnlockReleaseBuffer().

Referenced by currtid_byrelname(), currtid_byreloid(), and TidNext().

2157 {
2158  BlockNumber blk;
2159  ItemPointerData ctid;
2160  TransactionId priorXmax;
2161 
2162  /* this is to avoid Assert failures on bad input */
2163  if (!ItemPointerIsValid(tid))
2164  return;
2165 
2166  /*
2167  * Since this can be called with user-supplied TID, don't trust the input
2168  * too much. (RelationGetNumberOfBlocks is an expensive check, so we
2169  * don't check t_ctid links again this way. Note that it would not do to
2170  * call it just once and save the result, either.)
2171  */
2172  blk = ItemPointerGetBlockNumber(tid);
2173  if (blk >= RelationGetNumberOfBlocks(relation))
2174  elog(ERROR, "block number %u is out of range for relation \"%s\"",
2175  blk, RelationGetRelationName(relation));
2176 
2177  /*
2178  * Loop to chase down t_ctid links. At top of loop, ctid is the tuple we
2179  * need to examine, and *tid is the TID we will return if ctid turns out
2180  * to be bogus.
2181  *
2182  * Note that we will loop until we reach the end of the t_ctid chain.
2183  * Depending on the snapshot passed, there might be at most one visible
2184  * version of the row, but we don't try to optimize for that.
2185  */
2186  ctid = *tid;
2187  priorXmax = InvalidTransactionId; /* cannot check first XMIN */
2188  for (;;)
2189  {
2190  Buffer buffer;
2191  Page page;
2192  OffsetNumber offnum;
2193  ItemId lp;
2194  HeapTupleData tp;
2195  bool valid;
2196 
2197  /*
2198  * Read, pin, and lock the page.
2199  */
2200  buffer = ReadBuffer(relation, ItemPointerGetBlockNumber(&ctid));
2201  LockBuffer(buffer, BUFFER_LOCK_SHARE);
2202  page = BufferGetPage(buffer);
2203  TestForOldSnapshot(snapshot, relation, page);
2204 
2205  /*
2206  * Check for bogus item number. This is not treated as an error
2207  * condition because it can happen while following a t_ctid link. We
2208  * just assume that the prior tid is OK and return it unchanged.
2209  */
2210  offnum = ItemPointerGetOffsetNumber(&ctid);
2211  if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(page))
2212  {
2213  UnlockReleaseBuffer(buffer);
2214  break;
2215  }
2216  lp = PageGetItemId(page, offnum);
2217  if (!ItemIdIsNormal(lp))
2218  {
2219  UnlockReleaseBuffer(buffer);
2220  break;
2221  }
2222 
2223  /* OK to access the tuple */
2224  tp.t_self = ctid;
2225  tp.t_data = (HeapTupleHeader) PageGetItem(page, lp);
2226  tp.t_len = ItemIdGetLength(lp);
2227  tp.t_tableOid = RelationGetRelid(relation);
2228 
2229  /*
2230  * After following a t_ctid link, we might arrive at an unrelated
2231  * tuple. Check for XMIN match.
2232  */
2233  if (TransactionIdIsValid(priorXmax) &&
2235  {
2236  UnlockReleaseBuffer(buffer);
2237  break;
2238  }
2239 
2240  /*
2241  * Check time qualification of tuple; if visible, set it as the new
2242  * result candidate.
2243  */
2244  valid = HeapTupleSatisfiesVisibility(&tp, snapshot, buffer);
2245  CheckForSerializableConflictOut(valid, relation, &tp, buffer, snapshot);
2246  if (valid)
2247  *tid = ctid;
2248 
2249  /*
2250  * If there's a valid t_ctid link, follow it, else we're done.
2251  */
2252  if ((tp.t_data->t_infomask & HEAP_XMAX_INVALID) ||
2255  {
2256  UnlockReleaseBuffer(buffer);
2257  break;
2258  }
2259 
2260  ctid = tp.t_data->t_ctid;
2261  priorXmax = HeapTupleHeaderGetUpdateXid(tp.t_data);
2262  UnlockReleaseBuffer(buffer);
2263  } /* end of loop */
2264 }
#define HeapTupleHeaderGetUpdateXid(tup)
Definition: htup_details.h:359
bool HeapTupleHeaderIsOnlyLocked(HeapTupleHeader tuple)
Definition: tqual.c:1585
#define ItemPointerIsValid(pointer)
Definition: itemptr.h:59
static void TestForOldSnapshot(Snapshot snapshot, Relation relation, Page page)
Definition: bufmgr.h:265
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
uint32 TransactionId
Definition: c.h:393
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
uint32 BlockNumber
Definition: block.h:31
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
void CheckForSerializableConflictOut(bool visible, Relation relation, HeapTuple tuple, Buffer buffer, Snapshot snapshot)
Definition: predicate.c:3862
#define HeapTupleSatisfiesVisibility(tuple, snapshot, buffer)
Definition: tqual.h:45
uint16 OffsetNumber
Definition: off.h:24
HeapTupleHeader t_data
Definition: htup.h:67
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3315
#define ERROR
Definition: elog.h:43
#define HEAP_XMAX_INVALID
Definition: htup_details.h:193
ItemPointerData t_ctid
Definition: htup_details.h:150
ItemPointerData t_self
Definition: htup.h:65
uint32 t_len
Definition: htup.h:64
#define InvalidTransactionId
Definition: transam.h:31
#define RelationGetRelationName(relation)
Definition: rel.h:433
Oid t_tableOid
Definition: htup.h:66
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
#define HeapTupleHeaderGetXmin(tup)
Definition: htup_details.h:307
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
bool ItemPointerEquals(ItemPointer pointer1, ItemPointer pointer2)
Definition: itemptr.c:29
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
#define elog
Definition: elog.h:219
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
#define TransactionIdIsValid(xid)
Definition: transam.h:41
int Buffer
Definition: buf.h:23
#define RelationGetRelid(relation)
Definition: rel.h:413
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
void heap_get_root_tuples ( Page  page,
OffsetNumber root_offsets 
)

Definition at line 744 of file pruneheap.c.

References Assert, FirstOffsetNumber, HeapTupleHeaderGetUpdateXid, HeapTupleHeaderGetXmin, HeapTupleHeaderIsHeapOnly, HeapTupleHeaderIsHotUpdated, InvalidTransactionId, ItemIdGetRedirect, ItemIdIsDead, ItemIdIsNormal, ItemIdIsRedirected, ItemIdIsUsed, ItemPointerGetOffsetNumber, MaxHeapTuplesPerPage, MemSet, OffsetNumberNext, PageGetItem, PageGetItemId, PageGetMaxOffsetNumber, HeapTupleHeaderData::t_ctid, TransactionIdEquals, and TransactionIdIsValid.

Referenced by IndexBuildHeapRangeScan(), and validate_index_heapscan().

745 {
746  OffsetNumber offnum,
747  maxoff;
748 
749  MemSet(root_offsets, 0, MaxHeapTuplesPerPage * sizeof(OffsetNumber));
750 
751  maxoff = PageGetMaxOffsetNumber(page);
752  for (offnum = FirstOffsetNumber; offnum <= maxoff; offnum = OffsetNumberNext(offnum))
753  {
754  ItemId lp = PageGetItemId(page, offnum);
755  HeapTupleHeader htup;
756  OffsetNumber nextoffnum;
757  TransactionId priorXmax;
758 
759  /* skip unused and dead items */
760  if (!ItemIdIsUsed(lp) || ItemIdIsDead(lp))
761  continue;
762 
763  if (ItemIdIsNormal(lp))
764  {
765  htup = (HeapTupleHeader) PageGetItem(page, lp);
766 
767  /*
768  * Check if this tuple is part of a HOT-chain rooted at some other
769  * tuple. If so, skip it for now; we'll process it when we find
770  * its root.
771  */
772  if (HeapTupleHeaderIsHeapOnly(htup))
773  continue;
774 
775  /*
776  * This is either a plain tuple or the root of a HOT-chain.
777  * Remember it in the mapping.
778  */
779  root_offsets[offnum - 1] = offnum;
780 
781  /* If it's not the start of a HOT-chain, we're done with it */
782  if (!HeapTupleHeaderIsHotUpdated(htup))
783  continue;
784 
785  /* Set up to scan the HOT-chain */
786  nextoffnum = ItemPointerGetOffsetNumber(&htup->t_ctid);
787  priorXmax = HeapTupleHeaderGetUpdateXid(htup);
788  }
789  else
790  {
791  /* Must be a redirect item. We do not set its root_offsets entry */
793  /* Set up to scan the HOT-chain */
794  nextoffnum = ItemIdGetRedirect(lp);
795  priorXmax = InvalidTransactionId;
796  }
797 
798  /*
799  * Now follow the HOT-chain and collect other tuples in the chain.
800  *
801  * Note: Even though this is a nested loop, the complexity of the
802  * function is O(N) because a tuple in the page should be visited not
803  * more than twice, once in the outer loop and once in HOT-chain
804  * chases.
805  */
806  for (;;)
807  {
808  lp = PageGetItemId(page, nextoffnum);
809 
810  /* Check for broken chains */
811  if (!ItemIdIsNormal(lp))
812  break;
813 
814  htup = (HeapTupleHeader) PageGetItem(page, lp);
815 
816  if (TransactionIdIsValid(priorXmax) &&
817  !TransactionIdEquals(priorXmax, HeapTupleHeaderGetXmin(htup)))
818  break;
819 
820  /* Remember the root line pointer for this item */
821  root_offsets[nextoffnum - 1] = offnum;
822 
823  /* Advance to next chain member, if any */
824  if (!HeapTupleHeaderIsHotUpdated(htup))
825  break;
826 
827  nextoffnum = ItemPointerGetOffsetNumber(&htup->t_ctid);
828  priorXmax = HeapTupleHeaderGetUpdateXid(htup);
829  }
830  }
831 }
#define HeapTupleHeaderGetUpdateXid(tup)
Definition: htup_details.h:359
#define ItemIdIsRedirected(itemId)
Definition: itemid.h:105
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
uint32 TransactionId
Definition: c.h:393
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define ItemIdGetRedirect(itemId)
Definition: itemid.h:77
#define ItemIdIsUsed(itemId)
Definition: itemid.h:91
#define MaxHeapTuplesPerPage
Definition: htup_details.h:575
#define MemSet(start, val, len)
Definition: c.h:852
#define ItemIdIsDead(itemId)
Definition: itemid.h:112
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
uint16 OffsetNumber
Definition: off.h:24
#define HeapTupleHeaderIsHeapOnly(tup)
Definition: htup_details.h:502
ItemPointerData t_ctid
Definition: htup_details.h:150
#define FirstOffsetNumber
Definition: off.h:27
#define InvalidTransactionId
Definition: transam.h:31
#define HeapTupleHeaderIsHotUpdated(tup)
Definition: htup_details.h:485
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
#define Assert(condition)
Definition: c.h:670
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
#define HeapTupleHeaderGetXmin(tup)
Definition: htup_details.h:307
#define OffsetNumberNext(offsetNumber)
Definition: off.h:53
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define TransactionIdIsValid(xid)
Definition: transam.h:41
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
HeapTuple heap_getnext ( HeapScanDesc  scan,
ScanDirection  direction 
)

Definition at line 1781 of file heapam.c.

References HEAPDEBUG_1, HEAPDEBUG_2, HEAPDEBUG_3, heapgettup(), heapgettup_pagemode(), NULL, pgstat_count_heap_getnext, HeapScanDescData::rs_ctup, HeapScanDescData::rs_key, HeapScanDescData::rs_nkeys, HeapScanDescData::rs_pageatatime, HeapScanDescData::rs_rd, and HeapTupleData::t_data.

Referenced by AlterDomainNotNull(), AlterTableMoveAll(), AlterTableSpaceOptions(), ATRewriteTable(), boot_openrel(), check_db_file_conflict(), copy_heap_data(), CopyTo(), createdb(), DefineQueryRewrite(), do_autovacuum(), DropSetting(), DropTableSpace(), find_typed_table_dependencies(), get_database_list(), get_rel_oids(), get_rewrite_oid_without_relid(), get_subscription_list(), get_tables_to_cluster(), get_tablespace_name(), get_tablespace_oid(), GetAllTablesPublicationRelations(), getRelationsInNamespace(), gettype(), index_update_stats(), IndexBuildHeapRangeScan(), IndexCheckExclusion(), objectsInSchemaToOids(), pgrowlocks(), pgstat_collect_oids(), pgstat_heap(), ReindexMultipleTables(), RelationFindReplTupleSeq(), remove_dbtablespaces(), RemoveConversionById(), RenameTableSpace(), SeqNext(), systable_getnext(), ThereIsAtLeastOneRole(), vac_truncate_clog(), validate_index_heapscan(), validateCheckConstraint(), validateDomainConstraint(), and validateForeignKeyConstraint().

1782 {
1783  /* Note: no locking manipulations needed */
1784 
1785  HEAPDEBUG_1; /* heap_getnext( info ) */
1786 
1787  if (scan->rs_pageatatime)
1788  heapgettup_pagemode(scan, direction,
1789  scan->rs_nkeys, scan->rs_key);
1790  else
1791  heapgettup(scan, direction, scan->rs_nkeys, scan->rs_key);
1792 
1793  if (scan->rs_ctup.t_data == NULL)
1794  {
1795  HEAPDEBUG_2; /* heap_getnext returning EOS */
1796  return NULL;
1797  }
1798 
1799  /*
1800  * if we get here it means we have a new current scan tuple, so point to
1801  * the proper return buffer and return the tuple.
1802  */
1803  HEAPDEBUG_3; /* heap_getnext returning tuple */
1804 
1806 
1807  return &(scan->rs_ctup);
1808 }
#define HEAPDEBUG_2
Definition: heapam.c:1775
HeapTupleData rs_ctup
Definition: relscan.h:68
HeapTupleHeader t_data
Definition: htup.h:67
bool rs_pageatatime
Definition: relscan.h:53
#define HEAPDEBUG_1
Definition: heapam.c:1774
static void heapgettup(HeapScanDesc scan, ScanDirection dir, int nkeys, ScanKey key)
Definition: heapam.c:482
Relation rs_rd
Definition: relscan.h:47
#define NULL
Definition: c.h:226
#define HEAPDEBUG_3
Definition: heapam.c:1776
#define pgstat_count_heap_getnext(rel)
Definition: pgstat.h:1145
static void heapgettup_pagemode(HeapScanDesc scan, ScanDirection dir, int nkeys, ScanKey key)
Definition: heapam.c:784
ScanKey rs_key
Definition: relscan.h:50
bool heap_hot_search ( ItemPointer  tid,
Relation  relation,
Snapshot  snapshot,
bool all_dead 
)

Definition at line 2126 of file heapam.c.

References BUFFER_LOCK_SHARE, BUFFER_LOCK_UNLOCK, heap_hot_search_buffer(), ItemPointerGetBlockNumber, LockBuffer(), ReadBuffer(), and ReleaseBuffer().

Referenced by _bt_check_unique(), and unique_key_recheck().

2128 {
2129  bool result;
2130  Buffer buffer;
2131  HeapTupleData heapTuple;
2132 
2133  buffer = ReadBuffer(relation, ItemPointerGetBlockNumber(tid));
2134  LockBuffer(buffer, BUFFER_LOCK_SHARE);
2135  result = heap_hot_search_buffer(tid, relation, buffer, snapshot,
2136  &heapTuple, all_dead, true);
2137  LockBuffer(buffer, BUFFER_LOCK_UNLOCK);
2138  ReleaseBuffer(buffer);
2139  return result;
2140 }
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
bool heap_hot_search_buffer(ItemPointer tid, Relation relation, Buffer buffer, Snapshot snapshot, HeapTuple heapTuple, bool *all_dead, bool first_call)
Definition: heapam.c:1984
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
int Buffer
Definition: buf.h:23
bool heap_hot_search_buffer ( ItemPointer  tid,
Relation  relation,
Buffer  buffer,
Snapshot  snapshot,
HeapTuple  heapTuple,
bool all_dead,
bool  first_call 
)

Definition at line 1984 of file heapam.c.

References Assert, BufferGetBlockNumber(), BufferGetPage, CheckForSerializableConflictOut(), HeapTupleHeaderGetUpdateXid, HeapTupleHeaderGetXmin, HeapTupleIsHeapOnly, HeapTupleIsHotUpdated, HeapTupleIsSurelyDead(), HeapTupleSatisfiesVisibility, InvalidTransactionId, ItemIdGetLength, ItemIdGetRedirect, ItemIdIsNormal, ItemIdIsRedirected, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, ItemPointerSet, ItemPointerSetOffsetNumber, PageGetItem, PageGetItemId, PageGetMaxOffsetNumber, PredicateLockTuple(), RecentGlobalXmin, RelationGetRelid, skip(), HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, TransactionIdEquals, and TransactionIdIsValid.

Referenced by bitgetpage(), heap_hot_search(), and index_fetch_heap().

1987 {
1988  Page dp = (Page) BufferGetPage(buffer);
1989  TransactionId prev_xmax = InvalidTransactionId;
1990  OffsetNumber offnum;
1991  bool at_chain_start;
1992  bool valid;
1993  bool skip;
1994 
1995  /* If this is not the first call, previous call returned a (live!) tuple */
1996  if (all_dead)
1997  *all_dead = first_call;
1998 
2000 
2002  offnum = ItemPointerGetOffsetNumber(tid);
2003  at_chain_start = first_call;
2004  skip = !first_call;
2005 
2006  heapTuple->t_self = *tid;
2007 
2008  /* Scan through possible multiple members of HOT-chain */
2009  for (;;)
2010  {
2011  ItemId lp;
2012 
2013  /* check for bogus TID */
2014  if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(dp))
2015  break;
2016 
2017  lp = PageGetItemId(dp, offnum);
2018 
2019  /* check for unused, dead, or redirected items */
2020  if (!ItemIdIsNormal(lp))
2021  {
2022  /* We should only see a redirect at start of chain */
2023  if (ItemIdIsRedirected(lp) && at_chain_start)
2024  {
2025  /* Follow the redirect */
2026  offnum = ItemIdGetRedirect(lp);
2027  at_chain_start = false;
2028  continue;
2029  }
2030  /* else must be end of chain */
2031  break;
2032  }
2033 
2034  heapTuple->t_data = (HeapTupleHeader) PageGetItem(dp, lp);
2035  heapTuple->t_len = ItemIdGetLength(lp);
2036  heapTuple->t_tableOid = RelationGetRelid(relation);
2037  ItemPointerSetOffsetNumber(&heapTuple->t_self, offnum);
2038 
2039  /*
2040  * Shouldn't see a HEAP_ONLY tuple at chain start.
2041  */
2042  if (at_chain_start && HeapTupleIsHeapOnly(heapTuple))
2043  break;
2044 
2045  /*
2046  * The xmin should match the previous xmax value, else chain is
2047  * broken.
2048  */
2049  if (TransactionIdIsValid(prev_xmax) &&
2050  !TransactionIdEquals(prev_xmax,
2051  HeapTupleHeaderGetXmin(heapTuple->t_data)))
2052  break;
2053 
2054  /*
2055  * When first_call is true (and thus, skip is initially false) we'll
2056  * return the first tuple we find. But on later passes, heapTuple
2057  * will initially be pointing to the tuple we returned last time.
2058  * Returning it again would be incorrect (and would loop forever), so
2059  * we skip it and return the next match we find.
2060  */
2061  if (!skip)
2062  {
2063  /*
2064  * For the benefit of logical decoding, have t_self point at the
2065  * element of the HOT chain we're currently investigating instead
2066  * of the root tuple of the HOT chain. This is important because
2067  * the *Satisfies routine for historical mvcc snapshots needs the
2068  * correct tid to decide about the visibility in some cases.
2069  */
2070  ItemPointerSet(&(heapTuple->t_self), BufferGetBlockNumber(buffer), offnum);
2071 
2072  /* If it's visible per the snapshot, we must return it */
2073  valid = HeapTupleSatisfiesVisibility(heapTuple, snapshot, buffer);
2074  CheckForSerializableConflictOut(valid, relation, heapTuple,
2075  buffer, snapshot);
2076  /* reset to original, non-redirected, tid */
2077  heapTuple->t_self = *tid;
2078 
2079  if (valid)
2080  {
2081  ItemPointerSetOffsetNumber(tid, offnum);
2082  PredicateLockTuple(relation, heapTuple, snapshot);
2083  if (all_dead)
2084  *all_dead = false;
2085  return true;
2086  }
2087  }
2088  skip = false;
2089 
2090  /*
2091  * If we can't see it, maybe no one else can either. At caller
2092  * request, check whether all chain members are dead to all
2093  * transactions.
2094  */
2095  if (all_dead && *all_dead &&
2097  *all_dead = false;
2098 
2099  /*
2100  * Check to see if HOT chain continues past this tuple; if so fetch
2101  * the next offnum and loop around.
2102  */
2103  if (HeapTupleIsHotUpdated(heapTuple))
2104  {
2107  offnum = ItemPointerGetOffsetNumber(&heapTuple->t_data->t_ctid);
2108  at_chain_start = false;
2109  prev_xmax = HeapTupleHeaderGetUpdateXid(heapTuple->t_data);
2110  }
2111  else
2112  break; /* end of chain */
2113  }
2114 
2115  return false;
2116 }
#define HeapTupleHeaderGetUpdateXid(tup)
Definition: htup_details.h:359
static void skip(struct vars *v)
Definition: regc_lex.c:1109
#define ItemIdIsRedirected(itemId)
Definition: itemid.h:105
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
uint32 TransactionId
Definition: c.h:393
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define ItemIdGetRedirect(itemId)
Definition: itemid.h:77
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
void CheckForSerializableConflictOut(bool visible, Relation relation, HeapTuple tuple, Buffer buffer, Snapshot snapshot)
Definition: predicate.c:3862
bool HeapTupleIsSurelyDead(HeapTuple htup, TransactionId OldestXmin)
Definition: tqual.c:1409
#define HeapTupleSatisfiesVisibility(tuple, snapshot, buffer)
Definition: tqual.h:45
uint16 OffsetNumber
Definition: off.h:24
HeapTupleHeader t_data
Definition: htup.h:67
#define HeapTupleIsHotUpdated(tuple)
Definition: htup_details.h:677
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
ItemPointerData t_ctid
Definition: htup_details.h:150
ItemPointerData t_self
Definition: htup.h:65
uint32 t_len
Definition: htup.h:64
TransactionId RecentGlobalXmin
Definition: snapmgr.c:166
#define InvalidTransactionId
Definition: transam.h:31
Oid t_tableOid
Definition: htup.h:66
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
#define HeapTupleIsHeapOnly(tuple)
Definition: htup_details.h:686
#define Assert(condition)
Definition: c.h:670
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
#define HeapTupleHeaderGetXmin(tup)
Definition: htup_details.h:307
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
void PredicateLockTuple(Relation relation, HeapTuple tuple, Snapshot snapshot)
Definition: predicate.c:2460
#define ItemPointerSetOffsetNumber(pointer, offsetNumber)
Definition: itemptr.h:107
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2588
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
#define TransactionIdIsValid(xid)
Definition: transam.h:41
#define RelationGetRelid(relation)
Definition: rel.h:413
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
#define ItemPointerSet(pointer, blockNumber, offNum)
Definition: itemptr.h:86
void heap_inplace_update ( Relation  relation,
HeapTuple  tuple 
)

Definition at line 6233 of file heapam.c.

References BUFFER_LOCK_EXCLUSIVE, BufferGetPage, CacheInvalidateHeapTuple(), elog, END_CRIT_SECTION, ereport, errcode(), errmsg(), ERROR, IsBootstrapProcessingMode, IsInParallelMode(), ItemIdGetLength, ItemIdIsNormal, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, LockBuffer(), MarkBufferDirty(), NULL, xl_heap_inplace::offnum, PageGetItem, PageGetItemId, PageGetMaxOffsetNumber, PageSetLSN, ReadBuffer(), REGBUF_STANDARD, RelationNeedsWAL, SizeOfHeapInplace, START_CRIT_SECTION, HeapTupleData::t_data, HeapTupleHeaderData::t_hoff, HeapTupleData::t_len, HeapTupleData::t_self, UnlockReleaseBuffer(), XLOG_HEAP_INPLACE, XLogBeginInsert(), XLogInsert(), XLogRegisterBufData(), XLogRegisterBuffer(), and XLogRegisterData().

Referenced by create_toast_table(), index_set_state_flags(), index_update_stats(), vac_update_datfrozenxid(), and vac_update_relstats().

6234 {
6235  Buffer buffer;
6236  Page page;
6237  OffsetNumber offnum;
6238  ItemId lp = NULL;
6239  HeapTupleHeader htup;
6240  uint32 oldlen;
6241  uint32 newlen;
6242 
6243  /*
6244  * For now, parallel operations are required to be strictly read-only.
6245  * Unlike a regular update, this should never create a combo CID, so it
6246  * might be possible to relax this restriction, but not without more
6247  * thought and testing. It's not clear that it would be useful, anyway.
6248  */
6249  if (IsInParallelMode())
6250  ereport(ERROR,
6251  (errcode(ERRCODE_INVALID_TRANSACTION_STATE),
6252  errmsg("cannot update tuples during a parallel operation")));
6253 
6254  buffer = ReadBuffer(relation, ItemPointerGetBlockNumber(&(tuple->t_self)));
6256  page = (Page) BufferGetPage(buffer);
6257 
6258  offnum = ItemPointerGetOffsetNumber(&(tuple->t_self));
6259  if (PageGetMaxOffsetNumber(page) >= offnum)
6260  lp = PageGetItemId(page, offnum);
6261 
6262  if (PageGetMaxOffsetNumber(page) < offnum || !ItemIdIsNormal(lp))
6263  elog(ERROR, "invalid lp");
6264 
6265  htup = (HeapTupleHeader) PageGetItem(page, lp);
6266 
6267  oldlen = ItemIdGetLength(lp) - htup->t_hoff;
6268  newlen = tuple->t_len - tuple->t_data->t_hoff;
6269  if (oldlen != newlen || htup->t_hoff != tuple->t_data->t_hoff)
6270  elog(ERROR, "wrong tuple length");
6271 
6272  /* NO EREPORT(ERROR) from here till changes are logged */
6274 
6275  memcpy((char *) htup + htup->t_hoff,
6276  (char *) tuple->t_data + tuple->t_data->t_hoff,
6277  newlen);
6278 
6279  MarkBufferDirty(buffer);
6280 
6281  /* XLOG stuff */
6282  if (RelationNeedsWAL(relation))
6283  {
6284  xl_heap_inplace xlrec;
6285  XLogRecPtr recptr;
6286 
6287  xlrec.offnum = ItemPointerGetOffsetNumber(&tuple->t_self);
6288 
6289  XLogBeginInsert();
6290  XLogRegisterData((char *) &xlrec, SizeOfHeapInplace);
6291 
6292  XLogRegisterBuffer(0, buffer, REGBUF_STANDARD);
6293  XLogRegisterBufData(0, (char *) htup + htup->t_hoff, newlen);
6294 
6295  /* inplace updates aren't decoded atm, don't log the origin */
6296 
6297  recptr = XLogInsert(RM_HEAP_ID, XLOG_HEAP_INPLACE);
6298 
6299  PageSetLSN(page, recptr);
6300  }
6301 
6302  END_CRIT_SECTION();
6303 
6304  UnlockReleaseBuffer(buffer);
6305 
6306  /*
6307  * Send out shared cache inval if necessary. Note that because we only
6308  * pass the new version of the tuple, this mustn't be used for any
6309  * operations that could change catcache lookup keys. But we aren't
6310  * bothering with index updates either, so that's true a fortiori.
6311  */
6313  CacheInvalidateHeapTuple(relation, tuple, NULL);
6314 }
void XLogRegisterBufData(uint8 block_id, char *data, int len)
Definition: xloginsert.c:361
void CacheInvalidateHeapTuple(Relation relation, HeapTuple tuple, HeapTuple newtuple)
Definition: inval.c:1085
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
#define SizeOfHeapInplace
Definition: heapam_xlog.h:286
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
int errcode(int sqlerrcode)
Definition: elog.c:575
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
uint16 OffsetNumber
Definition: off.h:24
HeapTupleHeader t_data
Definition: htup.h:67
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
bool IsInParallelMode(void)
Definition: xact.c:912
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3315
#define ERROR
Definition: elog.h:43
ItemPointerData t_self
Definition: htup.h:65
uint32 t_len
Definition: htup.h:64
#define REGBUF_STANDARD
Definition: xloginsert.h:35
unsigned int uint32
Definition: c.h:265
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define ereport(elevel, rest)
Definition: elog.h:122
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
OffsetNumber offnum
Definition: heapam_xlog.h:282
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define NULL
Definition: c.h:226
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define XLOG_HEAP_INPLACE
Definition: heapam_xlog.h:39
#define RelationNeedsWAL(relation)
Definition: rel.h:502
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:365
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define elog
Definition: elog.h:219
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
Oid heap_insert ( Relation  relation,
HeapTuple  tup,
CommandId  cid,
int  options,
BulkInsertState  bistate 
)

Definition at line 2383 of file heapam.c.

References Assert, BufferGetBlockNumber(), BufferGetPage, CacheInvalidateHeapTuple(), CheckForSerializableConflictIn(), END_CRIT_SECTION, FirstOffsetNumber, xl_heap_insert::flags, GetCurrentTransactionId(), heap_freetuple(), HEAP_INSERT_SKIP_WAL, HEAP_INSERT_SPECULATIVE, heap_prepare_insert(), HeapTupleGetOid, InvalidBuffer, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, log_heap_new_cid(), MarkBufferDirty(), xl_heap_insert::offnum, PageClearAllVisible, PageGetMaxOffsetNumber, PageIsAllVisible, PageSetLSN, pgstat_count_heap_insert(), REGBUF_KEEP_DATA, REGBUF_STANDARD, REGBUF_WILL_INIT, RelationGetBufferForTuple(), RelationIsAccessibleInLogicalDecoding, RelationIsLogicallyLogged, RelationNeedsWAL, RelationPutHeapTuple(), ReleaseBuffer(), SizeOfHeapHeader, SizeOfHeapInsert, SizeofHeapTupleHeader, START_CRIT_SECTION, HeapTupleData::t_data, xl_heap_header::t_hoff, HeapTupleHeaderData::t_hoff, xl_heap_header::t_infomask, HeapTupleHeaderData::t_infomask, xl_heap_header::t_infomask2, HeapTupleHeaderData::t_infomask2, HeapTupleData::t_len, HeapTupleData::t_self, UnlockReleaseBuffer(), visibilitymap_clear(), VISIBILITYMAP_VALID_BITS, XLH_INSERT_ALL_VISIBLE_CLEARED, XLH_INSERT_CONTAINS_NEW_TUPLE, XLH_INSERT_IS_SPECULATIVE, XLOG_HEAP_INIT_PAGE, XLOG_HEAP_INSERT, XLOG_INCLUDE_ORIGIN, XLogBeginInsert(), XLogInsert(), XLogRegisterBufData(), XLogRegisterBuffer(), XLogRegisterData(), and XLogSetRecordFlags().

Referenced by ATRewriteTable(), CopyFrom(), ExecInsert(), intorel_receive(), simple_heap_insert(), toast_save_datum(), and transientrel_receive().

2385 {
2387  HeapTuple heaptup;
2388  Buffer buffer;
2389  Buffer vmbuffer = InvalidBuffer;
2390  bool all_visible_cleared = false;
2391 
2392  /*
2393  * Fill in tuple header fields, assign an OID, and toast the tuple if
2394  * necessary.
2395  *
2396  * Note: below this point, heaptup is the data we actually intend to store
2397  * into the relation; tup is the caller's original untoasted data.
2398  */
2399  heaptup = heap_prepare_insert(relation, tup, xid, cid, options);
2400 
2401  /*
2402  * Find buffer to insert this tuple into. If the page is all visible,
2403  * this will also pin the requisite visibility map page.
2404  */
2405  buffer = RelationGetBufferForTuple(relation, heaptup->t_len,
2406  InvalidBuffer, options, bistate,
2407  &vmbuffer, NULL);
2408 
2409  /*
2410  * We're about to do the actual insert -- but check for conflict first, to
2411  * avoid possibly having to roll back work we've just done.
2412  *
2413  * This is safe without a recheck as long as there is no possibility of
2414  * another process scanning the page between this check and the insert
2415  * being visible to the scan (i.e., an exclusive buffer content lock is
2416  * continuously held from this point until the tuple insert is visible).
2417  *
2418  * For a heap insert, we only need to check for table-level SSI locks. Our
2419  * new tuple can't possibly conflict with existing tuple locks, and heap
2420  * page locks are only consolidated versions of tuple locks; they do not
2421  * lock "gaps" as index page locks do. So we don't need to specify a
2422  * buffer when making the call, which makes for a faster check.
2423  */
2425 
2426  /* NO EREPORT(ERROR) from here till changes are logged */
2428 
2429  RelationPutHeapTuple(relation, buffer, heaptup,
2430  (options & HEAP_INSERT_SPECULATIVE) != 0);
2431 
2432  if (PageIsAllVisible(BufferGetPage(buffer)))
2433  {
2434  all_visible_cleared = true;
2436  visibilitymap_clear(relation,
2437  ItemPointerGetBlockNumber(&(heaptup->t_self)),
2438  vmbuffer, VISIBILITYMAP_VALID_BITS);
2439  }
2440 
2441  /*
2442  * XXX Should we set PageSetPrunable on this page ?
2443  *
2444  * The inserting transaction may eventually abort thus making this tuple
2445  * DEAD and hence available for pruning. Though we don't want to optimize
2446  * for aborts, if no other tuple in this page is UPDATEd/DELETEd, the
2447  * aborted tuple will never be pruned until next vacuum is triggered.
2448  *
2449  * If you do add PageSetPrunable here, add it in heap_xlog_insert too.
2450  */
2451 
2452  MarkBufferDirty(buffer);
2453 
2454  /* XLOG stuff */
2455  if (!(options & HEAP_INSERT_SKIP_WAL) && RelationNeedsWAL(relation))
2456  {
2457  xl_heap_insert xlrec;
2458  xl_heap_header xlhdr;
2459  XLogRecPtr recptr;
2460  Page page = BufferGetPage(buffer);
2461  uint8 info = XLOG_HEAP_INSERT;
2462  int bufflags = 0;
2463 
2464  /*
2465  * If this is a catalog, we need to transmit combocids to properly
2466  * decode, so log that as well.
2467  */
2469  log_heap_new_cid(relation, heaptup);
2470 
2471  /*
2472  * If this is the single and first tuple on page, we can reinit the
2473  * page instead of restoring the whole thing. Set flag, and hide
2474  * buffer references from XLogInsert.
2475  */
2476  if (ItemPointerGetOffsetNumber(&(heaptup->t_self)) == FirstOffsetNumber &&
2478  {
2479  info |= XLOG_HEAP_INIT_PAGE;
2480  bufflags |= REGBUF_WILL_INIT;
2481  }
2482 
2483  xlrec.offnum = ItemPointerGetOffsetNumber(&heaptup->t_self);
2484  xlrec.flags = 0;
2485  if (all_visible_cleared)
2490 
2491  /*
2492  * For logical decoding, we need the tuple even if we're doing a full
2493  * page write, so make sure it's included even if we take a full-page
2494  * image. (XXX We could alternatively store a pointer into the FPW).
2495  */
2496  if (RelationIsLogicallyLogged(relation))
2497  {
2499  bufflags |= REGBUF_KEEP_DATA;
2500  }
2501 
2502  XLogBeginInsert();
2503  XLogRegisterData((char *) &xlrec, SizeOfHeapInsert);
2504 
2505  xlhdr.t_infomask2 = heaptup->t_data->t_infomask2;
2506  xlhdr.t_infomask = heaptup->t_data->t_infomask;
2507  xlhdr.t_hoff = heaptup->t_data->t_hoff;
2508 
2509  /*
2510  * note we mark xlhdr as belonging to buffer; if XLogInsert decides to
2511  * write the whole page to the xlog, we don't need to store
2512  * xl_heap_header in the xlog.
2513  */
2514  XLogRegisterBuffer(0, buffer, REGBUF_STANDARD | bufflags);
2515  XLogRegisterBufData(0, (char *) &xlhdr, SizeOfHeapHeader);
2516  /* PG73FORMAT: write bitmap [+ padding] [+ oid] + data */
2518  (char *) heaptup->t_data + SizeofHeapTupleHeader,
2519  heaptup->t_len - SizeofHeapTupleHeader);
2520 
2521  /* filtering by origin on a row level is much more efficient */
2523 
2524  recptr = XLogInsert(RM_HEAP_ID, info);
2525 
2526  PageSetLSN(page, recptr);
2527  }
2528 
2529  END_CRIT_SECTION();
2530 
2531  UnlockReleaseBuffer(buffer);
2532  if (vmbuffer != InvalidBuffer)
2533  ReleaseBuffer(vmbuffer);
2534 
2535  /*
2536  * If tuple is cachable, mark it for invalidation from the caches in case
2537  * we abort. Note it is OK to do this after releasing the buffer, because
2538  * the heaptup data structure is all in local memory, not in the shared
2539  * buffer.
2540  */
2541  CacheInvalidateHeapTuple(relation, heaptup, NULL);
2542 
2543  /* Note: speculative insertions are counted too, even if aborted later */
2544  pgstat_count_heap_insert(relation, 1);
2545 
2546  /*
2547  * If heaptup is a private copy, release it. Don't forget to copy t_self
2548  * back to the caller's image, too.
2549  */
2550  if (heaptup != tup)
2551  {
2552  tup->t_self = heaptup->t_self;
2553  heap_freetuple(heaptup);
2554  }
2555 
2556  return HeapTupleGetOid(tup);
2557 }
void XLogRegisterBufData(uint8 block_id, char *data, int len)
Definition: xloginsert.c:361
#define SizeofHeapTupleHeader
Definition: htup_details.h:170
#define XLOG_HEAP_INSERT
Definition: heapam_xlog.h:32
static XLogRecPtr log_heap_new_cid(Relation relation, HeapTuple tup)
Definition: heapam.c:7732
void CacheInvalidateHeapTuple(Relation relation, HeapTuple tuple, HeapTuple newtuple)
Definition: inval.c:1085
static HeapTuple heap_prepare_insert(Relation relation, HeapTuple tup, TransactionId xid, CommandId cid, int options)
Definition: heapam.c:2567
#define PageIsAllVisible(page)
Definition: bufpage.h:382
uint32 TransactionId
Definition: c.h:393
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
unsigned char uint8
Definition: c.h:263
#define XLH_INSERT_IS_SPECULATIVE
Definition: heapam_xlog.h:68
#define InvalidBuffer
Definition: buf.h:25
#define REGBUF_WILL_INIT
Definition: xloginsert.h:32
uint16 t_infomask2
Definition: heapam_xlog.h:122
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
#define XLOG_INCLUDE_ORIGIN
Definition: xlog.h:192
#define HEAP_INSERT_SKIP_WAL
Definition: heapam.h:28
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
#define RelationIsLogicallyLogged(relation)
Definition: rel.h:572
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1374
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
void RelationPutHeapTuple(Relation relation, Buffer buffer, HeapTuple tuple, bool token)
Definition: hio.c:36
void CheckForSerializableConflictIn(Relation relation, HeapTuple tuple, Buffer buffer)
Definition: predicate.c:4243
#define XLOG_HEAP_INIT_PAGE
Definition: heapam_xlog.h:46
#define HEAP_INSERT_SPECULATIVE
Definition: heapam.h:31
#define VISIBILITYMAP_VALID_BITS
Definition: visibilitymap.h:28
HeapTupleHeader t_data
Definition: htup.h:67
bool visibilitymap_clear(Relation rel, BlockNumber heapBlk, Buffer buf, uint8 flags)
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3315
#define XLH_INSERT_CONTAINS_NEW_TUPLE
Definition: heapam_xlog.h:69
ItemPointerData t_self
Definition: htup.h:65
TransactionId GetCurrentTransactionId(void)
Definition: xact.c:416
uint32 t_len
Definition: htup.h:64
#define FirstOffsetNumber
Definition: off.h:27
#define REGBUF_STANDARD
Definition: xloginsert.h:35
Buffer RelationGetBufferForTuple(Relation relation, Size len, Buffer otherBuffer, int options, BulkInsertState bistate, Buffer *vmbuffer, Buffer *vmbuffer_other)
Definition: hio.c:297
void XLogSetRecordFlags(uint8 flags)
Definition: xloginsert.c:397
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
#define RelationIsAccessibleInLogicalDecoding(relation)
Definition: rel.h:556
#define REGBUF_KEEP_DATA
Definition: xloginsert.h:38
#define PageClearAllVisible(page)
Definition: bufpage.h:386
#define NULL
Definition: c.h:226
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:670
uint16 t_infomask
Definition: heapam_xlog.h:123
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define RelationNeedsWAL(relation)
Definition: rel.h:502
#define SizeOfHeapInsert
Definition: heapam_xlog.h:138
#define XLH_INSERT_ALL_VISIBLE_CLEARED
Definition: heapam_xlog.h:66
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2588
void pgstat_count_heap_insert(Relation rel, int n)
Definition: pgstat.c:1805
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
#define HeapTupleGetOid(tuple)
Definition: htup_details.h:695
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
OffsetNumber offnum
Definition: heapam_xlog.h:132
#define SizeOfHeapHeader
Definition: heapam_xlog.h:127
Pointer Page
Definition: bufpage.h:74
HTSU_Result heap_lock_tuple ( Relation  relation,
HeapTuple  tuple,
CommandId  cid,
LockTupleMode  mode,
LockWaitPolicy  wait_policy,
bool  follow_update,
Buffer buffer,
HeapUpdateFailureData hufd 
)

Definition at line 4578 of file heapam.c.

References Assert, BUFFER_LOCK_EXCLUSIVE, BUFFER_LOCK_UNLOCK, BufferGetPage, BufferIsValid, HeapUpdateFailureData::cmax, compute_infobits(), compute_new_xmax_infomask(), ConditionalMultiXactIdWait(), ConditionalXactLockTableWait(), HeapUpdateFailureData::ctid, DoesMultiXactIdConflict(), elog, END_CRIT_SECTION, ereport, errcode(), errmsg(), ERROR, xl_heap_lock::flags, get_mxact_status_for_lock(), GetCurrentTransactionId(), GetMultiXactIdMembers(), heap_acquire_tuplock(), HEAP_KEYS_UPDATED, heap_lock_updated_tuple(), HEAP_XMAX_BITS, HEAP_XMAX_INVALID, HEAP_XMAX_IS_EXCL_LOCKED, HEAP_XMAX_IS_KEYSHR_LOCKED, HEAP_XMAX_IS_LOCKED_ONLY, HEAP_XMAX_IS_MULTI, HEAP_XMAX_IS_SHR_LOCKED, HeapTupleBeingUpdated, HeapTupleHeaderClearHotUpdated, HeapTupleHeaderGetCmax(), HeapTupleHeaderGetRawXmax, HeapTupleHeaderGetUpdateXid, HeapTupleHeaderIsOnlyLocked(), HeapTupleHeaderSetXmax, HeapTupleInvisible, HeapTupleMayBeUpdated, HeapTupleSatisfiesUpdate(), HeapTupleSelfUpdated, HeapTupleUpdated, HeapTupleWouldBlock, i, xl_heap_lock::infobits_set, InvalidBuffer, InvalidCommandId, ItemIdGetLength, ItemIdIsNormal, ItemPointerCopy, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, LockBuffer(), xl_heap_lock::locking_xid, LockTupleExclusive, LockTupleKeyShare, LockTupleNoKeyExclusive, LockTupleShare, LockWaitBlock, LockWaitError, LockWaitSkip, MarkBufferDirty(), MultiXactIdSetOldestMember(), MultiXactIdWait(), MultiXactStatusNoKeyUpdate, xl_heap_lock::offnum, PageGetItem, PageGetItemId, PageIsAllVisible, PageSetLSN, pfree(), ReadBuffer(), REGBUF_STANDARD, RelationGetRelationName, RelationGetRelid, RelationNeedsWAL, ReleaseBuffer(), SizeOfHeapLock, START_CRIT_SECTION, status(), HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleHeaderData::t_infomask, HeapTupleHeaderData::t_infomask2, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, TransactionIdEquals, TransactionIdIsCurrentTransactionId(), TUPLOCK_from_mxstatus, UnlockTupleTuplock, UpdateXmaxHintBits(), VISIBILITYMAP_ALL_FROZEN, visibilitymap_clear(), visibilitymap_pin(), XactLockTableWait(), XLH_LOCK_ALL_FROZEN_CLEARED, XLOG_HEAP_LOCK, XLogBeginInsert(), XLogInsert(), XLogRegisterBuffer(), XLogRegisterData(), XLTW_Lock, HeapUpdateFailureData::xmax, and xmax_infomask_changed().

Referenced by EvalPlanQualFetch(), ExecLockRows(), ExecOnConflictUpdate(), GetTupleForTrigger(), RelationFindReplTupleByIndex(), and RelationFindReplTupleSeq().

4582 {
4583  HTSU_Result result;
4584  ItemPointer tid = &(tuple->t_self);
4585  ItemId lp;
4586  Page page;
4587  Buffer vmbuffer = InvalidBuffer;
4588  BlockNumber block;
4589  TransactionId xid,
4590  xmax;
4591  uint16 old_infomask,
4592  new_infomask,
4593  new_infomask2;
4594  bool first_time = true;
4595  bool have_tuple_lock = false;
4596  bool cleared_all_frozen = false;
4597 
4598  *buffer = ReadBuffer(relation, ItemPointerGetBlockNumber(tid));
4599  block = ItemPointerGetBlockNumber(tid);
4600 
4601  /*
4602  * Before locking the buffer, pin the visibility map page if it appears to
4603  * be necessary. Since we haven't got the lock yet, someone else might be
4604  * in the middle of changing this, so we'll need to recheck after we have
4605  * the lock.
4606  */
4607  if (PageIsAllVisible(BufferGetPage(*buffer)))
4608  visibilitymap_pin(relation, block, &vmbuffer);
4609 
4611 
4612  page = BufferGetPage(*buffer);
4613  lp = PageGetItemId(page, ItemPointerGetOffsetNumber(tid));
4614  Assert(ItemIdIsNormal(lp));
4615 
4616  tuple->t_data = (HeapTupleHeader) PageGetItem(page, lp);
4617  tuple->t_len = ItemIdGetLength(lp);
4618  tuple->t_tableOid = RelationGetRelid(relation);
4619 
4620 l3:
4621  result = HeapTupleSatisfiesUpdate(tuple, cid, *buffer);
4622 
4623  if (result == HeapTupleInvisible)
4624  {
4625  /*
4626  * This is possible, but only when locking a tuple for ON CONFLICT
4627  * UPDATE. We return this value here rather than throwing an error in
4628  * order to give that case the opportunity to throw a more specific
4629  * error.
4630  */
4631  result = HeapTupleInvisible;
4632  goto out_locked;
4633  }
4634  else if (result == HeapTupleBeingUpdated || result == HeapTupleUpdated)
4635  {
4636  TransactionId xwait;
4637  uint16 infomask;
4638  uint16 infomask2;
4639  bool require_sleep;
4640  ItemPointerData t_ctid;
4641 
4642  /* must copy state data before unlocking buffer */
4643  xwait = HeapTupleHeaderGetRawXmax(tuple->t_data);
4644  infomask = tuple->t_data->t_infomask;
4645  infomask2 = tuple->t_data->t_infomask2;
4646  ItemPointerCopy(&tuple->t_data->t_ctid, &t_ctid);
4647 
4648  LockBuffer(*buffer, BUFFER_LOCK_UNLOCK);
4649 
4650  /*
4651  * If any subtransaction of the current top transaction already holds
4652  * a lock as strong as or stronger than what we're requesting, we
4653  * effectively hold the desired lock already. We *must* succeed
4654  * without trying to take the tuple lock, else we will deadlock
4655  * against anyone wanting to acquire a stronger lock.
4656  *
4657  * Note we only do this the first time we loop on the HTSU result;
4658  * there is no point in testing in subsequent passes, because
4659  * evidently our own transaction cannot have acquired a new lock after
4660  * the first time we checked.
4661  */
4662  if (first_time)
4663  {
4664  first_time = false;
4665 
4666  if (infomask & HEAP_XMAX_IS_MULTI)
4667  {
4668  int i;
4669  int nmembers;
4670  MultiXactMember *members;
4671 
4672  /*
4673  * We don't need to allow old multixacts here; if that had
4674  * been the case, HeapTupleSatisfiesUpdate would have returned
4675  * MayBeUpdated and we wouldn't be here.
4676  */
4677  nmembers =
4678  GetMultiXactIdMembers(xwait, &members, false,
4679  HEAP_XMAX_IS_LOCKED_ONLY(infomask));
4680 
4681  for (i = 0; i < nmembers; i++)
4682  {
4683  /* only consider members of our own transaction */
4684  if (!TransactionIdIsCurrentTransactionId(members[i].xid))
4685  continue;
4686 
4687  if (TUPLOCK_from_mxstatus(members[i].status) >= mode)
4688  {
4689  pfree(members);
4690  result = HeapTupleMayBeUpdated;
4691  goto out_unlocked;
4692  }
4693  }
4694 
4695  if (members)
4696  pfree(members);
4697  }
4698  else if (TransactionIdIsCurrentTransactionId(xwait))
4699  {
4700  switch (mode)
4701  {
4702  case LockTupleKeyShare:
4703  Assert(HEAP_XMAX_IS_KEYSHR_LOCKED(infomask) ||
4704  HEAP_XMAX_IS_SHR_LOCKED(infomask) ||
4705  HEAP_XMAX_IS_EXCL_LOCKED(infomask));
4706  result = HeapTupleMayBeUpdated;
4707  goto out_unlocked;
4708  case LockTupleShare:
4709  if (HEAP_XMAX_IS_SHR_LOCKED(infomask) ||
4710  HEAP_XMAX_IS_EXCL_LOCKED(infomask))
4711  {
4712  result = HeapTupleMayBeUpdated;
4713  goto out_unlocked;
4714  }
4715  break;
4717  if (HEAP_XMAX_IS_EXCL_LOCKED(infomask))
4718  {
4719  result = HeapTupleMayBeUpdated;
4720  goto out_unlocked;
4721  }
4722  break;
4723  case LockTupleExclusive:
4724  if (HEAP_XMAX_IS_EXCL_LOCKED(infomask) &&
4725  infomask2 & HEAP_KEYS_UPDATED)
4726  {
4727  result = HeapTupleMayBeUpdated;
4728  goto out_unlocked;
4729  }
4730  break;
4731  }
4732  }
4733  }
4734 
4735  /*
4736  * Initially assume that we will have to wait for the locking
4737  * transaction(s) to finish. We check various cases below in which
4738  * this can be turned off.
4739  */
4740  require_sleep = true;
4741  if (mode == LockTupleKeyShare)
4742  {
4743  /*
4744  * If we're requesting KeyShare, and there's no update present, we
4745  * don't need to wait. Even if there is an update, we can still
4746  * continue if the key hasn't been modified.
4747  *
4748  * However, if there are updates, we need to walk the update chain
4749  * to mark future versions of the row as locked, too. That way,
4750  * if somebody deletes that future version, we're protected
4751  * against the key going away. This locking of future versions
4752  * could block momentarily, if a concurrent transaction is
4753  * deleting a key; or it could return a value to the effect that
4754  * the transaction deleting the key has already committed. So we
4755  * do this before re-locking the buffer; otherwise this would be
4756  * prone to deadlocks.
4757  *
4758  * Note that the TID we're locking was grabbed before we unlocked
4759  * the buffer. For it to change while we're not looking, the
4760  * other properties we're testing for below after re-locking the
4761  * buffer would also change, in which case we would restart this
4762  * loop above.
4763  */
4764  if (!(infomask2 & HEAP_KEYS_UPDATED))
4765  {
4766  bool updated;
4767 
4768  updated = !HEAP_XMAX_IS_LOCKED_ONLY(infomask);
4769 
4770  /*
4771  * If there are updates, follow the update chain; bail out if
4772  * that cannot be done.
4773  */
4774  if (follow_updates && updated)
4775  {
4776  HTSU_Result res;
4777 
4778  res = heap_lock_updated_tuple(relation, tuple, &t_ctid,
4780  mode);
4781  if (res != HeapTupleMayBeUpdated)
4782  {
4783  result = res;
4784  /* recovery code expects to have buffer lock held */
4786  goto failed;
4787  }
4788  }
4789 
4791 
4792  /*
4793  * Make sure it's still an appropriate lock, else start over.
4794  * Also, if it wasn't updated before we released the lock, but
4795  * is updated now, we start over too; the reason is that we
4796  * now need to follow the update chain to lock the new
4797  * versions.
4798  */
4799  if (!HeapTupleHeaderIsOnlyLocked(tuple->t_data) &&
4800  ((tuple->t_data->t_infomask2 & HEAP_KEYS_UPDATED) ||
4801  !updated))
4802  goto l3;
4803 
4804  /* Things look okay, so we can skip sleeping */
4805  require_sleep = false;
4806 
4807  /*
4808  * Note we allow Xmax to change here; other updaters/lockers
4809  * could have modified it before we grabbed the buffer lock.
4810  * However, this is not a problem, because with the recheck we
4811  * just did we ensure that they still don't conflict with the
4812  * lock we want.
4813  */
4814  }
4815  }
4816  else if (mode == LockTupleShare)
4817  {
4818  /*
4819  * If we're requesting Share, we can similarly avoid sleeping if
4820  * there's no update and no exclusive lock present.
4821  */
4822  if (HEAP_XMAX_IS_LOCKED_ONLY(infomask) &&
4823  !HEAP_XMAX_IS_EXCL_LOCKED(infomask))
4824  {
4826 
4827  /*
4828  * Make sure it's still an appropriate lock, else start over.
4829  * See above about allowing xmax to change.
4830  */
4831  if (!HEAP_XMAX_IS_LOCKED_ONLY(tuple->t_data->t_infomask) ||
4833  goto l3;
4834  require_sleep = false;
4835  }
4836  }
4837  else if (mode == LockTupleNoKeyExclusive)
4838  {
4839  /*
4840  * If we're requesting NoKeyExclusive, we might also be able to
4841  * avoid sleeping; just ensure that there no conflicting lock
4842  * already acquired.
4843  */
4844  if (infomask & HEAP_XMAX_IS_MULTI)
4845  {
4846  if (!DoesMultiXactIdConflict((MultiXactId) xwait, infomask,
4847  mode))
4848  {
4849  /*
4850  * No conflict, but if the xmax changed under us in the
4851  * meantime, start over.
4852  */
4854  if (xmax_infomask_changed(tuple->t_data->t_infomask, infomask) ||
4856  xwait))
4857  goto l3;
4858 
4859  /* otherwise, we're good */
4860  require_sleep = false;
4861  }
4862  }
4863  else if (HEAP_XMAX_IS_KEYSHR_LOCKED(infomask))
4864  {
4866 
4867  /* if the xmax changed in the meantime, start over */
4868  if (xmax_infomask_changed(tuple->t_data->t_infomask, infomask) ||
4871  xwait))
4872  goto l3;
4873  /* otherwise, we're good */
4874  require_sleep = false;
4875  }
4876  }
4877 
4878  /*
4879  * As a check independent from those above, we can also avoid sleeping
4880  * if the current transaction is the sole locker of the tuple. Note
4881  * that the strength of the lock already held is irrelevant; this is
4882  * not about recording the lock in Xmax (which will be done regardless
4883  * of this optimization, below). Also, note that the cases where we
4884  * hold a lock stronger than we are requesting are already handled
4885  * above by not doing anything.
4886  *
4887  * Note we only deal with the non-multixact case here; MultiXactIdWait
4888  * is well equipped to deal with this situation on its own.
4889  */
4890  if (require_sleep && !(infomask & HEAP_XMAX_IS_MULTI) &&
4892  {
4893  /* ... but if the xmax changed in the meantime, start over */
4895  if (xmax_infomask_changed(tuple->t_data->t_infomask, infomask) ||
4897  xwait))
4898  goto l3;
4900  require_sleep = false;
4901  }
4902 
4903  /*
4904  * Time to sleep on the other transaction/multixact, if necessary.
4905  *
4906  * If the other transaction is an update that's already committed,
4907  * then sleeping cannot possibly do any good: if we're required to
4908  * sleep, get out to raise an error instead.
4909  *
4910  * By here, we either have already acquired the buffer exclusive lock,
4911  * or we must wait for the locking transaction or multixact; so below
4912  * we ensure that we grab buffer lock after the sleep.
4913  */
4914  if (require_sleep && result == HeapTupleUpdated)
4915  {
4917  goto failed;
4918  }
4919  else if (require_sleep)
4920  {
4921  /*
4922  * Acquire tuple lock to establish our priority for the tuple, or
4923  * die trying. LockTuple will release us when we are next-in-line
4924  * for the tuple. We must do this even if we are share-locking.
4925  *
4926  * If we are forced to "start over" below, we keep the tuple lock;
4927  * this arranges that we stay at the head of the line while
4928  * rechecking tuple state.
4929  */
4930  if (!heap_acquire_tuplock(relation, tid, mode, wait_policy,
4931  &have_tuple_lock))
4932  {
4933  /*
4934  * This can only happen if wait_policy is Skip and the lock
4935  * couldn't be obtained.
4936  */
4937  result = HeapTupleWouldBlock;
4938  /* recovery code expects to have buffer lock held */
4940  goto failed;
4941  }
4942 
4943  if (infomask & HEAP_XMAX_IS_MULTI)
4944  {
4946 
4947  /* We only ever lock tuples, never update them */
4948  if (status >= MultiXactStatusNoKeyUpdate)
4949  elog(ERROR, "invalid lock mode in heap_lock_tuple");
4950 
4951  /* wait for multixact to end, or die trying */
4952  switch (wait_policy)
4953  {
4954  case LockWaitBlock:
4955  MultiXactIdWait((MultiXactId) xwait, status, infomask,
4956  relation, &tuple->t_self, XLTW_Lock, NULL);
4957  break;
4958  case LockWaitSkip:
4960  status, infomask, relation,
4961  NULL))
4962  {
4963  result = HeapTupleWouldBlock;
4964  /* recovery code expects to have buffer lock held */
4966  goto failed;
4967  }
4968  break;
4969  case LockWaitError:
4971  status, infomask, relation,
4972  NULL))
4973  ereport(ERROR,
4974  (errcode(ERRCODE_LOCK_NOT_AVAILABLE),
4975  errmsg("could not obtain lock on row in relation \"%s\"",
4976  RelationGetRelationName(relation))));
4977 
4978  break;
4979  }
4980 
4981  /*
4982  * Of course, the multixact might not be done here: if we're
4983  * requesting a light lock mode, other transactions with light
4984  * locks could still be alive, as well as locks owned by our
4985  * own xact or other subxacts of this backend. We need to
4986  * preserve the surviving MultiXact members. Note that it
4987  * isn't absolutely necessary in the latter case, but doing so
4988  * is simpler.
4989  */
4990  }
4991  else
4992  {
4993  /* wait for regular transaction to end, or die trying */
4994  switch (wait_policy)
4995  {
4996  case LockWaitBlock:
4997  XactLockTableWait(xwait, relation, &tuple->t_self,
4998  XLTW_Lock);
4999  break;
5000  case LockWaitSkip:
5001  if (!ConditionalXactLockTableWait(xwait))
5002  {
5003  result = HeapTupleWouldBlock;
5004  /* recovery code expects to have buffer lock held */
5006  goto failed;
5007  }
5008  break;
5009  case LockWaitError:
5010  if (!ConditionalXactLockTableWait(xwait))
5011  ereport(ERROR,
5012  (errcode(ERRCODE_LOCK_NOT_AVAILABLE),
5013  errmsg("could not obtain lock on row in relation \"%s\"",
5014  RelationGetRelationName(relation))));
5015  break;
5016  }
5017  }
5018 
5019  /* if there are updates, follow the update chain */
5020  if (follow_updates && !HEAP_XMAX_IS_LOCKED_ONLY(infomask))
5021  {
5022  HTSU_Result res;
5023 
5024  res = heap_lock_updated_tuple(relation, tuple, &t_ctid,
5026  mode);
5027  if (res != HeapTupleMayBeUpdated)
5028  {
5029  result = res;
5030  /* recovery code expects to have buffer lock held */
5032  goto failed;
5033  }
5034  }
5035 
5037 
5038  /*
5039  * xwait is done, but if xwait had just locked the tuple then some
5040  * other xact could update this tuple before we get to this point.
5041  * Check for xmax change, and start over if so.
5042  */
5043  if (xmax_infomask_changed(tuple->t_data->t_infomask, infomask) ||
5045  xwait))
5046  goto l3;
5047 
5048  if (!(infomask & HEAP_XMAX_IS_MULTI))
5049  {
5050  /*
5051  * Otherwise check if it committed or aborted. Note we cannot
5052  * be here if the tuple was only locked by somebody who didn't
5053  * conflict with us; that would have been handled above. So
5054  * that transaction must necessarily be gone by now. But
5055  * don't check for this in the multixact case, because some
5056  * locker transactions might still be running.
5057  */
5058  UpdateXmaxHintBits(tuple->t_data, *buffer, xwait);
5059  }
5060  }
5061 
5062  /* By here, we're certain that we hold buffer exclusive lock again */
5063 
5064  /*
5065  * We may lock if previous xmax aborted, or if it committed but only
5066  * locked the tuple without updating it; or if we didn't have to wait
5067  * at all for whatever reason.
5068  */
5069  if (!require_sleep ||
5070  (tuple->t_data->t_infomask & HEAP_XMAX_INVALID) ||
5073  result = HeapTupleMayBeUpdated;
5074  else
5075  result = HeapTupleUpdated;
5076  }
5077 
5078 failed:
5079  if (result != HeapTupleMayBeUpdated)
5080  {
5081  Assert(result == HeapTupleSelfUpdated || result == HeapTupleUpdated ||
5082  result == HeapTupleWouldBlock);
5083  Assert(!(tuple->t_data->t_infomask & HEAP_XMAX_INVALID));
5084  hufd->ctid = tuple->t_data->t_ctid;
5085  hufd->xmax = HeapTupleHeaderGetUpdateXid(tuple->t_data);
5086  if (result == HeapTupleSelfUpdated)
5087  hufd->cmax = HeapTupleHeaderGetCmax(tuple->t_data);
5088  else
5089  hufd->cmax = InvalidCommandId;
5090  goto out_locked;
5091  }
5092 
5093  /*
5094  * If we didn't pin the visibility map page and the page has become all
5095  * visible while we were busy locking the buffer, or during some
5096  * subsequent window during which we had it unlocked, we'll have to unlock
5097  * and re-lock, to avoid holding the buffer lock across I/O. That's a bit
5098  * unfortunate, especially since we'll now have to recheck whether the
5099  * tuple has been locked or updated under us, but hopefully it won't
5100  * happen very often.
5101  */
5102  if (vmbuffer == InvalidBuffer && PageIsAllVisible(page))
5103  {
5104  LockBuffer(*buffer, BUFFER_LOCK_UNLOCK);
5105  visibilitymap_pin(relation, block, &vmbuffer);
5107  goto l3;
5108  }
5109 
5110  xmax = HeapTupleHeaderGetRawXmax(tuple->t_data);
5111  old_infomask = tuple->t_data->t_infomask;
5112 
5113  /*
5114  * If this is the first possibly-multixact-able operation in the current
5115  * transaction, set my per-backend OldestMemberMXactId setting. We can be
5116  * certain that the transaction will never become a member of any older
5117  * MultiXactIds than that. (We have to do this even if we end up just
5118  * using our own TransactionId below, since some other backend could
5119  * incorporate our XID into a MultiXact immediately afterwards.)
5120  */
5122 
5123  /*
5124  * Compute the new xmax and infomask to store into the tuple. Note we do
5125  * not modify the tuple just yet, because that would leave it in the wrong
5126  * state if multixact.c elogs.
5127  */
5128  compute_new_xmax_infomask(xmax, old_infomask, tuple->t_data->t_infomask2,
5129  GetCurrentTransactionId(), mode, false,
5130  &xid, &new_infomask, &new_infomask2);
5131 
5133 
5134  /*
5135  * Store transaction information of xact locking the tuple.
5136  *
5137  * Note: Cmax is meaningless in this context, so don't set it; this avoids
5138  * possibly generating a useless combo CID. Moreover, if we're locking a
5139  * previously updated tuple, it's important to preserve the Cmax.
5140  *
5141  * Also reset the HOT UPDATE bit, but only if there's no update; otherwise
5142  * we would break the HOT chain.
5143  */
5144  tuple->t_data->t_infomask &= ~HEAP_XMAX_BITS;
5145  tuple->t_data->t_infomask2 &= ~HEAP_KEYS_UPDATED;
5146  tuple->t_data->t_infomask |= new_infomask;
5147  tuple->t_data->t_infomask2 |= new_infomask2;
5148  if (HEAP_XMAX_IS_LOCKED_ONLY(new_infomask))
5150  HeapTupleHeaderSetXmax(tuple->t_data, xid);
5151 
5152  /*
5153  * Make sure there is no forward chain link in t_ctid. Note that in the
5154  * cases where the tuple has been updated, we must not overwrite t_ctid,
5155  * because it was set by the updater. Moreover, if the tuple has been
5156  * updated, we need to follow the update chain to lock the new versions of
5157  * the tuple as well.
5158  */
5159  if (HEAP_XMAX_IS_LOCKED_ONLY(new_infomask))
5160  tuple->t_data->t_ctid = *tid;
5161 
5162  /* Clear only the all-frozen bit on visibility map if needed */
5163  if (PageIsAllVisible(page) &&
5164  visibilitymap_clear(relation, block, vmbuffer,
5166  cleared_all_frozen = true;
5167 
5168 
5169  MarkBufferDirty(*buffer);
5170 
5171  /*
5172  * XLOG stuff. You might think that we don't need an XLOG record because
5173  * there is no state change worth restoring after a crash. You would be
5174  * wrong however: we have just written either a TransactionId or a
5175  * MultiXactId that may never have been seen on disk before, and we need
5176  * to make sure that there are XLOG entries covering those ID numbers.
5177  * Else the same IDs might be re-used after a crash, which would be
5178  * disastrous if this page made it to disk before the crash. Essentially
5179  * we have to enforce the WAL log-before-data rule even in this case.
5180  * (Also, in a PITR log-shipping or 2PC environment, we have to have XLOG
5181  * entries for everything anyway.)
5182  */
5183  if (RelationNeedsWAL(relation))
5184  {
5185  xl_heap_lock xlrec;
5186  XLogRecPtr recptr;
5187 
5188  XLogBeginInsert();
5189  XLogRegisterBuffer(0, *buffer, REGBUF_STANDARD);
5190 
5191  xlrec.offnum = ItemPointerGetOffsetNumber(&tuple->t_self);
5192  xlrec.locking_xid = xid;
5193  xlrec.infobits_set = compute_infobits(new_infomask,
5194  tuple->t_data->t_infomask2);
5195  xlrec.flags = cleared_all_frozen ? XLH_LOCK_ALL_FROZEN_CLEARED : 0;
5196  XLogRegisterData((char *) &xlrec, SizeOfHeapLock);
5197 
5198  /* we don't decode row locks atm, so no need to log the origin */
5199 
5200  recptr = XLogInsert(RM_HEAP_ID, XLOG_HEAP_LOCK);
5201 
5202  PageSetLSN(page, recptr);
5203  }
5204 
5205  END_CRIT_SECTION();
5206 
5207  result = HeapTupleMayBeUpdated;
5208 
5209 out_locked:
5210  LockBuffer(*buffer, BUFFER_LOCK_UNLOCK);
5211 
5212 out_unlocked:
5213  if (BufferIsValid(vmbuffer))
5214  ReleaseBuffer(vmbuffer);
5215 
5216  /*
5217  * Don't update the visibility map here. Locking a tuple doesn't change
5218  * visibility info.
5219  */
5220 
5221  /*
5222  * Now that we have successfully marked the tuple as locked, we can
5223  * release the lmgr tuple lock, if we had it.
5224  */
5225  if (have_tuple_lock)
5226  UnlockTupleTuplock(relation, tid, mode);
5227 
5228  return result;
5229 }
#define HeapTupleHeaderGetUpdateXid(tup)
Definition: htup_details.h:359
bool HeapTupleHeaderIsOnlyLocked(HeapTupleHeader tuple)
Definition: tqual.c:1585
MultiXactStatus
Definition: multixact.h:40
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
#define HEAP_XMAX_BITS
Definition: htup_details.h:256
OffsetNumber offnum
Definition: heapam_xlog.h:253
static uint8 compute_infobits(uint16 infomask, uint16 infomask2)
Definition: heapam.c:2939
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
#define PageIsAllVisible(page)
Definition: bufpage.h:382
#define XLH_LOCK_ALL_FROZEN_CLEARED
Definition: heapam_xlog.h:247
TransactionId locking_xid
Definition: heapam_xlog.h:252
uint32 TransactionId
Definition: c.h:393
HTSU_Result HeapTupleSatisfiesUpdate(HeapTuple htup, CommandId curcid, Buffer buffer)
Definition: tqual.c:460
bool TransactionIdIsCurrentTransactionId(TransactionId xid)
Definition: xact.c:772
void visibilitymap_pin(Relation rel, BlockNumber heapBlk, Buffer *buf)
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define VISIBILITYMAP_ALL_FROZEN
Definition: visibilitymap.h:27
static bool xmax_infomask_changed(uint16 new_infomask, uint16 old_infomask)
Definition: heapam.c:2961
#define HeapTupleHeaderClearHotUpdated(tup)
Definition: htup_details.h:497
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
#define InvalidBuffer
Definition: buf.h:25
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
int errcode(int sqlerrcode)
Definition: elog.c:575
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
#define UnlockTupleTuplock(rel, tup, mode)
Definition: heapam.c:184
bool ConditionalXactLockTableWait(TransactionId xid)
Definition: lmgr.c:607
#define HEAP_XMAX_IS_SHR_LOCKED(infomask)
Definition: htup_details.h:248
void MultiXactIdSetOldestMember(void)
Definition: multixact.c:623
HeapTupleHeader t_data
Definition: htup.h:67
#define HeapTupleHeaderGetRawXmax(tup)
Definition: htup_details.h:369
unsigned short uint16
Definition: c.h:264
void pfree(void *pointer)
Definition: mcxt.c:992
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
bool visibilitymap_clear(Relation rel, BlockNumber heapBlk, Buffer buf, uint8 flags)
#define ERROR
Definition: elog.h:43
#define HEAP_XMAX_INVALID
Definition: htup_details.h:193
int8 infobits_set
Definition: heapam_xlog.h:254
ItemPointerData t_ctid
Definition: htup_details.h:150
ItemPointerData t_self
Definition: htup.h:65
static void MultiXactIdWait(MultiXactId multi, MultiXactStatus status, uint16 infomask, Relation rel, ItemPointer ctid, XLTW_Oper oper, int *remaining)
Definition: heapam.c:7148
TransactionId GetCurrentTransactionId(void)
Definition: xact.c:416
uint32 t_len
Definition: htup.h:64
#define REGBUF_STANDARD
Definition: xloginsert.h:35
CommandId cmax
Definition: heapam.h:72
#define HeapTupleHeaderSetXmax(tup, xid)
Definition: htup_details.h:374
HTSU_Result
Definition: snapshot.h:118
#define RelationGetRelationName(relation)
Definition: rel.h:433
Oid t_tableOid
Definition: htup.h:66
#define SizeOfHeapLock
Definition: heapam_xlog.h:258
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define ereport(elevel, rest)
Definition: elog.h:122
static void compute_new_xmax_infomask(TransactionId xmax, uint16 old_infomask, uint16 old_infomask2, TransactionId add_to_xmax, LockTupleMode mode, bool is_update, TransactionId *result_xmax, uint16 *result_infomask, uint16 *result_infomask2)
Definition: heapam.c:5293
TransactionId xmax
Definition: heapam.h:71
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
#define InvalidCommandId
Definition: c.h:410
#define HEAP_XMAX_IS_LOCKED_ONLY(infomask)
Definition: htup_details.h:216
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3529
#define HEAP_KEYS_UPDATED
Definition: htup_details.h:264
#define HEAP_XMAX_IS_MULTI
Definition: htup_details.h:194
static void UpdateXmaxHintBits(HeapTupleHeader tuple, Buffer buffer, TransactionId xid)
Definition: heapam.c:2284
static bool heap_acquire_tuplock(Relation relation, ItemPointer tid, LockTupleMode mode, LockWaitPolicy wait_policy, bool *have_tuple_lock)
Definition: heapam.c:5244
TransactionId MultiXactId
Definition: c.h:403
void XactLockTableWait(TransactionId xid, Relation rel, ItemPointer ctid, XLTW_Oper oper)
Definition: lmgr.c:554
#define NULL
Definition: c.h:226
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:670
Definition: lmgr.h:29
CommandId HeapTupleHeaderGetCmax(HeapTupleHeader tup)
Definition: combocid.c:119
static bool DoesMultiXactIdConflict(MultiXactId multi, uint16 infomask, LockTupleMode lockmode)
Definition: heapam.c:6981
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define BufferIsValid(bufnum)
Definition: bufmgr.h:114
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
#define RelationNeedsWAL(relation)
Definition: rel.h:502
#define TUPLOCK_from_mxstatus(status)
Definition: heapam.c:204
static HTSU_Result heap_lock_updated_tuple(Relation rel, HeapTuple tuple, ItemPointer ctid, TransactionId xid, LockTupleMode mode)
Definition: heapam.c:5961
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define XLOG_HEAP_LOCK
Definition: heapam_xlog.h:38
int i
static MultiXactStatus get_mxact_status_for_lock(LockTupleMode mode, bool is_update)
Definition: heapam.c:4525
ItemPointerData ctid
Definition: heapam.h:70
#define HEAP_XMAX_IS_EXCL_LOCKED(infomask)
Definition: htup_details.h:250
int GetMultiXactIdMembers(MultiXactId multi, MultiXactMember **members, bool from_pgupgrade, bool onlyLock)
Definition: multixact.c:1202
#define elog
Definition: elog.h:219
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:66
#define HEAP_XMAX_IS_KEYSHR_LOCKED(infomask)
Definition: htup_details.h:252
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:222
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
#define RelationGetRelid(relation)
Definition: rel.h:413
static bool ConditionalMultiXactIdWait(MultiXactId multi, MultiXactStatus status, uint16 infomask, Relation rel, int *remaining)
Definition: heapam.c:7170
#define PageGetItem(page, itemId)
Definition: bufpage.h:337
Pointer Page
Definition: bufpage.h:74
#define ItemPointerCopy(fromPointer, toPointer)
Definition: itemptr.h:120
void heap_multi_insert ( Relation  relation,
HeapTuple tuples,
int  ntuples,
CommandId  cid,
int  options,
BulkInsertState  bistate 
)

Definition at line 2645 of file heapam.c.

References Assert, BufferGetBlockNumber(), BufferGetPage, CacheInvalidateHeapTuple(), CHECK_FOR_INTERRUPTS, CheckForSerializableConflictIn(), xl_multi_insert_tuple::datalen, END_CRIT_SECTION, FirstOffsetNumber, xl_heap_multi_insert::flags, GetCurrentTransactionId(), HEAP_DEFAULT_FILLFACTOR, HEAP_INSERT_SKIP_WAL, heap_prepare_insert(), i, init(), InvalidBuffer, IsCatalogRelation(), ItemPointerGetOffsetNumber, log_heap_new_cid(), MarkBufferDirty(), MAXALIGN, xl_heap_multi_insert::ntuples, NULL, xl_heap_multi_insert::offsets, PageClearAllVisible, PageGetHeapFreeSpace(), PageGetMaxOffsetNumber, PageIsAllVisible, PageSetLSN, palloc(), pgstat_count_heap_insert(), REGBUF_KEEP_DATA, REGBUF_STANDARD, REGBUF_WILL_INIT, RelationGetBufferForTuple(), RelationGetTargetPageFreeSpace, RelationIsAccessibleInLogicalDecoding, RelationIsLogicallyLogged, RelationNeedsWAL, RelationPutHeapTuple(), ReleaseBuffer(), SHORTALIGN, SizeOfHeapMultiInsert, SizeofHeapTupleHeader, SizeOfMultiInsertTuple, START_CRIT_SECTION, HeapTupleData::t_data, HeapTupleHeaderData::t_hoff, xl_multi_insert_tuple::t_hoff, HeapTupleHeaderData::t_infomask, xl_multi_insert_tuple::t_infomask, HeapTupleHeaderData::t_infomask2, xl_multi_insert_tuple::t_infomask2, HeapTupleData::t_len, HeapTupleData::t_self, UnlockReleaseBuffer(), visibilitymap_clear(), VISIBILITYMAP_VALID_BITS, XLH_INSERT_ALL_VISIBLE_CLEARED, XLH_INSERT_CONTAINS_NEW_TUPLE, XLH_INSERT_LAST_IN_MULTI, XLOG_HEAP2_MULTI_INSERT, XLOG_HEAP_INIT_PAGE, XLOG_INCLUDE_ORIGIN, XLogBeginInsert(), XLogInsert(), XLogRegisterBufData(), XLogRegisterBuffer(), XLogRegisterData(), and XLogSetRecordFlags().

Referenced by CopyFromInsertBatch().

2647 {
2649  HeapTuple *heaptuples;
2650  int i;
2651  int ndone;
2652  char *scratch = NULL;
2653  Page page;
2654  bool needwal;
2655  Size saveFreeSpace;
2656  bool need_tuple_data = RelationIsLogicallyLogged(relation);
2657  bool need_cids = RelationIsAccessibleInLogicalDecoding(relation);
2658 
2659  needwal = !(options & HEAP_INSERT_SKIP_WAL) && RelationNeedsWAL(relation);
2660  saveFreeSpace = RelationGetTargetPageFreeSpace(relation,
2662 
2663  /* Toast and set header data in all the tuples */
2664  heaptuples = palloc(ntuples * sizeof(HeapTuple));
2665  for (i = 0; i < ntuples; i++)
2666  heaptuples[i] = heap_prepare_insert(relation, tuples[i],
2667  xid, cid, options);
2668 
2669  /*
2670  * Allocate some memory to use for constructing the WAL record. Using
2671  * palloc() within a critical section is not safe, so we allocate this
2672  * beforehand.
2673  */
2674  if (needwal)
2675  scratch = palloc(BLCKSZ);
2676 
2677  /*
2678  * We're about to do the actual inserts -- but check for conflict first,
2679  * to minimize the possibility of having to roll back work we've just
2680  * done.
2681  *
2682  * A check here does not definitively prevent a serialization anomaly;
2683  * that check MUST be done at least past the point of acquiring an
2684  * exclusive buffer content lock on every buffer that will be affected,
2685  * and MAY be done after all inserts are reflected in the buffers and
2686  * those locks are released; otherwise there race condition. Since
2687  * multiple buffers can be locked and unlocked in the loop below, and it
2688  * would not be feasible to identify and lock all of those buffers before
2689  * the loop, we must do a final check at the end.
2690  *
2691  * The check here could be omitted with no loss of correctness; it is
2692  * present strictly as an optimization.
2693  *
2694  * For heap inserts, we only need to check for table-level SSI locks. Our
2695  * new tuples can't possibly conflict with existing tuple locks, and heap
2696  * page locks are only consolidated versions of tuple locks; they do not
2697  * lock "gaps" as index page locks do. So we don't need to specify a
2698  * buffer when making the call, which makes for a faster check.
2699  */
2701 
2702  ndone = 0;
2703  while (ndone < ntuples)
2704  {
2705  Buffer buffer;
2706  Buffer vmbuffer = InvalidBuffer;
2707  bool all_visible_cleared = false;
2708  int nthispage;
2709 
2711 
2712  /*
2713  * Find buffer where at least the next tuple will fit. If the page is
2714  * all-visible, this will also pin the requisite visibility map page.
2715  */
2716  buffer = RelationGetBufferForTuple(relation, heaptuples[ndone]->t_len,
2717  InvalidBuffer, options, bistate,
2718  &vmbuffer, NULL);
2719  page = BufferGetPage(buffer);
2720 
2721  /* NO EREPORT(ERROR) from here till changes are logged */
2723 
2724  /*
2725  * RelationGetBufferForTuple has ensured that the first tuple fits.
2726  * Put that on the page, and then as many other tuples as fit.
2727  */
2728  RelationPutHeapTuple(relation, buffer, heaptuples[ndone], false);
2729  for (nthispage = 1; ndone + nthispage < ntuples; nthispage++)
2730  {
2731  HeapTuple heaptup = heaptuples[ndone + nthispage];
2732 
2733  if (PageGetHeapFreeSpace(page) < MAXALIGN(heaptup->t_len) + saveFreeSpace)
2734  break;
2735 
2736  RelationPutHeapTuple(relation, buffer, heaptup, false);
2737 
2738  /*
2739  * We don't use heap_multi_insert for catalog tuples yet, but
2740  * better be prepared...
2741  */
2742  if (needwal && need_cids)
2743  log_heap_new_cid(relation, heaptup);
2744  }
2745 
2746  if (PageIsAllVisible(page))
2747  {
2748  all_visible_cleared = true;
2749  PageClearAllVisible(page);
2750  visibilitymap_clear(relation,
2751  BufferGetBlockNumber(buffer),
2752  vmbuffer, VISIBILITYMAP_VALID_BITS);
2753  }
2754 
2755  /*
2756  * XXX Should we set PageSetPrunable on this page ? See heap_insert()
2757  */
2758 
2759  MarkBufferDirty(buffer);
2760 
2761  /* XLOG stuff */
2762  if (needwal)
2763  {
2764  XLogRecPtr recptr;
2765  xl_heap_multi_insert *xlrec;
2767  char *tupledata;
2768  int totaldatalen;
2769  char *scratchptr = scratch;
2770  bool init;
2771  int bufflags = 0;
2772 
2773  /*
2774  * If the page was previously empty, we can reinit the page
2775  * instead of restoring the whole thing.
2776  */
2777  init = (ItemPointerGetOffsetNumber(&(heaptuples[ndone]->t_self)) == FirstOffsetNumber &&
2778  PageGetMaxOffsetNumber(page) == FirstOffsetNumber + nthispage - 1);
2779 
2780  /* allocate xl_heap_multi_insert struct from the scratch area */
2781  xlrec = (xl_heap_multi_insert *) scratchptr;
2782  scratchptr += SizeOfHeapMultiInsert;
2783 
2784  /*
2785  * Allocate offsets array. Unless we're reinitializing the page,
2786  * in that case the tuples are stored in order starting at
2787  * FirstOffsetNumber and we don't need to store the offsets
2788  * explicitly.
2789  */
2790  if (!init)
2791  scratchptr += nthispage * sizeof(OffsetNumber);
2792 
2793  /* the rest of the scratch space is used for tuple data */
2794  tupledata = scratchptr;
2795 
2796  xlrec->flags = all_visible_cleared ? XLH_INSERT_ALL_VISIBLE_CLEARED : 0;
2797  xlrec->ntuples = nthispage;
2798 
2799  /*
2800  * Write out an xl_multi_insert_tuple and the tuple data itself
2801  * for each tuple.
2802  */
2803  for (i = 0; i < nthispage; i++)
2804  {
2805  HeapTuple heaptup = heaptuples[ndone + i];
2806  xl_multi_insert_tuple *tuphdr;
2807  int datalen;
2808 
2809  if (!init)
2810  xlrec->offsets[i] = ItemPointerGetOffsetNumber(&heaptup->t_self);
2811  /* xl_multi_insert_tuple needs two-byte alignment. */
2812  tuphdr = (xl_multi_insert_tuple *) SHORTALIGN(scratchptr);
2813  scratchptr = ((char *) tuphdr) + SizeOfMultiInsertTuple;
2814 
2815  tuphdr->t_infomask2 = heaptup->t_data->t_infomask2;
2816  tuphdr->t_infomask = heaptup->t_data->t_infomask;
2817  tuphdr->t_hoff = heaptup->t_data->t_hoff;
2818 
2819  /* write bitmap [+ padding] [+ oid] + data */
2820  datalen = heaptup->t_len - SizeofHeapTupleHeader;
2821  memcpy(scratchptr,
2822  (char *) heaptup->t_data + SizeofHeapTupleHeader,
2823  datalen);
2824  tuphdr->datalen = datalen;
2825  scratchptr += datalen;
2826  }
2827  totaldatalen = scratchptr - tupledata;
2828  Assert((scratchptr - scratch) < BLCKSZ);
2829 
2830  if (need_tuple_data)
2832 
2833  /*
2834  * Signal that this is the last xl_heap_multi_insert record
2835  * emitted by this call to heap_multi_insert(). Needed for logical
2836  * decoding so it knows when to cleanup temporary data.
2837  */
2838  if (ndone + nthispage == ntuples)
2839  xlrec->flags |= XLH_INSERT_LAST_IN_MULTI;
2840 
2841  if (init)
2842  {
2843  info |= XLOG_HEAP_INIT_PAGE;
2844  bufflags |= REGBUF_WILL_INIT;
2845  }
2846 
2847  /*
2848  * If we're doing logical decoding, include the new tuple data
2849  * even if we take a full-page image of the page.
2850  */
2851  if (need_tuple_data)
2852  bufflags |= REGBUF_KEEP_DATA;
2853 
2854  XLogBeginInsert();
2855  XLogRegisterData((char *) xlrec, tupledata - scratch);
2856  XLogRegisterBuffer(0, buffer, REGBUF_STANDARD | bufflags);
2857 
2858  XLogRegisterBufData(0, tupledata, totaldatalen);
2859 
2860  /* filtering by origin on a row level is much more efficient */
2862 
2863  recptr = XLogInsert(RM_HEAP2_ID, info);
2864 
2865  PageSetLSN(page, recptr);
2866  }
2867 
2868  END_CRIT_SECTION();
2869 
2870  UnlockReleaseBuffer(buffer);
2871  if (vmbuffer != InvalidBuffer)
2872  ReleaseBuffer(vmbuffer);
2873 
2874  ndone += nthispage;
2875  }
2876 
2877  /*
2878  * We're done with the actual inserts. Check for conflicts again, to
2879  * ensure that all rw-conflicts in to these inserts are detected. Without
2880  * this final check, a sequential scan of the heap may have locked the
2881  * table after the "before" check, missing one opportunity to detect the
2882  * conflict, and then scanned the table before the new tuples were there,
2883  * missing the other chance to detect the conflict.
2884  *
2885  * For heap inserts, we only need to check for table-level SSI locks. Our
2886  * new tuples can't possibly conflict with existing tuple locks, and heap
2887  * page locks are only consolidated versions of tuple locks; they do not
2888  * lock "gaps" as index page locks do. So we don't need to specify a
2889  * buffer when making the call.
2890  */
2892 
2893  /*
2894  * If tuples are cachable, mark them for invalidation from the caches in
2895  * case we abort. Note it is OK to do this after releasing the buffer,
2896  * because the heaptuples data structure is all in local memory, not in
2897  * the shared buffer.
2898  */
2899  if (IsCatalogRelation(relation))
2900  {
2901  for (i = 0; i < ntuples; i++)
2902  CacheInvalidateHeapTuple(relation, heaptuples[i], NULL);
2903  }
2904 
2905  /*
2906  * Copy t_self fields back to the caller's original tuples. This does
2907  * nothing for untoasted tuples (tuples[i] == heaptuples[i)], but it's
2908  * probably faster to always copy than check.
2909  */
2910  for (i = 0; i < ntuples; i++)
2911  tuples[i]->t_self = heaptuples[i]->t_self;
2912 
2913  pgstat_count_heap_insert(relation, ntuples);
2914 }
void XLogRegisterBufData(uint8 block_id, char *data, int len)
Definition: xloginsert.c:361
#define SizeofHeapTupleHeader
Definition: htup_details.h:170
bool IsCatalogRelation(Relation relation)
Definition: catalog.c:91
static XLogRecPtr log_heap_new_cid(Relation relation, HeapTuple tup)
Definition: heapam.c:7732
void CacheInvalidateHeapTuple(Relation relation, HeapTuple tuple, HeapTuple newtuple)
Definition: inval.c:1085
static HeapTuple heap_prepare_insert(Relation relation, HeapTuple tup, TransactionId xid, CommandId cid, int options)
Definition: heapam.c:2567
#define PageIsAllVisible(page)
Definition: bufpage.h:382
uint32 TransactionId
Definition: c.h:393
OffsetNumber offsets[FLEXIBLE_ARRAY_MEMBER]
Definition: heapam_xlog.h:155
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
unsigned char uint8
Definition: c.h:263
#define InvalidBuffer
Definition: buf.h:25
#define SizeOfHeapMultiInsert
Definition: heapam_xlog.h:158
#define REGBUF_WILL_INIT
Definition: xloginsert.h:32
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
#define XLOG_INCLUDE_ORIGIN
Definition: xlog.h:192
#define HEAP_INSERT_SKIP_WAL
Definition: heapam.h:28
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3292
#define RelationIsLogicallyLogged(relation)
Definition: rel.h:572
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
void RelationPutHeapTuple(Relation relation, Buffer buffer, HeapTuple tuple, bool token)
Definition: hio.c:36
void CheckForSerializableConflictIn(Relation relation, HeapTuple tuple, Buffer buffer)
Definition: predicate.c:4243
#define XLOG_HEAP_INIT_PAGE
Definition: heapam_xlog.h:46
#define XLOG_HEAP2_MULTI_INSERT
Definition: heapam_xlog.h:58
uint16 OffsetNumber
Definition: off.h:24
#define VISIBILITYMAP_VALID_BITS
Definition: visibilitymap.h:28
HeapTupleHeader t_data
Definition: htup.h:67
bool visibilitymap_clear(Relation rel, BlockNumber heapBlk, Buffer buf, uint8 flags)
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3315
Size PageGetHeapFreeSpace(Page page)
Definition: bufpage.c:639
#define XLH_INSERT_CONTAINS_NEW_TUPLE
Definition: heapam_xlog.h:69
ItemPointerData t_self
Definition: htup.h:65
TransactionId GetCurrentTransactionId(void)
Definition: xact.c:416
uint32 t_len
Definition: htup.h:64
#define FirstOffsetNumber
Definition: off.h:27
#define REGBUF_STANDARD
Definition: xloginsert.h:35
Buffer RelationGetBufferForTuple(Relation relation, Size len, Buffer otherBuffer, int options, BulkInsertState bistate, Buffer *vmbuffer, Buffer *vmbuffer_other)
Definition: hio.c:297
void XLogSetRecordFlags(uint8 flags)
Definition: xloginsert.c:397
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define RelationGetTargetPageFreeSpace(relation, defaultff)
Definition: rel.h:304
#define XLH_INSERT_LAST_IN_MULTI
Definition: heapam_xlog.h:67
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
#define RelationIsAccessibleInLogicalDecoding(relation)
Definition: rel.h:556
#define REGBUF_KEEP_DATA
Definition: xloginsert.h:38
#define PageClearAllVisible(page)
Definition: bufpage.h:386
#define NULL
Definition: c.h:226
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:670
size_t Size
Definition: c.h:352
#define MAXALIGN(LEN)
Definition: c.h:583
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:76
static void init(bool is_no_vacuum)
Definition: pgbench.c:2571
#define RelationNeedsWAL(relation)
Definition: rel.h:502
#define XLH_INSERT_ALL_VISIBLE_CLEARED
Definition: heapam_xlog.h:66
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2588
void * palloc(Size size)
Definition: mcxt.c:891
void pgstat_count_heap_insert(Relation rel, int n)
Definition: pgstat.c:1805
int i
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:97
#define HEAP_DEFAULT_FILLFACTOR
Definition: rel.h:283
#define SHORTALIGN(LEN)
Definition: c.h:579
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:74
#define SizeOfMultiInsertTuple
Definition: heapam_xlog.h:169
Relation heap_open ( Oid  relationId,
LOCKMODE  lockmode 
)

Definition at line 1287 of file heapam.c.

References ereport, errcode(), errmsg(), ERROR, RelationData::rd_rel, relation_open(), RelationGetRelationName, RELKIND_COMPOSITE_TYPE, and RELKIND_INDEX.

Referenced by acquire_inherited_sample_rows(), AcquireRewriteLocks(), AddEnumLabel(), AddNewAttributeTuples(), AddRoleMems(), AfterTriggerSetState(), AggregateCreate(), AlterConstraintNamespaces(), AlterDatabase(), AlterDatabaseOwner(), AlterDomainAddConstraint(), AlterDomainDefault(), AlterDomainDropConstraint(), AlterDomainNotNull(), AlterDomainValidateConstraint(), AlterEventTrigger(), AlterEventTriggerOwner(), AlterEventTriggerOwner_oid(), AlterExtensionNamespace(), AlterForeignDataWrapper(), AlterForeignDataWrapperOwner(), AlterForeignDataWrapperOwner_oid(), AlterForeignServer(), AlterForeignServerOwner(), AlterForeignServerOwner_oid(), AlterFunction(), AlterObjectNamespace_oid(), AlterOperator(), AlterPolicy(), AlterPublication(), AlterPublicationOwner(), AlterPublicationOwner_oid(), AlterPublicationTables(), AlterRole(), AlterSchemaOwner(), AlterSchemaOwner_oid(), AlterSeqNamespaces(), AlterSequence(), AlterSetting(), AlterSubscription(), AlterSubscriptionOwner(), AlterSubscriptionOwner_oid(), AlterTableMoveAll(), AlterTableNamespaceInternal(), AlterTableSpaceOptions(), AlterTSConfiguration(), AlterTSDictionary(), AlterTypeNamespaceInternal(), AlterTypeOwner(), AlterTypeOwner_oid(), AlterTypeOwnerInternal(), AlterUserMapping(), AppendAttributeTuples(), ApplyExtensionUpdates(), AssignTypeArrayOid(), ATAddCheckConstraint(), ATAddForeignKeyConstraint(), ATExecAddColumn(), ATExecAddOf(), ATExecAlterColumnGenericOptions(), ATExecAlterColumnType(), ATExecAlterConstraint(), ATExecAttachPartition(), ATExecChangeOwner(), ATExecDetachPartition(), ATExecDisableRowSecurity(), ATExecDropColumn(), ATExecDropConstraint(), ATExecDropNotNull(), ATExecDropOf(), ATExecEnableRowSecurity(), ATExecForceNoForceRowSecurity(), ATExecGenericOptions(), ATExecSetNotNull(), ATExecSetOptions(), ATExecSetRelOptions(), ATExecSetStatistics(), ATExecSetStorage(), ATExecSetTableSpace(), ATExecValidateConstraint(), ATPrepChangePersistence(), ATRewriteTable(), ATRewriteTables(), AttrDefaultFetch(), boot_openrel(), brin_summarize_new_values(), bringetbitmap(), brinvacuumcleanup(), build_indices(), build_physical_tlist(), CatalogCacheInitializeCache(), change_owner_fix_column_acls(), change_owner_recurse_to_sequences(), changeDependencyFor(), changeDependencyOnOwner(), check_db_file_conflict(), check_selective_binary_conversion(), CheckAndCreateToastTable(), CheckConstraintFetch(), checkSharedDependencies(), ChooseConstraintName(), cluster(), CollationCreate(), ConstraintNameIsUsed(), ConversionCreate(), copy_heap_data(), copyTemplateDependencies(), CountDBSubscriptions(), create_proc_lang(), create_toast_table(), CreateAccessMethod(), CreateCast(), CreateComments(), CreateConstraintEntry(), createdb(), CreateForeignDataWrapper(), CreateForeignServer(), CreateForeignTable(), CreateInheritance(), CreateOpFamily(), CreatePolicy(), CreatePublication(), CreateRole(), CreateSharedComments(), CreateSubscription(), CreateTableSpace(), CreateTransform(), CreateTrigger(), CreateUserMapping(), currtid_byreloid(), database_to_xmlschema_internal(), DefineIndex(), DefineOpClass(), DefineQueryRewrite(), DefineRelation(), DefineSequence(), DefineTSConfiguration(), DefineTSDictionary(), DefineTSParser(), DefineTSTemplate(), DeleteAttributeTuples(), DeleteComments(), deleteDependencyRecordsFor(), deleteDependencyRecordsForClass(), DeleteInitPrivs(), deleteOneObject(), DeleteRelationTuple(), DeleteSecurityLabel(), DeleteSequenceTuple(), DeleteSharedComments(), deleteSharedDependencyRecordsFor(), DeleteSharedSecurityLabel(), DeleteSystemAttributeTuples(), DelRoleMems(), deparseColumnRef(), deparseFromExprForRel(), deparseSelectSql(), do_autovacuum(), drop_parent_dependency(), DropCastById(), dropDatabaseDependencies(), dropdb(), DropProceduralLanguageById(), DropRole(), DropSetting(), DropSubscription(), DropTableSpace(), DropTransformById(), EnableDisableRule(), EnableDisableTrigger(), enum_endpoint(), enum_range_internal(), EnumValuesCreate(), EnumValuesDelete(), EventTriggerSQLDropAddObject(), exec_object_restorecon(), ExecAlterExtensionStmt(), ExecAlterObjectSchemaStmt(), ExecAlterOwnerStmt(), ExecGetTriggerResultRel(), ExecGrant_Database(), ExecGrant_Fdw(), ExecGrant_ForeignServer(), ExecGrant_Function(), ExecGrant_Language(), ExecGrant_Largeobject(), ExecGrant_Namespace(), ExecGrant_Relation(), ExecGrant_Tablespace(), ExecGrant_Type(), ExecOpenScanRelation(), ExecRefreshMatView(), ExecRenameStmt(), ExecSetupPartitionTupleRouting(), ExecuteTruncate(), expand_inherited_rtentry(), expand_targetlist(), extension_config_remove(), find_composite_type_dependencies(), find_inheritance_children(), find_language_template(), find_typed_table_dependencies(), finish_heap_swap(), fireRIRrules(), generate_partition_qual(), get_actual_variable_range(), get_constraint_index(), get_database_list(), get_database_oid(), get_db_info(), get_domain_constraint_oid(), get_extension_name(), get_extension_oid(), get_extension_schema(), get_file_fdw_attribute_options(), get_index_constraint(), get_object_address_relobject(), get_partition_parent(), get_pkey_attnames(), get_primary_key_attnos(), get_rel_oids(), get_relation_constraint_oid(), get_relation_constraints(), get_relation_data_width(), get_relation_info(), get_relation_policy_oid(), get_rels_with_domain(), get_rewrite_oid_without_relid(), get_row_security_policies(), get_subscription_list(), get_tables_to_cluster(), get_tablespace_name(), get_tablespace_oid(), get_trigger_oid(), GetAllTablesPublicationRelations(), GetAllTablesPublications(), GetComment(), getConstraintTypeDescription(), GetDatabaseTuple(), GetDatabaseTupleByOid(), GetDefaultOpClass(), getExtensionOfObject(), getObjectDescription(), getObjectIdentityParts(), getOwnedSequences(), GetPublicationRelations(), getRelationsInNamespace(), GetSecurityLabel(), GetSharedSecurityLabel(), gettype(), GrantRole(), has_row_triggers(), heap_create_with_catalog(), heap_drop_with_catalog(), heap_sync(), heap_truncate(), heap_truncate_find_FKs(), heap_truncate_one_rel(), index_build(), index_constraint_create(), index_create(), index_drop(), index_set_state_flags(), index_update_stats(), infer_arbiter_indexes(), InitPlan(), insert_event_trigger_tuple(), InsertExtensionTuple(), InsertRule(), intorel_startup(), isQueryUsingTempRelation_walker(), LargeObjectCreate(), LargeObjectDrop(), LargeObjectExists(), load_domaintype_info(), load_enum_cache_data(), logicalrep_rel_open(), lookup_ts_config_cache(), LookupOpclassInfo(), make_new_heap(), make_viewdef(), makeArrayTypeName(), mark_index_clustered(), MergeAttributesIntoExisting(), MergeConstraintsIntoExisting(), MergeWithExistingConstraint(), movedb(), myLargeObjectExists(), NamespaceCreate(), objectsInSchemaToOids(), open_lo_relation(), OpenTableList(), OperatorCreate(), OperatorShellMake(), OperatorUpd(), performDeletion(), performMultipleDeletions(), pg_event_trigger_ddl_commands(), pg_extension_config_dump(), pg_extension_ownercheck(), pg_get_constraintdef_worker(), pg_get_serial_sequence(), pg_get_triggerdef_worker(), pg_identify_object(), pg_largeobject_aclmask_snapshot(), pg_largeobject_ownercheck(), pgstat_collect_oids(), postgresPlanDirectModify(), postgresPlanForeignModify(), ProcedureCreate(), process_settings(), publication_add_relation(), RangeCreate(), RangeDelete(), recordExtensionInitPrivWorker(), recordExtObjInitPriv(), recordMultipleDependencies(), recordSharedDependencyOn(), refresh_by_match_merge(), regclassin(), regoperin(), regprocin(), regtypein(), reindex_index(), reindex_relation(), ReindexMultipleTables(), relation_has_policies(), relation_mark_replica_identity(), RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationBuildTriggers(), RelationBuildTupleDesc(), RelationGetExclusionInfo(), RelationGetFKeyList(), RelationGetIndexList(), RelationGetPartitionDispatchInfo(), RelationRemoveInheritance(), RelationSetNewRelfilenode(), RelidByRelfilenode(), remove_dbtablespaces(), RemoveAccessMethodById(), RemoveAmOpEntryById(), RemoveAmProcEntryById(), RemoveAttrDefault(), RemoveAttrDefaultById(), RemoveAttributeById(), RemoveCollationById(), RemoveConstraintById(), RemoveConversionById(), RemoveDefaultACLById(), RemoveEventTriggerById(), RemoveExtensionById(), RemoveForeignDataWrapperById(), RemoveForeignServerById(), RemoveFunctionById(), RemoveInheritance(), RemoveOpClassById(), RemoveOperatorById(), RemoveOpFamilyById(), RemovePartitionKeyByRelId(), RemovePolicyById(), RemovePublicationById(), RemovePublicationRelById(), RemoveRewriteRuleById(), RemoveRoleFromObjectACL(), RemoveRoleFromObjectPolicy(), RemoveSchemaById(), RemoveStatistics(), RemoveTriggerById(), RemoveTSConfigurationById(), RemoveTSDictionaryById(), RemoveTSParserById(), RemoveTSTemplateById(), RemoveTypeById(), RemoveUserMappingById(), rename_policy(), renameatt_internal(), RenameConstraint(), RenameConstraintById(), RenameDatabase(), RenameEnumLabel(), RenameRelationInternal(), RenameRewriteRule(), RenameRole(), RenameSchema(), RenameTableSpace(), renametrig(), RenameType(), RenameTypeInternal(), replorigin_create(), replorigin_drop(), RewriteQuery(), rewriteTargetView(), RI_FKey_cascade_del(), RI_FKey_cascade_upd(), RI_FKey_check(), RI_FKey_setdefault_del(), RI_FKey_setdefault_upd(), RI_FKey_setnull_del(), RI_FKey_setnull_upd(), ri_restrict_del(), ri_restrict_upd(), ScanPgRelation(), schema_to_xmlschema_internal(), SearchCatCache(), SearchCatCacheList(), sepgsql_attribute_post_create(), sepgsql_database_post_create(), sepgsql_index_modify(), sepgsql_proc_post_create(), sepgsql_proc_setattr(), sepgsql_relation_post_create(), sepgsql_relation_setattr(), sepgsql_schema_post_create(), sequenceIsOwned(), SetDefaultACL(), SetFunctionArgType(), SetFunctionReturnType(), SetMatViewPopulatedState(), SetRelationHasSubclass(), SetRelationNumChecks(), SetRelationRuleStatus(), SetSecurityLabel(), SetSharedSecurityLabel(), shdepDropOwned(), shdepReassignOwned(), StoreAttrDefault(), StoreCatalogInheritance(), storeOperators(), StorePartitionBound(), StorePartitionKey(), storeProcedures(), swap_relation_files(), table_to_xml_and_xmlschema(), table_to_xmlschema(), ThereIsAtLeastOneRole(), toast_delete_datum(), toast_fetch_datum(), toast_fetch_datum_slice(), toast_get_valid_index(), toast_save_datum(), toastid_valueid_exists(), transientrel_startup(), TypeCreate(), typeInheritsFrom(), TypeShellMake(), update_attstats(), updateAclDependencies(), UpdateIndexRelation(), vac_truncate_clog(), vac_update_datfrozenxid(), vac_update_relstats(), and validate_index().

1288 {
1289  Relation r;
1290 
1291  r = relation_open(relationId, lockmode);
1292 
1293  if (r->rd_rel->relkind == RELKIND_INDEX)
1294  ereport(ERROR,
1295  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1296  errmsg("\"%s\" is an index",
1298  else if (r->rd_rel->relkind == RELKIND_COMPOSITE_TYPE)
1299  ereport(ERROR,
1300  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1301  errmsg("\"%s\" is a composite type",
1303 
1304  return r;
1305 }
int errcode(int sqlerrcode)
Definition: elog.c:575
Form_pg_class rd_rel
Definition: rel.h:113
#define RELKIND_COMPOSITE_TYPE
Definition: pg_class.h:165
#define ERROR
Definition: elog.h:43
#define RelationGetRelationName(relation)
Definition: rel.h:433
#define ereport(elevel, rest)
Definition: elog.h:122
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_INDEX
Definition: pg_class.h:161
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1117
Relation heap_openrv ( const RangeVar relation,
LOCKMODE  lockmode 
)

Definition at line 1315 of file heapam.c.

References ereport, errcode(), errmsg(), ERROR, RelationData::rd_rel, relation_openrv(), RelationGetRelationName, RELKIND_COMPOSITE_TYPE, and RELKIND_INDEX.

Referenced by ATAddForeignKeyConstraint(), ATExecAddInherit(), ATExecAttachPartition(), ATExecDetachPartition(), ATExecDropInherit(), boot_openrel(), BootstrapToastTable(), CreateTrigger(), currtid_byrelname(), DefineIndex(), DoCopy(), ExecuteTruncate(), get_rel_from_relname(), MergeAttributes(), OpenTableList(), pgrowlocks(), transformIndexConstraint(), and transformRuleStmt().

1316 {
1317  Relation r;
1318 
1319  r = relation_openrv(relation, lockmode);
1320 
1321  if (r->rd_rel->relkind == RELKIND_INDEX)
1322  ereport(ERROR,
1323  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1324  errmsg("\"%s\" is an index",
1326  else if (r->rd_rel->relkind == RELKIND_COMPOSITE_TYPE)
1327  ereport(ERROR,
1328  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1329  errmsg("\"%s\" is a composite type",
1331 
1332  return r;
1333 }
Relation relation_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition: heapam.c:1195
int errcode(int sqlerrcode)
Definition: elog.c:575
Form_pg_class rd_rel
Definition: rel.h:113
#define RELKIND_COMPOSITE_TYPE
Definition: pg_class.h:165
#define ERROR
Definition: elog.h:43
#define RelationGetRelationName(relation)
Definition: rel.h:433
#define ereport(elevel, rest)
Definition: elog.h:122
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_INDEX
Definition: pg_class.h:161
Relation heap_openrv_extended ( const RangeVar relation,
LOCKMODE  lockmode,
bool  missing_ok 
)

Definition at line 1344 of file heapam.c.

References ereport, errcode(), errmsg(), ERROR, RelationData::rd_rel, relation_openrv_extended(), RelationGetRelationName, RELKIND_COMPOSITE_TYPE, and RELKIND_INDEX.

Referenced by get_object_address_relobject(), and parserOpenTable().

1346 {
1347  Relation r;
1348 
1349  r = relation_openrv_extended(relation, lockmode, missing_ok);
1350 
1351  if (r)
1352  {
1353  if (r->rd_rel->relkind == RELKIND_INDEX)
1354  ereport(ERROR,
1355  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1356  errmsg("\"%s\" is an index",
1358  else if (r->rd_rel->relkind == RELKIND_COMPOSITE_TYPE)
1359  ereport(ERROR,
1360  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1361  errmsg("\"%s\" is a composite type",
1363  }
1364 
1365  return r;
1366 }
int errcode(int sqlerrcode)
Definition: elog.c:575
Form_pg_class rd_rel
Definition: rel.h:113
#define RELKIND_COMPOSITE_TYPE
Definition: pg_class.h:165
#define ERROR
Definition: elog.h:43
#define RelationGetRelationName(relation)
Definition: rel.h:433
#define ereport(elevel, rest)
Definition: elog.h:122
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_INDEX
Definition: pg_class.h:161
Relation relation_openrv_extended(const RangeVar *relation, LOCKMODE lockmode, bool missing_ok)
Definition: heapam.c:1230
int heap_page_prune ( Relation  relation,
Buffer  buffer,
TransactionId  OldestXmin,
bool  report_stats,
TransactionId latestRemovedXid 
)

Definition at line 182 of file pruneheap.c.

References BufferGetPage, END_CRIT_SECTION, FirstOffsetNumber, heap_page_prune_execute(), heap_prune_chain(), InvalidTransactionId, ItemIdIsDead, ItemIdIsUsed, PruneState::latestRemovedXid, log_heap_clean(), MarkBufferDirty(), MarkBufferDirtyHint(), PruneState::marked, PruneState::ndead, PruneState::new_prune_xid, PruneState::nowdead, PruneState::nowunused, PruneState::nredirected, PruneState::nunused, OffsetNumberNext, PageClearFull, PageGetItemId, PageGetMaxOffsetNumber, PageIsFull, PageSetLSN, pgstat_update_heap_dead_tuples(), PruneState::redirected, RelationNeedsWAL, and START_CRIT_SECTION.

Referenced by heap_page_prune_opt(), and lazy_scan_heap().

184 {
185  int ndeleted = 0;
186  Page page = BufferGetPage(buffer);
187  OffsetNumber offnum,
188  maxoff;
189  PruneState prstate;
190 
191  /*
192  * Our strategy is to scan the page and make lists of items to change,
193  * then apply the changes within a critical section. This keeps as much
194  * logic as possible out of the critical section, and also ensures that
195  * WAL replay will work the same as the normal case.
196  *
197  * First, initialize the new pd_prune_xid value to zero (indicating no
198  * prunable tuples). If we find any tuples which may soon become
199  * prunable, we will save the lowest relevant XID in new_prune_xid. Also
200  * initialize the rest of our working state.
201  */
203  prstate.latestRemovedXid = *latestRemovedXid;
204  prstate.nredirected = prstate.ndead = prstate.nunused = 0;
205  memset(prstate.marked, 0, sizeof(prstate.marked));
206 
207  /* Scan the page */
208  maxoff = PageGetMaxOffsetNumber(page);
209  for (offnum = FirstOffsetNumber;
210  offnum <= maxoff;
211  offnum = OffsetNumberNext(offnum))
212  {
213  ItemId itemid;
214 
215  /* Ignore items already processed as part of an earlier chain */
216  if (prstate.marked[offnum])
217  continue;
218 
219  /* Nothing to do if slot is empty or already dead */
220  itemid = PageGetItemId(page, offnum);
221  if (!ItemIdIsUsed(itemid) || ItemIdIsDead(itemid))
222  continue;
223 
224  /* Process this item or chain of items */
225  ndeleted += heap_prune_chain(relation, buffer, offnum,
226  OldestXmin,
227  &prstate);
228  }
229 
230  /* Any error while applying the changes is critical */
232 
233  /* Have we found any prunable items? */
234  if (prstate.nredirected > 0 || prstate.ndead > 0 || prstate.nunused > 0)
235  {
236  /*
237  * Apply the planned item changes, then repair page fragmentation, and
238  * update the page's hint bit about whether it has free line pointers.
239  */
241  prstate.redirected, prstate.nredirected,
242  prstate.nowdead, prstate.ndead,
243  prstate.nowunused, prstate.nunused);
244 
245  /*
246  * Update the page's pd_prune_xid field to either zero, or the lowest
247  * XID of any soon-prunable tuple.
248  */
249  ((PageHeader) page)->pd_prune_xid = prstate.new_prune_xid;
250 
251  /*
252  * Also clear the "page is full" flag, since there's no point in
253  * repeating the prune/defrag process until something else happens to
254  * the page.
255  */
256  PageClearFull(page);
257 
258  MarkBufferDirty(buffer);
259 
260  /*
261  * Emit a WAL HEAP_CLEAN record showing what we did
262  */
263  if (RelationNeedsWAL(relation))
264  {
265  XLogRecPtr recptr;
266 
267  recptr = log_heap_clean(relation, buffer,
268  prstate.redirected, prstate.nredirected,
269  prstate.nowdead, prstate.ndead,
270  prstate.nowunused, prstate.nunused,
271  prstate.latestRemovedXid);
272 
273  PageSetLSN(BufferGetPage(buffer), recptr);
274  }
275  }
276  else
277  {
278  /*
279  * If we didn't prune anything, but have found a new value for the
280  * pd_prune_xid field, update it and mark the buffer dirty. This is
281  * treated as a non-WAL-logged hint.
282  *
283  * Also clear the "page is full" flag if it is set, since there's no
284  * point in repeating the prune/defrag process until something else
285  * happens to the page.
286  */
287  if (((PageHeader) page)->pd_prune_xid != prstate.new_prune_xid ||
288  PageIsFull(page))
289  {
290  ((PageHeader) page)->pd_prune_xid = prstate.new_prune_xid;
291  PageClearFull(page);
292  MarkBufferDirtyHint(buffer, true);
293  }
294  }
295 
297 
298  /*
299  * If requested, report the number of tuples reclaimed to pgstats. This is
300  * ndeleted minus ndead, because we don't want to count a now-DEAD root
301  * item as a deletion for this purpose.
302  */
303  if (report_stats && ndeleted > prstate.ndead)
304  pgstat_update_heap_dead_tuples(relation, ndeleted - prstate.ndead);
305 
306  *latestRemovedXid = prstate.latestRemovedXid;
307 
308  /*
309  * XXX Should we update the FSM information of this page ?
310  *
311  * There are two schools of thought here. We may not want to update FSM
312  * information so that the page is not used for unrelated UPDATEs/INSERTs
313  * and any free space in this page will remain available for further
314  * UPDATEs in *this* page, thus improving chances for doing HOT updates.
315  *
316  * But for a large table and where a page does not receive further UPDATEs
317  * for a long time, we might waste this space by not updating the FSM
318  * information. The relation may get extended and fragmented further.
319  *
320  * One possibility is to leave "fillfactor" worth of space in this page
321  * and update FSM with the remaining space.
322  */
323 
324  return ndeleted;
325 }
static int heap_prune_chain(Relation relation, Buffer buffer, OffsetNumber rootoffnum, TransactionId OldestXmin, PruneState *prstate)
Definition: pruneheap.c:354
int nredirected
Definition: pruneheap.c:36
void pgstat_update_heap_dead_tuples(Relation rel, int delta)
Definition: pgstat.c:1935
void MarkBufferDirtyHint(Buffer buffer, bool buffer_std)
Definition: bufmgr.c:3362
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1445
#define END_CRIT_SECTION()
Definition: miscadmin.h:132
#define ItemIdIsUsed(itemId)
Definition: itemid.h:91
#define START_CRIT_SECTION()
Definition: miscadmin.h:130
OffsetNumber nowdead[MaxHeapTuplesPerPage]
Definition: pruneheap.c:41
#define ItemIdIsDead(itemId)
Definition: itemid.h:112
bool marked[MaxHeapTuplesPerPage+1]
Definition: pruneheap.c:44
#define PageGetMaxOffsetNumber(page)
Definition: bufpage.h:354
TransactionId new_prune_xid
Definition: pruneheap.c:33
#define PageIsFull(page)
Definition: bufpage.h:375
int nunused
Definition: pruneheap.c:38
uint16 OffsetNumber
Definition: off.h:24
TransactionId latestRemovedXid
Definition: pruneheap.c:34
#define FirstOffsetNumber
Definition: off.h:27
#define InvalidTransactionId
Definition: transam.h:31
static TransactionId OldestXmin
Definition: vacuumlazy.c:138
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define PageClearFull(page)
Definition: bufpage.h:379
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:232
void heap_page_prune_execute(Buffer buffer, OffsetNumber *redirected, int nredirected, OffsetNumber *nowdead, int ndead, OffsetNumber *nowunused, int nunused)
Definition: pruneheap.c:680
PageHeaderData * PageHeader
Definition: bufpage.h:162
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define OffsetNumberNext(offsetNumber)
Definition: off.h:53
OffsetNumber nowunused[MaxHeapTuplesPerPage]
Definition: pruneheap.c:42
XLogRecPtr log_heap_clean(Relation reln, Buffer buffer, OffsetNumber *redirected, int nredirected, OffsetNumber *nowdead, int ndead, OffsetNumber *nowunused, int nunused, TransactionId latestRemovedXid)
Definition: heapam.c:7386
#define RelationNeedsWAL(relation)
Definition: rel.h:502
OffsetNumber redirected[MaxHeapTuplesPerPage *2]
Definition: pruneheap.c:40
int ndead
Definition: pruneheap.c:37
#define PageSetLSN(page, lsn)
Definition: bufpage.h:365
Pointer Page
Definition: bufpage.h:74
void heap_page_prune_execute ( Buffer  buffer,
OffsetNumber redirected,
int  nredirected,
OffsetNumber nowdead,
int  ndead,
OffsetNumber nowunused,
int  nunused 
)

Definition at line 680 of file pruneheap.c.

References BufferGetPage, i, ItemIdSetDead, ItemIdSetRedirect, ItemIdSetUnused, PageGetItemId, and PageRepairFragmentation().

Referenced by heap_page_prune(), and heap_xlog_clean().

684 {
685  Page page = (Page) BufferGetPage(buffer);
686  OffsetNumber *offnum;
687  int i;
688 
689  /* Update all redirected line pointers */
690  offnum = redirected;
691  for (i = 0; i < nredirected; i++)
692  {
693  OffsetNumber fromoff = *offnum++;
694  OffsetNumber tooff = *offnum++;
695  ItemId fromlp = PageGetItemId(page, fromoff);
696 
697  ItemIdSetRedirect(fromlp, tooff);
698  }
699 
700  /* Update all now-dead line pointers */
701  offnum = nowdead;
702  for (i = 0; i < ndead; i++)
703  {
704  OffsetNumber off = *offnum++;
705  ItemId lp = PageGetItemId(page, off);