OLD | NEW |
1 /* | 1 /* |
2 ** 2001 September 15 | 2 ** 2001 September 15 |
3 ** | 3 ** |
4 ** The author disclaims copyright to this source code. In place of | 4 ** The author disclaims copyright to this source code. In place of |
5 ** a legal notice, here is a blessing: | 5 ** a legal notice, here is a blessing: |
6 ** | 6 ** |
7 ** May you do good and not evil. | 7 ** May you do good and not evil. |
8 ** May you find forgiveness for yourself and forgive others. | 8 ** May you find forgiveness for yourself and forgive others. |
9 ** May you share freely, never taking more than you give. | 9 ** May you share freely, never taking more than you give. |
10 ** | 10 ** |
(...skipping 14 matching lines...) Expand all Loading... |
25 ** The following fields are initialized appropriate in pSrc: | 25 ** The following fields are initialized appropriate in pSrc: |
26 ** | 26 ** |
27 ** pSrc->a[0].pTab Pointer to the Table object | 27 ** pSrc->a[0].pTab Pointer to the Table object |
28 ** pSrc->a[0].pIndex Pointer to the INDEXED BY index, if there is one | 28 ** pSrc->a[0].pIndex Pointer to the INDEXED BY index, if there is one |
29 ** | 29 ** |
30 */ | 30 */ |
31 Table *sqlite3SrcListLookup(Parse *pParse, SrcList *pSrc){ | 31 Table *sqlite3SrcListLookup(Parse *pParse, SrcList *pSrc){ |
32 struct SrcList_item *pItem = pSrc->a; | 32 struct SrcList_item *pItem = pSrc->a; |
33 Table *pTab; | 33 Table *pTab; |
34 assert( pItem && pSrc->nSrc==1 ); | 34 assert( pItem && pSrc->nSrc==1 ); |
35 pTab = sqlite3LocateTable(pParse, 0, pItem->zName, pItem->zDatabase); | 35 pTab = sqlite3LocateTableItem(pParse, 0, pItem); |
36 sqlite3DeleteTable(pParse->db, pItem->pTab); | 36 sqlite3DeleteTable(pParse->db, pItem->pTab); |
37 pItem->pTab = pTab; | 37 pItem->pTab = pTab; |
38 if( pTab ){ | 38 if( pTab ){ |
39 pTab->nRef++; | 39 pTab->nRef++; |
40 } | 40 } |
41 if( sqlite3IndexedByLookup(pParse, pItem) ){ | 41 if( sqlite3IndexedByLookup(pParse, pItem) ){ |
42 pTab = 0; | 42 pTab = 0; |
43 } | 43 } |
44 return pTab; | 44 return pTab; |
45 } | 45 } |
(...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
83 #if !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) | 83 #if !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) |
84 /* | 84 /* |
85 ** Evaluate a view and store its result in an ephemeral table. The | 85 ** Evaluate a view and store its result in an ephemeral table. The |
86 ** pWhere argument is an optional WHERE clause that restricts the | 86 ** pWhere argument is an optional WHERE clause that restricts the |
87 ** set of rows in the view that are to be added to the ephemeral table. | 87 ** set of rows in the view that are to be added to the ephemeral table. |
88 */ | 88 */ |
89 void sqlite3MaterializeView( | 89 void sqlite3MaterializeView( |
90 Parse *pParse, /* Parsing context */ | 90 Parse *pParse, /* Parsing context */ |
91 Table *pView, /* View definition */ | 91 Table *pView, /* View definition */ |
92 Expr *pWhere, /* Optional WHERE clause to be added */ | 92 Expr *pWhere, /* Optional WHERE clause to be added */ |
93 int iCur /* Cursor number for ephemerial table */ | 93 int iCur /* Cursor number for ephemeral table */ |
94 ){ | 94 ){ |
95 SelectDest dest; | 95 SelectDest dest; |
96 Select *pDup; | 96 Select *pSel; |
| 97 SrcList *pFrom; |
97 sqlite3 *db = pParse->db; | 98 sqlite3 *db = pParse->db; |
98 | 99 int iDb = sqlite3SchemaToIndex(db, pView->pSchema); |
99 pDup = sqlite3SelectDup(db, pView->pSelect, 0); | 100 pWhere = sqlite3ExprDup(db, pWhere, 0); |
100 if( pWhere ){ | 101 pFrom = sqlite3SrcListAppend(db, 0, 0, 0); |
101 SrcList *pFrom; | 102 if( pFrom ){ |
102 | 103 assert( pFrom->nSrc==1 ); |
103 pWhere = sqlite3ExprDup(db, pWhere, 0); | 104 pFrom->a[0].zName = sqlite3DbStrDup(db, pView->zName); |
104 pFrom = sqlite3SrcListAppend(db, 0, 0, 0); | 105 pFrom->a[0].zDatabase = sqlite3DbStrDup(db, db->aDb[iDb].zName); |
105 if( pFrom ){ | 106 assert( pFrom->a[0].pOn==0 ); |
106 assert( pFrom->nSrc==1 ); | 107 assert( pFrom->a[0].pUsing==0 ); |
107 pFrom->a[0].zAlias = sqlite3DbStrDup(db, pView->zName); | |
108 pFrom->a[0].pSelect = pDup; | |
109 assert( pFrom->a[0].pOn==0 ); | |
110 assert( pFrom->a[0].pUsing==0 ); | |
111 }else{ | |
112 sqlite3SelectDelete(db, pDup); | |
113 } | |
114 pDup = sqlite3SelectNew(pParse, 0, pFrom, pWhere, 0, 0, 0, 0, 0, 0); | |
115 } | 108 } |
| 109 pSel = sqlite3SelectNew(pParse, 0, pFrom, pWhere, 0, 0, 0, 0, 0, 0); |
116 sqlite3SelectDestInit(&dest, SRT_EphemTab, iCur); | 110 sqlite3SelectDestInit(&dest, SRT_EphemTab, iCur); |
117 sqlite3Select(pParse, pDup, &dest); | 111 sqlite3Select(pParse, pSel, &dest); |
118 sqlite3SelectDelete(db, pDup); | 112 sqlite3SelectDelete(db, pSel); |
119 } | 113 } |
120 #endif /* !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) */ | 114 #endif /* !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) */ |
121 | 115 |
122 #if defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY) | 116 #if defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY) |
123 /* | 117 /* |
124 ** Generate an expression tree to implement the WHERE, ORDER BY, | 118 ** Generate an expression tree to implement the WHERE, ORDER BY, |
125 ** and LIMIT/OFFSET portion of DELETE and UPDATE statements. | 119 ** and LIMIT/OFFSET portion of DELETE and UPDATE statements. |
126 ** | 120 ** |
127 ** DELETE FROM table_wxyz WHERE a<5 ORDER BY a LIMIT 1; | 121 ** DELETE FROM table_wxyz WHERE a<5 ORDER BY a LIMIT 1; |
128 ** \__________________________/ | 122 ** \__________________________/ |
129 ** pLimitWhere (pInClause) | 123 ** pLimitWhere (pInClause) |
130 */ | 124 */ |
131 Expr *sqlite3LimitWhere( | 125 Expr *sqlite3LimitWhere( |
132 Parse *pParse, /* The parser context */ | 126 Parse *pParse, /* The parser context */ |
133 SrcList *pSrc, /* the FROM clause -- which tables to scan */ | 127 SrcList *pSrc, /* the FROM clause -- which tables to scan */ |
134 Expr *pWhere, /* The WHERE clause. May be null */ | 128 Expr *pWhere, /* The WHERE clause. May be null */ |
135 ExprList *pOrderBy, /* The ORDER BY clause. May be null */ | 129 ExprList *pOrderBy, /* The ORDER BY clause. May be null */ |
136 Expr *pLimit, /* The LIMIT clause. May be null */ | 130 Expr *pLimit, /* The LIMIT clause. May be null */ |
137 Expr *pOffset, /* The OFFSET clause. May be null */ | 131 Expr *pOffset, /* The OFFSET clause. May be null */ |
138 char *zStmtType /* Either DELETE or UPDATE. For error messages.
*/ | 132 char *zStmtType /* Either DELETE or UPDATE. For err msgs. */ |
139 ){ | 133 ){ |
140 Expr *pWhereRowid = NULL; /* WHERE rowid .. */ | 134 Expr *pWhereRowid = NULL; /* WHERE rowid .. */ |
141 Expr *pInClause = NULL; /* WHERE rowid IN ( select ) */ | 135 Expr *pInClause = NULL; /* WHERE rowid IN ( select ) */ |
142 Expr *pSelectRowid = NULL; /* SELECT rowid ... */ | 136 Expr *pSelectRowid = NULL; /* SELECT rowid ... */ |
143 ExprList *pEList = NULL; /* Expression list contaning only pSelectRowid */ | 137 ExprList *pEList = NULL; /* Expression list contaning only pSelectRowid */ |
144 SrcList *pSelectSrc = NULL; /* SELECT rowid FROM x ... (dup of pSrc) */ | 138 SrcList *pSelectSrc = NULL; /* SELECT rowid FROM x ... (dup of pSrc) */ |
145 Select *pSelect = NULL; /* Complete SELECT tree */ | 139 Select *pSelect = NULL; /* Complete SELECT tree */ |
146 | 140 |
147 /* Check that there isn't an ORDER BY without a LIMIT clause. | 141 /* Check that there isn't an ORDER BY without a LIMIT clause. |
148 */ | 142 */ |
149 if( pOrderBy && (pLimit == 0) ) { | 143 if( pOrderBy && (pLimit == 0) ) { |
150 sqlite3ErrorMsg(pParse, "ORDER BY without LIMIT on %s", zStmtType); | 144 sqlite3ErrorMsg(pParse, "ORDER BY without LIMIT on %s", zStmtType); |
151 pParse->parseError = 1; | |
152 goto limit_where_cleanup_2; | 145 goto limit_where_cleanup_2; |
153 } | 146 } |
154 | 147 |
155 /* We only need to generate a select expression if there | 148 /* We only need to generate a select expression if there |
156 ** is a limit/offset term to enforce. | 149 ** is a limit/offset term to enforce. |
157 */ | 150 */ |
158 if( pLimit == 0 ) { | 151 if( pLimit == 0 ) { |
159 /* if pLimit is null, pOffset will always be null as well. */ | 152 /* if pLimit is null, pOffset will always be null as well. */ |
160 assert( pOffset == 0 ); | 153 assert( pOffset == 0 ); |
161 return pWhere; | 154 return pWhere; |
(...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
204 sqlite3SelectDelete(pParse->db, pSelect); | 197 sqlite3SelectDelete(pParse->db, pSelect); |
205 return 0; | 198 return 0; |
206 | 199 |
207 limit_where_cleanup_2: | 200 limit_where_cleanup_2: |
208 sqlite3ExprDelete(pParse->db, pWhere); | 201 sqlite3ExprDelete(pParse->db, pWhere); |
209 sqlite3ExprListDelete(pParse->db, pOrderBy); | 202 sqlite3ExprListDelete(pParse->db, pOrderBy); |
210 sqlite3ExprDelete(pParse->db, pLimit); | 203 sqlite3ExprDelete(pParse->db, pLimit); |
211 sqlite3ExprDelete(pParse->db, pOffset); | 204 sqlite3ExprDelete(pParse->db, pOffset); |
212 return 0; | 205 return 0; |
213 } | 206 } |
214 #endif /* defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUB
QUERY) */ | 207 #endif /* defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) */ |
| 208 /* && !defined(SQLITE_OMIT_SUBQUERY) */ |
215 | 209 |
216 /* | 210 /* |
217 ** Generate code for a DELETE FROM statement. | 211 ** Generate code for a DELETE FROM statement. |
218 ** | 212 ** |
219 ** DELETE FROM table_wxyz WHERE a<5 AND b NOT NULL; | 213 ** DELETE FROM table_wxyz WHERE a<5 AND b NOT NULL; |
220 ** \________/ \________________/ | 214 ** \________/ \________________/ |
221 ** pTabList pWhere | 215 ** pTabList pWhere |
222 */ | 216 */ |
223 void sqlite3DeleteFrom( | 217 void sqlite3DeleteFrom( |
224 Parse *pParse, /* The parser context */ | 218 Parse *pParse, /* The parser context */ |
225 SrcList *pTabList, /* The table from which we should delete things */ | 219 SrcList *pTabList, /* The table from which we should delete things */ |
226 Expr *pWhere /* The WHERE clause. May be null */ | 220 Expr *pWhere /* The WHERE clause. May be null */ |
227 ){ | 221 ){ |
228 Vdbe *v; /* The virtual database engine */ | 222 Vdbe *v; /* The virtual database engine */ |
229 Table *pTab; /* The table from which records will be deleted */ | 223 Table *pTab; /* The table from which records will be deleted */ |
230 const char *zDb; /* Name of database holding pTab */ | 224 const char *zDb; /* Name of database holding pTab */ |
231 int end, addr = 0; /* A couple addresses of generated code */ | |
232 int i; /* Loop counter */ | 225 int i; /* Loop counter */ |
233 WhereInfo *pWInfo; /* Information about the WHERE clause */ | 226 WhereInfo *pWInfo; /* Information about the WHERE clause */ |
234 Index *pIdx; /* For looping over indices of the table */ | 227 Index *pIdx; /* For looping over indices of the table */ |
235 int iCur; /* VDBE Cursor number for pTab */ | 228 int iTabCur; /* Cursor number for the table */ |
| 229 int iDataCur; /* VDBE cursor for the canonical data source */ |
| 230 int iIdxCur; /* Cursor number of the first index */ |
| 231 int nIdx; /* Number of indices */ |
236 sqlite3 *db; /* Main database structure */ | 232 sqlite3 *db; /* Main database structure */ |
237 AuthContext sContext; /* Authorization context */ | 233 AuthContext sContext; /* Authorization context */ |
238 NameContext sNC; /* Name context to resolve expressions in */ | 234 NameContext sNC; /* Name context to resolve expressions in */ |
239 int iDb; /* Database number */ | 235 int iDb; /* Database number */ |
240 int memCnt = -1; /* Memory cell used for change counting */ | 236 int memCnt = -1; /* Memory cell used for change counting */ |
241 int rcauth; /* Value returned by authorization callback */ | 237 int rcauth; /* Value returned by authorization callback */ |
242 | 238 int okOnePass; /* True for one-pass algorithm without the FIFO */ |
| 239 int aiCurOnePass[2]; /* The write cursors opened by WHERE_ONEPASS */ |
| 240 u8 *aToOpen = 0; /* Open cursor iTabCur+j if aToOpen[j] is true */ |
| 241 Index *pPk; /* The PRIMARY KEY index on the table */ |
| 242 int iPk = 0; /* First of nPk registers holding PRIMARY KEY value */ |
| 243 i16 nPk = 1; /* Number of columns in the PRIMARY KEY */ |
| 244 int iKey; /* Memory cell holding key of row to be deleted */ |
| 245 i16 nKey; /* Number of memory cells in the row key */ |
| 246 int iEphCur = 0; /* Ephemeral table holding all primary key values */ |
| 247 int iRowSet = 0; /* Register for rowset of rows to delete */ |
| 248 int addrBypass = 0; /* Address of jump over the delete logic */ |
| 249 int addrLoop = 0; /* Top of the delete loop */ |
| 250 int addrDelete = 0; /* Jump directly to the delete logic */ |
| 251 int addrEphOpen = 0; /* Instruction to open the Ephemeral table */ |
| 252 |
243 #ifndef SQLITE_OMIT_TRIGGER | 253 #ifndef SQLITE_OMIT_TRIGGER |
244 int isView; /* True if attempting to delete from a view */ | 254 int isView; /* True if attempting to delete from a view */ |
245 Trigger *pTrigger; /* List of table triggers, if required */ | 255 Trigger *pTrigger; /* List of table triggers, if required */ |
246 #endif | 256 #endif |
247 | 257 |
248 memset(&sContext, 0, sizeof(sContext)); | 258 memset(&sContext, 0, sizeof(sContext)); |
249 db = pParse->db; | 259 db = pParse->db; |
250 if( pParse->nErr || db->mallocFailed ){ | 260 if( pParse->nErr || db->mallocFailed ){ |
251 goto delete_from_cleanup; | 261 goto delete_from_cleanup; |
252 } | 262 } |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
287 iDb = sqlite3SchemaToIndex(db, pTab->pSchema); | 297 iDb = sqlite3SchemaToIndex(db, pTab->pSchema); |
288 assert( iDb<db->nDb ); | 298 assert( iDb<db->nDb ); |
289 zDb = db->aDb[iDb].zName; | 299 zDb = db->aDb[iDb].zName; |
290 rcauth = sqlite3AuthCheck(pParse, SQLITE_DELETE, pTab->zName, 0, zDb); | 300 rcauth = sqlite3AuthCheck(pParse, SQLITE_DELETE, pTab->zName, 0, zDb); |
291 assert( rcauth==SQLITE_OK || rcauth==SQLITE_DENY || rcauth==SQLITE_IGNORE ); | 301 assert( rcauth==SQLITE_OK || rcauth==SQLITE_DENY || rcauth==SQLITE_IGNORE ); |
292 if( rcauth==SQLITE_DENY ){ | 302 if( rcauth==SQLITE_DENY ){ |
293 goto delete_from_cleanup; | 303 goto delete_from_cleanup; |
294 } | 304 } |
295 assert(!isView || pTrigger); | 305 assert(!isView || pTrigger); |
296 | 306 |
297 /* Assign cursor number to the table and all its indices. | 307 /* Assign cursor numbers to the table and all its indices. |
298 */ | 308 */ |
299 assert( pTabList->nSrc==1 ); | 309 assert( pTabList->nSrc==1 ); |
300 iCur = pTabList->a[0].iCursor = pParse->nTab++; | 310 iTabCur = pTabList->a[0].iCursor = pParse->nTab++; |
301 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ | 311 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){ |
302 pParse->nTab++; | 312 pParse->nTab++; |
303 } | 313 } |
304 | 314 |
305 /* Start the view context | 315 /* Start the view context |
306 */ | 316 */ |
307 if( isView ){ | 317 if( isView ){ |
308 sqlite3AuthContextPush(pParse, &sContext, pTab->zName); | 318 sqlite3AuthContextPush(pParse, &sContext, pTab->zName); |
309 } | 319 } |
310 | 320 |
311 /* Begin generating code. | 321 /* Begin generating code. |
312 */ | 322 */ |
313 v = sqlite3GetVdbe(pParse); | 323 v = sqlite3GetVdbe(pParse); |
314 if( v==0 ){ | 324 if( v==0 ){ |
315 goto delete_from_cleanup; | 325 goto delete_from_cleanup; |
316 } | 326 } |
317 if( pParse->nested==0 ) sqlite3VdbeCountChanges(v); | 327 if( pParse->nested==0 ) sqlite3VdbeCountChanges(v); |
318 sqlite3BeginWriteOperation(pParse, 1, iDb); | 328 sqlite3BeginWriteOperation(pParse, 1, iDb); |
319 | 329 |
320 /* If we are trying to delete from a view, realize that view into | 330 /* If we are trying to delete from a view, realize that view into |
321 ** a ephemeral table. | 331 ** an ephemeral table. |
322 */ | 332 */ |
323 #if !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) | 333 #if !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) |
324 if( isView ){ | 334 if( isView ){ |
325 sqlite3MaterializeView(pParse, pTab, pWhere, iCur); | 335 sqlite3MaterializeView(pParse, pTab, pWhere, iTabCur); |
| 336 iDataCur = iIdxCur = iTabCur; |
326 } | 337 } |
327 #endif | 338 #endif |
328 | 339 |
329 /* Resolve the column names in the WHERE clause. | 340 /* Resolve the column names in the WHERE clause. |
330 */ | 341 */ |
331 memset(&sNC, 0, sizeof(sNC)); | 342 memset(&sNC, 0, sizeof(sNC)); |
332 sNC.pParse = pParse; | 343 sNC.pParse = pParse; |
333 sNC.pSrcList = pTabList; | 344 sNC.pSrcList = pTabList; |
334 if( sqlite3ResolveExprNames(&sNC, pWhere) ){ | 345 if( sqlite3ResolveExprNames(&sNC, pWhere) ){ |
335 goto delete_from_cleanup; | 346 goto delete_from_cleanup; |
336 } | 347 } |
337 | 348 |
338 /* Initialize the counter of the number of rows deleted, if | 349 /* Initialize the counter of the number of rows deleted, if |
339 ** we are counting rows. | 350 ** we are counting rows. |
340 */ | 351 */ |
341 if( db->flags & SQLITE_CountRows ){ | 352 if( db->flags & SQLITE_CountRows ){ |
342 memCnt = ++pParse->nMem; | 353 memCnt = ++pParse->nMem; |
343 sqlite3VdbeAddOp2(v, OP_Integer, 0, memCnt); | 354 sqlite3VdbeAddOp2(v, OP_Integer, 0, memCnt); |
344 } | 355 } |
345 | 356 |
346 #ifndef SQLITE_OMIT_TRUNCATE_OPTIMIZATION | 357 #ifndef SQLITE_OMIT_TRUNCATE_OPTIMIZATION |
347 /* Special case: A DELETE without a WHERE clause deletes everything. | 358 /* Special case: A DELETE without a WHERE clause deletes everything. |
348 ** It is easier just to erase the whole table. Prior to version 3.6.5, | 359 ** It is easier just to erase the whole table. Prior to version 3.6.5, |
349 ** this optimization caused the row change count (the value returned by | 360 ** this optimization caused the row change count (the value returned by |
350 ** API function sqlite3_count_changes) to be set incorrectly. */ | 361 ** API function sqlite3_count_changes) to be set incorrectly. */ |
351 if( rcauth==SQLITE_OK && pWhere==0 && !pTrigger && !IsVirtual(pTab) | 362 if( rcauth==SQLITE_OK && pWhere==0 && !pTrigger && !IsVirtual(pTab) |
352 && 0==sqlite3FkRequired(pParse, pTab, 0, 0) | 363 && 0==sqlite3FkRequired(pParse, pTab, 0, 0) |
353 ){ | 364 ){ |
354 assert( !isView ); | 365 assert( !isView ); |
355 sqlite3VdbeAddOp4(v, OP_Clear, pTab->tnum, iDb, memCnt, | 366 sqlite3TableLock(pParse, iDb, pTab->tnum, 1, pTab->zName); |
356 pTab->zName, P4_STATIC); | 367 if( HasRowid(pTab) ){ |
| 368 sqlite3VdbeAddOp4(v, OP_Clear, pTab->tnum, iDb, memCnt, |
| 369 pTab->zName, P4_STATIC); |
| 370 } |
357 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ | 371 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ |
358 assert( pIdx->pSchema==pTab->pSchema ); | 372 assert( pIdx->pSchema==pTab->pSchema ); |
359 sqlite3VdbeAddOp2(v, OP_Clear, pIdx->tnum, iDb); | 373 sqlite3VdbeAddOp2(v, OP_Clear, pIdx->tnum, iDb); |
360 } | 374 } |
361 }else | 375 }else |
362 #endif /* SQLITE_OMIT_TRUNCATE_OPTIMIZATION */ | 376 #endif /* SQLITE_OMIT_TRUNCATE_OPTIMIZATION */ |
363 /* The usual case: There is a WHERE clause so we have to scan through | |
364 ** the table and pick which records to delete. | |
365 */ | |
366 { | 377 { |
367 int iRowSet = ++pParse->nMem; /* Register for rowset of rows to delete */ | 378 if( HasRowid(pTab) ){ |
368 int iRowid = ++pParse->nMem; /* Used for storing rowid values. */ | 379 /* For a rowid table, initialize the RowSet to an empty set */ |
369 int regRowid; /* Actual register containing rowids */ | 380 pPk = 0; |
370 | 381 nPk = 1; |
371 /* Collect rowids of every row to be deleted. | 382 iRowSet = ++pParse->nMem; |
| 383 sqlite3VdbeAddOp2(v, OP_Null, 0, iRowSet); |
| 384 }else{ |
| 385 /* For a WITHOUT ROWID table, create an ephemeral table used to |
| 386 ** hold all primary keys for rows to be deleted. */ |
| 387 pPk = sqlite3PrimaryKeyIndex(pTab); |
| 388 assert( pPk!=0 ); |
| 389 nPk = pPk->nKeyCol; |
| 390 iPk = pParse->nMem+1; |
| 391 pParse->nMem += nPk; |
| 392 iEphCur = pParse->nTab++; |
| 393 addrEphOpen = sqlite3VdbeAddOp2(v, OP_OpenEphemeral, iEphCur, nPk); |
| 394 sqlite3VdbeSetP4KeyInfo(pParse, pPk); |
| 395 } |
| 396 |
| 397 /* Construct a query to find the rowid or primary key for every row |
| 398 ** to be deleted, based on the WHERE clause. |
372 */ | 399 */ |
373 sqlite3VdbeAddOp2(v, OP_Null, 0, iRowSet); | 400 pWInfo = sqlite3WhereBegin(pParse, pTabList, pWhere, 0, 0, |
374 pWInfo = sqlite3WhereBegin(pParse, pTabList, pWhere,0,WHERE_DUPLICATES_OK); | 401 WHERE_ONEPASS_DESIRED|WHERE_DUPLICATES_OK, |
| 402 iTabCur+1); |
375 if( pWInfo==0 ) goto delete_from_cleanup; | 403 if( pWInfo==0 ) goto delete_from_cleanup; |
376 regRowid = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iCur, iRowid); | 404 okOnePass = sqlite3WhereOkOnePass(pWInfo, aiCurOnePass); |
377 sqlite3VdbeAddOp2(v, OP_RowSetAdd, iRowSet, regRowid); | 405 |
| 406 /* Keep track of the number of rows to be deleted */ |
378 if( db->flags & SQLITE_CountRows ){ | 407 if( db->flags & SQLITE_CountRows ){ |
379 sqlite3VdbeAddOp2(v, OP_AddImm, memCnt, 1); | 408 sqlite3VdbeAddOp2(v, OP_AddImm, memCnt, 1); |
380 } | 409 } |
| 410 |
| 411 /* Extract the rowid or primary key for the current row */ |
| 412 if( pPk ){ |
| 413 for(i=0; i<nPk; i++){ |
| 414 sqlite3ExprCodeGetColumnOfTable(v, pTab, iTabCur, |
| 415 pPk->aiColumn[i], iPk+i); |
| 416 } |
| 417 iKey = iPk; |
| 418 }else{ |
| 419 iKey = pParse->nMem + 1; |
| 420 iKey = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iTabCur, iKey, 0); |
| 421 if( iKey>pParse->nMem ) pParse->nMem = iKey; |
| 422 } |
| 423 |
| 424 if( okOnePass ){ |
| 425 /* For ONEPASS, no need to store the rowid/primary-key. There is only |
| 426 ** one, so just keep it in its register(s) and fall through to the |
| 427 ** delete code. |
| 428 */ |
| 429 nKey = nPk; /* OP_Found will use an unpacked key */ |
| 430 aToOpen = sqlite3DbMallocRaw(db, nIdx+2); |
| 431 if( aToOpen==0 ){ |
| 432 sqlite3WhereEnd(pWInfo); |
| 433 goto delete_from_cleanup; |
| 434 } |
| 435 memset(aToOpen, 1, nIdx+1); |
| 436 aToOpen[nIdx+1] = 0; |
| 437 if( aiCurOnePass[0]>=0 ) aToOpen[aiCurOnePass[0]-iTabCur] = 0; |
| 438 if( aiCurOnePass[1]>=0 ) aToOpen[aiCurOnePass[1]-iTabCur] = 0; |
| 439 if( addrEphOpen ) sqlite3VdbeChangeToNoop(v, addrEphOpen); |
| 440 addrDelete = sqlite3VdbeAddOp0(v, OP_Goto); /* Jump to DELETE logic */ |
| 441 }else if( pPk ){ |
| 442 /* Construct a composite key for the row to be deleted and remember it */ |
| 443 iKey = ++pParse->nMem; |
| 444 nKey = 0; /* Zero tells OP_Found to use a composite key */ |
| 445 sqlite3VdbeAddOp4(v, OP_MakeRecord, iPk, nPk, iKey, |
| 446 sqlite3IndexAffinityStr(v, pPk), nPk); |
| 447 sqlite3VdbeAddOp2(v, OP_IdxInsert, iEphCur, iKey); |
| 448 }else{ |
| 449 /* Get the rowid of the row to be deleted and remember it in the RowSet */ |
| 450 nKey = 1; /* OP_Seek always uses a single rowid */ |
| 451 sqlite3VdbeAddOp2(v, OP_RowSetAdd, iRowSet, iKey); |
| 452 } |
| 453 |
| 454 /* End of the WHERE loop */ |
381 sqlite3WhereEnd(pWInfo); | 455 sqlite3WhereEnd(pWInfo); |
382 | 456 if( okOnePass ){ |
383 /* Delete every item whose key was written to the list during the | 457 /* Bypass the delete logic below if the WHERE loop found zero rows */ |
384 ** database scan. We have to delete items after the scan is complete | 458 addrBypass = sqlite3VdbeMakeLabel(v); |
385 ** because deleting an item can change the scan order. */ | 459 sqlite3VdbeAddOp2(v, OP_Goto, 0, addrBypass); |
386 end = sqlite3VdbeMakeLabel(v); | 460 sqlite3VdbeJumpHere(v, addrDelete); |
387 | 461 } |
| 462 |
388 /* Unless this is a view, open cursors for the table we are | 463 /* Unless this is a view, open cursors for the table we are |
389 ** deleting from and all its indices. If this is a view, then the | 464 ** deleting from and all its indices. If this is a view, then the |
390 ** only effect this statement has is to fire the INSTEAD OF | 465 ** only effect this statement has is to fire the INSTEAD OF |
391 ** triggers. */ | 466 ** triggers. |
| 467 */ |
392 if( !isView ){ | 468 if( !isView ){ |
393 sqlite3OpenTableAndIndices(pParse, pTab, iCur, OP_OpenWrite); | 469 testcase( IsVirtual(pTab) ); |
| 470 sqlite3OpenTableAndIndices(pParse, pTab, OP_OpenWrite, iTabCur, aToOpen, |
| 471 &iDataCur, &iIdxCur); |
| 472 assert( pPk || IsVirtual(pTab) || iDataCur==iTabCur ); |
| 473 assert( pPk || IsVirtual(pTab) || iIdxCur==iDataCur+1 ); |
394 } | 474 } |
395 | 475 |
396 addr = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, end, iRowid); | 476 /* Set up a loop over the rowids/primary-keys that were found in the |
397 | 477 ** where-clause loop above. |
| 478 */ |
| 479 if( okOnePass ){ |
| 480 /* Just one row. Hence the top-of-loop is a no-op */ |
| 481 assert( nKey==nPk ); /* OP_Found will use an unpacked key */ |
| 482 assert( !IsVirtual(pTab) ); |
| 483 if( aToOpen[iDataCur-iTabCur] ){ |
| 484 assert( pPk!=0 || pTab->pSelect!=0 ); |
| 485 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey); |
| 486 VdbeCoverage(v); |
| 487 } |
| 488 }else if( pPk ){ |
| 489 addrLoop = sqlite3VdbeAddOp1(v, OP_Rewind, iEphCur); VdbeCoverage(v); |
| 490 sqlite3VdbeAddOp2(v, OP_RowKey, iEphCur, iKey); |
| 491 assert( nKey==0 ); /* OP_Found will use a composite key */ |
| 492 }else{ |
| 493 addrLoop = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, 0, iKey); |
| 494 VdbeCoverage(v); |
| 495 assert( nKey==1 ); |
| 496 } |
| 497 |
398 /* Delete the row */ | 498 /* Delete the row */ |
399 #ifndef SQLITE_OMIT_VIRTUALTABLE | 499 #ifndef SQLITE_OMIT_VIRTUALTABLE |
400 if( IsVirtual(pTab) ){ | 500 if( IsVirtual(pTab) ){ |
401 const char *pVTab = (const char *)sqlite3GetVTable(db, pTab); | 501 const char *pVTab = (const char *)sqlite3GetVTable(db, pTab); |
402 sqlite3VtabMakeWritable(pParse, pTab); | 502 sqlite3VtabMakeWritable(pParse, pTab); |
403 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iRowid, pVTab, P4_VTAB); | 503 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iKey, pVTab, P4_VTAB); |
| 504 sqlite3VdbeChangeP5(v, OE_Abort); |
404 sqlite3MayAbort(pParse); | 505 sqlite3MayAbort(pParse); |
405 }else | 506 }else |
406 #endif | 507 #endif |
407 { | 508 { |
408 int count = (pParse->nested==0); /* True to count changes */ | 509 int count = (pParse->nested==0); /* True to count changes */ |
409 sqlite3GenerateRowDelete(pParse, pTab, iCur, iRowid, count, pTrigger, OE_D
efault); | 510 sqlite3GenerateRowDelete(pParse, pTab, pTrigger, iDataCur, iIdxCur, |
| 511 iKey, nKey, count, OE_Default, okOnePass); |
410 } | 512 } |
411 | 513 |
412 /* End of the delete loop */ | 514 /* End of the loop over all rowids/primary-keys. */ |
413 sqlite3VdbeAddOp2(v, OP_Goto, 0, addr); | 515 if( okOnePass ){ |
414 sqlite3VdbeResolveLabel(v, end); | 516 sqlite3VdbeResolveLabel(v, addrBypass); |
415 | 517 }else if( pPk ){ |
| 518 sqlite3VdbeAddOp2(v, OP_Next, iEphCur, addrLoop+1); VdbeCoverage(v); |
| 519 sqlite3VdbeJumpHere(v, addrLoop); |
| 520 }else{ |
| 521 sqlite3VdbeAddOp2(v, OP_Goto, 0, addrLoop); |
| 522 sqlite3VdbeJumpHere(v, addrLoop); |
| 523 } |
| 524 |
416 /* Close the cursors open on the table and its indexes. */ | 525 /* Close the cursors open on the table and its indexes. */ |
417 if( !isView && !IsVirtual(pTab) ){ | 526 if( !isView && !IsVirtual(pTab) ){ |
418 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){ | 527 if( !pPk ) sqlite3VdbeAddOp1(v, OP_Close, iDataCur); |
419 sqlite3VdbeAddOp2(v, OP_Close, iCur + i, pIdx->tnum); | 528 for(i=0, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){ |
| 529 sqlite3VdbeAddOp1(v, OP_Close, iIdxCur + i); |
420 } | 530 } |
421 sqlite3VdbeAddOp1(v, OP_Close, iCur); | |
422 } | 531 } |
423 } | 532 } /* End non-truncate path */ |
424 | 533 |
425 /* Update the sqlite_sequence table by storing the content of the | 534 /* Update the sqlite_sequence table by storing the content of the |
426 ** maximum rowid counter values recorded while inserting into | 535 ** maximum rowid counter values recorded while inserting into |
427 ** autoincrement tables. | 536 ** autoincrement tables. |
428 */ | 537 */ |
429 if( pParse->nested==0 && pParse->pTriggerTab==0 ){ | 538 if( pParse->nested==0 && pParse->pTriggerTab==0 ){ |
430 sqlite3AutoincrementEnd(pParse); | 539 sqlite3AutoincrementEnd(pParse); |
431 } | 540 } |
432 | 541 |
433 /* Return the number of rows that were deleted. If this routine is | 542 /* Return the number of rows that were deleted. If this routine is |
434 ** generating code because of a call to sqlite3NestedParse(), do not | 543 ** generating code because of a call to sqlite3NestedParse(), do not |
435 ** invoke the callback function. | 544 ** invoke the callback function. |
436 */ | 545 */ |
437 if( (db->flags&SQLITE_CountRows) && !pParse->nested && !pParse->pTriggerTab ){ | 546 if( (db->flags&SQLITE_CountRows) && !pParse->nested && !pParse->pTriggerTab ){ |
438 sqlite3VdbeAddOp2(v, OP_ResultRow, memCnt, 1); | 547 sqlite3VdbeAddOp2(v, OP_ResultRow, memCnt, 1); |
439 sqlite3VdbeSetNumCols(v, 1); | 548 sqlite3VdbeSetNumCols(v, 1); |
440 sqlite3VdbeSetColName(v, 0, COLNAME_NAME, "rows deleted", SQLITE_STATIC); | 549 sqlite3VdbeSetColName(v, 0, COLNAME_NAME, "rows deleted", SQLITE_STATIC); |
441 } | 550 } |
442 | 551 |
443 delete_from_cleanup: | 552 delete_from_cleanup: |
444 sqlite3AuthContextPop(&sContext); | 553 sqlite3AuthContextPop(&sContext); |
445 sqlite3SrcListDelete(db, pTabList); | 554 sqlite3SrcListDelete(db, pTabList); |
446 sqlite3ExprDelete(db, pWhere); | 555 sqlite3ExprDelete(db, pWhere); |
| 556 sqlite3DbFree(db, aToOpen); |
447 return; | 557 return; |
448 } | 558 } |
449 /* Make sure "isView" and other macros defined above are undefined. Otherwise | 559 /* Make sure "isView" and other macros defined above are undefined. Otherwise |
450 ** thely may interfere with compilation of other functions in this file | 560 ** they may interfere with compilation of other functions in this file |
451 ** (or in another file, if this file becomes part of the amalgamation). */ | 561 ** (or in another file, if this file becomes part of the amalgamation). */ |
452 #ifdef isView | 562 #ifdef isView |
453 #undef isView | 563 #undef isView |
454 #endif | 564 #endif |
455 #ifdef pTrigger | 565 #ifdef pTrigger |
456 #undef pTrigger | 566 #undef pTrigger |
457 #endif | 567 #endif |
458 | 568 |
459 /* | 569 /* |
460 ** This routine generates VDBE code that causes a single row of a | 570 ** This routine generates VDBE code that causes a single row of a |
461 ** single table to be deleted. | 571 ** single table to be deleted. Both the original table entry and |
| 572 ** all indices are removed. |
462 ** | 573 ** |
463 ** The VDBE must be in a particular state when this routine is called. | 574 ** Preconditions: |
464 ** These are the requirements: | |
465 ** | 575 ** |
466 ** 1. A read/write cursor pointing to pTab, the table containing the row | 576 ** 1. iDataCur is an open cursor on the btree that is the canonical data |
467 ** to be deleted, must be opened as cursor number $iCur. | 577 ** store for the table. (This will be either the table itself, |
| 578 ** in the case of a rowid table, or the PRIMARY KEY index in the case |
| 579 ** of a WITHOUT ROWID table.) |
468 ** | 580 ** |
469 ** 2. Read/write cursors for all indices of pTab must be open as | 581 ** 2. Read/write cursors for all indices of pTab must be open as |
470 ** cursor number base+i for the i-th index. | 582 ** cursor number iIdxCur+i for the i-th index. |
471 ** | 583 ** |
472 ** 3. The record number of the row to be deleted must be stored in | 584 ** 3. The primary key for the row to be deleted must be stored in a |
473 ** memory cell iRowid. | 585 ** sequence of nPk memory cells starting at iPk. If nPk==0 that means |
474 ** | 586 ** that a search record formed from OP_MakeRecord is contained in the |
475 ** This routine generates code to remove both the table record and all | 587 ** single memory location iPk. |
476 ** index entries that point to that record. | |
477 */ | 588 */ |
478 void sqlite3GenerateRowDelete( | 589 void sqlite3GenerateRowDelete( |
479 Parse *pParse, /* Parsing context */ | 590 Parse *pParse, /* Parsing context */ |
480 Table *pTab, /* Table containing the row to be deleted */ | 591 Table *pTab, /* Table containing the row to be deleted */ |
481 int iCur, /* Cursor number for the table */ | |
482 int iRowid, /* Memory cell that contains the rowid to delete */ | |
483 int count, /* If non-zero, increment the row change counter */ | |
484 Trigger *pTrigger, /* List of triggers to (potentially) fire */ | 592 Trigger *pTrigger, /* List of triggers to (potentially) fire */ |
485 int onconf /* Default ON CONFLICT policy for triggers */ | 593 int iDataCur, /* Cursor from which column data is extracted */ |
| 594 int iIdxCur, /* First index cursor */ |
| 595 int iPk, /* First memory cell containing the PRIMARY KEY */ |
| 596 i16 nPk, /* Number of PRIMARY KEY memory cells */ |
| 597 u8 count, /* If non-zero, increment the row change counter */ |
| 598 u8 onconf, /* Default ON CONFLICT policy for triggers */ |
| 599 u8 bNoSeek /* iDataCur is already pointing to the row to delete */ |
486 ){ | 600 ){ |
487 Vdbe *v = pParse->pVdbe; /* Vdbe */ | 601 Vdbe *v = pParse->pVdbe; /* Vdbe */ |
488 int iOld = 0; /* First register in OLD.* array */ | 602 int iOld = 0; /* First register in OLD.* array */ |
489 int iLabel; /* Label resolved to end of generated code */ | 603 int iLabel; /* Label resolved to end of generated code */ |
| 604 u8 opSeek; /* Seek opcode */ |
490 | 605 |
491 /* Vdbe is guaranteed to have been allocated by this stage. */ | 606 /* Vdbe is guaranteed to have been allocated by this stage. */ |
492 assert( v ); | 607 assert( v ); |
| 608 VdbeModuleComment((v, "BEGIN: GenRowDel(%d,%d,%d,%d)", |
| 609 iDataCur, iIdxCur, iPk, (int)nPk)); |
493 | 610 |
494 /* Seek cursor iCur to the row to delete. If this row no longer exists | 611 /* Seek cursor iCur to the row to delete. If this row no longer exists |
495 ** (this can happen if a trigger program has already deleted it), do | 612 ** (this can happen if a trigger program has already deleted it), do |
496 ** not attempt to delete it or fire any DELETE triggers. */ | 613 ** not attempt to delete it or fire any DELETE triggers. */ |
497 iLabel = sqlite3VdbeMakeLabel(v); | 614 iLabel = sqlite3VdbeMakeLabel(v); |
498 sqlite3VdbeAddOp3(v, OP_NotExists, iCur, iLabel, iRowid); | 615 opSeek = HasRowid(pTab) ? OP_NotExists : OP_NotFound; |
| 616 if( !bNoSeek ){ |
| 617 sqlite3VdbeAddOp4Int(v, opSeek, iDataCur, iLabel, iPk, nPk); |
| 618 VdbeCoverageIf(v, opSeek==OP_NotExists); |
| 619 VdbeCoverageIf(v, opSeek==OP_NotFound); |
| 620 } |
499 | 621 |
500 /* If there are any triggers to fire, allocate a range of registers to | 622 /* If there are any triggers to fire, allocate a range of registers to |
501 ** use for the old.* references in the triggers. */ | 623 ** use for the old.* references in the triggers. */ |
502 if( sqlite3FkRequired(pParse, pTab, 0, 0) || pTrigger ){ | 624 if( sqlite3FkRequired(pParse, pTab, 0, 0) || pTrigger ){ |
503 u32 mask; /* Mask of OLD.* columns in use */ | 625 u32 mask; /* Mask of OLD.* columns in use */ |
504 int iCol; /* Iterator used while populating OLD.* */ | 626 int iCol; /* Iterator used while populating OLD.* */ |
| 627 int addrStart; /* Start of BEFORE trigger programs */ |
505 | 628 |
506 /* TODO: Could use temporary registers here. Also could attempt to | 629 /* TODO: Could use temporary registers here. Also could attempt to |
507 ** avoid copying the contents of the rowid register. */ | 630 ** avoid copying the contents of the rowid register. */ |
508 mask = sqlite3TriggerColmask( | 631 mask = sqlite3TriggerColmask( |
509 pParse, pTrigger, 0, 0, TRIGGER_BEFORE|TRIGGER_AFTER, pTab, onconf | 632 pParse, pTrigger, 0, 0, TRIGGER_BEFORE|TRIGGER_AFTER, pTab, onconf |
510 ); | 633 ); |
511 mask |= sqlite3FkOldmask(pParse, pTab); | 634 mask |= sqlite3FkOldmask(pParse, pTab); |
512 iOld = pParse->nMem+1; | 635 iOld = pParse->nMem+1; |
513 pParse->nMem += (1 + pTab->nCol); | 636 pParse->nMem += (1 + pTab->nCol); |
514 | 637 |
515 /* Populate the OLD.* pseudo-table register array. These values will be | 638 /* Populate the OLD.* pseudo-table register array. These values will be |
516 ** used by any BEFORE and AFTER triggers that exist. */ | 639 ** used by any BEFORE and AFTER triggers that exist. */ |
517 sqlite3VdbeAddOp2(v, OP_Copy, iRowid, iOld); | 640 sqlite3VdbeAddOp2(v, OP_Copy, iPk, iOld); |
518 for(iCol=0; iCol<pTab->nCol; iCol++){ | 641 for(iCol=0; iCol<pTab->nCol; iCol++){ |
519 if( mask==0xffffffff || mask&(1<<iCol) ){ | 642 testcase( mask!=0xffffffff && iCol==31 ); |
520 sqlite3ExprCodeGetColumnOfTable(v, pTab, iCur, iCol, iOld+iCol+1); | 643 testcase( mask!=0xffffffff && iCol==32 ); |
| 644 if( mask==0xffffffff || (iCol<=31 && (mask & MASKBIT32(iCol))!=0) ){ |
| 645 sqlite3ExprCodeGetColumnOfTable(v, pTab, iDataCur, iCol, iOld+iCol+1); |
521 } | 646 } |
522 } | 647 } |
523 | 648 |
524 /* Invoke BEFORE DELETE trigger programs. */ | 649 /* Invoke BEFORE DELETE trigger programs. */ |
| 650 addrStart = sqlite3VdbeCurrentAddr(v); |
525 sqlite3CodeRowTrigger(pParse, pTrigger, | 651 sqlite3CodeRowTrigger(pParse, pTrigger, |
526 TK_DELETE, 0, TRIGGER_BEFORE, pTab, iOld, onconf, iLabel | 652 TK_DELETE, 0, TRIGGER_BEFORE, pTab, iOld, onconf, iLabel |
527 ); | 653 ); |
528 | 654 |
529 /* Seek the cursor to the row to be deleted again. It may be that | 655 /* If any BEFORE triggers were coded, then seek the cursor to the |
530 ** the BEFORE triggers coded above have already removed the row | 656 ** row to be deleted again. It may be that the BEFORE triggers moved |
531 ** being deleted. Do not attempt to delete the row a second time, and | 657 ** the cursor or of already deleted the row that the cursor was |
532 ** do not fire AFTER triggers. */ | 658 ** pointing to. |
533 sqlite3VdbeAddOp3(v, OP_NotExists, iCur, iLabel, iRowid); | 659 */ |
| 660 if( addrStart<sqlite3VdbeCurrentAddr(v) ){ |
| 661 sqlite3VdbeAddOp4Int(v, opSeek, iDataCur, iLabel, iPk, nPk); |
| 662 VdbeCoverageIf(v, opSeek==OP_NotExists); |
| 663 VdbeCoverageIf(v, opSeek==OP_NotFound); |
| 664 } |
534 | 665 |
535 /* Do FK processing. This call checks that any FK constraints that | 666 /* Do FK processing. This call checks that any FK constraints that |
536 ** refer to this table (i.e. constraints attached to other tables) | 667 ** refer to this table (i.e. constraints attached to other tables) |
537 ** are not violated by deleting this row. */ | 668 ** are not violated by deleting this row. */ |
538 sqlite3FkCheck(pParse, pTab, iOld, 0); | 669 sqlite3FkCheck(pParse, pTab, iOld, 0, 0, 0); |
539 } | 670 } |
540 | 671 |
541 /* Delete the index and table entries. Skip this step if pTab is really | 672 /* Delete the index and table entries. Skip this step if pTab is really |
542 ** a view (in which case the only effect of the DELETE statement is to | 673 ** a view (in which case the only effect of the DELETE statement is to |
543 ** fire the INSTEAD OF triggers). */ | 674 ** fire the INSTEAD OF triggers). */ |
544 if( pTab->pSelect==0 ){ | 675 if( pTab->pSelect==0 ){ |
545 sqlite3GenerateRowIndexDelete(pParse, pTab, iCur, 0); | 676 sqlite3GenerateRowIndexDelete(pParse, pTab, iDataCur, iIdxCur, 0); |
546 sqlite3VdbeAddOp2(v, OP_Delete, iCur, (count?OPFLAG_NCHANGE:0)); | 677 sqlite3VdbeAddOp2(v, OP_Delete, iDataCur, (count?OPFLAG_NCHANGE:0)); |
547 if( count ){ | 678 if( count ){ |
548 sqlite3VdbeChangeP4(v, -1, pTab->zName, P4_TRANSIENT); | 679 sqlite3VdbeChangeP4(v, -1, pTab->zName, P4_TRANSIENT); |
549 } | 680 } |
550 } | 681 } |
551 | 682 |
552 /* Do any ON CASCADE, SET NULL or SET DEFAULT operations required to | 683 /* Do any ON CASCADE, SET NULL or SET DEFAULT operations required to |
553 ** handle rows (possibly in other tables) that refer via a foreign key | 684 ** handle rows (possibly in other tables) that refer via a foreign key |
554 ** to the row just deleted. */ | 685 ** to the row just deleted. */ |
555 sqlite3FkActions(pParse, pTab, 0, iOld); | 686 sqlite3FkActions(pParse, pTab, 0, iOld, 0, 0); |
556 | 687 |
557 /* Invoke AFTER DELETE trigger programs. */ | 688 /* Invoke AFTER DELETE trigger programs. */ |
558 sqlite3CodeRowTrigger(pParse, pTrigger, | 689 sqlite3CodeRowTrigger(pParse, pTrigger, |
559 TK_DELETE, 0, TRIGGER_AFTER, pTab, iOld, onconf, iLabel | 690 TK_DELETE, 0, TRIGGER_AFTER, pTab, iOld, onconf, iLabel |
560 ); | 691 ); |
561 | 692 |
562 /* Jump here if the row had already been deleted before any BEFORE | 693 /* Jump here if the row had already been deleted before any BEFORE |
563 ** trigger programs were invoked. Or if a trigger program throws a | 694 ** trigger programs were invoked. Or if a trigger program throws a |
564 ** RAISE(IGNORE) exception. */ | 695 ** RAISE(IGNORE) exception. */ |
565 sqlite3VdbeResolveLabel(v, iLabel); | 696 sqlite3VdbeResolveLabel(v, iLabel); |
| 697 VdbeModuleComment((v, "END: GenRowDel()")); |
566 } | 698 } |
567 | 699 |
568 /* | 700 /* |
569 ** This routine generates VDBE code that causes the deletion of all | 701 ** This routine generates VDBE code that causes the deletion of all |
570 ** index entries associated with a single row of a single table. | 702 ** index entries associated with a single row of a single table, pTab |
571 ** | 703 ** |
572 ** The VDBE must be in a particular state when this routine is called. | 704 ** Preconditions: |
573 ** These are the requirements: | |
574 ** | 705 ** |
575 ** 1. A read/write cursor pointing to pTab, the table containing the row | 706 ** 1. A read/write cursor "iDataCur" must be open on the canonical storage |
576 ** to be deleted, must be opened as cursor number "iCur". | 707 ** btree for the table pTab. (This will be either the table itself |
| 708 ** for rowid tables or to the primary key index for WITHOUT ROWID |
| 709 ** tables.) |
577 ** | 710 ** |
578 ** 2. Read/write cursors for all indices of pTab must be open as | 711 ** 2. Read/write cursors for all indices of pTab must be open as |
579 ** cursor number iCur+i for the i-th index. | 712 ** cursor number iIdxCur+i for the i-th index. (The pTab->pIndex |
| 713 ** index is the 0-th index.) |
580 ** | 714 ** |
581 ** 3. The "iCur" cursor must be pointing to the row that is to be | 715 ** 3. The "iDataCur" cursor must be already be positioned on the row |
582 ** deleted. | 716 ** that is to be deleted. |
583 */ | 717 */ |
584 void sqlite3GenerateRowIndexDelete( | 718 void sqlite3GenerateRowIndexDelete( |
585 Parse *pParse, /* Parsing and code generating context */ | 719 Parse *pParse, /* Parsing and code generating context */ |
586 Table *pTab, /* Table containing the row to be deleted */ | 720 Table *pTab, /* Table containing the row to be deleted */ |
587 int iCur, /* Cursor number for the table */ | 721 int iDataCur, /* Cursor of table holding data. */ |
| 722 int iIdxCur, /* First index cursor */ |
588 int *aRegIdx /* Only delete if aRegIdx!=0 && aRegIdx[i]>0 */ | 723 int *aRegIdx /* Only delete if aRegIdx!=0 && aRegIdx[i]>0 */ |
589 ){ | 724 ){ |
590 int i; | 725 int i; /* Index loop counter */ |
591 Index *pIdx; | 726 int r1 = -1; /* Register holding an index key */ |
592 int r1; | 727 int iPartIdxLabel; /* Jump destination for skipping partial index entries */ |
| 728 Index *pIdx; /* Current index */ |
| 729 Index *pPrior = 0; /* Prior index */ |
| 730 Vdbe *v; /* The prepared statement under construction */ |
| 731 Index *pPk; /* PRIMARY KEY index, or NULL for rowid tables */ |
593 | 732 |
594 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){ | 733 v = pParse->pVdbe; |
595 if( aRegIdx!=0 && aRegIdx[i-1]==0 ) continue; | 734 pPk = HasRowid(pTab) ? 0 : sqlite3PrimaryKeyIndex(pTab); |
596 r1 = sqlite3GenerateIndexKey(pParse, pIdx, iCur, 0, 0); | 735 for(i=0, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){ |
597 sqlite3VdbeAddOp3(pParse->pVdbe, OP_IdxDelete, iCur+i, r1,pIdx->nColumn+1); | 736 assert( iIdxCur+i!=iDataCur || pPk==pIdx ); |
| 737 if( aRegIdx!=0 && aRegIdx[i]==0 ) continue; |
| 738 if( pIdx==pPk ) continue; |
| 739 VdbeModuleComment((v, "GenRowIdxDel for %s", pIdx->zName)); |
| 740 r1 = sqlite3GenerateIndexKey(pParse, pIdx, iDataCur, 0, 1, |
| 741 &iPartIdxLabel, pPrior, r1); |
| 742 sqlite3VdbeAddOp3(v, OP_IdxDelete, iIdxCur+i, r1, |
| 743 pIdx->uniqNotNull ? pIdx->nKeyCol : pIdx->nColumn); |
| 744 sqlite3ResolvePartIdxLabel(pParse, iPartIdxLabel); |
| 745 pPrior = pIdx; |
598 } | 746 } |
599 } | 747 } |
600 | 748 |
601 /* | 749 /* |
602 ** Generate code that will assemble an index key and put it in register | 750 ** Generate code that will assemble an index key and stores it in register |
603 ** regOut. The key with be for index pIdx which is an index on pTab. | 751 ** regOut. The key with be for index pIdx which is an index on pTab. |
604 ** iCur is the index of a cursor open on the pTab table and pointing to | 752 ** iCur is the index of a cursor open on the pTab table and pointing to |
605 ** the entry that needs indexing. | 753 ** the entry that needs indexing. If pTab is a WITHOUT ROWID table, then |
| 754 ** iCur must be the cursor of the PRIMARY KEY index. |
606 ** | 755 ** |
607 ** Return a register number which is the first in a block of | 756 ** Return a register number which is the first in a block of |
608 ** registers that holds the elements of the index key. The | 757 ** registers that holds the elements of the index key. The |
609 ** block of registers has already been deallocated by the time | 758 ** block of registers has already been deallocated by the time |
610 ** this routine returns. | 759 ** this routine returns. |
| 760 ** |
| 761 ** If *piPartIdxLabel is not NULL, fill it in with a label and jump |
| 762 ** to that label if pIdx is a partial index that should be skipped. |
| 763 ** The label should be resolved using sqlite3ResolvePartIdxLabel(). |
| 764 ** A partial index should be skipped if its WHERE clause evaluates |
| 765 ** to false or null. If pIdx is not a partial index, *piPartIdxLabel |
| 766 ** will be set to zero which is an empty label that is ignored by |
| 767 ** sqlite3ResolvePartIdxLabel(). |
| 768 ** |
| 769 ** The pPrior and regPrior parameters are used to implement a cache to |
| 770 ** avoid unnecessary register loads. If pPrior is not NULL, then it is |
| 771 ** a pointer to a different index for which an index key has just been |
| 772 ** computed into register regPrior. If the current pIdx index is generating |
| 773 ** its key into the same sequence of registers and if pPrior and pIdx share |
| 774 ** a column in common, then the register corresponding to that column already |
| 775 ** holds the correct value and the loading of that register is skipped. |
| 776 ** This optimization is helpful when doing a DELETE or an INTEGRITY_CHECK |
| 777 ** on a table with multiple indices, and especially with the ROWID or |
| 778 ** PRIMARY KEY columns of the index. |
611 */ | 779 */ |
612 int sqlite3GenerateIndexKey( | 780 int sqlite3GenerateIndexKey( |
613 Parse *pParse, /* Parsing context */ | 781 Parse *pParse, /* Parsing context */ |
614 Index *pIdx, /* The index for which to generate a key */ | 782 Index *pIdx, /* The index for which to generate a key */ |
615 int iCur, /* Cursor number for the pIdx->pTable table */ | 783 int iDataCur, /* Cursor number from which to take column data */ |
616 int regOut, /* Write the new index key to this register */ | 784 int regOut, /* Put the new key into this register if not 0 */ |
617 int doMakeRec /* Run the OP_MakeRecord instruction if true */ | 785 int prefixOnly, /* Compute only a unique prefix of the key */ |
| 786 int *piPartIdxLabel, /* OUT: Jump to this label to skip partial index */ |
| 787 Index *pPrior, /* Previously generated index key */ |
| 788 int regPrior /* Register holding previous generated key */ |
618 ){ | 789 ){ |
619 Vdbe *v = pParse->pVdbe; | 790 Vdbe *v = pParse->pVdbe; |
620 int j; | 791 int j; |
621 Table *pTab = pIdx->pTable; | 792 Table *pTab = pIdx->pTable; |
622 int regBase; | 793 int regBase; |
623 int nCol; | 794 int nCol; |
624 | 795 |
625 nCol = pIdx->nColumn; | 796 if( piPartIdxLabel ){ |
626 regBase = sqlite3GetTempRange(pParse, nCol+1); | 797 if( pIdx->pPartIdxWhere ){ |
627 sqlite3VdbeAddOp2(v, OP_Rowid, iCur, regBase+nCol); | 798 *piPartIdxLabel = sqlite3VdbeMakeLabel(v); |
628 for(j=0; j<nCol; j++){ | 799 pParse->iPartIdxTab = iDataCur; |
629 int idx = pIdx->aiColumn[j]; | 800 sqlite3ExprCachePush(pParse); |
630 if( idx==pTab->iPKey ){ | 801 sqlite3ExprIfFalse(pParse, pIdx->pPartIdxWhere, *piPartIdxLabel, |
631 sqlite3VdbeAddOp2(v, OP_SCopy, regBase+nCol, regBase+j); | 802 SQLITE_JUMPIFNULL); |
632 }else{ | 803 }else{ |
633 sqlite3VdbeAddOp3(v, OP_Column, iCur, idx, regBase+j); | 804 *piPartIdxLabel = 0; |
634 sqlite3ColumnDefault(v, pTab, idx, -1); | |
635 } | 805 } |
636 } | 806 } |
637 if( doMakeRec ){ | 807 nCol = (prefixOnly && pIdx->uniqNotNull) ? pIdx->nKeyCol : pIdx->nColumn; |
638 sqlite3VdbeAddOp3(v, OP_MakeRecord, regBase, nCol+1, regOut); | 808 regBase = sqlite3GetTempRange(pParse, nCol); |
639 sqlite3VdbeChangeP4(v, -1, sqlite3IndexAffinityStr(v, pIdx), P4_TRANSIENT); | 809 if( pPrior && (regBase!=regPrior || pPrior->pPartIdxWhere) ) pPrior = 0; |
| 810 for(j=0; j<nCol; j++){ |
| 811 if( pPrior && pPrior->aiColumn[j]==pIdx->aiColumn[j] ) continue; |
| 812 sqlite3ExprCodeGetColumnOfTable(v, pTab, iDataCur, pIdx->aiColumn[j], |
| 813 regBase+j); |
| 814 /* If the column affinity is REAL but the number is an integer, then it |
| 815 ** might be stored in the table as an integer (using a compact |
| 816 ** representation) then converted to REAL by an OP_RealAffinity opcode. |
| 817 ** But we are getting ready to store this value back into an index, where |
| 818 ** it should be converted by to INTEGER again. So omit the OP_RealAffinity |
| 819 ** opcode if it is present */ |
| 820 sqlite3VdbeDeletePriorOpcode(v, OP_RealAffinity); |
640 } | 821 } |
641 sqlite3ReleaseTempRange(pParse, regBase, nCol+1); | 822 if( regOut ){ |
| 823 sqlite3VdbeAddOp3(v, OP_MakeRecord, regBase, nCol, regOut); |
| 824 } |
| 825 sqlite3ReleaseTempRange(pParse, regBase, nCol); |
642 return regBase; | 826 return regBase; |
643 } | 827 } |
| 828 |
| 829 /* |
| 830 ** If a prior call to sqlite3GenerateIndexKey() generated a jump-over label |
| 831 ** because it was a partial index, then this routine should be called to |
| 832 ** resolve that label. |
| 833 */ |
| 834 void sqlite3ResolvePartIdxLabel(Parse *pParse, int iLabel){ |
| 835 if( iLabel ){ |
| 836 sqlite3VdbeResolveLabel(pParse->pVdbe, iLabel); |
| 837 sqlite3ExprCachePop(pParse); |
| 838 } |
| 839 } |
OLD | NEW |