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