blob: b536dcfe016edf4905cbe56f8cd9952e98a6f835 [file] [log] [blame]
drh7d10d5a2008-08-20 16:35:10 +00001/*
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.
16**
drh0b0745a2009-05-28 12:49:53 +000017** $Id: resolve.c,v 1.25 2009/05/28 12:49:53 drh Exp $
drh7d10d5a2008-08-20 16:35:10 +000018*/
19#include "sqliteInt.h"
20#include <stdlib.h>
21#include <string.h>
22
23/*
drh8b213892008-08-29 02:14:02 +000024** Turn the pExpr expression into an alias for the iCol-th column of the
25** result set in pEList.
26**
27** If the result set column is a simple column reference, then this routine
28** makes an exact copy. But for any other kind of expression, this
29** routine make a copy of the result set column as the argument to the
30** TK_AS operator. The TK_AS operator causes the expression to be
31** evaluated just once and then reused for each alias.
32**
33** The reason for suppressing the TK_AS term when the expression is a simple
34** column reference is so that the column reference will be recognized as
35** usable by indices within the WHERE clause processing logic.
36**
37** Hack: The TK_AS operator is inhibited if zType[0]=='G'. This means
38** that in a GROUP BY clause, the expression is evaluated twice. Hence:
39**
40** SELECT random()%5 AS x, count(*) FROM tab GROUP BY x
41**
42** Is equivalent to:
43**
44** SELECT random()%5 AS x, count(*) FROM tab GROUP BY random()%5
45**
46** The result of random()%5 in the GROUP BY clause is probably different
47** from the result in the result-set. We might fix this someday. Or
48** then again, we might not...
49*/
50static void resolveAlias(
51 Parse *pParse, /* Parsing context */
52 ExprList *pEList, /* A result set */
53 int iCol, /* A column in the result set. 0..pEList->nExpr-1 */
54 Expr *pExpr, /* Transform this into an alias to the result set */
55 const char *zType /* "GROUP" or "ORDER" or "" */
56){
57 Expr *pOrig; /* The iCol-th column of the result set */
58 Expr *pDup; /* Copy of pOrig */
59 sqlite3 *db; /* The database connection */
60
61 assert( iCol>=0 && iCol<pEList->nExpr );
62 pOrig = pEList->a[iCol].pExpr;
63 assert( pOrig!=0 );
64 assert( pOrig->flags & EP_Resolved );
65 db = pParse->db;
drhb7916a72009-05-27 10:31:29 +000066 if( pOrig->op!=TK_COLUMN && zType[0]!='G' ){
67 pDup = sqlite3ExprDup(db, pOrig, 0);
drh8b213892008-08-29 02:14:02 +000068 pDup = sqlite3PExpr(pParse, TK_AS, pDup, 0, 0);
69 if( pDup==0 ) return;
70 if( pEList->a[iCol].iAlias==0 ){
drhea678832008-12-10 19:26:22 +000071 pEList->a[iCol].iAlias = (u16)(++pParse->nAlias);
drh8b213892008-08-29 02:14:02 +000072 }
73 pDup->iTable = pEList->a[iCol].iAlias;
drh0b0745a2009-05-28 12:49:53 +000074 }else if( ExprHasProperty(pOrig, EP_IntValue) || pOrig->u.zToken==0 ){
75 pDup = sqlite3ExprDup(db, pOrig, 0);
drhb7916a72009-05-27 10:31:29 +000076 }else{
drh33e619f2009-05-28 01:00:55 +000077 char *zToken = pOrig->u.zToken;
78 pOrig->u.zToken = 0;
drhb7916a72009-05-27 10:31:29 +000079 pDup = sqlite3ExprDup(db, pOrig, 0);
drh33e619f2009-05-28 01:00:55 +000080 pOrig->u.zToken = zToken;
drhb7916a72009-05-27 10:31:29 +000081 if( pDup==0 ) return;
82 if( zToken ){
83 assert( (pDup->flags & (EP_Reduced|EP_TokenOnly))==0 );
drh33e619f2009-05-28 01:00:55 +000084 pDup->flags2 |= EP2_MallocedToken;
85 pDup->u.zToken = sqlite3DbStrDup(db, zToken);
drhb7916a72009-05-27 10:31:29 +000086 }
drh8b213892008-08-29 02:14:02 +000087 }
88 if( pExpr->flags & EP_ExpCollate ){
89 pDup->pColl = pExpr->pColl;
90 pDup->flags |= EP_ExpCollate;
91 }
drh10fe8402008-10-11 16:47:35 +000092 sqlite3ExprClear(db, pExpr);
drh8b213892008-08-29 02:14:02 +000093 memcpy(pExpr, pDup, sizeof(*pExpr));
94 sqlite3DbFree(db, pDup);
95}
96
97/*
drh7d10d5a2008-08-20 16:35:10 +000098** Given the name of a column of the form X.Y.Z or Y.Z or just Z, look up
99** that name in the set of source tables in pSrcList and make the pExpr
100** expression node refer back to that source column. The following changes
101** are made to pExpr:
102**
103** pExpr->iDb Set the index in db->aDb[] of the database X
104** (even if X is implied).
105** pExpr->iTable Set to the cursor number for the table obtained
106** from pSrcList.
107** pExpr->pTab Points to the Table structure of X.Y (even if
108** X and/or Y are implied.)
109** pExpr->iColumn Set to the column number within the table.
110** pExpr->op Set to TK_COLUMN.
111** pExpr->pLeft Any expression this points to is deleted
112** pExpr->pRight Any expression this points to is deleted.
113**
drhb7916a72009-05-27 10:31:29 +0000114** The zDb variable is the name of the database (the "X"). This value may be
drh7d10d5a2008-08-20 16:35:10 +0000115** NULL meaning that name is of the form Y.Z or Z. Any available database
drhb7916a72009-05-27 10:31:29 +0000116** can be used. The zTable variable is the name of the table (the "Y"). This
117** value can be NULL if zDb is also NULL. If zTable is NULL it
drh7d10d5a2008-08-20 16:35:10 +0000118** means that the form of the name is Z and that columns from any table
119** can be used.
120**
121** If the name cannot be resolved unambiguously, leave an error message
122** in pParse and return non-zero. Return zero on success.
123*/
124static int lookupName(
125 Parse *pParse, /* The parsing context */
drhb7916a72009-05-27 10:31:29 +0000126 const char *zDb, /* Name of the database containing table, or NULL */
127 const char *zTab, /* Name of table containing column, or NULL */
128 const char *zCol, /* Name of the column. */
drh7d10d5a2008-08-20 16:35:10 +0000129 NameContext *pNC, /* The name context used to resolve the name */
130 Expr *pExpr /* Make this EXPR node point to the selected column */
131){
drh7d10d5a2008-08-20 16:35:10 +0000132 int i, j; /* Loop counters */
133 int cnt = 0; /* Number of matching column names */
134 int cntTab = 0; /* Number of matching table names */
135 sqlite3 *db = pParse->db; /* The database connection */
136 struct SrcList_item *pItem; /* Use for looping over pSrcList items */
137 struct SrcList_item *pMatch = 0; /* The matching pSrcList item */
138 NameContext *pTopNC = pNC; /* First namecontext in the list */
139 Schema *pSchema = 0; /* Schema of the expression */
140
drhb7916a72009-05-27 10:31:29 +0000141 assert( pNC ); /* the name context cannot be NULL. */
142 assert( zCol ); /* The Z in X.Y.Z cannot be NULL */
drh33e619f2009-05-28 01:00:55 +0000143 assert( ~ExprHasAnyProperty(pExpr, EP_TokenOnly|EP_Reduced) );
drh7d10d5a2008-08-20 16:35:10 +0000144
145 /* Initialize the node to no-match */
146 pExpr->iTable = -1;
147 pExpr->pTab = 0;
drh33e619f2009-05-28 01:00:55 +0000148 ExprSetIrreducible(pExpr);
drh7d10d5a2008-08-20 16:35:10 +0000149
150 /* Start at the inner-most context and move outward until a match is found */
151 while( pNC && cnt==0 ){
152 ExprList *pEList;
153 SrcList *pSrcList = pNC->pSrcList;
154
155 if( pSrcList ){
156 for(i=0, pItem=pSrcList->a; i<pSrcList->nSrc; i++, pItem++){
157 Table *pTab;
158 int iDb;
159 Column *pCol;
160
161 pTab = pItem->pTab;
drhf4366202008-08-25 12:14:08 +0000162 assert( pTab!=0 && pTab->zName!=0 );
drh7d10d5a2008-08-20 16:35:10 +0000163 iDb = sqlite3SchemaToIndex(db, pTab->pSchema);
164 assert( pTab->nCol>0 );
165 if( zTab ){
166 if( pItem->zAlias ){
167 char *zTabName = pItem->zAlias;
168 if( sqlite3StrICmp(zTabName, zTab)!=0 ) continue;
169 }else{
170 char *zTabName = pTab->zName;
171 if( zTabName==0 || sqlite3StrICmp(zTabName, zTab)!=0 ) continue;
172 if( zDb!=0 && sqlite3StrICmp(db->aDb[iDb].zName, zDb)!=0 ){
173 continue;
174 }
175 }
176 }
177 if( 0==(cntTab++) ){
178 pExpr->iTable = pItem->iCursor;
179 pExpr->pTab = pTab;
180 pSchema = pTab->pSchema;
181 pMatch = pItem;
182 }
183 for(j=0, pCol=pTab->aCol; j<pTab->nCol; j++, pCol++){
184 if( sqlite3StrICmp(pCol->zName, zCol)==0 ){
185 IdList *pUsing;
186 cnt++;
187 pExpr->iTable = pItem->iCursor;
188 pExpr->pTab = pTab;
189 pMatch = pItem;
190 pSchema = pTab->pSchema;
191 /* Substitute the rowid (column -1) for the INTEGER PRIMARY KEY */
192 pExpr->iColumn = j==pTab->iPKey ? -1 : j;
193 if( i<pSrcList->nSrc-1 ){
194 if( pItem[1].jointype & JT_NATURAL ){
195 /* If this match occurred in the left table of a natural join,
196 ** then skip the right table to avoid a duplicate match */
197 pItem++;
198 i++;
199 }else if( (pUsing = pItem[1].pUsing)!=0 ){
200 /* If this match occurs on a column that is in the USING clause
201 ** of a join, skip the search of the right table of the join
202 ** to avoid a duplicate match there. */
203 int k;
204 for(k=0; k<pUsing->nId; k++){
205 if( sqlite3StrICmp(pUsing->a[k].zName, zCol)==0 ){
206 pItem++;
207 i++;
208 break;
209 }
210 }
211 }
212 }
213 break;
214 }
215 }
216 }
217 }
218
219#ifndef SQLITE_OMIT_TRIGGER
220 /* If we have not already resolved the name, then maybe
221 ** it is a new.* or old.* trigger argument reference
222 */
223 if( zDb==0 && zTab!=0 && cnt==0 && pParse->trigStack!=0 ){
224 TriggerStack *pTriggerStack = pParse->trigStack;
225 Table *pTab = 0;
drhb27b7f52008-12-10 18:03:45 +0000226 u32 *piColMask = 0;
drh7d10d5a2008-08-20 16:35:10 +0000227 if( pTriggerStack->newIdx != -1 && sqlite3StrICmp("new", zTab) == 0 ){
228 pExpr->iTable = pTriggerStack->newIdx;
229 assert( pTriggerStack->pTab );
230 pTab = pTriggerStack->pTab;
231 piColMask = &(pTriggerStack->newColMask);
232 }else if( pTriggerStack->oldIdx != -1 && sqlite3StrICmp("old", zTab)==0 ){
233 pExpr->iTable = pTriggerStack->oldIdx;
234 assert( pTriggerStack->pTab );
235 pTab = pTriggerStack->pTab;
236 piColMask = &(pTriggerStack->oldColMask);
237 }
238
239 if( pTab ){
240 int iCol;
241 Column *pCol = pTab->aCol;
242
243 pSchema = pTab->pSchema;
244 cntTab++;
245 for(iCol=0; iCol < pTab->nCol; iCol++, pCol++) {
246 if( sqlite3StrICmp(pCol->zName, zCol)==0 ){
247 cnt++;
248 pExpr->iColumn = iCol==pTab->iPKey ? -1 : iCol;
249 pExpr->pTab = pTab;
250 if( iCol>=0 ){
251 testcase( iCol==31 );
252 testcase( iCol==32 );
drh3500ed62009-05-05 15:46:43 +0000253 if( iCol>=32 ){
254 *piColMask = 0xffffffff;
255 }else{
256 *piColMask |= ((u32)1)<<iCol;
257 }
drh7d10d5a2008-08-20 16:35:10 +0000258 }
259 break;
260 }
261 }
262 }
263 }
264#endif /* !defined(SQLITE_OMIT_TRIGGER) */
265
266 /*
267 ** Perhaps the name is a reference to the ROWID
268 */
269 if( cnt==0 && cntTab==1 && sqlite3IsRowid(zCol) ){
270 cnt = 1;
271 pExpr->iColumn = -1;
272 pExpr->affinity = SQLITE_AFF_INTEGER;
273 }
274
275 /*
276 ** If the input is of the form Z (not Y.Z or X.Y.Z) then the name Z
277 ** might refer to an result-set alias. This happens, for example, when
278 ** we are resolving names in the WHERE clause of the following command:
279 **
280 ** SELECT a+b AS x FROM table WHERE x<10;
281 **
282 ** In cases like this, replace pExpr with a copy of the expression that
283 ** forms the result set entry ("a+b" in the example) and return immediately.
284 ** Note that the expression in the result set should have already been
285 ** resolved by the time the WHERE clause is resolved.
286 */
287 if( cnt==0 && (pEList = pNC->pEList)!=0 && zTab==0 ){
288 for(j=0; j<pEList->nExpr; j++){
289 char *zAs = pEList->a[j].zName;
290 if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){
drh8b213892008-08-29 02:14:02 +0000291 Expr *pOrig;
drh7d10d5a2008-08-20 16:35:10 +0000292 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
danielk19776ab3a2e2009-02-19 14:39:25 +0000293 assert( pExpr->x.pList==0 );
294 assert( pExpr->x.pSelect==0 );
drh7d10d5a2008-08-20 16:35:10 +0000295 pOrig = pEList->a[j].pExpr;
296 if( !pNC->allowAgg && ExprHasProperty(pOrig, EP_Agg) ){
297 sqlite3ErrorMsg(pParse, "misuse of aliased aggregate %s", zAs);
drh7d10d5a2008-08-20 16:35:10 +0000298 return 2;
299 }
drh8b213892008-08-29 02:14:02 +0000300 resolveAlias(pParse, pEList, j, pExpr, "");
drh7d10d5a2008-08-20 16:35:10 +0000301 cnt = 1;
302 pMatch = 0;
303 assert( zTab==0 && zDb==0 );
drhb7916a72009-05-27 10:31:29 +0000304 goto lookupname_end;
drh7d10d5a2008-08-20 16:35:10 +0000305 }
306 }
307 }
308
309 /* Advance to the next name context. The loop will exit when either
310 ** we have a match (cnt>0) or when we run out of name contexts.
311 */
312 if( cnt==0 ){
313 pNC = pNC->pNext;
314 }
315 }
316
317 /*
318 ** If X and Y are NULL (in other words if only the column name Z is
319 ** supplied) and the value of Z is enclosed in double-quotes, then
320 ** Z is a string literal if it doesn't match any column names. In that
321 ** case, we need to return right away and not make any changes to
322 ** pExpr.
323 **
324 ** Because no reference was made to outer contexts, the pNC->nRef
325 ** fields are not changed in any context.
326 */
drh24fb6272009-05-01 21:13:36 +0000327 if( cnt==0 && zTab==0 && ExprHasProperty(pExpr,EP_DblQuoted) ){
drh7d10d5a2008-08-20 16:35:10 +0000328 pExpr->op = TK_STRING;
drh1885d1c2008-10-19 21:03:27 +0000329 pExpr->pTab = 0;
drh7d10d5a2008-08-20 16:35:10 +0000330 return 0;
331 }
332
333 /*
334 ** cnt==0 means there was not match. cnt>1 means there were two or
335 ** more matches. Either way, we have an error.
336 */
337 if( cnt!=1 ){
338 const char *zErr;
339 zErr = cnt==0 ? "no such column" : "ambiguous column name";
340 if( zDb ){
341 sqlite3ErrorMsg(pParse, "%s: %s.%s.%s", zErr, zDb, zTab, zCol);
342 }else if( zTab ){
343 sqlite3ErrorMsg(pParse, "%s: %s.%s", zErr, zTab, zCol);
344 }else{
345 sqlite3ErrorMsg(pParse, "%s: %s", zErr, zCol);
346 }
347 pTopNC->nErr++;
348 }
349
350 /* If a column from a table in pSrcList is referenced, then record
351 ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes
352 ** bit 0 to be set. Column 1 sets bit 1. And so forth. If the
353 ** column number is greater than the number of bits in the bitmask
354 ** then set the high-order bit of the bitmask.
355 */
danielk19772d2e7bd2009-02-24 10:14:40 +0000356 if( pExpr->iColumn>=0 && pMatch!=0 ){
357 int n = pExpr->iColumn;
358 testcase( n==BMS-1 );
359 if( n>=BMS ){
360 n = BMS-1;
drh7d10d5a2008-08-20 16:35:10 +0000361 }
danielk19772d2e7bd2009-02-24 10:14:40 +0000362 assert( pMatch->iCursor==pExpr->iTable );
363 pMatch->colUsed |= ((Bitmask)1)<<n;
drh7d10d5a2008-08-20 16:35:10 +0000364 }
365
drh7d10d5a2008-08-20 16:35:10 +0000366 /* Clean up and return
367 */
drh7d10d5a2008-08-20 16:35:10 +0000368 sqlite3ExprDelete(db, pExpr->pLeft);
369 pExpr->pLeft = 0;
370 sqlite3ExprDelete(db, pExpr->pRight);
371 pExpr->pRight = 0;
372 pExpr->op = TK_COLUMN;
drhb7916a72009-05-27 10:31:29 +0000373lookupname_end:
drh7d10d5a2008-08-20 16:35:10 +0000374 if( cnt==1 ){
375 assert( pNC!=0 );
376 sqlite3AuthRead(pParse, pExpr, pSchema, pNC->pSrcList);
377 /* Increment the nRef value on all name contexts from TopNC up to
378 ** the point where the name matched. */
379 for(;;){
380 assert( pTopNC!=0 );
381 pTopNC->nRef++;
382 if( pTopNC==pNC ) break;
383 pTopNC = pTopNC->pNext;
384 }
385 return 0;
386 } else {
387 return 1;
388 }
389}
390
391/*
392** This routine is callback for sqlite3WalkExpr().
393**
394** Resolve symbolic names into TK_COLUMN operators for the current
395** node in the expression tree. Return 0 to continue the search down
396** the tree or 2 to abort the tree walk.
397**
398** This routine also does error checking and name resolution for
399** function names. The operator for aggregate functions is changed
400** to TK_AGG_FUNCTION.
401*/
402static int resolveExprStep(Walker *pWalker, Expr *pExpr){
403 NameContext *pNC;
404 Parse *pParse;
405
drh7d10d5a2008-08-20 16:35:10 +0000406 pNC = pWalker->u.pNC;
407 assert( pNC!=0 );
408 pParse = pNC->pParse;
409 assert( pParse==pWalker->pParse );
410
411 if( ExprHasAnyProperty(pExpr, EP_Resolved) ) return WRC_Prune;
412 ExprSetProperty(pExpr, EP_Resolved);
413#ifndef NDEBUG
414 if( pNC->pSrcList && pNC->pSrcList->nAlloc>0 ){
415 SrcList *pSrcList = pNC->pSrcList;
416 int i;
417 for(i=0; i<pNC->pSrcList->nSrc; i++){
418 assert( pSrcList->a[i].iCursor>=0 && pSrcList->a[i].iCursor<pParse->nTab);
419 }
420 }
421#endif
422 switch( pExpr->op ){
drh41204f12008-10-06 13:54:35 +0000423
shane273f6192008-10-10 04:34:16 +0000424#if defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY)
drh41204f12008-10-06 13:54:35 +0000425 /* The special operator TK_ROW means use the rowid for the first
426 ** column in the FROM clause. This is used by the LIMIT and ORDER BY
427 ** clause processing on UPDATE and DELETE statements.
428 */
429 case TK_ROW: {
430 SrcList *pSrcList = pNC->pSrcList;
431 struct SrcList_item *pItem;
432 assert( pSrcList && pSrcList->nSrc==1 );
433 pItem = pSrcList->a;
434 pExpr->op = TK_COLUMN;
435 pExpr->pTab = pItem->pTab;
436 pExpr->iTable = pItem->iCursor;
437 pExpr->iColumn = -1;
438 pExpr->affinity = SQLITE_AFF_INTEGER;
439 break;
440 }
shane273f6192008-10-10 04:34:16 +0000441#endif /* defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY) */
drh41204f12008-10-06 13:54:35 +0000442
drh7d10d5a2008-08-20 16:35:10 +0000443 /* A lone identifier is the name of a column.
444 */
445 case TK_ID: {
drh33e619f2009-05-28 01:00:55 +0000446 lookupName(pParse, 0, 0, pExpr->u.zToken, pNC, pExpr);
drh7d10d5a2008-08-20 16:35:10 +0000447 return WRC_Prune;
448 }
449
450 /* A table name and column name: ID.ID
451 ** Or a database, table and column: ID.ID.ID
452 */
453 case TK_DOT: {
drhb7916a72009-05-27 10:31:29 +0000454 const char *zColumn;
455 const char *zTable;
456 const char *zDb;
drh7d10d5a2008-08-20 16:35:10 +0000457 Expr *pRight;
458
459 /* if( pSrcList==0 ) break; */
460 pRight = pExpr->pRight;
461 if( pRight->op==TK_ID ){
drhb7916a72009-05-27 10:31:29 +0000462 zDb = 0;
drh33e619f2009-05-28 01:00:55 +0000463 zTable = pExpr->pLeft->u.zToken;
464 zColumn = pRight->u.zToken;
drh7d10d5a2008-08-20 16:35:10 +0000465 }else{
466 assert( pRight->op==TK_DOT );
drh33e619f2009-05-28 01:00:55 +0000467 zDb = pExpr->pLeft->u.zToken;
468 zTable = pRight->pLeft->u.zToken;
469 zColumn = pRight->pRight->u.zToken;
drh7d10d5a2008-08-20 16:35:10 +0000470 }
drhb7916a72009-05-27 10:31:29 +0000471 lookupName(pParse, zDb, zTable, zColumn, pNC, pExpr);
drh7d10d5a2008-08-20 16:35:10 +0000472 return WRC_Prune;
473 }
474
475 /* Resolve function names
476 */
477 case TK_CONST_FUNC:
478 case TK_FUNCTION: {
danielk19776ab3a2e2009-02-19 14:39:25 +0000479 ExprList *pList = pExpr->x.pList; /* The argument list */
480 int n = pList ? pList->nExpr : 0; /* Number of arguments */
drh7d10d5a2008-08-20 16:35:10 +0000481 int no_such_func = 0; /* True if no such function exists */
482 int wrong_num_args = 0; /* True if wrong number of arguments */
483 int is_agg = 0; /* True if is an aggregate function */
484 int auth; /* Authorization to use the function */
485 int nId; /* Number of characters in function name */
486 const char *zId; /* The function name. */
487 FuncDef *pDef; /* Information about the function */
drhea678832008-12-10 19:26:22 +0000488 u8 enc = ENC(pParse->db); /* The database encoding */
drh7d10d5a2008-08-20 16:35:10 +0000489
danielk19776ab3a2e2009-02-19 14:39:25 +0000490 assert( !ExprHasProperty(pExpr, EP_xIsSelect) );
drh33e619f2009-05-28 01:00:55 +0000491 zId = pExpr->u.zToken;
drhb7916a72009-05-27 10:31:29 +0000492 nId = sqlite3Strlen30(zId);
drh7d10d5a2008-08-20 16:35:10 +0000493 pDef = sqlite3FindFunction(pParse->db, zId, nId, n, enc, 0);
494 if( pDef==0 ){
495 pDef = sqlite3FindFunction(pParse->db, zId, nId, -1, enc, 0);
496 if( pDef==0 ){
497 no_such_func = 1;
498 }else{
499 wrong_num_args = 1;
500 }
501 }else{
502 is_agg = pDef->xFunc==0;
503 }
504#ifndef SQLITE_OMIT_AUTHORIZATION
505 if( pDef ){
506 auth = sqlite3AuthCheck(pParse, SQLITE_FUNCTION, 0, pDef->zName, 0);
507 if( auth!=SQLITE_OK ){
508 if( auth==SQLITE_DENY ){
509 sqlite3ErrorMsg(pParse, "not authorized to use function: %s",
510 pDef->zName);
511 pNC->nErr++;
512 }
513 pExpr->op = TK_NULL;
514 return WRC_Prune;
515 }
516 }
517#endif
518 if( is_agg && !pNC->allowAgg ){
519 sqlite3ErrorMsg(pParse, "misuse of aggregate function %.*s()", nId,zId);
520 pNC->nErr++;
521 is_agg = 0;
522 }else if( no_such_func ){
523 sqlite3ErrorMsg(pParse, "no such function: %.*s", nId, zId);
524 pNC->nErr++;
525 }else if( wrong_num_args ){
526 sqlite3ErrorMsg(pParse,"wrong number of arguments to function %.*s()",
527 nId, zId);
528 pNC->nErr++;
529 }
530 if( is_agg ){
531 pExpr->op = TK_AGG_FUNCTION;
532 pNC->hasAgg = 1;
533 }
534 if( is_agg ) pNC->allowAgg = 0;
535 sqlite3WalkExprList(pWalker, pList);
536 if( is_agg ) pNC->allowAgg = 1;
537 /* FIX ME: Compute pExpr->affinity based on the expected return
538 ** type of the function
539 */
540 return WRC_Prune;
541 }
542#ifndef SQLITE_OMIT_SUBQUERY
543 case TK_SELECT:
544 case TK_EXISTS:
545#endif
546 case TK_IN: {
danielk19776ab3a2e2009-02-19 14:39:25 +0000547 if( ExprHasProperty(pExpr, EP_xIsSelect) ){
drh7d10d5a2008-08-20 16:35:10 +0000548 int nRef = pNC->nRef;
549#ifndef SQLITE_OMIT_CHECK
550 if( pNC->isCheck ){
551 sqlite3ErrorMsg(pParse,"subqueries prohibited in CHECK constraints");
552 }
553#endif
danielk19776ab3a2e2009-02-19 14:39:25 +0000554 sqlite3WalkSelect(pWalker, pExpr->x.pSelect);
drh7d10d5a2008-08-20 16:35:10 +0000555 assert( pNC->nRef>=nRef );
556 if( nRef!=pNC->nRef ){
557 ExprSetProperty(pExpr, EP_VarSelect);
558 }
559 }
560 break;
561 }
562#ifndef SQLITE_OMIT_CHECK
563 case TK_VARIABLE: {
564 if( pNC->isCheck ){
565 sqlite3ErrorMsg(pParse,"parameters prohibited in CHECK constraints");
566 }
567 break;
568 }
569#endif
570 }
571 return (pParse->nErr || pParse->db->mallocFailed) ? WRC_Abort : WRC_Continue;
572}
573
574/*
575** pEList is a list of expressions which are really the result set of the
576** a SELECT statement. pE is a term in an ORDER BY or GROUP BY clause.
577** This routine checks to see if pE is a simple identifier which corresponds
578** to the AS-name of one of the terms of the expression list. If it is,
579** this routine return an integer between 1 and N where N is the number of
580** elements in pEList, corresponding to the matching entry. If there is
581** no match, or if pE is not a simple identifier, then this routine
582** return 0.
583**
584** pEList has been resolved. pE has not.
585*/
586static int resolveAsName(
587 Parse *pParse, /* Parsing context for error messages */
588 ExprList *pEList, /* List of expressions to scan */
589 Expr *pE /* Expression we are trying to match */
590){
591 int i; /* Loop counter */
592
drh33e619f2009-05-28 01:00:55 +0000593 if( pE->op==TK_ID || (pE->op==TK_STRING && pE->u.zToken[0]!='\'') ){
594 char *zCol = pE->u.zToken;
drh7d10d5a2008-08-20 16:35:10 +0000595 for(i=0; i<pEList->nExpr; i++){
596 char *zAs = pEList->a[i].zName;
597 if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){
drh7d10d5a2008-08-20 16:35:10 +0000598 return i+1;
599 }
600 }
drh7d10d5a2008-08-20 16:35:10 +0000601 }
602 return 0;
603}
604
605/*
606** pE is a pointer to an expression which is a single term in the
607** ORDER BY of a compound SELECT. The expression has not been
608** name resolved.
609**
610** At the point this routine is called, we already know that the
611** ORDER BY term is not an integer index into the result set. That
612** case is handled by the calling routine.
613**
614** Attempt to match pE against result set columns in the left-most
615** SELECT statement. Return the index i of the matching column,
616** as an indication to the caller that it should sort by the i-th column.
617** The left-most column is 1. In other words, the value returned is the
618** same integer value that would be used in the SQL statement to indicate
619** the column.
620**
621** If there is no match, return 0. Return -1 if an error occurs.
622*/
623static int resolveOrderByTermToExprList(
624 Parse *pParse, /* Parsing context for error messages */
625 Select *pSelect, /* The SELECT statement with the ORDER BY clause */
626 Expr *pE /* The specific ORDER BY term */
627){
628 int i; /* Loop counter */
629 ExprList *pEList; /* The columns of the result set */
630 NameContext nc; /* Name context for resolving pE */
631
632 assert( sqlite3ExprIsInteger(pE, &i)==0 );
633 pEList = pSelect->pEList;
634
635 /* Resolve all names in the ORDER BY term expression
636 */
637 memset(&nc, 0, sizeof(nc));
638 nc.pParse = pParse;
639 nc.pSrcList = pSelect->pSrc;
640 nc.pEList = pEList;
641 nc.allowAgg = 1;
642 nc.nErr = 0;
643 if( sqlite3ResolveExprNames(&nc, pE) ){
644 sqlite3ErrorClear(pParse);
645 return 0;
646 }
647
648 /* Try to match the ORDER BY expression against an expression
649 ** in the result set. Return an 1-based index of the matching
650 ** result-set entry.
651 */
652 for(i=0; i<pEList->nExpr; i++){
653 if( sqlite3ExprCompare(pEList->a[i].pExpr, pE) ){
654 return i+1;
655 }
656 }
657
658 /* If no match, return 0. */
659 return 0;
660}
661
662/*
663** Generate an ORDER BY or GROUP BY term out-of-range error.
664*/
665static void resolveOutOfRangeError(
666 Parse *pParse, /* The error context into which to write the error */
667 const char *zType, /* "ORDER" or "GROUP" */
668 int i, /* The index (1-based) of the term out of range */
669 int mx /* Largest permissible value of i */
670){
671 sqlite3ErrorMsg(pParse,
672 "%r %s BY term out of range - should be "
673 "between 1 and %d", i, zType, mx);
674}
675
676/*
677** Analyze the ORDER BY clause in a compound SELECT statement. Modify
678** each term of the ORDER BY clause is a constant integer between 1
679** and N where N is the number of columns in the compound SELECT.
680**
681** ORDER BY terms that are already an integer between 1 and N are
682** unmodified. ORDER BY terms that are integers outside the range of
683** 1 through N generate an error. ORDER BY terms that are expressions
684** are matched against result set expressions of compound SELECT
685** beginning with the left-most SELECT and working toward the right.
686** At the first match, the ORDER BY expression is transformed into
687** the integer column number.
688**
689** Return the number of errors seen.
690*/
691static int resolveCompoundOrderBy(
692 Parse *pParse, /* Parsing context. Leave error messages here */
693 Select *pSelect /* The SELECT statement containing the ORDER BY */
694){
695 int i;
696 ExprList *pOrderBy;
697 ExprList *pEList;
698 sqlite3 *db;
699 int moreToDo = 1;
700
701 pOrderBy = pSelect->pOrderBy;
702 if( pOrderBy==0 ) return 0;
703 db = pParse->db;
704#if SQLITE_MAX_COLUMN
705 if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){
706 sqlite3ErrorMsg(pParse, "too many terms in ORDER BY clause");
707 return 1;
708 }
709#endif
710 for(i=0; i<pOrderBy->nExpr; i++){
711 pOrderBy->a[i].done = 0;
712 }
713 pSelect->pNext = 0;
714 while( pSelect->pPrior ){
715 pSelect->pPrior->pNext = pSelect;
716 pSelect = pSelect->pPrior;
717 }
718 while( pSelect && moreToDo ){
719 struct ExprList_item *pItem;
720 moreToDo = 0;
721 pEList = pSelect->pEList;
drh0a846f92008-08-25 17:23:29 +0000722 assert( pEList!=0 );
drh7d10d5a2008-08-20 16:35:10 +0000723 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){
724 int iCol = -1;
725 Expr *pE, *pDup;
726 if( pItem->done ) continue;
727 pE = pItem->pExpr;
728 if( sqlite3ExprIsInteger(pE, &iCol) ){
729 if( iCol<0 || iCol>pEList->nExpr ){
730 resolveOutOfRangeError(pParse, "ORDER", i+1, pEList->nExpr);
731 return 1;
732 }
733 }else{
734 iCol = resolveAsName(pParse, pEList, pE);
735 if( iCol==0 ){
danielk19776ab3a2e2009-02-19 14:39:25 +0000736 pDup = sqlite3ExprDup(db, pE, 0);
drh7d10d5a2008-08-20 16:35:10 +0000737 if( !db->mallocFailed ){
738 assert(pDup);
739 iCol = resolveOrderByTermToExprList(pParse, pSelect, pDup);
740 }
741 sqlite3ExprDelete(db, pDup);
742 }
743 if( iCol<0 ){
744 return 1;
745 }
746 }
747 if( iCol>0 ){
748 CollSeq *pColl = pE->pColl;
749 int flags = pE->flags & EP_ExpCollate;
750 sqlite3ExprDelete(db, pE);
drhb7916a72009-05-27 10:31:29 +0000751 pItem->pExpr = pE = sqlite3Expr(db, TK_INTEGER, 0);
drh7d10d5a2008-08-20 16:35:10 +0000752 if( pE==0 ) return 1;
753 pE->pColl = pColl;
754 pE->flags |= EP_IntValue | flags;
drh33e619f2009-05-28 01:00:55 +0000755 pE->u.iValue = iCol;
drhea678832008-12-10 19:26:22 +0000756 pItem->iCol = (u16)iCol;
drh7d10d5a2008-08-20 16:35:10 +0000757 pItem->done = 1;
758 }else{
759 moreToDo = 1;
760 }
761 }
762 pSelect = pSelect->pNext;
763 }
764 for(i=0; i<pOrderBy->nExpr; i++){
765 if( pOrderBy->a[i].done==0 ){
766 sqlite3ErrorMsg(pParse, "%r ORDER BY term does not match any "
767 "column in the result set", i+1);
768 return 1;
769 }
770 }
771 return 0;
772}
773
774/*
775** Check every term in the ORDER BY or GROUP BY clause pOrderBy of
776** the SELECT statement pSelect. If any term is reference to a
777** result set expression (as determined by the ExprList.a.iCol field)
778** then convert that term into a copy of the corresponding result set
779** column.
780**
781** If any errors are detected, add an error message to pParse and
782** return non-zero. Return zero if no errors are seen.
783*/
784int sqlite3ResolveOrderGroupBy(
785 Parse *pParse, /* Parsing context. Leave error messages here */
786 Select *pSelect, /* The SELECT statement containing the clause */
787 ExprList *pOrderBy, /* The ORDER BY or GROUP BY clause to be processed */
788 const char *zType /* "ORDER" or "GROUP" */
789){
790 int i;
791 sqlite3 *db = pParse->db;
792 ExprList *pEList;
793 struct ExprList_item *pItem;
794
795 if( pOrderBy==0 || pParse->db->mallocFailed ) return 0;
796#if SQLITE_MAX_COLUMN
797 if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){
798 sqlite3ErrorMsg(pParse, "too many terms in %s BY clause", zType);
799 return 1;
800 }
801#endif
802 pEList = pSelect->pEList;
drh0a846f92008-08-25 17:23:29 +0000803 assert( pEList!=0 ); /* sqlite3SelectNew() guarantees this */
drh7d10d5a2008-08-20 16:35:10 +0000804 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){
805 if( pItem->iCol ){
drh7d10d5a2008-08-20 16:35:10 +0000806 if( pItem->iCol>pEList->nExpr ){
807 resolveOutOfRangeError(pParse, zType, i+1, pEList->nExpr);
808 return 1;
809 }
drh8b213892008-08-29 02:14:02 +0000810 resolveAlias(pParse, pEList, pItem->iCol-1, pItem->pExpr, zType);
drh7d10d5a2008-08-20 16:35:10 +0000811 }
812 }
813 return 0;
814}
815
816/*
817** pOrderBy is an ORDER BY or GROUP BY clause in SELECT statement pSelect.
818** The Name context of the SELECT statement is pNC. zType is either
819** "ORDER" or "GROUP" depending on which type of clause pOrderBy is.
820**
821** This routine resolves each term of the clause into an expression.
822** If the order-by term is an integer I between 1 and N (where N is the
823** number of columns in the result set of the SELECT) then the expression
824** in the resolution is a copy of the I-th result-set expression. If
825** the order-by term is an identify that corresponds to the AS-name of
826** a result-set expression, then the term resolves to a copy of the
827** result-set expression. Otherwise, the expression is resolved in
828** the usual way - using sqlite3ResolveExprNames().
829**
830** This routine returns the number of errors. If errors occur, then
831** an appropriate error message might be left in pParse. (OOM errors
832** excepted.)
833*/
834static int resolveOrderGroupBy(
835 NameContext *pNC, /* The name context of the SELECT statement */
836 Select *pSelect, /* The SELECT statement holding pOrderBy */
837 ExprList *pOrderBy, /* An ORDER BY or GROUP BY clause to resolve */
838 const char *zType /* Either "ORDER" or "GROUP", as appropriate */
839){
840 int i; /* Loop counter */
841 int iCol; /* Column number */
842 struct ExprList_item *pItem; /* A term of the ORDER BY clause */
843 Parse *pParse; /* Parsing context */
844 int nResult; /* Number of terms in the result set */
845
846 if( pOrderBy==0 ) return 0;
847 nResult = pSelect->pEList->nExpr;
848 pParse = pNC->pParse;
849 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){
850 Expr *pE = pItem->pExpr;
851 iCol = resolveAsName(pParse, pSelect->pEList, pE);
852 if( iCol<0 ){
853 return 1; /* OOM error */
854 }
855 if( iCol>0 ){
856 /* If an AS-name match is found, mark this ORDER BY column as being
857 ** a copy of the iCol-th result-set column. The subsequent call to
858 ** sqlite3ResolveOrderGroupBy() will convert the expression to a
859 ** copy of the iCol-th result-set expression. */
drhea678832008-12-10 19:26:22 +0000860 pItem->iCol = (u16)iCol;
drh7d10d5a2008-08-20 16:35:10 +0000861 continue;
862 }
863 if( sqlite3ExprIsInteger(pE, &iCol) ){
864 /* The ORDER BY term is an integer constant. Again, set the column
865 ** number so that sqlite3ResolveOrderGroupBy() will convert the
866 ** order-by term to a copy of the result-set expression */
drh0a846f92008-08-25 17:23:29 +0000867 if( iCol<1 ){
drh7d10d5a2008-08-20 16:35:10 +0000868 resolveOutOfRangeError(pParse, zType, i+1, nResult);
869 return 1;
870 }
drhea678832008-12-10 19:26:22 +0000871 pItem->iCol = (u16)iCol;
drh7d10d5a2008-08-20 16:35:10 +0000872 continue;
873 }
874
875 /* Otherwise, treat the ORDER BY term as an ordinary expression */
876 pItem->iCol = 0;
877 if( sqlite3ResolveExprNames(pNC, pE) ){
878 return 1;
879 }
880 }
881 return sqlite3ResolveOrderGroupBy(pParse, pSelect, pOrderBy, zType);
882}
883
884/*
885** Resolve names in the SELECT statement p and all of its descendents.
886*/
887static int resolveSelectStep(Walker *pWalker, Select *p){
888 NameContext *pOuterNC; /* Context that contains this SELECT */
889 NameContext sNC; /* Name context of this SELECT */
890 int isCompound; /* True if p is a compound select */
891 int nCompound; /* Number of compound terms processed so far */
892 Parse *pParse; /* Parsing context */
893 ExprList *pEList; /* Result set expression list */
894 int i; /* Loop counter */
895 ExprList *pGroupBy; /* The GROUP BY clause */
896 Select *pLeftmost; /* Left-most of SELECT of a compound */
897 sqlite3 *db; /* Database connection */
898
899
drh0a846f92008-08-25 17:23:29 +0000900 assert( p!=0 );
drh7d10d5a2008-08-20 16:35:10 +0000901 if( p->selFlags & SF_Resolved ){
902 return WRC_Prune;
903 }
904 pOuterNC = pWalker->u.pNC;
905 pParse = pWalker->pParse;
906 db = pParse->db;
907
908 /* Normally sqlite3SelectExpand() will be called first and will have
909 ** already expanded this SELECT. However, if this is a subquery within
910 ** an expression, sqlite3ResolveExprNames() will be called without a
911 ** prior call to sqlite3SelectExpand(). When that happens, let
912 ** sqlite3SelectPrep() do all of the processing for this SELECT.
913 ** sqlite3SelectPrep() will invoke both sqlite3SelectExpand() and
914 ** this routine in the correct order.
915 */
916 if( (p->selFlags & SF_Expanded)==0 ){
917 sqlite3SelectPrep(pParse, p, pOuterNC);
918 return (pParse->nErr || db->mallocFailed) ? WRC_Abort : WRC_Prune;
919 }
920
921 isCompound = p->pPrior!=0;
922 nCompound = 0;
923 pLeftmost = p;
924 while( p ){
925 assert( (p->selFlags & SF_Expanded)!=0 );
926 assert( (p->selFlags & SF_Resolved)==0 );
927 p->selFlags |= SF_Resolved;
928
929 /* Resolve the expressions in the LIMIT and OFFSET clauses. These
930 ** are not allowed to refer to any names, so pass an empty NameContext.
931 */
932 memset(&sNC, 0, sizeof(sNC));
933 sNC.pParse = pParse;
934 if( sqlite3ResolveExprNames(&sNC, p->pLimit) ||
935 sqlite3ResolveExprNames(&sNC, p->pOffset) ){
936 return WRC_Abort;
937 }
938
939 /* Set up the local name-context to pass to sqlite3ResolveExprNames() to
940 ** resolve the result-set expression list.
941 */
942 sNC.allowAgg = 1;
943 sNC.pSrcList = p->pSrc;
944 sNC.pNext = pOuterNC;
945
946 /* Resolve names in the result set. */
947 pEList = p->pEList;
drh0a846f92008-08-25 17:23:29 +0000948 assert( pEList!=0 );
drh7d10d5a2008-08-20 16:35:10 +0000949 for(i=0; i<pEList->nExpr; i++){
950 Expr *pX = pEList->a[i].pExpr;
951 if( sqlite3ResolveExprNames(&sNC, pX) ){
952 return WRC_Abort;
953 }
954 }
955
956 /* Recursively resolve names in all subqueries
957 */
958 for(i=0; i<p->pSrc->nSrc; i++){
959 struct SrcList_item *pItem = &p->pSrc->a[i];
960 if( pItem->pSelect ){
961 const char *zSavedContext = pParse->zAuthContext;
962 if( pItem->zName ) pParse->zAuthContext = pItem->zName;
drhcd2b5612008-12-09 14:03:22 +0000963 sqlite3ResolveSelectNames(pParse, pItem->pSelect, pOuterNC);
drh7d10d5a2008-08-20 16:35:10 +0000964 pParse->zAuthContext = zSavedContext;
965 if( pParse->nErr || db->mallocFailed ) return WRC_Abort;
966 }
967 }
968
969 /* If there are no aggregate functions in the result-set, and no GROUP BY
970 ** expression, do not allow aggregates in any of the other expressions.
971 */
972 assert( (p->selFlags & SF_Aggregate)==0 );
973 pGroupBy = p->pGroupBy;
974 if( pGroupBy || sNC.hasAgg ){
975 p->selFlags |= SF_Aggregate;
976 }else{
977 sNC.allowAgg = 0;
978 }
979
980 /* If a HAVING clause is present, then there must be a GROUP BY clause.
981 */
982 if( p->pHaving && !pGroupBy ){
983 sqlite3ErrorMsg(pParse, "a GROUP BY clause is required before HAVING");
984 return WRC_Abort;
985 }
986
987 /* Add the expression list to the name-context before parsing the
988 ** other expressions in the SELECT statement. This is so that
989 ** expressions in the WHERE clause (etc.) can refer to expressions by
990 ** aliases in the result set.
991 **
992 ** Minor point: If this is the case, then the expression will be
993 ** re-evaluated for each reference to it.
994 */
995 sNC.pEList = p->pEList;
996 if( sqlite3ResolveExprNames(&sNC, p->pWhere) ||
997 sqlite3ResolveExprNames(&sNC, p->pHaving)
998 ){
999 return WRC_Abort;
1000 }
1001
1002 /* The ORDER BY and GROUP BY clauses may not refer to terms in
1003 ** outer queries
1004 */
1005 sNC.pNext = 0;
1006 sNC.allowAgg = 1;
1007
1008 /* Process the ORDER BY clause for singleton SELECT statements.
1009 ** The ORDER BY clause for compounds SELECT statements is handled
1010 ** below, after all of the result-sets for all of the elements of
1011 ** the compound have been resolved.
1012 */
1013 if( !isCompound && resolveOrderGroupBy(&sNC, p, p->pOrderBy, "ORDER") ){
1014 return WRC_Abort;
1015 }
1016 if( db->mallocFailed ){
1017 return WRC_Abort;
1018 }
1019
1020 /* Resolve the GROUP BY clause. At the same time, make sure
1021 ** the GROUP BY clause does not contain aggregate functions.
1022 */
1023 if( pGroupBy ){
1024 struct ExprList_item *pItem;
1025
1026 if( resolveOrderGroupBy(&sNC, p, pGroupBy, "GROUP") || db->mallocFailed ){
1027 return WRC_Abort;
1028 }
1029 for(i=0, pItem=pGroupBy->a; i<pGroupBy->nExpr; i++, pItem++){
1030 if( ExprHasProperty(pItem->pExpr, EP_Agg) ){
1031 sqlite3ErrorMsg(pParse, "aggregate functions are not allowed in "
1032 "the GROUP BY clause");
1033 return WRC_Abort;
1034 }
1035 }
1036 }
1037
1038 /* Advance to the next term of the compound
1039 */
1040 p = p->pPrior;
1041 nCompound++;
1042 }
1043
1044 /* Resolve the ORDER BY on a compound SELECT after all terms of
1045 ** the compound have been resolved.
1046 */
1047 if( isCompound && resolveCompoundOrderBy(pParse, pLeftmost) ){
1048 return WRC_Abort;
1049 }
1050
1051 return WRC_Prune;
1052}
1053
1054/*
1055** This routine walks an expression tree and resolves references to
1056** table columns and result-set columns. At the same time, do error
1057** checking on function usage and set a flag if any aggregate functions
1058** are seen.
1059**
1060** To resolve table columns references we look for nodes (or subtrees) of the
1061** form X.Y.Z or Y.Z or just Z where
1062**
1063** X: The name of a database. Ex: "main" or "temp" or
1064** the symbolic name assigned to an ATTACH-ed database.
1065**
1066** Y: The name of a table in a FROM clause. Or in a trigger
1067** one of the special names "old" or "new".
1068**
1069** Z: The name of a column in table Y.
1070**
1071** The node at the root of the subtree is modified as follows:
1072**
1073** Expr.op Changed to TK_COLUMN
1074** Expr.pTab Points to the Table object for X.Y
1075** Expr.iColumn The column index in X.Y. -1 for the rowid.
1076** Expr.iTable The VDBE cursor number for X.Y
1077**
1078**
1079** To resolve result-set references, look for expression nodes of the
1080** form Z (with no X and Y prefix) where the Z matches the right-hand
1081** size of an AS clause in the result-set of a SELECT. The Z expression
1082** is replaced by a copy of the left-hand side of the result-set expression.
1083** Table-name and function resolution occurs on the substituted expression
1084** tree. For example, in:
1085**
1086** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY x;
1087**
1088** The "x" term of the order by is replaced by "a+b" to render:
1089**
1090** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY a+b;
1091**
1092** Function calls are checked to make sure that the function is
1093** defined and that the correct number of arguments are specified.
1094** If the function is an aggregate function, then the pNC->hasAgg is
1095** set and the opcode is changed from TK_FUNCTION to TK_AGG_FUNCTION.
1096** If an expression contains aggregate functions then the EP_Agg
1097** property on the expression is set.
1098**
1099** An error message is left in pParse if anything is amiss. The number
1100** if errors is returned.
1101*/
1102int sqlite3ResolveExprNames(
1103 NameContext *pNC, /* Namespace to resolve expressions in. */
1104 Expr *pExpr /* The expression to be analyzed. */
1105){
1106 int savedHasAgg;
1107 Walker w;
1108
1109 if( pExpr==0 ) return 0;
1110#if SQLITE_MAX_EXPR_DEPTH>0
1111 {
1112 Parse *pParse = pNC->pParse;
1113 if( sqlite3ExprCheckHeight(pParse, pExpr->nHeight+pNC->pParse->nHeight) ){
1114 return 1;
1115 }
1116 pParse->nHeight += pExpr->nHeight;
1117 }
1118#endif
1119 savedHasAgg = pNC->hasAgg;
1120 pNC->hasAgg = 0;
1121 w.xExprCallback = resolveExprStep;
1122 w.xSelectCallback = resolveSelectStep;
1123 w.pParse = pNC->pParse;
1124 w.u.pNC = pNC;
1125 sqlite3WalkExpr(&w, pExpr);
1126#if SQLITE_MAX_EXPR_DEPTH>0
1127 pNC->pParse->nHeight -= pExpr->nHeight;
1128#endif
1129 if( pNC->nErr>0 ){
1130 ExprSetProperty(pExpr, EP_Error);
1131 }
1132 if( pNC->hasAgg ){
1133 ExprSetProperty(pExpr, EP_Agg);
1134 }else if( savedHasAgg ){
1135 pNC->hasAgg = 1;
1136 }
1137 return ExprHasProperty(pExpr, EP_Error);
1138}
drh7d10d5a2008-08-20 16:35:10 +00001139
1140
1141/*
1142** Resolve all names in all expressions of a SELECT and in all
1143** decendents of the SELECT, including compounds off of p->pPrior,
1144** subqueries in expressions, and subqueries used as FROM clause
1145** terms.
1146**
1147** See sqlite3ResolveExprNames() for a description of the kinds of
1148** transformations that occur.
1149**
1150** All SELECT statements should have been expanded using
1151** sqlite3SelectExpand() prior to invoking this routine.
1152*/
1153void sqlite3ResolveSelectNames(
1154 Parse *pParse, /* The parser context */
1155 Select *p, /* The SELECT statement being coded. */
1156 NameContext *pOuterNC /* Name context for parent SELECT statement */
1157){
1158 Walker w;
1159
drh0a846f92008-08-25 17:23:29 +00001160 assert( p!=0 );
1161 w.xExprCallback = resolveExprStep;
1162 w.xSelectCallback = resolveSelectStep;
1163 w.pParse = pParse;
1164 w.u.pNC = pOuterNC;
1165 sqlite3WalkSelect(&w, p);
drh7d10d5a2008-08-20 16:35:10 +00001166}