Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(332)

Side by Side Diff: third_party/sqlite/sqlite-src-3170000/src/delete.c

Issue 2747283002: [sql] Import reference version of SQLite 3.17.. (Closed)
Patch Set: Created 3 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
(Empty)
1 /*
2 ** 2001 September 15
3 **
4 ** The author disclaims copyright to this source code. In place of
5 ** a legal notice, here is a blessing:
6 **
7 ** May you do good and not evil.
8 ** May you find forgiveness for yourself and forgive others.
9 ** May you share freely, never taking more than you give.
10 **
11 *************************************************************************
12 ** This file contains C code routines that are called by the parser
13 ** in order to generate code for DELETE FROM statements.
14 */
15 #include "sqliteInt.h"
16
17 /*
18 ** While a SrcList can in general represent multiple tables and subqueries
19 ** (as in the FROM clause of a SELECT statement) in this case it contains
20 ** the name of a single table, as one might find in an INSERT, DELETE,
21 ** or UPDATE statement. Look up that table in the symbol table and
22 ** return a pointer. Set an error message and return NULL if the table
23 ** name is not found or if any other error occurs.
24 **
25 ** The following fields are initialized appropriate in pSrc:
26 **
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
29 **
30 */
31 Table *sqlite3SrcListLookup(Parse *pParse, SrcList *pSrc){
32 struct SrcList_item *pItem = pSrc->a;
33 Table *pTab;
34 assert( pItem && pSrc->nSrc==1 );
35 pTab = sqlite3LocateTableItem(pParse, 0, pItem);
36 sqlite3DeleteTable(pParse->db, pItem->pTab);
37 pItem->pTab = pTab;
38 if( pTab ){
39 pTab->nTabRef++;
40 }
41 if( sqlite3IndexedByLookup(pParse, pItem) ){
42 pTab = 0;
43 }
44 return pTab;
45 }
46
47 /*
48 ** Check to make sure the given table is writable. If it is not
49 ** writable, generate an error message and return 1. If it is
50 ** writable return 0;
51 */
52 int sqlite3IsReadOnly(Parse *pParse, Table *pTab, int viewOk){
53 /* A table is not writable under the following circumstances:
54 **
55 ** 1) It is a virtual table and no implementation of the xUpdate method
56 ** has been provided, or
57 ** 2) It is a system table (i.e. sqlite_master), this call is not
58 ** part of a nested parse and writable_schema pragma has not
59 ** been specified.
60 **
61 ** In either case leave an error message in pParse and return non-zero.
62 */
63 if( ( IsVirtual(pTab)
64 && sqlite3GetVTable(pParse->db, pTab)->pMod->pModule->xUpdate==0 )
65 || ( (pTab->tabFlags & TF_Readonly)!=0
66 && (pParse->db->flags & SQLITE_WriteSchema)==0
67 && pParse->nested==0 )
68 ){
69 sqlite3ErrorMsg(pParse, "table %s may not be modified", pTab->zName);
70 return 1;
71 }
72
73 #ifndef SQLITE_OMIT_VIEW
74 if( !viewOk && pTab->pSelect ){
75 sqlite3ErrorMsg(pParse,"cannot modify %s because it is a view",pTab->zName);
76 return 1;
77 }
78 #endif
79 return 0;
80 }
81
82
83 #if !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER)
84 /*
85 ** Evaluate a view and store its result in an ephemeral table. 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.
88 */
89 void sqlite3MaterializeView(
90 Parse *pParse, /* Parsing context */
91 Table *pView, /* View definition */
92 Expr *pWhere, /* Optional WHERE clause to be added */
93 int iCur /* Cursor number for ephemeral table */
94 ){
95 SelectDest dest;
96 Select *pSel;
97 SrcList *pFrom;
98 sqlite3 *db = pParse->db;
99 int iDb = sqlite3SchemaToIndex(db, pView->pSchema);
100 pWhere = sqlite3ExprDup(db, pWhere, 0);
101 pFrom = sqlite3SrcListAppend(db, 0, 0, 0);
102 if( pFrom ){
103 assert( pFrom->nSrc==1 );
104 pFrom->a[0].zName = sqlite3DbStrDup(db, pView->zName);
105 pFrom->a[0].zDatabase = sqlite3DbStrDup(db, db->aDb[iDb].zDbSName);
106 assert( pFrom->a[0].pOn==0 );
107 assert( pFrom->a[0].pUsing==0 );
108 }
109 pSel = sqlite3SelectNew(pParse, 0, pFrom, pWhere, 0, 0, 0,
110 SF_IncludeHidden, 0, 0);
111 sqlite3SelectDestInit(&dest, SRT_EphemTab, iCur);
112 sqlite3Select(pParse, pSel, &dest);
113 sqlite3SelectDelete(db, pSel);
114 }
115 #endif /* !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER) */
116
117 #if defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) && !defined(SQLITE_OMIT_SUBQUERY)
118 /*
119 ** Generate an expression tree to implement the WHERE, ORDER BY,
120 ** and LIMIT/OFFSET portion of DELETE and UPDATE statements.
121 **
122 ** DELETE FROM table_wxyz WHERE a<5 ORDER BY a LIMIT 1;
123 ** \__________________________/
124 ** pLimitWhere (pInClause)
125 */
126 Expr *sqlite3LimitWhere(
127 Parse *pParse, /* The parser context */
128 SrcList *pSrc, /* the FROM clause -- which tables to scan */
129 Expr *pWhere, /* The WHERE clause. May be null */
130 ExprList *pOrderBy, /* The ORDER BY clause. May be null */
131 Expr *pLimit, /* The LIMIT clause. May be null */
132 Expr *pOffset, /* The OFFSET clause. May be null */
133 char *zStmtType /* Either DELETE or UPDATE. For err msgs. */
134 ){
135 Expr *pWhereRowid = NULL; /* WHERE rowid .. */
136 Expr *pInClause = NULL; /* WHERE rowid IN ( select ) */
137 Expr *pSelectRowid = NULL; /* SELECT rowid ... */
138 ExprList *pEList = NULL; /* Expression list contaning only pSelectRowid */
139 SrcList *pSelectSrc = NULL; /* SELECT rowid FROM x ... (dup of pSrc) */
140 Select *pSelect = NULL; /* Complete SELECT tree */
141
142 /* Check that there isn't an ORDER BY without a LIMIT clause.
143 */
144 if( pOrderBy && (pLimit == 0) ) {
145 sqlite3ErrorMsg(pParse, "ORDER BY without LIMIT on %s", zStmtType);
146 goto limit_where_cleanup;
147 }
148
149 /* We only need to generate a select expression if there
150 ** is a limit/offset term to enforce.
151 */
152 if( pLimit == 0 ) {
153 /* if pLimit is null, pOffset will always be null as well. */
154 assert( pOffset == 0 );
155 return pWhere;
156 }
157
158 /* Generate a select expression tree to enforce the limit/offset
159 ** term for the DELETE or UPDATE statement. For example:
160 ** DELETE FROM table_a WHERE col1=1 ORDER BY col2 LIMIT 1 OFFSET 1
161 ** becomes:
162 ** DELETE FROM table_a WHERE rowid IN (
163 ** SELECT rowid FROM table_a WHERE col1=1 ORDER BY col2 LIMIT 1 OFFSET 1
164 ** );
165 */
166
167 pSelectRowid = sqlite3PExpr(pParse, TK_ROW, 0, 0);
168 if( pSelectRowid == 0 ) goto limit_where_cleanup;
169 pEList = sqlite3ExprListAppend(pParse, 0, pSelectRowid);
170 if( pEList == 0 ) goto limit_where_cleanup;
171
172 /* duplicate the FROM clause as it is needed by both the DELETE/UPDATE tree
173 ** and the SELECT subtree. */
174 pSelectSrc = sqlite3SrcListDup(pParse->db, pSrc, 0);
175 if( pSelectSrc == 0 ) {
176 sqlite3ExprListDelete(pParse->db, pEList);
177 goto limit_where_cleanup;
178 }
179
180 /* generate the SELECT expression tree. */
181 pSelect = sqlite3SelectNew(pParse,pEList,pSelectSrc,pWhere,0,0,
182 pOrderBy,0,pLimit,pOffset);
183 if( pSelect == 0 ) return 0;
184
185 /* now generate the new WHERE rowid IN clause for the DELETE/UDPATE */
186 pWhereRowid = sqlite3PExpr(pParse, TK_ROW, 0, 0);
187 pInClause = pWhereRowid ? sqlite3PExpr(pParse, TK_IN, pWhereRowid, 0) : 0;
188 sqlite3PExprAddSelect(pParse, pInClause, pSelect);
189 return pInClause;
190
191 limit_where_cleanup:
192 sqlite3ExprDelete(pParse->db, pWhere);
193 sqlite3ExprListDelete(pParse->db, pOrderBy);
194 sqlite3ExprDelete(pParse->db, pLimit);
195 sqlite3ExprDelete(pParse->db, pOffset);
196 return 0;
197 }
198 #endif /* defined(SQLITE_ENABLE_UPDATE_DELETE_LIMIT) */
199 /* && !defined(SQLITE_OMIT_SUBQUERY) */
200
201 /*
202 ** Generate code for a DELETE FROM statement.
203 **
204 ** DELETE FROM table_wxyz WHERE a<5 AND b NOT NULL;
205 ** \________/ \________________/
206 ** pTabList pWhere
207 */
208 void sqlite3DeleteFrom(
209 Parse *pParse, /* The parser context */
210 SrcList *pTabList, /* The table from which we should delete things */
211 Expr *pWhere /* The WHERE clause. May be null */
212 ){
213 Vdbe *v; /* The virtual database engine */
214 Table *pTab; /* The table from which records will be deleted */
215 int i; /* Loop counter */
216 WhereInfo *pWInfo; /* Information about the WHERE clause */
217 Index *pIdx; /* For looping over indices of the table */
218 int iTabCur; /* Cursor number for the table */
219 int iDataCur = 0; /* VDBE cursor for the canonical data source */
220 int iIdxCur = 0; /* Cursor number of the first index */
221 int nIdx; /* Number of indices */
222 sqlite3 *db; /* Main database structure */
223 AuthContext sContext; /* Authorization context */
224 NameContext sNC; /* Name context to resolve expressions in */
225 int iDb; /* Database number */
226 int memCnt = -1; /* Memory cell used for change counting */
227 int rcauth; /* Value returned by authorization callback */
228 int eOnePass; /* ONEPASS_OFF or _SINGLE or _MULTI */
229 int aiCurOnePass[2]; /* The write cursors opened by WHERE_ONEPASS */
230 u8 *aToOpen = 0; /* Open cursor iTabCur+j if aToOpen[j] is true */
231 Index *pPk; /* The PRIMARY KEY index on the table */
232 int iPk = 0; /* First of nPk registers holding PRIMARY KEY value */
233 i16 nPk = 1; /* Number of columns in the PRIMARY KEY */
234 int iKey; /* Memory cell holding key of row to be deleted */
235 i16 nKey; /* Number of memory cells in the row key */
236 int iEphCur = 0; /* Ephemeral table holding all primary key values */
237 int iRowSet = 0; /* Register for rowset of rows to delete */
238 int addrBypass = 0; /* Address of jump over the delete logic */
239 int addrLoop = 0; /* Top of the delete loop */
240 int addrEphOpen = 0; /* Instruction to open the Ephemeral table */
241 int bComplex; /* True if there are triggers or FKs or
242 ** subqueries in the WHERE clause */
243
244 #ifndef SQLITE_OMIT_TRIGGER
245 int isView; /* True if attempting to delete from a view */
246 Trigger *pTrigger; /* List of table triggers, if required */
247 #endif
248
249 memset(&sContext, 0, sizeof(sContext));
250 db = pParse->db;
251 if( pParse->nErr || db->mallocFailed ){
252 goto delete_from_cleanup;
253 }
254 assert( pTabList->nSrc==1 );
255
256 /* Locate the table which we want to delete. This table has to be
257 ** put in an SrcList structure because some of the subroutines we
258 ** will be calling are designed to work with multiple tables and expect
259 ** an SrcList* parameter instead of just a Table* parameter.
260 */
261 pTab = sqlite3SrcListLookup(pParse, pTabList);
262 if( pTab==0 ) goto delete_from_cleanup;
263
264 /* Figure out if we have any triggers and if the table being
265 ** deleted from is a view
266 */
267 #ifndef SQLITE_OMIT_TRIGGER
268 pTrigger = sqlite3TriggersExist(pParse, pTab, TK_DELETE, 0, 0);
269 isView = pTab->pSelect!=0;
270 bComplex = pTrigger || sqlite3FkRequired(pParse, pTab, 0, 0);
271 #else
272 # define pTrigger 0
273 # define isView 0
274 #endif
275 #ifdef SQLITE_OMIT_VIEW
276 # undef isView
277 # define isView 0
278 #endif
279
280 /* If pTab is really a view, make sure it has been initialized.
281 */
282 if( sqlite3ViewGetColumnNames(pParse, pTab) ){
283 goto delete_from_cleanup;
284 }
285
286 if( sqlite3IsReadOnly(pParse, pTab, (pTrigger?1:0)) ){
287 goto delete_from_cleanup;
288 }
289 iDb = sqlite3SchemaToIndex(db, pTab->pSchema);
290 assert( iDb<db->nDb );
291 rcauth = sqlite3AuthCheck(pParse, SQLITE_DELETE, pTab->zName, 0,
292 db->aDb[iDb].zDbSName);
293 assert( rcauth==SQLITE_OK || rcauth==SQLITE_DENY || rcauth==SQLITE_IGNORE );
294 if( rcauth==SQLITE_DENY ){
295 goto delete_from_cleanup;
296 }
297 assert(!isView || pTrigger);
298
299 /* Assign cursor numbers to the table and all its indices.
300 */
301 assert( pTabList->nSrc==1 );
302 iTabCur = pTabList->a[0].iCursor = pParse->nTab++;
303 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
304 pParse->nTab++;
305 }
306
307 /* Start the view context
308 */
309 if( isView ){
310 sqlite3AuthContextPush(pParse, &sContext, pTab->zName);
311 }
312
313 /* Begin generating code.
314 */
315 v = sqlite3GetVdbe(pParse);
316 if( v==0 ){
317 goto delete_from_cleanup;
318 }
319 if( pParse->nested==0 ) sqlite3VdbeCountChanges(v);
320 sqlite3BeginWriteOperation(pParse, 1, iDb);
321
322 /* If we are trying to delete from a view, realize that view into
323 ** an ephemeral table.
324 */
325 #if !defined(SQLITE_OMIT_VIEW) && !defined(SQLITE_OMIT_TRIGGER)
326 if( isView ){
327 sqlite3MaterializeView(pParse, pTab, pWhere, iTabCur);
328 iDataCur = iIdxCur = iTabCur;
329 }
330 #endif
331
332 /* Resolve the column names in the WHERE clause.
333 */
334 memset(&sNC, 0, sizeof(sNC));
335 sNC.pParse = pParse;
336 sNC.pSrcList = pTabList;
337 if( sqlite3ResolveExprNames(&sNC, pWhere) ){
338 goto delete_from_cleanup;
339 }
340
341 /* Initialize the counter of the number of rows deleted, if
342 ** we are counting rows.
343 */
344 if( db->flags & SQLITE_CountRows ){
345 memCnt = ++pParse->nMem;
346 sqlite3VdbeAddOp2(v, OP_Integer, 0, memCnt);
347 }
348
349 #ifndef SQLITE_OMIT_TRUNCATE_OPTIMIZATION
350 /* Special case: A DELETE without a WHERE clause deletes everything.
351 ** It is easier just to erase the whole table. Prior to version 3.6.5,
352 ** this optimization caused the row change count (the value returned by
353 ** API function sqlite3_count_changes) to be set incorrectly. */
354 if( rcauth==SQLITE_OK
355 && pWhere==0
356 && !bComplex
357 && !IsVirtual(pTab)
358 #ifdef SQLITE_ENABLE_PREUPDATE_HOOK
359 && db->xPreUpdateCallback==0
360 #endif
361 ){
362 assert( !isView );
363 sqlite3TableLock(pParse, iDb, pTab->tnum, 1, pTab->zName);
364 if( HasRowid(pTab) ){
365 sqlite3VdbeAddOp4(v, OP_Clear, pTab->tnum, iDb, memCnt,
366 pTab->zName, P4_STATIC);
367 }
368 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
369 assert( pIdx->pSchema==pTab->pSchema );
370 sqlite3VdbeAddOp2(v, OP_Clear, pIdx->tnum, iDb);
371 }
372 }else
373 #endif /* SQLITE_OMIT_TRUNCATE_OPTIMIZATION */
374 {
375 u16 wcf = WHERE_ONEPASS_DESIRED|WHERE_DUPLICATES_OK|WHERE_SEEK_TABLE;
376 if( sNC.ncFlags & NC_VarSelect ) bComplex = 1;
377 wcf |= (bComplex ? 0 : WHERE_ONEPASS_MULTIROW);
378 if( HasRowid(pTab) ){
379 /* For a rowid table, initialize the RowSet to an empty set */
380 pPk = 0;
381 nPk = 1;
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. Set variable eOnePass
399 ** to indicate the strategy used to implement this delete:
400 **
401 ** ONEPASS_OFF: Two-pass approach - use a FIFO for rowids/PK values.
402 ** ONEPASS_SINGLE: One-pass approach - at most one row deleted.
403 ** ONEPASS_MULTI: One-pass approach - any number of rows may be deleted.
404 */
405 pWInfo = sqlite3WhereBegin(pParse, pTabList, pWhere, 0, 0, wcf, iTabCur+1);
406 if( pWInfo==0 ) goto delete_from_cleanup;
407 eOnePass = sqlite3WhereOkOnePass(pWInfo, aiCurOnePass);
408 assert( IsVirtual(pTab)==0 || eOnePass!=ONEPASS_MULTI );
409 assert( IsVirtual(pTab) || bComplex || eOnePass!=ONEPASS_OFF );
410
411 /* Keep track of the number of rows to be deleted */
412 if( db->flags & SQLITE_CountRows ){
413 sqlite3VdbeAddOp2(v, OP_AddImm, memCnt, 1);
414 }
415
416 /* Extract the rowid or primary key for the current row */
417 if( pPk ){
418 for(i=0; i<nPk; i++){
419 assert( pPk->aiColumn[i]>=0 );
420 sqlite3ExprCodeGetColumnOfTable(v, pTab, iTabCur,
421 pPk->aiColumn[i], iPk+i);
422 }
423 iKey = iPk;
424 }else{
425 iKey = pParse->nMem + 1;
426 iKey = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iTabCur, iKey, 0);
427 if( iKey>pParse->nMem ) pParse->nMem = iKey;
428 }
429
430 if( eOnePass!=ONEPASS_OFF ){
431 /* For ONEPASS, no need to store the rowid/primary-key. There is only
432 ** one, so just keep it in its register(s) and fall through to the
433 ** delete code. */
434 nKey = nPk; /* OP_Found will use an unpacked key */
435 aToOpen = sqlite3DbMallocRawNN(db, nIdx+2);
436 if( aToOpen==0 ){
437 sqlite3WhereEnd(pWInfo);
438 goto delete_from_cleanup;
439 }
440 memset(aToOpen, 1, nIdx+1);
441 aToOpen[nIdx+1] = 0;
442 if( aiCurOnePass[0]>=0 ) aToOpen[aiCurOnePass[0]-iTabCur] = 0;
443 if( aiCurOnePass[1]>=0 ) aToOpen[aiCurOnePass[1]-iTabCur] = 0;
444 if( addrEphOpen ) sqlite3VdbeChangeToNoop(v, addrEphOpen);
445 }else{
446 if( pPk ){
447 /* Add the PK key for this row to the temporary table */
448 iKey = ++pParse->nMem;
449 nKey = 0; /* Zero tells OP_Found to use a composite key */
450 sqlite3VdbeAddOp4(v, OP_MakeRecord, iPk, nPk, iKey,
451 sqlite3IndexAffinityStr(pParse->db, pPk), nPk);
452 sqlite3VdbeAddOp4Int(v, OP_IdxInsert, iEphCur, iKey, iPk, nPk);
453 }else{
454 /* Add the rowid of the row to be deleted to the RowSet */
455 nKey = 1; /* OP_Seek always uses a single rowid */
456 sqlite3VdbeAddOp2(v, OP_RowSetAdd, iRowSet, iKey);
457 }
458 }
459
460 /* If this DELETE cannot use the ONEPASS strategy, this is the
461 ** end of the WHERE loop */
462 if( eOnePass!=ONEPASS_OFF ){
463 addrBypass = sqlite3VdbeMakeLabel(v);
464 }else{
465 sqlite3WhereEnd(pWInfo);
466 }
467
468 /* Unless this is a view, open cursors for the table we are
469 ** deleting from and all its indices. If this is a view, then the
470 ** only effect this statement has is to fire the INSTEAD OF
471 ** triggers.
472 */
473 if( !isView ){
474 int iAddrOnce = 0;
475 if( eOnePass==ONEPASS_MULTI ){
476 iAddrOnce = sqlite3VdbeAddOp0(v, OP_Once); VdbeCoverage(v);
477 }
478 testcase( IsVirtual(pTab) );
479 sqlite3OpenTableAndIndices(pParse, pTab, OP_OpenWrite, OPFLAG_FORDELETE,
480 iTabCur, aToOpen, &iDataCur, &iIdxCur);
481 assert( pPk || IsVirtual(pTab) || iDataCur==iTabCur );
482 assert( pPk || IsVirtual(pTab) || iIdxCur==iDataCur+1 );
483 if( eOnePass==ONEPASS_MULTI ) sqlite3VdbeJumpHere(v, iAddrOnce);
484 }
485
486 /* Set up a loop over the rowids/primary-keys that were found in the
487 ** where-clause loop above.
488 */
489 if( eOnePass!=ONEPASS_OFF ){
490 assert( nKey==nPk ); /* OP_Found will use an unpacked key */
491 if( !IsVirtual(pTab) && aToOpen[iDataCur-iTabCur] ){
492 assert( pPk!=0 || pTab->pSelect!=0 );
493 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
494 VdbeCoverage(v);
495 }
496 }else if( pPk ){
497 addrLoop = sqlite3VdbeAddOp1(v, OP_Rewind, iEphCur); VdbeCoverage(v);
498 sqlite3VdbeAddOp2(v, OP_RowData, iEphCur, iKey);
499 assert( nKey==0 ); /* OP_Found will use a composite key */
500 }else{
501 addrLoop = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, 0, iKey);
502 VdbeCoverage(v);
503 assert( nKey==1 );
504 }
505
506 /* Delete the row */
507 #ifndef SQLITE_OMIT_VIRTUALTABLE
508 if( IsVirtual(pTab) ){
509 const char *pVTab = (const char *)sqlite3GetVTable(db, pTab);
510 sqlite3VtabMakeWritable(pParse, pTab);
511 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iKey, pVTab, P4_VTAB);
512 sqlite3VdbeChangeP5(v, OE_Abort);
513 assert( eOnePass==ONEPASS_OFF || eOnePass==ONEPASS_SINGLE );
514 sqlite3MayAbort(pParse);
515 if( eOnePass==ONEPASS_SINGLE && sqlite3IsToplevel(pParse) ){
516 pParse->isMultiWrite = 0;
517 }
518 }else
519 #endif
520 {
521 int count = (pParse->nested==0); /* True to count changes */
522 sqlite3GenerateRowDelete(pParse, pTab, pTrigger, iDataCur, iIdxCur,
523 iKey, nKey, count, OE_Default, eOnePass, aiCurOnePass[1]);
524 }
525
526 /* End of the loop over all rowids/primary-keys. */
527 if( eOnePass!=ONEPASS_OFF ){
528 sqlite3VdbeResolveLabel(v, addrBypass);
529 sqlite3WhereEnd(pWInfo);
530 }else if( pPk ){
531 sqlite3VdbeAddOp2(v, OP_Next, iEphCur, addrLoop+1); VdbeCoverage(v);
532 sqlite3VdbeJumpHere(v, addrLoop);
533 }else{
534 sqlite3VdbeGoto(v, addrLoop);
535 sqlite3VdbeJumpHere(v, addrLoop);
536 }
537 } /* End non-truncate path */
538
539 /* Update the sqlite_sequence table by storing the content of the
540 ** maximum rowid counter values recorded while inserting into
541 ** autoincrement tables.
542 */
543 if( pParse->nested==0 && pParse->pTriggerTab==0 ){
544 sqlite3AutoincrementEnd(pParse);
545 }
546
547 /* Return the number of rows that were deleted. If this routine is
548 ** generating code because of a call to sqlite3NestedParse(), do not
549 ** invoke the callback function.
550 */
551 if( (db->flags&SQLITE_CountRows) && !pParse->nested && !pParse->pTriggerTab ){
552 sqlite3VdbeAddOp2(v, OP_ResultRow, memCnt, 1);
553 sqlite3VdbeSetNumCols(v, 1);
554 sqlite3VdbeSetColName(v, 0, COLNAME_NAME, "rows deleted", SQLITE_STATIC);
555 }
556
557 delete_from_cleanup:
558 sqlite3AuthContextPop(&sContext);
559 sqlite3SrcListDelete(db, pTabList);
560 sqlite3ExprDelete(db, pWhere);
561 sqlite3DbFree(db, aToOpen);
562 return;
563 }
564 /* Make sure "isView" and other macros defined above are undefined. Otherwise
565 ** they may interfere with compilation of other functions in this file
566 ** (or in another file, if this file becomes part of the amalgamation). */
567 #ifdef isView
568 #undef isView
569 #endif
570 #ifdef pTrigger
571 #undef pTrigger
572 #endif
573
574 /*
575 ** This routine generates VDBE code that causes a single row of a
576 ** single table to be deleted. Both the original table entry and
577 ** all indices are removed.
578 **
579 ** Preconditions:
580 **
581 ** 1. iDataCur is an open cursor on the btree that is the canonical data
582 ** store for the table. (This will be either the table itself,
583 ** in the case of a rowid table, or the PRIMARY KEY index in the case
584 ** of a WITHOUT ROWID table.)
585 **
586 ** 2. Read/write cursors for all indices of pTab must be open as
587 ** cursor number iIdxCur+i for the i-th index.
588 **
589 ** 3. The primary key for the row to be deleted must be stored in a
590 ** sequence of nPk memory cells starting at iPk. If nPk==0 that means
591 ** that a search record formed from OP_MakeRecord is contained in the
592 ** single memory location iPk.
593 **
594 ** eMode:
595 ** Parameter eMode may be passed either ONEPASS_OFF (0), ONEPASS_SINGLE, or
596 ** ONEPASS_MULTI. If eMode is not ONEPASS_OFF, then the cursor
597 ** iDataCur already points to the row to delete. If eMode is ONEPASS_OFF
598 ** then this function must seek iDataCur to the entry identified by iPk
599 ** and nPk before reading from it.
600 **
601 ** If eMode is ONEPASS_MULTI, then this call is being made as part
602 ** of a ONEPASS delete that affects multiple rows. In this case, if
603 ** iIdxNoSeek is a valid cursor number (>=0) and is not the same as
604 ** iDataCur, then its position should be preserved following the delete
605 ** operation. Or, if iIdxNoSeek is not a valid cursor number, the
606 ** position of iDataCur should be preserved instead.
607 **
608 ** iIdxNoSeek:
609 ** If iIdxNoSeek is a valid cursor number (>=0) not equal to iDataCur,
610 ** then it identifies an index cursor (from within array of cursors
611 ** starting at iIdxCur) that already points to the index entry to be deleted.
612 ** Except, this optimization is disabled if there are BEFORE triggers since
613 ** the trigger body might have moved the cursor.
614 */
615 void sqlite3GenerateRowDelete(
616 Parse *pParse, /* Parsing context */
617 Table *pTab, /* Table containing the row to be deleted */
618 Trigger *pTrigger, /* List of triggers to (potentially) fire */
619 int iDataCur, /* Cursor from which column data is extracted */
620 int iIdxCur, /* First index cursor */
621 int iPk, /* First memory cell containing the PRIMARY KEY */
622 i16 nPk, /* Number of PRIMARY KEY memory cells */
623 u8 count, /* If non-zero, increment the row change counter */
624 u8 onconf, /* Default ON CONFLICT policy for triggers */
625 u8 eMode, /* ONEPASS_OFF, _SINGLE, or _MULTI. See above */
626 int iIdxNoSeek /* Cursor number of cursor that does not need seeking */
627 ){
628 Vdbe *v = pParse->pVdbe; /* Vdbe */
629 int iOld = 0; /* First register in OLD.* array */
630 int iLabel; /* Label resolved to end of generated code */
631 u8 opSeek; /* Seek opcode */
632
633 /* Vdbe is guaranteed to have been allocated by this stage. */
634 assert( v );
635 VdbeModuleComment((v, "BEGIN: GenRowDel(%d,%d,%d,%d)",
636 iDataCur, iIdxCur, iPk, (int)nPk));
637
638 /* Seek cursor iCur to the row to delete. If this row no longer exists
639 ** (this can happen if a trigger program has already deleted it), do
640 ** not attempt to delete it or fire any DELETE triggers. */
641 iLabel = sqlite3VdbeMakeLabel(v);
642 opSeek = HasRowid(pTab) ? OP_NotExists : OP_NotFound;
643 if( eMode==ONEPASS_OFF ){
644 sqlite3VdbeAddOp4Int(v, opSeek, iDataCur, iLabel, iPk, nPk);
645 VdbeCoverageIf(v, opSeek==OP_NotExists);
646 VdbeCoverageIf(v, opSeek==OP_NotFound);
647 }
648
649 /* If there are any triggers to fire, allocate a range of registers to
650 ** use for the old.* references in the triggers. */
651 if( sqlite3FkRequired(pParse, pTab, 0, 0) || pTrigger ){
652 u32 mask; /* Mask of OLD.* columns in use */
653 int iCol; /* Iterator used while populating OLD.* */
654 int addrStart; /* Start of BEFORE trigger programs */
655
656 /* TODO: Could use temporary registers here. Also could attempt to
657 ** avoid copying the contents of the rowid register. */
658 mask = sqlite3TriggerColmask(
659 pParse, pTrigger, 0, 0, TRIGGER_BEFORE|TRIGGER_AFTER, pTab, onconf
660 );
661 mask |= sqlite3FkOldmask(pParse, pTab);
662 iOld = pParse->nMem+1;
663 pParse->nMem += (1 + pTab->nCol);
664
665 /* Populate the OLD.* pseudo-table register array. These values will be
666 ** used by any BEFORE and AFTER triggers that exist. */
667 sqlite3VdbeAddOp2(v, OP_Copy, iPk, iOld);
668 for(iCol=0; iCol<pTab->nCol; iCol++){
669 testcase( mask!=0xffffffff && iCol==31 );
670 testcase( mask!=0xffffffff && iCol==32 );
671 if( mask==0xffffffff || (iCol<=31 && (mask & MASKBIT32(iCol))!=0) ){
672 sqlite3ExprCodeGetColumnOfTable(v, pTab, iDataCur, iCol, iOld+iCol+1);
673 }
674 }
675
676 /* Invoke BEFORE DELETE trigger programs. */
677 addrStart = sqlite3VdbeCurrentAddr(v);
678 sqlite3CodeRowTrigger(pParse, pTrigger,
679 TK_DELETE, 0, TRIGGER_BEFORE, pTab, iOld, onconf, iLabel
680 );
681
682 /* If any BEFORE triggers were coded, then seek the cursor to the
683 ** row to be deleted again. It may be that the BEFORE triggers moved
684 ** the cursor or already deleted the row that the cursor was
685 ** pointing to.
686 **
687 ** Also disable the iIdxNoSeek optimization since the BEFORE trigger
688 ** may have moved that cursor.
689 */
690 if( addrStart<sqlite3VdbeCurrentAddr(v) ){
691 sqlite3VdbeAddOp4Int(v, opSeek, iDataCur, iLabel, iPk, nPk);
692 VdbeCoverageIf(v, opSeek==OP_NotExists);
693 VdbeCoverageIf(v, opSeek==OP_NotFound);
694 testcase( iIdxNoSeek>=0 );
695 iIdxNoSeek = -1;
696 }
697
698 /* Do FK processing. This call checks that any FK constraints that
699 ** refer to this table (i.e. constraints attached to other tables)
700 ** are not violated by deleting this row. */
701 sqlite3FkCheck(pParse, pTab, iOld, 0, 0, 0);
702 }
703
704 /* Delete the index and table entries. Skip this step if pTab is really
705 ** a view (in which case the only effect of the DELETE statement is to
706 ** fire the INSTEAD OF triggers).
707 **
708 ** If variable 'count' is non-zero, then this OP_Delete instruction should
709 ** invoke the update-hook. The pre-update-hook, on the other hand should
710 ** be invoked unless table pTab is a system table. The difference is that
711 ** the update-hook is not invoked for rows removed by REPLACE, but the
712 ** pre-update-hook is.
713 */
714 if( pTab->pSelect==0 ){
715 u8 p5 = 0;
716 sqlite3GenerateRowIndexDelete(pParse, pTab, iDataCur, iIdxCur,0,iIdxNoSeek);
717 sqlite3VdbeAddOp2(v, OP_Delete, iDataCur, (count?OPFLAG_NCHANGE:0));
718 if( pParse->nested==0 ){
719 sqlite3VdbeAppendP4(v, (char*)pTab, P4_TABLE);
720 }
721 if( eMode!=ONEPASS_OFF ){
722 sqlite3VdbeChangeP5(v, OPFLAG_AUXDELETE);
723 }
724 if( iIdxNoSeek>=0 && iIdxNoSeek!=iDataCur ){
725 sqlite3VdbeAddOp1(v, OP_Delete, iIdxNoSeek);
726 }
727 if( eMode==ONEPASS_MULTI ) p5 |= OPFLAG_SAVEPOSITION;
728 sqlite3VdbeChangeP5(v, p5);
729 }
730
731 /* Do any ON CASCADE, SET NULL or SET DEFAULT operations required to
732 ** handle rows (possibly in other tables) that refer via a foreign key
733 ** to the row just deleted. */
734 sqlite3FkActions(pParse, pTab, 0, iOld, 0, 0);
735
736 /* Invoke AFTER DELETE trigger programs. */
737 sqlite3CodeRowTrigger(pParse, pTrigger,
738 TK_DELETE, 0, TRIGGER_AFTER, pTab, iOld, onconf, iLabel
739 );
740
741 /* Jump here if the row had already been deleted before any BEFORE
742 ** trigger programs were invoked. Or if a trigger program throws a
743 ** RAISE(IGNORE) exception. */
744 sqlite3VdbeResolveLabel(v, iLabel);
745 VdbeModuleComment((v, "END: GenRowDel()"));
746 }
747
748 /*
749 ** This routine generates VDBE code that causes the deletion of all
750 ** index entries associated with a single row of a single table, pTab
751 **
752 ** Preconditions:
753 **
754 ** 1. A read/write cursor "iDataCur" must be open on the canonical storage
755 ** btree for the table pTab. (This will be either the table itself
756 ** for rowid tables or to the primary key index for WITHOUT ROWID
757 ** tables.)
758 **
759 ** 2. Read/write cursors for all indices of pTab must be open as
760 ** cursor number iIdxCur+i for the i-th index. (The pTab->pIndex
761 ** index is the 0-th index.)
762 **
763 ** 3. The "iDataCur" cursor must be already be positioned on the row
764 ** that is to be deleted.
765 */
766 void sqlite3GenerateRowIndexDelete(
767 Parse *pParse, /* Parsing and code generating context */
768 Table *pTab, /* Table containing the row to be deleted */
769 int iDataCur, /* Cursor of table holding data. */
770 int iIdxCur, /* First index cursor */
771 int *aRegIdx, /* Only delete if aRegIdx!=0 && aRegIdx[i]>0 */
772 int iIdxNoSeek /* Do not delete from this cursor */
773 ){
774 int i; /* Index loop counter */
775 int r1 = -1; /* Register holding an index key */
776 int iPartIdxLabel; /* Jump destination for skipping partial index entries */
777 Index *pIdx; /* Current index */
778 Index *pPrior = 0; /* Prior index */
779 Vdbe *v; /* The prepared statement under construction */
780 Index *pPk; /* PRIMARY KEY index, or NULL for rowid tables */
781
782 v = pParse->pVdbe;
783 pPk = HasRowid(pTab) ? 0 : sqlite3PrimaryKeyIndex(pTab);
784 for(i=0, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
785 assert( iIdxCur+i!=iDataCur || pPk==pIdx );
786 if( aRegIdx!=0 && aRegIdx[i]==0 ) continue;
787 if( pIdx==pPk ) continue;
788 if( iIdxCur+i==iIdxNoSeek ) continue;
789 VdbeModuleComment((v, "GenRowIdxDel for %s", pIdx->zName));
790 r1 = sqlite3GenerateIndexKey(pParse, pIdx, iDataCur, 0, 1,
791 &iPartIdxLabel, pPrior, r1);
792 sqlite3VdbeAddOp3(v, OP_IdxDelete, iIdxCur+i, r1,
793 pIdx->uniqNotNull ? pIdx->nKeyCol : pIdx->nColumn);
794 sqlite3ResolvePartIdxLabel(pParse, iPartIdxLabel);
795 pPrior = pIdx;
796 }
797 }
798
799 /*
800 ** Generate code that will assemble an index key and stores it in register
801 ** regOut. The key with be for index pIdx which is an index on pTab.
802 ** iCur is the index of a cursor open on the pTab table and pointing to
803 ** the entry that needs indexing. If pTab is a WITHOUT ROWID table, then
804 ** iCur must be the cursor of the PRIMARY KEY index.
805 **
806 ** Return a register number which is the first in a block of
807 ** registers that holds the elements of the index key. The
808 ** block of registers has already been deallocated by the time
809 ** this routine returns.
810 **
811 ** If *piPartIdxLabel is not NULL, fill it in with a label and jump
812 ** to that label if pIdx is a partial index that should be skipped.
813 ** The label should be resolved using sqlite3ResolvePartIdxLabel().
814 ** A partial index should be skipped if its WHERE clause evaluates
815 ** to false or null. If pIdx is not a partial index, *piPartIdxLabel
816 ** will be set to zero which is an empty label that is ignored by
817 ** sqlite3ResolvePartIdxLabel().
818 **
819 ** The pPrior and regPrior parameters are used to implement a cache to
820 ** avoid unnecessary register loads. If pPrior is not NULL, then it is
821 ** a pointer to a different index for which an index key has just been
822 ** computed into register regPrior. If the current pIdx index is generating
823 ** its key into the same sequence of registers and if pPrior and pIdx share
824 ** a column in common, then the register corresponding to that column already
825 ** holds the correct value and the loading of that register is skipped.
826 ** This optimization is helpful when doing a DELETE or an INTEGRITY_CHECK
827 ** on a table with multiple indices, and especially with the ROWID or
828 ** PRIMARY KEY columns of the index.
829 */
830 int sqlite3GenerateIndexKey(
831 Parse *pParse, /* Parsing context */
832 Index *pIdx, /* The index for which to generate a key */
833 int iDataCur, /* Cursor number from which to take column data */
834 int regOut, /* Put the new key into this register if not 0 */
835 int prefixOnly, /* Compute only a unique prefix of the key */
836 int *piPartIdxLabel, /* OUT: Jump to this label to skip partial index */
837 Index *pPrior, /* Previously generated index key */
838 int regPrior /* Register holding previous generated key */
839 ){
840 Vdbe *v = pParse->pVdbe;
841 int j;
842 int regBase;
843 int nCol;
844
845 if( piPartIdxLabel ){
846 if( pIdx->pPartIdxWhere ){
847 *piPartIdxLabel = sqlite3VdbeMakeLabel(v);
848 pParse->iSelfTab = iDataCur;
849 sqlite3ExprCachePush(pParse);
850 sqlite3ExprIfFalseDup(pParse, pIdx->pPartIdxWhere, *piPartIdxLabel,
851 SQLITE_JUMPIFNULL);
852 }else{
853 *piPartIdxLabel = 0;
854 }
855 }
856 nCol = (prefixOnly && pIdx->uniqNotNull) ? pIdx->nKeyCol : pIdx->nColumn;
857 regBase = sqlite3GetTempRange(pParse, nCol);
858 if( pPrior && (regBase!=regPrior || pPrior->pPartIdxWhere) ) pPrior = 0;
859 for(j=0; j<nCol; j++){
860 if( pPrior
861 && pPrior->aiColumn[j]==pIdx->aiColumn[j]
862 && pPrior->aiColumn[j]!=XN_EXPR
863 ){
864 /* This column was already computed by the previous index */
865 continue;
866 }
867 sqlite3ExprCodeLoadIndexColumn(pParse, pIdx, iDataCur, j, regBase+j);
868 /* If the column affinity is REAL but the number is an integer, then it
869 ** might be stored in the table as an integer (using a compact
870 ** representation) then converted to REAL by an OP_RealAffinity opcode.
871 ** But we are getting ready to store this value back into an index, where
872 ** it should be converted by to INTEGER again. So omit the OP_RealAffinity
873 ** opcode if it is present */
874 sqlite3VdbeDeletePriorOpcode(v, OP_RealAffinity);
875 }
876 if( regOut ){
877 sqlite3VdbeAddOp3(v, OP_MakeRecord, regBase, nCol, regOut);
878 if( pIdx->pTable->pSelect ){
879 const char *zAff = sqlite3IndexAffinityStr(pParse->db, pIdx);
880 sqlite3VdbeChangeP4(v, -1, zAff, P4_TRANSIENT);
881 }
882 }
883 sqlite3ReleaseTempRange(pParse, regBase, nCol);
884 return regBase;
885 }
886
887 /*
888 ** If a prior call to sqlite3GenerateIndexKey() generated a jump-over label
889 ** because it was a partial index, then this routine should be called to
890 ** resolve that label.
891 */
892 void sqlite3ResolvePartIdxLabel(Parse *pParse, int iLabel){
893 if( iLabel ){
894 sqlite3VdbeResolveLabel(pParse->pVdbe, iLabel);
895 sqlite3ExprCachePop(pParse);
896 }
897 }
OLDNEW
« no previous file with comments | « third_party/sqlite/sqlite-src-3170000/src/dbstat.c ('k') | third_party/sqlite/sqlite-src-3170000/src/expr.c » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698