Home | History | Annotate | Download | only in dist

Lines Matching defs:btreeMask

14206   yDbMask btreeMask;      /* Bitmask of db->aDb[] entries referenced */
14207 yDbMask lockMask; /* Subset of btreeMask that requires a lock */
62753 assert( p->bIsReader!=0 || DbMaskAllZero(p->btreeMask) );
62780 assert( DbMaskAllZero(p->btreeMask) );
63359 ** is maintained in p->btreeMask. The p->lockMask value is the subset of
63360 ** p->btreeMask of databases that will require a lock.
63364 assert( i<(int)sizeof(p->btreeMask)*8 );
63365 DbMaskSet(p->btreeMask, i);
63387 ** The p->btreeMask field is a bitmask of all btrees that the prepared
63388 ** statement p will ever use. Let N be the number of bits in p->btreeMask
71067 assert( DbMaskTest(p->btreeMask, pOp->p1) );
71162 assert( DbMaskTest(p->btreeMask, iDb) );
71183 assert( DbMaskTest(p->btreeMask, pOp->p1) );
71314 assert( DbMaskTest(p->btreeMask, iDb) );
72980 assert( DbMaskTest(p->btreeMask, iDb) );
73020 assert( DbMaskTest(p->btreeMask, pOp->p2) );
73090 assert( DbMaskTest(p->btreeMask, pOp->p1) );
73258 assert( DbMaskTest(p->btreeMask, pOp->p5) );
73914 assert( DbMaskTest(p->btreeMask, pOp->p1) );
73967 assert( DbMaskTest(p->btreeMask, p1) );
74417 if( DbMaskTest(p->btreeMask, i)==0 ) continue;