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