#define ROTATEDIST(d) do { \
- SplitedPageLayout *tmp=(SplitedPageLayout*)palloc0(sizeof(SplitedPageLayout)); \
+ SplitPageLayout *tmp=(SplitPageLayout*)palloc0(sizeof(SplitPageLayout)); \
tmp->block.blkno = InvalidBlockNumber; \
tmp->buffer = InvalidBuffer; \
tmp->next = (d); \
/* no space for insertion */
IndexTuple *itvec;
int tlen;
- SplitedPageLayout *dist = NULL,
+ SplitPageLayout *dist = NULL,
*ptr;
BlockNumber oldrlink = InvalidBlockNumber;
GistNSN oldnsn = 0;
- SplitedPageLayout rootpg;
+ SplitPageLayout rootpg;
bool is_rootsplit;
int npage;
{
/*
* End of chain and still didn't find parent. It's a very-very
- * rare situation when root splitted.
+ * rare situation when the root was split.
*/
break;
}
* used for XLOG and real writes buffers. Function is recursive, ie
* it will split page until keys will fit in every page.
*/
-SplitedPageLayout *
+SplitPageLayout *
gistSplit(Relation r,
Page page,
IndexTuple *itup, /* contains compressed entry */
*rvectup;
GistSplitVector v;
int i;
- SplitedPageLayout *res = NULL;
+ SplitPageLayout *res = NULL;
/* this should never recurse very deeply, but better safe than sorry */
check_stack_depth();
if (!gistfitpage(lvectup, v.splitVector.spl_nleft))
{
- SplitedPageLayout *resptr,
+ SplitPageLayout *resptr,
*subres;
resptr = subres = gistSplit(r, page, lvectup, v.splitVector.spl_nleft, giststate);
BlockNumber blkno;
MemoryContext oldCtx;
IndexTuple union_tuple;
- SplitedPageLayout *dist;
+ SplitPageLayout *dist;
IndexTuple *itvec;
int vect_len;
bool isleaf = GistPageIsLeaf(levelstate->pages[0]);
}
else
{
- /* Create splitted layout from single page */
- dist = (SplitedPageLayout *) palloc0(sizeof(SplitedPageLayout));
+ /* Create split layout from single page */
+ dist = (SplitPageLayout *) palloc0(sizeof(SplitPageLayout));
union_tuple = gistunion(state->indexrel, itvec, vect_len,
state->giststate);
dist->itup = union_tuple;
* not arbitrary that the new buffer is put to the beginning of the
* list: in the final emptying phase we loop through all buffers at
* each level, and flush them. If a page is split during the emptying,
- * it's more efficient to flush the new splitted pages first, before
+ * it's more efficient to flush the new split pages first, before
* moving on to pre-existing pages on the level. The buffers just
* created during the page split are likely still in cache, so
* flushing them immediately is more efficient than putting them to
/*
* Data structure representing information about node buffer for index tuples
- * relocation from splitted node buffer.
+ * relocation from split node buffer.
*/
typedef struct
{
GISTNodeBuffer oldBuf;
ListCell *lc;
- /* If the splitted page doesn't have buffers, we have nothing to do. */
+ /* If the split page doesn't have buffers, we have nothing to do. */
if (!LEVEL_HAS_BUFFERS(level, gfbb))
return;
/*
- * Get the node buffer of the splitted page.
+ * Get the node buffer of the split page.
*/
blocknum = BufferGetBlockNumber(buffer);
nodeBuffer = hash_search(gfbb->nodeBuffersTab, &blocknum,
*/
XLogRecPtr
gistXLogSplit(bool page_is_leaf,
- SplitedPageLayout *dist,
+ SplitPageLayout *dist,
BlockNumber origrlink, GistNSN orignsn,
Buffer leftchildbuf, bool markfollowright)
{
gistxlogPageSplit xlrec;
- SplitedPageLayout *ptr;
+ SplitPageLayout *ptr;
int npage = 0;
XLogRecPtr recptr;
int i;
int num; /* number of index tuples following */
} gistxlogPage;
-/* SplitedPageLayout - gistSplit function result */
-typedef struct SplitedPageLayout
+/* SplitPageLayout - gistSplit function result */
+typedef struct SplitPageLayout
{
gistxlogPage block;
IndexTupleData *list;
Page page; /* to operate */
Buffer buffer; /* to write after all proceed */
- struct SplitedPageLayout *next;
-} SplitedPageLayout;
+ struct SplitPageLayout *next;
+} SplitPageLayout;
/*
* GISTInsertStack used for locking buffers and transfer arguments during
Relation heapRel,
bool is_build);
-extern SplitedPageLayout *gistSplit(Relation r, Page page, IndexTuple *itup,
- int len, GISTSTATE *giststate);
+extern SplitPageLayout *gistSplit(Relation r, Page page, IndexTuple *itup,
+ int len, GISTSTATE *giststate);
/* gistxlog.c */
extern XLogRecPtr gistXLogPageDelete(Buffer buffer,
Relation heaprel);
extern XLogRecPtr gistXLogSplit(bool page_is_leaf,
- SplitedPageLayout *dist,
+ SplitPageLayout *dist,
BlockNumber origrlink, GistNSN orignsn,
Buffer leftchildbuf, bool markfollowright);
{
BlockNumber origrlink; /* rightlink of the page before split */
GistNSN orignsn; /* NSN of the page before split */
- bool origleaf; /* was splitted page a leaf page? */
+ bool origleaf; /* was split page a leaf page? */
uint16 npage; /* # of pages in the split */
bool markfollowright; /* set F_FOLLOW_RIGHT flags */
SpinDelayStatus
SplitInterval
SplitLR
+SplitPageLayout
SplitPoint
SplitTextOutputData
SplitVar
-SplitedPageLayout
StackElem
StartDataPtrType
StartLOPtrType