PostgreSQL Source Code  git master
ginbtree.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * ginbtree.c
4  * page utilities routines for the postgres inverted index access method.
5  *
6  *
7  * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
8  * Portions Copyright (c) 1994, Regents of the University of California
9  *
10  * IDENTIFICATION
11  * src/backend/access/gin/ginbtree.c
12  *-------------------------------------------------------------------------
13  */
14 
15 #include "postgres.h"
16 
17 #include "access/gin_private.h"
18 #include "access/ginxlog.h"
19 #include "access/xloginsert.h"
20 #include "miscadmin.h"
21 #include "storage/predicate.h"
22 #include "utils/memutils.h"
23 #include "utils/rel.h"
24 
25 static void ginFindParents(GinBtree btree, GinBtreeStack *stack);
26 static bool ginPlaceToPage(GinBtree btree, GinBtreeStack *stack,
27  void *insertdata, BlockNumber updateblkno,
28  Buffer childbuf, GinStatsData *buildStats);
29 static void ginFinishSplit(GinBtree btree, GinBtreeStack *stack,
30  bool freestack, GinStatsData *buildStats);
31 
32 /*
33  * Lock buffer by needed method for search.
34  */
35 int
36 ginTraverseLock(Buffer buffer, bool searchMode)
37 {
38  Page page;
39  int access = GIN_SHARE;
40 
41  LockBuffer(buffer, GIN_SHARE);
42  page = BufferGetPage(buffer);
43  if (GinPageIsLeaf(page))
44  {
45  if (searchMode == false)
46  {
47  /* we should relock our page */
48  LockBuffer(buffer, GIN_UNLOCK);
49  LockBuffer(buffer, GIN_EXCLUSIVE);
50 
51  /* But root can become non-leaf during relock */
52  if (!GinPageIsLeaf(page))
53  {
54  /* restore old lock type (very rare) */
55  LockBuffer(buffer, GIN_UNLOCK);
56  LockBuffer(buffer, GIN_SHARE);
57  }
58  else
59  access = GIN_EXCLUSIVE;
60  }
61  }
62 
63  return access;
64 }
65 
66 /*
67  * Descend the tree to the leaf page that contains or would contain the key
68  * we're searching for. The key should already be filled in 'btree', in
69  * tree-type specific manner. If btree->fullScan is true, descends to the
70  * leftmost leaf page.
71  *
72  * If 'searchmode' is false, on return stack->buffer is exclusively locked,
73  * and the stack represents the full path to the root. Otherwise stack->buffer
74  * is share-locked, and stack->parent is NULL.
75  *
76  * If 'rootConflictCheck' is true, tree root is checked for serialization
77  * conflict.
78  */
80 ginFindLeafPage(GinBtree btree, bool searchMode,
81  bool rootConflictCheck, Snapshot snapshot)
82 {
83  GinBtreeStack *stack;
84 
85  stack = (GinBtreeStack *) palloc(sizeof(GinBtreeStack));
86  stack->blkno = btree->rootBlkno;
87  stack->buffer = ReadBuffer(btree->index, btree->rootBlkno);
88  stack->parent = NULL;
89  stack->predictNumber = 1;
90 
91  if (rootConflictCheck)
92  CheckForSerializableConflictIn(btree->index, NULL, btree->rootBlkno);
93 
94  for (;;)
95  {
96  Page page;
97  BlockNumber child;
98  int access;
99 
100  stack->off = InvalidOffsetNumber;
101 
102  page = BufferGetPage(stack->buffer);
103  TestForOldSnapshot(snapshot, btree->index, page);
104 
105  access = ginTraverseLock(stack->buffer, searchMode);
106 
107  /*
108  * If we're going to modify the tree, finish any incomplete splits we
109  * encounter on the way.
110  */
111  if (!searchMode && GinPageIsIncompleteSplit(page))
112  ginFinishSplit(btree, stack, false, NULL);
113 
114  /*
115  * ok, page is correctly locked, we should check to move right ..,
116  * root never has a right link, so small optimization
117  */
118  while (btree->fullScan == false && stack->blkno != btree->rootBlkno &&
119  btree->isMoveRight(btree, page))
120  {
121  BlockNumber rightlink = GinPageGetOpaque(page)->rightlink;
122 
123  if (rightlink == InvalidBlockNumber)
124  /* rightmost page */
125  break;
126 
127  stack->buffer = ginStepRight(stack->buffer, btree->index, access);
128  stack->blkno = rightlink;
129  page = BufferGetPage(stack->buffer);
130  TestForOldSnapshot(snapshot, btree->index, page);
131 
132  if (!searchMode && GinPageIsIncompleteSplit(page))
133  ginFinishSplit(btree, stack, false, NULL);
134  }
135 
136  if (GinPageIsLeaf(page)) /* we found, return locked page */
137  return stack;
138 
139  /* now we have correct buffer, try to find child */
140  child = btree->findChildPage(btree, stack);
141 
142  LockBuffer(stack->buffer, GIN_UNLOCK);
143  Assert(child != InvalidBlockNumber);
144  Assert(stack->blkno != child);
145 
146  if (searchMode)
147  {
148  /* in search mode we may forget path to leaf */
149  stack->blkno = child;
150  stack->buffer = ReleaseAndReadBuffer(stack->buffer, btree->index, stack->blkno);
151  }
152  else
153  {
154  GinBtreeStack *ptr = (GinBtreeStack *) palloc(sizeof(GinBtreeStack));
155 
156  ptr->parent = stack;
157  stack = ptr;
158  stack->blkno = child;
159  stack->buffer = ReadBuffer(btree->index, stack->blkno);
160  stack->predictNumber = 1;
161  }
162  }
163 }
164 
165 /*
166  * Step right from current page.
167  *
168  * The next page is locked first, before releasing the current page. This is
169  * crucial to protect from concurrent page deletion (see comment in
170  * ginDeletePage).
171  */
172 Buffer
173 ginStepRight(Buffer buffer, Relation index, int lockmode)
174 {
175  Buffer nextbuffer;
176  Page page = BufferGetPage(buffer);
177  bool isLeaf = GinPageIsLeaf(page);
178  bool isData = GinPageIsData(page);
179  BlockNumber blkno = GinPageGetOpaque(page)->rightlink;
180 
181  nextbuffer = ReadBuffer(index, blkno);
182  LockBuffer(nextbuffer, lockmode);
183  UnlockReleaseBuffer(buffer);
184 
185  /* Sanity check that the page we stepped to is of similar kind. */
186  page = BufferGetPage(nextbuffer);
187  if (isLeaf != GinPageIsLeaf(page) || isData != GinPageIsData(page))
188  elog(ERROR, "right sibling of GIN page is of different type");
189 
190  return nextbuffer;
191 }
192 
193 void
195 {
196  while (stack)
197  {
198  GinBtreeStack *tmp = stack->parent;
199 
200  if (stack->buffer != InvalidBuffer)
201  ReleaseBuffer(stack->buffer);
202 
203  pfree(stack);
204  stack = tmp;
205  }
206 }
207 
208 /*
209  * Try to find parent for current stack position. Returns correct parent and
210  * child's offset in stack->parent. The root page is never released, to
211  * prevent conflict with vacuum process.
212  */
213 static void
215 {
216  Page page;
217  Buffer buffer;
218  BlockNumber blkno,
219  leftmostBlkno;
220  OffsetNumber offset;
221  GinBtreeStack *root;
222  GinBtreeStack *ptr;
223 
224  /*
225  * Unwind the stack all the way up to the root, leaving only the root
226  * item.
227  *
228  * Be careful not to release the pin on the root page! The pin on root
229  * page is required to lock out concurrent vacuums on the tree.
230  */
231  root = stack->parent;
232  while (root->parent)
233  {
234  ReleaseBuffer(root->buffer);
235  root = root->parent;
236  }
237 
238  Assert(root->blkno == btree->rootBlkno);
239  Assert(BufferGetBlockNumber(root->buffer) == btree->rootBlkno);
240  root->off = InvalidOffsetNumber;
241 
242  blkno = root->blkno;
243  buffer = root->buffer;
244 
245  ptr = (GinBtreeStack *) palloc(sizeof(GinBtreeStack));
246 
247  for (;;)
248  {
249  LockBuffer(buffer, GIN_EXCLUSIVE);
250  page = BufferGetPage(buffer);
251  if (GinPageIsLeaf(page))
252  elog(ERROR, "Lost path");
253 
254  if (GinPageIsIncompleteSplit(page))
255  {
256  Assert(blkno != btree->rootBlkno);
257  ptr->blkno = blkno;
258  ptr->buffer = buffer;
259 
260  /*
261  * parent may be wrong, but if so, the ginFinishSplit call will
262  * recurse to call ginFindParents again to fix it.
263  */
264  ptr->parent = root;
265  ptr->off = InvalidOffsetNumber;
266 
267  ginFinishSplit(btree, ptr, false, NULL);
268  }
269 
270  leftmostBlkno = btree->getLeftMostChild(btree, page);
271 
272  while ((offset = btree->findChildPtr(btree, page, stack->blkno, InvalidOffsetNumber)) == InvalidOffsetNumber)
273  {
274  blkno = GinPageGetOpaque(page)->rightlink;
275  if (blkno == InvalidBlockNumber)
276  {
277  UnlockReleaseBuffer(buffer);
278  break;
279  }
280  buffer = ginStepRight(buffer, btree->index, GIN_EXCLUSIVE);
281  page = BufferGetPage(buffer);
282 
283  /* finish any incomplete splits, as above */
284  if (GinPageIsIncompleteSplit(page))
285  {
286  Assert(blkno != btree->rootBlkno);
287  ptr->blkno = blkno;
288  ptr->buffer = buffer;
289  ptr->parent = root;
290  ptr->off = InvalidOffsetNumber;
291 
292  ginFinishSplit(btree, ptr, false, NULL);
293  }
294  }
295 
296  if (blkno != InvalidBlockNumber)
297  {
298  ptr->blkno = blkno;
299  ptr->buffer = buffer;
300  ptr->parent = root; /* it may be wrong, but in next call we will
301  * correct */
302  ptr->off = offset;
303  stack->parent = ptr;
304  return;
305  }
306 
307  /* Descend down to next level */
308  blkno = leftmostBlkno;
309  buffer = ReadBuffer(btree->index, blkno);
310  }
311 }
312 
313 /*
314  * Insert a new item to a page.
315  *
316  * Returns true if the insertion was finished. On false, the page was split and
317  * the parent needs to be updated. (A root split returns true as it doesn't
318  * need any further action by the caller to complete.)
319  *
320  * When inserting a downlink to an internal page, 'childbuf' contains the
321  * child page that was split. Its GIN_INCOMPLETE_SPLIT flag will be cleared
322  * atomically with the insert. Also, the existing item at offset stack->off
323  * in the target page is updated to point to updateblkno.
324  *
325  * stack->buffer is locked on entry, and is kept locked.
326  * Likewise for childbuf, if given.
327  */
328 static bool
330  void *insertdata, BlockNumber updateblkno,
331  Buffer childbuf, GinStatsData *buildStats)
332 {
333  Page page = BufferGetPage(stack->buffer);
334  bool result;
335  GinPlaceToPageRC rc;
336  uint16 xlflags = 0;
337  Page childpage = NULL;
338  Page newlpage = NULL,
339  newrpage = NULL;
340  void *ptp_workspace = NULL;
341  MemoryContext tmpCxt;
342  MemoryContext oldCxt;
343 
344  /*
345  * We do all the work of this function and its subfunctions in a temporary
346  * memory context. This avoids leakages and simplifies APIs, since some
347  * subfunctions allocate storage that has to survive until we've finished
348  * the WAL insertion.
349  */
351  "ginPlaceToPage temporary context",
353  oldCxt = MemoryContextSwitchTo(tmpCxt);
354 
355  if (GinPageIsData(page))
356  xlflags |= GIN_INSERT_ISDATA;
357  if (GinPageIsLeaf(page))
358  {
359  xlflags |= GIN_INSERT_ISLEAF;
360  Assert(!BufferIsValid(childbuf));
361  Assert(updateblkno == InvalidBlockNumber);
362  }
363  else
364  {
365  Assert(BufferIsValid(childbuf));
366  Assert(updateblkno != InvalidBlockNumber);
367  childpage = BufferGetPage(childbuf);
368  }
369 
370  /*
371  * See if the incoming tuple will fit on the page. beginPlaceToPage will
372  * decide if the page needs to be split, and will compute the split
373  * contents if so. See comments for beginPlaceToPage and execPlaceToPage
374  * functions for more details of the API here.
375  */
376  rc = btree->beginPlaceToPage(btree, stack->buffer, stack,
377  insertdata, updateblkno,
378  &ptp_workspace,
379  &newlpage, &newrpage);
380 
381  if (rc == GPTP_NO_WORK)
382  {
383  /* Nothing to do */
384  result = true;
385  }
386  else if (rc == GPTP_INSERT)
387  {
388  /* It will fit, perform the insertion */
390 
391  if (RelationNeedsWAL(btree->index) && !btree->isBuild)
392  {
393  XLogBeginInsert();
395  if (BufferIsValid(childbuf))
396  XLogRegisterBuffer(1, childbuf, REGBUF_STANDARD);
397  }
398 
399  /* Perform the page update, and register any extra WAL data */
400  btree->execPlaceToPage(btree, stack->buffer, stack,
401  insertdata, updateblkno, ptp_workspace);
402 
403  MarkBufferDirty(stack->buffer);
404 
405  /* An insert to an internal page finishes the split of the child. */
406  if (BufferIsValid(childbuf))
407  {
408  GinPageGetOpaque(childpage)->flags &= ~GIN_INCOMPLETE_SPLIT;
409  MarkBufferDirty(childbuf);
410  }
411 
412  if (RelationNeedsWAL(btree->index) && !btree->isBuild)
413  {
414  XLogRecPtr recptr;
415  ginxlogInsert xlrec;
416  BlockIdData childblknos[2];
417 
418  xlrec.flags = xlflags;
419 
420  XLogRegisterData((char *) &xlrec, sizeof(ginxlogInsert));
421 
422  /*
423  * Log information about child if this was an insertion of a
424  * downlink.
425  */
426  if (BufferIsValid(childbuf))
427  {
428  BlockIdSet(&childblknos[0], BufferGetBlockNumber(childbuf));
429  BlockIdSet(&childblknos[1], GinPageGetOpaque(childpage)->rightlink);
430  XLogRegisterData((char *) childblknos,
431  sizeof(BlockIdData) * 2);
432  }
433 
434  recptr = XLogInsert(RM_GIN_ID, XLOG_GIN_INSERT);
435  PageSetLSN(page, recptr);
436  if (BufferIsValid(childbuf))
437  PageSetLSN(childpage, recptr);
438  }
439 
441 
442  /* Insertion is complete. */
443  result = true;
444  }
445  else if (rc == GPTP_SPLIT)
446  {
447  /*
448  * Didn't fit, need to split. The split has been computed in newlpage
449  * and newrpage, which are pointers to palloc'd pages, not associated
450  * with buffers. stack->buffer is not touched yet.
451  */
452  Buffer rbuffer;
453  BlockNumber savedRightLink;
454  ginxlogSplit data;
455  Buffer lbuffer = InvalidBuffer;
456  Page newrootpg = NULL;
457 
458  /* Get a new index page to become the right page */
459  rbuffer = GinNewBuffer(btree->index);
460 
461  /* During index build, count the new page */
462  if (buildStats)
463  {
464  if (btree->isData)
465  buildStats->nDataPages++;
466  else
467  buildStats->nEntryPages++;
468  }
469 
470  savedRightLink = GinPageGetOpaque(page)->rightlink;
471 
472  /* Begin setting up WAL record */
473  data.node = btree->index->rd_node;
474  data.flags = xlflags;
475  if (BufferIsValid(childbuf))
476  {
477  data.leftChildBlkno = BufferGetBlockNumber(childbuf);
478  data.rightChildBlkno = GinPageGetOpaque(childpage)->rightlink;
479  }
480  else
482 
483  if (stack->parent == NULL)
484  {
485  /*
486  * splitting the root, so we need to allocate new left page and
487  * place pointers to left and right page on root page.
488  */
489  lbuffer = GinNewBuffer(btree->index);
490 
491  /* During index build, count the new left page */
492  if (buildStats)
493  {
494  if (btree->isData)
495  buildStats->nDataPages++;
496  else
497  buildStats->nEntryPages++;
498  }
499 
500  data.rrlink = InvalidBlockNumber;
501  data.flags |= GIN_SPLIT_ROOT;
502 
503  GinPageGetOpaque(newrpage)->rightlink = InvalidBlockNumber;
504  GinPageGetOpaque(newlpage)->rightlink = BufferGetBlockNumber(rbuffer);
505 
506  /*
507  * Construct a new root page containing downlinks to the new left
508  * and right pages. (Do this in a temporary copy rather than
509  * overwriting the original page directly, since we're not in the
510  * critical section yet.)
511  */
512  newrootpg = PageGetTempPage(newrpage);
513  GinInitPage(newrootpg, GinPageGetOpaque(newlpage)->flags & ~(GIN_LEAF | GIN_COMPRESSED), BLCKSZ);
514 
515  btree->fillRoot(btree, newrootpg,
516  BufferGetBlockNumber(lbuffer), newlpage,
517  BufferGetBlockNumber(rbuffer), newrpage);
518 
519  if (GinPageIsLeaf(BufferGetPage(stack->buffer)))
520  {
521 
524  BufferGetBlockNumber(lbuffer));
525 
528  BufferGetBlockNumber(rbuffer));
529  }
530 
531  }
532  else
533  {
534  /* splitting a non-root page */
535  data.rrlink = savedRightLink;
536 
537  GinPageGetOpaque(newrpage)->rightlink = savedRightLink;
538  GinPageGetOpaque(newlpage)->flags |= GIN_INCOMPLETE_SPLIT;
539  GinPageGetOpaque(newlpage)->rightlink = BufferGetBlockNumber(rbuffer);
540 
541  if (GinPageIsLeaf(BufferGetPage(stack->buffer)))
542  {
543 
546  BufferGetBlockNumber(rbuffer));
547  }
548  }
549 
550  /*
551  * OK, we have the new contents of the left page in a temporary copy
552  * now (newlpage), and likewise for the new contents of the
553  * newly-allocated right block. The original page is still unchanged.
554  *
555  * If this is a root split, we also have a temporary page containing
556  * the new contents of the root.
557  */
558 
560 
561  MarkBufferDirty(rbuffer);
562  MarkBufferDirty(stack->buffer);
563 
564  /*
565  * Restore the temporary copies over the real buffers.
566  */
567  if (stack->parent == NULL)
568  {
569  /* Splitting the root, three pages to update */
570  MarkBufferDirty(lbuffer);
571  memcpy(page, newrootpg, BLCKSZ);
572  memcpy(BufferGetPage(lbuffer), newlpage, BLCKSZ);
573  memcpy(BufferGetPage(rbuffer), newrpage, BLCKSZ);
574  }
575  else
576  {
577  /* Normal split, only two pages to update */
578  memcpy(page, newlpage, BLCKSZ);
579  memcpy(BufferGetPage(rbuffer), newrpage, BLCKSZ);
580  }
581 
582  /* We also clear childbuf's INCOMPLETE_SPLIT flag, if passed */
583  if (BufferIsValid(childbuf))
584  {
585  GinPageGetOpaque(childpage)->flags &= ~GIN_INCOMPLETE_SPLIT;
586  MarkBufferDirty(childbuf);
587  }
588 
589  /* write WAL record */
590  if (RelationNeedsWAL(btree->index) && !btree->isBuild)
591  {
592  XLogRecPtr recptr;
593 
594  XLogBeginInsert();
595 
596  /*
597  * We just take full page images of all the split pages. Splits
598  * are uncommon enough that it's not worth complicating the code
599  * to be more efficient.
600  */
601  if (stack->parent == NULL)
602  {
606  }
607  else
608  {
611  }
612  if (BufferIsValid(childbuf))
613  XLogRegisterBuffer(3, childbuf, REGBUF_STANDARD);
614 
615  XLogRegisterData((char *) &data, sizeof(ginxlogSplit));
616 
617  recptr = XLogInsert(RM_GIN_ID, XLOG_GIN_SPLIT);
618 
619  PageSetLSN(page, recptr);
620  PageSetLSN(BufferGetPage(rbuffer), recptr);
621  if (stack->parent == NULL)
622  PageSetLSN(BufferGetPage(lbuffer), recptr);
623  if (BufferIsValid(childbuf))
624  PageSetLSN(childpage, recptr);
625  }
627 
628  /*
629  * We can release the locks/pins on the new pages now, but keep
630  * stack->buffer locked. childbuf doesn't get unlocked either.
631  */
632  UnlockReleaseBuffer(rbuffer);
633  if (stack->parent == NULL)
634  UnlockReleaseBuffer(lbuffer);
635 
636  /*
637  * If we split the root, we're done. Otherwise the split is not
638  * complete until the downlink for the new page has been inserted to
639  * the parent.
640  */
641  result = (stack->parent == NULL);
642  }
643  else
644  {
645  elog(ERROR, "invalid return code from GIN beginPlaceToPage method: %d", rc);
646  result = false; /* keep compiler quiet */
647  }
648 
649  /* Clean up temp context */
650  MemoryContextSwitchTo(oldCxt);
651  MemoryContextDelete(tmpCxt);
652 
653  return result;
654 }
655 
656 /*
657  * Finish a split by inserting the downlink for the new page to parent.
658  *
659  * On entry, stack->buffer is exclusively locked.
660  *
661  * If freestack is true, all the buffers are released and unlocked as we
662  * crawl up the tree, and 'stack' is freed. Otherwise stack->buffer is kept
663  * locked, and stack is unmodified, except for possibly moving right to find
664  * the correct parent of page.
665  */
666 static void
667 ginFinishSplit(GinBtree btree, GinBtreeStack *stack, bool freestack,
668  GinStatsData *buildStats)
669 {
670  Page page;
671  bool done;
672  bool first = true;
673 
674  /*
675  * freestack == false when we encounter an incompletely split page during
676  * a scan, while freestack == true is used in the normal scenario that a
677  * split is finished right after the initial insert.
678  */
679  if (!freestack)
680  elog(DEBUG1, "finishing incomplete split of block %u in gin index \"%s\"",
681  stack->blkno, RelationGetRelationName(btree->index));
682 
683  /* this loop crawls up the stack until the insertion is complete */
684  do
685  {
686  GinBtreeStack *parent = stack->parent;
687  void *insertdata;
688  BlockNumber updateblkno;
689 
690  /* search parent to lock */
691  LockBuffer(parent->buffer, GIN_EXCLUSIVE);
692 
693  /*
694  * If the parent page was incompletely split, finish that split first,
695  * then continue with the current one.
696  *
697  * Note: we have to finish *all* incomplete splits we encounter, even
698  * if we have to move right. Otherwise we might choose as the target a
699  * page that has no downlink in the parent, and splitting it further
700  * would fail.
701  */
703  ginFinishSplit(btree, parent, false, buildStats);
704 
705  /* move right if it's needed */
706  page = BufferGetPage(parent->buffer);
707  while ((parent->off = btree->findChildPtr(btree, page, stack->blkno, parent->off)) == InvalidOffsetNumber)
708  {
709  if (GinPageRightMost(page))
710  {
711  /*
712  * rightmost page, but we don't find parent, we should use
713  * plain search...
714  */
715  LockBuffer(parent->buffer, GIN_UNLOCK);
716  ginFindParents(btree, stack);
717  parent = stack->parent;
718  Assert(parent != NULL);
719  break;
720  }
721 
722  parent->buffer = ginStepRight(parent->buffer, btree->index, GIN_EXCLUSIVE);
723  parent->blkno = BufferGetBlockNumber(parent->buffer);
724  page = BufferGetPage(parent->buffer);
725 
727  ginFinishSplit(btree, parent, false, buildStats);
728  }
729 
730  /* insert the downlink */
731  insertdata = btree->prepareDownlink(btree, stack->buffer);
732  updateblkno = GinPageGetOpaque(BufferGetPage(stack->buffer))->rightlink;
733  done = ginPlaceToPage(btree, parent,
734  insertdata, updateblkno,
735  stack->buffer, buildStats);
736  pfree(insertdata);
737 
738  /*
739  * If the caller requested to free the stack, unlock and release the
740  * child buffer now. Otherwise keep it pinned and locked, but if we
741  * have to recurse up the tree, we can unlock the upper pages, only
742  * keeping the page at the bottom of the stack locked.
743  */
744  if (!first || freestack)
745  LockBuffer(stack->buffer, GIN_UNLOCK);
746  if (freestack)
747  {
748  ReleaseBuffer(stack->buffer);
749  pfree(stack);
750  }
751  stack = parent;
752 
753  first = false;
754  } while (!done);
755 
756  /* unlock the parent */
757  LockBuffer(stack->buffer, GIN_UNLOCK);
758 
759  if (freestack)
760  freeGinBtreeStack(stack);
761 }
762 
763 /*
764  * Insert a value to tree described by stack.
765  *
766  * The value to be inserted is given in 'insertdata'. Its format depends
767  * on whether this is an entry or data tree, ginInsertValue just passes it
768  * through to the tree-specific callback function.
769  *
770  * During an index build, buildStats is non-null and the counters it contains
771  * are incremented as needed.
772  *
773  * NB: the passed-in stack is freed, as though by freeGinBtreeStack.
774  */
775 void
776 ginInsertValue(GinBtree btree, GinBtreeStack *stack, void *insertdata,
777  GinStatsData *buildStats)
778 {
779  bool done;
780 
781  /* If the leaf page was incompletely split, finish the split first */
783  ginFinishSplit(btree, stack, false, buildStats);
784 
785  done = ginPlaceToPage(btree, stack,
786  insertdata, InvalidBlockNumber,
787  InvalidBuffer, buildStats);
788  if (done)
789  {
790  LockBuffer(stack->buffer, GIN_UNLOCK);
791  freeGinBtreeStack(stack);
792  }
793  else
794  ginFinishSplit(btree, stack, true, buildStats);
795 }
#define GIN_UNLOCK
Definition: gin_private.h:48
BlockNumber nEntryPages
Definition: gin.h:46
Buffer GinNewBuffer(Relation index)
Definition: ginutil.c:298
static void ginFindParents(GinBtree btree, GinBtreeStack *stack)
Definition: ginbtree.c:214
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:212
#define AllocSetContextCreate
Definition: memutils.h:170
static void TestForOldSnapshot(Snapshot snapshot, Relation relation, Page page)
Definition: bufmgr.h:277
#define DEBUG1
Definition: elog.h:25
void(* fillRoot)(GinBtree, Page, BlockNumber, Page, BlockNumber, Page)
Definition: gin_private.h:161
void GinInitPage(Page page, uint32 f, Size pageSize)
Definition: ginutil.c:344
OffsetNumber off
Definition: gin_private.h:131
#define GinPageIsIncompleteSplit(page)
Definition: ginblock.h:128
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1469
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:220
bool(* isMoveRight)(GinBtree, Page)
Definition: gin_private.h:153
GinBtreeStack * ginFindLeafPage(GinBtree btree, bool searchMode, bool rootConflictCheck, Snapshot snapshot)
Definition: ginbtree.c:80
#define END_CRIT_SECTION()
Definition: miscadmin.h:134
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static void ginFinishSplit(GinBtree btree, GinBtreeStack *stack, bool freestack, GinStatsData *buildStats)
Definition: ginbtree.c:667
BlockNumber rightChildBlkno
Definition: ginxlog.h:117
#define InvalidBuffer
Definition: buf.h:25
#define START_CRIT_SECTION()
Definition: miscadmin.h:132
BlockNumber rootBlkno
Definition: gin_private.h:166
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3511
#define GinPageGetOpaque(page)
Definition: ginblock.h:111
#define GIN_SPLIT_ROOT
Definition: ginxlog.h:126
#define GIN_INSERT_ISLEAF
Definition: ginxlog.h:125
#define GIN_COMPRESSED
Definition: ginblock.h:49
uint16 flags
Definition: ginxlog.h:39
uint16 OffsetNumber
Definition: off.h:24
Definition: type.h:89
unsigned short uint16
Definition: c.h:373
void pfree(void *pointer)
Definition: mcxt.c:1057
GinPlaceToPageRC
Definition: gin_private.h:141
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3534
#define ERROR
Definition: elog.h:43
GinPlaceToPageRC(* beginPlaceToPage)(GinBtree, Buffer, GinBtreeStack *, void *, BlockNumber, void **, Page *, Page *)
Definition: gin_private.h:158
#define GinPageRightMost(page)
Definition: ginblock.h:130
void(* execPlaceToPage)(GinBtree, Buffer, GinBtreeStack *, void *, BlockNumber, void *)
Definition: gin_private.h:159
BlockNumber(* findChildPage)(GinBtree, GinBtreeStack *)
Definition: gin_private.h:151
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:192
#define GIN_INSERT_ISDATA
Definition: ginxlog.h:124
RelFileNode node
Definition: ginxlog.h:113
#define REGBUF_STANDARD
Definition: xloginsert.h:35
BlockNumber(* getLeftMostChild)(GinBtree, Page)
Definition: gin_private.h:152
Buffer ginStepRight(Buffer buffer, Relation index, int lockmode)
Definition: ginbtree.c:173
#define RelationGetRelationName(relation)
Definition: rel.h:490
MemoryContext CurrentMemoryContext
Definition: mcxt.c:38
#define GinPageIsLeaf(page)
Definition: ginblock.h:113
#define BufferGetPage(buffer)
Definition: bufmgr.h:169
#define GIN_SHARE
Definition: gin_private.h:49
#define REGBUF_FORCE_IMAGE
Definition: xloginsert.h:31
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:330
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:422
Page PageGetTempPage(Page page)
Definition: bufpage.c:344
struct GinBtreeStack * parent
Definition: gin_private.h:135
#define GIN_EXCLUSIVE
Definition: gin_private.h:50
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3750
void ginInsertValue(GinBtree btree, GinBtreeStack *stack, void *insertdata, GinStatsData *buildStats)
Definition: ginbtree.c:776
Relation index
Definition: gin_private.h:165
void CheckForSerializableConflictIn(Relation relation, ItemPointer tid, BlockNumber blkno)
Definition: predicate.c:4375
#define InvalidOffsetNumber
Definition: off.h:26
BlockNumber nDataPages
Definition: gin.h:47
BlockNumber leftChildBlkno
Definition: ginxlog.h:116
#define GinPageIsData(page)
Definition: ginblock.h:116
RelFileNode rd_node
Definition: rel.h:55
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:745
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:607
#define InvalidBlockNumber
Definition: block.h:33
Buffer ReleaseAndReadBuffer(Buffer buffer, Relation relation, BlockNumber blockNum)
Definition: bufmgr.c:1532
#define BufferIsValid(bufnum)
Definition: bufmgr.h:123
BlockNumber blkno
Definition: gin_private.h:129
#define RelationNeedsWAL(relation)
Definition: rel.h:562
#define BlockIdSet(blockId, blockNumber)
Definition: block.h:84
BlockNumber rrlink
Definition: ginxlog.h:114
uint32 predictNumber
Definition: gin_private.h:134
#define GIN_INCOMPLETE_SPLIT
Definition: ginblock.h:47
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2661
#define XLOG_GIN_INSERT
Definition: ginxlog.h:35
void *(* prepareDownlink)(GinBtree, Buffer)
Definition: gin_private.h:160
void * palloc(Size size)
Definition: mcxt.c:950
void freeGinBtreeStack(GinBtreeStack *stack)
Definition: ginbtree.c:194
#define elog(elevel,...)
Definition: elog.h:214
OffsetNumber(* findChildPtr)(GinBtree, Page, BlockNumber, OffsetNumber)
Definition: gin_private.h:157
void XLogBeginInsert(void)
Definition: xloginsert.c:123
static bool ginPlaceToPage(GinBtree btree, GinBtreeStack *stack, void *insertdata, BlockNumber updateblkno, Buffer childbuf, GinStatsData *buildStats)
Definition: ginbtree.c:329
#define PageSetLSN(page, lsn)
Definition: bufpage.h:368
int Buffer
Definition: buf.h:23
uint16 flags
Definition: ginxlog.h:118
void PredicateLockPageSplit(Relation relation, BlockNumber oldblkno, BlockNumber newblkno)
Definition: predicate.c:3096
#define XLOG_GIN_SPLIT
Definition: ginxlog.h:109
Pointer Page
Definition: bufpage.h:78
int ginTraverseLock(Buffer buffer, bool searchMode)
Definition: ginbtree.c:36
#define GIN_LEAF
Definition: ginblock.h:42