Lines Matching defs:area
13218 int aTempReg[8]; /* Holding area for temporary registers */
30851 ** Open a shared-memory area associated with open database file pDbFd.
34657 void *pMapRegion; /* Area memory mapped */
37970 ** Open the shared-memory area associated with database file pDbFd.
40916 ** function is 0, then the data area associated with page 1 is zeroed, but
52279 ** same area of shared memory on a different CPU in a SMP,
53610 ** cell pointer array, and the cell content area. Page 1 also has a 100-byte
53626 ** | area | | and free space fragments.
53635 ** 5 2 first byte of the cell content area
53643 ** the payload area.
53648 ** content area. The cell pointers occur in sorted order. The system strives
53655 ** Unused space within the cell content area is collected into a linked list of
53659 ** any group of 3 or fewer unused bytes in the cell content area cannot
53668 ** Cells are of variable length. Cells are stored in the cell content area at
53800 u8 *aCellIdx; /* The cell index area */
54542 ** This routine is used to extract the "offset to cell content area" value
55697 ** data area of the btree-page. The return number includes the cell
55807 ** pointer array and the cell content area.
55821 int cbrk; /* Offset to the cell content area */
55824 unsigned char *temp; /* Temp area for cell content */
55963 ** the first two bytes past the cell pointer area since presumably this
55970 int top; /* First byte of cell content area */
56032 ** and the cell content area. The btreeInitPage() call has already
56128 /* The new freeblock is at the beginning of the cell content area,
56129 ** so just extend the cell content area rather than create another
56234 int top; /* First byte of the cell content area */
56254 ** the start of the cell content area. A zero value for this integer is
56267 ** offset to the cell content area will equal the page size minus the
56329 ** of the cell-content area plus the number of free bytes within
56330 ** the cell-content area. If this is greater than the usable-size
56333 ** area, according to the page header, lies within the page.
56958 ** beginning of pTmpSpace as an area available to prepend the
60520 ** area. pCell might point to some temporary storage. The cell will
60521 ** be constructed in this temporary area then copied into pPage->aData
60547 ** buffer space that is separate from the pPage buffer area */
60655 /* If pToRelease is not zero than pPrior points into the data area
60659 /* If pPrior is part of the data area of pPage, then make sure pPage
60675 /* If pToRelease is not zero than pPayload points into the data area
60679 /* If pPayload is part of the data area of pPage, then make sure pPage
60972 ** content area on page pPg. If the size of the content area is extended,
60973 ** *ppData is updated to point to the new start of the content area
60977 ** end of the space required by this page for the cell-pointer area (for
60979 ** area must be extended to before this point in order to accomodate all
60985 u8 **ppData, /* IN/OUT: Page content -area pointer */
60986 u8 *pCellptr, /* Pointer to cell-pointer area */
63532 u32 contentOffset; /* Offset to the start of the cell content area */
63739 ** number of fragmented free bytes within the cell content area.
155794 RtreeDValue area = (RtreeDValue)1;
155797 area = (area * (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii])));
155799 return area;
155834 ** Return true if the area covered by p2 is a subset of the area covered
155856 RtreeDValue area;
155859 area = cellArea(pRtree, &cell);
155861 return (cellArea(pRtree, &cell)-area);
155922 ** the smallest area.
155927 RtreeDValue area;
155930 area = cellArea(pRtree, &cell);
155931 if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){
155936 fMinArea = area;
156198 RtreeDValue area;
156212 area = cellArea(pRtree, &left) + cellArea(pRtree, &right);
156215 || (overlap==fBestOverlap && area<fBestArea)
156219 fBestArea = area;
172052 ** Offset of last rowid written to data area. Relative to first byte of
