dvander@1203: /* dvander@1203: ** 2001 September 15 dvander@1203: ** dvander@1203: ** The author disclaims copyright to this source code. In place of dvander@1203: ** a legal notice, here is a blessing: dvander@1203: ** dvander@1203: ** May you do good and not evil. dvander@1203: ** May you find forgiveness for yourself and forgive others. dvander@1203: ** May you share freely, never taking more than you give. dvander@1203: ** dvander@1203: ************************************************************************* dvander@1203: ** This file contains routines used for analyzing expressions and dvander@1203: ** for generating VDBE code that evaluates expressions in SQLite. dvander@1203: ** dvander@1203: ** $Id$ dvander@1203: */ dvander@1203: #include "sqliteInt.h" dvander@1203: #include dvander@1203: dvander@1203: /* dvander@1203: ** Return the 'affinity' of the expression pExpr if any. dvander@1203: ** dvander@1203: ** If pExpr is a column, a reference to a column via an 'AS' alias, dvander@1203: ** or a sub-select with a column as the return value, then the dvander@1203: ** affinity of that column is returned. Otherwise, 0x00 is returned, dvander@1203: ** indicating no affinity for the expression. dvander@1203: ** dvander@1203: ** i.e. the WHERE clause expresssions in the following statements all dvander@1203: ** have an affinity: dvander@1203: ** dvander@1203: ** CREATE TABLE t1(a); dvander@1203: ** SELECT * FROM t1 WHERE a; dvander@1203: ** SELECT a AS b FROM t1 WHERE b; dvander@1203: ** SELECT * FROM t1 WHERE (select a from t1); dvander@1203: */ dvander@1203: char sqlite3ExprAffinity(Expr *pExpr){ dvander@1203: int op = pExpr->op; dvander@1203: if( op==TK_SELECT ){ dvander@1203: return sqlite3ExprAffinity(pExpr->pSelect->pEList->a[0].pExpr); dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_CAST dvander@1203: if( op==TK_CAST ){ dvander@1203: return sqlite3AffinityType(&pExpr->token); dvander@1203: } dvander@1203: #endif dvander@1203: return pExpr->affinity; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Set the collating sequence for expression pExpr to be the collating dvander@1203: ** sequence named by pToken. Return a pointer to the revised expression. dvander@1203: ** The collating sequence is marked as "explicit" using the EP_ExpCollate dvander@1203: ** flag. An explicit collating sequence will override implicit dvander@1203: ** collating sequences. dvander@1203: */ dvander@1203: Expr *sqlite3ExprSetColl(Parse *pParse, Expr *pExpr, Token *pName){ dvander@1203: CollSeq *pColl; dvander@1203: if( pExpr==0 ) return 0; dvander@1203: pColl = sqlite3LocateCollSeq(pParse, (char*)pName->z, pName->n); dvander@1203: if( pColl ){ dvander@1203: pExpr->pColl = pColl; dvander@1203: pExpr->flags |= EP_ExpCollate; dvander@1203: } dvander@1203: return pExpr; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Return the default collation sequence for the expression pExpr. If dvander@1203: ** there is no default collation type, return 0. dvander@1203: */ dvander@1203: CollSeq *sqlite3ExprCollSeq(Parse *pParse, Expr *pExpr){ dvander@1203: CollSeq *pColl = 0; dvander@1203: if( pExpr ){ dvander@1203: int op; dvander@1203: pColl = pExpr->pColl; dvander@1203: op = pExpr->op; dvander@1203: if( (op==TK_CAST || op==TK_UPLUS) && !pColl ){ dvander@1203: return sqlite3ExprCollSeq(pParse, pExpr->pLeft); dvander@1203: } dvander@1203: } dvander@1203: if( sqlite3CheckCollSeq(pParse, pColl) ){ dvander@1203: pColl = 0; dvander@1203: } dvander@1203: return pColl; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** pExpr is an operand of a comparison operator. aff2 is the dvander@1203: ** type affinity of the other operand. This routine returns the dvander@1203: ** type affinity that should be used for the comparison operator. dvander@1203: */ dvander@1203: char sqlite3CompareAffinity(Expr *pExpr, char aff2){ dvander@1203: char aff1 = sqlite3ExprAffinity(pExpr); dvander@1203: if( aff1 && aff2 ){ dvander@1203: /* Both sides of the comparison are columns. If one has numeric dvander@1203: ** affinity, use that. Otherwise use no affinity. dvander@1203: */ dvander@1203: if( sqlite3IsNumericAffinity(aff1) || sqlite3IsNumericAffinity(aff2) ){ dvander@1203: return SQLITE_AFF_NUMERIC; dvander@1203: }else{ dvander@1203: return SQLITE_AFF_NONE; dvander@1203: } dvander@1203: }else if( !aff1 && !aff2 ){ dvander@1203: /* Neither side of the comparison is a column. Compare the dvander@1203: ** results directly. dvander@1203: */ dvander@1203: return SQLITE_AFF_NONE; dvander@1203: }else{ dvander@1203: /* One side is a column, the other is not. Use the columns affinity. */ dvander@1203: assert( aff1==0 || aff2==0 ); dvander@1203: return (aff1 + aff2); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** pExpr is a comparison operator. Return the type affinity that should dvander@1203: ** be applied to both operands prior to doing the comparison. dvander@1203: */ dvander@1203: static char comparisonAffinity(Expr *pExpr){ dvander@1203: char aff; dvander@1203: assert( pExpr->op==TK_EQ || pExpr->op==TK_IN || pExpr->op==TK_LT || dvander@1203: pExpr->op==TK_GT || pExpr->op==TK_GE || pExpr->op==TK_LE || dvander@1203: pExpr->op==TK_NE ); dvander@1203: assert( pExpr->pLeft ); dvander@1203: aff = sqlite3ExprAffinity(pExpr->pLeft); dvander@1203: if( pExpr->pRight ){ dvander@1203: aff = sqlite3CompareAffinity(pExpr->pRight, aff); dvander@1203: } dvander@1203: else if( pExpr->pSelect ){ dvander@1203: aff = sqlite3CompareAffinity(pExpr->pSelect->pEList->a[0].pExpr, aff); dvander@1203: } dvander@1203: else if( !aff ){ dvander@1203: aff = SQLITE_AFF_NONE; dvander@1203: } dvander@1203: return aff; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** pExpr is a comparison expression, eg. '=', '<', IN(...) etc. dvander@1203: ** idx_affinity is the affinity of an indexed column. Return true dvander@1203: ** if the index with affinity idx_affinity may be used to implement dvander@1203: ** the comparison in pExpr. dvander@1203: */ dvander@1203: int sqlite3IndexAffinityOk(Expr *pExpr, char idx_affinity){ dvander@1203: char aff = comparisonAffinity(pExpr); dvander@1203: switch( aff ){ dvander@1203: case SQLITE_AFF_NONE: dvander@1203: return 1; dvander@1203: case SQLITE_AFF_TEXT: dvander@1203: return idx_affinity==SQLITE_AFF_TEXT; dvander@1203: default: dvander@1203: return sqlite3IsNumericAffinity(idx_affinity); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Return the P1 value that should be used for a binary comparison dvander@1203: ** opcode (OP_Eq, OP_Ge etc.) used to compare pExpr1 and pExpr2. dvander@1203: ** If jumpIfNull is true, then set the low byte of the returned dvander@1203: ** P1 value to tell the opcode to jump if either expression dvander@1203: ** evaluates to NULL. dvander@1203: */ dvander@1203: static int binaryCompareP1(Expr *pExpr1, Expr *pExpr2, int jumpIfNull){ dvander@1203: char aff = sqlite3ExprAffinity(pExpr2); dvander@1203: return ((int)sqlite3CompareAffinity(pExpr1, aff))+(jumpIfNull?0x100:0); dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Return a pointer to the collation sequence that should be used by dvander@1203: ** a binary comparison operator comparing pLeft and pRight. dvander@1203: ** dvander@1203: ** If the left hand expression has a collating sequence type, then it is dvander@1203: ** used. Otherwise the collation sequence for the right hand expression dvander@1203: ** is used, or the default (BINARY) if neither expression has a collating dvander@1203: ** type. dvander@1203: ** dvander@1203: ** Argument pRight (but not pLeft) may be a null pointer. In this case, dvander@1203: ** it is not considered. dvander@1203: */ dvander@1203: CollSeq* sqlite3BinaryCompareCollSeq( dvander@1203: Parse *pParse, dvander@1203: Expr *pLeft, dvander@1203: Expr *pRight dvander@1203: ){ dvander@1203: CollSeq *pColl; dvander@1203: assert( pLeft ); dvander@1203: if( pLeft->flags & EP_ExpCollate ){ dvander@1203: assert( pLeft->pColl ); dvander@1203: pColl = pLeft->pColl; dvander@1203: }else if( pRight && pRight->flags & EP_ExpCollate ){ dvander@1203: assert( pRight->pColl ); dvander@1203: pColl = pRight->pColl; dvander@1203: }else{ dvander@1203: pColl = sqlite3ExprCollSeq(pParse, pLeft); dvander@1203: if( !pColl ){ dvander@1203: pColl = sqlite3ExprCollSeq(pParse, pRight); dvander@1203: } dvander@1203: } dvander@1203: return pColl; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Generate code for a comparison operator. dvander@1203: */ dvander@1203: static int codeCompare( dvander@1203: Parse *pParse, /* The parsing (and code generating) context */ dvander@1203: Expr *pLeft, /* The left operand */ dvander@1203: Expr *pRight, /* The right operand */ dvander@1203: int opcode, /* The comparison opcode */ dvander@1203: int dest, /* Jump here if true. */ dvander@1203: int jumpIfNull /* If true, jump if either operand is NULL */ dvander@1203: ){ dvander@1203: int p1 = binaryCompareP1(pLeft, pRight, jumpIfNull); dvander@1203: CollSeq *p3 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight); dvander@1203: return sqlite3VdbeOp3(pParse->pVdbe, opcode, p1, dest, (void*)p3, P3_COLLSEQ); dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Construct a new expression node and return a pointer to it. Memory dvander@1203: ** for this node is obtained from sqliteMalloc(). The calling function dvander@1203: ** is responsible for making sure the node eventually gets freed. dvander@1203: */ dvander@1203: Expr *sqlite3Expr(int op, Expr *pLeft, Expr *pRight, const Token *pToken){ dvander@1203: Expr *pNew; dvander@1203: pNew = sqliteMalloc( sizeof(Expr) ); dvander@1203: if( pNew==0 ){ dvander@1203: /* When malloc fails, delete pLeft and pRight. Expressions passed to dvander@1203: ** this function must always be allocated with sqlite3Expr() for this dvander@1203: ** reason. dvander@1203: */ dvander@1203: sqlite3ExprDelete(pLeft); dvander@1203: sqlite3ExprDelete(pRight); dvander@1203: return 0; dvander@1203: } dvander@1203: pNew->op = op; dvander@1203: pNew->pLeft = pLeft; dvander@1203: pNew->pRight = pRight; dvander@1203: pNew->iAgg = -1; dvander@1203: if( pToken ){ dvander@1203: assert( pToken->dyn==0 ); dvander@1203: pNew->span = pNew->token = *pToken; dvander@1203: }else if( pLeft ){ dvander@1203: if( pRight ){ dvander@1203: sqlite3ExprSpan(pNew, &pLeft->span, &pRight->span); dvander@1203: if( pRight->flags & EP_ExpCollate ){ dvander@1203: pNew->flags |= EP_ExpCollate; dvander@1203: pNew->pColl = pRight->pColl; dvander@1203: } dvander@1203: } dvander@1203: if( pLeft->flags & EP_ExpCollate ){ dvander@1203: pNew->flags |= EP_ExpCollate; dvander@1203: pNew->pColl = pLeft->pColl; dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: sqlite3ExprSetHeight(pNew); dvander@1203: return pNew; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Works like sqlite3Expr() but frees its pLeft and pRight arguments dvander@1203: ** if it fails due to a malloc problem. dvander@1203: */ dvander@1203: Expr *sqlite3ExprOrFree(int op, Expr *pLeft, Expr *pRight, const Token *pToken){ dvander@1203: Expr *pNew = sqlite3Expr(op, pLeft, pRight, pToken); dvander@1203: if( pNew==0 ){ dvander@1203: sqlite3ExprDelete(pLeft); dvander@1203: sqlite3ExprDelete(pRight); dvander@1203: } dvander@1203: return pNew; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** When doing a nested parse, you can include terms in an expression dvander@1203: ** that look like this: #0 #1 #2 ... These terms refer to elements dvander@1203: ** on the stack. "#0" means the top of the stack. dvander@1203: ** "#1" means the next down on the stack. And so forth. dvander@1203: ** dvander@1203: ** This routine is called by the parser to deal with on of those terms. dvander@1203: ** It immediately generates code to store the value in a memory location. dvander@1203: ** The returns an expression that will code to extract the value from dvander@1203: ** that memory location as needed. dvander@1203: */ dvander@1203: Expr *sqlite3RegisterExpr(Parse *pParse, Token *pToken){ dvander@1203: Vdbe *v = pParse->pVdbe; dvander@1203: Expr *p; dvander@1203: int depth; dvander@1203: if( pParse->nested==0 ){ dvander@1203: sqlite3ErrorMsg(pParse, "near \"%T\": syntax error", pToken); dvander@1203: return sqlite3Expr(TK_NULL, 0, 0, 0); dvander@1203: } dvander@1203: if( v==0 ) return 0; dvander@1203: p = sqlite3Expr(TK_REGISTER, 0, 0, pToken); dvander@1203: if( p==0 ){ dvander@1203: return 0; /* Malloc failed */ dvander@1203: } dvander@1203: depth = atoi((char*)&pToken->z[1]); dvander@1203: p->iTable = pParse->nMem++; dvander@1203: sqlite3VdbeAddOp(v, OP_Dup, depth, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_MemStore, p->iTable, 1); dvander@1203: return p; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Join two expressions using an AND operator. If either expression is dvander@1203: ** NULL, then just return the other expression. dvander@1203: */ dvander@1203: Expr *sqlite3ExprAnd(Expr *pLeft, Expr *pRight){ dvander@1203: if( pLeft==0 ){ dvander@1203: return pRight; dvander@1203: }else if( pRight==0 ){ dvander@1203: return pLeft; dvander@1203: }else{ dvander@1203: return sqlite3Expr(TK_AND, pLeft, pRight, 0); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Set the Expr.span field of the given expression to span all dvander@1203: ** text between the two given tokens. dvander@1203: */ dvander@1203: void sqlite3ExprSpan(Expr *pExpr, Token *pLeft, Token *pRight){ dvander@1203: assert( pRight!=0 ); dvander@1203: assert( pLeft!=0 ); dvander@1203: if( !sqlite3MallocFailed() && pRight->z && pLeft->z ){ dvander@1203: assert( pLeft->dyn==0 || pLeft->z[pLeft->n]==0 ); dvander@1203: if( pLeft->dyn==0 && pRight->dyn==0 ){ dvander@1203: pExpr->span.z = pLeft->z; dvander@1203: pExpr->span.n = pRight->n + (pRight->z - pLeft->z); dvander@1203: }else{ dvander@1203: pExpr->span.z = 0; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Construct a new expression node for a function with multiple dvander@1203: ** arguments. dvander@1203: */ dvander@1203: Expr *sqlite3ExprFunction(ExprList *pList, Token *pToken){ dvander@1203: Expr *pNew; dvander@1203: assert( pToken ); dvander@1203: pNew = sqliteMalloc( sizeof(Expr) ); dvander@1203: if( pNew==0 ){ dvander@1203: sqlite3ExprListDelete(pList); /* Avoid leaking memory when malloc fails */ dvander@1203: return 0; dvander@1203: } dvander@1203: pNew->op = TK_FUNCTION; dvander@1203: pNew->pList = pList; dvander@1203: assert( pToken->dyn==0 ); dvander@1203: pNew->token = *pToken; dvander@1203: pNew->span = pNew->token; dvander@1203: dvander@1203: sqlite3ExprSetHeight(pNew); dvander@1203: return pNew; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Assign a variable number to an expression that encodes a wildcard dvander@1203: ** in the original SQL statement. dvander@1203: ** dvander@1203: ** Wildcards consisting of a single "?" are assigned the next sequential dvander@1203: ** variable number. dvander@1203: ** dvander@1203: ** Wildcards of the form "?nnn" are assigned the number "nnn". We make dvander@1203: ** sure "nnn" is not too be to avoid a denial of service attack when dvander@1203: ** the SQL statement comes from an external source. dvander@1203: ** dvander@1203: ** Wildcards of the form ":aaa" or "$aaa" are assigned the same number dvander@1203: ** as the previous instance of the same wildcard. Or if this is the first dvander@1203: ** instance of the wildcard, the next sequenial variable number is dvander@1203: ** assigned. dvander@1203: */ dvander@1203: void sqlite3ExprAssignVarNumber(Parse *pParse, Expr *pExpr){ dvander@1203: Token *pToken; dvander@1203: if( pExpr==0 ) return; dvander@1203: pToken = &pExpr->token; dvander@1203: assert( pToken->n>=1 ); dvander@1203: assert( pToken->z!=0 ); dvander@1203: assert( pToken->z[0]!=0 ); dvander@1203: if( pToken->n==1 ){ dvander@1203: /* Wildcard of the form "?". Assign the next variable number */ dvander@1203: pExpr->iTable = ++pParse->nVar; dvander@1203: }else if( pToken->z[0]=='?' ){ dvander@1203: /* Wildcard of the form "?nnn". Convert "nnn" to an integer and dvander@1203: ** use it as the variable number */ dvander@1203: int i; dvander@1203: pExpr->iTable = i = atoi((char*)&pToken->z[1]); dvander@1203: if( i<1 || i>SQLITE_MAX_VARIABLE_NUMBER ){ dvander@1203: sqlite3ErrorMsg(pParse, "variable number must be between ?1 and ?%d", dvander@1203: SQLITE_MAX_VARIABLE_NUMBER); dvander@1203: } dvander@1203: if( i>pParse->nVar ){ dvander@1203: pParse->nVar = i; dvander@1203: } dvander@1203: }else{ dvander@1203: /* Wildcards of the form ":aaa" or "$aaa". Reuse the same variable dvander@1203: ** number as the prior appearance of the same name, or if the name dvander@1203: ** has never appeared before, reuse the same variable number dvander@1203: */ dvander@1203: int i, n; dvander@1203: n = pToken->n; dvander@1203: for(i=0; inVarExpr; i++){ dvander@1203: Expr *pE; dvander@1203: if( (pE = pParse->apVarExpr[i])!=0 dvander@1203: && pE->token.n==n dvander@1203: && memcmp(pE->token.z, pToken->z, n)==0 ){ dvander@1203: pExpr->iTable = pE->iTable; dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: if( i>=pParse->nVarExpr ){ dvander@1203: pExpr->iTable = ++pParse->nVar; dvander@1203: if( pParse->nVarExpr>=pParse->nVarExprAlloc-1 ){ dvander@1203: pParse->nVarExprAlloc += pParse->nVarExprAlloc + 10; dvander@1203: pParse->apVarExpr = sqliteReallocOrFree(pParse->apVarExpr, dvander@1203: pParse->nVarExprAlloc*sizeof(pParse->apVarExpr[0]) ); dvander@1203: } dvander@1203: if( !sqlite3MallocFailed() ){ dvander@1203: assert( pParse->apVarExpr!=0 ); dvander@1203: pParse->apVarExpr[pParse->nVarExpr++] = pExpr; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: if( !pParse->nErr && pParse->nVar>SQLITE_MAX_VARIABLE_NUMBER ){ dvander@1203: sqlite3ErrorMsg(pParse, "too many SQL variables"); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Recursively delete an expression tree. dvander@1203: */ dvander@1203: void sqlite3ExprDelete(Expr *p){ dvander@1203: if( p==0 ) return; dvander@1203: if( p->span.dyn ) sqliteFree((char*)p->span.z); dvander@1203: if( p->token.dyn ) sqliteFree((char*)p->token.z); dvander@1203: sqlite3ExprDelete(p->pLeft); dvander@1203: sqlite3ExprDelete(p->pRight); dvander@1203: sqlite3ExprListDelete(p->pList); dvander@1203: sqlite3SelectDelete(p->pSelect); dvander@1203: sqliteFree(p); dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** The Expr.token field might be a string literal that is quoted. dvander@1203: ** If so, remove the quotation marks. dvander@1203: */ dvander@1203: void sqlite3DequoteExpr(Expr *p){ dvander@1203: if( ExprHasAnyProperty(p, EP_Dequoted) ){ dvander@1203: return; dvander@1203: } dvander@1203: ExprSetProperty(p, EP_Dequoted); dvander@1203: if( p->token.dyn==0 ){ dvander@1203: sqlite3TokenCopy(&p->token, &p->token); dvander@1203: } dvander@1203: sqlite3Dequote((char*)p->token.z); dvander@1203: } dvander@1203: dvander@1203: dvander@1203: /* dvander@1203: ** The following group of routines make deep copies of expressions, dvander@1203: ** expression lists, ID lists, and select statements. The copies can dvander@1203: ** be deleted (by being passed to their respective ...Delete() routines) dvander@1203: ** without effecting the originals. dvander@1203: ** dvander@1203: ** The expression list, ID, and source lists return by sqlite3ExprListDup(), dvander@1203: ** sqlite3IdListDup(), and sqlite3SrcListDup() can not be further expanded dvander@1203: ** by subsequent calls to sqlite*ListAppend() routines. dvander@1203: ** dvander@1203: ** Any tables that the SrcList might point to are not duplicated. dvander@1203: */ dvander@1203: Expr *sqlite3ExprDup(Expr *p){ dvander@1203: Expr *pNew; dvander@1203: if( p==0 ) return 0; dvander@1203: pNew = sqliteMallocRaw( sizeof(*p) ); dvander@1203: if( pNew==0 ) return 0; dvander@1203: memcpy(pNew, p, sizeof(*pNew)); dvander@1203: if( p->token.z!=0 ){ dvander@1203: pNew->token.z = (u8*)sqliteStrNDup((char*)p->token.z, p->token.n); dvander@1203: pNew->token.dyn = 1; dvander@1203: }else{ dvander@1203: assert( pNew->token.z==0 ); dvander@1203: } dvander@1203: pNew->span.z = 0; dvander@1203: pNew->pLeft = sqlite3ExprDup(p->pLeft); dvander@1203: pNew->pRight = sqlite3ExprDup(p->pRight); dvander@1203: pNew->pList = sqlite3ExprListDup(p->pList); dvander@1203: pNew->pSelect = sqlite3SelectDup(p->pSelect); dvander@1203: return pNew; dvander@1203: } dvander@1203: void sqlite3TokenCopy(Token *pTo, Token *pFrom){ dvander@1203: if( pTo->dyn ) sqliteFree((char*)pTo->z); dvander@1203: if( pFrom->z ){ dvander@1203: pTo->n = pFrom->n; dvander@1203: pTo->z = (u8*)sqliteStrNDup((char*)pFrom->z, pFrom->n); dvander@1203: pTo->dyn = 1; dvander@1203: }else{ dvander@1203: pTo->z = 0; dvander@1203: } dvander@1203: } dvander@1203: ExprList *sqlite3ExprListDup(ExprList *p){ dvander@1203: ExprList *pNew; dvander@1203: struct ExprList_item *pItem, *pOldItem; dvander@1203: int i; dvander@1203: if( p==0 ) return 0; dvander@1203: pNew = sqliteMalloc( sizeof(*pNew) ); dvander@1203: if( pNew==0 ) return 0; dvander@1203: pNew->nExpr = pNew->nAlloc = p->nExpr; dvander@1203: pNew->a = pItem = sqliteMalloc( p->nExpr*sizeof(p->a[0]) ); dvander@1203: if( pItem==0 ){ dvander@1203: sqliteFree(pNew); dvander@1203: return 0; dvander@1203: } dvander@1203: pOldItem = p->a; dvander@1203: for(i=0; inExpr; i++, pItem++, pOldItem++){ dvander@1203: Expr *pNewExpr, *pOldExpr; dvander@1203: pItem->pExpr = pNewExpr = sqlite3ExprDup(pOldExpr = pOldItem->pExpr); dvander@1203: if( pOldExpr->span.z!=0 && pNewExpr ){ dvander@1203: /* Always make a copy of the span for top-level expressions in the dvander@1203: ** expression list. The logic in SELECT processing that determines dvander@1203: ** the names of columns in the result set needs this information */ dvander@1203: sqlite3TokenCopy(&pNewExpr->span, &pOldExpr->span); dvander@1203: } dvander@1203: assert( pNewExpr==0 || pNewExpr->span.z!=0 dvander@1203: || pOldExpr->span.z==0 dvander@1203: || sqlite3MallocFailed() ); dvander@1203: pItem->zName = sqliteStrDup(pOldItem->zName); dvander@1203: pItem->sortOrder = pOldItem->sortOrder; dvander@1203: pItem->isAgg = pOldItem->isAgg; dvander@1203: pItem->done = 0; dvander@1203: } dvander@1203: return pNew; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** If cursors, triggers, views and subqueries are all omitted from dvander@1203: ** the build, then none of the following routines, except for dvander@1203: ** sqlite3SelectDup(), can be called. sqlite3SelectDup() is sometimes dvander@1203: ** called with a NULL argument. dvander@1203: */ dvander@1203: #if !defined(SQLITE_OMIT_VIEW) || !defined(SQLITE_OMIT_TRIGGER) \ dvander@1203: || !defined(SQLITE_OMIT_SUBQUERY) dvander@1203: SrcList *sqlite3SrcListDup(SrcList *p){ dvander@1203: SrcList *pNew; dvander@1203: int i; dvander@1203: int nByte; dvander@1203: if( p==0 ) return 0; dvander@1203: nByte = sizeof(*p) + (p->nSrc>0 ? sizeof(p->a[0]) * (p->nSrc-1) : 0); dvander@1203: pNew = sqliteMallocRaw( nByte ); dvander@1203: if( pNew==0 ) return 0; dvander@1203: pNew->nSrc = pNew->nAlloc = p->nSrc; dvander@1203: for(i=0; inSrc; i++){ dvander@1203: struct SrcList_item *pNewItem = &pNew->a[i]; dvander@1203: struct SrcList_item *pOldItem = &p->a[i]; dvander@1203: Table *pTab; dvander@1203: pNewItem->zDatabase = sqliteStrDup(pOldItem->zDatabase); dvander@1203: pNewItem->zName = sqliteStrDup(pOldItem->zName); dvander@1203: pNewItem->zAlias = sqliteStrDup(pOldItem->zAlias); dvander@1203: pNewItem->jointype = pOldItem->jointype; dvander@1203: pNewItem->iCursor = pOldItem->iCursor; dvander@1203: pNewItem->isPopulated = pOldItem->isPopulated; dvander@1203: pTab = pNewItem->pTab = pOldItem->pTab; dvander@1203: if( pTab ){ dvander@1203: pTab->nRef++; dvander@1203: } dvander@1203: pNewItem->pSelect = sqlite3SelectDup(pOldItem->pSelect); dvander@1203: pNewItem->pOn = sqlite3ExprDup(pOldItem->pOn); dvander@1203: pNewItem->pUsing = sqlite3IdListDup(pOldItem->pUsing); dvander@1203: pNewItem->colUsed = pOldItem->colUsed; dvander@1203: } dvander@1203: return pNew; dvander@1203: } dvander@1203: IdList *sqlite3IdListDup(IdList *p){ dvander@1203: IdList *pNew; dvander@1203: int i; dvander@1203: if( p==0 ) return 0; dvander@1203: pNew = sqliteMallocRaw( sizeof(*pNew) ); dvander@1203: if( pNew==0 ) return 0; dvander@1203: pNew->nId = pNew->nAlloc = p->nId; dvander@1203: pNew->a = sqliteMallocRaw( p->nId*sizeof(p->a[0]) ); dvander@1203: if( pNew->a==0 ){ dvander@1203: sqliteFree(pNew); dvander@1203: return 0; dvander@1203: } dvander@1203: for(i=0; inId; i++){ dvander@1203: struct IdList_item *pNewItem = &pNew->a[i]; dvander@1203: struct IdList_item *pOldItem = &p->a[i]; dvander@1203: pNewItem->zName = sqliteStrDup(pOldItem->zName); dvander@1203: pNewItem->idx = pOldItem->idx; dvander@1203: } dvander@1203: return pNew; dvander@1203: } dvander@1203: Select *sqlite3SelectDup(Select *p){ dvander@1203: Select *pNew; dvander@1203: if( p==0 ) return 0; dvander@1203: pNew = sqliteMallocRaw( sizeof(*p) ); dvander@1203: if( pNew==0 ) return 0; dvander@1203: pNew->isDistinct = p->isDistinct; dvander@1203: pNew->pEList = sqlite3ExprListDup(p->pEList); dvander@1203: pNew->pSrc = sqlite3SrcListDup(p->pSrc); dvander@1203: pNew->pWhere = sqlite3ExprDup(p->pWhere); dvander@1203: pNew->pGroupBy = sqlite3ExprListDup(p->pGroupBy); dvander@1203: pNew->pHaving = sqlite3ExprDup(p->pHaving); dvander@1203: pNew->pOrderBy = sqlite3ExprListDup(p->pOrderBy); dvander@1203: pNew->op = p->op; dvander@1203: pNew->pPrior = sqlite3SelectDup(p->pPrior); dvander@1203: pNew->pLimit = sqlite3ExprDup(p->pLimit); dvander@1203: pNew->pOffset = sqlite3ExprDup(p->pOffset); dvander@1203: pNew->iLimit = -1; dvander@1203: pNew->iOffset = -1; dvander@1203: pNew->isResolved = p->isResolved; dvander@1203: pNew->isAgg = p->isAgg; dvander@1203: pNew->usesEphm = 0; dvander@1203: pNew->disallowOrderBy = 0; dvander@1203: pNew->pRightmost = 0; dvander@1203: pNew->addrOpenEphm[0] = -1; dvander@1203: pNew->addrOpenEphm[1] = -1; dvander@1203: pNew->addrOpenEphm[2] = -1; dvander@1203: return pNew; dvander@1203: } dvander@1203: #else dvander@1203: Select *sqlite3SelectDup(Select *p){ dvander@1203: assert( p==0 ); dvander@1203: return 0; dvander@1203: } dvander@1203: #endif dvander@1203: dvander@1203: dvander@1203: /* dvander@1203: ** Add a new element to the end of an expression list. If pList is dvander@1203: ** initially NULL, then create a new expression list. dvander@1203: */ dvander@1203: ExprList *sqlite3ExprListAppend(ExprList *pList, Expr *pExpr, Token *pName){ dvander@1203: if( pList==0 ){ dvander@1203: pList = sqliteMalloc( sizeof(ExprList) ); dvander@1203: if( pList==0 ){ dvander@1203: goto no_mem; dvander@1203: } dvander@1203: assert( pList->nAlloc==0 ); dvander@1203: } dvander@1203: if( pList->nAlloc<=pList->nExpr ){ dvander@1203: struct ExprList_item *a; dvander@1203: int n = pList->nAlloc*2 + 4; dvander@1203: a = sqliteRealloc(pList->a, n*sizeof(pList->a[0])); dvander@1203: if( a==0 ){ dvander@1203: goto no_mem; dvander@1203: } dvander@1203: pList->a = a; dvander@1203: pList->nAlloc = n; dvander@1203: } dvander@1203: assert( pList->a!=0 ); dvander@1203: if( pExpr || pName ){ dvander@1203: struct ExprList_item *pItem = &pList->a[pList->nExpr++]; dvander@1203: memset(pItem, 0, sizeof(*pItem)); dvander@1203: pItem->zName = sqlite3NameFromToken(pName); dvander@1203: pItem->pExpr = pExpr; dvander@1203: } dvander@1203: return pList; dvander@1203: dvander@1203: no_mem: dvander@1203: /* Avoid leaking memory if malloc has failed. */ dvander@1203: sqlite3ExprDelete(pExpr); dvander@1203: sqlite3ExprListDelete(pList); dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** If the expression list pEList contains more than iLimit elements, dvander@1203: ** leave an error message in pParse. dvander@1203: */ dvander@1203: void sqlite3ExprListCheckLength( dvander@1203: Parse *pParse, dvander@1203: ExprList *pEList, dvander@1203: int iLimit, dvander@1203: const char *zObject dvander@1203: ){ dvander@1203: if( pEList && pEList->nExpr>iLimit ){ dvander@1203: sqlite3ErrorMsg(pParse, "too many columns in %s", zObject); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: dvander@1203: #if SQLITE_MAX_EXPR_DEPTH>0 dvander@1203: /* The following three functions, heightOfExpr(), heightOfExprList() dvander@1203: ** and heightOfSelect(), are used to determine the maximum height dvander@1203: ** of any expression tree referenced by the structure passed as the dvander@1203: ** first argument. dvander@1203: ** dvander@1203: ** If this maximum height is greater than the current value pointed dvander@1203: ** to by pnHeight, the second parameter, then set *pnHeight to that dvander@1203: ** value. dvander@1203: */ dvander@1203: static void heightOfExpr(Expr *p, int *pnHeight){ dvander@1203: if( p ){ dvander@1203: if( p->nHeight>*pnHeight ){ dvander@1203: *pnHeight = p->nHeight; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: static void heightOfExprList(ExprList *p, int *pnHeight){ dvander@1203: if( p ){ dvander@1203: int i; dvander@1203: for(i=0; inExpr; i++){ dvander@1203: heightOfExpr(p->a[i].pExpr, pnHeight); dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: static void heightOfSelect(Select *p, int *pnHeight){ dvander@1203: if( p ){ dvander@1203: heightOfExpr(p->pWhere, pnHeight); dvander@1203: heightOfExpr(p->pHaving, pnHeight); dvander@1203: heightOfExpr(p->pLimit, pnHeight); dvander@1203: heightOfExpr(p->pOffset, pnHeight); dvander@1203: heightOfExprList(p->pEList, pnHeight); dvander@1203: heightOfExprList(p->pGroupBy, pnHeight); dvander@1203: heightOfExprList(p->pOrderBy, pnHeight); dvander@1203: heightOfSelect(p->pPrior, pnHeight); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Set the Expr.nHeight variable in the structure passed as an dvander@1203: ** argument. An expression with no children, Expr.pList or dvander@1203: ** Expr.pSelect member has a height of 1. Any other expression dvander@1203: ** has a height equal to the maximum height of any other dvander@1203: ** referenced Expr plus one. dvander@1203: */ dvander@1203: void sqlite3ExprSetHeight(Expr *p){ dvander@1203: int nHeight = 0; dvander@1203: heightOfExpr(p->pLeft, &nHeight); dvander@1203: heightOfExpr(p->pRight, &nHeight); dvander@1203: heightOfExprList(p->pList, &nHeight); dvander@1203: heightOfSelect(p->pSelect, &nHeight); dvander@1203: p->nHeight = nHeight + 1; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Return the maximum height of any expression tree referenced dvander@1203: ** by the select statement passed as an argument. dvander@1203: */ dvander@1203: int sqlite3SelectExprHeight(Select *p){ dvander@1203: int nHeight = 0; dvander@1203: heightOfSelect(p, &nHeight); dvander@1203: return nHeight; dvander@1203: } dvander@1203: #endif dvander@1203: dvander@1203: /* dvander@1203: ** Delete an entire expression list. dvander@1203: */ dvander@1203: void sqlite3ExprListDelete(ExprList *pList){ dvander@1203: int i; dvander@1203: struct ExprList_item *pItem; dvander@1203: if( pList==0 ) return; dvander@1203: assert( pList->a!=0 || (pList->nExpr==0 && pList->nAlloc==0) ); dvander@1203: assert( pList->nExpr<=pList->nAlloc ); dvander@1203: for(pItem=pList->a, i=0; inExpr; i++, pItem++){ dvander@1203: sqlite3ExprDelete(pItem->pExpr); dvander@1203: sqliteFree(pItem->zName); dvander@1203: } dvander@1203: sqliteFree(pList->a); dvander@1203: sqliteFree(pList); dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Walk an expression tree. Call xFunc for each node visited. dvander@1203: ** dvander@1203: ** The return value from xFunc determines whether the tree walk continues. dvander@1203: ** 0 means continue walking the tree. 1 means do not walk children dvander@1203: ** of the current node but continue with siblings. 2 means abandon dvander@1203: ** the tree walk completely. dvander@1203: ** dvander@1203: ** The return value from this routine is 1 to abandon the tree walk dvander@1203: ** and 0 to continue. dvander@1203: ** dvander@1203: ** NOTICE: This routine does *not* descend into subqueries. dvander@1203: */ dvander@1203: static int walkExprList(ExprList *, int (*)(void *, Expr*), void *); dvander@1203: static int walkExprTree(Expr *pExpr, int (*xFunc)(void*,Expr*), void *pArg){ dvander@1203: int rc; dvander@1203: if( pExpr==0 ) return 0; dvander@1203: rc = (*xFunc)(pArg, pExpr); dvander@1203: if( rc==0 ){ dvander@1203: if( walkExprTree(pExpr->pLeft, xFunc, pArg) ) return 1; dvander@1203: if( walkExprTree(pExpr->pRight, xFunc, pArg) ) return 1; dvander@1203: if( walkExprList(pExpr->pList, xFunc, pArg) ) return 1; dvander@1203: } dvander@1203: return rc>1; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Call walkExprTree() for every expression in list p. dvander@1203: */ dvander@1203: static int walkExprList(ExprList *p, int (*xFunc)(void *, Expr*), void *pArg){ dvander@1203: int i; dvander@1203: struct ExprList_item *pItem; dvander@1203: if( !p ) return 0; dvander@1203: for(i=p->nExpr, pItem=p->a; i>0; i--, pItem++){ dvander@1203: if( walkExprTree(pItem->pExpr, xFunc, pArg) ) return 1; dvander@1203: } dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Call walkExprTree() for every expression in Select p, not including dvander@1203: ** expressions that are part of sub-selects in any FROM clause or the LIMIT dvander@1203: ** or OFFSET expressions.. dvander@1203: */ dvander@1203: static int walkSelectExpr(Select *p, int (*xFunc)(void *, Expr*), void *pArg){ dvander@1203: walkExprList(p->pEList, xFunc, pArg); dvander@1203: walkExprTree(p->pWhere, xFunc, pArg); dvander@1203: walkExprList(p->pGroupBy, xFunc, pArg); dvander@1203: walkExprTree(p->pHaving, xFunc, pArg); dvander@1203: walkExprList(p->pOrderBy, xFunc, pArg); dvander@1203: if( p->pPrior ){ dvander@1203: walkSelectExpr(p->pPrior, xFunc, pArg); dvander@1203: } dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: dvander@1203: /* dvander@1203: ** This routine is designed as an xFunc for walkExprTree(). dvander@1203: ** dvander@1203: ** pArg is really a pointer to an integer. If we can tell by looking dvander@1203: ** at pExpr that the expression that contains pExpr is not a constant dvander@1203: ** expression, then set *pArg to 0 and return 2 to abandon the tree walk. dvander@1203: ** If pExpr does does not disqualify the expression from being a constant dvander@1203: ** then do nothing. dvander@1203: ** dvander@1203: ** After walking the whole tree, if no nodes are found that disqualify dvander@1203: ** the expression as constant, then we assume the whole expression dvander@1203: ** is constant. See sqlite3ExprIsConstant() for additional information. dvander@1203: */ dvander@1203: static int exprNodeIsConstant(void *pArg, Expr *pExpr){ dvander@1203: int *pN = (int*)pArg; dvander@1203: dvander@1203: /* If *pArg is 3 then any term of the expression that comes from dvander@1203: ** the ON or USING clauses of a join disqualifies the expression dvander@1203: ** from being considered constant. */ dvander@1203: if( (*pN)==3 && ExprHasAnyProperty(pExpr, EP_FromJoin) ){ dvander@1203: *pN = 0; dvander@1203: return 2; dvander@1203: } dvander@1203: dvander@1203: switch( pExpr->op ){ dvander@1203: /* Consider functions to be constant if all their arguments are constant dvander@1203: ** and *pArg==2 */ dvander@1203: case TK_FUNCTION: dvander@1203: if( (*pN)==2 ) return 0; dvander@1203: /* Fall through */ dvander@1203: case TK_ID: dvander@1203: case TK_COLUMN: dvander@1203: case TK_DOT: dvander@1203: case TK_AGG_FUNCTION: dvander@1203: case TK_AGG_COLUMN: dvander@1203: #ifndef SQLITE_OMIT_SUBQUERY dvander@1203: case TK_SELECT: dvander@1203: case TK_EXISTS: dvander@1203: #endif dvander@1203: *pN = 0; dvander@1203: return 2; dvander@1203: case TK_IN: dvander@1203: if( pExpr->pSelect ){ dvander@1203: *pN = 0; dvander@1203: return 2; dvander@1203: } dvander@1203: default: dvander@1203: return 0; dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Walk an expression tree. Return 1 if the expression is constant dvander@1203: ** and 0 if it involves variables or function calls. dvander@1203: ** dvander@1203: ** For the purposes of this function, a double-quoted string (ex: "abc") dvander@1203: ** is considered a variable but a single-quoted string (ex: 'abc') is dvander@1203: ** a constant. dvander@1203: */ dvander@1203: int sqlite3ExprIsConstant(Expr *p){ dvander@1203: int isConst = 1; dvander@1203: walkExprTree(p, exprNodeIsConstant, &isConst); dvander@1203: return isConst; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Walk an expression tree. Return 1 if the expression is constant dvander@1203: ** that does no originate from the ON or USING clauses of a join. dvander@1203: ** Return 0 if it involves variables or function calls or terms from dvander@1203: ** an ON or USING clause. dvander@1203: */ dvander@1203: int sqlite3ExprIsConstantNotJoin(Expr *p){ dvander@1203: int isConst = 3; dvander@1203: walkExprTree(p, exprNodeIsConstant, &isConst); dvander@1203: return isConst!=0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Walk an expression tree. Return 1 if the expression is constant dvander@1203: ** or a function call with constant arguments. Return and 0 if there dvander@1203: ** are any variables. dvander@1203: ** dvander@1203: ** For the purposes of this function, a double-quoted string (ex: "abc") dvander@1203: ** is considered a variable but a single-quoted string (ex: 'abc') is dvander@1203: ** a constant. dvander@1203: */ dvander@1203: int sqlite3ExprIsConstantOrFunction(Expr *p){ dvander@1203: int isConst = 2; dvander@1203: walkExprTree(p, exprNodeIsConstant, &isConst); dvander@1203: return isConst!=0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** If the expression p codes a constant integer that is small enough dvander@1203: ** to fit in a 32-bit integer, return 1 and put the value of the integer dvander@1203: ** in *pValue. If the expression is not an integer or if it is too big dvander@1203: ** to fit in a signed 32-bit integer, return 0 and leave *pValue unchanged. dvander@1203: */ dvander@1203: int sqlite3ExprIsInteger(Expr *p, int *pValue){ dvander@1203: switch( p->op ){ dvander@1203: case TK_INTEGER: { dvander@1203: if( sqlite3GetInt32((char*)p->token.z, pValue) ){ dvander@1203: return 1; dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: case TK_UPLUS: { dvander@1203: return sqlite3ExprIsInteger(p->pLeft, pValue); dvander@1203: } dvander@1203: case TK_UMINUS: { dvander@1203: int v; dvander@1203: if( sqlite3ExprIsInteger(p->pLeft, &v) ){ dvander@1203: *pValue = -v; dvander@1203: return 1; dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: default: break; dvander@1203: } dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Return TRUE if the given string is a row-id column name. dvander@1203: */ dvander@1203: int sqlite3IsRowid(const char *z){ dvander@1203: if( sqlite3StrICmp(z, "_ROWID_")==0 ) return 1; dvander@1203: if( sqlite3StrICmp(z, "ROWID")==0 ) return 1; dvander@1203: if( sqlite3StrICmp(z, "OID")==0 ) return 1; dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Given the name of a column of the form X.Y.Z or Y.Z or just Z, look up dvander@1203: ** that name in the set of source tables in pSrcList and make the pExpr dvander@1203: ** expression node refer back to that source column. The following changes dvander@1203: ** are made to pExpr: dvander@1203: ** dvander@1203: ** pExpr->iDb Set the index in db->aDb[] of the database holding dvander@1203: ** the table. dvander@1203: ** pExpr->iTable Set to the cursor number for the table obtained dvander@1203: ** from pSrcList. dvander@1203: ** pExpr->iColumn Set to the column number within the table. dvander@1203: ** pExpr->op Set to TK_COLUMN. dvander@1203: ** pExpr->pLeft Any expression this points to is deleted dvander@1203: ** pExpr->pRight Any expression this points to is deleted. dvander@1203: ** dvander@1203: ** The pDbToken is the name of the database (the "X"). This value may be dvander@1203: ** NULL meaning that name is of the form Y.Z or Z. Any available database dvander@1203: ** can be used. The pTableToken is the name of the table (the "Y"). This dvander@1203: ** value can be NULL if pDbToken is also NULL. If pTableToken is NULL it dvander@1203: ** means that the form of the name is Z and that columns from any table dvander@1203: ** can be used. dvander@1203: ** dvander@1203: ** If the name cannot be resolved unambiguously, leave an error message dvander@1203: ** in pParse and return non-zero. Return zero on success. dvander@1203: */ dvander@1203: static int lookupName( dvander@1203: Parse *pParse, /* The parsing context */ dvander@1203: Token *pDbToken, /* Name of the database containing table, or NULL */ dvander@1203: Token *pTableToken, /* Name of table containing column, or NULL */ dvander@1203: Token *pColumnToken, /* Name of the column. */ dvander@1203: NameContext *pNC, /* The name context used to resolve the name */ dvander@1203: Expr *pExpr /* Make this EXPR node point to the selected column */ dvander@1203: ){ dvander@1203: char *zDb = 0; /* Name of the database. The "X" in X.Y.Z */ dvander@1203: char *zTab = 0; /* Name of the table. The "Y" in X.Y.Z or Y.Z */ dvander@1203: char *zCol = 0; /* Name of the column. The "Z" */ dvander@1203: int i, j; /* Loop counters */ dvander@1203: int cnt = 0; /* Number of matching column names */ dvander@1203: int cntTab = 0; /* Number of matching table names */ dvander@1203: sqlite3 *db = pParse->db; /* The database */ dvander@1203: struct SrcList_item *pItem; /* Use for looping over pSrcList items */ dvander@1203: struct SrcList_item *pMatch = 0; /* The matching pSrcList item */ dvander@1203: NameContext *pTopNC = pNC; /* First namecontext in the list */ dvander@1203: dvander@1203: assert( pColumnToken && pColumnToken->z ); /* The Z in X.Y.Z cannot be NULL */ dvander@1203: zDb = sqlite3NameFromToken(pDbToken); dvander@1203: zTab = sqlite3NameFromToken(pTableToken); dvander@1203: zCol = sqlite3NameFromToken(pColumnToken); dvander@1203: if( sqlite3MallocFailed() ){ dvander@1203: goto lookupname_end; dvander@1203: } dvander@1203: dvander@1203: pExpr->iTable = -1; dvander@1203: while( pNC && cnt==0 ){ dvander@1203: ExprList *pEList; dvander@1203: SrcList *pSrcList = pNC->pSrcList; dvander@1203: dvander@1203: if( pSrcList ){ dvander@1203: for(i=0, pItem=pSrcList->a; inSrc; i++, pItem++){ dvander@1203: Table *pTab; dvander@1203: int iDb; dvander@1203: Column *pCol; dvander@1203: dvander@1203: pTab = pItem->pTab; dvander@1203: assert( pTab!=0 ); dvander@1203: iDb = sqlite3SchemaToIndex(db, pTab->pSchema); dvander@1203: assert( pTab->nCol>0 ); dvander@1203: if( zTab ){ dvander@1203: if( pItem->zAlias ){ dvander@1203: char *zTabName = pItem->zAlias; dvander@1203: if( sqlite3StrICmp(zTabName, zTab)!=0 ) continue; dvander@1203: }else{ dvander@1203: char *zTabName = pTab->zName; dvander@1203: if( zTabName==0 || sqlite3StrICmp(zTabName, zTab)!=0 ) continue; dvander@1203: if( zDb!=0 && sqlite3StrICmp(db->aDb[iDb].zName, zDb)!=0 ){ dvander@1203: continue; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: if( 0==(cntTab++) ){ dvander@1203: pExpr->iTable = pItem->iCursor; dvander@1203: pExpr->pSchema = pTab->pSchema; dvander@1203: pMatch = pItem; dvander@1203: } dvander@1203: for(j=0, pCol=pTab->aCol; jnCol; j++, pCol++){ dvander@1203: if( sqlite3StrICmp(pCol->zName, zCol)==0 ){ dvander@1203: const char *zColl = pTab->aCol[j].zColl; dvander@1203: IdList *pUsing; dvander@1203: cnt++; dvander@1203: pExpr->iTable = pItem->iCursor; dvander@1203: pMatch = pItem; dvander@1203: pExpr->pSchema = pTab->pSchema; dvander@1203: /* Substitute the rowid (column -1) for the INTEGER PRIMARY KEY */ dvander@1203: pExpr->iColumn = j==pTab->iPKey ? -1 : j; dvander@1203: pExpr->affinity = pTab->aCol[j].affinity; dvander@1203: if( (pExpr->flags & EP_ExpCollate)==0 ){ dvander@1203: pExpr->pColl = sqlite3FindCollSeq(db, ENC(db), zColl,-1, 0); dvander@1203: } dvander@1203: if( inSrc-1 ){ dvander@1203: if( pItem[1].jointype & JT_NATURAL ){ dvander@1203: /* If this match occurred in the left table of a natural join, dvander@1203: ** then skip the right table to avoid a duplicate match */ dvander@1203: pItem++; dvander@1203: i++; dvander@1203: }else if( (pUsing = pItem[1].pUsing)!=0 ){ dvander@1203: /* If this match occurs on a column that is in the USING clause dvander@1203: ** of a join, skip the search of the right table of the join dvander@1203: ** to avoid a duplicate match there. */ dvander@1203: int k; dvander@1203: for(k=0; knId; k++){ dvander@1203: if( sqlite3StrICmp(pUsing->a[k].zName, zCol)==0 ){ dvander@1203: pItem++; dvander@1203: i++; dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: #ifndef SQLITE_OMIT_TRIGGER dvander@1203: /* If we have not already resolved the name, then maybe dvander@1203: ** it is a new.* or old.* trigger argument reference dvander@1203: */ dvander@1203: if( zDb==0 && zTab!=0 && cnt==0 && pParse->trigStack!=0 ){ dvander@1203: TriggerStack *pTriggerStack = pParse->trigStack; dvander@1203: Table *pTab = 0; dvander@1203: if( pTriggerStack->newIdx != -1 && sqlite3StrICmp("new", zTab) == 0 ){ dvander@1203: pExpr->iTable = pTriggerStack->newIdx; dvander@1203: assert( pTriggerStack->pTab ); dvander@1203: pTab = pTriggerStack->pTab; dvander@1203: }else if( pTriggerStack->oldIdx != -1 && sqlite3StrICmp("old", zTab)==0 ){ dvander@1203: pExpr->iTable = pTriggerStack->oldIdx; dvander@1203: assert( pTriggerStack->pTab ); dvander@1203: pTab = pTriggerStack->pTab; dvander@1203: } dvander@1203: dvander@1203: if( pTab ){ dvander@1203: int iCol; dvander@1203: Column *pCol = pTab->aCol; dvander@1203: dvander@1203: pExpr->pSchema = pTab->pSchema; dvander@1203: cntTab++; dvander@1203: for(iCol=0; iCol < pTab->nCol; iCol++, pCol++) { dvander@1203: if( sqlite3StrICmp(pCol->zName, zCol)==0 ){ dvander@1203: const char *zColl = pTab->aCol[iCol].zColl; dvander@1203: cnt++; dvander@1203: pExpr->iColumn = iCol==pTab->iPKey ? -1 : iCol; dvander@1203: pExpr->affinity = pTab->aCol[iCol].affinity; dvander@1203: if( (pExpr->flags & EP_ExpCollate)==0 ){ dvander@1203: pExpr->pColl = sqlite3FindCollSeq(db, ENC(db), zColl,-1, 0); dvander@1203: } dvander@1203: pExpr->pTab = pTab; dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: #endif /* !defined(SQLITE_OMIT_TRIGGER) */ dvander@1203: dvander@1203: /* dvander@1203: ** Perhaps the name is a reference to the ROWID dvander@1203: */ dvander@1203: if( cnt==0 && cntTab==1 && sqlite3IsRowid(zCol) ){ dvander@1203: cnt = 1; dvander@1203: pExpr->iColumn = -1; dvander@1203: pExpr->affinity = SQLITE_AFF_INTEGER; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** If the input is of the form Z (not Y.Z or X.Y.Z) then the name Z dvander@1203: ** might refer to an result-set alias. This happens, for example, when dvander@1203: ** we are resolving names in the WHERE clause of the following command: dvander@1203: ** dvander@1203: ** SELECT a+b AS x FROM table WHERE x<10; dvander@1203: ** dvander@1203: ** In cases like this, replace pExpr with a copy of the expression that dvander@1203: ** forms the result set entry ("a+b" in the example) and return immediately. dvander@1203: ** Note that the expression in the result set should have already been dvander@1203: ** resolved by the time the WHERE clause is resolved. dvander@1203: */ dvander@1203: if( cnt==0 && (pEList = pNC->pEList)!=0 && zTab==0 ){ dvander@1203: for(j=0; jnExpr; j++){ dvander@1203: char *zAs = pEList->a[j].zName; dvander@1203: if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){ dvander@1203: Expr *pDup; dvander@1203: assert( pExpr->pLeft==0 && pExpr->pRight==0 ); dvander@1203: assert( pExpr->pList==0 ); dvander@1203: assert( pExpr->pSelect==0 ); dvander@1203: pDup = sqlite3ExprDup(pEList->a[j].pExpr); dvander@1203: if( pExpr->flags & EP_ExpCollate ){ dvander@1203: pDup->pColl = pExpr->pColl; dvander@1203: pDup->flags |= EP_ExpCollate; dvander@1203: } dvander@1203: if( pExpr->span.dyn ) sqliteFree((char*)pExpr->span.z); dvander@1203: if( pExpr->token.dyn ) sqliteFree((char*)pExpr->token.z); dvander@1203: memcpy(pExpr, pDup, sizeof(*pExpr)); dvander@1203: sqliteFree(pDup); dvander@1203: cnt = 1; dvander@1203: pMatch = 0; dvander@1203: assert( zTab==0 && zDb==0 ); dvander@1203: goto lookupname_end_2; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* Advance to the next name context. The loop will exit when either dvander@1203: ** we have a match (cnt>0) or when we run out of name contexts. dvander@1203: */ dvander@1203: if( cnt==0 ){ dvander@1203: pNC = pNC->pNext; dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** If X and Y are NULL (in other words if only the column name Z is dvander@1203: ** supplied) and the value of Z is enclosed in double-quotes, then dvander@1203: ** Z is a string literal if it doesn't match any column names. In that dvander@1203: ** case, we need to return right away and not make any changes to dvander@1203: ** pExpr. dvander@1203: ** dvander@1203: ** Because no reference was made to outer contexts, the pNC->nRef dvander@1203: ** fields are not changed in any context. dvander@1203: */ dvander@1203: if( cnt==0 && zTab==0 && pColumnToken->z[0]=='"' ){ dvander@1203: sqliteFree(zCol); dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** cnt==0 means there was not match. cnt>1 means there were two or dvander@1203: ** more matches. Either way, we have an error. dvander@1203: */ dvander@1203: if( cnt!=1 ){ dvander@1203: char *z = 0; dvander@1203: char *zErr; dvander@1203: zErr = cnt==0 ? "no such column: %s" : "ambiguous column name: %s"; dvander@1203: if( zDb ){ dvander@1203: sqlite3SetString(&z, zDb, ".", zTab, ".", zCol, (char*)0); dvander@1203: }else if( zTab ){ dvander@1203: sqlite3SetString(&z, zTab, ".", zCol, (char*)0); dvander@1203: }else{ dvander@1203: z = sqliteStrDup(zCol); dvander@1203: } dvander@1203: sqlite3ErrorMsg(pParse, zErr, z); dvander@1203: sqliteFree(z); dvander@1203: pTopNC->nErr++; dvander@1203: } dvander@1203: dvander@1203: /* If a column from a table in pSrcList is referenced, then record dvander@1203: ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes dvander@1203: ** bit 0 to be set. Column 1 sets bit 1. And so forth. If the dvander@1203: ** column number is greater than the number of bits in the bitmask dvander@1203: ** then set the high-order bit of the bitmask. dvander@1203: */ dvander@1203: if( pExpr->iColumn>=0 && pMatch!=0 ){ dvander@1203: int n = pExpr->iColumn; dvander@1203: if( n>=sizeof(Bitmask)*8 ){ dvander@1203: n = sizeof(Bitmask)*8-1; dvander@1203: } dvander@1203: assert( pMatch->iCursor==pExpr->iTable ); dvander@1203: pMatch->colUsed |= ((Bitmask)1)<pLeft); dvander@1203: pExpr->pLeft = 0; dvander@1203: sqlite3ExprDelete(pExpr->pRight); dvander@1203: pExpr->pRight = 0; dvander@1203: pExpr->op = TK_COLUMN; dvander@1203: lookupname_end_2: dvander@1203: sqliteFree(zCol); dvander@1203: if( cnt==1 ){ dvander@1203: assert( pNC!=0 ); dvander@1203: sqlite3AuthRead(pParse, pExpr, pNC->pSrcList); dvander@1203: if( pMatch && !pMatch->pSelect ){ dvander@1203: pExpr->pTab = pMatch->pTab; dvander@1203: } dvander@1203: /* Increment the nRef value on all name contexts from TopNC up to dvander@1203: ** the point where the name matched. */ dvander@1203: for(;;){ dvander@1203: assert( pTopNC!=0 ); dvander@1203: pTopNC->nRef++; dvander@1203: if( pTopNC==pNC ) break; dvander@1203: pTopNC = pTopNC->pNext; dvander@1203: } dvander@1203: return 0; dvander@1203: } else { dvander@1203: return 1; dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** This routine is designed as an xFunc for walkExprTree(). dvander@1203: ** dvander@1203: ** Resolve symbolic names into TK_COLUMN operators for the current dvander@1203: ** node in the expression tree. Return 0 to continue the search down dvander@1203: ** the tree or 2 to abort the tree walk. dvander@1203: ** dvander@1203: ** This routine also does error checking and name resolution for dvander@1203: ** function names. The operator for aggregate functions is changed dvander@1203: ** to TK_AGG_FUNCTION. dvander@1203: */ dvander@1203: static int nameResolverStep(void *pArg, Expr *pExpr){ dvander@1203: NameContext *pNC = (NameContext*)pArg; dvander@1203: Parse *pParse; dvander@1203: dvander@1203: if( pExpr==0 ) return 1; dvander@1203: assert( pNC!=0 ); dvander@1203: pParse = pNC->pParse; dvander@1203: dvander@1203: if( ExprHasAnyProperty(pExpr, EP_Resolved) ) return 1; dvander@1203: ExprSetProperty(pExpr, EP_Resolved); dvander@1203: #ifndef NDEBUG dvander@1203: if( pNC->pSrcList && pNC->pSrcList->nAlloc>0 ){ dvander@1203: SrcList *pSrcList = pNC->pSrcList; dvander@1203: int i; dvander@1203: for(i=0; ipSrcList->nSrc; i++){ dvander@1203: assert( pSrcList->a[i].iCursor>=0 && pSrcList->a[i].iCursornTab); dvander@1203: } dvander@1203: } dvander@1203: #endif dvander@1203: switch( pExpr->op ){ dvander@1203: /* Double-quoted strings (ex: "abc") are used as identifiers if dvander@1203: ** possible. Otherwise they remain as strings. Single-quoted dvander@1203: ** strings (ex: 'abc') are always string literals. dvander@1203: */ dvander@1203: case TK_STRING: { dvander@1203: if( pExpr->token.z[0]=='\'' ) break; dvander@1203: /* Fall thru into the TK_ID case if this is a double-quoted string */ dvander@1203: } dvander@1203: /* A lone identifier is the name of a column. dvander@1203: */ dvander@1203: case TK_ID: { dvander@1203: lookupName(pParse, 0, 0, &pExpr->token, pNC, pExpr); dvander@1203: return 1; dvander@1203: } dvander@1203: dvander@1203: /* A table name and column name: ID.ID dvander@1203: ** Or a database, table and column: ID.ID.ID dvander@1203: */ dvander@1203: case TK_DOT: { dvander@1203: Token *pColumn; dvander@1203: Token *pTable; dvander@1203: Token *pDb; dvander@1203: Expr *pRight; dvander@1203: dvander@1203: /* if( pSrcList==0 ) break; */ dvander@1203: pRight = pExpr->pRight; dvander@1203: if( pRight->op==TK_ID ){ dvander@1203: pDb = 0; dvander@1203: pTable = &pExpr->pLeft->token; dvander@1203: pColumn = &pRight->token; dvander@1203: }else{ dvander@1203: assert( pRight->op==TK_DOT ); dvander@1203: pDb = &pExpr->pLeft->token; dvander@1203: pTable = &pRight->pLeft->token; dvander@1203: pColumn = &pRight->pRight->token; dvander@1203: } dvander@1203: lookupName(pParse, pDb, pTable, pColumn, pNC, pExpr); dvander@1203: return 1; dvander@1203: } dvander@1203: dvander@1203: /* Resolve function names dvander@1203: */ dvander@1203: case TK_CONST_FUNC: dvander@1203: case TK_FUNCTION: { dvander@1203: ExprList *pList = pExpr->pList; /* The argument list */ dvander@1203: int n = pList ? pList->nExpr : 0; /* Number of arguments */ dvander@1203: int no_such_func = 0; /* True if no such function exists */ dvander@1203: int wrong_num_args = 0; /* True if wrong number of arguments */ dvander@1203: int is_agg = 0; /* True if is an aggregate function */ dvander@1203: int i; dvander@1203: int auth; /* Authorization to use the function */ dvander@1203: int nId; /* Number of characters in function name */ dvander@1203: const char *zId; /* The function name. */ dvander@1203: FuncDef *pDef; /* Information about the function */ dvander@1203: int enc = ENC(pParse->db); /* The database encoding */ dvander@1203: dvander@1203: zId = (char*)pExpr->token.z; dvander@1203: nId = pExpr->token.n; dvander@1203: pDef = sqlite3FindFunction(pParse->db, zId, nId, n, enc, 0); dvander@1203: if( pDef==0 ){ dvander@1203: pDef = sqlite3FindFunction(pParse->db, zId, nId, -1, enc, 0); dvander@1203: if( pDef==0 ){ dvander@1203: no_such_func = 1; dvander@1203: }else{ dvander@1203: wrong_num_args = 1; dvander@1203: } dvander@1203: }else{ dvander@1203: is_agg = pDef->xFunc==0; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_AUTHORIZATION dvander@1203: if( pDef ){ dvander@1203: auth = sqlite3AuthCheck(pParse, SQLITE_FUNCTION, 0, pDef->zName, 0); dvander@1203: if( auth!=SQLITE_OK ){ dvander@1203: if( auth==SQLITE_DENY ){ dvander@1203: sqlite3ErrorMsg(pParse, "not authorized to use function: %s", dvander@1203: pDef->zName); dvander@1203: pNC->nErr++; dvander@1203: } dvander@1203: pExpr->op = TK_NULL; dvander@1203: return 1; dvander@1203: } dvander@1203: } dvander@1203: #endif dvander@1203: if( is_agg && !pNC->allowAgg ){ dvander@1203: sqlite3ErrorMsg(pParse, "misuse of aggregate function %.*s()", nId,zId); dvander@1203: pNC->nErr++; dvander@1203: is_agg = 0; dvander@1203: }else if( no_such_func ){ dvander@1203: sqlite3ErrorMsg(pParse, "no such function: %.*s", nId, zId); dvander@1203: pNC->nErr++; dvander@1203: }else if( wrong_num_args ){ dvander@1203: sqlite3ErrorMsg(pParse,"wrong number of arguments to function %.*s()", dvander@1203: nId, zId); dvander@1203: pNC->nErr++; dvander@1203: } dvander@1203: if( is_agg ){ dvander@1203: pExpr->op = TK_AGG_FUNCTION; dvander@1203: pNC->hasAgg = 1; dvander@1203: } dvander@1203: if( is_agg ) pNC->allowAgg = 0; dvander@1203: for(i=0; pNC->nErr==0 && ia[i].pExpr, nameResolverStep, pNC); dvander@1203: } dvander@1203: if( is_agg ) pNC->allowAgg = 1; dvander@1203: /* FIX ME: Compute pExpr->affinity based on the expected return dvander@1203: ** type of the function dvander@1203: */ dvander@1203: return is_agg; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_SUBQUERY dvander@1203: case TK_SELECT: dvander@1203: case TK_EXISTS: dvander@1203: #endif dvander@1203: case TK_IN: { dvander@1203: if( pExpr->pSelect ){ dvander@1203: int nRef = pNC->nRef; dvander@1203: #ifndef SQLITE_OMIT_CHECK dvander@1203: if( pNC->isCheck ){ dvander@1203: sqlite3ErrorMsg(pParse,"subqueries prohibited in CHECK constraints"); dvander@1203: } dvander@1203: #endif dvander@1203: sqlite3SelectResolve(pParse, pExpr->pSelect, pNC); dvander@1203: assert( pNC->nRef>=nRef ); dvander@1203: if( nRef!=pNC->nRef ){ dvander@1203: ExprSetProperty(pExpr, EP_VarSelect); dvander@1203: } dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_CHECK dvander@1203: case TK_VARIABLE: { dvander@1203: if( pNC->isCheck ){ dvander@1203: sqlite3ErrorMsg(pParse,"parameters prohibited in CHECK constraints"); dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: #endif dvander@1203: } dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** This routine walks an expression tree and resolves references to dvander@1203: ** table columns. Nodes of the form ID.ID or ID resolve into an dvander@1203: ** index to the table in the table list and a column offset. The dvander@1203: ** Expr.opcode for such nodes is changed to TK_COLUMN. The Expr.iTable dvander@1203: ** value is changed to the index of the referenced table in pTabList dvander@1203: ** plus the "base" value. The base value will ultimately become the dvander@1203: ** VDBE cursor number for a cursor that is pointing into the referenced dvander@1203: ** table. The Expr.iColumn value is changed to the index of the column dvander@1203: ** of the referenced table. The Expr.iColumn value for the special dvander@1203: ** ROWID column is -1. Any INTEGER PRIMARY KEY column is tried as an dvander@1203: ** alias for ROWID. dvander@1203: ** dvander@1203: ** Also resolve function names and check the functions for proper dvander@1203: ** usage. Make sure all function names are recognized and all functions dvander@1203: ** have the correct number of arguments. Leave an error message dvander@1203: ** in pParse->zErrMsg if anything is amiss. Return the number of errors. dvander@1203: ** dvander@1203: ** If the expression contains aggregate functions then set the EP_Agg dvander@1203: ** property on the expression. dvander@1203: */ dvander@1203: int sqlite3ExprResolveNames( dvander@1203: NameContext *pNC, /* Namespace to resolve expressions in. */ dvander@1203: Expr *pExpr /* The expression to be analyzed. */ dvander@1203: ){ dvander@1203: int savedHasAgg; dvander@1203: if( pExpr==0 ) return 0; dvander@1203: #if SQLITE_MAX_EXPR_DEPTH>0 dvander@1203: if( (pExpr->nHeight+pNC->pParse->nHeight)>SQLITE_MAX_EXPR_DEPTH ){ dvander@1203: sqlite3ErrorMsg(pNC->pParse, dvander@1203: "Expression tree is too large (maximum depth %d)", dvander@1203: SQLITE_MAX_EXPR_DEPTH dvander@1203: ); dvander@1203: return 1; dvander@1203: } dvander@1203: pNC->pParse->nHeight += pExpr->nHeight; dvander@1203: #endif dvander@1203: savedHasAgg = pNC->hasAgg; dvander@1203: pNC->hasAgg = 0; dvander@1203: walkExprTree(pExpr, nameResolverStep, pNC); dvander@1203: #if SQLITE_MAX_EXPR_DEPTH>0 dvander@1203: pNC->pParse->nHeight -= pExpr->nHeight; dvander@1203: #endif dvander@1203: if( pNC->nErr>0 ){ dvander@1203: ExprSetProperty(pExpr, EP_Error); dvander@1203: } dvander@1203: if( pNC->hasAgg ){ dvander@1203: ExprSetProperty(pExpr, EP_Agg); dvander@1203: }else if( savedHasAgg ){ dvander@1203: pNC->hasAgg = 1; dvander@1203: } dvander@1203: return ExprHasProperty(pExpr, EP_Error); dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** A pointer instance of this structure is used to pass information dvander@1203: ** through walkExprTree into codeSubqueryStep(). dvander@1203: */ dvander@1203: typedef struct QueryCoder QueryCoder; dvander@1203: struct QueryCoder { dvander@1203: Parse *pParse; /* The parsing context */ dvander@1203: NameContext *pNC; /* Namespace of first enclosing query */ dvander@1203: }; dvander@1203: dvander@1203: dvander@1203: /* dvander@1203: ** Generate code for scalar subqueries used as an expression dvander@1203: ** and IN operators. Examples: dvander@1203: ** dvander@1203: ** (SELECT a FROM b) -- subquery dvander@1203: ** EXISTS (SELECT a FROM b) -- EXISTS subquery dvander@1203: ** x IN (4,5,11) -- IN operator with list on right-hand side dvander@1203: ** x IN (SELECT a FROM b) -- IN operator with subquery on the right dvander@1203: ** dvander@1203: ** The pExpr parameter describes the expression that contains the IN dvander@1203: ** operator or subquery. dvander@1203: */ dvander@1203: #ifndef SQLITE_OMIT_SUBQUERY dvander@1203: void sqlite3CodeSubselect(Parse *pParse, Expr *pExpr){ dvander@1203: int testAddr = 0; /* One-time test address */ dvander@1203: Vdbe *v = sqlite3GetVdbe(pParse); dvander@1203: if( v==0 ) return; dvander@1203: dvander@1203: dvander@1203: /* This code must be run in its entirety every time it is encountered dvander@1203: ** if any of the following is true: dvander@1203: ** dvander@1203: ** * The right-hand side is a correlated subquery dvander@1203: ** * The right-hand side is an expression list containing variables dvander@1203: ** * We are inside a trigger dvander@1203: ** dvander@1203: ** If all of the above are false, then we can run this code just once dvander@1203: ** save the results, and reuse the same result on subsequent invocations. dvander@1203: */ dvander@1203: if( !ExprHasAnyProperty(pExpr, EP_VarSelect) && !pParse->trigStack ){ dvander@1203: int mem = pParse->nMem++; dvander@1203: sqlite3VdbeAddOp(v, OP_MemLoad, mem, 0); dvander@1203: testAddr = sqlite3VdbeAddOp(v, OP_If, 0, 0); dvander@1203: assert( testAddr>0 || sqlite3MallocFailed() ); dvander@1203: sqlite3VdbeAddOp(v, OP_MemInt, 1, mem); dvander@1203: } dvander@1203: dvander@1203: switch( pExpr->op ){ dvander@1203: case TK_IN: { dvander@1203: char affinity; dvander@1203: KeyInfo keyInfo; dvander@1203: int addr; /* Address of OP_OpenEphemeral instruction */ dvander@1203: dvander@1203: affinity = sqlite3ExprAffinity(pExpr->pLeft); dvander@1203: dvander@1203: /* Whether this is an 'x IN(SELECT...)' or an 'x IN()' dvander@1203: ** expression it is handled the same way. A virtual table is dvander@1203: ** filled with single-field index keys representing the results dvander@1203: ** from the SELECT or the . dvander@1203: ** dvander@1203: ** If the 'x' expression is a column value, or the SELECT... dvander@1203: ** statement returns a column value, then the affinity of that dvander@1203: ** column is used to build the index keys. If both 'x' and the dvander@1203: ** SELECT... statement are columns, then numeric affinity is used dvander@1203: ** if either column has NUMERIC or INTEGER affinity. If neither dvander@1203: ** 'x' nor the SELECT... statement are columns, then numeric affinity dvander@1203: ** is used. dvander@1203: */ dvander@1203: pExpr->iTable = pParse->nTab++; dvander@1203: addr = sqlite3VdbeAddOp(v, OP_OpenEphemeral, pExpr->iTable, 0); dvander@1203: memset(&keyInfo, 0, sizeof(keyInfo)); dvander@1203: keyInfo.nField = 1; dvander@1203: sqlite3VdbeAddOp(v, OP_SetNumColumns, pExpr->iTable, 1); dvander@1203: dvander@1203: if( pExpr->pSelect ){ dvander@1203: /* Case 1: expr IN (SELECT ...) dvander@1203: ** dvander@1203: ** Generate code to write the results of the select into the temporary dvander@1203: ** table allocated and opened above. dvander@1203: */ dvander@1203: int iParm = pExpr->iTable + (((int)affinity)<<16); dvander@1203: ExprList *pEList; dvander@1203: assert( (pExpr->iTable&0x0000FFFF)==pExpr->iTable ); dvander@1203: if( sqlite3Select(pParse, pExpr->pSelect, SRT_Set, iParm, 0, 0, 0, 0) ){ dvander@1203: return; dvander@1203: } dvander@1203: pEList = pExpr->pSelect->pEList; dvander@1203: if( pEList && pEList->nExpr>0 ){ dvander@1203: keyInfo.aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft, dvander@1203: pEList->a[0].pExpr); dvander@1203: } dvander@1203: }else if( pExpr->pList ){ dvander@1203: /* Case 2: expr IN (exprlist) dvander@1203: ** dvander@1203: ** For each expression, build an index key from the evaluation and dvander@1203: ** store it in the temporary table. If is a column, then use dvander@1203: ** that columns affinity when building index keys. If is not dvander@1203: ** a column, use numeric affinity. dvander@1203: */ dvander@1203: int i; dvander@1203: ExprList *pList = pExpr->pList; dvander@1203: struct ExprList_item *pItem; dvander@1203: dvander@1203: if( !affinity ){ dvander@1203: affinity = SQLITE_AFF_NONE; dvander@1203: } dvander@1203: keyInfo.aColl[0] = pExpr->pLeft->pColl; dvander@1203: dvander@1203: /* Loop through each expression in . */ dvander@1203: for(i=pList->nExpr, pItem=pList->a; i>0; i--, pItem++){ dvander@1203: Expr *pE2 = pItem->pExpr; dvander@1203: dvander@1203: /* If the expression is not constant then we will need to dvander@1203: ** disable the test that was generated above that makes sure dvander@1203: ** this code only executes once. Because for a non-constant dvander@1203: ** expression we need to rerun this code each time. dvander@1203: */ dvander@1203: if( testAddr>0 && !sqlite3ExprIsConstant(pE2) ){ dvander@1203: sqlite3VdbeChangeToNoop(v, testAddr-1, 3); dvander@1203: testAddr = 0; dvander@1203: } dvander@1203: dvander@1203: /* Evaluate the expression and insert it into the temp table */ dvander@1203: sqlite3ExprCode(pParse, pE2); dvander@1203: sqlite3VdbeOp3(v, OP_MakeRecord, 1, 0, &affinity, 1); dvander@1203: sqlite3VdbeAddOp(v, OP_IdxInsert, pExpr->iTable, 0); dvander@1203: } dvander@1203: } dvander@1203: sqlite3VdbeChangeP3(v, addr, (void *)&keyInfo, P3_KEYINFO); dvander@1203: break; dvander@1203: } dvander@1203: dvander@1203: case TK_EXISTS: dvander@1203: case TK_SELECT: { dvander@1203: /* This has to be a scalar SELECT. Generate code to put the dvander@1203: ** value of this select in a memory cell and record the number dvander@1203: ** of the memory cell in iColumn. dvander@1203: */ dvander@1203: static const Token one = { (u8*)"1", 0, 1 }; dvander@1203: Select *pSel; dvander@1203: int iMem; dvander@1203: int sop; dvander@1203: dvander@1203: pExpr->iColumn = iMem = pParse->nMem++; dvander@1203: pSel = pExpr->pSelect; dvander@1203: if( pExpr->op==TK_SELECT ){ dvander@1203: sop = SRT_Mem; dvander@1203: sqlite3VdbeAddOp(v, OP_MemNull, iMem, 0); dvander@1203: VdbeComment((v, "# Init subquery result")); dvander@1203: }else{ dvander@1203: sop = SRT_Exists; dvander@1203: sqlite3VdbeAddOp(v, OP_MemInt, 0, iMem); dvander@1203: VdbeComment((v, "# Init EXISTS result")); dvander@1203: } dvander@1203: sqlite3ExprDelete(pSel->pLimit); dvander@1203: pSel->pLimit = sqlite3Expr(TK_INTEGER, 0, 0, &one); dvander@1203: if( sqlite3Select(pParse, pSel, sop, iMem, 0, 0, 0, 0) ){ dvander@1203: return; dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: if( testAddr ){ dvander@1203: sqlite3VdbeJumpHere(v, testAddr); dvander@1203: } dvander@1203: dvander@1203: return; dvander@1203: } dvander@1203: #endif /* SQLITE_OMIT_SUBQUERY */ dvander@1203: dvander@1203: /* dvander@1203: ** Generate an instruction that will put the integer describe by dvander@1203: ** text z[0..n-1] on the stack. dvander@1203: */ dvander@1203: static void codeInteger(Vdbe *v, const char *z, int n){ dvander@1203: assert( z || sqlite3MallocFailed() ); dvander@1203: if( z ){ dvander@1203: int i; dvander@1203: if( sqlite3GetInt32(z, &i) ){ dvander@1203: sqlite3VdbeAddOp(v, OP_Integer, i, 0); dvander@1203: }else if( sqlite3FitsIn64Bits(z) ){ dvander@1203: sqlite3VdbeOp3(v, OP_Int64, 0, 0, z, n); dvander@1203: }else{ dvander@1203: sqlite3VdbeOp3(v, OP_Real, 0, 0, z, n); dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: dvander@1203: /* dvander@1203: ** Generate code that will extract the iColumn-th column from dvander@1203: ** table pTab and push that column value on the stack. There dvander@1203: ** is an open cursor to pTab in iTable. If iColumn<0 then dvander@1203: ** code is generated that extracts the rowid. dvander@1203: */ dvander@1203: void sqlite3ExprCodeGetColumn(Vdbe *v, Table *pTab, int iColumn, int iTable){ dvander@1203: if( iColumn<0 ){ dvander@1203: int op = (pTab && IsVirtual(pTab)) ? OP_VRowid : OP_Rowid; dvander@1203: sqlite3VdbeAddOp(v, op, iTable, 0); dvander@1203: }else if( pTab==0 ){ dvander@1203: sqlite3VdbeAddOp(v, OP_Column, iTable, iColumn); dvander@1203: }else{ dvander@1203: int op = IsVirtual(pTab) ? OP_VColumn : OP_Column; dvander@1203: sqlite3VdbeAddOp(v, op, iTable, iColumn); dvander@1203: sqlite3ColumnDefault(v, pTab, iColumn); dvander@1203: #ifndef SQLITE_OMIT_FLOATING_POINT dvander@1203: if( pTab->aCol[iColumn].affinity==SQLITE_AFF_REAL ){ dvander@1203: sqlite3VdbeAddOp(v, OP_RealAffinity, 0, 0); dvander@1203: } dvander@1203: #endif dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Generate code into the current Vdbe to evaluate the given dvander@1203: ** expression and leave the result on the top of stack. dvander@1203: ** dvander@1203: ** This code depends on the fact that certain token values (ex: TK_EQ) dvander@1203: ** are the same as opcode values (ex: OP_Eq) that implement the corresponding dvander@1203: ** operation. Special comments in vdbe.c and the mkopcodeh.awk script in dvander@1203: ** the make process cause these values to align. Assert()s in the code dvander@1203: ** below verify that the numbers are aligned correctly. dvander@1203: */ dvander@1203: void sqlite3ExprCode(Parse *pParse, Expr *pExpr){ dvander@1203: Vdbe *v = pParse->pVdbe; dvander@1203: int op; dvander@1203: int stackChng = 1; /* Amount of change to stack depth */ dvander@1203: dvander@1203: if( v==0 ) return; dvander@1203: if( pExpr==0 ){ dvander@1203: sqlite3VdbeAddOp(v, OP_Null, 0, 0); dvander@1203: return; dvander@1203: } dvander@1203: op = pExpr->op; dvander@1203: switch( op ){ dvander@1203: case TK_AGG_COLUMN: { dvander@1203: AggInfo *pAggInfo = pExpr->pAggInfo; dvander@1203: struct AggInfo_col *pCol = &pAggInfo->aCol[pExpr->iAgg]; dvander@1203: if( !pAggInfo->directMode ){ dvander@1203: sqlite3VdbeAddOp(v, OP_MemLoad, pCol->iMem, 0); dvander@1203: break; dvander@1203: }else if( pAggInfo->useSortingIdx ){ dvander@1203: sqlite3VdbeAddOp(v, OP_Column, pAggInfo->sortingIdx, dvander@1203: pCol->iSorterColumn); dvander@1203: break; dvander@1203: } dvander@1203: /* Otherwise, fall thru into the TK_COLUMN case */ dvander@1203: } dvander@1203: case TK_COLUMN: { dvander@1203: if( pExpr->iTable<0 ){ dvander@1203: /* This only happens when coding check constraints */ dvander@1203: assert( pParse->ckOffset>0 ); dvander@1203: sqlite3VdbeAddOp(v, OP_Dup, pParse->ckOffset-pExpr->iColumn-1, 1); dvander@1203: }else{ dvander@1203: sqlite3ExprCodeGetColumn(v, pExpr->pTab, pExpr->iColumn, pExpr->iTable); dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: case TK_INTEGER: { dvander@1203: codeInteger(v, (char*)pExpr->token.z, pExpr->token.n); dvander@1203: break; dvander@1203: } dvander@1203: case TK_FLOAT: dvander@1203: case TK_STRING: { dvander@1203: assert( TK_FLOAT==OP_Real ); dvander@1203: assert( TK_STRING==OP_String8 ); dvander@1203: sqlite3DequoteExpr(pExpr); dvander@1203: sqlite3VdbeOp3(v, op, 0, 0, (char*)pExpr->token.z, pExpr->token.n); dvander@1203: break; dvander@1203: } dvander@1203: case TK_NULL: { dvander@1203: sqlite3VdbeAddOp(v, OP_Null, 0, 0); dvander@1203: break; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_BLOB_LITERAL dvander@1203: case TK_BLOB: { dvander@1203: int n; dvander@1203: const char *z; dvander@1203: assert( TK_BLOB==OP_HexBlob ); dvander@1203: n = pExpr->token.n - 3; dvander@1203: z = (char*)pExpr->token.z + 2; dvander@1203: assert( n>=0 ); dvander@1203: if( n==0 ){ dvander@1203: z = ""; dvander@1203: } dvander@1203: sqlite3VdbeOp3(v, op, 0, 0, z, n); dvander@1203: break; dvander@1203: } dvander@1203: #endif dvander@1203: case TK_VARIABLE: { dvander@1203: sqlite3VdbeAddOp(v, OP_Variable, pExpr->iTable, 0); dvander@1203: if( pExpr->token.n>1 ){ dvander@1203: sqlite3VdbeChangeP3(v, -1, (char*)pExpr->token.z, pExpr->token.n); dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: case TK_REGISTER: { dvander@1203: sqlite3VdbeAddOp(v, OP_MemLoad, pExpr->iTable, 0); dvander@1203: break; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_CAST dvander@1203: case TK_CAST: { dvander@1203: /* Expressions of the form: CAST(pLeft AS token) */ dvander@1203: int aff, to_op; dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: aff = sqlite3AffinityType(&pExpr->token); dvander@1203: to_op = aff - SQLITE_AFF_TEXT + OP_ToText; dvander@1203: assert( to_op==OP_ToText || aff!=SQLITE_AFF_TEXT ); dvander@1203: assert( to_op==OP_ToBlob || aff!=SQLITE_AFF_NONE ); dvander@1203: assert( to_op==OP_ToNumeric || aff!=SQLITE_AFF_NUMERIC ); dvander@1203: assert( to_op==OP_ToInt || aff!=SQLITE_AFF_INTEGER ); dvander@1203: assert( to_op==OP_ToReal || aff!=SQLITE_AFF_REAL ); dvander@1203: sqlite3VdbeAddOp(v, to_op, 0, 0); dvander@1203: stackChng = 0; dvander@1203: break; dvander@1203: } dvander@1203: #endif /* SQLITE_OMIT_CAST */ dvander@1203: case TK_LT: dvander@1203: case TK_LE: dvander@1203: case TK_GT: dvander@1203: case TK_GE: dvander@1203: case TK_NE: dvander@1203: case TK_EQ: { dvander@1203: assert( TK_LT==OP_Lt ); dvander@1203: assert( TK_LE==OP_Le ); dvander@1203: assert( TK_GT==OP_Gt ); dvander@1203: assert( TK_GE==OP_Ge ); dvander@1203: assert( TK_EQ==OP_Eq ); dvander@1203: assert( TK_NE==OP_Ne ); dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3ExprCode(pParse, pExpr->pRight); dvander@1203: codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op, 0, 0); dvander@1203: stackChng = -1; dvander@1203: break; dvander@1203: } dvander@1203: case TK_AND: dvander@1203: case TK_OR: dvander@1203: case TK_PLUS: dvander@1203: case TK_STAR: dvander@1203: case TK_MINUS: dvander@1203: case TK_REM: dvander@1203: case TK_BITAND: dvander@1203: case TK_BITOR: dvander@1203: case TK_SLASH: dvander@1203: case TK_LSHIFT: dvander@1203: case TK_RSHIFT: dvander@1203: case TK_CONCAT: { dvander@1203: assert( TK_AND==OP_And ); dvander@1203: assert( TK_OR==OP_Or ); dvander@1203: assert( TK_PLUS==OP_Add ); dvander@1203: assert( TK_MINUS==OP_Subtract ); dvander@1203: assert( TK_REM==OP_Remainder ); dvander@1203: assert( TK_BITAND==OP_BitAnd ); dvander@1203: assert( TK_BITOR==OP_BitOr ); dvander@1203: assert( TK_SLASH==OP_Divide ); dvander@1203: assert( TK_LSHIFT==OP_ShiftLeft ); dvander@1203: assert( TK_RSHIFT==OP_ShiftRight ); dvander@1203: assert( TK_CONCAT==OP_Concat ); dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3ExprCode(pParse, pExpr->pRight); dvander@1203: sqlite3VdbeAddOp(v, op, 0, 0); dvander@1203: stackChng = -1; dvander@1203: break; dvander@1203: } dvander@1203: case TK_UMINUS: { dvander@1203: Expr *pLeft = pExpr->pLeft; dvander@1203: assert( pLeft ); dvander@1203: if( pLeft->op==TK_FLOAT || pLeft->op==TK_INTEGER ){ dvander@1203: Token *p = &pLeft->token; dvander@1203: char *z = sqlite3MPrintf("-%.*s", p->n, p->z); dvander@1203: if( pLeft->op==TK_FLOAT ){ dvander@1203: sqlite3VdbeOp3(v, OP_Real, 0, 0, z, p->n+1); dvander@1203: }else{ dvander@1203: codeInteger(v, z, p->n+1); dvander@1203: } dvander@1203: sqliteFree(z); dvander@1203: break; dvander@1203: } dvander@1203: /* Fall through into TK_NOT */ dvander@1203: } dvander@1203: case TK_BITNOT: dvander@1203: case TK_NOT: { dvander@1203: assert( TK_BITNOT==OP_BitNot ); dvander@1203: assert( TK_NOT==OP_Not ); dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3VdbeAddOp(v, op, 0, 0); dvander@1203: stackChng = 0; dvander@1203: break; dvander@1203: } dvander@1203: case TK_ISNULL: dvander@1203: case TK_NOTNULL: { dvander@1203: int dest; dvander@1203: assert( TK_ISNULL==OP_IsNull ); dvander@1203: assert( TK_NOTNULL==OP_NotNull ); dvander@1203: sqlite3VdbeAddOp(v, OP_Integer, 1, 0); dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: dest = sqlite3VdbeCurrentAddr(v) + 2; dvander@1203: sqlite3VdbeAddOp(v, op, 1, dest); dvander@1203: sqlite3VdbeAddOp(v, OP_AddImm, -1, 0); dvander@1203: stackChng = 0; dvander@1203: break; dvander@1203: } dvander@1203: case TK_AGG_FUNCTION: { dvander@1203: AggInfo *pInfo = pExpr->pAggInfo; dvander@1203: if( pInfo==0 ){ dvander@1203: sqlite3ErrorMsg(pParse, "misuse of aggregate: %T", dvander@1203: &pExpr->span); dvander@1203: }else{ dvander@1203: sqlite3VdbeAddOp(v, OP_MemLoad, pInfo->aFunc[pExpr->iAgg].iMem, 0); dvander@1203: } dvander@1203: break; dvander@1203: } dvander@1203: case TK_CONST_FUNC: dvander@1203: case TK_FUNCTION: { dvander@1203: ExprList *pList = pExpr->pList; dvander@1203: int nExpr = pList ? pList->nExpr : 0; dvander@1203: FuncDef *pDef; dvander@1203: int nId; dvander@1203: const char *zId; dvander@1203: int constMask = 0; dvander@1203: int i; dvander@1203: u8 enc = ENC(pParse->db); dvander@1203: CollSeq *pColl = 0; dvander@1203: zId = (char*)pExpr->token.z; dvander@1203: nId = pExpr->token.n; dvander@1203: pDef = sqlite3FindFunction(pParse->db, zId, nId, nExpr, enc, 0); dvander@1203: assert( pDef!=0 ); dvander@1203: nExpr = sqlite3ExprCodeExprList(pParse, pList); dvander@1203: #ifndef SQLITE_OMIT_VIRTUALTABLE dvander@1203: /* Possibly overload the function if the first argument is dvander@1203: ** a virtual table column. dvander@1203: ** dvander@1203: ** For infix functions (LIKE, GLOB, REGEXP, and MATCH) use the dvander@1203: ** second argument, not the first, as the argument to test to dvander@1203: ** see if it is a column in a virtual table. This is done because dvander@1203: ** the left operand of infix functions (the operand we want to dvander@1203: ** control overloading) ends up as the second argument to the dvander@1203: ** function. The expression "A glob B" is equivalent to dvander@1203: ** "glob(B,A). We want to use the A in "A glob B" to test dvander@1203: ** for function overloading. But we use the B term in "glob(B,A)". dvander@1203: */ dvander@1203: if( nExpr>=2 && (pExpr->flags & EP_InfixFunc) ){ dvander@1203: pDef = sqlite3VtabOverloadFunction(pDef, nExpr, pList->a[1].pExpr); dvander@1203: }else if( nExpr>0 ){ dvander@1203: pDef = sqlite3VtabOverloadFunction(pDef, nExpr, pList->a[0].pExpr); dvander@1203: } dvander@1203: #endif dvander@1203: for(i=0; ia[i].pExpr) ){ dvander@1203: constMask |= (1<needCollSeq && !pColl ){ dvander@1203: pColl = sqlite3ExprCollSeq(pParse, pList->a[i].pExpr); dvander@1203: } dvander@1203: } dvander@1203: if( pDef->needCollSeq ){ dvander@1203: if( !pColl ) pColl = pParse->db->pDfltColl; dvander@1203: sqlite3VdbeOp3(v, OP_CollSeq, 0, 0, (char *)pColl, P3_COLLSEQ); dvander@1203: } dvander@1203: sqlite3VdbeOp3(v, OP_Function, constMask, nExpr, (char*)pDef, P3_FUNCDEF); dvander@1203: stackChng = 1-nExpr; dvander@1203: break; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_SUBQUERY dvander@1203: case TK_EXISTS: dvander@1203: case TK_SELECT: { dvander@1203: if( pExpr->iColumn==0 ){ dvander@1203: sqlite3CodeSubselect(pParse, pExpr); dvander@1203: } dvander@1203: sqlite3VdbeAddOp(v, OP_MemLoad, pExpr->iColumn, 0); dvander@1203: VdbeComment((v, "# load subquery result")); dvander@1203: break; dvander@1203: } dvander@1203: case TK_IN: { dvander@1203: int addr; dvander@1203: char affinity; dvander@1203: int ckOffset = pParse->ckOffset; dvander@1203: sqlite3CodeSubselect(pParse, pExpr); dvander@1203: dvander@1203: /* Figure out the affinity to use to create a key from the results dvander@1203: ** of the expression. affinityStr stores a static string suitable for dvander@1203: ** P3 of OP_MakeRecord. dvander@1203: */ dvander@1203: affinity = comparisonAffinity(pExpr); dvander@1203: dvander@1203: sqlite3VdbeAddOp(v, OP_Integer, 1, 0); dvander@1203: pParse->ckOffset = (ckOffset ? (ckOffset+1) : 0); dvander@1203: dvander@1203: /* Code the from " IN (...)". The temporary table dvander@1203: ** pExpr->iTable contains the values that make up the (...) set. dvander@1203: */ dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: addr = sqlite3VdbeCurrentAddr(v); dvander@1203: sqlite3VdbeAddOp(v, OP_NotNull, -1, addr+4); /* addr + 0 */ dvander@1203: sqlite3VdbeAddOp(v, OP_Pop, 2, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_Null, 0, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_Goto, 0, addr+7); dvander@1203: sqlite3VdbeOp3(v, OP_MakeRecord, 1, 0, &affinity, 1); /* addr + 4 */ dvander@1203: sqlite3VdbeAddOp(v, OP_Found, pExpr->iTable, addr+7); dvander@1203: sqlite3VdbeAddOp(v, OP_AddImm, -1, 0); /* addr + 6 */ dvander@1203: dvander@1203: break; dvander@1203: } dvander@1203: #endif dvander@1203: case TK_BETWEEN: { dvander@1203: Expr *pLeft = pExpr->pLeft; dvander@1203: struct ExprList_item *pLItem = pExpr->pList->a; dvander@1203: Expr *pRight = pLItem->pExpr; dvander@1203: sqlite3ExprCode(pParse, pLeft); dvander@1203: sqlite3VdbeAddOp(v, OP_Dup, 0, 0); dvander@1203: sqlite3ExprCode(pParse, pRight); dvander@1203: codeCompare(pParse, pLeft, pRight, OP_Ge, 0, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_Pull, 1, 0); dvander@1203: pLItem++; dvander@1203: pRight = pLItem->pExpr; dvander@1203: sqlite3ExprCode(pParse, pRight); dvander@1203: codeCompare(pParse, pLeft, pRight, OP_Le, 0, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_And, 0, 0); dvander@1203: break; dvander@1203: } dvander@1203: case TK_UPLUS: { dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: stackChng = 0; dvander@1203: break; dvander@1203: } dvander@1203: case TK_CASE: { dvander@1203: int expr_end_label; dvander@1203: int jumpInst; dvander@1203: int nExpr; dvander@1203: int i; dvander@1203: ExprList *pEList; dvander@1203: struct ExprList_item *aListelem; dvander@1203: dvander@1203: assert(pExpr->pList); dvander@1203: assert((pExpr->pList->nExpr % 2) == 0); dvander@1203: assert(pExpr->pList->nExpr > 0); dvander@1203: pEList = pExpr->pList; dvander@1203: aListelem = pEList->a; dvander@1203: nExpr = pEList->nExpr; dvander@1203: expr_end_label = sqlite3VdbeMakeLabel(v); dvander@1203: if( pExpr->pLeft ){ dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: } dvander@1203: for(i=0; ipLeft ){ dvander@1203: sqlite3VdbeAddOp(v, OP_Dup, 1, 1); dvander@1203: jumpInst = codeCompare(pParse, pExpr->pLeft, aListelem[i].pExpr, dvander@1203: OP_Ne, 0, 1); dvander@1203: sqlite3VdbeAddOp(v, OP_Pop, 1, 0); dvander@1203: }else{ dvander@1203: jumpInst = sqlite3VdbeAddOp(v, OP_IfNot, 1, 0); dvander@1203: } dvander@1203: sqlite3ExprCode(pParse, aListelem[i+1].pExpr); dvander@1203: sqlite3VdbeAddOp(v, OP_Goto, 0, expr_end_label); dvander@1203: sqlite3VdbeJumpHere(v, jumpInst); dvander@1203: } dvander@1203: if( pExpr->pLeft ){ dvander@1203: sqlite3VdbeAddOp(v, OP_Pop, 1, 0); dvander@1203: } dvander@1203: if( pExpr->pRight ){ dvander@1203: sqlite3ExprCode(pParse, pExpr->pRight); dvander@1203: }else{ dvander@1203: sqlite3VdbeAddOp(v, OP_Null, 0, 0); dvander@1203: } dvander@1203: sqlite3VdbeResolveLabel(v, expr_end_label); dvander@1203: break; dvander@1203: } dvander@1203: #ifndef SQLITE_OMIT_TRIGGER dvander@1203: case TK_RAISE: { dvander@1203: if( !pParse->trigStack ){ dvander@1203: sqlite3ErrorMsg(pParse, dvander@1203: "RAISE() may only be used within a trigger-program"); dvander@1203: return; dvander@1203: } dvander@1203: if( pExpr->iColumn!=OE_Ignore ){ dvander@1203: assert( pExpr->iColumn==OE_Rollback || dvander@1203: pExpr->iColumn == OE_Abort || dvander@1203: pExpr->iColumn == OE_Fail ); dvander@1203: sqlite3DequoteExpr(pExpr); dvander@1203: sqlite3VdbeOp3(v, OP_Halt, SQLITE_CONSTRAINT, pExpr->iColumn, dvander@1203: (char*)pExpr->token.z, pExpr->token.n); dvander@1203: } else { dvander@1203: assert( pExpr->iColumn == OE_Ignore ); dvander@1203: sqlite3VdbeAddOp(v, OP_ContextPop, 0, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_Goto, 0, pParse->trigStack->ignoreJump); dvander@1203: VdbeComment((v, "# raise(IGNORE)")); dvander@1203: } dvander@1203: stackChng = 0; dvander@1203: break; dvander@1203: } dvander@1203: #endif dvander@1203: } dvander@1203: dvander@1203: if( pParse->ckOffset ){ dvander@1203: pParse->ckOffset += stackChng; dvander@1203: assert( pParse->ckOffset ); dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: #ifndef SQLITE_OMIT_TRIGGER dvander@1203: /* dvander@1203: ** Generate code that evalutes the given expression and leaves the result dvander@1203: ** on the stack. See also sqlite3ExprCode(). dvander@1203: ** dvander@1203: ** This routine might also cache the result and modify the pExpr tree dvander@1203: ** so that it will make use of the cached result on subsequent evaluations dvander@1203: ** rather than evaluate the whole expression again. Trivial expressions are dvander@1203: ** not cached. If the expression is cached, its result is stored in a dvander@1203: ** memory location. dvander@1203: */ dvander@1203: void sqlite3ExprCodeAndCache(Parse *pParse, Expr *pExpr){ dvander@1203: Vdbe *v = pParse->pVdbe; dvander@1203: int iMem; dvander@1203: int addr1, addr2; dvander@1203: if( v==0 ) return; dvander@1203: addr1 = sqlite3VdbeCurrentAddr(v); dvander@1203: sqlite3ExprCode(pParse, pExpr); dvander@1203: addr2 = sqlite3VdbeCurrentAddr(v); dvander@1203: if( addr2>addr1+1 || sqlite3VdbeGetOp(v, addr1)->opcode==OP_Function ){ dvander@1203: iMem = pExpr->iTable = pParse->nMem++; dvander@1203: sqlite3VdbeAddOp(v, OP_MemStore, iMem, 0); dvander@1203: pExpr->op = TK_REGISTER; dvander@1203: } dvander@1203: } dvander@1203: #endif dvander@1203: dvander@1203: /* dvander@1203: ** Generate code that pushes the value of every element of the given dvander@1203: ** expression list onto the stack. dvander@1203: ** dvander@1203: ** Return the number of elements pushed onto the stack. dvander@1203: */ dvander@1203: int sqlite3ExprCodeExprList( dvander@1203: Parse *pParse, /* Parsing context */ dvander@1203: ExprList *pList /* The expression list to be coded */ dvander@1203: ){ dvander@1203: struct ExprList_item *pItem; dvander@1203: int i, n; dvander@1203: if( pList==0 ) return 0; dvander@1203: n = pList->nExpr; dvander@1203: for(pItem=pList->a, i=n; i>0; i--, pItem++){ dvander@1203: sqlite3ExprCode(pParse, pItem->pExpr); dvander@1203: } dvander@1203: return n; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Generate code for a boolean expression such that a jump is made dvander@1203: ** to the label "dest" if the expression is true but execution dvander@1203: ** continues straight thru if the expression is false. dvander@1203: ** dvander@1203: ** If the expression evaluates to NULL (neither true nor false), then dvander@1203: ** take the jump if the jumpIfNull flag is true. dvander@1203: ** dvander@1203: ** This code depends on the fact that certain token values (ex: TK_EQ) dvander@1203: ** are the same as opcode values (ex: OP_Eq) that implement the corresponding dvander@1203: ** operation. Special comments in vdbe.c and the mkopcodeh.awk script in dvander@1203: ** the make process cause these values to align. Assert()s in the code dvander@1203: ** below verify that the numbers are aligned correctly. dvander@1203: */ dvander@1203: void sqlite3ExprIfTrue(Parse *pParse, Expr *pExpr, int dest, int jumpIfNull){ dvander@1203: Vdbe *v = pParse->pVdbe; dvander@1203: int op = 0; dvander@1203: int ckOffset = pParse->ckOffset; dvander@1203: if( v==0 || pExpr==0 ) return; dvander@1203: op = pExpr->op; dvander@1203: switch( op ){ dvander@1203: case TK_AND: { dvander@1203: int d2 = sqlite3VdbeMakeLabel(v); dvander@1203: sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2, !jumpIfNull); dvander@1203: sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull); dvander@1203: sqlite3VdbeResolveLabel(v, d2); dvander@1203: break; dvander@1203: } dvander@1203: case TK_OR: { dvander@1203: sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull); dvander@1203: sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: case TK_NOT: { dvander@1203: sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: case TK_LT: dvander@1203: case TK_LE: dvander@1203: case TK_GT: dvander@1203: case TK_GE: dvander@1203: case TK_NE: dvander@1203: case TK_EQ: { dvander@1203: assert( TK_LT==OP_Lt ); dvander@1203: assert( TK_LE==OP_Le ); dvander@1203: assert( TK_GT==OP_Gt ); dvander@1203: assert( TK_GE==OP_Ge ); dvander@1203: assert( TK_EQ==OP_Eq ); dvander@1203: assert( TK_NE==OP_Ne ); dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3ExprCode(pParse, pExpr->pRight); dvander@1203: codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: case TK_ISNULL: dvander@1203: case TK_NOTNULL: { dvander@1203: assert( TK_ISNULL==OP_IsNull ); dvander@1203: assert( TK_NOTNULL==OP_NotNull ); dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3VdbeAddOp(v, op, 1, dest); dvander@1203: break; dvander@1203: } dvander@1203: case TK_BETWEEN: { dvander@1203: /* The expression "x BETWEEN y AND z" is implemented as: dvander@1203: ** dvander@1203: ** 1 IF (x < y) GOTO 3 dvander@1203: ** 2 IF (x <= z) GOTO dvander@1203: ** 3 ... dvander@1203: */ dvander@1203: int addr; dvander@1203: Expr *pLeft = pExpr->pLeft; dvander@1203: Expr *pRight = pExpr->pList->a[0].pExpr; dvander@1203: sqlite3ExprCode(pParse, pLeft); dvander@1203: sqlite3VdbeAddOp(v, OP_Dup, 0, 0); dvander@1203: sqlite3ExprCode(pParse, pRight); dvander@1203: addr = codeCompare(pParse, pLeft, pRight, OP_Lt, 0, !jumpIfNull); dvander@1203: dvander@1203: pRight = pExpr->pList->a[1].pExpr; dvander@1203: sqlite3ExprCode(pParse, pRight); dvander@1203: codeCompare(pParse, pLeft, pRight, OP_Le, dest, jumpIfNull); dvander@1203: dvander@1203: sqlite3VdbeAddOp(v, OP_Integer, 0, 0); dvander@1203: sqlite3VdbeJumpHere(v, addr); dvander@1203: sqlite3VdbeAddOp(v, OP_Pop, 1, 0); dvander@1203: break; dvander@1203: } dvander@1203: default: { dvander@1203: sqlite3ExprCode(pParse, pExpr); dvander@1203: sqlite3VdbeAddOp(v, OP_If, jumpIfNull, dest); dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: pParse->ckOffset = ckOffset; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Generate code for a boolean expression such that a jump is made dvander@1203: ** to the label "dest" if the expression is false but execution dvander@1203: ** continues straight thru if the expression is true. dvander@1203: ** dvander@1203: ** If the expression evaluates to NULL (neither true nor false) then dvander@1203: ** jump if jumpIfNull is true or fall through if jumpIfNull is false. dvander@1203: */ dvander@1203: void sqlite3ExprIfFalse(Parse *pParse, Expr *pExpr, int dest, int jumpIfNull){ dvander@1203: Vdbe *v = pParse->pVdbe; dvander@1203: int op = 0; dvander@1203: int ckOffset = pParse->ckOffset; dvander@1203: if( v==0 || pExpr==0 ) return; dvander@1203: dvander@1203: /* The value of pExpr->op and op are related as follows: dvander@1203: ** dvander@1203: ** pExpr->op op dvander@1203: ** --------- ---------- dvander@1203: ** TK_ISNULL OP_NotNull dvander@1203: ** TK_NOTNULL OP_IsNull dvander@1203: ** TK_NE OP_Eq dvander@1203: ** TK_EQ OP_Ne dvander@1203: ** TK_GT OP_Le dvander@1203: ** TK_LE OP_Gt dvander@1203: ** TK_GE OP_Lt dvander@1203: ** TK_LT OP_Ge dvander@1203: ** dvander@1203: ** For other values of pExpr->op, op is undefined and unused. dvander@1203: ** The value of TK_ and OP_ constants are arranged such that we dvander@1203: ** can compute the mapping above using the following expression. dvander@1203: ** Assert()s verify that the computation is correct. dvander@1203: */ dvander@1203: op = ((pExpr->op+(TK_ISNULL&1))^1)-(TK_ISNULL&1); dvander@1203: dvander@1203: /* Verify correct alignment of TK_ and OP_ constants dvander@1203: */ dvander@1203: assert( pExpr->op!=TK_ISNULL || op==OP_NotNull ); dvander@1203: assert( pExpr->op!=TK_NOTNULL || op==OP_IsNull ); dvander@1203: assert( pExpr->op!=TK_NE || op==OP_Eq ); dvander@1203: assert( pExpr->op!=TK_EQ || op==OP_Ne ); dvander@1203: assert( pExpr->op!=TK_LT || op==OP_Ge ); dvander@1203: assert( pExpr->op!=TK_LE || op==OP_Gt ); dvander@1203: assert( pExpr->op!=TK_GT || op==OP_Le ); dvander@1203: assert( pExpr->op!=TK_GE || op==OP_Lt ); dvander@1203: dvander@1203: switch( pExpr->op ){ dvander@1203: case TK_AND: { dvander@1203: sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull); dvander@1203: sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: case TK_OR: { dvander@1203: int d2 = sqlite3VdbeMakeLabel(v); dvander@1203: sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, !jumpIfNull); dvander@1203: sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull); dvander@1203: sqlite3VdbeResolveLabel(v, d2); dvander@1203: break; dvander@1203: } dvander@1203: case TK_NOT: { dvander@1203: sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: case TK_LT: dvander@1203: case TK_LE: dvander@1203: case TK_GT: dvander@1203: case TK_GE: dvander@1203: case TK_NE: dvander@1203: case TK_EQ: { dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3ExprCode(pParse, pExpr->pRight); dvander@1203: codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: case TK_ISNULL: dvander@1203: case TK_NOTNULL: { dvander@1203: sqlite3ExprCode(pParse, pExpr->pLeft); dvander@1203: sqlite3VdbeAddOp(v, op, 1, dest); dvander@1203: break; dvander@1203: } dvander@1203: case TK_BETWEEN: { dvander@1203: /* The expression is "x BETWEEN y AND z". It is implemented as: dvander@1203: ** dvander@1203: ** 1 IF (x >= y) GOTO 3 dvander@1203: ** 2 GOTO dvander@1203: ** 3 IF (x > z) GOTO dvander@1203: */ dvander@1203: int addr; dvander@1203: Expr *pLeft = pExpr->pLeft; dvander@1203: Expr *pRight = pExpr->pList->a[0].pExpr; dvander@1203: sqlite3ExprCode(pParse, pLeft); dvander@1203: sqlite3VdbeAddOp(v, OP_Dup, 0, 0); dvander@1203: sqlite3ExprCode(pParse, pRight); dvander@1203: addr = sqlite3VdbeCurrentAddr(v); dvander@1203: codeCompare(pParse, pLeft, pRight, OP_Ge, addr+3, !jumpIfNull); dvander@1203: dvander@1203: sqlite3VdbeAddOp(v, OP_Pop, 1, 0); dvander@1203: sqlite3VdbeAddOp(v, OP_Goto, 0, dest); dvander@1203: pRight = pExpr->pList->a[1].pExpr; dvander@1203: sqlite3ExprCode(pParse, pRight); dvander@1203: codeCompare(pParse, pLeft, pRight, OP_Gt, dest, jumpIfNull); dvander@1203: break; dvander@1203: } dvander@1203: default: { dvander@1203: sqlite3ExprCode(pParse, pExpr); dvander@1203: sqlite3VdbeAddOp(v, OP_IfNot, jumpIfNull, dest); dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: pParse->ckOffset = ckOffset; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Do a deep comparison of two expression trees. Return TRUE (non-zero) dvander@1203: ** if they are identical and return FALSE if they differ in any way. dvander@1203: ** dvander@1203: ** Sometimes this routine will return FALSE even if the two expressions dvander@1203: ** really are equivalent. If we cannot prove that the expressions are dvander@1203: ** identical, we return FALSE just to be safe. So if this routine dvander@1203: ** returns false, then you do not really know for certain if the two dvander@1203: ** expressions are the same. But if you get a TRUE return, then you dvander@1203: ** can be sure the expressions are the same. In the places where dvander@1203: ** this routine is used, it does not hurt to get an extra FALSE - that dvander@1203: ** just might result in some slightly slower code. But returning dvander@1203: ** an incorrect TRUE could lead to a malfunction. dvander@1203: */ dvander@1203: int sqlite3ExprCompare(Expr *pA, Expr *pB){ dvander@1203: int i; dvander@1203: if( pA==0||pB==0 ){ dvander@1203: return pB==pA; dvander@1203: } dvander@1203: if( pA->op!=pB->op ) return 0; dvander@1203: if( (pA->flags & EP_Distinct)!=(pB->flags & EP_Distinct) ) return 0; dvander@1203: if( !sqlite3ExprCompare(pA->pLeft, pB->pLeft) ) return 0; dvander@1203: if( !sqlite3ExprCompare(pA->pRight, pB->pRight) ) return 0; dvander@1203: if( pA->pList ){ dvander@1203: if( pB->pList==0 ) return 0; dvander@1203: if( pA->pList->nExpr!=pB->pList->nExpr ) return 0; dvander@1203: for(i=0; ipList->nExpr; i++){ dvander@1203: if( !sqlite3ExprCompare(pA->pList->a[i].pExpr, pB->pList->a[i].pExpr) ){ dvander@1203: return 0; dvander@1203: } dvander@1203: } dvander@1203: }else if( pB->pList ){ dvander@1203: return 0; dvander@1203: } dvander@1203: if( pA->pSelect || pB->pSelect ) return 0; dvander@1203: if( pA->iTable!=pB->iTable || pA->iColumn!=pB->iColumn ) return 0; dvander@1203: if( pA->op!=TK_COLUMN && pA->token.z ){ dvander@1203: if( pB->token.z==0 ) return 0; dvander@1203: if( pB->token.n!=pA->token.n ) return 0; dvander@1203: if( sqlite3StrNICmp((char*)pA->token.z,(char*)pB->token.z,pB->token.n)!=0 ){ dvander@1203: return 0; dvander@1203: } dvander@1203: } dvander@1203: return 1; dvander@1203: } dvander@1203: dvander@1203: dvander@1203: /* dvander@1203: ** Add a new element to the pAggInfo->aCol[] array. Return the index of dvander@1203: ** the new element. Return a negative number if malloc fails. dvander@1203: */ dvander@1203: static int addAggInfoColumn(AggInfo *pInfo){ dvander@1203: int i; dvander@1203: pInfo->aCol = sqlite3ArrayAllocate( dvander@1203: pInfo->aCol, dvander@1203: sizeof(pInfo->aCol[0]), dvander@1203: 3, dvander@1203: &pInfo->nColumn, dvander@1203: &pInfo->nColumnAlloc, dvander@1203: &i dvander@1203: ); dvander@1203: return i; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Add a new element to the pAggInfo->aFunc[] array. Return the index of dvander@1203: ** the new element. Return a negative number if malloc fails. dvander@1203: */ dvander@1203: static int addAggInfoFunc(AggInfo *pInfo){ dvander@1203: int i; dvander@1203: pInfo->aFunc = sqlite3ArrayAllocate( dvander@1203: pInfo->aFunc, dvander@1203: sizeof(pInfo->aFunc[0]), dvander@1203: 3, dvander@1203: &pInfo->nFunc, dvander@1203: &pInfo->nFuncAlloc, dvander@1203: &i dvander@1203: ); dvander@1203: return i; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** This is an xFunc for walkExprTree() used to implement dvander@1203: ** sqlite3ExprAnalyzeAggregates(). See sqlite3ExprAnalyzeAggregates dvander@1203: ** for additional information. dvander@1203: ** dvander@1203: ** This routine analyzes the aggregate function at pExpr. dvander@1203: */ dvander@1203: static int analyzeAggregate(void *pArg, Expr *pExpr){ dvander@1203: int i; dvander@1203: NameContext *pNC = (NameContext *)pArg; dvander@1203: Parse *pParse = pNC->pParse; dvander@1203: SrcList *pSrcList = pNC->pSrcList; dvander@1203: AggInfo *pAggInfo = pNC->pAggInfo; dvander@1203: dvander@1203: dvander@1203: switch( pExpr->op ){ dvander@1203: case TK_AGG_COLUMN: dvander@1203: case TK_COLUMN: { dvander@1203: /* Check to see if the column is in one of the tables in the FROM dvander@1203: ** clause of the aggregate query */ dvander@1203: if( pSrcList ){ dvander@1203: struct SrcList_item *pItem = pSrcList->a; dvander@1203: for(i=0; inSrc; i++, pItem++){ dvander@1203: struct AggInfo_col *pCol; dvander@1203: if( pExpr->iTable==pItem->iCursor ){ dvander@1203: /* If we reach this point, it means that pExpr refers to a table dvander@1203: ** that is in the FROM clause of the aggregate query. dvander@1203: ** dvander@1203: ** Make an entry for the column in pAggInfo->aCol[] if there dvander@1203: ** is not an entry there already. dvander@1203: */ dvander@1203: int k; dvander@1203: pCol = pAggInfo->aCol; dvander@1203: for(k=0; knColumn; k++, pCol++){ dvander@1203: if( pCol->iTable==pExpr->iTable && dvander@1203: pCol->iColumn==pExpr->iColumn ){ dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: if( k>=pAggInfo->nColumn && (k = addAggInfoColumn(pAggInfo))>=0 ){ dvander@1203: pCol = &pAggInfo->aCol[k]; dvander@1203: pCol->pTab = pExpr->pTab; dvander@1203: pCol->iTable = pExpr->iTable; dvander@1203: pCol->iColumn = pExpr->iColumn; dvander@1203: pCol->iMem = pParse->nMem++; dvander@1203: pCol->iSorterColumn = -1; dvander@1203: pCol->pExpr = pExpr; dvander@1203: if( pAggInfo->pGroupBy ){ dvander@1203: int j, n; dvander@1203: ExprList *pGB = pAggInfo->pGroupBy; dvander@1203: struct ExprList_item *pTerm = pGB->a; dvander@1203: n = pGB->nExpr; dvander@1203: for(j=0; jpExpr; dvander@1203: if( pE->op==TK_COLUMN && pE->iTable==pExpr->iTable && dvander@1203: pE->iColumn==pExpr->iColumn ){ dvander@1203: pCol->iSorterColumn = j; dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: if( pCol->iSorterColumn<0 ){ dvander@1203: pCol->iSorterColumn = pAggInfo->nSortingColumn++; dvander@1203: } dvander@1203: } dvander@1203: /* There is now an entry for pExpr in pAggInfo->aCol[] (either dvander@1203: ** because it was there before or because we just created it). dvander@1203: ** Convert the pExpr to be a TK_AGG_COLUMN referring to that dvander@1203: ** pAggInfo->aCol[] entry. dvander@1203: */ dvander@1203: pExpr->pAggInfo = pAggInfo; dvander@1203: pExpr->op = TK_AGG_COLUMN; dvander@1203: pExpr->iAgg = k; dvander@1203: break; dvander@1203: } /* endif pExpr->iTable==pItem->iCursor */ dvander@1203: } /* end loop over pSrcList */ dvander@1203: } dvander@1203: return 1; dvander@1203: } dvander@1203: case TK_AGG_FUNCTION: { dvander@1203: /* The pNC->nDepth==0 test causes aggregate functions in subqueries dvander@1203: ** to be ignored */ dvander@1203: if( pNC->nDepth==0 ){ dvander@1203: /* Check to see if pExpr is a duplicate of another aggregate dvander@1203: ** function that is already in the pAggInfo structure dvander@1203: */ dvander@1203: struct AggInfo_func *pItem = pAggInfo->aFunc; dvander@1203: for(i=0; inFunc; i++, pItem++){ dvander@1203: if( sqlite3ExprCompare(pItem->pExpr, pExpr) ){ dvander@1203: break; dvander@1203: } dvander@1203: } dvander@1203: if( i>=pAggInfo->nFunc ){ dvander@1203: /* pExpr is original. Make a new entry in pAggInfo->aFunc[] dvander@1203: */ dvander@1203: u8 enc = ENC(pParse->db); dvander@1203: i = addAggInfoFunc(pAggInfo); dvander@1203: if( i>=0 ){ dvander@1203: pItem = &pAggInfo->aFunc[i]; dvander@1203: pItem->pExpr = pExpr; dvander@1203: pItem->iMem = pParse->nMem++; dvander@1203: pItem->pFunc = sqlite3FindFunction(pParse->db, dvander@1203: (char*)pExpr->token.z, pExpr->token.n, dvander@1203: pExpr->pList ? pExpr->pList->nExpr : 0, enc, 0); dvander@1203: if( pExpr->flags & EP_Distinct ){ dvander@1203: pItem->iDistinct = pParse->nTab++; dvander@1203: }else{ dvander@1203: pItem->iDistinct = -1; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: /* Make pExpr point to the appropriate pAggInfo->aFunc[] entry dvander@1203: */ dvander@1203: pExpr->iAgg = i; dvander@1203: pExpr->pAggInfo = pAggInfo; dvander@1203: return 1; dvander@1203: } dvander@1203: } dvander@1203: } dvander@1203: dvander@1203: /* Recursively walk subqueries looking for TK_COLUMN nodes that need dvander@1203: ** to be changed to TK_AGG_COLUMN. But increment nDepth so that dvander@1203: ** TK_AGG_FUNCTION nodes in subqueries will be unchanged. dvander@1203: */ dvander@1203: if( pExpr->pSelect ){ dvander@1203: pNC->nDepth++; dvander@1203: walkSelectExpr(pExpr->pSelect, analyzeAggregate, pNC); dvander@1203: pNC->nDepth--; dvander@1203: } dvander@1203: return 0; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Analyze the given expression looking for aggregate functions and dvander@1203: ** for variables that need to be added to the pParse->aAgg[] array. dvander@1203: ** Make additional entries to the pParse->aAgg[] array as necessary. dvander@1203: ** dvander@1203: ** This routine should only be called after the expression has been dvander@1203: ** analyzed by sqlite3ExprResolveNames(). dvander@1203: ** dvander@1203: ** If errors are seen, leave an error message in zErrMsg and return dvander@1203: ** the number of errors. dvander@1203: */ dvander@1203: int sqlite3ExprAnalyzeAggregates(NameContext *pNC, Expr *pExpr){ dvander@1203: int nErr = pNC->pParse->nErr; dvander@1203: walkExprTree(pExpr, analyzeAggregate, pNC); dvander@1203: return pNC->pParse->nErr - nErr; dvander@1203: } dvander@1203: dvander@1203: /* dvander@1203: ** Call sqlite3ExprAnalyzeAggregates() for every expression in an dvander@1203: ** expression list. Return the number of errors. dvander@1203: ** dvander@1203: ** If an error is found, the analysis is cut short. dvander@1203: */ dvander@1203: int sqlite3ExprAnalyzeAggList(NameContext *pNC, ExprList *pList){ dvander@1203: struct ExprList_item *pItem; dvander@1203: int i; dvander@1203: int nErr = 0; dvander@1203: if( pList ){ dvander@1203: for(pItem=pList->a, i=0; nErr==0 && inExpr; i++, pItem++){ dvander@1203: nErr += sqlite3ExprAnalyzeAggregates(pNC, pItem->pExpr); dvander@1203: } dvander@1203: } dvander@1203: return nErr; dvander@1203: }