Lines Matching defs:Bitmask
8015 ** bitmask tests, testcase() can be used to make sure each bit
11522 ** The bitmask datatype defined below is used for various optimizations.
11528 typedef u64 Bitmask;
11531 ** The number of bits in a Bitmask. "BMS" means "BitMask Size".
11533 #define BMS ((int)(sizeof(Bitmask)*8))
11536 ** A bit in a Bitmask
11538 #define MASKBIT(n) (((Bitmask)1)<<(n))
11584 Bitmask colUsed; /* Bit N (1<<N) set if column N of pTab is used */
11873 ** The yDbMask datatype for the bitmask of all attached databases.
11947 yDbMask cookieMask; /* Bitmask of schema verified databases */
13145 ** the MEMTYPE_* macros defined below. The type must be a bitmask with
14206 yDbMask btreeMask; /* Bitmask of db->aDb[] entries referenced */
24306 ** Allowed values for the unixFile.ctrlFlags bitmask:
44753 ** The vfsFlags parameter is a bitmask to pass to the flags parameter
53277 ** The "flags" parameter is a bitmask that might contain bits like
63367 ** The p->btreeMask field is a bitmask of all btrees that the prepared
69497 ** P1 is a 32-bit bitmask indicating whether or not each argument to the
77246 ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes
77248 ** column number is greater than the number of bits in the bitmask
77249 ** then set the high-order bit of the bitmask.
77258 pMatch->colUsed |= ((Bitmask)1)<<n;
77304 pItem->colUsed |= ((Bitmask)1)<<(iCol>=BMS ? BMS-1 : iCol);
108130 ** This function returns a 32-bit bitmask indicating which columns of the
110537 Bitmask notReady; /* FROM entries not usable at this level */
110555 Bitmask prereq; /* Bitmask of other loops that must run first */
110556 Bitmask maskSelf; /* Bitmask identifying table iTab */
110594 Bitmask prereq; /* Prerequisites */
110632 Bitmask maskLoop; /* Bitmask of all WhereLoop objects in this path */
110633 Bitmask revLoop; /* aLoop[]s that should be reversed for ORDER BY */
110659 ** the <op> using a bitmask encoding defined by WO_xxx below. The
110660 ** use of a bitmask encoding for the operator allows us to search
110680 ** bits that will fit in a Bitmask. The VDBE cursor numbers might be
110685 ** bits in the Bitmask. So, in the example above, the cursor numbers
110706 Bitmask prereqRight; /* Bitmask of tables used by pExpr->pRight */
110707 Bitmask prereqAll; /* Bitmask of tables referenced by pExpr */
110774 Bitmask indexable; /* Bitmask of all indexable tables in the clause */
110797 ** If WhereMaskSet.ix[A]==B it means that The A-th bit of a Bitmask
110798 ** corresponds VDBE cursor number B. The A-th bit of a bitmask is 1<<A.
110848 Bitmask revMask; /* Mask of ORDER BY terms that need reversing */
110993 Bitmask prereq, /* Prerequisites of the new entry */
111167 ** Return the bitmask for the given cursor number. Return 0 if
111170 static Bitmask getMask(WhereMaskSet *pMaskSet, int iCursor){
111172 assert( pMaskSet->n<=(int)sizeof(Bitmask)*8 );
111196 ** a bitmask indicating which tables are used in that expression
111199 static Bitmask exprListTableUsage(WhereMaskSet*, ExprList*);
111200 static Bitmask exprSelectTableUsage(WhereMaskSet*, Select*);
111201 static Bitmask exprTableUsage(WhereMaskSet *pMaskSet, Expr *p){
111202 Bitmask mask = 0;
111217 static Bitmask exprListTableUsage(WhereMaskSet *pMaskSet, ExprList *pList){
111219 Bitmask mask = 0;
111227 static Bitmask exprSelectTableUsage(WhereMaskSet *pMaskSet, Select *pS){
111228 Bitmask mask = 0;
111307 ** Translate from TK_xx operator to WO_xx bitmask.
111484 Bitmask notReady, /* RHS must not overlap with this mask */
111749 Bitmask chngToIN; /* Tables that might satisfy case 1 */
111750 Bitmask indexable; /* Tables that are indexable, satisfying case 2 */
111772 indexable = ~(Bitmask)0;
111773 chngToIN = ~(Bitmask)0;
111784 Bitmask b = 0;
111808 Bitmask b;
111993 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
111994 Bitmask prereqAll; /* Prerequesites of pExpr */
111995 Bitmask extraRight = 0; /* Extra dependencies on LEFT JOIN */
112026 Bitmask x = getMask(pMaskSet, pExpr->iRightJoinTable);
112212 Bitmask prereqColumn, prereqExpr;
112370 if( 0==findTerm(pWC, iBase, iCol, ~(Bitmask)0, WO_EQ, pIdx) ){
112448 Bitmask notReady /* Tables in outer loops of the join */
112472 Bitmask notReady, /* Mask of cursors that are not available */
112490 Bitmask idxCols; /* Bitmap of columns used for indexing */
112491 Bitmask extraCols; /* Bitmap of additional columns */
112510 Bitmask cMask = iCol>=BMS ? MASKBIT(BMS-1) : MASKBIT(iCol);
112562 Bitmask cMask = iCol>=BMS ? MASKBIT(BMS-1) : MASKBIT(iCol);
113775 static Bitmask codeOneLoopStart(
113778 Bitmask notReady /* Which tables are currently available */
115106 Bitmask notAllowed = ~(pLoop->prereq|pLoop->maskSelf);
115163 Bitmask saved_prereq; /* Original value of pNew->prereq */
115429 ** Return a bitmask where 1s indicate that the corresponding column of
115432 static Bitmask columnsInIndex(Index *pIdx){
115433 Bitmask m = 0;
115496 Bitmask mExtra /* Extra prerequesites for using this table */
115628 Bitmask m;
115687 Bitmask mExtra
115853 static int whereLoopAddOr(WhereLoopBuilder *pBuilder, Bitmask mExtra){
115963 Bitmask mExtra = 0;
115964 Bitmask mPrior = 0;
116023 Bitmask *pRevMask /* OUT: Mask of WhereLoops to run in reverse order */
116044 Bitmask obSat = 0; /* Mask of ORDER BY terms satisfied so far */
116045 Bitmask obDone; /* Mask of all ORDER BY terms */
116046 Bitmask orderDistinctMask; /* Mask of all well-ordered loops */
116047 Bitmask ready; /* Mask of inner loops */
116233 Bitmask mTerm;
116247 Bitmask m = MASKBIT(i) - 1;
116445 Bitmask maskNew; /* Mask of src visited by (..) */
116446 Bitmask revMask = 0; /* Mask of rev-order loops for (..) */
116641 Bitmask notUsed;
116661 Bitmask notUsed = 0;
116865 Bitmask notReady; /* Cursors that are not yet positioned */
116891 ** bits in a Bitmask
116910 ** field (type Bitmask) it must be aligned on an 8-byte boundary on
116966 /* Assign a bit from the bitmask to every term in the FROM clause.
116968 ** When assigning bitmask values to FROM clause cursors, it must be
116969 ** the case that if X is the bitmask for the N-th FROM clause term then
116970 ** the bitmask for all FROM clause terms to the left of the N-th term
116972 ** its Expr.iRightJoinTable value to find the bitmask of the right table
116973 ** of the join. Subtracting one from the right table bitmask gives a
116974 ** bitmask for all tables to the left of the join. Knowing the bitmask
116987 Bitmask toTheLeft = 0;
116989 Bitmask m = getMask(pMaskSet, pTabList->a[ii].iCursor);
117062 pWInfo->revMask = (Bitmask)(-1);
117099 Bitmask tabUsed = exprListTableUsage(pMaskSet, pResultSet);
117145 notReady = ~(Bitmask)0;
117179 Bitmask b = pTabItem->colUsed;
117237 notReady = ~(Bitmask)0;
125426 ** argument N is a bitmask of optimizations to be disabled. For normal
142669 u64 mCovered, /* Bitmask of phrases already covered */
142672 u64 *pmCover, /* OUT: Bitmask of phrases covered */
142673 u64 *pmHighlight /* OUT: Bitmask of terms to highlight */
143589 u64 mCovered = 0; /* Bitmask of phrases covered by snippet */
143590 u64 mSeen = 0; /* Bitmask of phrases seen by BestSnippet() */
