PostgreSQL Source Code  git master
heaptuple.c File Reference
#include "postgres.h"
#include "access/heaptoast.h"
#include "access/sysattr.h"
#include "access/tupdesc_details.h"
#include "common/hashfn.h"
#include "executor/tuptable.h"
#include "utils/datum.h"
#include "utils/expandeddatum.h"
#include "utils/hsearch.h"
#include "utils/memutils.h"
Include dependency graph for heaptuple.c:

Go to the source code of this file.

Data Structures

struct  missing_cache_key
 

Macros

#define ATT_IS_PACKABLE(att)    ((att)->attlen == -1 && (att)->attstorage != TYPSTORAGE_PLAIN)
 
#define VARLENA_ATT_IS_PACKABLE(att)    ((att)->attstorage != TYPSTORAGE_PLAIN)
 

Functions

static uint32 missing_hash (const void *key, Size keysize)
 
static int missing_match (const void *key1, const void *key2, Size keysize)
 
static void init_missing_cache ()
 
Datum getmissingattr (TupleDesc tupleDesc, int attnum, bool *isnull)
 
Size heap_compute_data_size (TupleDesc tupleDesc, const Datum *values, const bool *isnull)
 
static void fill_val (Form_pg_attribute att, bits8 **bit, int *bitmask, char **dataP, uint16 *infomask, Datum datum, bool isnull)
 
void heap_fill_tuple (TupleDesc tupleDesc, const Datum *values, const bool *isnull, char *data, Size data_size, uint16 *infomask, bits8 *bit)
 
bool heap_attisnull (HeapTuple tup, int attnum, TupleDesc tupleDesc)
 
Datum nocachegetattr (HeapTuple tup, int attnum, TupleDesc tupleDesc)
 
Datum heap_getsysattr (HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
 
HeapTuple heap_copytuple (HeapTuple tuple)
 
void heap_copytuple_with_tuple (HeapTuple src, HeapTuple dest)
 
static void expand_tuple (HeapTuple *targetHeapTuple, MinimalTuple *targetMinimalTuple, HeapTuple sourceTuple, TupleDesc tupleDesc)
 
MinimalTuple minimal_expand_tuple (HeapTuple sourceTuple, TupleDesc tupleDesc)
 
HeapTuple heap_expand_tuple (HeapTuple sourceTuple, TupleDesc tupleDesc)
 
Datum heap_copy_tuple_as_datum (HeapTuple tuple, TupleDesc tupleDesc)
 
HeapTuple heap_form_tuple (TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
 
HeapTuple heap_modify_tuple (HeapTuple tuple, TupleDesc tupleDesc, const Datum *replValues, const bool *replIsnull, const bool *doReplace)
 
HeapTuple heap_modify_tuple_by_cols (HeapTuple tuple, TupleDesc tupleDesc, int nCols, const int *replCols, const Datum *replValues, const bool *replIsnull)
 
void heap_deform_tuple (HeapTuple tuple, TupleDesc tupleDesc, Datum *values, bool *isnull)
 
void heap_freetuple (HeapTuple htup)
 
MinimalTuple heap_form_minimal_tuple (TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
 
void heap_free_minimal_tuple (MinimalTuple mtup)
 
MinimalTuple heap_copy_minimal_tuple (MinimalTuple mtup)
 
HeapTuple heap_tuple_from_minimal_tuple (MinimalTuple mtup)
 
MinimalTuple minimal_tuple_from_heap_tuple (HeapTuple htup)
 
size_t varsize_any (void *p)
 

Variables

static HTABmissing_cache = NULL
 

Macro Definition Documentation

◆ ATT_IS_PACKABLE

#define ATT_IS_PACKABLE (   att)     ((att)->attlen == -1 && (att)->attstorage != TYPSTORAGE_PLAIN)

Definition at line 81 of file heaptuple.c.

◆ VARLENA_ATT_IS_PACKABLE

#define VARLENA_ATT_IS_PACKABLE (   att)     ((att)->attstorage != TYPSTORAGE_PLAIN)

Definition at line 84 of file heaptuple.c.

Function Documentation

◆ expand_tuple()

static void expand_tuple ( HeapTuple targetHeapTuple,
MinimalTuple targetMinimalTuple,
HeapTuple  sourceTuple,
TupleDesc  tupleDesc 
)
static

Definition at line 829 of file heaptuple.c.

833 {
834  AttrMissing *attrmiss = NULL;
835  int attnum;
836  int firstmissingnum;
837  bool hasNulls = HeapTupleHasNulls(sourceTuple);
838  HeapTupleHeader targetTHeader;
839  HeapTupleHeader sourceTHeader = sourceTuple->t_data;
840  int sourceNatts = HeapTupleHeaderGetNatts(sourceTHeader);
841  int natts = tupleDesc->natts;
842  int sourceNullLen;
843  int targetNullLen;
844  Size sourceDataLen = sourceTuple->t_len - sourceTHeader->t_hoff;
845  Size targetDataLen;
846  Size len;
847  int hoff;
848  bits8 *nullBits = NULL;
849  int bitMask = 0;
850  char *targetData;
851  uint16 *infoMask;
852 
853  Assert((targetHeapTuple && !targetMinimalTuple)
854  || (!targetHeapTuple && targetMinimalTuple));
855 
856  Assert(sourceNatts < natts);
857 
858  sourceNullLen = (hasNulls ? BITMAPLEN(sourceNatts) : 0);
859 
860  targetDataLen = sourceDataLen;
861 
862  if (tupleDesc->constr &&
863  tupleDesc->constr->missing)
864  {
865  /*
866  * If there are missing values we want to put them into the tuple.
867  * Before that we have to compute the extra length for the values
868  * array and the variable length data.
869  */
870  attrmiss = tupleDesc->constr->missing;
871 
872  /*
873  * Find the first item in attrmiss for which we don't have a value in
874  * the source. We can ignore all the missing entries before that.
875  */
876  for (firstmissingnum = sourceNatts;
877  firstmissingnum < natts;
878  firstmissingnum++)
879  {
880  if (attrmiss[firstmissingnum].am_present)
881  break;
882  else
883  hasNulls = true;
884  }
885 
886  /*
887  * Now walk the missing attributes. If there is a missing value make
888  * space for it. Otherwise, it's going to be NULL.
889  */
890  for (attnum = firstmissingnum;
891  attnum < natts;
892  attnum++)
893  {
894  if (attrmiss[attnum].am_present)
895  {
896  Form_pg_attribute att = TupleDescAttr(tupleDesc, attnum);
897 
898  targetDataLen = att_align_datum(targetDataLen,
899  att->attalign,
900  att->attlen,
901  attrmiss[attnum].am_value);
902 
903  targetDataLen = att_addlength_pointer(targetDataLen,
904  att->attlen,
905  attrmiss[attnum].am_value);
906  }
907  else
908  {
909  /* no missing value, so it must be null */
910  hasNulls = true;
911  }
912  }
913  } /* end if have missing values */
914  else
915  {
916  /*
917  * If there are no missing values at all then NULLS must be allowed,
918  * since some of the attributes are known to be absent.
919  */
920  hasNulls = true;
921  }
922 
923  len = 0;
924 
925  if (hasNulls)
926  {
927  targetNullLen = BITMAPLEN(natts);
928  len += targetNullLen;
929  }
930  else
931  targetNullLen = 0;
932 
933  /*
934  * Allocate and zero the space needed. Note that the tuple body and
935  * HeapTupleData management structure are allocated in one chunk.
936  */
937  if (targetHeapTuple)
938  {
939  len += offsetof(HeapTupleHeaderData, t_bits);
940  hoff = len = MAXALIGN(len); /* align user data safely */
941  len += targetDataLen;
942 
943  *targetHeapTuple = (HeapTuple) palloc0(HEAPTUPLESIZE + len);
944  (*targetHeapTuple)->t_data
945  = targetTHeader
946  = (HeapTupleHeader) ((char *) *targetHeapTuple + HEAPTUPLESIZE);
947  (*targetHeapTuple)->t_len = len;
948  (*targetHeapTuple)->t_tableOid = sourceTuple->t_tableOid;
949  (*targetHeapTuple)->t_self = sourceTuple->t_self;
950 
951  targetTHeader->t_infomask = sourceTHeader->t_infomask;
952  targetTHeader->t_hoff = hoff;
953  HeapTupleHeaderSetNatts(targetTHeader, natts);
954  HeapTupleHeaderSetDatumLength(targetTHeader, len);
955  HeapTupleHeaderSetTypeId(targetTHeader, tupleDesc->tdtypeid);
956  HeapTupleHeaderSetTypMod(targetTHeader, tupleDesc->tdtypmod);
957  /* We also make sure that t_ctid is invalid unless explicitly set */
958  ItemPointerSetInvalid(&(targetTHeader->t_ctid));
959  if (targetNullLen > 0)
960  nullBits = (bits8 *) ((char *) (*targetHeapTuple)->t_data
961  + offsetof(HeapTupleHeaderData, t_bits));
962  targetData = (char *) (*targetHeapTuple)->t_data + hoff;
963  infoMask = &(targetTHeader->t_infomask);
964  }
965  else
966  {
968  hoff = len = MAXALIGN(len); /* align user data safely */
969  len += targetDataLen;
970 
971  *targetMinimalTuple = (MinimalTuple) palloc0(len);
972  (*targetMinimalTuple)->t_len = len;
973  (*targetMinimalTuple)->t_hoff = hoff + MINIMAL_TUPLE_OFFSET;
974  (*targetMinimalTuple)->t_infomask = sourceTHeader->t_infomask;
975  /* Same macro works for MinimalTuples */
976  HeapTupleHeaderSetNatts(*targetMinimalTuple, natts);
977  if (targetNullLen > 0)
978  nullBits = (bits8 *) ((char *) *targetMinimalTuple
979  + offsetof(MinimalTupleData, t_bits));
980  targetData = (char *) *targetMinimalTuple + hoff;
981  infoMask = &((*targetMinimalTuple)->t_infomask);
982  }
983 
984  if (targetNullLen > 0)
985  {
986  if (sourceNullLen > 0)
987  {
988  /* if bitmap pre-existed copy in - all is set */
989  memcpy(nullBits,
990  ((char *) sourceTHeader)
991  + offsetof(HeapTupleHeaderData, t_bits),
992  sourceNullLen);
993  nullBits += sourceNullLen - 1;
994  }
995  else
996  {
997  sourceNullLen = BITMAPLEN(sourceNatts);
998  /* Set NOT NULL for all existing attributes */
999  memset(nullBits, 0xff, sourceNullLen);
1000 
1001  nullBits += sourceNullLen - 1;
1002 
1003  if (sourceNatts & 0x07)
1004  {
1005  /* build the mask (inverted!) */
1006  bitMask = 0xff << (sourceNatts & 0x07);
1007  /* Voila */
1008  *nullBits = ~bitMask;
1009  }
1010  }
1011 
1012  bitMask = (1 << ((sourceNatts - 1) & 0x07));
1013  } /* End if have null bitmap */
1014 
1015  memcpy(targetData,
1016  ((char *) sourceTuple->t_data) + sourceTHeader->t_hoff,
1017  sourceDataLen);
1018 
1019  targetData += sourceDataLen;
1020 
1021  /* Now fill in the missing values */
1022  for (attnum = sourceNatts; attnum < natts; attnum++)
1023  {
1024 
1025  Form_pg_attribute attr = TupleDescAttr(tupleDesc, attnum);
1026 
1027  if (attrmiss && attrmiss[attnum].am_present)
1028  {
1029  fill_val(attr,
1030  nullBits ? &nullBits : NULL,
1031  &bitMask,
1032  &targetData,
1033  infoMask,
1034  attrmiss[attnum].am_value,
1035  false);
1036  }
1037  else
1038  {
1039  fill_val(attr,
1040  &nullBits,
1041  &bitMask,
1042  &targetData,
1043  infoMask,
1044  (Datum) 0,
1045  true);
1046  }
1047  } /* end loop over missing attributes */
1048 }
unsigned short uint16
Definition: c.h:494
#define MAXALIGN(LEN)
Definition: c.h:800
uint8 bits8
Definition: c.h:502
size_t Size
Definition: c.h:594
static void fill_val(Form_pg_attribute att, bits8 **bit, int *bitmask, char **dataP, uint16 *infomask, Datum datum, bool isnull)
Definition: heaptuple.c:272
#define HEAPTUPLESIZE
Definition: htup.h:73
HeapTupleData * HeapTuple
Definition: htup.h:71
MinimalTupleData * MinimalTuple
Definition: htup.h:27
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define MINIMAL_TUPLE_OFFSET
Definition: htup_details.h:617
#define HeapTupleHeaderSetTypMod(tup, typmod)
Definition: htup_details.h:471
#define HeapTupleHeaderGetNatts(tup)
Definition: htup_details.h:529
#define SizeofMinimalTupleHeader
Definition: htup_details.h:647
#define BITMAPLEN(NATTS)
Definition: htup_details.h:545
#define HeapTupleHeaderSetNatts(tup, natts)
Definition: htup_details.h:532
#define HeapTupleHeaderSetDatumLength(tup, len)
Definition: htup_details.h:453
#define HeapTupleHasNulls(tuple)
Definition: htup_details.h:659
#define HeapTupleHeaderSetTypeId(tup, typeid)
Definition: htup_details.h:461
static void ItemPointerSetInvalid(ItemPointerData *pointer)
Definition: itemptr.h:184
Assert(fmt[strlen(fmt) - 1] !='\n')
void * palloc0(Size size)
Definition: mcxt.c:1257
int16 attnum
Definition: pg_attribute.h:74
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:209
const void size_t len
uintptr_t Datum
Definition: postgres.h:64
ItemPointerData t_self
Definition: htup.h:65
uint32 t_len
Definition: htup.h:64
HeapTupleHeader t_data
Definition: htup.h:68
Oid t_tableOid
Definition: htup.h:66
ItemPointerData t_ctid
Definition: htup_details.h:161
struct AttrMissing * missing
Definition: tupdesc.h:41
TupleConstr * constr
Definition: tupdesc.h:85
int32 tdtypmod
Definition: tupdesc.h:83
Oid tdtypeid
Definition: tupdesc.h:82
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
#define att_align_datum(cur_offset, attalign, attlen, attdatum)
Definition: tupmacs.h:86
#define att_addlength_pointer(cur_offset, attlen, attptr)
Definition: tupmacs.h:157

References AttrMissing::am_value, Assert(), att_addlength_pointer, att_align_datum, attnum, BITMAPLEN, TupleDescData::constr, fill_val(), HeapTupleHasNulls, HeapTupleHeaderGetNatts, HeapTupleHeaderSetDatumLength, HeapTupleHeaderSetNatts, HeapTupleHeaderSetTypeId, HeapTupleHeaderSetTypMod, HEAPTUPLESIZE, ItemPointerSetInvalid(), len, MAXALIGN, MINIMAL_TUPLE_OFFSET, TupleConstr::missing, TupleDescData::natts, palloc0(), SizeofMinimalTupleHeader, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleHeaderData::t_hoff, HeapTupleHeaderData::t_infomask, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, TupleDescData::tdtypeid, TupleDescData::tdtypmod, and TupleDescAttr.

Referenced by heap_expand_tuple(), and minimal_expand_tuple().

◆ fill_val()

static void fill_val ( Form_pg_attribute  att,
bits8 **  bit,
int *  bitmask,
char **  dataP,
uint16 infomask,
Datum  datum,
bool  isnull 
)
inlinestatic

Definition at line 272 of file heaptuple.c.

279 {
280  Size data_length;
281  char *data = *dataP;
282 
283  /*
284  * If we're building a null bitmap, set the appropriate bit for the
285  * current column value here.
286  */
287  if (bit != NULL)
288  {
289  if (*bitmask != HIGHBIT)
290  *bitmask <<= 1;
291  else
292  {
293  *bit += 1;
294  **bit = 0x0;
295  *bitmask = 1;
296  }
297 
298  if (isnull)
299  {
300  *infomask |= HEAP_HASNULL;
301  return;
302  }
303 
304  **bit |= *bitmask;
305  }
306 
307  /*
308  * XXX we use the att_align macros on the pointer value itself, not on an
309  * offset. This is a bit of a hack.
310  */
311  if (att->attbyval)
312  {
313  /* pass-by-value */
314  data = (char *) att_align_nominal(data, att->attalign);
315  store_att_byval(data, datum, att->attlen);
316  data_length = att->attlen;
317  }
318  else if (att->attlen == -1)
319  {
320  /* varlena */
321  Pointer val = DatumGetPointer(datum);
322 
323  *infomask |= HEAP_HASVARWIDTH;
324  if (VARATT_IS_EXTERNAL(val))
325  {
327  {
328  /*
329  * we want to flatten the expanded value so that the
330  * constructed tuple doesn't depend on it
331  */
332  ExpandedObjectHeader *eoh = DatumGetEOHP(datum);
333 
334  data = (char *) att_align_nominal(data,
335  att->attalign);
336  data_length = EOH_get_flat_size(eoh);
337  EOH_flatten_into(eoh, data, data_length);
338  }
339  else
340  {
341  *infomask |= HEAP_HASEXTERNAL;
342  /* no alignment, since it's short by definition */
343  data_length = VARSIZE_EXTERNAL(val);
344  memcpy(data, val, data_length);
345  }
346  }
347  else if (VARATT_IS_SHORT(val))
348  {
349  /* no alignment for short varlenas */
350  data_length = VARSIZE_SHORT(val);
351  memcpy(data, val, data_length);
352  }
353  else if (VARLENA_ATT_IS_PACKABLE(att) &&
355  {
356  /* convert to short varlena -- no alignment */
357  data_length = VARATT_CONVERTED_SHORT_SIZE(val);
358  SET_VARSIZE_SHORT(data, data_length);
359  memcpy(data + 1, VARDATA(val), data_length - 1);
360  }
361  else
362  {
363  /* full 4-byte header varlena */
364  data = (char *) att_align_nominal(data,
365  att->attalign);
366  data_length = VARSIZE(val);
367  memcpy(data, val, data_length);
368  }
369  }
370  else if (att->attlen == -2)
371  {
372  /* cstring ... never needs alignment */
373  *infomask |= HEAP_HASVARWIDTH;
374  Assert(att->attalign == TYPALIGN_CHAR);
375  data_length = strlen(DatumGetCString(datum)) + 1;
376  memcpy(data, DatumGetPointer(datum), data_length);
377  }
378  else
379  {
380  /* fixed-length pass-by-reference */
381  data = (char *) att_align_nominal(data, att->attalign);
382  Assert(att->attlen > 0);
383  data_length = att->attlen;
384  memcpy(data, DatumGetPointer(datum), data_length);
385  }
386 
387  data += data_length;
388  *dataP = data;
389 }
char * Pointer
Definition: c.h:472
#define HIGHBIT
Definition: c.h:1167
ExpandedObjectHeader * DatumGetEOHP(Datum d)
Definition: expandeddatum.c:29
void EOH_flatten_into(ExpandedObjectHeader *eohptr, void *result, Size allocated_size)
Definition: expandeddatum.c:81
Size EOH_get_flat_size(ExpandedObjectHeader *eohptr)
Definition: expandeddatum.c:75
#define VARLENA_ATT_IS_PACKABLE(att)
Definition: heaptuple.c:84
#define HEAP_HASVARWIDTH
Definition: htup_details.h:191
#define HEAP_HASNULL
Definition: htup_details.h:190
#define HEAP_HASEXTERNAL
Definition: htup_details.h:192
long val
Definition: informix.c:664
const void * data
static char * DatumGetCString(Datum X)
Definition: postgres.h:335
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:312
#define att_align_nominal(cur_offset, attalign)
Definition: tupmacs.h:129
static void store_att_byval(void *T, Datum newdatum, int attlen)
Definition: tupmacs.h:183
#define VARSIZE_SHORT(PTR)
Definition: varatt.h:281
#define SET_VARSIZE_SHORT(PTR, len)
Definition: varatt.h:306
#define VARATT_CAN_MAKE_SHORT(PTR)
Definition: varatt.h:258
#define VARATT_IS_EXTERNAL_EXPANDED(PTR)
Definition: varatt.h:298
#define VARATT_IS_SHORT(PTR)
Definition: varatt.h:302
#define VARDATA(PTR)
Definition: varatt.h:278
#define VARSIZE_EXTERNAL(PTR)
Definition: varatt.h:285
#define VARSIZE(PTR)
Definition: varatt.h:279
#define VARATT_CONVERTED_SHORT_SIZE(PTR)
Definition: varatt.h:261
#define VARATT_IS_EXTERNAL(PTR)
Definition: varatt.h:289
Datum bit(PG_FUNCTION_ARGS)
Definition: varbit.c:391

References Assert(), att_align_nominal, bit(), data, DatumGetCString(), DatumGetEOHP(), DatumGetPointer(), EOH_flatten_into(), EOH_get_flat_size(), HEAP_HASEXTERNAL, HEAP_HASNULL, HEAP_HASVARWIDTH, HIGHBIT, SET_VARSIZE_SHORT, store_att_byval(), val, VARATT_CAN_MAKE_SHORT, VARATT_CONVERTED_SHORT_SIZE, VARATT_IS_EXTERNAL, VARATT_IS_EXTERNAL_EXPANDED, VARATT_IS_SHORT, VARDATA, VARLENA_ATT_IS_PACKABLE, VARSIZE, VARSIZE_EXTERNAL, and VARSIZE_SHORT.

Referenced by expand_tuple(), and heap_fill_tuple().

◆ getmissingattr()

Datum getmissingattr ( TupleDesc  tupleDesc,
int  attnum,
bool isnull 
)

Definition at line 148 of file heaptuple.c.

150 {
151  Form_pg_attribute att;
152 
153  Assert(attnum <= tupleDesc->natts);
154  Assert(attnum > 0);
155 
156  att = TupleDescAttr(tupleDesc, attnum - 1);
157 
158  if (att->atthasmissing)
159  {
160  AttrMissing *attrmiss;
161 
162  Assert(tupleDesc->constr);
163  Assert(tupleDesc->constr->missing);
164 
165  attrmiss = tupleDesc->constr->missing + (attnum - 1);
166 
167  if (attrmiss->am_present)
168  {
170  missing_cache_key *entry;
171  bool found;
172  MemoryContext oldctx;
173 
174  *isnull = false;
175 
176  /* no need to cache by-value attributes */
177  if (att->attbyval)
178  return attrmiss->am_value;
179 
180  /* set up cache if required */
181  if (missing_cache == NULL)
183 
184  /* check if there's a cache entry */
185  Assert(att->attlen > 0 || att->attlen == -1);
186  if (att->attlen > 0)
187  key.len = att->attlen;
188  else
189  key.len = VARSIZE_ANY(attrmiss->am_value);
190  key.value = attrmiss->am_value;
191 
192  entry = hash_search(missing_cache, &key, HASH_ENTER, &found);
193 
194  if (!found)
195  {
196  /* cache miss, so we need a non-transient copy of the datum */
198  entry->value =
199  datumCopy(attrmiss->am_value, false, att->attlen);
200  MemoryContextSwitchTo(oldctx);
201  }
202 
203  return entry->value;
204  }
205  }
206 
207  *isnull = true;
208  return PointerGetDatum(NULL);
209 }
Datum datumCopy(Datum value, bool typByVal, int typLen)
Definition: datum.c:132
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:953
static void init_missing_cache()
Definition: heaptuple.c:123
static HTAB * missing_cache
Definition: heaptuple.c:98
@ HASH_ENTER
Definition: hsearch.h:114
MemoryContext TopMemoryContext
Definition: mcxt.c:141
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:138
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
#define VARSIZE_ANY(PTR)
Definition: varatt.h:311

References AttrMissing::am_present, AttrMissing::am_value, Assert(), attnum, TupleDescData::constr, datumCopy(), HASH_ENTER, hash_search(), init_missing_cache(), sort-test::key, MemoryContextSwitchTo(), TupleConstr::missing, missing_cache, PointerGetDatum(), TopMemoryContext, TupleDescAttr, missing_cache_key::value, and VARSIZE_ANY.

Referenced by heap_getattr().

◆ heap_attisnull()

bool heap_attisnull ( HeapTuple  tup,
int  attnum,
TupleDesc  tupleDesc 
)

Definition at line 456 of file heaptuple.c.

457 {
458  /*
459  * We allow a NULL tupledesc for relations not expected to have missing
460  * values, such as catalog relations and indexes.
461  */
462  Assert(!tupleDesc || attnum <= tupleDesc->natts);
463  if (attnum > (int) HeapTupleHeaderGetNatts(tup->t_data))
464  {
465  if (tupleDesc && TupleDescAttr(tupleDesc, attnum - 1)->atthasmissing)
466  return false;
467  else
468  return true;
469  }
470 
471  if (attnum > 0)
472  {
473  if (HeapTupleNoNulls(tup))
474  return false;
475  return att_isnull(attnum - 1, tup->t_data->t_bits);
476  }
477 
478  switch (attnum)
479  {
486  /* these are never null */
487  break;
488 
489  default:
490  elog(ERROR, "invalid attnum: %d", attnum);
491  }
492 
493  return false;
494 }
#define ERROR
Definition: elog.h:39
#define HeapTupleNoNulls(tuple)
Definition: htup_details.h:662
bits8 t_bits[FLEXIBLE_ARRAY_MEMBER]
Definition: htup_details.h:178
#define MinTransactionIdAttributeNumber
Definition: sysattr.h:22
#define MaxCommandIdAttributeNumber
Definition: sysattr.h:25
#define MaxTransactionIdAttributeNumber
Definition: sysattr.h:24
#define TableOidAttributeNumber
Definition: sysattr.h:26
#define SelfItemPointerAttributeNumber
Definition: sysattr.h:21
#define MinCommandIdAttributeNumber
Definition: sysattr.h:23
static bool att_isnull(int ATT, const bits8 *BITS)
Definition: tupmacs.h:26

References Assert(), att_isnull(), attnum, elog(), ERROR, HeapTupleHeaderGetNatts, HeapTupleNoNulls, MaxCommandIdAttributeNumber, MaxTransactionIdAttributeNumber, MinCommandIdAttributeNumber, MinTransactionIdAttributeNumber, SelfItemPointerAttributeNumber, HeapTupleHeaderData::t_bits, HeapTupleData::t_data, TableOidAttributeNumber, and TupleDescAttr.

Referenced by AlterPublicationOptions(), AlterPublicationSchemas(), build_function_result_tupdesc_t(), check_index_is_clusterable(), CheckIndexCompatible(), ExecEvalRowNullInt(), ExecuteCallStmt(), fmgr_info_cxt_security(), fmgr_symbol(), get_func_result_name(), index_drop(), inline_function(), inline_set_returning_function(), pg_get_indexdef_worker(), pg_get_partkeydef_worker(), pg_get_statisticsobj_worker(), pg_get_statisticsobjdef_expressions(), RelationGetDummyIndexExpressions(), RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), statext_is_kind_built(), and transformFkeyCheckAttrs().

◆ heap_compute_data_size()

Size heap_compute_data_size ( TupleDesc  tupleDesc,
const Datum values,
const bool isnull 
)

Definition at line 216 of file heaptuple.c.

219 {
220  Size data_length = 0;
221  int i;
222  int numberOfAttributes = tupleDesc->natts;
223 
224  for (i = 0; i < numberOfAttributes; i++)
225  {
226  Datum val;
227  Form_pg_attribute atti;
228 
229  if (isnull[i])
230  continue;
231 
232  val = values[i];
233  atti = TupleDescAttr(tupleDesc, i);
234 
235  if (ATT_IS_PACKABLE(atti) &&
237  {
238  /*
239  * we're anticipating converting to a short varlena header, so
240  * adjust length and don't count any alignment
241  */
243  }
244  else if (atti->attlen == -1 &&
246  {
247  /*
248  * we want to flatten the expanded value so that the constructed
249  * tuple doesn't depend on it
250  */
251  data_length = att_align_nominal(data_length, atti->attalign);
252  data_length += EOH_get_flat_size(DatumGetEOHP(val));
253  }
254  else
255  {
256  data_length = att_align_datum(data_length, atti->attalign,
257  atti->attlen, val);
258  data_length = att_addlength_datum(data_length, atti->attlen,
259  val);
260  }
261  }
262 
263  return data_length;
264 }
static Datum values[MAXATTR]
Definition: bootstrap.c:156
#define ATT_IS_PACKABLE(att)
Definition: heaptuple.c:81
int i
Definition: isn.c:73
#define att_addlength_datum(cur_offset, attlen, attdatum)
Definition: tupmacs.h:145

References att_addlength_datum, att_align_datum, att_align_nominal, ATT_IS_PACKABLE, DatumGetEOHP(), DatumGetPointer(), EOH_get_flat_size(), i, TupleDescData::natts, TupleDescAttr, val, values, VARATT_CAN_MAKE_SHORT, VARATT_CONVERTED_SHORT_SIZE, and VARATT_IS_EXTERNAL_EXPANDED.

Referenced by brin_form_tuple(), ER_get_flat_size(), heap_form_minimal_tuple(), heap_form_tuple(), heap_toast_insert_or_update(), index_form_tuple_context(), spgFormLeafTuple(), SpGistGetLeafTupleSize(), and toast_flatten_tuple_to_datum().

◆ heap_copy_minimal_tuple()

MinimalTuple heap_copy_minimal_tuple ( MinimalTuple  mtup)

Definition at line 1536 of file heaptuple.c.

1537 {
1538  MinimalTuple result;
1539 
1540  result = (MinimalTuple) palloc(mtup->t_len);
1541  memcpy(result, mtup, mtup->t_len);
1542  return result;
1543 }
void * palloc(Size size)
Definition: mcxt.c:1226

References palloc(), and MinimalTupleData::t_len.

Referenced by gm_readnext_tuple(), tts_minimal_copy_minimal_tuple(), tts_minimal_materialize(), tuplesort_gettupleslot(), and tuplestore_gettupleslot().

◆ heap_copy_tuple_as_datum()

Datum heap_copy_tuple_as_datum ( HeapTuple  tuple,
TupleDesc  tupleDesc 
)

Definition at line 1081 of file heaptuple.c.

1082 {
1083  HeapTupleHeader td;
1084 
1085  /*
1086  * If the tuple contains any external TOAST pointers, we have to inline
1087  * those fields to meet the conventions for composite-type Datums.
1088  */
1089  if (HeapTupleHasExternal(tuple))
1090  return toast_flatten_tuple_to_datum(tuple->t_data,
1091  tuple->t_len,
1092  tupleDesc);
1093 
1094  /*
1095  * Fast path for easy case: just make a palloc'd copy and insert the
1096  * correct composite-Datum header fields (since those may not be set if
1097  * the given tuple came from disk, rather than from heap_form_tuple).
1098  */
1099  td = (HeapTupleHeader) palloc(tuple->t_len);
1100  memcpy((char *) td, (char *) tuple->t_data, tuple->t_len);
1101 
1103  HeapTupleHeaderSetTypeId(td, tupleDesc->tdtypeid);
1104  HeapTupleHeaderSetTypMod(td, tupleDesc->tdtypmod);
1105 
1106  return PointerGetDatum(td);
1107 }
Datum toast_flatten_tuple_to_datum(HeapTupleHeader tup, uint32 tup_len, TupleDesc tupleDesc)
Definition: heaptoast.c:449
#define HeapTupleHasExternal(tuple)
Definition: htup_details.h:671

References HeapTupleHasExternal, HeapTupleHeaderSetDatumLength, HeapTupleHeaderSetTypeId, HeapTupleHeaderSetTypMod, palloc(), PointerGetDatum(), HeapTupleData::t_data, HeapTupleData::t_len, TupleDescData::tdtypeid, TupleDescData::tdtypmod, and toast_flatten_tuple_to_datum().

Referenced by ExecEvalConvertRowtype(), ExecFetchSlotHeapTupleDatum(), PLyGenericObject_ToComposite(), PLyMapping_ToComposite(), PLySequence_ToComposite(), serialize_expr_stats(), and SPI_returntuple().

◆ heap_copytuple()

HeapTuple heap_copytuple ( HeapTuple  tuple)

Definition at line 777 of file heaptuple.c.

778 {
779  HeapTuple newTuple;
780 
781  if (!HeapTupleIsValid(tuple) || tuple->t_data == NULL)
782  return NULL;
783 
784  newTuple = (HeapTuple) palloc(HEAPTUPLESIZE + tuple->t_len);
785  newTuple->t_len = tuple->t_len;
786  newTuple->t_self = tuple->t_self;
787  newTuple->t_tableOid = tuple->t_tableOid;
788  newTuple->t_data = (HeapTupleHeader) ((char *) newTuple + HEAPTUPLESIZE);
789  memcpy((char *) newTuple->t_data, (char *) tuple->t_data, tuple->t_len);
790  return newTuple;
791 }
#define HeapTupleIsValid(tuple)
Definition: htup.h:78

References HeapTupleIsValid, HEAPTUPLESIZE, palloc(), HeapTupleData::t_data, HeapTupleData::t_len, HeapTupleData::t_self, and HeapTupleData::t_tableOid.

Referenced by AlterConstraintNamespaces(), AlterDomainValidateConstraint(), AlterExtensionNamespace(), AlterSequence(), AlterTypeOwner(), ATExecAlterConstrRecurse(), ATExecSetNotNull(), ATExecValidateConstraint(), changeDependenciesOf(), changeDependenciesOn(), changeDependencyFor(), ConstraintSetParentConstraint(), CopyStatistics(), CreateTriggerFiringOn(), DefineIndex(), dropconstraint_internal(), EnableDisableTrigger(), ExecForceStoreHeapTuple(), expanded_record_set_tuple(), findNotNullConstraintAttnum(), get_catalog_object_by_oid(), GetDatabaseTuple(), GetDatabaseTupleByOid(), index_concurrently_swap(), index_update_stats(), make_expanded_record_from_datum(), MarkInheritDetached(), MergeConstraintsIntoExisting(), MergeWithExistingConstraint(), RelationInitIndexAccessInfo(), RemoveInheritance(), rename_policy(), RenameEnumLabel(), RenameTableSpace(), renametrig_internal(), RenumberEnumType(), ResetSequence(), rewrite_heap_tuple(), ScanPgRelation(), SearchSysCacheCopy(), SearchSysCacheCopyAttName(), SearchSysCacheCopyAttNum(), shdepChangeDep(), SPI_copytuple(), statext_expressions_load(), TriggerSetParentTrigger(), tts_buffer_heap_copy_heap_tuple(), tts_buffer_heap_materialize(), tts_heap_copy_heap_tuple(), tts_heap_materialize(), tuplesort_putheaptuple(), and vac_update_datfrozenxid().

◆ heap_copytuple_with_tuple()

void heap_copytuple_with_tuple ( HeapTuple  src,
HeapTuple  dest 
)

Definition at line 803 of file heaptuple.c.

804 {
805  if (!HeapTupleIsValid(src) || src->t_data == NULL)
806  {
807  dest->t_data = NULL;
808  return;
809  }
810 
811  dest->t_len = src->t_len;
812  dest->t_self = src->t_self;
813  dest->t_tableOid = src->t_tableOid;
814  dest->t_data = (HeapTupleHeader) palloc(src->t_len);
815  memcpy((char *) dest->t_data, (char *) src->t_data, src->t_len);
816 }

References generate_unaccent_rules::dest, HeapTupleIsValid, palloc(), HeapTupleData::t_data, HeapTupleData::t_len, HeapTupleData::t_self, and HeapTupleData::t_tableOid.

◆ heap_deform_tuple()

void heap_deform_tuple ( HeapTuple  tuple,
TupleDesc  tupleDesc,
Datum values,
bool isnull 
)

Definition at line 1346 of file heaptuple.c.

1348 {
1349  HeapTupleHeader tup = tuple->t_data;
1350  bool hasnulls = HeapTupleHasNulls(tuple);
1351  int tdesc_natts = tupleDesc->natts;
1352  int natts; /* number of atts to extract */
1353  int attnum;
1354  char *tp; /* ptr to tuple data */
1355  uint32 off; /* offset in tuple data */
1356  bits8 *bp = tup->t_bits; /* ptr to null bitmap in tuple */
1357  bool slow = false; /* can we use/set attcacheoff? */
1358 
1359  natts = HeapTupleHeaderGetNatts(tup);
1360 
1361  /*
1362  * In inheritance situations, it is possible that the given tuple actually
1363  * has more fields than the caller is expecting. Don't run off the end of
1364  * the caller's arrays.
1365  */
1366  natts = Min(natts, tdesc_natts);
1367 
1368  tp = (char *) tup + tup->t_hoff;
1369 
1370  off = 0;
1371 
1372  for (attnum = 0; attnum < natts; attnum++)
1373  {
1374  Form_pg_attribute thisatt = TupleDescAttr(tupleDesc, attnum);
1375 
1376  if (hasnulls && att_isnull(attnum, bp))
1377  {
1378  values[attnum] = (Datum) 0;
1379  isnull[attnum] = true;
1380  slow = true; /* can't use attcacheoff anymore */
1381  continue;
1382  }
1383 
1384  isnull[attnum] = false;
1385 
1386  if (!slow && thisatt->attcacheoff >= 0)
1387  off = thisatt->attcacheoff;
1388  else if (thisatt->attlen == -1)
1389  {
1390  /*
1391  * We can only cache the offset for a varlena attribute if the
1392  * offset is already suitably aligned, so that there would be no
1393  * pad bytes in any case: then the offset will be valid for either
1394  * an aligned or unaligned value.
1395  */
1396  if (!slow &&
1397  off == att_align_nominal(off, thisatt->attalign))
1398  thisatt->attcacheoff = off;
1399  else
1400  {
1401  off = att_align_pointer(off, thisatt->attalign, -1,
1402  tp + off);
1403  slow = true;
1404  }
1405  }
1406  else
1407  {
1408  /* not varlena, so safe to use att_align_nominal */
1409  off = att_align_nominal(off, thisatt->attalign);
1410 
1411  if (!slow)
1412  thisatt->attcacheoff = off;
1413  }
1414 
1415  values[attnum] = fetchatt(thisatt, tp + off);
1416 
1417  off = att_addlength_pointer(off, thisatt->attlen, tp + off);
1418 
1419  if (thisatt->attlen <= 0)
1420  slow = true; /* can't use attcacheoff anymore */
1421  }
1422 
1423  /*
1424  * If tuple doesn't have all the atts indicated by tupleDesc, read the
1425  * rest as nulls or missing values as appropriate.
1426  */
1427  for (; attnum < tdesc_natts; attnum++)
1428  values[attnum] = getmissingattr(tupleDesc, attnum + 1, &isnull[attnum]);
1429 }
unsigned int uint32
Definition: c.h:495
#define Min(x, y)
Definition: c.h:993
Datum getmissingattr(TupleDesc tupleDesc, int attnum, bool *isnull)
Definition: heaptuple.c:148
#define att_align_pointer(cur_offset, attalign, attlen, attptr)
Definition: tupmacs.h:107
#define fetchatt(A, T)
Definition: tupmacs.h:46

References att_addlength_pointer, att_align_nominal, att_align_pointer, att_isnull(), attnum, fetchatt, HeapTupleHasNulls, HeapTupleHeaderGetNatts, Min, TupleDescData::natts, HeapTupleHeaderData::t_bits, HeapTupleData::t_data, HeapTupleHeaderData::t_hoff, TupleDescAttr, and values.

Referenced by deconstruct_expanded_record(), exec_move_row(), ExecEvalFieldStoreDeForm(), ExecForceStoreHeapTuple(), ExecForceStoreMinimalTuple(), ExecStoreHeapTupleDatum(), execute_attr_map_tuple(), ExtractReplicaIdentity(), hash_record(), hash_record_extended(), heap_modify_tuple(), heap_modify_tuple_by_cols(), heap_toast_delete(), heap_toast_insert_or_update(), hstore_from_record(), hstore_populate_record(), make_tuple_indirect(), populate_record(), record_cmp(), record_eq(), record_image_cmp(), record_image_eq(), record_out(), record_send(), reform_and_rewrite_tuple(), ReorderBufferToastReplace(), RI_Initial_Check(), RI_PartitionRemove_Check(), SPI_modifytuple(), toast_flatten_tuple(), and toast_flatten_tuple_to_datum().

◆ heap_expand_tuple()

HeapTuple heap_expand_tuple ( HeapTuple  sourceTuple,
TupleDesc  tupleDesc 
)

Definition at line 1066 of file heaptuple.c.

1067 {
1068  HeapTuple heapTuple;
1069 
1070  expand_tuple(&heapTuple, NULL, sourceTuple, tupleDesc);
1071  return heapTuple;
1072 }
static void expand_tuple(HeapTuple *targetHeapTuple, MinimalTuple *targetMinimalTuple, HeapTuple sourceTuple, TupleDesc tupleDesc)
Definition: heaptuple.c:829

References expand_tuple().

◆ heap_fill_tuple()

void heap_fill_tuple ( TupleDesc  tupleDesc,
const Datum values,
const bool isnull,
char *  data,
Size  data_size,
uint16 infomask,
bits8 bit 
)

Definition at line 401 of file heaptuple.c.

405 {
406  bits8 *bitP;
407  int bitmask;
408  int i;
409  int numberOfAttributes = tupleDesc->natts;
410 
411 #ifdef USE_ASSERT_CHECKING
412  char *start = data;
413 #endif
414 
415  if (bit != NULL)
416  {
417  bitP = &bit[-1];
418  bitmask = HIGHBIT;
419  }
420  else
421  {
422  /* just to keep compiler quiet */
423  bitP = NULL;
424  bitmask = 0;
425  }
426 
427  *infomask &= ~(HEAP_HASNULL | HEAP_HASVARWIDTH | HEAP_HASEXTERNAL);
428 
429  for (i = 0; i < numberOfAttributes; i++)
430  {
431  Form_pg_attribute attr = TupleDescAttr(tupleDesc, i);
432 
433  fill_val(attr,
434  bitP ? &bitP : NULL,
435  &bitmask,
436  &data,
437  infomask,
438  values ? values[i] : PointerGetDatum(NULL),
439  isnull ? isnull[i] : true);
440  }
441 
442  Assert((data - start) == data_size);
443 }

References Assert(), bit(), data, fill_val(), HEAP_HASEXTERNAL, HEAP_HASNULL, HEAP_HASVARWIDTH, HIGHBIT, i, TupleDescData::natts, PointerGetDatum(), TupleDescAttr, and values.

Referenced by brin_form_tuple(), ER_flatten_into(), heap_form_minimal_tuple(), heap_form_tuple(), heap_toast_insert_or_update(), index_form_tuple_context(), spgFormLeafTuple(), and toast_flatten_tuple_to_datum().

◆ heap_form_minimal_tuple()

MinimalTuple heap_form_minimal_tuple ( TupleDesc  tupleDescriptor,
const Datum values,
const bool isnull 
)

Definition at line 1453 of file heaptuple.c.

1456 {
1457  MinimalTuple tuple; /* return tuple */
1458  Size len,
1459  data_len;
1460  int hoff;
1461  bool hasnull = false;
1462  int numberOfAttributes = tupleDescriptor->natts;
1463  int i;
1464 
1465  if (numberOfAttributes > MaxTupleAttributeNumber)
1466  ereport(ERROR,
1467  (errcode(ERRCODE_TOO_MANY_COLUMNS),
1468  errmsg("number of columns (%d) exceeds limit (%d)",
1469  numberOfAttributes, MaxTupleAttributeNumber)));
1470 
1471  /*
1472  * Check for nulls
1473  */
1474  for (i = 0; i < numberOfAttributes; i++)
1475  {
1476  if (isnull[i])
1477  {
1478  hasnull = true;
1479  break;
1480  }
1481  }
1482 
1483  /*
1484  * Determine total space needed
1485  */
1487 
1488  if (hasnull)
1489  len += BITMAPLEN(numberOfAttributes);
1490 
1491  hoff = len = MAXALIGN(len); /* align user data safely */
1492 
1493  data_len = heap_compute_data_size(tupleDescriptor, values, isnull);
1494 
1495  len += data_len;
1496 
1497  /*
1498  * Allocate and zero the space needed.
1499  */
1500  tuple = (MinimalTuple) palloc0(len);
1501 
1502  /*
1503  * And fill in the information.
1504  */
1505  tuple->t_len = len;
1506  HeapTupleHeaderSetNatts(tuple, numberOfAttributes);
1507  tuple->t_hoff = hoff + MINIMAL_TUPLE_OFFSET;
1508 
1509  heap_fill_tuple(tupleDescriptor,
1510  values,
1511  isnull,
1512  (char *) tuple + hoff,
1513  data_len,
1514  &tuple->t_infomask,
1515  (hasnull ? tuple->t_bits : NULL));
1516 
1517  return tuple;
1518 }
int errcode(int sqlerrcode)
Definition: elog.c:858
int errmsg(const char *fmt,...)
Definition: elog.c:1069
#define ereport(elevel,...)
Definition: elog.h:149
Size heap_compute_data_size(TupleDesc tupleDesc, const Datum *values, const bool *isnull)
Definition: heaptuple.c:216
void heap_fill_tuple(TupleDesc tupleDesc, const Datum *values, const bool *isnull, char *data, Size data_size, uint16 *infomask, bits8 *bit)
Definition: heaptuple.c:401
#define MaxTupleAttributeNumber
Definition: htup_details.h:34
bits8 t_bits[FLEXIBLE_ARRAY_MEMBER]
Definition: htup_details.h:640

References BITMAPLEN, ereport, errcode(), errmsg(), ERROR, heap_compute_data_size(), heap_fill_tuple(), HeapTupleHeaderSetNatts, i, len, MAXALIGN, MaxTupleAttributeNumber, MINIMAL_TUPLE_OFFSET, TupleDescData::natts, palloc0(), SizeofMinimalTupleHeader, MinimalTupleData::t_bits, MinimalTupleData::t_hoff, MinimalTupleData::t_infomask, MinimalTupleData::t_len, and values.

Referenced by tts_minimal_materialize(), tts_virtual_copy_minimal_tuple(), and tuplestore_putvalues().

◆ heap_form_tuple()

HeapTuple heap_form_tuple ( TupleDesc  tupleDescriptor,
const Datum values,
const bool isnull 
)

Definition at line 1117 of file heaptuple.c.

1120 {
1121  HeapTuple tuple; /* return tuple */
1122  HeapTupleHeader td; /* tuple data */
1123  Size len,
1124  data_len;
1125  int hoff;
1126  bool hasnull = false;
1127  int numberOfAttributes = tupleDescriptor->natts;
1128  int i;
1129 
1130  if (numberOfAttributes > MaxTupleAttributeNumber)
1131  ereport(ERROR,
1132  (errcode(ERRCODE_TOO_MANY_COLUMNS),
1133  errmsg("number of columns (%d) exceeds limit (%d)",
1134  numberOfAttributes, MaxTupleAttributeNumber)));
1135 
1136  /*
1137  * Check for nulls
1138  */
1139  for (i = 0; i < numberOfAttributes; i++)
1140  {
1141  if (isnull[i])
1142  {
1143  hasnull = true;
1144  break;
1145  }
1146  }
1147 
1148  /*
1149  * Determine total space needed
1150  */
1151  len = offsetof(HeapTupleHeaderData, t_bits);
1152 
1153  if (hasnull)
1154  len += BITMAPLEN(numberOfAttributes);
1155 
1156  hoff = len = MAXALIGN(len); /* align user data safely */
1157 
1158  data_len = heap_compute_data_size(tupleDescriptor, values, isnull);
1159 
1160  len += data_len;
1161 
1162  /*
1163  * Allocate and zero the space needed. Note that the tuple body and
1164  * HeapTupleData management structure are allocated in one chunk.
1165  */
1166  tuple = (HeapTuple) palloc0(HEAPTUPLESIZE + len);
1167  tuple->t_data = td = (HeapTupleHeader) ((char *) tuple + HEAPTUPLESIZE);
1168 
1169  /*
1170  * And fill in the information. Note we fill the Datum fields even though
1171  * this tuple may never become a Datum. This lets HeapTupleHeaderGetDatum
1172  * identify the tuple type if needed.
1173  */
1174  tuple->t_len = len;
1175  ItemPointerSetInvalid(&(tuple->t_self));
1176  tuple->t_tableOid = InvalidOid;
1177 
1179  HeapTupleHeaderSetTypeId(td, tupleDescriptor->tdtypeid);
1180  HeapTupleHeaderSetTypMod(td, tupleDescriptor->tdtypmod);
1181  /* We also make sure that t_ctid is invalid unless explicitly set */
1182  ItemPointerSetInvalid(&(td->t_ctid));
1183 
1184  HeapTupleHeaderSetNatts(td, numberOfAttributes);
1185  td->t_hoff = hoff;
1186 
1187  heap_fill_tuple(tupleDescriptor,
1188  values,
1189  isnull,
1190  (char *) td + hoff,
1191  data_len,
1192  &td->t_infomask,
1193  (hasnull ? td->t_bits : NULL));
1194 
1195  return tuple;
1196 }
#define InvalidOid
Definition: postgres_ext.h:36

References BITMAPLEN, ereport, errcode(), errmsg(), ERROR, heap_compute_data_size(), heap_fill_tuple(), HeapTupleHeaderSetDatumLength, HeapTupleHeaderSetNatts, HeapTupleHeaderSetTypeId, HeapTupleHeaderSetTypMod, HEAPTUPLESIZE, i, InvalidOid, ItemPointerSetInvalid(), len, MAXALIGN, MaxTupleAttributeNumber, TupleDescData::natts, palloc0(), HeapTupleHeaderData::t_bits, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleHeaderData::t_hoff, HeapTupleHeaderData::t_infomask, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, TupleDescData::tdtypeid, TupleDescData::tdtypmod, and values.

Referenced by aclexplode(), AddEnumLabel(), AddRoleMems(), AddSubscriptionRelState(), AggregateCreate(), AlterSetting(), brin_metapage_info(), bt_page_print_tuples(), BuildTupleFromCStrings(), CastCreate(), CollationCreate(), ConversionCreate(), copy_replication_slot(), CreateAccessMethod(), CreateComments(), CreateConstraintEntry(), createdb(), CreateForeignDataWrapper(), CreateForeignServer(), CreateForeignTable(), CreateOpFamily(), CreatePolicy(), CreateProceduralLanguage(), CreatePublication(), CreateRole(), CreateSharedComments(), CreateStatistics(), CreateSubscription(), CreateTableSpace(), CreateTransform(), CreateTriggerFiringOn(), CreateUserMapping(), DefineOpClass(), DefineSequence(), DefineTSConfiguration(), DefineTSDictionary(), DefineTSParser(), DefineTSTemplate(), each_object_field_end(), elements_array_element_end(), ExecEvalFieldStoreForm(), ExecEvalRow(), execute_attr_map_tuple(), expanded_record_get_tuple(), ExtractReplicaIdentity(), file_acquire_sample_rows(), fill_hba_line(), fill_ident_line(), gin_leafpage_items(), gin_metapage_info(), gin_page_opaque_info(), gist_page_opaque_info(), gistFetchTuple(), hash_bitmap_info(), hash_metapage_info(), hash_page_items(), hash_page_stats(), heap_modify_tuple(), heap_modify_tuple_by_cols(), heap_page_items(), heap_tuple_infomask_flags(), hstore_each(), hstore_populate_record(), insert_event_trigger_tuple(), InsertExtensionTuple(), InsertOneTuple(), InsertPgClassTuple(), InsertRule(), inv_truncate(), inv_write(), LargeObjectCreate(), make_tuple_from_result_row(), make_tuple_from_row(), make_tuple_indirect(), NamespaceCreate(), OperatorCreate(), OperatorShellMake(), page_header(), ParameterAclCreate(), pg_backup_stop(), pg_buffercache_pages(), pg_buffercache_summary(), pg_control_checkpoint(), pg_control_init(), pg_control_recovery(), pg_control_system(), pg_create_logical_replication_slot(), pg_create_physical_replication_slot(), pg_get_catalog_foreign_keys(), pg_get_object_address(), pg_get_publication_tables(), pg_get_wal_record_info(), pg_identify_object(), pg_identify_object_as_address(), pg_input_error_info(), pg_last_committed_xact(), pg_lock_status(), pg_partition_tree(), pg_prepared_xact(), pg_replication_slot_advance(), pg_sequence_parameters(), pg_split_walfile_name(), pg_stat_file(), pg_stat_get_archiver(), pg_stat_get_backend_subxact(), pg_stat_get_replication_slot(), pg_stat_get_subscription_stats(), pg_stat_get_wal(), pg_stat_get_wal_receiver(), pg_stat_statements_info(), pg_stats_ext_mcvlist_items(), pg_timezone_abbrevs(), pg_visibility(), pg_visibility_map(), pg_visibility_map_rel(), pg_visibility_map_summary(), pg_visibility_rel(), pg_walfile_name_offset(), pg_xact_commit_timestamp_origin(), pgstatginindex_internal(), pgstathashindex(), pgstattuple_approx_internal(), plperl_build_tuple_result(), PLyGenericObject_ToComposite(), PLyMapping_ToComposite(), PLySequence_ToComposite(), populate_record(), ProcedureCreate(), publication_add_relation(), publication_add_schema(), RangeCreate(), record_in(), record_recv(), recordExtensionInitPrivWorker(), reform_and_rewrite_tuple(), ReorderBufferToastReplace(), replorigin_create(), report_corruption_internal(), serialize_expr_stats(), SetDefaultACL(), SetSecurityLabel(), SetSharedSecurityLabel(), shdepAddDependency(), shdepChangeDep(), SPI_modifytuple(), ssl_extension_info(), statext_store(), StoreAttrDefault(), storeGettuple(), storeOperators(), StorePartitionKey(), storeProcedures(), StoreSingleInheritance(), test_enc_conversion(), test_predtest(), toast_build_flattened_tuple(), toast_flatten_tuple(), toast_save_datum(), tsvector_unnest(), tts_buffer_heap_materialize(), tts_heap_materialize(), tts_virtual_copy_heap_tuple(), TypeCreate(), TypeShellMake(), update_attstats(), and UpdateIndexRelation().

◆ heap_free_minimal_tuple()

void heap_free_minimal_tuple ( MinimalTuple  mtup)

◆ heap_freetuple()

void heap_freetuple ( HeapTuple  htup)

Definition at line 1435 of file heaptuple.c.

1436 {
1437  pfree(htup);
1438 }

References pfree().

Referenced by acquire_inherited_sample_rows(), acquire_sample_rows(), AddEnumLabel(), AddSubscriptionRelState(), AfterTriggerExecute(), AlterCollation(), AlterDatabaseOwner(), AlterDatabaseRefreshColl(), AlterDomainDefault(), AlterDomainNotNull(), AlterDomainValidateConstraint(), AlterEventTrigger(), AlterEventTriggerOwner(), AlterEventTriggerOwner_oid(), AlterForeignDataWrapper(), AlterForeignDataWrapperOwner(), AlterForeignDataWrapperOwner_oid(), AlterForeignServer(), AlterForeignServerOwner(), AlterForeignServerOwner_oid(), AlterFunction(), AlterObjectRename_internal(), AlterPolicy(), AlterPublication(), AlterPublicationOwner(), AlterPublicationOwner_oid(), AlterRelationNamespaceInternal(), AlterRole(), AlterSchemaOwner_internal(), AlterStatistics(), AlterSubscription(), AlterSubscriptionOwner(), AlterSubscriptionOwner_oid(), AlterTableSpaceOptions(), AlterTSDictionary(), AlterTypeNamespaceInternal(), AlterUserMapping(), analyze_row_processor(), ATExecAddColumn(), ATExecAddIdentity(), ATExecAddOf(), ATExecAlterColumnGenericOptions(), ATExecAlterColumnType(), ATExecAlterConstrRecurse(), ATExecChangeOwner(), ATExecDropColumn(), ATExecDropExpression(), ATExecDropIdentity(), ATExecDropNotNull(), ATExecDropOf(), ATExecForceNoForceRowSecurity(), ATExecGenericOptions(), ATExecSetCompression(), ATExecSetIdentity(), ATExecSetOptions(), ATExecSetRelOptions(), ATExecSetRowSecurity(), ATExecSetStatistics(), ATExecSetStorage(), ATExecValidateConstraint(), build_tuplestore_recursively(), CastCreate(), CatalogCacheCreateEntry(), CatalogTuplesMultiInsertWithInfo(), change_owner_fix_column_acls(), changeDependenciesOf(), changeDependenciesOn(), changeDependencyFor(), clear_subscription_skip_lsn(), CollationCreate(), ConversionCreate(), copy_table_data(), CopyStatistics(), create_toast_table(), CreateAccessMethod(), CreateComments(), CreateForeignDataWrapper(), CreateForeignServer(), CreateForeignTable(), CreateOpFamily(), CreatePolicy(), CreatePublication(), CreateSharedComments(), CreateStatistics(), CreateSubscription(), CreateTableSpace(), CreateTransform(), CreateTriggerFiringOn(), CreateUserMapping(), crosstab(), DefineIndex(), DefineOpClass(), DefineSequence(), DefineTSConfiguration(), DefineTSDictionary(), DefineTSParser(), DefineTSTemplate(), DetachPartitionFinalize(), DisableSubscription(), dropconstraint_internal(), EnableDisableRule(), EnableDisableTrigger(), EventTriggerOnLogin(), examine_attribute(), examine_expression(), ExecBRDeleteTriggers(), ExecBRInsertTriggers(), ExecBRUpdateTriggers(), ExecIRDeleteTriggers(), ExecIRInsertTriggers(), ExecIRUpdateTriggers(), ExecReScanAgg(), ExecReScanIndexScan(), ExecReScanSetOp(), ExecScanSubPlan(), ExecSetParamPlan(), expanded_record_set_tuple(), ExtractReplicaIdentity(), file_acquire_sample_rows(), heap_delete(), heap_insert(), heap_update(), index_build(), index_concurrently_swap(), index_constraint_create(), index_update_stats(), insert_event_trigger_tuple(), InsertExtensionTuple(), InsertOneTuple(), InsertPgClassTuple(), InsertRule(), inv_truncate(), inv_write(), LargeObjectCreate(), mark_index_clustered(), MarkInheritDetached(), MergeAttributesIntoExisting(), MergeConstraintsIntoExisting(), OperatorShellMake(), ParameterAclCreate(), PLyGenericObject_ToComposite(), PLyMapping_ToComposite(), PLySequence_ToComposite(), ProcedureCreate(), publication_add_relation(), publication_add_schema(), RangeCreate(), raw_heap_insert(), record_in(), record_recv(), reform_and_rewrite_tuple(), relation_mark_replica_identity(), RelationBuildDesc(), RelationClearMissing(), RelationInitPhysicalAddr(), RelationReloadIndexInfo(), RelationReloadNailed(), RelationSetNewRelfilenumber(), RemoveConstraintById(), RemoveInheritance(), RemoveRoleFromObjectPolicy(), renameatt_internal(), RenameConstraintById(), RenameEnumLabel(), RenameRelationInternal(), RenameRewriteRule(), RenameSchema(), RenameTypeInternal(), RenumberEnumType(), replorigin_create(), ResetRelRewrite(), rewrite_heap_dead_tuple(), rewrite_heap_tuple(), SetDatatabaseHasLoginEventTriggers(), SetIndexStorageProperties(), SetMatViewPopulatedState(), SetRelationHasSubclass(), SetRelationNumChecks(), SetRelationRuleStatus(), SetRelationTableSpace(), SetSecurityLabel(), SetSharedSecurityLabel(), shdepAddDependency(), shdepChangeDep(), SPI_freetuple(), statext_store(), StoreAttrDefault(), storeOperators(), StorePartitionBound(), storeProcedures(), StoreSingleInheritance(), swap_relation_files(), table_recheck_autovac(), toast_save_datum(), TriggerSetParentTrigger(), tts_buffer_heap_clear(), tts_buffer_heap_store_tuple(), tts_heap_clear(), TypeShellMake(), update_attstats(), update_default_partition_oid(), update_relispartition(), UpdateIndexRelation(), UpdateTwoPhaseState(), vac_update_datfrozenxid(), validatePartitionedIndex(), and xpath_table().

◆ heap_getsysattr()

Datum heap_getsysattr ( HeapTuple  tup,
int  attnum,
TupleDesc  tupleDesc,
bool isnull 
)

Definition at line 724 of file heaptuple.c.

725 {
726  Datum result;
727 
728  Assert(tup);
729 
730  /* Currently, no sys attribute ever reads as NULL. */
731  *isnull = false;
732 
733  switch (attnum)
734  {
736  /* pass-by-reference datatype */
737  result = PointerGetDatum(&(tup->t_self));
738  break;
741  break;
744  break;
747 
748  /*
749  * cmin and cmax are now both aliases for the same field, which
750  * can in fact also be a combo command id. XXX perhaps we should
751  * return the "real" cmin or cmax if possible, that is if we are
752  * inside the originating transaction?
753  */
755  break;
757  result = ObjectIdGetDatum(tup->t_tableOid);
758  break;
759  default:
760  elog(ERROR, "invalid attnum: %d", attnum);
761  result = 0; /* keep compiler quiet */
762  break;
763  }
764  return result;
765 }
#define HeapTupleHeaderGetRawXmin(tup)
Definition: htup_details.h:304
#define HeapTupleHeaderGetRawXmax(tup)
Definition: htup_details.h:371
#define HeapTupleHeaderGetRawCommandId(tup)
Definition: htup_details.h:387
static Datum TransactionIdGetDatum(TransactionId X)
Definition: postgres.h:272
static Datum CommandIdGetDatum(CommandId X)
Definition: postgres.h:302
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252

References Assert(), attnum, CommandIdGetDatum(), elog(), ERROR, HeapTupleHeaderGetRawCommandId, HeapTupleHeaderGetRawXmax, HeapTupleHeaderGetRawXmin, MaxCommandIdAttributeNumber, MaxTransactionIdAttributeNumber, MinCommandIdAttributeNumber, MinTransactionIdAttributeNumber, ObjectIdGetDatum(), PointerGetDatum(), SelfItemPointerAttributeNumber, HeapTupleData::t_data, HeapTupleData::t_self, HeapTupleData::t_tableOid, TableOidAttributeNumber, and TransactionIdGetDatum().

Referenced by expanded_record_fetch_field(), heap_getattr(), tts_buffer_heap_getsysattr(), and tts_heap_getsysattr().

◆ heap_modify_tuple()

HeapTuple heap_modify_tuple ( HeapTuple  tuple,
TupleDesc  tupleDesc,
const Datum replValues,
const bool replIsnull,
const bool doReplace 
)

Definition at line 1210 of file heaptuple.c.

1215 {
1216  int numberOfAttributes = tupleDesc->natts;
1217  int attoff;
1218  Datum *values;
1219  bool *isnull;
1220  HeapTuple newTuple;
1221 
1222  /*
1223  * allocate and fill values and isnull arrays from either the tuple or the
1224  * repl information, as appropriate.
1225  *
1226  * NOTE: it's debatable whether to use heap_deform_tuple() here or just
1227  * heap_getattr() only the non-replaced columns. The latter could win if
1228  * there are many replaced columns and few non-replaced ones. However,
1229  * heap_deform_tuple costs only O(N) while the heap_getattr way would cost
1230  * O(N^2) if there are many non-replaced columns, so it seems better to
1231  * err on the side of linear cost.
1232  */
1233  values = (Datum *) palloc(numberOfAttributes * sizeof(Datum));
1234  isnull = (bool *) palloc(numberOfAttributes * sizeof(bool));
1235 
1236  heap_deform_tuple(tuple, tupleDesc, values, isnull);
1237 
1238  for (attoff = 0; attoff < numberOfAttributes; attoff++)
1239  {
1240  if (doReplace[attoff])
1241  {
1242  values[attoff] = replValues[attoff];
1243  isnull[attoff] = replIsnull[attoff];
1244  }
1245  }
1246 
1247  /*
1248  * create a new tuple from the values and isnull arrays
1249  */
1250  newTuple = heap_form_tuple(tupleDesc, values, isnull);
1251 
1252  pfree(values);
1253  pfree(isnull);
1254 
1255  /*
1256  * copy the identification info of the old tuple: t_ctid, t_self
1257  */
1258  newTuple->t_data->t_ctid = tuple->t_data->t_ctid;
1259  newTuple->t_self = tuple->t_self;
1260  newTuple->t_tableOid = tuple->t_tableOid;
1261 
1262  return newTuple;
1263 }
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
Definition: heaptuple.c:1117
void heap_deform_tuple(HeapTuple tuple, TupleDesc tupleDesc, Datum *values, bool *isnull)
Definition: heaptuple.c:1346

References heap_deform_tuple(), heap_form_tuple(), TupleDescData::natts, palloc(), pfree(), HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleData::t_self, HeapTupleData::t_tableOid, and values.

Referenced by AddRoleMems(), AggregateCreate(), AlterCollation(), AlterDatabase(), AlterDatabaseOwner(), AlterDatabaseRefreshColl(), AlterDomainDefault(), AlterForeignDataWrapper(), AlterForeignDataWrapperOwner_internal(), AlterForeignServer(), AlterForeignServerOwner_internal(), AlterFunction(), AlterObjectNamespace_internal(), AlterObjectOwner_internal(), AlterObjectRename_internal(), AlterOperator(), AlterPolicy(), AlterPublicationOptions(), AlterRole(), AlterSchemaOwner_internal(), AlterSetting(), AlterStatistics(), AlterSubscription(), AlterTableSpaceOptions(), AlterTSDictionary(), AlterTypeOwnerInternal(), AlterTypeRecurse(), AlterUserMapping(), ApplyExtensionUpdates(), ATExecAlterColumnGenericOptions(), ATExecAlterColumnType(), ATExecChangeOwner(), ATExecGenericOptions(), ATExecSetOptions(), ATExecSetRelOptions(), change_owner_fix_column_acls(), clear_subscription_skip_lsn(), CreateComments(), CreateProceduralLanguage(), CreateSharedComments(), CreateTransform(), DelRoleMems(), DetachPartitionFinalize(), DisableSubscription(), ExecGrant_Attribute(), ExecGrant_common(), ExecGrant_Largeobject(), ExecGrant_Parameter(), ExecGrant_Relation(), extension_config_remove(), index_concurrently_swap(), InsertRule(), inv_truncate(), inv_write(), MakeConfigurationMapping(), movedb(), OperatorCreate(), pg_extension_config_dump(), plperl_modify_tuple(), PLy_modify_tuple(), ProcedureCreate(), recordExtensionInitPrivWorker(), RelationClearMissing(), RemoveAttributeById(), RemoveRoleFromObjectPolicy(), RenameRole(), SetAttrMissing(), SetDefaultACL(), SetSecurityLabel(), SetSharedSecurityLabel(), StoreAttrDefault(), StorePartitionBound(), TypeCreate(), update_attstats(), UpdateSubscriptionRelState(), and UpdateTwoPhaseState().

◆ heap_modify_tuple_by_cols()

HeapTuple heap_modify_tuple_by_cols ( HeapTuple  tuple,
TupleDesc  tupleDesc,
int  nCols,
const int *  replCols,
const Datum replValues,
const bool replIsnull 
)

Definition at line 1278 of file heaptuple.c.

1284 {
1285  int numberOfAttributes = tupleDesc->natts;
1286  Datum *values;
1287  bool *isnull;
1288  HeapTuple newTuple;
1289  int i;
1290 
1291  /*
1292  * allocate and fill values and isnull arrays from the tuple, then replace
1293  * selected columns from the input arrays.
1294  */
1295  values = (Datum *) palloc(numberOfAttributes * sizeof(Datum));
1296  isnull = (bool *) palloc(numberOfAttributes * sizeof(bool));
1297 
1298  heap_deform_tuple(tuple, tupleDesc, values, isnull);
1299 
1300  for (i = 0; i < nCols; i++)
1301  {
1302  int attnum = replCols[i];
1303 
1304  if (attnum <= 0 || attnum > numberOfAttributes)
1305  elog(ERROR, "invalid column number %d", attnum);
1306  values[attnum - 1] = replValues[i];
1307  isnull[attnum - 1] = replIsnull[i];
1308  }
1309 
1310  /*
1311  * create a new tuple from the values and isnull arrays
1312  */
1313  newTuple = heap_form_tuple(tupleDesc, values, isnull);
1314 
1315  pfree(values);
1316  pfree(isnull);
1317 
1318  /*
1319  * copy the identification info of the old tuple: t_ctid, t_self
1320  */
1321  newTuple->t_data->t_ctid = tuple->t_data->t_ctid;
1322  newTuple->t_self = tuple->t_self;
1323  newTuple->t_tableOid = tuple->t_tableOid;
1324 
1325  return newTuple;
1326 }

References attnum, elog(), ERROR, heap_deform_tuple(), heap_form_tuple(), i, TupleDescData::natts, palloc(), pfree(), HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleData::t_self, HeapTupleData::t_tableOid, and values.

Referenced by autoinc(), insert_username(), moddatetime(), and tsvector_update_trigger().

◆ heap_tuple_from_minimal_tuple()

HeapTuple heap_tuple_from_minimal_tuple ( MinimalTuple  mtup)

Definition at line 1555 of file heaptuple.c.

1556 {
1557  HeapTuple result;
1559 
1560  result = (HeapTuple) palloc(HEAPTUPLESIZE + len);
1561  result->t_len = len;
1562  ItemPointerSetInvalid(&(result->t_self));
1563  result->t_tableOid = InvalidOid;
1564  result->t_data = (HeapTupleHeader) ((char *) result + HEAPTUPLESIZE);
1565  memcpy((char *) result->t_data + MINIMAL_TUPLE_OFFSET, mtup, mtup->t_len);
1566  memset(result->t_data, 0, offsetof(HeapTupleHeaderData, t_infomask2));
1567  return result;
1568 }

References HEAPTUPLESIZE, InvalidOid, ItemPointerSetInvalid(), len, MINIMAL_TUPLE_OFFSET, palloc(), HeapTupleData::t_data, HeapTupleData::t_len, MinimalTupleData::t_len, HeapTupleData::t_self, and HeapTupleData::t_tableOid.

Referenced by tts_minimal_copy_heap_tuple().

◆ init_missing_cache()

static void init_missing_cache ( )
static

Definition at line 123 of file heaptuple.c.

124 {
125  HASHCTL hash_ctl;
126 
127  hash_ctl.keysize = sizeof(missing_cache_key);
128  hash_ctl.entrysize = sizeof(missing_cache_key);
129  hash_ctl.hcxt = TopMemoryContext;
130  hash_ctl.hash = missing_hash;
131  hash_ctl.match = missing_match;
132  missing_cache =
133  hash_create("Missing Values Cache",
134  32,
135  &hash_ctl,
137 }
HTAB * hash_create(const char *tabname, long nelem, const HASHCTL *info, int flags)
Definition: dynahash.c:350
static uint32 missing_hash(const void *key, Size keysize)
Definition: heaptuple.c:101
static int missing_match(const void *key1, const void *key2, Size keysize)
Definition: heaptuple.c:109
#define HASH_CONTEXT
Definition: hsearch.h:102
#define HASH_ELEM
Definition: hsearch.h:95
#define HASH_COMPARE
Definition: hsearch.h:99
#define HASH_FUNCTION
Definition: hsearch.h:98
Size keysize
Definition: hsearch.h:75
HashValueFunc hash
Definition: hsearch.h:78
Size entrysize
Definition: hsearch.h:76
HashCompareFunc match
Definition: hsearch.h:80
MemoryContext hcxt
Definition: hsearch.h:86

References HASHCTL::entrysize, HASHCTL::hash, HASH_COMPARE, HASH_CONTEXT, hash_create(), HASH_ELEM, HASH_FUNCTION, HASHCTL::hcxt, HASHCTL::keysize, HASHCTL::match, missing_cache, missing_hash(), missing_match(), and TopMemoryContext.

Referenced by getmissingattr().

◆ minimal_expand_tuple()

MinimalTuple minimal_expand_tuple ( HeapTuple  sourceTuple,
TupleDesc  tupleDesc 
)

Definition at line 1054 of file heaptuple.c.

1055 {
1056  MinimalTuple minimalTuple;
1057 
1058  expand_tuple(NULL, &minimalTuple, sourceTuple, tupleDesc);
1059  return minimalTuple;
1060 }

References expand_tuple().

◆ minimal_tuple_from_heap_tuple()

MinimalTuple minimal_tuple_from_heap_tuple ( HeapTuple  htup)

Definition at line 1577 of file heaptuple.c.

1578 {
1579  MinimalTuple result;
1580  uint32 len;
1581 
1583  len = htup->t_len - MINIMAL_TUPLE_OFFSET;
1584  result = (MinimalTuple) palloc(len);
1585  memcpy(result, (char *) htup->t_data + MINIMAL_TUPLE_OFFSET, len);
1586  result->t_len = len;
1587  return result;
1588 }

References Assert(), len, MINIMAL_TUPLE_OFFSET, palloc(), HeapTupleData::t_data, HeapTupleData::t_len, and MinimalTupleData::t_len.

Referenced by copytup_heap(), tts_buffer_heap_copy_minimal_tuple(), and tts_heap_copy_minimal_tuple().

◆ missing_hash()

static uint32 missing_hash ( const void *  key,
Size  keysize 
)
static

Definition at line 101 of file heaptuple.c.

102 {
103  const missing_cache_key *entry = (missing_cache_key *) key;
104 
105  return hash_bytes((const unsigned char *) entry->value, entry->len);
106 }
uint32 hash_bytes(const unsigned char *k, int keylen)
Definition: hashfn.c:146

References hash_bytes(), sort-test::key, missing_cache_key::len, and missing_cache_key::value.

Referenced by init_missing_cache().

◆ missing_match()

static int missing_match ( const void *  key1,
const void *  key2,
Size  keysize 
)
static

Definition at line 109 of file heaptuple.c.

110 {
111  const missing_cache_key *entry1 = (missing_cache_key *) key1;
112  const missing_cache_key *entry2 = (missing_cache_key *) key2;
113 
114  if (entry1->len != entry2->len)
115  return entry1->len > entry2->len ? 1 : -1;
116 
117  return memcmp(DatumGetPointer(entry1->value),
118  DatumGetPointer(entry2->value),
119  entry1->len);
120 }

References DatumGetPointer(), missing_cache_key::len, and missing_cache_key::value.

Referenced by init_missing_cache().

◆ nocachegetattr()

Datum nocachegetattr ( HeapTuple  tup,
int  attnum,
TupleDesc  tupleDesc 
)

Definition at line 520 of file heaptuple.c.

523 {
524  HeapTupleHeader td = tup->t_data;
525  char *tp; /* ptr to data part of tuple */
526  bits8 *bp = td->t_bits; /* ptr to null bitmap in tuple */
527  bool slow = false; /* do we have to walk attrs? */
528  int off; /* current offset within data */
529 
530  /* ----------------
531  * Three cases:
532  *
533  * 1: No nulls and no variable-width attributes.
534  * 2: Has a null or a var-width AFTER att.
535  * 3: Has nulls or var-widths BEFORE att.
536  * ----------------
537  */
538 
539  attnum--;
540 
541  if (!HeapTupleNoNulls(tup))
542  {
543  /*
544  * there's a null somewhere in the tuple
545  *
546  * check to see if any preceding bits are null...
547  */
548  int byte = attnum >> 3;
549  int finalbit = attnum & 0x07;
550 
551  /* check for nulls "before" final bit of last byte */
552  if ((~bp[byte]) & ((1 << finalbit) - 1))
553  slow = true;
554  else
555  {
556  /* check for nulls in any "earlier" bytes */
557  int i;
558 
559  for (i = 0; i < byte; i++)
560  {
561  if (bp[i] != 0xFF)
562  {
563  slow = true;
564  break;
565  }
566  }
567  }
568  }
569 
570  tp = (char *) td + td->t_hoff;
571 
572  if (!slow)
573  {
574  Form_pg_attribute att;
575 
576  /*
577  * If we get here, there are no nulls up to and including the target
578  * attribute. If we have a cached offset, we can use it.
579  */
580  att = TupleDescAttr(tupleDesc, attnum);
581  if (att->attcacheoff >= 0)
582  return fetchatt(att, tp + att->attcacheoff);
583 
584  /*
585  * Otherwise, check for non-fixed-length attrs up to and including
586  * target. If there aren't any, it's safe to cheaply initialize the
587  * cached offsets for these attrs.
588  */
589  if (HeapTupleHasVarWidth(tup))
590  {
591  int j;
592 
593  for (j = 0; j <= attnum; j++)
594  {
595  if (TupleDescAttr(tupleDesc, j)->attlen <= 0)
596  {
597  slow = true;
598  break;
599  }
600  }
601  }
602  }
603 
604  if (!slow)
605  {
606  int natts = tupleDesc->natts;
607  int j = 1;
608 
609  /*
610  * If we get here, we have a tuple with no nulls or var-widths up to
611  * and including the target attribute, so we can use the cached offset
612  * ... only we don't have it yet, or we'd not have got here. Since
613  * it's cheap to compute offsets for fixed-width columns, we take the
614  * opportunity to initialize the cached offsets for *all* the leading
615  * fixed-width columns, in hope of avoiding future visits to this
616  * routine.
617  */
618  TupleDescAttr(tupleDesc, 0)->attcacheoff = 0;
619 
620  /* we might have set some offsets in the slow path previously */
621  while (j < natts && TupleDescAttr(tupleDesc, j)->attcacheoff > 0)
622  j++;
623 
624  off = TupleDescAttr(tupleDesc, j - 1)->attcacheoff +
625  TupleDescAttr(tupleDesc, j - 1)->attlen;
626 
627  for (; j < natts; j++)
628  {
629  Form_pg_attribute att = TupleDescAttr(tupleDesc, j);
630 
631  if (att->attlen <= 0)
632  break;
633 
634  off = att_align_nominal(off, att->attalign);
635 
636  att->attcacheoff = off;
637 
638  off += att->attlen;
639  }
640 
641  Assert(j > attnum);
642 
643  off = TupleDescAttr(tupleDesc, attnum)->attcacheoff;
644  }
645  else
646  {
647  bool usecache = true;
648  int i;
649 
650  /*
651  * Now we know that we have to walk the tuple CAREFULLY. But we still
652  * might be able to cache some offsets for next time.
653  *
654  * Note - This loop is a little tricky. For each non-null attribute,
655  * we have to first account for alignment padding before the attr,
656  * then advance over the attr based on its length. Nulls have no
657  * storage and no alignment padding either. We can use/set
658  * attcacheoff until we reach either a null or a var-width attribute.
659  */
660  off = 0;
661  for (i = 0;; i++) /* loop exit is at "break" */
662  {
663  Form_pg_attribute att = TupleDescAttr(tupleDesc, i);
664 
665  if (HeapTupleHasNulls(tup) && att_isnull(i, bp))
666  {
667  usecache = false;
668  continue; /* this cannot be the target att */
669  }
670 
671  /* If we know the next offset, we can skip the rest */
672  if (usecache && att->attcacheoff >= 0)
673  off = att->attcacheoff;
674  else if (att->attlen == -1)
675  {
676  /*
677  * We can only cache the offset for a varlena attribute if the
678  * offset is already suitably aligned, so that there would be
679  * no pad bytes in any case: then the offset will be valid for
680  * either an aligned or unaligned value.
681  */
682  if (usecache &&
683  off == att_align_nominal(off, att->attalign))
684  att->attcacheoff = off;
685  else
686  {
687  off = att_align_pointer(off, att->attalign, -1,
688  tp + off);
689  usecache = false;
690  }
691  }
692  else
693  {
694  /* not varlena, so safe to use att_align_nominal */
695  off = att_align_nominal(off, att->attalign);
696 
697  if (usecache)
698  att->attcacheoff = off;
699  }
700 
701  if (i == attnum)
702  break;
703 
704  off = att_addlength_pointer(off, att->attlen, tp + off);
705 
706  if (usecache && att->attlen <= 0)
707  usecache = false;
708  }
709  }
710 
711  return fetchatt(TupleDescAttr(tupleDesc, attnum), tp + off);
712 }
#define HeapTupleHasVarWidth(tuple)
Definition: htup_details.h:665
int j
Definition: isn.c:74
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:77
int16 attlen
Definition: pg_attribute.h:59

References Assert(), att_addlength_pointer, att_align_nominal, att_align_pointer, att_isnull(), attlen, attnum, fetchatt, HeapTupleHasNulls, HeapTupleHasVarWidth, HeapTupleNoNulls, i, if(), j, TupleDescData::natts, HeapTupleHeaderData::t_bits, HeapTupleData::t_data, HeapTupleHeaderData::t_hoff, and TupleDescAttr.

Referenced by fastgetattr().

◆ varsize_any()

size_t varsize_any ( void *  p)

Definition at line 1595 of file heaptuple.c.

1596 {
1597  return VARSIZE_ANY(p);
1598 }

References VARSIZE_ANY.

Variable Documentation

◆ missing_cache

HTAB* missing_cache = NULL
static

Definition at line 98 of file heaptuple.c.

Referenced by getmissingattr(), and init_missing_cache().