blob: a1759374c9028640431c704590c3157c63b3c53f [file] [log] [blame]
drhcce7d172000-05-31 15:34:51 +00001/*
drhb19a2bc2001-09-16 00:13:26 +00002** 2001 September 15
drhcce7d172000-05-31 15:34:51 +00003**
drhb19a2bc2001-09-16 00:13:26 +00004** The author disclaims copyright to this source code. In place of
5** a legal notice, here is a blessing:
drhcce7d172000-05-31 15:34:51 +00006**
drhb19a2bc2001-09-16 00:13:26 +00007** 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.
drhcce7d172000-05-31 15:34:51 +000010**
11*************************************************************************
drh1ccde152000-06-17 13:12:39 +000012** This file contains routines used for analyzing expressions and
drhb19a2bc2001-09-16 00:13:26 +000013** for generating VDBE code that evaluates expressions in SQLite.
drhcce7d172000-05-31 15:34:51 +000014*/
15#include "sqliteInt.h"
drha2e00042002-01-22 03:13:42 +000016
danielk1977e014a832004-05-17 10:48:57 +000017/*
18** Return the 'affinity' of the expression pExpr if any.
19**
20** If pExpr is a column, a reference to a column via an 'AS' alias,
21** or a sub-select with a column as the return value, then the
22** affinity of that column is returned. Otherwise, 0x00 is returned,
23** indicating no affinity for the expression.
24**
peter.d.reid60ec9142014-09-06 16:39:46 +000025** i.e. the WHERE clause expressions in the following statements all
danielk1977e014a832004-05-17 10:48:57 +000026** have an affinity:
27**
28** CREATE TABLE t1(a);
29** SELECT * FROM t1 WHERE a;
30** SELECT a AS b FROM t1 WHERE b;
31** SELECT * FROM t1 WHERE (select a from t1);
32*/
danielk1977bf3b7212004-05-18 10:06:24 +000033char sqlite3ExprAffinity(Expr *pExpr){
drh580c8c12012-12-08 03:34:04 +000034 int op;
35 pExpr = sqlite3ExprSkipCollate(pExpr);
mistachkin9bec6fb2014-06-26 21:28:21 +000036 if( pExpr->flags & EP_Generic ) return 0;
drh580c8c12012-12-08 03:34:04 +000037 op = pExpr->op;
drh487e2622005-06-25 18:42:14 +000038 if( op==TK_SELECT ){
danielk19776ab3a2e2009-02-19 14:39:25 +000039 assert( pExpr->flags&EP_xIsSelect );
40 return sqlite3ExprAffinity(pExpr->x.pSelect->pEList->a[0].pExpr);
danielk1977a37cdde2004-05-16 11:15:36 +000041 }
drh487e2622005-06-25 18:42:14 +000042#ifndef SQLITE_OMIT_CAST
43 if( op==TK_CAST ){
drh33e619f2009-05-28 01:00:55 +000044 assert( !ExprHasProperty(pExpr, EP_IntValue) );
drhfdaac672013-10-04 15:30:21 +000045 return sqlite3AffinityType(pExpr->u.zToken, 0);
drh487e2622005-06-25 18:42:14 +000046 }
47#endif
danielk1977259a4552008-11-12 08:07:12 +000048 if( (op==TK_AGG_COLUMN || op==TK_COLUMN || op==TK_REGISTER)
49 && pExpr->pTab!=0
50 ){
drh7d10d5a2008-08-20 16:35:10 +000051 /* op==TK_REGISTER && pExpr->pTab!=0 happens when pExpr was originally
52 ** a TK_COLUMN but was previously evaluated and cached in a register */
53 int j = pExpr->iColumn;
54 if( j<0 ) return SQLITE_AFF_INTEGER;
55 assert( pExpr->pTab && j<pExpr->pTab->nCol );
56 return pExpr->pTab->aCol[j].affinity;
57 }
danielk1977a37cdde2004-05-16 11:15:36 +000058 return pExpr->affinity;
59}
60
drh53db1452004-05-20 13:54:53 +000061/*
drh8b4c40d2007-02-01 23:02:45 +000062** Set the collating sequence for expression pExpr to be the collating
drhae80dde2012-12-06 21:16:43 +000063** sequence named by pToken. Return a pointer to a new Expr node that
64** implements the COLLATE operator.
drh0a8a4062012-12-07 18:38:16 +000065**
66** If a memory allocation error occurs, that fact is recorded in pParse->db
67** and the pExpr parameter is returned unchanged.
drh8b4c40d2007-02-01 23:02:45 +000068*/
drh4ef7efa2014-03-20 15:14:08 +000069Expr *sqlite3ExprAddCollateToken(
70 Parse *pParse, /* Parsing context */
71 Expr *pExpr, /* Add the "COLLATE" clause to this expression */
72 const Token *pCollName /* Name of collating sequence */
73){
drh0a8a4062012-12-07 18:38:16 +000074 if( pCollName->n>0 ){
75 Expr *pNew = sqlite3ExprAlloc(pParse->db, TK_COLLATE, pCollName, 1);
76 if( pNew ){
77 pNew->pLeft = pExpr;
drha4c3c872013-09-12 17:29:25 +000078 pNew->flags |= EP_Collate|EP_Skip;
drh0a8a4062012-12-07 18:38:16 +000079 pExpr = pNew;
80 }
drhae80dde2012-12-06 21:16:43 +000081 }
drh0a8a4062012-12-07 18:38:16 +000082 return pExpr;
83}
84Expr *sqlite3ExprAddCollateString(Parse *pParse, Expr *pExpr, const char *zC){
drh261d8a52012-12-08 21:36:26 +000085 Token s;
86 assert( zC!=0 );
87 s.z = zC;
88 s.n = sqlite3Strlen30(s.z);
89 return sqlite3ExprAddCollateToken(pParse, pExpr, &s);
drh0a8a4062012-12-07 18:38:16 +000090}
91
92/*
drha4c3c872013-09-12 17:29:25 +000093** Skip over any TK_COLLATE or TK_AS operators and any unlikely()
94** or likelihood() function at the root of an expression.
drh0a8a4062012-12-07 18:38:16 +000095*/
96Expr *sqlite3ExprSkipCollate(Expr *pExpr){
drha4c3c872013-09-12 17:29:25 +000097 while( pExpr && ExprHasProperty(pExpr, EP_Skip) ){
98 if( ExprHasProperty(pExpr, EP_Unlikely) ){
drhcca9f3d2013-09-06 15:23:29 +000099 assert( !ExprHasProperty(pExpr, EP_xIsSelect) );
100 assert( pExpr->x.pList->nExpr>0 );
drha4c3c872013-09-12 17:29:25 +0000101 assert( pExpr->op==TK_FUNCTION );
drhcca9f3d2013-09-06 15:23:29 +0000102 pExpr = pExpr->x.pList->a[0].pExpr;
103 }else{
drha4c3c872013-09-12 17:29:25 +0000104 assert( pExpr->op==TK_COLLATE || pExpr->op==TK_AS );
105 pExpr = pExpr->pLeft;
drhcca9f3d2013-09-06 15:23:29 +0000106 }
drha4c3c872013-09-12 17:29:25 +0000107 }
drh0a8a4062012-12-07 18:38:16 +0000108 return pExpr;
drh8b4c40d2007-02-01 23:02:45 +0000109}
110
111/*
drhae80dde2012-12-06 21:16:43 +0000112** Return the collation sequence for the expression pExpr. If
113** there is no defined collating sequence, return NULL.
114**
115** The collating sequence might be determined by a COLLATE operator
116** or by the presence of a column with a defined collating sequence.
117** COLLATE operators take first precedence. Left operands take
118** precedence over right operands.
danielk19770202b292004-06-09 09:55:16 +0000119*/
danielk19777cedc8d2004-06-10 10:50:08 +0000120CollSeq *sqlite3ExprCollSeq(Parse *pParse, Expr *pExpr){
drhae80dde2012-12-06 21:16:43 +0000121 sqlite3 *db = pParse->db;
danielk19777cedc8d2004-06-10 10:50:08 +0000122 CollSeq *pColl = 0;
drh7d10d5a2008-08-20 16:35:10 +0000123 Expr *p = pExpr;
drh261d8a52012-12-08 21:36:26 +0000124 while( p ){
drhae80dde2012-12-06 21:16:43 +0000125 int op = p->op;
drhfbb24d12014-03-20 17:03:30 +0000126 if( p->flags & EP_Generic ) break;
drhae80dde2012-12-06 21:16:43 +0000127 if( op==TK_CAST || op==TK_UPLUS ){
128 p = p->pLeft;
129 continue;
130 }
dan36e78302013-08-21 12:04:32 +0000131 if( op==TK_COLLATE || (op==TK_REGISTER && p->op2==TK_COLLATE) ){
drh6fdd3d82013-05-15 17:47:12 +0000132 pColl = sqlite3GetCollSeq(pParse, ENC(db), 0, p->u.zToken);
drhae80dde2012-12-06 21:16:43 +0000133 break;
134 }
135 if( p->pTab!=0
136 && (op==TK_AGG_COLUMN || op==TK_COLUMN
137 || op==TK_REGISTER || op==TK_TRIGGER)
138 ){
drh7d10d5a2008-08-20 16:35:10 +0000139 /* op==TK_REGISTER && p->pTab!=0 happens when pExpr was originally
140 ** a TK_COLUMN but was previously evaluated and cached in a register */
drh7d10d5a2008-08-20 16:35:10 +0000141 int j = p->iColumn;
142 if( j>=0 ){
drhae80dde2012-12-06 21:16:43 +0000143 const char *zColl = p->pTab->aCol[j].zColl;
drhc4a64fa2009-05-11 20:53:28 +0000144 pColl = sqlite3FindCollSeq(db, ENC(db), zColl, 0);
drh7d10d5a2008-08-20 16:35:10 +0000145 }
146 break;
danielk19770202b292004-06-09 09:55:16 +0000147 }
drhae80dde2012-12-06 21:16:43 +0000148 if( p->flags & EP_Collate ){
drh261d8a52012-12-08 21:36:26 +0000149 if( ALWAYS(p->pLeft) && (p->pLeft->flags & EP_Collate)!=0 ){
drhae80dde2012-12-06 21:16:43 +0000150 p = p->pLeft;
151 }else{
152 p = p->pRight;
153 }
154 }else{
drh7d10d5a2008-08-20 16:35:10 +0000155 break;
156 }
danielk19770202b292004-06-09 09:55:16 +0000157 }
danielk19777cedc8d2004-06-10 10:50:08 +0000158 if( sqlite3CheckCollSeq(pParse, pColl) ){
159 pColl = 0;
160 }
161 return pColl;
danielk19770202b292004-06-09 09:55:16 +0000162}
163
164/*
drh626a8792005-01-17 22:08:19 +0000165** pExpr is an operand of a comparison operator. aff2 is the
166** type affinity of the other operand. This routine returns the
drh53db1452004-05-20 13:54:53 +0000167** type affinity that should be used for the comparison operator.
168*/
danielk1977e014a832004-05-17 10:48:57 +0000169char sqlite3CompareAffinity(Expr *pExpr, char aff2){
danielk1977bf3b7212004-05-18 10:06:24 +0000170 char aff1 = sqlite3ExprAffinity(pExpr);
danielk1977e014a832004-05-17 10:48:57 +0000171 if( aff1 && aff2 ){
drh8df447f2005-11-01 15:48:24 +0000172 /* Both sides of the comparison are columns. If one has numeric
173 ** affinity, use that. Otherwise use no affinity.
danielk1977e014a832004-05-17 10:48:57 +0000174 */
drh8a512562005-11-14 22:29:05 +0000175 if( sqlite3IsNumericAffinity(aff1) || sqlite3IsNumericAffinity(aff2) ){
danielk1977e014a832004-05-17 10:48:57 +0000176 return SQLITE_AFF_NUMERIC;
177 }else{
178 return SQLITE_AFF_NONE;
179 }
180 }else if( !aff1 && !aff2 ){
drh5f6a87b2004-07-19 00:39:45 +0000181 /* Neither side of the comparison is a column. Compare the
182 ** results directly.
danielk1977e014a832004-05-17 10:48:57 +0000183 */
drh5f6a87b2004-07-19 00:39:45 +0000184 return SQLITE_AFF_NONE;
danielk1977e014a832004-05-17 10:48:57 +0000185 }else{
186 /* One side is a column, the other is not. Use the columns affinity. */
drhfe05af82005-07-21 03:14:59 +0000187 assert( aff1==0 || aff2==0 );
danielk1977e014a832004-05-17 10:48:57 +0000188 return (aff1 + aff2);
189 }
190}
191
drh53db1452004-05-20 13:54:53 +0000192/*
193** pExpr is a comparison operator. Return the type affinity that should
194** be applied to both operands prior to doing the comparison.
195*/
danielk1977e014a832004-05-17 10:48:57 +0000196static char comparisonAffinity(Expr *pExpr){
197 char aff;
198 assert( pExpr->op==TK_EQ || pExpr->op==TK_IN || pExpr->op==TK_LT ||
199 pExpr->op==TK_GT || pExpr->op==TK_GE || pExpr->op==TK_LE ||
drh6a2fe092009-09-23 02:29:36 +0000200 pExpr->op==TK_NE || pExpr->op==TK_IS || pExpr->op==TK_ISNOT );
danielk1977e014a832004-05-17 10:48:57 +0000201 assert( pExpr->pLeft );
danielk1977bf3b7212004-05-18 10:06:24 +0000202 aff = sqlite3ExprAffinity(pExpr->pLeft);
danielk1977e014a832004-05-17 10:48:57 +0000203 if( pExpr->pRight ){
204 aff = sqlite3CompareAffinity(pExpr->pRight, aff);
danielk19776ab3a2e2009-02-19 14:39:25 +0000205 }else if( ExprHasProperty(pExpr, EP_xIsSelect) ){
206 aff = sqlite3CompareAffinity(pExpr->x.pSelect->pEList->a[0].pExpr, aff);
207 }else if( !aff ){
drhde087bd2007-02-23 03:00:44 +0000208 aff = SQLITE_AFF_NONE;
danielk1977e014a832004-05-17 10:48:57 +0000209 }
210 return aff;
211}
212
213/*
214** pExpr is a comparison expression, eg. '=', '<', IN(...) etc.
215** idx_affinity is the affinity of an indexed column. Return true
216** if the index with affinity idx_affinity may be used to implement
217** the comparison in pExpr.
218*/
219int sqlite3IndexAffinityOk(Expr *pExpr, char idx_affinity){
220 char aff = comparisonAffinity(pExpr);
drh8a512562005-11-14 22:29:05 +0000221 switch( aff ){
222 case SQLITE_AFF_NONE:
223 return 1;
224 case SQLITE_AFF_TEXT:
225 return idx_affinity==SQLITE_AFF_TEXT;
226 default:
227 return sqlite3IsNumericAffinity(idx_affinity);
228 }
danielk1977e014a832004-05-17 10:48:57 +0000229}
230
danielk1977a37cdde2004-05-16 11:15:36 +0000231/*
drh35573352008-01-08 23:54:25 +0000232** Return the P5 value that should be used for a binary comparison
danielk1977a37cdde2004-05-16 11:15:36 +0000233** opcode (OP_Eq, OP_Ge etc.) used to compare pExpr1 and pExpr2.
danielk1977a37cdde2004-05-16 11:15:36 +0000234*/
drh35573352008-01-08 23:54:25 +0000235static u8 binaryCompareP5(Expr *pExpr1, Expr *pExpr2, int jumpIfNull){
236 u8 aff = (char)sqlite3ExprAffinity(pExpr2);
drh1bd10f82008-12-10 21:19:56 +0000237 aff = (u8)sqlite3CompareAffinity(pExpr1, aff) | (u8)jumpIfNull;
drh35573352008-01-08 23:54:25 +0000238 return aff;
danielk1977a37cdde2004-05-16 11:15:36 +0000239}
240
drha2e00042002-01-22 03:13:42 +0000241/*
danielk19770202b292004-06-09 09:55:16 +0000242** Return a pointer to the collation sequence that should be used by
243** a binary comparison operator comparing pLeft and pRight.
244**
245** If the left hand expression has a collating sequence type, then it is
246** used. Otherwise the collation sequence for the right hand expression
247** is used, or the default (BINARY) if neither expression has a collating
248** type.
danielk1977bcbb04e2007-05-29 12:11:29 +0000249**
250** Argument pRight (but not pLeft) may be a null pointer. In this case,
251** it is not considered.
danielk19770202b292004-06-09 09:55:16 +0000252*/
drh0a0e1312007-08-07 17:04:59 +0000253CollSeq *sqlite3BinaryCompareCollSeq(
danielk1977bcbb04e2007-05-29 12:11:29 +0000254 Parse *pParse,
255 Expr *pLeft,
256 Expr *pRight
257){
drhec41dda2007-02-07 13:09:45 +0000258 CollSeq *pColl;
259 assert( pLeft );
drhae80dde2012-12-06 21:16:43 +0000260 if( pLeft->flags & EP_Collate ){
261 pColl = sqlite3ExprCollSeq(pParse, pLeft);
262 }else if( pRight && (pRight->flags & EP_Collate)!=0 ){
263 pColl = sqlite3ExprCollSeq(pParse, pRight);
drhec41dda2007-02-07 13:09:45 +0000264 }else{
265 pColl = sqlite3ExprCollSeq(pParse, pLeft);
266 if( !pColl ){
267 pColl = sqlite3ExprCollSeq(pParse, pRight);
268 }
danielk19770202b292004-06-09 09:55:16 +0000269 }
270 return pColl;
271}
272
273/*
drhbe5c89a2004-07-26 00:31:09 +0000274** Generate code for a comparison operator.
275*/
276static int codeCompare(
277 Parse *pParse, /* The parsing (and code generating) context */
278 Expr *pLeft, /* The left operand */
279 Expr *pRight, /* The right operand */
280 int opcode, /* The comparison opcode */
drh35573352008-01-08 23:54:25 +0000281 int in1, int in2, /* Register holding operands */
drhbe5c89a2004-07-26 00:31:09 +0000282 int dest, /* Jump here if true. */
283 int jumpIfNull /* If true, jump if either operand is NULL */
284){
drh35573352008-01-08 23:54:25 +0000285 int p5;
286 int addr;
287 CollSeq *p4;
288
289 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
290 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
291 addr = sqlite3VdbeAddOp4(pParse->pVdbe, opcode, in2, dest, in1,
292 (void*)p4, P4_COLLSEQ);
drh1bd10f82008-12-10 21:19:56 +0000293 sqlite3VdbeChangeP5(pParse->pVdbe, (u8)p5);
drh35573352008-01-08 23:54:25 +0000294 return addr;
drhbe5c89a2004-07-26 00:31:09 +0000295}
296
danielk19774b5255a2008-06-05 16:47:39 +0000297#if SQLITE_MAX_EXPR_DEPTH>0
298/*
299** Check that argument nHeight is less than or equal to the maximum
300** expression depth allowed. If it is not, leave an error message in
301** pParse.
302*/
drh7d10d5a2008-08-20 16:35:10 +0000303int sqlite3ExprCheckHeight(Parse *pParse, int nHeight){
danielk19774b5255a2008-06-05 16:47:39 +0000304 int rc = SQLITE_OK;
305 int mxHeight = pParse->db->aLimit[SQLITE_LIMIT_EXPR_DEPTH];
306 if( nHeight>mxHeight ){
307 sqlite3ErrorMsg(pParse,
308 "Expression tree is too large (maximum depth %d)", mxHeight
309 );
310 rc = SQLITE_ERROR;
311 }
312 return rc;
313}
314
315/* The following three functions, heightOfExpr(), heightOfExprList()
316** and heightOfSelect(), are used to determine the maximum height
317** of any expression tree referenced by the structure passed as the
318** first argument.
319**
320** If this maximum height is greater than the current value pointed
321** to by pnHeight, the second parameter, then set *pnHeight to that
322** value.
323*/
324static void heightOfExpr(Expr *p, int *pnHeight){
325 if( p ){
326 if( p->nHeight>*pnHeight ){
327 *pnHeight = p->nHeight;
328 }
329 }
330}
331static void heightOfExprList(ExprList *p, int *pnHeight){
332 if( p ){
333 int i;
334 for(i=0; i<p->nExpr; i++){
335 heightOfExpr(p->a[i].pExpr, pnHeight);
336 }
337 }
338}
339static void heightOfSelect(Select *p, int *pnHeight){
340 if( p ){
341 heightOfExpr(p->pWhere, pnHeight);
342 heightOfExpr(p->pHaving, pnHeight);
343 heightOfExpr(p->pLimit, pnHeight);
344 heightOfExpr(p->pOffset, pnHeight);
345 heightOfExprList(p->pEList, pnHeight);
346 heightOfExprList(p->pGroupBy, pnHeight);
347 heightOfExprList(p->pOrderBy, pnHeight);
348 heightOfSelect(p->pPrior, pnHeight);
349 }
350}
351
352/*
353** Set the Expr.nHeight variable in the structure passed as an
354** argument. An expression with no children, Expr.pList or
355** Expr.pSelect member has a height of 1. Any other expression
356** has a height equal to the maximum height of any other
357** referenced Expr plus one.
358*/
359static void exprSetHeight(Expr *p){
360 int nHeight = 0;
361 heightOfExpr(p->pLeft, &nHeight);
362 heightOfExpr(p->pRight, &nHeight);
danielk19776ab3a2e2009-02-19 14:39:25 +0000363 if( ExprHasProperty(p, EP_xIsSelect) ){
364 heightOfSelect(p->x.pSelect, &nHeight);
365 }else{
366 heightOfExprList(p->x.pList, &nHeight);
367 }
danielk19774b5255a2008-06-05 16:47:39 +0000368 p->nHeight = nHeight + 1;
369}
370
371/*
372** Set the Expr.nHeight variable using the exprSetHeight() function. If
373** the height is greater than the maximum allowed expression depth,
374** leave an error in pParse.
375*/
376void sqlite3ExprSetHeight(Parse *pParse, Expr *p){
377 exprSetHeight(p);
drh7d10d5a2008-08-20 16:35:10 +0000378 sqlite3ExprCheckHeight(pParse, p->nHeight);
danielk19774b5255a2008-06-05 16:47:39 +0000379}
380
381/*
382** Return the maximum height of any expression tree referenced
383** by the select statement passed as an argument.
384*/
385int sqlite3SelectExprHeight(Select *p){
386 int nHeight = 0;
387 heightOfSelect(p, &nHeight);
388 return nHeight;
389}
390#else
danielk19774b5255a2008-06-05 16:47:39 +0000391 #define exprSetHeight(y)
392#endif /* SQLITE_MAX_EXPR_DEPTH>0 */
393
drhbe5c89a2004-07-26 00:31:09 +0000394/*
drhb7916a72009-05-27 10:31:29 +0000395** This routine is the core allocator for Expr nodes.
396**
drha76b5df2002-02-23 02:32:10 +0000397** Construct a new expression node and return a pointer to it. Memory
drhb7916a72009-05-27 10:31:29 +0000398** for this node and for the pToken argument is a single allocation
399** obtained from sqlite3DbMalloc(). The calling function
drha76b5df2002-02-23 02:32:10 +0000400** is responsible for making sure the node eventually gets freed.
drhb7916a72009-05-27 10:31:29 +0000401**
402** If dequote is true, then the token (if it exists) is dequoted.
403** If dequote is false, no dequoting is performance. The deQuote
404** parameter is ignored if pToken is NULL or if the token does not
405** appear to be quoted. If the quotes were of the form "..." (double-quotes)
406** then the EP_DblQuoted flag is set on the expression node.
drh33e619f2009-05-28 01:00:55 +0000407**
408** Special case: If op==TK_INTEGER and pToken points to a string that
409** can be translated into a 32-bit integer, then the token is not
410** stored in u.zToken. Instead, the integer values is written
411** into u.iValue and the EP_IntValue flag is set. No extra storage
412** is allocated to hold the integer text and the dequote flag is ignored.
drha76b5df2002-02-23 02:32:10 +0000413*/
drhb7916a72009-05-27 10:31:29 +0000414Expr *sqlite3ExprAlloc(
danielk1977a1644fd2007-08-29 12:31:25 +0000415 sqlite3 *db, /* Handle for sqlite3DbMallocZero() (may be null) */
drh17435752007-08-16 04:30:38 +0000416 int op, /* Expression opcode */
drhb7916a72009-05-27 10:31:29 +0000417 const Token *pToken, /* Token argument. Might be NULL */
418 int dequote /* True to dequote */
drh17435752007-08-16 04:30:38 +0000419){
drha76b5df2002-02-23 02:32:10 +0000420 Expr *pNew;
drh33e619f2009-05-28 01:00:55 +0000421 int nExtra = 0;
shanecf697392009-06-01 16:53:09 +0000422 int iValue = 0;
danielk1977fc976062007-05-10 10:46:56 +0000423
drhb7916a72009-05-27 10:31:29 +0000424 if( pToken ){
drh33e619f2009-05-28 01:00:55 +0000425 if( op!=TK_INTEGER || pToken->z==0
426 || sqlite3GetInt32(pToken->z, &iValue)==0 ){
427 nExtra = pToken->n+1;
drhd50ffc42011-03-08 02:38:28 +0000428 assert( iValue>=0 );
drh33e619f2009-05-28 01:00:55 +0000429 }
drhb7916a72009-05-27 10:31:29 +0000430 }
431 pNew = sqlite3DbMallocZero(db, sizeof(Expr)+nExtra);
432 if( pNew ){
433 pNew->op = (u8)op;
434 pNew->iAgg = -1;
435 if( pToken ){
drh33e619f2009-05-28 01:00:55 +0000436 if( nExtra==0 ){
437 pNew->flags |= EP_IntValue;
438 pNew->u.iValue = iValue;
439 }else{
440 int c;
441 pNew->u.zToken = (char*)&pNew[1];
drhb07028f2011-10-14 21:49:18 +0000442 assert( pToken->z!=0 || pToken->n==0 );
443 if( pToken->n ) memcpy(pNew->u.zToken, pToken->z, pToken->n);
drh33e619f2009-05-28 01:00:55 +0000444 pNew->u.zToken[pToken->n] = 0;
445 if( dequote && nExtra>=3
446 && ((c = pToken->z[0])=='\'' || c=='"' || c=='[' || c=='`') ){
447 sqlite3Dequote(pNew->u.zToken);
448 if( c=='"' ) pNew->flags |= EP_DblQuoted;
449 }
drhb7916a72009-05-27 10:31:29 +0000450 }
451 }
452#if SQLITE_MAX_EXPR_DEPTH>0
453 pNew->nHeight = 1;
454#endif
455 }
drha76b5df2002-02-23 02:32:10 +0000456 return pNew;
457}
458
459/*
drhb7916a72009-05-27 10:31:29 +0000460** Allocate a new expression node from a zero-terminated token that has
461** already been dequoted.
462*/
463Expr *sqlite3Expr(
464 sqlite3 *db, /* Handle for sqlite3DbMallocZero() (may be null) */
465 int op, /* Expression opcode */
466 const char *zToken /* Token argument. Might be NULL */
467){
468 Token x;
469 x.z = zToken;
470 x.n = zToken ? sqlite3Strlen30(zToken) : 0;
471 return sqlite3ExprAlloc(db, op, &x, 0);
472}
473
474/*
475** Attach subtrees pLeft and pRight to the Expr node pRoot.
476**
477** If pRoot==NULL that means that a memory allocation error has occurred.
478** In that case, delete the subtrees pLeft and pRight.
479*/
480void sqlite3ExprAttachSubtrees(
481 sqlite3 *db,
482 Expr *pRoot,
483 Expr *pLeft,
484 Expr *pRight
485){
486 if( pRoot==0 ){
487 assert( db->mallocFailed );
488 sqlite3ExprDelete(db, pLeft);
489 sqlite3ExprDelete(db, pRight);
490 }else{
491 if( pRight ){
492 pRoot->pRight = pRight;
drhae80dde2012-12-06 21:16:43 +0000493 pRoot->flags |= EP_Collate & pRight->flags;
drhb7916a72009-05-27 10:31:29 +0000494 }
495 if( pLeft ){
496 pRoot->pLeft = pLeft;
drhae80dde2012-12-06 21:16:43 +0000497 pRoot->flags |= EP_Collate & pLeft->flags;
drhb7916a72009-05-27 10:31:29 +0000498 }
499 exprSetHeight(pRoot);
500 }
501}
502
503/*
peter.d.reid60ec9142014-09-06 16:39:46 +0000504** Allocate an Expr node which joins as many as two subtrees.
drhb7916a72009-05-27 10:31:29 +0000505**
drhbf664462009-06-19 18:32:54 +0000506** One or both of the subtrees can be NULL. Return a pointer to the new
507** Expr node. Or, if an OOM error occurs, set pParse->db->mallocFailed,
508** free the subtrees and return NULL.
drh206f3d92006-07-11 13:15:08 +0000509*/
drh17435752007-08-16 04:30:38 +0000510Expr *sqlite3PExpr(
511 Parse *pParse, /* Parsing context */
512 int op, /* Expression opcode */
513 Expr *pLeft, /* Left operand */
514 Expr *pRight, /* Right operand */
515 const Token *pToken /* Argument token */
516){
drh5fb52ca2012-03-31 02:34:35 +0000517 Expr *p;
518 if( op==TK_AND && pLeft && pRight ){
519 /* Take advantage of short-circuit false optimization for AND */
520 p = sqlite3ExprAnd(pParse->db, pLeft, pRight);
521 }else{
522 p = sqlite3ExprAlloc(pParse->db, op, pToken, 1);
523 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
524 }
dan2b359bd2010-10-28 11:31:23 +0000525 if( p ) {
526 sqlite3ExprCheckHeight(pParse, p->nHeight);
527 }
drh4e0cff62004-11-05 05:10:28 +0000528 return p;
529}
530
531/*
drh991a1982014-01-02 17:57:16 +0000532** If the expression is always either TRUE or FALSE (respectively),
533** then return 1. If one cannot determine the truth value of the
534** expression at compile-time return 0.
535**
536** This is an optimization. If is OK to return 0 here even if
537** the expression really is always false or false (a false negative).
538** But it is a bug to return 1 if the expression might have different
539** boolean values in different circumstances (a false positive.)
drh5fb52ca2012-03-31 02:34:35 +0000540**
541** Note that if the expression is part of conditional for a
542** LEFT JOIN, then we cannot determine at compile-time whether or not
543** is it true or false, so always return 0.
544*/
drh991a1982014-01-02 17:57:16 +0000545static int exprAlwaysTrue(Expr *p){
546 int v = 0;
547 if( ExprHasProperty(p, EP_FromJoin) ) return 0;
548 if( !sqlite3ExprIsInteger(p, &v) ) return 0;
549 return v!=0;
550}
drh5fb52ca2012-03-31 02:34:35 +0000551static int exprAlwaysFalse(Expr *p){
552 int v = 0;
553 if( ExprHasProperty(p, EP_FromJoin) ) return 0;
554 if( !sqlite3ExprIsInteger(p, &v) ) return 0;
555 return v==0;
556}
557
558/*
drh91bb0ee2004-09-01 03:06:34 +0000559** Join two expressions using an AND operator. If either expression is
560** NULL, then just return the other expression.
drh5fb52ca2012-03-31 02:34:35 +0000561**
562** If one side or the other of the AND is known to be false, then instead
563** of returning an AND expression, just return a constant expression with
564** a value of false.
drh91bb0ee2004-09-01 03:06:34 +0000565*/
danielk19771e536952007-08-16 10:09:01 +0000566Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
drh91bb0ee2004-09-01 03:06:34 +0000567 if( pLeft==0 ){
568 return pRight;
569 }else if( pRight==0 ){
570 return pLeft;
drh5fb52ca2012-03-31 02:34:35 +0000571 }else if( exprAlwaysFalse(pLeft) || exprAlwaysFalse(pRight) ){
572 sqlite3ExprDelete(db, pLeft);
573 sqlite3ExprDelete(db, pRight);
574 return sqlite3ExprAlloc(db, TK_INTEGER, &sqlite3IntTokens[0], 0);
drh91bb0ee2004-09-01 03:06:34 +0000575 }else{
drhb7916a72009-05-27 10:31:29 +0000576 Expr *pNew = sqlite3ExprAlloc(db, TK_AND, 0, 0);
577 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
578 return pNew;
drha76b5df2002-02-23 02:32:10 +0000579 }
580}
581
582/*
583** Construct a new expression node for a function with multiple
584** arguments.
585*/
drh17435752007-08-16 04:30:38 +0000586Expr *sqlite3ExprFunction(Parse *pParse, ExprList *pList, Token *pToken){
drha76b5df2002-02-23 02:32:10 +0000587 Expr *pNew;
drh633e6d52008-07-28 19:34:53 +0000588 sqlite3 *db = pParse->db;
danielk19774b202ae2006-01-23 05:50:58 +0000589 assert( pToken );
drhb7916a72009-05-27 10:31:29 +0000590 pNew = sqlite3ExprAlloc(db, TK_FUNCTION, pToken, 1);
drha76b5df2002-02-23 02:32:10 +0000591 if( pNew==0 ){
drhd9da78a2009-03-24 15:08:09 +0000592 sqlite3ExprListDelete(db, pList); /* Avoid memory leak when malloc fails */
drha76b5df2002-02-23 02:32:10 +0000593 return 0;
594 }
danielk19776ab3a2e2009-02-19 14:39:25 +0000595 pNew->x.pList = pList;
596 assert( !ExprHasProperty(pNew, EP_xIsSelect) );
danielk19774b5255a2008-06-05 16:47:39 +0000597 sqlite3ExprSetHeight(pParse, pNew);
drha76b5df2002-02-23 02:32:10 +0000598 return pNew;
599}
600
601/*
drhfa6bc002004-09-07 16:19:52 +0000602** Assign a variable number to an expression that encodes a wildcard
603** in the original SQL statement.
604**
605** Wildcards consisting of a single "?" are assigned the next sequential
606** variable number.
607**
608** Wildcards of the form "?nnn" are assigned the number "nnn". We make
609** sure "nnn" is not too be to avoid a denial of service attack when
610** the SQL statement comes from an external source.
611**
drh51f49f12009-05-21 20:41:32 +0000612** Wildcards of the form ":aaa", "@aaa", or "$aaa" are assigned the same number
drhfa6bc002004-09-07 16:19:52 +0000613** as the previous instance of the same wildcard. Or if this is the first
peter.d.reid60ec9142014-09-06 16:39:46 +0000614** instance of the wildcard, the next sequential variable number is
drhfa6bc002004-09-07 16:19:52 +0000615** assigned.
616*/
617void sqlite3ExprAssignVarNumber(Parse *pParse, Expr *pExpr){
drh17435752007-08-16 04:30:38 +0000618 sqlite3 *db = pParse->db;
drhb7916a72009-05-27 10:31:29 +0000619 const char *z;
drh17435752007-08-16 04:30:38 +0000620
drhfa6bc002004-09-07 16:19:52 +0000621 if( pExpr==0 ) return;
drhc5cd1242013-09-12 16:50:49 +0000622 assert( !ExprHasProperty(pExpr, EP_IntValue|EP_Reduced|EP_TokenOnly) );
drh33e619f2009-05-28 01:00:55 +0000623 z = pExpr->u.zToken;
drhb7916a72009-05-27 10:31:29 +0000624 assert( z!=0 );
625 assert( z[0]!=0 );
626 if( z[1]==0 ){
drhfa6bc002004-09-07 16:19:52 +0000627 /* Wildcard of the form "?". Assign the next variable number */
drhb7916a72009-05-27 10:31:29 +0000628 assert( z[0]=='?' );
drh8677d302009-11-04 13:17:14 +0000629 pExpr->iColumn = (ynVar)(++pParse->nVar);
drhfa6bc002004-09-07 16:19:52 +0000630 }else{
drh124c0b42011-06-01 18:15:55 +0000631 ynVar x = 0;
632 u32 n = sqlite3Strlen30(z);
633 if( z[0]=='?' ){
634 /* Wildcard of the form "?nnn". Convert "nnn" to an integer and
635 ** use it as the variable number */
636 i64 i;
637 int bOk = 0==sqlite3Atoi64(&z[1], &i, n-1, SQLITE_UTF8);
638 pExpr->iColumn = x = (ynVar)i;
639 testcase( i==0 );
640 testcase( i==1 );
641 testcase( i==db->aLimit[SQLITE_LIMIT_VARIABLE_NUMBER]-1 );
642 testcase( i==db->aLimit[SQLITE_LIMIT_VARIABLE_NUMBER] );
643 if( bOk==0 || i<1 || i>db->aLimit[SQLITE_LIMIT_VARIABLE_NUMBER] ){
644 sqlite3ErrorMsg(pParse, "variable number must be between ?1 and ?%d",
645 db->aLimit[SQLITE_LIMIT_VARIABLE_NUMBER]);
646 x = 0;
drhfa6bc002004-09-07 16:19:52 +0000647 }
drh124c0b42011-06-01 18:15:55 +0000648 if( i>pParse->nVar ){
649 pParse->nVar = (int)i;
650 }
651 }else{
652 /* Wildcards like ":aaa", "$aaa" or "@aaa". Reuse the same variable
653 ** number as the prior appearance of the same name, or if the name
654 ** has never appeared before, reuse the same variable number
655 */
656 ynVar i;
657 for(i=0; i<pParse->nzVar; i++){
drh503a6862013-03-01 01:07:17 +0000658 if( pParse->azVar[i] && strcmp(pParse->azVar[i],z)==0 ){
drh124c0b42011-06-01 18:15:55 +0000659 pExpr->iColumn = x = (ynVar)i+1;
660 break;
661 }
662 }
663 if( x==0 ) x = pExpr->iColumn = (ynVar)(++pParse->nVar);
drhfa6bc002004-09-07 16:19:52 +0000664 }
drh124c0b42011-06-01 18:15:55 +0000665 if( x>0 ){
666 if( x>pParse->nzVar ){
667 char **a;
668 a = sqlite3DbRealloc(db, pParse->azVar, x*sizeof(a[0]));
669 if( a==0 ) return; /* Error reported through db->mallocFailed */
670 pParse->azVar = a;
671 memset(&a[pParse->nzVar], 0, (x-pParse->nzVar)*sizeof(a[0]));
672 pParse->nzVar = x;
drhfa6bc002004-09-07 16:19:52 +0000673 }
drh124c0b42011-06-01 18:15:55 +0000674 if( z[0]!='?' || pParse->azVar[x-1]==0 ){
675 sqlite3DbFree(db, pParse->azVar[x-1]);
676 pParse->azVar[x-1] = sqlite3DbStrNDup(db, z, n);
drhfa6bc002004-09-07 16:19:52 +0000677 }
678 }
679 }
drhbb4957f2008-03-20 14:03:29 +0000680 if( !pParse->nErr && pParse->nVar>db->aLimit[SQLITE_LIMIT_VARIABLE_NUMBER] ){
danielk1977832b2662007-05-09 11:37:22 +0000681 sqlite3ErrorMsg(pParse, "too many SQL variables");
682 }
drhfa6bc002004-09-07 16:19:52 +0000683}
684
685/*
danf6963f92009-11-23 14:39:14 +0000686** Recursively delete an expression tree.
drha2e00042002-01-22 03:13:42 +0000687*/
danf6963f92009-11-23 14:39:14 +0000688void sqlite3ExprDelete(sqlite3 *db, Expr *p){
689 if( p==0 ) return;
drhd50ffc42011-03-08 02:38:28 +0000690 /* Sanity check: Assert that the IntValue is non-negative if it exists */
691 assert( !ExprHasProperty(p, EP_IntValue) || p->u.iValue>=0 );
drhc5cd1242013-09-12 16:50:49 +0000692 if( !ExprHasProperty(p, EP_TokenOnly) ){
693 /* The Expr.x union is never used at the same time as Expr.pRight */
694 assert( p->x.pList==0 || p->pRight==0 );
drh33e619f2009-05-28 01:00:55 +0000695 sqlite3ExprDelete(db, p->pLeft);
696 sqlite3ExprDelete(db, p->pRight);
drhc5cd1242013-09-12 16:50:49 +0000697 if( ExprHasProperty(p, EP_MemToken) ) sqlite3DbFree(db, p->u.zToken);
danielk19776ab3a2e2009-02-19 14:39:25 +0000698 if( ExprHasProperty(p, EP_xIsSelect) ){
699 sqlite3SelectDelete(db, p->x.pSelect);
700 }else{
701 sqlite3ExprListDelete(db, p->x.pList);
702 }
703 }
drh33e619f2009-05-28 01:00:55 +0000704 if( !ExprHasProperty(p, EP_Static) ){
705 sqlite3DbFree(db, p);
706 }
drha2e00042002-01-22 03:13:42 +0000707}
708
drhd2687b72005-08-12 22:56:09 +0000709/*
danielk19776ab3a2e2009-02-19 14:39:25 +0000710** Return the number of bytes allocated for the expression structure
711** passed as the first argument. This is always one of EXPR_FULLSIZE,
712** EXPR_REDUCEDSIZE or EXPR_TOKENONLYSIZE.
713*/
714static int exprStructSize(Expr *p){
715 if( ExprHasProperty(p, EP_TokenOnly) ) return EXPR_TOKENONLYSIZE;
danielk19776ab3a2e2009-02-19 14:39:25 +0000716 if( ExprHasProperty(p, EP_Reduced) ) return EXPR_REDUCEDSIZE;
717 return EXPR_FULLSIZE;
718}
719
720/*
drh33e619f2009-05-28 01:00:55 +0000721** The dupedExpr*Size() routines each return the number of bytes required
722** to store a copy of an expression or expression tree. They differ in
723** how much of the tree is measured.
724**
725** dupedExprStructSize() Size of only the Expr structure
726** dupedExprNodeSize() Size of Expr + space for token
727** dupedExprSize() Expr + token + subtree components
728**
729***************************************************************************
730**
731** The dupedExprStructSize() function returns two values OR-ed together:
732** (1) the space required for a copy of the Expr structure only and
733** (2) the EP_xxx flags that indicate what the structure size should be.
734** The return values is always one of:
735**
736** EXPR_FULLSIZE
737** EXPR_REDUCEDSIZE | EP_Reduced
738** EXPR_TOKENONLYSIZE | EP_TokenOnly
739**
740** The size of the structure can be found by masking the return value
741** of this routine with 0xfff. The flags can be found by masking the
742** return value with EP_Reduced|EP_TokenOnly.
743**
744** Note that with flags==EXPRDUP_REDUCE, this routines works on full-size
745** (unreduced) Expr objects as they or originally constructed by the parser.
746** During expression analysis, extra information is computed and moved into
747** later parts of teh Expr object and that extra information might get chopped
748** off if the expression is reduced. Note also that it does not work to
peter.d.reid60ec9142014-09-06 16:39:46 +0000749** make an EXPRDUP_REDUCE copy of a reduced expression. It is only legal
drh33e619f2009-05-28 01:00:55 +0000750** to reduce a pristine expression tree from the parser. The implementation
751** of dupedExprStructSize() contain multiple assert() statements that attempt
752** to enforce this constraint.
danielk19776ab3a2e2009-02-19 14:39:25 +0000753*/
754static int dupedExprStructSize(Expr *p, int flags){
755 int nSize;
drh33e619f2009-05-28 01:00:55 +0000756 assert( flags==EXPRDUP_REDUCE || flags==0 ); /* Only one flag value allowed */
drhaecd8022013-09-13 18:15:15 +0000757 assert( EXPR_FULLSIZE<=0xfff );
758 assert( (0xfff & (EP_Reduced|EP_TokenOnly))==0 );
danielk19776ab3a2e2009-02-19 14:39:25 +0000759 if( 0==(flags&EXPRDUP_REDUCE) ){
760 nSize = EXPR_FULLSIZE;
danielk19776ab3a2e2009-02-19 14:39:25 +0000761 }else{
drhc5cd1242013-09-12 16:50:49 +0000762 assert( !ExprHasProperty(p, EP_TokenOnly|EP_Reduced) );
drh33e619f2009-05-28 01:00:55 +0000763 assert( !ExprHasProperty(p, EP_FromJoin) );
drhc5cd1242013-09-12 16:50:49 +0000764 assert( !ExprHasProperty(p, EP_MemToken) );
drhebb6a652013-09-12 23:42:22 +0000765 assert( !ExprHasProperty(p, EP_NoReduce) );
drhaecd8022013-09-13 18:15:15 +0000766 if( p->pLeft || p->x.pList ){
drh33e619f2009-05-28 01:00:55 +0000767 nSize = EXPR_REDUCEDSIZE | EP_Reduced;
768 }else{
drhaecd8022013-09-13 18:15:15 +0000769 assert( p->pRight==0 );
drh33e619f2009-05-28 01:00:55 +0000770 nSize = EXPR_TOKENONLYSIZE | EP_TokenOnly;
771 }
danielk19776ab3a2e2009-02-19 14:39:25 +0000772 }
773 return nSize;
774}
775
776/*
drh33e619f2009-05-28 01:00:55 +0000777** This function returns the space in bytes required to store the copy
778** of the Expr structure and a copy of the Expr.u.zToken string (if that
779** string is defined.)
danielk19776ab3a2e2009-02-19 14:39:25 +0000780*/
781static int dupedExprNodeSize(Expr *p, int flags){
drh33e619f2009-05-28 01:00:55 +0000782 int nByte = dupedExprStructSize(p, flags) & 0xfff;
783 if( !ExprHasProperty(p, EP_IntValue) && p->u.zToken ){
784 nByte += sqlite3Strlen30(p->u.zToken)+1;
danielk19776ab3a2e2009-02-19 14:39:25 +0000785 }
danielk1977bc739712009-03-23 04:33:32 +0000786 return ROUND8(nByte);
danielk19776ab3a2e2009-02-19 14:39:25 +0000787}
788
789/*
790** Return the number of bytes required to create a duplicate of the
791** expression passed as the first argument. The second argument is a
792** mask containing EXPRDUP_XXX flags.
793**
794** The value returned includes space to create a copy of the Expr struct
drh33e619f2009-05-28 01:00:55 +0000795** itself and the buffer referred to by Expr.u.zToken, if any.
danielk19776ab3a2e2009-02-19 14:39:25 +0000796**
797** If the EXPRDUP_REDUCE flag is set, then the return value includes
798** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
799** and Expr.pRight variables (but not for any structures pointed to or
800** descended from the Expr.x.pList or Expr.x.pSelect variables).
801*/
802static int dupedExprSize(Expr *p, int flags){
803 int nByte = 0;
804 if( p ){
805 nByte = dupedExprNodeSize(p, flags);
806 if( flags&EXPRDUP_REDUCE ){
drhb7916a72009-05-27 10:31:29 +0000807 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
danielk19776ab3a2e2009-02-19 14:39:25 +0000808 }
809 }
810 return nByte;
811}
812
813/*
814** This function is similar to sqlite3ExprDup(), except that if pzBuffer
815** is not NULL then *pzBuffer is assumed to point to a buffer large enough
drh33e619f2009-05-28 01:00:55 +0000816** to store the copy of expression p, the copies of p->u.zToken
danielk19776ab3a2e2009-02-19 14:39:25 +0000817** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
peter.d.reid60ec9142014-09-06 16:39:46 +0000818** if any. Before returning, *pzBuffer is set to the first byte past the
danielk19776ab3a2e2009-02-19 14:39:25 +0000819** portion of the buffer copied into by this function.
820*/
821static Expr *exprDup(sqlite3 *db, Expr *p, int flags, u8 **pzBuffer){
822 Expr *pNew = 0; /* Value to return */
823 if( p ){
danielk19776ab3a2e2009-02-19 14:39:25 +0000824 const int isReduced = (flags&EXPRDUP_REDUCE);
825 u8 *zAlloc;
drh33e619f2009-05-28 01:00:55 +0000826 u32 staticFlag = 0;
danielk19776ab3a2e2009-02-19 14:39:25 +0000827
828 assert( pzBuffer==0 || isReduced );
829
830 /* Figure out where to write the new Expr structure. */
831 if( pzBuffer ){
832 zAlloc = *pzBuffer;
drh33e619f2009-05-28 01:00:55 +0000833 staticFlag = EP_Static;
danielk19776ab3a2e2009-02-19 14:39:25 +0000834 }else{
835 zAlloc = sqlite3DbMallocRaw(db, dupedExprSize(p, flags));
836 }
837 pNew = (Expr *)zAlloc;
838
839 if( pNew ){
840 /* Set nNewSize to the size allocated for the structure pointed to
841 ** by pNew. This is either EXPR_FULLSIZE, EXPR_REDUCEDSIZE or
842 ** EXPR_TOKENONLYSIZE. nToken is set to the number of bytes consumed
drh33e619f2009-05-28 01:00:55 +0000843 ** by the copy of the p->u.zToken string (if any).
danielk19776ab3a2e2009-02-19 14:39:25 +0000844 */
drh33e619f2009-05-28 01:00:55 +0000845 const unsigned nStructSize = dupedExprStructSize(p, flags);
846 const int nNewSize = nStructSize & 0xfff;
847 int nToken;
848 if( !ExprHasProperty(p, EP_IntValue) && p->u.zToken ){
849 nToken = sqlite3Strlen30(p->u.zToken) + 1;
850 }else{
851 nToken = 0;
852 }
danielk19776ab3a2e2009-02-19 14:39:25 +0000853 if( isReduced ){
854 assert( ExprHasProperty(p, EP_Reduced)==0 );
855 memcpy(zAlloc, p, nNewSize);
856 }else{
857 int nSize = exprStructSize(p);
858 memcpy(zAlloc, p, nSize);
859 memset(&zAlloc[nSize], 0, EXPR_FULLSIZE-nSize);
860 }
861
drh33e619f2009-05-28 01:00:55 +0000862 /* Set the EP_Reduced, EP_TokenOnly, and EP_Static flags appropriately. */
drhc5cd1242013-09-12 16:50:49 +0000863 pNew->flags &= ~(EP_Reduced|EP_TokenOnly|EP_Static|EP_MemToken);
drh33e619f2009-05-28 01:00:55 +0000864 pNew->flags |= nStructSize & (EP_Reduced|EP_TokenOnly);
865 pNew->flags |= staticFlag;
danielk19776ab3a2e2009-02-19 14:39:25 +0000866
drh33e619f2009-05-28 01:00:55 +0000867 /* Copy the p->u.zToken string, if any. */
danielk19776ab3a2e2009-02-19 14:39:25 +0000868 if( nToken ){
drh33e619f2009-05-28 01:00:55 +0000869 char *zToken = pNew->u.zToken = (char*)&zAlloc[nNewSize];
870 memcpy(zToken, p->u.zToken, nToken);
danielk19776ab3a2e2009-02-19 14:39:25 +0000871 }
872
873 if( 0==((p->flags|pNew->flags) & EP_TokenOnly) ){
danielk19776ab3a2e2009-02-19 14:39:25 +0000874 /* Fill in the pNew->x.pSelect or pNew->x.pList member. */
875 if( ExprHasProperty(p, EP_xIsSelect) ){
876 pNew->x.pSelect = sqlite3SelectDup(db, p->x.pSelect, isReduced);
877 }else{
878 pNew->x.pList = sqlite3ExprListDup(db, p->x.pList, isReduced);
879 }
880 }
881
882 /* Fill in pNew->pLeft and pNew->pRight. */
drhc5cd1242013-09-12 16:50:49 +0000883 if( ExprHasProperty(pNew, EP_Reduced|EP_TokenOnly) ){
danielk19776ab3a2e2009-02-19 14:39:25 +0000884 zAlloc += dupedExprNodeSize(p, flags);
885 if( ExprHasProperty(pNew, EP_Reduced) ){
886 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
887 pNew->pRight = exprDup(db, p->pRight, EXPRDUP_REDUCE, &zAlloc);
888 }
889 if( pzBuffer ){
890 *pzBuffer = zAlloc;
891 }
drhb7916a72009-05-27 10:31:29 +0000892 }else{
drhc5cd1242013-09-12 16:50:49 +0000893 if( !ExprHasProperty(p, EP_TokenOnly) ){
drhb7916a72009-05-27 10:31:29 +0000894 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
895 pNew->pRight = sqlite3ExprDup(db, p->pRight, 0);
896 }
danielk19776ab3a2e2009-02-19 14:39:25 +0000897 }
drhb7916a72009-05-27 10:31:29 +0000898
danielk19776ab3a2e2009-02-19 14:39:25 +0000899 }
900 }
901 return pNew;
902}
903
danbfe31e72014-01-15 14:17:31 +0000904/*
905** Create and return a deep copy of the object passed as the second
906** argument. If an OOM condition is encountered, NULL is returned
907** and the db->mallocFailed flag set.
908*/
daneede6a52014-01-15 19:42:23 +0000909#ifndef SQLITE_OMIT_CTE
danbfe31e72014-01-15 14:17:31 +0000910static With *withDup(sqlite3 *db, With *p){
dan4e9119d2014-01-13 15:12:23 +0000911 With *pRet = 0;
912 if( p ){
913 int nByte = sizeof(*p) + sizeof(p->a[0]) * (p->nCte-1);
914 pRet = sqlite3DbMallocZero(db, nByte);
915 if( pRet ){
916 int i;
917 pRet->nCte = p->nCte;
918 for(i=0; i<p->nCte; i++){
919 pRet->a[i].pSelect = sqlite3SelectDup(db, p->a[i].pSelect, 0);
920 pRet->a[i].pCols = sqlite3ExprListDup(db, p->a[i].pCols, 0);
921 pRet->a[i].zName = sqlite3DbStrDup(db, p->a[i].zName);
922 }
923 }
924 }
925 return pRet;
926}
daneede6a52014-01-15 19:42:23 +0000927#else
928# define withDup(x,y) 0
929#endif
dan4e9119d2014-01-13 15:12:23 +0000930
danielk19776ab3a2e2009-02-19 14:39:25 +0000931/*
drhff78bd22002-02-27 01:47:11 +0000932** The following group of routines make deep copies of expressions,
933** expression lists, ID lists, and select statements. The copies can
934** be deleted (by being passed to their respective ...Delete() routines)
935** without effecting the originals.
936**
danielk19774adee202004-05-08 08:23:19 +0000937** The expression list, ID, and source lists return by sqlite3ExprListDup(),
938** sqlite3IdListDup(), and sqlite3SrcListDup() can not be further expanded
drhad3cab52002-05-24 02:04:32 +0000939** by subsequent calls to sqlite*ListAppend() routines.
drhff78bd22002-02-27 01:47:11 +0000940**
drhad3cab52002-05-24 02:04:32 +0000941** Any tables that the SrcList might point to are not duplicated.
danielk19776ab3a2e2009-02-19 14:39:25 +0000942**
drhb7916a72009-05-27 10:31:29 +0000943** The flags parameter contains a combination of the EXPRDUP_XXX flags.
danielk19776ab3a2e2009-02-19 14:39:25 +0000944** If the EXPRDUP_REDUCE flag is set, then the structure returned is a
945** truncated version of the usual Expr structure that will be stored as
946** part of the in-memory representation of the database schema.
drhff78bd22002-02-27 01:47:11 +0000947*/
danielk19776ab3a2e2009-02-19 14:39:25 +0000948Expr *sqlite3ExprDup(sqlite3 *db, Expr *p, int flags){
949 return exprDup(db, p, flags, 0);
drhff78bd22002-02-27 01:47:11 +0000950}
danielk19776ab3a2e2009-02-19 14:39:25 +0000951ExprList *sqlite3ExprListDup(sqlite3 *db, ExprList *p, int flags){
drhff78bd22002-02-27 01:47:11 +0000952 ExprList *pNew;
drh145716b2004-09-24 12:24:06 +0000953 struct ExprList_item *pItem, *pOldItem;
drhff78bd22002-02-27 01:47:11 +0000954 int i;
955 if( p==0 ) return 0;
drh17435752007-08-16 04:30:38 +0000956 pNew = sqlite3DbMallocRaw(db, sizeof(*pNew) );
drhff78bd22002-02-27 01:47:11 +0000957 if( pNew==0 ) return 0;
drhd872bb12012-02-02 01:58:08 +0000958 pNew->nExpr = i = p->nExpr;
959 if( (flags & EXPRDUP_REDUCE)==0 ) for(i=1; i<p->nExpr; i+=i){}
960 pNew->a = pItem = sqlite3DbMallocRaw(db, i*sizeof(p->a[0]) );
danielk1977e0048402004-06-15 16:51:01 +0000961 if( pItem==0 ){
drh633e6d52008-07-28 19:34:53 +0000962 sqlite3DbFree(db, pNew);
danielk1977e0048402004-06-15 16:51:01 +0000963 return 0;
964 }
drh145716b2004-09-24 12:24:06 +0000965 pOldItem = p->a;
966 for(i=0; i<p->nExpr; i++, pItem++, pOldItem++){
danielk19776ab3a2e2009-02-19 14:39:25 +0000967 Expr *pOldExpr = pOldItem->pExpr;
drhb5526ea2009-07-16 12:41:05 +0000968 pItem->pExpr = sqlite3ExprDup(db, pOldExpr, flags);
drh17435752007-08-16 04:30:38 +0000969 pItem->zName = sqlite3DbStrDup(db, pOldItem->zName);
drhb7916a72009-05-27 10:31:29 +0000970 pItem->zSpan = sqlite3DbStrDup(db, pOldItem->zSpan);
drh145716b2004-09-24 12:24:06 +0000971 pItem->sortOrder = pOldItem->sortOrder;
drh3e7bc9c2004-02-21 19:17:17 +0000972 pItem->done = 0;
drh2c036cf2013-06-26 00:34:13 +0000973 pItem->bSpanIsTab = pOldItem->bSpanIsTab;
drhc2acc4e2013-11-15 18:15:19 +0000974 pItem->u = pOldItem->u;
drhff78bd22002-02-27 01:47:11 +0000975 }
976 return pNew;
977}
danielk197793758c82005-01-21 08:13:14 +0000978
979/*
980** If cursors, triggers, views and subqueries are all omitted from
981** the build, then none of the following routines, except for
982** sqlite3SelectDup(), can be called. sqlite3SelectDup() is sometimes
983** called with a NULL argument.
984*/
danielk19776a67fe82005-02-04 04:07:16 +0000985#if !defined(SQLITE_OMIT_VIEW) || !defined(SQLITE_OMIT_TRIGGER) \
986 || !defined(SQLITE_OMIT_SUBQUERY)
danielk19776ab3a2e2009-02-19 14:39:25 +0000987SrcList *sqlite3SrcListDup(sqlite3 *db, SrcList *p, int flags){
drhad3cab52002-05-24 02:04:32 +0000988 SrcList *pNew;
989 int i;
drh113088e2003-03-20 01:16:58 +0000990 int nByte;
drhad3cab52002-05-24 02:04:32 +0000991 if( p==0 ) return 0;
drh113088e2003-03-20 01:16:58 +0000992 nByte = sizeof(*p) + (p->nSrc>0 ? sizeof(p->a[0]) * (p->nSrc-1) : 0);
drh17435752007-08-16 04:30:38 +0000993 pNew = sqlite3DbMallocRaw(db, nByte );
drhad3cab52002-05-24 02:04:32 +0000994 if( pNew==0 ) return 0;
drh4305d102003-07-30 12:34:12 +0000995 pNew->nSrc = pNew->nAlloc = p->nSrc;
drhad3cab52002-05-24 02:04:32 +0000996 for(i=0; i<p->nSrc; i++){
drh4efc4752004-01-16 15:55:37 +0000997 struct SrcList_item *pNewItem = &pNew->a[i];
998 struct SrcList_item *pOldItem = &p->a[i];
drhed8a3bb2005-06-06 21:19:56 +0000999 Table *pTab;
dan41fb5cd2012-10-04 19:33:00 +00001000 pNewItem->pSchema = pOldItem->pSchema;
drh17435752007-08-16 04:30:38 +00001001 pNewItem->zDatabase = sqlite3DbStrDup(db, pOldItem->zDatabase);
1002 pNewItem->zName = sqlite3DbStrDup(db, pOldItem->zName);
1003 pNewItem->zAlias = sqlite3DbStrDup(db, pOldItem->zAlias);
drh4efc4752004-01-16 15:55:37 +00001004 pNewItem->jointype = pOldItem->jointype;
1005 pNewItem->iCursor = pOldItem->iCursor;
drh5b6a9ed2011-09-15 23:58:14 +00001006 pNewItem->addrFillSub = pOldItem->addrFillSub;
1007 pNewItem->regReturn = pOldItem->regReturn;
danda79cf02011-07-08 16:10:54 +00001008 pNewItem->isCorrelated = pOldItem->isCorrelated;
drh21172c42012-10-30 00:29:07 +00001009 pNewItem->viaCoroutine = pOldItem->viaCoroutine;
danf43fe6e2014-01-15 18:12:00 +00001010 pNewItem->isRecursive = pOldItem->isRecursive;
danielk197785574e32008-10-06 05:32:18 +00001011 pNewItem->zIndex = sqlite3DbStrDup(db, pOldItem->zIndex);
1012 pNewItem->notIndexed = pOldItem->notIndexed;
1013 pNewItem->pIndex = pOldItem->pIndex;
drhed8a3bb2005-06-06 21:19:56 +00001014 pTab = pNewItem->pTab = pOldItem->pTab;
1015 if( pTab ){
1016 pTab->nRef++;
danielk1977a1cb1832005-02-12 08:59:55 +00001017 }
danielk19776ab3a2e2009-02-19 14:39:25 +00001018 pNewItem->pSelect = sqlite3SelectDup(db, pOldItem->pSelect, flags);
1019 pNewItem->pOn = sqlite3ExprDup(db, pOldItem->pOn, flags);
drh17435752007-08-16 04:30:38 +00001020 pNewItem->pUsing = sqlite3IdListDup(db, pOldItem->pUsing);
danielk19776c18b6e2005-01-30 09:17:58 +00001021 pNewItem->colUsed = pOldItem->colUsed;
drhad3cab52002-05-24 02:04:32 +00001022 }
1023 return pNew;
1024}
drh17435752007-08-16 04:30:38 +00001025IdList *sqlite3IdListDup(sqlite3 *db, IdList *p){
drhff78bd22002-02-27 01:47:11 +00001026 IdList *pNew;
1027 int i;
1028 if( p==0 ) return 0;
drh17435752007-08-16 04:30:38 +00001029 pNew = sqlite3DbMallocRaw(db, sizeof(*pNew) );
drhff78bd22002-02-27 01:47:11 +00001030 if( pNew==0 ) return 0;
drh6c535152012-02-02 03:38:30 +00001031 pNew->nId = p->nId;
drh17435752007-08-16 04:30:38 +00001032 pNew->a = sqlite3DbMallocRaw(db, p->nId*sizeof(p->a[0]) );
danielk1977d5d56522005-03-16 12:15:20 +00001033 if( pNew->a==0 ){
drh633e6d52008-07-28 19:34:53 +00001034 sqlite3DbFree(db, pNew);
danielk1977d5d56522005-03-16 12:15:20 +00001035 return 0;
1036 }
drh6c535152012-02-02 03:38:30 +00001037 /* Note that because the size of the allocation for p->a[] is not
1038 ** necessarily a power of two, sqlite3IdListAppend() may not be called
1039 ** on the duplicate created by this function. */
drhff78bd22002-02-27 01:47:11 +00001040 for(i=0; i<p->nId; i++){
drh4efc4752004-01-16 15:55:37 +00001041 struct IdList_item *pNewItem = &pNew->a[i];
1042 struct IdList_item *pOldItem = &p->a[i];
drh17435752007-08-16 04:30:38 +00001043 pNewItem->zName = sqlite3DbStrDup(db, pOldItem->zName);
drh4efc4752004-01-16 15:55:37 +00001044 pNewItem->idx = pOldItem->idx;
drhff78bd22002-02-27 01:47:11 +00001045 }
1046 return pNew;
1047}
danielk19776ab3a2e2009-02-19 14:39:25 +00001048Select *sqlite3SelectDup(sqlite3 *db, Select *p, int flags){
drh23b1b372011-12-07 01:55:51 +00001049 Select *pNew, *pPrior;
drhff78bd22002-02-27 01:47:11 +00001050 if( p==0 ) return 0;
drh17435752007-08-16 04:30:38 +00001051 pNew = sqlite3DbMallocRaw(db, sizeof(*p) );
drhff78bd22002-02-27 01:47:11 +00001052 if( pNew==0 ) return 0;
drhb7916a72009-05-27 10:31:29 +00001053 pNew->pEList = sqlite3ExprListDup(db, p->pEList, flags);
danielk19776ab3a2e2009-02-19 14:39:25 +00001054 pNew->pSrc = sqlite3SrcListDup(db, p->pSrc, flags);
1055 pNew->pWhere = sqlite3ExprDup(db, p->pWhere, flags);
1056 pNew->pGroupBy = sqlite3ExprListDup(db, p->pGroupBy, flags);
1057 pNew->pHaving = sqlite3ExprDup(db, p->pHaving, flags);
1058 pNew->pOrderBy = sqlite3ExprListDup(db, p->pOrderBy, flags);
drhff78bd22002-02-27 01:47:11 +00001059 pNew->op = p->op;
drh23b1b372011-12-07 01:55:51 +00001060 pNew->pPrior = pPrior = sqlite3SelectDup(db, p->pPrior, flags);
1061 if( pPrior ) pPrior->pNext = pNew;
1062 pNew->pNext = 0;
danielk19776ab3a2e2009-02-19 14:39:25 +00001063 pNew->pLimit = sqlite3ExprDup(db, p->pLimit, flags);
1064 pNew->pOffset = sqlite3ExprDup(db, p->pOffset, flags);
drh92b01d52008-06-24 00:32:35 +00001065 pNew->iLimit = 0;
1066 pNew->iOffset = 0;
drh7d10d5a2008-08-20 16:35:10 +00001067 pNew->selFlags = p->selFlags & ~SF_UsesEphemeral;
drhb9bb7c12006-06-11 23:41:55 +00001068 pNew->addrOpenEphm[0] = -1;
1069 pNew->addrOpenEphm[1] = -1;
drhec2da852014-01-29 01:46:12 +00001070 pNew->nSelectRow = p->nSelectRow;
dan4e9119d2014-01-13 15:12:23 +00001071 pNew->pWith = withDup(db, p->pWith);
drh9300adb2014-09-20 20:24:49 +00001072#if SELECTTRACE_ENABLED
1073 memcpy(pNew->zSelLabel, p->zSelLabel, sizeof(p->zSelLabel));
1074#endif
drhff78bd22002-02-27 01:47:11 +00001075 return pNew;
1076}
danielk197793758c82005-01-21 08:13:14 +00001077#else
danielk19776ab3a2e2009-02-19 14:39:25 +00001078Select *sqlite3SelectDup(sqlite3 *db, Select *p, int flags){
danielk197793758c82005-01-21 08:13:14 +00001079 assert( p==0 );
1080 return 0;
1081}
1082#endif
drhff78bd22002-02-27 01:47:11 +00001083
1084
1085/*
drha76b5df2002-02-23 02:32:10 +00001086** Add a new element to the end of an expression list. If pList is
1087** initially NULL, then create a new expression list.
drhb7916a72009-05-27 10:31:29 +00001088**
1089** If a memory allocation error occurs, the entire list is freed and
1090** NULL is returned. If non-NULL is returned, then it is guaranteed
1091** that the new entry was successfully appended.
drha76b5df2002-02-23 02:32:10 +00001092*/
drh17435752007-08-16 04:30:38 +00001093ExprList *sqlite3ExprListAppend(
1094 Parse *pParse, /* Parsing context */
1095 ExprList *pList, /* List to which to append. Might be NULL */
drhb7916a72009-05-27 10:31:29 +00001096 Expr *pExpr /* Expression to be appended. Might be NULL */
drh17435752007-08-16 04:30:38 +00001097){
1098 sqlite3 *db = pParse->db;
drha76b5df2002-02-23 02:32:10 +00001099 if( pList==0 ){
drh17435752007-08-16 04:30:38 +00001100 pList = sqlite3DbMallocZero(db, sizeof(ExprList) );
drha76b5df2002-02-23 02:32:10 +00001101 if( pList==0 ){
danielk1977d5d56522005-03-16 12:15:20 +00001102 goto no_mem;
drha76b5df2002-02-23 02:32:10 +00001103 }
drhd872bb12012-02-02 01:58:08 +00001104 pList->a = sqlite3DbMallocRaw(db, sizeof(pList->a[0]));
1105 if( pList->a==0 ) goto no_mem;
1106 }else if( (pList->nExpr & (pList->nExpr-1))==0 ){
danielk1977d5d56522005-03-16 12:15:20 +00001107 struct ExprList_item *a;
drhd872bb12012-02-02 01:58:08 +00001108 assert( pList->nExpr>0 );
1109 a = sqlite3DbRealloc(db, pList->a, pList->nExpr*2*sizeof(pList->a[0]));
danielk1977d5d56522005-03-16 12:15:20 +00001110 if( a==0 ){
1111 goto no_mem;
drha76b5df2002-02-23 02:32:10 +00001112 }
danielk1977d5d56522005-03-16 12:15:20 +00001113 pList->a = a;
drha76b5df2002-02-23 02:32:10 +00001114 }
drh4efc4752004-01-16 15:55:37 +00001115 assert( pList->a!=0 );
drhb7916a72009-05-27 10:31:29 +00001116 if( 1 ){
drh4efc4752004-01-16 15:55:37 +00001117 struct ExprList_item *pItem = &pList->a[pList->nExpr++];
1118 memset(pItem, 0, sizeof(*pItem));
danielk1977e94ddc92005-03-21 03:53:38 +00001119 pItem->pExpr = pExpr;
drha76b5df2002-02-23 02:32:10 +00001120 }
1121 return pList;
danielk1977d5d56522005-03-16 12:15:20 +00001122
1123no_mem:
1124 /* Avoid leaking memory if malloc has failed. */
drh633e6d52008-07-28 19:34:53 +00001125 sqlite3ExprDelete(db, pExpr);
1126 sqlite3ExprListDelete(db, pList);
danielk1977d5d56522005-03-16 12:15:20 +00001127 return 0;
drha76b5df2002-02-23 02:32:10 +00001128}
1129
1130/*
drhb7916a72009-05-27 10:31:29 +00001131** Set the ExprList.a[].zName element of the most recently added item
1132** on the expression list.
1133**
1134** pList might be NULL following an OOM error. But pName should never be
1135** NULL. If a memory allocation fails, the pParse->db->mallocFailed flag
1136** is set.
1137*/
1138void sqlite3ExprListSetName(
1139 Parse *pParse, /* Parsing context */
1140 ExprList *pList, /* List to which to add the span. */
1141 Token *pName, /* Name to be added */
1142 int dequote /* True to cause the name to be dequoted */
1143){
1144 assert( pList!=0 || pParse->db->mallocFailed!=0 );
1145 if( pList ){
1146 struct ExprList_item *pItem;
1147 assert( pList->nExpr>0 );
1148 pItem = &pList->a[pList->nExpr-1];
1149 assert( pItem->zName==0 );
1150 pItem->zName = sqlite3DbStrNDup(pParse->db, pName->z, pName->n);
1151 if( dequote && pItem->zName ) sqlite3Dequote(pItem->zName);
1152 }
1153}
1154
1155/*
1156** Set the ExprList.a[].zSpan element of the most recently added item
1157** on the expression list.
1158**
1159** pList might be NULL following an OOM error. But pSpan should never be
1160** NULL. If a memory allocation fails, the pParse->db->mallocFailed flag
1161** is set.
1162*/
1163void sqlite3ExprListSetSpan(
1164 Parse *pParse, /* Parsing context */
1165 ExprList *pList, /* List to which to add the span. */
1166 ExprSpan *pSpan /* The span to be added */
1167){
1168 sqlite3 *db = pParse->db;
1169 assert( pList!=0 || db->mallocFailed!=0 );
1170 if( pList ){
1171 struct ExprList_item *pItem = &pList->a[pList->nExpr-1];
1172 assert( pList->nExpr>0 );
1173 assert( db->mallocFailed || pItem->pExpr==pSpan->pExpr );
1174 sqlite3DbFree(db, pItem->zSpan);
1175 pItem->zSpan = sqlite3DbStrNDup(db, (char*)pSpan->zStart,
shanecf697392009-06-01 16:53:09 +00001176 (int)(pSpan->zEnd - pSpan->zStart));
drhb7916a72009-05-27 10:31:29 +00001177 }
1178}
1179
1180/*
danielk19777a15a4b2007-05-08 17:54:43 +00001181** If the expression list pEList contains more than iLimit elements,
1182** leave an error message in pParse.
1183*/
1184void sqlite3ExprListCheckLength(
1185 Parse *pParse,
1186 ExprList *pEList,
danielk19777a15a4b2007-05-08 17:54:43 +00001187 const char *zObject
1188){
drhb1a6c3c2008-03-20 16:30:17 +00001189 int mx = pParse->db->aLimit[SQLITE_LIMIT_COLUMN];
drhc5499be2008-04-01 15:06:33 +00001190 testcase( pEList && pEList->nExpr==mx );
1191 testcase( pEList && pEList->nExpr==mx+1 );
drhb1a6c3c2008-03-20 16:30:17 +00001192 if( pEList && pEList->nExpr>mx ){
danielk19777a15a4b2007-05-08 17:54:43 +00001193 sqlite3ErrorMsg(pParse, "too many columns in %s", zObject);
1194 }
1195}
1196
1197/*
drha76b5df2002-02-23 02:32:10 +00001198** Delete an entire expression list.
1199*/
drh633e6d52008-07-28 19:34:53 +00001200void sqlite3ExprListDelete(sqlite3 *db, ExprList *pList){
drha76b5df2002-02-23 02:32:10 +00001201 int i;
drhbe5c89a2004-07-26 00:31:09 +00001202 struct ExprList_item *pItem;
drha76b5df2002-02-23 02:32:10 +00001203 if( pList==0 ) return;
drhd872bb12012-02-02 01:58:08 +00001204 assert( pList->a!=0 || pList->nExpr==0 );
drhbe5c89a2004-07-26 00:31:09 +00001205 for(pItem=pList->a, i=0; i<pList->nExpr; i++, pItem++){
drh633e6d52008-07-28 19:34:53 +00001206 sqlite3ExprDelete(db, pItem->pExpr);
1207 sqlite3DbFree(db, pItem->zName);
drhb7916a72009-05-27 10:31:29 +00001208 sqlite3DbFree(db, pItem->zSpan);
drha76b5df2002-02-23 02:32:10 +00001209 }
drh633e6d52008-07-28 19:34:53 +00001210 sqlite3DbFree(db, pList->a);
1211 sqlite3DbFree(db, pList);
drha76b5df2002-02-23 02:32:10 +00001212}
1213
1214/*
drh7d10d5a2008-08-20 16:35:10 +00001215** These routines are Walker callbacks. Walker.u.pi is a pointer
1216** to an integer. These routines are checking an expression to see
1217** if it is a constant. Set *Walker.u.pi to 0 if the expression is
1218** not constant.
drh73b211a2005-01-18 04:00:42 +00001219**
drh7d10d5a2008-08-20 16:35:10 +00001220** These callback routines are used to implement the following:
drh626a8792005-01-17 22:08:19 +00001221**
drh7d10d5a2008-08-20 16:35:10 +00001222** sqlite3ExprIsConstant()
1223** sqlite3ExprIsConstantNotJoin()
1224** sqlite3ExprIsConstantOrFunction()
drh87abf5c2005-08-25 12:45:04 +00001225**
drh626a8792005-01-17 22:08:19 +00001226*/
drh7d10d5a2008-08-20 16:35:10 +00001227static int exprNodeIsConstant(Walker *pWalker, Expr *pExpr){
drh626a8792005-01-17 22:08:19 +00001228
drh7d10d5a2008-08-20 16:35:10 +00001229 /* If pWalker->u.i is 3 then any term of the expression that comes from
drh0a168372007-06-08 00:20:47 +00001230 ** the ON or USING clauses of a join disqualifies the expression
1231 ** from being considered constant. */
drhc5cd1242013-09-12 16:50:49 +00001232 if( pWalker->u.i==3 && ExprHasProperty(pExpr, EP_FromJoin) ){
drh7d10d5a2008-08-20 16:35:10 +00001233 pWalker->u.i = 0;
1234 return WRC_Abort;
drh0a168372007-06-08 00:20:47 +00001235 }
1236
drh626a8792005-01-17 22:08:19 +00001237 switch( pExpr->op ){
drheb55bd22005-06-30 17:04:21 +00001238 /* Consider functions to be constant if all their arguments are constant
drhb1fba282013-11-21 14:33:48 +00001239 ** and either pWalker->u.i==2 or the function as the SQLITE_FUNC_CONST
1240 ** flag. */
drheb55bd22005-06-30 17:04:21 +00001241 case TK_FUNCTION:
drhb1fba282013-11-21 14:33:48 +00001242 if( pWalker->u.i==2 || ExprHasProperty(pExpr,EP_Constant) ){
1243 return WRC_Continue;
1244 }
drheb55bd22005-06-30 17:04:21 +00001245 /* Fall through */
drh626a8792005-01-17 22:08:19 +00001246 case TK_ID:
1247 case TK_COLUMN:
drh626a8792005-01-17 22:08:19 +00001248 case TK_AGG_FUNCTION:
drh13449892005-09-07 21:22:45 +00001249 case TK_AGG_COLUMN:
drhc5499be2008-04-01 15:06:33 +00001250 testcase( pExpr->op==TK_ID );
1251 testcase( pExpr->op==TK_COLUMN );
drhc5499be2008-04-01 15:06:33 +00001252 testcase( pExpr->op==TK_AGG_FUNCTION );
1253 testcase( pExpr->op==TK_AGG_COLUMN );
drh7d10d5a2008-08-20 16:35:10 +00001254 pWalker->u.i = 0;
1255 return WRC_Abort;
drh626a8792005-01-17 22:08:19 +00001256 default:
drhb74b1012009-05-28 21:04:37 +00001257 testcase( pExpr->op==TK_SELECT ); /* selectNodeIsConstant will disallow */
1258 testcase( pExpr->op==TK_EXISTS ); /* selectNodeIsConstant will disallow */
drh7d10d5a2008-08-20 16:35:10 +00001259 return WRC_Continue;
drh626a8792005-01-17 22:08:19 +00001260 }
1261}
danielk197762c14b32008-11-19 09:05:26 +00001262static int selectNodeIsConstant(Walker *pWalker, Select *NotUsed){
1263 UNUSED_PARAMETER(NotUsed);
drh7d10d5a2008-08-20 16:35:10 +00001264 pWalker->u.i = 0;
1265 return WRC_Abort;
1266}
1267static int exprIsConst(Expr *p, int initFlag){
1268 Walker w;
drhaa87f9a2013-04-25 00:57:10 +00001269 memset(&w, 0, sizeof(w));
drh7d10d5a2008-08-20 16:35:10 +00001270 w.u.i = initFlag;
1271 w.xExprCallback = exprNodeIsConstant;
1272 w.xSelectCallback = selectNodeIsConstant;
1273 sqlite3WalkExpr(&w, p);
1274 return w.u.i;
1275}
drh626a8792005-01-17 22:08:19 +00001276
1277/*
drhfef52082000-06-06 01:50:43 +00001278** Walk an expression tree. Return 1 if the expression is constant
drheb55bd22005-06-30 17:04:21 +00001279** and 0 if it involves variables or function calls.
drh23989372002-05-21 13:43:04 +00001280**
1281** For the purposes of this function, a double-quoted string (ex: "abc")
1282** is considered a variable but a single-quoted string (ex: 'abc') is
1283** a constant.
drhfef52082000-06-06 01:50:43 +00001284*/
danielk19774adee202004-05-08 08:23:19 +00001285int sqlite3ExprIsConstant(Expr *p){
drh7d10d5a2008-08-20 16:35:10 +00001286 return exprIsConst(p, 1);
drhfef52082000-06-06 01:50:43 +00001287}
1288
1289/*
drheb55bd22005-06-30 17:04:21 +00001290** Walk an expression tree. Return 1 if the expression is constant
drh0a168372007-06-08 00:20:47 +00001291** that does no originate from the ON or USING clauses of a join.
1292** Return 0 if it involves variables or function calls or terms from
1293** an ON or USING clause.
1294*/
1295int sqlite3ExprIsConstantNotJoin(Expr *p){
drh7d10d5a2008-08-20 16:35:10 +00001296 return exprIsConst(p, 3);
drh0a168372007-06-08 00:20:47 +00001297}
1298
1299/*
1300** Walk an expression tree. Return 1 if the expression is constant
drheb55bd22005-06-30 17:04:21 +00001301** or a function call with constant arguments. Return and 0 if there
1302** are any variables.
1303**
1304** For the purposes of this function, a double-quoted string (ex: "abc")
1305** is considered a variable but a single-quoted string (ex: 'abc') is
1306** a constant.
1307*/
1308int sqlite3ExprIsConstantOrFunction(Expr *p){
drh7d10d5a2008-08-20 16:35:10 +00001309 return exprIsConst(p, 2);
drheb55bd22005-06-30 17:04:21 +00001310}
1311
1312/*
drh73b211a2005-01-18 04:00:42 +00001313** If the expression p codes a constant integer that is small enough
drh202b2df2004-01-06 01:13:46 +00001314** to fit in a 32-bit integer, return 1 and put the value of the integer
1315** in *pValue. If the expression is not an integer or if it is too big
1316** to fit in a signed 32-bit integer, return 0 and leave *pValue unchanged.
drhe4de1fe2002-06-02 16:09:01 +00001317*/
danielk19774adee202004-05-08 08:23:19 +00001318int sqlite3ExprIsInteger(Expr *p, int *pValue){
drh92b01d52008-06-24 00:32:35 +00001319 int rc = 0;
drhcd92e842011-02-17 15:58:20 +00001320
1321 /* If an expression is an integer literal that fits in a signed 32-bit
1322 ** integer, then the EP_IntValue flag will have already been set */
1323 assert( p->op!=TK_INTEGER || (p->flags & EP_IntValue)!=0
1324 || sqlite3GetInt32(p->u.zToken, &rc)==0 );
1325
drh92b01d52008-06-24 00:32:35 +00001326 if( p->flags & EP_IntValue ){
drh33e619f2009-05-28 01:00:55 +00001327 *pValue = p->u.iValue;
drh92b01d52008-06-24 00:32:35 +00001328 return 1;
1329 }
drhe4de1fe2002-06-02 16:09:01 +00001330 switch( p->op ){
drh4b59ab52002-08-24 18:24:51 +00001331 case TK_UPLUS: {
drh92b01d52008-06-24 00:32:35 +00001332 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
drhf6e369a2008-06-24 12:46:30 +00001333 break;
drh4b59ab52002-08-24 18:24:51 +00001334 }
drhe4de1fe2002-06-02 16:09:01 +00001335 case TK_UMINUS: {
1336 int v;
danielk19774adee202004-05-08 08:23:19 +00001337 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
mistachkinf6418892013-08-28 01:54:12 +00001338 assert( v!=(-2147483647-1) );
drhe4de1fe2002-06-02 16:09:01 +00001339 *pValue = -v;
drh92b01d52008-06-24 00:32:35 +00001340 rc = 1;
drhe4de1fe2002-06-02 16:09:01 +00001341 }
1342 break;
1343 }
1344 default: break;
1345 }
drh92b01d52008-06-24 00:32:35 +00001346 return rc;
drhe4de1fe2002-06-02 16:09:01 +00001347}
1348
1349/*
drh039fc322009-11-17 18:31:47 +00001350** Return FALSE if there is no chance that the expression can be NULL.
1351**
1352** If the expression might be NULL or if the expression is too complex
1353** to tell return TRUE.
1354**
1355** This routine is used as an optimization, to skip OP_IsNull opcodes
1356** when we know that a value cannot be NULL. Hence, a false positive
1357** (returning TRUE when in fact the expression can never be NULL) might
1358** be a small performance hit but is otherwise harmless. On the other
1359** hand, a false negative (returning FALSE when the result could be NULL)
1360** will likely result in an incorrect answer. So when in doubt, return
1361** TRUE.
1362*/
1363int sqlite3ExprCanBeNull(const Expr *p){
1364 u8 op;
drhcd7f4572009-11-19 14:48:40 +00001365 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
drh039fc322009-11-17 18:31:47 +00001366 op = p->op;
1367 if( op==TK_REGISTER ) op = p->op2;
1368 switch( op ){
1369 case TK_INTEGER:
1370 case TK_STRING:
1371 case TK_FLOAT:
1372 case TK_BLOB:
1373 return 0;
drh7248a8b2014-08-04 18:50:54 +00001374 case TK_COLUMN:
1375 assert( p->pTab!=0 );
1376 return p->iColumn>=0 && p->pTab->aCol[p->iColumn].notNull==0;
drh039fc322009-11-17 18:31:47 +00001377 default:
1378 return 1;
1379 }
1380}
1381
1382/*
1383** Return TRUE if the given expression is a constant which would be
1384** unchanged by OP_Affinity with the affinity given in the second
1385** argument.
1386**
1387** This routine is used to determine if the OP_Affinity operation
1388** can be omitted. When in doubt return FALSE. A false negative
1389** is harmless. A false positive, however, can result in the wrong
1390** answer.
1391*/
1392int sqlite3ExprNeedsNoAffinityChange(const Expr *p, char aff){
1393 u8 op;
1394 if( aff==SQLITE_AFF_NONE ) return 1;
drhcd7f4572009-11-19 14:48:40 +00001395 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
drh039fc322009-11-17 18:31:47 +00001396 op = p->op;
1397 if( op==TK_REGISTER ) op = p->op2;
1398 switch( op ){
1399 case TK_INTEGER: {
1400 return aff==SQLITE_AFF_INTEGER || aff==SQLITE_AFF_NUMERIC;
1401 }
1402 case TK_FLOAT: {
1403 return aff==SQLITE_AFF_REAL || aff==SQLITE_AFF_NUMERIC;
1404 }
1405 case TK_STRING: {
1406 return aff==SQLITE_AFF_TEXT;
1407 }
1408 case TK_BLOB: {
1409 return 1;
1410 }
drh2f2855b2009-11-18 01:25:26 +00001411 case TK_COLUMN: {
drh88376ca2009-11-19 15:44:53 +00001412 assert( p->iTable>=0 ); /* p cannot be part of a CHECK constraint */
1413 return p->iColumn<0
1414 && (aff==SQLITE_AFF_INTEGER || aff==SQLITE_AFF_NUMERIC);
drh2f2855b2009-11-18 01:25:26 +00001415 }
drh039fc322009-11-17 18:31:47 +00001416 default: {
1417 return 0;
1418 }
1419 }
1420}
1421
1422/*
drhc4a3c772001-04-04 11:48:57 +00001423** Return TRUE if the given string is a row-id column name.
1424*/
danielk19774adee202004-05-08 08:23:19 +00001425int sqlite3IsRowid(const char *z){
1426 if( sqlite3StrICmp(z, "_ROWID_")==0 ) return 1;
1427 if( sqlite3StrICmp(z, "ROWID")==0 ) return 1;
1428 if( sqlite3StrICmp(z, "OID")==0 ) return 1;
drhc4a3c772001-04-04 11:48:57 +00001429 return 0;
1430}
1431
danielk19779a96b662007-11-29 17:05:18 +00001432/*
drhb74b1012009-05-28 21:04:37 +00001433** Return true if we are able to the IN operator optimization on a
1434** query of the form
drhb287f4b2008-04-25 00:08:38 +00001435**
drhb74b1012009-05-28 21:04:37 +00001436** x IN (SELECT ...)
drhb287f4b2008-04-25 00:08:38 +00001437**
drhb74b1012009-05-28 21:04:37 +00001438** Where the SELECT... clause is as specified by the parameter to this
1439** routine.
1440**
1441** The Select object passed in has already been preprocessed and no
1442** errors have been found.
drhb287f4b2008-04-25 00:08:38 +00001443*/
1444#ifndef SQLITE_OMIT_SUBQUERY
1445static int isCandidateForInOpt(Select *p){
1446 SrcList *pSrc;
1447 ExprList *pEList;
1448 Table *pTab;
drhb287f4b2008-04-25 00:08:38 +00001449 if( p==0 ) return 0; /* right-hand side of IN is SELECT */
1450 if( p->pPrior ) return 0; /* Not a compound SELECT */
drh7d10d5a2008-08-20 16:35:10 +00001451 if( p->selFlags & (SF_Distinct|SF_Aggregate) ){
drhb74b1012009-05-28 21:04:37 +00001452 testcase( (p->selFlags & (SF_Distinct|SF_Aggregate))==SF_Distinct );
1453 testcase( (p->selFlags & (SF_Distinct|SF_Aggregate))==SF_Aggregate );
1454 return 0; /* No DISTINCT keyword and no aggregate functions */
drh7d10d5a2008-08-20 16:35:10 +00001455 }
drhb74b1012009-05-28 21:04:37 +00001456 assert( p->pGroupBy==0 ); /* Has no GROUP BY clause */
drhb287f4b2008-04-25 00:08:38 +00001457 if( p->pLimit ) return 0; /* Has no LIMIT clause */
drhb74b1012009-05-28 21:04:37 +00001458 assert( p->pOffset==0 ); /* No LIMIT means no OFFSET */
drhb287f4b2008-04-25 00:08:38 +00001459 if( p->pWhere ) return 0; /* Has no WHERE clause */
1460 pSrc = p->pSrc;
drhd1fa7bc2009-01-10 13:24:50 +00001461 assert( pSrc!=0 );
1462 if( pSrc->nSrc!=1 ) return 0; /* Single term in FROM clause */
drhb74b1012009-05-28 21:04:37 +00001463 if( pSrc->a[0].pSelect ) return 0; /* FROM is not a subquery or view */
drhb287f4b2008-04-25 00:08:38 +00001464 pTab = pSrc->a[0].pTab;
drhb74b1012009-05-28 21:04:37 +00001465 if( NEVER(pTab==0) ) return 0;
1466 assert( pTab->pSelect==0 ); /* FROM clause is not a view */
drhb287f4b2008-04-25 00:08:38 +00001467 if( IsVirtual(pTab) ) return 0; /* FROM clause not a virtual table */
1468 pEList = p->pEList;
1469 if( pEList->nExpr!=1 ) return 0; /* One column in the result set */
1470 if( pEList->a[0].pExpr->op!=TK_COLUMN ) return 0; /* Result is a column */
1471 return 1;
1472}
1473#endif /* SQLITE_OMIT_SUBQUERY */
1474
1475/*
dan1d8cb212011-12-09 13:24:16 +00001476** Code an OP_Once instruction and allocate space for its flag. Return the
1477** address of the new instruction.
1478*/
1479int sqlite3CodeOnce(Parse *pParse){
1480 Vdbe *v = sqlite3GetVdbe(pParse); /* Virtual machine being coded */
drh7d176102014-02-18 03:07:12 +00001481 return sqlite3VdbeAddOp1(v, OP_Once, pParse->nOnce++);
dan1d8cb212011-12-09 13:24:16 +00001482}
1483
1484/*
drh4c259e92014-08-01 21:12:35 +00001485** Generate code that checks the left-most column of index table iCur to see if
1486** it contains any NULL entries. Cause the register at regHasNull to be set
drh6be515e2014-08-01 21:00:53 +00001487** to a non-NULL value if iCur contains no NULLs. Cause register regHasNull
1488** to be set to NULL if iCur contains one or more NULL values.
1489*/
1490static void sqlite3SetHasNullFlag(Vdbe *v, int iCur, int regHasNull){
1491 int j1;
1492 sqlite3VdbeAddOp2(v, OP_Integer, 0, regHasNull);
1493 j1 = sqlite3VdbeAddOp1(v, OP_Rewind, iCur); VdbeCoverage(v);
1494 sqlite3VdbeAddOp3(v, OP_Column, iCur, 0, regHasNull);
1495 sqlite3VdbeChangeP5(v, OPFLAG_TYPEOFARG);
drh4c259e92014-08-01 21:12:35 +00001496 VdbeComment((v, "first_entry_in(%d)", iCur));
drh6be515e2014-08-01 21:00:53 +00001497 sqlite3VdbeJumpHere(v, j1);
1498}
1499
drhbb53ecb2014-08-02 21:03:33 +00001500
1501#ifndef SQLITE_OMIT_SUBQUERY
1502/*
1503** The argument is an IN operator with a list (not a subquery) on the
1504** right-hand side. Return TRUE if that list is constant.
1505*/
1506static int sqlite3InRhsIsConstant(Expr *pIn){
1507 Expr *pLHS;
1508 int res;
1509 assert( !ExprHasProperty(pIn, EP_xIsSelect) );
1510 pLHS = pIn->pLeft;
1511 pIn->pLeft = 0;
1512 res = sqlite3ExprIsConstant(pIn);
1513 pIn->pLeft = pLHS;
1514 return res;
1515}
1516#endif
1517
drh6be515e2014-08-01 21:00:53 +00001518/*
danielk19779a96b662007-11-29 17:05:18 +00001519** This function is used by the implementation of the IN (...) operator.
drhd4305ca2012-09-18 17:08:33 +00001520** The pX parameter is the expression on the RHS of the IN operator, which
1521** might be either a list of expressions or a subquery.
danielk19779a96b662007-11-29 17:05:18 +00001522**
drhd4305ca2012-09-18 17:08:33 +00001523** The job of this routine is to find or create a b-tree object that can
1524** be used either to test for membership in the RHS set or to iterate through
1525** all members of the RHS set, skipping duplicates.
1526**
drh3a856252014-08-01 14:46:57 +00001527** A cursor is opened on the b-tree object that is the RHS of the IN operator
drhd4305ca2012-09-18 17:08:33 +00001528** and pX->iTable is set to the index of that cursor.
1529**
drhb74b1012009-05-28 21:04:37 +00001530** The returned value of this function indicates the b-tree type, as follows:
danielk19779a96b662007-11-29 17:05:18 +00001531**
drh1ccce442013-03-12 20:38:51 +00001532** IN_INDEX_ROWID - The cursor was opened on a database table.
1533** IN_INDEX_INDEX_ASC - The cursor was opened on an ascending index.
1534** IN_INDEX_INDEX_DESC - The cursor was opened on a descending index.
1535** IN_INDEX_EPH - The cursor was opened on a specially created and
1536** populated epheremal table.
drhbb53ecb2014-08-02 21:03:33 +00001537** IN_INDEX_NOOP - No cursor was allocated. The IN operator must be
1538** implemented as a sequence of comparisons.
danielk19779a96b662007-11-29 17:05:18 +00001539**
drhd4305ca2012-09-18 17:08:33 +00001540** An existing b-tree might be used if the RHS expression pX is a simple
1541** subquery such as:
danielk19779a96b662007-11-29 17:05:18 +00001542**
1543** SELECT <column> FROM <table>
1544**
drhd4305ca2012-09-18 17:08:33 +00001545** If the RHS of the IN operator is a list or a more complex subquery, then
1546** an ephemeral table might need to be generated from the RHS and then
peter.d.reid60ec9142014-09-06 16:39:46 +00001547** pX->iTable made to point to the ephemeral table instead of an
drh3a856252014-08-01 14:46:57 +00001548** existing table.
drhd4305ca2012-09-18 17:08:33 +00001549**
drh3a856252014-08-01 14:46:57 +00001550** The inFlags parameter must contain exactly one of the bits
1551** IN_INDEX_MEMBERSHIP or IN_INDEX_LOOP. If inFlags contains
1552** IN_INDEX_MEMBERSHIP, then the generated table will be used for a
1553** fast membership test. When the IN_INDEX_LOOP bit is set, the
1554** IN index will be used to loop over all values of the RHS of the
1555** IN operator.
1556**
1557** When IN_INDEX_LOOP is used (and the b-tree will be used to iterate
1558** through the set members) then the b-tree must not contain duplicates.
1559** An epheremal table must be used unless the selected <column> is guaranteed
danielk19779a96b662007-11-29 17:05:18 +00001560** to be unique - either because it is an INTEGER PRIMARY KEY or it
drhb74b1012009-05-28 21:04:37 +00001561** has a UNIQUE constraint or UNIQUE index.
danielk19770cdc0222008-06-26 18:04:03 +00001562**
drh3a856252014-08-01 14:46:57 +00001563** When IN_INDEX_MEMBERSHIP is used (and the b-tree will be used
1564** for fast set membership tests) then an epheremal table must
danielk19770cdc0222008-06-26 18:04:03 +00001565** be used unless <column> is an INTEGER PRIMARY KEY or an index can
1566** be found with <column> as its left-most column.
1567**
drhbb53ecb2014-08-02 21:03:33 +00001568** If the IN_INDEX_NOOP_OK and IN_INDEX_MEMBERSHIP are both set and
1569** if the RHS of the IN operator is a list (not a subquery) then this
1570** routine might decide that creating an ephemeral b-tree for membership
1571** testing is too expensive and return IN_INDEX_NOOP. In that case, the
1572** calling routine should implement the IN operator using a sequence
1573** of Eq or Ne comparison operations.
1574**
drhb74b1012009-05-28 21:04:37 +00001575** When the b-tree is being used for membership tests, the calling function
drh3a856252014-08-01 14:46:57 +00001576** might need to know whether or not the RHS side of the IN operator
drhe21a6e12014-08-01 18:00:24 +00001577** contains a NULL. If prRhsHasNull is not a NULL pointer and
drh3a856252014-08-01 14:46:57 +00001578** if there is any chance that the (...) might contain a NULL value at
danielk19770cdc0222008-06-26 18:04:03 +00001579** runtime, then a register is allocated and the register number written
drhe21a6e12014-08-01 18:00:24 +00001580** to *prRhsHasNull. If there is no chance that the (...) contains a
1581** NULL value, then *prRhsHasNull is left unchanged.
danielk19770cdc0222008-06-26 18:04:03 +00001582**
drhe21a6e12014-08-01 18:00:24 +00001583** If a register is allocated and its location stored in *prRhsHasNull, then
drh6be515e2014-08-01 21:00:53 +00001584** the value in that register will be NULL if the b-tree contains one or more
1585** NULL values, and it will be some non-NULL value if the b-tree contains no
1586** NULL values.
danielk19779a96b662007-11-29 17:05:18 +00001587*/
danielk1977284f4ac2007-12-10 05:03:46 +00001588#ifndef SQLITE_OMIT_SUBQUERY
drhe21a6e12014-08-01 18:00:24 +00001589int sqlite3FindInIndex(Parse *pParse, Expr *pX, u32 inFlags, int *prRhsHasNull){
drhb74b1012009-05-28 21:04:37 +00001590 Select *p; /* SELECT to the right of IN operator */
1591 int eType = 0; /* Type of RHS table. IN_INDEX_* */
1592 int iTab = pParse->nTab++; /* Cursor of the RHS table */
drh3a856252014-08-01 14:46:57 +00001593 int mustBeUnique; /* True if RHS must be unique */
drhb8475df2011-12-09 16:21:19 +00001594 Vdbe *v = sqlite3GetVdbe(pParse); /* Virtual machine being coded */
danielk19779a96b662007-11-29 17:05:18 +00001595
drh1450bc62009-10-30 13:25:56 +00001596 assert( pX->op==TK_IN );
drh3a856252014-08-01 14:46:57 +00001597 mustBeUnique = (inFlags & IN_INDEX_LOOP)!=0;
drh1450bc62009-10-30 13:25:56 +00001598
drhb74b1012009-05-28 21:04:37 +00001599 /* Check to see if an existing table or index can be used to
1600 ** satisfy the query. This is preferable to generating a new
1601 ** ephemeral table.
danielk19779a96b662007-11-29 17:05:18 +00001602 */
danielk19776ab3a2e2009-02-19 14:39:25 +00001603 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
drhfd773cf2009-05-29 14:39:07 +00001604 if( ALWAYS(pParse->nErr==0) && isCandidateForInOpt(p) ){
danielk1977e1fb65a2009-04-02 17:23:32 +00001605 sqlite3 *db = pParse->db; /* Database connection */
drhb07028f2011-10-14 21:49:18 +00001606 Table *pTab; /* Table <table>. */
1607 Expr *pExpr; /* Expression <column> */
drhbbbdc832013-10-22 18:01:40 +00001608 i16 iCol; /* Index of column <column> */
1609 i16 iDb; /* Database idx for pTab */
drhb07028f2011-10-14 21:49:18 +00001610
1611 assert( p ); /* Because of isCandidateForInOpt(p) */
1612 assert( p->pEList!=0 ); /* Because of isCandidateForInOpt(p) */
1613 assert( p->pEList->a[0].pExpr!=0 ); /* Because of isCandidateForInOpt(p) */
1614 assert( p->pSrc!=0 ); /* Because of isCandidateForInOpt(p) */
1615 pTab = p->pSrc->a[0].pTab;
1616 pExpr = p->pEList->a[0].pExpr;
drhbbbdc832013-10-22 18:01:40 +00001617 iCol = (i16)pExpr->iColumn;
danielk1977e1fb65a2009-04-02 17:23:32 +00001618
drhb22f7c82014-02-06 23:56:27 +00001619 /* Code an OP_Transaction and OP_TableLock for <table>. */
drhedf83d12014-01-22 18:31:27 +00001620 iDb = sqlite3SchemaToIndex(db, pTab->pSchema);
1621 sqlite3CodeVerifySchema(pParse, iDb);
1622 sqlite3TableLock(pParse, iDb, pTab->tnum, 0, pTab->zName);
danielk19779a96b662007-11-29 17:05:18 +00001623
1624 /* This function is only called from two places. In both cases the vdbe
1625 ** has already been allocated. So assume sqlite3GetVdbe() is always
1626 ** successful here.
1627 */
1628 assert(v);
1629 if( iCol<0 ){
drh7d176102014-02-18 03:07:12 +00001630 int iAddr = sqlite3CodeOnce(pParse);
1631 VdbeCoverage(v);
danielk19779a96b662007-11-29 17:05:18 +00001632
1633 sqlite3OpenTable(pParse, iTab, iDb, pTab, OP_OpenRead);
1634 eType = IN_INDEX_ROWID;
1635
1636 sqlite3VdbeJumpHere(v, iAddr);
1637 }else{
danielk1977e1fb65a2009-04-02 17:23:32 +00001638 Index *pIdx; /* Iterator variable */
1639
drhb74b1012009-05-28 21:04:37 +00001640 /* The collation sequence used by the comparison. If an index is to
danielk19779a96b662007-11-29 17:05:18 +00001641 ** be used in place of a temp-table, it must be ordered according
danielk1977e1fb65a2009-04-02 17:23:32 +00001642 ** to this collation sequence. */
danielk19779a96b662007-11-29 17:05:18 +00001643 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
1644
1645 /* Check that the affinity that will be used to perform the
1646 ** comparison is the same as the affinity of the column. If
1647 ** it is not, it is not possible to use any index.
1648 */
drhdbaee5e2012-09-18 19:29:06 +00001649 int affinity_ok = sqlite3IndexAffinityOk(pX, pTab->aCol[iCol].affinity);
danielk19779a96b662007-11-29 17:05:18 +00001650
1651 for(pIdx=pTab->pIndex; pIdx && eType==0 && affinity_ok; pIdx=pIdx->pNext){
1652 if( (pIdx->aiColumn[0]==iCol)
drhb74b1012009-05-28 21:04:37 +00001653 && sqlite3FindCollSeq(db, ENC(db), pIdx->azColl[0], 0)==pReq
drh5f1d1d92014-07-31 22:59:04 +00001654 && (!mustBeUnique || (pIdx->nKeyCol==1 && IsUniqueIndex(pIdx)))
danielk19779a96b662007-11-29 17:05:18 +00001655 ){
drh7d176102014-02-18 03:07:12 +00001656 int iAddr = sqlite3CodeOnce(pParse); VdbeCoverage(v);
drh2ec2fb22013-11-06 19:59:23 +00001657 sqlite3VdbeAddOp3(v, OP_OpenRead, iTab, pIdx->tnum, iDb);
1658 sqlite3VdbeSetP4KeyInfo(pParse, pIdx);
danielk1977207872a2008-01-03 07:54:23 +00001659 VdbeComment((v, "%s", pIdx->zName));
drh1ccce442013-03-12 20:38:51 +00001660 assert( IN_INDEX_INDEX_DESC == IN_INDEX_INDEX_ASC+1 );
1661 eType = IN_INDEX_INDEX_ASC + pIdx->aSortOrder[0];
danielk19779a96b662007-11-29 17:05:18 +00001662
drhe21a6e12014-08-01 18:00:24 +00001663 if( prRhsHasNull && !pTab->aCol[iCol].notNull ){
1664 *prRhsHasNull = ++pParse->nMem;
drh6be515e2014-08-01 21:00:53 +00001665 sqlite3SetHasNullFlag(v, iTab, *prRhsHasNull);
danielk19770cdc0222008-06-26 18:04:03 +00001666 }
drh552fd452014-02-18 01:07:38 +00001667 sqlite3VdbeJumpHere(v, iAddr);
danielk19779a96b662007-11-29 17:05:18 +00001668 }
1669 }
1670 }
1671 }
1672
drhbb53ecb2014-08-02 21:03:33 +00001673 /* If no preexisting index is available for the IN clause
1674 ** and IN_INDEX_NOOP is an allowed reply
1675 ** and the RHS of the IN operator is a list, not a subquery
1676 ** and the RHS is not contant or has two or fewer terms,
peter.d.reid60ec9142014-09-06 16:39:46 +00001677 ** then it is not worth creating an ephemeral table to evaluate
drhbb53ecb2014-08-02 21:03:33 +00001678 ** the IN operator so return IN_INDEX_NOOP.
1679 */
1680 if( eType==0
1681 && (inFlags & IN_INDEX_NOOP_OK)
1682 && !ExprHasProperty(pX, EP_xIsSelect)
1683 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
1684 ){
1685 eType = IN_INDEX_NOOP;
1686 }
1687
1688
danielk19779a96b662007-11-29 17:05:18 +00001689 if( eType==0 ){
drh43870062014-07-31 15:44:44 +00001690 /* Could not find an existing table or index to use as the RHS b-tree.
drhb74b1012009-05-28 21:04:37 +00001691 ** We will have to generate an ephemeral table to do the job.
1692 */
drh8e23daf2013-06-11 13:30:04 +00001693 u32 savedNQueryLoop = pParse->nQueryLoop;
danielk19770cdc0222008-06-26 18:04:03 +00001694 int rMayHaveNull = 0;
danielk197741a05b72008-10-02 13:50:55 +00001695 eType = IN_INDEX_EPH;
drh3a856252014-08-01 14:46:57 +00001696 if( inFlags & IN_INDEX_LOOP ){
drh4a5acf82013-06-18 20:06:23 +00001697 pParse->nQueryLoop = 0;
drhc5cd1242013-09-12 16:50:49 +00001698 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
drhcf4d38a2010-07-28 02:53:36 +00001699 eType = IN_INDEX_ROWID;
1700 }
drhe21a6e12014-08-01 18:00:24 +00001701 }else if( prRhsHasNull ){
1702 *prRhsHasNull = rMayHaveNull = ++pParse->nMem;
danielk19770cdc0222008-06-26 18:04:03 +00001703 }
danielk197741a05b72008-10-02 13:50:55 +00001704 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
drhcf4d38a2010-07-28 02:53:36 +00001705 pParse->nQueryLoop = savedNQueryLoop;
danielk19779a96b662007-11-29 17:05:18 +00001706 }else{
1707 pX->iTable = iTab;
1708 }
1709 return eType;
1710}
danielk1977284f4ac2007-12-10 05:03:46 +00001711#endif
drh626a8792005-01-17 22:08:19 +00001712
1713/*
drhd4187c72010-08-30 22:15:45 +00001714** Generate code for scalar subqueries used as a subquery expression, EXISTS,
1715** or IN operators. Examples:
drh626a8792005-01-17 22:08:19 +00001716**
drh9cbe6352005-11-29 03:13:21 +00001717** (SELECT a FROM b) -- subquery
1718** EXISTS (SELECT a FROM b) -- EXISTS subquery
1719** x IN (4,5,11) -- IN operator with list on right-hand side
1720** x IN (SELECT a FROM b) -- IN operator with subquery on the right
drhfef52082000-06-06 01:50:43 +00001721**
drh9cbe6352005-11-29 03:13:21 +00001722** The pExpr parameter describes the expression that contains the IN
1723** operator or subquery.
danielk197741a05b72008-10-02 13:50:55 +00001724**
1725** If parameter isRowid is non-zero, then expression pExpr is guaranteed
1726** to be of the form "<rowid> IN (?, ?, ?)", where <rowid> is a reference
1727** to some integer key column of a table B-Tree. In this case, use an
1728** intkey B-Tree to store the set of IN(...) values instead of the usual
1729** (slower) variable length keys B-Tree.
drhfd773cf2009-05-29 14:39:07 +00001730**
1731** If rMayHaveNull is non-zero, that means that the operation is an IN
1732** (not a SELECT or EXISTS) and that the RHS might contains NULLs.
drh3a856252014-08-01 14:46:57 +00001733** All this routine does is initialize the register given by rMayHaveNull
1734** to NULL. Calling routines will take care of changing this register
1735** value to non-NULL if the RHS is NULL-free.
drh1450bc62009-10-30 13:25:56 +00001736**
1737** For a SELECT or EXISTS operator, return the register that holds the
1738** result. For IN operators or if an error occurs, the return value is 0.
drhcce7d172000-05-31 15:34:51 +00001739*/
drh51522cd2005-01-20 13:36:19 +00001740#ifndef SQLITE_OMIT_SUBQUERY
drh1450bc62009-10-30 13:25:56 +00001741int sqlite3CodeSubselect(
drhfd773cf2009-05-29 14:39:07 +00001742 Parse *pParse, /* Parsing context */
1743 Expr *pExpr, /* The IN, SELECT, or EXISTS operator */
drh6be515e2014-08-01 21:00:53 +00001744 int rHasNullFlag, /* Register that records whether NULLs exist in RHS */
drhfd773cf2009-05-29 14:39:07 +00001745 int isRowid /* If true, LHS of IN operator is a rowid */
danielk197741a05b72008-10-02 13:50:55 +00001746){
drh6be515e2014-08-01 21:00:53 +00001747 int jmpIfDynamic = -1; /* One-time test address */
drh1450bc62009-10-30 13:25:56 +00001748 int rReg = 0; /* Register storing resulting */
danielk1977b3bce662005-01-29 08:32:43 +00001749 Vdbe *v = sqlite3GetVdbe(pParse);
drh1450bc62009-10-30 13:25:56 +00001750 if( NEVER(v==0) ) return 0;
drhceea3322009-04-23 13:22:42 +00001751 sqlite3ExprCachePush(pParse);
danielk1977fc976062007-05-10 10:46:56 +00001752
drh57dbd7b2005-07-08 18:25:26 +00001753 /* This code must be run in its entirety every time it is encountered
1754 ** if any of the following is true:
1755 **
1756 ** * The right-hand side is a correlated subquery
1757 ** * The right-hand side is an expression list containing variables
1758 ** * We are inside a trigger
1759 **
1760 ** If all of the above are false, then we can run this code just once
1761 ** save the results, and reuse the same result on subsequent invocations.
danielk1977b3bce662005-01-29 08:32:43 +00001762 */
drhc5cd1242013-09-12 16:50:49 +00001763 if( !ExprHasProperty(pExpr, EP_VarSelect) ){
drh6be515e2014-08-01 21:00:53 +00001764 jmpIfDynamic = sqlite3CodeOnce(pParse); VdbeCoverage(v);
danielk1977b3bce662005-01-29 08:32:43 +00001765 }
1766
dan4a07e3d2010-11-09 14:48:59 +00001767#ifndef SQLITE_OMIT_EXPLAIN
1768 if( pParse->explain==2 ){
1769 char *zMsg = sqlite3MPrintf(
drh6be515e2014-08-01 21:00:53 +00001770 pParse->db, "EXECUTE %s%s SUBQUERY %d", jmpIfDynamic>=0?"":"CORRELATED ",
dan4a07e3d2010-11-09 14:48:59 +00001771 pExpr->op==TK_IN?"LIST":"SCALAR", pParse->iNextSelectId
1772 );
1773 sqlite3VdbeAddOp4(v, OP_Explain, pParse->iSelectId, 0, 0, zMsg, P4_DYNAMIC);
1774 }
1775#endif
1776
drhcce7d172000-05-31 15:34:51 +00001777 switch( pExpr->op ){
drhfef52082000-06-06 01:50:43 +00001778 case TK_IN: {
drhd4187c72010-08-30 22:15:45 +00001779 char affinity; /* Affinity of the LHS of the IN */
drhd4187c72010-08-30 22:15:45 +00001780 int addr; /* Address of OP_OpenEphemeral instruction */
1781 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
drh323df792013-08-05 19:11:29 +00001782 KeyInfo *pKeyInfo = 0; /* Key information */
drhd3d39e92004-05-20 22:16:29 +00001783
danielk197741a05b72008-10-02 13:50:55 +00001784 affinity = sqlite3ExprAffinity(pLeft);
danielk1977e014a832004-05-17 10:48:57 +00001785
1786 /* Whether this is an 'x IN(SELECT...)' or an 'x IN(<exprlist>)'
drh8cff69d2009-11-12 19:59:44 +00001787 ** expression it is handled the same way. An ephemeral table is
danielk1977e014a832004-05-17 10:48:57 +00001788 ** filled with single-field index keys representing the results
1789 ** from the SELECT or the <exprlist>.
1790 **
1791 ** If the 'x' expression is a column value, or the SELECT...
1792 ** statement returns a column value, then the affinity of that
1793 ** column is used to build the index keys. If both 'x' and the
1794 ** SELECT... statement are columns, then numeric affinity is used
1795 ** if either column has NUMERIC or INTEGER affinity. If neither
1796 ** 'x' nor the SELECT... statement are columns, then numeric affinity
1797 ** is used.
1798 */
1799 pExpr->iTable = pParse->nTab++;
danielk197741a05b72008-10-02 13:50:55 +00001800 addr = sqlite3VdbeAddOp2(v, OP_OpenEphemeral, pExpr->iTable, !isRowid);
drhad124322013-10-23 13:30:58 +00001801 pKeyInfo = isRowid ? 0 : sqlite3KeyInfoAlloc(pParse->db, 1, 1);
danielk1977e014a832004-05-17 10:48:57 +00001802
danielk19776ab3a2e2009-02-19 14:39:25 +00001803 if( ExprHasProperty(pExpr, EP_xIsSelect) ){
drhfef52082000-06-06 01:50:43 +00001804 /* Case 1: expr IN (SELECT ...)
1805 **
danielk1977e014a832004-05-17 10:48:57 +00001806 ** Generate code to write the results of the select into the temporary
1807 ** table allocated and opened above.
drhfef52082000-06-06 01:50:43 +00001808 */
drh43870062014-07-31 15:44:44 +00001809 Select *pSelect = pExpr->x.pSelect;
drh1013c932008-01-06 00:25:21 +00001810 SelectDest dest;
drhbe5c89a2004-07-26 00:31:09 +00001811 ExprList *pEList;
drh1013c932008-01-06 00:25:21 +00001812
danielk197741a05b72008-10-02 13:50:55 +00001813 assert( !isRowid );
drh1013c932008-01-06 00:25:21 +00001814 sqlite3SelectDestInit(&dest, SRT_Set, pExpr->iTable);
drh2b596da2012-07-23 21:43:19 +00001815 dest.affSdst = (u8)affinity;
danielk1977e014a832004-05-17 10:48:57 +00001816 assert( (pExpr->iTable&0x0000FFFF)==pExpr->iTable );
drh43870062014-07-31 15:44:44 +00001817 pSelect->iLimit = 0;
1818 testcase( pSelect->selFlags & SF_Distinct );
1819 pSelect->selFlags &= ~SF_Distinct;
drh812ea832013-08-06 17:24:23 +00001820 testcase( pKeyInfo==0 ); /* Caused by OOM in sqlite3KeyInfoAlloc() */
drh43870062014-07-31 15:44:44 +00001821 if( sqlite3Select(pParse, pSelect, &dest) ){
drh2ec2fb22013-11-06 19:59:23 +00001822 sqlite3KeyInfoUnref(pKeyInfo);
drh1450bc62009-10-30 13:25:56 +00001823 return 0;
drh94ccde52007-04-13 16:06:32 +00001824 }
drh43870062014-07-31 15:44:44 +00001825 pEList = pSelect->pEList;
drh812ea832013-08-06 17:24:23 +00001826 assert( pKeyInfo!=0 ); /* OOM will cause exit after sqlite3Select() */
drh3535ec32013-08-06 16:56:44 +00001827 assert( pEList!=0 );
1828 assert( pEList->nExpr>0 );
drh2ec2fb22013-11-06 19:59:23 +00001829 assert( sqlite3KeyInfoIsWriteable(pKeyInfo) );
drh3535ec32013-08-06 16:56:44 +00001830 pKeyInfo->aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
1831 pEList->a[0].pExpr);
drha7d2db12010-07-14 20:23:52 +00001832 }else if( ALWAYS(pExpr->x.pList!=0) ){
drhfef52082000-06-06 01:50:43 +00001833 /* Case 2: expr IN (exprlist)
1834 **
drhfd131da2007-08-07 17:13:03 +00001835 ** For each expression, build an index key from the evaluation and
danielk1977e014a832004-05-17 10:48:57 +00001836 ** store it in the temporary table. If <expr> is a column, then use
1837 ** that columns affinity when building index keys. If <expr> is not
1838 ** a column, use numeric affinity.
drhfef52082000-06-06 01:50:43 +00001839 */
danielk1977e014a832004-05-17 10:48:57 +00001840 int i;
danielk19776ab3a2e2009-02-19 14:39:25 +00001841 ExprList *pList = pExpr->x.pList;
drh57dbd7b2005-07-08 18:25:26 +00001842 struct ExprList_item *pItem;
drhecc31802008-06-26 20:06:06 +00001843 int r1, r2, r3;
drh57dbd7b2005-07-08 18:25:26 +00001844
danielk1977e014a832004-05-17 10:48:57 +00001845 if( !affinity ){
drh8159a352006-05-23 23:22:29 +00001846 affinity = SQLITE_AFF_NONE;
danielk1977e014a832004-05-17 10:48:57 +00001847 }
drh323df792013-08-05 19:11:29 +00001848 if( pKeyInfo ){
drh2ec2fb22013-11-06 19:59:23 +00001849 assert( sqlite3KeyInfoIsWriteable(pKeyInfo) );
drh323df792013-08-05 19:11:29 +00001850 pKeyInfo->aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
1851 }
danielk1977e014a832004-05-17 10:48:57 +00001852
1853 /* Loop through each expression in <exprlist>. */
drh2d401ab2008-01-10 23:50:11 +00001854 r1 = sqlite3GetTempReg(pParse);
1855 r2 = sqlite3GetTempReg(pParse);
drh37e08082014-07-31 20:16:08 +00001856 if( isRowid ) sqlite3VdbeAddOp2(v, OP_Null, 0, r2);
drh57dbd7b2005-07-08 18:25:26 +00001857 for(i=pList->nExpr, pItem=pList->a; i>0; i--, pItem++){
1858 Expr *pE2 = pItem->pExpr;
drhe05c9292009-10-29 13:48:10 +00001859 int iValToIns;
danielk1977e014a832004-05-17 10:48:57 +00001860
drh57dbd7b2005-07-08 18:25:26 +00001861 /* If the expression is not constant then we will need to
1862 ** disable the test that was generated above that makes sure
1863 ** this code only executes once. Because for a non-constant
1864 ** expression we need to rerun this code each time.
1865 */
drh6be515e2014-08-01 21:00:53 +00001866 if( jmpIfDynamic>=0 && !sqlite3ExprIsConstant(pE2) ){
1867 sqlite3VdbeChangeToNoop(v, jmpIfDynamic);
1868 jmpIfDynamic = -1;
drh4794b982000-06-06 13:54:14 +00001869 }
danielk1977e014a832004-05-17 10:48:57 +00001870
1871 /* Evaluate the expression and insert it into the temp table */
drhe05c9292009-10-29 13:48:10 +00001872 if( isRowid && sqlite3ExprIsInteger(pE2, &iValToIns) ){
1873 sqlite3VdbeAddOp3(v, OP_InsertInt, pExpr->iTable, r2, iValToIns);
danielk197741a05b72008-10-02 13:50:55 +00001874 }else{
drhe05c9292009-10-29 13:48:10 +00001875 r3 = sqlite3ExprCodeTarget(pParse, pE2, r1);
1876 if( isRowid ){
1877 sqlite3VdbeAddOp2(v, OP_MustBeInt, r3,
1878 sqlite3VdbeCurrentAddr(v)+2);
drh688852a2014-02-17 22:40:43 +00001879 VdbeCoverage(v);
drhe05c9292009-10-29 13:48:10 +00001880 sqlite3VdbeAddOp3(v, OP_Insert, pExpr->iTable, r2, r3);
1881 }else{
1882 sqlite3VdbeAddOp4(v, OP_MakeRecord, r3, 1, r2, &affinity, 1);
1883 sqlite3ExprCacheAffinityChange(pParse, r3, 1);
1884 sqlite3VdbeAddOp2(v, OP_IdxInsert, pExpr->iTable, r2);
1885 }
danielk197741a05b72008-10-02 13:50:55 +00001886 }
drhfef52082000-06-06 01:50:43 +00001887 }
drh2d401ab2008-01-10 23:50:11 +00001888 sqlite3ReleaseTempReg(pParse, r1);
1889 sqlite3ReleaseTempReg(pParse, r2);
drhfef52082000-06-06 01:50:43 +00001890 }
drh323df792013-08-05 19:11:29 +00001891 if( pKeyInfo ){
drh2ec2fb22013-11-06 19:59:23 +00001892 sqlite3VdbeChangeP4(v, addr, (void *)pKeyInfo, P4_KEYINFO);
danielk197741a05b72008-10-02 13:50:55 +00001893 }
danielk1977b3bce662005-01-29 08:32:43 +00001894 break;
drhfef52082000-06-06 01:50:43 +00001895 }
1896
drh51522cd2005-01-20 13:36:19 +00001897 case TK_EXISTS:
drhfd773cf2009-05-29 14:39:07 +00001898 case TK_SELECT:
1899 default: {
drhfd773cf2009-05-29 14:39:07 +00001900 /* If this has to be a scalar SELECT. Generate code to put the
drhfef52082000-06-06 01:50:43 +00001901 ** value of this select in a memory cell and record the number
drhfd773cf2009-05-29 14:39:07 +00001902 ** of the memory cell in iColumn. If this is an EXISTS, write
1903 ** an integer 0 (not exists) or 1 (exists) into a memory cell
1904 ** and record that memory cell in iColumn.
drhfef52082000-06-06 01:50:43 +00001905 */
drhfd773cf2009-05-29 14:39:07 +00001906 Select *pSel; /* SELECT statement to encode */
1907 SelectDest dest; /* How to deal with SELECt result */
drh1398ad32005-01-19 23:24:50 +00001908
shanecf697392009-06-01 16:53:09 +00001909 testcase( pExpr->op==TK_EXISTS );
1910 testcase( pExpr->op==TK_SELECT );
1911 assert( pExpr->op==TK_EXISTS || pExpr->op==TK_SELECT );
1912
danielk19776ab3a2e2009-02-19 14:39:25 +00001913 assert( ExprHasProperty(pExpr, EP_xIsSelect) );
1914 pSel = pExpr->x.pSelect;
drh1013c932008-01-06 00:25:21 +00001915 sqlite3SelectDestInit(&dest, 0, ++pParse->nMem);
drh51522cd2005-01-20 13:36:19 +00001916 if( pExpr->op==TK_SELECT ){
danielk19776c8c8ce2008-01-02 16:27:09 +00001917 dest.eDest = SRT_Mem;
drh53932ce2014-08-29 12:29:39 +00001918 dest.iSdst = dest.iSDParm;
drh2b596da2012-07-23 21:43:19 +00001919 sqlite3VdbeAddOp2(v, OP_Null, 0, dest.iSDParm);
drhd4e70eb2008-01-02 00:34:36 +00001920 VdbeComment((v, "Init subquery result"));
drh51522cd2005-01-20 13:36:19 +00001921 }else{
danielk19776c8c8ce2008-01-02 16:27:09 +00001922 dest.eDest = SRT_Exists;
drh2b596da2012-07-23 21:43:19 +00001923 sqlite3VdbeAddOp2(v, OP_Integer, 0, dest.iSDParm);
drhd4e70eb2008-01-02 00:34:36 +00001924 VdbeComment((v, "Init EXISTS result"));
drh51522cd2005-01-20 13:36:19 +00001925 }
drh633e6d52008-07-28 19:34:53 +00001926 sqlite3ExprDelete(pParse->db, pSel->pLimit);
drh094430e2010-07-14 18:24:06 +00001927 pSel->pLimit = sqlite3PExpr(pParse, TK_INTEGER, 0, 0,
1928 &sqlite3IntTokens[1]);
drh48b5b042010-12-06 18:50:32 +00001929 pSel->iLimit = 0;
drh7d10d5a2008-08-20 16:35:10 +00001930 if( sqlite3Select(pParse, pSel, &dest) ){
drh1450bc62009-10-30 13:25:56 +00001931 return 0;
drh94ccde52007-04-13 16:06:32 +00001932 }
drh2b596da2012-07-23 21:43:19 +00001933 rReg = dest.iSDParm;
drhebb6a652013-09-12 23:42:22 +00001934 ExprSetVVAProperty(pExpr, EP_NoReduce);
danielk1977b3bce662005-01-29 08:32:43 +00001935 break;
drhcce7d172000-05-31 15:34:51 +00001936 }
1937 }
danielk1977b3bce662005-01-29 08:32:43 +00001938
drh6be515e2014-08-01 21:00:53 +00001939 if( rHasNullFlag ){
1940 sqlite3SetHasNullFlag(v, pExpr->iTable, rHasNullFlag);
1941 }
1942
1943 if( jmpIfDynamic>=0 ){
1944 sqlite3VdbeJumpHere(v, jmpIfDynamic);
danielk1977b3bce662005-01-29 08:32:43 +00001945 }
drhd2490902014-04-13 19:28:15 +00001946 sqlite3ExprCachePop(pParse);
danielk1977fc976062007-05-10 10:46:56 +00001947
drh1450bc62009-10-30 13:25:56 +00001948 return rReg;
drhcce7d172000-05-31 15:34:51 +00001949}
drh51522cd2005-01-20 13:36:19 +00001950#endif /* SQLITE_OMIT_SUBQUERY */
drhcce7d172000-05-31 15:34:51 +00001951
drhe3365e62009-11-12 17:52:24 +00001952#ifndef SQLITE_OMIT_SUBQUERY
1953/*
1954** Generate code for an IN expression.
1955**
1956** x IN (SELECT ...)
1957** x IN (value, value, ...)
1958**
1959** The left-hand side (LHS) is a scalar expression. The right-hand side (RHS)
1960** is an array of zero or more values. The expression is true if the LHS is
1961** contained within the RHS. The value of the expression is unknown (NULL)
1962** if the LHS is NULL or if the LHS is not contained within the RHS and the
1963** RHS contains one or more NULL values.
1964**
drh6be515e2014-08-01 21:00:53 +00001965** This routine generates code that jumps to destIfFalse if the LHS is not
drhe3365e62009-11-12 17:52:24 +00001966** contained within the RHS. If due to NULLs we cannot determine if the LHS
1967** is contained in the RHS then jump to destIfNull. If the LHS is contained
1968** within the RHS then fall through.
1969*/
1970static void sqlite3ExprCodeIN(
1971 Parse *pParse, /* Parsing and code generating context */
1972 Expr *pExpr, /* The IN expression */
1973 int destIfFalse, /* Jump here if LHS is not contained in the RHS */
1974 int destIfNull /* Jump here if the results are unknown due to NULLs */
1975){
1976 int rRhsHasNull = 0; /* Register that is true if RHS contains NULL values */
1977 char affinity; /* Comparison affinity to use */
1978 int eType; /* Type of the RHS */
1979 int r1; /* Temporary use register */
1980 Vdbe *v; /* Statement under construction */
1981
1982 /* Compute the RHS. After this step, the table with cursor
1983 ** pExpr->iTable will contains the values that make up the RHS.
1984 */
1985 v = pParse->pVdbe;
1986 assert( v!=0 ); /* OOM detected prior to this routine */
1987 VdbeNoopComment((v, "begin IN expr"));
drhbb53ecb2014-08-02 21:03:33 +00001988 eType = sqlite3FindInIndex(pParse, pExpr,
1989 IN_INDEX_MEMBERSHIP | IN_INDEX_NOOP_OK,
drh3a856252014-08-01 14:46:57 +00001990 destIfFalse==destIfNull ? 0 : &rRhsHasNull);
drhe3365e62009-11-12 17:52:24 +00001991
1992 /* Figure out the affinity to use to create a key from the results
1993 ** of the expression. affinityStr stores a static string suitable for
1994 ** P4 of OP_MakeRecord.
1995 */
1996 affinity = comparisonAffinity(pExpr);
1997
1998 /* Code the LHS, the <expr> from "<expr> IN (...)".
1999 */
2000 sqlite3ExprCachePush(pParse);
2001 r1 = sqlite3GetTempReg(pParse);
2002 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
drhe3365e62009-11-12 17:52:24 +00002003
drhbb53ecb2014-08-02 21:03:33 +00002004 /* If sqlite3FindInIndex() did not find or create an index that is
2005 ** suitable for evaluating the IN operator, then evaluate using a
2006 ** sequence of comparisons.
drh094430e2010-07-14 18:24:06 +00002007 */
drhbb53ecb2014-08-02 21:03:33 +00002008 if( eType==IN_INDEX_NOOP ){
2009 ExprList *pList = pExpr->x.pList;
2010 CollSeq *pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
2011 int labelOk = sqlite3VdbeMakeLabel(v);
2012 int r2, regToFree;
2013 int regCkNull = 0;
2014 int ii;
2015 assert( !ExprHasProperty(pExpr, EP_xIsSelect) );
drhbb53ecb2014-08-02 21:03:33 +00002016 if( destIfNull!=destIfFalse ){
2017 regCkNull = sqlite3GetTempReg(pParse);
drha9769792014-08-04 16:39:39 +00002018 sqlite3VdbeAddOp3(v, OP_BitAnd, r1, r1, regCkNull);
drhbb53ecb2014-08-02 21:03:33 +00002019 }
2020 for(ii=0; ii<pList->nExpr; ii++){
2021 r2 = sqlite3ExprCodeTemp(pParse, pList->a[ii].pExpr, &regToFree);
drha9769792014-08-04 16:39:39 +00002022 if( regCkNull && sqlite3ExprCanBeNull(pList->a[ii].pExpr) ){
drhbb53ecb2014-08-02 21:03:33 +00002023 sqlite3VdbeAddOp3(v, OP_BitAnd, regCkNull, r2, regCkNull);
2024 }
2025 if( ii<pList->nExpr-1 || destIfNull!=destIfFalse ){
2026 sqlite3VdbeAddOp4(v, OP_Eq, r1, labelOk, r2,
drh4336b0e2014-08-05 00:53:51 +00002027 (void*)pColl, P4_COLLSEQ);
2028 VdbeCoverageIf(v, ii<pList->nExpr-1);
2029 VdbeCoverageIf(v, ii==pList->nExpr-1);
drhbb53ecb2014-08-02 21:03:33 +00002030 sqlite3VdbeChangeP5(v, affinity);
2031 }else{
2032 assert( destIfNull==destIfFalse );
2033 sqlite3VdbeAddOp4(v, OP_Ne, r1, destIfFalse, r2,
2034 (void*)pColl, P4_COLLSEQ); VdbeCoverage(v);
2035 sqlite3VdbeChangeP5(v, affinity | SQLITE_JUMPIFNULL);
2036 }
2037 sqlite3ReleaseTempReg(pParse, regToFree);
2038 }
2039 if( regCkNull ){
2040 sqlite3VdbeAddOp2(v, OP_IsNull, regCkNull, destIfNull); VdbeCoverage(v);
2041 sqlite3VdbeAddOp2(v, OP_Goto, 0, destIfFalse);
2042 }
2043 sqlite3VdbeResolveLabel(v, labelOk);
2044 sqlite3ReleaseTempReg(pParse, regCkNull);
drh094430e2010-07-14 18:24:06 +00002045 }else{
drhbb53ecb2014-08-02 21:03:33 +00002046
2047 /* If the LHS is NULL, then the result is either false or NULL depending
2048 ** on whether the RHS is empty or not, respectively.
drhe3365e62009-11-12 17:52:24 +00002049 */
drh7248a8b2014-08-04 18:50:54 +00002050 if( sqlite3ExprCanBeNull(pExpr->pLeft) ){
2051 if( destIfNull==destIfFalse ){
2052 /* Shortcut for the common case where the false and NULL outcomes are
2053 ** the same. */
2054 sqlite3VdbeAddOp2(v, OP_IsNull, r1, destIfNull); VdbeCoverage(v);
2055 }else{
2056 int addr1 = sqlite3VdbeAddOp1(v, OP_NotNull, r1); VdbeCoverage(v);
2057 sqlite3VdbeAddOp2(v, OP_Rewind, pExpr->iTable, destIfFalse);
2058 VdbeCoverage(v);
2059 sqlite3VdbeAddOp2(v, OP_Goto, 0, destIfNull);
2060 sqlite3VdbeJumpHere(v, addr1);
2061 }
drhbb53ecb2014-08-02 21:03:33 +00002062 }
2063
2064 if( eType==IN_INDEX_ROWID ){
2065 /* In this case, the RHS is the ROWID of table b-tree
drhe3365e62009-11-12 17:52:24 +00002066 */
drhbb53ecb2014-08-02 21:03:33 +00002067 sqlite3VdbeAddOp2(v, OP_MustBeInt, r1, destIfFalse); VdbeCoverage(v);
2068 sqlite3VdbeAddOp3(v, OP_NotExists, pExpr->iTable, destIfFalse, r1);
drh688852a2014-02-17 22:40:43 +00002069 VdbeCoverage(v);
drhe3365e62009-11-12 17:52:24 +00002070 }else{
drhbb53ecb2014-08-02 21:03:33 +00002071 /* In this case, the RHS is an index b-tree.
drhe3365e62009-11-12 17:52:24 +00002072 */
drhbb53ecb2014-08-02 21:03:33 +00002073 sqlite3VdbeAddOp4(v, OP_Affinity, r1, 1, 0, &affinity, 1);
2074
2075 /* If the set membership test fails, then the result of the
2076 ** "x IN (...)" expression must be either 0 or NULL. If the set
2077 ** contains no NULL values, then the result is 0. If the set
2078 ** contains one or more NULL values, then the result of the
2079 ** expression is also NULL.
drhe3365e62009-11-12 17:52:24 +00002080 */
drhbb53ecb2014-08-02 21:03:33 +00002081 assert( destIfFalse!=destIfNull || rRhsHasNull==0 );
2082 if( rRhsHasNull==0 ){
2083 /* This branch runs if it is known at compile time that the RHS
2084 ** cannot contain NULL values. This happens as the result
2085 ** of a "NOT NULL" constraint in the database schema.
2086 **
2087 ** Also run this branch if NULL is equivalent to FALSE
2088 ** for this particular IN operator.
2089 */
2090 sqlite3VdbeAddOp4Int(v, OP_NotFound, pExpr->iTable, destIfFalse, r1, 1);
2091 VdbeCoverage(v);
2092 }else{
2093 /* In this branch, the RHS of the IN might contain a NULL and
2094 ** the presence of a NULL on the RHS makes a difference in the
2095 ** outcome.
2096 */
2097 int j1;
2098
2099 /* First check to see if the LHS is contained in the RHS. If so,
2100 ** then the answer is TRUE the presence of NULLs in the RHS does
2101 ** not matter. If the LHS is not contained in the RHS, then the
2102 ** answer is NULL if the RHS contains NULLs and the answer is
2103 ** FALSE if the RHS is NULL-free.
2104 */
2105 j1 = sqlite3VdbeAddOp4Int(v, OP_Found, pExpr->iTable, 0, r1, 1);
2106 VdbeCoverage(v);
2107 sqlite3VdbeAddOp2(v, OP_IsNull, rRhsHasNull, destIfNull);
2108 VdbeCoverage(v);
2109 sqlite3VdbeAddOp2(v, OP_Goto, 0, destIfFalse);
2110 sqlite3VdbeJumpHere(v, j1);
2111 }
drhe3365e62009-11-12 17:52:24 +00002112 }
drhe3365e62009-11-12 17:52:24 +00002113 }
2114 sqlite3ReleaseTempReg(pParse, r1);
drhd2490902014-04-13 19:28:15 +00002115 sqlite3ExprCachePop(pParse);
drhe3365e62009-11-12 17:52:24 +00002116 VdbeComment((v, "end IN expr"));
2117}
2118#endif /* SQLITE_OMIT_SUBQUERY */
2119
drhcce7d172000-05-31 15:34:51 +00002120/*
drh598f1342007-10-23 15:39:45 +00002121** Duplicate an 8-byte value
2122*/
2123static char *dup8bytes(Vdbe *v, const char *in){
2124 char *out = sqlite3DbMallocRaw(sqlite3VdbeDb(v), 8);
2125 if( out ){
2126 memcpy(out, in, 8);
2127 }
2128 return out;
2129}
2130
drh13573c72010-01-12 17:04:07 +00002131#ifndef SQLITE_OMIT_FLOATING_POINT
drh598f1342007-10-23 15:39:45 +00002132/*
2133** Generate an instruction that will put the floating point
drh9cbf3422008-01-17 16:22:13 +00002134** value described by z[0..n-1] into register iMem.
drh0cf19ed2007-10-23 18:55:48 +00002135**
2136** The z[] string will probably not be zero-terminated. But the
2137** z[n] character is guaranteed to be something that does not look
2138** like the continuation of the number.
drh598f1342007-10-23 15:39:45 +00002139*/
drhb7916a72009-05-27 10:31:29 +00002140static void codeReal(Vdbe *v, const char *z, int negateFlag, int iMem){
drhfd773cf2009-05-29 14:39:07 +00002141 if( ALWAYS(z!=0) ){
drh598f1342007-10-23 15:39:45 +00002142 double value;
2143 char *zV;
drh9339da12010-09-30 00:50:49 +00002144 sqlite3AtoF(z, &value, sqlite3Strlen30(z), SQLITE_UTF8);
drhd0015162009-08-21 13:22:25 +00002145 assert( !sqlite3IsNaN(value) ); /* The new AtoF never returns NaN */
2146 if( negateFlag ) value = -value;
2147 zV = dup8bytes(v, (char*)&value);
2148 sqlite3VdbeAddOp4(v, OP_Real, 0, iMem, 0, zV, P4_REAL);
drh598f1342007-10-23 15:39:45 +00002149 }
2150}
drh13573c72010-01-12 17:04:07 +00002151#endif
drh598f1342007-10-23 15:39:45 +00002152
2153
2154/*
drhfec19aa2004-05-19 20:41:03 +00002155** Generate an instruction that will put the integer describe by
drh9cbf3422008-01-17 16:22:13 +00002156** text z[0..n-1] into register iMem.
drh0cf19ed2007-10-23 18:55:48 +00002157**
shaneh5f1d6b62010-09-30 16:51:25 +00002158** Expr.u.zToken is always UTF8 and zero-terminated.
drhfec19aa2004-05-19 20:41:03 +00002159*/
drh13573c72010-01-12 17:04:07 +00002160static void codeInteger(Parse *pParse, Expr *pExpr, int negFlag, int iMem){
2161 Vdbe *v = pParse->pVdbe;
drh92b01d52008-06-24 00:32:35 +00002162 if( pExpr->flags & EP_IntValue ){
drh33e619f2009-05-28 01:00:55 +00002163 int i = pExpr->u.iValue;
drhd50ffc42011-03-08 02:38:28 +00002164 assert( i>=0 );
drh92b01d52008-06-24 00:32:35 +00002165 if( negFlag ) i = -i;
2166 sqlite3VdbeAddOp2(v, OP_Integer, i, iMem);
drhfd773cf2009-05-29 14:39:07 +00002167 }else{
shaneh5f1d6b62010-09-30 16:51:25 +00002168 int c;
2169 i64 value;
drhfd773cf2009-05-29 14:39:07 +00002170 const char *z = pExpr->u.zToken;
2171 assert( z!=0 );
drh9296c182014-07-23 13:40:49 +00002172 c = sqlite3DecOrHexToI64(z, &value);
shaneh5f1d6b62010-09-30 16:51:25 +00002173 if( c==0 || (c==2 && negFlag) ){
drh598f1342007-10-23 15:39:45 +00002174 char *zV;
drh158b9cb2011-03-05 20:59:46 +00002175 if( negFlag ){ value = c==2 ? SMALLEST_INT64 : -value; }
drh598f1342007-10-23 15:39:45 +00002176 zV = dup8bytes(v, (char*)&value);
drh9de221d2008-01-05 06:51:30 +00002177 sqlite3VdbeAddOp4(v, OP_Int64, 0, iMem, 0, zV, P4_INT64);
danielk1977c9cf9012007-05-30 10:36:47 +00002178 }else{
drh13573c72010-01-12 17:04:07 +00002179#ifdef SQLITE_OMIT_FLOATING_POINT
2180 sqlite3ErrorMsg(pParse, "oversized integer: %s%s", negFlag ? "-" : "", z);
2181#else
drh1b7ddc52014-07-23 14:52:05 +00002182#ifndef SQLITE_OMIT_HEX_INTEGER
drh9296c182014-07-23 13:40:49 +00002183 if( sqlite3_strnicmp(z,"0x",2)==0 ){
2184 sqlite3ErrorMsg(pParse, "hex literal too big: %s", z);
drh1b7ddc52014-07-23 14:52:05 +00002185 }else
2186#endif
2187 {
drh9296c182014-07-23 13:40:49 +00002188 codeReal(v, z, negFlag, iMem);
2189 }
drh13573c72010-01-12 17:04:07 +00002190#endif
danielk1977c9cf9012007-05-30 10:36:47 +00002191 }
drhfec19aa2004-05-19 20:41:03 +00002192 }
2193}
2194
drhceea3322009-04-23 13:22:42 +00002195/*
2196** Clear a cache entry.
2197*/
2198static void cacheEntryClear(Parse *pParse, struct yColCache *p){
2199 if( p->tempReg ){
2200 if( pParse->nTempReg<ArraySize(pParse->aTempReg) ){
2201 pParse->aTempReg[pParse->nTempReg++] = p->iReg;
2202 }
2203 p->tempReg = 0;
2204 }
2205}
2206
2207
2208/*
2209** Record in the column cache that a particular column from a
2210** particular table is stored in a particular register.
2211*/
2212void sqlite3ExprCacheStore(Parse *pParse, int iTab, int iCol, int iReg){
2213 int i;
2214 int minLru;
2215 int idxLru;
2216 struct yColCache *p;
2217
drh20411ea2009-05-29 19:00:12 +00002218 assert( iReg>0 ); /* Register numbers are always positive */
2219 assert( iCol>=-1 && iCol<32768 ); /* Finite column numbers */
2220
drhb6da74e2009-12-24 16:00:28 +00002221 /* The SQLITE_ColumnCache flag disables the column cache. This is used
2222 ** for testing only - to verify that SQLite always gets the same answer
2223 ** with and without the column cache.
2224 */
drh7e5418e2012-09-27 15:05:54 +00002225 if( OptimizationDisabled(pParse->db, SQLITE_ColumnCache) ) return;
drhb6da74e2009-12-24 16:00:28 +00002226
drh27ee4062009-12-30 01:13:11 +00002227 /* First replace any existing entry.
2228 **
2229 ** Actually, the way the column cache is currently used, we are guaranteed
2230 ** that the object will never already be in cache. Verify this guarantee.
2231 */
2232#ifndef NDEBUG
drhceea3322009-04-23 13:22:42 +00002233 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
drh27ee4062009-12-30 01:13:11 +00002234 assert( p->iReg==0 || p->iTable!=iTab || p->iColumn!=iCol );
drhceea3322009-04-23 13:22:42 +00002235 }
drh27ee4062009-12-30 01:13:11 +00002236#endif
drhceea3322009-04-23 13:22:42 +00002237
2238 /* Find an empty slot and replace it */
2239 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
2240 if( p->iReg==0 ){
2241 p->iLevel = pParse->iCacheLevel;
2242 p->iTable = iTab;
2243 p->iColumn = iCol;
2244 p->iReg = iReg;
drhceea3322009-04-23 13:22:42 +00002245 p->tempReg = 0;
2246 p->lru = pParse->iCacheCnt++;
2247 return;
2248 }
2249 }
2250
2251 /* Replace the last recently used */
2252 minLru = 0x7fffffff;
2253 idxLru = -1;
2254 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
2255 if( p->lru<minLru ){
2256 idxLru = i;
2257 minLru = p->lru;
2258 }
2259 }
drh20411ea2009-05-29 19:00:12 +00002260 if( ALWAYS(idxLru>=0) ){
drhceea3322009-04-23 13:22:42 +00002261 p = &pParse->aColCache[idxLru];
2262 p->iLevel = pParse->iCacheLevel;
2263 p->iTable = iTab;
2264 p->iColumn = iCol;
2265 p->iReg = iReg;
drhceea3322009-04-23 13:22:42 +00002266 p->tempReg = 0;
2267 p->lru = pParse->iCacheCnt++;
2268 return;
2269 }
2270}
2271
2272/*
drhf49f3522009-12-30 14:12:38 +00002273** Indicate that registers between iReg..iReg+nReg-1 are being overwritten.
2274** Purge the range of registers from the column cache.
drhceea3322009-04-23 13:22:42 +00002275*/
drhf49f3522009-12-30 14:12:38 +00002276void sqlite3ExprCacheRemove(Parse *pParse, int iReg, int nReg){
drhceea3322009-04-23 13:22:42 +00002277 int i;
drhf49f3522009-12-30 14:12:38 +00002278 int iLast = iReg + nReg - 1;
drhceea3322009-04-23 13:22:42 +00002279 struct yColCache *p;
2280 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
drhf49f3522009-12-30 14:12:38 +00002281 int r = p->iReg;
2282 if( r>=iReg && r<=iLast ){
drhceea3322009-04-23 13:22:42 +00002283 cacheEntryClear(pParse, p);
2284 p->iReg = 0;
2285 }
2286 }
2287}
2288
2289/*
2290** Remember the current column cache context. Any new entries added
2291** added to the column cache after this call are removed when the
2292** corresponding pop occurs.
2293*/
2294void sqlite3ExprCachePush(Parse *pParse){
2295 pParse->iCacheLevel++;
drh9ac79622013-12-18 15:11:47 +00002296#ifdef SQLITE_DEBUG
2297 if( pParse->db->flags & SQLITE_VdbeAddopTrace ){
2298 printf("PUSH to %d\n", pParse->iCacheLevel);
2299 }
2300#endif
drhceea3322009-04-23 13:22:42 +00002301}
2302
2303/*
2304** Remove from the column cache any entries that were added since the
drhd2490902014-04-13 19:28:15 +00002305** the previous sqlite3ExprCachePush operation. In other words, restore
2306** the cache to the state it was in prior the most recent Push.
drhceea3322009-04-23 13:22:42 +00002307*/
drhd2490902014-04-13 19:28:15 +00002308void sqlite3ExprCachePop(Parse *pParse){
drhceea3322009-04-23 13:22:42 +00002309 int i;
2310 struct yColCache *p;
drhd2490902014-04-13 19:28:15 +00002311 assert( pParse->iCacheLevel>=1 );
2312 pParse->iCacheLevel--;
drh9ac79622013-12-18 15:11:47 +00002313#ifdef SQLITE_DEBUG
2314 if( pParse->db->flags & SQLITE_VdbeAddopTrace ){
2315 printf("POP to %d\n", pParse->iCacheLevel);
2316 }
2317#endif
drhceea3322009-04-23 13:22:42 +00002318 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
2319 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
2320 cacheEntryClear(pParse, p);
2321 p->iReg = 0;
2322 }
2323 }
2324}
drh945498f2007-02-24 11:52:52 +00002325
2326/*
drh5cd79232009-05-25 11:46:29 +00002327** When a cached column is reused, make sure that its register is
2328** no longer available as a temp register. ticket #3879: that same
2329** register might be in the cache in multiple places, so be sure to
2330** get them all.
2331*/
2332static void sqlite3ExprCachePinRegister(Parse *pParse, int iReg){
2333 int i;
2334 struct yColCache *p;
2335 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
2336 if( p->iReg==iReg ){
2337 p->tempReg = 0;
2338 }
2339 }
2340}
2341
2342/*
drh5c092e82010-05-14 19:24:02 +00002343** Generate code to extract the value of the iCol-th column of a table.
2344*/
2345void sqlite3ExprCodeGetColumnOfTable(
2346 Vdbe *v, /* The VDBE under construction */
2347 Table *pTab, /* The table containing the value */
drh313619f2013-10-31 20:34:06 +00002348 int iTabCur, /* The table cursor. Or the PK cursor for WITHOUT ROWID */
drh5c092e82010-05-14 19:24:02 +00002349 int iCol, /* Index of the column to extract */
drh313619f2013-10-31 20:34:06 +00002350 int regOut /* Extract the value into this register */
drh5c092e82010-05-14 19:24:02 +00002351){
2352 if( iCol<0 || iCol==pTab->iPKey ){
2353 sqlite3VdbeAddOp2(v, OP_Rowid, iTabCur, regOut);
2354 }else{
2355 int op = IsVirtual(pTab) ? OP_VColumn : OP_Column;
drhee0ec8e2013-10-31 17:38:01 +00002356 int x = iCol;
2357 if( !HasRowid(pTab) ){
2358 x = sqlite3ColumnOfIndex(sqlite3PrimaryKeyIndex(pTab), iCol);
2359 }
2360 sqlite3VdbeAddOp3(v, op, iTabCur, x, regOut);
drh5c092e82010-05-14 19:24:02 +00002361 }
2362 if( iCol>=0 ){
2363 sqlite3ColumnDefault(v, pTab, iCol, regOut);
2364 }
2365}
2366
2367/*
drh945498f2007-02-24 11:52:52 +00002368** Generate code that will extract the iColumn-th column from
drhe55cbd72008-03-31 23:48:03 +00002369** table pTab and store the column value in a register. An effort
2370** is made to store the column value in register iReg, but this is
2371** not guaranteed. The location of the column value is returned.
2372**
2373** There must be an open cursor to pTab in iTable when this routine
2374** is called. If iColumn<0 then code is generated that extracts the rowid.
drh945498f2007-02-24 11:52:52 +00002375*/
drhe55cbd72008-03-31 23:48:03 +00002376int sqlite3ExprCodeGetColumn(
2377 Parse *pParse, /* Parsing and code generating context */
drh2133d822008-01-03 18:44:59 +00002378 Table *pTab, /* Description of the table we are reading from */
2379 int iColumn, /* Index of the table column */
2380 int iTable, /* The cursor pointing to the table */
drha748fdc2012-03-28 01:34:47 +00002381 int iReg, /* Store results here */
2382 u8 p5 /* P5 value for OP_Column */
drh2133d822008-01-03 18:44:59 +00002383){
drhe55cbd72008-03-31 23:48:03 +00002384 Vdbe *v = pParse->pVdbe;
2385 int i;
drhda250ea2008-04-01 05:07:14 +00002386 struct yColCache *p;
drhe55cbd72008-03-31 23:48:03 +00002387
drhceea3322009-04-23 13:22:42 +00002388 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
drhb6da74e2009-12-24 16:00:28 +00002389 if( p->iReg>0 && p->iTable==iTable && p->iColumn==iColumn ){
drhceea3322009-04-23 13:22:42 +00002390 p->lru = pParse->iCacheCnt++;
drh5cd79232009-05-25 11:46:29 +00002391 sqlite3ExprCachePinRegister(pParse, p->iReg);
drhda250ea2008-04-01 05:07:14 +00002392 return p->iReg;
drhe55cbd72008-03-31 23:48:03 +00002393 }
2394 }
2395 assert( v!=0 );
drh5c092e82010-05-14 19:24:02 +00002396 sqlite3ExprCodeGetColumnOfTable(v, pTab, iTable, iColumn, iReg);
drha748fdc2012-03-28 01:34:47 +00002397 if( p5 ){
2398 sqlite3VdbeChangeP5(v, p5);
2399 }else{
2400 sqlite3ExprCacheStore(pParse, iTable, iColumn, iReg);
2401 }
drhe55cbd72008-03-31 23:48:03 +00002402 return iReg;
2403}
2404
2405/*
drhceea3322009-04-23 13:22:42 +00002406** Clear all column cache entries.
drhe55cbd72008-03-31 23:48:03 +00002407*/
drhceea3322009-04-23 13:22:42 +00002408void sqlite3ExprCacheClear(Parse *pParse){
2409 int i;
2410 struct yColCache *p;
2411
drh9ac79622013-12-18 15:11:47 +00002412#if SQLITE_DEBUG
2413 if( pParse->db->flags & SQLITE_VdbeAddopTrace ){
2414 printf("CLEAR\n");
2415 }
2416#endif
drhceea3322009-04-23 13:22:42 +00002417 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
2418 if( p->iReg ){
2419 cacheEntryClear(pParse, p);
2420 p->iReg = 0;
drhe55cbd72008-03-31 23:48:03 +00002421 }
drhe55cbd72008-03-31 23:48:03 +00002422 }
2423}
2424
2425/*
drhda250ea2008-04-01 05:07:14 +00002426** Record the fact that an affinity change has occurred on iCount
2427** registers starting with iStart.
drhe55cbd72008-03-31 23:48:03 +00002428*/
drhda250ea2008-04-01 05:07:14 +00002429void sqlite3ExprCacheAffinityChange(Parse *pParse, int iStart, int iCount){
drhf49f3522009-12-30 14:12:38 +00002430 sqlite3ExprCacheRemove(pParse, iStart, iCount);
drhe55cbd72008-03-31 23:48:03 +00002431}
2432
2433/*
drhb21e7c72008-06-22 12:37:57 +00002434** Generate code to move content from registers iFrom...iFrom+nReg-1
2435** over to iTo..iTo+nReg-1. Keep the column cache up-to-date.
drhe55cbd72008-03-31 23:48:03 +00002436*/
drhb21e7c72008-06-22 12:37:57 +00002437void sqlite3ExprCodeMove(Parse *pParse, int iFrom, int iTo, int nReg){
drhe8e4af72012-09-21 00:04:28 +00002438 assert( iFrom>=iTo+nReg || iFrom+nReg<=iTo );
drh079a3072014-03-19 14:10:55 +00002439 sqlite3VdbeAddOp3(pParse->pVdbe, OP_Move, iFrom, iTo, nReg);
drh236241a2014-09-12 17:41:30 +00002440 sqlite3ExprCacheRemove(pParse, iFrom, nReg);
drh945498f2007-02-24 11:52:52 +00002441}
2442
drhf49f3522009-12-30 14:12:38 +00002443#if defined(SQLITE_DEBUG) || defined(SQLITE_COVERAGE_TEST)
drh92b01d52008-06-24 00:32:35 +00002444/*
drh652fbf52008-04-01 01:42:41 +00002445** Return true if any register in the range iFrom..iTo (inclusive)
2446** is used as part of the column cache.
drhf49f3522009-12-30 14:12:38 +00002447**
2448** This routine is used within assert() and testcase() macros only
2449** and does not appear in a normal build.
drh652fbf52008-04-01 01:42:41 +00002450*/
2451static int usedAsColumnCache(Parse *pParse, int iFrom, int iTo){
2452 int i;
drhceea3322009-04-23 13:22:42 +00002453 struct yColCache *p;
2454 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
2455 int r = p->iReg;
drhf49f3522009-12-30 14:12:38 +00002456 if( r>=iFrom && r<=iTo ) return 1; /*NO_TEST*/
drh652fbf52008-04-01 01:42:41 +00002457 }
2458 return 0;
2459}
drhf49f3522009-12-30 14:12:38 +00002460#endif /* SQLITE_DEBUG || SQLITE_COVERAGE_TEST */
drh652fbf52008-04-01 01:42:41 +00002461
2462/*
drha4c3c872013-09-12 17:29:25 +00002463** Convert an expression node to a TK_REGISTER
2464*/
2465static void exprToRegister(Expr *p, int iReg){
2466 p->op2 = p->op;
2467 p->op = TK_REGISTER;
2468 p->iTable = iReg;
2469 ExprClearProperty(p, EP_Skip);
2470}
2471
2472/*
drhcce7d172000-05-31 15:34:51 +00002473** Generate code into the current Vdbe to evaluate the given
drh2dcef112008-01-12 19:03:48 +00002474** expression. Attempt to store the results in register "target".
2475** Return the register where results are stored.
drh389a1ad2008-01-03 23:44:53 +00002476**
drh8b213892008-08-29 02:14:02 +00002477** With this routine, there is no guarantee that results will
drh2dcef112008-01-12 19:03:48 +00002478** be stored in target. The result might be stored in some other
2479** register if it is convenient to do so. The calling function
2480** must check the return code and move the results to the desired
2481** register.
drhcce7d172000-05-31 15:34:51 +00002482*/
drh678ccce2008-03-31 18:19:54 +00002483int sqlite3ExprCodeTarget(Parse *pParse, Expr *pExpr, int target){
drh2dcef112008-01-12 19:03:48 +00002484 Vdbe *v = pParse->pVdbe; /* The VM under construction */
2485 int op; /* The opcode being coded */
2486 int inReg = target; /* Results stored in register inReg */
2487 int regFree1 = 0; /* If non-zero free this temporary register */
2488 int regFree2 = 0; /* If non-zero free this temporary register */
drh678ccce2008-03-31 18:19:54 +00002489 int r1, r2, r3, r4; /* Various register numbers */
drh20411ea2009-05-29 19:00:12 +00002490 sqlite3 *db = pParse->db; /* The database connection */
drh10d1edf2013-11-15 15:52:39 +00002491 Expr tempX; /* Temporary expression node */
drhffe07b22005-11-03 00:41:17 +00002492
drh9cbf3422008-01-17 16:22:13 +00002493 assert( target>0 && target<=pParse->nMem );
drh20411ea2009-05-29 19:00:12 +00002494 if( v==0 ){
2495 assert( pParse->db->mallocFailed );
2496 return 0;
2497 }
drh389a1ad2008-01-03 23:44:53 +00002498
2499 if( pExpr==0 ){
2500 op = TK_NULL;
2501 }else{
2502 op = pExpr->op;
2503 }
drhf2bc0132004-10-04 13:19:23 +00002504 switch( op ){
drh13449892005-09-07 21:22:45 +00002505 case TK_AGG_COLUMN: {
2506 AggInfo *pAggInfo = pExpr->pAggInfo;
2507 struct AggInfo_col *pCol = &pAggInfo->aCol[pExpr->iAgg];
2508 if( !pAggInfo->directMode ){
drh9de221d2008-01-05 06:51:30 +00002509 assert( pCol->iMem>0 );
2510 inReg = pCol->iMem;
drh13449892005-09-07 21:22:45 +00002511 break;
2512 }else if( pAggInfo->useSortingIdx ){
dan5134d132011-09-02 10:31:11 +00002513 sqlite3VdbeAddOp3(v, OP_Column, pAggInfo->sortingIdxPTab,
drh389a1ad2008-01-03 23:44:53 +00002514 pCol->iSorterColumn, target);
drh13449892005-09-07 21:22:45 +00002515 break;
2516 }
2517 /* Otherwise, fall thru into the TK_COLUMN case */
2518 }
drh967e8b72000-06-21 13:59:10 +00002519 case TK_COLUMN: {
drhb2b9d3d2013-08-01 01:14:43 +00002520 int iTab = pExpr->iTable;
2521 if( iTab<0 ){
2522 if( pParse->ckBase>0 ){
2523 /* Generating CHECK constraints or inserting into partial index */
2524 inReg = pExpr->iColumn + pParse->ckBase;
2525 break;
2526 }else{
2527 /* Deleting from a partial index */
2528 iTab = pParse->iPartIdxTab;
2529 }
drh22827922000-06-06 17:27:05 +00002530 }
drhb2b9d3d2013-08-01 01:14:43 +00002531 inReg = sqlite3ExprCodeGetColumn(pParse, pExpr->pTab,
2532 pExpr->iColumn, iTab, target,
2533 pExpr->op2);
drhcce7d172000-05-31 15:34:51 +00002534 break;
2535 }
2536 case TK_INTEGER: {
drh13573c72010-01-12 17:04:07 +00002537 codeInteger(pParse, pExpr, 0, target);
drhfec19aa2004-05-19 20:41:03 +00002538 break;
2539 }
drh13573c72010-01-12 17:04:07 +00002540#ifndef SQLITE_OMIT_FLOATING_POINT
drh598f1342007-10-23 15:39:45 +00002541 case TK_FLOAT: {
drh33e619f2009-05-28 01:00:55 +00002542 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2543 codeReal(v, pExpr->u.zToken, 0, target);
drh598f1342007-10-23 15:39:45 +00002544 break;
2545 }
drh13573c72010-01-12 17:04:07 +00002546#endif
drhfec19aa2004-05-19 20:41:03 +00002547 case TK_STRING: {
drh33e619f2009-05-28 01:00:55 +00002548 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2549 sqlite3VdbeAddOp4(v, OP_String8, 0, target, 0, pExpr->u.zToken, 0);
drhcce7d172000-05-31 15:34:51 +00002550 break;
2551 }
drhf0863fe2005-06-12 21:35:51 +00002552 case TK_NULL: {
drh9de221d2008-01-05 06:51:30 +00002553 sqlite3VdbeAddOp2(v, OP_Null, 0, target);
drhf0863fe2005-06-12 21:35:51 +00002554 break;
2555 }
danielk19775338a5f2005-01-20 13:03:10 +00002556#ifndef SQLITE_OMIT_BLOB_LITERAL
danielk1977c572ef72004-05-27 09:28:41 +00002557 case TK_BLOB: {
drh6c8c6ce2005-08-23 11:17:58 +00002558 int n;
2559 const char *z;
drhca48c902008-01-18 14:08:24 +00002560 char *zBlob;
drh33e619f2009-05-28 01:00:55 +00002561 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2562 assert( pExpr->u.zToken[0]=='x' || pExpr->u.zToken[0]=='X' );
2563 assert( pExpr->u.zToken[1]=='\'' );
2564 z = &pExpr->u.zToken[2];
drhb7916a72009-05-27 10:31:29 +00002565 n = sqlite3Strlen30(z) - 1;
2566 assert( z[n]=='\'' );
drhca48c902008-01-18 14:08:24 +00002567 zBlob = sqlite3HexToBlob(sqlite3VdbeDb(v), z, n);
2568 sqlite3VdbeAddOp4(v, OP_Blob, n/2, target, 0, zBlob, P4_DYNAMIC);
danielk1977c572ef72004-05-27 09:28:41 +00002569 break;
2570 }
danielk19775338a5f2005-01-20 13:03:10 +00002571#endif
drh50457892003-09-06 01:10:47 +00002572 case TK_VARIABLE: {
drh33e619f2009-05-28 01:00:55 +00002573 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2574 assert( pExpr->u.zToken!=0 );
2575 assert( pExpr->u.zToken[0]!=0 );
drheaf52d82010-05-12 13:50:23 +00002576 sqlite3VdbeAddOp2(v, OP_Variable, pExpr->iColumn, target);
2577 if( pExpr->u.zToken[1]!=0 ){
drh04e9eea2011-06-01 19:16:06 +00002578 assert( pExpr->u.zToken[0]=='?'
2579 || strcmp(pExpr->u.zToken, pParse->azVar[pExpr->iColumn-1])==0 );
2580 sqlite3VdbeChangeP4(v, -1, pParse->azVar[pExpr->iColumn-1], P4_STATIC);
drh895d7472004-08-20 16:02:39 +00002581 }
drh50457892003-09-06 01:10:47 +00002582 break;
2583 }
drh4e0cff62004-11-05 05:10:28 +00002584 case TK_REGISTER: {
drh9de221d2008-01-05 06:51:30 +00002585 inReg = pExpr->iTable;
drh4e0cff62004-11-05 05:10:28 +00002586 break;
2587 }
drh8b213892008-08-29 02:14:02 +00002588 case TK_AS: {
drh7445ffe2010-09-27 18:14:12 +00002589 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
drh8b213892008-08-29 02:14:02 +00002590 break;
2591 }
drh487e2622005-06-25 18:42:14 +00002592#ifndef SQLITE_OMIT_CAST
2593 case TK_CAST: {
2594 /* Expressions of the form: CAST(pLeft AS token) */
drh2dcef112008-01-12 19:03:48 +00002595 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
drh1735fa82008-11-06 15:33:03 +00002596 if( inReg!=target ){
2597 sqlite3VdbeAddOp2(v, OP_SCopy, inReg, target);
2598 inReg = target;
2599 }
drh4169e432014-08-25 20:11:52 +00002600 sqlite3VdbeAddOp2(v, OP_Cast, target,
2601 sqlite3AffinityType(pExpr->u.zToken, 0));
drhc5499be2008-04-01 15:06:33 +00002602 testcase( usedAsColumnCache(pParse, inReg, inReg) );
drhb3843a82008-04-01 12:24:11 +00002603 sqlite3ExprCacheAffinityChange(pParse, inReg, 1);
drh487e2622005-06-25 18:42:14 +00002604 break;
2605 }
2606#endif /* SQLITE_OMIT_CAST */
drhc9b84a12002-06-20 11:36:48 +00002607 case TK_LT:
2608 case TK_LE:
2609 case TK_GT:
2610 case TK_GE:
2611 case TK_NE:
2612 case TK_EQ: {
drhb6da74e2009-12-24 16:00:28 +00002613 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
2614 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh35573352008-01-08 23:54:25 +00002615 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
drh7d176102014-02-18 03:07:12 +00002616 r1, r2, inReg, SQLITE_STOREP2);
2617 assert(TK_LT==OP_Lt); testcase(op==OP_Lt); VdbeCoverageIf(v,op==OP_Lt);
2618 assert(TK_LE==OP_Le); testcase(op==OP_Le); VdbeCoverageIf(v,op==OP_Le);
2619 assert(TK_GT==OP_Gt); testcase(op==OP_Gt); VdbeCoverageIf(v,op==OP_Gt);
2620 assert(TK_GE==OP_Ge); testcase(op==OP_Ge); VdbeCoverageIf(v,op==OP_Ge);
2621 assert(TK_EQ==OP_Eq); testcase(op==OP_Eq); VdbeCoverageIf(v,op==OP_Eq);
2622 assert(TK_NE==OP_Ne); testcase(op==OP_Ne); VdbeCoverageIf(v,op==OP_Ne);
drhc5499be2008-04-01 15:06:33 +00002623 testcase( regFree1==0 );
2624 testcase( regFree2==0 );
danielk1977a37cdde2004-05-16 11:15:36 +00002625 break;
drhc9b84a12002-06-20 11:36:48 +00002626 }
drh6a2fe092009-09-23 02:29:36 +00002627 case TK_IS:
2628 case TK_ISNOT: {
2629 testcase( op==TK_IS );
2630 testcase( op==TK_ISNOT );
drhb6da74e2009-12-24 16:00:28 +00002631 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
2632 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh6a2fe092009-09-23 02:29:36 +00002633 op = (op==TK_IS) ? TK_EQ : TK_NE;
2634 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
2635 r1, r2, inReg, SQLITE_STOREP2 | SQLITE_NULLEQ);
drh7d176102014-02-18 03:07:12 +00002636 VdbeCoverageIf(v, op==TK_EQ);
2637 VdbeCoverageIf(v, op==TK_NE);
drh6a2fe092009-09-23 02:29:36 +00002638 testcase( regFree1==0 );
2639 testcase( regFree2==0 );
2640 break;
2641 }
drhcce7d172000-05-31 15:34:51 +00002642 case TK_AND:
2643 case TK_OR:
2644 case TK_PLUS:
2645 case TK_STAR:
2646 case TK_MINUS:
drhbf4133c2001-10-13 02:59:08 +00002647 case TK_REM:
2648 case TK_BITAND:
2649 case TK_BITOR:
drh17c40292004-07-21 02:53:29 +00002650 case TK_SLASH:
drhbf4133c2001-10-13 02:59:08 +00002651 case TK_LSHIFT:
drh855eb1c2004-08-31 13:45:11 +00002652 case TK_RSHIFT:
drh00400772000-06-16 20:51:26 +00002653 case TK_CONCAT: {
drh7d176102014-02-18 03:07:12 +00002654 assert( TK_AND==OP_And ); testcase( op==TK_AND );
2655 assert( TK_OR==OP_Or ); testcase( op==TK_OR );
2656 assert( TK_PLUS==OP_Add ); testcase( op==TK_PLUS );
2657 assert( TK_MINUS==OP_Subtract ); testcase( op==TK_MINUS );
2658 assert( TK_REM==OP_Remainder ); testcase( op==TK_REM );
2659 assert( TK_BITAND==OP_BitAnd ); testcase( op==TK_BITAND );
2660 assert( TK_BITOR==OP_BitOr ); testcase( op==TK_BITOR );
2661 assert( TK_SLASH==OP_Divide ); testcase( op==TK_SLASH );
2662 assert( TK_LSHIFT==OP_ShiftLeft ); testcase( op==TK_LSHIFT );
2663 assert( TK_RSHIFT==OP_ShiftRight ); testcase( op==TK_RSHIFT );
2664 assert( TK_CONCAT==OP_Concat ); testcase( op==TK_CONCAT );
drh2dcef112008-01-12 19:03:48 +00002665 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
2666 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh5b6afba2008-01-05 16:29:28 +00002667 sqlite3VdbeAddOp3(v, op, r2, r1, target);
drhc5499be2008-04-01 15:06:33 +00002668 testcase( regFree1==0 );
2669 testcase( regFree2==0 );
drh00400772000-06-16 20:51:26 +00002670 break;
2671 }
drhcce7d172000-05-31 15:34:51 +00002672 case TK_UMINUS: {
drhfec19aa2004-05-19 20:41:03 +00002673 Expr *pLeft = pExpr->pLeft;
2674 assert( pLeft );
drh13573c72010-01-12 17:04:07 +00002675 if( pLeft->op==TK_INTEGER ){
2676 codeInteger(pParse, pLeft, 1, target);
2677#ifndef SQLITE_OMIT_FLOATING_POINT
2678 }else if( pLeft->op==TK_FLOAT ){
drh33e619f2009-05-28 01:00:55 +00002679 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2680 codeReal(v, pLeft->u.zToken, 1, target);
drh13573c72010-01-12 17:04:07 +00002681#endif
drh3c84ddf2008-01-09 02:15:38 +00002682 }else{
drh10d1edf2013-11-15 15:52:39 +00002683 tempX.op = TK_INTEGER;
2684 tempX.flags = EP_IntValue|EP_TokenOnly;
2685 tempX.u.iValue = 0;
2686 r1 = sqlite3ExprCodeTemp(pParse, &tempX, &regFree1);
drhe55cbd72008-03-31 23:48:03 +00002687 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree2);
drh2dcef112008-01-12 19:03:48 +00002688 sqlite3VdbeAddOp3(v, OP_Subtract, r2, r1, target);
drhc5499be2008-04-01 15:06:33 +00002689 testcase( regFree2==0 );
drh6e142f52000-06-08 13:36:40 +00002690 }
drh3c84ddf2008-01-09 02:15:38 +00002691 inReg = target;
2692 break;
drh6e142f52000-06-08 13:36:40 +00002693 }
drhbf4133c2001-10-13 02:59:08 +00002694 case TK_BITNOT:
drh6e142f52000-06-08 13:36:40 +00002695 case TK_NOT: {
drh7d176102014-02-18 03:07:12 +00002696 assert( TK_BITNOT==OP_BitNot ); testcase( op==TK_BITNOT );
2697 assert( TK_NOT==OP_Not ); testcase( op==TK_NOT );
drhe99fa2a2008-12-15 15:27:51 +00002698 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
2699 testcase( regFree1==0 );
2700 inReg = target;
2701 sqlite3VdbeAddOp2(v, op, r1, inReg);
drhcce7d172000-05-31 15:34:51 +00002702 break;
2703 }
2704 case TK_ISNULL:
2705 case TK_NOTNULL: {
drh6a288a32008-01-07 19:20:24 +00002706 int addr;
drh7d176102014-02-18 03:07:12 +00002707 assert( TK_ISNULL==OP_IsNull ); testcase( op==TK_ISNULL );
2708 assert( TK_NOTNULL==OP_NotNull ); testcase( op==TK_NOTNULL );
drh9de221d2008-01-05 06:51:30 +00002709 sqlite3VdbeAddOp2(v, OP_Integer, 1, target);
drh2dcef112008-01-12 19:03:48 +00002710 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
drhc5499be2008-04-01 15:06:33 +00002711 testcase( regFree1==0 );
drh7d176102014-02-18 03:07:12 +00002712 addr = sqlite3VdbeAddOp1(v, op, r1);
2713 VdbeCoverageIf(v, op==TK_ISNULL);
2714 VdbeCoverageIf(v, op==TK_NOTNULL);
drha9769792014-08-04 16:39:39 +00002715 sqlite3VdbeAddOp2(v, OP_Integer, 0, target);
drh6a288a32008-01-07 19:20:24 +00002716 sqlite3VdbeJumpHere(v, addr);
drhf2bc0132004-10-04 13:19:23 +00002717 break;
drhcce7d172000-05-31 15:34:51 +00002718 }
drh22827922000-06-06 17:27:05 +00002719 case TK_AGG_FUNCTION: {
drh13449892005-09-07 21:22:45 +00002720 AggInfo *pInfo = pExpr->pAggInfo;
drh7e56e712005-11-16 12:53:15 +00002721 if( pInfo==0 ){
drh33e619f2009-05-28 01:00:55 +00002722 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2723 sqlite3ErrorMsg(pParse, "misuse of aggregate: %s()", pExpr->u.zToken);
drh7e56e712005-11-16 12:53:15 +00002724 }else{
drh9de221d2008-01-05 06:51:30 +00002725 inReg = pInfo->aFunc[pExpr->iAgg].iMem;
drh7e56e712005-11-16 12:53:15 +00002726 }
drh22827922000-06-06 17:27:05 +00002727 break;
2728 }
drhcce7d172000-05-31 15:34:51 +00002729 case TK_FUNCTION: {
drh12ffee82009-04-08 13:51:51 +00002730 ExprList *pFarg; /* List of function arguments */
2731 int nFarg; /* Number of function arguments */
2732 FuncDef *pDef; /* The function definition object */
2733 int nId; /* Length of the function name in bytes */
2734 const char *zId; /* The function name */
drh693e6712014-01-24 22:58:00 +00002735 u32 constMask = 0; /* Mask of function arguments that are constant */
drh12ffee82009-04-08 13:51:51 +00002736 int i; /* Loop counter */
2737 u8 enc = ENC(db); /* The text encoding used by this database */
2738 CollSeq *pColl = 0; /* A collating sequence */
drh17435752007-08-16 04:30:38 +00002739
danielk19776ab3a2e2009-02-19 14:39:25 +00002740 assert( !ExprHasProperty(pExpr, EP_xIsSelect) );
drhc5cd1242013-09-12 16:50:49 +00002741 if( ExprHasProperty(pExpr, EP_TokenOnly) ){
drh12ffee82009-04-08 13:51:51 +00002742 pFarg = 0;
2743 }else{
2744 pFarg = pExpr->x.pList;
2745 }
2746 nFarg = pFarg ? pFarg->nExpr : 0;
drh33e619f2009-05-28 01:00:55 +00002747 assert( !ExprHasProperty(pExpr, EP_IntValue) );
2748 zId = pExpr->u.zToken;
drhb7916a72009-05-27 10:31:29 +00002749 nId = sqlite3Strlen30(zId);
drh12ffee82009-04-08 13:51:51 +00002750 pDef = sqlite3FindFunction(db, zId, nId, nFarg, enc, 0);
drh0c4de2d2014-08-06 00:29:06 +00002751 if( pDef==0 || pDef->xFunc==0 ){
drhfeb306f2009-08-18 16:05:46 +00002752 sqlite3ErrorMsg(pParse, "unknown function: %.*s()", nId, zId);
2753 break;
2754 }
drhae6bb952009-11-11 00:24:31 +00002755
2756 /* Attempt a direct implementation of the built-in COALESCE() and
peter.d.reid60ec9142014-09-06 16:39:46 +00002757 ** IFNULL() functions. This avoids unnecessary evaluation of
drhae6bb952009-11-11 00:24:31 +00002758 ** arguments past the first non-NULL argument.
2759 */
drhd36e1042013-09-06 13:10:12 +00002760 if( pDef->funcFlags & SQLITE_FUNC_COALESCE ){
drhae6bb952009-11-11 00:24:31 +00002761 int endCoalesce = sqlite3VdbeMakeLabel(v);
2762 assert( nFarg>=2 );
2763 sqlite3ExprCode(pParse, pFarg->a[0].pExpr, target);
2764 for(i=1; i<nFarg; i++){
2765 sqlite3VdbeAddOp2(v, OP_NotNull, target, endCoalesce);
drh688852a2014-02-17 22:40:43 +00002766 VdbeCoverage(v);
drhf49f3522009-12-30 14:12:38 +00002767 sqlite3ExprCacheRemove(pParse, target, 1);
drhae6bb952009-11-11 00:24:31 +00002768 sqlite3ExprCachePush(pParse);
2769 sqlite3ExprCode(pParse, pFarg->a[i].pExpr, target);
drhd2490902014-04-13 19:28:15 +00002770 sqlite3ExprCachePop(pParse);
drhae6bb952009-11-11 00:24:31 +00002771 }
2772 sqlite3VdbeResolveLabel(v, endCoalesce);
2773 break;
2774 }
2775
drhcca9f3d2013-09-06 15:23:29 +00002776 /* The UNLIKELY() function is a no-op. The result is the value
2777 ** of the first argument.
2778 */
2779 if( pDef->funcFlags & SQLITE_FUNC_UNLIKELY ){
2780 assert( nFarg>=1 );
2781 sqlite3ExprCode(pParse, pFarg->a[0].pExpr, target);
2782 break;
2783 }
drhae6bb952009-11-11 00:24:31 +00002784
drhd1a01ed2013-11-21 16:08:52 +00002785 for(i=0; i<nFarg; i++){
2786 if( i<32 && sqlite3ExprIsConstant(pFarg->a[i].pExpr) ){
drh693e6712014-01-24 22:58:00 +00002787 testcase( i==31 );
2788 constMask |= MASKBIT32(i);
drhd1a01ed2013-11-21 16:08:52 +00002789 }
2790 if( (pDef->funcFlags & SQLITE_FUNC_NEEDCOLL)!=0 && !pColl ){
2791 pColl = sqlite3ExprCollSeq(pParse, pFarg->a[i].pExpr);
2792 }
2793 }
drh12ffee82009-04-08 13:51:51 +00002794 if( pFarg ){
drhd1a01ed2013-11-21 16:08:52 +00002795 if( constMask ){
2796 r1 = pParse->nMem+1;
2797 pParse->nMem += nFarg;
2798 }else{
2799 r1 = sqlite3GetTempRange(pParse, nFarg);
2800 }
drha748fdc2012-03-28 01:34:47 +00002801
2802 /* For length() and typeof() functions with a column argument,
2803 ** set the P5 parameter to the OP_Column opcode to OPFLAG_LENGTHARG
2804 ** or OPFLAG_TYPEOFARG respectively, to avoid unnecessary data
2805 ** loading.
2806 */
drhd36e1042013-09-06 13:10:12 +00002807 if( (pDef->funcFlags & (SQLITE_FUNC_LENGTH|SQLITE_FUNC_TYPEOF))!=0 ){
drh4e245a42012-03-30 00:00:36 +00002808 u8 exprOp;
drha748fdc2012-03-28 01:34:47 +00002809 assert( nFarg==1 );
2810 assert( pFarg->a[0].pExpr!=0 );
drh4e245a42012-03-30 00:00:36 +00002811 exprOp = pFarg->a[0].pExpr->op;
2812 if( exprOp==TK_COLUMN || exprOp==TK_AGG_COLUMN ){
drha748fdc2012-03-28 01:34:47 +00002813 assert( SQLITE_FUNC_LENGTH==OPFLAG_LENGTHARG );
2814 assert( SQLITE_FUNC_TYPEOF==OPFLAG_TYPEOFARG );
drhb1fba282013-11-21 14:33:48 +00002815 testcase( pDef->funcFlags & OPFLAG_LENGTHARG );
2816 pFarg->a[0].pExpr->op2 =
2817 pDef->funcFlags & (OPFLAG_LENGTHARG|OPFLAG_TYPEOFARG);
drha748fdc2012-03-28 01:34:47 +00002818 }
2819 }
2820
drhd7d385d2009-09-03 01:18:00 +00002821 sqlite3ExprCachePush(pParse); /* Ticket 2ea2425d34be */
drh079a3072014-03-19 14:10:55 +00002822 sqlite3ExprCodeExprList(pParse, pFarg, r1,
drhd1a01ed2013-11-21 16:08:52 +00002823 SQLITE_ECEL_DUP|SQLITE_ECEL_FACTOR);
drhd2490902014-04-13 19:28:15 +00002824 sqlite3ExprCachePop(pParse); /* Ticket 2ea2425d34be */
drh892d3172008-01-10 03:46:36 +00002825 }else{
drh12ffee82009-04-08 13:51:51 +00002826 r1 = 0;
drh892d3172008-01-10 03:46:36 +00002827 }
drhb7f6f682006-07-08 17:06:43 +00002828#ifndef SQLITE_OMIT_VIRTUALTABLE
drha43fa222006-07-08 18:41:37 +00002829 /* Possibly overload the function if the first argument is
2830 ** a virtual table column.
2831 **
2832 ** For infix functions (LIKE, GLOB, REGEXP, and MATCH) use the
2833 ** second argument, not the first, as the argument to test to
2834 ** see if it is a column in a virtual table. This is done because
2835 ** the left operand of infix functions (the operand we want to
2836 ** control overloading) ends up as the second argument to the
2837 ** function. The expression "A glob B" is equivalent to
2838 ** "glob(B,A). We want to use the A in "A glob B" to test
2839 ** for function overloading. But we use the B term in "glob(B,A)".
2840 */
drh12ffee82009-04-08 13:51:51 +00002841 if( nFarg>=2 && (pExpr->flags & EP_InfixFunc) ){
2842 pDef = sqlite3VtabOverloadFunction(db, pDef, nFarg, pFarg->a[1].pExpr);
2843 }else if( nFarg>0 ){
2844 pDef = sqlite3VtabOverloadFunction(db, pDef, nFarg, pFarg->a[0].pExpr);
drhb7f6f682006-07-08 17:06:43 +00002845 }
2846#endif
drhd36e1042013-09-06 13:10:12 +00002847 if( pDef->funcFlags & SQLITE_FUNC_NEEDCOLL ){
drh8b213892008-08-29 02:14:02 +00002848 if( !pColl ) pColl = db->pDfltColl;
drh66a51672008-01-03 00:01:23 +00002849 sqlite3VdbeAddOp4(v, OP_CollSeq, 0, 0, 0, (char *)pColl, P4_COLLSEQ);
danielk1977682f68b2004-06-05 10:22:17 +00002850 }
drh2dcef112008-01-12 19:03:48 +00002851 sqlite3VdbeAddOp4(v, OP_Function, constMask, r1, target,
drh66a51672008-01-03 00:01:23 +00002852 (char*)pDef, P4_FUNCDEF);
drh12ffee82009-04-08 13:51:51 +00002853 sqlite3VdbeChangeP5(v, (u8)nFarg);
drhd1a01ed2013-11-21 16:08:52 +00002854 if( nFarg && constMask==0 ){
drh12ffee82009-04-08 13:51:51 +00002855 sqlite3ReleaseTempRange(pParse, r1, nFarg);
drh2dcef112008-01-12 19:03:48 +00002856 }
drhcce7d172000-05-31 15:34:51 +00002857 break;
2858 }
drhfe2093d2005-01-20 22:48:47 +00002859#ifndef SQLITE_OMIT_SUBQUERY
2860 case TK_EXISTS:
drh19a775c2000-06-05 18:54:46 +00002861 case TK_SELECT: {
drhc5499be2008-04-01 15:06:33 +00002862 testcase( op==TK_EXISTS );
2863 testcase( op==TK_SELECT );
drh1450bc62009-10-30 13:25:56 +00002864 inReg = sqlite3CodeSubselect(pParse, pExpr, 0, 0);
drh19a775c2000-06-05 18:54:46 +00002865 break;
2866 }
drhfef52082000-06-06 01:50:43 +00002867 case TK_IN: {
drhe3365e62009-11-12 17:52:24 +00002868 int destIfFalse = sqlite3VdbeMakeLabel(v);
2869 int destIfNull = sqlite3VdbeMakeLabel(v);
2870 sqlite3VdbeAddOp2(v, OP_Null, 0, target);
2871 sqlite3ExprCodeIN(pParse, pExpr, destIfFalse, destIfNull);
2872 sqlite3VdbeAddOp2(v, OP_Integer, 1, target);
2873 sqlite3VdbeResolveLabel(v, destIfFalse);
2874 sqlite3VdbeAddOp2(v, OP_AddImm, target, 0);
2875 sqlite3VdbeResolveLabel(v, destIfNull);
drhfef52082000-06-06 01:50:43 +00002876 break;
2877 }
drhe3365e62009-11-12 17:52:24 +00002878#endif /* SQLITE_OMIT_SUBQUERY */
2879
2880
drh2dcef112008-01-12 19:03:48 +00002881 /*
2882 ** x BETWEEN y AND z
2883 **
2884 ** This is equivalent to
2885 **
2886 ** x>=y AND x<=z
2887 **
2888 ** X is stored in pExpr->pLeft.
2889 ** Y is stored in pExpr->pList->a[0].pExpr.
2890 ** Z is stored in pExpr->pList->a[1].pExpr.
2891 */
drhfef52082000-06-06 01:50:43 +00002892 case TK_BETWEEN: {
drhbe5c89a2004-07-26 00:31:09 +00002893 Expr *pLeft = pExpr->pLeft;
danielk19776ab3a2e2009-02-19 14:39:25 +00002894 struct ExprList_item *pLItem = pExpr->x.pList->a;
drhbe5c89a2004-07-26 00:31:09 +00002895 Expr *pRight = pLItem->pExpr;
drh35573352008-01-08 23:54:25 +00002896
drhb6da74e2009-12-24 16:00:28 +00002897 r1 = sqlite3ExprCodeTemp(pParse, pLeft, &regFree1);
2898 r2 = sqlite3ExprCodeTemp(pParse, pRight, &regFree2);
drhc5499be2008-04-01 15:06:33 +00002899 testcase( regFree1==0 );
2900 testcase( regFree2==0 );
drh2dcef112008-01-12 19:03:48 +00002901 r3 = sqlite3GetTempReg(pParse);
drh678ccce2008-03-31 18:19:54 +00002902 r4 = sqlite3GetTempReg(pParse);
drh35573352008-01-08 23:54:25 +00002903 codeCompare(pParse, pLeft, pRight, OP_Ge,
drh7d176102014-02-18 03:07:12 +00002904 r1, r2, r3, SQLITE_STOREP2); VdbeCoverage(v);
drhbe5c89a2004-07-26 00:31:09 +00002905 pLItem++;
2906 pRight = pLItem->pExpr;
drh2dcef112008-01-12 19:03:48 +00002907 sqlite3ReleaseTempReg(pParse, regFree2);
2908 r2 = sqlite3ExprCodeTemp(pParse, pRight, &regFree2);
drhc5499be2008-04-01 15:06:33 +00002909 testcase( regFree2==0 );
drh678ccce2008-03-31 18:19:54 +00002910 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
drh688852a2014-02-17 22:40:43 +00002911 VdbeCoverage(v);
drh678ccce2008-03-31 18:19:54 +00002912 sqlite3VdbeAddOp3(v, OP_And, r3, r4, target);
drh2dcef112008-01-12 19:03:48 +00002913 sqlite3ReleaseTempReg(pParse, r3);
drh678ccce2008-03-31 18:19:54 +00002914 sqlite3ReleaseTempReg(pParse, r4);
drhfef52082000-06-06 01:50:43 +00002915 break;
2916 }
drhae80dde2012-12-06 21:16:43 +00002917 case TK_COLLATE:
drh4f07e5f2007-05-14 11:34:46 +00002918 case TK_UPLUS: {
drh2dcef112008-01-12 19:03:48 +00002919 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
drha2e00042002-01-22 03:13:42 +00002920 break;
2921 }
drh2dcef112008-01-12 19:03:48 +00002922
dan165921a2009-08-28 18:53:45 +00002923 case TK_TRIGGER: {
dan65a7cd12009-09-01 12:16:01 +00002924 /* If the opcode is TK_TRIGGER, then the expression is a reference
2925 ** to a column in the new.* or old.* pseudo-tables available to
2926 ** trigger programs. In this case Expr.iTable is set to 1 for the
2927 ** new.* pseudo-table, or 0 for the old.* pseudo-table. Expr.iColumn
2928 ** is set to the column of the pseudo-table to read, or to -1 to
2929 ** read the rowid field.
2930 **
2931 ** The expression is implemented using an OP_Param opcode. The p1
2932 ** parameter is set to 0 for an old.rowid reference, or to (i+1)
2933 ** to reference another column of the old.* pseudo-table, where
2934 ** i is the index of the column. For a new.rowid reference, p1 is
2935 ** set to (n+1), where n is the number of columns in each pseudo-table.
2936 ** For a reference to any other column in the new.* pseudo-table, p1
2937 ** is set to (n+2+i), where n and i are as defined previously. For
2938 ** example, if the table on which triggers are being fired is
2939 ** declared as:
2940 **
2941 ** CREATE TABLE t1(a, b);
2942 **
2943 ** Then p1 is interpreted as follows:
2944 **
2945 ** p1==0 -> old.rowid p1==3 -> new.rowid
2946 ** p1==1 -> old.a p1==4 -> new.a
2947 ** p1==2 -> old.b p1==5 -> new.b
2948 */
dan2832ad42009-08-31 15:27:27 +00002949 Table *pTab = pExpr->pTab;
dan65a7cd12009-09-01 12:16:01 +00002950 int p1 = pExpr->iTable * (pTab->nCol+1) + 1 + pExpr->iColumn;
2951
2952 assert( pExpr->iTable==0 || pExpr->iTable==1 );
2953 assert( pExpr->iColumn>=-1 && pExpr->iColumn<pTab->nCol );
2954 assert( pTab->iPKey<0 || pExpr->iColumn!=pTab->iPKey );
2955 assert( p1>=0 && p1<(pTab->nCol*2+2) );
2956
2957 sqlite3VdbeAddOp2(v, OP_Param, p1, target);
dan2bd93512009-08-31 08:22:46 +00002958 VdbeComment((v, "%s.%s -> $%d",
2959 (pExpr->iTable ? "new" : "old"),
dan76d462e2009-08-30 11:42:51 +00002960 (pExpr->iColumn<0 ? "rowid" : pExpr->pTab->aCol[pExpr->iColumn].zName),
dan2bd93512009-08-31 08:22:46 +00002961 target
dan165921a2009-08-28 18:53:45 +00002962 ));
dan65a7cd12009-09-01 12:16:01 +00002963
drh44dbca82010-01-13 04:22:20 +00002964#ifndef SQLITE_OMIT_FLOATING_POINT
dan65a7cd12009-09-01 12:16:01 +00002965 /* If the column has REAL affinity, it may currently be stored as an
2966 ** integer. Use OP_RealAffinity to make sure it is really real. */
dan2832ad42009-08-31 15:27:27 +00002967 if( pExpr->iColumn>=0
2968 && pTab->aCol[pExpr->iColumn].affinity==SQLITE_AFF_REAL
2969 ){
2970 sqlite3VdbeAddOp1(v, OP_RealAffinity, target);
2971 }
drh44dbca82010-01-13 04:22:20 +00002972#endif
dan165921a2009-08-28 18:53:45 +00002973 break;
2974 }
2975
2976
drh2dcef112008-01-12 19:03:48 +00002977 /*
2978 ** Form A:
2979 ** CASE x WHEN e1 THEN r1 WHEN e2 THEN r2 ... WHEN eN THEN rN ELSE y END
2980 **
2981 ** Form B:
2982 ** CASE WHEN e1 THEN r1 WHEN e2 THEN r2 ... WHEN eN THEN rN ELSE y END
2983 **
2984 ** Form A is can be transformed into the equivalent form B as follows:
2985 ** CASE WHEN x=e1 THEN r1 WHEN x=e2 THEN r2 ...
2986 ** WHEN x=eN THEN rN ELSE y END
2987 **
2988 ** X (if it exists) is in pExpr->pLeft.
drhc5cd1242013-09-12 16:50:49 +00002989 ** Y is in the last element of pExpr->x.pList if pExpr->x.pList->nExpr is
2990 ** odd. The Y is also optional. If the number of elements in x.pList
2991 ** is even, then Y is omitted and the "otherwise" result is NULL.
drh2dcef112008-01-12 19:03:48 +00002992 ** Ei is in pExpr->pList->a[i*2] and Ri is pExpr->pList->a[i*2+1].
2993 **
2994 ** The result of the expression is the Ri for the first matching Ei,
2995 ** or if there is no matching Ei, the ELSE term Y, or if there is
2996 ** no ELSE term, NULL.
2997 */
drh33cd4902009-05-30 20:49:20 +00002998 default: assert( op==TK_CASE ); {
drh2dcef112008-01-12 19:03:48 +00002999 int endLabel; /* GOTO label for end of CASE stmt */
3000 int nextCase; /* GOTO label for next WHEN clause */
3001 int nExpr; /* 2x number of WHEN terms */
3002 int i; /* Loop counter */
3003 ExprList *pEList; /* List of WHEN terms */
3004 struct ExprList_item *aListelem; /* Array of WHEN terms */
3005 Expr opCompare; /* The X==Ei expression */
drh2dcef112008-01-12 19:03:48 +00003006 Expr *pX; /* The X expression */
drh1bd10f82008-12-10 21:19:56 +00003007 Expr *pTest = 0; /* X==Ei (form A) or just Ei (form B) */
drhceea3322009-04-23 13:22:42 +00003008 VVA_ONLY( int iCacheLevel = pParse->iCacheLevel; )
drh17a7f8d2002-03-24 13:13:27 +00003009
danielk19776ab3a2e2009-02-19 14:39:25 +00003010 assert( !ExprHasProperty(pExpr, EP_xIsSelect) && pExpr->x.pList );
danielk19776ab3a2e2009-02-19 14:39:25 +00003011 assert(pExpr->x.pList->nExpr > 0);
3012 pEList = pExpr->x.pList;
drhbe5c89a2004-07-26 00:31:09 +00003013 aListelem = pEList->a;
3014 nExpr = pEList->nExpr;
drh2dcef112008-01-12 19:03:48 +00003015 endLabel = sqlite3VdbeMakeLabel(v);
3016 if( (pX = pExpr->pLeft)!=0 ){
drh10d1edf2013-11-15 15:52:39 +00003017 tempX = *pX;
drh33cd4902009-05-30 20:49:20 +00003018 testcase( pX->op==TK_COLUMN );
drh10d1edf2013-11-15 15:52:39 +00003019 exprToRegister(&tempX, sqlite3ExprCodeTemp(pParse, pX, &regFree1));
drhc5499be2008-04-01 15:06:33 +00003020 testcase( regFree1==0 );
drh2dcef112008-01-12 19:03:48 +00003021 opCompare.op = TK_EQ;
drh10d1edf2013-11-15 15:52:39 +00003022 opCompare.pLeft = &tempX;
drh2dcef112008-01-12 19:03:48 +00003023 pTest = &opCompare;
drh8b1db072010-09-28 04:14:03 +00003024 /* Ticket b351d95f9cd5ef17e9d9dbae18f5ca8611190001:
3025 ** The value in regFree1 might get SCopy-ed into the file result.
3026 ** So make sure that the regFree1 register is not reused for other
3027 ** purposes and possibly overwritten. */
3028 regFree1 = 0;
drh17a7f8d2002-03-24 13:13:27 +00003029 }
drhc5cd1242013-09-12 16:50:49 +00003030 for(i=0; i<nExpr-1; i=i+2){
drhceea3322009-04-23 13:22:42 +00003031 sqlite3ExprCachePush(pParse);
drh2dcef112008-01-12 19:03:48 +00003032 if( pX ){
drh1bd10f82008-12-10 21:19:56 +00003033 assert( pTest!=0 );
drh2dcef112008-01-12 19:03:48 +00003034 opCompare.pRight = aListelem[i].pExpr;
drh17a7f8d2002-03-24 13:13:27 +00003035 }else{
drh2dcef112008-01-12 19:03:48 +00003036 pTest = aListelem[i].pExpr;
drh17a7f8d2002-03-24 13:13:27 +00003037 }
drh2dcef112008-01-12 19:03:48 +00003038 nextCase = sqlite3VdbeMakeLabel(v);
drh33cd4902009-05-30 20:49:20 +00003039 testcase( pTest->op==TK_COLUMN );
drh2dcef112008-01-12 19:03:48 +00003040 sqlite3ExprIfFalse(pParse, pTest, nextCase, SQLITE_JUMPIFNULL);
drhc5499be2008-04-01 15:06:33 +00003041 testcase( aListelem[i+1].pExpr->op==TK_COLUMN );
drh9de221d2008-01-05 06:51:30 +00003042 sqlite3ExprCode(pParse, aListelem[i+1].pExpr, target);
drh2dcef112008-01-12 19:03:48 +00003043 sqlite3VdbeAddOp2(v, OP_Goto, 0, endLabel);
drhd2490902014-04-13 19:28:15 +00003044 sqlite3ExprCachePop(pParse);
drh2dcef112008-01-12 19:03:48 +00003045 sqlite3VdbeResolveLabel(v, nextCase);
drhf570f012002-05-31 15:51:25 +00003046 }
drhc5cd1242013-09-12 16:50:49 +00003047 if( (nExpr&1)!=0 ){
drhceea3322009-04-23 13:22:42 +00003048 sqlite3ExprCachePush(pParse);
drhc5cd1242013-09-12 16:50:49 +00003049 sqlite3ExprCode(pParse, pEList->a[nExpr-1].pExpr, target);
drhd2490902014-04-13 19:28:15 +00003050 sqlite3ExprCachePop(pParse);
drh17a7f8d2002-03-24 13:13:27 +00003051 }else{
drh9de221d2008-01-05 06:51:30 +00003052 sqlite3VdbeAddOp2(v, OP_Null, 0, target);
drh17a7f8d2002-03-24 13:13:27 +00003053 }
danielk1977c1f4a192009-04-28 12:08:15 +00003054 assert( db->mallocFailed || pParse->nErr>0
3055 || pParse->iCacheLevel==iCacheLevel );
drh2dcef112008-01-12 19:03:48 +00003056 sqlite3VdbeResolveLabel(v, endLabel);
danielk19776f349032002-06-11 02:25:40 +00003057 break;
3058 }
danielk19775338a5f2005-01-20 13:03:10 +00003059#ifndef SQLITE_OMIT_TRIGGER
danielk19776f349032002-06-11 02:25:40 +00003060 case TK_RAISE: {
dan165921a2009-08-28 18:53:45 +00003061 assert( pExpr->affinity==OE_Rollback
3062 || pExpr->affinity==OE_Abort
3063 || pExpr->affinity==OE_Fail
3064 || pExpr->affinity==OE_Ignore
3065 );
dane0af83a2009-09-08 19:15:01 +00003066 if( !pParse->pTriggerTab ){
3067 sqlite3ErrorMsg(pParse,
3068 "RAISE() may only be used within a trigger-program");
3069 return 0;
3070 }
3071 if( pExpr->affinity==OE_Abort ){
3072 sqlite3MayAbort(pParse);
3073 }
dan165921a2009-08-28 18:53:45 +00003074 assert( !ExprHasProperty(pExpr, EP_IntValue) );
dane0af83a2009-09-08 19:15:01 +00003075 if( pExpr->affinity==OE_Ignore ){
3076 sqlite3VdbeAddOp4(
3077 v, OP_Halt, SQLITE_OK, OE_Ignore, 0, pExpr->u.zToken,0);
drh688852a2014-02-17 22:40:43 +00003078 VdbeCoverage(v);
dane0af83a2009-09-08 19:15:01 +00003079 }else{
drh433dccf2013-02-09 15:37:11 +00003080 sqlite3HaltConstraint(pParse, SQLITE_CONSTRAINT_TRIGGER,
drhf9c8ce32013-11-05 13:33:55 +00003081 pExpr->affinity, pExpr->u.zToken, 0, 0);
dane0af83a2009-09-08 19:15:01 +00003082 }
3083
drhffe07b22005-11-03 00:41:17 +00003084 break;
drh17a7f8d2002-03-24 13:13:27 +00003085 }
danielk19775338a5f2005-01-20 13:03:10 +00003086#endif
drhffe07b22005-11-03 00:41:17 +00003087 }
drh2dcef112008-01-12 19:03:48 +00003088 sqlite3ReleaseTempReg(pParse, regFree1);
3089 sqlite3ReleaseTempReg(pParse, regFree2);
3090 return inReg;
3091}
3092
3093/*
drhd1a01ed2013-11-21 16:08:52 +00003094** Factor out the code of the given expression to initialization time.
3095*/
drhd673cdd2013-11-21 21:23:31 +00003096void sqlite3ExprCodeAtInit(
3097 Parse *pParse, /* Parsing context */
3098 Expr *pExpr, /* The expression to code when the VDBE initializes */
3099 int regDest, /* Store the value in this register */
3100 u8 reusable /* True if this expression is reusable */
3101){
drhd1a01ed2013-11-21 16:08:52 +00003102 ExprList *p;
drhd9f158e2013-11-21 20:48:42 +00003103 assert( ConstFactorOk(pParse) );
drhd1a01ed2013-11-21 16:08:52 +00003104 p = pParse->pConstExpr;
3105 pExpr = sqlite3ExprDup(pParse->db, pExpr, 0);
3106 p = sqlite3ExprListAppend(pParse, p, pExpr);
drhd673cdd2013-11-21 21:23:31 +00003107 if( p ){
3108 struct ExprList_item *pItem = &p->a[p->nExpr-1];
3109 pItem->u.iConstExprReg = regDest;
3110 pItem->reusable = reusable;
3111 }
drhd1a01ed2013-11-21 16:08:52 +00003112 pParse->pConstExpr = p;
3113}
3114
3115/*
drh2dcef112008-01-12 19:03:48 +00003116** Generate code to evaluate an expression and store the results
3117** into a register. Return the register number where the results
3118** are stored.
3119**
3120** If the register is a temporary register that can be deallocated,
drh678ccce2008-03-31 18:19:54 +00003121** then write its number into *pReg. If the result register is not
drh2dcef112008-01-12 19:03:48 +00003122** a temporary, then set *pReg to zero.
drhf30a9692013-11-15 01:10:18 +00003123**
3124** If pExpr is a constant, then this routine might generate this
3125** code to fill the register in the initialization section of the
3126** VDBE program, in order to factor it out of the evaluation loop.
drh2dcef112008-01-12 19:03:48 +00003127*/
3128int sqlite3ExprCodeTemp(Parse *pParse, Expr *pExpr, int *pReg){
drhf30a9692013-11-15 01:10:18 +00003129 int r2;
3130 pExpr = sqlite3ExprSkipCollate(pExpr);
drhd9f158e2013-11-21 20:48:42 +00003131 if( ConstFactorOk(pParse)
drhf30a9692013-11-15 01:10:18 +00003132 && pExpr->op!=TK_REGISTER
3133 && sqlite3ExprIsConstantNotJoin(pExpr)
3134 ){
3135 ExprList *p = pParse->pConstExpr;
3136 int i;
3137 *pReg = 0;
3138 if( p ){
drhd673cdd2013-11-21 21:23:31 +00003139 struct ExprList_item *pItem;
3140 for(pItem=p->a, i=p->nExpr; i>0; pItem++, i--){
3141 if( pItem->reusable && sqlite3ExprCompare(pItem->pExpr,pExpr,-1)==0 ){
3142 return pItem->u.iConstExprReg;
drhf30a9692013-11-15 01:10:18 +00003143 }
3144 }
3145 }
drhf30a9692013-11-15 01:10:18 +00003146 r2 = ++pParse->nMem;
drhd673cdd2013-11-21 21:23:31 +00003147 sqlite3ExprCodeAtInit(pParse, pExpr, r2, 1);
drh2dcef112008-01-12 19:03:48 +00003148 }else{
drhf30a9692013-11-15 01:10:18 +00003149 int r1 = sqlite3GetTempReg(pParse);
3150 r2 = sqlite3ExprCodeTarget(pParse, pExpr, r1);
3151 if( r2==r1 ){
3152 *pReg = r1;
3153 }else{
3154 sqlite3ReleaseTempReg(pParse, r1);
3155 *pReg = 0;
3156 }
drh2dcef112008-01-12 19:03:48 +00003157 }
3158 return r2;
3159}
3160
3161/*
3162** Generate code that will evaluate expression pExpr and store the
3163** results in register target. The results are guaranteed to appear
3164** in register target.
3165*/
drh05a86c52014-02-16 01:55:49 +00003166void sqlite3ExprCode(Parse *pParse, Expr *pExpr, int target){
drh9cbf3422008-01-17 16:22:13 +00003167 int inReg;
3168
3169 assert( target>0 && target<=pParse->nMem );
drhebc16712010-09-28 00:25:58 +00003170 if( pExpr && pExpr->op==TK_REGISTER ){
3171 sqlite3VdbeAddOp2(pParse->pVdbe, OP_Copy, pExpr->iTable, target);
3172 }else{
3173 inReg = sqlite3ExprCodeTarget(pParse, pExpr, target);
3174 assert( pParse->pVdbe || pParse->db->mallocFailed );
3175 if( inReg!=target && pParse->pVdbe ){
3176 sqlite3VdbeAddOp2(pParse->pVdbe, OP_SCopy, inReg, target);
3177 }
drhcce7d172000-05-31 15:34:51 +00003178 }
drh05a86c52014-02-16 01:55:49 +00003179}
3180
3181/*
3182** Generate code that will evaluate expression pExpr and store the
3183** results in register target. The results are guaranteed to appear
3184** in register target. If the expression is constant, then this routine
3185** might choose to code the expression at initialization time.
3186*/
3187void sqlite3ExprCodeFactorable(Parse *pParse, Expr *pExpr, int target){
3188 if( pParse->okConstFactor && sqlite3ExprIsConstant(pExpr) ){
3189 sqlite3ExprCodeAtInit(pParse, pExpr, target, 0);
3190 }else{
3191 sqlite3ExprCode(pParse, pExpr, target);
3192 }
drhcce7d172000-05-31 15:34:51 +00003193}
3194
3195/*
peter.d.reid60ec9142014-09-06 16:39:46 +00003196** Generate code that evaluates the given expression and puts the result
drhde4fcfd2008-01-19 23:50:26 +00003197** in register target.
drh25303782004-12-07 15:41:48 +00003198**
drh2dcef112008-01-12 19:03:48 +00003199** Also make a copy of the expression results into another "cache" register
3200** and modify the expression so that the next time it is evaluated,
3201** the result is a copy of the cache register.
3202**
3203** This routine is used for expressions that are used multiple
3204** times. They are evaluated once and the results of the expression
3205** are reused.
drh25303782004-12-07 15:41:48 +00003206*/
drh05a86c52014-02-16 01:55:49 +00003207void sqlite3ExprCodeAndCache(Parse *pParse, Expr *pExpr, int target){
drh25303782004-12-07 15:41:48 +00003208 Vdbe *v = pParse->pVdbe;
drh05a86c52014-02-16 01:55:49 +00003209 int iMem;
3210
drhde4fcfd2008-01-19 23:50:26 +00003211 assert( target>0 );
drh05a86c52014-02-16 01:55:49 +00003212 assert( pExpr->op!=TK_REGISTER );
3213 sqlite3ExprCode(pParse, pExpr, target);
3214 iMem = ++pParse->nMem;
3215 sqlite3VdbeAddOp2(v, OP_Copy, target, iMem);
3216 exprToRegister(pExpr, iMem);
drh25303782004-12-07 15:41:48 +00003217}
drh2dcef112008-01-12 19:03:48 +00003218
drh678a9aa2011-12-10 15:55:01 +00003219#if defined(SQLITE_ENABLE_TREE_EXPLAIN)
drh7e02e5e2011-12-06 19:44:51 +00003220/*
3221** Generate a human-readable explanation of an expression tree.
3222*/
drha84203a2011-12-07 01:23:51 +00003223void sqlite3ExplainExpr(Vdbe *pOut, Expr *pExpr){
3224 int op; /* The opcode being coded */
3225 const char *zBinOp = 0; /* Binary operator */
3226 const char *zUniOp = 0; /* Unary operator */
3227 if( pExpr==0 ){
3228 op = TK_NULL;
drh7e02e5e2011-12-06 19:44:51 +00003229 }else{
drha84203a2011-12-07 01:23:51 +00003230 op = pExpr->op;
drh7e02e5e2011-12-06 19:44:51 +00003231 }
drha84203a2011-12-07 01:23:51 +00003232 switch( op ){
3233 case TK_AGG_COLUMN: {
drh04b83422011-12-07 15:33:14 +00003234 sqlite3ExplainPrintf(pOut, "AGG{%d:%d}",
3235 pExpr->iTable, pExpr->iColumn);
drha84203a2011-12-07 01:23:51 +00003236 break;
3237 }
3238 case TK_COLUMN: {
3239 if( pExpr->iTable<0 ){
3240 /* This only happens when coding check constraints */
3241 sqlite3ExplainPrintf(pOut, "COLUMN(%d)", pExpr->iColumn);
3242 }else{
drh04b83422011-12-07 15:33:14 +00003243 sqlite3ExplainPrintf(pOut, "{%d:%d}",
3244 pExpr->iTable, pExpr->iColumn);
drha84203a2011-12-07 01:23:51 +00003245 }
3246 break;
3247 }
3248 case TK_INTEGER: {
3249 if( pExpr->flags & EP_IntValue ){
drh04b83422011-12-07 15:33:14 +00003250 sqlite3ExplainPrintf(pOut, "%d", pExpr->u.iValue);
drha84203a2011-12-07 01:23:51 +00003251 }else{
drh04b83422011-12-07 15:33:14 +00003252 sqlite3ExplainPrintf(pOut, "%s", pExpr->u.zToken);
drha84203a2011-12-07 01:23:51 +00003253 }
3254 break;
3255 }
3256#ifndef SQLITE_OMIT_FLOATING_POINT
3257 case TK_FLOAT: {
drh04b83422011-12-07 15:33:14 +00003258 sqlite3ExplainPrintf(pOut,"%s", pExpr->u.zToken);
drha84203a2011-12-07 01:23:51 +00003259 break;
3260 }
3261#endif
3262 case TK_STRING: {
drh04b83422011-12-07 15:33:14 +00003263 sqlite3ExplainPrintf(pOut,"%Q", pExpr->u.zToken);
drha84203a2011-12-07 01:23:51 +00003264 break;
3265 }
3266 case TK_NULL: {
3267 sqlite3ExplainPrintf(pOut,"NULL");
3268 break;
3269 }
3270#ifndef SQLITE_OMIT_BLOB_LITERAL
3271 case TK_BLOB: {
drh04b83422011-12-07 15:33:14 +00003272 sqlite3ExplainPrintf(pOut,"%s", pExpr->u.zToken);
drha84203a2011-12-07 01:23:51 +00003273 break;
3274 }
3275#endif
3276 case TK_VARIABLE: {
3277 sqlite3ExplainPrintf(pOut,"VARIABLE(%s,%d)",
3278 pExpr->u.zToken, pExpr->iColumn);
3279 break;
3280 }
3281 case TK_REGISTER: {
3282 sqlite3ExplainPrintf(pOut,"REGISTER(%d)", pExpr->iTable);
3283 break;
3284 }
3285 case TK_AS: {
3286 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3287 break;
3288 }
3289#ifndef SQLITE_OMIT_CAST
3290 case TK_CAST: {
3291 /* Expressions of the form: CAST(pLeft AS token) */
3292 const char *zAff = "unk";
drhfdaac672013-10-04 15:30:21 +00003293 switch( sqlite3AffinityType(pExpr->u.zToken, 0) ){
drha84203a2011-12-07 01:23:51 +00003294 case SQLITE_AFF_TEXT: zAff = "TEXT"; break;
3295 case SQLITE_AFF_NONE: zAff = "NONE"; break;
3296 case SQLITE_AFF_NUMERIC: zAff = "NUMERIC"; break;
3297 case SQLITE_AFF_INTEGER: zAff = "INTEGER"; break;
3298 case SQLITE_AFF_REAL: zAff = "REAL"; break;
3299 }
3300 sqlite3ExplainPrintf(pOut, "CAST-%s(", zAff);
3301 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3302 sqlite3ExplainPrintf(pOut, ")");
3303 break;
3304 }
3305#endif /* SQLITE_OMIT_CAST */
3306 case TK_LT: zBinOp = "LT"; break;
3307 case TK_LE: zBinOp = "LE"; break;
3308 case TK_GT: zBinOp = "GT"; break;
3309 case TK_GE: zBinOp = "GE"; break;
3310 case TK_NE: zBinOp = "NE"; break;
3311 case TK_EQ: zBinOp = "EQ"; break;
3312 case TK_IS: zBinOp = "IS"; break;
3313 case TK_ISNOT: zBinOp = "ISNOT"; break;
3314 case TK_AND: zBinOp = "AND"; break;
3315 case TK_OR: zBinOp = "OR"; break;
3316 case TK_PLUS: zBinOp = "ADD"; break;
3317 case TK_STAR: zBinOp = "MUL"; break;
3318 case TK_MINUS: zBinOp = "SUB"; break;
3319 case TK_REM: zBinOp = "REM"; break;
3320 case TK_BITAND: zBinOp = "BITAND"; break;
3321 case TK_BITOR: zBinOp = "BITOR"; break;
3322 case TK_SLASH: zBinOp = "DIV"; break;
3323 case TK_LSHIFT: zBinOp = "LSHIFT"; break;
3324 case TK_RSHIFT: zBinOp = "RSHIFT"; break;
3325 case TK_CONCAT: zBinOp = "CONCAT"; break;
3326
3327 case TK_UMINUS: zUniOp = "UMINUS"; break;
3328 case TK_UPLUS: zUniOp = "UPLUS"; break;
3329 case TK_BITNOT: zUniOp = "BITNOT"; break;
3330 case TK_NOT: zUniOp = "NOT"; break;
3331 case TK_ISNULL: zUniOp = "ISNULL"; break;
3332 case TK_NOTNULL: zUniOp = "NOTNULL"; break;
3333
drh7a66da12012-12-07 20:31:11 +00003334 case TK_COLLATE: {
3335 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3336 sqlite3ExplainPrintf(pOut,".COLLATE(%s)",pExpr->u.zToken);
3337 break;
3338 }
3339
drha84203a2011-12-07 01:23:51 +00003340 case TK_AGG_FUNCTION:
drha84203a2011-12-07 01:23:51 +00003341 case TK_FUNCTION: {
3342 ExprList *pFarg; /* List of function arguments */
drhc5cd1242013-09-12 16:50:49 +00003343 if( ExprHasProperty(pExpr, EP_TokenOnly) ){
drha84203a2011-12-07 01:23:51 +00003344 pFarg = 0;
3345 }else{
3346 pFarg = pExpr->x.pList;
3347 }
drhed551b92012-08-23 19:46:11 +00003348 if( op==TK_AGG_FUNCTION ){
3349 sqlite3ExplainPrintf(pOut, "AGG_FUNCTION%d:%s(",
3350 pExpr->op2, pExpr->u.zToken);
3351 }else{
3352 sqlite3ExplainPrintf(pOut, "FUNCTION:%s(", pExpr->u.zToken);
3353 }
drha84203a2011-12-07 01:23:51 +00003354 if( pFarg ){
3355 sqlite3ExplainExprList(pOut, pFarg);
3356 }
3357 sqlite3ExplainPrintf(pOut, ")");
3358 break;
3359 }
3360#ifndef SQLITE_OMIT_SUBQUERY
3361 case TK_EXISTS: {
3362 sqlite3ExplainPrintf(pOut, "EXISTS(");
3363 sqlite3ExplainSelect(pOut, pExpr->x.pSelect);
3364 sqlite3ExplainPrintf(pOut,")");
3365 break;
3366 }
3367 case TK_SELECT: {
3368 sqlite3ExplainPrintf(pOut, "(");
3369 sqlite3ExplainSelect(pOut, pExpr->x.pSelect);
3370 sqlite3ExplainPrintf(pOut, ")");
3371 break;
3372 }
3373 case TK_IN: {
3374 sqlite3ExplainPrintf(pOut, "IN(");
3375 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3376 sqlite3ExplainPrintf(pOut, ",");
3377 if( ExprHasProperty(pExpr, EP_xIsSelect) ){
3378 sqlite3ExplainSelect(pOut, pExpr->x.pSelect);
3379 }else{
3380 sqlite3ExplainExprList(pOut, pExpr->x.pList);
3381 }
3382 sqlite3ExplainPrintf(pOut, ")");
3383 break;
3384 }
3385#endif /* SQLITE_OMIT_SUBQUERY */
3386
3387 /*
3388 ** x BETWEEN y AND z
3389 **
3390 ** This is equivalent to
3391 **
3392 ** x>=y AND x<=z
3393 **
3394 ** X is stored in pExpr->pLeft.
3395 ** Y is stored in pExpr->pList->a[0].pExpr.
3396 ** Z is stored in pExpr->pList->a[1].pExpr.
3397 */
3398 case TK_BETWEEN: {
3399 Expr *pX = pExpr->pLeft;
3400 Expr *pY = pExpr->x.pList->a[0].pExpr;
3401 Expr *pZ = pExpr->x.pList->a[1].pExpr;
3402 sqlite3ExplainPrintf(pOut, "BETWEEN(");
3403 sqlite3ExplainExpr(pOut, pX);
3404 sqlite3ExplainPrintf(pOut, ",");
3405 sqlite3ExplainExpr(pOut, pY);
3406 sqlite3ExplainPrintf(pOut, ",");
3407 sqlite3ExplainExpr(pOut, pZ);
3408 sqlite3ExplainPrintf(pOut, ")");
3409 break;
3410 }
3411 case TK_TRIGGER: {
3412 /* If the opcode is TK_TRIGGER, then the expression is a reference
3413 ** to a column in the new.* or old.* pseudo-tables available to
3414 ** trigger programs. In this case Expr.iTable is set to 1 for the
3415 ** new.* pseudo-table, or 0 for the old.* pseudo-table. Expr.iColumn
3416 ** is set to the column of the pseudo-table to read, or to -1 to
3417 ** read the rowid field.
3418 */
3419 sqlite3ExplainPrintf(pOut, "%s(%d)",
3420 pExpr->iTable ? "NEW" : "OLD", pExpr->iColumn);
3421 break;
3422 }
3423 case TK_CASE: {
3424 sqlite3ExplainPrintf(pOut, "CASE(");
3425 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3426 sqlite3ExplainPrintf(pOut, ",");
3427 sqlite3ExplainExprList(pOut, pExpr->x.pList);
3428 break;
3429 }
3430#ifndef SQLITE_OMIT_TRIGGER
3431 case TK_RAISE: {
3432 const char *zType = "unk";
3433 switch( pExpr->affinity ){
3434 case OE_Rollback: zType = "rollback"; break;
3435 case OE_Abort: zType = "abort"; break;
3436 case OE_Fail: zType = "fail"; break;
3437 case OE_Ignore: zType = "ignore"; break;
3438 }
3439 sqlite3ExplainPrintf(pOut, "RAISE-%s(%s)", zType, pExpr->u.zToken);
3440 break;
3441 }
3442#endif
drh7e02e5e2011-12-06 19:44:51 +00003443 }
drha84203a2011-12-07 01:23:51 +00003444 if( zBinOp ){
3445 sqlite3ExplainPrintf(pOut,"%s(", zBinOp);
3446 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3447 sqlite3ExplainPrintf(pOut,",");
3448 sqlite3ExplainExpr(pOut, pExpr->pRight);
3449 sqlite3ExplainPrintf(pOut,")");
3450 }else if( zUniOp ){
3451 sqlite3ExplainPrintf(pOut,"%s(", zUniOp);
3452 sqlite3ExplainExpr(pOut, pExpr->pLeft);
3453 sqlite3ExplainPrintf(pOut,")");
drh7e02e5e2011-12-06 19:44:51 +00003454 }
drh7e02e5e2011-12-06 19:44:51 +00003455}
drh678a9aa2011-12-10 15:55:01 +00003456#endif /* defined(SQLITE_ENABLE_TREE_EXPLAIN) */
drh7e02e5e2011-12-06 19:44:51 +00003457
drh678a9aa2011-12-10 15:55:01 +00003458#if defined(SQLITE_ENABLE_TREE_EXPLAIN)
drh7e02e5e2011-12-06 19:44:51 +00003459/*
3460** Generate a human-readable explanation of an expression list.
3461*/
3462void sqlite3ExplainExprList(Vdbe *pOut, ExprList *pList){
3463 int i;
drha84203a2011-12-07 01:23:51 +00003464 if( pList==0 || pList->nExpr==0 ){
drh7e02e5e2011-12-06 19:44:51 +00003465 sqlite3ExplainPrintf(pOut, "(empty-list)");
3466 return;
drha84203a2011-12-07 01:23:51 +00003467 }else if( pList->nExpr==1 ){
3468 sqlite3ExplainExpr(pOut, pList->a[0].pExpr);
3469 }else{
drh7e02e5e2011-12-06 19:44:51 +00003470 sqlite3ExplainPush(pOut);
drha84203a2011-12-07 01:23:51 +00003471 for(i=0; i<pList->nExpr; i++){
3472 sqlite3ExplainPrintf(pOut, "item[%d] = ", i);
3473 sqlite3ExplainPush(pOut);
3474 sqlite3ExplainExpr(pOut, pList->a[i].pExpr);
drhb66e21f2014-01-04 20:00:14 +00003475 sqlite3ExplainPop(pOut);
drh3e3f1a52013-01-03 00:45:56 +00003476 if( pList->a[i].zName ){
3477 sqlite3ExplainPrintf(pOut, " AS %s", pList->a[i].zName);
3478 }
3479 if( pList->a[i].bSpanIsTab ){
3480 sqlite3ExplainPrintf(pOut, " (%s)", pList->a[i].zSpan);
3481 }
drha84203a2011-12-07 01:23:51 +00003482 if( i<pList->nExpr-1 ){
3483 sqlite3ExplainNL(pOut);
3484 }
drh7e02e5e2011-12-06 19:44:51 +00003485 }
drha84203a2011-12-07 01:23:51 +00003486 sqlite3ExplainPop(pOut);
drh7e02e5e2011-12-06 19:44:51 +00003487 }
drh7e02e5e2011-12-06 19:44:51 +00003488}
3489#endif /* SQLITE_DEBUG */
3490
drh678ccce2008-03-31 18:19:54 +00003491/*
drh268380c2004-02-25 13:47:31 +00003492** Generate code that pushes the value of every element of the given
drh9cbf3422008-01-17 16:22:13 +00003493** expression list into a sequence of registers beginning at target.
drh268380c2004-02-25 13:47:31 +00003494**
drh892d3172008-01-10 03:46:36 +00003495** Return the number of elements evaluated.
drhd1a01ed2013-11-21 16:08:52 +00003496**
3497** The SQLITE_ECEL_DUP flag prevents the arguments from being
3498** filled using OP_SCopy. OP_Copy must be used instead.
3499**
3500** The SQLITE_ECEL_FACTOR argument allows constant arguments to be
3501** factored out into initialization code.
drh268380c2004-02-25 13:47:31 +00003502*/
danielk19774adee202004-05-08 08:23:19 +00003503int sqlite3ExprCodeExprList(
drh268380c2004-02-25 13:47:31 +00003504 Parse *pParse, /* Parsing context */
drh389a1ad2008-01-03 23:44:53 +00003505 ExprList *pList, /* The expression list to be coded */
drh191b54c2008-04-15 12:14:21 +00003506 int target, /* Where to write results */
drhd1a01ed2013-11-21 16:08:52 +00003507 u8 flags /* SQLITE_ECEL_* flags */
drh268380c2004-02-25 13:47:31 +00003508){
3509 struct ExprList_item *pItem;
drh9cbf3422008-01-17 16:22:13 +00003510 int i, n;
drhd1a01ed2013-11-21 16:08:52 +00003511 u8 copyOp = (flags & SQLITE_ECEL_DUP) ? OP_Copy : OP_SCopy;
drh9d8b3072008-08-22 16:29:51 +00003512 assert( pList!=0 );
drh9cbf3422008-01-17 16:22:13 +00003513 assert( target>0 );
drhd81a1422010-09-28 07:11:24 +00003514 assert( pParse->pVdbe!=0 ); /* Never gets this far otherwise */
drh268380c2004-02-25 13:47:31 +00003515 n = pList->nExpr;
drhd9f158e2013-11-21 20:48:42 +00003516 if( !ConstFactorOk(pParse) ) flags &= ~SQLITE_ECEL_FACTOR;
drh191b54c2008-04-15 12:14:21 +00003517 for(pItem=pList->a, i=0; i<n; i++, pItem++){
drh7445ffe2010-09-27 18:14:12 +00003518 Expr *pExpr = pItem->pExpr;
drhd1a01ed2013-11-21 16:08:52 +00003519 if( (flags & SQLITE_ECEL_FACTOR)!=0 && sqlite3ExprIsConstant(pExpr) ){
drhd673cdd2013-11-21 21:23:31 +00003520 sqlite3ExprCodeAtInit(pParse, pExpr, target+i, 0);
drhd1a01ed2013-11-21 16:08:52 +00003521 }else{
3522 int inReg = sqlite3ExprCodeTarget(pParse, pExpr, target+i);
3523 if( inReg!=target+i ){
drh4eded602013-12-20 15:59:20 +00003524 VdbeOp *pOp;
3525 Vdbe *v = pParse->pVdbe;
3526 if( copyOp==OP_Copy
3527 && (pOp=sqlite3VdbeGetOp(v, -1))->opcode==OP_Copy
3528 && pOp->p1+pOp->p3+1==inReg
3529 && pOp->p2+pOp->p3+1==target+i
3530 ){
3531 pOp->p3++;
3532 }else{
3533 sqlite3VdbeAddOp2(v, copyOp, inReg, target+i);
3534 }
drhd1a01ed2013-11-21 16:08:52 +00003535 }
drhd1766112008-09-17 00:13:12 +00003536 }
drh268380c2004-02-25 13:47:31 +00003537 }
drhf9b596e2004-05-26 16:54:42 +00003538 return n;
drh268380c2004-02-25 13:47:31 +00003539}
3540
3541/*
drh36c563a2009-11-12 13:32:22 +00003542** Generate code for a BETWEEN operator.
3543**
3544** x BETWEEN y AND z
3545**
3546** The above is equivalent to
3547**
3548** x>=y AND x<=z
3549**
3550** Code it as such, taking care to do the common subexpression
peter.d.reid60ec9142014-09-06 16:39:46 +00003551** elimination of x.
drh36c563a2009-11-12 13:32:22 +00003552*/
3553static void exprCodeBetween(
3554 Parse *pParse, /* Parsing and code generating context */
3555 Expr *pExpr, /* The BETWEEN expression */
3556 int dest, /* Jump here if the jump is taken */
3557 int jumpIfTrue, /* Take the jump if the BETWEEN is true */
3558 int jumpIfNull /* Take the jump if the BETWEEN is NULL */
3559){
3560 Expr exprAnd; /* The AND operator in x>=y AND x<=z */
3561 Expr compLeft; /* The x>=y term */
3562 Expr compRight; /* The x<=z term */
3563 Expr exprX; /* The x subexpression */
3564 int regFree1 = 0; /* Temporary use register */
3565
3566 assert( !ExprHasProperty(pExpr, EP_xIsSelect) );
3567 exprX = *pExpr->pLeft;
3568 exprAnd.op = TK_AND;
3569 exprAnd.pLeft = &compLeft;
3570 exprAnd.pRight = &compRight;
3571 compLeft.op = TK_GE;
3572 compLeft.pLeft = &exprX;
3573 compLeft.pRight = pExpr->x.pList->a[0].pExpr;
3574 compRight.op = TK_LE;
3575 compRight.pLeft = &exprX;
3576 compRight.pRight = pExpr->x.pList->a[1].pExpr;
drha4c3c872013-09-12 17:29:25 +00003577 exprToRegister(&exprX, sqlite3ExprCodeTemp(pParse, &exprX, &regFree1));
drh36c563a2009-11-12 13:32:22 +00003578 if( jumpIfTrue ){
3579 sqlite3ExprIfTrue(pParse, &exprAnd, dest, jumpIfNull);
3580 }else{
3581 sqlite3ExprIfFalse(pParse, &exprAnd, dest, jumpIfNull);
3582 }
3583 sqlite3ReleaseTempReg(pParse, regFree1);
3584
3585 /* Ensure adequate test coverage */
3586 testcase( jumpIfTrue==0 && jumpIfNull==0 && regFree1==0 );
3587 testcase( jumpIfTrue==0 && jumpIfNull==0 && regFree1!=0 );
3588 testcase( jumpIfTrue==0 && jumpIfNull!=0 && regFree1==0 );
3589 testcase( jumpIfTrue==0 && jumpIfNull!=0 && regFree1!=0 );
3590 testcase( jumpIfTrue!=0 && jumpIfNull==0 && regFree1==0 );
3591 testcase( jumpIfTrue!=0 && jumpIfNull==0 && regFree1!=0 );
3592 testcase( jumpIfTrue!=0 && jumpIfNull!=0 && regFree1==0 );
3593 testcase( jumpIfTrue!=0 && jumpIfNull!=0 && regFree1!=0 );
3594}
3595
3596/*
drhcce7d172000-05-31 15:34:51 +00003597** Generate code for a boolean expression such that a jump is made
3598** to the label "dest" if the expression is true but execution
3599** continues straight thru if the expression is false.
drhf5905aa2002-05-26 20:54:33 +00003600**
3601** If the expression evaluates to NULL (neither true nor false), then
drh35573352008-01-08 23:54:25 +00003602** take the jump if the jumpIfNull flag is SQLITE_JUMPIFNULL.
drhf2bc0132004-10-04 13:19:23 +00003603**
3604** This code depends on the fact that certain token values (ex: TK_EQ)
3605** are the same as opcode values (ex: OP_Eq) that implement the corresponding
3606** operation. Special comments in vdbe.c and the mkopcodeh.awk script in
3607** the make process cause these values to align. Assert()s in the code
3608** below verify that the numbers are aligned correctly.
drhcce7d172000-05-31 15:34:51 +00003609*/
danielk19774adee202004-05-08 08:23:19 +00003610void sqlite3ExprIfTrue(Parse *pParse, Expr *pExpr, int dest, int jumpIfNull){
drhcce7d172000-05-31 15:34:51 +00003611 Vdbe *v = pParse->pVdbe;
3612 int op = 0;
drh2dcef112008-01-12 19:03:48 +00003613 int regFree1 = 0;
3614 int regFree2 = 0;
3615 int r1, r2;
3616
drh35573352008-01-08 23:54:25 +00003617 assert( jumpIfNull==SQLITE_JUMPIFNULL || jumpIfNull==0 );
mistachkin48864df2013-03-21 21:20:32 +00003618 if( NEVER(v==0) ) return; /* Existence of VDBE checked by caller */
drh33cd4902009-05-30 20:49:20 +00003619 if( NEVER(pExpr==0) ) return; /* No way this can happen */
drhf2bc0132004-10-04 13:19:23 +00003620 op = pExpr->op;
3621 switch( op ){
drhcce7d172000-05-31 15:34:51 +00003622 case TK_AND: {
danielk19774adee202004-05-08 08:23:19 +00003623 int d2 = sqlite3VdbeMakeLabel(v);
drhc5499be2008-04-01 15:06:33 +00003624 testcase( jumpIfNull==0 );
drh35573352008-01-08 23:54:25 +00003625 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
drh54e2adb2014-01-04 15:17:04 +00003626 sqlite3ExprCachePush(pParse);
danielk19774adee202004-05-08 08:23:19 +00003627 sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull);
3628 sqlite3VdbeResolveLabel(v, d2);
drhd2490902014-04-13 19:28:15 +00003629 sqlite3ExprCachePop(pParse);
drhcce7d172000-05-31 15:34:51 +00003630 break;
3631 }
3632 case TK_OR: {
drhc5499be2008-04-01 15:06:33 +00003633 testcase( jumpIfNull==0 );
danielk19774adee202004-05-08 08:23:19 +00003634 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
drh54e2adb2014-01-04 15:17:04 +00003635 sqlite3ExprCachePush(pParse);
danielk19774adee202004-05-08 08:23:19 +00003636 sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull);
drhd2490902014-04-13 19:28:15 +00003637 sqlite3ExprCachePop(pParse);
drhcce7d172000-05-31 15:34:51 +00003638 break;
3639 }
3640 case TK_NOT: {
drhc5499be2008-04-01 15:06:33 +00003641 testcase( jumpIfNull==0 );
danielk19774adee202004-05-08 08:23:19 +00003642 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
drhcce7d172000-05-31 15:34:51 +00003643 break;
3644 }
3645 case TK_LT:
3646 case TK_LE:
3647 case TK_GT:
3648 case TK_GE:
3649 case TK_NE:
drh0ac65892002-04-20 14:24:41 +00003650 case TK_EQ: {
drhc5499be2008-04-01 15:06:33 +00003651 testcase( jumpIfNull==0 );
drhb6da74e2009-12-24 16:00:28 +00003652 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
3653 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh35573352008-01-08 23:54:25 +00003654 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
drh7d176102014-02-18 03:07:12 +00003655 r1, r2, dest, jumpIfNull);
3656 assert(TK_LT==OP_Lt); testcase(op==OP_Lt); VdbeCoverageIf(v,op==OP_Lt);
3657 assert(TK_LE==OP_Le); testcase(op==OP_Le); VdbeCoverageIf(v,op==OP_Le);
3658 assert(TK_GT==OP_Gt); testcase(op==OP_Gt); VdbeCoverageIf(v,op==OP_Gt);
3659 assert(TK_GE==OP_Ge); testcase(op==OP_Ge); VdbeCoverageIf(v,op==OP_Ge);
3660 assert(TK_EQ==OP_Eq); testcase(op==OP_Eq); VdbeCoverageIf(v,op==OP_Eq);
3661 assert(TK_NE==OP_Ne); testcase(op==OP_Ne); VdbeCoverageIf(v,op==OP_Ne);
drhc5499be2008-04-01 15:06:33 +00003662 testcase( regFree1==0 );
3663 testcase( regFree2==0 );
drhcce7d172000-05-31 15:34:51 +00003664 break;
3665 }
drh6a2fe092009-09-23 02:29:36 +00003666 case TK_IS:
3667 case TK_ISNOT: {
3668 testcase( op==TK_IS );
3669 testcase( op==TK_ISNOT );
drhb6da74e2009-12-24 16:00:28 +00003670 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
3671 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh6a2fe092009-09-23 02:29:36 +00003672 op = (op==TK_IS) ? TK_EQ : TK_NE;
3673 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
drh7d176102014-02-18 03:07:12 +00003674 r1, r2, dest, SQLITE_NULLEQ);
3675 VdbeCoverageIf(v, op==TK_EQ);
3676 VdbeCoverageIf(v, op==TK_NE);
drh6a2fe092009-09-23 02:29:36 +00003677 testcase( regFree1==0 );
3678 testcase( regFree2==0 );
3679 break;
3680 }
drhcce7d172000-05-31 15:34:51 +00003681 case TK_ISNULL:
3682 case TK_NOTNULL: {
drh7d176102014-02-18 03:07:12 +00003683 assert( TK_ISNULL==OP_IsNull ); testcase( op==TK_ISNULL );
3684 assert( TK_NOTNULL==OP_NotNull ); testcase( op==TK_NOTNULL );
drh2dcef112008-01-12 19:03:48 +00003685 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
drh7d176102014-02-18 03:07:12 +00003686 sqlite3VdbeAddOp2(v, op, r1, dest);
3687 VdbeCoverageIf(v, op==TK_ISNULL);
3688 VdbeCoverageIf(v, op==TK_NOTNULL);
drhc5499be2008-04-01 15:06:33 +00003689 testcase( regFree1==0 );
drhcce7d172000-05-31 15:34:51 +00003690 break;
3691 }
drhfef52082000-06-06 01:50:43 +00003692 case TK_BETWEEN: {
drh5c03f302009-11-13 15:03:59 +00003693 testcase( jumpIfNull==0 );
drh36c563a2009-11-12 13:32:22 +00003694 exprCodeBetween(pParse, pExpr, dest, 1, jumpIfNull);
drhfef52082000-06-06 01:50:43 +00003695 break;
3696 }
drh84e30ca2011-02-10 17:46:14 +00003697#ifndef SQLITE_OMIT_SUBQUERY
drhe3365e62009-11-12 17:52:24 +00003698 case TK_IN: {
3699 int destIfFalse = sqlite3VdbeMakeLabel(v);
3700 int destIfNull = jumpIfNull ? dest : destIfFalse;
3701 sqlite3ExprCodeIN(pParse, pExpr, destIfFalse, destIfNull);
3702 sqlite3VdbeAddOp2(v, OP_Goto, 0, dest);
3703 sqlite3VdbeResolveLabel(v, destIfFalse);
3704 break;
3705 }
shanehbb201342011-02-09 19:55:20 +00003706#endif
drhcce7d172000-05-31 15:34:51 +00003707 default: {
drh991a1982014-01-02 17:57:16 +00003708 if( exprAlwaysTrue(pExpr) ){
3709 sqlite3VdbeAddOp2(v, OP_Goto, 0, dest);
3710 }else if( exprAlwaysFalse(pExpr) ){
3711 /* No-op */
3712 }else{
3713 r1 = sqlite3ExprCodeTemp(pParse, pExpr, &regFree1);
3714 sqlite3VdbeAddOp3(v, OP_If, r1, dest, jumpIfNull!=0);
drh688852a2014-02-17 22:40:43 +00003715 VdbeCoverage(v);
drh991a1982014-01-02 17:57:16 +00003716 testcase( regFree1==0 );
3717 testcase( jumpIfNull==0 );
3718 }
drhcce7d172000-05-31 15:34:51 +00003719 break;
3720 }
3721 }
drh2dcef112008-01-12 19:03:48 +00003722 sqlite3ReleaseTempReg(pParse, regFree1);
3723 sqlite3ReleaseTempReg(pParse, regFree2);
drhcce7d172000-05-31 15:34:51 +00003724}
3725
3726/*
drh66b89c82000-11-28 20:47:17 +00003727** Generate code for a boolean expression such that a jump is made
drhcce7d172000-05-31 15:34:51 +00003728** to the label "dest" if the expression is false but execution
3729** continues straight thru if the expression is true.
drhf5905aa2002-05-26 20:54:33 +00003730**
3731** If the expression evaluates to NULL (neither true nor false) then
drh35573352008-01-08 23:54:25 +00003732** jump if jumpIfNull is SQLITE_JUMPIFNULL or fall through if jumpIfNull
3733** is 0.
drhcce7d172000-05-31 15:34:51 +00003734*/
danielk19774adee202004-05-08 08:23:19 +00003735void sqlite3ExprIfFalse(Parse *pParse, Expr *pExpr, int dest, int jumpIfNull){
drhcce7d172000-05-31 15:34:51 +00003736 Vdbe *v = pParse->pVdbe;
3737 int op = 0;
drh2dcef112008-01-12 19:03:48 +00003738 int regFree1 = 0;
3739 int regFree2 = 0;
3740 int r1, r2;
3741
drh35573352008-01-08 23:54:25 +00003742 assert( jumpIfNull==SQLITE_JUMPIFNULL || jumpIfNull==0 );
mistachkin48864df2013-03-21 21:20:32 +00003743 if( NEVER(v==0) ) return; /* Existence of VDBE checked by caller */
drh33cd4902009-05-30 20:49:20 +00003744 if( pExpr==0 ) return;
drhf2bc0132004-10-04 13:19:23 +00003745
3746 /* The value of pExpr->op and op are related as follows:
3747 **
3748 ** pExpr->op op
3749 ** --------- ----------
3750 ** TK_ISNULL OP_NotNull
3751 ** TK_NOTNULL OP_IsNull
3752 ** TK_NE OP_Eq
3753 ** TK_EQ OP_Ne
3754 ** TK_GT OP_Le
3755 ** TK_LE OP_Gt
3756 ** TK_GE OP_Lt
3757 ** TK_LT OP_Ge
3758 **
3759 ** For other values of pExpr->op, op is undefined and unused.
3760 ** The value of TK_ and OP_ constants are arranged such that we
3761 ** can compute the mapping above using the following expression.
3762 ** Assert()s verify that the computation is correct.
3763 */
3764 op = ((pExpr->op+(TK_ISNULL&1))^1)-(TK_ISNULL&1);
3765
3766 /* Verify correct alignment of TK_ and OP_ constants
3767 */
3768 assert( pExpr->op!=TK_ISNULL || op==OP_NotNull );
3769 assert( pExpr->op!=TK_NOTNULL || op==OP_IsNull );
3770 assert( pExpr->op!=TK_NE || op==OP_Eq );
3771 assert( pExpr->op!=TK_EQ || op==OP_Ne );
3772 assert( pExpr->op!=TK_LT || op==OP_Ge );
3773 assert( pExpr->op!=TK_LE || op==OP_Gt );
3774 assert( pExpr->op!=TK_GT || op==OP_Le );
3775 assert( pExpr->op!=TK_GE || op==OP_Lt );
3776
drhcce7d172000-05-31 15:34:51 +00003777 switch( pExpr->op ){
3778 case TK_AND: {
drhc5499be2008-04-01 15:06:33 +00003779 testcase( jumpIfNull==0 );
danielk19774adee202004-05-08 08:23:19 +00003780 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
drh54e2adb2014-01-04 15:17:04 +00003781 sqlite3ExprCachePush(pParse);
danielk19774adee202004-05-08 08:23:19 +00003782 sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull);
drhd2490902014-04-13 19:28:15 +00003783 sqlite3ExprCachePop(pParse);
drhcce7d172000-05-31 15:34:51 +00003784 break;
3785 }
3786 case TK_OR: {
danielk19774adee202004-05-08 08:23:19 +00003787 int d2 = sqlite3VdbeMakeLabel(v);
drhc5499be2008-04-01 15:06:33 +00003788 testcase( jumpIfNull==0 );
drh35573352008-01-08 23:54:25 +00003789 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
drh54e2adb2014-01-04 15:17:04 +00003790 sqlite3ExprCachePush(pParse);
danielk19774adee202004-05-08 08:23:19 +00003791 sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull);
3792 sqlite3VdbeResolveLabel(v, d2);
drhd2490902014-04-13 19:28:15 +00003793 sqlite3ExprCachePop(pParse);
drhcce7d172000-05-31 15:34:51 +00003794 break;
3795 }
3796 case TK_NOT: {
drh5c03f302009-11-13 15:03:59 +00003797 testcase( jumpIfNull==0 );
danielk19774adee202004-05-08 08:23:19 +00003798 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
drhcce7d172000-05-31 15:34:51 +00003799 break;
3800 }
3801 case TK_LT:
3802 case TK_LE:
3803 case TK_GT:
3804 case TK_GE:
3805 case TK_NE:
3806 case TK_EQ: {
drhc5499be2008-04-01 15:06:33 +00003807 testcase( jumpIfNull==0 );
drhb6da74e2009-12-24 16:00:28 +00003808 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
3809 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh35573352008-01-08 23:54:25 +00003810 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
drh7d176102014-02-18 03:07:12 +00003811 r1, r2, dest, jumpIfNull);
3812 assert(TK_LT==OP_Lt); testcase(op==OP_Lt); VdbeCoverageIf(v,op==OP_Lt);
3813 assert(TK_LE==OP_Le); testcase(op==OP_Le); VdbeCoverageIf(v,op==OP_Le);
3814 assert(TK_GT==OP_Gt); testcase(op==OP_Gt); VdbeCoverageIf(v,op==OP_Gt);
3815 assert(TK_GE==OP_Ge); testcase(op==OP_Ge); VdbeCoverageIf(v,op==OP_Ge);
3816 assert(TK_EQ==OP_Eq); testcase(op==OP_Eq); VdbeCoverageIf(v,op==OP_Eq);
3817 assert(TK_NE==OP_Ne); testcase(op==OP_Ne); VdbeCoverageIf(v,op==OP_Ne);
drhc5499be2008-04-01 15:06:33 +00003818 testcase( regFree1==0 );
3819 testcase( regFree2==0 );
drhcce7d172000-05-31 15:34:51 +00003820 break;
3821 }
drh6a2fe092009-09-23 02:29:36 +00003822 case TK_IS:
3823 case TK_ISNOT: {
drh6d4486a2009-09-23 14:45:05 +00003824 testcase( pExpr->op==TK_IS );
3825 testcase( pExpr->op==TK_ISNOT );
drhb6da74e2009-12-24 16:00:28 +00003826 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
3827 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, &regFree2);
drh6a2fe092009-09-23 02:29:36 +00003828 op = (pExpr->op==TK_IS) ? TK_NE : TK_EQ;
3829 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
drh7d176102014-02-18 03:07:12 +00003830 r1, r2, dest, SQLITE_NULLEQ);
3831 VdbeCoverageIf(v, op==TK_EQ);
3832 VdbeCoverageIf(v, op==TK_NE);
drh6a2fe092009-09-23 02:29:36 +00003833 testcase( regFree1==0 );
3834 testcase( regFree2==0 );
3835 break;
3836 }
drhcce7d172000-05-31 15:34:51 +00003837 case TK_ISNULL:
3838 case TK_NOTNULL: {
drh2dcef112008-01-12 19:03:48 +00003839 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
drh7d176102014-02-18 03:07:12 +00003840 sqlite3VdbeAddOp2(v, op, r1, dest);
3841 testcase( op==TK_ISNULL ); VdbeCoverageIf(v, op==TK_ISNULL);
3842 testcase( op==TK_NOTNULL ); VdbeCoverageIf(v, op==TK_NOTNULL);
drhc5499be2008-04-01 15:06:33 +00003843 testcase( regFree1==0 );
drhcce7d172000-05-31 15:34:51 +00003844 break;
3845 }
drhfef52082000-06-06 01:50:43 +00003846 case TK_BETWEEN: {
drh5c03f302009-11-13 15:03:59 +00003847 testcase( jumpIfNull==0 );
drh36c563a2009-11-12 13:32:22 +00003848 exprCodeBetween(pParse, pExpr, dest, 0, jumpIfNull);
drhfef52082000-06-06 01:50:43 +00003849 break;
3850 }
drh84e30ca2011-02-10 17:46:14 +00003851#ifndef SQLITE_OMIT_SUBQUERY
drhe3365e62009-11-12 17:52:24 +00003852 case TK_IN: {
3853 if( jumpIfNull ){
3854 sqlite3ExprCodeIN(pParse, pExpr, dest, dest);
3855 }else{
3856 int destIfNull = sqlite3VdbeMakeLabel(v);
3857 sqlite3ExprCodeIN(pParse, pExpr, dest, destIfNull);
3858 sqlite3VdbeResolveLabel(v, destIfNull);
3859 }
3860 break;
3861 }
shanehbb201342011-02-09 19:55:20 +00003862#endif
drhcce7d172000-05-31 15:34:51 +00003863 default: {
drh991a1982014-01-02 17:57:16 +00003864 if( exprAlwaysFalse(pExpr) ){
3865 sqlite3VdbeAddOp2(v, OP_Goto, 0, dest);
3866 }else if( exprAlwaysTrue(pExpr) ){
3867 /* no-op */
3868 }else{
3869 r1 = sqlite3ExprCodeTemp(pParse, pExpr, &regFree1);
3870 sqlite3VdbeAddOp3(v, OP_IfNot, r1, dest, jumpIfNull!=0);
drh688852a2014-02-17 22:40:43 +00003871 VdbeCoverage(v);
drh991a1982014-01-02 17:57:16 +00003872 testcase( regFree1==0 );
3873 testcase( jumpIfNull==0 );
3874 }
drhcce7d172000-05-31 15:34:51 +00003875 break;
3876 }
3877 }
drh2dcef112008-01-12 19:03:48 +00003878 sqlite3ReleaseTempReg(pParse, regFree1);
3879 sqlite3ReleaseTempReg(pParse, regFree2);
drhcce7d172000-05-31 15:34:51 +00003880}
drh22827922000-06-06 17:27:05 +00003881
3882/*
drh1d9da702010-01-07 15:17:02 +00003883** Do a deep comparison of two expression trees. Return 0 if the two
3884** expressions are completely identical. Return 1 if they differ only
3885** by a COLLATE operator at the top level. Return 2 if there are differences
3886** other than the top-level COLLATE operator.
drhd40aab02007-02-24 15:29:03 +00003887**
drh619a1302013-08-01 13:04:46 +00003888** If any subelement of pB has Expr.iTable==(-1) then it is allowed
3889** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
3890**
drh66518ca2013-08-01 15:09:57 +00003891** The pA side might be using TK_REGISTER. If that is the case and pB is
3892** not using TK_REGISTER but is otherwise equivalent, then still return 0.
3893**
drh1d9da702010-01-07 15:17:02 +00003894** Sometimes this routine will return 2 even if the two expressions
drhd40aab02007-02-24 15:29:03 +00003895** really are equivalent. If we cannot prove that the expressions are
drh1d9da702010-01-07 15:17:02 +00003896** identical, we return 2 just to be safe. So if this routine
3897** returns 2, then you do not really know for certain if the two
3898** expressions are the same. But if you get a 0 or 1 return, then you
drhd40aab02007-02-24 15:29:03 +00003899** can be sure the expressions are the same. In the places where
drh1d9da702010-01-07 15:17:02 +00003900** this routine is used, it does not hurt to get an extra 2 - that
drhd40aab02007-02-24 15:29:03 +00003901** just might result in some slightly slower code. But returning
drh1d9da702010-01-07 15:17:02 +00003902** an incorrect 0 or 1 could lead to a malfunction.
drh22827922000-06-06 17:27:05 +00003903*/
drh619a1302013-08-01 13:04:46 +00003904int sqlite3ExprCompare(Expr *pA, Expr *pB, int iTab){
drh10d1edf2013-11-15 15:52:39 +00003905 u32 combinedFlags;
3906 if( pA==0 || pB==0 ){
drh1d9da702010-01-07 15:17:02 +00003907 return pB==pA ? 0 : 2;
drh22827922000-06-06 17:27:05 +00003908 }
drh10d1edf2013-11-15 15:52:39 +00003909 combinedFlags = pA->flags | pB->flags;
3910 if( combinedFlags & EP_IntValue ){
3911 if( (pA->flags&pB->flags&EP_IntValue)!=0 && pA->u.iValue==pB->u.iValue ){
3912 return 0;
3913 }
drh1d9da702010-01-07 15:17:02 +00003914 return 2;
drh22827922000-06-06 17:27:05 +00003915 }
drhc2acc4e2013-11-15 18:15:19 +00003916 if( pA->op!=pB->op ){
drh619a1302013-08-01 13:04:46 +00003917 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pA->pLeft, pB, iTab)<2 ){
drhae80dde2012-12-06 21:16:43 +00003918 return 1;
3919 }
drh619a1302013-08-01 13:04:46 +00003920 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pA, pB->pLeft, iTab)<2 ){
drhae80dde2012-12-06 21:16:43 +00003921 return 1;
3922 }
3923 return 2;
3924 }
drh10d1edf2013-11-15 15:52:39 +00003925 if( pA->op!=TK_COLUMN && ALWAYS(pA->op!=TK_AGG_COLUMN) && pA->u.zToken ){
drh6b93c9a2011-10-13 15:35:52 +00003926 if( strcmp(pA->u.zToken,pB->u.zToken)!=0 ){
drhae80dde2012-12-06 21:16:43 +00003927 return pA->op==TK_COLLATE ? 1 : 2;
drh2646da72005-12-09 20:02:05 +00003928 }
drh22827922000-06-06 17:27:05 +00003929 }
drh10d1edf2013-11-15 15:52:39 +00003930 if( (pA->flags & EP_Distinct)!=(pB->flags & EP_Distinct) ) return 2;
drh85f8aa72013-11-15 20:06:26 +00003931 if( ALWAYS((combinedFlags & EP_TokenOnly)==0) ){
drh10d1edf2013-11-15 15:52:39 +00003932 if( combinedFlags & EP_xIsSelect ) return 2;
3933 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft, iTab) ) return 2;
3934 if( sqlite3ExprCompare(pA->pRight, pB->pRight, iTab) ) return 2;
3935 if( sqlite3ExprListCompare(pA->x.pList, pB->x.pList, iTab) ) return 2;
drh85f8aa72013-11-15 20:06:26 +00003936 if( ALWAYS((combinedFlags & EP_Reduced)==0) ){
drh10d1edf2013-11-15 15:52:39 +00003937 if( pA->iColumn!=pB->iColumn ) return 2;
3938 if( pA->iTable!=pB->iTable
drh85f8aa72013-11-15 20:06:26 +00003939 && (pA->iTable!=iTab || NEVER(pB->iTable>=0)) ) return 2;
drh10d1edf2013-11-15 15:52:39 +00003940 }
3941 }
drh1d9da702010-01-07 15:17:02 +00003942 return 0;
drh22827922000-06-06 17:27:05 +00003943}
3944
drh8c6f6662010-04-26 19:17:26 +00003945/*
3946** Compare two ExprList objects. Return 0 if they are identical and
3947** non-zero if they differ in any way.
3948**
drh619a1302013-08-01 13:04:46 +00003949** If any subelement of pB has Expr.iTable==(-1) then it is allowed
3950** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
3951**
drh8c6f6662010-04-26 19:17:26 +00003952** This routine might return non-zero for equivalent ExprLists. The
3953** only consequence will be disabled optimizations. But this routine
3954** must never return 0 if the two ExprList objects are different, or
3955** a malfunction will result.
3956**
3957** Two NULL pointers are considered to be the same. But a NULL pointer
3958** always differs from a non-NULL pointer.
3959*/
drh619a1302013-08-01 13:04:46 +00003960int sqlite3ExprListCompare(ExprList *pA, ExprList *pB, int iTab){
drh8c6f6662010-04-26 19:17:26 +00003961 int i;
3962 if( pA==0 && pB==0 ) return 0;
3963 if( pA==0 || pB==0 ) return 1;
3964 if( pA->nExpr!=pB->nExpr ) return 1;
3965 for(i=0; i<pA->nExpr; i++){
3966 Expr *pExprA = pA->a[i].pExpr;
3967 Expr *pExprB = pB->a[i].pExpr;
3968 if( pA->a[i].sortOrder!=pB->a[i].sortOrder ) return 1;
drh619a1302013-08-01 13:04:46 +00003969 if( sqlite3ExprCompare(pExprA, pExprB, iTab) ) return 1;
drh8c6f6662010-04-26 19:17:26 +00003970 }
3971 return 0;
3972}
drh13449892005-09-07 21:22:45 +00003973
drh22827922000-06-06 17:27:05 +00003974/*
drh4bd5f732013-07-31 23:22:39 +00003975** Return true if we can prove the pE2 will always be true if pE1 is
3976** true. Return false if we cannot complete the proof or if pE2 might
3977** be false. Examples:
3978**
drh619a1302013-08-01 13:04:46 +00003979** pE1: x==5 pE2: x==5 Result: true
3980** pE1: x>0 pE2: x==5 Result: false
3981** pE1: x=21 pE2: x=21 OR y=43 Result: true
3982** pE1: x!=123 pE2: x IS NOT NULL Result: true
3983** pE1: x!=?1 pE2: x IS NOT NULL Result: true
3984** pE1: x IS NULL pE2: x IS NOT NULL Result: false
3985** pE1: x IS ?2 pE2: x IS NOT NULL Reuslt: false
drh4bd5f732013-07-31 23:22:39 +00003986**
3987** When comparing TK_COLUMN nodes between pE1 and pE2, if pE2 has
3988** Expr.iTable<0 then assume a table number given by iTab.
3989**
3990** When in doubt, return false. Returning true might give a performance
3991** improvement. Returning false might cause a performance reduction, but
3992** it will always give the correct answer and is hence always safe.
3993*/
3994int sqlite3ExprImpliesExpr(Expr *pE1, Expr *pE2, int iTab){
drh619a1302013-08-01 13:04:46 +00003995 if( sqlite3ExprCompare(pE1, pE2, iTab)==0 ){
3996 return 1;
3997 }
3998 if( pE2->op==TK_OR
3999 && (sqlite3ExprImpliesExpr(pE1, pE2->pLeft, iTab)
4000 || sqlite3ExprImpliesExpr(pE1, pE2->pRight, iTab) )
4001 ){
4002 return 1;
4003 }
4004 if( pE2->op==TK_NOTNULL
4005 && sqlite3ExprCompare(pE1->pLeft, pE2->pLeft, iTab)==0
4006 && (pE1->op!=TK_ISNULL && pE1->op!=TK_IS)
4007 ){
4008 return 1;
4009 }
4010 return 0;
drh4bd5f732013-07-31 23:22:39 +00004011}
4012
4013/*
drh030796d2012-08-23 16:18:10 +00004014** An instance of the following structure is used by the tree walker
4015** to count references to table columns in the arguments of an
drhed551b92012-08-23 19:46:11 +00004016** aggregate function, in order to implement the
4017** sqlite3FunctionThisSrc() routine.
drh374fdce2012-04-17 16:38:53 +00004018*/
drh030796d2012-08-23 16:18:10 +00004019struct SrcCount {
4020 SrcList *pSrc; /* One particular FROM clause in a nested query */
4021 int nThis; /* Number of references to columns in pSrcList */
4022 int nOther; /* Number of references to columns in other FROM clauses */
4023};
4024
4025/*
4026** Count the number of references to columns.
4027*/
4028static int exprSrcCount(Walker *pWalker, Expr *pExpr){
drhfb0a6082012-08-24 01:07:52 +00004029 /* The NEVER() on the second term is because sqlite3FunctionUsesThisSrc()
4030 ** is always called before sqlite3ExprAnalyzeAggregates() and so the
4031 ** TK_COLUMNs have not yet been converted into TK_AGG_COLUMN. If
4032 ** sqlite3FunctionUsesThisSrc() is used differently in the future, the
4033 ** NEVER() will need to be removed. */
4034 if( pExpr->op==TK_COLUMN || NEVER(pExpr->op==TK_AGG_COLUMN) ){
drh374fdce2012-04-17 16:38:53 +00004035 int i;
drh030796d2012-08-23 16:18:10 +00004036 struct SrcCount *p = pWalker->u.pSrcCount;
4037 SrcList *pSrc = p->pSrc;
drh374fdce2012-04-17 16:38:53 +00004038 for(i=0; i<pSrc->nSrc; i++){
drh030796d2012-08-23 16:18:10 +00004039 if( pExpr->iTable==pSrc->a[i].iCursor ) break;
drh374fdce2012-04-17 16:38:53 +00004040 }
drh030796d2012-08-23 16:18:10 +00004041 if( i<pSrc->nSrc ){
4042 p->nThis++;
4043 }else{
4044 p->nOther++;
4045 }
drh374fdce2012-04-17 16:38:53 +00004046 }
drh030796d2012-08-23 16:18:10 +00004047 return WRC_Continue;
drh374fdce2012-04-17 16:38:53 +00004048}
4049
4050/*
drh030796d2012-08-23 16:18:10 +00004051** Determine if any of the arguments to the pExpr Function reference
4052** pSrcList. Return true if they do. Also return true if the function
4053** has no arguments or has only constant arguments. Return false if pExpr
4054** references columns but not columns of tables found in pSrcList.
drh374fdce2012-04-17 16:38:53 +00004055*/
drh030796d2012-08-23 16:18:10 +00004056int sqlite3FunctionUsesThisSrc(Expr *pExpr, SrcList *pSrcList){
drh374fdce2012-04-17 16:38:53 +00004057 Walker w;
drh030796d2012-08-23 16:18:10 +00004058 struct SrcCount cnt;
drh374fdce2012-04-17 16:38:53 +00004059 assert( pExpr->op==TK_AGG_FUNCTION );
4060 memset(&w, 0, sizeof(w));
drh030796d2012-08-23 16:18:10 +00004061 w.xExprCallback = exprSrcCount;
4062 w.u.pSrcCount = &cnt;
4063 cnt.pSrc = pSrcList;
4064 cnt.nThis = 0;
4065 cnt.nOther = 0;
4066 sqlite3WalkExprList(&w, pExpr->x.pList);
4067 return cnt.nThis>0 || cnt.nOther==0;
drh374fdce2012-04-17 16:38:53 +00004068}
4069
4070/*
drh13449892005-09-07 21:22:45 +00004071** Add a new element to the pAggInfo->aCol[] array. Return the index of
4072** the new element. Return a negative number if malloc fails.
drh22827922000-06-06 17:27:05 +00004073*/
drh17435752007-08-16 04:30:38 +00004074static int addAggInfoColumn(sqlite3 *db, AggInfo *pInfo){
drh13449892005-09-07 21:22:45 +00004075 int i;
drhcf643722007-03-27 13:36:37 +00004076 pInfo->aCol = sqlite3ArrayAllocate(
drh17435752007-08-16 04:30:38 +00004077 db,
drhcf643722007-03-27 13:36:37 +00004078 pInfo->aCol,
4079 sizeof(pInfo->aCol[0]),
drhcf643722007-03-27 13:36:37 +00004080 &pInfo->nColumn,
drhcf643722007-03-27 13:36:37 +00004081 &i
4082 );
drh13449892005-09-07 21:22:45 +00004083 return i;
4084}
4085
4086/*
4087** Add a new element to the pAggInfo->aFunc[] array. Return the index of
4088** the new element. Return a negative number if malloc fails.
4089*/
drh17435752007-08-16 04:30:38 +00004090static int addAggInfoFunc(sqlite3 *db, AggInfo *pInfo){
drh13449892005-09-07 21:22:45 +00004091 int i;
drhcf643722007-03-27 13:36:37 +00004092 pInfo->aFunc = sqlite3ArrayAllocate(
drh17435752007-08-16 04:30:38 +00004093 db,
drhcf643722007-03-27 13:36:37 +00004094 pInfo->aFunc,
4095 sizeof(pInfo->aFunc[0]),
drhcf643722007-03-27 13:36:37 +00004096 &pInfo->nFunc,
drhcf643722007-03-27 13:36:37 +00004097 &i
4098 );
drh13449892005-09-07 21:22:45 +00004099 return i;
4100}
drh22827922000-06-06 17:27:05 +00004101
4102/*
drh7d10d5a2008-08-20 16:35:10 +00004103** This is the xExprCallback for a tree walker. It is used to
4104** implement sqlite3ExprAnalyzeAggregates(). See sqlite3ExprAnalyzeAggregates
drh626a8792005-01-17 22:08:19 +00004105** for additional information.
drh22827922000-06-06 17:27:05 +00004106*/
drh7d10d5a2008-08-20 16:35:10 +00004107static int analyzeAggregate(Walker *pWalker, Expr *pExpr){
drh22827922000-06-06 17:27:05 +00004108 int i;
drh7d10d5a2008-08-20 16:35:10 +00004109 NameContext *pNC = pWalker->u.pNC;
danielk1977a58fdfb2005-02-08 07:50:40 +00004110 Parse *pParse = pNC->pParse;
4111 SrcList *pSrcList = pNC->pSrcList;
drh13449892005-09-07 21:22:45 +00004112 AggInfo *pAggInfo = pNC->pAggInfo;
drh22827922000-06-06 17:27:05 +00004113
drh22827922000-06-06 17:27:05 +00004114 switch( pExpr->op ){
drh89c69d02007-01-04 01:20:28 +00004115 case TK_AGG_COLUMN:
drh967e8b72000-06-21 13:59:10 +00004116 case TK_COLUMN: {
drh8b213892008-08-29 02:14:02 +00004117 testcase( pExpr->op==TK_AGG_COLUMN );
4118 testcase( pExpr->op==TK_COLUMN );
drh13449892005-09-07 21:22:45 +00004119 /* Check to see if the column is in one of the tables in the FROM
4120 ** clause of the aggregate query */
drh20bc3932009-05-30 23:35:43 +00004121 if( ALWAYS(pSrcList!=0) ){
drh13449892005-09-07 21:22:45 +00004122 struct SrcList_item *pItem = pSrcList->a;
4123 for(i=0; i<pSrcList->nSrc; i++, pItem++){
4124 struct AggInfo_col *pCol;
drhc5cd1242013-09-12 16:50:49 +00004125 assert( !ExprHasProperty(pExpr, EP_TokenOnly|EP_Reduced) );
drh13449892005-09-07 21:22:45 +00004126 if( pExpr->iTable==pItem->iCursor ){
4127 /* If we reach this point, it means that pExpr refers to a table
4128 ** that is in the FROM clause of the aggregate query.
4129 **
4130 ** Make an entry for the column in pAggInfo->aCol[] if there
4131 ** is not an entry there already.
4132 */
drh7f906d62007-03-12 23:48:52 +00004133 int k;
drh13449892005-09-07 21:22:45 +00004134 pCol = pAggInfo->aCol;
drh7f906d62007-03-12 23:48:52 +00004135 for(k=0; k<pAggInfo->nColumn; k++, pCol++){
drh13449892005-09-07 21:22:45 +00004136 if( pCol->iTable==pExpr->iTable &&
4137 pCol->iColumn==pExpr->iColumn ){
4138 break;
4139 }
danielk1977a58fdfb2005-02-08 07:50:40 +00004140 }
danielk19771e536952007-08-16 10:09:01 +00004141 if( (k>=pAggInfo->nColumn)
4142 && (k = addAggInfoColumn(pParse->db, pAggInfo))>=0
4143 ){
drh7f906d62007-03-12 23:48:52 +00004144 pCol = &pAggInfo->aCol[k];
danielk19770817d0d2007-02-14 09:19:36 +00004145 pCol->pTab = pExpr->pTab;
drh13449892005-09-07 21:22:45 +00004146 pCol->iTable = pExpr->iTable;
4147 pCol->iColumn = pExpr->iColumn;
drh0a07c102008-01-03 18:03:08 +00004148 pCol->iMem = ++pParse->nMem;
drh13449892005-09-07 21:22:45 +00004149 pCol->iSorterColumn = -1;
drh5774b802005-09-07 22:48:16 +00004150 pCol->pExpr = pExpr;
drh13449892005-09-07 21:22:45 +00004151 if( pAggInfo->pGroupBy ){
4152 int j, n;
4153 ExprList *pGB = pAggInfo->pGroupBy;
4154 struct ExprList_item *pTerm = pGB->a;
4155 n = pGB->nExpr;
4156 for(j=0; j<n; j++, pTerm++){
4157 Expr *pE = pTerm->pExpr;
4158 if( pE->op==TK_COLUMN && pE->iTable==pExpr->iTable &&
4159 pE->iColumn==pExpr->iColumn ){
4160 pCol->iSorterColumn = j;
4161 break;
4162 }
4163 }
4164 }
4165 if( pCol->iSorterColumn<0 ){
4166 pCol->iSorterColumn = pAggInfo->nSortingColumn++;
4167 }
4168 }
4169 /* There is now an entry for pExpr in pAggInfo->aCol[] (either
4170 ** because it was there before or because we just created it).
4171 ** Convert the pExpr to be a TK_AGG_COLUMN referring to that
4172 ** pAggInfo->aCol[] entry.
4173 */
drhebb6a652013-09-12 23:42:22 +00004174 ExprSetVVAProperty(pExpr, EP_NoReduce);
drh13449892005-09-07 21:22:45 +00004175 pExpr->pAggInfo = pAggInfo;
4176 pExpr->op = TK_AGG_COLUMN;
shanecf697392009-06-01 16:53:09 +00004177 pExpr->iAgg = (i16)k;
drh13449892005-09-07 21:22:45 +00004178 break;
4179 } /* endif pExpr->iTable==pItem->iCursor */
4180 } /* end loop over pSrcList */
drh22827922000-06-06 17:27:05 +00004181 }
drh7d10d5a2008-08-20 16:35:10 +00004182 return WRC_Prune;
drh22827922000-06-06 17:27:05 +00004183 }
4184 case TK_AGG_FUNCTION: {
drh3a8c4be2012-05-21 20:13:39 +00004185 if( (pNC->ncFlags & NC_InAggFunc)==0
drhed551b92012-08-23 19:46:11 +00004186 && pWalker->walkerDepth==pExpr->op2
drh3a8c4be2012-05-21 20:13:39 +00004187 ){
drh13449892005-09-07 21:22:45 +00004188 /* Check to see if pExpr is a duplicate of another aggregate
4189 ** function that is already in the pAggInfo structure
4190 */
4191 struct AggInfo_func *pItem = pAggInfo->aFunc;
4192 for(i=0; i<pAggInfo->nFunc; i++, pItem++){
drh619a1302013-08-01 13:04:46 +00004193 if( sqlite3ExprCompare(pItem->pExpr, pExpr, -1)==0 ){
danielk1977a58fdfb2005-02-08 07:50:40 +00004194 break;
4195 }
drh22827922000-06-06 17:27:05 +00004196 }
drh13449892005-09-07 21:22:45 +00004197 if( i>=pAggInfo->nFunc ){
4198 /* pExpr is original. Make a new entry in pAggInfo->aFunc[]
4199 */
danielk197714db2662006-01-09 16:12:04 +00004200 u8 enc = ENC(pParse->db);
danielk19771e536952007-08-16 10:09:01 +00004201 i = addAggInfoFunc(pParse->db, pAggInfo);
drh13449892005-09-07 21:22:45 +00004202 if( i>=0 ){
danielk19776ab3a2e2009-02-19 14:39:25 +00004203 assert( !ExprHasProperty(pExpr, EP_xIsSelect) );
drh13449892005-09-07 21:22:45 +00004204 pItem = &pAggInfo->aFunc[i];
4205 pItem->pExpr = pExpr;
drh0a07c102008-01-03 18:03:08 +00004206 pItem->iMem = ++pParse->nMem;
drh33e619f2009-05-28 01:00:55 +00004207 assert( !ExprHasProperty(pExpr, EP_IntValue) );
drh13449892005-09-07 21:22:45 +00004208 pItem->pFunc = sqlite3FindFunction(pParse->db,
drh33e619f2009-05-28 01:00:55 +00004209 pExpr->u.zToken, sqlite3Strlen30(pExpr->u.zToken),
danielk19776ab3a2e2009-02-19 14:39:25 +00004210 pExpr->x.pList ? pExpr->x.pList->nExpr : 0, enc, 0);
drhfd357972005-09-09 01:33:19 +00004211 if( pExpr->flags & EP_Distinct ){
4212 pItem->iDistinct = pParse->nTab++;
4213 }else{
4214 pItem->iDistinct = -1;
4215 }
drh13449892005-09-07 21:22:45 +00004216 }
danielk1977a58fdfb2005-02-08 07:50:40 +00004217 }
drh13449892005-09-07 21:22:45 +00004218 /* Make pExpr point to the appropriate pAggInfo->aFunc[] entry
4219 */
drhc5cd1242013-09-12 16:50:49 +00004220 assert( !ExprHasProperty(pExpr, EP_TokenOnly|EP_Reduced) );
drhebb6a652013-09-12 23:42:22 +00004221 ExprSetVVAProperty(pExpr, EP_NoReduce);
shanecf697392009-06-01 16:53:09 +00004222 pExpr->iAgg = (i16)i;
drh13449892005-09-07 21:22:45 +00004223 pExpr->pAggInfo = pAggInfo;
drh6e83a572012-11-02 18:48:49 +00004224 return WRC_Prune;
4225 }else{
4226 return WRC_Continue;
drh22827922000-06-06 17:27:05 +00004227 }
drh22827922000-06-06 17:27:05 +00004228 }
4229 }
drh7d10d5a2008-08-20 16:35:10 +00004230 return WRC_Continue;
4231}
4232static int analyzeAggregatesInSelect(Walker *pWalker, Select *pSelect){
drhd5a336e2012-04-19 15:49:19 +00004233 UNUSED_PARAMETER(pWalker);
4234 UNUSED_PARAMETER(pSelect);
drh374fdce2012-04-17 16:38:53 +00004235 return WRC_Continue;
drh626a8792005-01-17 22:08:19 +00004236}
4237
4238/*
drhe8abb4c2012-11-02 18:24:57 +00004239** Analyze the pExpr expression looking for aggregate functions and
4240** for variables that need to be added to AggInfo object that pNC->pAggInfo
4241** points to. Additional entries are made on the AggInfo object as
4242** necessary.
drh626a8792005-01-17 22:08:19 +00004243**
4244** This routine should only be called after the expression has been
drh7d10d5a2008-08-20 16:35:10 +00004245** analyzed by sqlite3ResolveExprNames().
drh626a8792005-01-17 22:08:19 +00004246*/
drhd2b3e232008-01-23 14:51:49 +00004247void sqlite3ExprAnalyzeAggregates(NameContext *pNC, Expr *pExpr){
drh7d10d5a2008-08-20 16:35:10 +00004248 Walker w;
drh374fdce2012-04-17 16:38:53 +00004249 memset(&w, 0, sizeof(w));
drh7d10d5a2008-08-20 16:35:10 +00004250 w.xExprCallback = analyzeAggregate;
4251 w.xSelectCallback = analyzeAggregatesInSelect;
4252 w.u.pNC = pNC;
drh20bc3932009-05-30 23:35:43 +00004253 assert( pNC->pSrcList!=0 );
drh7d10d5a2008-08-20 16:35:10 +00004254 sqlite3WalkExpr(&w, pExpr);
drh22827922000-06-06 17:27:05 +00004255}
drh5d9a4af2005-08-30 00:54:01 +00004256
4257/*
4258** Call sqlite3ExprAnalyzeAggregates() for every expression in an
4259** expression list. Return the number of errors.
4260**
4261** If an error is found, the analysis is cut short.
4262*/
drhd2b3e232008-01-23 14:51:49 +00004263void sqlite3ExprAnalyzeAggList(NameContext *pNC, ExprList *pList){
drh5d9a4af2005-08-30 00:54:01 +00004264 struct ExprList_item *pItem;
4265 int i;
drh5d9a4af2005-08-30 00:54:01 +00004266 if( pList ){
drhd2b3e232008-01-23 14:51:49 +00004267 for(pItem=pList->a, i=0; i<pList->nExpr; i++, pItem++){
4268 sqlite3ExprAnalyzeAggregates(pNC, pItem->pExpr);
drh5d9a4af2005-08-30 00:54:01 +00004269 }
4270 }
drh5d9a4af2005-08-30 00:54:01 +00004271}
drh892d3172008-01-10 03:46:36 +00004272
4273/*
drhceea3322009-04-23 13:22:42 +00004274** Allocate a single new register for use to hold some intermediate result.
drh892d3172008-01-10 03:46:36 +00004275*/
4276int sqlite3GetTempReg(Parse *pParse){
drhe55cbd72008-03-31 23:48:03 +00004277 if( pParse->nTempReg==0 ){
drh892d3172008-01-10 03:46:36 +00004278 return ++pParse->nMem;
4279 }
danielk19772f425f62008-07-04 09:41:39 +00004280 return pParse->aTempReg[--pParse->nTempReg];
drh892d3172008-01-10 03:46:36 +00004281}
drhceea3322009-04-23 13:22:42 +00004282
4283/*
4284** Deallocate a register, making available for reuse for some other
4285** purpose.
4286**
4287** If a register is currently being used by the column cache, then
peter.d.reid60ec9142014-09-06 16:39:46 +00004288** the deallocation is deferred until the column cache line that uses
drhceea3322009-04-23 13:22:42 +00004289** the register becomes stale.
4290*/
drh892d3172008-01-10 03:46:36 +00004291void sqlite3ReleaseTempReg(Parse *pParse, int iReg){
drh2dcef112008-01-12 19:03:48 +00004292 if( iReg && pParse->nTempReg<ArraySize(pParse->aTempReg) ){
drhceea3322009-04-23 13:22:42 +00004293 int i;
4294 struct yColCache *p;
4295 for(i=0, p=pParse->aColCache; i<SQLITE_N_COLCACHE; i++, p++){
4296 if( p->iReg==iReg ){
4297 p->tempReg = 1;
4298 return;
4299 }
4300 }
drh892d3172008-01-10 03:46:36 +00004301 pParse->aTempReg[pParse->nTempReg++] = iReg;
4302 }
4303}
4304
4305/*
4306** Allocate or deallocate a block of nReg consecutive registers
4307*/
4308int sqlite3GetTempRange(Parse *pParse, int nReg){
drhe55cbd72008-03-31 23:48:03 +00004309 int i, n;
4310 i = pParse->iRangeReg;
4311 n = pParse->nRangeReg;
drhf49f3522009-12-30 14:12:38 +00004312 if( nReg<=n ){
4313 assert( !usedAsColumnCache(pParse, i, i+n-1) );
drh892d3172008-01-10 03:46:36 +00004314 pParse->iRangeReg += nReg;
4315 pParse->nRangeReg -= nReg;
4316 }else{
4317 i = pParse->nMem+1;
4318 pParse->nMem += nReg;
4319 }
4320 return i;
4321}
4322void sqlite3ReleaseTempRange(Parse *pParse, int iReg, int nReg){
drhf49f3522009-12-30 14:12:38 +00004323 sqlite3ExprCacheRemove(pParse, iReg, nReg);
drh892d3172008-01-10 03:46:36 +00004324 if( nReg>pParse->nRangeReg ){
4325 pParse->nRangeReg = nReg;
4326 pParse->iRangeReg = iReg;
4327 }
4328}
drhcdc69552011-12-06 13:24:59 +00004329
4330/*
4331** Mark all temporary registers as being unavailable for reuse.
4332*/
4333void sqlite3ClearTempRegCache(Parse *pParse){
4334 pParse->nTempReg = 0;
4335 pParse->nRangeReg = 0;
4336}