Lines Matching defs:Bitmask
464 ** bitmask tests, testcase() can be used to make sure each bit
10708 ** The bitmask datatype defined below is used for various optimizations.
10714 typedef u64 Bitmask;
10717 ** The number of bits in a Bitmask. "BMS" means "BitMask Size".
10719 #define BMS ((int)(sizeof(Bitmask)*8))
10760 Bitmask colUsed; /* Bit N (1<<N) set if column N of pTab is used */
11059 ** The yDbMask datatype for the bitmask of all attached databases.
11117 yDbMask cookieMask; /* Bitmask of schema verified databases */
12147 ** the MEMTYPE_* macros defined below. The type must be a bitmask with
13154 yDbMask btreeMask; /* Bitmask of db->aDb[] entries referenced */
25065 ** Allowed values for the unixFile.ctrlFlags bitmask:
42745 ** The vfsFlags parameter is a bitmask to pass to the flags parameter
51082 ** The "flags" parameter is a bitmask that might contain bits like
60531 ** The p->btreeMask field is a bitmask of all btrees that the prepared
66251 ** P1 is a 32-bit bitmask indicating whether or not each argument to the
73572 ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes
73574 ** column number is greater than the number of bits in the bitmask
73575 ** then set the high-order bit of the bitmask.
73584 pMatch->colUsed |= ((Bitmask)1)<<n;
73628 pItem->colUsed |= ((Bitmask)1)<<(iCol>=BMS ? BMS-1 : iCol);
100422 ** This function returns a 32-bit bitmask
102628 ** the <op> using a bitmask encoding defined by WO_xxx below. The
102629 ** use of a bitmask encoding for the operator allows us to search
102649 ** bits that will fit in a Bitmask. The VDBE cursor numbers might be
102654 ** bits in the Bitmask. So, in the example above, the cursor numbers
102675 Bitmask prereqRight; /* Bitmask of tables used by pExpr->pRight */
102676 Bitmask prereqAll; /* Bitmask of tables referenced by pExpr */
102710 Bitmask vmask; /* Bitmask identifying virtual table cursors */
102730 Bitmask indexable; /* Bitmask of all indexable tables in the clause */
102753 ** If WhereMaskSet.ix[A]==B it means that The A-th bit of a Bitmask
102754 ** corresponds VDBE cursor number B. The A-th bit of a bitmask is 1<<A.
102779 Bitmask used; /* Bitmask of cursors used by this plan */
102979 ** Return the bitmask for the given cursor number. Return 0 if
102982 static Bitmask getMask(WhereMaskSet *pMaskSet, int iCursor){
102984 assert( pMaskSet->n<=(int)sizeof(Bitmask)*8 );
102987 return ((Bitmask)1)<<i;
103008 ** a bitmask indicating which tables are used in that expression
103017 ** translate the cursor numbers into bitmask values and OR all
103020 static Bitmask exprListTableUsage(WhereMaskSet*, ExprList*);
103021 static Bitmask exprSelectTableUsage(WhereMaskSet*, Select*);
103022 static Bitmask exprTableUsage(WhereMaskSet *pMaskSet, Expr *p){
103023 Bitmask mask = 0;
103038 static Bitmask exprListTableUsage(WhereMaskSet *pMaskSet, ExprList *pList){
103040 Bitmask mask = 0;
103048 static Bitmask exprSelectTableUsage(WhereMaskSet *pMaskSet, Select *pS){
103049 Bitmask mask = 0;
103127 ** Translate from TK_xx operator to WO_xx bitmask.
103160 Bitmask notReady, /* RHS must not overlap with this mask */
103449 Bitmask chngToIN; /* Tables that might satisfy case 1 */
103450 Bitmask indexable; /* Tables that are indexable, satisfying case 2 */
103472 indexable = ~(Bitmask)0;
103485 Bitmask b = 0;
103509 Bitmask b;
103696 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
103697 Bitmask prereqAll; /* Prerequesites of pExpr */
103698 Bitmask extraRight = 0; /* Extra dependencies on LEFT JOIN */
103728 Bitmask x = getMask(pMaskSet, pExpr->iRightJoinTable);
103901 Bitmask prereqColumn, prereqExpr;
103984 Bitmask allowed = ~getMask(pMaskSet, iBase);
104049 Bitmask mask = 0; /* Mask of unaccounted for pDistinct exprs */
104067 pTerm = findTerm(pWC, p->iTable, p->iColumn, ~(Bitmask)0, WO_EQ, 0);
104075 mask |= (((Bitmask)1) << i);
104081 mask &= ~(((Bitmask)1) << iExpr);
104135 if( 0==findTerm(pWC, iBase, iCol, ~(Bitmask)0, WO_EQ, pIdx)
104364 Bitmask, Bitmask, ExprList*, WhereCost*);
104377 Bitmask notReady, /* Mask of cursors not available for indexing */
104378 Bitmask notValid, /* Cursors not available for any purpose */
104384 const Bitmask maskSrc = getMask(pWC->pMaskSet, iCur); /* Bitmask for pSrc */
104409 Bitmask used = 0;
104471 Bitmask notReady /* Tables in outer loops of the join */
104496 Bitmask notReady, /* Mask of cursors that are not available */
104567 Bitmask notReady, /* Mask of cursors that are not available */
104585 Bitmask idxCols; /* Bitmap of columns used for indexing */
104586 Bitmask extraCols; /* Bitmap of additional columns */
104603 Bitmask cMask = iCol>=BMS ? ((Bitmask)1)<<(BMS-1) : ((Bitmask)1)<<iCol;
104623 extraCols = pSrc->colUsed & (~idxCols | (((Bitmask)1)<<(BMS-1)));
104628 if( extraCols & (((Bitmask)1)<<i) ) nColumn++;
104630 if( pSrc->colUsed & (((Bitmask)1)<<(BMS-1)) ){
104654 Bitmask cMask = iCol>=BMS ? ((Bitmask)1)<<(BMS-1) : ((Bitmask)1)<<iCol;
104670 if( extraCols & (((Bitmask)1)<<i) ){
104676 if( pSrc->colUsed & (((Bitmask)1)<<(BMS-1)) ){
104882 Bitmask notReady, /* Mask of cursors not available for index */
104883 Bitmask notValid, /* Cursors not valid for any purpose */
105445 Bitmask notReady, /* Mask of cursors not available for indexing */
105446 Bitmask notValid, /* Cursors not available for any purpose */
105518 Bitmask used = 0;
105687 Bitmask m = pSrc->colUsed;
105692 m &= ~(((Bitmask)1)<<x);
105824 Bitmask thisTab; /* Bitmap for pSrc */
105930 Bitmask notReady, /* Mask of cursors not available for indexing */
105931 Bitmask notValid, /* Cursors not available for any purpose */
106139 Bitmask notReady, /* Which parts of FROM have not yet been coded */
106369 static Bitmask codeOneLoopStart(
106373 Bitmask notReady /* Which tables are currently available */
107196 Bitmask notReady; /* Cursors that are not yet positioned */
107206 ** bits in a Bitmask
107225 ** field (type Bitmask) it must be aligned on an 8-byte boundary on
107269 /* Assign a bit from the bitmask to every term in the FROM clause.
107271 ** When assigning bitmask values to FROM clause cursors, it must be
107272 ** the case that if X is the bitmask for the N-th FROM clause term then
107273 ** the bitmask for all FROM clause terms to the left of the N-th term
107275 ** its Expr.iRightJoinTable value to find the bitmask of the right table
107276 ** of the join. Subtracting one from the right table bitmask gives a
107277 ** bitmask for all tables to the left of the join. Knowing the bitmask
107295 pWC->vmask |= ((Bitmask)1 << i);
107301 Bitmask toTheLeft = 0;
107303 Bitmask m = getMask(pMaskSet, pTabList->a[i].iCursor);
107344 notReady = ~(Bitmask)0;
107352 Bitmask m; /* Bitmask value for j or bestJ */
107355 Bitmask notIndexed; /* Mask of tables that cannot use an index */
107407 Bitmask mask; /* Mask of tables not yet ready */
107564 notReady = ~(Bitmask)0;
107592 Bitmask b = pTabItem->colUsed;
107627 notReady = ~(Bitmask)0;
115366 ** argument N is a bitmask of optimizations to be disabled. For normal
128966 u64 mCovered, /* Bitmask of phrases already covered */
128969 u64 *pmCover, /* OUT: Bitmask of phrases covered */
128970 u64 *pmHighlight /* OUT: Bitmask of terms to highlight */
129868 u64 mCovered = 0; /* Bitmask of phrases covered by snippet */
129869 u64 mSeen = 0; /* Bitmask of phrases seen by BestSnippet() */
