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 */
25058 ** Allowed values for the unixFile.ctrlFlags bitmask:
42717 ** The vfsFlags parameter is a bitmask to pass to the flags parameter
51054 ** The "flags" parameter is a bitmask that might contain bits like
60503 ** The p->btreeMask field is a bitmask of all btrees that the prepared
66223 ** P1 is a 32-bit bitmask indicating whether or not each argument to the
73536 ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes
73538 ** column number is greater than the number of bits in the bitmask
73539 ** then set the high-order bit of the bitmask.
73548 pMatch->colUsed |= ((Bitmask)1)<<n;
73592 pItem->colUsed |= ((Bitmask)1)<<(iCol>=BMS ? BMS-1 : iCol);
100386 ** This function returns a 32-bit bitmask indicating which columns of the
102592 ** the <op> using a bitmask encoding defined by WO_xxx below. The
102593 ** use of a bitmask encoding for the operator allows us to search
102613 ** bits that will fit in a Bitmask. The VDBE cursor numbers might be
102618 ** bits in the Bitmask. So, in the example above, the cursor numbers
102639 Bitmask prereqRight; /* Bitmask of tables used by pExpr->pRight */
102640 Bitmask prereqAll; /* Bitmask of tables referenced by pExpr */
102674 Bitmask vmask; /* Bitmask identifying virtual table cursors */
102694 Bitmask indexable; /* Bitmask of all indexable tables in the clause */
102717 ** If WhereMaskSet.ix[A]==B it means that The A-th bit of a Bitmask
102718 ** corresponds VDBE cursor number B. The A-th bit of a bitmask is 1<<A.
102743 Bitmask used; /* Bitmask of cursors used by this plan */
102943 ** Return the bitmask for the given cursor number. Return 0 if
102946 static Bitmask getMask(WhereMaskSet *pMaskSet, int iCursor){
102948 assert( pMaskSet->n<=(int)sizeof(Bitmask)*8 );
102951 return ((Bitmask)1)<<i;
102972 ** a bitmask indicating which tables are used in that expression
102981 ** translate the cursor numbers into bitmask values and OR all
102984 static Bitmask exprListTableUsage(WhereMaskSet*, ExprList*);
102985 static Bitmask exprSelectTableUsage(WhereMaskSet*, Select*);
102986 static Bitmask exprTableUsage(WhereMaskSet *pMaskSet, Expr *p){
102987 Bitmask mask = 0;
103002 static Bitmask exprListTableUsage(WhereMaskSet *pMaskSet, ExprList *pList){
103004 Bitmask mask = 0;
103012 static Bitmask exprSelectTableUsage(WhereMaskSet *pMaskSet, Select *pS){
103013 Bitmask mask = 0;
103091 ** Translate from TK_xx operator to WO_xx bitmask.
103124 Bitmask notReady, /* RHS must not overlap with this mask */
103413 Bitmask chngToIN; /* Tables that might satisfy case 1 */
103414 Bitmask indexable; /* Tables that are indexable, satisfying case 2 */
103436 indexable = ~(Bitmask)0;
103449 Bitmask b = 0;
103473 Bitmask b;
103660 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
103661 Bitmask prereqAll; /* Prerequesites of pExpr */
103662 Bitmask extraRight = 0; /* Extra dependencies on LEFT JOIN */
103692 Bitmask x = getMask(pMaskSet, pExpr->iRightJoinTable);
103865 Bitmask prereqColumn, prereqExpr;
103948 Bitmask allowed = ~getMask(pMaskSet, iBase);
104013 Bitmask mask = 0; /* Mask of unaccounted for pDistinct exprs */
104031 pTerm = findTerm(pWC, p->iTable, p->iColumn, ~(Bitmask)0, WO_EQ, 0);
104039 mask |= (((Bitmask)1) << i);
104045 mask &= ~(((Bitmask)1) << iExpr);
104099 if( 0==findTerm(pWC, iBase, iCol, ~(Bitmask)0, WO_EQ, pIdx)
104328 Bitmask, Bitmask, ExprList*, WhereCost*);
104341 Bitmask notReady, /* Mask of cursors not available for indexing */
104342 Bitmask notValid, /* Cursors not available for any purpose */
104348 const Bitmask maskSrc = getMask(pWC->pMaskSet, iCur); /* Bitmask for pSrc */
104373 Bitmask used = 0;
104435 Bitmask notReady /* Tables in outer loops of the join */
104460 Bitmask notReady, /* Mask of cursors that are not available */
104531 Bitmask notReady, /* Mask of cursors that are not available */
104549 Bitmask idxCols; /* Bitmap of columns used for indexing */
104550 Bitmask extraCols; /* Bitmap of additional columns */
104567 Bitmask cMask = iCol>=BMS ? ((Bitmask)1)<<(BMS-1) : ((Bitmask)1)<<iCol;
104587 extraCols = pSrc->colUsed & (~idxCols | (((Bitmask)1)<<(BMS-1)));
104592 if( extraCols & (((Bitmask)1)<<i) ) nColumn++;
104594 if( pSrc->colUsed & (((Bitmask)1)<<(BMS-1)) ){
104618 Bitmask cMask = iCol>=BMS ? ((Bitmask)1)<<(BMS-1) : ((Bitmask)1)<<iCol;
104634 if( extraCols & (((Bitmask)1)<<i) ){
104640 if( pSrc->colUsed & (((Bitmask)1)<<(BMS-1)) ){
104846 Bitmask notReady, /* Mask of cursors not available for index */
104847 Bitmask notValid, /* Cursors not valid for any purpose */
105409 Bitmask notReady, /* Mask of cursors not available for indexing */
105410 Bitmask notValid, /* Cursors not available for any purpose */
105482 Bitmask used = 0;
105651 Bitmask m = pSrc->colUsed;
105656 m &= ~(((Bitmask)1)<<x);
105788 Bitmask thisTab; /* Bitmap for pSrc */
105894 Bitmask notReady, /* Mask of cursors not available for indexing */
105895 Bitmask notValid, /* Cursors not available for any purpose */
106103 Bitmask notReady, /* Which parts of FROM have not yet been coded */
106333 static Bitmask codeOneLoopStart(
106337 Bitmask notReady /* Which tables are currently available */
107160 Bitmask notReady; /* Cursors that are not yet positioned */
107170 ** bits in a Bitmask
107189 ** field (type Bitmask) it must be aligned on an 8-byte boundary on
107233 /* Assign a bit from the bitmask to every term in the FROM clause.
107235 ** When assigning bitmask values to FROM clause cursors, it must be
107236 ** the case that if X is the bitmask for the N-th FROM clause term then
107237 ** the bitmask for all FROM clause terms to the left of the N-th term
107239 ** its Expr.iRightJoinTable value to find the bitmask of the right table
107240 ** of the join. Subtracting one from the right table bitmask gives a
107241 ** bitmask for all tables to the left of the join. Knowing the bitmask
107259 pWC->vmask |= ((Bitmask)1 << i);
107265 Bitmask toTheLeft = 0;
107267 Bitmask m = getMask(pMaskSet, pTabList->a[i].iCursor);
107308 notReady = ~(Bitmask)0;
107316 Bitmask m; /* Bitmask value for j or bestJ */
107319 Bitmask notIndexed; /* Mask of tables that cannot use an index */
107371 Bitmask mask; /* Mask of tables not yet ready */
107528 notReady = ~(Bitmask)0;
107556 Bitmask b = pTabItem->colUsed;
107591 notReady = ~(Bitmask)0;
115330 ** argument N is a bitmask of optimizations to be disabled. For normal
128918 u64 mCovered, /* Bitmask of phrases already covered */
128921 u64 *pmCover, /* OUT: Bitmask of phrases covered */
128922 u64 *pmHighlight /* OUT: Bitmask of terms to highlight */
129820 u64 mCovered = 0; /* Bitmask of phrases covered by snippet */
129821 u64 mSeen = 0; /* Bitmask of phrases seen by BestSnippet() */
