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. 16 */ 17 #include "sqliteInt.h" 18 19 /* 20 ** Walk the expression tree pExpr and increase the aggregate function 21 ** depth (the Expr.op2 field) by N on every TK_AGG_FUNCTION node. 22 ** This needs to occur when copying a TK_AGG_FUNCTION node from an 23 ** outer query into an inner subquery. 24 ** 25 ** incrAggFunctionDepth(pExpr,n) is the main routine. incrAggDepth(..) 26 ** is a helper function - a callback for the tree walker. 27 */ 28 static int incrAggDepth(Walker *pWalker, Expr *pExpr){ 29 if( pExpr->op==TK_AGG_FUNCTION ) pExpr->op2 += pWalker->u.n; 30 return WRC_Continue; 31 } 32 static void incrAggFunctionDepth(Expr *pExpr, int N){ 33 if( N>0 ){ 34 Walker w; 35 memset(&w, 0, sizeof(w)); 36 w.xExprCallback = incrAggDepth; 37 w.u.n = N; 38 sqlite3WalkExpr(&w, pExpr); 39 } 40 } 41 42 /* 43 ** Turn the pExpr expression into an alias for the iCol-th column of the 44 ** result set in pEList. 45 ** 46 ** If the reference is followed by a COLLATE operator, then make sure 47 ** the COLLATE operator is preserved. For example: 48 ** 49 ** SELECT a+b, c+d FROM t1 ORDER BY 1 COLLATE nocase; 50 ** 51 ** Should be transformed into: 52 ** 53 ** SELECT a+b, c+d FROM t1 ORDER BY (a+b) COLLATE nocase; 54 ** 55 ** The nSubquery parameter specifies how many levels of subquery the 56 ** alias is removed from the original expression. The usual value is 57 ** zero but it might be more if the alias is contained within a subquery 58 ** of the original expression. The Expr.op2 field of TK_AGG_FUNCTION 59 ** structures must be increased by the nSubquery amount. 60 */ 61 static void resolveAlias( 62 Parse *pParse, /* Parsing context */ 63 ExprList *pEList, /* A result set */ 64 int iCol, /* A column in the result set. 0..pEList->nExpr-1 */ 65 Expr *pExpr, /* Transform this into an alias to the result set */ 66 const char *zType, /* "GROUP" or "ORDER" or "" */ 67 int nSubquery /* Number of subqueries that the label is moving */ 68 ){ 69 Expr *pOrig; /* The iCol-th column of the result set */ 70 Expr *pDup; /* Copy of pOrig */ 71 sqlite3 *db; /* The database connection */ 72 73 assert( iCol>=0 && iCol<pEList->nExpr ); 74 pOrig = pEList->a[iCol].pExpr; 75 assert( pOrig!=0 ); 76 db = pParse->db; 77 pDup = sqlite3ExprDup(db, pOrig, 0); 78 if( pDup!=0 ){ 79 if( zType[0]!='G' ) incrAggFunctionDepth(pDup, nSubquery); 80 if( pExpr->op==TK_COLLATE ){ 81 pDup = sqlite3ExprAddCollateString(pParse, pDup, pExpr->u.zToken); 82 } 83 84 /* Before calling sqlite3ExprDelete(), set the EP_Static flag. This 85 ** prevents ExprDelete() from deleting the Expr structure itself, 86 ** allowing it to be repopulated by the memcpy() on the following line. 87 ** The pExpr->u.zToken might point into memory that will be freed by the 88 ** sqlite3DbFree(db, pDup) on the last line of this block, so be sure to 89 ** make a copy of the token before doing the sqlite3DbFree(). 90 */ 91 ExprSetProperty(pExpr, EP_Static); 92 sqlite3ExprDelete(db, pExpr); 93 memcpy(pExpr, pDup, sizeof(*pExpr)); 94 if( !ExprHasProperty(pExpr, EP_IntValue) && pExpr->u.zToken!=0 ){ 95 assert( (pExpr->flags & (EP_Reduced|EP_TokenOnly))==0 ); 96 pExpr->u.zToken = sqlite3DbStrDup(db, pExpr->u.zToken); 97 pExpr->flags |= EP_MemToken; 98 } 99 if( ExprHasProperty(pExpr, EP_WinFunc) ){ 100 if( pExpr->y.pWin!=0 ){ 101 pExpr->y.pWin->pOwner = pExpr; 102 }else{ 103 assert( db->mallocFailed ); 104 } 105 } 106 sqlite3DbFree(db, pDup); 107 } 108 ExprSetProperty(pExpr, EP_Alias); 109 } 110 111 112 /* 113 ** Return TRUE if the name zCol occurs anywhere in the USING clause. 114 ** 115 ** Return FALSE if the USING clause is NULL or if it does not contain 116 ** zCol. 117 */ 118 static int nameInUsingClause(IdList *pUsing, const char *zCol){ 119 if( pUsing ){ 120 int k; 121 for(k=0; k<pUsing->nId; k++){ 122 if( sqlite3StrICmp(pUsing->a[k].zName, zCol)==0 ) return 1; 123 } 124 } 125 return 0; 126 } 127 128 /* 129 ** Subqueries stores the original database, table and column names for their 130 ** result sets in ExprList.a[].zSpan, in the form "DATABASE.TABLE.COLUMN". 131 ** Check to see if the zSpan given to this routine matches the zDb, zTab, 132 ** and zCol. If any of zDb, zTab, and zCol are NULL then those fields will 133 ** match anything. 134 */ 135 int sqlite3MatchSpanName( 136 const char *zSpan, 137 const char *zCol, 138 const char *zTab, 139 const char *zDb 140 ){ 141 int n; 142 for(n=0; ALWAYS(zSpan[n]) && zSpan[n]!='.'; n++){} 143 if( zDb && (sqlite3StrNICmp(zSpan, zDb, n)!=0 || zDb[n]!=0) ){ 144 return 0; 145 } 146 zSpan += n+1; 147 for(n=0; ALWAYS(zSpan[n]) && zSpan[n]!='.'; n++){} 148 if( zTab && (sqlite3StrNICmp(zSpan, zTab, n)!=0 || zTab[n]!=0) ){ 149 return 0; 150 } 151 zSpan += n+1; 152 if( zCol && sqlite3StrICmp(zSpan, zCol)!=0 ){ 153 return 0; 154 } 155 return 1; 156 } 157 158 /* 159 ** Return TRUE if the double-quoted string mis-feature should be supported. 160 */ 161 static int areDoubleQuotedStringsEnabled(sqlite3 *db, NameContext *pTopNC){ 162 if( db->init.busy ) return 1; /* Always support for legacy schemas */ 163 if( pTopNC->ncFlags & NC_IsDDL ){ 164 /* Currently parsing a DDL statement */ 165 if( sqlite3WritableSchema(db) && (db->flags & SQLITE_DqsDML)!=0 ){ 166 return 1; 167 } 168 return (db->flags & SQLITE_DqsDDL)!=0; 169 }else{ 170 /* Currently parsing a DML statement */ 171 return (db->flags & SQLITE_DqsDML)!=0; 172 } 173 } 174 175 /* 176 ** Given the name of a column of the form X.Y.Z or Y.Z or just Z, look up 177 ** that name in the set of source tables in pSrcList and make the pExpr 178 ** expression node refer back to that source column. The following changes 179 ** are made to pExpr: 180 ** 181 ** pExpr->iDb Set the index in db->aDb[] of the database X 182 ** (even if X is implied). 183 ** pExpr->iTable Set to the cursor number for the table obtained 184 ** from pSrcList. 185 ** pExpr->y.pTab Points to the Table structure of X.Y (even if 186 ** X and/or Y are implied.) 187 ** pExpr->iColumn Set to the column number within the table. 188 ** pExpr->op Set to TK_COLUMN. 189 ** pExpr->pLeft Any expression this points to is deleted 190 ** pExpr->pRight Any expression this points to is deleted. 191 ** 192 ** The zDb variable is the name of the database (the "X"). This value may be 193 ** NULL meaning that name is of the form Y.Z or Z. Any available database 194 ** can be used. The zTable variable is the name of the table (the "Y"). This 195 ** value can be NULL if zDb is also NULL. If zTable is NULL it 196 ** means that the form of the name is Z and that columns from any table 197 ** can be used. 198 ** 199 ** If the name cannot be resolved unambiguously, leave an error message 200 ** in pParse and return WRC_Abort. Return WRC_Prune on success. 201 */ 202 static int lookupName( 203 Parse *pParse, /* The parsing context */ 204 const char *zDb, /* Name of the database containing table, or NULL */ 205 const char *zTab, /* Name of table containing column, or NULL */ 206 const char *zCol, /* Name of the column. */ 207 NameContext *pNC, /* The name context used to resolve the name */ 208 Expr *pExpr /* Make this EXPR node point to the selected column */ 209 ){ 210 int i, j; /* Loop counters */ 211 int cnt = 0; /* Number of matching column names */ 212 int cntTab = 0; /* Number of matching table names */ 213 int nSubquery = 0; /* How many levels of subquery */ 214 sqlite3 *db = pParse->db; /* The database connection */ 215 struct SrcList_item *pItem; /* Use for looping over pSrcList items */ 216 struct SrcList_item *pMatch = 0; /* The matching pSrcList item */ 217 NameContext *pTopNC = pNC; /* First namecontext in the list */ 218 Schema *pSchema = 0; /* Schema of the expression */ 219 int eNewExprOp = TK_COLUMN; /* New value for pExpr->op on success */ 220 Table *pTab = 0; /* Table hold the row */ 221 Column *pCol; /* A column of pTab */ 222 223 assert( pNC ); /* the name context cannot be NULL. */ 224 assert( zCol ); /* The Z in X.Y.Z cannot be NULL */ 225 assert( !ExprHasProperty(pExpr, EP_TokenOnly|EP_Reduced) ); 226 227 /* Initialize the node to no-match */ 228 pExpr->iTable = -1; 229 ExprSetVVAProperty(pExpr, EP_NoReduce); 230 231 /* Translate the schema name in zDb into a pointer to the corresponding 232 ** schema. If not found, pSchema will remain NULL and nothing will match 233 ** resulting in an appropriate error message toward the end of this routine 234 */ 235 if( zDb ){ 236 testcase( pNC->ncFlags & NC_PartIdx ); 237 testcase( pNC->ncFlags & NC_IsCheck ); 238 if( (pNC->ncFlags & (NC_PartIdx|NC_IsCheck))!=0 ){ 239 /* Silently ignore database qualifiers inside CHECK constraints and 240 ** partial indices. Do not raise errors because that might break 241 ** legacy and because it does not hurt anything to just ignore the 242 ** database name. */ 243 zDb = 0; 244 }else{ 245 for(i=0; i<db->nDb; i++){ 246 assert( db->aDb[i].zDbSName ); 247 if( sqlite3StrICmp(db->aDb[i].zDbSName,zDb)==0 ){ 248 pSchema = db->aDb[i].pSchema; 249 break; 250 } 251 } 252 } 253 } 254 255 /* Start at the inner-most context and move outward until a match is found */ 256 assert( pNC && cnt==0 ); 257 do{ 258 ExprList *pEList; 259 SrcList *pSrcList = pNC->pSrcList; 260 261 if( pSrcList ){ 262 for(i=0, pItem=pSrcList->a; i<pSrcList->nSrc; i++, pItem++){ 263 pTab = pItem->pTab; 264 assert( pTab!=0 && pTab->zName!=0 ); 265 assert( pTab->nCol>0 ); 266 if( pItem->pSelect && (pItem->pSelect->selFlags & SF_NestedFrom)!=0 ){ 267 int hit = 0; 268 pEList = pItem->pSelect->pEList; 269 for(j=0; j<pEList->nExpr; j++){ 270 if( sqlite3MatchSpanName(pEList->a[j].zSpan, zCol, zTab, zDb) ){ 271 cnt++; 272 cntTab = 2; 273 pMatch = pItem; 274 pExpr->iColumn = j; 275 hit = 1; 276 } 277 } 278 if( hit || zTab==0 ) continue; 279 } 280 if( zDb && pTab->pSchema!=pSchema ){ 281 continue; 282 } 283 if( zTab ){ 284 const char *zTabName = pItem->zAlias ? pItem->zAlias : pTab->zName; 285 assert( zTabName!=0 ); 286 if( sqlite3StrICmp(zTabName, zTab)!=0 ){ 287 continue; 288 } 289 if( IN_RENAME_OBJECT && pItem->zAlias ){ 290 sqlite3RenameTokenRemap(pParse, 0, (void*)&pExpr->y.pTab); 291 } 292 } 293 if( 0==(cntTab++) ){ 294 pMatch = pItem; 295 } 296 for(j=0, pCol=pTab->aCol; j<pTab->nCol; j++, pCol++){ 297 if( sqlite3StrICmp(pCol->zName, zCol)==0 ){ 298 /* If there has been exactly one prior match and this match 299 ** is for the right-hand table of a NATURAL JOIN or is in a 300 ** USING clause, then skip this match. 301 */ 302 if( cnt==1 ){ 303 if( pItem->fg.jointype & JT_NATURAL ) continue; 304 if( nameInUsingClause(pItem->pUsing, zCol) ) continue; 305 } 306 cnt++; 307 pMatch = pItem; 308 /* Substitute the rowid (column -1) for the INTEGER PRIMARY KEY */ 309 pExpr->iColumn = j==pTab->iPKey ? -1 : (i16)j; 310 break; 311 } 312 } 313 } 314 if( pMatch ){ 315 pExpr->iTable = pMatch->iCursor; 316 pExpr->y.pTab = pMatch->pTab; 317 /* RIGHT JOIN not (yet) supported */ 318 assert( (pMatch->fg.jointype & JT_RIGHT)==0 ); 319 if( (pMatch->fg.jointype & JT_LEFT)!=0 ){ 320 ExprSetProperty(pExpr, EP_CanBeNull); 321 } 322 pSchema = pExpr->y.pTab->pSchema; 323 } 324 } /* if( pSrcList ) */ 325 326 #if !defined(SQLITE_OMIT_TRIGGER) || !defined(SQLITE_OMIT_UPSERT) 327 /* If we have not already resolved the name, then maybe 328 ** it is a new.* or old.* trigger argument reference. Or 329 ** maybe it is an excluded.* from an upsert. 330 */ 331 if( zDb==0 && zTab!=0 && cntTab==0 ){ 332 pTab = 0; 333 #ifndef SQLITE_OMIT_TRIGGER 334 if( pParse->pTriggerTab!=0 ){ 335 int op = pParse->eTriggerOp; 336 assert( op==TK_DELETE || op==TK_UPDATE || op==TK_INSERT ); 337 if( op!=TK_DELETE && sqlite3StrICmp("new",zTab) == 0 ){ 338 pExpr->iTable = 1; 339 pTab = pParse->pTriggerTab; 340 }else if( op!=TK_INSERT && sqlite3StrICmp("old",zTab)==0 ){ 341 pExpr->iTable = 0; 342 pTab = pParse->pTriggerTab; 343 } 344 } 345 #endif /* SQLITE_OMIT_TRIGGER */ 346 #ifndef SQLITE_OMIT_UPSERT 347 if( (pNC->ncFlags & NC_UUpsert)!=0 ){ 348 Upsert *pUpsert = pNC->uNC.pUpsert; 349 if( pUpsert && sqlite3StrICmp("excluded",zTab)==0 ){ 350 pTab = pUpsert->pUpsertSrc->a[0].pTab; 351 pExpr->iTable = 2; 352 } 353 } 354 #endif /* SQLITE_OMIT_UPSERT */ 355 356 if( pTab ){ 357 int iCol; 358 pSchema = pTab->pSchema; 359 cntTab++; 360 for(iCol=0, pCol=pTab->aCol; iCol<pTab->nCol; iCol++, pCol++){ 361 if( sqlite3StrICmp(pCol->zName, zCol)==0 ){ 362 if( iCol==pTab->iPKey ){ 363 iCol = -1; 364 } 365 break; 366 } 367 } 368 if( iCol>=pTab->nCol && sqlite3IsRowid(zCol) && VisibleRowid(pTab) ){ 369 /* IMP: R-51414-32910 */ 370 iCol = -1; 371 } 372 if( iCol<pTab->nCol ){ 373 cnt++; 374 #ifndef SQLITE_OMIT_UPSERT 375 if( pExpr->iTable==2 ){ 376 testcase( iCol==(-1) ); 377 if( IN_RENAME_OBJECT ){ 378 pExpr->iColumn = iCol; 379 pExpr->y.pTab = pTab; 380 eNewExprOp = TK_COLUMN; 381 }else{ 382 pExpr->iTable = pNC->uNC.pUpsert->regData + iCol; 383 eNewExprOp = TK_REGISTER; 384 ExprSetProperty(pExpr, EP_Alias); 385 } 386 }else 387 #endif /* SQLITE_OMIT_UPSERT */ 388 { 389 #ifndef SQLITE_OMIT_TRIGGER 390 if( iCol<0 ){ 391 pExpr->affExpr = SQLITE_AFF_INTEGER; 392 }else if( pExpr->iTable==0 ){ 393 testcase( iCol==31 ); 394 testcase( iCol==32 ); 395 pParse->oldmask |= (iCol>=32 ? 0xffffffff : (((u32)1)<<iCol)); 396 }else{ 397 testcase( iCol==31 ); 398 testcase( iCol==32 ); 399 pParse->newmask |= (iCol>=32 ? 0xffffffff : (((u32)1)<<iCol)); 400 } 401 pExpr->y.pTab = pTab; 402 pExpr->iColumn = (i16)iCol; 403 eNewExprOp = TK_TRIGGER; 404 #endif /* SQLITE_OMIT_TRIGGER */ 405 } 406 } 407 } 408 } 409 #endif /* !defined(SQLITE_OMIT_TRIGGER) || !defined(SQLITE_OMIT_UPSERT) */ 410 411 /* 412 ** Perhaps the name is a reference to the ROWID 413 */ 414 if( cnt==0 415 && cntTab==1 416 && pMatch 417 && (pNC->ncFlags & NC_IdxExpr)==0 418 && sqlite3IsRowid(zCol) 419 && VisibleRowid(pMatch->pTab) 420 ){ 421 cnt = 1; 422 pExpr->iColumn = -1; 423 pExpr->affExpr = SQLITE_AFF_INTEGER; 424 } 425 426 /* 427 ** If the input is of the form Z (not Y.Z or X.Y.Z) then the name Z 428 ** might refer to an result-set alias. This happens, for example, when 429 ** we are resolving names in the WHERE clause of the following command: 430 ** 431 ** SELECT a+b AS x FROM table WHERE x<10; 432 ** 433 ** In cases like this, replace pExpr with a copy of the expression that 434 ** forms the result set entry ("a+b" in the example) and return immediately. 435 ** Note that the expression in the result set should have already been 436 ** resolved by the time the WHERE clause is resolved. 437 ** 438 ** The ability to use an output result-set column in the WHERE, GROUP BY, 439 ** or HAVING clauses, or as part of a larger expression in the ORDER BY 440 ** clause is not standard SQL. This is a (goofy) SQLite extension, that 441 ** is supported for backwards compatibility only. Hence, we issue a warning 442 ** on sqlite3_log() whenever the capability is used. 443 */ 444 if( (pNC->ncFlags & NC_UEList)!=0 445 && cnt==0 446 && zTab==0 447 ){ 448 pEList = pNC->uNC.pEList; 449 assert( pEList!=0 ); 450 for(j=0; j<pEList->nExpr; j++){ 451 char *zAs = pEList->a[j].zName; 452 if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){ 453 Expr *pOrig; 454 assert( pExpr->pLeft==0 && pExpr->pRight==0 ); 455 assert( pExpr->x.pList==0 ); 456 assert( pExpr->x.pSelect==0 ); 457 pOrig = pEList->a[j].pExpr; 458 if( (pNC->ncFlags&NC_AllowAgg)==0 && ExprHasProperty(pOrig, EP_Agg) ){ 459 sqlite3ErrorMsg(pParse, "misuse of aliased aggregate %s", zAs); 460 return WRC_Abort; 461 } 462 if( (pNC->ncFlags&NC_AllowWin)==0 && ExprHasProperty(pOrig, EP_Win) ){ 463 sqlite3ErrorMsg(pParse, "misuse of aliased window function %s",zAs); 464 return WRC_Abort; 465 } 466 if( sqlite3ExprVectorSize(pOrig)!=1 ){ 467 sqlite3ErrorMsg(pParse, "row value misused"); 468 return WRC_Abort; 469 } 470 resolveAlias(pParse, pEList, j, pExpr, "", nSubquery); 471 cnt = 1; 472 pMatch = 0; 473 assert( zTab==0 && zDb==0 ); 474 if( IN_RENAME_OBJECT ){ 475 sqlite3RenameTokenRemap(pParse, 0, (void*)pExpr); 476 } 477 goto lookupname_end; 478 } 479 } 480 } 481 482 /* Advance to the next name context. The loop will exit when either 483 ** we have a match (cnt>0) or when we run out of name contexts. 484 */ 485 if( cnt ) break; 486 pNC = pNC->pNext; 487 nSubquery++; 488 }while( pNC ); 489 490 491 /* 492 ** If X and Y are NULL (in other words if only the column name Z is 493 ** supplied) and the value of Z is enclosed in double-quotes, then 494 ** Z is a string literal if it doesn't match any column names. In that 495 ** case, we need to return right away and not make any changes to 496 ** pExpr. 497 ** 498 ** Because no reference was made to outer contexts, the pNC->nRef 499 ** fields are not changed in any context. 500 */ 501 if( cnt==0 && zTab==0 ){ 502 assert( pExpr->op==TK_ID ); 503 if( ExprHasProperty(pExpr,EP_DblQuoted) 504 && areDoubleQuotedStringsEnabled(db, pTopNC) 505 ){ 506 /* If a double-quoted identifier does not match any known column name, 507 ** then treat it as a string. 508 ** 509 ** This hack was added in the early days of SQLite in a misguided attempt 510 ** to be compatible with MySQL 3.x, which used double-quotes for strings. 511 ** I now sorely regret putting in this hack. The effect of this hack is 512 ** that misspelled identifier names are silently converted into strings 513 ** rather than causing an error, to the frustration of countless 514 ** programmers. To all those frustrated programmers, my apologies. 515 ** 516 ** Someday, I hope to get rid of this hack. Unfortunately there is 517 ** a huge amount of legacy SQL that uses it. So for now, we just 518 ** issue a warning. 519 */ 520 sqlite3_log(SQLITE_WARNING, 521 "double-quoted string literal: \"%w\"", zCol); 522 #ifdef SQLITE_ENABLE_NORMALIZE 523 sqlite3VdbeAddDblquoteStr(db, pParse->pVdbe, zCol); 524 #endif 525 pExpr->op = TK_STRING; 526 pExpr->y.pTab = 0; 527 return WRC_Prune; 528 } 529 if( sqlite3ExprIdToTrueFalse(pExpr) ){ 530 return WRC_Prune; 531 } 532 } 533 534 /* 535 ** cnt==0 means there was not match. cnt>1 means there were two or 536 ** more matches. Either way, we have an error. 537 */ 538 if( cnt!=1 ){ 539 const char *zErr; 540 zErr = cnt==0 ? "no such column" : "ambiguous column name"; 541 if( zDb ){ 542 sqlite3ErrorMsg(pParse, "%s: %s.%s.%s", zErr, zDb, zTab, zCol); 543 }else if( zTab ){ 544 sqlite3ErrorMsg(pParse, "%s: %s.%s", zErr, zTab, zCol); 545 }else{ 546 sqlite3ErrorMsg(pParse, "%s: %s", zErr, zCol); 547 } 548 pParse->checkSchema = 1; 549 pTopNC->nErr++; 550 } 551 552 /* If a column from a table in pSrcList is referenced, then record 553 ** this fact in the pSrcList.a[].colUsed bitmask. Column 0 causes 554 ** bit 0 to be set. Column 1 sets bit 1. And so forth. If the 555 ** column number is greater than the number of bits in the bitmask 556 ** then set the high-order bit of the bitmask. 557 */ 558 if( pExpr->iColumn>=0 && pMatch!=0 ){ 559 int n = pExpr->iColumn; 560 testcase( n==BMS-1 ); 561 if( n>=BMS ){ 562 n = BMS-1; 563 } 564 assert( pMatch->iCursor==pExpr->iTable ); 565 pMatch->colUsed |= ((Bitmask)1)<<n; 566 } 567 568 /* Clean up and return 569 */ 570 sqlite3ExprDelete(db, pExpr->pLeft); 571 pExpr->pLeft = 0; 572 sqlite3ExprDelete(db, pExpr->pRight); 573 pExpr->pRight = 0; 574 pExpr->op = eNewExprOp; 575 ExprSetProperty(pExpr, EP_Leaf); 576 lookupname_end: 577 if( cnt==1 ){ 578 assert( pNC!=0 ); 579 if( !ExprHasProperty(pExpr, EP_Alias) ){ 580 sqlite3AuthRead(pParse, pExpr, pSchema, pNC->pSrcList); 581 } 582 /* Increment the nRef value on all name contexts from TopNC up to 583 ** the point where the name matched. */ 584 for(;;){ 585 assert( pTopNC!=0 ); 586 pTopNC->nRef++; 587 if( pTopNC==pNC ) break; 588 pTopNC = pTopNC->pNext; 589 } 590 return WRC_Prune; 591 } else { 592 return WRC_Abort; 593 } 594 } 595 596 /* 597 ** Allocate and return a pointer to an expression to load the column iCol 598 ** from datasource iSrc in SrcList pSrc. 599 */ 600 Expr *sqlite3CreateColumnExpr(sqlite3 *db, SrcList *pSrc, int iSrc, int iCol){ 601 Expr *p = sqlite3ExprAlloc(db, TK_COLUMN, 0, 0); 602 if( p ){ 603 struct SrcList_item *pItem = &pSrc->a[iSrc]; 604 p->y.pTab = pItem->pTab; 605 p->iTable = pItem->iCursor; 606 if( p->y.pTab->iPKey==iCol ){ 607 p->iColumn = -1; 608 }else{ 609 p->iColumn = (ynVar)iCol; 610 testcase( iCol==BMS ); 611 testcase( iCol==BMS-1 ); 612 pItem->colUsed |= ((Bitmask)1)<<(iCol>=BMS ? BMS-1 : iCol); 613 } 614 } 615 return p; 616 } 617 618 /* 619 ** Report an error that an expression is not valid for some set of 620 ** pNC->ncFlags values determined by validMask. 621 */ 622 static void notValid( 623 Parse *pParse, /* Leave error message here */ 624 NameContext *pNC, /* The name context */ 625 const char *zMsg, /* Type of error */ 626 int validMask /* Set of contexts for which prohibited */ 627 ){ 628 assert( (validMask&~(NC_IsCheck|NC_PartIdx|NC_IdxExpr))==0 ); 629 if( (pNC->ncFlags & validMask)!=0 ){ 630 const char *zIn = "partial index WHERE clauses"; 631 if( pNC->ncFlags & NC_IdxExpr ) zIn = "index expressions"; 632 #ifndef SQLITE_OMIT_CHECK 633 else if( pNC->ncFlags & NC_IsCheck ) zIn = "CHECK constraints"; 634 #endif 635 sqlite3ErrorMsg(pParse, "%s prohibited in %s", zMsg, zIn); 636 } 637 } 638 639 /* 640 ** Expression p should encode a floating point value between 1.0 and 0.0. 641 ** Return 1024 times this value. Or return -1 if p is not a floating point 642 ** value between 1.0 and 0.0. 643 */ 644 static int exprProbability(Expr *p){ 645 double r = -1.0; 646 if( p->op!=TK_FLOAT ) return -1; 647 sqlite3AtoF(p->u.zToken, &r, sqlite3Strlen30(p->u.zToken), SQLITE_UTF8); 648 assert( r>=0.0 ); 649 if( r>1.0 ) return -1; 650 return (int)(r*134217728.0); 651 } 652 653 /* 654 ** This routine is callback for sqlite3WalkExpr(). 655 ** 656 ** Resolve symbolic names into TK_COLUMN operators for the current 657 ** node in the expression tree. Return 0 to continue the search down 658 ** the tree or 2 to abort the tree walk. 659 ** 660 ** This routine also does error checking and name resolution for 661 ** function names. The operator for aggregate functions is changed 662 ** to TK_AGG_FUNCTION. 663 */ 664 static int resolveExprStep(Walker *pWalker, Expr *pExpr){ 665 NameContext *pNC; 666 Parse *pParse; 667 668 pNC = pWalker->u.pNC; 669 assert( pNC!=0 ); 670 pParse = pNC->pParse; 671 assert( pParse==pWalker->pParse ); 672 673 #ifndef NDEBUG 674 if( pNC->pSrcList && pNC->pSrcList->nAlloc>0 ){ 675 SrcList *pSrcList = pNC->pSrcList; 676 int i; 677 for(i=0; i<pNC->pSrcList->nSrc; i++){ 678 assert( pSrcList->a[i].iCursor>=0 && pSrcList->a[i].iCursor<pParse->nTab); 679 } 680 } 681 #endif 682 switch( pExpr->op ){ 683 684 #if defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY) 685 /* The special operator TK_ROW means use the rowid for the first 686 ** column in the FROM clause. This is used by the LIMIT and ORDER BY 687 ** clause processing on UPDATE and DELETE statements. 688 */ 689 case TK_ROW: { 690 SrcList *pSrcList = pNC->pSrcList; 691 struct SrcList_item *pItem; 692 assert( pSrcList && pSrcList->nSrc==1 ); 693 pItem = pSrcList->a; 694 assert( HasRowid(pItem->pTab) && pItem->pTab->pSelect==0 ); 695 pExpr->op = TK_COLUMN; 696 pExpr->y.pTab = pItem->pTab; 697 pExpr->iTable = pItem->iCursor; 698 pExpr->iColumn = -1; 699 pExpr->affExpr = SQLITE_AFF_INTEGER; 700 break; 701 } 702 #endif /* defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) 703 && !defined(SQLITE_OMIT_SUBQUERY) */ 704 705 /* A column name: ID 706 ** Or table name and column name: ID.ID 707 ** Or a database, table and column: ID.ID.ID 708 ** 709 ** The TK_ID and TK_OUT cases are combined so that there will only 710 ** be one call to lookupName(). Then the compiler will in-line 711 ** lookupName() for a size reduction and performance increase. 712 */ 713 case TK_ID: 714 case TK_DOT: { 715 const char *zColumn; 716 const char *zTable; 717 const char *zDb; 718 Expr *pRight; 719 720 if( pExpr->op==TK_ID ){ 721 zDb = 0; 722 zTable = 0; 723 zColumn = pExpr->u.zToken; 724 }else{ 725 Expr *pLeft = pExpr->pLeft; 726 notValid(pParse, pNC, "the \".\" operator", NC_IdxExpr); 727 pRight = pExpr->pRight; 728 if( pRight->op==TK_ID ){ 729 zDb = 0; 730 }else{ 731 assert( pRight->op==TK_DOT ); 732 zDb = pLeft->u.zToken; 733 pLeft = pRight->pLeft; 734 pRight = pRight->pRight; 735 } 736 zTable = pLeft->u.zToken; 737 zColumn = pRight->u.zToken; 738 if( IN_RENAME_OBJECT ){ 739 sqlite3RenameTokenRemap(pParse, (void*)pExpr, (void*)pRight); 740 sqlite3RenameTokenRemap(pParse, (void*)&pExpr->y.pTab, (void*)pLeft); 741 } 742 } 743 return lookupName(pParse, zDb, zTable, zColumn, pNC, pExpr); 744 } 745 746 /* Resolve function names 747 */ 748 case TK_FUNCTION: { 749 ExprList *pList = pExpr->x.pList; /* The argument list */ 750 int n = pList ? pList->nExpr : 0; /* Number of arguments */ 751 int no_such_func = 0; /* True if no such function exists */ 752 int wrong_num_args = 0; /* True if wrong number of arguments */ 753 int is_agg = 0; /* True if is an aggregate function */ 754 int nId; /* Number of characters in function name */ 755 const char *zId; /* The function name. */ 756 FuncDef *pDef; /* Information about the function */ 757 u8 enc = ENC(pParse->db); /* The database encoding */ 758 int savedAllowFlags = (pNC->ncFlags & (NC_AllowAgg | NC_AllowWin)); 759 #ifndef SQLITE_OMIT_WINDOWFUNC 760 Window *pWin = (IsWindowFunc(pExpr) ? pExpr->y.pWin : 0); 761 #endif 762 assert( !ExprHasProperty(pExpr, EP_xIsSelect) ); 763 zId = pExpr->u.zToken; 764 nId = sqlite3Strlen30(zId); 765 pDef = sqlite3FindFunction(pParse->db, zId, n, enc, 0); 766 if( pDef==0 ){ 767 pDef = sqlite3FindFunction(pParse->db, zId, -2, enc, 0); 768 if( pDef==0 ){ 769 no_such_func = 1; 770 }else{ 771 wrong_num_args = 1; 772 } 773 }else{ 774 is_agg = pDef->xFinalize!=0; 775 if( pDef->funcFlags & SQLITE_FUNC_UNLIKELY ){ 776 ExprSetProperty(pExpr, EP_Unlikely); 777 if( n==2 ){ 778 pExpr->iTable = exprProbability(pList->a[1].pExpr); 779 if( pExpr->iTable<0 ){ 780 sqlite3ErrorMsg(pParse, 781 "second argument to likelihood() must be a " 782 "constant between 0.0 and 1.0"); 783 pNC->nErr++; 784 } 785 }else{ 786 /* EVIDENCE-OF: R-61304-29449 The unlikely(X) function is 787 ** equivalent to likelihood(X, 0.0625). 788 ** EVIDENCE-OF: R-01283-11636 The unlikely(X) function is 789 ** short-hand for likelihood(X,0.0625). 790 ** EVIDENCE-OF: R-36850-34127 The likely(X) function is short-hand 791 ** for likelihood(X,0.9375). 792 ** EVIDENCE-OF: R-53436-40973 The likely(X) function is equivalent 793 ** to likelihood(X,0.9375). */ 794 /* TUNING: unlikely() probability is 0.0625. likely() is 0.9375 */ 795 pExpr->iTable = pDef->zName[0]=='u' ? 8388608 : 125829120; 796 } 797 } 798 #ifndef SQLITE_OMIT_AUTHORIZATION 799 { 800 int auth = sqlite3AuthCheck(pParse, SQLITE_FUNCTION, 0,pDef->zName,0); 801 if( auth!=SQLITE_OK ){ 802 if( auth==SQLITE_DENY ){ 803 sqlite3ErrorMsg(pParse, "not authorized to use function: %s", 804 pDef->zName); 805 pNC->nErr++; 806 } 807 pExpr->op = TK_NULL; 808 return WRC_Prune; 809 } 810 } 811 #endif 812 if( pDef->funcFlags & (SQLITE_FUNC_CONSTANT|SQLITE_FUNC_SLOCHNG) ){ 813 /* For the purposes of the EP_ConstFunc flag, date and time 814 ** functions and other functions that change slowly are considered 815 ** constant because they are constant for the duration of one query */ 816 ExprSetProperty(pExpr,EP_ConstFunc); 817 } 818 if( (pDef->funcFlags & SQLITE_FUNC_CONSTANT)==0 ){ 819 /* Date/time functions that use 'now', and other functions like 820 ** sqlite_version() that might change over time cannot be used 821 ** in an index. */ 822 notValid(pParse, pNC, "non-deterministic functions", 823 NC_IdxExpr|NC_PartIdx); 824 } 825 if( (pDef->funcFlags & SQLITE_FUNC_INTERNAL)!=0 826 && pParse->nested==0 827 && sqlite3Config.bInternalFunctions==0 828 ){ 829 /* Internal-use-only functions are disallowed unless the 830 ** SQL is being compiled using sqlite3NestedParse() */ 831 no_such_func = 1; 832 pDef = 0; 833 }else 834 if( (pDef->funcFlags & SQLITE_FUNC_DIRECT)!=0 835 && ExprHasProperty(pExpr, EP_Indirect) 836 && !IN_RENAME_OBJECT 837 ){ 838 /* Functions tagged with SQLITE_DIRECTONLY may not be used 839 ** inside of triggers and views */ 840 sqlite3ErrorMsg(pParse, "%s() prohibited in triggers and views", 841 pDef->zName); 842 } 843 } 844 845 if( 0==IN_RENAME_OBJECT ){ 846 #ifndef SQLITE_OMIT_WINDOWFUNC 847 assert( is_agg==0 || (pDef->funcFlags & SQLITE_FUNC_MINMAX) 848 || (pDef->xValue==0 && pDef->xInverse==0) 849 || (pDef->xValue && pDef->xInverse && pDef->xSFunc && pDef->xFinalize) 850 ); 851 if( pDef && pDef->xValue==0 && pWin ){ 852 sqlite3ErrorMsg(pParse, 853 "%.*s() may not be used as a window function", nId, zId 854 ); 855 pNC->nErr++; 856 }else if( 857 (is_agg && (pNC->ncFlags & NC_AllowAgg)==0) 858 || (is_agg && (pDef->funcFlags&SQLITE_FUNC_WINDOW) && !pWin) 859 || (is_agg && pWin && (pNC->ncFlags & NC_AllowWin)==0) 860 ){ 861 const char *zType; 862 if( (pDef->funcFlags & SQLITE_FUNC_WINDOW) || pWin ){ 863 zType = "window"; 864 }else{ 865 zType = "aggregate"; 866 } 867 sqlite3ErrorMsg(pParse, "misuse of %s function %.*s()",zType,nId,zId); 868 pNC->nErr++; 869 is_agg = 0; 870 } 871 #else 872 if( (is_agg && (pNC->ncFlags & NC_AllowAgg)==0) ){ 873 sqlite3ErrorMsg(pParse,"misuse of aggregate function %.*s()",nId,zId); 874 pNC->nErr++; 875 is_agg = 0; 876 } 877 #endif 878 else if( no_such_func && pParse->db->init.busy==0 879 #ifdef SQLITE_ENABLE_UNKNOWN_SQL_FUNCTION 880 && pParse->explain==0 881 #endif 882 ){ 883 sqlite3ErrorMsg(pParse, "no such function: %.*s", nId, zId); 884 pNC->nErr++; 885 }else if( wrong_num_args ){ 886 sqlite3ErrorMsg(pParse,"wrong number of arguments to function %.*s()", 887 nId, zId); 888 pNC->nErr++; 889 } 890 #ifndef SQLITE_OMIT_WINDOWFUNC 891 else if( is_agg==0 && ExprHasProperty(pExpr, EP_WinFunc) ){ 892 sqlite3ErrorMsg(pParse, 893 "FILTER may not be used with non-aggregate %.*s()", 894 nId, zId 895 ); 896 pNC->nErr++; 897 } 898 #endif 899 if( is_agg ){ 900 /* Window functions may not be arguments of aggregate functions. 901 ** Or arguments of other window functions. But aggregate functions 902 ** may be arguments for window functions. */ 903 #ifndef SQLITE_OMIT_WINDOWFUNC 904 pNC->ncFlags &= ~(NC_AllowWin | (!pWin ? NC_AllowAgg : 0)); 905 #else 906 pNC->ncFlags &= ~NC_AllowAgg; 907 #endif 908 } 909 } 910 #ifndef SQLITE_OMIT_WINDOWFUNC 911 else if( ExprHasProperty(pExpr, EP_WinFunc) ){ 912 is_agg = 1; 913 } 914 #endif 915 sqlite3WalkExprList(pWalker, pList); 916 if( is_agg ){ 917 #ifndef SQLITE_OMIT_WINDOWFUNC 918 if( pWin ){ 919 Select *pSel = pNC->pWinSelect; 920 assert( pWin==pExpr->y.pWin ); 921 if( IN_RENAME_OBJECT==0 ){ 922 sqlite3WindowUpdate(pParse, pSel->pWinDefn, pWin, pDef); 923 } 924 sqlite3WalkExprList(pWalker, pWin->pPartition); 925 sqlite3WalkExprList(pWalker, pWin->pOrderBy); 926 sqlite3WalkExpr(pWalker, pWin->pFilter); 927 sqlite3WindowLink(pSel, pWin); 928 pNC->ncFlags |= NC_HasWin; 929 }else 930 #endif /* SQLITE_OMIT_WINDOWFUNC */ 931 { 932 NameContext *pNC2 = pNC; 933 pExpr->op = TK_AGG_FUNCTION; 934 pExpr->op2 = 0; 935 #ifndef SQLITE_OMIT_WINDOWFUNC 936 if( ExprHasProperty(pExpr, EP_WinFunc) ){ 937 sqlite3WalkExpr(pWalker, pExpr->y.pWin->pFilter); 938 } 939 #endif 940 while( pNC2 && !sqlite3FunctionUsesThisSrc(pExpr, pNC2->pSrcList) ){ 941 pExpr->op2++; 942 pNC2 = pNC2->pNext; 943 } 944 assert( pDef!=0 || IN_RENAME_OBJECT ); 945 if( pNC2 && pDef ){ 946 assert( SQLITE_FUNC_MINMAX==NC_MinMaxAgg ); 947 testcase( (pDef->funcFlags & SQLITE_FUNC_MINMAX)!=0 ); 948 pNC2->ncFlags |= NC_HasAgg | (pDef->funcFlags & SQLITE_FUNC_MINMAX); 949 950 } 951 } 952 pNC->ncFlags |= savedAllowFlags; 953 } 954 /* FIX ME: Compute pExpr->affinity based on the expected return 955 ** type of the function 956 */ 957 return WRC_Prune; 958 } 959 #ifndef SQLITE_OMIT_SUBQUERY 960 case TK_SELECT: 961 case TK_EXISTS: testcase( pExpr->op==TK_EXISTS ); 962 #endif 963 case TK_IN: { 964 testcase( pExpr->op==TK_IN ); 965 if( ExprHasProperty(pExpr, EP_xIsSelect) ){ 966 int nRef = pNC->nRef; 967 notValid(pParse, pNC, "subqueries", NC_IsCheck|NC_PartIdx|NC_IdxExpr); 968 sqlite3WalkSelect(pWalker, pExpr->x.pSelect); 969 assert( pNC->nRef>=nRef ); 970 if( nRef!=pNC->nRef ){ 971 ExprSetProperty(pExpr, EP_VarSelect); 972 pNC->ncFlags |= NC_VarSelect; 973 } 974 } 975 break; 976 } 977 case TK_VARIABLE: { 978 notValid(pParse, pNC, "parameters", NC_IsCheck|NC_PartIdx|NC_IdxExpr); 979 break; 980 } 981 case TK_IS: 982 case TK_ISNOT: { 983 Expr *pRight = sqlite3ExprSkipCollateAndLikely(pExpr->pRight); 984 assert( !ExprHasProperty(pExpr, EP_Reduced) ); 985 /* Handle special cases of "x IS TRUE", "x IS FALSE", "x IS NOT TRUE", 986 ** and "x IS NOT FALSE". */ 987 if( pRight->op==TK_ID ){ 988 int rc = resolveExprStep(pWalker, pRight); 989 if( rc==WRC_Abort ) return WRC_Abort; 990 if( pRight->op==TK_TRUEFALSE ){ 991 pExpr->op2 = pExpr->op; 992 pExpr->op = TK_TRUTH; 993 return WRC_Continue; 994 } 995 } 996 /* Fall thru */ 997 } 998 case TK_BETWEEN: 999 case TK_EQ: 1000 case TK_NE: 1001 case TK_LT: 1002 case TK_LE: 1003 case TK_GT: 1004 case TK_GE: { 1005 int nLeft, nRight; 1006 if( pParse->db->mallocFailed ) break; 1007 assert( pExpr->pLeft!=0 ); 1008 nLeft = sqlite3ExprVectorSize(pExpr->pLeft); 1009 if( pExpr->op==TK_BETWEEN ){ 1010 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[0].pExpr); 1011 if( nRight==nLeft ){ 1012 nRight = sqlite3ExprVectorSize(pExpr->x.pList->a[1].pExpr); 1013 } 1014 }else{ 1015 assert( pExpr->pRight!=0 ); 1016 nRight = sqlite3ExprVectorSize(pExpr->pRight); 1017 } 1018 if( nLeft!=nRight ){ 1019 testcase( pExpr->op==TK_EQ ); 1020 testcase( pExpr->op==TK_NE ); 1021 testcase( pExpr->op==TK_LT ); 1022 testcase( pExpr->op==TK_LE ); 1023 testcase( pExpr->op==TK_GT ); 1024 testcase( pExpr->op==TK_GE ); 1025 testcase( pExpr->op==TK_IS ); 1026 testcase( pExpr->op==TK_ISNOT ); 1027 testcase( pExpr->op==TK_BETWEEN ); 1028 sqlite3ErrorMsg(pParse, "row value misused"); 1029 } 1030 break; 1031 } 1032 } 1033 return (pParse->nErr || pParse->db->mallocFailed) ? WRC_Abort : WRC_Continue; 1034 } 1035 1036 /* 1037 ** pEList is a list of expressions which are really the result set of the 1038 ** a SELECT statement. pE is a term in an ORDER BY or GROUP BY clause. 1039 ** This routine checks to see if pE is a simple identifier which corresponds 1040 ** to the AS-name of one of the terms of the expression list. If it is, 1041 ** this routine return an integer between 1 and N where N is the number of 1042 ** elements in pEList, corresponding to the matching entry. If there is 1043 ** no match, or if pE is not a simple identifier, then this routine 1044 ** return 0. 1045 ** 1046 ** pEList has been resolved. pE has not. 1047 */ 1048 static int resolveAsName( 1049 Parse *pParse, /* Parsing context for error messages */ 1050 ExprList *pEList, /* List of expressions to scan */ 1051 Expr *pE /* Expression we are trying to match */ 1052 ){ 1053 int i; /* Loop counter */ 1054 1055 UNUSED_PARAMETER(pParse); 1056 1057 if( pE->op==TK_ID ){ 1058 char *zCol = pE->u.zToken; 1059 for(i=0; i<pEList->nExpr; i++){ 1060 char *zAs = pEList->a[i].zName; 1061 if( zAs!=0 && sqlite3StrICmp(zAs, zCol)==0 ){ 1062 return i+1; 1063 } 1064 } 1065 } 1066 return 0; 1067 } 1068 1069 /* 1070 ** pE is a pointer to an expression which is a single term in the 1071 ** ORDER BY of a compound SELECT. The expression has not been 1072 ** name resolved. 1073 ** 1074 ** At the point this routine is called, we already know that the 1075 ** ORDER BY term is not an integer index into the result set. That 1076 ** case is handled by the calling routine. 1077 ** 1078 ** Attempt to match pE against result set columns in the left-most 1079 ** SELECT statement. Return the index i of the matching column, 1080 ** as an indication to the caller that it should sort by the i-th column. 1081 ** The left-most column is 1. In other words, the value returned is the 1082 ** same integer value that would be used in the SQL statement to indicate 1083 ** the column. 1084 ** 1085 ** If there is no match, return 0. Return -1 if an error occurs. 1086 */ 1087 static int resolveOrderByTermToExprList( 1088 Parse *pParse, /* Parsing context for error messages */ 1089 Select *pSelect, /* The SELECT statement with the ORDER BY clause */ 1090 Expr *pE /* The specific ORDER BY term */ 1091 ){ 1092 int i; /* Loop counter */ 1093 ExprList *pEList; /* The columns of the result set */ 1094 NameContext nc; /* Name context for resolving pE */ 1095 sqlite3 *db; /* Database connection */ 1096 int rc; /* Return code from subprocedures */ 1097 u8 savedSuppErr; /* Saved value of db->suppressErr */ 1098 1099 assert( sqlite3ExprIsInteger(pE, &i)==0 ); 1100 pEList = pSelect->pEList; 1101 1102 /* Resolve all names in the ORDER BY term expression 1103 */ 1104 memset(&nc, 0, sizeof(nc)); 1105 nc.pParse = pParse; 1106 nc.pSrcList = pSelect->pSrc; 1107 nc.uNC.pEList = pEList; 1108 nc.ncFlags = NC_AllowAgg|NC_UEList; 1109 nc.nErr = 0; 1110 db = pParse->db; 1111 savedSuppErr = db->suppressErr; 1112 db->suppressErr = 1; 1113 rc = sqlite3ResolveExprNames(&nc, pE); 1114 db->suppressErr = savedSuppErr; 1115 if( rc ) return 0; 1116 1117 /* Try to match the ORDER BY expression against an expression 1118 ** in the result set. Return an 1-based index of the matching 1119 ** result-set entry. 1120 */ 1121 for(i=0; i<pEList->nExpr; i++){ 1122 if( sqlite3ExprCompare(0, pEList->a[i].pExpr, pE, -1)<2 ){ 1123 return i+1; 1124 } 1125 } 1126 1127 /* If no match, return 0. */ 1128 return 0; 1129 } 1130 1131 /* 1132 ** Generate an ORDER BY or GROUP BY term out-of-range error. 1133 */ 1134 static void resolveOutOfRangeError( 1135 Parse *pParse, /* The error context into which to write the error */ 1136 const char *zType, /* "ORDER" or "GROUP" */ 1137 int i, /* The index (1-based) of the term out of range */ 1138 int mx /* Largest permissible value of i */ 1139 ){ 1140 sqlite3ErrorMsg(pParse, 1141 "%r %s BY term out of range - should be " 1142 "between 1 and %d", i, zType, mx); 1143 } 1144 1145 /* 1146 ** Analyze the ORDER BY clause in a compound SELECT statement. Modify 1147 ** each term of the ORDER BY clause is a constant integer between 1 1148 ** and N where N is the number of columns in the compound SELECT. 1149 ** 1150 ** ORDER BY terms that are already an integer between 1 and N are 1151 ** unmodified. ORDER BY terms that are integers outside the range of 1152 ** 1 through N generate an error. ORDER BY terms that are expressions 1153 ** are matched against result set expressions of compound SELECT 1154 ** beginning with the left-most SELECT and working toward the right. 1155 ** At the first match, the ORDER BY expression is transformed into 1156 ** the integer column number. 1157 ** 1158 ** Return the number of errors seen. 1159 */ 1160 static int resolveCompoundOrderBy( 1161 Parse *pParse, /* Parsing context. Leave error messages here */ 1162 Select *pSelect /* The SELECT statement containing the ORDER BY */ 1163 ){ 1164 int i; 1165 ExprList *pOrderBy; 1166 ExprList *pEList; 1167 sqlite3 *db; 1168 int moreToDo = 1; 1169 1170 pOrderBy = pSelect->pOrderBy; 1171 if( pOrderBy==0 ) return 0; 1172 db = pParse->db; 1173 if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){ 1174 sqlite3ErrorMsg(pParse, "too many terms in ORDER BY clause"); 1175 return 1; 1176 } 1177 for(i=0; i<pOrderBy->nExpr; i++){ 1178 pOrderBy->a[i].done = 0; 1179 } 1180 pSelect->pNext = 0; 1181 while( pSelect->pPrior ){ 1182 pSelect->pPrior->pNext = pSelect; 1183 pSelect = pSelect->pPrior; 1184 } 1185 while( pSelect && moreToDo ){ 1186 struct ExprList_item *pItem; 1187 moreToDo = 0; 1188 pEList = pSelect->pEList; 1189 assert( pEList!=0 ); 1190 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){ 1191 int iCol = -1; 1192 Expr *pE, *pDup; 1193 if( pItem->done ) continue; 1194 pE = sqlite3ExprSkipCollateAndLikely(pItem->pExpr); 1195 if( sqlite3ExprIsInteger(pE, &iCol) ){ 1196 if( iCol<=0 || iCol>pEList->nExpr ){ 1197 resolveOutOfRangeError(pParse, "ORDER", i+1, pEList->nExpr); 1198 return 1; 1199 } 1200 }else{ 1201 iCol = resolveAsName(pParse, pEList, pE); 1202 if( iCol==0 ){ 1203 /* Now test if expression pE matches one of the values returned 1204 ** by pSelect. In the usual case this is done by duplicating the 1205 ** expression, resolving any symbols in it, and then comparing 1206 ** it against each expression returned by the SELECT statement. 1207 ** Once the comparisons are finished, the duplicate expression 1208 ** is deleted. 1209 ** 1210 ** Or, if this is running as part of an ALTER TABLE operation, 1211 ** resolve the symbols in the actual expression, not a duplicate. 1212 ** And, if one of the comparisons is successful, leave the expression 1213 ** as is instead of transforming it to an integer as in the usual 1214 ** case. This allows the code in alter.c to modify column 1215 ** refererences within the ORDER BY expression as required. */ 1216 if( IN_RENAME_OBJECT ){ 1217 pDup = pE; 1218 }else{ 1219 pDup = sqlite3ExprDup(db, pE, 0); 1220 } 1221 if( !db->mallocFailed ){ 1222 assert(pDup); 1223 iCol = resolveOrderByTermToExprList(pParse, pSelect, pDup); 1224 } 1225 if( !IN_RENAME_OBJECT ){ 1226 sqlite3ExprDelete(db, pDup); 1227 } 1228 } 1229 } 1230 if( iCol>0 ){ 1231 /* Convert the ORDER BY term into an integer column number iCol, 1232 ** taking care to preserve the COLLATE clause if it exists */ 1233 if( !IN_RENAME_OBJECT ){ 1234 Expr *pNew = sqlite3Expr(db, TK_INTEGER, 0); 1235 if( pNew==0 ) return 1; 1236 pNew->flags |= EP_IntValue; 1237 pNew->u.iValue = iCol; 1238 if( pItem->pExpr==pE ){ 1239 pItem->pExpr = pNew; 1240 }else{ 1241 Expr *pParent = pItem->pExpr; 1242 assert( pParent->op==TK_COLLATE ); 1243 while( pParent->pLeft->op==TK_COLLATE ) pParent = pParent->pLeft; 1244 assert( pParent->pLeft==pE ); 1245 pParent->pLeft = pNew; 1246 } 1247 sqlite3ExprDelete(db, pE); 1248 pItem->u.x.iOrderByCol = (u16)iCol; 1249 } 1250 pItem->done = 1; 1251 }else{ 1252 moreToDo = 1; 1253 } 1254 } 1255 pSelect = pSelect->pNext; 1256 } 1257 for(i=0; i<pOrderBy->nExpr; i++){ 1258 if( pOrderBy->a[i].done==0 ){ 1259 sqlite3ErrorMsg(pParse, "%r ORDER BY term does not match any " 1260 "column in the result set", i+1); 1261 return 1; 1262 } 1263 } 1264 return 0; 1265 } 1266 1267 /* 1268 ** Check every term in the ORDER BY or GROUP BY clause pOrderBy of 1269 ** the SELECT statement pSelect. If any term is reference to a 1270 ** result set expression (as determined by the ExprList.a.u.x.iOrderByCol 1271 ** field) then convert that term into a copy of the corresponding result set 1272 ** column. 1273 ** 1274 ** If any errors are detected, add an error message to pParse and 1275 ** return non-zero. Return zero if no errors are seen. 1276 */ 1277 int sqlite3ResolveOrderGroupBy( 1278 Parse *pParse, /* Parsing context. Leave error messages here */ 1279 Select *pSelect, /* The SELECT statement containing the clause */ 1280 ExprList *pOrderBy, /* The ORDER BY or GROUP BY clause to be processed */ 1281 const char *zType /* "ORDER" or "GROUP" */ 1282 ){ 1283 int i; 1284 sqlite3 *db = pParse->db; 1285 ExprList *pEList; 1286 struct ExprList_item *pItem; 1287 1288 if( pOrderBy==0 || pParse->db->mallocFailed || IN_RENAME_OBJECT ) return 0; 1289 if( pOrderBy->nExpr>db->aLimit[SQLITE_LIMIT_COLUMN] ){ 1290 sqlite3ErrorMsg(pParse, "too many terms in %s BY clause", zType); 1291 return 1; 1292 } 1293 pEList = pSelect->pEList; 1294 assert( pEList!=0 ); /* sqlite3SelectNew() guarantees this */ 1295 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){ 1296 if( pItem->u.x.iOrderByCol ){ 1297 if( pItem->u.x.iOrderByCol>pEList->nExpr ){ 1298 resolveOutOfRangeError(pParse, zType, i+1, pEList->nExpr); 1299 return 1; 1300 } 1301 resolveAlias(pParse, pEList, pItem->u.x.iOrderByCol-1, pItem->pExpr, 1302 zType,0); 1303 } 1304 } 1305 return 0; 1306 } 1307 1308 #ifndef SQLITE_OMIT_WINDOWFUNC 1309 /* 1310 ** Walker callback for windowRemoveExprFromSelect(). 1311 */ 1312 static int resolveRemoveWindowsCb(Walker *pWalker, Expr *pExpr){ 1313 UNUSED_PARAMETER(pWalker); 1314 if( ExprHasProperty(pExpr, EP_WinFunc) ){ 1315 Window *pWin = pExpr->y.pWin; 1316 sqlite3WindowUnlinkFromSelect(pWin); 1317 } 1318 return WRC_Continue; 1319 } 1320 1321 /* 1322 ** Remove any Window objects owned by the expression pExpr from the 1323 ** Select.pWin list of Select object pSelect. 1324 */ 1325 static void windowRemoveExprFromSelect(Select *pSelect, Expr *pExpr){ 1326 if( pSelect->pWin ){ 1327 Walker sWalker; 1328 memset(&sWalker, 0, sizeof(Walker)); 1329 sWalker.xExprCallback = resolveRemoveWindowsCb; 1330 sWalker.u.pSelect = pSelect; 1331 sqlite3WalkExpr(&sWalker, pExpr); 1332 } 1333 } 1334 #else 1335 # define windowRemoveExprFromSelect(a, b) 1336 #endif /* SQLITE_OMIT_WINDOWFUNC */ 1337 1338 /* 1339 ** pOrderBy is an ORDER BY or GROUP BY clause in SELECT statement pSelect. 1340 ** The Name context of the SELECT statement is pNC. zType is either 1341 ** "ORDER" or "GROUP" depending on which type of clause pOrderBy is. 1342 ** 1343 ** This routine resolves each term of the clause into an expression. 1344 ** If the order-by term is an integer I between 1 and N (where N is the 1345 ** number of columns in the result set of the SELECT) then the expression 1346 ** in the resolution is a copy of the I-th result-set expression. If 1347 ** the order-by term is an identifier that corresponds to the AS-name of 1348 ** a result-set expression, then the term resolves to a copy of the 1349 ** result-set expression. Otherwise, the expression is resolved in 1350 ** the usual way - using sqlite3ResolveExprNames(). 1351 ** 1352 ** This routine returns the number of errors. If errors occur, then 1353 ** an appropriate error message might be left in pParse. (OOM errors 1354 ** excepted.) 1355 */ 1356 static int resolveOrderGroupBy( 1357 NameContext *pNC, /* The name context of the SELECT statement */ 1358 Select *pSelect, /* The SELECT statement holding pOrderBy */ 1359 ExprList *pOrderBy, /* An ORDER BY or GROUP BY clause to resolve */ 1360 const char *zType /* Either "ORDER" or "GROUP", as appropriate */ 1361 ){ 1362 int i, j; /* Loop counters */ 1363 int iCol; /* Column number */ 1364 struct ExprList_item *pItem; /* A term of the ORDER BY clause */ 1365 Parse *pParse; /* Parsing context */ 1366 int nResult; /* Number of terms in the result set */ 1367 1368 if( pOrderBy==0 ) return 0; 1369 nResult = pSelect->pEList->nExpr; 1370 pParse = pNC->pParse; 1371 for(i=0, pItem=pOrderBy->a; i<pOrderBy->nExpr; i++, pItem++){ 1372 Expr *pE = pItem->pExpr; 1373 Expr *pE2 = sqlite3ExprSkipCollateAndLikely(pE); 1374 if( zType[0]!='G' ){ 1375 iCol = resolveAsName(pParse, pSelect->pEList, pE2); 1376 if( iCol>0 ){ 1377 /* If an AS-name match is found, mark this ORDER BY column as being 1378 ** a copy of the iCol-th result-set column. The subsequent call to 1379 ** sqlite3ResolveOrderGroupBy() will convert the expression to a 1380 ** copy of the iCol-th result-set expression. */ 1381 pItem->u.x.iOrderByCol = (u16)iCol; 1382 continue; 1383 } 1384 } 1385 if( sqlite3ExprIsInteger(pE2, &iCol) ){ 1386 /* The ORDER BY term is an integer constant. Again, set the column 1387 ** number so that sqlite3ResolveOrderGroupBy() will convert the 1388 ** order-by term to a copy of the result-set expression */ 1389 if( iCol<1 || iCol>0xffff ){ 1390 resolveOutOfRangeError(pParse, zType, i+1, nResult); 1391 return 1; 1392 } 1393 pItem->u.x.iOrderByCol = (u16)iCol; 1394 continue; 1395 } 1396 1397 /* Otherwise, treat the ORDER BY term as an ordinary expression */ 1398 pItem->u.x.iOrderByCol = 0; 1399 if( sqlite3ResolveExprNames(pNC, pE) ){ 1400 return 1; 1401 } 1402 for(j=0; j<pSelect->pEList->nExpr; j++){ 1403 if( sqlite3ExprCompare(0, pE, pSelect->pEList->a[j].pExpr, -1)==0 ){ 1404 /* Since this expresion is being changed into a reference 1405 ** to an identical expression in the result set, remove all Window 1406 ** objects belonging to the expression from the Select.pWin list. */ 1407 windowRemoveExprFromSelect(pSelect, pE); 1408 pItem->u.x.iOrderByCol = j+1; 1409 } 1410 } 1411 } 1412 return sqlite3ResolveOrderGroupBy(pParse, pSelect, pOrderBy, zType); 1413 } 1414 1415 /* 1416 ** Resolve names in the SELECT statement p and all of its descendants. 1417 */ 1418 static int resolveSelectStep(Walker *pWalker, Select *p){ 1419 NameContext *pOuterNC; /* Context that contains this SELECT */ 1420 NameContext sNC; /* Name context of this SELECT */ 1421 int isCompound; /* True if p is a compound select */ 1422 int nCompound; /* Number of compound terms processed so far */ 1423 Parse *pParse; /* Parsing context */ 1424 int i; /* Loop counter */ 1425 ExprList *pGroupBy; /* The GROUP BY clause */ 1426 Select *pLeftmost; /* Left-most of SELECT of a compound */ 1427 sqlite3 *db; /* Database connection */ 1428 1429 1430 assert( p!=0 ); 1431 if( p->selFlags & SF_Resolved ){ 1432 return WRC_Prune; 1433 } 1434 pOuterNC = pWalker->u.pNC; 1435 pParse = pWalker->pParse; 1436 db = pParse->db; 1437 1438 /* Normally sqlite3SelectExpand() will be called first and will have 1439 ** already expanded this SELECT. However, if this is a subquery within 1440 ** an expression, sqlite3ResolveExprNames() will be called without a 1441 ** prior call to sqlite3SelectExpand(). When that happens, let 1442 ** sqlite3SelectPrep() do all of the processing for this SELECT. 1443 ** sqlite3SelectPrep() will invoke both sqlite3SelectExpand() and 1444 ** this routine in the correct order. 1445 */ 1446 if( (p->selFlags & SF_Expanded)==0 ){ 1447 sqlite3SelectPrep(pParse, p, pOuterNC); 1448 return (pParse->nErr || db->mallocFailed) ? WRC_Abort : WRC_Prune; 1449 } 1450 1451 isCompound = p->pPrior!=0; 1452 nCompound = 0; 1453 pLeftmost = p; 1454 while( p ){ 1455 assert( (p->selFlags & SF_Expanded)!=0 ); 1456 assert( (p->selFlags & SF_Resolved)==0 ); 1457 p->selFlags |= SF_Resolved; 1458 1459 /* Resolve the expressions in the LIMIT and OFFSET clauses. These 1460 ** are not allowed to refer to any names, so pass an empty NameContext. 1461 */ 1462 memset(&sNC, 0, sizeof(sNC)); 1463 sNC.pParse = pParse; 1464 sNC.pWinSelect = p; 1465 if( sqlite3ResolveExprNames(&sNC, p->pLimit) ){ 1466 return WRC_Abort; 1467 } 1468 1469 /* If the SF_Converted flags is set, then this Select object was 1470 ** was created by the convertCompoundSelectToSubquery() function. 1471 ** In this case the ORDER BY clause (p->pOrderBy) should be resolved 1472 ** as if it were part of the sub-query, not the parent. This block 1473 ** moves the pOrderBy down to the sub-query. It will be moved back 1474 ** after the names have been resolved. */ 1475 if( p->selFlags & SF_Converted ){ 1476 Select *pSub = p->pSrc->a[0].pSelect; 1477 assert( p->pSrc->nSrc==1 && p->pOrderBy ); 1478 assert( pSub->pPrior && pSub->pOrderBy==0 ); 1479 pSub->pOrderBy = p->pOrderBy; 1480 p->pOrderBy = 0; 1481 } 1482 1483 /* Recursively resolve names in all subqueries 1484 */ 1485 for(i=0; i<p->pSrc->nSrc; i++){ 1486 struct SrcList_item *pItem = &p->pSrc->a[i]; 1487 if( pItem->pSelect && (pItem->pSelect->selFlags & SF_Resolved)==0 ){ 1488 NameContext *pNC; /* Used to iterate name contexts */ 1489 int nRef = 0; /* Refcount for pOuterNC and outer contexts */ 1490 const char *zSavedContext = pParse->zAuthContext; 1491 1492 /* Count the total number of references to pOuterNC and all of its 1493 ** parent contexts. After resolving references to expressions in 1494 ** pItem->pSelect, check if this value has changed. If so, then 1495 ** SELECT statement pItem->pSelect must be correlated. Set the 1496 ** pItem->fg.isCorrelated flag if this is the case. */ 1497 for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef += pNC->nRef; 1498 1499 if( pItem->zName ) pParse->zAuthContext = pItem->zName; 1500 sqlite3ResolveSelectNames(pParse, pItem->pSelect, pOuterNC); 1501 pParse->zAuthContext = zSavedContext; 1502 if( pParse->nErr || db->mallocFailed ) return WRC_Abort; 1503 1504 for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef -= pNC->nRef; 1505 assert( pItem->fg.isCorrelated==0 && nRef<=0 ); 1506 pItem->fg.isCorrelated = (nRef!=0); 1507 } 1508 } 1509 1510 /* Set up the local name-context to pass to sqlite3ResolveExprNames() to 1511 ** resolve the result-set expression list. 1512 */ 1513 sNC.ncFlags = NC_AllowAgg|NC_AllowWin; 1514 sNC.pSrcList = p->pSrc; 1515 sNC.pNext = pOuterNC; 1516 1517 /* Resolve names in the result set. */ 1518 if( sqlite3ResolveExprListNames(&sNC, p->pEList) ) return WRC_Abort; 1519 sNC.ncFlags &= ~NC_AllowWin; 1520 1521 /* If there are no aggregate functions in the result-set, and no GROUP BY 1522 ** expression, do not allow aggregates in any of the other expressions. 1523 */ 1524 assert( (p->selFlags & SF_Aggregate)==0 ); 1525 pGroupBy = p->pGroupBy; 1526 if( pGroupBy || (sNC.ncFlags & NC_HasAgg)!=0 ){ 1527 assert( NC_MinMaxAgg==SF_MinMaxAgg ); 1528 p->selFlags |= SF_Aggregate | (sNC.ncFlags&NC_MinMaxAgg); 1529 }else{ 1530 sNC.ncFlags &= ~NC_AllowAgg; 1531 } 1532 1533 /* If a HAVING clause is present, then there must be a GROUP BY clause. 1534 */ 1535 if( p->pHaving && !pGroupBy ){ 1536 sqlite3ErrorMsg(pParse, "a GROUP BY clause is required before HAVING"); 1537 return WRC_Abort; 1538 } 1539 1540 /* Add the output column list to the name-context before parsing the 1541 ** other expressions in the SELECT statement. This is so that 1542 ** expressions in the WHERE clause (etc.) can refer to expressions by 1543 ** aliases in the result set. 1544 ** 1545 ** Minor point: If this is the case, then the expression will be 1546 ** re-evaluated for each reference to it. 1547 */ 1548 assert( (sNC.ncFlags & (NC_UAggInfo|NC_UUpsert))==0 ); 1549 sNC.uNC.pEList = p->pEList; 1550 sNC.ncFlags |= NC_UEList; 1551 if( sqlite3ResolveExprNames(&sNC, p->pHaving) ) return WRC_Abort; 1552 if( sqlite3ResolveExprNames(&sNC, p->pWhere) ) return WRC_Abort; 1553 1554 /* Resolve names in table-valued-function arguments */ 1555 for(i=0; i<p->pSrc->nSrc; i++){ 1556 struct SrcList_item *pItem = &p->pSrc->a[i]; 1557 if( pItem->fg.isTabFunc 1558 && sqlite3ResolveExprListNames(&sNC, pItem->u1.pFuncArg) 1559 ){ 1560 return WRC_Abort; 1561 } 1562 } 1563 1564 /* The ORDER BY and GROUP BY clauses may not refer to terms in 1565 ** outer queries 1566 */ 1567 sNC.pNext = 0; 1568 sNC.ncFlags |= NC_AllowAgg|NC_AllowWin; 1569 1570 /* If this is a converted compound query, move the ORDER BY clause from 1571 ** the sub-query back to the parent query. At this point each term 1572 ** within the ORDER BY clause has been transformed to an integer value. 1573 ** These integers will be replaced by copies of the corresponding result 1574 ** set expressions by the call to resolveOrderGroupBy() below. */ 1575 if( p->selFlags & SF_Converted ){ 1576 Select *pSub = p->pSrc->a[0].pSelect; 1577 p->pOrderBy = pSub->pOrderBy; 1578 pSub->pOrderBy = 0; 1579 } 1580 1581 /* Process the ORDER BY clause for singleton SELECT statements. 1582 ** The ORDER BY clause for compounds SELECT statements is handled 1583 ** below, after all of the result-sets for all of the elements of 1584 ** the compound have been resolved. 1585 ** 1586 ** If there is an ORDER BY clause on a term of a compound-select other 1587 ** than the right-most term, then that is a syntax error. But the error 1588 ** is not detected until much later, and so we need to go ahead and 1589 ** resolve those symbols on the incorrect ORDER BY for consistency. 1590 */ 1591 if( isCompound<=nCompound /* Defer right-most ORDER BY of a compound */ 1592 && resolveOrderGroupBy(&sNC, p, p->pOrderBy, "ORDER") 1593 ){ 1594 return WRC_Abort; 1595 } 1596 if( db->mallocFailed ){ 1597 return WRC_Abort; 1598 } 1599 sNC.ncFlags &= ~NC_AllowWin; 1600 1601 /* Resolve the GROUP BY clause. At the same time, make sure 1602 ** the GROUP BY clause does not contain aggregate functions. 1603 */ 1604 if( pGroupBy ){ 1605 struct ExprList_item *pItem; 1606 1607 if( resolveOrderGroupBy(&sNC, p, pGroupBy, "GROUP") || db->mallocFailed ){ 1608 return WRC_Abort; 1609 } 1610 for(i=0, pItem=pGroupBy->a; i<pGroupBy->nExpr; i++, pItem++){ 1611 if( ExprHasProperty(pItem->pExpr, EP_Agg) ){ 1612 sqlite3ErrorMsg(pParse, "aggregate functions are not allowed in " 1613 "the GROUP BY clause"); 1614 return WRC_Abort; 1615 } 1616 } 1617 } 1618 1619 #ifndef SQLITE_OMIT_WINDOWFUNC 1620 if( IN_RENAME_OBJECT ){ 1621 Window *pWin; 1622 for(pWin=p->pWinDefn; pWin; pWin=pWin->pNextWin){ 1623 if( sqlite3ResolveExprListNames(&sNC, pWin->pOrderBy) 1624 || sqlite3ResolveExprListNames(&sNC, pWin->pPartition) 1625 ){ 1626 return WRC_Abort; 1627 } 1628 } 1629 } 1630 #endif 1631 1632 /* If this is part of a compound SELECT, check that it has the right 1633 ** number of expressions in the select list. */ 1634 if( p->pNext && p->pEList->nExpr!=p->pNext->pEList->nExpr ){ 1635 sqlite3SelectWrongNumTermsError(pParse, p->pNext); 1636 return WRC_Abort; 1637 } 1638 1639 /* Advance to the next term of the compound 1640 */ 1641 p = p->pPrior; 1642 nCompound++; 1643 } 1644 1645 /* Resolve the ORDER BY on a compound SELECT after all terms of 1646 ** the compound have been resolved. 1647 */ 1648 if( isCompound && resolveCompoundOrderBy(pParse, pLeftmost) ){ 1649 return WRC_Abort; 1650 } 1651 1652 return WRC_Prune; 1653 } 1654 1655 /* 1656 ** This routine walks an expression tree and resolves references to 1657 ** table columns and result-set columns. At the same time, do error 1658 ** checking on function usage and set a flag if any aggregate functions 1659 ** are seen. 1660 ** 1661 ** To resolve table columns references we look for nodes (or subtrees) of the 1662 ** form X.Y.Z or Y.Z or just Z where 1663 ** 1664 ** X: The name of a database. Ex: "main" or "temp" or 1665 ** the symbolic name assigned to an ATTACH-ed database. 1666 ** 1667 ** Y: The name of a table in a FROM clause. Or in a trigger 1668 ** one of the special names "old" or "new". 1669 ** 1670 ** Z: The name of a column in table Y. 1671 ** 1672 ** The node at the root of the subtree is modified as follows: 1673 ** 1674 ** Expr.op Changed to TK_COLUMN 1675 ** Expr.pTab Points to the Table object for X.Y 1676 ** Expr.iColumn The column index in X.Y. -1 for the rowid. 1677 ** Expr.iTable The VDBE cursor number for X.Y 1678 ** 1679 ** 1680 ** To resolve result-set references, look for expression nodes of the 1681 ** form Z (with no X and Y prefix) where the Z matches the right-hand 1682 ** size of an AS clause in the result-set of a SELECT. The Z expression 1683 ** is replaced by a copy of the left-hand side of the result-set expression. 1684 ** Table-name and function resolution occurs on the substituted expression 1685 ** tree. For example, in: 1686 ** 1687 ** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY x; 1688 ** 1689 ** The "x" term of the order by is replaced by "a+b" to render: 1690 ** 1691 ** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY a+b; 1692 ** 1693 ** Function calls are checked to make sure that the function is 1694 ** defined and that the correct number of arguments are specified. 1695 ** If the function is an aggregate function, then the NC_HasAgg flag is 1696 ** set and the opcode is changed from TK_FUNCTION to TK_AGG_FUNCTION. 1697 ** If an expression contains aggregate functions then the EP_Agg 1698 ** property on the expression is set. 1699 ** 1700 ** An error message is left in pParse if anything is amiss. The number 1701 ** if errors is returned. 1702 */ 1703 int sqlite3ResolveExprNames( 1704 NameContext *pNC, /* Namespace to resolve expressions in. */ 1705 Expr *pExpr /* The expression to be analyzed. */ 1706 ){ 1707 int savedHasAgg; 1708 Walker w; 1709 1710 if( pExpr==0 ) return SQLITE_OK; 1711 savedHasAgg = pNC->ncFlags & (NC_HasAgg|NC_MinMaxAgg|NC_HasWin); 1712 pNC->ncFlags &= ~(NC_HasAgg|NC_MinMaxAgg|NC_HasWin); 1713 w.pParse = pNC->pParse; 1714 w.xExprCallback = resolveExprStep; 1715 w.xSelectCallback = resolveSelectStep; 1716 w.xSelectCallback2 = 0; 1717 w.u.pNC = pNC; 1718 #if SQLITE_MAX_EXPR_DEPTH>0 1719 w.pParse->nHeight += pExpr->nHeight; 1720 if( sqlite3ExprCheckHeight(w.pParse, w.pParse->nHeight) ){ 1721 return SQLITE_ERROR; 1722 } 1723 #endif 1724 sqlite3WalkExpr(&w, pExpr); 1725 #if SQLITE_MAX_EXPR_DEPTH>0 1726 w.pParse->nHeight -= pExpr->nHeight; 1727 #endif 1728 assert( EP_Agg==NC_HasAgg ); 1729 assert( EP_Win==NC_HasWin ); 1730 testcase( pNC->ncFlags & NC_HasAgg ); 1731 testcase( pNC->ncFlags & NC_HasWin ); 1732 ExprSetProperty(pExpr, pNC->ncFlags & (NC_HasAgg|NC_HasWin) ); 1733 pNC->ncFlags |= savedHasAgg; 1734 return pNC->nErr>0 || w.pParse->nErr>0; 1735 } 1736 1737 /* 1738 ** Resolve all names for all expression in an expression list. This is 1739 ** just like sqlite3ResolveExprNames() except that it works for an expression 1740 ** list rather than a single expression. 1741 */ 1742 int sqlite3ResolveExprListNames( 1743 NameContext *pNC, /* Namespace to resolve expressions in. */ 1744 ExprList *pList /* The expression list to be analyzed. */ 1745 ){ 1746 int i; 1747 if( pList ){ 1748 for(i=0; i<pList->nExpr; i++){ 1749 if( sqlite3ResolveExprNames(pNC, pList->a[i].pExpr) ) return WRC_Abort; 1750 } 1751 } 1752 return WRC_Continue; 1753 } 1754 1755 /* 1756 ** Resolve all names in all expressions of a SELECT and in all 1757 ** decendents of the SELECT, including compounds off of p->pPrior, 1758 ** subqueries in expressions, and subqueries used as FROM clause 1759 ** terms. 1760 ** 1761 ** See sqlite3ResolveExprNames() for a description of the kinds of 1762 ** transformations that occur. 1763 ** 1764 ** All SELECT statements should have been expanded using 1765 ** sqlite3SelectExpand() prior to invoking this routine. 1766 */ 1767 void sqlite3ResolveSelectNames( 1768 Parse *pParse, /* The parser context */ 1769 Select *p, /* The SELECT statement being coded. */ 1770 NameContext *pOuterNC /* Name context for parent SELECT statement */ 1771 ){ 1772 Walker w; 1773 1774 assert( p!=0 ); 1775 w.xExprCallback = resolveExprStep; 1776 w.xSelectCallback = resolveSelectStep; 1777 w.xSelectCallback2 = 0; 1778 w.pParse = pParse; 1779 w.u.pNC = pOuterNC; 1780 sqlite3WalkSelect(&w, p); 1781 } 1782 1783 /* 1784 ** Resolve names in expressions that can only reference a single table 1785 ** or which cannot reference any tables at all. Examples: 1786 ** 1787 ** (1) CHECK constraints 1788 ** (2) WHERE clauses on partial indices 1789 ** (3) Expressions in indexes on expressions 1790 ** (4) Expression arguments to VACUUM INTO. 1791 ** 1792 ** In all cases except (4), the Expr.iTable value for Expr.op==TK_COLUMN 1793 ** nodes of the expression is set to -1 and the Expr.iColumn value is 1794 ** set to the column number. In case (4), TK_COLUMN nodes cause an error. 1795 ** 1796 ** Any errors cause an error message to be set in pParse. 1797 */ 1798 int sqlite3ResolveSelfReference( 1799 Parse *pParse, /* Parsing context */ 1800 Table *pTab, /* The table being referenced, or NULL */ 1801 int type, /* NC_IsCheck or NC_PartIdx or NC_IdxExpr, or 0 */ 1802 Expr *pExpr, /* Expression to resolve. May be NULL. */ 1803 ExprList *pList /* Expression list to resolve. May be NULL. */ 1804 ){ 1805 SrcList sSrc; /* Fake SrcList for pParse->pNewTable */ 1806 NameContext sNC; /* Name context for pParse->pNewTable */ 1807 int rc; 1808 1809 assert( type==0 || pTab!=0 ); 1810 assert( type==NC_IsCheck || type==NC_PartIdx || type==NC_IdxExpr || pTab==0 ); 1811 memset(&sNC, 0, sizeof(sNC)); 1812 memset(&sSrc, 0, sizeof(sSrc)); 1813 if( pTab ){ 1814 sSrc.nSrc = 1; 1815 sSrc.a[0].zName = pTab->zName; 1816 sSrc.a[0].pTab = pTab; 1817 sSrc.a[0].iCursor = -1; 1818 } 1819 sNC.pParse = pParse; 1820 sNC.pSrcList = &sSrc; 1821 sNC.ncFlags = type | NC_IsDDL; 1822 if( (rc = sqlite3ResolveExprNames(&sNC, pExpr))!=SQLITE_OK ) return rc; 1823 if( pList ) rc = sqlite3ResolveExprListNames(&sNC, pList); 1824 return rc; 1825 } 1826