Lines Matching defs:NB
12676 ** if( rc==SQLITE_OK ) rc = sqlite3changegroup_add(pGrp, nB, pB);
12690 int nB, /* Number of bytes in buffer pB */
18234 /* NB: pDirtyNext and pDirtyPrev are undefined if the
46338 /* NB: zFilename exists and remains valid until the file is closed
57760 /* NB: pLruPrev is only valid if pLruNext!=0 */
62179 ** NB: zJournal is really a MAIN_JOURNAL. But call it a
80609 ** of the page that participate in the balancing operation. NB is the
80620 ** But that is unlikely. NB has been 3 since the inception of SQLite and
80624 #define NB 3 /* (NN*2+1): Total pages involved in the balance */
80695 u8 *apEnd[NB*2]; /* MemPage.aDataEnd values */
80696 int ixNx[NB*2]; /* Index of at which we move to the next apEnd[] */
80773 assert( pCArray->ixNx[NB*2-1]>i );
80858 assert( pCArray->ixNx[NB*2-1]>i );
81148 b.ixNx[NB*2-1] = 0x7fffffff;
81370 MemPage *apOld[NB]; /* pPage and up to two siblings */
81371 MemPage *apNew[NB+2]; /* pPage and up to NB siblings after balancing */
81373 u8 *apDiv[NB-1]; /* Divider cells in pParent */
81374 int cntNew[NB+2]; /* Index in b.paCell[] of cell after i-th page */
81375 int cntOld[NB+2]; /* Old index in b.apCell[] */
81376 int szNew[NB+2]; /* Combined size of cells placed on i-th page */
81379 u8 abDone[NB+2]; /* True after i'th new page is populated */
81380 Pgno aPgno[NB+2]; /* Page numbers of new pages before shuffling */
81386 b.ixNx[NB*2-1] = 0x7fffffff;
81408 ** has NB or fewer children then all children of pParent are taken.
81670 if( k>NB+2 ){ rc = SQLITE_CORRUPT_BKPT; goto balance_cleanup; }
81808 ** An O(N*N) sort algorithm is used, but since N is never more than NB+2
81811 ** When NB==3, this one optimization makes the database about 25% faster
81903 assert( iOld>=0 && iOld<NB );
81982 assert( b.ixNx[NB*2-1]>j );
89845 /* NB: The sqlite3OpcodeName() function is implemented by code created
102327 ** If the OPFLAG_NCHANGE (0x01) flag of P2 (NB: P2 not P5) is set, then
158145 /* NB: The SQLITE_ALLOW_TRIGGERS_ON_SYSTEM_TABLES compile-time option is
163690 ** NB: False-negatives are possible */
171022 int nb;
171028 nb = 1+(pWInfo->pTabList->nSrc+3)/4;
171031 mAll = (((Bitmask)1)<<(nb*4)) - 1;
171033 p->iTab, nb, p->maskSelf, nb, p->prereq & mAll);
191375 ** NB: One must usually run "PRAGMA writable_schema=RESET" after
221232 ** NB: nData can only be less than nDim*2+3 if the rtree is mis-declared
Indexes created Mon May 18 00:24:49 UTC 2026