1/*-------------------------------------------------------------------------
4 * POSTGRES heap tuple header definitions.
7 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
10 * src/include/access/htup_details.h
12 *-------------------------------------------------------------------------
25 * MaxTupleAttributeNumber limits the number of (user) columns in a tuple.
26 * The key limit on this value is that the size of the fixed overhead for
27 * a tuple, plus the size of the null-values bitmap (at 1 bit per column),
28 * plus MAXALIGN alignment, must fit into t_hoff which is uint8. On most
29 * machines the upper limit without making t_hoff wider would be a little
30 * over 1700. We use round numbers here and for MaxHeapAttributeNumber
31 * so that alterations in HeapTupleHeaderData layout won't change the
32 * supported max number of columns.
34 #define MaxTupleAttributeNumber 1664 /* 8 * 208 */
37 * MaxHeapAttributeNumber limits the number of (user) columns in a table.
38 * This should be somewhat less than MaxTupleAttributeNumber. It must be
39 * at least one less, else we will fail to do UPDATEs on a maximal-width
40 * table (because UPDATE has to form working tuples that include CTID).
41 * In practice we want some additional daylight so that we can gracefully
42 * support operations that add hidden "resjunk" columns, for example
43 * SELECT * FROM wide_table ORDER BY foo, bar, baz.
44 * In any case, depending on column data types you will likely be running
45 * into the disk-block-based limit on overall tuple size if you have more
46 * than a thousand or so columns. TOAST won't help.
48 #define MaxHeapAttributeNumber 1600 /* 8 * 200 */
51 * Heap tuple header. To avoid wasting space, the fields should be
52 * laid out in such a way as to avoid structure padding.
54 * Datums of composite types (row types) share the same general structure
55 * as on-disk tuples, so that the same routines can be used to build and
56 * examine them. However the requirements are slightly different: a Datum
57 * does not need any transaction visibility information, and it does need
58 * a length word and some embedded type information. We can achieve this
59 * by overlaying the xmin/cmin/xmax/cmax/xvac fields of a heap tuple
60 * with the fields needed in the Datum case. Typically, all tuples built
61 * in-memory will be initialized with the Datum fields; but when a tuple is
62 * about to be inserted in a table, the transaction fields will be filled,
63 * overwriting the datum fields.
65 * The overall structure of a heap tuple looks like:
66 * fixed fields (HeapTupleHeaderData struct)
67 * nulls bitmap (if HEAP_HASNULL is set in t_infomask)
68 * alignment padding (as needed to make user data MAXALIGN'd)
69 * object ID (if HEAP_HASOID_OLD is set in t_infomask, not created
73 * We store five "virtual" fields Xmin, Cmin, Xmax, Cmax, and Xvac in three
74 * physical fields. Xmin and Xmax are always really stored, but Cmin, Cmax
75 * and Xvac share a field. This works because we know that Cmin and Cmax
76 * are only interesting for the lifetime of the inserting and deleting
77 * transaction respectively. If a tuple is inserted and deleted in the same
78 * transaction, we store a "combo" command id that can be mapped to the real
79 * cmin and cmax, but only by use of local state within the originating
80 * backend. See combocid.c for more details. Meanwhile, Xvac is only set by
81 * old-style VACUUM FULL, which does not have any command sub-structure and so
82 * does not need either Cmin or Cmax. (This requires that old-style VACUUM
83 * FULL never try to move a tuple whose Cmin or Cmax is still interesting,
84 * ie, an insert-in-progress or delete-in-progress tuple.)
86 * A word about t_ctid: whenever a new tuple is stored on disk, its t_ctid
87 * is initialized with its own TID (location). If the tuple is ever updated,
88 * its t_ctid is changed to point to the replacement version of the tuple. Or
89 * if the tuple is moved from one partition to another, due to an update of
90 * the partition key, t_ctid is set to a special value to indicate that
91 * (see ItemPointerSetMovedPartitions). Thus, a tuple is the latest version
92 * of its row iff XMAX is invalid or
93 * t_ctid points to itself (in which case, if XMAX is valid, the tuple is
94 * either locked or deleted). One can follow the chain of t_ctid links
95 * to find the newest version of the row, unless it was moved to a different
96 * partition. Beware however that VACUUM might
97 * erase the pointed-to (newer) tuple before erasing the pointing (older)
98 * tuple. Hence, when following a t_ctid link, it is necessary to check
99 * to see if the referenced slot is empty or contains an unrelated tuple.
100 * Check that the referenced tuple has XMIN equal to the referencing tuple's
101 * XMAX to verify that it is actually the descendant version and not an
102 * unrelated tuple stored into a slot recently freed by VACUUM. If either
103 * check fails, one may assume that there is no live descendant version.
105 * t_ctid is sometimes used to store a speculative insertion token, instead
106 * of a real TID. A speculative token is set on a tuple that's being
107 * inserted, until the inserter is sure that it wants to go ahead with the
108 * insertion. Hence a token should only be seen on a tuple with an XMAX
109 * that's still in-progress, or invalid/aborted. The token is replaced with
110 * the tuple's real TID when the insertion is confirmed. One should never
111 * see a speculative insertion token while following a chain of t_ctid links,
112 * because they are not used on updates, only insertions.
114 * Following the fixed header fields, the nulls bitmap is stored (beginning
115 * at t_bits). The bitmap is *not* stored if t_infomask shows that there
116 * are no nulls in the tuple. If an OID field is present (as indicated by
117 * t_infomask), then it is stored just before the user data, which begins at
118 * the offset shown by t_hoff. Note that t_hoff must be a multiple of
143 * datum_typeid cannot be a domain over composite, only plain composite,
144 * even if the datum is meant as a value of a domain-over-composite type.
145 * This is in line with the general principle that CoerceToDomain does not
146 * change the physical representation of the base type value.
148 * Note: field ordering is chosen with thought that Oid might someday
162 * speculative insertion token) */
164 /* Fields below here must match MinimalTupleData! */
166 #define FIELDNO_HEAPTUPLEHEADERDATA_INFOMASK2 2
169 #define FIELDNO_HEAPTUPLEHEADERDATA_INFOMASK 3
172 #define FIELDNO_HEAPTUPLEHEADERDATA_HOFF 4
175 /* ^ - 23 bytes - ^ */
177 #define FIELDNO_HEAPTUPLEHEADERDATA_BITS 5
180 /* MORE DATA FOLLOWS AT END OF STRUCT */
183/* typedef appears in htup.h */
185 #define SizeofHeapTupleHeader offsetof(HeapTupleHeaderData, t_bits)
188 * information stored in t_infomask:
190 #define HEAP_HASNULL 0x0001 /* has null attribute(s) */
191 #define HEAP_HASVARWIDTH 0x0002 /* has variable-width attribute(s) */
192 #define HEAP_HASEXTERNAL 0x0004 /* has external stored attribute(s) */
193 #define HEAP_HASOID_OLD 0x0008 /* has an object-id field */
194 #define HEAP_XMAX_KEYSHR_LOCK 0x0010 /* xmax is a key-shared locker */
195 #define HEAP_COMBOCID 0x0020 /* t_cid is a combo CID */
196 #define HEAP_XMAX_EXCL_LOCK 0x0040 /* xmax is exclusive locker */
197 #define HEAP_XMAX_LOCK_ONLY 0x0080 /* xmax, if valid, is only a locker */
199 /* xmax is a shared locker */
200 #define HEAP_XMAX_SHR_LOCK (HEAP_XMAX_EXCL_LOCK | HEAP_XMAX_KEYSHR_LOCK)
202 #define HEAP_LOCK_MASK (HEAP_XMAX_SHR_LOCK | HEAP_XMAX_EXCL_LOCK | \
203 HEAP_XMAX_KEYSHR_LOCK)
204 #define HEAP_XMIN_COMMITTED 0x0100 /* t_xmin committed */
205 #define HEAP_XMIN_INVALID 0x0200 /* t_xmin invalid/aborted */
206 #define HEAP_XMIN_FROZEN (HEAP_XMIN_COMMITTED|HEAP_XMIN_INVALID)
207 #define HEAP_XMAX_COMMITTED 0x0400 /* t_xmax committed */
208 #define HEAP_XMAX_INVALID 0x0800 /* t_xmax invalid/aborted */
209 #define HEAP_XMAX_IS_MULTI 0x1000 /* t_xmax is a MultiXactId */
210 #define HEAP_UPDATED 0x2000 /* this is UPDATEd version of row */
211 #define HEAP_MOVED_OFF 0x4000 /* moved to another place by pre-9.0
212 * VACUUM FULL; kept for binary
214#define HEAP_MOVED_IN 0x8000 /* moved from another place by pre-9.0
215 * VACUUM FULL; kept for binary
217#define HEAP_MOVED (HEAP_MOVED_OFF | HEAP_MOVED_IN)
219#define HEAP_XACT_MASK 0xFFF0 /* visibility-related bits */
222 * A tuple is only locked (i.e. not updated by its Xmax) if the
223 * HEAP_XMAX_LOCK_ONLY bit is set; or, for pg_upgrade's sake, if the Xmax is
224 * not a multi and the EXCL_LOCK bit is set.
226 * See also HeapTupleHeaderIsOnlyLocked, which also checks for a possible
227 * aborted updater transaction.
237 * A tuple that has HEAP_XMAX_IS_MULTI and HEAP_XMAX_LOCK_ONLY but neither of
238 * HEAP_XMAX_EXCL_LOCK and HEAP_XMAX_KEYSHR_LOCK must come from a tuple that was
239 * share-locked in 9.2 or earlier and then pg_upgrade'd.
241 * In 9.2 and prior, HEAP_XMAX_IS_MULTI was only set when there were multiple
242 * FOR SHARE lockers of that tuple. That set HEAP_XMAX_LOCK_ONLY (with a
243 * different name back then) but neither of HEAP_XMAX_EXCL_LOCK and
244 * HEAP_XMAX_KEYSHR_LOCK. That combination is no longer possible in 9.3 and
245 * up, so if we see that combination we know for certain that the tuple was
246 * locked in an earlier release; since all such lockers are gone (they cannot
247 * survive through pg_upgrade), such tuples can safely be considered not
250 * We must not resolve such multixacts locally, because the result would be
251 * bogus, regardless of where they stand with respect to the current valid
264 * Use these to test whether a particular lock is applied to a tuple
284/* turn these all off when Xmax is to change */
285#define HEAP_XMAX_BITS (HEAP_XMAX_COMMITTED | HEAP_XMAX_INVALID | \
286 HEAP_XMAX_IS_MULTI | HEAP_LOCK_MASK | HEAP_XMAX_LOCK_ONLY)
289 * information stored in t_infomask2:
291 #define HEAP_NATTS_MASK 0x07FF /* 11 bits for number of attributes */
292/* bits 0x1800 are available */
293 #define HEAP_KEYS_UPDATED 0x2000 /* tuple was updated and key cols
294 * modified, or tuple deleted */
295#define HEAP_HOT_UPDATED 0x4000 /* tuple was HOT-updated */
296#define HEAP_ONLY_TUPLE 0x8000 /* this is heap-only tuple */
298#define HEAP2_XACT_MASK 0xE000 /* visibility-related bits */
301 * HEAP_TUPLE_HAS_MATCH is a temporary flag used during hash joins. It is
302 * only used in tuples that are in the hash table, and those don't need
303 * any visibility information, so we can overlay it on a visibility flag
304 * instead of using up a dedicated bit.
306#define HEAP_TUPLE_HAS_MATCH HEAP_ONLY_TUPLE /* tuple has a join match */
309 * HeapTupleHeader accessor functions
315 * HeapTupleHeaderGetRawXmin returns the "raw" xmin field, which is the xid
316 * originally used to insert the tuple. However, the tuple might actually
317 * be frozen (via HeapTupleHeaderSetXminFrozen) in which case the tuple's xmin
318 * is visible to every snapshot. Prior to PostgreSQL 9.4, we actually changed
319 * the xmin to FrozenTransactionId, and that value may still be encountered
395 * HeapTupleHeaderGetRawXmax gets you the raw Xmax field. To find out the Xid
396 * that updated a tuple, you might need to resolve the MultiXactId if certain
397 * bits are set. HeapTupleHeaderGetUpdateXid checks those bits and takes care
398 * to resolve the MultiXactId if necessary. This might involve multixact I/O,
399 * so it should only be used if absolutely necessary.
414 * HeapTupleHeaderGetRawCommandId will give you what's in the header whether
415 * it is useful or not. Most code should use HeapTupleHeaderGetCmin or
416 * HeapTupleHeaderGetCmax instead, but note that those Assert that you can
417 * get a legitimate result, ie you are in the originating transaction!
425/* SetCmin is reasonably simple since we never need a combo CID */
434/* SetCmax must be used after HeapTupleHeaderAdjustCmax; see combocid.c */
463 "invalid speculative token constant");
533 * Note that we stop considering a tuple HOT-updated as soon as it is known
534 * aborted or the would-be updating transaction is known aborted. For best
535 * efficiency, check tuple visibility before using this function, so that the
536 * INVALID bits will be as up to date as possible.
578 * These are used with both HeapTuple and MinimalTuple, so they must be
582#define HeapTupleHeaderGetNatts(tup) \
583 ((tup)->t_infomask2 & HEAP_NATTS_MASK)
585 #define HeapTupleHeaderSetNatts(tup, natts) \
587 (tup)->t_infomask2 = ((tup)->t_infomask2 & ~HEAP_NATTS_MASK) | (natts) \
590#define HeapTupleHeaderHasExternal(tup) \
591 (((tup)->t_infomask & HEAP_HASEXTERNAL) != 0)
596 * Computes size of null bitmap given number of data columns.
601 return (NATTS + 7) / 8;
605 * MaxHeapTupleSize is the maximum allowed size of a heap tuple, including
606 * header and MAXALIGN alignment padding. Basically it's BLCKSZ minus the
607 * other stuff that has to be on a disk page. Since heap pages use no
608 * "special space", there's no deduction for that.
610 * NOTE: we allow for the ItemId that must point to the tuple, ensuring that
611 * an otherwise-empty page can indeed hold a tuple of this size. Because
612 * ItemIds and tuples have different alignment requirements, don't assume that
613 * you can, say, fit 2 tuples of size MaxHeapTupleSize/2 on the same page.
615#define MaxHeapTupleSize (BLCKSZ - MAXALIGN(SizeOfPageHeaderData + sizeof(ItemIdData)))
616#define MinHeapTupleSize MAXALIGN(SizeofHeapTupleHeader)
619 * MaxHeapTuplesPerPage is an upper bound on the number of tuples that can
620 * fit on one heap page. (Note that indexes could have more, because they
621 * use a smaller tuple header.) We arrive at the divisor because each tuple
622 * must be maxaligned, and it must have an associated line pointer.
624 * Note: with HOT, there could theoretically be more line pointers (not actual
625 * tuples) than this on a heap page. However we constrain the number of line
626 * pointers to this anyway, to avoid excessive line-pointer bloat and not
627 * require increases in the size of work arrays.
629#define MaxHeapTuplesPerPage \
630 ((int) ((BLCKSZ - SizeOfPageHeaderData) / \
631 (MAXALIGN(SizeofHeapTupleHeader) + sizeof(ItemIdData))))
634 * MaxAttrSize is a somewhat arbitrary upper limit on the declared size of
635 * data fields of char(n) and similar types. It need not have anything
636 * directly to do with the *actual* upper limit of varlena values, which
637 * is currently 1Gb (see TOAST structures in varatt.h). I've set it
638 * at 10Mb which seems like a reasonable number --- tgl 8/6/00.
640#define MaxAttrSize (10 * 1024 * 1024)
644 * MinimalTuple is an alternative representation that is used for transient
645 * tuples inside the executor, in places where transaction status information
646 * is not required, the tuple rowtype is known, and shaving off a few bytes
647 * is worthwhile because we need to store many tuples. The representation
648 * is chosen so that tuple access routines can work with either full or
649 * minimal tuples via a HeapTupleData pointer structure. The access routines
650 * see no difference, except that they must not access the transaction status
651 * or t_ctid fields because those aren't there.
653 * For the most part, MinimalTuples should be accessed via TupleTableSlot
654 * routines. These routines will prevent access to the "system columns"
655 * and thereby prevent accidental use of the nonexistent fields.
657 * MinimalTupleData contains a length word, some padding, and fields matching
658 * HeapTupleHeaderData beginning with t_infomask2. The padding is chosen so
659 * that offsetof(t_infomask2) is the same modulo MAXIMUM_ALIGNOF in both
660 * structs. This makes data alignment rules equivalent in both cases.
662 * When a minimal tuple is accessed via a HeapTupleData pointer, t_data is
663 * set to point MINIMAL_TUPLE_OFFSET bytes before the actual start of the
664 * minimal tuple --- that is, where a full tuple matching the minimal tuple's
665 * data would start. This trick is what makes the structs seem equivalent.
667 * Note that t_hoff is computed the same as in a full tuple, hence it includes
668 * the MINIMAL_TUPLE_OFFSET distance. t_len does not include that, however.
670 * MINIMAL_TUPLE_DATA_OFFSET is the offset to the first useful (non-pad) data
671 * other than the length word. tuplesort.c and tuplestore.c use this to avoid
672 * writing the padding to disk.
674#define MINIMAL_TUPLE_OFFSET \
675 ((offsetof(HeapTupleHeaderData, t_infomask2) - sizeof(uint32)) / MAXIMUM_ALIGNOF * MAXIMUM_ALIGNOF)
676 #define MINIMAL_TUPLE_PADDING \
677 ((offsetof(HeapTupleHeaderData, t_infomask2) - sizeof(uint32)) % MAXIMUM_ALIGNOF)
678 #define MINIMAL_TUPLE_DATA_OFFSET \
679 offsetof(MinimalTupleData, t_infomask2)
687 /* Fields below here must match HeapTupleHeaderData! */
693 uint8 t_hoff;
/* sizeof header incl. bitmap, padding */
695 /* ^ - 23 bytes - ^ */
699 /* MORE DATA FOLLOWS AT END OF STRUCT */
702/* typedef appears in htup.h */
704#define SizeofMinimalTupleHeader offsetof(MinimalTupleData, t_bits)
707 * MinimalTuple accessor functions
730 * GETSTRUCT - given a HeapTuple pointer, return address of the user data
739 * Accessor functions to be used with HeapTuple pointers.
808/* prototypes for functions in common/heaptuple.c */
821 int attnum,
bool *isnull);
829 const Datum *replValues,
830 const bool *replIsnull,
831 const bool *doReplace);
836 const Datum *replValues,
837 const bool *replIsnull);
855 * Fetch a user attribute's value as a Datum (might be either a
856 * value, or a pointer into the data area of the tuple).
858 * This must not be used when a system attribute might be requested.
859 * Furthermore, the passed attnum MUST be valid. Use heap_getattr()
860 * instead, if in doubt.
862 * This gets called many times, so we macro the cacheable and NULL
863 * lookups, and call nocachegetattr() for the rest.
896 * Extract an attribute of a heap tuple and return it as a Datum.
897 * This works for either system or user attributes. The given attnum
898 * is properly range-checked.
900 * If the field in question has a NULL value, we return a zero Datum
901 * and set *isnull == true. Otherwise, we set *isnull == false.
903 * <tup> is the pointer to the heap tuple. <attnum> is the attribute
904 * number of the column (field) caller wants. <tupleDesc> is a
905 * pointer to the structure describing the row and all its fields.
923#endif /* HTUP_DETAILS_H */
static Datum values[MAXATTR]
#define FLEXIBLE_ARRAY_MEMBER
Assert(PointerIsAligned(start, uint64))
TransactionId HeapTupleGetUpdateXid(const HeapTupleHeaderData *tup)
Size heap_compute_data_size(TupleDesc tupleDesc, const Datum *values, const bool *isnull)
static bool HEAP_XMAX_IS_SHR_LOCKED(int16 infomask)
#define HEAP_XMAX_SHR_LOCK
static bool HeapTupleIsHotUpdated(const HeapTupleData *tuple)
static Datum heap_getattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
static bool HeapTupleHeaderXminFrozen(const HeapTupleHeaderData *tup)
struct HeapTupleFields HeapTupleFields
static void HeapTupleHeaderClearHeapOnly(HeapTupleHeaderData *tup)
#define HEAP_XMIN_COMMITTED
#define HeapTupleHeaderGetNatts(tup)
static void HeapTupleHeaderSetXminFrozen(HeapTupleHeaderData *tup)
HeapTuple heap_modify_tuple(HeapTuple tuple, TupleDesc tupleDesc, const Datum *replValues, const bool *replIsnull, const bool *doReplace)
void heap_copytuple_with_tuple(HeapTuple src, HeapTuple dest)
HeapTuple heap_copytuple(HeapTuple tuple)
static void HeapTupleHeaderSetTypMod(HeapTupleHeaderData *tup, int32 typmod)
size_t varsize_any(void *p)
static bool HeapTupleHasNulls(const HeapTupleData *tuple)
MinimalTuple heap_copy_minimal_tuple(MinimalTuple mtup, Size extra)
static void HeapTupleHeaderSetSpeculativeToken(HeapTupleHeaderData *tup, BlockNumber token)
Datum heap_getsysattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
static void HeapTupleHeaderSetMatch(MinimalTupleData *tup)
static bool HEAP_XMAX_IS_LOCKED_ONLY(uint16 infomask)
static int BITMAPLEN(int NATTS)
static bool HeapTupleHeaderXminInvalid(const HeapTupleHeaderData *tup)
static void HeapTupleClearHotUpdated(const HeapTupleData *tuple)
static int32 HeapTupleHeaderGetTypMod(const HeapTupleHeaderData *tup)
static bool HeapTupleHasExternal(const HeapTupleData *tuple)
static TransactionId HeapTupleHeaderGetXvac(const HeapTupleHeaderData *tup)
MinimalTuple heap_form_minimal_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull, Size extra)
static void HeapTupleHeaderSetXminInvalid(HeapTupleHeaderData *tup)
static bool HeapTupleAllFixed(const HeapTupleData *tuple)
static void HeapTupleHeaderSetCmax(HeapTupleHeaderData *tup, CommandId cid, bool iscombo)
static void HeapTupleHeaderSetTypeId(HeapTupleHeaderData *tup, Oid datum_typeid)
#define HEAP_XMAX_LOCK_ONLY
static void HeapTupleHeaderClearHotUpdated(HeapTupleHeaderData *tup)
static void HeapTupleHeaderSetCmin(HeapTupleHeaderData *tup, CommandId cid)
static CommandId HeapTupleHeaderGetRawCommandId(const HeapTupleHeaderData *tup)
HeapTuple heap_modify_tuple_by_cols(HeapTuple tuple, TupleDesc tupleDesc, int nCols, const int *replCols, const Datum *replValues, const bool *replIsnull)
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
static TransactionId HeapTupleHeaderGetRawXmax(const HeapTupleHeaderData *tup)
static bool HeapTupleHeaderIsHeapOnly(const HeapTupleHeaderData *tup)
static void HeapTupleHeaderClearMatch(MinimalTupleData *tup)
void heap_free_minimal_tuple(MinimalTuple mtup)
static bool HeapTupleIsHeapOnly(const HeapTupleData *tuple)
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Datum nocachegetattr(HeapTuple tup, int attnum, TupleDesc tupleDesc)
static void HeapTupleSetHeapOnly(const HeapTupleData *tuple)
static bool HeapTupleNoNulls(const HeapTupleData *tuple)
static bool HEAP_XMAX_IS_KEYSHR_LOCKED(int16 infomask)
static void HeapTupleHeaderSetXminCommitted(HeapTupleHeaderData *tup)
#define HEAP_TUPLE_HAS_MATCH
Datum getmissingattr(TupleDesc tupleDesc, int attnum, bool *isnull)
static void HeapTupleHeaderSetHeapOnly(HeapTupleHeaderData *tup)
#define HEAP_XMAX_IS_MULTI
MinimalTuple minimal_tuple_from_heap_tuple(HeapTuple htup, Size extra)
HeapTuple heap_expand_tuple(HeapTuple sourceTuple, TupleDesc tupleDesc)
static bool HeapTupleHeaderHasMatch(const MinimalTupleData *tup)
static TransactionId HeapTupleHeaderGetXmin(const HeapTupleHeaderData *tup)
void heap_fill_tuple(TupleDesc tupleDesc, const Datum *values, const bool *isnull, char *data, Size data_size, uint16 *infomask, bits8 *bit)
static void HeapTupleHeaderSetXvac(HeapTupleHeaderData *tup, TransactionId xid)
struct DatumTupleFields DatumTupleFields
void heap_deform_tuple(HeapTuple tuple, TupleDesc tupleDesc, Datum *values, bool *isnull)
#define HEAP_XMIN_INVALID
static bool HeapTupleHeaderIndicatesMovedPartitions(const HeapTupleHeaderData *tup)
static void HeapTupleSetHotUpdated(const HeapTupleData *tuple)
#define HEAP_XMAX_EXCL_LOCK
static BlockNumber HeapTupleHeaderGetSpeculativeToken(const HeapTupleHeaderData *tup)
static bool HeapTupleHeaderIsHotUpdated(const HeapTupleHeaderData *tup)
#define HEAP_XMAX_INVALID
static void HeapTupleHeaderSetDatumLength(HeapTupleHeaderData *tup, uint32 len)
#define MINIMAL_TUPLE_PADDING
static TransactionId HeapTupleHeaderGetRawXmin(const HeapTupleHeaderData *tup)
static uint32 HeapTupleHeaderGetDatumLength(const HeapTupleHeaderData *tup)
static void * GETSTRUCT(const HeapTupleData *tuple)
static void HeapTupleClearHeapOnly(const HeapTupleData *tuple)
Datum heap_copy_tuple_as_datum(HeapTuple tuple, TupleDesc tupleDesc)
static bool HeapTupleHeaderIsSpeculative(const HeapTupleHeaderData *tup)
static TransactionId HeapTupleHeaderGetUpdateXid(const HeapTupleHeaderData *tup)
StaticAssertDecl(MaxOffsetNumber< SpecTokenOffsetNumber, "invalid speculative token constant")
static void HeapTupleHeaderSetXmin(HeapTupleHeaderData *tup, TransactionId xid)
static bool HEAP_LOCKED_UPGRADED(uint16 infomask)
#define HEAP_XMAX_KEYSHR_LOCK
static bool HEAP_XMAX_IS_EXCL_LOCKED(int16 infomask)
static Oid HeapTupleHeaderGetTypeId(const HeapTupleHeaderData *tup)
HeapTuple heap_tuple_from_minimal_tuple(MinimalTuple mtup)
MinimalTuple minimal_expand_tuple(HeapTuple sourceTuple, TupleDesc tupleDesc)
static void HeapTupleHeaderSetMovedPartitions(HeapTupleHeaderData *tup)
static Datum fastgetattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
void heap_freetuple(HeapTuple htup)
static void HeapTupleHeaderSetXmax(HeapTupleHeaderData *tup, TransactionId xid)
static bool HeapTupleHasVarWidth(const HeapTupleData *tuple)
static bool HeapTupleHeaderXminCommitted(const HeapTupleHeaderData *tup)
static void HeapTupleHeaderSetHotUpdated(HeapTupleHeaderData *tup)
static void ItemPointerSet(ItemPointerData *pointer, BlockNumber blockNumber, OffsetNumber offNum)
static bool ItemPointerIndicatesMovedPartitions(const ItemPointerData *pointer)
static void ItemPointerSetMovedPartitions(ItemPointerData *pointer)
static OffsetNumber ItemPointerGetOffsetNumberNoCheck(const ItemPointerData *pointer)
static BlockNumber ItemPointerGetBlockNumber(const ItemPointerData *pointer)
#define SpecTokenOffsetNumber
union HeapTupleFields::@48 t_field3
char mt_padding[MINIMAL_TUPLE_PADDING]
bits8 t_bits[FLEXIBLE_ARRAY_MEMBER]
#define FrozenTransactionId
#define InvalidTransactionId
static CompactAttribute * TupleDescCompactAttr(TupleDesc tupdesc, int i)
static bool att_isnull(int ATT, const bits8 *BITS)
static Size VARSIZE(const void *PTR)
static void SET_VARSIZE(void *PTR, Size len)
Datum bit(PG_FUNCTION_ARGS)