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