1 /* 2 ** 2004 April 6 3 ** 4 ** The author disclaims copyright to this source code. In place of 5 ** a legal notice, here is a blessing: 6 ** 7 ** May you do good and not evil. 8 ** May you find forgiveness for yourself and forgive others. 9 ** May you share freely, never taking more than you give. 10 ** 11 ************************************************************************* 12 ** $Id: btreeInt.h,v 1.42 2009/02/03 16:51:25 danielk1977 Exp $ 13 ** 14 ** This file implements a external (disk-based) database using BTrees. 15 ** For a detailed discussion of BTrees, refer to 16 ** 17 ** Donald E. Knuth, THE ART OF COMPUTER PROGRAMMING, Volume 3: 18 ** "Sorting And Searching", pages 473-480. Addison-Wesley 19 ** Publishing Company, Reading, Massachusetts. 20 ** 21 ** The basic idea is that each page of the file contains N database 22 ** entries and N+1 pointers to subpages. 23 ** 24 ** ---------------------------------------------------------------- 25 ** | Ptr(0) | Key(0) | Ptr(1) | Key(1) | ... | Key(N-1) | Ptr(N) | 26 ** ---------------------------------------------------------------- 27 ** 28 ** All of the keys on the page that Ptr(0) points to have values less 29 ** than Key(0). All of the keys on page Ptr(1) and its subpages have 30 ** values greater than Key(0) and less than Key(1). All of the keys 31 ** on Ptr(N) and its subpages have values greater than Key(N-1). And 32 ** so forth. 33 ** 34 ** Finding a particular key requires reading O(log(M)) pages from the 35 ** disk where M is the number of entries in the tree. 36 ** 37 ** In this implementation, a single file can hold one or more separate 38 ** BTrees. Each BTree is identified by the index of its root page. The 39 ** key and data for any entry are combined to form the "payload". A 40 ** fixed amount of payload can be carried directly on the database 41 ** page. If the payload is larger than the preset amount then surplus 42 ** bytes are stored on overflow pages. The payload for an entry 43 ** and the preceding pointer are combined to form a "Cell". Each 44 ** page has a small header which contains the Ptr(N) pointer and other 45 ** information such as the size of key and data. 46 ** 47 ** FORMAT DETAILS 48 ** 49 ** The file is divided into pages. The first page is called page 1, 50 ** the second is page 2, and so forth. A page number of zero indicates 51 ** "no such page". The page size can be anything between 512 and 65536. 52 ** Each page can be either a btree page, a freelist page or an overflow 53 ** page. 54 ** 55 ** The first page is always a btree page. The first 100 bytes of the first 56 ** page contain a special header (the "file header") that describes the file. 57 ** The format of the file header is as follows: 58 ** 59 ** OFFSET SIZE DESCRIPTION 60 ** 0 16 Header string: "SQLite format 3\000" 61 ** 16 2 Page size in bytes. 62 ** 18 1 File format write version 63 ** 19 1 File format read version 64 ** 20 1 Bytes of unused space at the end of each page 65 ** 21 1 Max embedded payload fraction 66 ** 22 1 Min embedded payload fraction 67 ** 23 1 Min leaf payload fraction 68 ** 24 4 File change counter 69 ** 28 4 Reserved for future use 70 ** 32 4 First freelist page 71 ** 36 4 Number of freelist pages in the file 72 ** 40 60 15 4-byte meta values passed to higher layers 73 ** 74 ** All of the integer values are big-endian (most significant byte first). 75 ** 76 ** The file change counter is incremented when the database is changed 77 ** This counter allows other processes to know when the file has changed 78 ** and thus when they need to flush their cache. 79 ** 80 ** The max embedded payload fraction is the amount of the total usable 81 ** space in a page that can be consumed by a single cell for standard 82 ** B-tree (non-LEAFDATA) tables. A value of 255 means 100%. The default 83 ** is to limit the maximum cell size so that at least 4 cells will fit 84 ** on one page. Thus the default max embedded payload fraction is 64. 85 ** 86 ** If the payload for a cell is larger than the max payload, then extra 87 ** payload is spilled to overflow pages. Once an overflow page is allocated, 88 ** as many bytes as possible are moved into the overflow pages without letting 89 ** the cell size drop below the min embedded payload fraction. 90 ** 91 ** The min leaf payload fraction is like the min embedded payload fraction 92 ** except that it applies to leaf nodes in a LEAFDATA tree. The maximum 93 ** payload fraction for a LEAFDATA tree is always 100% (or 255) and it 94 ** not specified in the header. 95 ** 96 ** Each btree pages is divided into three sections: The header, the 97 ** cell pointer array, and the cell content area. Page 1 also has a 100-byte 98 ** file header that occurs before the page header. 99 ** 100 ** |----------------| 101 ** | file header | 100 bytes. Page 1 only. 102 ** |----------------| 103 ** | page header | 8 bytes for leaves. 12 bytes for interior nodes 104 ** |----------------| 105 ** | cell pointer | | 2 bytes per cell. Sorted order. 106 ** | array | | Grows downward 107 ** | | v 108 ** |----------------| 109 ** | unallocated | 110 ** | space | 111 ** |----------------| ^ Grows upwards 112 ** | cell content | | Arbitrary order interspersed with freeblocks. 113 ** | area | | and free space fragments. 114 ** |----------------| 115 ** 116 ** The page headers looks like this: 117 ** 118 ** OFFSET SIZE DESCRIPTION 119 ** 0 1 Flags. 1: intkey, 2: zerodata, 4: leafdata, 8: leaf 120 ** 1 2 byte offset to the first freeblock 121 ** 3 2 number of cells on this page 122 ** 5 2 first byte of the cell content area 123 ** 7 1 number of fragmented free bytes 124 ** 8 4 Right child (the Ptr(N) value). Omitted on leaves. 125 ** 126 ** The flags define the format of this btree page. The leaf flag means that 127 ** this page has no children. The zerodata flag means that this page carries 128 ** only keys and no data. The intkey flag means that the key is a integer 129 ** which is stored in the key size entry of the cell header rather than in 130 ** the payload area. 131 ** 132 ** The cell pointer array begins on the first byte after the page header. 133 ** The cell pointer array contains zero or more 2-byte numbers which are 134 ** offsets from the beginning of the page to the cell content in the cell 135 ** content area. The cell pointers occur in sorted order. The system strives 136 ** to keep free space after the last cell pointer so that new cells can 137 ** be easily added without having to defragment the page. 138 ** 139 ** Cell content is stored at the very end of the page and grows toward the 140 ** beginning of the page. 141 ** 142 ** Unused space within the cell content area is collected into a linked list of 143 ** freeblocks. Each freeblock is at least 4 bytes in size. The byte offset 144 ** to the first freeblock is given in the header. Freeblocks occur in 145 ** increasing order. Because a freeblock must be at least 4 bytes in size, 146 ** any group of 3 or fewer unused bytes in the cell content area cannot 147 ** exist on the freeblock chain. A group of 3 or fewer free bytes is called 148 ** a fragment. The total number of bytes in all fragments is recorded. 149 ** in the page header at offset 7. 150 ** 151 ** SIZE DESCRIPTION 152 ** 2 Byte offset of the next freeblock 153 ** 2 Bytes in this freeblock 154 ** 155 ** Cells are of variable length. Cells are stored in the cell content area at 156 ** the end of the page. Pointers to the cells are in the cell pointer array 157 ** that immediately follows the page header. Cells is not necessarily 158 ** contiguous or in order, but cell pointers are contiguous and in order. 159 ** 160 ** Cell content makes use of variable length integers. A variable 161 ** length integer is 1 to 9 bytes where the lower 7 bits of each 162 ** byte are used. The integer consists of all bytes that have bit 8 set and 163 ** the first byte with bit 8 clear. The most significant byte of the integer 164 ** appears first. A variable-length integer may not be more than 9 bytes long. 165 ** As a special case, all 8 bytes of the 9th byte are used as data. This 166 ** allows a 64-bit integer to be encoded in 9 bytes. 167 ** 168 ** 0x00 becomes 0x00000000 169 ** 0x7f becomes 0x0000007f 170 ** 0x81 0x00 becomes 0x00000080 171 ** 0x82 0x00 becomes 0x00000100 172 ** 0x80 0x7f becomes 0x0000007f 173 ** 0x8a 0x91 0xd1 0xac 0x78 becomes 0x12345678 174 ** 0x81 0x81 0x81 0x81 0x01 becomes 0x10204081 175 ** 176 ** Variable length integers are used for rowids and to hold the number of 177 ** bytes of key and data in a btree cell. 178 ** 179 ** The content of a cell looks like this: 180 ** 181 ** SIZE DESCRIPTION 182 ** 4 Page number of the left child. Omitted if leaf flag is set. 183 ** var Number of bytes of data. Omitted if the zerodata flag is set. 184 ** var Number of bytes of key. Or the key itself if intkey flag is set. 185 ** * Payload 186 ** 4 First page of the overflow chain. Omitted if no overflow 187 ** 188 ** Overflow pages form a linked list. Each page except the last is completely 189 ** filled with data (pagesize - 4 bytes). The last page can have as little 190 ** as 1 byte of data. 191 ** 192 ** SIZE DESCRIPTION 193 ** 4 Page number of next overflow page 194 ** * Data 195 ** 196 ** Freelist pages come in two subtypes: trunk pages and leaf pages. The 197 ** file header points to the first in a linked list of trunk page. Each trunk 198 ** page points to multiple leaf pages. The content of a leaf page is 199 ** unspecified. A trunk page looks like this: 200 ** 201 ** SIZE DESCRIPTION 202 ** 4 Page number of next trunk page 203 ** 4 Number of leaf pointers on this page 204 ** * zero or more pages numbers of leaves 205 */ 206 #include "sqliteInt.h" 207 208 /* Round up a number to the next larger multiple of 8. This is used 209 ** to force 8-byte alignment on 64-bit architectures. 210 */ 211 #define ROUND8(x) ((x+7)&~7) 212 213 214 /* The following value is the maximum cell size assuming a maximum page 215 ** size give above. 216 */ 217 #define MX_CELL_SIZE(pBt) (pBt->pageSize-8) 218 219 /* The maximum number of cells on a single page of the database. This 220 ** assumes a minimum cell size of 6 bytes (4 bytes for the cell itself 221 ** plus 2 bytes for the index to the cell in the page header). Such 222 ** small cells will be rare, but they are possible. 223 */ 224 #define MX_CELL(pBt) ((pBt->pageSize-8)/6) 225 226 /* Forward declarations */ 227 typedef struct MemPage MemPage; 228 typedef struct BtLock BtLock; 229 230 /* 231 ** This is a magic string that appears at the beginning of every 232 ** SQLite database in order to identify the file as a real database. 233 ** 234 ** You can change this value at compile-time by specifying a 235 ** -DSQLITE_FILE_HEADER="..." on the compiler command-line. The 236 ** header must be exactly 16 bytes including the zero-terminator so 237 ** the string itself should be 15 characters long. If you change 238 ** the header, then your custom library will not be able to read 239 ** databases generated by the standard tools and the standard tools 240 ** will not be able to read databases created by your custom library. 241 */ 242 #ifndef SQLITE_FILE_HEADER /* 123456789 123456 */ 243 # define SQLITE_FILE_HEADER "SQLite format 3" 244 #endif 245 246 /* 247 ** Page type flags. An ORed combination of these flags appear as the 248 ** first byte of on-disk image of every BTree page. 249 */ 250 #define PTF_INTKEY 0x01 251 #define PTF_ZERODATA 0x02 252 #define PTF_LEAFDATA 0x04 253 #define PTF_LEAF 0x08 254 255 /* 256 ** As each page of the file is loaded into memory, an instance of the following 257 ** structure is appended and initialized to zero. This structure stores 258 ** information about the page that is decoded from the raw file page. 259 ** 260 ** The pParent field points back to the parent page. This allows us to 261 ** walk up the BTree from any leaf to the root. Care must be taken to 262 ** unref() the parent page pointer when this page is no longer referenced. 263 ** The pageDestructor() routine handles that chore. 264 ** 265 ** Access to all fields of this structure is controlled by the mutex 266 ** stored in MemPage.pBt->mutex. 267 */ 268 struct MemPage { 269 u8 isInit; /* True if previously initialized. MUST BE FIRST! */ 270 u8 nOverflow; /* Number of overflow cell bodies in aCell[] */ 271 u8 intKey; /* True if intkey flag is set */ 272 u8 leaf; /* True if leaf flag is set */ 273 u8 hasData; /* True if this page stores data */ 274 u8 hdrOffset; /* 100 for page 1. 0 otherwise */ 275 u8 childPtrSize; /* 0 if leaf==1. 4 if leaf==0 */ 276 u16 maxLocal; /* Copy of BtShared.maxLocal or BtShared.maxLeaf */ 277 u16 minLocal; /* Copy of BtShared.minLocal or BtShared.minLeaf */ 278 u16 cellOffset; /* Index in aData of first cell pointer */ 279 u16 nFree; /* Number of free bytes on the page */ 280 u16 nCell; /* Number of cells on this page, local and ovfl */ 281 u16 maskPage; /* Mask for page offset */ 282 struct _OvflCell { /* Cells that will not fit on aData[] */ 283 u8 *pCell; /* Pointers to the body of the overflow cell */ 284 u16 idx; /* Insert this cell before idx-th non-overflow cell */ 285 } aOvfl[5]; 286 BtShared *pBt; /* Pointer to BtShared that this page is part of */ 287 u8 *aData; /* Pointer to disk image of the page data */ 288 DbPage *pDbPage; /* Pager page handle */ 289 Pgno pgno; /* Page number for this page */ 290 }; 291 292 /* 293 ** The in-memory image of a disk page has the auxiliary information appended 294 ** to the end. EXTRA_SIZE is the number of bytes of space needed to hold 295 ** that extra information. 296 */ 297 #define EXTRA_SIZE sizeof(MemPage) 298 299 /* A Btree handle 300 ** 301 ** A database connection contains a pointer to an instance of 302 ** this object for every database file that it has open. This structure 303 ** is opaque to the database connection. The database connection cannot 304 ** see the internals of this structure and only deals with pointers to 305 ** this structure. 306 ** 307 ** For some database files, the same underlying database cache might be 308 ** shared between multiple connections. In that case, each contection 309 ** has it own pointer to this object. But each instance of this object 310 ** points to the same BtShared object. The database cache and the 311 ** schema associated with the database file are all contained within 312 ** the BtShared object. 313 ** 314 ** All fields in this structure are accessed under sqlite3.mutex. 315 ** The pBt pointer itself may not be changed while there exists cursors 316 ** in the referenced BtShared that point back to this Btree since those 317 ** cursors have to do go through this Btree to find their BtShared and 318 ** they often do so without holding sqlite3.mutex. 319 */ 320 struct Btree { 321 sqlite3 *db; /* The database connection holding this btree */ 322 BtShared *pBt; /* Sharable content of this btree */ 323 u8 inTrans; /* TRANS_NONE, TRANS_READ or TRANS_WRITE */ 324 u8 sharable; /* True if we can share pBt with another db */ 325 u8 locked; /* True if db currently has pBt locked */ 326 int wantToLock; /* Number of nested calls to sqlite3BtreeEnter() */ 327 int nBackup; /* Number of backup operations reading this btree */ 328 Btree *pNext; /* List of other sharable Btrees from the same db */ 329 Btree *pPrev; /* Back pointer of the same list */ 330 }; 331 332 /* 333 ** Btree.inTrans may take one of the following values. 334 ** 335 ** If the shared-data extension is enabled, there may be multiple users 336 ** of the Btree structure. At most one of these may open a write transaction, 337 ** but any number may have active read transactions. 338 */ 339 #define TRANS_NONE 0 340 #define TRANS_READ 1 341 #define TRANS_WRITE 2 342 343 /* 344 ** An instance of this object represents a single database file. 345 ** 346 ** A single database file can be in use as the same time by two 347 ** or more database connections. When two or more connections are 348 ** sharing the same database file, each connection has it own 349 ** private Btree object for the file and each of those Btrees points 350 ** to this one BtShared object. BtShared.nRef is the number of 351 ** connections currently sharing this database file. 352 ** 353 ** Fields in this structure are accessed under the BtShared.mutex 354 ** mutex, except for nRef and pNext which are accessed under the 355 ** global SQLITE_MUTEX_STATIC_MASTER mutex. The pPager field 356 ** may not be modified once it is initially set as long as nRef>0. 357 ** The pSchema field may be set once under BtShared.mutex and 358 ** thereafter is unchanged as long as nRef>0. 359 */ 360 struct BtShared { 361 Pager *pPager; /* The page cache */ 362 sqlite3 *db; /* Database connection currently using this Btree */ 363 BtCursor *pCursor; /* A list of all open cursors */ 364 MemPage *pPage1; /* First page of the database */ 365 u8 inStmt; /* True if we are in a statement subtransaction */ 366 u8 readOnly; /* True if the underlying file is readonly */ 367 u8 pageSizeFixed; /* True if the page size can no longer be changed */ 368 #ifndef SQLITE_OMIT_AUTOVACUUM 369 u8 autoVacuum; /* True if auto-vacuum is enabled */ 370 u8 incrVacuum; /* True if incr-vacuum is enabled */ 371 #endif 372 u16 pageSize; /* Total number of bytes on a page */ 373 u16 usableSize; /* Number of usable bytes on each page */ 374 u16 maxLocal; /* Maximum local payload in non-LEAFDATA tables */ 375 u16 minLocal; /* Minimum local payload in non-LEAFDATA tables */ 376 u16 maxLeaf; /* Maximum local payload in a LEAFDATA table */ 377 u16 minLeaf; /* Minimum local payload in a LEAFDATA table */ 378 u8 inTransaction; /* Transaction state */ 379 int nTransaction; /* Number of open transactions (read + write) */ 380 void *pSchema; /* Pointer to space allocated by sqlite3BtreeSchema() */ 381 void (*xFreeSchema)(void*); /* Destructor for BtShared.pSchema */ 382 sqlite3_mutex *mutex; /* Non-recursive mutex required to access this struct */ 383 Bitvec *pHasContent; /* Set of pages moved to free-list this transaction */ 384 #ifndef SQLITE_OMIT_SHARED_CACHE 385 int nRef; /* Number of references to this structure */ 386 BtShared *pNext; /* Next on a list of sharable BtShared structs */ 387 BtLock *pLock; /* List of locks held on this shared-btree struct */ 388 Btree *pExclusive; /* Btree with an EXCLUSIVE lock on the whole db */ 389 #endif 390 u8 *pTmpSpace; /* BtShared.pageSize bytes of space for tmp use */ 391 }; 392 393 /* 394 ** An instance of the following structure is used to hold information 395 ** about a cell. The parseCellPtr() function fills in this structure 396 ** based on information extract from the raw disk page. 397 */ 398 typedef struct CellInfo CellInfo; 399 struct CellInfo { 400 u8 *pCell; /* Pointer to the start of cell content */ 401 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ 402 u32 nData; /* Number of bytes of data */ 403 u32 nPayload; /* Total amount of payload */ 404 u16 nHeader; /* Size of the cell content header in bytes */ 405 u16 nLocal; /* Amount of payload held locally */ 406 u16 iOverflow; /* Offset to overflow page number. Zero if no overflow */ 407 u16 nSize; /* Size of the cell content on the main b-tree page */ 408 }; 409 410 /* 411 ** Maximum depth of an SQLite B-Tree structure. Any B-Tree deeper than 412 ** this will be declared corrupt. This value is calculated based on a 413 ** maximum database size of 2^31 pages a minimum fanout of 2 for a 414 ** root-node and 3 for all other internal nodes. 415 ** 416 ** If a tree that appears to be taller than this is encountered, it is 417 ** assumed that the database is corrupt. 418 */ 419 #define BTCURSOR_MAX_DEPTH 20 420 421 /* 422 ** A cursor is a pointer to a particular entry within a particular 423 ** b-tree within a database file. 424 ** 425 ** The entry is identified by its MemPage and the index in 426 ** MemPage.aCell[] of the entry. 427 ** 428 ** When a single database file can shared by two more database connections, 429 ** but cursors cannot be shared. Each cursor is associated with a 430 ** particular database connection identified BtCursor.pBtree.db. 431 ** 432 ** Fields in this structure are accessed under the BtShared.mutex 433 ** found at self->pBt->mutex. 434 */ 435 struct BtCursor { 436 Btree *pBtree; /* The Btree to which this cursor belongs */ 437 BtShared *pBt; /* The BtShared this cursor points to */ 438 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */ 439 struct KeyInfo *pKeyInfo; /* Argument passed to comparison function */ 440 Pgno pgnoRoot; /* The root page of this tree */ 441 CellInfo info; /* A parse of the cell we are pointing at */ 442 u8 wrFlag; /* True if writable */ 443 u8 atLast; /* Cursor pointing to the last entry */ 444 u8 validNKey; /* True if info.nKey is valid */ 445 u8 eState; /* One of the CURSOR_XXX constants (see below) */ 446 void *pKey; /* Saved key that was cursor's last known position */ 447 i64 nKey; /* Size of pKey, or last integer key */ 448 int skip; /* (skip<0) -> Prev() is a no-op. (skip>0) -> Next() is */ 449 #ifndef SQLITE_OMIT_INCRBLOB 450 u8 isIncrblobHandle; /* True if this cursor is an incr. io handle */ 451 Pgno *aOverflow; /* Cache of overflow page locations */ 452 #endif 453 #ifndef NDEBUG 454 u8 pagesShuffled; /* True if Btree pages are rearranged by balance()*/ 455 #endif 456 i16 iPage; /* Index of current page in apPage */ 457 MemPage *apPage[BTCURSOR_MAX_DEPTH]; /* Pages from root to current page */ 458 u16 aiIdx[BTCURSOR_MAX_DEPTH]; /* Current index in apPage[i] */ 459 }; 460 461 /* 462 ** Potential values for BtCursor.eState. 463 ** 464 ** CURSOR_VALID: 465 ** Cursor points to a valid entry. getPayload() etc. may be called. 466 ** 467 ** CURSOR_INVALID: 468 ** Cursor does not point to a valid entry. This can happen (for example) 469 ** because the table is empty or because BtreeCursorFirst() has not been 470 ** called. 471 ** 472 ** CURSOR_REQUIRESEEK: 473 ** The table that this cursor was opened on still exists, but has been 474 ** modified since the cursor was last used. The cursor position is saved 475 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in 476 ** this state, restoreCursorPosition() can be called to attempt to 477 ** seek the cursor to the saved position. 478 ** 479 ** CURSOR_FAULT: 480 ** A unrecoverable error (an I/O error or a malloc failure) has occurred 481 ** on a different connection that shares the BtShared cache with this 482 ** cursor. The error has left the cache in an inconsistent state. 483 ** Do nothing else with this cursor. Any attempt to use the cursor 484 ** should return the error code stored in BtCursor.skip 485 */ 486 #define CURSOR_INVALID 0 487 #define CURSOR_VALID 1 488 #define CURSOR_REQUIRESEEK 2 489 #define CURSOR_FAULT 3 490 491 /* 492 ** The database page the PENDING_BYTE occupies. This page is never used. 493 */ 494 # define PENDING_BYTE_PAGE(pBt) PAGER_MJ_PGNO(pBt) 495 496 /* 497 ** A linked list of the following structures is stored at BtShared.pLock. 498 ** Locks are added (or upgraded from READ_LOCK to WRITE_LOCK) when a cursor 499 ** is opened on the table with root page BtShared.iTable. Locks are removed 500 ** from this list when a transaction is committed or rolled back, or when 501 ** a btree handle is closed. 502 */ 503 struct BtLock { 504 Btree *pBtree; /* Btree handle holding this lock */ 505 Pgno iTable; /* Root page of table */ 506 u8 eLock; /* READ_LOCK or WRITE_LOCK */ 507 BtLock *pNext; /* Next in BtShared.pLock list */ 508 }; 509 510 /* Candidate values for BtLock.eLock */ 511 #define READ_LOCK 1 512 #define WRITE_LOCK 2 513 514 /* 515 ** These macros define the location of the pointer-map entry for a 516 ** database page. The first argument to each is the number of usable 517 ** bytes on each page of the database (often 1024). The second is the 518 ** page number to look up in the pointer map. 519 ** 520 ** PTRMAP_PAGENO returns the database page number of the pointer-map 521 ** page that stores the required pointer. PTRMAP_PTROFFSET returns 522 ** the offset of the requested map entry. 523 ** 524 ** If the pgno argument passed to PTRMAP_PAGENO is a pointer-map page, 525 ** then pgno is returned. So (pgno==PTRMAP_PAGENO(pgsz, pgno)) can be 526 ** used to test if pgno is a pointer-map page. PTRMAP_ISPAGE implements 527 ** this test. 528 */ 529 #define PTRMAP_PAGENO(pBt, pgno) ptrmapPageno(pBt, pgno) 530 #define PTRMAP_PTROFFSET(pgptrmap, pgno) (5*(pgno-pgptrmap-1)) 531 #define PTRMAP_ISPAGE(pBt, pgno) (PTRMAP_PAGENO((pBt),(pgno))==(pgno)) 532 533 /* 534 ** The pointer map is a lookup table that identifies the parent page for 535 ** each child page in the database file. The parent page is the page that 536 ** contains a pointer to the child. Every page in the database contains 537 ** 0 or 1 parent pages. (In this context 'database page' refers 538 ** to any page that is not part of the pointer map itself.) Each pointer map 539 ** entry consists of a single byte 'type' and a 4 byte parent page number. 540 ** The PTRMAP_XXX identifiers below are the valid types. 541 ** 542 ** The purpose of the pointer map is to facility moving pages from one 543 ** position in the file to another as part of autovacuum. When a page 544 ** is moved, the pointer in its parent must be updated to point to the 545 ** new location. The pointer map is used to locate the parent page quickly. 546 ** 547 ** PTRMAP_ROOTPAGE: The database page is a root-page. The page-number is not 548 ** used in this case. 549 ** 550 ** PTRMAP_FREEPAGE: The database page is an unused (free) page. The page-number 551 ** is not used in this case. 552 ** 553 ** PTRMAP_OVERFLOW1: The database page is the first page in a list of 554 ** overflow pages. The page number identifies the page that 555 ** contains the cell with a pointer to this overflow page. 556 ** 557 ** PTRMAP_OVERFLOW2: The database page is the second or later page in a list of 558 ** overflow pages. The page-number identifies the previous 559 ** page in the overflow page list. 560 ** 561 ** PTRMAP_BTREE: The database page is a non-root btree page. The page number 562 ** identifies the parent page in the btree. 563 */ 564 #define PTRMAP_ROOTPAGE 1 565 #define PTRMAP_FREEPAGE 2 566 #define PTRMAP_OVERFLOW1 3 567 #define PTRMAP_OVERFLOW2 4 568 #define PTRMAP_BTREE 5 569 570 /* A bunch of assert() statements to check the transaction state variables 571 ** of handle p (type Btree*) are internally consistent. 572 */ 573 #define btreeIntegrity(p) \ 574 assert( p->pBt->inTransaction!=TRANS_NONE || p->pBt->nTransaction==0 ); \ 575 assert( p->pBt->inTransaction>=p->inTrans ); 576 577 578 /* 579 ** The ISAUTOVACUUM macro is used within balance_nonroot() to determine 580 ** if the database supports auto-vacuum or not. Because it is used 581 ** within an expression that is an argument to another macro 582 ** (sqliteMallocRaw), it is not possible to use conditional compilation. 583 ** So, this macro is defined instead. 584 */ 585 #ifndef SQLITE_OMIT_AUTOVACUUM 586 #define ISAUTOVACUUM (pBt->autoVacuum) 587 #else 588 #define ISAUTOVACUUM 0 589 #endif 590 591 592 /* 593 ** This structure is passed around through all the sanity checking routines 594 ** in order to keep track of some global state information. 595 */ 596 typedef struct IntegrityCk IntegrityCk; 597 struct IntegrityCk { 598 BtShared *pBt; /* The tree being checked out */ 599 Pager *pPager; /* The associated pager. Also accessible by pBt->pPager */ 600 Pgno nPage; /* Number of pages in the database */ 601 int *anRef; /* Number of times each page is referenced */ 602 int mxErr; /* Stop accumulating errors when this reaches zero */ 603 int nErr; /* Number of messages written to zErrMsg so far */ 604 int mallocFailed; /* A memory allocation error has occurred */ 605 StrAccum errMsg; /* Accumulate the error message text here */ 606 }; 607 608 /* 609 ** Read or write a two- and four-byte big-endian integer values. 610 */ 611 #define get2byte(x) ((x)[0]<<8 | (x)[1]) 612 #define put2byte(p,v) ((p)[0] = (u8)((v)>>8), (p)[1] = (u8)(v)) 613 #define get4byte sqlite3Get4byte 614 #define put4byte sqlite3Put4byte 615 616 /* 617 ** Internal routines that should be accessed by the btree layer only. 618 */ 619 int sqlite3BtreeGetPage(BtShared*, Pgno, MemPage**, int); 620 int sqlite3BtreeInitPage(MemPage *pPage); 621 void sqlite3BtreeParseCellPtr(MemPage*, u8*, CellInfo*); 622 void sqlite3BtreeParseCell(MemPage*, int, CellInfo*); 623 int sqlite3BtreeRestoreCursorPosition(BtCursor *pCur); 624 void sqlite3BtreeGetTempCursor(BtCursor *pCur, BtCursor *pTempCur); 625 void sqlite3BtreeReleaseTempCursor(BtCursor *pCur); 626 void sqlite3BtreeMoveToParent(BtCursor *pCur); 627