Lines Matching defs:usable
4723 ** aConstraint[].iColumn.)^ ^(aConstraint[].usable is TRUE if the
4725 ** is usable) and false if it cannot.)^
4763 unsigned char usable; /* True if this constraint is usable */
14234 u8 *zByte; /* Memory usable by this allocator */
30588 /* Step 5. If a usable page buffer has still not been found,
36671 ** The max embedded payload fraction is the amount of the total usable
36996 u16 usableSize; /* Number of usable bytes on each page */
37121 ** database page. The first argument to each is the number of usable
38618 int usableSize; /* Number of usable bytes on a page */
38942 u16 usableSize; /* Amount of usable space on each page */
39021 ** the cell-content area. If this is greater than the usable-size
59075 ** usable by indices within the WHERE clause processing logic.
72806 if( i==nCol ) break; /* pIdx is usable */
88029 p->aConstraint[i].usable);
88084 /* Search the WHERE clause terms for a usable WO_OR term. */
88290 if( !p->aConstraint[i].usable && p->aConstraintUsage[i].argvIndex>0 ){
88365 /* Set the aConstraint[].usable fields and initialize all
88368 ** aConstraint[].usable is true for constraints where the right-hand
88382 ** join might be different so we have to recompute the usable flag
88390 pIdxCons->usable = (pTerm->prereqRight¬Ready) ? 0 : 1;
89877 /* Case 5: There is no usable index. We must do a complete
99171 if( pCons->usable==0 ) continue;
108354 if( p->usable && p->iColumn==0 && p->op==SQLITE_INDEX_CONSTRAINT_EQ ){
108374 if( p->usable && p->iColumn>0 ){