Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
Comment: | Change leading tabs into spaces. (CVS 5755) |
---|---|
Downloads: | Tarball | ZIP archive |
Timelines: | family | ancestors | descendants | both | trunk |
Files: | files | file ages | folders |
SHA1: |
4e536463c1aa9991de85c7efc826c288 |
User & Date: | drh 2008-09-30 14:06:29.000 |
Context
2008-09-30
| ||
16:48 | Fix a comment in btree.c. No code changes. (CVS 5756) (check-in: 0f3c56330b user: danielk1977 tags: trunk) | |
14:06 | Change leading tabs into spaces. (CVS 5755) (check-in: 4e536463c1 user: drh tags: trunk) | |
09:31 | Fix a recently introduced problem with deleting entries from index tables. (CVS 5754) (check-in: 83c064cae4 user: danielk1977 tags: trunk) | |
Changes
Changes to src/btree.c.
1 2 3 4 5 6 7 8 9 10 11 | /* ** 2004 April 6 ** ** The author disclaims copyright to this source code. In place of ** a legal notice, here is a blessing: ** ** May you do good and not evil. ** May you find forgiveness for yourself and forgive others. ** May you share freely, never taking more than you give. ** ************************************************************************* | | | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | /* ** 2004 April 6 ** ** The author disclaims copyright to this source code. In place of ** a legal notice, here is a blessing: ** ** May you do good and not evil. ** May you find forgiveness for yourself and forgive others. ** May you share freely, never taking more than you give. ** ************************************************************************* ** $Id: btree.c,v 1.522 2008/09/30 14:06:29 drh Exp $ ** ** This file implements a external (disk-based) database using BTrees. ** See the header comment on "btreeInt.h" for additional information. ** Including a description of file format and an overview of operation. */ #include "btreeInt.h" |
︙ | ︙ | |||
5942 5943 5944 5945 5946 5947 5948 | ** node above may have modified the structure of the B-Tree and ** so the current contents of leafCur.apPage[] and leafCur.aiIdx[] ** may not be trusted. ** ** It is not possible to copy the ancestry from pCur, as the same ** balance() call has invalidated the pCur->apPage[] and aiIdx[] ** arrays. | | | | | | | | | | | | | 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 | ** node above may have modified the structure of the B-Tree and ** so the current contents of leafCur.apPage[] and leafCur.aiIdx[] ** may not be trusted. ** ** It is not possible to copy the ancestry from pCur, as the same ** balance() call has invalidated the pCur->apPage[] and aiIdx[] ** arrays. ** ** The call to saveCursorPosition() below internally saves the ** key that leafCur is currently pointing to. Currently, there ** are two copies of that key in the tree - one here on the leaf ** page and one on some internal node in the tree. The copy on ** the leaf node is always the next key in tree-order after the ** copy on the internal node. So, the call to sqlite3BtreeNext() ** calls restoreCursorPosition() to point the cursor to the copy ** stored on the internal node, then advances to the next entry, ** which happens to be the copy of the key on the internal node. ** Net effect: leafCur is pointing back where */ #ifndef NDEBUG Pgno leafPgno = pLeafPage->pgno; #endif rc = saveCursorPosition(&leafCur); if( rc==SQLITE_OK ){ rc = sqlite3BtreeNext(&leafCur, ¬Used); |
︙ | ︙ |