Lines Matching defs:overflow
158 ** level of recursion for each term. A stack overflow can result
6410 ** buffer and where forced to overflow to [sqlite3_malloc()]. The
6433 ** buffer and where forced to overflow to [sqlite3_malloc()]. The values
18888 ** signed integer value might cause an integer overflow inside of the
21564 ** special case 2 overflow if positive */
22137 ** overflow, leave *pA unchanged and return 1.
36757 ** One extra bucket is added to catch overflow in case something
48506 ** bytes are stored on overflow pages. The payload for an entry
48516 ** Each page can be either a btree page, a freelist page, an overflow
48562 ** payload is spilled to overflow pages. Once an overflow page is allocated,
48563 ** as many bytes as possible are moved into the overflow pages without letting
48661 ** 4 First page of the overflow chain. Omitted if no overflow
48663 ** Overflow pages form a linked list. Each page except the last is completely
48668 ** 4 Page number of next overflow page
48739 u8 nOverflow; /* Number of overflow cell bodies in aCell[] */
48752 u16 aiOvfl[5]; /* Insert the i-th overflow cell before the aiOvfl-th
48753 ** non-overflow cell */
48754 u8 *apOvfl[5]; /* Pointers to the body of overflow cells */
48928 u16 iOverflow; /* Offset to overflow page number. Zero if no overflow */
48963 Pgno *aOverflow; /* Cache of overflow page locations */
49058 ** overflow pages. The page number identifies the page that
49059 ** contains the cell with a pointer to this overflow page.
49062 ** overflow pages. The page-number identifies the previous
49063 ** page in the overflow page list.
49825 ** Invalidate the overflow page-list cache for cursor pCur, if any.
49834 ** Invalidate the overflow page-list cache for all cursors opened
50249 ** This routine works only for pages that do not contain overflow cells.
50258 ** pages that do contain overflow cells.
50318 ** on the local page. No overflow is required.
50326 ** overflow pages. The strategy is to minimize the amount of unused
50327 ** space on overflow pages while keeping the amount of local storage
50330 ** Warning: changing the way overflow payload is distributed in any
50335 int surplus; /* Overflow payload available for local storage */
50364 ** data header and the local payload, but not any overflow page or
50431 ** to an overflow page, insert an entry into the pointer-map
50432 ** for the overflow page.
51049 /* pPage might not be a btree page; it might be an overflow page
51813 ** 4-byte overflow page pointer
51815 ** 17 bytes long, 0 to N bytes of payload, and an optional 4 byte overflow
52078 ** pPage contains cells that point to overflow pages, set the pointer
52079 ** map entries for the overflow pages as well.
52125 ** PTRMAP_OVERFLOW1: pPage is a btree-page. The pointer points at an overflow
52128 ** PTRMAP_OVERFLOW2: pPage is an overflow-page. The pointer points at the next
52129 ** overflow page in the list.
52219 ** that point to overflow pages. The pointer map entries for all these
52222 ** If pDbPage is an overflow page, then the first 4 bytes may store a
52223 ** pointer to a subsequent overflow page. If this is the case, then
52224 ** the pointer map needs to be updated for the subsequent overflow page.
53101 ** Given the page number of an overflow page in the database (parameter
53103 ** linked list of overflow pages. If possible, it uses the auto-vacuum
53108 ** The page number of the next overflow page in the linked list is
53121 Pgno ovfl, /* Current overflow page number */
53123 Pgno *pPgnoNext /* OUT: Next overflow page number */
53133 /* Try to find the next page in the overflow list using the
53135 ** the overflow list is page number (ovfl+1). If that guess turns
53219 ** or be scattered out on multiple overflow pages.
53222 ** cursor entry uses one or more overflow pages, this function
53223 ** allocates space for and lazily popluates the overflow page-list
53227 ** Once an overflow page-list cache has been allocated, it may be
53230 ** mode, the following events may invalidate an overflow page-list cache.
53234 ** * Creating a table (may require moving an overflow page).
53289 ** one entry for each overflow page in the overflow chain. The
53290 ** page number of the first overflow page is stored in aOverflow[0],
53304 /* If the overflow page-list cache has been allocated and the
53305 ** entry for the first required overflow page is valid, skip
53318 /* If required, populate the overflow page-list cache. */
53327 ** number for the next page in the overflow chain. The page
53328 ** data is not required. So first try to lookup the overflow
53355 ** 2) data is required from the start of this overflow page, and
53362 ** up loading large records that span many overflow pages.
53460 ** and data to fit on the local page and for there to be no overflow
53463 ** onto overflow pages, then accessPayload() must be used to reassemble
53520 ** in the common case where no overflow pages are used.
53980 /* The record flows over onto one or more overflow pages. In
54629 ** Free any overflow pages associated with the given Cell.
54642 return SQLITE_OK; /* No overflow pages. Return without doing anything */
54657 ** overflow page. Therefore if ovflPgno<2 or past the end of the
54670 ** to an overflow page belonging to a cell that is being deleted/updated.
54672 ** must not really be an overflow page and the database must be corrupt.
54675 ** enabled. If this 'overflow' page happens to be a page that the
54695 ** and write that byte sequence into pCell[]. Overflow pages are
54771 Pgno pgnoPtrmap = pgnoOvfl; /* Overflow page pointer-map entry page */
54783 ** overflow page is being allocated, add an entry to the pointer-map
54786 ** If this is the first overflow page, then write a partial entry
54788 ** then the optimistic overflow chain processing in clearCell()
54999 /* The cell may contain a pointer to an overflow page. If so, write
55000 ** the entry for the overflow page into the pointer map.
55081 ** pParent is its parent. pPage must have a single overflow entry
55123 ** cell on the page to an overflow page. If either of these
55218 ** any cells with overflow page pointers, then the corresponding pointer
55221 ** If pFrom is currently carrying any overflow cells (entries in the
55263 ** for any b-tree or overflow pages that pTo now contains the pointers to.
55302 ** used to store the parent's overflow cells. Because this function inserts
55306 ** enough for all overflow cells.
55353 /* At this point pParent may have at most one overflow cell. And if
55354 ** this overflow cell is present, it must be the cell with
55373 ** overflow cells in the parent page, since if any existed they will
55824 ** 2) The pointer-map entries associated with the first overflow
55825 ** page in any overflow chains used by new divider cells. These
55832 ** overflow pages used by these cells may need to be updated
55833 ** (internal intkey nodes never contain pointers to overflow pages).
55842 ** code only sets pointer map entries for child or overflow pages that have
55888 ** an overflow cell, or if the cell was located on a different sibling
55890 ** with any child or overflow pages need to be updated. */
55940 ** overfull (has one or more overflow pages).
55943 ** page, including overflow cells, are copied into the child. The root
55989 /* Copy the overflow cells from pRoot to pChild */
56061 ** to store the overflow cell. balance_quick() inserts a new cell
56062 ** into pParent, which may cause pParent overflow. If this
56065 ** happens, the overflow cell is stored in the aBalanceQuickSpace[]
56084 ** If the parent page becomes overfull, the overflow cell or cells
56088 ** but it doesn't deal with overflow cells - just moves them to a
56091 ** the previous call, as the overflow cell data will have been
56250 /* If no error has occured and pPage has an overflow cell, call balance()
56340 ** deleted writable. Then free any overflow pages associated with the
56438 ** out to be an overflow page, delete all overflow page-map caches
56854 ** page in the B-Tree structure (not including overflow pages).
57001 ** Check the integrity of the freelist or of an overflow page list.
57006 int isFreeList, /* True for a freelist. False for overflow page list */
57019 "%d of %d pages missing from overflow list starting at %d",
57056 ** page in this overflow list, check that the pointer-map entry for
57084 ** 5. Check the integrity of overflow pages.
57142 /* Check payload overflow pages
57611 ** overflow list for the current row. This is used by cursors opened
58795 ** the second condition under the assumption that addition overflow causes
86301 ** abs(X) throws an integer overflow error since there is no
86303 sqlite3_result_error(context, "integer overflow", -1);
87396 u8 overflow; /* True if integer overflow seen */
87422 if( (p->approx|p->overflow)==0 && sqlite3AddInt64(&p->iSum, v) ){
87423 p->overflow = 1;
87435 if( p->overflow ){
87436 sqlite3_result_error(context,"integer overflow",-1);
102999 ** array will never overflow.
109470 fprintf(yyTraceFILE,"%sStack Overflow!\n",yyTracePrompt);
109478 sqlite3ErrorMsg(pParse, "parser stack overflow");
111050 ** onto the stack here, and skip the stack overflow test in yy_shift().
120750 int nOvfl; /* Number of overflow pages to load doclist */
120813 ** the number of overflow pages consumed by a record B bytes in size.
120886 int nOvfl = 0; /* Total overflow pages used by doclists */
120902 ** associated with the tokens spill onto overflow pages, or if there is
120918 ** of the number of overflow pages that will be loaded by the pager layer
120935 ** loading N or more overflow pages into memory, where N is computed as:
120954 /* The number of overflow pages to load for this (and therefore all
