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