Lines Matching defs:area
13218 int aTempReg[8]; /* Holding area for temporary registers */
30869 ** Open a shared-memory area associated with open database file pDbFd.
34675 void *pMapRegion; /* Area memory mapped */
37988 ** Open the shared-memory area associated with database file pDbFd.
40934 ** function is 0, then the data area associated with page 1 is zeroed, but
52297 ** same area of shared memory on a different CPU in a SMP,
53628 ** cell pointer array, and the cell content area. Page 1 also has a 100-byte
53644 ** | area | | and free space fragments.
53653 ** 5 2 first byte of the cell content area
53661 ** the payload area.
53666 ** content area. The cell pointers occur in sorted order. The system strives
53673 ** Unused space within the cell content area is collected into a linked list of
53677 ** any group of 3 or fewer unused bytes in the cell content area cannot
53686 ** Cells are of variable length. Cells are stored in the cell content area at
53818 u8 *aCellIdx; /* The cell index area */
54560 ** This routine is used to extract the "offset to cell content area" value
55715 ** data area of the btree-page. The return number includes the cell
55825 ** pointer array and the cell content area.
55839 int cbrk; /* Offset to the cell content area */
55842 unsigned char *temp; /* Temp area for cell content */
55981 ** the first two bytes past the cell pointer area since presumably this
55988 int top; /* First byte of cell content area */
56050 ** and the cell content area. The btreeInitPage() call has already
56146 /* The new freeblock is at the beginning of the cell content area,
56147 ** so just extend the cell content area rather than create another
56252 int top; /* First byte of the cell content area */
56272 ** the start of the cell content area. A zero value for this integer is
56285 ** offset to the cell content area will equal the page size minus the
56347 ** of the cell-content area plus the number of free bytes within
56348 ** the cell-content area. If this is greater than the usable-size
56351 ** area, according to the page header, lies within the page.
56976 ** beginning of pTmpSpace as an area available to prepend the
60538 ** area. pCell might point to some temporary storage. The cell will
60539 ** be constructed in this temporary area then copied into pPage->aData
60565 ** buffer space that is separate from the pPage buffer area */
60673 /* If pToRelease is not zero than pPrior points into the data area
60677 /* If pPrior is part of the data area of pPage, then make sure pPage
60693 /* If pToRelease is not zero than pPayload points into the data area
60697 /* If pPayload is part of the data area of pPage, then make sure pPage
60990 ** content area on page pPg. If the size of the content area is extended,
60991 ** *ppData is updated to point to the new start of the content area
60995 ** end of the space required by this page for the cell-pointer area (for
60997 ** area must be extended to before this point in order to accomodate all
61003 u8 **ppData, /* IN/OUT: Page content -area pointer */
61004 u8 *pCellptr, /* Pointer to cell-pointer area */
63550 u32 contentOffset; /* Offset to the start of the cell content area */
63757 ** number of fragmented free bytes within the cell content area.
155824 RtreeDValue area = (RtreeDValue)1;
155827 area = (area * (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii])));
155829 return area;
155864 ** Return true if the area covered by p2 is a subset of the area covered
155886 RtreeDValue area;
155889 area = cellArea(pRtree, &cell);
155891 return (cellArea(pRtree, &cell)-area);
155952 ** the smallest area.
155957 RtreeDValue area;
155960 area = cellArea(pRtree, &cell);
155961 if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){
155966 fMinArea = area;
156228 RtreeDValue area;
156242 area = cellArea(pRtree, &left) + cellArea(pRtree, &right);
156245 || (overlap==fBestOverlap && area<fBestArea)
156249 fBestArea = area;
172082 ** Offset of last rowid written to data area. Relative to first byte of
