Home | History | Annotate | Download | only in orig

Lines Matching refs:Bitmask

9085 ** bitmask tests, testcase() can be used to make sure each bit
12801 ** The bitmask datatype defined below is used for various optimizations.
12807 typedef u64 Bitmask;
12810 ** The number of bits in a Bitmask. "BMS" means "BitMask Size".
12812 #define BMS ((int)(sizeof(Bitmask)*8))
12815 ** A bit in a Bitmask
12817 #define MASKBIT(n) (((Bitmask)1)<<(n))
12867 Bitmask colUsed; /* Bit N (1<<N) set if column N of pTab is used */
13171 ** The yDbMask datatype for the bitmask of all attached databases.
13245 yDbMask cookieMask; /* Bitmask of schema verified databases */
14473 ** the MEMTYPE_* macros defined below. The type must be a bitmask with
15613 yDbMask btreeMask; /* Bitmask of db->aDb[] entries referenced */
26671 ** Allowed values for the unixFile.ctrlFlags bitmask:
47505 ** The vfsFlags parameter is a bitmask to pass to the flags parameter
56609 ** The "flags" parameter is a bitmask that might contain bits like
67922 ** The p->btreeMask field is a bitmask of all btrees that the prepared
74456 ** P1 is a 32-bit bitmask indicating whether or not each argument to the
74473 ** P1 is a 32-bit bitmask indicating whether or not each argument to the
83942 ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes
83944 ** column number is greater than the number of bits in the bitmask
83945 ** then set the high-order bit of the bitmask.
83954 pMatch->colUsed |= ((Bitmask)1)<<n;
84000 pItem->colUsed |= ((Bitmask)1)<<(iCol>=BMS ? BMS-1 : iCol);
115526 ** This function returns a 32-bit bitmask indicating which columns of the
118093 Bitmask notReady; /* FROM entries not usable at this level */
118114 Bitmask prereq; /* Bitmask of other loops that must run first */
118115 Bitmask maskSelf; /* Bitmask identifying table iTab */
118153 Bitmask prereq; /* Prerequisites */
118187 Bitmask maskLoop; /* Bitmask of all WhereLoop objects in this path */
118188 Bitmask revLoop; /* aLoop[]s that should be reversed for ORDER BY */
118214 ** the <op> using a bitmask encoding defined by WO_xxx below. The
118215 ** use of a bitmask encoding for the operator allows us to search
118235 ** bits that will fit in a Bitmask. The VDBE cursor numbers might be
118240 ** bits in the Bitmask. So, in the example above, the cursor numbers
118261 Bitmask prereqRight; /* Bitmask of tables used by pExpr->pRight */
118262 Bitmask prereqAll; /* Bitmask of tables referenced by pExpr */
118335 Bitmask indexable; /* Bitmask of all indexable tables in the clause */
118358 ** If WhereMaskSet.ix[A]==B it means that The A-th bit of a Bitmask
118359 ** corresponds VDBE cursor number B. The A-th bit of a bitmask is 1<<A.
118414 Bitmask revMask; /* Mask of ORDER BY terms that need reversing */
118438 SQLITE_PRIVATE Bitmask sqlite3WhereGetMask(WhereMaskSet*,int);
118443 Bitmask notReady, /* RHS must not overlap with this mask */
118471 SQLITE_PRIVATE Bitmask sqlite3WhereCodeOneLoopStart(
118474 Bitmask notReady /* Which tables are currently available */
118481 SQLITE_PRIVATE Bitmask sqlite3WhereExprUsage(WhereMaskSet*, Expr*);
118482 SQLITE_PRIVATE Bitmask sqlite3WhereExprListUsage(WhereMaskSet*, ExprList*);
119116 SQLITE_PRIVATE Bitmask sqlite3WhereCodeOneLoopStart(
119119 Bitmask notReady /* Which tables are currently available */
120184 ** Translate from TK_xx operator to WO_xx bitmask.
120536 Bitmask chngToIN; /* Tables that might satisfy case 1 */
120537 Bitmask indexable; /* Tables that are indexable, satisfying case 2 */
120559 indexable = ~(Bitmask)0;
120560 chngToIN = ~(Bitmask)0;
120571 Bitmask b = 0;
120595 Bitmask b;
120809 ** a bitmask indicating which tables are used in that expression
120812 static Bitmask exprSelectUsage(WhereMaskSet *pMaskSet, Select *pS){
120813 Bitmask mask = 0;
120847 Bitmask mPrereq, /* Bitmask of FROM clause terms referenced by pExpr */
120905 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
120906 Bitmask prereqAll; /* Prerequesites of pExpr */
120907 Bitmask extraRight = 0; /* Extra dependencies on LEFT JOIN */
120938 Bitmask x = sqlite3WhereGetMask(pMaskSet, pExpr->iRightJoinTable);
121141 Bitmask prereqColumn, prereqExpr;
121284 ** a bitmask indicating which tables are used in that expression
121287 SQLITE_PRIVATE Bitmask sqlite3WhereExprUsage(WhereMaskSet *pMaskSet, Expr *p){
121288 Bitmask mask = 0;
121303 SQLITE_PRIVATE Bitmask sqlite3WhereExprListUsage(WhereMaskSet *pMaskSet, ExprList *pList){
121305 Bitmask mask = 0;
121491 Bitmask prereq, /* Prerequisites of the new entry */
121523 ** Return the bitmask for the given cursor number. Return 0 if
121526 SQLITE_PRIVATE Bitmask sqlite3WhereGetMask(WhereMaskSet *pMaskSet, int iCursor){
121528 assert( pMaskSet->n<=(int)sizeof(Bitmask)*8 );
121711 Bitmask notReady, /* RHS must not overlap with this mask */
121836 if( 0==sqlite3WhereFindTerm(pWC, iBase, i, ~(Bitmask)0, WO_EQ, pIdx) ){
121955 Bitmask notReady /* Tables in outer loops of the join */
121980 Bitmask notReady, /* Mask of cursors that are not available */
121998 Bitmask idxCols; /* Bitmap of columns used for indexing */
121999 Bitmask extraCols; /* Bitmap of additional columns */
122034 Bitmask cMask = iCol>=BMS ? MASKBIT(BMS-1) : MASKBIT(iCol);
122087 Bitmask cMask = iCol>=BMS ? MASKBIT(BMS-1) : MASKBIT(iCol);
122184 Bitmask mUnusable, /* Ignore terms with these prereqs */
123476 Bitmask notAllowed = ~(pLoop->prereq|pLoop->maskSelf);
123551 Bitmask saved_prereq; /* Original value of pNew->prereq */
123851 ** Return a bitmask where 1s indicate that the corresponding column of
123854 static Bitmask columnsInIndex(Index *pIdx){
123855 Bitmask m = 0;
123927 Bitmask mExtra /* Extra prerequesites for using this table */
124068 Bitmask m;
124148 Bitmask mExtra, /* Tables that must be scanned before this one */
124149 Bitmask mUnusable /* Tables that must be scanned after this one */
124328 Bitmask mExtra,
124329 Bitmask mUnusable
124453 Bitmask mExtra = 0;
124454 Bitmask mPrior = 0;
124468 Bitmask mUnusable = 0;
124523 Bitmask *pRevMask /* OUT: Mask of WhereLoops to run in reverse order */
124544 Bitmask obSat = 0; /* Mask of ORDER BY terms satisfied so far */
124545 Bitmask obDone; /* Mask of all ORDER BY terms */
124546 Bitmask orderDistinctMask; /* Mask of all well-ordered loops */
124547 Bitmask ready; /* Mask of inner loops */
124741 Bitmask mTerm;
124755 Bitmask m = MASKBIT(i) - 1;
124953 Bitmask maskNew; /* Mask of src visited by (..) */
124954 Bitmask revMask = 0; /* Mask of rev-order loops for (..) */
125149 Bitmask notUsed;
125169 Bitmask revMask = 0;
125379 Bitmask notReady; /* Cursors that are not yet positioned */
125409 ** bits in a Bitmask
125428 ** field (type Bitmask) it must be aligned on an 8-byte boundary on
125485 /* Assign a bit from the bitmask to every term in the FROM clause.
125487 ** The N-th term of the FROM clause is assigned a bitmask of 1<<N.
125489 ** The rule of the previous sentence ensures thta if X is the bitmask for
125490 ** a table T, then X-1 is the bitmask for all other tables to the left of T.
125491 ** Knowing the bitmask for all tables to the left of a left join is
125505 Bitmask m = sqlite3WhereGetMask(pMaskSet, pTabList->a[ii].iCursor);
125562 pWInfo->revMask = (Bitmask)(-1);
125598 Bitmask tabUsed = sqlite3WhereExprListUsage(pMaskSet, pResultSet);
125684 Bitmask b = pTabItem->colUsed;
125766 notReady = ~(Bitmask)0;
134390 ** argument N is a bitmask of optimizations to be disabled. For normal
151980 u64 mCovered, /* Bitmask of phrases already covered */
151983 u64 *pmCover, /* OUT: Bitmask of phrases covered */
151984 u64 *pmHighlight /* OUT: Bitmask of terms to highlight */
152996 u64 mCovered = 0; /* Bitmask of phrases covered by snippet */
152997 u64 mSeen = 0; /* Bitmask of phrases seen by BestSnippet() */