Lines Matching refs:notReady
98224 Bitmask notReady, /* RHS must not overlap with this mask */
98234 && (pTerm->prereqRight & notReady)==0
99279 Bitmask notReady, /* Mask of cursors not available for indexing */
99299 && ((pTerm->prereqAll & ~maskSrc) & notReady)==0
99317 bestIndex(pParse, pAndWC, pSrc, notReady, notValid, 0, &sTermCost);
99325 bestIndex(pParse, &tempWC, pSrc, notReady, notValid, 0, &sTermCost);
99368 Bitmask notReady /* Tables in outer loops of the join */
99373 if( (pTerm->prereqRight & notReady)!=0 ) return 0;
99393 Bitmask notReady, /* Mask of cursors that are not available */
99430 if( termCanDriveIndex(pTerm, pSrc, notReady) ){
99456 Bitmask notReady, /* Mask of cursors that are not available */
99493 if( termCanDriveIndex(pTerm, pSrc, notReady) ){
99544 if( termCanDriveIndex(pTerm, pSrc, notReady) ){
99772 Bitmask notReady, /* Mask of cursors not available for index */
99844 pIdxCons->usable = (pTerm->prereqRight¬Ready) ? 0 : 1;
99903 bestOrClauseIndex(pParse, pWC, pSrc, notReady, notValid, pOrderBy, pCost);
100343 Bitmask notReady, /* Mask of cursors not available for indexing */
100496 pTerm = findTerm(pWC, iCur, j, notReady, eqTermMask, pIdx);
100522 if( findTerm(pWC, iCur, j, notReady, WO_LT|WO_LE|WO_GT|WO_GE, pIdx) ){
100523 WhereTerm *pTop = findTerm(pWC, iCur, j, notReady, WO_LT|WO_LE, pIdx);
100524 WhereTerm *pBtm = findTerm(pWC, iCur, j, notReady, WO_GT|WO_GE, pIdx);
100688 ** the notReady mask. When computing an "optimal" index, the notReady
100691 ** tables that are not in outer loops. If notReady is used here instead
100741 " notReady=0x%llx log10N=%.1f nRow=%.1f cost=%.1f used=0x%llx\n",
100744 notReady, log10N, nRow, cost, used
100791 bestOrClauseIndex(pParse, pWC, pSrc, notReady, notValid, pOrderBy, pCost);
100792 bestAutomaticIndex(pParse, pWC, pSrc, notReady, pCost);
100806 Bitmask notReady, /* Mask of cursors not available for indexing */
100814 bestVirtualIndex(pParse, pWC, pSrc, notReady, notValid, pOrderBy, pCost,&p);
100822 bestBtreeIndex(pParse, pWC, pSrc, notReady, notValid, pOrderBy, pCost);
101015 Bitmask notReady, /* Which parts of FROM have not yet been coded */
101050 pTerm = findTerm(pWC, iCur, k, notReady, pLevel->plan.wsFlags, pIdx);
101247 Bitmask notReady /* Which tables are currently available */
101349 pTerm = findTerm(pWC, iCur, -1, notReady, WO_EQ|WO_IN, 0);
101371 pStart = findTerm(pWC, iCur, -1, notReady, WO_GT|WO_GE, 0);
101372 pEnd = findTerm(pWC, iCur, -1, notReady, WO_LT|WO_LE, 0);
101529 pRangeEnd = findTerm(pWC, iCur, k, notReady, (WO_LT|WO_LE), pIdx);
101533 pRangeStart = findTerm(pWC, iCur, k, notReady, (WO_GT|WO_GE), pIdx);
101542 pParse, pLevel, pWC, notReady, nExtraReg, &zStartAff
101740 ** by this loop in the a[0] slot and all notReady tables in a[1..] slots.
101744 int nNotReady; /* The number of notReady tables */
101749 if( pOrTab==0 ) return notReady;
101802 ** contained one or more AND term from a notReady table. The
101803 ** terms from the notReady table could not be tested and will
101835 notReady &= ~getMask(pWC->pMaskSet, iCur);
101849 if( (pTerm->prereqAll & notReady)!=0 ){
101876 if( (pTerm->prereqAll & notReady)!=0 ){
101887 return notReady;
102032 Bitmask notReady; /* Cursors that are not yet positioned */
102167 notReady = ~(Bitmask)0;
102198 ** other FROM clause terms that are notReady. If no notReady terms are
102239 if( (m & notReady)==0 ){
102243 mask = (isOptimal ? m : notReady);
102253 bestVirtualIndex(pParse, pWC, pTabItem, mask, notReady, pOrderBy,
102258 bestBtreeIndex(pParse, pWC, pTabItem, mask, notReady, pOrderBy,
102261 assert( isOptimal || (sCost.used¬Ready)==0 );
102293 if( (sCost.used¬Ready)==0 /* (1) */
102313 assert( notReady & getMask(pMaskSet, pTabList->a[bestJ].iCursor) );
102329 notReady &= ~getMask(pMaskSet, pTabList->a[bestJ].iCursor);
102380 notReady = ~(Bitmask)0;
102420 constructAutomaticIndex(pParse, pWC, pTabItem, notReady, pLevel);
102434 notReady &= ~getMask(pWC->pMaskSet, pTabItem->iCursor);
102443 notReady = ~(Bitmask)0;
102447 notReady = codeOneLoopStart(pWInfo, i, wctrlFlags, notReady);