Lines Matching defs:area
19173 int aTempReg[8]; /* Holding area for temporary registers */
41445 ** Open a shared-memory area associated with open database file pDbFd.
45037 assert( UNIX_SHM_BASE==120 ); /* Start of locking area */
48988 ** Open the shared-memory area associated with database file pDbFd.
53288 ** function is 0, then the data area associated with page 1 is zeroed, but
53580 ** area after the page content buffer. The header serves as that overrun
53581 ** area. Therefore SQLITE_PCACHE_SEPARATE_HEADER was discontinued to avoid
53634 ** overrun area, so that overreads are harmless.
65693 ** same area of shared memory on a different CPU in a SMP,
65903 /* Check to see if a separate writer has attached to the shared-memory area,
67673 ** cell pointer array, and the cell content area. Page 1 also has a 100-byte
67689 ** | area | | and free space fragments.
67698 ** 5 2 first byte of the cell content area
67706 ** the payload area.
67711 ** content area. The cell pointers occur in sorted order. The system strives
67718 ** Unused space within the cell content area is collected into a linked list of
67722 ** any group of 3 or fewer unused bytes in the cell content area cannot
67731 ** Cells are of variable length. Cells are stored in the cell content area at
67865 u8 *aCellIdx; /* The cell index area */
68633 ** This routine is used to extract the "offset to cell content area" value
69943 ** data area of the btree-page. The return number includes the cell
70120 int cbrk; /* Offset to the cell content area */
70123 unsigned char *temp; /* Temp area for cell content */
70315 ** the first two bytes past the cell pointer area since presumably this
70322 int top; /* First byte of cell content area */
70392 ** and the cell content area. The btreeComputeFreeSpace() call has already
70423 u16 x; /* Offset to cell content area */
70492 /* The new freeblock is at the beginning of the cell content area,
70493 ** so just extend the cell content area rather than create another
70608 int top; /* First byte of the cell content area */
70625 ** the start of the cell content area. A zero value for this integer is
70667 ** of the cell-content area plus the number of free bytes within
70668 ** the cell-content area. If this is greater than the usable-size
70671 ** area, according to the page header, lies within the page.
70692 int cellOffset; /* Start of cell content area */
70761 ** offset to the cell content area will equal the page size minus the
71433 ** beginning of pTmpSpace as an area available to prepend the
75435 ** area. pCell might point to some temporary storage. The cell will
75436 ** be constructed in this temporary area then copied into pPage->aData
75459 ** buffer space that is separate from the pPage buffer area */
75539 /* If pToRelease is not zero than pPayload points into the data area
75543 /* If pPayload is part of the data area of pPage, then make sure pPage
75599 /* If pToRelease is not zero than pPrior points into the data area
75603 /* If pPrior is part of the data area of pPage, then make sure pPage
75813 ** to content area of the pages.
75930 u32 j; /* Start of cell content area */
75999 ** content area on page pPg. If the size of the content area is extended,
76000 ** *ppData is updated to point to the new start of the content area
76004 ** end of the space required by this page for the cell-pointer area (for
76006 ** area must be extended to before this point in order to accomodate all
76012 u8 **ppData, /* IN/OUT: Page content-area pointer */
76013 u8 *pCellptr, /* Pointer to cell-pointer area */
76020 u8 *pData = *ppData; /* Content area. A subset of aData[] */
79051 u32 contentOffset; /* Offset to the start of the cell content area */
79264 ** number of fragmented free bytes within the cell content area.
81809 pMem->z[amt] = 0; /* Overrun area used when reading malformed records */
93280 ** content area, the "page header" comes after the page content and so
203021 RtreeDValue area = (RtreeDValue)1;
203026 case 5: area = p->aCoord[9].f - p->aCoord[8].f;
203027 case 4: area *= p->aCoord[7].f - p->aCoord[6].f;
203028 case 3: area *= p->aCoord[5].f - p->aCoord[4].f;
203029 case 2: area *= p->aCoord[3].f - p->aCoord[2].f;
203030 default: area *= p->aCoord[1].f - p->aCoord[0].f;
203036 case 5: area = (i64)p->aCoord[9].i - (i64)p->aCoord[8].i;
203037 case 4: area *= (i64)p->aCoord[7].i - (i64)p->aCoord[6].i;
203038 case 3: area *= (i64)p->aCoord[5].i - (i64)p->aCoord[4].i;
203039 case 2: area *= (i64)p->aCoord[3].i - (i64)p->aCoord[2].i;
203040 default: area *= (i64)p->aCoord[1].i - (i64)p->aCoord[0].i;
203043 return area;
203081 ** Return true if the area covered by p2 is a subset of the area covered
203103 RtreeDValue area;
203106 area = cellArea(pRtree, &cell);
203108 return (cellArea(pRtree, &cell)-area);
203169 ** the smallest area.
203174 RtreeDValue area;
203177 area = cellArea(pRtree, &cell);
203178 if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){
203183 fMinArea = area;
203454 RtreeDValue area;
203468 area = cellArea(pRtree, &left) + cellArea(pRtree, &right);
203471 || (overlap==fBestOverlap && area<fBestArea)
203475 fBestArea = area;
205448 ** The polygon follows the right-hand rule. The area to the right of
205449 ** each segment is "outside" and the area to the left is "inside".
205831 ** Compute the area enclosed by the polygon.
205854 ** If the input is a well-formed Geopoly BLOB then return the area
205857 ** enclosed area. Otherwise return NULL.
229497 ** Offset of last rowid written to data area. Relative to first byte of