Lines Matching refs:btree
156936 } btree;
157499 Index *pIndex = pLoop->u.btree.pIndex;
157500 u16 nEq = pLoop->u.btree.nEq;
157514 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nBtm, j, i, ">");
157518 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nTop, j, i, "<");
157558 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))
157568 assert( pLoop->u.btree.pIndex!=0 );
157569 pIdx = pLoop->u.btree.pIndex;
157674 for(i=pLoop->nSkip; i<pLoop->u.btree.nEq; i++){
157675 const char *z = explainIndexColumnName(pLoop->u.btree.pIndex, i);
157712 if( (wsFlags & WHERE_VIRTUALTABLE)==0 && pLoop->u.btree.pIndex!=0 ){
157713 zObj = pLoop->u.btree.pIndex->zName;
158030 && pLoop->u.btree.pIndex!=0
158031 && pLoop->u.btree.pIndex->aSortOrder[iEq]
158224 nEq = pLoop->u.btree.nEq;
158226 pIdx = pLoop->u.btree.pIndex;
158480 sHint.pIdx = pLoop->u.btree.pIndex;
158529 if( pLoop->u.btree.nEq==0 && pTerm!=pEndRange ){
158733 u16 nEq = pLoop->u.btree.nEq;
158757 if( pLoop->u.btree.pIndex->onError
158759 && pLoop->u.btree.nEq==pLoop->u.btree.pIndex->nKeyCol
158762 for(ii=0; ii<pLoop->u.btree.nEq; ii++){
159003 assert( pLoop->u.btree.nEq==1 );
159179 u16 nEq = pLoop->u.btree.nEq; /* Number of == or IN terms */
159180 u16 nBtm = pLoop->u.btree.nBtm; /* Length of BTM vector */
159181 u16 nTop = pLoop->u.btree.nTop; /* Length of TOP vector */
159200 pIdx = pLoop->u.btree.pIndex;
159210 nExtraReg = MAX(nExtraReg, pLoop->u.btree.nBtm);
159217 nExtraReg = MAX(nExtraReg, pLoop->u.btree.nTop);
159826 && (ii==0 || pSubLoop->u.btree.pIndex==pCov)
159827 && (HasRowid(pTab) || !IsPrimaryKeyIndex(pSubLoop->u.btree.pIndex))
159830 pCov = pSubLoop->u.btree.pIndex;
163135 pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol;
163165 pLoop->u.btree.pIndex = pIdx;
163200 assert( (u32)n==pLoop->u.btree.nEq );
163258 regBase, pLoop->u.btree.nEq);
163386 Index *pIdx = pLoop->u.btree.pIndex;
163387 int n = pLoop->u.btree.nEq;
163972 Index *p = pLoop->u.btree.pIndex;
163973 int nEq = pLoop->u.btree.nEq;
164089 Index *p = pLoop->u.btree.pIndex;
164090 int nEq = pLoop->u.btree.nEq;
164098 int nBtm = pLoop->u.btree.nBtm;
164099 int nTop = pLoop->u.btree.nTop;
164265 Index *p = pBuilder->pNew->u.btree.pIndex;
164266 int nEq = pBuilder->pNew->u.btree.nEq;
164329 Index *p = pBuilder->pNew->u.btree.pIndex;
164447 if( p->u.btree.pIndex && (zName = p->u.btree.pIndex->zName)!=0 ){
164453 sqlite3DebugPrintf(".%-16s %2d", zName, p->u.btree.nEq);
164512 }else if( (p->wsFlags & WHERE_AUTO_INDEX)!=0 && p->u.btree.pIndex!=0 ){
164513 sqlite3DbFree(db, p->u.btree.pIndex->zColAff);
164514 sqlite3DbFreeNN(db, p->u.btree.pIndex);
164515 p->u.btree.pIndex = 0;
164567 pFrom->u.btree.pIndex = 0;
164634 if( pX->u.btree.nEq < pY->u.btree.nEq /* (1b) */
164635 && pX->u.btree.pIndex==pY->u.btree.pIndex /* (1a) */
164901 Index *pIndex = p->u.btree.pIndex;
164903 p->u.btree.pIndex = 0;
165135 pNew->u.btree.nEq, pNew->nSkip, pNew->rRun));
165142 assert( pNew->u.btree.nBtm==0 );
165152 assert( pNew->u.btree.nEq<pProbe->nColumn );
165153 assert( pNew->u.btree.nEq<pProbe->nKeyCol
165156 saved_nEq = pNew->u.btree.nEq;
165157 saved_nBtm = pNew->u.btree.nBtm;
165158 saved_nTop = pNew->u.btree.nTop;
165199 pNew->u.btree.nEq = saved_nEq;
165200 pNew->u.btree.nBtm = saved_nBtm;
165201 pNew->u.btree.nTop = saved_nTop;
165285 assert( saved_nEq==pNew->u.btree.nEq );
165308 pNew->u.btree.nBtm = nVecLen;
165321 pNew->u.btree.nTop = 1;
165328 pNew->u.btree.nTop = nVecLen;
165346 int nEq = ++pNew->u.btree.nEq;
165360 && ALWAYS(pNew->u.btree.nEq<=pProbe->nSampleCol)
165460 && pNew->u.btree.nEq<pProbe->nColumn
165461 && (pNew->u.btree.nEq<pProbe->nKeyCol ||
165464 if( pNew->u.btree.nEq>3 ){
165475 pNew->u.btree.nEq = saved_nEq;
165476 pNew->u.btree.nBtm = saved_nBtm;
165477 pNew->u.btree.nTop = saved_nTop;
165504 pNew->u.btree.nEq++;
165515 pNew->u.btree.nEq = saved_nEq;
165953 pNew->u.btree.nEq = 1;
165955 pNew->u.btree.pIndex = 0;
166003 pNew->u.btree.nEq = 0;
166004 pNew->u.btree.nBtm = 0;
166005 pNew->u.btree.nTop = 0;
166012 pNew->u.btree.pIndex = pProbe;
166983 pLoop->u.btree.nDistinctCol = 0;
167028 }else if( (pIndex = pLoop->u.btree.pIndex)==0 || pIndex->bUnordered ){
167052 assert( j>=pLoop->u.btree.nEq
167055 if( j<pLoop->u.btree.nEq && j>=pLoop->nSkip ){
167084 for(i=j+1; i<pLoop->u.btree.nEq; i++){
167111 && j>=pLoop->u.btree.nEq
167147 pLoop->u.btree.nDistinctCol = j+1;
167168 if( j==pLoop->u.btree.nEq ){
167848 pLoop->u.btree.nEq = 1;
167873 pLoop->u.btree.nEq = j;
167874 pLoop->u.btree.pIndex = pIdx;
168808 if( pLoop->u.btree.pIndex!=0 && (pTab->tabFlags & TF_WithoutRowid)==0 ){
168823 Index *pIx = pLoop->u.btree.pIndex;
169052 && (pIdx = pLoop->u.btree.pIndex)->hasStat1
169053 && (n = pLoop->u.btree.nDistinctCol)>0
169141 VdbeComment((v, "next skip-scan on %s", pLoop->u.btree.pIndex->zName));
169233 pIdx = pLoop->u.btree.pIndex;