HomeSort by relevance Sort by last modified time
    Searched refs:Bitvec (Results 1 - 7 of 7) sorted by null

  /external/chromium_org/third_party/sqlite/src/src/
bitvec.c 31 ** 5 and 500 set operations per Bitvec object, though the number of sets can
33 ** Bitvec object is the number of pages in the database file at the
39 /* Size of the Bitvec structure in bytes. */
43 ** it will be aligned within the Bitvec struct. */
44 #define BITVEC_USIZE (((BITVEC_SZ-(3*sizeof(u32)))/sizeof(Bitvec*))*sizeof(Bitvec*))
69 #define BITVEC_NPTR (BITVEC_USIZE/sizeof(Bitvec *))
79 ** If iSize<=BITVEC_NBIT, then Bitvec.u.aBitmap[] is a straight
82 ** If iSize>BITVEC_NBIT and iDivisor==0 then Bitvec.u.aHash[] is
86 ** sub-bitmaps pointed to by Bitvec.u.apSub[]. Each subbitma
    [all...]
btreeInt.h 430 Bitvec *pHasContent; /* Set of pages moved to free-list this transaction */
sqliteInt.h 600 typedef struct Bitvec Bitvec;
    [all...]
test_journal.c 123 Bitvec *pWritable; /* Bitvec of pages that may be written to the file */
380 ** leaf to the jt_file.pWritable bitvec.
427 ** page in the journal to the Bitvec object passed as the second argument.
601 ** jt_file.pWritable bitvec of the main database file associated with
607 /* Set the bitvec values */
pager.c 448 Bitvec *pInSavepoint; /* Set of pages in this savepoint */
648 Bitvec *pInJournal; /* One bit for each page in the database file */
    [all...]
btree.c 491 ** Set bit pgno of the BtShared.pHasContent bitvec. This is called
495 ** The BtShared.pHasContent bitvec exists to work around an obscure
518 ** The solution is the BtShared.pHasContent bitvec. Whenever a page is
520 ** set in the bitvec. Whenever a leaf page is extracted from the free-list,
522 ** set in BtShared.pHasContent. The contents of the bitvec are cleared
548 Bitvec *p = pBt->pHasContent;
553 ** Clear (destroy) the BtShared.pHasContent bitvec. This should be
    [all...]
  /external/chromium_org/third_party/sqlite/amalgamation/
sqlite3.c     [all...]

Completed in 622 milliseconds