database/sqlite
1
0
Fork 0
mirror of https://github.com/sqlite/sqlite.git synced 2025-11-16 23:02:26 +03:00
Code Activity

Enhanced analysis of OR terms in a WHERE clause. Another step toward being

Browse Source 
able to use indices with OR-connected WHERE clause terms. (CVS 6045)

FossilOrigin-Name: c3f7aa019c613e18457f090685725dd8a6a336b9
This commit is contained in:
drh
2008-12-20 02:06:13 +00:00
parent 47e23024b1
commit 1a58fe0290
3 changed files with 277 additions and 166 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
manifest
View File

@@ -1,5 +1,5 @@
C Add\sextra\scrash\stest\scases\sthat\sstress\sthe\ssavepoint\smechanism\sto\ssavepoint4.test.\sCurrently,\sthese\stests\sare\scausing\sdatabase\scorruption\swhich\s(obviously)\sneeds\sto\sbe\sfixed.\s(CVS\s6044) C Enhanced\sanalysis\sof\sOR\sterms\sin\sa\sWHERE\sclause.\s\sAnother\sstep\stoward\sbeing\nable\sto\suse\sindices\swith\sOR-connected\sWHERE\sclause\sterms.\s(CVS\s6045)
D 2008-12-19T18:45:53 D 2008-12-20T02:06:14
F Makefile.arm-wince-mingw32ce-gcc fcd5e9cd67fe88836360bb4f9ef4cb7f8e2fb5a0 F Makefile.arm-wince-mingw32ce-gcc fcd5e9cd67fe88836360bb4f9ef4cb7f8e2fb5a0
F Makefile.in f7e4c81c347b04f7b0f1c1b081a168645d7b8af7 F Makefile.in f7e4c81c347b04f7b0f1c1b081a168645d7b8af7
F Makefile.linux-gcc d53183f4aa6a9192d249731c90dbdffbd2c68654 F Makefile.linux-gcc d53183f4aa6a9192d249731c90dbdffbd2c68654
@@ -206,7 +206,7 @@ F src/vdbeblob.c b0dcebfafedcf9c0addc7901ad98f6f986c08935
F src/vdbemem.c f9c859ac17e2e05a0f249868ce4f191f69edd31d F src/vdbemem.c f9c859ac17e2e05a0f249868ce4f191f69edd31d
F src/vtab.c e39e011d7443a8d574b1b9cde207a35522e6df43 F src/vtab.c e39e011d7443a8d574b1b9cde207a35522e6df43
F src/walker.c 488c2660e13224ff70c0c82761118efb547f8f0d F src/walker.c 488c2660e13224ff70c0c82761118efb547f8f0d
F src/where.c 685a1e8d2b84946a4804ae7973e4704f76a71ac6 F src/where.c d373103ee8a7f2c69d42d585e83adef0b50ad3a0
F tclinstaller.tcl 4356d9d94d2b5ed5e68f9f0c80c4df3048dd7617 F tclinstaller.tcl 4356d9d94d2b5ed5e68f9f0c80c4df3048dd7617
F test/aggerror.test a867e273ef9e3d7919f03ef4f0e8c0d2767944f2 F test/aggerror.test a867e273ef9e3d7919f03ef4f0e8c0d2767944f2
F test/alias.test 597662c5d777a122f9a3df0047ea5c5bd383a911 F test/alias.test 597662c5d777a122f9a3df0047ea5c5bd383a911
@@ -683,7 +683,7 @@ F tool/speedtest16.c c8a9c793df96db7e4933f0852abb7a03d48f2e81
F tool/speedtest2.tcl ee2149167303ba8e95af97873c575c3e0fab58ff F tool/speedtest2.tcl ee2149167303ba8e95af97873c575c3e0fab58ff
F tool/speedtest8.c 2902c46588c40b55661e471d7a86e4dd71a18224 F tool/speedtest8.c 2902c46588c40b55661e471d7a86e4dd71a18224
F tool/speedtest8inst1.c 293327bc76823f473684d589a8160bde1f52c14e F tool/speedtest8inst1.c 293327bc76823f473684d589a8160bde1f52c14e
P 6f36c16678b6e3baa5a9d9ceba1a756a8034f3e1 P e06a968aa5b17ce12ea179b36a99ad74d274fd2c
R 2a5a11863cbc6dc85f1a72ca45278583 R a6eb762ef1053032b1fe61a22a5c40ac
U danielk1977 U drh
Z f91b2e50bc859a782a332b4d8be666cb Z a1e1b0e8f9ef51bafdd5164b7b2aaa33

2
manifest.uuid
View File

@@ -1 +1 @@
e06a968aa5b17ce12ea179b36a99ad74d274fd2c c3f7aa019c613e18457f090685725dd8a6a336b9

427
src/where.c
View File

@@ -16,7 +16,7 @@
** so is applicable. Because this module is responsible for selecting ** so is applicable. Because this module is responsible for selecting
** indices, you might also think of this module as the "query optimizer". ** indices, you might also think of this module as the "query optimizer".
** **
** $Id: where.c,v 1.338 2008/12/17 19:22:16 drh Exp $ ** $Id: where.c,v 1.339 2008/12/20 02:06:14 drh Exp $
*/ */
#include "sqliteInt.h" #include "sqliteInt.h"
@@ -140,7 +140,7 @@ struct WhereClause {
*/ */
struct WhereOrInfo { struct WhereOrInfo {
WhereClause wc; /* The OR subexpression broken out */ WhereClause wc; /* The OR subexpression broken out */
double cost; /* Cost of evaluating this OR subexpression */ Bitmask indexable; /* Bitmask of all indexable tables in the clause */
}; };
/* /*
@@ -202,6 +202,7 @@ struct ExprMaskSet {
#define WO_AND 0x200 /* Two or more AND-connected terms */ #define WO_AND 0x200 /* Two or more AND-connected terms */
#define WO_ALL 0xfff /* Mask of all possible WO_* values */ #define WO_ALL 0xfff /* Mask of all possible WO_* values */
#define WO_SINGLE 0x0ff /* Mask of all non-compound WO_* values */
/* /*
** Value for wsFlags returned by bestIndex() and stored in ** Value for wsFlags returned by bestIndex() and stored in
@@ -254,6 +255,7 @@ static void whereClauseClear(WhereClause*);
static void whereOrInfoDelete(sqlite3 *db, WhereOrInfo *p){ static void whereOrInfoDelete(sqlite3 *db, WhereOrInfo *p){
if( p ){ if( p ){
whereClauseClear(&p->wc); whereClauseClear(&p->wc);
sqlite3DbFree(db, p);
} }
} }
@@ -263,6 +265,7 @@ static void whereOrInfoDelete(sqlite3 *db, WhereOrInfo *p){
static void whereAndInfoDelete(sqlite3 *db, WhereAndInfo *p){ static void whereAndInfoDelete(sqlite3 *db, WhereAndInfo *p){
if( p ){ if( p ){
whereClauseClear(&p->wc); whereClauseClear(&p->wc);
sqlite3DbFree(db, p);
} }
} }
@@ -705,91 +708,249 @@ static void transferJoinMarkings(Expr *pDerived, Expr *pBase){
#if !defined(SQLITE_OMIT_OR_OPTIMIZATION) && !defined(SQLITE_OMIT_SUBQUERY) #if !defined(SQLITE_OMIT_OR_OPTIMIZATION) && !defined(SQLITE_OMIT_SUBQUERY)
/* /*
** Return TRUE if the given term of an OR clause can be converted ** Analyze a term that consists of two or more OR-connected
** into an IN clause. The iCursor and iColumn define the left-hand ** subterms. So in:
** side of the IN clause.
** **
** The context is that we have multiple OR-connected equality terms ** ... WHERE (a=5) AND (b=7 OR c=9 OR d=13) AND (d=13)
** like this: ** ^^^^^^^^^^^^^^^^^^^^
** **
** a=<expr1> OR a=<expr2> OR b=<expr3> OR ... ** This routine analyzes terms such as the middle term in the above example.
** A WhereOrTerm object is computed and attached to the term under
** analysis, regardless of the outcome of the analysis. Hence:
** **
** The pOrTerm input to this routine corresponds to a single term of ** WhereTerm.wtFlags |= TERM_ORINFO
** this OR clause. In order for the term to be a candidate for ** WhereTerm.u.pOrInfo = a dynamically allocated WhereOrTerm object
** conversion to an IN operator, the following must be true:
** **
** * The left-hand side of the term must be the column which ** The term being analyzed must have two or more of OR-connected subterms.
** is identified by iCursor and iColumn. ** A single subterms might be a set of AND-connected sub-subterms.
** Examples of terms under analysis:
** **
** * If the right-hand side is also a column, then the affinities ** (A) t1.x=t2.y OR t1.x=t2.z OR t1.y=15 OR t1.z=t3.a+5
** of both right and left sides must be such that no type ** (B) x=expr1 OR expr2=x OR x=expr3
** conversions are required on the right. (Ticket #2249) ** (C) t1.x=t2.y OR (t1.x=t2.z AND t1.y=15)
** (D) x=expr1 OR (y>11 AND y<22 AND z LIKE '*hello*')
** (E) (p.a=1 AND q.b=2 AND r.c=3) OR (p.x=4 AND q.y=5 AND r.z=6)
** **
** If both of these conditions are true, then return true. Otherwise ** CASE 1:
** return false. **
** If all subterms are of the form T.C=expr for some single column of C
** a single table T (as shown in example B above) then create a new virtual
** term that is an equivalent IN expression. In other words, if the term
** being analyzed is:
**
** x = expr1 OR expr2 = x OR x = expr3
**
** then create a new virtual term like this:
**
** x IN (expr1,expr2,expr3)
**
** CASE 2:
**
** If all subterms are indexable by a single table T, then set
**
** WhereTerm.eOperator = WO_OR
** WhereTerm.u.pOrInfo->indexable |= the cursor number for table T
**
** A subterm is "indexable" if it is of the form
** "T.C <op> <expr>" where C is any column of table T and
** <op> is one of "=", "<", "<=", ">", ">=", "IS NULL", or "IN".
** A subterm is also indexable if it is an AND of two or more
** subsubterms at least one of which is indexable. Indexable AND
** subterms have their eOperator set to WO_AND and they have
** u.pAndInfo set to a dynamically allocated WhereAndTerm object.
**
** From another point of view, "indexable" means that the subterm could
** potentially be used with an index if an appropriate index exists.
** This analysis does not consider whether or not the index exists; that
** is something the bestIndex() routine will determine. This analysis
** only looks at whether subterms appropriate for indexing exist.
**
** All examples A through E above all satisfy case 2. But if a term
** also statisfies case 1 (such as B) we know that the optimizer will
** always prefer case 1, so in that case we pretend that case 2 is not
** satisfied.
**
** It might be the case that multiple tables are indexable. For example,
** (E) above is indexable on tables P, Q, and R.
**
** Terms that satisfy case 2 are candidates for lookup by using
** separate indices to find rowids for each subterm and composing
** the union of all rowids using a RowSet object. This is similar
** to "bitmap indices" in other database engines.
**
** OTHERWISE:
**
** If neither case 1 nor case 2 apply, then leave the eOperator set to
** zero. This term is not useful for search.
*/ */
static int orTermIsOptCandidate(WhereTerm *pOrTerm, int iCursor, int iColumn){ static void exprAnalyzeOrTerm(
int affLeft, affRight; SrcList *pSrc, /* the FROM clause */
assert( pOrTerm->eOperator==WO_EQ ); WhereClause *pWC, /* the complete WHERE clause */
if( pOrTerm->leftCursor!=iCursor ){ int idxTerm /* Index of the OR-term to be analyzed */
return 0; ){
} Parse *pParse = pWC->pParse; /* Parser context */
if( pOrTerm->u.leftColumn!=iColumn ){ sqlite3 *db = pParse->db; /* Database connection */
return 0; WhereTerm *pTerm = &pWC->a[idxTerm]; /* The term to be analyzed */
} Expr *pExpr = pTerm->pExpr; /* The expression of the term */
affRight = sqlite3ExprAffinity(pOrTerm->pExpr->pRight); ExprMaskSet *pMaskSet = pWC->pMaskSet; /* Table use masks */
if( affRight==0 ){ int i; /* Loop counters */
return 1; WhereClause *pOrWc; /* Breakup of pTerm into subterms */
} WhereTerm *pOrTerm; /* A Sub-term within the pOrWc */
affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft); WhereOrInfo *pOrInfo; /* Additional information associated with pTerm */
if( affRight!=affLeft ){ Bitmask chngToIN; /* Tables that might satisfy case 1 */
return 0; Bitmask indexable; /* Tables that are indexable, satisfying case 2 */
}
return 1;
}
/* /*
** Return true if the given term of an OR clause can be ignored during ** Break the OR clause into its separate subterms. The subterms are
** a check to make sure all OR terms are candidates for optimization. ** stored in a WhereClause structure containing within the WhereOrInfo
** In other words, return true if a call to the orTermIsOptCandidate() ** object that is attached to the original OR clause term.
** above returned false but it is not necessary to disqualify the */
** optimization. assert( (pTerm->wtFlags & (TERM_DYNAMIC|TERM_ORINFO|TERM_ANDINFO))==0 );
** assert( pExpr->op==TK_OR );
** Suppose the original OR phrase was this: pTerm->u.pOrInfo = pOrInfo = sqlite3DbMallocRaw(db, sizeof(*pOrInfo));
** if( pOrInfo==0 ) return;
** a=4 OR a=11 OR a=b pTerm->wtFlags |= TERM_ORINFO;
** pOrWc = &pOrInfo->wc;
** During analysis, the third term gets flipped around and duplicate whereClauseInit(pOrWc, pWC->pParse, pMaskSet);
** so that we are left with this: whereSplit(pOrWc, pExpr, TK_OR);
** exprAnalyzeAll(pSrc, pOrWc);
** a=4 OR a=11 OR a=b OR b=a if( db->mallocFailed ) return;
** assert( pOrWc->nTerm>=2 );
** Since the last two terms are duplicates, only one of them
** has to qualify in order for the whole phrase to qualify. When /*
** this routine is called, we know that pOrTerm did not qualify. ** Compute the set of tables that might satisfy cases 1 or 2.
** This routine merely checks to see if pOrTerm has a duplicate that */
** might qualify. If there is a duplicate that has not yet been indexable = chngToIN = ~(Bitmask)0;
** disqualified, then return true. If there are no duplicates, or for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0 && indexable; i--, pOrTerm++){
** the duplicate has also been disqualified, return false. if( (pOrTerm->eOperator & WO_SINGLE)==0 ){
*/ chngToIN = 0;
static int orTermHasOkDuplicate(WhereClause *pOr, WhereTerm *pOrTerm){ indexable = 0; /***** FIX ME. Some AND clauses are indexable. */
if( pOrTerm->wtFlags & TERM_COPIED ){ }else if( pOrTerm->wtFlags & TERM_COPIED ){
/* This is the original term. The duplicate is to the left had /* Skip this term for now. We revisit it when we process the
** has not yet been analyzed and thus has not yet been disqualified. */ ** corresponding TERM_VIRTUAL term */
return 1; }else{
Bitmask b;
b = getMask(pMaskSet, pOrTerm->leftCursor);
if( pOrTerm->wtFlags & TERM_VIRTUAL ){
WhereTerm *pOther = &pOrWc->a[pOrTerm->iParent];
b |= getMask(pMaskSet, pOther->leftCursor);
}
indexable &= b;
if( pOrTerm->eOperator!=WO_EQ ){
chngToIN = 0;
}else{
chngToIN &= b;
}
}
} }
if( (pOrTerm->wtFlags & TERM_VIRTUAL)!=0
&& (pOr->a[pOrTerm->iParent].wtFlags & TERM_OR_OK)!=0 ){ /*
/* This is a duplicate term. The original qualified so this one ** Record the set of tables that satisfy case 2. The set might be
** does not have to. */ ** empty, but that is OK.
return 1; */
pOrInfo->indexable = indexable;
pTerm->eOperator = WO_OR;
/*
** chngToIN holds a set of tables that *might* satisfy case 1. But
** we have to do some additional checking to see if case 1 really
** is satisfied.
*/
if( chngToIN ){
int okToChngToIN = 0; /* True if the conversion to IN is valid */
int iColumn = -1; /* Column index on lhs of IN operator */
int iCursor; /* Table cursor common to all terms */
int j = 0; /* Loop counter */
/* Search for a table and column that appears on one side or the
** other of the == operator in every subterm. That table and column
** will be recorded in iCursor and iColumn. There might not be any
** such table and column. Set okToChngToIN if an appropriate table
** and column is found but leave okToChngToIN false if not found.
*/
for(j=0; j<2 && !okToChngToIN; j++){
pOrTerm = pOrWc->a;
for(i=pOrWc->nTerm-1; i>=0; i--, pOrTerm++){
assert( pOrTerm->eOperator==WO_EQ );
pOrTerm->wtFlags &= ~TERM_OR_OK;
if( pOrTerm->leftCursor==iColumn ) continue;
if( (chngToIN & getMask(pMaskSet, pOrTerm->leftCursor))==0 ) continue;
iColumn = pOrTerm->u.leftColumn;
iCursor = pOrTerm->leftCursor;
break;
}
if( i<0 ){
assert( j==1 );
assert( (chngToIN&(chngToIN-1))==0 );
assert( chngToIN==getMask(pMaskSet, iColumn) );
break;
}
okToChngToIN = 1;
for(; i>=0 && okToChngToIN; i--, pOrTerm++){
assert( pOrTerm->eOperator==WO_EQ );
if( pOrTerm->leftCursor!=iCursor ){
pOrTerm->wtFlags &= ~TERM_OR_OK;
}else if( pOrTerm->u.leftColumn!=iColumn ){
okToChngToIN = 0;
}else{
int affLeft, affRight;
/* If the right-hand side is also a column, then the affinities
** of both right and left sides must be such that no type
** conversions are required on the right. (Ticket #2249)
*/
affRight = sqlite3ExprAffinity(pOrTerm->pExpr->pRight);
affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
if( affRight!=0 && affRight!=affLeft ){
okToChngToIN = 0;
}else{
pOrTerm->wtFlags |= TERM_OR_OK;
}
}
}
}
/* At this point, okToChngToIN is true if original pTerm satisfies
** case 1. In that case, construct a new virtual term that is
** pTerm converted into an IN operator.
*/
if( okToChngToIN ){
Expr *pDup; /* A transient duplicate expression */
ExprList *pList = 0; /* The RHS of the IN operator */
Expr *pLeft = 0; /* The LHS of the IN operator */
Expr *pNew; /* The complete IN operator */
for(i=pOrWc->nTerm-1, pOrTerm=pOrWc->a; i>=0; i--, pOrTerm++){
if( (pOrTerm->wtFlags & TERM_OR_OK)==0 ) continue;
assert( pOrTerm->eOperator==WO_EQ );
assert( pOrTerm->leftCursor==iCursor );
assert( pOrTerm->u.leftColumn==iColumn );
pDup = sqlite3ExprDup(db, pOrTerm->pExpr->pRight);
pList = sqlite3ExprListAppend(pWC->pParse, pList, pDup, 0);
pLeft = pOrTerm->pExpr->pLeft;
}
assert( pLeft!=0 );
pDup = sqlite3ExprDup(db, pLeft);
pNew = sqlite3Expr(db, TK_IN, pDup, 0, 0);
if( pNew ){
int idxNew;
transferJoinMarkings(pNew, pExpr);
pNew->pList = pList;
idxNew = whereClauseInsert(pWC, pNew, TERM_VIRTUAL|TERM_DYNAMIC);
testcase( idxNew==0 );
exprAnalyze(pSrc, pWC, idxNew);
pTerm = &pWC->a[idxTerm];
pWC->a[idxNew].iParent = idxTerm;
pTerm->nChild = 1;
}else{
sqlite3ExprListDelete(db, pList);
}
pTerm->eOperator = 0; /* case 1 trumps case 2 */
}
} }
/* This is either a singleton term or else it is a duplicate for
** which the original did not qualify. Either way we are done for. */
return 0;
} }
#endif /* !SQLITE_OMIT_OR_OPTIMIZATION && !SQLITE_OMIT_SUBQUERY */ #endif /* !SQLITE_OMIT_OR_OPTIMIZATION && !SQLITE_OMIT_SUBQUERY */
/* /*
** The input to this routine is an WhereTerm structure with only the ** The input to this routine is an WhereTerm structure with only the
** "pExpr" field filled in. The job of this routine is to analyze the ** "pExpr" field filled in. The job of this routine is to analyze the
@@ -797,28 +958,34 @@ static int orTermHasOkDuplicate(WhereClause *pOr, WhereTerm *pOrTerm){
** structure. ** structure.
** **
** If the expression is of the form "<expr> <op> X" it gets commuted ** If the expression is of the form "<expr> <op> X" it gets commuted
** to the standard form of "X <op> <expr>". If the expression is of ** to the standard form of "X <op> <expr>".
** the form "X <op> Y" where both X and Y are columns, then the original **
** expression is unchanged and a new virtual expression of the form ** If the expression is of the form "X <op> Y" where both X and Y are
** "Y <op> X" is added to the WHERE clause and analyzed separately. ** columns, then the original expression is unchanged and a new virtual
** term of the form "Y <op> X" is added to the WHERE clause and
** analyzed separately. The original term is marked with TERM_COPIED
** and the new term is marked with TERM_DYNAMIC (because it's pExpr
** needs to be freed with the WhereClause) and TERM_VIRTUAL (because it
** is a commuted copy of a prior term.) The original term has nChild=1
** and the copy has idxParent set to the index of the original term.
*/ */
static void exprAnalyze( static void exprAnalyze(
SrcList *pSrc, /* the FROM clause */ SrcList *pSrc, /* the FROM clause */
WhereClause *pWC, /* the WHERE clause */ WhereClause *pWC, /* the WHERE clause */
int idxTerm /* Index of the term to be analyzed */ int idxTerm /* Index of the term to be analyzed */
){ ){
WhereTerm *pTerm; WhereTerm *pTerm; /* The term to be analyzed */
ExprMaskSet *pMaskSet; ExprMaskSet *pMaskSet; /* Set of table index masks */
Expr *pExpr; Expr *pExpr; /* The expression to be analyzed */
Bitmask prereqLeft; Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
Bitmask prereqAll; Bitmask prereqAll; /* Prerequesites of pExpr */
Bitmask extraRight = 0; Bitmask extraRight = 0;
int nPattern; int nPattern;
int isComplete; int isComplete;
int noCase; int noCase;
int op; int op; /* Top-level operator. pExpr->op */
Parse *pParse = pWC->pParse; Parse *pParse = pWC->pParse; /* Parsing context */
sqlite3 *db = pParse->db; sqlite3 *db = pParse->db; /* Database connection */
if( db->mallocFailed ){ if( db->mallocFailed ){
return; return;
@@ -889,7 +1056,19 @@ static void exprAnalyze(
#ifndef SQLITE_OMIT_BETWEEN_OPTIMIZATION #ifndef SQLITE_OMIT_BETWEEN_OPTIMIZATION
/* If a term is the BETWEEN operator, create two new virtual terms /* If a term is the BETWEEN operator, create two new virtual terms
** that define the range that the BETWEEN implements. ** that define the range that the BETWEEN implements. For example:
**
** a BETWEEN b AND c
**
** is converted into:
**
** (a BETWEEN b AND c) AND (a>=b) AND (a<=c)
**
** The two new terms are added onto the end of the WhereClause object.
** The new terms are "dynamic" and are children of the original BETWEEN
** term. That means that if the BETWEEN term is coded, the children are
** skipped. Or, if the children are satisfied by an index, the original
** BETWEEN term is skipped.
*/ */
else if( pExpr->op==TK_BETWEEN ){ else if( pExpr->op==TK_BETWEEN ){
ExprList *pList = pExpr->pList; ExprList *pList = pExpr->pList;
@@ -913,79 +1092,11 @@ static void exprAnalyze(
#endif /* SQLITE_OMIT_BETWEEN_OPTIMIZATION */ #endif /* SQLITE_OMIT_BETWEEN_OPTIMIZATION */
#if !defined(SQLITE_OMIT_OR_OPTIMIZATION) && !defined(SQLITE_OMIT_SUBQUERY) #if !defined(SQLITE_OMIT_OR_OPTIMIZATION) && !defined(SQLITE_OMIT_SUBQUERY)
/* Attempt to convert OR-connected terms into an IN operator so that /* Analyze a term that is composed of two or more subterms connected by
** they can make use of indices. Example: ** an OR operator.
**
** x = expr1 OR expr2 = x OR x = expr3
**
** is converted into
**
** x IN (expr1,expr2,expr3)
**
** This optimization must be omitted if OMIT_SUBQUERY is defined because
** the compiler for the the IN operator is part of sub-queries.
*/ */
else if( pExpr->op==TK_OR ){ else if( pExpr->op==TK_OR ){
int ok; exprAnalyzeOrTerm(pSrc, pWC, idxTerm);
int i, j;
int iColumn, iCursor;
WhereClause sOr;
WhereTerm *pOrTerm;
assert( (pTerm->wtFlags & TERM_DYNAMIC)==0 );
whereClauseInit(&sOr, pWC->pParse, pMaskSet);
whereSplit(&sOr, pExpr, TK_OR);
exprAnalyzeAll(pSrc, &sOr);
assert( sOr.nTerm>=2 );
j = 0;
if( db->mallocFailed ) goto or_not_possible;
do{
assert( j<sOr.nTerm );
iColumn = sOr.a[j].u.leftColumn;
iCursor = sOr.a[j].leftCursor;
ok = iCursor>=0;
for(i=sOr.nTerm-1, pOrTerm=sOr.a; i>=0 && ok; i--, pOrTerm++){
if( pOrTerm->eOperator!=WO_EQ ){
goto or_not_possible;
}
if( orTermIsOptCandidate(pOrTerm, iCursor, iColumn) ){
pOrTerm->wtFlags |= TERM_OR_OK;
}else if( orTermHasOkDuplicate(&sOr, pOrTerm) ){
pOrTerm->wtFlags &= ~TERM_OR_OK;
}else{
ok = 0;
}
}
}while( !ok && (sOr.a[j++].wtFlags & TERM_COPIED)!=0 && j<2 );
if( ok ){
ExprList *pList = 0;
Expr *pNew, *pDup;
Expr *pLeft = 0;
for(i=sOr.nTerm-1, pOrTerm=sOr.a; i>=0; i--, pOrTerm++){
if( (pOrTerm->wtFlags & TERM_OR_OK)==0 ) continue;
pDup = sqlite3ExprDup(db, pOrTerm->pExpr->pRight);
pList = sqlite3ExprListAppend(pWC->pParse, pList, pDup, 0);
pLeft = pOrTerm->pExpr->pLeft;
}
assert( pLeft!=0 );
pDup = sqlite3ExprDup(db, pLeft);
pNew = sqlite3Expr(db, TK_IN, pDup, 0, 0);
if( pNew ){
int idxNew;
transferJoinMarkings(pNew, pExpr);
pNew->pList = pList;
idxNew = whereClauseInsert(pWC, pNew, TERM_VIRTUAL|TERM_DYNAMIC);
testcase( idxNew==0 );
exprAnalyze(pSrc, pWC, idxNew);
pTerm = &pWC->a[idxTerm];
pWC->a[idxNew].iParent = idxTerm;
pTerm->nChild = 1;
}else{
sqlite3ExprListDelete(db, pList);
}
}
or_not_possible:
whereClauseClear(&sOr);
} }
#endif /* SQLITE_OMIT_OR_OPTIMIZATION */ #endif /* SQLITE_OMIT_OR_OPTIMIZATION */