| Index: third_party/sqlite/patches/0014-fts2-Detect-and-handle-certain-corruption-cases.patch
|
| diff --git a/third_party/sqlite/patches/0014-fts2-Detect-and-handle-certain-corruption-cases.patch b/third_party/sqlite/patches/0014-fts2-Detect-and-handle-certain-corruption-cases.patch
|
| new file mode 100644
|
| index 0000000000000000000000000000000000000000..8fe03bc38bfc699a3d5023662ab37197d1b424bc
|
| --- /dev/null
|
| +++ b/third_party/sqlite/patches/0014-fts2-Detect-and-handle-certain-corruption-cases.patch
|
| @@ -0,0 +1,309 @@
|
| +From c0a3343f2b446088f8f721baf8f53e20e8ce4fb5 Mon Sep 17 00:00:00 2001
|
| +From: Scott Hess <shess@chromium.org>
|
| +Date: Thu, 18 Sep 2008 17:00:30 -0700
|
| +Subject: [PATCH 14/16] [fts2] Detect and handle certain corruption cases.
|
| +
|
| +Detect and handle certain corruption cases for fts2,
|
| +concentrating on high-level structural issues not trying to
|
| +detect corruption when decoding, for now. These cases handle
|
| +all the in-the-wild corruption examples I have but one.
|
| +
|
| +- During a query, detect when the fts index references a docid
|
| + which doesn't exist in the content table.
|
| +
|
| +- Detect when leavesReaderInit() receives an empty leaf node,
|
| + or a leaf node which begins with a character other than nul.
|
| + Similar mod to leavesReaderStep().
|
| +
|
| +- Similar changes to interior-node handling in
|
| + loadAndGetChildrenContaining(), and loadSegment().
|
| +
|
| +- In various places detects if values of the wrong type are
|
| + received from SQL queries. I have audited the code, and all
|
| + stored values are bound using a type appropriate to their
|
| + column, so any mismatch means that we are either reading
|
| + random data, or valid SQLite data from a page which wasn't
|
| + previously part of an fts table (as if a page from another
|
| + table were re-used).
|
| +
|
| +Original Gears CL:
|
| +https://code.google.com/p/gears/source/detail?r=2855&path=/trunk/third_party/sqlite_google/ext/fts2/fts2.c
|
| +---
|
| + third_party/sqlite/src/ext/fts2/fts2.c | 152 ++++++++++++++++++++++++++++-----
|
| + 1 file changed, 132 insertions(+), 20 deletions(-)
|
| +
|
| +diff --git a/third_party/sqlite/src/ext/fts2/fts2.c b/third_party/sqlite/src/ext/fts2/fts2.c
|
| +index 1c68af5..5cb3fc6 100644
|
| +--- a/third_party/sqlite/src/ext/fts2/fts2.c
|
| ++++ b/third_party/sqlite/src/ext/fts2/fts2.c
|
| +@@ -349,6 +349,16 @@
|
| + # define TRACE(A)
|
| + #endif
|
| +
|
| ++#if 0
|
| ++/* Useful to set breakpoints. See main.c sqlite3Corrupt(). */
|
| ++static int fts2Corrupt(void){
|
| ++ return SQLITE_CORRUPT;
|
| ++}
|
| ++# define SQLITE_CORRUPT_BKPT fts2Corrupt()
|
| ++#else
|
| ++# define SQLITE_CORRUPT_BKPT SQLITE_CORRUPT
|
| ++#endif
|
| ++
|
| + /* It is not safe to call isspace(), tolower(), or isalnum() on
|
| + ** hi-bit-set characters. This is the same solution used in the
|
| + ** tokenizer.
|
| +@@ -3435,8 +3445,11 @@ static int fulltextNext(sqlite3_vtab_cursor *pCursor){
|
| + c->eof = 0;
|
| + return SQLITE_OK;
|
| + }
|
| +- /* an error occurred; abort */
|
| +- return rc==SQLITE_DONE ? SQLITE_ERROR : rc;
|
| ++
|
| ++ /* Corrupt if the index refers to missing document. */
|
| ++ if( rc==SQLITE_DONE ) return SQLITE_CORRUPT_BKPT;
|
| ++
|
| ++ return rc;
|
| + }
|
| + }
|
| +
|
| +@@ -5106,6 +5119,9 @@ static void leavesReaderDestroy(LeavesReader *pReader){
|
| + ** the leaf data was entirely contained in the root), or from the
|
| + ** stream of blocks between iStartBlockid and iEndBlockid, inclusive.
|
| + */
|
| ++/* TODO(shess): Figure out a means of indicating how many leaves are
|
| ++** expected, for purposes of detecting corruption.
|
| ++*/
|
| + static int leavesReaderInit(fulltext_vtab *v,
|
| + int idx,
|
| + sqlite_int64 iStartBlockid,
|
| +@@ -5117,6 +5133,10 @@ static int leavesReaderInit(fulltext_vtab *v,
|
| +
|
| + dataBufferInit(&pReader->rootData, 0);
|
| + if( iStartBlockid==0 ){
|
| ++ /* Corrupt if this can't be a leaf node. */
|
| ++ if( pRootData==NULL || nRootData<1 || pRootData[0]!='\0' ){
|
| ++ return SQLITE_CORRUPT_BKPT;
|
| ++ }
|
| + /* Entire leaf level fit in root data. */
|
| + dataBufferReplace(&pReader->rootData, pRootData, nRootData);
|
| + leafReaderInit(pReader->rootData.pData, pReader->rootData.nData,
|
| +@@ -5127,22 +5147,48 @@ static int leavesReaderInit(fulltext_vtab *v,
|
| + if( rc!=SQLITE_OK ) return rc;
|
| +
|
| + rc = sqlite3_bind_int64(s, 1, iStartBlockid);
|
| +- if( rc!=SQLITE_OK ) return rc;
|
| ++ if( rc!=SQLITE_OK ) goto err;
|
| +
|
| + rc = sqlite3_bind_int64(s, 2, iEndBlockid);
|
| +- if( rc!=SQLITE_OK ) return rc;
|
| ++ if( rc!=SQLITE_OK ) goto err;
|
| +
|
| + rc = sqlite3_step(s);
|
| ++
|
| ++ /* Corrupt if interior node referenced missing leaf node. */
|
| + if( rc==SQLITE_DONE ){
|
| +- pReader->eof = 1;
|
| +- return SQLITE_OK;
|
| ++ rc = SQLITE_CORRUPT_BKPT;
|
| ++ goto err;
|
| ++ }
|
| ++
|
| ++ if( rc!=SQLITE_ROW ) goto err;
|
| ++ rc = SQLITE_OK;
|
| ++
|
| ++ /* Corrupt if leaf data isn't a blob. */
|
| ++ if( sqlite3_column_type(s, 0)!=SQLITE_BLOB ){
|
| ++ rc = SQLITE_CORRUPT_BKPT;
|
| ++ }else{
|
| ++ const char *pLeafData = sqlite3_column_blob(s, 0);
|
| ++ int nLeafData = sqlite3_column_bytes(s, 0);
|
| ++
|
| ++ /* Corrupt if this can't be a leaf node. */
|
| ++ if( pLeafData==NULL || nLeafData<1 || pLeafData[0]!='\0' ){
|
| ++ rc = SQLITE_CORRUPT_BKPT;
|
| ++ }else{
|
| ++ leafReaderInit(pLeafData, nLeafData, &pReader->leafReader);
|
| ++ }
|
| ++ }
|
| ++
|
| ++ err:
|
| ++ if( rc!=SQLITE_OK ){
|
| ++ if( idx==-1 ){
|
| ++ sqlite3_finalize(s);
|
| ++ }else{
|
| ++ sqlite3_reset(s);
|
| ++ }
|
| ++ return rc;
|
| + }
|
| +- if( rc!=SQLITE_ROW ) return rc;
|
| +
|
| + pReader->pStmt = s;
|
| +- leafReaderInit(sqlite3_column_blob(pReader->pStmt, 0),
|
| +- sqlite3_column_bytes(pReader->pStmt, 0),
|
| +- &pReader->leafReader);
|
| + }
|
| + return SQLITE_OK;
|
| + }
|
| +@@ -5165,10 +5211,22 @@ static int leavesReaderStep(fulltext_vtab *v, LeavesReader *pReader){
|
| + pReader->eof = 1;
|
| + return rc==SQLITE_DONE ? SQLITE_OK : rc;
|
| + }
|
| +- leafReaderDestroy(&pReader->leafReader);
|
| +- leafReaderInit(sqlite3_column_blob(pReader->pStmt, 0),
|
| +- sqlite3_column_bytes(pReader->pStmt, 0),
|
| +- &pReader->leafReader);
|
| ++
|
| ++ /* Corrupt if leaf data isn't a blob. */
|
| ++ if( sqlite3_column_type(pReader->pStmt, 0)!=SQLITE_BLOB ){
|
| ++ return SQLITE_CORRUPT_BKPT;
|
| ++ }else{
|
| ++ const char *pLeafData = sqlite3_column_blob(pReader->pStmt, 0);
|
| ++ int nLeafData = sqlite3_column_bytes(pReader->pStmt, 0);
|
| ++
|
| ++ /* Corrupt if this can't be a leaf node. */
|
| ++ if( pLeafData==NULL || nLeafData<1 || pLeafData[0]!='\0' ){
|
| ++ return SQLITE_CORRUPT_BKPT;
|
| ++ }
|
| ++
|
| ++ leafReaderDestroy(&pReader->leafReader);
|
| ++ leafReaderInit(pLeafData, nLeafData, &pReader->leafReader);
|
| ++ }
|
| + }
|
| + return SQLITE_OK;
|
| + }
|
| +@@ -5230,6 +5288,14 @@ static int leavesReadersInit(fulltext_vtab *v, int iLevel,
|
| + const char *pRootData = sqlite3_column_blob(s, 2);
|
| + int nRootData = sqlite3_column_bytes(s, 2);
|
| +
|
| ++ /* Corrupt if we get back different types than we stored. */
|
| ++ if( sqlite3_column_type(s, 0)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 1)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 2)!=SQLITE_BLOB ){
|
| ++ rc = SQLITE_CORRUPT_BKPT;
|
| ++ break;
|
| ++ }
|
| ++
|
| + assert( i<MERGE_COUNT );
|
| + rc = leavesReaderInit(v, i, iStart, iEnd, pRootData, nRootData,
|
| + &pReaders[i]);
|
| +@@ -5241,6 +5307,7 @@ static int leavesReadersInit(fulltext_vtab *v, int iLevel,
|
| + while( i-->0 ){
|
| + leavesReaderDestroy(&pReaders[i]);
|
| + }
|
| ++ sqlite3_reset(s); /* So we don't leave a lock. */
|
| + return rc;
|
| + }
|
| +
|
| +@@ -5617,11 +5684,27 @@ static int loadAndGetChildrenContaining(
|
| + if( rc!=SQLITE_OK ) return rc;
|
| +
|
| + rc = sqlite3_step(s);
|
| +- if( rc==SQLITE_DONE ) return SQLITE_ERROR;
|
| ++ /* Corrupt if interior node references missing child node. */
|
| ++ if( rc==SQLITE_DONE ) return SQLITE_CORRUPT_BKPT;
|
| + if( rc!=SQLITE_ROW ) return rc;
|
| +
|
| +- getChildrenContaining(sqlite3_column_blob(s, 0), sqlite3_column_bytes(s, 0),
|
| +- pTerm, nTerm, isPrefix, piStartChild, piEndChild);
|
| ++ /* Corrupt if child node isn't a blob. */
|
| ++ if( sqlite3_column_type(s, 0)!=SQLITE_BLOB ){
|
| ++ sqlite3_reset(s); /* So we don't leave a lock. */
|
| ++ return SQLITE_CORRUPT_BKPT;
|
| ++ }else{
|
| ++ const char *pData = sqlite3_column_blob(s, 0);
|
| ++ int nData = sqlite3_column_bytes(s, 0);
|
| ++
|
| ++ /* Corrupt if child is not a valid interior node. */
|
| ++ if( pData==NULL || nData<1 || pData[0]=='\0' ){
|
| ++ sqlite3_reset(s); /* So we don't leave a lock. */
|
| ++ return SQLITE_CORRUPT_BKPT;
|
| ++ }
|
| ++
|
| ++ getChildrenContaining(pData, nData, pTerm, nTerm,
|
| ++ isPrefix, piStartChild, piEndChild);
|
| ++ }
|
| +
|
| + /* We expect only one row. We must execute another sqlite3_step()
|
| + * to complete the iteration; otherwise the table will remain
|
| +@@ -5704,7 +5787,8 @@ static int loadSegment(fulltext_vtab *v, const char *pData, int nData,
|
| + DataBuffer result;
|
| + int rc;
|
| +
|
| +- assert( nData>1 );
|
| ++ /* Corrupt if segment root can't be valid. */
|
| ++ if( pData==NULL || nData<1 ) return SQLITE_CORRUPT_BKPT;
|
| +
|
| + /* This code should never be called with buffered updates. */
|
| + assert( v->nPendingData<0 );
|
| +@@ -5758,6 +5842,14 @@ static int termSelect(fulltext_vtab *v, int iColumn,
|
| + const char *pData = sqlite3_column_blob(s, 2);
|
| + const int nData = sqlite3_column_bytes(s, 2);
|
| + const sqlite_int64 iLeavesEnd = sqlite3_column_int64(s, 1);
|
| ++
|
| ++ /* Corrupt if we get back different types than we stored. */
|
| ++ if( sqlite3_column_type(s, 1)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 2)!=SQLITE_BLOB ){
|
| ++ rc = SQLITE_CORRUPT_BKPT;
|
| ++ goto err;
|
| ++ }
|
| ++
|
| + rc = loadSegment(v, pData, nData, iLeavesEnd, pTerm, nTerm, isPrefix,
|
| + &doclist);
|
| + if( rc!=SQLITE_OK ) goto err;
|
| +@@ -5777,6 +5869,7 @@ static int termSelect(fulltext_vtab *v, int iColumn,
|
| + }
|
| +
|
| + err:
|
| ++ sqlite3_reset(s); /* So we don't leave a lock. */
|
| + dataBufferDestroy(&doclist);
|
| + return rc;
|
| + }
|
| +@@ -6269,6 +6362,14 @@ static void optimizeFunc(sqlite3_context *pContext,
|
| + const char *pRootData = sqlite3_column_blob(s, 2);
|
| + int nRootData = sqlite3_column_bytes(s, 2);
|
| +
|
| ++ /* Corrupt if we get back different types than we stored. */
|
| ++ if( sqlite3_column_type(s, 0)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 1)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 2)!=SQLITE_BLOB ){
|
| ++ rc = SQLITE_CORRUPT_BKPT;
|
| ++ break;
|
| ++ }
|
| ++
|
| + assert( i<nReaders );
|
| + rc = leavesReaderInit(v, -1, iStart, iEnd, pRootData, nRootData,
|
| + &readers[i].reader);
|
| +@@ -6282,6 +6383,8 @@ static void optimizeFunc(sqlite3_context *pContext,
|
| + if( rc==SQLITE_DONE ){
|
| + assert( i==nReaders );
|
| + rc = optimizeInternal(v, readers, nReaders, &writer);
|
| ++ }else{
|
| ++ sqlite3_reset(s); /* So we don't leave a lock. */
|
| + }
|
| +
|
| + while( i-- > 0 ){
|
| +@@ -6345,9 +6448,18 @@ static int collectSegmentTerms(fulltext_vtab *v, sqlite3_stmt *s,
|
| + const sqlite_int64 iEndBlockid = sqlite3_column_int64(s, 1);
|
| + const char *pRootData = sqlite3_column_blob(s, 2);
|
| + const int nRootData = sqlite3_column_bytes(s, 2);
|
| ++ int rc;
|
| + LeavesReader reader;
|
| +- int rc = leavesReaderInit(v, 0, iStartBlockid, iEndBlockid,
|
| +- pRootData, nRootData, &reader);
|
| ++
|
| ++ /* Corrupt if we get back different types than we stored. */
|
| ++ if( sqlite3_column_type(s, 0)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 1)!=SQLITE_INTEGER ||
|
| ++ sqlite3_column_type(s, 2)!=SQLITE_BLOB ){
|
| ++ return SQLITE_CORRUPT_BKPT;
|
| ++ }
|
| ++
|
| ++ rc = leavesReaderInit(v, 0, iStartBlockid, iEndBlockid,
|
| ++ pRootData, nRootData, &reader);
|
| + if( rc!=SQLITE_OK ) return rc;
|
| +
|
| + while( rc==SQLITE_OK && !leavesReaderAtEnd(&reader) ){
|
| +--
|
| +2.2.1
|
| +
|
|
|