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 253 of file execGrouping.c.

References BuildTupleHashTableExt().

263 {
264  return BuildTupleHashTableExt(parent,
265  inputDesc,
266  numCols, keyColIdx,
267  eqfuncoids,
268  hashfunctions,
269  collations,
270  nbuckets, additionalsize,
271  tablecxt,
272  tablecxt,
273  tempcxt,
274  use_variable_hash_iv);
275 }
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_mem(), TupleHashTableData::hash_iv, TupleHashTableData::hashtab, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, TupleHashTableData::keyColIdx, MakeSingleTupleTableSlot(), MemoryContextSwitchTo(), Min, 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  int hash_mem = get_hash_mem();
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  nbuckets = Min(nbuckets, (long) ((hash_mem * 1024L) / entrysize));
176 
177  oldcontext = MemoryContextSwitchTo(metacxt);
178 
179  hashtable = (TupleHashTable) palloc(sizeof(TupleHashTableData));
180 
181  hashtable->numCols = numCols;
182  hashtable->keyColIdx = keyColIdx;
183  hashtable->tab_hash_funcs = hashfunctions;
184  hashtable->tab_collations = collations;
185  hashtable->tablecxt = tablecxt;
186  hashtable->tempcxt = tempcxt;
187  hashtable->entrysize = entrysize;
188  hashtable->tableslot = NULL; /* will be made on first lookup */
189  hashtable->inputslot = NULL;
190  hashtable->in_hash_funcs = NULL;
191  hashtable->cur_eq_func = NULL;
192 
193  /*
194  * If parallelism is in use, even if the leader backend is performing the
195  * scan itself, we don't want to create the hashtable exactly the same way
196  * in all workers. As hashtables are iterated over in keyspace-order,
197  * doing so in all processes in the same way is likely to lead to
198  * "unbalanced" hashtables when the table size initially is
199  * underestimated.
200  */
201  if (use_variable_hash_iv)
203  else
204  hashtable->hash_iv = 0;
205 
206  hashtable->hashtab = tuplehash_create(metacxt, nbuckets, hashtable);
207 
208  /*
209  * We copy the input tuple descriptor just for safety --- we assume all
210  * input tuples will have equivalent descriptors.
211  */
214 
215  /*
216  * If the old reset interface is used (i.e. BuildTupleHashTable, rather
217  * than BuildTupleHashTableExt), allowing JIT would lead to the generated
218  * functions to a) live longer than the query b) be re-generated each time
219  * the table is being reset. Therefore prevent JIT from being used in that
220  * case, by not providing a parent node (which prevents accessing the
221  * JitContext in the EState).
222  */
223  allow_jit = metacxt != tablecxt;
224 
225  /* build comparator for all columns */
226  /* XXX: should we support non-minimal tuples for the inputslot? */
227  hashtable->tab_eq_func = ExecBuildGroupingEqual(inputDesc, inputDesc,
229  numCols,
230  keyColIdx, eqfuncoids, collations,
231  allow_jit ? parent : NULL);
232 
233  /*
234  * While not pretty, it's ok to not shut down this context, but instead
235  * rely on the containing memory context being reset, as
236  * ExecBuildGroupingEqual() only builds a very simple expression calling
237  * functions (i.e. nothing that'd employ RegisterExprContextCallback()).
238  */
240 
241  MemoryContextSwitchTo(oldcontext);
242 
243  return hashtable;
244 }
ExprContext * exprcontext
Definition: execnodes.h:717
ExprContext * CreateStandaloneExprContext(void)
Definition: execUtils.c:351
TupleDesc CreateTupleDescCopy(TupleDesc tupdesc)
Definition: tupdesc.c:110
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc, const TupleTableSlotOps *tts_ops)
Definition: execTuples.c:1208
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:3333
TupleTableSlot * inputslot
Definition: execnodes.h:713
#define Min(x, y)
Definition: c.h:928
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
AttrNumber * keyColIdx
Definition: execnodes.h:704
ExprState * tab_eq_func
Definition: execnodes.h:706
ExprState * cur_eq_func
Definition: execnodes.h:715
static uint32 murmurhash32(uint32 data)
Definition: hashfn.h:92
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:705
FmgrInfo * in_hash_funcs
Definition: execnodes.h:714
struct TupleHashEntryData TupleHashEntryData
MemoryContext tablecxt
Definition: execnodes.h:708
struct TupleHashTableData * TupleHashTable
Definition: execnodes.h:682
int ParallelWorkerNumber
Definition: parallel.c:112
tuplehash_hash * hashtab
Definition: execnodes.h:702
#define Assert(condition)
Definition: c.h:746
TupleTableSlot * tableslot
Definition: execnodes.h:711
size_t Size
Definition: c.h:474
void * palloc(Size size)
Definition: mcxt.c:950
MemoryContext tempcxt
Definition: execnodes.h:709
const TupleTableSlotOps TTSOpsMinimalTuple
Definition: execTuples.c:85
int get_hash_mem(void)
Definition: nodeHash.c:3389

◆ 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:43
void fmgr_info(Oid functionId, FmgrInfo *finfo)
Definition: fmgr.c:126
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1202
#define Assert(condition)
Definition: c.h:746
void * palloc(Size size)
Definition: mcxt.c:950
#define elog(elevel,...)
Definition: elog.h:214
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:3333
unsigned int Oid
Definition: postgres_ext.h:31
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1202
void * palloc(Size size)
Definition: mcxt.c:950
int i

◆ FindTupleHashEntry()

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

Definition at line 391 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().

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

◆ LookupTupleHashEntry()

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

Definition at line 304 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().

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

◆ LookupTupleHashEntry_internal()

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

Definition at line 494 of file execGrouping.c.

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

Referenced by LookupTupleHashEntry(), and LookupTupleHashEntryHash().

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

◆ LookupTupleHashEntryHash()

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

Definition at line 359 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().

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

◆ ResetTupleHashTable()

void ResetTupleHashTable ( TupleHashTable  hashtable)

Definition at line 283 of file execGrouping.c.

References TupleHashTableData::hashtab.

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

284 {
285  tuplehash_reset(hashtable->hashtab);
286 }
tuplehash_hash * hashtab
Definition: execnodes.h:702

◆ TupleHashTableHash()

uint32 TupleHashTableHash ( TupleHashTable  hashtable,
TupleTableSlot slot 
)

Definition at line 336 of file execGrouping.c.

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

337 {
338  MemoryContext oldContext;
339  uint32 hash;
340 
341  hashtable->inputslot = slot;
342  hashtable->in_hash_funcs = hashtable->tab_hash_funcs;
343 
344  /* Need to run the hash functions in short-lived context */
345  oldContext = MemoryContextSwitchTo(hashtable->tempcxt);
346 
347  hash = TupleHashTableHash_internal(hashtable->hashtab, NULL);
348 
349  MemoryContextSwitchTo(oldContext);
350 
351  return hash;
352 }
TupleTableSlot * inputslot
Definition: execnodes.h:713
static uint32 TupleHashTableHash_internal(struct tuplehash_hash *tb, const MinimalTuple tuple)
Definition: execGrouping.c:424
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:705
FmgrInfo * in_hash_funcs
Definition: execnodes.h:714
unsigned int uint32
Definition: c.h:375
tuplehash_hash * hashtab
Definition: execnodes.h:702
MemoryContext tempcxt
Definition: execnodes.h:709
static unsigned hash(unsigned *uv, int n)
Definition: rege_dfa.c:541

◆ TupleHashTableHash_internal()

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

Definition at line 424 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().

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

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

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