567   assert( iCol>=0 && iCol<pIdx->nColumn );  in indexColumnNotNull()
1643   assert( iCol>=0 && iCol<pIdx->nColumn );  in sqlite3IndexColumnAffinity()
1996   assert( nEq<=p->nColumn );  in whereEqualScanEst()
2009   if( nEq>=p->nColumn ){  in whereEqualScanEst()
2720   nCmp = MIN(nCmp, (pIdx->nColumn - nEq));  in whereRangeVectorLen()
2826   assert( pNew->u.btree.nEq<pProbe->nColumn );  in whereLoopAddBtreeIndex()
3115      && pNew->u.btree.nEq<pProbe->nColumn  in whereLoopAddBtreeIndex()
3276   u16 nColumn;            /* Number of columns in the index */  in whereIsCoveringIndexWalkCallback()  local
3282   nColumn = pIdx->nColumn;  in whereIsCoveringIndexWalkCallback()
3283   for(i=0; i<nColumn; i++){  in whereIsCoveringIndexWalkCallback()
3318   for(i=0; i<pIdx->nColumn; i++){  in whereIsCoveringIndex()
3321   if( i>=pIdx->nColumn ){  in whereIsCoveringIndex()
3415     sPk.nColumn = 1;  in whereLoopAddBtree()
4371   u16 nColumn;          /* Total number of ordered columns in the index */  in wherePathSatisfiesOrderBy()  local
4484         nColumn = 1;  in wherePathSatisfiesOrderBy()
4489         nColumn = pIndex->nColumn;  in wherePathSatisfiesOrderBy()
4490         assert( nColumn==nKeyCol+1 || !HasRowid(pIndex->pTable) );  in wherePathSatisfiesOrderBy()
4491         assert( pIndex->aiColumn[nColumn-1]==XN_ROWID  in wherePathSatisfiesOrderBy()
4506       for(j=0; j<nColumn; j++){  in wherePathSatisfiesOrderBy()
5498   for(i=0; i<pIdx->nColumn; i++){  in whereAddIndexedExpr()
6105           for(ii=0; ii<pIx->nColumn; ii++){  in sqlite3WhereBegin()