*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtinsert.c,v 1.93 2002/06/20 20:29:25 momjian Exp $
+ * $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtinsert.c,v 1.94 2002/07/02 05:48:44 momjian Exp $
*
*-------------------------------------------------------------------------
*/
* to 1/3 the per-page available space. Note that at this point,
* itemsz doesn't include the ItemId.
*/
- if (itemsz > (PageGetPageSize(page) - sizeof(PageHeaderData) - MAXALIGN(sizeof(BTPageOpaqueData))) / 3 - sizeof(ItemIdData))
+ if (itemsz > BTMaxItemSize(page))
elog(ERROR, "btree: index item size %lu exceeds maximum %lu",
- (unsigned long) itemsz,
- (PageGetPageSize(page) - sizeof(PageHeaderData) - MAXALIGN(sizeof(BTPageOpaqueData))) / 3 - sizeof(ItemIdData));
+ (unsigned long) itemsz, BTMaxItemSize(page));
/*
* Determine exactly where new item will go.
/* Total free space available on a btree page, after fixed overhead */
leftspace = rightspace =
- PageGetPageSize(page) - sizeof(PageHeaderData) -
- MAXALIGN(sizeof(BTPageOpaqueData))
- +sizeof(ItemIdData);
+ PageGetPageSize(page) - SizeOfPageHeaderData -
+ MAXALIGN(sizeof(BTPageOpaqueData));
/*
* Finding the best possible split would require checking all the
*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/storage/page/bufpage.c,v 1.45 2002/06/20 20:29:35 momjian Exp $
+ * $Header: /cvsroot/pgsql/src/backend/storage/page/bufpage.c,v 1.46 2002/07/02 05:48:44 momjian Exp $
*
*-------------------------------------------------------------------------
*/
specialSize = MAXALIGN(specialSize);
Assert(pageSize == BLCKSZ);
- Assert(pageSize >
- specialSize + sizeof(PageHeaderData) - sizeof(ItemIdData));
+ Assert(pageSize > specialSize + SizeOfPageHeaderData);
/* Make sure all fields of page are zero, as well as unused space */
MemSet(p, 0, pageSize);
- p->pd_lower = sizeof(PageHeaderData) - sizeof(ItemIdData);
+ p->pd_lower = SizeOfPageHeaderData;
p->pd_upper = pageSize - specialSize;
p->pd_special = pageSize - specialSize;
PageSetPageSize(page, pageSize);
/*
* Be wary about corrupted page pointers
*/
- if (phdr->pd_lower < (sizeof(PageHeaderData) - sizeof(ItemIdData)) ||
+ if (phdr->pd_lower < SizeOfPageHeaderData ||
phdr->pd_lower > phdr->pd_upper ||
phdr->pd_upper > phdr->pd_special ||
phdr->pd_special > BLCKSZ)
}
if (offsetNumber < limit)
{
- itemId = &phdr->pd_linp[offsetNumber - 1];
+ itemId = PageGetItemId(phdr, offsetNumber);
if (((*itemId).lp_flags & LP_USED) ||
((*itemId).lp_len != 0))
{
/* look for "recyclable" (unused & deallocated) ItemId */
for (offsetNumber = 1; offsetNumber < limit; offsetNumber++)
{
- itemId = &phdr->pd_linp[offsetNumber - 1];
+ itemId = PageGetItemId(phdr, offsetNumber);
if ((((*itemId).lp_flags & LP_USED) == 0) &&
((*itemId).lp_len == 0))
break;
* alignedSize > pd_upper.
*/
if (offsetNumber > limit)
- lower = (char *) (&phdr->pd_linp[offsetNumber]) - (char *) page;
+ lower = (char *) PageGetItemId(phdr, offsetNumber + 1) - (char *) page;
else if (offsetNumber == limit || needshuffle)
lower = phdr->pd_lower + sizeof(ItemIdData);
else
ItemId fromitemId,
toitemId;
- fromitemId = &phdr->pd_linp[i - 1];
- toitemId = &phdr->pd_linp[i];
+ fromitemId = PageGetItemId(phdr, i);
+ toitemId = PageGetItemId(phdr, i + 1);
*toitemId = *fromitemId;
}
}
- itemId = &phdr->pd_linp[offsetNumber - 1];
+ itemId = PageGetItemId(phdr, offsetNumber);
(*itemId).lp_off = upper;
(*itemId).lp_len = size;
(*itemId).lp_flags = flags;
memcpy(temp, page, pageSize);
/* clear out the middle */
- size = (pageSize - sizeof(PageHeaderData)) + sizeof(ItemIdData);
+ size = pageSize - SizeOfPageHeaderData;
size -= MAXALIGN(specialSize);
- MemSet((char *) &(thdr->pd_linp[0]), 0, size);
+ MemSet(PageGetContents(thdr), 0, size);
/* set high, low water marks */
- thdr->pd_lower = sizeof(PageHeaderData) - sizeof(ItemIdData);
+ thdr->pd_lower = SizeOfPageHeaderData;
thdr->pd_upper = pageSize - MAXALIGN(specialSize);
return temp;
* pointers, lengths, etc could cause us to clobber adjacent disk
* buffers, spreading the data loss further. So, check everything.
*/
- if (pd_lower < (sizeof(PageHeaderData) - sizeof(ItemIdData)) ||
+ if (pd_lower < SizeOfPageHeaderData ||
pd_lower > pd_upper ||
pd_upper > pd_special ||
pd_special > BLCKSZ ||
nused = 0;
for (i = 0; i < nline; i++)
{
- lp = ((PageHeader) page)->pd_linp + i;
+ lp = PageGetItemId(page, i + 1);
if ((*lp).lp_flags & LP_DELETE) /* marked for deletion */
(*lp).lp_flags &= ~(LP_USED | LP_DELETE);
if ((*lp).lp_flags & LP_USED)
/* Page is completely empty, so just reset it quickly */
for (i = 0; i < nline; i++)
{
- lp = ((PageHeader) page)->pd_linp + i;
+ lp = PageGetItemId(page, i + 1);
(*lp).lp_len = 0; /* indicate unused & deallocated */
}
((PageHeader) page)->pd_upper = pd_special;
totallen = 0;
for (i = 0; i < nline; i++)
{
- lp = ((PageHeader) page)->pd_linp + i;
+ lp = PageGetItemId(page, i + 1);
if ((*lp).lp_flags & LP_USED)
{
itemidptr->offsetindex = i;
for (i = 0, itemidptr = itemidbase; i < nused; i++, itemidptr++)
{
- lp = ((PageHeader) page)->pd_linp + itemidptr->offsetindex;
+ lp = PageGetItemId(page, itemidptr->offsetindex + 1);
upper -= itemidptr->alignedlen;
memmove((char *) page + upper,
(char *) page + itemidptr->itemoff,
/*
* As with PageRepairFragmentation, paranoia seems justified.
*/
- if (phdr->pd_lower < (sizeof(PageHeaderData) - sizeof(ItemIdData)) ||
+ if (phdr->pd_lower < SizeOfPageHeaderData ||
phdr->pd_lower > phdr->pd_upper ||
phdr->pd_upper > phdr->pd_special ||
phdr->pd_special > BLCKSZ)
/*
* First, we want to get rid of the pd_linp entry for the index tuple.
* We copy all subsequent linp's back one slot in the array.
+ * We don't use PageGetItemId, because we are manipulating the _array_,
+ * not individual linp's.
*/
nbytes = phdr->pd_lower -
((char *) &phdr->pd_linp[offidx + 1] - (char *) phdr);
nline--; /* there's one less than when we started */
for (i = nline; --i >= 0; )
{
- if (phdr->pd_linp[i].lp_off <= offset)
- phdr->pd_linp[i].lp_off += size;
+ if (PageGetItemId(phdr, i + 1)->lp_off <= offset)
+ PageGetItemId(phdr, i + 1)->lp_off += size;
}
}
}
* Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
- * $Id: bufpage.h,v 1.48 2002/06/20 20:29:52 momjian Exp $
+ * $Id: bufpage.h,v 1.49 2002/07/02 05:48:44 momjian Exp $
*
*-------------------------------------------------------------------------
*/
((bool) (((PageHeader) (page))->pd_lower != 0)) \
)
+/*
+ * line pointer does not count as part of header
+ */
+#define SizeOfPageHeaderData (offsetof(PageHeaderData, pd_linp[0]))
+
/*
* PageIsEmpty
* returns true iff no itemid has been allocated on the page
*/
#define PageIsEmpty(page) \
- (((PageHeader) (page))->pd_lower <= \
- (sizeof(PageHeaderData) - sizeof(ItemIdData)))
+ (((PageHeader) (page))->pd_lower <= SizeOfPageHeaderData)
/*
* PageIsNew
#define PageGetItemId(page, offsetNumber) \
((ItemId) (&((PageHeader) (page))->pd_linp[(offsetNumber) - 1]))
+/*
+ * PageGetContents
+ * To be used in case the page does not contain item pointers.
+ */
+#define PageGetContents(page) \
+ ((char *) (&((PageHeader) (page))->pd_linp[0]))
+
/* ----------------
* macros to access opaque space
* ----------------
* That way we get -1 or so, not a huge positive number...
*/
#define PageGetMaxOffsetNumber(page) \
- (((int) (((PageHeader) (page))->pd_lower - \
- (sizeof(PageHeaderData) - sizeof(ItemIdData)))) \
+ (((int) (((PageHeader) (page))->pd_lower - SizeOfPageHeaderData)) \
/ ((int) sizeof(ItemIdData)))
#define PageGetLSN(page) \