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