drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1 | /* |
| 2 | ** 2008 August 18 |
| 3 | ** |
| 4 | ** The author disclaims copyright to this source code. In place of |
| 5 | ** a legal notice, here is a blessing: |
| 6 | ** |
| 7 | ** May you do good and not evil. |
| 8 | ** May you find forgiveness for yourself and forgive others. |
| 9 | ** May you share freely, never taking more than you give. |
| 10 | ** |
| 11 | ************************************************************************* |
| 12 | ** |
| 13 | ** This file contains routines used for walking the parser tree and |
| 14 | ** resolve all identifiers by associating them with a particular |
| 15 | ** table and column. |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 16 | */ |
| 17 | #include "sqliteInt.h" |
| 18 | #include <stdlib.h> |
| 19 | #include <string.h> |
| 20 | |
| 21 | /* |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 22 | ** Walk the expression tree pExpr and increase the aggregate function |
| 23 | ** depth (the Expr.op2 field) by N on every TK_AGG_FUNCTION node. |
| 24 | ** This needs to occur when copying a TK_AGG_FUNCTION node from an |
| 25 | ** outer query into an inner subquery. |
| 26 | ** |
| 27 | ** incrAggFunctionDepth(pExpr,n) is the main routine. incrAggDepth(..) |
| 28 | ** is a helper function - a callback for the tree walker. |
| 29 | */ |
| 30 | static int incrAggDepth(Walker *pWalker, Expr *pExpr){ |
| 31 | if( pExpr->op==TK_AGG_FUNCTION ) pExpr->op2 += pWalker->u.i; |
| 32 | return WRC_Continue; |
| 33 | } |
| 34 | static void incrAggFunctionDepth(Expr *pExpr, int N){ |
| 35 | if( N>0 ){ |
| 36 | Walker w; |
| 37 | memset(&w, 0, sizeof(w)); |
| 38 | w.xExprCallback = incrAggDepth; |
| 39 | w.u.i = N; |
| 40 | sqlite3WalkExpr(&w, pExpr); |
| 41 | } |
| 42 | } |
| 43 | |
| 44 | /* |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 45 | ** Turn the pExpr expression into an alias for the iCol-th column of the |
| 46 | ** result set in pEList. |
| 47 | ** |
| 48 | ** If the result set column is a simple column reference, then this routine |
| 49 | ** makes an exact copy. But for any other kind of expression, this |
| 50 | ** routine make a copy of the result set column as the argument to the |
| 51 | ** TK_AS operator. The TK_AS operator causes the expression to be |
| 52 | ** evaluated just once and then reused for each alias. |
| 53 | ** |
| 54 | ** The reason for suppressing the TK_AS term when the expression is a simple |
| 55 | ** column reference is so that the column reference will be recognized as |
| 56 | ** usable by indices within the WHERE clause processing logic. |
| 57 | ** |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 58 | ** The TK_AS operator is inhibited if zType[0]=='G'. This means |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 59 | ** that in a GROUP BY clause, the expression is evaluated twice. Hence: |
| 60 | ** |
| 61 | ** SELECT random()%5 AS x, count(*) FROM tab GROUP BY x |
| 62 | ** |
| 63 | ** Is equivalent to: |
| 64 | ** |
| 65 | ** SELECT random()%5 AS x, count(*) FROM tab GROUP BY random()%5 |
| 66 | ** |
| 67 | ** The result of random()%5 in the GROUP BY clause is probably different |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 68 | ** from the result in the result-set. On the other hand Standard SQL does |
| 69 | ** not allow the GROUP BY clause to contain references to result-set columns. |
| 70 | ** So this should never come up in well-formed queries. |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 71 | ** |
drh | 0a8a406 | 2012-12-07 18:38:16 +0000 | [diff] [blame] | 72 | ** If the reference is followed by a COLLATE operator, then make sure |
| 73 | ** the COLLATE operator is preserved. For example: |
| 74 | ** |
| 75 | ** SELECT a+b, c+d FROM t1 ORDER BY 1 COLLATE nocase; |
| 76 | ** |
| 77 | ** Should be transformed into: |
| 78 | ** |
| 79 | ** SELECT a+b, c+d FROM t1 ORDER BY (a+b) COLLATE nocase; |
| 80 | ** |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 81 | ** The nSubquery parameter specifies how many levels of subquery the |
| 82 | ** alias is removed from the original expression. The usually value is |
| 83 | ** zero but it might be more if the alias is contained within a subquery |
| 84 | ** of the original expression. The Expr.op2 field of TK_AGG_FUNCTION |
| 85 | ** structures must be increased by the nSubquery amount. |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 86 | */ |
| 87 | static void resolveAlias( |
| 88 | Parse *pParse, /* Parsing context */ |
| 89 | ExprList *pEList, /* A result set */ |
| 90 | int iCol, /* A column in the result set. 0..pEList->nExpr-1 */ |
| 91 | Expr *pExpr, /* Transform this into an alias to the result set */ |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 92 | const char *zType, /* "GROUP" or "ORDER" or "" */ |
| 93 | int nSubquery /* Number of subqueries that the label is moving */ |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 94 | ){ |
| 95 | Expr *pOrig; /* The iCol-th column of the result set */ |
| 96 | Expr *pDup; /* Copy of pOrig */ |
| 97 | sqlite3 *db; /* The database connection */ |
| 98 | |
| 99 | assert( iCol>=0 && iCol<pEList->nExpr ); |
| 100 | pOrig = pEList->a[iCol].pExpr; |
| 101 | assert( pOrig!=0 ); |
| 102 | assert( pOrig->flags & EP_Resolved ); |
| 103 | db = pParse->db; |
drh | 0a8a406 | 2012-12-07 18:38:16 +0000 | [diff] [blame] | 104 | pDup = sqlite3ExprDup(db, pOrig, 0); |
| 105 | if( pDup==0 ) return; |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 106 | if( pOrig->op!=TK_COLUMN && zType[0]!='G' ){ |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 107 | incrAggFunctionDepth(pDup, nSubquery); |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 108 | pDup = sqlite3PExpr(pParse, TK_AS, pDup, 0, 0); |
| 109 | if( pDup==0 ) return; |
| 110 | if( pEList->a[iCol].iAlias==0 ){ |
drh | ea67883 | 2008-12-10 19:26:22 +0000 | [diff] [blame] | 111 | pEList->a[iCol].iAlias = (u16)(++pParse->nAlias); |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 112 | } |
| 113 | pDup->iTable = pEList->a[iCol].iAlias; |
| 114 | } |
drh | 0a8a406 | 2012-12-07 18:38:16 +0000 | [diff] [blame] | 115 | if( pExpr->op==TK_COLLATE ){ |
| 116 | pDup = sqlite3ExprAddCollateString(pParse, pDup, pExpr->u.zToken); |
| 117 | } |
dan | f6963f9 | 2009-11-23 14:39:14 +0000 | [diff] [blame] | 118 | |
| 119 | /* Before calling sqlite3ExprDelete(), set the EP_Static flag. This |
| 120 | ** prevents ExprDelete() from deleting the Expr structure itself, |
| 121 | ** allowing it to be repopulated by the memcpy() on the following line. |
drh | bd13d34 | 2012-12-07 21:02:47 +0000 | [diff] [blame] | 122 | ** The pExpr->u.zToken might point into memory that will be freed by the |
| 123 | ** sqlite3DbFree(db, pDup) on the last line of this block, so be sure to |
| 124 | ** make a copy of the token before doing the sqlite3DbFree(). |
dan | f6963f9 | 2009-11-23 14:39:14 +0000 | [diff] [blame] | 125 | */ |
| 126 | ExprSetProperty(pExpr, EP_Static); |
| 127 | sqlite3ExprDelete(db, pExpr); |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 128 | memcpy(pExpr, pDup, sizeof(*pExpr)); |
drh | 0a8a406 | 2012-12-07 18:38:16 +0000 | [diff] [blame] | 129 | if( !ExprHasProperty(pExpr, EP_IntValue) && pExpr->u.zToken!=0 ){ |
| 130 | assert( (pExpr->flags & (EP_Reduced|EP_TokenOnly))==0 ); |
| 131 | pExpr->u.zToken = sqlite3DbStrDup(db, pExpr->u.zToken); |
| 132 | pExpr->flags2 |= EP2_MallocedToken; |
| 133 | } |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 134 | sqlite3DbFree(db, pDup); |
| 135 | } |
| 136 | |
drh | e802c5d | 2011-10-18 18:10:40 +0000 | [diff] [blame] | 137 | |
| 138 | /* |
| 139 | ** Return TRUE if the name zCol occurs anywhere in the USING clause. |
| 140 | ** |
| 141 | ** Return FALSE if the USING clause is NULL or if it does not contain |
| 142 | ** zCol. |
| 143 | */ |
| 144 | static int nameInUsingClause(IdList *pUsing, const char *zCol){ |
| 145 | if( pUsing ){ |
| 146 | int k; |
| 147 | for(k=0; k<pUsing->nId; k++){ |
| 148 | if( sqlite3StrICmp(pUsing->a[k].zName, zCol)==0 ) return 1; |
| 149 | } |
| 150 | } |
| 151 | return 0; |
| 152 | } |
| 153 | |
drh | 3e3f1a5 | 2013-01-03 00:45:56 +0000 | [diff] [blame] | 154 | /* |
| 155 | ** Subqueries stores the original database, table and column names for their |
| 156 | ** result sets in ExprList.a[].zSpan, in the form "DATABASE.TABLE.COLUMN". |
| 157 | ** Check to see if the zSpan given to this routine matches the zDb, zTab, |
| 158 | ** and zCol. If any of zDb, zTab, and zCol are NULL then those fields will |
| 159 | ** match anything. |
| 160 | */ |
| 161 | int sqlite3MatchSpanName( |
| 162 | const char *zSpan, |
| 163 | const char *zCol, |
| 164 | const char *zTab, |
| 165 | const char *zDb |
| 166 | ){ |
| 167 | int n; |
| 168 | for(n=0; ALWAYS(zSpan[n]) && zSpan[n]!='.'; n++){} |
drh | dd1dd48 | 2013-02-26 12:57:42 +0000 | [diff] [blame] | 169 | if( zDb && (sqlite3StrNICmp(zSpan, zDb, n)!=0 || zDb[n]!=0) ){ |
drh | 3e3f1a5 | 2013-01-03 00:45:56 +0000 | [diff] [blame] | 170 | return 0; |
| 171 | } |
| 172 | zSpan += n+1; |
| 173 | for(n=0; ALWAYS(zSpan[n]) && zSpan[n]!='.'; n++){} |
drh | dd1dd48 | 2013-02-26 12:57:42 +0000 | [diff] [blame] | 174 | if( zTab && (sqlite3StrNICmp(zSpan, zTab, n)!=0 || zTab[n]!=0) ){ |
drh | 3e3f1a5 | 2013-01-03 00:45:56 +0000 | [diff] [blame] | 175 | return 0; |
| 176 | } |
| 177 | zSpan += n+1; |
| 178 | if( zCol && sqlite3StrICmp(zSpan, zCol)!=0 ){ |
| 179 | return 0; |
| 180 | } |
| 181 | return 1; |
| 182 | } |
drh | e802c5d | 2011-10-18 18:10:40 +0000 | [diff] [blame] | 183 | |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 184 | /* |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 185 | ** Given the name of a column of the form X.Y.Z or Y.Z or just Z, look up |
| 186 | ** that name in the set of source tables in pSrcList and make the pExpr |
| 187 | ** expression node refer back to that source column. The following changes |
| 188 | ** are made to pExpr: |
| 189 | ** |
| 190 | ** pExpr->iDb Set the index in db->aDb[] of the database X |
| 191 | ** (even if X is implied). |
| 192 | ** pExpr->iTable Set to the cursor number for the table obtained |
| 193 | ** from pSrcList. |
| 194 | ** pExpr->pTab Points to the Table structure of X.Y (even if |
| 195 | ** X and/or Y are implied.) |
| 196 | ** pExpr->iColumn Set to the column number within the table. |
| 197 | ** pExpr->op Set to TK_COLUMN. |
| 198 | ** pExpr->pLeft Any expression this points to is deleted |
| 199 | ** pExpr->pRight Any expression this points to is deleted. |
| 200 | ** |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 201 | ** The zDb variable is the name of the database (the "X"). This value may be |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 202 | ** NULL meaning that name is of the form Y.Z or Z. Any available database |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 203 | ** can be used. The zTable variable is the name of the table (the "Y"). This |
| 204 | ** value can be NULL if zDb is also NULL. If zTable is NULL it |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 205 | ** means that the form of the name is Z and that columns from any table |
| 206 | ** can be used. |
| 207 | ** |
| 208 | ** If the name cannot be resolved unambiguously, leave an error message |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 209 | ** in pParse and return WRC_Abort. Return WRC_Prune on success. |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 210 | */ |
| 211 | static int lookupName( |
| 212 | Parse *pParse, /* The parsing context */ |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 213 | const char *zDb, /* Name of the database containing table, or NULL */ |
| 214 | const char *zTab, /* Name of table containing column, or NULL */ |
| 215 | const char *zCol, /* Name of the column. */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 216 | NameContext *pNC, /* The name context used to resolve the name */ |
| 217 | Expr *pExpr /* Make this EXPR node point to the selected column */ |
| 218 | ){ |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 219 | int i, j; /* Loop counters */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 220 | int cnt = 0; /* Number of matching column names */ |
| 221 | int cntTab = 0; /* Number of matching table names */ |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 222 | int nSubquery = 0; /* How many levels of subquery */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 223 | sqlite3 *db = pParse->db; /* The database connection */ |
| 224 | struct SrcList_item *pItem; /* Use for looping over pSrcList items */ |
| 225 | struct SrcList_item *pMatch = 0; /* The matching pSrcList item */ |
| 226 | NameContext *pTopNC = pNC; /* First namecontext in the list */ |
| 227 | Schema *pSchema = 0; /* Schema of the expression */ |
dan | 2bd9351 | 2009-08-31 08:22:46 +0000 | [diff] [blame] | 228 | int isTrigger = 0; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 229 | |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 230 | assert( pNC ); /* the name context cannot be NULL. */ |
| 231 | assert( zCol ); /* The Z in X.Y.Z cannot be NULL */ |
drh | 5a05be1 | 2012-10-09 18:51:44 +0000 | [diff] [blame] | 232 | assert( !ExprHasAnyProperty(pExpr, EP_TokenOnly|EP_Reduced) ); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 233 | |
| 234 | /* Initialize the node to no-match */ |
| 235 | pExpr->iTable = -1; |
| 236 | pExpr->pTab = 0; |
drh | 33e619f | 2009-05-28 01:00:55 +0000 | [diff] [blame] | 237 | ExprSetIrreducible(pExpr); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 238 | |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 239 | /* Translate the schema name in zDb into a pointer to the corresponding |
| 240 | ** schema. If not found, pSchema will remain NULL and nothing will match |
| 241 | ** resulting in an appropriate error message toward the end of this routine |
| 242 | */ |
| 243 | if( zDb ){ |
drh | 1e7d43c | 2013-08-02 14:18:18 +0000 | [diff] [blame] | 244 | testcase( pNC->ncFlags & NC_PartIdx ); |
| 245 | testcase( pNC->ncFlags & NC_IsCheck ); |
| 246 | if( (pNC->ncFlags & (NC_PartIdx|NC_IsCheck))!=0 ){ |
| 247 | /* Silently ignore database qualifiers inside CHECK constraints and partial |
| 248 | ** indices. Do not raise errors because that might break legacy and |
| 249 | ** because it does not hurt anything to just ignore the database name. */ |
| 250 | zDb = 0; |
| 251 | }else{ |
| 252 | for(i=0; i<db->nDb; i++){ |
| 253 | assert( db->aDb[i].zName ); |
| 254 | if( sqlite3StrICmp(db->aDb[i].zName,zDb)==0 ){ |
| 255 | pSchema = db->aDb[i].pSchema; |
| 256 | break; |
| 257 | } |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 258 | } |
| 259 | } |
| 260 | } |
| 261 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 262 | /* Start at the inner-most context and move outward until a match is found */ |
| 263 | while( pNC && cnt==0 ){ |
| 264 | ExprList *pEList; |
| 265 | SrcList *pSrcList = pNC->pSrcList; |
| 266 | |
| 267 | if( pSrcList ){ |
| 268 | for(i=0, pItem=pSrcList->a; i<pSrcList->nSrc; i++, pItem++){ |
| 269 | Table *pTab; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 270 | Column *pCol; |
| 271 | |
| 272 | pTab = pItem->pTab; |
drh | f436620 | 2008-08-25 12:14:08 +0000 | [diff] [blame] | 273 | assert( pTab!=0 && pTab->zName!=0 ); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 274 | assert( pTab->nCol>0 ); |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 275 | if( pItem->pSelect && (pItem->pSelect->selFlags & SF_NestedFrom)!=0 ){ |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 276 | int hit = 0; |
drh | 928d9c6 | 2013-02-07 09:33:56 +0000 | [diff] [blame] | 277 | pEList = pItem->pSelect->pEList; |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 278 | for(j=0; j<pEList->nExpr; j++){ |
drh | 3e3f1a5 | 2013-01-03 00:45:56 +0000 | [diff] [blame] | 279 | if( sqlite3MatchSpanName(pEList->a[j].zSpan, zCol, zTab, zDb) ){ |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 280 | cnt++; |
| 281 | cntTab = 2; |
| 282 | pMatch = pItem; |
| 283 | pExpr->iColumn = j; |
drh | 38b384a | 2013-01-03 17:34:28 +0000 | [diff] [blame] | 284 | hit = 1; |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 285 | } |
| 286 | } |
| 287 | if( hit || zTab==0 ) continue; |
| 288 | } |
drh | c75e09c | 2013-01-03 16:54:20 +0000 | [diff] [blame] | 289 | if( zDb && pTab->pSchema!=pSchema ){ |
| 290 | continue; |
| 291 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 292 | if( zTab ){ |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 293 | const char *zTabName = pItem->zAlias ? pItem->zAlias : pTab->zName; |
| 294 | assert( zTabName!=0 ); |
| 295 | if( sqlite3StrICmp(zTabName, zTab)!=0 ){ |
| 296 | continue; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 297 | } |
| 298 | } |
| 299 | if( 0==(cntTab++) ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 300 | pMatch = pItem; |
| 301 | } |
| 302 | for(j=0, pCol=pTab->aCol; j<pTab->nCol; j++, pCol++){ |
| 303 | if( sqlite3StrICmp(pCol->zName, zCol)==0 ){ |
drh | e802c5d | 2011-10-18 18:10:40 +0000 | [diff] [blame] | 304 | /* If there has been exactly one prior match and this match |
| 305 | ** is for the right-hand table of a NATURAL JOIN or is in a |
| 306 | ** USING clause, then skip this match. |
| 307 | */ |
| 308 | if( cnt==1 ){ |
| 309 | if( pItem->jointype & JT_NATURAL ) continue; |
| 310 | if( nameInUsingClause(pItem->pUsing, zCol) ) continue; |
| 311 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 312 | cnt++; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 313 | pMatch = pItem; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 314 | /* Substitute the rowid (column -1) for the INTEGER PRIMARY KEY */ |
shane | cf69739 | 2009-06-01 16:53:09 +0000 | [diff] [blame] | 315 | pExpr->iColumn = j==pTab->iPKey ? -1 : (i16)j; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 316 | break; |
| 317 | } |
| 318 | } |
| 319 | } |
drh | 8f25d18 | 2012-12-19 02:36:45 +0000 | [diff] [blame] | 320 | if( pMatch ){ |
| 321 | pExpr->iTable = pMatch->iCursor; |
| 322 | pExpr->pTab = pMatch->pTab; |
| 323 | pSchema = pExpr->pTab->pSchema; |
| 324 | } |
| 325 | } /* if( pSrcList ) */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 326 | |
| 327 | #ifndef SQLITE_OMIT_TRIGGER |
| 328 | /* If we have not already resolved the name, then maybe |
| 329 | ** it is a new.* or old.* trigger argument reference |
| 330 | */ |
dan | 165921a | 2009-08-28 18:53:45 +0000 | [diff] [blame] | 331 | if( zDb==0 && zTab!=0 && cnt==0 && pParse->pTriggerTab!=0 ){ |
dan | 65a7cd1 | 2009-09-01 12:16:01 +0000 | [diff] [blame] | 332 | int op = pParse->eTriggerOp; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 333 | Table *pTab = 0; |
dan | 65a7cd1 | 2009-09-01 12:16:01 +0000 | [diff] [blame] | 334 | assert( op==TK_DELETE || op==TK_UPDATE || op==TK_INSERT ); |
| 335 | if( op!=TK_DELETE && sqlite3StrICmp("new",zTab) == 0 ){ |
dan | 165921a | 2009-08-28 18:53:45 +0000 | [diff] [blame] | 336 | pExpr->iTable = 1; |
| 337 | pTab = pParse->pTriggerTab; |
dan | 65a7cd1 | 2009-09-01 12:16:01 +0000 | [diff] [blame] | 338 | }else if( op!=TK_INSERT && sqlite3StrICmp("old",zTab)==0 ){ |
dan | 165921a | 2009-08-28 18:53:45 +0000 | [diff] [blame] | 339 | pExpr->iTable = 0; |
| 340 | pTab = pParse->pTriggerTab; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 341 | } |
| 342 | |
| 343 | if( pTab ){ |
| 344 | int iCol; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 345 | pSchema = pTab->pSchema; |
| 346 | cntTab++; |
drh | 25e978d | 2009-12-29 23:39:04 +0000 | [diff] [blame] | 347 | for(iCol=0; iCol<pTab->nCol; iCol++){ |
| 348 | Column *pCol = &pTab->aCol[iCol]; |
| 349 | if( sqlite3StrICmp(pCol->zName, zCol)==0 ){ |
| 350 | if( iCol==pTab->iPKey ){ |
| 351 | iCol = -1; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 352 | } |
drh | 25e978d | 2009-12-29 23:39:04 +0000 | [diff] [blame] | 353 | break; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 354 | } |
| 355 | } |
drh | 25e978d | 2009-12-29 23:39:04 +0000 | [diff] [blame] | 356 | if( iCol>=pTab->nCol && sqlite3IsRowid(zCol) ){ |
drh | c79c761 | 2010-01-01 18:57:48 +0000 | [diff] [blame] | 357 | iCol = -1; /* IMP: R-44911-55124 */ |
drh | 25e978d | 2009-12-29 23:39:04 +0000 | [diff] [blame] | 358 | } |
dan | 2bd9351 | 2009-08-31 08:22:46 +0000 | [diff] [blame] | 359 | if( iCol<pTab->nCol ){ |
| 360 | cnt++; |
| 361 | if( iCol<0 ){ |
| 362 | pExpr->affinity = SQLITE_AFF_INTEGER; |
dan | 2832ad4 | 2009-08-31 15:27:27 +0000 | [diff] [blame] | 363 | }else if( pExpr->iTable==0 ){ |
| 364 | testcase( iCol==31 ); |
| 365 | testcase( iCol==32 ); |
| 366 | pParse->oldmask |= (iCol>=32 ? 0xffffffff : (((u32)1)<<iCol)); |
dan | bb5f168 | 2009-11-27 12:12:34 +0000 | [diff] [blame] | 367 | }else{ |
| 368 | testcase( iCol==31 ); |
| 369 | testcase( iCol==32 ); |
| 370 | pParse->newmask |= (iCol>=32 ? 0xffffffff : (((u32)1)<<iCol)); |
dan | 2bd9351 | 2009-08-31 08:22:46 +0000 | [diff] [blame] | 371 | } |
shane | cea72b2 | 2009-09-07 04:38:36 +0000 | [diff] [blame] | 372 | pExpr->iColumn = (i16)iCol; |
dan | 2bd9351 | 2009-08-31 08:22:46 +0000 | [diff] [blame] | 373 | pExpr->pTab = pTab; |
| 374 | isTrigger = 1; |
| 375 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 376 | } |
| 377 | } |
| 378 | #endif /* !defined(SQLITE_OMIT_TRIGGER) */ |
| 379 | |
| 380 | /* |
| 381 | ** Perhaps the name is a reference to the ROWID |
| 382 | */ |
| 383 | if( cnt==0 && cntTab==1 && sqlite3IsRowid(zCol) ){ |
| 384 | cnt = 1; |
drh | c79c761 | 2010-01-01 18:57:48 +0000 | [diff] [blame] | 385 | pExpr->iColumn = -1; /* IMP: R-44911-55124 */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 386 | pExpr->affinity = SQLITE_AFF_INTEGER; |
| 387 | } |
| 388 | |
| 389 | /* |
| 390 | ** If the input is of the form Z (not Y.Z or X.Y.Z) then the name Z |
| 391 | ** might refer to an result-set alias. This happens, for example, when |
| 392 | ** we are resolving names in the WHERE clause of the following command: |
| 393 | ** |
| 394 | ** SELECT a+b AS x FROM table WHERE x<10; |
| 395 | ** |
| 396 | ** In cases like this, replace pExpr with a copy of the expression that |
| 397 | ** forms the result set entry ("a+b" in the example) and return immediately. |
| 398 | ** Note that the expression in the result set should have already been |
| 399 | ** resolved by the time the WHERE clause is resolved. |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 400 | ** |
| 401 | ** The ability to use an output result-set column in the WHERE, GROUP BY, |
| 402 | ** or HAVING clauses, or as part of a larger expression in the ORDRE BY |
| 403 | ** clause is not standard SQL. This is a (goofy) SQLite extension, that |
| 404 | ** is supported for backwards compatibility only. TO DO: Issue a warning |
| 405 | ** on sqlite3_log() whenever the capability is used. |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 406 | */ |
drh | a3a5bd9 | 2013-04-13 19:59:58 +0000 | [diff] [blame] | 407 | if( (pEList = pNC->pEList)!=0 |
| 408 | && zTab==0 |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 409 | && cnt==0 |
drh | a3a5bd9 | 2013-04-13 19:59:58 +0000 | [diff] [blame] | 410 | ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 411 | for(j=0; j<pEList->nExpr; j++){ |
| 412 | char *zAs = pEList->a[j].zName; |
| 413 | if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){ |
drh | 8b21389 | 2008-08-29 02:14:02 +0000 | [diff] [blame] | 414 | Expr *pOrig; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 415 | assert( pExpr->pLeft==0 && pExpr->pRight==0 ); |
danielk1977 | 6ab3a2e | 2009-02-19 14:39:25 +0000 | [diff] [blame] | 416 | assert( pExpr->x.pList==0 ); |
| 417 | assert( pExpr->x.pSelect==0 ); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 418 | pOrig = pEList->a[j].pExpr; |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 419 | if( (pNC->ncFlags&NC_AllowAgg)==0 && ExprHasProperty(pOrig, EP_Agg) ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 420 | sqlite3ErrorMsg(pParse, "misuse of aliased aggregate %s", zAs); |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 421 | return WRC_Abort; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 422 | } |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 423 | resolveAlias(pParse, pEList, j, pExpr, "", nSubquery); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 424 | cnt = 1; |
| 425 | pMatch = 0; |
| 426 | assert( zTab==0 && zDb==0 ); |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 427 | goto lookupname_end; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 428 | } |
| 429 | } |
| 430 | } |
| 431 | |
| 432 | /* Advance to the next name context. The loop will exit when either |
| 433 | ** we have a match (cnt>0) or when we run out of name contexts. |
| 434 | */ |
| 435 | if( cnt==0 ){ |
| 436 | pNC = pNC->pNext; |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 437 | nSubquery++; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 438 | } |
| 439 | } |
| 440 | |
| 441 | /* |
| 442 | ** If X and Y are NULL (in other words if only the column name Z is |
| 443 | ** supplied) and the value of Z is enclosed in double-quotes, then |
| 444 | ** Z is a string literal if it doesn't match any column names. In that |
| 445 | ** case, we need to return right away and not make any changes to |
| 446 | ** pExpr. |
| 447 | ** |
| 448 | ** Because no reference was made to outer contexts, the pNC->nRef |
| 449 | ** fields are not changed in any context. |
| 450 | */ |
drh | 24fb627 | 2009-05-01 21:13:36 +0000 | [diff] [blame] | 451 | if( cnt==0 && zTab==0 && ExprHasProperty(pExpr,EP_DblQuoted) ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 452 | pExpr->op = TK_STRING; |
drh | 1885d1c | 2008-10-19 21:03:27 +0000 | [diff] [blame] | 453 | pExpr->pTab = 0; |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 454 | return WRC_Prune; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 455 | } |
| 456 | |
| 457 | /* |
| 458 | ** cnt==0 means there was not match. cnt>1 means there were two or |
| 459 | ** more matches. Either way, we have an error. |
| 460 | */ |
| 461 | if( cnt!=1 ){ |
| 462 | const char *zErr; |
| 463 | zErr = cnt==0 ? "no such column" : "ambiguous column name"; |
| 464 | if( zDb ){ |
| 465 | sqlite3ErrorMsg(pParse, "%s: %s.%s.%s", zErr, zDb, zTab, zCol); |
| 466 | }else if( zTab ){ |
| 467 | sqlite3ErrorMsg(pParse, "%s: %s.%s", zErr, zTab, zCol); |
| 468 | }else{ |
| 469 | sqlite3ErrorMsg(pParse, "%s: %s", zErr, zCol); |
| 470 | } |
dan | 1db9510 | 2010-06-28 10:15:19 +0000 | [diff] [blame] | 471 | pParse->checkSchema = 1; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 472 | pTopNC->nErr++; |
| 473 | } |
| 474 | |
| 475 | /* If a column from a table in pSrcList is referenced, then record |
| 476 | ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes |
| 477 | ** bit 0 to be set. Column 1 sets bit 1. And so forth. If the |
| 478 | ** column number is greater than the number of bits in the bitmask |
| 479 | ** then set the high-order bit of the bitmask. |
| 480 | */ |
danielk1977 | 2d2e7bd | 2009-02-24 10:14:40 +0000 | [diff] [blame] | 481 | if( pExpr->iColumn>=0 && pMatch!=0 ){ |
| 482 | int n = pExpr->iColumn; |
| 483 | testcase( n==BMS-1 ); |
| 484 | if( n>=BMS ){ |
| 485 | n = BMS-1; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 486 | } |
danielk1977 | 2d2e7bd | 2009-02-24 10:14:40 +0000 | [diff] [blame] | 487 | assert( pMatch->iCursor==pExpr->iTable ); |
| 488 | pMatch->colUsed |= ((Bitmask)1)<<n; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 489 | } |
| 490 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 491 | /* Clean up and return |
| 492 | */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 493 | sqlite3ExprDelete(db, pExpr->pLeft); |
| 494 | pExpr->pLeft = 0; |
| 495 | sqlite3ExprDelete(db, pExpr->pRight); |
| 496 | pExpr->pRight = 0; |
dan | 2bd9351 | 2009-08-31 08:22:46 +0000 | [diff] [blame] | 497 | pExpr->op = (isTrigger ? TK_TRIGGER : TK_COLUMN); |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 498 | lookupname_end: |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 499 | if( cnt==1 ){ |
| 500 | assert( pNC!=0 ); |
drh | a3a5bd9 | 2013-04-13 19:59:58 +0000 | [diff] [blame] | 501 | if( pExpr->op!=TK_AS ){ |
| 502 | sqlite3AuthRead(pParse, pExpr, pSchema, pNC->pSrcList); |
| 503 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 504 | /* Increment the nRef value on all name contexts from TopNC up to |
| 505 | ** the point where the name matched. */ |
| 506 | for(;;){ |
| 507 | assert( pTopNC!=0 ); |
| 508 | pTopNC->nRef++; |
| 509 | if( pTopNC==pNC ) break; |
| 510 | pTopNC = pTopNC->pNext; |
| 511 | } |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 512 | return WRC_Prune; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 513 | } else { |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 514 | return WRC_Abort; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 515 | } |
| 516 | } |
| 517 | |
| 518 | /* |
dan | f7b0b0a | 2009-10-19 15:52:32 +0000 | [diff] [blame] | 519 | ** Allocate and return a pointer to an expression to load the column iCol |
drh | 9e48165 | 2010-04-08 17:35:34 +0000 | [diff] [blame] | 520 | ** from datasource iSrc in SrcList pSrc. |
dan | f7b0b0a | 2009-10-19 15:52:32 +0000 | [diff] [blame] | 521 | */ |
| 522 | Expr *sqlite3CreateColumnExpr(sqlite3 *db, SrcList *pSrc, int iSrc, int iCol){ |
| 523 | Expr *p = sqlite3ExprAlloc(db, TK_COLUMN, 0, 0); |
| 524 | if( p ){ |
| 525 | struct SrcList_item *pItem = &pSrc->a[iSrc]; |
| 526 | p->pTab = pItem->pTab; |
| 527 | p->iTable = pItem->iCursor; |
| 528 | if( p->pTab->iPKey==iCol ){ |
| 529 | p->iColumn = -1; |
| 530 | }else{ |
drh | 8677d30 | 2009-11-04 13:17:14 +0000 | [diff] [blame] | 531 | p->iColumn = (ynVar)iCol; |
drh | 7caba66 | 2010-04-08 15:01:44 +0000 | [diff] [blame] | 532 | testcase( iCol==BMS ); |
| 533 | testcase( iCol==BMS-1 ); |
dan | f7b0b0a | 2009-10-19 15:52:32 +0000 | [diff] [blame] | 534 | pItem->colUsed |= ((Bitmask)1)<<(iCol>=BMS ? BMS-1 : iCol); |
| 535 | } |
| 536 | ExprSetProperty(p, EP_Resolved); |
| 537 | } |
| 538 | return p; |
| 539 | } |
| 540 | |
| 541 | /* |
drh | 3780be1 | 2013-07-31 19:05:22 +0000 | [diff] [blame] | 542 | ** Report an error that an expression is not valid for a partial index WHERE |
| 543 | ** clause. |
| 544 | */ |
| 545 | static void notValidPartIdxWhere( |
| 546 | Parse *pParse, /* Leave error message here */ |
| 547 | NameContext *pNC, /* The name context */ |
| 548 | const char *zMsg /* Type of error */ |
| 549 | ){ |
| 550 | if( (pNC->ncFlags & NC_PartIdx)!=0 ){ |
| 551 | sqlite3ErrorMsg(pParse, "%s prohibited in partial index WHERE clauses", |
| 552 | zMsg); |
| 553 | } |
| 554 | } |
| 555 | |
| 556 | #ifndef SQLITE_OMIT_CHECK |
| 557 | /* |
| 558 | ** Report an error that an expression is not valid for a CHECK constraint. |
| 559 | */ |
| 560 | static void notValidCheckConstraint( |
| 561 | Parse *pParse, /* Leave error message here */ |
| 562 | NameContext *pNC, /* The name context */ |
| 563 | const char *zMsg /* Type of error */ |
| 564 | ){ |
| 565 | if( (pNC->ncFlags & NC_IsCheck)!=0 ){ |
| 566 | sqlite3ErrorMsg(pParse,"%s prohibited in CHECK constraints", zMsg); |
| 567 | } |
| 568 | } |
| 569 | #else |
| 570 | # define notValidCheckConstraint(P,N,M) |
| 571 | #endif |
| 572 | |
drh | cca9f3d | 2013-09-06 15:23:29 +0000 | [diff] [blame] | 573 | /* |
| 574 | ** Expression p should encode a floating point value between 1.0 and 0.0. |
| 575 | ** Return 1024 times this value. Or return -1 if p is not a floating point |
| 576 | ** value between 1.0 and 0.0. |
| 577 | */ |
| 578 | static int exprProbability(Expr *p){ |
| 579 | double r = -1.0; |
| 580 | if( p->op!=TK_FLOAT ) return -1; |
| 581 | sqlite3AtoF(p->u.zToken, &r, sqlite3Strlen30(p->u.zToken), SQLITE_UTF8); |
drh | 09328c0 | 2013-09-11 14:34:58 +0000 | [diff] [blame] | 582 | assert( r>=0.0 ); |
| 583 | if( r>1.0 ) return -1; |
drh | cca9f3d | 2013-09-06 15:23:29 +0000 | [diff] [blame] | 584 | return (int)(r*1000.0); |
| 585 | } |
drh | 3780be1 | 2013-07-31 19:05:22 +0000 | [diff] [blame] | 586 | |
| 587 | /* |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 588 | ** This routine is callback for sqlite3WalkExpr(). |
| 589 | ** |
| 590 | ** Resolve symbolic names into TK_COLUMN operators for the current |
| 591 | ** node in the expression tree. Return 0 to continue the search down |
| 592 | ** the tree or 2 to abort the tree walk. |
| 593 | ** |
| 594 | ** This routine also does error checking and name resolution for |
| 595 | ** function names. The operator for aggregate functions is changed |
| 596 | ** to TK_AGG_FUNCTION. |
| 597 | */ |
| 598 | static int resolveExprStep(Walker *pWalker, Expr *pExpr){ |
| 599 | NameContext *pNC; |
| 600 | Parse *pParse; |
| 601 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 602 | pNC = pWalker->u.pNC; |
| 603 | assert( pNC!=0 ); |
| 604 | pParse = pNC->pParse; |
| 605 | assert( pParse==pWalker->pParse ); |
| 606 | |
| 607 | if( ExprHasAnyProperty(pExpr, EP_Resolved) ) return WRC_Prune; |
| 608 | ExprSetProperty(pExpr, EP_Resolved); |
| 609 | #ifndef NDEBUG |
| 610 | if( pNC->pSrcList && pNC->pSrcList->nAlloc>0 ){ |
| 611 | SrcList *pSrcList = pNC->pSrcList; |
| 612 | int i; |
| 613 | for(i=0; i<pNC->pSrcList->nSrc; i++){ |
| 614 | assert( pSrcList->a[i].iCursor>=0 && pSrcList->a[i].iCursor<pParse->nTab); |
| 615 | } |
| 616 | } |
| 617 | #endif |
| 618 | switch( pExpr->op ){ |
drh | 41204f1 | 2008-10-06 13:54:35 +0000 | [diff] [blame] | 619 | |
shane | 273f619 | 2008-10-10 04:34:16 +0000 | [diff] [blame] | 620 | #if defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY) |
drh | 41204f1 | 2008-10-06 13:54:35 +0000 | [diff] [blame] | 621 | /* The special operator TK_ROW means use the rowid for the first |
| 622 | ** column in the FROM clause. This is used by the LIMIT and ORDER BY |
| 623 | ** clause processing on UPDATE and DELETE statements. |
| 624 | */ |
| 625 | case TK_ROW: { |
| 626 | SrcList *pSrcList = pNC->pSrcList; |
| 627 | struct SrcList_item *pItem; |
| 628 | assert( pSrcList && pSrcList->nSrc==1 ); |
| 629 | pItem = pSrcList->a; |
| 630 | pExpr->op = TK_COLUMN; |
| 631 | pExpr->pTab = pItem->pTab; |
| 632 | pExpr->iTable = pItem->iCursor; |
| 633 | pExpr->iColumn = -1; |
| 634 | pExpr->affinity = SQLITE_AFF_INTEGER; |
| 635 | break; |
| 636 | } |
shane | 273f619 | 2008-10-10 04:34:16 +0000 | [diff] [blame] | 637 | #endif /* defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY) */ |
drh | 41204f1 | 2008-10-06 13:54:35 +0000 | [diff] [blame] | 638 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 639 | /* A lone identifier is the name of a column. |
| 640 | */ |
| 641 | case TK_ID: { |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 642 | return lookupName(pParse, 0, 0, pExpr->u.zToken, pNC, pExpr); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 643 | } |
| 644 | |
| 645 | /* A table name and column name: ID.ID |
| 646 | ** Or a database, table and column: ID.ID.ID |
| 647 | */ |
| 648 | case TK_DOT: { |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 649 | const char *zColumn; |
| 650 | const char *zTable; |
| 651 | const char *zDb; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 652 | Expr *pRight; |
| 653 | |
| 654 | /* if( pSrcList==0 ) break; */ |
| 655 | pRight = pExpr->pRight; |
| 656 | if( pRight->op==TK_ID ){ |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 657 | zDb = 0; |
drh | 33e619f | 2009-05-28 01:00:55 +0000 | [diff] [blame] | 658 | zTable = pExpr->pLeft->u.zToken; |
| 659 | zColumn = pRight->u.zToken; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 660 | }else{ |
| 661 | assert( pRight->op==TK_DOT ); |
drh | 33e619f | 2009-05-28 01:00:55 +0000 | [diff] [blame] | 662 | zDb = pExpr->pLeft->u.zToken; |
| 663 | zTable = pRight->pLeft->u.zToken; |
| 664 | zColumn = pRight->pRight->u.zToken; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 665 | } |
drh | f7828b5 | 2009-06-15 23:15:59 +0000 | [diff] [blame] | 666 | return lookupName(pParse, zDb, zTable, zColumn, pNC, pExpr); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 667 | } |
| 668 | |
| 669 | /* Resolve function names |
| 670 | */ |
| 671 | case TK_CONST_FUNC: |
| 672 | case TK_FUNCTION: { |
danielk1977 | 6ab3a2e | 2009-02-19 14:39:25 +0000 | [diff] [blame] | 673 | ExprList *pList = pExpr->x.pList; /* The argument list */ |
| 674 | int n = pList ? pList->nExpr : 0; /* Number of arguments */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 675 | int no_such_func = 0; /* True if no such function exists */ |
| 676 | int wrong_num_args = 0; /* True if wrong number of arguments */ |
| 677 | int is_agg = 0; /* True if is an aggregate function */ |
| 678 | int auth; /* Authorization to use the function */ |
| 679 | int nId; /* Number of characters in function name */ |
| 680 | const char *zId; /* The function name. */ |
| 681 | FuncDef *pDef; /* Information about the function */ |
drh | ea67883 | 2008-12-10 19:26:22 +0000 | [diff] [blame] | 682 | u8 enc = ENC(pParse->db); /* The database encoding */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 683 | |
drh | 73c0fdc | 2009-06-15 18:32:36 +0000 | [diff] [blame] | 684 | testcase( pExpr->op==TK_CONST_FUNC ); |
danielk1977 | 6ab3a2e | 2009-02-19 14:39:25 +0000 | [diff] [blame] | 685 | assert( !ExprHasProperty(pExpr, EP_xIsSelect) ); |
drh | 3780be1 | 2013-07-31 19:05:22 +0000 | [diff] [blame] | 686 | notValidPartIdxWhere(pParse, pNC, "functions"); |
drh | 33e619f | 2009-05-28 01:00:55 +0000 | [diff] [blame] | 687 | zId = pExpr->u.zToken; |
drh | b7916a7 | 2009-05-27 10:31:29 +0000 | [diff] [blame] | 688 | nId = sqlite3Strlen30(zId); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 689 | pDef = sqlite3FindFunction(pParse->db, zId, nId, n, enc, 0); |
| 690 | if( pDef==0 ){ |
drh | 89d5d6a | 2012-04-07 00:09:21 +0000 | [diff] [blame] | 691 | pDef = sqlite3FindFunction(pParse->db, zId, nId, -2, enc, 0); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 692 | if( pDef==0 ){ |
| 693 | no_such_func = 1; |
| 694 | }else{ |
| 695 | wrong_num_args = 1; |
| 696 | } |
| 697 | }else{ |
| 698 | is_agg = pDef->xFunc==0; |
drh | cca9f3d | 2013-09-06 15:23:29 +0000 | [diff] [blame] | 699 | if( pDef->funcFlags & SQLITE_FUNC_UNLIKELY ){ |
| 700 | ExprSetProperty(pExpr, EP_Hint); |
| 701 | if( n==2 ){ |
| 702 | pExpr->iTable = exprProbability(pList->a[1].pExpr); |
| 703 | if( pExpr->iTable<0 ){ |
drh | aae0f9e | 2013-09-11 11:38:58 +0000 | [diff] [blame] | 704 | sqlite3ErrorMsg(pParse, "second argument to likelihood() must be a " |
| 705 | "constant between 0.0 and 1.0"); |
drh | cca9f3d | 2013-09-06 15:23:29 +0000 | [diff] [blame] | 706 | pNC->nErr++; |
| 707 | } |
| 708 | }else{ |
drh | abfa6d5 | 2013-09-11 03:53:22 +0000 | [diff] [blame] | 709 | pExpr->iTable = 62; /* TUNING: Default 2nd arg to unlikely() is 0.0625 */ |
drh | cca9f3d | 2013-09-06 15:23:29 +0000 | [diff] [blame] | 710 | } |
| 711 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 712 | } |
| 713 | #ifndef SQLITE_OMIT_AUTHORIZATION |
| 714 | if( pDef ){ |
| 715 | auth = sqlite3AuthCheck(pParse, SQLITE_FUNCTION, 0, pDef->zName, 0); |
| 716 | if( auth!=SQLITE_OK ){ |
| 717 | if( auth==SQLITE_DENY ){ |
| 718 | sqlite3ErrorMsg(pParse, "not authorized to use function: %s", |
| 719 | pDef->zName); |
| 720 | pNC->nErr++; |
| 721 | } |
| 722 | pExpr->op = TK_NULL; |
| 723 | return WRC_Prune; |
| 724 | } |
| 725 | } |
| 726 | #endif |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 727 | if( is_agg && (pNC->ncFlags & NC_AllowAgg)==0 ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 728 | sqlite3ErrorMsg(pParse, "misuse of aggregate function %.*s()", nId,zId); |
| 729 | pNC->nErr++; |
| 730 | is_agg = 0; |
drh | ddd1fc7 | 2013-01-08 12:48:10 +0000 | [diff] [blame] | 731 | }else if( no_such_func && pParse->db->init.busy==0 ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 732 | sqlite3ErrorMsg(pParse, "no such function: %.*s", nId, zId); |
| 733 | pNC->nErr++; |
| 734 | }else if( wrong_num_args ){ |
| 735 | sqlite3ErrorMsg(pParse,"wrong number of arguments to function %.*s()", |
| 736 | nId, zId); |
| 737 | pNC->nErr++; |
| 738 | } |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 739 | if( is_agg ) pNC->ncFlags &= ~NC_AllowAgg; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 740 | sqlite3WalkExprList(pWalker, pList); |
drh | 030796d | 2012-08-23 16:18:10 +0000 | [diff] [blame] | 741 | if( is_agg ){ |
| 742 | NameContext *pNC2 = pNC; |
| 743 | pExpr->op = TK_AGG_FUNCTION; |
| 744 | pExpr->op2 = 0; |
| 745 | while( pNC2 && !sqlite3FunctionUsesThisSrc(pExpr, pNC2->pSrcList) ){ |
| 746 | pExpr->op2++; |
| 747 | pNC2 = pNC2->pNext; |
| 748 | } |
| 749 | if( pNC2 ) pNC2->ncFlags |= NC_HasAgg; |
| 750 | pNC->ncFlags |= NC_AllowAgg; |
| 751 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 752 | /* FIX ME: Compute pExpr->affinity based on the expected return |
| 753 | ** type of the function |
| 754 | */ |
| 755 | return WRC_Prune; |
| 756 | } |
| 757 | #ifndef SQLITE_OMIT_SUBQUERY |
| 758 | case TK_SELECT: |
drh | 73c0fdc | 2009-06-15 18:32:36 +0000 | [diff] [blame] | 759 | case TK_EXISTS: testcase( pExpr->op==TK_EXISTS ); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 760 | #endif |
| 761 | case TK_IN: { |
drh | 73c0fdc | 2009-06-15 18:32:36 +0000 | [diff] [blame] | 762 | testcase( pExpr->op==TK_IN ); |
danielk1977 | 6ab3a2e | 2009-02-19 14:39:25 +0000 | [diff] [blame] | 763 | if( ExprHasProperty(pExpr, EP_xIsSelect) ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 764 | int nRef = pNC->nRef; |
drh | 3780be1 | 2013-07-31 19:05:22 +0000 | [diff] [blame] | 765 | notValidCheckConstraint(pParse, pNC, "subqueries"); |
| 766 | notValidPartIdxWhere(pParse, pNC, "subqueries"); |
danielk1977 | 6ab3a2e | 2009-02-19 14:39:25 +0000 | [diff] [blame] | 767 | sqlite3WalkSelect(pWalker, pExpr->x.pSelect); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 768 | assert( pNC->nRef>=nRef ); |
| 769 | if( nRef!=pNC->nRef ){ |
| 770 | ExprSetProperty(pExpr, EP_VarSelect); |
| 771 | } |
| 772 | } |
| 773 | break; |
| 774 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 775 | case TK_VARIABLE: { |
drh | 3780be1 | 2013-07-31 19:05:22 +0000 | [diff] [blame] | 776 | notValidCheckConstraint(pParse, pNC, "parameters"); |
| 777 | notValidPartIdxWhere(pParse, pNC, "parameters"); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 778 | break; |
| 779 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 780 | } |
| 781 | return (pParse->nErr || pParse->db->mallocFailed) ? WRC_Abort : WRC_Continue; |
| 782 | } |
| 783 | |
| 784 | /* |
| 785 | ** pEList is a list of expressions which are really the result set of the |
| 786 | ** a SELECT statement. pE is a term in an ORDER BY or GROUP BY clause. |
| 787 | ** This routine checks to see if pE is a simple identifier which corresponds |
| 788 | ** to the AS-name of one of the terms of the expression list. If it is, |
| 789 | ** this routine return an integer between 1 and N where N is the number of |
| 790 | ** elements in pEList, corresponding to the matching entry. If there is |
| 791 | ** no match, or if pE is not a simple identifier, then this routine |
| 792 | ** return 0. |
| 793 | ** |
| 794 | ** pEList has been resolved. pE has not. |
| 795 | */ |
| 796 | static int resolveAsName( |
| 797 | Parse *pParse, /* Parsing context for error messages */ |
| 798 | ExprList *pEList, /* List of expressions to scan */ |
| 799 | Expr *pE /* Expression we are trying to match */ |
| 800 | ){ |
| 801 | int i; /* Loop counter */ |
| 802 | |
shane | cf69739 | 2009-06-01 16:53:09 +0000 | [diff] [blame] | 803 | UNUSED_PARAMETER(pParse); |
| 804 | |
drh | 73c0fdc | 2009-06-15 18:32:36 +0000 | [diff] [blame] | 805 | if( pE->op==TK_ID ){ |
drh | 33e619f | 2009-05-28 01:00:55 +0000 | [diff] [blame] | 806 | char *zCol = pE->u.zToken; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 807 | for(i=0; i<pEList->nExpr; i++){ |
| 808 | char *zAs = pEList->a[i].zName; |
| 809 | if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 810 | return i+1; |
| 811 | } |
| 812 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 813 | } |
| 814 | return 0; |
| 815 | } |
| 816 | |
| 817 | /* |
| 818 | ** pE is a pointer to an expression which is a single term in the |
| 819 | ** ORDER BY of a compound SELECT. The expression has not been |
| 820 | ** name resolved. |
| 821 | ** |
| 822 | ** At the point this routine is called, we already know that the |
| 823 | ** ORDER BY term is not an integer index into the result set. That |
| 824 | ** case is handled by the calling routine. |
| 825 | ** |
| 826 | ** Attempt to match pE against result set columns in the left-most |
| 827 | ** SELECT statement. Return the index i of the matching column, |
| 828 | ** as an indication to the caller that it should sort by the i-th column. |
| 829 | ** The left-most column is 1. In other words, the value returned is the |
| 830 | ** same integer value that would be used in the SQL statement to indicate |
| 831 | ** the column. |
| 832 | ** |
| 833 | ** If there is no match, return 0. Return -1 if an error occurs. |
| 834 | */ |
| 835 | static int resolveOrderByTermToExprList( |
| 836 | Parse *pParse, /* Parsing context for error messages */ |
| 837 | Select *pSelect, /* The SELECT statement with the ORDER BY clause */ |
| 838 | Expr *pE /* The specific ORDER BY term */ |
| 839 | ){ |
| 840 | int i; /* Loop counter */ |
| 841 | ExprList *pEList; /* The columns of the result set */ |
| 842 | NameContext nc; /* Name context for resolving pE */ |
drh | a756466 | 2010-02-22 19:32:31 +0000 | [diff] [blame] | 843 | sqlite3 *db; /* Database connection */ |
| 844 | int rc; /* Return code from subprocedures */ |
| 845 | u8 savedSuppErr; /* Saved value of db->suppressErr */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 846 | |
| 847 | assert( sqlite3ExprIsInteger(pE, &i)==0 ); |
| 848 | pEList = pSelect->pEList; |
| 849 | |
| 850 | /* Resolve all names in the ORDER BY term expression |
| 851 | */ |
| 852 | memset(&nc, 0, sizeof(nc)); |
| 853 | nc.pParse = pParse; |
| 854 | nc.pSrcList = pSelect->pSrc; |
| 855 | nc.pEList = pEList; |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 856 | nc.ncFlags = NC_AllowAgg; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 857 | nc.nErr = 0; |
drh | a756466 | 2010-02-22 19:32:31 +0000 | [diff] [blame] | 858 | db = pParse->db; |
| 859 | savedSuppErr = db->suppressErr; |
| 860 | db->suppressErr = 1; |
| 861 | rc = sqlite3ResolveExprNames(&nc, pE); |
| 862 | db->suppressErr = savedSuppErr; |
| 863 | if( rc ) return 0; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 864 | |
| 865 | /* Try to match the ORDER BY expression against an expression |
| 866 | ** in the result set. Return an 1-based index of the matching |
| 867 | ** result-set entry. |
| 868 | */ |
| 869 | for(i=0; i<pEList->nExpr; i++){ |
drh | 619a130 | 2013-08-01 13:04:46 +0000 | [diff] [blame] | 870 | if( sqlite3ExprCompare(pEList->a[i].pExpr, pE, -1)<2 ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 871 | return i+1; |
| 872 | } |
| 873 | } |
| 874 | |
| 875 | /* If no match, return 0. */ |
| 876 | return 0; |
| 877 | } |
| 878 | |
| 879 | /* |
| 880 | ** Generate an ORDER BY or GROUP BY term out-of-range error. |
| 881 | */ |
| 882 | static void resolveOutOfRangeError( |
| 883 | Parse *pParse, /* The error context into which to write the error */ |
| 884 | const char *zType, /* "ORDER" or "GROUP" */ |
| 885 | int i, /* The index (1-based) of the term out of range */ |
| 886 | int mx /* Largest permissible value of i */ |
| 887 | ){ |
| 888 | sqlite3ErrorMsg(pParse, |
| 889 | "%r %s BY term out of range - should be " |
| 890 | "between 1 and %d", i, zType, mx); |
| 891 | } |
| 892 | |
| 893 | /* |
| 894 | ** Analyze the ORDER BY clause in a compound SELECT statement. Modify |
| 895 | ** each term of the ORDER BY clause is a constant integer between 1 |
| 896 | ** and N where N is the number of columns in the compound SELECT. |
| 897 | ** |
| 898 | ** ORDER BY terms that are already an integer between 1 and N are |
| 899 | ** unmodified. ORDER BY terms that are integers outside the range of |
| 900 | ** 1 through N generate an error. ORDER BY terms that are expressions |
| 901 | ** are matched against result set expressions of compound SELECT |
| 902 | ** beginning with the left-most SELECT and working toward the right. |
| 903 | ** At the first match, the ORDER BY expression is transformed into |
| 904 | ** the integer column number. |
| 905 | ** |
| 906 | ** Return the number of errors seen. |
| 907 | */ |
| 908 | static int resolveCompoundOrderBy( |
| 909 | Parse *pParse, /* Parsing context. Leave error messages here */ |
| 910 | Select *pSelect /* The SELECT statement containing the ORDER BY */ |
| 911 | ){ |
| 912 | int i; |
| 913 | ExprList *pOrderBy; |
| 914 | ExprList *pEList; |
| 915 | sqlite3 *db; |
| 916 | int moreToDo = 1; |
| 917 | |
| 918 | pOrderBy = pSelect->pOrderBy; |
| 919 | if( pOrderBy==0 ) return 0; |
| 920 | db = pParse->db; |
| 921 | #if SQLITE_MAX_COLUMN |
| 922 | if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){ |
| 923 | sqlite3ErrorMsg(pParse, "too many terms in ORDER BY clause"); |
| 924 | return 1; |
| 925 | } |
| 926 | #endif |
| 927 | for(i=0; i<pOrderBy->nExpr; i++){ |
| 928 | pOrderBy->a[i].done = 0; |
| 929 | } |
| 930 | pSelect->pNext = 0; |
| 931 | while( pSelect->pPrior ){ |
| 932 | pSelect->pPrior->pNext = pSelect; |
| 933 | pSelect = pSelect->pPrior; |
| 934 | } |
| 935 | while( pSelect && moreToDo ){ |
| 936 | struct ExprList_item *pItem; |
| 937 | moreToDo = 0; |
| 938 | pEList = pSelect->pEList; |
drh | 0a846f9 | 2008-08-25 17:23:29 +0000 | [diff] [blame] | 939 | assert( pEList!=0 ); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 940 | for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){ |
| 941 | int iCol = -1; |
| 942 | Expr *pE, *pDup; |
| 943 | if( pItem->done ) continue; |
drh | bd13d34 | 2012-12-07 21:02:47 +0000 | [diff] [blame] | 944 | pE = sqlite3ExprSkipCollate(pItem->pExpr); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 945 | if( sqlite3ExprIsInteger(pE, &iCol) ){ |
drh | 73c0fdc | 2009-06-15 18:32:36 +0000 | [diff] [blame] | 946 | if( iCol<=0 || iCol>pEList->nExpr ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 947 | resolveOutOfRangeError(pParse, "ORDER", i+1, pEList->nExpr); |
| 948 | return 1; |
| 949 | } |
| 950 | }else{ |
| 951 | iCol = resolveAsName(pParse, pEList, pE); |
| 952 | if( iCol==0 ){ |
danielk1977 | 6ab3a2e | 2009-02-19 14:39:25 +0000 | [diff] [blame] | 953 | pDup = sqlite3ExprDup(db, pE, 0); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 954 | if( !db->mallocFailed ){ |
| 955 | assert(pDup); |
| 956 | iCol = resolveOrderByTermToExprList(pParse, pSelect, pDup); |
| 957 | } |
| 958 | sqlite3ExprDelete(db, pDup); |
| 959 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 960 | } |
| 961 | if( iCol>0 ){ |
drh | bd13d34 | 2012-12-07 21:02:47 +0000 | [diff] [blame] | 962 | /* Convert the ORDER BY term into an integer column number iCol, |
| 963 | ** taking care to preserve the COLLATE clause if it exists */ |
| 964 | Expr *pNew = sqlite3Expr(db, TK_INTEGER, 0); |
| 965 | if( pNew==0 ) return 1; |
| 966 | pNew->flags |= EP_IntValue; |
| 967 | pNew->u.iValue = iCol; |
| 968 | if( pItem->pExpr==pE ){ |
| 969 | pItem->pExpr = pNew; |
| 970 | }else{ |
| 971 | assert( pItem->pExpr->op==TK_COLLATE ); |
| 972 | assert( pItem->pExpr->pLeft==pE ); |
| 973 | pItem->pExpr->pLeft = pNew; |
| 974 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 975 | sqlite3ExprDelete(db, pE); |
drh | 4b3ac73 | 2011-12-10 23:18:32 +0000 | [diff] [blame] | 976 | pItem->iOrderByCol = (u16)iCol; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 977 | pItem->done = 1; |
| 978 | }else{ |
| 979 | moreToDo = 1; |
| 980 | } |
| 981 | } |
| 982 | pSelect = pSelect->pNext; |
| 983 | } |
| 984 | for(i=0; i<pOrderBy->nExpr; i++){ |
| 985 | if( pOrderBy->a[i].done==0 ){ |
| 986 | sqlite3ErrorMsg(pParse, "%r ORDER BY term does not match any " |
| 987 | "column in the result set", i+1); |
| 988 | return 1; |
| 989 | } |
| 990 | } |
| 991 | return 0; |
| 992 | } |
| 993 | |
| 994 | /* |
| 995 | ** Check every term in the ORDER BY or GROUP BY clause pOrderBy of |
| 996 | ** the SELECT statement pSelect. If any term is reference to a |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 997 | ** result set expression (as determined by the ExprList.a.iOrderByCol field) |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 998 | ** then convert that term into a copy of the corresponding result set |
| 999 | ** column. |
| 1000 | ** |
| 1001 | ** If any errors are detected, add an error message to pParse and |
| 1002 | ** return non-zero. Return zero if no errors are seen. |
| 1003 | */ |
| 1004 | int sqlite3ResolveOrderGroupBy( |
| 1005 | Parse *pParse, /* Parsing context. Leave error messages here */ |
| 1006 | Select *pSelect, /* The SELECT statement containing the clause */ |
| 1007 | ExprList *pOrderBy, /* The ORDER BY or GROUP BY clause to be processed */ |
| 1008 | const char *zType /* "ORDER" or "GROUP" */ |
| 1009 | ){ |
| 1010 | int i; |
| 1011 | sqlite3 *db = pParse->db; |
| 1012 | ExprList *pEList; |
| 1013 | struct ExprList_item *pItem; |
| 1014 | |
| 1015 | if( pOrderBy==0 || pParse->db->mallocFailed ) return 0; |
| 1016 | #if SQLITE_MAX_COLUMN |
| 1017 | if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){ |
| 1018 | sqlite3ErrorMsg(pParse, "too many terms in %s BY clause", zType); |
| 1019 | return 1; |
| 1020 | } |
| 1021 | #endif |
| 1022 | pEList = pSelect->pEList; |
drh | 0a846f9 | 2008-08-25 17:23:29 +0000 | [diff] [blame] | 1023 | assert( pEList!=0 ); /* sqlite3SelectNew() guarantees this */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1024 | for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){ |
drh | 4b3ac73 | 2011-12-10 23:18:32 +0000 | [diff] [blame] | 1025 | if( pItem->iOrderByCol ){ |
| 1026 | if( pItem->iOrderByCol>pEList->nExpr ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1027 | resolveOutOfRangeError(pParse, zType, i+1, pEList->nExpr); |
| 1028 | return 1; |
| 1029 | } |
drh | ed551b9 | 2012-08-23 19:46:11 +0000 | [diff] [blame] | 1030 | resolveAlias(pParse, pEList, pItem->iOrderByCol-1, pItem->pExpr, zType,0); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1031 | } |
| 1032 | } |
| 1033 | return 0; |
| 1034 | } |
| 1035 | |
| 1036 | /* |
| 1037 | ** pOrderBy is an ORDER BY or GROUP BY clause in SELECT statement pSelect. |
| 1038 | ** The Name context of the SELECT statement is pNC. zType is either |
| 1039 | ** "ORDER" or "GROUP" depending on which type of clause pOrderBy is. |
| 1040 | ** |
| 1041 | ** This routine resolves each term of the clause into an expression. |
| 1042 | ** If the order-by term is an integer I between 1 and N (where N is the |
| 1043 | ** number of columns in the result set of the SELECT) then the expression |
| 1044 | ** in the resolution is a copy of the I-th result-set expression. If |
drh | 26080d9 | 2013-08-15 14:27:42 +0000 | [diff] [blame] | 1045 | ** the order-by term is an identifier that corresponds to the AS-name of |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1046 | ** a result-set expression, then the term resolves to a copy of the |
| 1047 | ** result-set expression. Otherwise, the expression is resolved in |
| 1048 | ** the usual way - using sqlite3ResolveExprNames(). |
| 1049 | ** |
| 1050 | ** This routine returns the number of errors. If errors occur, then |
| 1051 | ** an appropriate error message might be left in pParse. (OOM errors |
| 1052 | ** excepted.) |
| 1053 | */ |
| 1054 | static int resolveOrderGroupBy( |
| 1055 | NameContext *pNC, /* The name context of the SELECT statement */ |
| 1056 | Select *pSelect, /* The SELECT statement holding pOrderBy */ |
| 1057 | ExprList *pOrderBy, /* An ORDER BY or GROUP BY clause to resolve */ |
| 1058 | const char *zType /* Either "ORDER" or "GROUP", as appropriate */ |
| 1059 | ){ |
drh | 70331cd | 2012-04-27 01:09:06 +0000 | [diff] [blame] | 1060 | int i, j; /* Loop counters */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1061 | int iCol; /* Column number */ |
| 1062 | struct ExprList_item *pItem; /* A term of the ORDER BY clause */ |
| 1063 | Parse *pParse; /* Parsing context */ |
| 1064 | int nResult; /* Number of terms in the result set */ |
| 1065 | |
| 1066 | if( pOrderBy==0 ) return 0; |
| 1067 | nResult = pSelect->pEList->nExpr; |
| 1068 | pParse = pNC->pParse; |
| 1069 | for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){ |
| 1070 | Expr *pE = pItem->pExpr; |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 1071 | Expr *pE2 = sqlite3ExprSkipCollate(pE); |
drh | 0af16ab | 2013-08-15 22:40:21 +0000 | [diff] [blame] | 1072 | if( zType[0]!='G' ){ |
| 1073 | iCol = resolveAsName(pParse, pSelect->pEList, pE2); |
| 1074 | if( iCol>0 ){ |
| 1075 | /* If an AS-name match is found, mark this ORDER BY column as being |
| 1076 | ** a copy of the iCol-th result-set column. The subsequent call to |
| 1077 | ** sqlite3ResolveOrderGroupBy() will convert the expression to a |
| 1078 | ** copy of the iCol-th result-set expression. */ |
| 1079 | pItem->iOrderByCol = (u16)iCol; |
| 1080 | continue; |
| 1081 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1082 | } |
drh | e35463b | 2013-08-15 20:24:27 +0000 | [diff] [blame] | 1083 | if( sqlite3ExprIsInteger(pE2, &iCol) ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1084 | /* The ORDER BY term is an integer constant. Again, set the column |
| 1085 | ** number so that sqlite3ResolveOrderGroupBy() will convert the |
| 1086 | ** order-by term to a copy of the result-set expression */ |
drh | 85d641f | 2012-12-07 23:23:53 +0000 | [diff] [blame] | 1087 | if( iCol<1 || iCol>0xffff ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1088 | resolveOutOfRangeError(pParse, zType, i+1, nResult); |
| 1089 | return 1; |
| 1090 | } |
drh | 4b3ac73 | 2011-12-10 23:18:32 +0000 | [diff] [blame] | 1091 | pItem->iOrderByCol = (u16)iCol; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1092 | continue; |
| 1093 | } |
| 1094 | |
| 1095 | /* Otherwise, treat the ORDER BY term as an ordinary expression */ |
drh | 4b3ac73 | 2011-12-10 23:18:32 +0000 | [diff] [blame] | 1096 | pItem->iOrderByCol = 0; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1097 | if( sqlite3ResolveExprNames(pNC, pE) ){ |
| 1098 | return 1; |
| 1099 | } |
drh | 70331cd | 2012-04-27 01:09:06 +0000 | [diff] [blame] | 1100 | for(j=0; j<pSelect->pEList->nExpr; j++){ |
drh | 619a130 | 2013-08-01 13:04:46 +0000 | [diff] [blame] | 1101 | if( sqlite3ExprCompare(pE, pSelect->pEList->a[j].pExpr, -1)==0 ){ |
drh | 70331cd | 2012-04-27 01:09:06 +0000 | [diff] [blame] | 1102 | pItem->iOrderByCol = j+1; |
| 1103 | } |
| 1104 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1105 | } |
| 1106 | return sqlite3ResolveOrderGroupBy(pParse, pSelect, pOrderBy, zType); |
| 1107 | } |
| 1108 | |
| 1109 | /* |
| 1110 | ** Resolve names in the SELECT statement p and all of its descendents. |
| 1111 | */ |
| 1112 | static int resolveSelectStep(Walker *pWalker, Select *p){ |
| 1113 | NameContext *pOuterNC; /* Context that contains this SELECT */ |
| 1114 | NameContext sNC; /* Name context of this SELECT */ |
| 1115 | int isCompound; /* True if p is a compound select */ |
| 1116 | int nCompound; /* Number of compound terms processed so far */ |
| 1117 | Parse *pParse; /* Parsing context */ |
| 1118 | ExprList *pEList; /* Result set expression list */ |
| 1119 | int i; /* Loop counter */ |
| 1120 | ExprList *pGroupBy; /* The GROUP BY clause */ |
| 1121 | Select *pLeftmost; /* Left-most of SELECT of a compound */ |
| 1122 | sqlite3 *db; /* Database connection */ |
| 1123 | |
| 1124 | |
drh | 0a846f9 | 2008-08-25 17:23:29 +0000 | [diff] [blame] | 1125 | assert( p!=0 ); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1126 | if( p->selFlags & SF_Resolved ){ |
| 1127 | return WRC_Prune; |
| 1128 | } |
| 1129 | pOuterNC = pWalker->u.pNC; |
| 1130 | pParse = pWalker->pParse; |
| 1131 | db = pParse->db; |
| 1132 | |
| 1133 | /* Normally sqlite3SelectExpand() will be called first and will have |
| 1134 | ** already expanded this SELECT. However, if this is a subquery within |
| 1135 | ** an expression, sqlite3ResolveExprNames() will be called without a |
| 1136 | ** prior call to sqlite3SelectExpand(). When that happens, let |
| 1137 | ** sqlite3SelectPrep() do all of the processing for this SELECT. |
| 1138 | ** sqlite3SelectPrep() will invoke both sqlite3SelectExpand() and |
| 1139 | ** this routine in the correct order. |
| 1140 | */ |
| 1141 | if( (p->selFlags & SF_Expanded)==0 ){ |
| 1142 | sqlite3SelectPrep(pParse, p, pOuterNC); |
| 1143 | return (pParse->nErr || db->mallocFailed) ? WRC_Abort : WRC_Prune; |
| 1144 | } |
| 1145 | |
| 1146 | isCompound = p->pPrior!=0; |
| 1147 | nCompound = 0; |
| 1148 | pLeftmost = p; |
| 1149 | while( p ){ |
| 1150 | assert( (p->selFlags & SF_Expanded)!=0 ); |
| 1151 | assert( (p->selFlags & SF_Resolved)==0 ); |
| 1152 | p->selFlags |= SF_Resolved; |
| 1153 | |
| 1154 | /* Resolve the expressions in the LIMIT and OFFSET clauses. These |
| 1155 | ** are not allowed to refer to any names, so pass an empty NameContext. |
| 1156 | */ |
| 1157 | memset(&sNC, 0, sizeof(sNC)); |
| 1158 | sNC.pParse = pParse; |
| 1159 | if( sqlite3ResolveExprNames(&sNC, p->pLimit) || |
| 1160 | sqlite3ResolveExprNames(&sNC, p->pOffset) ){ |
| 1161 | return WRC_Abort; |
| 1162 | } |
| 1163 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1164 | /* Recursively resolve names in all subqueries |
| 1165 | */ |
| 1166 | for(i=0; i<p->pSrc->nSrc; i++){ |
| 1167 | struct SrcList_item *pItem = &p->pSrc->a[i]; |
| 1168 | if( pItem->pSelect ){ |
dan | da79cf0 | 2011-07-08 16:10:54 +0000 | [diff] [blame] | 1169 | NameContext *pNC; /* Used to iterate name contexts */ |
| 1170 | int nRef = 0; /* Refcount for pOuterNC and outer contexts */ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1171 | const char *zSavedContext = pParse->zAuthContext; |
dan | da79cf0 | 2011-07-08 16:10:54 +0000 | [diff] [blame] | 1172 | |
| 1173 | /* Count the total number of references to pOuterNC and all of its |
| 1174 | ** parent contexts. After resolving references to expressions in |
| 1175 | ** pItem->pSelect, check if this value has changed. If so, then |
| 1176 | ** SELECT statement pItem->pSelect must be correlated. Set the |
| 1177 | ** pItem->isCorrelated flag if this is the case. */ |
| 1178 | for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef += pNC->nRef; |
| 1179 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1180 | if( pItem->zName ) pParse->zAuthContext = pItem->zName; |
drh | cd2b561 | 2008-12-09 14:03:22 +0000 | [diff] [blame] | 1181 | sqlite3ResolveSelectNames(pParse, pItem->pSelect, pOuterNC); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1182 | pParse->zAuthContext = zSavedContext; |
| 1183 | if( pParse->nErr || db->mallocFailed ) return WRC_Abort; |
dan | da79cf0 | 2011-07-08 16:10:54 +0000 | [diff] [blame] | 1184 | |
| 1185 | for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef -= pNC->nRef; |
| 1186 | assert( pItem->isCorrelated==0 && nRef<=0 ); |
| 1187 | pItem->isCorrelated = (nRef!=0); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1188 | } |
| 1189 | } |
| 1190 | |
drh | 92689d2 | 2012-12-18 16:07:08 +0000 | [diff] [blame] | 1191 | /* Set up the local name-context to pass to sqlite3ResolveExprNames() to |
| 1192 | ** resolve the result-set expression list. |
| 1193 | */ |
| 1194 | sNC.ncFlags = NC_AllowAgg; |
| 1195 | sNC.pSrcList = p->pSrc; |
| 1196 | sNC.pNext = pOuterNC; |
| 1197 | |
| 1198 | /* Resolve names in the result set. */ |
| 1199 | pEList = p->pEList; |
| 1200 | assert( pEList!=0 ); |
| 1201 | for(i=0; i<pEList->nExpr; i++){ |
| 1202 | Expr *pX = pEList->a[i].pExpr; |
| 1203 | if( sqlite3ResolveExprNames(&sNC, pX) ){ |
| 1204 | return WRC_Abort; |
| 1205 | } |
| 1206 | } |
| 1207 | |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1208 | /* If there are no aggregate functions in the result-set, and no GROUP BY |
| 1209 | ** expression, do not allow aggregates in any of the other expressions. |
| 1210 | */ |
| 1211 | assert( (p->selFlags & SF_Aggregate)==0 ); |
| 1212 | pGroupBy = p->pGroupBy; |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1213 | if( pGroupBy || (sNC.ncFlags & NC_HasAgg)!=0 ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1214 | p->selFlags |= SF_Aggregate; |
| 1215 | }else{ |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1216 | sNC.ncFlags &= ~NC_AllowAgg; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1217 | } |
| 1218 | |
| 1219 | /* If a HAVING clause is present, then there must be a GROUP BY clause. |
| 1220 | */ |
| 1221 | if( p->pHaving && !pGroupBy ){ |
| 1222 | sqlite3ErrorMsg(pParse, "a GROUP BY clause is required before HAVING"); |
| 1223 | return WRC_Abort; |
| 1224 | } |
| 1225 | |
drh | 26080d9 | 2013-08-15 14:27:42 +0000 | [diff] [blame] | 1226 | /* Add the output column list to the name-context before parsing the |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1227 | ** other expressions in the SELECT statement. This is so that |
| 1228 | ** expressions in the WHERE clause (etc.) can refer to expressions by |
| 1229 | ** aliases in the result set. |
| 1230 | ** |
| 1231 | ** Minor point: If this is the case, then the expression will be |
| 1232 | ** re-evaluated for each reference to it. |
| 1233 | */ |
| 1234 | sNC.pEList = p->pEList; |
drh | 58a450c | 2013-05-16 01:02:45 +0000 | [diff] [blame] | 1235 | if( sqlite3ResolveExprNames(&sNC, p->pHaving) ) return WRC_Abort; |
drh | a3a5bd9 | 2013-04-13 19:59:58 +0000 | [diff] [blame] | 1236 | if( sqlite3ResolveExprNames(&sNC, p->pWhere) ) return WRC_Abort; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1237 | |
| 1238 | /* The ORDER BY and GROUP BY clauses may not refer to terms in |
| 1239 | ** outer queries |
| 1240 | */ |
| 1241 | sNC.pNext = 0; |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1242 | sNC.ncFlags |= NC_AllowAgg; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1243 | |
| 1244 | /* Process the ORDER BY clause for singleton SELECT statements. |
| 1245 | ** The ORDER BY clause for compounds SELECT statements is handled |
| 1246 | ** below, after all of the result-sets for all of the elements of |
| 1247 | ** the compound have been resolved. |
| 1248 | */ |
| 1249 | if( !isCompound && resolveOrderGroupBy(&sNC, p, p->pOrderBy, "ORDER") ){ |
| 1250 | return WRC_Abort; |
| 1251 | } |
| 1252 | if( db->mallocFailed ){ |
| 1253 | return WRC_Abort; |
| 1254 | } |
| 1255 | |
| 1256 | /* Resolve the GROUP BY clause. At the same time, make sure |
| 1257 | ** the GROUP BY clause does not contain aggregate functions. |
| 1258 | */ |
| 1259 | if( pGroupBy ){ |
| 1260 | struct ExprList_item *pItem; |
| 1261 | |
| 1262 | if( resolveOrderGroupBy(&sNC, p, pGroupBy, "GROUP") || db->mallocFailed ){ |
| 1263 | return WRC_Abort; |
| 1264 | } |
| 1265 | for(i=0, pItem=pGroupBy->a; i<pGroupBy->nExpr; i++, pItem++){ |
| 1266 | if( ExprHasProperty(pItem->pExpr, EP_Agg) ){ |
| 1267 | sqlite3ErrorMsg(pParse, "aggregate functions are not allowed in " |
| 1268 | "the GROUP BY clause"); |
| 1269 | return WRC_Abort; |
| 1270 | } |
| 1271 | } |
| 1272 | } |
| 1273 | |
| 1274 | /* Advance to the next term of the compound |
| 1275 | */ |
| 1276 | p = p->pPrior; |
| 1277 | nCompound++; |
| 1278 | } |
| 1279 | |
| 1280 | /* Resolve the ORDER BY on a compound SELECT after all terms of |
| 1281 | ** the compound have been resolved. |
| 1282 | */ |
| 1283 | if( isCompound && resolveCompoundOrderBy(pParse, pLeftmost) ){ |
| 1284 | return WRC_Abort; |
| 1285 | } |
| 1286 | |
| 1287 | return WRC_Prune; |
| 1288 | } |
| 1289 | |
| 1290 | /* |
| 1291 | ** This routine walks an expression tree and resolves references to |
| 1292 | ** table columns and result-set columns. At the same time, do error |
| 1293 | ** checking on function usage and set a flag if any aggregate functions |
| 1294 | ** are seen. |
| 1295 | ** |
| 1296 | ** To resolve table columns references we look for nodes (or subtrees) of the |
| 1297 | ** form X.Y.Z or Y.Z or just Z where |
| 1298 | ** |
| 1299 | ** X: The name of a database. Ex: "main" or "temp" or |
| 1300 | ** the symbolic name assigned to an ATTACH-ed database. |
| 1301 | ** |
| 1302 | ** Y: The name of a table in a FROM clause. Or in a trigger |
| 1303 | ** one of the special names "old" or "new". |
| 1304 | ** |
| 1305 | ** Z: The name of a column in table Y. |
| 1306 | ** |
| 1307 | ** The node at the root of the subtree is modified as follows: |
| 1308 | ** |
| 1309 | ** Expr.op Changed to TK_COLUMN |
| 1310 | ** Expr.pTab Points to the Table object for X.Y |
| 1311 | ** Expr.iColumn The column index in X.Y. -1 for the rowid. |
| 1312 | ** Expr.iTable The VDBE cursor number for X.Y |
| 1313 | ** |
| 1314 | ** |
| 1315 | ** To resolve result-set references, look for expression nodes of the |
| 1316 | ** form Z (with no X and Y prefix) where the Z matches the right-hand |
| 1317 | ** size of an AS clause in the result-set of a SELECT. The Z expression |
| 1318 | ** is replaced by a copy of the left-hand side of the result-set expression. |
| 1319 | ** Table-name and function resolution occurs on the substituted expression |
| 1320 | ** tree. For example, in: |
| 1321 | ** |
| 1322 | ** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY x; |
| 1323 | ** |
| 1324 | ** The "x" term of the order by is replaced by "a+b" to render: |
| 1325 | ** |
| 1326 | ** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY a+b; |
| 1327 | ** |
| 1328 | ** Function calls are checked to make sure that the function is |
| 1329 | ** defined and that the correct number of arguments are specified. |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1330 | ** If the function is an aggregate function, then the NC_HasAgg flag is |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1331 | ** set and the opcode is changed from TK_FUNCTION to TK_AGG_FUNCTION. |
| 1332 | ** If an expression contains aggregate functions then the EP_Agg |
| 1333 | ** property on the expression is set. |
| 1334 | ** |
| 1335 | ** An error message is left in pParse if anything is amiss. The number |
| 1336 | ** if errors is returned. |
| 1337 | */ |
| 1338 | int sqlite3ResolveExprNames( |
| 1339 | NameContext *pNC, /* Namespace to resolve expressions in. */ |
| 1340 | Expr *pExpr /* The expression to be analyzed. */ |
| 1341 | ){ |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1342 | u8 savedHasAgg; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1343 | Walker w; |
| 1344 | |
| 1345 | if( pExpr==0 ) return 0; |
| 1346 | #if SQLITE_MAX_EXPR_DEPTH>0 |
| 1347 | { |
| 1348 | Parse *pParse = pNC->pParse; |
| 1349 | if( sqlite3ExprCheckHeight(pParse, pExpr->nHeight+pNC->pParse->nHeight) ){ |
| 1350 | return 1; |
| 1351 | } |
| 1352 | pParse->nHeight += pExpr->nHeight; |
| 1353 | } |
| 1354 | #endif |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1355 | savedHasAgg = pNC->ncFlags & NC_HasAgg; |
| 1356 | pNC->ncFlags &= ~NC_HasAgg; |
drh | aa87f9a | 2013-04-25 00:57:10 +0000 | [diff] [blame] | 1357 | memset(&w, 0, sizeof(w)); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1358 | w.xExprCallback = resolveExprStep; |
| 1359 | w.xSelectCallback = resolveSelectStep; |
| 1360 | w.pParse = pNC->pParse; |
| 1361 | w.u.pNC = pNC; |
| 1362 | sqlite3WalkExpr(&w, pExpr); |
| 1363 | #if SQLITE_MAX_EXPR_DEPTH>0 |
| 1364 | pNC->pParse->nHeight -= pExpr->nHeight; |
| 1365 | #endif |
drh | fd773cf | 2009-05-29 14:39:07 +0000 | [diff] [blame] | 1366 | if( pNC->nErr>0 || w.pParse->nErr>0 ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1367 | ExprSetProperty(pExpr, EP_Error); |
| 1368 | } |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1369 | if( pNC->ncFlags & NC_HasAgg ){ |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1370 | ExprSetProperty(pExpr, EP_Agg); |
| 1371 | }else if( savedHasAgg ){ |
drh | a51009b | 2012-05-21 19:11:25 +0000 | [diff] [blame] | 1372 | pNC->ncFlags |= NC_HasAgg; |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1373 | } |
| 1374 | return ExprHasProperty(pExpr, EP_Error); |
| 1375 | } |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1376 | |
| 1377 | |
| 1378 | /* |
| 1379 | ** Resolve all names in all expressions of a SELECT and in all |
| 1380 | ** decendents of the SELECT, including compounds off of p->pPrior, |
| 1381 | ** subqueries in expressions, and subqueries used as FROM clause |
| 1382 | ** terms. |
| 1383 | ** |
| 1384 | ** See sqlite3ResolveExprNames() for a description of the kinds of |
| 1385 | ** transformations that occur. |
| 1386 | ** |
| 1387 | ** All SELECT statements should have been expanded using |
| 1388 | ** sqlite3SelectExpand() prior to invoking this routine. |
| 1389 | */ |
| 1390 | void sqlite3ResolveSelectNames( |
| 1391 | Parse *pParse, /* The parser context */ |
| 1392 | Select *p, /* The SELECT statement being coded. */ |
| 1393 | NameContext *pOuterNC /* Name context for parent SELECT statement */ |
| 1394 | ){ |
| 1395 | Walker w; |
| 1396 | |
drh | 0a846f9 | 2008-08-25 17:23:29 +0000 | [diff] [blame] | 1397 | assert( p!=0 ); |
drh | aa87f9a | 2013-04-25 00:57:10 +0000 | [diff] [blame] | 1398 | memset(&w, 0, sizeof(w)); |
drh | 0a846f9 | 2008-08-25 17:23:29 +0000 | [diff] [blame] | 1399 | w.xExprCallback = resolveExprStep; |
| 1400 | w.xSelectCallback = resolveSelectStep; |
| 1401 | w.pParse = pParse; |
| 1402 | w.u.pNC = pOuterNC; |
| 1403 | sqlite3WalkSelect(&w, p); |
drh | 7d10d5a | 2008-08-20 16:35:10 +0000 | [diff] [blame] | 1404 | } |
drh | 3780be1 | 2013-07-31 19:05:22 +0000 | [diff] [blame] | 1405 | |
| 1406 | /* |
| 1407 | ** Resolve names in expressions that can only reference a single table: |
| 1408 | ** |
| 1409 | ** * CHECK constraints |
| 1410 | ** * WHERE clauses on partial indices |
| 1411 | ** |
| 1412 | ** The Expr.iTable value for Expr.op==TK_COLUMN nodes of the expression |
| 1413 | ** is set to -1 and the Expr.iColumn value is set to the column number. |
| 1414 | ** |
| 1415 | ** Any errors cause an error message to be set in pParse. |
| 1416 | */ |
| 1417 | void sqlite3ResolveSelfReference( |
| 1418 | Parse *pParse, /* Parsing context */ |
| 1419 | Table *pTab, /* The table being referenced */ |
| 1420 | int type, /* NC_IsCheck or NC_PartIdx */ |
| 1421 | Expr *pExpr, /* Expression to resolve. May be NULL. */ |
| 1422 | ExprList *pList /* Expression list to resolve. May be NUL. */ |
| 1423 | ){ |
| 1424 | SrcList sSrc; /* Fake SrcList for pParse->pNewTable */ |
| 1425 | NameContext sNC; /* Name context for pParse->pNewTable */ |
| 1426 | int i; /* Loop counter */ |
| 1427 | |
| 1428 | assert( type==NC_IsCheck || type==NC_PartIdx ); |
| 1429 | memset(&sNC, 0, sizeof(sNC)); |
| 1430 | memset(&sSrc, 0, sizeof(sSrc)); |
| 1431 | sSrc.nSrc = 1; |
| 1432 | sSrc.a[0].zName = pTab->zName; |
| 1433 | sSrc.a[0].pTab = pTab; |
| 1434 | sSrc.a[0].iCursor = -1; |
| 1435 | sNC.pParse = pParse; |
| 1436 | sNC.pSrcList = &sSrc; |
| 1437 | sNC.ncFlags = type; |
| 1438 | if( sqlite3ResolveExprNames(&sNC, pExpr) ) return; |
| 1439 | if( pList ){ |
| 1440 | for(i=0; i<pList->nExpr; i++){ |
| 1441 | if( sqlite3ResolveExprNames(&sNC, pList->a[i].pExpr) ){ |
| 1442 | return; |
| 1443 | } |
| 1444 | } |
| 1445 | } |
| 1446 | } |