7157 #define NB 3             /* (NN*2+1): Total pages involved in the balance */  macro
7228   u8 *apEnd[NB*2];        /* MemPage.aDataEnd values */
7229   int ixNx[NB*2];         /* Index of at which we move to the next apEnd[] */
7303   for(k=0; pCArray->ixNx[k]<=i && ALWAYS(k<NB*2); k++){}  in rebuildPage()
7386   for(k=0; pCArray->ixNx[k]<=i && ALWAYS(k<NB*2); k++){}  in pageInsertArray()
7880   MemPage *apOld[NB];          /* pPage and up to two siblings */  in balance_nonroot()
7881   MemPage *apNew[NB+2];        /* pPage and up to NB siblings after balancing */  in balance_nonroot()
7883   u8 *apDiv[NB-1];             /* Divider cells in pParent */  in balance_nonroot()
7884   int cntNew[NB+2];            /* Index in b.paCell[] of cell after i-th page */  in balance_nonroot()
7885   int cntOld[NB+2];            /* Old index in b.apCell[] */  in balance_nonroot()
7886   int szNew[NB+2];             /* Combined size of cells placed on i-th page */  in balance_nonroot()
7889   u8 abDone[NB+2];             /* True after i'th new page is populated */  in balance_nonroot()
7890   Pgno aPgno[NB+2];            /* Page numbers of new pages before shuffling */  in balance_nonroot()
8178         if( k>NB+2 ){ rc = SQLITE_CORRUPT_BKPT; goto balance_cleanup; }  in balance_nonroot()
8404         assert( iOld>=0 && iOld<NB );  in balance_nonroot()
8483     for(k=0; b.ixNx[k]<=j && ALWAYS(k<NB*2); k++){}  in balance_nonroot()