PostgreSQL Source Code  git master
nodeIndexonlyscan.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * nodeIndexonlyscan.c
4  * Routines to support index-only scans
5  *
6  * Portions Copyright (c) 1996-2018, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  *
10  * IDENTIFICATION
11  * src/backend/executor/nodeIndexonlyscan.c
12  *
13  *-------------------------------------------------------------------------
14  */
15 /*
16  * INTERFACE ROUTINES
17  * ExecIndexOnlyScan scans an index
18  * IndexOnlyNext retrieve next tuple
19  * ExecInitIndexOnlyScan creates and initializes state info.
20  * ExecReScanIndexOnlyScan rescans the indexed relation.
21  * ExecEndIndexOnlyScan releases all storage.
22  * ExecIndexOnlyMarkPos marks scan position.
23  * ExecIndexOnlyRestrPos restores scan position.
24  * ExecIndexOnlyScanEstimate estimates DSM space needed for
25  * parallel index-only scan
26  * ExecIndexOnlyScanInitializeDSM initialize DSM for parallel
27  * index-only scan
28  * ExecIndexOnlyScanReInitializeDSM reinitialize DSM for fresh scan
29  * ExecIndexOnlyScanInitializeWorker attach to DSM info in parallel worker
30  */
31 #include "postgres.h"
32 
33 #include "access/relscan.h"
34 #include "access/visibilitymap.h"
35 #include "executor/execdebug.h"
37 #include "executor/nodeIndexscan.h"
38 #include "miscadmin.h"
39 #include "storage/bufmgr.h"
40 #include "storage/predicate.h"
41 #include "utils/memutils.h"
42 #include "utils/rel.h"
43 
44 
46 static void StoreIndexTuple(TupleTableSlot *slot, IndexTuple itup,
47  TupleDesc itupdesc);
48 
49 
50 /* ----------------------------------------------------------------
51  * IndexOnlyNext
52  *
53  * Retrieve a tuple from the IndexOnlyScan node's index.
54  * ----------------------------------------------------------------
55  */
56 static TupleTableSlot *
58 {
59  EState *estate;
60  ExprContext *econtext;
61  ScanDirection direction;
62  IndexScanDesc scandesc;
63  TupleTableSlot *slot;
64  ItemPointer tid;
65 
66  /*
67  * extract necessary information from index scan node
68  */
69  estate = node->ss.ps.state;
70  direction = estate->es_direction;
71  /* flip direction if this is an overall backward scan */
72  if (ScanDirectionIsBackward(((IndexOnlyScan *) node->ss.ps.plan)->indexorderdir))
73  {
74  if (ScanDirectionIsForward(direction))
75  direction = BackwardScanDirection;
76  else if (ScanDirectionIsBackward(direction))
77  direction = ForwardScanDirection;
78  }
79  scandesc = node->ioss_ScanDesc;
80  econtext = node->ss.ps.ps_ExprContext;
81  slot = node->ss.ss_ScanTupleSlot;
82 
83  if (scandesc == NULL)
84  {
85  /*
86  * We reach here if the index only scan is not parallel, or if we're
87  * executing a index only scan that was intended to be parallel
88  * serially.
89  */
90  scandesc = index_beginscan(node->ss.ss_currentRelation,
91  node->ioss_RelationDesc,
92  estate->es_snapshot,
93  node->ioss_NumScanKeys,
94  node->ioss_NumOrderByKeys);
95 
96  node->ioss_ScanDesc = scandesc;
97 
98 
99  /* Set it up for index-only scan */
100  node->ioss_ScanDesc->xs_want_itup = true;
102 
103  /*
104  * If no run-time keys to calculate or they are ready, go ahead and
105  * pass the scankeys to the index AM.
106  */
107  if (node->ioss_NumRuntimeKeys == 0 || node->ioss_RuntimeKeysReady)
108  index_rescan(scandesc,
109  node->ioss_ScanKeys,
110  node->ioss_NumScanKeys,
111  node->ioss_OrderByKeys,
112  node->ioss_NumOrderByKeys);
113  }
114 
115  /*
116  * OK, now that we have what we need, fetch the next tuple.
117  */
118  while ((tid = index_getnext_tid(scandesc, direction)) != NULL)
119  {
120  HeapTuple tuple = NULL;
121 
123 
124  /*
125  * We can skip the heap fetch if the TID references a heap page on
126  * which all tuples are known visible to everybody. In any case,
127  * we'll use the index tuple not the heap tuple as the data source.
128  *
129  * Note on Memory Ordering Effects: visibilitymap_get_status does not
130  * lock the visibility map buffer, and therefore the result we read
131  * here could be slightly stale. However, it can't be stale enough to
132  * matter.
133  *
134  * We need to detect clearing a VM bit due to an insert right away,
135  * because the tuple is present in the index page but not visible. The
136  * reading of the TID by this scan (using a shared lock on the index
137  * buffer) is serialized with the insert of the TID into the index
138  * (using an exclusive lock on the index buffer). Because the VM bit
139  * is cleared before updating the index, and locking/unlocking of the
140  * index page acts as a full memory barrier, we are sure to see the
141  * cleared bit if we see a recently-inserted TID.
142  *
143  * Deletes do not update the index page (only VACUUM will clear out
144  * the TID), so the clearing of the VM bit by a delete is not
145  * serialized with this test below, and we may see a value that is
146  * significantly stale. However, we don't care about the delete right
147  * away, because the tuple is still visible until the deleting
148  * transaction commits or the statement ends (if it's our
149  * transaction). In either case, the lock on the VM buffer will have
150  * been released (acting as a write barrier) after clearing the bit.
151  * And for us to have a snapshot that includes the deleting
152  * transaction (making the tuple invisible), we must have acquired
153  * ProcArrayLock after that time, acting as a read barrier.
154  *
155  * It's worth going through this complexity to avoid needing to lock
156  * the VM buffer, which could cause significant contention.
157  */
158  if (!VM_ALL_VISIBLE(scandesc->heapRelation,
160  &node->ioss_VMBuffer))
161  {
162  /*
163  * Rats, we have to visit the heap to check visibility.
164  */
165  InstrCountTuples2(node, 1);
166  tuple = index_fetch_heap(scandesc);
167  if (tuple == NULL)
168  continue; /* no visible tuple, try next index entry */
169 
170  /*
171  * Only MVCC snapshots are supported here, so there should be no
172  * need to keep following the HOT chain once a visible entry has
173  * been found. If we did want to allow that, we'd need to keep
174  * more state to remember not to call index_getnext_tid next time.
175  */
176  if (scandesc->xs_continue_hot)
177  elog(ERROR, "non-MVCC snapshots are not supported in index-only scans");
178 
179  /*
180  * Note: at this point we are holding a pin on the heap page, as
181  * recorded in scandesc->xs_cbuf. We could release that pin now,
182  * but it's not clear whether it's a win to do so. The next index
183  * entry might require a visit to the same heap page.
184  */
185  }
186 
187  /*
188  * Fill the scan tuple slot with data from the index. This might be
189  * provided in either HeapTuple or IndexTuple format. Conceivably an
190  * index AM might fill both fields, in which case we prefer the heap
191  * format, since it's probably a bit cheaper to fill a slot from.
192  */
193  if (scandesc->xs_hitup)
194  {
195  /*
196  * We don't take the trouble to verify that the provided tuple has
197  * exactly the slot's format, but it seems worth doing a quick
198  * check on the number of fields.
199  */
201  scandesc->xs_hitupdesc->natts);
202  ExecStoreTuple(scandesc->xs_hitup, slot, InvalidBuffer, false);
203  }
204  else if (scandesc->xs_itup)
205  StoreIndexTuple(slot, scandesc->xs_itup, scandesc->xs_itupdesc);
206  else
207  elog(ERROR, "no data returned for index-only scan");
208 
209  /*
210  * If the index was lossy, we have to recheck the index quals.
211  * (Currently, this can never happen, but we should support the case
212  * for possible future use, eg with GiST indexes.)
213  */
214  if (scandesc->xs_recheck)
215  {
216  econtext->ecxt_scantuple = slot;
217  if (!ExecQualAndReset(node->indexqual, econtext))
218  {
219  /* Fails recheck, so drop it and loop back for another */
220  InstrCountFiltered2(node, 1);
221  continue;
222  }
223  }
224 
225  /*
226  * We don't currently support rechecking ORDER BY distances. (In
227  * principle, if the index can support retrieval of the originally
228  * indexed value, it should be able to produce an exact distance
229  * calculation too. So it's not clear that adding code here for
230  * recheck/re-sort would be worth the trouble. But we should at least
231  * throw an error if someone tries it.)
232  */
233  if (scandesc->numberOfOrderBys > 0 && scandesc->xs_recheckorderby)
234  ereport(ERROR,
235  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
236  errmsg("lossy distance functions are not supported in index-only scans")));
237 
238  /*
239  * Predicate locks for index-only scans must be acquired at the page
240  * level when the heap is not accessed, since tuple-level predicate
241  * locks need the tuple's xmin value. If we had to visit the tuple
242  * anyway, then we already have the tuple-level lock and can skip the
243  * page lock.
244  */
245  if (tuple == NULL)
248  estate->es_snapshot);
249 
250  return slot;
251  }
252 
253  /*
254  * if we get here it means the index scan failed so we are at the end of
255  * the scan..
256  */
257  return ExecClearTuple(slot);
258 }
259 
260 /*
261  * StoreIndexTuple
262  * Fill the slot with data from the index tuple.
263  *
264  * At some point this might be generally-useful functionality, but
265  * right now we don't need it elsewhere.
266  */
267 static void
269 {
270  int nindexatts = itupdesc->natts;
271  Datum *values = slot->tts_values;
272  bool *isnull = slot->tts_isnull;
273  int i;
274 
275  /*
276  * Note: we must use the tupdesc supplied by the AM in index_getattr, not
277  * the slot's tupdesc, in case the latter has different datatypes (this
278  * happens for btree name_ops in particular). They'd better have the same
279  * number of columns though, as well as being datatype-compatible which is
280  * something we can't so easily check.
281  */
282  Assert(slot->tts_tupleDescriptor->natts == nindexatts);
283 
284  ExecClearTuple(slot);
285  for (i = 0; i < nindexatts; i++)
286  values[i] = index_getattr(itup, i + 1, itupdesc, &isnull[i]);
287  ExecStoreVirtualTuple(slot);
288 }
289 
290 /*
291  * IndexOnlyRecheck -- access method routine to recheck a tuple in EvalPlanQual
292  *
293  * This can't really happen, since an index can't supply CTID which would
294  * be necessary data for any potential EvalPlanQual target relation. If it
295  * did happen, the EPQ code would pass us the wrong data, namely a heap
296  * tuple not an index tuple. So throw an error.
297  */
298 static bool
300 {
301  elog(ERROR, "EvalPlanQual recheck is not supported in index-only scans");
302  return false; /* keep compiler quiet */
303 }
304 
305 /* ----------------------------------------------------------------
306  * ExecIndexOnlyScan(node)
307  * ----------------------------------------------------------------
308  */
309 static TupleTableSlot *
311 {
313 
314  /*
315  * If we have runtime keys and they've not already been set up, do it now.
316  */
317  if (node->ioss_NumRuntimeKeys != 0 && !node->ioss_RuntimeKeysReady)
318  ExecReScan((PlanState *) node);
319 
320  return ExecScan(&node->ss,
323 }
324 
325 /* ----------------------------------------------------------------
326  * ExecReScanIndexOnlyScan(node)
327  *
328  * Recalculates the values of any scan keys whose value depends on
329  * information known at runtime, then rescans the indexed relation.
330  *
331  * Updating the scan key was formerly done separately in
332  * ExecUpdateIndexScanKeys. Integrating it into ReScan makes
333  * rescans of indices and relations/general streams more uniform.
334  * ----------------------------------------------------------------
335  */
336 void
338 {
339  /*
340  * If we are doing runtime key calculations (ie, any of the index key
341  * values weren't simple Consts), compute the new key values. But first,
342  * reset the context so we don't leak memory as each outer tuple is
343  * scanned. Note this assumes that we will recalculate *all* runtime keys
344  * on each call.
345  */
346  if (node->ioss_NumRuntimeKeys != 0)
347  {
348  ExprContext *econtext = node->ioss_RuntimeContext;
349 
350  ResetExprContext(econtext);
351  ExecIndexEvalRuntimeKeys(econtext,
352  node->ioss_RuntimeKeys,
353  node->ioss_NumRuntimeKeys);
354  }
355  node->ioss_RuntimeKeysReady = true;
356 
357  /* reset index scan */
358  if (node->ioss_ScanDesc)
360  node->ioss_ScanKeys, node->ioss_NumScanKeys,
362 
363  ExecScanReScan(&node->ss);
364 }
365 
366 
367 /* ----------------------------------------------------------------
368  * ExecEndIndexOnlyScan
369  * ----------------------------------------------------------------
370  */
371 void
373 {
374  Relation indexRelationDesc;
375  IndexScanDesc indexScanDesc;
376  Relation relation;
377 
378  /*
379  * extract information from the node
380  */
381  indexRelationDesc = node->ioss_RelationDesc;
382  indexScanDesc = node->ioss_ScanDesc;
383  relation = node->ss.ss_currentRelation;
384 
385  /* Release VM buffer pin, if any. */
386  if (node->ioss_VMBuffer != InvalidBuffer)
387  {
390  }
391 
392  /*
393  * Free the exprcontext(s) ... now dead code, see ExecFreeExprContext
394  */
395 #ifdef NOT_USED
396  ExecFreeExprContext(&node->ss.ps);
397  if (node->ioss_RuntimeContext)
399 #endif
400 
401  /*
402  * clear out tuple table slots
403  */
406 
407  /*
408  * close the index relation (no-op if we didn't open it)
409  */
410  if (indexScanDesc)
411  index_endscan(indexScanDesc);
412  if (indexRelationDesc)
413  index_close(indexRelationDesc, NoLock);
414 
415  /*
416  * close the heap relation.
417  */
418  ExecCloseScanRelation(relation);
419 }
420 
421 /* ----------------------------------------------------------------
422  * ExecIndexOnlyMarkPos
423  *
424  * Note: we assume that no caller attempts to set a mark before having read
425  * at least one tuple. Otherwise, ioss_ScanDesc might still be NULL.
426  * ----------------------------------------------------------------
427  */
428 void
430 {
431  EState *estate = node->ss.ps.state;
432 
433  if (estate->es_epqTuple != NULL)
434  {
435  /*
436  * We are inside an EvalPlanQual recheck. If a test tuple exists for
437  * this relation, then we shouldn't access the index at all. We would
438  * instead need to save, and later restore, the state of the
439  * es_epqScanDone flag, so that re-fetching the test tuple is
440  * possible. However, given the assumption that no caller sets a mark
441  * at the start of the scan, we can only get here with es_epqScanDone
442  * already set, and so no state need be saved.
443  */
444  Index scanrelid = ((Scan *) node->ss.ps.plan)->scanrelid;
445 
446  Assert(scanrelid > 0);
447  if (estate->es_epqTupleSet[scanrelid - 1])
448  {
449  /* Verify the claim above */
450  if (!estate->es_epqScanDone[scanrelid - 1])
451  elog(ERROR, "unexpected ExecIndexOnlyMarkPos call in EPQ recheck");
452  return;
453  }
454  }
455 
457 }
458 
459 /* ----------------------------------------------------------------
460  * ExecIndexOnlyRestrPos
461  * ----------------------------------------------------------------
462  */
463 void
465 {
466  EState *estate = node->ss.ps.state;
467 
468  if (estate->es_epqTuple != NULL)
469  {
470  /* See comments in ExecIndexOnlyMarkPos */
471  Index scanrelid = ((Scan *) node->ss.ps.plan)->scanrelid;
472 
473  Assert(scanrelid > 0);
474  if (estate->es_epqTupleSet[scanrelid - 1])
475  {
476  /* Verify the claim above */
477  if (!estate->es_epqScanDone[scanrelid - 1])
478  elog(ERROR, "unexpected ExecIndexOnlyRestrPos call in EPQ recheck");
479  return;
480  }
481  }
482 
484 }
485 
486 /* ----------------------------------------------------------------
487  * ExecInitIndexOnlyScan
488  *
489  * Initializes the index scan's state information, creates
490  * scan keys, and opens the base and index relations.
491  *
492  * Note: index scans have 2 sets of state information because
493  * we have to keep track of the base relation and the
494  * index relation.
495  * ----------------------------------------------------------------
496  */
498 ExecInitIndexOnlyScan(IndexOnlyScan *node, EState *estate, int eflags)
499 {
500  IndexOnlyScanState *indexstate;
501  Relation currentRelation;
502  bool relistarget;
503  TupleDesc tupDesc;
504 
505  /*
506  * create state structure
507  */
508  indexstate = makeNode(IndexOnlyScanState);
509  indexstate->ss.ps.plan = (Plan *) node;
510  indexstate->ss.ps.state = estate;
511  indexstate->ss.ps.ExecProcNode = ExecIndexOnlyScan;
512 
513  /*
514  * Miscellaneous initialization
515  *
516  * create expression context for node
517  */
518  ExecAssignExprContext(estate, &indexstate->ss.ps);
519 
520  /*
521  * open the base relation and acquire appropriate lock on it.
522  */
523  currentRelation = ExecOpenScanRelation(estate, node->scan.scanrelid, eflags);
524 
525  indexstate->ss.ss_currentRelation = currentRelation;
526  indexstate->ss.ss_currentScanDesc = NULL; /* no heap scan here */
527 
528  /*
529  * Build the scan tuple type using the indextlist generated by the
530  * planner. We use this, rather than the index's physical tuple
531  * descriptor, because the latter contains storage column types not the
532  * types of the original datums. (It's the AM's responsibility to return
533  * suitable data anyway.)
534  */
535  tupDesc = ExecTypeFromTL(node->indextlist, false);
536  ExecInitScanTupleSlot(estate, &indexstate->ss, tupDesc);
537 
538  /*
539  * Initialize result slot, type and projection info. The node's
540  * targetlist will contain Vars with varno = INDEX_VAR, referencing the
541  * scan tuple.
542  */
543  ExecInitResultTupleSlotTL(estate, &indexstate->ss.ps);
545 
546  /*
547  * initialize child expressions
548  *
549  * Note: we don't initialize all of the indexorderby expression, only the
550  * sub-parts corresponding to runtime keys (see below).
551  */
552  indexstate->ss.ps.qual =
553  ExecInitQual(node->scan.plan.qual, (PlanState *) indexstate);
554  indexstate->indexqual =
555  ExecInitQual(node->indexqual, (PlanState *) indexstate);
556 
557  /*
558  * If we are just doing EXPLAIN (ie, aren't going to run the plan), stop
559  * here. This allows an index-advisor plugin to EXPLAIN a plan containing
560  * references to nonexistent indexes.
561  */
562  if (eflags & EXEC_FLAG_EXPLAIN_ONLY)
563  return indexstate;
564 
565  /*
566  * Open the index relation.
567  *
568  * If the parent table is one of the target relations of the query, then
569  * InitPlan already opened and write-locked the index, so we can avoid
570  * taking another lock here. Otherwise we need a normal reader's lock.
571  */
572  relistarget = ExecRelationIsTargetRelation(estate, node->scan.scanrelid);
573  indexstate->ioss_RelationDesc = index_open(node->indexid,
574  relistarget ? NoLock : AccessShareLock);
575 
576  /*
577  * Initialize index-specific scan state
578  */
579  indexstate->ioss_RuntimeKeysReady = false;
580  indexstate->ioss_RuntimeKeys = NULL;
581  indexstate->ioss_NumRuntimeKeys = 0;
582 
583  /*
584  * build the index scan keys from the index qualification
585  */
586  ExecIndexBuildScanKeys((PlanState *) indexstate,
587  indexstate->ioss_RelationDesc,
588  node->indexqual,
589  false,
590  &indexstate->ioss_ScanKeys,
591  &indexstate->ioss_NumScanKeys,
592  &indexstate->ioss_RuntimeKeys,
593  &indexstate->ioss_NumRuntimeKeys,
594  NULL, /* no ArrayKeys */
595  NULL);
596 
597  /*
598  * any ORDER BY exprs have to be turned into scankeys in the same way
599  */
600  ExecIndexBuildScanKeys((PlanState *) indexstate,
601  indexstate->ioss_RelationDesc,
602  node->indexorderby,
603  true,
604  &indexstate->ioss_OrderByKeys,
605  &indexstate->ioss_NumOrderByKeys,
606  &indexstate->ioss_RuntimeKeys,
607  &indexstate->ioss_NumRuntimeKeys,
608  NULL, /* no ArrayKeys */
609  NULL);
610 
611  /*
612  * If we have runtime keys, we need an ExprContext to evaluate them. The
613  * node's standard context won't do because we want to reset that context
614  * for every tuple. So, build another context just like the other one...
615  * -tgl 7/11/00
616  */
617  if (indexstate->ioss_NumRuntimeKeys != 0)
618  {
619  ExprContext *stdecontext = indexstate->ss.ps.ps_ExprContext;
620 
621  ExecAssignExprContext(estate, &indexstate->ss.ps);
622  indexstate->ioss_RuntimeContext = indexstate->ss.ps.ps_ExprContext;
623  indexstate->ss.ps.ps_ExprContext = stdecontext;
624  }
625  else
626  {
627  indexstate->ioss_RuntimeContext = NULL;
628  }
629 
630  /*
631  * all done.
632  */
633  return indexstate;
634 }
635 
636 /* ----------------------------------------------------------------
637  * Parallel Index-only Scan Support
638  * ----------------------------------------------------------------
639  */
640 
641 /* ----------------------------------------------------------------
642  * ExecIndexOnlyScanEstimate
643  *
644  * Compute the amount of space we'll need in the parallel
645  * query DSM, and inform pcxt->estimator about our needs.
646  * ----------------------------------------------------------------
647  */
648 void
650  ParallelContext *pcxt)
651 {
652  EState *estate = node->ss.ps.state;
653 
655  estate->es_snapshot);
657  shm_toc_estimate_keys(&pcxt->estimator, 1);
658 }
659 
660 /* ----------------------------------------------------------------
661  * ExecIndexOnlyScanInitializeDSM
662  *
663  * Set up a parallel index-only scan descriptor.
664  * ----------------------------------------------------------------
665  */
666 void
668  ParallelContext *pcxt)
669 {
670  EState *estate = node->ss.ps.state;
671  ParallelIndexScanDesc piscan;
672 
673  piscan = shm_toc_allocate(pcxt->toc, node->ioss_PscanLen);
675  node->ioss_RelationDesc,
676  estate->es_snapshot,
677  piscan);
678  shm_toc_insert(pcxt->toc, node->ss.ps.plan->plan_node_id, piscan);
679  node->ioss_ScanDesc =
681  node->ioss_RelationDesc,
682  node->ioss_NumScanKeys,
683  node->ioss_NumOrderByKeys,
684  piscan);
685  node->ioss_ScanDesc->xs_want_itup = true;
687 
688  /*
689  * If no run-time keys to calculate or they are ready, go ahead and pass
690  * the scankeys to the index AM.
691  */
692  if (node->ioss_NumRuntimeKeys == 0 || node->ioss_RuntimeKeysReady)
694  node->ioss_ScanKeys, node->ioss_NumScanKeys,
696 }
697 
698 /* ----------------------------------------------------------------
699  * ExecIndexOnlyScanReInitializeDSM
700  *
701  * Reset shared state before beginning a fresh scan.
702  * ----------------------------------------------------------------
703  */
704 void
706  ParallelContext *pcxt)
707 {
709 }
710 
711 /* ----------------------------------------------------------------
712  * ExecIndexOnlyScanInitializeWorker
713  *
714  * Copy relevant information from TOC into planstate.
715  * ----------------------------------------------------------------
716  */
717 void
719  ParallelWorkerContext *pwcxt)
720 {
721  ParallelIndexScanDesc piscan;
722 
723  piscan = shm_toc_lookup(pwcxt->toc, node->ss.ps.plan->plan_node_id, false);
724  node->ioss_ScanDesc =
726  node->ioss_RelationDesc,
727  node->ioss_NumScanKeys,
728  node->ioss_NumOrderByKeys,
729  piscan);
730  node->ioss_ScanDesc->xs_want_itup = true;
731 
732  /*
733  * If no run-time keys to calculate or they are ready, go ahead and pass
734  * the scankeys to the index AM.
735  */
736  if (node->ioss_NumRuntimeKeys == 0 || node->ioss_RuntimeKeysReady)
738  node->ioss_ScanKeys, node->ioss_NumScanKeys,
740 }
bool ioss_RuntimeKeysReady
Definition: execnodes.h:1328
TupleTableSlot * ExecStoreTuple(HeapTuple tuple, TupleTableSlot *slot, Buffer buffer, bool shouldFree)
Definition: execTuples.c:356
List * qual
Definition: plannodes.h:147
HeapTuple * es_epqTuple
Definition: execnodes.h:558
void PredicateLockPage(Relation relation, BlockNumber blkno, Snapshot snapshot)
Definition: predicate.c:2475
Plan plan
Definition: plannodes.h:342
Index scanrelid
Definition: plannodes.h:343
#define ScanDirectionIsForward(direction)
Definition: sdir.h:55
IndexTuple xs_itup
Definition: relscan.h:115
#define castNode(_type_, nodeptr)
Definition: nodes.h:586
IndexScanDesc index_beginscan_parallel(Relation heaprel, Relation indexrel, int nkeys, int norderbys, ParallelIndexScanDesc pscan)
Definition: indexam.c:496
void ExecIndexOnlyRestrPos(IndexOnlyScanState *node)
TupleTableSlot * ExecScan(ScanState *node, ExecScanAccessMtd accessMtd, ExecScanRecheckMtd recheckMtd)
Definition: execScan.c:121
void index_markpos(IndexScanDesc scan)
Definition: indexam.c:370
ExprContext * ps_ExprContext
Definition: execnodes.h:946
shm_toc_estimator estimator
Definition: parallel.h:41
void ExecReScan(PlanState *node)
Definition: execAmi.c:76
TupleTableSlot * ExecClearTuple(TupleTableSlot *slot)
Definition: execTuples.c:475
int plan_node_id
Definition: plannodes.h:145
#define AccessShareLock
Definition: lockdefs.h:36
#define InvalidBuffer
Definition: buf.h:25
void index_rescan(IndexScanDesc scan, ScanKey keys, int nkeys, ScanKey orderbys, int norderbys)
Definition: indexam.c:310
int errcode(int sqlerrcode)
Definition: elog.c:575
IndexRuntimeKeyInfo * ioss_RuntimeKeys
Definition: execnodes.h:1326
bool xs_recheckorderby
Definition: relscan.h:135
Snapshot es_snapshot
Definition: execnodes.h:478
Datum * tts_values
Definition: tuptable.h:130
TupleTableSlot * ss_ScanTupleSlot
Definition: execnodes.h:1194
void ExecReScanIndexOnlyScan(IndexOnlyScanState *node)
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
TupleDesc xs_itupdesc
Definition: relscan.h:116
Relation ss_currentRelation
Definition: execnodes.h:1192
EState * state
Definition: execnodes.h:913
#define shm_toc_estimate_chunk(e, sz)
Definition: shm_toc.h:51
static bool IndexOnlyRecheck(IndexOnlyScanState *node, TupleTableSlot *slot)
int natts
Definition: tupdesc.h:82
void ExecFreeExprContext(PlanState *planstate)
Definition: execUtils.c:566
TupleDesc xs_hitupdesc
Definition: relscan.h:118
ScanDirection es_direction
Definition: execnodes.h:477
ExprState * ExecInitQual(List *qual, PlanState *parent)
Definition: execExpr.c:205
Size index_parallelscan_estimate(Relation indexRelation, Snapshot snapshot)
Definition: indexam.c:417
void index_parallelrescan(IndexScanDesc scan)
Definition: indexam.c:481
Relation heapRelation
Definition: relscan.h:90
void ExecAssignScanProjectionInfoWithVarno(ScanState *node, Index varno)
Definition: execScan.c:248
void index_restrpos(IndexScanDesc scan)
Definition: indexam.c:395
PlanState ps
Definition: execnodes.h:1191
ScanKey ioss_ScanKeys
Definition: execnodes.h:1322
#define ScanDirectionIsBackward(direction)
Definition: sdir.h:41
ItemPointer index_getnext_tid(IndexScanDesc scan, ScanDirection direction)
Definition: indexam.c:526
TupleTableSlot * ps_ResultTupleSlot
Definition: execnodes.h:945
void ExecIndexOnlyMarkPos(IndexOnlyScanState *node)
#define ERROR
Definition: elog.h:43
Relation ExecOpenScanRelation(EState *estate, Index scanrelid, int eflags)
Definition: execUtils.c:643
void ExecIndexOnlyScanEstimate(IndexOnlyScanState *node, ParallelContext *pcxt)
ExprContext * ioss_RuntimeContext
Definition: execnodes.h:1329
#define NoLock
Definition: lockdefs.h:34
bool * tts_isnull
Definition: tuptable.h:132
HeapTuple index_fetch_heap(IndexScanDesc scan)
Definition: indexam.c:583
IndexScanDesc ioss_ScanDesc
Definition: execnodes.h:1331
ScanDirection
Definition: sdir.h:22
bool xs_continue_hot
Definition: relscan.h:138
#define InstrCountTuples2(node, delta)
Definition: execnodes.h:968
void ExecEndIndexOnlyScan(IndexOnlyScanState *node)
void index_endscan(IndexScanDesc scan)
Definition: indexam.c:340
#define ereport(elevel, rest)
Definition: elog.h:122
ScanKey ioss_OrderByKeys
Definition: execnodes.h:1324
TupleDesc ExecTypeFromTL(List *targetList, bool hasoid)
Definition: execTuples.c:965
bool(* ExecScanRecheckMtd)(ScanState *node, TupleTableSlot *slot)
Definition: executor.h:422
TupleDesc tts_tupleDescriptor
Definition: tuptable.h:124
static bool ExecQualAndReset(ExprState *state, ExprContext *econtext)
Definition: executor.h:388
ExecProcNodeMtd ExecProcNode
Definition: execnodes.h:917
uintptr_t Datum
Definition: postgres.h:365
void FreeExprContext(ExprContext *econtext, bool isCommit)
Definition: execUtils.c:359
unsigned int Index
Definition: c.h:442
void ExecInitResultTupleSlotTL(EState *estate, PlanState *planstate)
Definition: execTuples.c:890
Plan * plan
Definition: execnodes.h:911
Relation ioss_RelationDesc
Definition: execnodes.h:1330
List * indextlist
Definition: plannodes.h:435
bool xs_want_itup
Definition: relscan.h:97
List * indexorderby
Definition: plannodes.h:434
#define makeNode(_type_)
Definition: nodes.h:565
IndexOnlyScanState * ExecInitIndexOnlyScan(IndexOnlyScan *node, EState *estate, int eflags)
#define Assert(condition)
Definition: c.h:699
static TupleTableSlot * ExecIndexOnlyScan(PlanState *pstate)
static void StoreIndexTuple(TupleTableSlot *slot, IndexTuple itup, TupleDesc itupdesc)
static TupleTableSlot * IndexOnlyNext(IndexOnlyScanState *node)
#define InstrCountFiltered2(node, delta)
Definition: execnodes.h:978
#define VM_ALL_VISIBLE(r, b, v)
Definition: visibilitymap.h:32
void ExecAssignExprContext(EState *estate, PlanState *planstate)
Definition: execUtils.c:428
void ExecIndexBuildScanKeys(PlanState *planstate, Relation index, List *quals, bool isorderby, ScanKey *scanKeys, int *numScanKeys, IndexRuntimeKeyInfo **runtimeKeys, int *numRuntimeKeys, IndexArrayKeyInfo **arrayKeys, int *numArrayKeys)
#define shm_toc_estimate_keys(e, cnt)
Definition: shm_toc.h:53
void ExecCloseScanRelation(Relation scanrel)
Definition: execUtils.c:701
List * indexqual
Definition: plannodes.h:433
ExprState * indexqual
Definition: execnodes.h:1321
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:218
#define index_getattr(tup, attnum, tupleDesc, isnull)
Definition: itup.h:100
bool * es_epqTupleSet
Definition: execnodes.h:559
void * shm_toc_allocate(shm_toc *toc, Size nbytes)
Definition: shm_toc.c:88
void ExecIndexOnlyScanInitializeWorker(IndexOnlyScanState *node, ParallelWorkerContext *pwcxt)
void ExecIndexOnlyScanReInitializeDSM(IndexOnlyScanState *node, ParallelContext *pcxt)
void ExecIndexEvalRuntimeKeys(ExprContext *econtext, IndexRuntimeKeyInfo *runtimeKeys, int numRuntimeKeys)
ExprState * qual
Definition: execnodes.h:929
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
static Datum values[MAXATTR]
Definition: bootstrap.c:164
HeapScanDesc ss_currentScanDesc
Definition: execnodes.h:1193
void shm_toc_insert(shm_toc *toc, uint64 key, void *address)
Definition: shm_toc.c:171
int errmsg(const char *fmt,...)
Definition: elog.c:797
HeapTuple xs_hitup
Definition: relscan.h:117
void index_parallelscan_initialize(Relation heapRelation, Relation indexRelation, Snapshot snapshot, ParallelIndexScanDesc target)
Definition: indexam.c:450
int i
bool * es_epqScanDone
Definition: execnodes.h:560
void ExecScanReScan(ScanState *node)
Definition: execScan.c:262
void ExecIndexOnlyScanInitializeDSM(IndexOnlyScanState *node, ParallelContext *pcxt)
void ExecInitScanTupleSlot(EState *estate, ScanState *scanstate, TupleDesc tupledesc)
Definition: execTuples.c:915
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
int numberOfOrderBys
Definition: relscan.h:94
#define elog
Definition: elog.h:219
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:76
TupleTableSlot *(* ExecScanAccessMtd)(ScanState *node)
Definition: executor.h:421
#define INDEX_VAR
Definition: primnodes.h:156
#define EXEC_FLAG_EXPLAIN_ONLY
Definition: executor.h:58
void * shm_toc_lookup(shm_toc *toc, uint64 key, bool noError)
Definition: shm_toc.c:232
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:150
bool ExecRelationIsTargetRelation(EState *estate, Index scanrelid)
Definition: execUtils.c:617
#define ResetExprContext(econtext)
Definition: executor.h:483
TupleTableSlot * ExecStoreVirtualTuple(TupleTableSlot *slot)
Definition: execTuples.c:524
shm_toc * toc
Definition: parallel.h:44
IndexScanDesc index_beginscan(Relation heapRelation, Relation indexRelation, Snapshot snapshot, int nkeys, int norderbys)
Definition: indexam.c:221