Lines Matching refs:btree
125920 } btree;
126418 Index *pIndex = pLoop->u.btree.pIndex;
126419 u16 nEq = pLoop->u.btree.nEq;
126433 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nBtm, j, i, ">");
126437 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nTop, j, i, "<");
126480 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))
126498 assert( pLoop->u.btree.pIndex!=0 );
126499 pIdx = pLoop->u.btree.pIndex;
126571 if( (pLoop->wsFlags & WHERE_VIRTUALTABLE)==0 && pLoop->u.btree.pIndex!=0 ){
126572 zObj = pLoop->u.btree.pIndex->zName;
126754 && pLoop->u.btree.pIndex!=0
126755 && pLoop->u.btree.pIndex->aSortOrder[iEq]
126955 nEq = pLoop->u.btree.nEq;
126957 pIdx = pLoop->u.btree.pIndex;
126963 nReg = pLoop->u.btree.nEq + nExtraReg;
127210 sHint.pIdx = pLoop->u.btree.pIndex;
127259 if( pLoop->u.btree.nEq==0 && pTerm!=pEndRange ){
127547 assert( pLoop->u.btree.nEq==1 );
127714 u16 nEq = pLoop->u.btree.nEq; /* Number of == or IN terms */
127715 u16 nBtm = pLoop->u.btree.nBtm; /* Length of BTM vector */
127716 u16 nTop = pLoop->u.btree.nTop; /* Length of TOP vector */
127733 pIdx = pLoop->u.btree.pIndex;
127763 nExtraReg = MAX(nExtraReg, pLoop->u.btree.nBtm);
127770 nExtraReg = MAX(nExtraReg, pLoop->u.btree.nTop);
128228 && (ii==0 || pSubLoop->u.btree.pIndex==pCov)
128229 && (HasRowid(pTab) || !IsPrimaryKeyIndex(pSubLoop->u.btree.pIndex))
128232 pCov = pSubLoop->u.btree.pIndex;
130541 pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol;
130567 pLoop->u.btree.pIndex = pIdx;
130588 assert( (u32)n==pLoop->u.btree.nEq );
131122 Index *p = pLoop->u.btree.pIndex;
131123 int nEq = pLoop->u.btree.nEq;
131239 Index *p = pLoop->u.btree.pIndex;
131240 int nEq = pLoop->u.btree.nEq;
131246 int nBtm = pLoop->u.btree.nBtm;
131247 int nTop = pLoop->u.btree.nTop;
131412 Index *p = pBuilder->pNew->u.btree.pIndex;
131413 int nEq = pBuilder->pNew->u.btree.nEq;
131476 Index *p = pBuilder->pNew->u.btree.pIndex;
131568 if( p->u.btree.pIndex && (zName = p->u.btree.pIndex->zName)!=0 ){
131574 sqlite3DebugPrintf(".%-16s %2d", zName, p->u.btree.nEq);
131624 }else if( (p->wsFlags & WHERE_AUTO_INDEX)!=0 && p->u.btree.pIndex!=0 ){
131625 sqlite3DbFree(db, p->u.btree.pIndex->zColAff);
131626 sqlite3DbFree(db, p->u.btree.pIndex);
131627 p->u.btree.pIndex = 0;
131671 pFrom->u.btree.pIndex = 0;
131973 Index *pIndex = p->u.btree.pIndex;
131975 p->u.btree.pIndex = 0;
132173 pProbe->zName, pNew->u.btree.nEq));
132180 assert( pNew->u.btree.nBtm==0 );
132185 assert( pNew->u.btree.nEq<pProbe->nColumn );
132187 saved_nEq = pNew->u.btree.nEq;
132188 saved_nBtm = pNew->u.btree.nBtm;
132189 saved_nTop = pNew->u.btree.nTop;
132237 pNew->u.btree.nEq = saved_nEq;
132238 pNew->u.btree.nBtm = saved_nBtm;
132239 pNew->u.btree.nTop = saved_nTop;
132276 assert( saved_nEq==pNew->u.btree.nEq );
132292 pNew->u.btree.nBtm = whereRangeVectorLen(
132307 pNew->u.btree.nTop = 1;
132314 pNew->u.btree.nTop = whereRangeVectorLen(
132333 int nEq = ++pNew->u.btree.nEq;
132347 && pNew->u.btree.nEq<=pProbe->nSampleCol
132405 && pNew->u.btree.nEq<pProbe->nColumn
132415 pNew->u.btree.nEq = saved_nEq;
132416 pNew->u.btree.nBtm = saved_nBtm;
132417 pNew->u.btree.nTop = saved_nTop;
132441 pNew->u.btree.nEq++;
132452 pNew->u.btree.nEq = saved_nEq;
132652 pNew->u.btree.nEq = 1;
132654 pNew->u.btree.pIndex = 0;
132694 pNew->u.btree.nEq = 0;
132695 pNew->u.btree.nBtm = 0;
132696 pNew->u.btree.nTop = 0;
132703 pNew->u.btree.pIndex = pProbe;
133415 }else if( (pIndex = pLoop->u.btree.pIndex)==0 || pIndex->bUnordered ){
133434 assert( j>=pLoop->u.btree.nEq
133437 if( j<pLoop->u.btree.nEq && j>=pLoop->nSkip ){
133460 for(i=j+1; i<pLoop->u.btree.nEq; i++){
133487 && j>=pLoop->u.btree.nEq
134068 pLoop->u.btree.nEq = 1;
134092 pLoop->u.btree.nEq = j;
134093 pLoop->u.btree.pIndex = pIdx;
134544 if( pLoop->u.btree.pIndex!=0 ){
134559 Index *pIx = pLoop->u.btree.pIndex;
134711 VdbeComment((v, "next skip-scan on %s", pLoop->u.btree.pIndex->zName));
134783 pIdx = pLoop->u.btree.pIndex;