PostgreSQL Source Code  git master
nodeHashjoin.h File Reference
#include "access/parallel.h"
#include "nodes/execnodes.h"
#include "storage/buffile.h"
Include dependency graph for nodeHashjoin.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

HashJoinStateExecInitHashJoin (HashJoin *node, EState *estate, int eflags)
 
void ExecEndHashJoin (HashJoinState *node)
 
void ExecReScanHashJoin (HashJoinState *node)
 
void ExecShutdownHashJoin (HashJoinState *node)
 
void ExecHashJoinEstimate (HashJoinState *state, ParallelContext *pcxt)
 
void ExecHashJoinInitializeDSM (HashJoinState *state, ParallelContext *pcxt)
 
void ExecHashJoinReInitializeDSM (HashJoinState *state, ParallelContext *pcxt)
 
void ExecHashJoinInitializeWorker (HashJoinState *state, ParallelWorkerContext *pwcxt)
 
void ExecHashJoinSaveTuple (MinimalTuple tuple, uint32 hashvalue, BufFile **fileptr, HashJoinTable hashtable)
 

Function Documentation

◆ ExecEndHashJoin()

void ExecEndHashJoin ( HashJoinState node)

Definition at line 859 of file nodeHashjoin.c.

860 {
861  /*
862  * Free hash table
863  */
864  if (node->hj_HashTable)
865  {
867  node->hj_HashTable = NULL;
868  }
869 
870  /*
871  * clean up subtrees
872  */
875 }
void ExecEndNode(PlanState *node)
Definition: execProcnode.c:557
#define outerPlanState(node)
Definition: execnodes.h:1139
#define innerPlanState(node)
Definition: execnodes.h:1138
void ExecHashTableDestroy(HashJoinTable hashtable)
Definition: nodeHash.c:884
HashJoinTable hj_HashTable
Definition: execnodes.h:2116

References ExecEndNode(), ExecHashTableDestroy(), HashJoinState::hj_HashTable, innerPlanState, and outerPlanState.

Referenced by ExecEndNode().

◆ ExecHashJoinEstimate()

void ExecHashJoinEstimate ( HashJoinState state,
ParallelContext pcxt 
)

Definition at line 1544 of file nodeHashjoin.c.

1545 {
1547  shm_toc_estimate_keys(&pcxt->estimator, 1);
1548 }
#define shm_toc_estimate_chunk(e, sz)
Definition: shm_toc.h:51
#define shm_toc_estimate_keys(e, cnt)
Definition: shm_toc.h:53
shm_toc_estimator estimator
Definition: parallel.h:42

References ParallelContext::estimator, shm_toc_estimate_chunk, and shm_toc_estimate_keys.

Referenced by ExecParallelEstimate().

◆ ExecHashJoinInitializeDSM()

void ExecHashJoinInitializeDSM ( HashJoinState state,
ParallelContext pcxt 
)

Definition at line 1551 of file nodeHashjoin.c.

1552 {
1553  int plan_node_id = state->js.ps.plan->plan_node_id;
1554  HashState *hashNode;
1555  ParallelHashJoinState *pstate;
1556 
1557  /*
1558  * Disable shared hash table mode if we failed to create a real DSM
1559  * segment, because that means that we don't have a DSA area to work with.
1560  */
1561  if (pcxt->seg == NULL)
1562  return;
1563 
1565 
1566  /*
1567  * Set up the state needed to coordinate access to the shared hash
1568  * table(s), using the plan node ID as the toc key.
1569  */
1570  pstate = shm_toc_allocate(pcxt->toc, sizeof(ParallelHashJoinState));
1571  shm_toc_insert(pcxt->toc, plan_node_id, pstate);
1572 
1573  /*
1574  * Set up the shared hash join state with no batches initially.
1575  * ExecHashTableCreate() will prepare at least one later and set nbatch
1576  * and space_allowed.
1577  */
1578  pstate->nbatch = 0;
1579  pstate->space_allowed = 0;
1580  pstate->batches = InvalidDsaPointer;
1581  pstate->old_batches = InvalidDsaPointer;
1582  pstate->nbuckets = 0;
1583  pstate->growth = PHJ_GROWTH_OK;
1585  pg_atomic_init_u32(&pstate->distributor, 0);
1586  pstate->nparticipants = pcxt->nworkers + 1;
1587  pstate->total_tuples = 0;
1588  LWLockInitialize(&pstate->lock,
1590  BarrierInit(&pstate->build_barrier, 0);
1591  BarrierInit(&pstate->grow_batches_barrier, 0);
1592  BarrierInit(&pstate->grow_buckets_barrier, 0);
1593 
1594  /* Set up the space we'll use for shared temporary files. */
1595  SharedFileSetInit(&pstate->fileset, pcxt->seg);
1596 
1597  /* Initialize the shared state in the hash node. */
1598  hashNode = (HashState *) innerPlanState(state);
1599  hashNode->parallel_state = pstate;
1600 }
static void pg_atomic_init_u32(volatile pg_atomic_uint32 *ptr, uint32 val)
Definition: atomics.h:218
void BarrierInit(Barrier *barrier, int participants)
Definition: barrier.c:100
#define InvalidDsaPointer
Definition: dsa.h:78
void ExecSetExecProcNode(PlanState *node, ExecProcNodeMtd function)
Definition: execProcnode.c:425
@ PHJ_GROWTH_OK
Definition: hashjoin.h:233
void LWLockInitialize(LWLock *lock, int tranche_id)
Definition: lwlock.c:703
@ LWTRANCHE_PARALLEL_HASH_JOIN
Definition: lwlock.h:196
static TupleTableSlot * ExecParallelHashJoin(PlanState *pstate)
Definition: nodeHashjoin.c:694
void SharedFileSetInit(SharedFileSet *fileset, dsm_segment *seg)
Definition: sharedfileset.c:44
void shm_toc_insert(shm_toc *toc, uint64 key, void *address)
Definition: shm_toc.c:171
void * shm_toc_allocate(shm_toc *toc, Size nbytes)
Definition: shm_toc.c:88
struct ParallelHashJoinState * parallel_state
Definition: execnodes.h:2687
dsm_segment * seg
Definition: parallel.h:43
shm_toc * toc
Definition: parallel.h:45
Barrier grow_batches_barrier
Definition: hashjoin.h:261
dsa_pointer old_batches
Definition: hashjoin.h:249
dsa_pointer chunk_work_queue
Definition: hashjoin.h:254
Barrier grow_buckets_barrier
Definition: hashjoin.h:262
ParallelHashGrowth growth
Definition: hashjoin.h:253
pg_atomic_uint32 distributor
Definition: hashjoin.h:263
SharedFileSet fileset
Definition: hashjoin.h:265
dsa_pointer batches
Definition: hashjoin.h:248
Definition: regguts.h:323

References BarrierInit(), ParallelHashJoinState::batches, ParallelHashJoinState::build_barrier, ParallelHashJoinState::chunk_work_queue, ParallelHashJoinState::distributor, ExecParallelHashJoin(), ExecSetExecProcNode(), ParallelHashJoinState::fileset, ParallelHashJoinState::grow_batches_barrier, ParallelHashJoinState::grow_buckets_barrier, ParallelHashJoinState::growth, innerPlanState, InvalidDsaPointer, ParallelHashJoinState::lock, LWLockInitialize(), LWTRANCHE_PARALLEL_HASH_JOIN, ParallelHashJoinState::nbatch, ParallelHashJoinState::nbuckets, ParallelHashJoinState::nparticipants, ParallelContext::nworkers, ParallelHashJoinState::old_batches, HashState::parallel_state, pg_atomic_init_u32(), PHJ_GROWTH_OK, ParallelContext::seg, SharedFileSetInit(), shm_toc_allocate(), shm_toc_insert(), ParallelHashJoinState::space_allowed, ParallelContext::toc, and ParallelHashJoinState::total_tuples.

Referenced by ExecParallelInitializeDSM().

◆ ExecHashJoinInitializeWorker()

void ExecHashJoinInitializeWorker ( HashJoinState state,
ParallelWorkerContext pwcxt 
)

Definition at line 1642 of file nodeHashjoin.c.

1644 {
1645  HashState *hashNode;
1646  int plan_node_id = state->js.ps.plan->plan_node_id;
1647  ParallelHashJoinState *pstate =
1648  shm_toc_lookup(pwcxt->toc, plan_node_id, false);
1649 
1650  /* Attach to the space for shared temporary files. */
1651  SharedFileSetAttach(&pstate->fileset, pwcxt->seg);
1652 
1653  /* Attach to the shared state in the hash node. */
1654  hashNode = (HashState *) innerPlanState(state);
1655  hashNode->parallel_state = pstate;
1656 
1658 }
void SharedFileSetAttach(SharedFileSet *fileset, dsm_segment *seg)
Definition: sharedfileset.c:62
void * shm_toc_lookup(shm_toc *toc, uint64 key, bool noError)
Definition: shm_toc.c:232
dsm_segment * seg
Definition: parallel.h:53

References ExecParallelHashJoin(), ExecSetExecProcNode(), ParallelHashJoinState::fileset, innerPlanState, HashState::parallel_state, ParallelWorkerContext::seg, SharedFileSetAttach(), shm_toc_lookup(), and ParallelWorkerContext::toc.

Referenced by ExecParallelInitializeWorker().

◆ ExecHashJoinReInitializeDSM()

void ExecHashJoinReInitializeDSM ( HashJoinState state,
ParallelContext pcxt 
)

Definition at line 1609 of file nodeHashjoin.c.

1610 {
1611  int plan_node_id = state->js.ps.plan->plan_node_id;
1612  ParallelHashJoinState *pstate =
1613  shm_toc_lookup(pcxt->toc, plan_node_id, false);
1614 
1615  /*
1616  * It would be possible to reuse the shared hash table in single-batch
1617  * cases by resetting and then fast-forwarding build_barrier to
1618  * PHJ_BUILD_FREE and batch 0's batch_barrier to PHJ_BATCH_PROBE, but
1619  * currently shared hash tables are already freed by now (by the last
1620  * participant to detach from the batch). We could consider keeping it
1621  * around for single-batch joins. We'd also need to adjust
1622  * finalize_plan() so that it doesn't record a dummy dependency for
1623  * Parallel Hash nodes, preventing the rescan optimization. For now we
1624  * don't try.
1625  */
1626 
1627  /* Detach, freeing any remaining shared memory. */
1628  if (state->hj_HashTable != NULL)
1629  {
1630  ExecHashTableDetachBatch(state->hj_HashTable);
1631  ExecHashTableDetach(state->hj_HashTable);
1632  }
1633 
1634  /* Clear any shared batch files. */
1635  SharedFileSetDeleteAll(&pstate->fileset);
1636 
1637  /* Reset build_barrier to PHJ_BUILD_ELECT so we can go around again. */
1638  BarrierInit(&pstate->build_barrier, 0);
1639 }
void ExecHashTableDetachBatch(HashJoinTable hashtable)
Definition: nodeHash.c:3283
void ExecHashTableDetach(HashJoinTable hashtable)
Definition: nodeHash.c:3375
void SharedFileSetDeleteAll(SharedFileSet *fileset)
Definition: sharedfileset.c:89

References BarrierInit(), ParallelHashJoinState::build_barrier, ExecHashTableDetach(), ExecHashTableDetachBatch(), ParallelHashJoinState::fileset, SharedFileSetDeleteAll(), shm_toc_lookup(), and ParallelContext::toc.

Referenced by ExecParallelReInitializeDSM().

◆ ExecHashJoinSaveTuple()

void ExecHashJoinSaveTuple ( MinimalTuple  tuple,
uint32  hashvalue,
BufFile **  fileptr,
HashJoinTable  hashtable 
)

Definition at line 1315 of file nodeHashjoin.c.

1317 {
1318  BufFile *file = *fileptr;
1319 
1320  /*
1321  * The batch file is lazily created. If this is the first tuple written to
1322  * this batch, the batch file is created and its buffer is allocated in
1323  * the spillCxt context, NOT in the batchCxt.
1324  *
1325  * During the build phase, buffered files are created for inner batches.
1326  * Each batch's buffered file is closed (and its buffer freed) after the
1327  * batch is loaded into memory during the outer side scan. Therefore, it
1328  * is necessary to allocate the batch file buffer in a memory context
1329  * which outlives the batch itself.
1330  *
1331  * Also, we use spillCxt instead of hashCxt for a better accounting of the
1332  * spilling memory consumption.
1333  */
1334  if (file == NULL)
1335  {
1336  MemoryContext oldctx = MemoryContextSwitchTo(hashtable->spillCxt);
1337 
1338  file = BufFileCreateTemp(false);
1339  *fileptr = file;
1340 
1341  MemoryContextSwitchTo(oldctx);
1342  }
1343 
1344  BufFileWrite(file, &hashvalue, sizeof(uint32));
1345  BufFileWrite(file, tuple, tuple->t_len);
1346 }
BufFile * BufFileCreateTemp(bool interXact)
Definition: buffile.c:193
void BufFileWrite(BufFile *file, const void *ptr, size_t size)
Definition: buffile.c:676
unsigned int uint32
Definition: c.h:495
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:124
MemoryContext spillCxt
Definition: hashjoin.h:364

References BufFileCreateTemp(), BufFileWrite(), MemoryContextSwitchTo(), HashJoinTableData::spillCxt, and MinimalTupleData::t_len.

Referenced by ExecHashIncreaseNumBatches(), ExecHashJoinImpl(), ExecHashRemoveNextSkewBucket(), and ExecHashTableInsert().

◆ ExecInitHashJoin()

HashJoinState* ExecInitHashJoin ( HashJoin node,
EState estate,
int  eflags 
)

Definition at line 710 of file nodeHashjoin.c.

711 {
712  HashJoinState *hjstate;
713  Plan *outerNode;
714  Hash *hashNode;
715  TupleDesc outerDesc,
716  innerDesc;
717  const TupleTableSlotOps *ops;
718 
719  /* check for unsupported flags */
720  Assert(!(eflags & (EXEC_FLAG_BACKWARD | EXEC_FLAG_MARK)));
721 
722  /*
723  * create state structure
724  */
725  hjstate = makeNode(HashJoinState);
726  hjstate->js.ps.plan = (Plan *) node;
727  hjstate->js.ps.state = estate;
728 
729  /*
730  * See ExecHashJoinInitializeDSM() and ExecHashJoinInitializeWorker()
731  * where this function may be replaced with a parallel version, if we
732  * managed to launch a parallel query.
733  */
734  hjstate->js.ps.ExecProcNode = ExecHashJoin;
735  hjstate->js.jointype = node->join.jointype;
736 
737  /*
738  * Miscellaneous initialization
739  *
740  * create expression context for node
741  */
742  ExecAssignExprContext(estate, &hjstate->js.ps);
743 
744  /*
745  * initialize child nodes
746  *
747  * Note: we could suppress the REWIND flag for the inner input, which
748  * would amount to betting that the hash will be a single batch. Not
749  * clear if this would be a win or not.
750  */
751  outerNode = outerPlan(node);
752  hashNode = (Hash *) innerPlan(node);
753 
754  outerPlanState(hjstate) = ExecInitNode(outerNode, estate, eflags);
755  outerDesc = ExecGetResultType(outerPlanState(hjstate));
756  innerPlanState(hjstate) = ExecInitNode((Plan *) hashNode, estate, eflags);
757  innerDesc = ExecGetResultType(innerPlanState(hjstate));
758 
759  /*
760  * Initialize result slot, type and projection.
761  */
763  ExecAssignProjectionInfo(&hjstate->js.ps, NULL);
764 
765  /*
766  * tuple table initialization
767  */
768  ops = ExecGetResultSlotOps(outerPlanState(hjstate), NULL);
769  hjstate->hj_OuterTupleSlot = ExecInitExtraTupleSlot(estate, outerDesc,
770  ops);
771 
772  /*
773  * detect whether we need only consider the first matching inner tuple
774  */
775  hjstate->js.single_match = (node->join.inner_unique ||
776  node->join.jointype == JOIN_SEMI);
777 
778  /* set up null tuples for outer joins, if needed */
779  switch (node->join.jointype)
780  {
781  case JOIN_INNER:
782  case JOIN_SEMI:
783  break;
784  case JOIN_LEFT:
785  case JOIN_ANTI:
786  hjstate->hj_NullInnerTupleSlot =
787  ExecInitNullTupleSlot(estate, innerDesc, &TTSOpsVirtual);
788  break;
789  case JOIN_RIGHT:
790  case JOIN_RIGHT_ANTI:
791  hjstate->hj_NullOuterTupleSlot =
792  ExecInitNullTupleSlot(estate, outerDesc, &TTSOpsVirtual);
793  break;
794  case JOIN_FULL:
795  hjstate->hj_NullOuterTupleSlot =
796  ExecInitNullTupleSlot(estate, outerDesc, &TTSOpsVirtual);
797  hjstate->hj_NullInnerTupleSlot =
798  ExecInitNullTupleSlot(estate, innerDesc, &TTSOpsVirtual);
799  break;
800  default:
801  elog(ERROR, "unrecognized join type: %d",
802  (int) node->join.jointype);
803  }
804 
805  /*
806  * now for some voodoo. our temporary tuple slot is actually the result
807  * tuple slot of the Hash node (which is our inner plan). we can do this
808  * because Hash nodes don't return tuples via ExecProcNode() -- instead
809  * the hash join node uses ExecScanHashBucket() to get at the contents of
810  * the hash table. -cim 6/9/91
811  */
812  {
813  HashState *hashstate = (HashState *) innerPlanState(hjstate);
814  TupleTableSlot *slot = hashstate->ps.ps_ResultTupleSlot;
815 
816  hjstate->hj_HashTupleSlot = slot;
817  }
818 
819  /*
820  * initialize child expressions
821  */
822  hjstate->js.ps.qual =
823  ExecInitQual(node->join.plan.qual, (PlanState *) hjstate);
824  hjstate->js.joinqual =
825  ExecInitQual(node->join.joinqual, (PlanState *) hjstate);
826  hjstate->hashclauses =
827  ExecInitQual(node->hashclauses, (PlanState *) hjstate);
828 
829  /*
830  * initialize hash-specific info
831  */
832  hjstate->hj_HashTable = NULL;
833  hjstate->hj_FirstOuterTupleSlot = NULL;
834 
835  hjstate->hj_CurHashValue = 0;
836  hjstate->hj_CurBucketNo = 0;
838  hjstate->hj_CurTuple = NULL;
839 
840  hjstate->hj_OuterHashKeys = ExecInitExprList(node->hashkeys,
841  (PlanState *) hjstate);
842  hjstate->hj_HashOperators = node->hashoperators;
843  hjstate->hj_Collations = node->hashcollations;
844 
845  hjstate->hj_JoinState = HJ_BUILD_HASHTABLE;
846  hjstate->hj_MatchedOuter = false;
847  hjstate->hj_OuterNotEmpty = false;
848 
849  return hjstate;
850 }
#define ERROR
Definition: elog.h:39
List * ExecInitExprList(List *nodes, PlanState *parent)
Definition: execExpr.c:320
ExprState * ExecInitQual(List *qual, PlanState *parent)
Definition: execExpr.c:214
PlanState * ExecInitNode(Plan *node, EState *estate, int eflags)
Definition: execProcnode.c:142
const TupleTableSlotOps TTSOpsVirtual
Definition: execTuples.c:83
TupleTableSlot * ExecInitNullTupleSlot(EState *estate, TupleDesc tupType, const TupleTableSlotOps *tts_ops)
Definition: execTuples.c:1846
TupleTableSlot * ExecInitExtraTupleSlot(EState *estate, TupleDesc tupledesc, const TupleTableSlotOps *tts_ops)
Definition: execTuples.c:1830
void ExecInitResultTupleSlotTL(PlanState *planstate, const TupleTableSlotOps *tts_ops)
Definition: execTuples.c:1798
TupleDesc ExecGetResultType(PlanState *planstate)
Definition: execUtils.c:498
const TupleTableSlotOps * ExecGetResultSlotOps(PlanState *planstate, bool *isfixed)
Definition: execUtils.c:507
void ExecAssignExprContext(EState *estate, PlanState *planstate)
Definition: execUtils.c:488
void ExecAssignProjectionInfo(PlanState *planstate, TupleDesc inputDesc)
Definition: execUtils.c:543
#define EXEC_FLAG_BACKWARD
Definition: executor.h:68
#define EXEC_FLAG_MARK
Definition: executor.h:69
#define INVALID_SKEW_BUCKET_NO
Definition: hashjoin.h:120
Assert(fmt[strlen(fmt) - 1] !='\n')
static TupleTableSlot * ExecHashJoin(PlanState *pstate)
Definition: nodeHashjoin.c:678
#define HJ_BUILD_HASHTABLE
Definition: nodeHashjoin.c:180
#define makeNode(_type_)
Definition: nodes.h:155
@ JOIN_SEMI
Definition: nodes.h:297
@ JOIN_FULL
Definition: nodes.h:285
@ JOIN_INNER
Definition: nodes.h:283
@ JOIN_RIGHT
Definition: nodes.h:286
@ JOIN_LEFT
Definition: nodes.h:284
@ JOIN_RIGHT_ANTI
Definition: nodes.h:299
@ JOIN_ANTI
Definition: nodes.h:298
#define innerPlan(node)
Definition: plannodes.h:181
#define outerPlan(node)
Definition: plannodes.h:182
HashJoinTuple hj_CurTuple
Definition: execnodes.h:2120
int hj_CurSkewBucketNo
Definition: execnodes.h:2119
List * hj_OuterHashKeys
Definition: execnodes.h:2113
TupleTableSlot * hj_NullOuterTupleSlot
Definition: execnodes.h:2123
TupleTableSlot * hj_OuterTupleSlot
Definition: execnodes.h:2121
bool hj_OuterNotEmpty
Definition: execnodes.h:2128
TupleTableSlot * hj_NullInnerTupleSlot
Definition: execnodes.h:2124
List * hj_HashOperators
Definition: execnodes.h:2114
ExprState * hashclauses
Definition: execnodes.h:2112
JoinState js
Definition: execnodes.h:2111
TupleTableSlot * hj_FirstOuterTupleSlot
Definition: execnodes.h:2125
bool hj_MatchedOuter
Definition: execnodes.h:2127
uint32 hj_CurHashValue
Definition: execnodes.h:2117
List * hj_Collations
Definition: execnodes.h:2115
int hj_CurBucketNo
Definition: execnodes.h:2118
TupleTableSlot * hj_HashTupleSlot
Definition: execnodes.h:2122
List * hashcollations
Definition: plannodes.h:865
List * hashclauses
Definition: plannodes.h:863
List * hashoperators
Definition: plannodes.h:864
Join join
Definition: plannodes.h:862
List * hashkeys
Definition: plannodes.h:871
PlanState ps
Definition: execnodes.h:2667
JoinType jointype
Definition: execnodes.h:2009
PlanState ps
Definition: execnodes.h:2008
ExprState * joinqual
Definition: execnodes.h:2012
bool single_match
Definition: execnodes.h:2010
List * joinqual
Definition: plannodes.h:791
JoinType jointype
Definition: plannodes.h:789
bool inner_unique
Definition: plannodes.h:790
ExprState * qual
Definition: execnodes.h:1064
Plan * plan
Definition: execnodes.h:1043
EState * state
Definition: execnodes.h:1045
TupleTableSlot * ps_ResultTupleSlot
Definition: execnodes.h:1081
ExecProcNodeMtd ExecProcNode
Definition: execnodes.h:1049

References Assert(), elog(), ERROR, EXEC_FLAG_BACKWARD, EXEC_FLAG_MARK, ExecAssignExprContext(), ExecAssignProjectionInfo(), ExecGetResultSlotOps(), ExecGetResultType(), ExecHashJoin(), ExecInitExprList(), ExecInitExtraTupleSlot(), ExecInitNode(), ExecInitNullTupleSlot(), ExecInitQual(), ExecInitResultTupleSlotTL(), PlanState::ExecProcNode, HashJoinState::hashclauses, HashJoin::hashclauses, HashJoin::hashcollations, HashJoin::hashkeys, HashJoin::hashoperators, HJ_BUILD_HASHTABLE, HashJoinState::hj_Collations, HashJoinState::hj_CurBucketNo, HashJoinState::hj_CurHashValue, HashJoinState::hj_CurSkewBucketNo, HashJoinState::hj_CurTuple, HashJoinState::hj_FirstOuterTupleSlot, HashJoinState::hj_HashOperators, HashJoinState::hj_HashTable, HashJoinState::hj_HashTupleSlot, HashJoinState::hj_JoinState, HashJoinState::hj_MatchedOuter, HashJoinState::hj_NullInnerTupleSlot, HashJoinState::hj_NullOuterTupleSlot, HashJoinState::hj_OuterHashKeys, HashJoinState::hj_OuterNotEmpty, HashJoinState::hj_OuterTupleSlot, Join::inner_unique, innerPlan, innerPlanState, INVALID_SKEW_BUCKET_NO, HashJoin::join, JOIN_ANTI, JOIN_FULL, JOIN_INNER, JOIN_LEFT, JOIN_RIGHT, JOIN_RIGHT_ANTI, JOIN_SEMI, JoinState::joinqual, Join::joinqual, JoinState::jointype, Join::jointype, HashJoinState::js, makeNode, outerPlan, outerPlanState, PlanState::plan, JoinState::ps, HashState::ps, PlanState::ps_ResultTupleSlot, PlanState::qual, JoinState::single_match, PlanState::state, and TTSOpsVirtual.

Referenced by ExecInitNode().

◆ ExecReScanHashJoin()

void ExecReScanHashJoin ( HashJoinState node)

Definition at line 1395 of file nodeHashjoin.c.

1396 {
1399 
1400  /*
1401  * In a multi-batch join, we currently have to do rescans the hard way,
1402  * primarily because batch temp files may have already been released. But
1403  * if it's a single-batch join, and there is no parameter change for the
1404  * inner subnode, then we can just re-use the existing hash table without
1405  * rebuilding it.
1406  */
1407  if (node->hj_HashTable != NULL)
1408  {
1409  if (node->hj_HashTable->nbatch == 1 &&
1410  innerPlan->chgParam == NULL)
1411  {
1412  /*
1413  * Okay to reuse the hash table; needn't rescan inner, either.
1414  *
1415  * However, if it's a right/right-anti/full join, we'd better
1416  * reset the inner-tuple match flags contained in the table.
1417  */
1418  if (HJ_FILL_INNER(node))
1420 
1421  /*
1422  * Also, we need to reset our state about the emptiness of the
1423  * outer relation, so that the new scan of the outer will update
1424  * it correctly if it turns out to be empty this time. (There's no
1425  * harm in clearing it now because ExecHashJoin won't need the
1426  * info. In the other cases, where the hash table doesn't exist
1427  * or we are destroying it, we leave this state alone because
1428  * ExecHashJoin will need it the first time through.)
1429  */
1430  node->hj_OuterNotEmpty = false;
1431 
1432  /* ExecHashJoin can skip the BUILD_HASHTABLE step */
1434  }
1435  else
1436  {
1437  /* must destroy and rebuild hash table */
1438  HashState *hashNode = castNode(HashState, innerPlan);
1439 
1440  Assert(hashNode->hashtable == node->hj_HashTable);
1441  /* accumulate stats from old hash table, if wanted */
1442  /* (this should match ExecShutdownHash) */
1443  if (hashNode->ps.instrument && !hashNode->hinstrument)
1444  hashNode->hinstrument = (HashInstrumentation *)
1445  palloc0(sizeof(HashInstrumentation));
1446  if (hashNode->hinstrument)
1448  hashNode->hashtable);
1449  /* for safety, be sure to clear child plan node's pointer too */
1450  hashNode->hashtable = NULL;
1451 
1453  node->hj_HashTable = NULL;
1455 
1456  /*
1457  * if chgParam of subnode is not null then plan will be re-scanned
1458  * by first ExecProcNode.
1459  */
1460  if (innerPlan->chgParam == NULL)
1462  }
1463  }
1464 
1465  /* Always reset intra-tuple state */
1466  node->hj_CurHashValue = 0;
1467  node->hj_CurBucketNo = 0;
1469  node->hj_CurTuple = NULL;
1470 
1471  node->hj_MatchedOuter = false;
1472  node->hj_FirstOuterTupleSlot = NULL;
1473 
1474  /*
1475  * if chgParam of subnode is not null then plan will be re-scanned by
1476  * first ExecProcNode.
1477  */
1478  if (outerPlan->chgParam == NULL)
1480 }
void ExecReScan(PlanState *node)
Definition: execAmi.c:78
void * palloc0(Size size)
Definition: mcxt.c:1232
void ExecHashAccumInstrumentation(HashInstrumentation *instrument, HashJoinTable hashtable)
Definition: nodeHash.c:2851
void ExecHashTableResetMatchFlags(HashJoinTable hashtable)
Definition: nodeHash.c:2328
#define HJ_FILL_INNER(hjstate)
Definition: nodeHashjoin.c:190
#define HJ_NEED_NEW_OUTER
Definition: nodeHashjoin.c:181
#define castNode(_type_, nodeptr)
Definition: nodes.h:176
HashJoinTable hashtable
Definition: execnodes.h:2668
HashInstrumentation * hinstrument
Definition: execnodes.h:2684
Instrumentation * instrument
Definition: execnodes.h:1053

References Assert(), castNode, ExecHashAccumInstrumentation(), ExecHashTableDestroy(), ExecHashTableResetMatchFlags(), ExecReScan(), HashState::hashtable, HashState::hinstrument, HJ_BUILD_HASHTABLE, HashJoinState::hj_CurBucketNo, HashJoinState::hj_CurHashValue, HashJoinState::hj_CurSkewBucketNo, HashJoinState::hj_CurTuple, HJ_FILL_INNER, HashJoinState::hj_FirstOuterTupleSlot, HashJoinState::hj_HashTable, HashJoinState::hj_JoinState, HashJoinState::hj_MatchedOuter, HJ_NEED_NEW_OUTER, HashJoinState::hj_OuterNotEmpty, innerPlan, innerPlanState, PlanState::instrument, INVALID_SKEW_BUCKET_NO, HashJoinTableData::nbatch, outerPlan, outerPlanState, palloc0(), and HashState::ps.

Referenced by ExecReScan().

◆ ExecShutdownHashJoin()

void ExecShutdownHashJoin ( HashJoinState node)

Definition at line 1483 of file nodeHashjoin.c.

1484 {
1485  if (node->hj_HashTable)
1486  {
1487  /*
1488  * Detach from shared state before DSM memory goes away. This makes
1489  * sure that we don't have any pointers into DSM memory by the time
1490  * ExecEndHashJoin runs.
1491  */
1494  }
1495 }

References ExecHashTableDetach(), ExecHashTableDetachBatch(), and HashJoinState::hj_HashTable.

Referenced by ExecShutdownNode_walker().