PostgreSQL Source Code  git master
execGrouping.c File Reference
#include "postgres.h"
#include "access/parallel.h"
#include "common/hashfn.h"
#include "executor/executor.h"
#include "miscadmin.h"
#include "utils/lsyscache.h"
#include "utils/memutils.h"
#include "lib/simplehash.h"
Include dependency graph for execGrouping.c:

Go to the source code of this file.

Macros

#define SH_PREFIX   tuplehash
 
#define SH_ELEMENT_TYPE   TupleHashEntryData
 
#define SH_KEY_TYPE   MinimalTuple
 
#define SH_KEY   firstTuple
 
#define SH_HASH_KEY(tb, key)   TupleHashTableHash_internal(tb, key)
 
#define SH_EQUAL(tb, a, b)   TupleHashTableMatch(tb, a, b) == 0
 
#define SH_SCOPE   extern
 
#define SH_STORE_HASH
 
#define SH_GET_HASH(tb, a)   a->hash
 
#define SH_DEFINE
 

Functions

static int TupleHashTableMatch (struct tuplehash_hash *tb, const MinimalTuple tuple1, const MinimalTuple tuple2)
 
static uint32 TupleHashTableHash_internal (struct tuplehash_hash *tb, const MinimalTuple tuple)
 
static TupleHashEntry LookupTupleHashEntry_internal (TupleHashTable hashtable, TupleTableSlot *slot, bool *isnew, uint32 hash)
 
ExprStateexecTuplesMatchPrepare (TupleDesc desc, int numCols, const AttrNumber *keyColIdx, const Oid *eqOperators, const Oid *collations, PlanState *parent)
 
void execTuplesHashPrepare (int numCols, const Oid *eqOperators, Oid **eqFuncOids, FmgrInfo **hashFunctions)
 
TupleHashTable BuildTupleHashTableExt (PlanState *parent, TupleDesc inputDesc, int numCols, AttrNumber *keyColIdx, const Oid *eqfuncoids, FmgrInfo *hashfunctions, Oid *collations, long nbuckets, Size additionalsize, MemoryContext metacxt, MemoryContext tablecxt, MemoryContext tempcxt, bool use_variable_hash_iv)
 
TupleHashTable BuildTupleHashTable (PlanState *parent, TupleDesc inputDesc, int numCols, AttrNumber *keyColIdx, const Oid *eqfuncoids, FmgrInfo *hashfunctions, Oid *collations, long nbuckets, Size additionalsize, MemoryContext tablecxt, MemoryContext tempcxt, bool use_variable_hash_iv)
 
void ResetTupleHashTable (TupleHashTable hashtable)
 
TupleHashEntry LookupTupleHashEntry (TupleHashTable hashtable, TupleTableSlot *slot, bool *isnew, uint32 *hash)
 
uint32 TupleHashTableHash (TupleHashTable hashtable, TupleTableSlot *slot)
 
TupleHashEntry LookupTupleHashEntryHash (TupleHashTable hashtable, TupleTableSlot *slot, bool *isnew, uint32 hash)
 
TupleHashEntry FindTupleHashEntry (TupleHashTable hashtable, TupleTableSlot *slot, ExprState *eqcomp, FmgrInfo *hashfunctions)
 

Macro Definition Documentation

◆ SH_DEFINE

#define SH_DEFINE

Definition at line 45 of file execGrouping.c.

◆ SH_ELEMENT_TYPE

#define SH_ELEMENT_TYPE   TupleHashEntryData

Definition at line 37 of file execGrouping.c.

◆ SH_EQUAL

#define SH_EQUAL (   tb,
  a,
 
)    TupleHashTableMatch(tb, a, b) == 0

Definition at line 41 of file execGrouping.c.

◆ SH_GET_HASH

#define SH_GET_HASH (   tb,
 
)    a->hash

Definition at line 44 of file execGrouping.c.

◆ SH_HASH_KEY

#define SH_HASH_KEY (   tb,
  key 
)    TupleHashTableHash_internal(tb, key)

Definition at line 40 of file execGrouping.c.

◆ SH_KEY

#define SH_KEY   firstTuple

Definition at line 39 of file execGrouping.c.

◆ SH_KEY_TYPE

#define SH_KEY_TYPE   MinimalTuple

Definition at line 38 of file execGrouping.c.

◆ SH_PREFIX

#define SH_PREFIX   tuplehash

Definition at line 36 of file execGrouping.c.

◆ SH_SCOPE

#define SH_SCOPE   extern

Definition at line 42 of file execGrouping.c.

◆ SH_STORE_HASH

#define SH_STORE_HASH

Definition at line 43 of file execGrouping.c.

Function Documentation

◆ BuildTupleHashTable()

TupleHashTable BuildTupleHashTable ( PlanState parent,
TupleDesc  inputDesc,
int  numCols,
AttrNumber keyColIdx,
const Oid eqfuncoids,
FmgrInfo hashfunctions,
Oid collations,
long  nbuckets,
Size  additionalsize,
MemoryContext  tablecxt,
MemoryContext  tempcxt,
bool  use_variable_hash_iv 
)

Definition at line 255 of file execGrouping.c.

References BuildTupleHashTableExt().

265 {
266  return BuildTupleHashTableExt(parent,
267  inputDesc,
268  numCols, keyColIdx,
269  eqfuncoids,
270  hashfunctions,
271  collations,
272  nbuckets, additionalsize,
273  tablecxt,
274  tablecxt,
275  tempcxt,
276  use_variable_hash_iv);
277 }
TupleHashTable BuildTupleHashTableExt(PlanState *parent, TupleDesc inputDesc, int numCols, AttrNumber *keyColIdx, const Oid *eqfuncoids, FmgrInfo *hashfunctions, Oid *collations, long nbuckets, Size additionalsize, MemoryContext metacxt, MemoryContext tablecxt, MemoryContext tempcxt, bool use_variable_hash_iv)
Definition: execGrouping.c:154

◆ BuildTupleHashTableExt()

TupleHashTable BuildTupleHashTableExt ( PlanState parent,
TupleDesc  inputDesc,
int  numCols,
AttrNumber keyColIdx,
const Oid eqfuncoids,
FmgrInfo hashfunctions,
Oid collations,
long  nbuckets,
Size  additionalsize,
MemoryContext  metacxt,
MemoryContext  tablecxt,
MemoryContext  tempcxt,
bool  use_variable_hash_iv 
)

Definition at line 154 of file execGrouping.c.

References Assert, CreateStandaloneExprContext(), CreateTupleDescCopy(), TupleHashTableData::cur_eq_func, TupleHashTableData::entrysize, ExecBuildGroupingEqual(), TupleHashTableData::exprcontext, get_hash_memory_limit(), TupleHashTableData::hash_iv, TupleHashTableData::hashtab, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, TupleHashTableData::keyColIdx, MakeSingleTupleTableSlot(), MemoryContextSwitchTo(), murmurhash32(), TupleHashTableData::numCols, palloc(), ParallelWorkerNumber, TupleHashTableData::tab_collations, TupleHashTableData::tab_eq_func, TupleHashTableData::tab_hash_funcs, TupleHashTableData::tablecxt, TupleHashTableData::tableslot, TupleHashTableData::tempcxt, and TTSOpsMinimalTuple.

Referenced by build_hash_table(), buildSubPlanHash(), and BuildTupleHashTable().

165 {
166  TupleHashTable hashtable;
167  Size entrysize = sizeof(TupleHashEntryData) + additionalsize;
168  Size hash_mem_limit;
169  MemoryContext oldcontext;
170  bool allow_jit;
171 
172  Assert(nbuckets > 0);
173 
174  /* Limit initial table size request to not more than hash_mem */
175  hash_mem_limit = get_hash_memory_limit() / entrysize;
176  if (nbuckets > hash_mem_limit)
177  nbuckets = hash_mem_limit;
178 
179  oldcontext = MemoryContextSwitchTo(metacxt);
180 
181  hashtable = (TupleHashTable) palloc(sizeof(TupleHashTableData));
182 
183  hashtable->numCols = numCols;
184  hashtable->keyColIdx = keyColIdx;
185  hashtable->tab_hash_funcs = hashfunctions;
186  hashtable->tab_collations = collations;
187  hashtable->tablecxt = tablecxt;
188  hashtable->tempcxt = tempcxt;
189  hashtable->entrysize = entrysize;
190  hashtable->tableslot = NULL; /* will be made on first lookup */
191  hashtable->inputslot = NULL;
192  hashtable->in_hash_funcs = NULL;
193  hashtable->cur_eq_func = NULL;
194 
195  /*
196  * If parallelism is in use, even if the leader backend is performing the
197  * scan itself, we don't want to create the hashtable exactly the same way
198  * in all workers. As hashtables are iterated over in keyspace-order,
199  * doing so in all processes in the same way is likely to lead to
200  * "unbalanced" hashtables when the table size initially is
201  * underestimated.
202  */
203  if (use_variable_hash_iv)
205  else
206  hashtable->hash_iv = 0;
207 
208  hashtable->hashtab = tuplehash_create(metacxt, nbuckets, hashtable);
209 
210  /*
211  * We copy the input tuple descriptor just for safety --- we assume all
212  * input tuples will have equivalent descriptors.
213  */
216 
217  /*
218  * If the old reset interface is used (i.e. BuildTupleHashTable, rather
219  * than BuildTupleHashTableExt), allowing JIT would lead to the generated
220  * functions to a) live longer than the query b) be re-generated each time
221  * the table is being reset. Therefore prevent JIT from being used in that
222  * case, by not providing a parent node (which prevents accessing the
223  * JitContext in the EState).
224  */
225  allow_jit = metacxt != tablecxt;
226 
227  /* build comparator for all columns */
228  /* XXX: should we support non-minimal tuples for the inputslot? */
229  hashtable->tab_eq_func = ExecBuildGroupingEqual(inputDesc, inputDesc,
231  numCols,
232  keyColIdx, eqfuncoids, collations,
233  allow_jit ? parent : NULL);
234 
235  /*
236  * While not pretty, it's ok to not shut down this context, but instead
237  * rely on the containing memory context being reset, as
238  * ExecBuildGroupingEqual() only builds a very simple expression calling
239  * functions (i.e. nothing that'd employ RegisterExprContextCallback()).
240  */
242 
243  MemoryContextSwitchTo(oldcontext);
244 
245  return hashtable;
246 }
ExprContext * exprcontext
Definition: execnodes.h:756
ExprContext * CreateStandaloneExprContext(void)
Definition: execUtils.c:352
TupleDesc CreateTupleDescCopy(TupleDesc tupdesc)
Definition: tupdesc.c:111
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc, const TupleTableSlotOps *tts_ops)
Definition: execTuples.c:1238
ExprState * ExecBuildGroupingEqual(TupleDesc ldesc, TupleDesc rdesc, const TupleTableSlotOps *lops, const TupleTableSlotOps *rops, int numCols, const AttrNumber *keyColIdx, const Oid *eqfunctions, const Oid *collations, PlanState *parent)
Definition: execExpr.c:3708
TupleTableSlot * inputslot
Definition: execnodes.h:752
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
AttrNumber * keyColIdx
Definition: execnodes.h:743
ExprState * tab_eq_func
Definition: execnodes.h:745
ExprState * cur_eq_func
Definition: execnodes.h:754
static uint32 murmurhash32(uint32 data)
Definition: hashfn.h:92
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:744
FmgrInfo * in_hash_funcs
Definition: execnodes.h:753
struct TupleHashEntryData TupleHashEntryData
MemoryContext tablecxt
Definition: execnodes.h:747
struct TupleHashTableData * TupleHashTable
Definition: execnodes.h:721
int ParallelWorkerNumber
Definition: parallel.c:112
tuplehash_hash * hashtab
Definition: execnodes.h:741
#define Assert(condition)
Definition: c.h:804
TupleTableSlot * tableslot
Definition: execnodes.h:750
size_t Size
Definition: c.h:540
size_t get_hash_memory_limit(void)
Definition: nodeHash.c:3401
void * palloc(Size size)
Definition: mcxt.c:1062
MemoryContext tempcxt
Definition: execnodes.h:748
const TupleTableSlotOps TTSOpsMinimalTuple
Definition: execTuples.c:85

◆ execTuplesHashPrepare()

void execTuplesHashPrepare ( int  numCols,
const Oid eqOperators,
Oid **  eqFuncOids,
FmgrInfo **  hashFunctions 
)

Definition at line 96 of file execGrouping.c.

References Assert, elog, ERROR, fmgr_info(), get_op_hash_functions(), get_opcode(), i, and palloc().

Referenced by ExecInitRecursiveUnion(), ExecInitSetOp(), and find_hash_columns().

100 {
101  int i;
102 
103  *eqFuncOids = (Oid *) palloc(numCols * sizeof(Oid));
104  *hashFunctions = (FmgrInfo *) palloc(numCols * sizeof(FmgrInfo));
105 
106  for (i = 0; i < numCols; i++)
107  {
108  Oid eq_opr = eqOperators[i];
109  Oid eq_function;
110  Oid left_hash_function;
111  Oid right_hash_function;
112 
113  eq_function = get_opcode(eq_opr);
114  if (!get_op_hash_functions(eq_opr,
115  &left_hash_function, &right_hash_function))
116  elog(ERROR, "could not find hash function for hash operator %u",
117  eq_opr);
118  /* We're not supporting cross-type cases here */
119  Assert(left_hash_function == right_hash_function);
120  (*eqFuncOids)[i] = eq_function;
121  fmgr_info(right_hash_function, &(*hashFunctions)[i]);
122  }
123 }
Definition: fmgr.h:56
bool get_op_hash_functions(Oid opno, RegProcedure *lhs_procno, RegProcedure *rhs_procno)
Definition: lsyscache.c:508
unsigned int Oid
Definition: postgres_ext.h:31
#define ERROR
Definition: elog.h:46
void fmgr_info(Oid functionId, FmgrInfo *finfo)
Definition: fmgr.c:126
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1256
#define Assert(condition)
Definition: c.h:804
void * palloc(Size size)
Definition: mcxt.c:1062
#define elog(elevel,...)
Definition: elog.h:232
int i

◆ execTuplesMatchPrepare()

ExprState* execTuplesMatchPrepare ( TupleDesc  desc,
int  numCols,
const AttrNumber keyColIdx,
const Oid eqOperators,
const Oid collations,
PlanState parent 
)

Definition at line 59 of file execGrouping.c.

References ExecBuildGroupingEqual(), get_opcode(), i, and palloc().

Referenced by build_pertrans_for_aggref(), ExecInitAgg(), ExecInitGroup(), ExecInitLimit(), ExecInitSetOp(), ExecInitUnique(), ExecInitWindowAgg(), and hypothetical_dense_rank_final().

65 {
66  Oid *eqFunctions = (Oid *) palloc(numCols * sizeof(Oid));
67  int i;
68  ExprState *expr;
69 
70  if (numCols == 0)
71  return NULL;
72 
73  /* lookup equality functions */
74  for (i = 0; i < numCols; i++)
75  eqFunctions[i] = get_opcode(eqOperators[i]);
76 
77  /* build actual expression */
78  expr = ExecBuildGroupingEqual(desc, desc, NULL, NULL,
79  numCols, keyColIdx, eqFunctions, collations,
80  parent);
81 
82  return expr;
83 }
ExprState * ExecBuildGroupingEqual(TupleDesc ldesc, TupleDesc rdesc, const TupleTableSlotOps *lops, const TupleTableSlotOps *rops, int numCols, const AttrNumber *keyColIdx, const Oid *eqfunctions, const Oid *collations, PlanState *parent)
Definition: execExpr.c:3708
unsigned int Oid
Definition: postgres_ext.h:31
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1256
void * palloc(Size size)
Definition: mcxt.c:1062
int i

◆ FindTupleHashEntry()

TupleHashEntry FindTupleHashEntry ( TupleHashTable  hashtable,
TupleTableSlot slot,
ExprState eqcomp,
FmgrInfo hashfunctions 
)

Definition at line 393 of file execGrouping.c.

References TupleHashTableData::cur_eq_func, TupleHashTableData::hashtab, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, sort-test::key, MemoryContextSwitchTo(), and TupleHashTableData::tempcxt.

Referenced by ExecHashSubPlan().

396 {
397  TupleHashEntry entry;
398  MemoryContext oldContext;
400 
401  /* Need to run the hash functions in short-lived context */
402  oldContext = MemoryContextSwitchTo(hashtable->tempcxt);
403 
404  /* Set up data needed by hash and match functions */
405  hashtable->inputslot = slot;
406  hashtable->in_hash_funcs = hashfunctions;
407  hashtable->cur_eq_func = eqcomp;
408 
409  /* Search the hash table */
410  key = NULL; /* flag to reference inputslot */
411  entry = tuplehash_lookup(hashtable->hashtab, key);
412  MemoryContextSwitchTo(oldContext);
413 
414  return entry;
415 }
TupleTableSlot * inputslot
Definition: execnodes.h:752
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
ExprState * cur_eq_func
Definition: execnodes.h:754
FmgrInfo * in_hash_funcs
Definition: execnodes.h:753
tuplehash_hash * hashtab
Definition: execnodes.h:741
MemoryContext tempcxt
Definition: execnodes.h:748

◆ LookupTupleHashEntry()

TupleHashEntry LookupTupleHashEntry ( TupleHashTable  hashtable,
TupleTableSlot slot,
bool isnew,
uint32 hash 
)

Definition at line 306 of file execGrouping.c.

References Assert, TupleHashTableData::cur_eq_func, TupleHashEntryData::hash, TupleHashTableData::hashtab, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, LookupTupleHashEntry_internal(), MemoryContextSwitchTo(), TupleHashTableData::tab_eq_func, TupleHashTableData::tab_hash_funcs, TupleHashTableData::tempcxt, and TupleHashTableHash_internal().

Referenced by buildSubPlanHash(), ExecRecursiveUnion(), lookup_hash_entries(), and setop_fill_hash_table().

308 {
309  TupleHashEntry entry;
310  MemoryContext oldContext;
311  uint32 local_hash;
312 
313  /* Need to run the hash functions in short-lived context */
314  oldContext = MemoryContextSwitchTo(hashtable->tempcxt);
315 
316  /* set up data needed by hash and match functions */
317  hashtable->inputslot = slot;
318  hashtable->in_hash_funcs = hashtable->tab_hash_funcs;
319  hashtable->cur_eq_func = hashtable->tab_eq_func;
320 
321  local_hash = TupleHashTableHash_internal(hashtable->hashtab, NULL);
322  entry = LookupTupleHashEntry_internal(hashtable, slot, isnew, local_hash);
323 
324  if (hash != NULL)
325  *hash = local_hash;
326 
327  Assert(entry == NULL || entry->hash == local_hash);
328 
329  MemoryContextSwitchTo(oldContext);
330 
331  return entry;
332 }
TupleTableSlot * inputslot
Definition: execnodes.h:752
static uint32 TupleHashTableHash_internal(struct tuplehash_hash *tb, const MinimalTuple tuple)
Definition: execGrouping.c:426
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
ExprState * tab_eq_func
Definition: execnodes.h:745
ExprState * cur_eq_func
Definition: execnodes.h:754
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:744
FmgrInfo * in_hash_funcs
Definition: execnodes.h:753
static TupleHashEntry LookupTupleHashEntry_internal(TupleHashTable hashtable, TupleTableSlot *slot, bool *isnew, uint32 hash)
Definition: execGrouping.c:496
unsigned int uint32
Definition: c.h:441
tuplehash_hash * hashtab
Definition: execnodes.h:741
#define Assert(condition)
Definition: c.h:804
MemoryContext tempcxt
Definition: execnodes.h:748
static unsigned hash(unsigned *uv, int n)
Definition: rege_dfa.c:715

◆ LookupTupleHashEntry_internal()

static TupleHashEntry LookupTupleHashEntry_internal ( TupleHashTable  hashtable,
TupleTableSlot slot,
bool isnew,
uint32  hash 
)
inlinestatic

Definition at line 496 of file execGrouping.c.

References TupleHashEntryData::additional, ExecCopySlotMinimalTuple(), TupleHashEntryData::firstTuple, TupleHashTableData::hashtab, sort-test::key, MemoryContextSwitchTo(), and TupleHashTableData::tablecxt.

Referenced by LookupTupleHashEntry(), and LookupTupleHashEntryHash().

498 {
499  TupleHashEntryData *entry;
500  bool found;
502 
503  key = NULL; /* flag to reference inputslot */
504 
505  if (isnew)
506  {
507  entry = tuplehash_insert_hash(hashtable->hashtab, key, hash, &found);
508 
509  if (found)
510  {
511  /* found pre-existing entry */
512  *isnew = false;
513  }
514  else
515  {
516  /* created new entry */
517  *isnew = true;
518  /* zero caller data */
519  entry->additional = NULL;
520  MemoryContextSwitchTo(hashtable->tablecxt);
521  /* Copy the first tuple into the table context */
522  entry->firstTuple = ExecCopySlotMinimalTuple(slot);
523  }
524  }
525  else
526  {
527  entry = tuplehash_lookup_hash(hashtable->hashtab, key, hash);
528  }
529 
530  return entry;
531 }
MinimalTuple firstTuple
Definition: execnodes.h:725
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static MinimalTuple ExecCopySlotMinimalTuple(TupleTableSlot *slot)
Definition: tuptable.h:463
MemoryContext tablecxt
Definition: execnodes.h:747
tuplehash_hash * hashtab
Definition: execnodes.h:741
static unsigned hash(unsigned *uv, int n)
Definition: rege_dfa.c:715

◆ LookupTupleHashEntryHash()

TupleHashEntry LookupTupleHashEntryHash ( TupleHashTable  hashtable,
TupleTableSlot slot,
bool isnew,
uint32  hash 
)

Definition at line 361 of file execGrouping.c.

References Assert, TupleHashTableData::cur_eq_func, TupleHashEntryData::hash, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, LookupTupleHashEntry_internal(), MemoryContextSwitchTo(), TupleHashTableData::tab_eq_func, TupleHashTableData::tab_hash_funcs, and TupleHashTableData::tempcxt.

Referenced by agg_refill_hash_table().

363 {
364  TupleHashEntry entry;
365  MemoryContext oldContext;
366 
367  /* Need to run the hash functions in short-lived context */
368  oldContext = MemoryContextSwitchTo(hashtable->tempcxt);
369 
370  /* set up data needed by hash and match functions */
371  hashtable->inputslot = slot;
372  hashtable->in_hash_funcs = hashtable->tab_hash_funcs;
373  hashtable->cur_eq_func = hashtable->tab_eq_func;
374 
375  entry = LookupTupleHashEntry_internal(hashtable, slot, isnew, hash);
376  Assert(entry == NULL || entry->hash == hash);
377 
378  MemoryContextSwitchTo(oldContext);
379 
380  return entry;
381 }
TupleTableSlot * inputslot
Definition: execnodes.h:752
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
ExprState * tab_eq_func
Definition: execnodes.h:745
ExprState * cur_eq_func
Definition: execnodes.h:754
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:744
FmgrInfo * in_hash_funcs
Definition: execnodes.h:753
static TupleHashEntry LookupTupleHashEntry_internal(TupleHashTable hashtable, TupleTableSlot *slot, bool *isnew, uint32 hash)
Definition: execGrouping.c:496
#define Assert(condition)
Definition: c.h:804
MemoryContext tempcxt
Definition: execnodes.h:748
static unsigned hash(unsigned *uv, int n)
Definition: rege_dfa.c:715

◆ ResetTupleHashTable()

void ResetTupleHashTable ( TupleHashTable  hashtable)

Definition at line 285 of file execGrouping.c.

References TupleHashTableData::hashtab.

Referenced by agg_refill_hash_table(), build_hash_tables(), buildSubPlanHash(), ExecReScanRecursiveUnion(), and ExecReScanSetOp().

286 {
287  tuplehash_reset(hashtable->hashtab);
288 }
tuplehash_hash * hashtab
Definition: execnodes.h:741

◆ TupleHashTableHash()

uint32 TupleHashTableHash ( TupleHashTable  hashtable,
TupleTableSlot slot 
)

Definition at line 338 of file execGrouping.c.

References hash(), TupleHashTableData::hashtab, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, MemoryContextSwitchTo(), TupleHashTableData::tab_hash_funcs, TupleHashTableData::tempcxt, and TupleHashTableHash_internal().

339 {
340  MemoryContext oldContext;
341  uint32 hash;
342 
343  hashtable->inputslot = slot;
344  hashtable->in_hash_funcs = hashtable->tab_hash_funcs;
345 
346  /* Need to run the hash functions in short-lived context */
347  oldContext = MemoryContextSwitchTo(hashtable->tempcxt);
348 
349  hash = TupleHashTableHash_internal(hashtable->hashtab, NULL);
350 
351  MemoryContextSwitchTo(oldContext);
352 
353  return hash;
354 }
TupleTableSlot * inputslot
Definition: execnodes.h:752
static uint32 TupleHashTableHash_internal(struct tuplehash_hash *tb, const MinimalTuple tuple)
Definition: execGrouping.c:426
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:744
FmgrInfo * in_hash_funcs
Definition: execnodes.h:753
unsigned int uint32
Definition: c.h:441
tuplehash_hash * hashtab
Definition: execnodes.h:741
MemoryContext tempcxt
Definition: execnodes.h:748
static unsigned hash(unsigned *uv, int n)
Definition: rege_dfa.c:715

◆ TupleHashTableHash_internal()

static uint32 TupleHashTableHash_internal ( struct tuplehash_hash *  tb,
const MinimalTuple  tuple 
)
inlinestatic

Definition at line 426 of file execGrouping.c.

References DatumGetUInt32, ExecStoreMinimalTuple(), FunctionCall1Coll(), TupleHashTableData::hash_iv, i, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, TupleHashTableData::keyColIdx, murmurhash32(), TupleHashTableData::numCols, slot_getattr(), TupleHashTableData::tab_collations, TupleHashTableData::tab_hash_funcs, and TupleHashTableData::tableslot.

Referenced by LookupTupleHashEntry(), and TupleHashTableHash().

428 {
429  TupleHashTable hashtable = (TupleHashTable) tb->private_data;
430  int numCols = hashtable->numCols;
431  AttrNumber *keyColIdx = hashtable->keyColIdx;
432  uint32 hashkey = hashtable->hash_iv;
433  TupleTableSlot *slot;
434  FmgrInfo *hashfunctions;
435  int i;
436 
437  if (tuple == NULL)
438  {
439  /* Process the current input tuple for the table */
440  slot = hashtable->inputslot;
441  hashfunctions = hashtable->in_hash_funcs;
442  }
443  else
444  {
445  /*
446  * Process a tuple already stored in the table.
447  *
448  * (this case never actually occurs due to the way simplehash.h is
449  * used, as the hash-value is stored in the entries)
450  */
451  slot = hashtable->tableslot;
452  ExecStoreMinimalTuple(tuple, slot, false);
453  hashfunctions = hashtable->tab_hash_funcs;
454  }
455 
456  for (i = 0; i < numCols; i++)
457  {
458  AttrNumber att = keyColIdx[i];
459  Datum attr;
460  bool isNull;
461 
462  /* rotate hashkey left 1 bit at each step */
463  hashkey = (hashkey << 1) | ((hashkey & 0x80000000) ? 1 : 0);
464 
465  attr = slot_getattr(slot, att, &isNull);
466 
467  if (!isNull) /* treat nulls as having hash key 0 */
468  {
469  uint32 hkey;
470 
471  hkey = DatumGetUInt32(FunctionCall1Coll(&hashfunctions[i],
472  hashtable->tab_collations[i],
473  attr));
474  hashkey ^= hkey;
475  }
476  }
477 
478  /*
479  * The way hashes are combined above, among each other and with the IV,
480  * doesn't lead to good bit perturbation. As the IV's goal is to lead to
481  * achieve that, perform a round of hashing of the combined hash -
482  * resulting in near perfect perturbation.
483  */
484  return murmurhash32(hashkey);
485 }
#define DatumGetUInt32(X)
Definition: postgres.h:530
Definition: fmgr.h:56
TupleTableSlot * ExecStoreMinimalTuple(MinimalTuple mtup, TupleTableSlot *slot, bool shouldFree)
Definition: execTuples.c:1446
TupleTableSlot * inputslot
Definition: execnodes.h:752
AttrNumber * keyColIdx
Definition: execnodes.h:743
static uint32 murmurhash32(uint32 data)
Definition: hashfn.h:92
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:744
FmgrInfo * in_hash_funcs
Definition: execnodes.h:753
struct TupleHashTableData * TupleHashTable
Definition: execnodes.h:721
unsigned int uint32
Definition: c.h:441
uintptr_t Datum
Definition: postgres.h:411
Datum FunctionCall1Coll(FmgrInfo *flinfo, Oid collation, Datum arg1)
Definition: fmgr.c:1128
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: tuptable.h:381
TupleTableSlot * tableslot
Definition: execnodes.h:750
int i
int16 AttrNumber
Definition: attnum.h:21

◆ TupleHashTableMatch()

static int TupleHashTableMatch ( struct tuplehash_hash *  tb,
const MinimalTuple  tuple1,
const MinimalTuple  tuple2 
)
static

Definition at line 537 of file execGrouping.c.

References Assert, TupleHashTableData::cur_eq_func, ExecQualAndReset(), ExecStoreMinimalTuple(), TupleHashTableData::exprcontext, TupleHashTableData::inputslot, and TupleHashTableData::tableslot.

538 {
539  TupleTableSlot *slot1;
540  TupleTableSlot *slot2;
541  TupleHashTable hashtable = (TupleHashTable) tb->private_data;
542  ExprContext *econtext = hashtable->exprcontext;
543 
544  /*
545  * We assume that simplehash.h will only ever call us with the first
546  * argument being an actual table entry, and the second argument being
547  * LookupTupleHashEntry's dummy TupleHashEntryData. The other direction
548  * could be supported too, but is not currently required.
549  */
550  Assert(tuple1 != NULL);
551  slot1 = hashtable->tableslot;
552  ExecStoreMinimalTuple(tuple1, slot1, false);
553  Assert(tuple2 == NULL);
554  slot2 = hashtable->inputslot;
555 
556  /* For crosstype comparisons, the inputslot must be first */
557  econtext->ecxt_innertuple = slot2;
558  econtext->ecxt_outertuple = slot1;
559  return !ExecQualAndReset(hashtable->cur_eq_func, econtext);
560 }
ExprContext * exprcontext
Definition: execnodes.h:756
TupleTableSlot * ExecStoreMinimalTuple(MinimalTuple mtup, TupleTableSlot *slot, bool shouldFree)
Definition: execTuples.c:1446
TupleTableSlot * inputslot
Definition: execnodes.h:752
ExprState * cur_eq_func
Definition: execnodes.h:754
struct TupleHashTableData * TupleHashTable
Definition: execnodes.h:721
static bool ExecQualAndReset(ExprState *state, ExprContext *econtext)
Definition: executor.h:423
#define Assert(condition)
Definition: c.h:804
TupleTableSlot * tableslot
Definition: execnodes.h:750