Lines Matching refs:u

329          && pTerm->u.x.leftColumn==iColumn  in whereScanNext()
805 if( pTerm->u.x.leftColumn<0 ) return 0; in termCanDriveIndex()
806 aff = pSrc->pTab->aCol[pTerm->u.x.leftColumn].affinity; in termCanDriveIndex()
879 iCol = pTerm->u.x.leftColumn; in constructAutomaticIndex()
899 pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol; in constructAutomaticIndex()
925 pLoop->u.btree.pIndex = pIdx; in constructAutomaticIndex()
935 iCol = pTerm->u.x.leftColumn; in constructAutomaticIndex()
942 pIdx->aiColumn[n] = pTerm->u.x.leftColumn; in constructAutomaticIndex()
950 assert( (u32)n==pLoop->u.btree.nEq ); in constructAutomaticIndex()
1006 regBase, pLoop->u.btree.nEq); in constructAutomaticIndex()
1120 Index *pIdx = pLoop->u.btree.pIndex; in sqlite3ConstructBloomFilter()
1121 int n = pLoop->u.btree.nEq; in sqlite3ConstructBloomFilter()
1211 assert( pTerm->u.x.leftColumn>=XN_ROWID ); in allocateIndexInfo()
1212 assert( pTerm->u.x.leftColumn<pTab->nCol ); in allocateIndexInfo()
1255 assert( pExpr->u.zToken!=0 ); in allocateIndexInfo()
1261 if( sqlite3_stricmp(pExpr->u.zToken, zColl)==0 ) continue; in allocateIndexInfo()
1301 pIdxCons[j].iColumn = pTerm->u.x.leftColumn; in allocateIndexInfo()
1696 Index *p = pLoop->u.btree.pIndex; in whereRangeSkipScanEst()
1697 int nEq = pLoop->u.btree.nEq; in whereRangeSkipScanEst()
1813 Index *p = pLoop->u.btree.pIndex; in whereRangeScanEst()
1814 int nEq = pLoop->u.btree.nEq; in whereRangeScanEst()
1822 int nBtm = pLoop->u.btree.nBtm; in whereRangeScanEst()
1823 int nTop = pLoop->u.btree.nTop; in whereRangeScanEst()
1988 Index *p = pBuilder->pNew->u.btree.pIndex; in whereEqualScanEst()
1989 int nEq = pBuilder->pNew->u.btree.nEq; in whereEqualScanEst()
2052 Index *p = pBuilder->pNew->u.btree.pIndex; in whereInScanEst()
2097 pTerm->leftCursor, pTerm->u.x.leftColumn); in sqlite3WhereTermPrint()
2098 }else if( (pTerm->eOperator & WO_OR)!=0 && pTerm->u.pOrInfo!=0 ){ in sqlite3WhereTermPrint()
2100 pTerm->u.pOrInfo->indexable); in sqlite3WhereTermPrint()
2113 if( (pTerm->eOperator & (WO_OR|WO_AND))==0 && pTerm->u.x.iField ){ in sqlite3WhereTermPrint()
2114 sqlite3DebugPrintf(" iField=%d", pTerm->u.x.iField); in sqlite3WhereTermPrint()
2153 if( p->u.btree.pIndex && (zName = p->u.btree.pIndex->zName)!=0 ){ in sqlite3WhereLoopPrint()
2159 sqlite3DebugPrintf(".%-16s %2d", zName, p->u.btree.nEq); in sqlite3WhereLoopPrint()
2165 if( p->u.vtab.idxStr ){ in sqlite3WhereLoopPrint()
2167 p->u.vtab.idxNum, p->u.vtab.idxStr, p->u.vtab.omitMask); in sqlite3WhereLoopPrint()
2169 z = sqlite3_mprintf("(%d,%x)", p->u.vtab.idxNum, p->u.vtab.omitMask); in sqlite3WhereLoopPrint()
2205 if( (p->wsFlags & WHERE_VIRTUALTABLE)!=0 && p->u.vtab.needFree ){ in whereLoopClearUnion()
2206 sqlite3_free(p->u.vtab.idxStr); in whereLoopClearUnion()
2207 p->u.vtab.needFree = 0; in whereLoopClearUnion()
2208 p->u.vtab.idxStr = 0; in whereLoopClearUnion()
2209 }else if( (p->wsFlags & WHERE_AUTO_INDEX)!=0 && p->u.btree.pIndex!=0 ){ in whereLoopClearUnion()
2210 sqlite3DbFree(db, p->u.btree.pIndex->zColAff); in whereLoopClearUnion()
2211 sqlite3DbFreeNN(db, p->u.btree.pIndex); in whereLoopClearUnion()
2212 p->u.btree.pIndex = 0; in whereLoopClearUnion()
2262 pFrom->u.vtab.needFree = 0; in whereLoopXfer()
2264 pFrom->u.btree.pIndex = 0; in whereLoopXfer()
2584 Index *pIndex = p->u.btree.pIndex; in whereLoopInsert()
2586 p->u.btree.pIndex = 0; in whereLoopInsert()
2814 pNew->u.btree.nEq, pNew->nSkip, pNew->rRun)); in whereLoopAddBtreeIndex()
2821 assert( pNew->u.btree.nBtm==0 ); in whereLoopAddBtreeIndex()
2826 assert( pNew->u.btree.nEq<pProbe->nColumn ); in whereLoopAddBtreeIndex()
2827 assert( pNew->u.btree.nEq<pProbe->nKeyCol in whereLoopAddBtreeIndex()
2830 saved_nEq = pNew->u.btree.nEq; in whereLoopAddBtreeIndex()
2831 saved_nBtm = pNew->u.btree.nBtm; in whereLoopAddBtreeIndex()
2832 saved_nTop = pNew->u.btree.nTop; in whereLoopAddBtreeIndex()
2873 pNew->u.btree.nEq = saved_nEq; in whereLoopAddBtreeIndex()
2874 pNew->u.btree.nBtm = saved_nBtm; in whereLoopAddBtreeIndex()
2875 pNew->u.btree.nTop = saved_nTop; in whereLoopAddBtreeIndex()
2959 assert( saved_nEq==pNew->u.btree.nEq ); in whereLoopAddBtreeIndex()
2982 pNew->u.btree.nBtm = nVecLen; in whereLoopAddBtreeIndex()
2995 pNew->u.btree.nTop = 1; in whereLoopAddBtreeIndex()
3002 pNew->u.btree.nTop = nVecLen; in whereLoopAddBtreeIndex()
3020 int nEq = ++pNew->u.btree.nEq; in whereLoopAddBtreeIndex()
3034 && ALWAYS(pNew->u.btree.nEq<=pProbe->nSampleCol) in whereLoopAddBtreeIndex()
3115 && pNew->u.btree.nEq<pProbe->nColumn in whereLoopAddBtreeIndex()
3116 && (pNew->u.btree.nEq<pProbe->nKeyCol || in whereLoopAddBtreeIndex()
3127 pNew->u.btree.nEq = saved_nEq; in whereLoopAddBtreeIndex()
3128 pNew->u.btree.nBtm = saved_nBtm; in whereLoopAddBtreeIndex()
3129 pNew->u.btree.nTop = saved_nTop; in whereLoopAddBtreeIndex()
3156 pNew->u.btree.nEq++; in whereLoopAddBtreeIndex()
3167 pNew->u.btree.nEq = saved_nEq; in whereLoopAddBtreeIndex()
3279 if( pExpr->iTable!=pWalk->u.pCovIdxCk->iTabCur ) return WRC_Continue; in whereIsCoveringIndexWalkCallback()
3280 pIdx = pWalk->u.pCovIdxCk->pIdx; in whereIsCoveringIndexWalkCallback()
3332 w.u.pCovIdxCk = &ck; in whereIsCoveringIndex()
3454 pNew->u.btree.nEq = 1; in whereLoopAddBtree()
3456 pNew->u.btree.pIndex = 0; in whereLoopAddBtree()
3503 pNew->u.btree.nEq = 0; in whereLoopAddBtree()
3504 pNew->u.btree.nBtm = 0; in whereLoopAddBtree()
3505 pNew->u.btree.nTop = 0; in whereLoopAddBtree()
3512 pNew->u.btree.pIndex = pProbe; in whereLoopAddBtree()
3740 memset(&pNew->u.vtab, 0, sizeof(pNew->u.vtab)); in whereLoopAddVirtualOne()
3770 pNew->u.vtab.omitMask |= 1<<iTerm; in whereLoopAddVirtualOne()
3775 pNew->u.vtab.bOmitOffset = 1; in whereLoopAddVirtualOne()
3779 pNew->u.vtab.mHandleIn |= MASKBIT32(iTerm); in whereLoopAddVirtualOne()
3820 pNew->u.vtab.idxNum = pIdxInfo->idxNum; in whereLoopAddVirtualOne()
3821 pNew->u.vtab.needFree = pIdxInfo->needToFreeIdxStr; in whereLoopAddVirtualOne()
3823 pNew->u.vtab.idxStr = pIdxInfo->idxStr; in whereLoopAddVirtualOne()
3824 pNew->u.vtab.isOrdered = (i8)(pIdxInfo->orderByConsumed ? in whereLoopAddVirtualOne()
3838 if( pNew->u.vtab.needFree ){ in whereLoopAddVirtualOne()
3839 sqlite3_free(pNew->u.vtab.idxStr); in whereLoopAddVirtualOne()
3840 pNew->u.vtab.needFree = 0; in whereLoopAddVirtualOne()
4025 pNew->u.vtab.needFree = 0; in whereLoopAddVirtual()
4154 && (pTerm->u.pOrInfo->indexable & pNew->maskSelf)!=0 in whereLoopAddOr()
4156 WhereClause * const pOrWC = &pTerm->u.pOrInfo->wc; in whereLoopAddOr()
4168 sSubBuild.pWC = &pOrTerm->u.pAndInfo->wc; in whereLoopAddOr()
4227 memset(&pNew->u, 0, sizeof(pNew->u)); in whereLoopAddOr()
4433 if( pLoop->u.vtab.isOrdered in wherePathSatisfiesOrderBy()
4440 pLoop->u.btree.nDistinctCol = 0; in wherePathSatisfiesOrderBy()
4485 }else if( (pIndex = pLoop->u.btree.pIndex)==0 || pIndex->bUnordered ){ in wherePathSatisfiesOrderBy()
4509 assert( j>=pLoop->u.btree.nEq in wherePathSatisfiesOrderBy()
4512 if( j<pLoop->u.btree.nEq && j>=pLoop->nSkip ){ in wherePathSatisfiesOrderBy()
4541 for(i=j+1; i<pLoop->u.btree.nEq; i++){ in wherePathSatisfiesOrderBy()
4568 && j>=pLoop->u.btree.nEq in wherePathSatisfiesOrderBy()
4604 pLoop->u.btree.nDistinctCol = j+1; in wherePathSatisfiesOrderBy()
4625 if( j==pLoop->u.btree.nEq ){ in wherePathSatisfiesOrderBy()
5213 pLoop->u.btree.nEq = 1; in whereShortCut()
5238 pLoop->u.btree.nEq = j; in whereShortCut()
5239 pLoop->u.btree.pIndex = pIdx; in whereShortCut()
6038 if( pLoop->u.btree.pIndex!=0 ){ in sqlite3WhereBegin()
6053 Index *pIx = pLoop->u.btree.pIndex; in sqlite3WhereBegin()
6292 && (pIdx = pLoop->u.btree.pIndex)->hasStat1 in sqlite3WhereEnd()
6293 && (n = pLoop->u.btree.nDistinctCol)>0 in sqlite3WhereEnd()
6328 if( (pLoop->wsFlags & WHERE_IN_ABLE)!=0 && pLevel->u.in.nIn>0 ){ in sqlite3WhereEnd()
6332 for(j=pLevel->u.in.nIn, pIn=&pLevel->u.in.aInLoop[j-1]; j>0; j--, pIn--){ in sqlite3WhereEnd()
6381 VdbeComment((v, "next skip-scan on %s", pLoop->u.btree.pIndex->zName)); in sqlite3WhereEnd()
6401 || ((ws & WHERE_MULTI_OR) && pLevel->u.pCoveringIdx) in sqlite3WhereEnd()
6404 Index *pIx = pLevel->u.pCoveringIdx; in sqlite3WhereEnd()
6464 pIdx = pLoop->u.btree.pIndex; in sqlite3WhereEnd()
6466 pIdx = pLevel->u.pCoveringIdx; in sqlite3WhereEnd()