mirror of
https://gitlab.alpinelinux.org/alpine/aports.git
synced 2026-05-05 20:36:40 +02:00
25 lines
1.0 KiB
Diff
25 lines
1.0 KiB
Diff
diff --git a/sqlite3.c b/sqlite3.c
|
|
index 4404295..b40ca97 100644
|
|
--- a/sqlite3.c
|
|
+++ b/sqlite3.c
|
|
@@ -105489,7 +105489,9 @@ static void decodeIntArray(
|
|
if( sqlite3_strglob("unordered*", z)==0 ){
|
|
pIndex->bUnordered = 1;
|
|
}else if( sqlite3_strglob("sz=[0-9]*", z)==0 ){
|
|
- pIndex->szIdxRow = sqlite3LogEst(sqlite3Atoi(z+3));
|
|
+ int sz = sqlite3Atoi(z+3);
|
|
+ if( sz<2 ) sz = 2;
|
|
+ pIndex->szIdxRow = sqlite3LogEst(sz);
|
|
}else if( sqlite3_strglob("noskipscan*", z)==0 ){
|
|
pIndex->noSkipScan = 1;
|
|
}
|
|
@@ -142704,6 +142706,7 @@ static int whereLoopAddBtreeIndex(
|
|
** it to pNew->rRun, which is currently set to the cost of the index
|
|
** seek only. Then, if this is a non-covering index, add the cost of
|
|
** visiting the rows in the main table. */
|
|
+ assert( pSrc->pTab->szTabRow>0 );
|
|
rCostIdx = pNew->nOut + 1 + (15*pProbe->szIdxRow)/pSrc->pTab->szTabRow;
|
|
pNew->rRun = sqlite3LogEstAdd(rLogSize, rCostIdx);
|
|
if( (pNew->wsFlags & (WHERE_IDX_ONLY|WHERE_IPK))==0 ){
|
|
|