Lines Matching defs:NB
16525 /* NB: pDirtyNext and pDirtyPrev are undefined if the
40108 ** NB: If you define USE_PREAD or USE_PREAD64, then it might also
42629 /* NB: zFilename exists and remains valid until the file is closed
53660 /* NB: pLruPrev is only valid if pLruNext!=0 */
58105 ** NB: zJournal is really a MAIN_JOURNAL. But call it a
75782 ** of the page that participate in the balancing operation. NB is the
75793 ** But that is unlikely. NB has been 3 since the inception of SQLite and
75797 #define NB 3 /* (NN*2+1): Total pages involved in the balance */
75868 u8 *apEnd[NB*2]; /* MemPage.aDataEnd values */
75869 int ixNx[NB*2]; /* Index of at which we move to the next apEnd[] */
75943 for(k=0; pCArray->ixNx[k]<=i && ALWAYS(k<NB*2); k++){}
76026 for(k=0; pCArray->ixNx[k]<=i && ALWAYS(k<NB*2); k++){}
76520 MemPage *apOld[NB]; /* pPage and up to two siblings */
76521 MemPage *apNew[NB+2]; /* pPage and up to NB siblings after balancing */
76523 u8 *apDiv[NB-1]; /* Divider cells in pParent */
76524 int cntNew[NB+2]; /* Index in b.paCell[] of cell after i-th page */
76525 int cntOld[NB+2]; /* Old index in b.apCell[] */
76526 int szNew[NB+2]; /* Combined size of cells placed on i-th page */
76529 u8 abDone[NB+2]; /* True after i'th new page is populated */
76530 Pgno aPgno[NB+2]; /* Page numbers of new pages before shuffling */
76556 ** has NB or fewer children then all children of pParent are taken.
76818 if( k>NB+2 ){ rc = SQLITE_CORRUPT_BKPT; goto balance_cleanup; }
76954 ** An O(N*N) sort algorithm is used, but since N is never more than NB+2
76957 ** When NB==3, this one optimization makes the database about 25% faster
77044 assert( iOld>=0 && iOld<NB );
77123 for(k=0; b.ixNx[k]<=j && ALWAYS(k<NB*2); k++){}
84494 /* NB: The sqlite3OpcodeName() function is implemented by code created
96025 ** If the OPFLAG_NCHANGE flag of P2 (NB: P2 not P5) is set, then the row
204204 ** NB: nData can only be less than nDim*2+3 if the rtree is mis-declared