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 ** The code in this file implements the function that runs the 13 ** bytecode of a prepared statement. 14 ** 15 ** Various scripts scan this source file in order to generate HTML 16 ** documentation, headers files, or other derived files. The formatting 17 ** of the code in this file is, therefore, important. See other comments 18 ** in this file for details. If in doubt, do not deviate from existing 19 ** commenting and indentation practices when changing or adding code. 20 */ 21 #include "sqliteInt.h" 22 #include "vdbeInt.h" 23 24 /* 25 ** Invoke this macro on memory cells just prior to changing the 26 ** value of the cell. This macro verifies that shallow copies are 27 ** not misused. A shallow copy of a string or blob just copies a 28 ** pointer to the string or blob, not the content. If the original 29 ** is changed while the copy is still in use, the string or blob might 30 ** be changed out from under the copy. This macro verifies that nothing 31 ** like that ever happens. 32 */ 33 #ifdef SQLITE_DEBUG 34 # define memAboutToChange(P,M) sqlite3VdbeMemAboutToChange(P,M) 35 #else 36 # define memAboutToChange(P,M) 37 #endif 38 39 /* 40 ** The following global variable is incremented every time a cursor 41 ** moves, either by the OP_SeekXX, OP_Next, or OP_Prev opcodes. The test 42 ** procedures use this information to make sure that indices are 43 ** working correctly. This variable has no function other than to 44 ** help verify the correct operation of the library. 45 */ 46 #ifdef SQLITE_TEST 47 int sqlite3_search_count = 0; 48 #endif 49 50 /* 51 ** When this global variable is positive, it gets decremented once before 52 ** each instruction in the VDBE. When it reaches zero, the u1.isInterrupted 53 ** field of the sqlite3 structure is set in order to simulate an interrupt. 54 ** 55 ** This facility is used for testing purposes only. It does not function 56 ** in an ordinary build. 57 */ 58 #ifdef SQLITE_TEST 59 int sqlite3_interrupt_count = 0; 60 #endif 61 62 /* 63 ** The next global variable is incremented each type the OP_Sort opcode 64 ** is executed. The test procedures use this information to make sure that 65 ** sorting is occurring or not occurring at appropriate times. This variable 66 ** has no function other than to help verify the correct operation of the 67 ** library. 68 */ 69 #ifdef SQLITE_TEST 70 int sqlite3_sort_count = 0; 71 #endif 72 73 /* 74 ** The next global variable records the size of the largest MEM_Blob 75 ** or MEM_Str that has been used by a VDBE opcode. The test procedures 76 ** use this information to make sure that the zero-blob functionality 77 ** is working correctly. This variable has no function other than to 78 ** help verify the correct operation of the library. 79 */ 80 #ifdef SQLITE_TEST 81 int sqlite3_max_blobsize = 0; 82 static void updateMaxBlobsize(Mem *p){ 83 if( (p->flags & (MEM_Str|MEM_Blob))!=0 && p->n>sqlite3_max_blobsize ){ 84 sqlite3_max_blobsize = p->n; 85 } 86 } 87 #endif 88 89 /* 90 ** This macro evaluates to true if either the update hook or the preupdate 91 ** hook are enabled for database connect DB. 92 */ 93 #ifdef SQLITE_ENABLE_PREUPDATE_HOOK 94 # define HAS_UPDATE_HOOK(DB) ((DB)->xPreUpdateCallback||(DB)->xUpdateCallback) 95 #else 96 # define HAS_UPDATE_HOOK(DB) ((DB)->xUpdateCallback) 97 #endif 98 99 /* 100 ** The next global variable is incremented each time the OP_Found opcode 101 ** is executed. This is used to test whether or not the foreign key 102 ** operation implemented using OP_FkIsZero is working. This variable 103 ** has no function other than to help verify the correct operation of the 104 ** library. 105 */ 106 #ifdef SQLITE_TEST 107 int sqlite3_found_count = 0; 108 #endif 109 110 /* 111 ** Test a register to see if it exceeds the current maximum blob size. 112 ** If it does, record the new maximum blob size. 113 */ 114 #if defined(SQLITE_TEST) && !defined(SQLITE_UNTESTABLE) 115 # define UPDATE_MAX_BLOBSIZE(P) updateMaxBlobsize(P) 116 #else 117 # define UPDATE_MAX_BLOBSIZE(P) 118 #endif 119 120 #ifdef SQLITE_DEBUG 121 /* This routine provides a convenient place to set a breakpoint during 122 ** tracing with PRAGMA vdbe_trace=on. The breakpoint fires right after 123 ** each opcode is printed. Variables "pc" (program counter) and pOp are 124 ** available to add conditionals to the breakpoint. GDB example: 125 ** 126 ** break test_trace_breakpoint if pc=22 127 ** 128 ** Other useful labels for breakpoints include: 129 ** test_addop_breakpoint(pc,pOp) 130 ** sqlite3CorruptError(lineno) 131 ** sqlite3MisuseError(lineno) 132 ** sqlite3CantopenError(lineno) 133 */ 134 static void test_trace_breakpoint(int pc, Op *pOp, Vdbe *v){ 135 static int n = 0; 136 n++; 137 } 138 #endif 139 140 /* 141 ** Invoke the VDBE coverage callback, if that callback is defined. This 142 ** feature is used for test suite validation only and does not appear an 143 ** production builds. 144 ** 145 ** M is the type of branch. I is the direction taken for this instance of 146 ** the branch. 147 ** 148 ** M: 2 - two-way branch (I=0: fall-thru 1: jump ) 149 ** 3 - two-way + NULL (I=0: fall-thru 1: jump 2: NULL ) 150 ** 4 - OP_Jump (I=0: jump p1 1: jump p2 2: jump p3) 151 ** 152 ** In other words, if M is 2, then I is either 0 (for fall-through) or 153 ** 1 (for when the branch is taken). If M is 3, the I is 0 for an 154 ** ordinary fall-through, I is 1 if the branch was taken, and I is 2 155 ** if the result of comparison is NULL. For M=3, I=2 the jump may or 156 ** may not be taken, depending on the SQLITE_JUMPIFNULL flags in p5. 157 ** When M is 4, that means that an OP_Jump is being run. I is 0, 1, or 2 158 ** depending on if the operands are less than, equal, or greater than. 159 ** 160 ** iSrcLine is the source code line (from the __LINE__ macro) that 161 ** generated the VDBE instruction combined with flag bits. The source 162 ** code line number is in the lower 24 bits of iSrcLine and the upper 163 ** 8 bytes are flags. The lower three bits of the flags indicate 164 ** values for I that should never occur. For example, if the branch is 165 ** always taken, the flags should be 0x05 since the fall-through and 166 ** alternate branch are never taken. If a branch is never taken then 167 ** flags should be 0x06 since only the fall-through approach is allowed. 168 ** 169 ** Bit 0x08 of the flags indicates an OP_Jump opcode that is only 170 ** interested in equal or not-equal. In other words, I==0 and I==2 171 ** should be treated as equivalent 172 ** 173 ** Since only a line number is retained, not the filename, this macro 174 ** only works for amalgamation builds. But that is ok, since these macros 175 ** should be no-ops except for special builds used to measure test coverage. 176 */ 177 #if !defined(SQLITE_VDBE_COVERAGE) 178 # define VdbeBranchTaken(I,M) 179 #else 180 # define VdbeBranchTaken(I,M) vdbeTakeBranch(pOp->iSrcLine,I,M) 181 static void vdbeTakeBranch(u32 iSrcLine, u8 I, u8 M){ 182 u8 mNever; 183 assert( I<=2 ); /* 0: fall through, 1: taken, 2: alternate taken */ 184 assert( M<=4 ); /* 2: two-way branch, 3: three-way branch, 4: OP_Jump */ 185 assert( I<M ); /* I can only be 2 if M is 3 or 4 */ 186 /* Transform I from a integer [0,1,2] into a bitmask of [1,2,4] */ 187 I = 1<<I; 188 /* The upper 8 bits of iSrcLine are flags. The lower three bits of 189 ** the flags indicate directions that the branch can never go. If 190 ** a branch really does go in one of those directions, assert right 191 ** away. */ 192 mNever = iSrcLine >> 24; 193 assert( (I & mNever)==0 ); 194 if( sqlite3GlobalConfig.xVdbeBranch==0 ) return; /*NO_TEST*/ 195 /* Invoke the branch coverage callback with three arguments: 196 ** iSrcLine - the line number of the VdbeCoverage() macro, with 197 ** flags removed. 198 ** I - Mask of bits 0x07 indicating which cases are are 199 ** fulfilled by this instance of the jump. 0x01 means 200 ** fall-thru, 0x02 means taken, 0x04 means NULL. Any 201 ** impossible cases (ex: if the comparison is never NULL) 202 ** are filled in automatically so that the coverage 203 ** measurement logic does not flag those impossible cases 204 ** as missed coverage. 205 ** M - Type of jump. Same as M argument above 206 */ 207 I |= mNever; 208 if( M==2 ) I |= 0x04; 209 if( M==4 ){ 210 I |= 0x08; 211 if( (mNever&0x08)!=0 && (I&0x05)!=0) I |= 0x05; /*NO_TEST*/ 212 } 213 sqlite3GlobalConfig.xVdbeBranch(sqlite3GlobalConfig.pVdbeBranchArg, 214 iSrcLine&0xffffff, I, M); 215 } 216 #endif 217 218 /* 219 ** An ephemeral string value (signified by the MEM_Ephem flag) contains 220 ** a pointer to a dynamically allocated string where some other entity 221 ** is responsible for deallocating that string. Because the register 222 ** does not control the string, it might be deleted without the register 223 ** knowing it. 224 ** 225 ** This routine converts an ephemeral string into a dynamically allocated 226 ** string that the register itself controls. In other words, it 227 ** converts an MEM_Ephem string into a string with P.z==P.zMalloc. 228 */ 229 #define Deephemeralize(P) \ 230 if( ((P)->flags&MEM_Ephem)!=0 \ 231 && sqlite3VdbeMemMakeWriteable(P) ){ goto no_mem;} 232 233 /* Return true if the cursor was opened using the OP_OpenSorter opcode. */ 234 #define isSorter(x) ((x)->eCurType==CURTYPE_SORTER) 235 236 /* 237 ** Allocate VdbeCursor number iCur. Return a pointer to it. Return NULL 238 ** if we run out of memory. 239 */ 240 static VdbeCursor *allocateCursor( 241 Vdbe *p, /* The virtual machine */ 242 int iCur, /* Index of the new VdbeCursor */ 243 int nField, /* Number of fields in the table or index */ 244 int iDb, /* Database the cursor belongs to, or -1 */ 245 u8 eCurType /* Type of the new cursor */ 246 ){ 247 /* Find the memory cell that will be used to store the blob of memory 248 ** required for this VdbeCursor structure. It is convenient to use a 249 ** vdbe memory cell to manage the memory allocation required for a 250 ** VdbeCursor structure for the following reasons: 251 ** 252 ** * Sometimes cursor numbers are used for a couple of different 253 ** purposes in a vdbe program. The different uses might require 254 ** different sized allocations. Memory cells provide growable 255 ** allocations. 256 ** 257 ** * When using ENABLE_MEMORY_MANAGEMENT, memory cell buffers can 258 ** be freed lazily via the sqlite3_release_memory() API. This 259 ** minimizes the number of malloc calls made by the system. 260 ** 261 ** The memory cell for cursor 0 is aMem[0]. The rest are allocated from 262 ** the top of the register space. Cursor 1 is at Mem[p->nMem-1]. 263 ** Cursor 2 is at Mem[p->nMem-2]. And so forth. 264 */ 265 Mem *pMem = iCur>0 ? &p->aMem[p->nMem-iCur] : p->aMem; 266 267 int nByte; 268 VdbeCursor *pCx = 0; 269 nByte = 270 ROUND8(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField + 271 (eCurType==CURTYPE_BTREE?sqlite3BtreeCursorSize():0); 272 273 assert( iCur>=0 && iCur<p->nCursor ); 274 if( p->apCsr[iCur] ){ /*OPTIMIZATION-IF-FALSE*/ 275 sqlite3VdbeFreeCursor(p, p->apCsr[iCur]); 276 p->apCsr[iCur] = 0; 277 } 278 if( SQLITE_OK==sqlite3VdbeMemClearAndResize(pMem, nByte) ){ 279 p->apCsr[iCur] = pCx = (VdbeCursor*)pMem->z; 280 memset(pCx, 0, offsetof(VdbeCursor,pAltCursor)); 281 pCx->eCurType = eCurType; 282 pCx->iDb = iDb; 283 pCx->nField = nField; 284 pCx->aOffset = &pCx->aType[nField]; 285 if( eCurType==CURTYPE_BTREE ){ 286 pCx->uc.pCursor = (BtCursor*) 287 &pMem->z[ROUND8(sizeof(VdbeCursor))+2*sizeof(u32)*nField]; 288 sqlite3BtreeCursorZero(pCx->uc.pCursor); 289 } 290 } 291 return pCx; 292 } 293 294 /* 295 ** The string in pRec is known to look like an integer and to have a 296 ** floating point value of rValue. Return true and set *piValue to the 297 ** integer value if the string is in range to be an integer. Otherwise, 298 ** return false. 299 */ 300 static int alsoAnInt(Mem *pRec, double rValue, i64 *piValue){ 301 i64 iValue = (double)rValue; 302 if( sqlite3RealSameAsInt(rValue,iValue) ){ 303 *piValue = iValue; 304 return 1; 305 } 306 return 0==sqlite3Atoi64(pRec->z, piValue, pRec->n, pRec->enc); 307 } 308 309 /* 310 ** Try to convert a value into a numeric representation if we can 311 ** do so without loss of information. In other words, if the string 312 ** looks like a number, convert it into a number. If it does not 313 ** look like a number, leave it alone. 314 ** 315 ** If the bTryForInt flag is true, then extra effort is made to give 316 ** an integer representation. Strings that look like floating point 317 ** values but which have no fractional component (example: '48.00') 318 ** will have a MEM_Int representation when bTryForInt is true. 319 ** 320 ** If bTryForInt is false, then if the input string contains a decimal 321 ** point or exponential notation, the result is only MEM_Real, even 322 ** if there is an exact integer representation of the quantity. 323 */ 324 static void applyNumericAffinity(Mem *pRec, int bTryForInt){ 325 double rValue; 326 u8 enc = pRec->enc; 327 int rc; 328 assert( (pRec->flags & (MEM_Str|MEM_Int|MEM_Real|MEM_IntReal))==MEM_Str ); 329 rc = sqlite3AtoF(pRec->z, &rValue, pRec->n, enc); 330 if( rc<=0 ) return; 331 if( rc==1 && alsoAnInt(pRec, rValue, &pRec->u.i) ){ 332 pRec->flags |= MEM_Int; 333 }else{ 334 pRec->u.r = rValue; 335 pRec->flags |= MEM_Real; 336 if( bTryForInt ) sqlite3VdbeIntegerAffinity(pRec); 337 } 338 /* TEXT->NUMERIC is many->one. Hence, it is important to invalidate the 339 ** string representation after computing a numeric equivalent, because the 340 ** string representation might not be the canonical representation for the 341 ** numeric value. Ticket [343634942dd54ab57b7024] 2018-01-31. */ 342 pRec->flags &= ~MEM_Str; 343 } 344 345 /* 346 ** Processing is determine by the affinity parameter: 347 ** 348 ** SQLITE_AFF_INTEGER: 349 ** SQLITE_AFF_REAL: 350 ** SQLITE_AFF_NUMERIC: 351 ** Try to convert pRec to an integer representation or a 352 ** floating-point representation if an integer representation 353 ** is not possible. Note that the integer representation is 354 ** always preferred, even if the affinity is REAL, because 355 ** an integer representation is more space efficient on disk. 356 ** 357 ** SQLITE_AFF_TEXT: 358 ** Convert pRec to a text representation. 359 ** 360 ** SQLITE_AFF_BLOB: 361 ** SQLITE_AFF_NONE: 362 ** No-op. pRec is unchanged. 363 */ 364 static void applyAffinity( 365 Mem *pRec, /* The value to apply affinity to */ 366 char affinity, /* The affinity to be applied */ 367 u8 enc /* Use this text encoding */ 368 ){ 369 if( affinity>=SQLITE_AFF_NUMERIC ){ 370 assert( affinity==SQLITE_AFF_INTEGER || affinity==SQLITE_AFF_REAL 371 || affinity==SQLITE_AFF_NUMERIC ); 372 if( (pRec->flags & MEM_Int)==0 ){ /*OPTIMIZATION-IF-FALSE*/ 373 if( (pRec->flags & MEM_Real)==0 ){ 374 if( pRec->flags & MEM_Str ) applyNumericAffinity(pRec,1); 375 }else{ 376 sqlite3VdbeIntegerAffinity(pRec); 377 } 378 } 379 }else if( affinity==SQLITE_AFF_TEXT ){ 380 /* Only attempt the conversion to TEXT if there is an integer or real 381 ** representation (blob and NULL do not get converted) but no string 382 ** representation. It would be harmless to repeat the conversion if 383 ** there is already a string rep, but it is pointless to waste those 384 ** CPU cycles. */ 385 if( 0==(pRec->flags&MEM_Str) ){ /*OPTIMIZATION-IF-FALSE*/ 386 if( (pRec->flags&(MEM_Real|MEM_Int|MEM_IntReal)) ){ 387 testcase( pRec->flags & MEM_Int ); 388 testcase( pRec->flags & MEM_Real ); 389 testcase( pRec->flags & MEM_IntReal ); 390 sqlite3VdbeMemStringify(pRec, enc, 1); 391 } 392 } 393 pRec->flags &= ~(MEM_Real|MEM_Int|MEM_IntReal); 394 } 395 } 396 397 /* 398 ** Try to convert the type of a function argument or a result column 399 ** into a numeric representation. Use either INTEGER or REAL whichever 400 ** is appropriate. But only do the conversion if it is possible without 401 ** loss of information and return the revised type of the argument. 402 */ 403 int sqlite3_value_numeric_type(sqlite3_value *pVal){ 404 int eType = sqlite3_value_type(pVal); 405 if( eType==SQLITE_TEXT ){ 406 Mem *pMem = (Mem*)pVal; 407 applyNumericAffinity(pMem, 0); 408 eType = sqlite3_value_type(pVal); 409 } 410 return eType; 411 } 412 413 /* 414 ** Exported version of applyAffinity(). This one works on sqlite3_value*, 415 ** not the internal Mem* type. 416 */ 417 void sqlite3ValueApplyAffinity( 418 sqlite3_value *pVal, 419 u8 affinity, 420 u8 enc 421 ){ 422 applyAffinity((Mem *)pVal, affinity, enc); 423 } 424 425 /* 426 ** pMem currently only holds a string type (or maybe a BLOB that we can 427 ** interpret as a string if we want to). Compute its corresponding 428 ** numeric type, if has one. Set the pMem->u.r and pMem->u.i fields 429 ** accordingly. 430 */ 431 static u16 SQLITE_NOINLINE computeNumericType(Mem *pMem){ 432 int rc; 433 sqlite3_int64 ix; 434 assert( (pMem->flags & (MEM_Int|MEM_Real|MEM_IntReal))==0 ); 435 assert( (pMem->flags & (MEM_Str|MEM_Blob))!=0 ); 436 if( ExpandBlob(pMem) ){ 437 pMem->u.i = 0; 438 return MEM_Int; 439 } 440 rc = sqlite3AtoF(pMem->z, &pMem->u.r, pMem->n, pMem->enc); 441 if( rc<=0 ){ 442 if( rc==0 && sqlite3Atoi64(pMem->z, &ix, pMem->n, pMem->enc)<=1 ){ 443 pMem->u.i = ix; 444 return MEM_Int; 445 }else{ 446 return MEM_Real; 447 } 448 }else if( rc==1 && sqlite3Atoi64(pMem->z, &ix, pMem->n, pMem->enc)==0 ){ 449 pMem->u.i = ix; 450 return MEM_Int; 451 } 452 return MEM_Real; 453 } 454 455 /* 456 ** Return the numeric type for pMem, either MEM_Int or MEM_Real or both or 457 ** none. 458 ** 459 ** Unlike applyNumericAffinity(), this routine does not modify pMem->flags. 460 ** But it does set pMem->u.r and pMem->u.i appropriately. 461 */ 462 static u16 numericType(Mem *pMem){ 463 if( pMem->flags & (MEM_Int|MEM_Real|MEM_IntReal) ){ 464 testcase( pMem->flags & MEM_Int ); 465 testcase( pMem->flags & MEM_Real ); 466 testcase( pMem->flags & MEM_IntReal ); 467 return pMem->flags & (MEM_Int|MEM_Real|MEM_IntReal); 468 } 469 if( pMem->flags & (MEM_Str|MEM_Blob) ){ 470 testcase( pMem->flags & MEM_Str ); 471 testcase( pMem->flags & MEM_Blob ); 472 return computeNumericType(pMem); 473 } 474 return 0; 475 } 476 477 #ifdef SQLITE_DEBUG 478 /* 479 ** Write a nice string representation of the contents of cell pMem 480 ** into buffer zBuf, length nBuf. 481 */ 482 void sqlite3VdbeMemPrettyPrint(Mem *pMem, StrAccum *pStr){ 483 int f = pMem->flags; 484 static const char *const encnames[] = {"(X)", "(8)", "(16LE)", "(16BE)"}; 485 if( f&MEM_Blob ){ 486 int i; 487 char c; 488 if( f & MEM_Dyn ){ 489 c = 'z'; 490 assert( (f & (MEM_Static|MEM_Ephem))==0 ); 491 }else if( f & MEM_Static ){ 492 c = 't'; 493 assert( (f & (MEM_Dyn|MEM_Ephem))==0 ); 494 }else if( f & MEM_Ephem ){ 495 c = 'e'; 496 assert( (f & (MEM_Static|MEM_Dyn))==0 ); 497 }else{ 498 c = 's'; 499 } 500 sqlite3_str_appendf(pStr, "%cx[", c); 501 for(i=0; i<25 && i<pMem->n; i++){ 502 sqlite3_str_appendf(pStr, "%02X", ((int)pMem->z[i] & 0xFF)); 503 } 504 sqlite3_str_appendf(pStr, "|"); 505 for(i=0; i<25 && i<pMem->n; i++){ 506 char z = pMem->z[i]; 507 sqlite3_str_appendchar(pStr, 1, (z<32||z>126)?'.':z); 508 } 509 sqlite3_str_appendf(pStr,"]"); 510 if( f & MEM_Zero ){ 511 sqlite3_str_appendf(pStr, "+%dz",pMem->u.nZero); 512 } 513 }else if( f & MEM_Str ){ 514 int j; 515 u8 c; 516 if( f & MEM_Dyn ){ 517 c = 'z'; 518 assert( (f & (MEM_Static|MEM_Ephem))==0 ); 519 }else if( f & MEM_Static ){ 520 c = 't'; 521 assert( (f & (MEM_Dyn|MEM_Ephem))==0 ); 522 }else if( f & MEM_Ephem ){ 523 c = 'e'; 524 assert( (f & (MEM_Static|MEM_Dyn))==0 ); 525 }else{ 526 c = 's'; 527 } 528 sqlite3_str_appendf(pStr, " %c%d[", c, pMem->n); 529 for(j=0; j<25 && j<pMem->n; j++){ 530 c = pMem->z[j]; 531 sqlite3_str_appendchar(pStr, 1, (c>=0x20&&c<=0x7f) ? c : '.'); 532 } 533 sqlite3_str_appendf(pStr, "]%s", encnames[pMem->enc]); 534 } 535 } 536 #endif 537 538 #ifdef SQLITE_DEBUG 539 /* 540 ** Print the value of a register for tracing purposes: 541 */ 542 static void memTracePrint(Mem *p){ 543 if( p->flags & MEM_Undefined ){ 544 printf(" undefined"); 545 }else if( p->flags & MEM_Null ){ 546 printf(p->flags & MEM_Zero ? " NULL-nochng" : " NULL"); 547 }else if( (p->flags & (MEM_Int|MEM_Str))==(MEM_Int|MEM_Str) ){ 548 printf(" si:%lld", p->u.i); 549 }else if( (p->flags & (MEM_IntReal))!=0 ){ 550 printf(" ir:%lld", p->u.i); 551 }else if( p->flags & MEM_Int ){ 552 printf(" i:%lld", p->u.i); 553 #ifndef SQLITE_OMIT_FLOATING_POINT 554 }else if( p->flags & MEM_Real ){ 555 printf(" r:%.17g", p->u.r); 556 #endif 557 }else if( sqlite3VdbeMemIsRowSet(p) ){ 558 printf(" (rowset)"); 559 }else{ 560 StrAccum acc; 561 char zBuf[1000]; 562 sqlite3StrAccumInit(&acc, 0, zBuf, sizeof(zBuf), 0); 563 sqlite3VdbeMemPrettyPrint(p, &acc); 564 printf(" %s", sqlite3StrAccumFinish(&acc)); 565 } 566 if( p->flags & MEM_Subtype ) printf(" subtype=0x%02x", p->eSubtype); 567 } 568 static void registerTrace(int iReg, Mem *p){ 569 printf("R[%d] = ", iReg); 570 memTracePrint(p); 571 if( p->pScopyFrom ){ 572 printf(" <== R[%d]", (int)(p->pScopyFrom - &p[-iReg])); 573 } 574 printf("\n"); 575 sqlite3VdbeCheckMemInvariants(p); 576 } 577 #endif 578 579 #ifdef SQLITE_DEBUG 580 /* 581 ** Show the values of all registers in the virtual machine. Used for 582 ** interactive debugging. 583 */ 584 void sqlite3VdbeRegisterDump(Vdbe *v){ 585 int i; 586 for(i=1; i<v->nMem; i++) registerTrace(i, v->aMem+i); 587 } 588 #endif /* SQLITE_DEBUG */ 589 590 591 #ifdef SQLITE_DEBUG 592 # define REGISTER_TRACE(R,M) if(db->flags&SQLITE_VdbeTrace)registerTrace(R,M) 593 #else 594 # define REGISTER_TRACE(R,M) 595 #endif 596 597 598 #ifdef VDBE_PROFILE 599 600 /* 601 ** hwtime.h contains inline assembler code for implementing 602 ** high-performance timing routines. 603 */ 604 #include "hwtime.h" 605 606 #endif 607 608 #ifndef NDEBUG 609 /* 610 ** This function is only called from within an assert() expression. It 611 ** checks that the sqlite3.nTransaction variable is correctly set to 612 ** the number of non-transaction savepoints currently in the 613 ** linked list starting at sqlite3.pSavepoint. 614 ** 615 ** Usage: 616 ** 617 ** assert( checkSavepointCount(db) ); 618 */ 619 static int checkSavepointCount(sqlite3 *db){ 620 int n = 0; 621 Savepoint *p; 622 for(p=db->pSavepoint; p; p=p->pNext) n++; 623 assert( n==(db->nSavepoint + db->isTransactionSavepoint) ); 624 return 1; 625 } 626 #endif 627 628 /* 629 ** Return the register of pOp->p2 after first preparing it to be 630 ** overwritten with an integer value. 631 */ 632 static SQLITE_NOINLINE Mem *out2PrereleaseWithClear(Mem *pOut){ 633 sqlite3VdbeMemSetNull(pOut); 634 pOut->flags = MEM_Int; 635 return pOut; 636 } 637 static Mem *out2Prerelease(Vdbe *p, VdbeOp *pOp){ 638 Mem *pOut; 639 assert( pOp->p2>0 ); 640 assert( pOp->p2<=(p->nMem+1 - p->nCursor) ); 641 pOut = &p->aMem[pOp->p2]; 642 memAboutToChange(p, pOut); 643 if( VdbeMemDynamic(pOut) ){ /*OPTIMIZATION-IF-FALSE*/ 644 return out2PrereleaseWithClear(pOut); 645 }else{ 646 pOut->flags = MEM_Int; 647 return pOut; 648 } 649 } 650 651 652 /* 653 ** Execute as much of a VDBE program as we can. 654 ** This is the core of sqlite3_step(). 655 */ 656 int sqlite3VdbeExec( 657 Vdbe *p /* The VDBE */ 658 ){ 659 Op *aOp = p->aOp; /* Copy of p->aOp */ 660 Op *pOp = aOp; /* Current operation */ 661 #if defined(SQLITE_DEBUG) || defined(VDBE_PROFILE) 662 Op *pOrigOp; /* Value of pOp at the top of the loop */ 663 #endif 664 #ifdef SQLITE_DEBUG 665 int nExtraDelete = 0; /* Verifies FORDELETE and AUXDELETE flags */ 666 #endif 667 int rc = SQLITE_OK; /* Value to return */ 668 sqlite3 *db = p->db; /* The database */ 669 u8 resetSchemaOnFault = 0; /* Reset schema after an error if positive */ 670 u8 encoding = ENC(db); /* The database encoding */ 671 int iCompare = 0; /* Result of last comparison */ 672 u64 nVmStep = 0; /* Number of virtual machine steps */ 673 #ifndef SQLITE_OMIT_PROGRESS_CALLBACK 674 u64 nProgressLimit; /* Invoke xProgress() when nVmStep reaches this */ 675 #endif 676 Mem *aMem = p->aMem; /* Copy of p->aMem */ 677 Mem *pIn1 = 0; /* 1st input operand */ 678 Mem *pIn2 = 0; /* 2nd input operand */ 679 Mem *pIn3 = 0; /* 3rd input operand */ 680 Mem *pOut = 0; /* Output operand */ 681 #ifdef VDBE_PROFILE 682 u64 start; /* CPU clock count at start of opcode */ 683 #endif 684 /*** INSERT STACK UNION HERE ***/ 685 686 assert( p->iVdbeMagic==VDBE_MAGIC_RUN ); /* sqlite3_step() verifies this */ 687 sqlite3VdbeEnter(p); 688 #ifndef SQLITE_OMIT_PROGRESS_CALLBACK 689 if( db->xProgress ){ 690 u32 iPrior = p->aCounter[SQLITE_STMTSTATUS_VM_STEP]; 691 assert( 0 < db->nProgressOps ); 692 nProgressLimit = db->nProgressOps - (iPrior % db->nProgressOps); 693 }else{ 694 nProgressLimit = LARGEST_UINT64; 695 } 696 #endif 697 if( p->rc==SQLITE_NOMEM ){ 698 /* This happens if a malloc() inside a call to sqlite3_column_text() or 699 ** sqlite3_column_text16() failed. */ 700 goto no_mem; 701 } 702 assert( p->rc==SQLITE_OK || (p->rc&0xff)==SQLITE_BUSY ); 703 testcase( p->rc!=SQLITE_OK ); 704 p->rc = SQLITE_OK; 705 assert( p->bIsReader || p->readOnly!=0 ); 706 p->iCurrentTime = 0; 707 assert( p->explain==0 ); 708 p->pResultSet = 0; 709 db->busyHandler.nBusy = 0; 710 if( AtomicLoad(&db->u1.isInterrupted) ) goto abort_due_to_interrupt; 711 sqlite3VdbeIOTraceSql(p); 712 #ifdef SQLITE_DEBUG 713 sqlite3BeginBenignMalloc(); 714 if( p->pc==0 715 && (p->db->flags & (SQLITE_VdbeListing|SQLITE_VdbeEQP|SQLITE_VdbeTrace))!=0 716 ){ 717 int i; 718 int once = 1; 719 sqlite3VdbePrintSql(p); 720 if( p->db->flags & SQLITE_VdbeListing ){ 721 printf("VDBE Program Listing:\n"); 722 for(i=0; i<p->nOp; i++){ 723 sqlite3VdbePrintOp(stdout, i, &aOp[i]); 724 } 725 } 726 if( p->db->flags & SQLITE_VdbeEQP ){ 727 for(i=0; i<p->nOp; i++){ 728 if( aOp[i].opcode==OP_Explain ){ 729 if( once ) printf("VDBE Query Plan:\n"); 730 printf("%s\n", aOp[i].p4.z); 731 once = 0; 732 } 733 } 734 } 735 if( p->db->flags & SQLITE_VdbeTrace ) printf("VDBE Trace:\n"); 736 } 737 sqlite3EndBenignMalloc(); 738 #endif 739 for(pOp=&aOp[p->pc]; 1; pOp++){ 740 /* Errors are detected by individual opcodes, with an immediate 741 ** jumps to abort_due_to_error. */ 742 assert( rc==SQLITE_OK ); 743 744 assert( pOp>=aOp && pOp<&aOp[p->nOp]); 745 #ifdef VDBE_PROFILE 746 start = sqlite3NProfileCnt ? sqlite3NProfileCnt : sqlite3Hwtime(); 747 #endif 748 nVmStep++; 749 #ifdef SQLITE_ENABLE_STMT_SCANSTATUS 750 if( p->anExec ) p->anExec[(int)(pOp-aOp)]++; 751 #endif 752 753 /* Only allow tracing if SQLITE_DEBUG is defined. 754 */ 755 #ifdef SQLITE_DEBUG 756 if( db->flags & SQLITE_VdbeTrace ){ 757 sqlite3VdbePrintOp(stdout, (int)(pOp - aOp), pOp); 758 test_trace_breakpoint((int)(pOp - aOp),pOp,p); 759 } 760 #endif 761 762 763 /* Check to see if we need to simulate an interrupt. This only happens 764 ** if we have a special test build. 765 */ 766 #ifdef SQLITE_TEST 767 if( sqlite3_interrupt_count>0 ){ 768 sqlite3_interrupt_count--; 769 if( sqlite3_interrupt_count==0 ){ 770 sqlite3_interrupt(db); 771 } 772 } 773 #endif 774 775 /* Sanity checking on other operands */ 776 #ifdef SQLITE_DEBUG 777 { 778 u8 opProperty = sqlite3OpcodeProperty[pOp->opcode]; 779 if( (opProperty & OPFLG_IN1)!=0 ){ 780 assert( pOp->p1>0 ); 781 assert( pOp->p1<=(p->nMem+1 - p->nCursor) ); 782 assert( memIsValid(&aMem[pOp->p1]) ); 783 assert( sqlite3VdbeCheckMemInvariants(&aMem[pOp->p1]) ); 784 REGISTER_TRACE(pOp->p1, &aMem[pOp->p1]); 785 } 786 if( (opProperty & OPFLG_IN2)!=0 ){ 787 assert( pOp->p2>0 ); 788 assert( pOp->p2<=(p->nMem+1 - p->nCursor) ); 789 assert( memIsValid(&aMem[pOp->p2]) ); 790 assert( sqlite3VdbeCheckMemInvariants(&aMem[pOp->p2]) ); 791 REGISTER_TRACE(pOp->p2, &aMem[pOp->p2]); 792 } 793 if( (opProperty & OPFLG_IN3)!=0 ){ 794 assert( pOp->p3>0 ); 795 assert( pOp->p3<=(p->nMem+1 - p->nCursor) ); 796 assert( memIsValid(&aMem[pOp->p3]) ); 797 assert( sqlite3VdbeCheckMemInvariants(&aMem[pOp->p3]) ); 798 REGISTER_TRACE(pOp->p3, &aMem[pOp->p3]); 799 } 800 if( (opProperty & OPFLG_OUT2)!=0 ){ 801 assert( pOp->p2>0 ); 802 assert( pOp->p2<=(p->nMem+1 - p->nCursor) ); 803 memAboutToChange(p, &aMem[pOp->p2]); 804 } 805 if( (opProperty & OPFLG_OUT3)!=0 ){ 806 assert( pOp->p3>0 ); 807 assert( pOp->p3<=(p->nMem+1 - p->nCursor) ); 808 memAboutToChange(p, &aMem[pOp->p3]); 809 } 810 } 811 #endif 812 #if defined(SQLITE_DEBUG) || defined(VDBE_PROFILE) 813 pOrigOp = pOp; 814 #endif 815 816 switch( pOp->opcode ){ 817 818 /***************************************************************************** 819 ** What follows is a massive switch statement where each case implements a 820 ** separate instruction in the virtual machine. If we follow the usual 821 ** indentation conventions, each case should be indented by 6 spaces. But 822 ** that is a lot of wasted space on the left margin. So the code within 823 ** the switch statement will break with convention and be flush-left. Another 824 ** big comment (similar to this one) will mark the point in the code where 825 ** we transition back to normal indentation. 826 ** 827 ** The formatting of each case is important. The makefile for SQLite 828 ** generates two C files "opcodes.h" and "opcodes.c" by scanning this 829 ** file looking for lines that begin with "case OP_". The opcodes.h files 830 ** will be filled with #defines that give unique integer values to each 831 ** opcode and the opcodes.c file is filled with an array of strings where 832 ** each string is the symbolic name for the corresponding opcode. If the 833 ** case statement is followed by a comment of the form "/# same as ... #/" 834 ** that comment is used to determine the particular value of the opcode. 835 ** 836 ** Other keywords in the comment that follows each case are used to 837 ** construct the OPFLG_INITIALIZER value that initializes opcodeProperty[]. 838 ** Keywords include: in1, in2, in3, out2, out3. See 839 ** the mkopcodeh.awk script for additional information. 840 ** 841 ** Documentation about VDBE opcodes is generated by scanning this file 842 ** for lines of that contain "Opcode:". That line and all subsequent 843 ** comment lines are used in the generation of the opcode.html documentation 844 ** file. 845 ** 846 ** SUMMARY: 847 ** 848 ** Formatting is important to scripts that scan this file. 849 ** Do not deviate from the formatting style currently in use. 850 ** 851 *****************************************************************************/ 852 853 /* Opcode: Goto * P2 * * * 854 ** 855 ** An unconditional jump to address P2. 856 ** The next instruction executed will be 857 ** the one at index P2 from the beginning of 858 ** the program. 859 ** 860 ** The P1 parameter is not actually used by this opcode. However, it 861 ** is sometimes set to 1 instead of 0 as a hint to the command-line shell 862 ** that this Goto is the bottom of a loop and that the lines from P2 down 863 ** to the current line should be indented for EXPLAIN output. 864 */ 865 case OP_Goto: { /* jump */ 866 867 #ifdef SQLITE_DEBUG 868 /* In debuggging mode, when the p5 flags is set on an OP_Goto, that 869 ** means we should really jump back to the preceeding OP_ReleaseReg 870 ** instruction. */ 871 if( pOp->p5 ){ 872 assert( pOp->p2 < (int)(pOp - aOp) ); 873 assert( pOp->p2 > 1 ); 874 pOp = &aOp[pOp->p2 - 2]; 875 assert( pOp[1].opcode==OP_ReleaseReg ); 876 goto check_for_interrupt; 877 } 878 #endif 879 880 jump_to_p2_and_check_for_interrupt: 881 pOp = &aOp[pOp->p2 - 1]; 882 883 /* Opcodes that are used as the bottom of a loop (OP_Next, OP_Prev, 884 ** OP_VNext, or OP_SorterNext) all jump here upon 885 ** completion. Check to see if sqlite3_interrupt() has been called 886 ** or if the progress callback needs to be invoked. 887 ** 888 ** This code uses unstructured "goto" statements and does not look clean. 889 ** But that is not due to sloppy coding habits. The code is written this 890 ** way for performance, to avoid having to run the interrupt and progress 891 ** checks on every opcode. This helps sqlite3_step() to run about 1.5% 892 ** faster according to "valgrind --tool=cachegrind" */ 893 check_for_interrupt: 894 if( AtomicLoad(&db->u1.isInterrupted) ) goto abort_due_to_interrupt; 895 #ifndef SQLITE_OMIT_PROGRESS_CALLBACK 896 /* Call the progress callback if it is configured and the required number 897 ** of VDBE ops have been executed (either since this invocation of 898 ** sqlite3VdbeExec() or since last time the progress callback was called). 899 ** If the progress callback returns non-zero, exit the virtual machine with 900 ** a return code SQLITE_ABORT. 901 */ 902 while( nVmStep>=nProgressLimit && db->xProgress!=0 ){ 903 assert( db->nProgressOps!=0 ); 904 nProgressLimit += db->nProgressOps; 905 if( db->xProgress(db->pProgressArg) ){ 906 nProgressLimit = LARGEST_UINT64; 907 rc = SQLITE_INTERRUPT; 908 goto abort_due_to_error; 909 } 910 } 911 #endif 912 913 break; 914 } 915 916 /* Opcode: Gosub P1 P2 * * * 917 ** 918 ** Write the current address onto register P1 919 ** and then jump to address P2. 920 */ 921 case OP_Gosub: { /* jump */ 922 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) ); 923 pIn1 = &aMem[pOp->p1]; 924 assert( VdbeMemDynamic(pIn1)==0 ); 925 memAboutToChange(p, pIn1); 926 pIn1->flags = MEM_Int; 927 pIn1->u.i = (int)(pOp-aOp); 928 REGISTER_TRACE(pOp->p1, pIn1); 929 930 /* Most jump operations do a goto to this spot in order to update 931 ** the pOp pointer. */ 932 jump_to_p2: 933 pOp = &aOp[pOp->p2 - 1]; 934 break; 935 } 936 937 /* Opcode: Return P1 * * * * 938 ** 939 ** Jump to the next instruction after the address in register P1. After 940 ** the jump, register P1 becomes undefined. 941 */ 942 case OP_Return: { /* in1 */ 943 pIn1 = &aMem[pOp->p1]; 944 assert( pIn1->flags==MEM_Int ); 945 pOp = &aOp[pIn1->u.i]; 946 pIn1->flags = MEM_Undefined; 947 break; 948 } 949 950 /* Opcode: InitCoroutine P1 P2 P3 * * 951 ** 952 ** Set up register P1 so that it will Yield to the coroutine 953 ** located at address P3. 954 ** 955 ** If P2!=0 then the coroutine implementation immediately follows 956 ** this opcode. So jump over the coroutine implementation to 957 ** address P2. 958 ** 959 ** See also: EndCoroutine 960 */ 961 case OP_InitCoroutine: { /* jump */ 962 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) ); 963 assert( pOp->p2>=0 && pOp->p2<p->nOp ); 964 assert( pOp->p3>=0 && pOp->p3<p->nOp ); 965 pOut = &aMem[pOp->p1]; 966 assert( !VdbeMemDynamic(pOut) ); 967 pOut->u.i = pOp->p3 - 1; 968 pOut->flags = MEM_Int; 969 if( pOp->p2 ) goto jump_to_p2; 970 break; 971 } 972 973 /* Opcode: EndCoroutine P1 * * * * 974 ** 975 ** The instruction at the address in register P1 is a Yield. 976 ** Jump to the P2 parameter of that Yield. 977 ** After the jump, register P1 becomes undefined. 978 ** 979 ** See also: InitCoroutine 980 */ 981 case OP_EndCoroutine: { /* in1 */ 982 VdbeOp *pCaller; 983 pIn1 = &aMem[pOp->p1]; 984 assert( pIn1->flags==MEM_Int ); 985 assert( pIn1->u.i>=0 && pIn1->u.i<p->nOp ); 986 pCaller = &aOp[pIn1->u.i]; 987 assert( pCaller->opcode==OP_Yield ); 988 assert( pCaller->p2>=0 && pCaller->p2<p->nOp ); 989 pOp = &aOp[pCaller->p2 - 1]; 990 pIn1->flags = MEM_Undefined; 991 break; 992 } 993 994 /* Opcode: Yield P1 P2 * * * 995 ** 996 ** Swap the program counter with the value in register P1. This 997 ** has the effect of yielding to a coroutine. 998 ** 999 ** If the coroutine that is launched by this instruction ends with 1000 ** Yield or Return then continue to the next instruction. But if 1001 ** the coroutine launched by this instruction ends with 1002 ** EndCoroutine, then jump to P2 rather than continuing with the 1003 ** next instruction. 1004 ** 1005 ** See also: InitCoroutine 1006 */ 1007 case OP_Yield: { /* in1, jump */ 1008 int pcDest; 1009 pIn1 = &aMem[pOp->p1]; 1010 assert( VdbeMemDynamic(pIn1)==0 ); 1011 pIn1->flags = MEM_Int; 1012 pcDest = (int)pIn1->u.i; 1013 pIn1->u.i = (int)(pOp - aOp); 1014 REGISTER_TRACE(pOp->p1, pIn1); 1015 pOp = &aOp[pcDest]; 1016 break; 1017 } 1018 1019 /* Opcode: HaltIfNull P1 P2 P3 P4 P5 1020 ** Synopsis: if r[P3]=null halt 1021 ** 1022 ** Check the value in register P3. If it is NULL then Halt using 1023 ** parameter P1, P2, and P4 as if this were a Halt instruction. If the 1024 ** value in register P3 is not NULL, then this routine is a no-op. 1025 ** The P5 parameter should be 1. 1026 */ 1027 case OP_HaltIfNull: { /* in3 */ 1028 pIn3 = &aMem[pOp->p3]; 1029 #ifdef SQLITE_DEBUG 1030 if( pOp->p2==OE_Abort ){ sqlite3VdbeAssertAbortable(p); } 1031 #endif 1032 if( (pIn3->flags & MEM_Null)==0 ) break; 1033 /* Fall through into OP_Halt */ 1034 /* no break */ deliberate_fall_through 1035 } 1036 1037 /* Opcode: Halt P1 P2 * P4 P5 1038 ** 1039 ** Exit immediately. All open cursors, etc are closed 1040 ** automatically. 1041 ** 1042 ** P1 is the result code returned by sqlite3_exec(), sqlite3_reset(), 1043 ** or sqlite3_finalize(). For a normal halt, this should be SQLITE_OK (0). 1044 ** For errors, it can be some other value. If P1!=0 then P2 will determine 1045 ** whether or not to rollback the current transaction. Do not rollback 1046 ** if P2==OE_Fail. Do the rollback if P2==OE_Rollback. If P2==OE_Abort, 1047 ** then back out all changes that have occurred during this execution of the 1048 ** VDBE, but do not rollback the transaction. 1049 ** 1050 ** If P4 is not null then it is an error message string. 1051 ** 1052 ** P5 is a value between 0 and 4, inclusive, that modifies the P4 string. 1053 ** 1054 ** 0: (no change) 1055 ** 1: NOT NULL contraint failed: P4 1056 ** 2: UNIQUE constraint failed: P4 1057 ** 3: CHECK constraint failed: P4 1058 ** 4: FOREIGN KEY constraint failed: P4 1059 ** 1060 ** If P5 is not zero and P4 is NULL, then everything after the ":" is 1061 ** omitted. 1062 ** 1063 ** There is an implied "Halt 0 0 0" instruction inserted at the very end of 1064 ** every program. So a jump past the last instruction of the program 1065 ** is the same as executing Halt. 1066 */ 1067 case OP_Halt: { 1068 VdbeFrame *pFrame; 1069 int pcx; 1070 1071 pcx = (int)(pOp - aOp); 1072 #ifdef SQLITE_DEBUG 1073 if( pOp->p2==OE_Abort ){ sqlite3VdbeAssertAbortable(p); } 1074 #endif 1075 if( pOp->p1==SQLITE_OK && p->pFrame ){ 1076 /* Halt the sub-program. Return control to the parent frame. */ 1077 pFrame = p->pFrame; 1078 p->pFrame = pFrame->pParent; 1079 p->nFrame--; 1080 sqlite3VdbeSetChanges(db, p->nChange); 1081 pcx = sqlite3VdbeFrameRestore(pFrame); 1082 if( pOp->p2==OE_Ignore ){ 1083 /* Instruction pcx is the OP_Program that invoked the sub-program 1084 ** currently being halted. If the p2 instruction of this OP_Halt 1085 ** instruction is set to OE_Ignore, then the sub-program is throwing 1086 ** an IGNORE exception. In this case jump to the address specified 1087 ** as the p2 of the calling OP_Program. */ 1088 pcx = p->aOp[pcx].p2-1; 1089 } 1090 aOp = p->aOp; 1091 aMem = p->aMem; 1092 pOp = &aOp[pcx]; 1093 break; 1094 } 1095 p->rc = pOp->p1; 1096 p->errorAction = (u8)pOp->p2; 1097 p->pc = pcx; 1098 assert( pOp->p5<=4 ); 1099 if( p->rc ){ 1100 if( pOp->p5 ){ 1101 static const char * const azType[] = { "NOT NULL", "UNIQUE", "CHECK", 1102 "FOREIGN KEY" }; 1103 testcase( pOp->p5==1 ); 1104 testcase( pOp->p5==2 ); 1105 testcase( pOp->p5==3 ); 1106 testcase( pOp->p5==4 ); 1107 sqlite3VdbeError(p, "%s constraint failed", azType[pOp->p5-1]); 1108 if( pOp->p4.z ){ 1109 p->zErrMsg = sqlite3MPrintf(db, "%z: %s", p->zErrMsg, pOp->p4.z); 1110 } 1111 }else{ 1112 sqlite3VdbeError(p, "%s", pOp->p4.z); 1113 } 1114 sqlite3_log(pOp->p1, "abort at %d in [%s]: %s", pcx, p->zSql, p->zErrMsg); 1115 } 1116 rc = sqlite3VdbeHalt(p); 1117 assert( rc==SQLITE_BUSY || rc==SQLITE_OK || rc==SQLITE_ERROR ); 1118 if( rc==SQLITE_BUSY ){ 1119 p->rc = SQLITE_BUSY; 1120 }else{ 1121 assert( rc==SQLITE_OK || (p->rc&0xff)==SQLITE_CONSTRAINT ); 1122 assert( rc==SQLITE_OK || db->nDeferredCons>0 || db->nDeferredImmCons>0 ); 1123 rc = p->rc ? SQLITE_ERROR : SQLITE_DONE; 1124 } 1125 goto vdbe_return; 1126 } 1127 1128 /* Opcode: Integer P1 P2 * * * 1129 ** Synopsis: r[P2]=P1 1130 ** 1131 ** The 32-bit integer value P1 is written into register P2. 1132 */ 1133 case OP_Integer: { /* out2 */ 1134 pOut = out2Prerelease(p, pOp); 1135 pOut->u.i = pOp->p1; 1136 break; 1137 } 1138 1139 /* Opcode: Int64 * P2 * P4 * 1140 ** Synopsis: r[P2]=P4 1141 ** 1142 ** P4 is a pointer to a 64-bit integer value. 1143 ** Write that value into register P2. 1144 */ 1145 case OP_Int64: { /* out2 */ 1146 pOut = out2Prerelease(p, pOp); 1147 assert( pOp->p4.pI64!=0 ); 1148 pOut->u.i = *pOp->p4.pI64; 1149 break; 1150 } 1151 1152 #ifndef SQLITE_OMIT_FLOATING_POINT 1153 /* Opcode: Real * P2 * P4 * 1154 ** Synopsis: r[P2]=P4 1155 ** 1156 ** P4 is a pointer to a 64-bit floating point value. 1157 ** Write that value into register P2. 1158 */ 1159 case OP_Real: { /* same as TK_FLOAT, out2 */ 1160 pOut = out2Prerelease(p, pOp); 1161 pOut->flags = MEM_Real; 1162 assert( !sqlite3IsNaN(*pOp->p4.pReal) ); 1163 pOut->u.r = *pOp->p4.pReal; 1164 break; 1165 } 1166 #endif 1167 1168 /* Opcode: String8 * P2 * P4 * 1169 ** Synopsis: r[P2]='P4' 1170 ** 1171 ** P4 points to a nul terminated UTF-8 string. This opcode is transformed 1172 ** into a String opcode before it is executed for the first time. During 1173 ** this transformation, the length of string P4 is computed and stored 1174 ** as the P1 parameter. 1175 */ 1176 case OP_String8: { /* same as TK_STRING, out2 */ 1177 assert( pOp->p4.z!=0 ); 1178 pOut = out2Prerelease(p, pOp); 1179 pOp->p1 = sqlite3Strlen30(pOp->p4.z); 1180 1181 #ifndef SQLITE_OMIT_UTF16 1182 if( encoding!=SQLITE_UTF8 ){ 1183 rc = sqlite3VdbeMemSetStr(pOut, pOp->p4.z, -1, SQLITE_UTF8, SQLITE_STATIC); 1184 assert( rc==SQLITE_OK || rc==SQLITE_TOOBIG ); 1185 if( rc ) goto too_big; 1186 if( SQLITE_OK!=sqlite3VdbeChangeEncoding(pOut, encoding) ) goto no_mem; 1187 assert( pOut->szMalloc>0 && pOut->zMalloc==pOut->z ); 1188 assert( VdbeMemDynamic(pOut)==0 ); 1189 pOut->szMalloc = 0; 1190 pOut->flags |= MEM_Static; 1191 if( pOp->p4type==P4_DYNAMIC ){ 1192 sqlite3DbFree(db, pOp->p4.z); 1193 } 1194 pOp->p4type = P4_DYNAMIC; 1195 pOp->p4.z = pOut->z; 1196 pOp->p1 = pOut->n; 1197 } 1198 #endif 1199 if( pOp->p1>db->aLimit[SQLITE_LIMIT_LENGTH] ){ 1200 goto too_big; 1201 } 1202 pOp->opcode = OP_String; 1203 assert( rc==SQLITE_OK ); 1204 /* Fall through to the next case, OP_String */ 1205 /* no break */ deliberate_fall_through 1206 } 1207 1208 /* Opcode: String P1 P2 P3 P4 P5 1209 ** Synopsis: r[P2]='P4' (len=P1) 1210 ** 1211 ** The string value P4 of length P1 (bytes) is stored in register P2. 1212 ** 1213 ** If P3 is not zero and the content of register P3 is equal to P5, then 1214 ** the datatype of the register P2 is converted to BLOB. The content is 1215 ** the same sequence of bytes, it is merely interpreted as a BLOB instead 1216 ** of a string, as if it had been CAST. In other words: 1217 ** 1218 ** if( P3!=0 and reg[P3]==P5 ) reg[P2] := CAST(reg[P2] as BLOB) 1219 */ 1220 case OP_String: { /* out2 */ 1221 assert( pOp->p4.z!=0 ); 1222 pOut = out2Prerelease(p, pOp); 1223 pOut->flags = MEM_Str|MEM_Static|MEM_Term; 1224 pOut->z = pOp->p4.z; 1225 pOut->n = pOp->p1; 1226 pOut->enc = encoding; 1227 UPDATE_MAX_BLOBSIZE(pOut); 1228 #ifndef SQLITE_LIKE_DOESNT_MATCH_BLOBS 1229 if( pOp->p3>0 ){ 1230 assert( pOp->p3<=(p->nMem+1 - p->nCursor) ); 1231 pIn3 = &aMem[pOp->p3]; 1232 assert( pIn3->flags & MEM_Int ); 1233 if( pIn3->u.i==pOp->p5 ) pOut->flags = MEM_Blob|MEM_Static|MEM_Term; 1234 } 1235 #endif 1236 break; 1237 } 1238 1239 /* Opcode: Null P1 P2 P3 * * 1240 ** Synopsis: r[P2..P3]=NULL 1241 ** 1242 ** Write a NULL into registers P2. If P3 greater than P2, then also write 1243 ** NULL into register P3 and every register in between P2 and P3. If P3 1244 ** is less than P2 (typically P3 is zero) then only register P2 is 1245 ** set to NULL. 1246 ** 1247 ** If the P1 value is non-zero, then also set the MEM_Cleared flag so that 1248 ** NULL values will not compare equal even if SQLITE_NULLEQ is set on 1249 ** OP_Ne or OP_Eq. 1250 */ 1251 case OP_Null: { /* out2 */ 1252 int cnt; 1253 u16 nullFlag; 1254 pOut = out2Prerelease(p, pOp); 1255 cnt = pOp->p3-pOp->p2; 1256 assert( pOp->p3<=(p->nMem+1 - p->nCursor) ); 1257 pOut->flags = nullFlag = pOp->p1 ? (MEM_Null|MEM_Cleared) : MEM_Null; 1258 pOut->n = 0; 1259 #ifdef SQLITE_DEBUG 1260 pOut->uTemp = 0; 1261 #endif 1262 while( cnt>0 ){ 1263 pOut++; 1264 memAboutToChange(p, pOut); 1265 sqlite3VdbeMemSetNull(pOut); 1266 pOut->flags = nullFlag; 1267 pOut->n = 0; 1268 cnt--; 1269 } 1270 break; 1271 } 1272 1273 /* Opcode: SoftNull P1 * * * * 1274 ** Synopsis: r[P1]=NULL 1275 ** 1276 ** Set register P1 to have the value NULL as seen by the OP_MakeRecord 1277 ** instruction, but do not free any string or blob memory associated with 1278 ** the register, so that if the value was a string or blob that was 1279 ** previously copied using OP_SCopy, the copies will continue to be valid. 1280 */ 1281 case OP_SoftNull: { 1282 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) ); 1283 pOut = &aMem[pOp->p1]; 1284 pOut->flags = (pOut->flags&~(MEM_Undefined|MEM_AffMask))|MEM_Null; 1285 break; 1286 } 1287 1288 /* Opcode: Blob P1 P2 * P4 * 1289 ** Synopsis: r[P2]=P4 (len=P1) 1290 ** 1291 ** P4 points to a blob of data P1 bytes long. Store this 1292 ** blob in register P2. 1293 */ 1294 case OP_Blob: { /* out2 */ 1295 assert( pOp->p1 <= SQLITE_MAX_LENGTH ); 1296 pOut = out2Prerelease(p, pOp); 1297 sqlite3VdbeMemSetStr(pOut, pOp->p4.z, pOp->p1, 0, 0); 1298 pOut->enc = encoding; 1299 UPDATE_MAX_BLOBSIZE(pOut); 1300 break; 1301 } 1302 1303 /* Opcode: Variable P1 P2 * P4 * 1304 ** Synopsis: r[P2]=parameter(P1,P4) 1305 ** 1306 ** Transfer the values of bound parameter P1 into register P2 1307 ** 1308 ** If the parameter is named, then its name appears in P4. 1309 ** The P4 value is used by sqlite3_bind_parameter_name(). 1310 */ 1311 case OP_Variable: { /* out2 */ 1312 Mem *pVar; /* Value being transferred */ 1313 1314 assert( pOp->p1>0 && pOp->p1<=p->nVar ); 1315 assert( pOp->p4.z==0 || pOp->p4.z==sqlite3VListNumToName(p->pVList,pOp->p1) ); 1316 pVar = &p->aVar[pOp->p1 - 1]; 1317 if( sqlite3VdbeMemTooBig(pVar) ){ 1318 goto too_big; 1319 } 1320 pOut = &aMem[pOp->p2]; 1321 if( VdbeMemDynamic(pOut) ) sqlite3VdbeMemSetNull(pOut); 1322 memcpy(pOut, pVar, MEMCELLSIZE); 1323 pOut->flags &= ~(MEM_Dyn|MEM_Ephem); 1324 pOut->flags |= MEM_Static|MEM_FromBind; 1325 UPDATE_MAX_BLOBSIZE(pOut); 1326 break; 1327 } 1328 1329 /* Opcode: Move P1 P2 P3 * * 1330 ** Synopsis: r[P2@P3]=r[P1@P3] 1331 ** 1332 ** Move the P3 values in register P1..P1+P3-1 over into 1333 ** registers P2..P2+P3-1. Registers P1..P1+P3-1 are 1334 ** left holding a NULL. It is an error for register ranges 1335 ** P1..P1+P3-1 and P2..P2+P3-1 to overlap. It is an error 1336 ** for P3 to be less than 1. 1337 */ 1338 case OP_Move: { 1339 int n; /* Number of registers left to copy */ 1340 int p1; /* Register to copy from */ 1341 int p2; /* Register to copy to */ 1342 1343 n = pOp->p3; 1344 p1 = pOp->p1; 1345 p2 = pOp->p2; 1346 assert( n>0 && p1>0 && p2>0 ); 1347 assert( p1+n<=p2 || p2+n<=p1 ); 1348 1349 pIn1 = &aMem[p1]; 1350 pOut = &aMem[p2]; 1351 do{ 1352 assert( pOut<=&aMem[(p->nMem+1 - p->nCursor)] ); 1353 assert( pIn1<=&aMem[(p->nMem+1 - p->nCursor)] ); 1354 assert( memIsValid(pIn1) ); 1355 memAboutToChange(p, pOut); 1356 sqlite3VdbeMemMove(pOut, pIn1); 1357 #ifdef SQLITE_DEBUG 1358 pIn1->pScopyFrom = 0; 1359 { int i; 1360 for(i=1; i<p->nMem; i++){ 1361 if( aMem[i].pScopyFrom==pIn1 ){ 1362 aMem[i].pScopyFrom = pOut; 1363 } 1364 } 1365 } 1366 #endif 1367 Deephemeralize(pOut); 1368 REGISTER_TRACE(p2++, pOut); 1369 pIn1++; 1370 pOut++; 1371 }while( --n ); 1372 break; 1373 } 1374 1375 /* Opcode: Copy P1 P2 P3 * * 1376 ** Synopsis: r[P2@P3+1]=r[P1@P3+1] 1377 ** 1378 ** Make a copy of registers P1..P1+P3 into registers P2..P2+P3. 1379 ** 1380 ** This instruction makes a deep copy of the value. A duplicate 1381 ** is made of any string or blob constant. See also OP_SCopy. 1382 */ 1383 case OP_Copy: { 1384 int n; 1385 1386 n = pOp->p3; 1387 pIn1 = &aMem[pOp->p1]; 1388 pOut = &aMem[pOp->p2]; 1389 assert( pOut!=pIn1 ); 1390 while( 1 ){ 1391 memAboutToChange(p, pOut); 1392 sqlite3VdbeMemShallowCopy(pOut, pIn1, MEM_Ephem); 1393 Deephemeralize(pOut); 1394 #ifdef SQLITE_DEBUG 1395 pOut->pScopyFrom = 0; 1396 #endif 1397 REGISTER_TRACE(pOp->p2+pOp->p3-n, pOut); 1398 if( (n--)==0 ) break; 1399 pOut++; 1400 pIn1++; 1401 } 1402 break; 1403 } 1404 1405 /* Opcode: SCopy P1 P2 * * * 1406 ** Synopsis: r[P2]=r[P1] 1407 ** 1408 ** Make a shallow copy of register P1 into register P2. 1409 ** 1410 ** This instruction makes a shallow copy of the value. If the value 1411 ** is a string or blob, then the copy is only a pointer to the 1412 ** original and hence if the original changes so will the copy. 1413 ** Worse, if the original is deallocated, the copy becomes invalid. 1414 ** Thus the program must guarantee that the original will not change 1415 ** during the lifetime of the copy. Use OP_Copy to make a complete 1416 ** copy. 1417 */ 1418 case OP_SCopy: { /* out2 */ 1419 pIn1 = &aMem[pOp->p1]; 1420 pOut = &aMem[pOp->p2]; 1421 assert( pOut!=pIn1 ); 1422 sqlite3VdbeMemShallowCopy(pOut, pIn1, MEM_Ephem); 1423 #ifdef SQLITE_DEBUG 1424 pOut->pScopyFrom = pIn1; 1425 pOut->mScopyFlags = pIn1->flags; 1426 #endif 1427 break; 1428 } 1429 1430 /* Opcode: IntCopy P1 P2 * * * 1431 ** Synopsis: r[P2]=r[P1] 1432 ** 1433 ** Transfer the integer value held in register P1 into register P2. 1434 ** 1435 ** This is an optimized version of SCopy that works only for integer 1436 ** values. 1437 */ 1438 case OP_IntCopy: { /* out2 */ 1439 pIn1 = &aMem[pOp->p1]; 1440 assert( (pIn1->flags & MEM_Int)!=0 ); 1441 pOut = &aMem[pOp->p2]; 1442 sqlite3VdbeMemSetInt64(pOut, pIn1->u.i); 1443 break; 1444 } 1445 1446 /* Opcode: ChngCntRow P1 P2 * * * 1447 ** Synopsis: output=r[P1] 1448 ** 1449 ** Output value in register P1 as the chance count for a DML statement, 1450 ** due to the "PRAGMA count_changes=ON" setting. Or, if there was a 1451 ** foreign key error in the statement, trigger the error now. 1452 ** 1453 ** This opcode is a variant of OP_ResultRow that checks the foreign key 1454 ** immediate constraint count and throws an error if the count is 1455 ** non-zero. The P2 opcode must be 1. 1456 */ 1457 case OP_ChngCntRow: { 1458 assert( pOp->p2==1 ); 1459 if( (rc = sqlite3VdbeCheckFk(p,0))!=SQLITE_OK ){ 1460 goto abort_due_to_error; 1461 } 1462 /* Fall through to the next case, OP_ResultRow */ 1463 /* no break */ deliberate_fall_through 1464 } 1465 1466 /* Opcode: ResultRow P1 P2 * * * 1467 ** Synopsis: output=r[P1@P2] 1468 ** 1469 ** The registers P1 through P1+P2-1 contain a single row of 1470 ** results. This opcode causes the sqlite3_step() call to terminate 1471 ** with an SQLITE_ROW return code and it sets up the sqlite3_stmt 1472 ** structure to provide access to the r(P1)..r(P1+P2-1) values as 1473 ** the result row. 1474 */ 1475 case OP_ResultRow: { 1476 Mem *pMem; 1477 int i; 1478 assert( p->nResColumn==pOp->p2 ); 1479 assert( pOp->p1>0 || CORRUPT_DB ); 1480 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 ); 1481 1482 /* Invalidate all ephemeral cursor row caches */ 1483 p->cacheCtr = (p->cacheCtr + 2)|1; 1484 1485 /* Make sure the results of the current row are \000 terminated 1486 ** and have an assigned type. The results are de-ephemeralized as 1487 ** a side effect. 1488 */ 1489 pMem = p->pResultSet = &aMem[pOp->p1]; 1490 for(i=0; i<pOp->p2; i++){ 1491 assert( memIsValid(&pMem[i]) ); 1492 Deephemeralize(&pMem[i]); 1493 assert( (pMem[i].flags & MEM_Ephem)==0 1494 || (pMem[i].flags & (MEM_Str|MEM_Blob))==0 ); 1495 sqlite3VdbeMemNulTerminate(&pMem[i]); 1496 REGISTER_TRACE(pOp->p1+i, &pMem[i]); 1497 #ifdef SQLITE_DEBUG 1498 /* The registers in the result will not be used again when the 1499 ** prepared statement restarts. This is because sqlite3_column() 1500 ** APIs might have caused type conversions of made other changes to 1501 ** the register values. Therefore, we can go ahead and break any 1502 ** OP_SCopy dependencies. */ 1503 pMem[i].pScopyFrom = 0; 1504 #endif 1505 } 1506 if( db->mallocFailed ) goto no_mem; 1507 1508 if( db->mTrace & SQLITE_TRACE_ROW ){ 1509 db->trace.xV2(SQLITE_TRACE_ROW, db->pTraceArg, p, 0); 1510 } 1511 1512 1513 /* Return SQLITE_ROW 1514 */ 1515 p->pc = (int)(pOp - aOp) + 1; 1516 rc = SQLITE_ROW; 1517 goto vdbe_return; 1518 } 1519 1520 /* Opcode: Concat P1 P2 P3 * * 1521 ** Synopsis: r[P3]=r[P2]+r[P1] 1522 ** 1523 ** Add the text in register P1 onto the end of the text in 1524 ** register P2 and store the result in register P3. 1525 ** If either the P1 or P2 text are NULL then store NULL in P3. 1526 ** 1527 ** P3 = P2 || P1 1528 ** 1529 ** It is illegal for P1 and P3 to be the same register. Sometimes, 1530 ** if P3 is the same register as P2, the implementation is able 1531 ** to avoid a memcpy(). 1532 */ 1533 case OP_Concat: { /* same as TK_CONCAT, in1, in2, out3 */ 1534 i64 nByte; /* Total size of the output string or blob */ 1535 u16 flags1; /* Initial flags for P1 */ 1536 u16 flags2; /* Initial flags for P2 */ 1537 1538 pIn1 = &aMem[pOp->p1]; 1539 pIn2 = &aMem[pOp->p2]; 1540 pOut = &aMem[pOp->p3]; 1541 testcase( pOut==pIn2 ); 1542 assert( pIn1!=pOut ); 1543 flags1 = pIn1->flags; 1544 testcase( flags1 & MEM_Null ); 1545 testcase( pIn2->flags & MEM_Null ); 1546 if( (flags1 | pIn2->flags) & MEM_Null ){ 1547 sqlite3VdbeMemSetNull(pOut); 1548 break; 1549 } 1550 if( (flags1 & (MEM_Str|MEM_Blob))==0 ){ 1551 if( sqlite3VdbeMemStringify(pIn1,encoding,0) ) goto no_mem; 1552 flags1 = pIn1->flags & ~MEM_Str; 1553 }else if( (flags1 & MEM_Zero)!=0 ){ 1554 if( sqlite3VdbeMemExpandBlob(pIn1) ) goto no_mem; 1555 flags1 = pIn1->flags & ~MEM_Str; 1556 } 1557 flags2 = pIn2->flags; 1558 if( (flags2 & (MEM_Str|MEM_Blob))==0 ){ 1559 if( sqlite3VdbeMemStringify(pIn2,encoding,0) ) goto no_mem; 1560 flags2 = pIn2->flags & ~MEM_Str; 1561 }else if( (flags2 & MEM_Zero)!=0 ){ 1562 if( sqlite3VdbeMemExpandBlob(pIn2) ) goto no_mem; 1563 flags2 = pIn2->flags & ~MEM_Str; 1564 } 1565 nByte = pIn1->n + pIn2->n; 1566 if( nByte>db->aLimit[SQLITE_LIMIT_LENGTH] ){ 1567 goto too_big; 1568 } 1569 if( sqlite3VdbeMemGrow(pOut, (int)nByte+3, pOut==pIn2) ){ 1570 goto no_mem; 1571 } 1572 MemSetTypeFlag(pOut, MEM_Str); 1573 if( pOut!=pIn2 ){ 1574 memcpy(pOut->z, pIn2->z, pIn2->n); 1575 assert( (pIn2->flags & MEM_Dyn) == (flags2 & MEM_Dyn) ); 1576 pIn2->flags = flags2; 1577 } 1578 memcpy(&pOut->z[pIn2->n], pIn1->z, pIn1->n); 1579 assert( (pIn1->flags & MEM_Dyn) == (flags1 & MEM_Dyn) ); 1580 pIn1->flags = flags1; 1581 pOut->z[nByte]=0; 1582 pOut->z[nByte+1] = 0; 1583 pOut->z[nByte+2] = 0; 1584 pOut->flags |= MEM_Term; 1585 pOut->n = (int)nByte; 1586 pOut->enc = encoding; 1587 UPDATE_MAX_BLOBSIZE(pOut); 1588 break; 1589 } 1590 1591 /* Opcode: Add P1 P2 P3 * * 1592 ** Synopsis: r[P3]=r[P1]+r[P2] 1593 ** 1594 ** Add the value in register P1 to the value in register P2 1595 ** and store the result in register P3. 1596 ** If either input is NULL, the result is NULL. 1597 */ 1598 /* Opcode: Multiply P1 P2 P3 * * 1599 ** Synopsis: r[P3]=r[P1]*r[P2] 1600 ** 1601 ** 1602 ** Multiply the value in register P1 by the value in register P2 1603 ** and store the result in register P3. 1604 ** If either input is NULL, the result is NULL. 1605 */ 1606 /* Opcode: Subtract P1 P2 P3 * * 1607 ** Synopsis: r[P3]=r[P2]-r[P1] 1608 ** 1609 ** Subtract the value in register P1 from the value in register P2 1610 ** and store the result in register P3. 1611 ** If either input is NULL, the result is NULL. 1612 */ 1613 /* Opcode: Divide P1 P2 P3 * * 1614 ** Synopsis: r[P3]=r[P2]/r[P1] 1615 ** 1616 ** Divide the value in register P1 by the value in register P2 1617 ** and store the result in register P3 (P3=P2/P1). If the value in 1618 ** register P1 is zero, then the result is NULL. If either input is 1619 ** NULL, the result is NULL. 1620 */ 1621 /* Opcode: Remainder P1 P2 P3 * * 1622 ** Synopsis: r[P3]=r[P2]%r[P1] 1623 ** 1624 ** Compute the remainder after integer register P2 is divided by 1625 ** register P1 and store the result in register P3. 1626 ** If the value in register P1 is zero the result is NULL. 1627 ** If either operand is NULL, the result is NULL. 1628 */ 1629 case OP_Add: /* same as TK_PLUS, in1, in2, out3 */ 1630 case OP_Subtract: /* same as TK_MINUS, in1, in2, out3 */ 1631 case OP_Multiply: /* same as TK_STAR, in1, in2, out3 */ 1632 case OP_Divide: /* same as TK_SLASH, in1, in2, out3 */ 1633 case OP_Remainder: { /* same as TK_REM, in1, in2, out3 */ 1634 u16 flags; /* Combined MEM_* flags from both inputs */ 1635 u16 type1; /* Numeric type of left operand */ 1636 u16 type2; /* Numeric type of right operand */ 1637 i64 iA; /* Integer value of left operand */ 1638 i64 iB; /* Integer value of right operand */ 1639 double rA; /* Real value of left operand */ 1640 double rB; /* Real value of right operand */ 1641 1642 pIn1 = &aMem[pOp->p1]; 1643 type1 = numericType(pIn1); 1644 pIn2 = &aMem[pOp->p2]; 1645 type2 = numericType(pIn2); 1646 pOut = &aMem[pOp->p3]; 1647 flags = pIn1->flags | pIn2->flags; 1648 if( (type1 & type2 & MEM_Int)!=0 ){ 1649 iA = pIn1->u.i; 1650 iB = pIn2->u.i; 1651 switch( pOp->opcode ){ 1652 case OP_Add: if( sqlite3AddInt64(&iB,iA) ) goto fp_math; break; 1653 case OP_Subtract: if( sqlite3SubInt64(&iB,iA) ) goto fp_math; break; 1654 case OP_Multiply: if( sqlite3MulInt64(&iB,iA) ) goto fp_math; break; 1655 case OP_Divide: { 1656 if( iA==0 ) goto arithmetic_result_is_null; 1657 if( iA==-1 && iB==SMALLEST_INT64 ) goto fp_math; 1658 iB /= iA; 1659 break; 1660 } 1661 default: { 1662 if( iA==0 ) goto arithmetic_result_is_null; 1663 if( iA==-1 ) iA = 1; 1664 iB %= iA; 1665 break; 1666 } 1667 } 1668 pOut->u.i = iB; 1669 MemSetTypeFlag(pOut, MEM_Int); 1670 }else if( (flags & MEM_Null)!=0 ){ 1671 goto arithmetic_result_is_null; 1672 }else{ 1673 fp_math: 1674 rA = sqlite3VdbeRealValue(pIn1); 1675 rB = sqlite3VdbeRealValue(pIn2); 1676 switch( pOp->opcode ){ 1677 case OP_Add: rB += rA; break; 1678 case OP_Subtract: rB -= rA; break; 1679 case OP_Multiply: rB *= rA; break; 1680 case OP_Divide: { 1681 /* (double)0 In case of SQLITE_OMIT_FLOATING_POINT... */ 1682 if( rA==(double)0 ) goto arithmetic_result_is_null; 1683 rB /= rA; 1684 break; 1685 } 1686 default: { 1687 iA = sqlite3VdbeIntValue(pIn1); 1688 iB = sqlite3VdbeIntValue(pIn2); 1689 if( iA==0 ) goto arithmetic_result_is_null; 1690 if( iA==-1 ) iA = 1; 1691 rB = (double)(iB % iA); 1692 break; 1693 } 1694 } 1695 #ifdef SQLITE_OMIT_FLOATING_POINT 1696 pOut->u.i = rB; 1697 MemSetTypeFlag(pOut, MEM_Int); 1698 #else 1699 if( sqlite3IsNaN(rB) ){ 1700 goto arithmetic_result_is_null; 1701 } 1702 pOut->u.r = rB; 1703 MemSetTypeFlag(pOut, MEM_Real); 1704 #endif 1705 } 1706 break; 1707 1708 arithmetic_result_is_null: 1709 sqlite3VdbeMemSetNull(pOut); 1710 break; 1711 } 1712 1713 /* Opcode: CollSeq P1 * * P4 1714 ** 1715 ** P4 is a pointer to a CollSeq object. If the next call to a user function 1716 ** or aggregate calls sqlite3GetFuncCollSeq(), this collation sequence will 1717 ** be returned. This is used by the built-in min(), max() and nullif() 1718 ** functions. 1719 ** 1720 ** If P1 is not zero, then it is a register that a subsequent min() or 1721 ** max() aggregate will set to 1 if the current row is not the minimum or 1722 ** maximum. The P1 register is initialized to 0 by this instruction. 1723 ** 1724 ** The interface used by the implementation of the aforementioned functions 1725 ** to retrieve the collation sequence set by this opcode is not available 1726 ** publicly. Only built-in functions have access to this feature. 1727 */ 1728 case OP_CollSeq: { 1729 assert( pOp->p4type==P4_COLLSEQ ); 1730 if( pOp->p1 ){ 1731 sqlite3VdbeMemSetInt64(&aMem[pOp->p1], 0); 1732 } 1733 break; 1734 } 1735 1736 /* Opcode: BitAnd P1 P2 P3 * * 1737 ** Synopsis: r[P3]=r[P1]&r[P2] 1738 ** 1739 ** Take the bit-wise AND of the values in register P1 and P2 and 1740 ** store the result in register P3. 1741 ** If either input is NULL, the result is NULL. 1742 */ 1743 /* Opcode: BitOr P1 P2 P3 * * 1744 ** Synopsis: r[P3]=r[P1]|r[P2] 1745 ** 1746 ** Take the bit-wise OR of the values in register P1 and P2 and 1747 ** store the result in register P3. 1748 ** If either input is NULL, the result is NULL. 1749 */ 1750 /* Opcode: ShiftLeft P1 P2 P3 * * 1751 ** Synopsis: r[P3]=r[P2]<<r[P1] 1752 ** 1753 ** Shift the integer value in register P2 to the left by the 1754 ** number of bits specified by the integer in register P1. 1755 ** Store the result in register P3. 1756 ** If either input is NULL, the result is NULL. 1757 */ 1758 /* Opcode: ShiftRight P1 P2 P3 * * 1759 ** Synopsis: r[P3]=r[P2]>>r[P1] 1760 ** 1761 ** Shift the integer value in register P2 to the right by the 1762 ** number of bits specified by the integer in register P1. 1763 ** Store the result in register P3. 1764 ** If either input is NULL, the result is NULL. 1765 */ 1766 case OP_BitAnd: /* same as TK_BITAND, in1, in2, out3 */ 1767 case OP_BitOr: /* same as TK_BITOR, in1, in2, out3 */ 1768 case OP_ShiftLeft: /* same as TK_LSHIFT, in1, in2, out3 */ 1769 case OP_ShiftRight: { /* same as TK_RSHIFT, in1, in2, out3 */ 1770 i64 iA; 1771 u64 uA; 1772 i64 iB; 1773 u8 op; 1774 1775 pIn1 = &aMem[pOp->p1]; 1776 pIn2 = &aMem[pOp->p2]; 1777 pOut = &aMem[pOp->p3]; 1778 if( (pIn1->flags | pIn2->flags) & MEM_Null ){ 1779 sqlite3VdbeMemSetNull(pOut); 1780 break; 1781 } 1782 iA = sqlite3VdbeIntValue(pIn2); 1783 iB = sqlite3VdbeIntValue(pIn1); 1784 op = pOp->opcode; 1785 if( op==OP_BitAnd ){ 1786 iA &= iB; 1787 }else if( op==OP_BitOr ){ 1788 iA |= iB; 1789 }else if( iB!=0 ){ 1790 assert( op==OP_ShiftRight || op==OP_ShiftLeft ); 1791 1792 /* If shifting by a negative amount, shift in the other direction */ 1793 if( iB<0 ){ 1794 assert( OP_ShiftRight==OP_ShiftLeft+1 ); 1795 op = 2*OP_ShiftLeft + 1 - op; 1796 iB = iB>(-64) ? -iB : 64; 1797 } 1798 1799 if( iB>=64 ){ 1800 iA = (iA>=0 || op==OP_ShiftLeft) ? 0 : -1; 1801 }else{ 1802 memcpy(&uA, &iA, sizeof(uA)); 1803 if( op==OP_ShiftLeft ){ 1804 uA <<= iB; 1805 }else{ 1806 uA >>= iB; 1807 /* Sign-extend on a right shift of a negative number */ 1808 if( iA<0 ) uA |= ((((u64)0xffffffff)<<32)|0xffffffff) << (64-iB); 1809 } 1810 memcpy(&iA, &uA, sizeof(iA)); 1811 } 1812 } 1813 pOut->u.i = iA; 1814 MemSetTypeFlag(pOut, MEM_Int); 1815 break; 1816 } 1817 1818 /* Opcode: AddImm P1 P2 * * * 1819 ** Synopsis: r[P1]=r[P1]+P2 1820 ** 1821 ** Add the constant P2 to the value in register P1. 1822 ** The result is always an integer. 1823 ** 1824 ** To force any register to be an integer, just add 0. 1825 */ 1826 case OP_AddImm: { /* in1 */ 1827 pIn1 = &aMem[pOp->p1]; 1828 memAboutToChange(p, pIn1); 1829 sqlite3VdbeMemIntegerify(pIn1); 1830 pIn1->u.i += pOp->p2; 1831 break; 1832 } 1833 1834 /* Opcode: MustBeInt P1 P2 * * * 1835 ** 1836 ** Force the value in register P1 to be an integer. If the value 1837 ** in P1 is not an integer and cannot be converted into an integer 1838 ** without data loss, then jump immediately to P2, or if P2==0 1839 ** raise an SQLITE_MISMATCH exception. 1840 */ 1841 case OP_MustBeInt: { /* jump, in1 */ 1842 pIn1 = &aMem[pOp->p1]; 1843 if( (pIn1->flags & MEM_Int)==0 ){ 1844 applyAffinity(pIn1, SQLITE_AFF_NUMERIC, encoding); 1845 if( (pIn1->flags & MEM_Int)==0 ){ 1846 VdbeBranchTaken(1, 2); 1847 if( pOp->p2==0 ){ 1848 rc = SQLITE_MISMATCH; 1849 goto abort_due_to_error; 1850 }else{ 1851 goto jump_to_p2; 1852 } 1853 } 1854 } 1855 VdbeBranchTaken(0, 2); 1856 MemSetTypeFlag(pIn1, MEM_Int); 1857 break; 1858 } 1859 1860 #ifndef SQLITE_OMIT_FLOATING_POINT 1861 /* Opcode: RealAffinity P1 * * * * 1862 ** 1863 ** If register P1 holds an integer convert it to a real value. 1864 ** 1865 ** This opcode is used when extracting information from a column that 1866 ** has REAL affinity. Such column values may still be stored as 1867 ** integers, for space efficiency, but after extraction we want them 1868 ** to have only a real value. 1869 */ 1870 case OP_RealAffinity: { /* in1 */ 1871 pIn1 = &aMem[pOp->p1]; 1872 if( pIn1->flags & (MEM_Int|MEM_IntReal) ){ 1873 testcase( pIn1->flags & MEM_Int ); 1874 testcase( pIn1->flags & MEM_IntReal ); 1875 sqlite3VdbeMemRealify(pIn1); 1876 REGISTER_TRACE(pOp->p1, pIn1); 1877 } 1878 break; 1879 } 1880 #endif 1881 1882 #ifndef SQLITE_OMIT_CAST 1883 /* Opcode: Cast P1 P2 * * * 1884 ** Synopsis: affinity(r[P1]) 1885 ** 1886 ** Force the value in register P1 to be the type defined by P2. 1887 ** 1888 ** <ul> 1889 ** <li> P2=='A' → BLOB 1890 ** <li> P2=='B' → TEXT 1891 ** <li> P2=='C' → NUMERIC 1892 ** <li> P2=='D' → INTEGER 1893 ** <li> P2=='E' → REAL 1894 ** </ul> 1895 ** 1896 ** A NULL value is not changed by this routine. It remains NULL. 1897 */ 1898 case OP_Cast: { /* in1 */ 1899 assert( pOp->p2>=SQLITE_AFF_BLOB && pOp->p2<=SQLITE_AFF_REAL ); 1900 testcase( pOp->p2==SQLITE_AFF_TEXT ); 1901 testcase( pOp->p2==SQLITE_AFF_BLOB ); 1902 testcase( pOp->p2==SQLITE_AFF_NUMERIC ); 1903 testcase( pOp->p2==SQLITE_AFF_INTEGER ); 1904 testcase( pOp->p2==SQLITE_AFF_REAL ); 1905 pIn1 = &aMem[pOp->p1]; 1906 memAboutToChange(p, pIn1); 1907 rc = ExpandBlob(pIn1); 1908 if( rc ) goto abort_due_to_error; 1909 rc = sqlite3VdbeMemCast(pIn1, pOp->p2, encoding); 1910 if( rc ) goto abort_due_to_error; 1911 UPDATE_MAX_BLOBSIZE(pIn1); 1912 REGISTER_TRACE(pOp->p1, pIn1); 1913 break; 1914 } 1915 #endif /* SQLITE_OMIT_CAST */ 1916 1917 /* Opcode: Eq P1 P2 P3 P4 P5 1918 ** Synopsis: IF r[P3]==r[P1] 1919 ** 1920 ** Compare the values in register P1 and P3. If reg(P3)==reg(P1) then 1921 ** jump to address P2. 1922 ** 1923 ** The SQLITE_AFF_MASK portion of P5 must be an affinity character - 1924 ** SQLITE_AFF_TEXT, SQLITE_AFF_INTEGER, and so forth. An attempt is made 1925 ** to coerce both inputs according to this affinity before the 1926 ** comparison is made. If the SQLITE_AFF_MASK is 0x00, then numeric 1927 ** affinity is used. Note that the affinity conversions are stored 1928 ** back into the input registers P1 and P3. So this opcode can cause 1929 ** persistent changes to registers P1 and P3. 1930 ** 1931 ** Once any conversions have taken place, and neither value is NULL, 1932 ** the values are compared. If both values are blobs then memcmp() is 1933 ** used to determine the results of the comparison. If both values 1934 ** are text, then the appropriate collating function specified in 1935 ** P4 is used to do the comparison. If P4 is not specified then 1936 ** memcmp() is used to compare text string. If both values are 1937 ** numeric, then a numeric comparison is used. If the two values 1938 ** are of different types, then numbers are considered less than 1939 ** strings and strings are considered less than blobs. 1940 ** 1941 ** If SQLITE_NULLEQ is set in P5 then the result of comparison is always either 1942 ** true or false and is never NULL. If both operands are NULL then the result 1943 ** of comparison is true. If either operand is NULL then the result is false. 1944 ** If neither operand is NULL the result is the same as it would be if 1945 ** the SQLITE_NULLEQ flag were omitted from P5. 1946 ** 1947 ** This opcode saves the result of comparison for use by the new 1948 ** OP_Jump opcode. 1949 */ 1950 /* Opcode: Ne P1 P2 P3 P4 P5 1951 ** Synopsis: IF r[P3]!=r[P1] 1952 ** 1953 ** This works just like the Eq opcode except that the jump is taken if 1954 ** the operands in registers P1 and P3 are not equal. See the Eq opcode for 1955 ** additional information. 1956 */ 1957 /* Opcode: Lt P1 P2 P3 P4 P5 1958 ** Synopsis: IF r[P3]<r[P1] 1959 ** 1960 ** Compare the values in register P1 and P3. If reg(P3)<reg(P1) then 1961 ** jump to address P2. 1962 ** 1963 ** If the SQLITE_JUMPIFNULL bit of P5 is set and either reg(P1) or 1964 ** reg(P3) is NULL then the take the jump. If the SQLITE_JUMPIFNULL 1965 ** bit is clear then fall through if either operand is NULL. 1966 ** 1967 ** The SQLITE_AFF_MASK portion of P5 must be an affinity character - 1968 ** SQLITE_AFF_TEXT, SQLITE_AFF_INTEGER, and so forth. An attempt is made 1969 ** to coerce both inputs according to this affinity before the 1970 ** comparison is made. If the SQLITE_AFF_MASK is 0x00, then numeric 1971 ** affinity is used. Note that the affinity conversions are stored 1972 ** back into the input registers P1 and P3. So this opcode can cause 1973 ** persistent changes to registers P1 and P3. 1974 ** 1975 ** Once any conversions have taken place, and neither value is NULL, 1976 ** the values are compared. If both values are blobs then memcmp() is 1977 ** used to determine the results of the comparison. If both values 1978 ** are text, then the appropriate collating function specified in 1979 ** P4 is used to do the comparison. If P4 is not specified then 1980 ** memcmp() is used to compare text string. If both values are 1981 ** numeric, then a numeric comparison is used. If the two values 1982 ** are of different types, then numbers are considered less than 1983 ** strings and strings are considered less than blobs. 1984 ** 1985 ** This opcode saves the result of comparison for use by the new 1986 ** OP_Jump opcode. 1987 */ 1988 /* Opcode: Le P1 P2 P3 P4 P5 1989 ** Synopsis: IF r[P3]<=r[P1] 1990 ** 1991 ** This works just like the Lt opcode except that the jump is taken if 1992 ** the content of register P3 is less than or equal to the content of 1993 ** register P1. See the Lt opcode for additional information. 1994 */ 1995 /* Opcode: Gt P1 P2 P3 P4 P5 1996 ** Synopsis: IF r[P3]>r[P1] 1997 ** 1998 ** This works just like the Lt opcode except that the jump is taken if 1999 ** the content of register P3 is greater than the content of 2000 ** register P1. See the Lt opcode for additional information. 2001 */ 2002 /* Opcode: Ge P1 P2 P3 P4 P5 2003 ** Synopsis: IF r[P3]>=r[P1] 2004 ** 2005 ** This works just like the Lt opcode except that the jump is taken if 2006 ** the content of register P3 is greater than or equal to the content of 2007 ** register P1. See the Lt opcode for additional information. 2008 */ 2009 case OP_Eq: /* same as TK_EQ, jump, in1, in3 */ 2010 case OP_Ne: /* same as TK_NE, jump, in1, in3 */ 2011 case OP_Lt: /* same as TK_LT, jump, in1, in3 */ 2012 case OP_Le: /* same as TK_LE, jump, in1, in3 */ 2013 case OP_Gt: /* same as TK_GT, jump, in1, in3 */ 2014 case OP_Ge: { /* same as TK_GE, jump, in1, in3 */ 2015 int res, res2; /* Result of the comparison of pIn1 against pIn3 */ 2016 char affinity; /* Affinity to use for comparison */ 2017 u16 flags1; /* Copy of initial value of pIn1->flags */ 2018 u16 flags3; /* Copy of initial value of pIn3->flags */ 2019 2020 pIn1 = &aMem[pOp->p1]; 2021 pIn3 = &aMem[pOp->p3]; 2022 flags1 = pIn1->flags; 2023 flags3 = pIn3->flags; 2024 if( (flags1 | flags3)&MEM_Null ){ 2025 /* One or both operands are NULL */ 2026 if( pOp->p5 & SQLITE_NULLEQ ){ 2027 /* If SQLITE_NULLEQ is set (which will only happen if the operator is 2028 ** OP_Eq or OP_Ne) then take the jump or not depending on whether 2029 ** or not both operands are null. 2030 */ 2031 assert( (flags1 & MEM_Cleared)==0 ); 2032 assert( (pOp->p5 & SQLITE_JUMPIFNULL)==0 || CORRUPT_DB ); 2033 testcase( (pOp->p5 & SQLITE_JUMPIFNULL)!=0 ); 2034 if( (flags1&flags3&MEM_Null)!=0 2035 && (flags3&MEM_Cleared)==0 2036 ){ 2037 res = 0; /* Operands are equal */ 2038 }else{ 2039 res = ((flags3 & MEM_Null) ? -1 : +1); /* Operands are not equal */ 2040 } 2041 }else{ 2042 /* SQLITE_NULLEQ is clear and at least one operand is NULL, 2043 ** then the result is always NULL. 2044 ** The jump is taken if the SQLITE_JUMPIFNULL bit is set. 2045 */ 2046 iCompare = 1; /* Operands are not equal */ 2047 VdbeBranchTaken(2,3); 2048 if( pOp->p5 & SQLITE_JUMPIFNULL ){ 2049 goto jump_to_p2; 2050 } 2051 break; 2052 } 2053 }else{ 2054 /* Neither operand is NULL. Do a comparison. */ 2055 affinity = pOp->p5 & SQLITE_AFF_MASK; 2056 if( affinity>=SQLITE_AFF_NUMERIC ){ 2057 if( (flags1 | flags3)&MEM_Str ){ 2058 if( (flags1 & (MEM_Int|MEM_IntReal|MEM_Real|MEM_Str))==MEM_Str ){ 2059 applyNumericAffinity(pIn1,0); 2060 testcase( flags3==pIn3->flags ); 2061 flags3 = pIn3->flags; 2062 } 2063 if( (flags3 & (MEM_Int|MEM_IntReal|MEM_Real|MEM_Str))==MEM_Str ){ 2064 applyNumericAffinity(pIn3,0); 2065 } 2066 } 2067 /* Handle the common case of integer comparison here, as an 2068 ** optimization, to avoid a call to sqlite3MemCompare() */ 2069 if( (pIn1->flags & pIn3->flags & MEM_Int)!=0 ){ 2070 if( pIn3->u.i > pIn1->u.i ){ res = +1; goto compare_op; } 2071 if( pIn3->u.i < pIn1->u.i ){ res = -1; goto compare_op; } 2072 res = 0; 2073 goto compare_op; 2074 } 2075 }else if( affinity==SQLITE_AFF_TEXT ){ 2076 if( (flags1 & MEM_Str)==0 && (flags1&(MEM_Int|MEM_Real|MEM_IntReal))!=0 ){ 2077 testcase( pIn1->flags & MEM_Int ); 2078 testcase( pIn1->flags & MEM_Real ); 2079 testcase( pIn1->flags & MEM_IntReal ); 2080 sqlite3VdbeMemStringify(pIn1, encoding, 1); 2081 testcase( (flags1&MEM_Dyn) != (pIn1->flags&MEM_Dyn) ); 2082 flags1 = (pIn1->flags & ~MEM_TypeMask) | (flags1 & MEM_TypeMask); 2083 if( NEVER(pIn1==pIn3) ) flags3 = flags1 | MEM_Str; 2084 } 2085 if( (flags3 & MEM_Str)==0 && (flags3&(MEM_Int|MEM_Real|MEM_IntReal))!=0 ){ 2086 testcase( pIn3->flags & MEM_Int ); 2087 testcase( pIn3->flags & MEM_Real ); 2088 testcase( pIn3->flags & MEM_IntReal ); 2089 sqlite3VdbeMemStringify(pIn3, encoding, 1); 2090 testcase( (flags3&MEM_Dyn) != (pIn3->flags&MEM_Dyn) ); 2091 flags3 = (pIn3->flags & ~MEM_TypeMask) | (flags3 & MEM_TypeMask); 2092 } 2093 } 2094 assert( pOp->p4type==P4_COLLSEQ || pOp->p4.pColl==0 ); 2095 res = sqlite3MemCompare(pIn3, pIn1, pOp->p4.pColl); 2096 } 2097 compare_op: 2098 /* At this point, res is negative, zero, or positive if reg[P1] is 2099 ** less than, equal to, or greater than reg[P3], respectively. Compute 2100 ** the answer to this operator in res2, depending on what the comparison 2101 ** operator actually is. The next block of code depends on the fact 2102 ** that the 6 comparison operators are consecutive integers in this 2103 ** order: NE, EQ, GT, LE, LT, GE */ 2104 assert( OP_Eq==OP_Ne+1 ); assert( OP_Gt==OP_Ne+2 ); assert( OP_Le==OP_Ne+3 ); 2105 assert( OP_Lt==OP_Ne+4 ); assert( OP_Ge==OP_Ne+5 ); 2106 if( res<0 ){ 2107 res2 = sqlite3aLTb[pOp->opcode]; 2108 }else if( res==0 ){ 2109 res2 = sqlite3aEQb[pOp->opcode]; 2110 }else{ 2111 res2 = sqlite3aGTb[pOp->opcode]; 2112 } 2113 iCompare = res; 2114 2115 /* Undo any changes made by applyAffinity() to the input registers. */ 2116 assert( (pIn3->flags & MEM_Dyn) == (flags3 & MEM_Dyn) ); 2117 pIn3->flags = flags3; 2118 assert( (pIn1->flags & MEM_Dyn) == (flags1 & MEM_Dyn) ); 2119 pIn1->flags = flags1; 2120 2121 VdbeBranchTaken(res2!=0, (pOp->p5 & SQLITE_NULLEQ)?2:3); 2122 if( res2 ){ 2123 goto jump_to_p2; 2124 } 2125 break; 2126 } 2127 2128 /* Opcode: ElseEq * P2 * * * 2129 ** 2130 ** This opcode must follow an OP_Lt or OP_Gt comparison operator. There 2131 ** can be zero or more OP_ReleaseReg opcodes intervening, but no other 2132 ** opcodes are allowed to occur between this instruction and the previous 2133 ** OP_Lt or OP_Gt. 2134 ** 2135 ** If result of an OP_Eq comparison on the same two operands as the 2136 ** prior OP_Lt or OP_Gt would have been true, then jump to P2. 2137 ** If the result of an OP_Eq comparison on the two previous 2138 ** operands would have been false or NULL, then fall through. 2139 */ 2140 case OP_ElseEq: { /* same as TK_ESCAPE, jump */ 2141 2142 #ifdef SQLITE_DEBUG 2143 /* Verify the preconditions of this opcode - that it follows an OP_Lt or 2144 ** OP_Gt with zero or more intervening OP_ReleaseReg opcodes */ 2145 int iAddr; 2146 for(iAddr = (int)(pOp - aOp) - 1; ALWAYS(iAddr>=0); iAddr--){ 2147 if( aOp[iAddr].opcode==OP_ReleaseReg ) continue; 2148 assert( aOp[iAddr].opcode==OP_Lt || aOp[iAddr].opcode==OP_Gt ); 2149 break; 2150 } 2151 #endif /* SQLITE_DEBUG */ 2152 VdbeBranchTaken(iCompare==0, 2); 2153 if( iCompare==0 ) goto jump_to_p2; 2154 break; 2155 } 2156 2157 2158 /* Opcode: Permutation * * * P4 * 2159 ** 2160 ** Set the permutation used by the OP_Compare operator in the next 2161 ** instruction. The permutation is stored in the P4 operand. 2162 ** 2163 ** The permutation is only valid until the next OP_Compare that has 2164 ** the OPFLAG_PERMUTE bit set in P5. Typically the OP_Permutation should 2165 ** occur immediately prior to the OP_Compare. 2166 ** 2167 ** The first integer in the P4 integer array is the length of the array 2168 ** and does not become part of the permutation. 2169 */ 2170 case OP_Permutation: { 2171 assert( pOp->p4type==P4_INTARRAY ); 2172 assert( pOp->p4.ai ); 2173 assert( pOp[1].opcode==OP_Compare ); 2174 assert( pOp[1].p5 & OPFLAG_PERMUTE ); 2175 break; 2176 } 2177 2178 /* Opcode: Compare P1 P2 P3 P4 P5 2179 ** Synopsis: r[P1@P3] <-> r[P2@P3] 2180 ** 2181 ** Compare two vectors of registers in reg(P1)..reg(P1+P3-1) (call this 2182 ** vector "A") and in reg(P2)..reg(P2+P3-1) ("B"). Save the result of 2183 ** the comparison for use by the next OP_Jump instruct. 2184 ** 2185 ** If P5 has the OPFLAG_PERMUTE bit set, then the order of comparison is 2186 ** determined by the most recent OP_Permutation operator. If the 2187 ** OPFLAG_PERMUTE bit is clear, then register are compared in sequential 2188 ** order. 2189 ** 2190 ** P4 is a KeyInfo structure that defines collating sequences and sort 2191 ** orders for the comparison. The permutation applies to registers 2192 ** only. The KeyInfo elements are used sequentially. 2193 ** 2194 ** The comparison is a sort comparison, so NULLs compare equal, 2195 ** NULLs are less than numbers, numbers are less than strings, 2196 ** and strings are less than blobs. 2197 */ 2198 case OP_Compare: { 2199 int n; 2200 int i; 2201 int p1; 2202 int p2; 2203 const KeyInfo *pKeyInfo; 2204 u32 idx; 2205 CollSeq *pColl; /* Collating sequence to use on this term */ 2206 int bRev; /* True for DESCENDING sort order */ 2207 u32 *aPermute; /* The permutation */ 2208 2209 if( (pOp->p5 & OPFLAG_PERMUTE)==0 ){ 2210 aPermute = 0; 2211 }else{ 2212 assert( pOp>aOp ); 2213 assert( pOp[-1].opcode==OP_Permutation ); 2214 assert( pOp[-1].p4type==P4_INTARRAY ); 2215 aPermute = pOp[-1].p4.ai + 1; 2216 assert( aPermute!=0 ); 2217 } 2218 n = pOp->p3; 2219 pKeyInfo = pOp->p4.pKeyInfo; 2220 assert( n>0 ); 2221 assert( pKeyInfo!=0 ); 2222 p1 = pOp->p1; 2223 p2 = pOp->p2; 2224 #ifdef SQLITE_DEBUG 2225 if( aPermute ){ 2226 int k, mx = 0; 2227 for(k=0; k<n; k++) if( aPermute[k]>(u32)mx ) mx = aPermute[k]; 2228 assert( p1>0 && p1+mx<=(p->nMem+1 - p->nCursor)+1 ); 2229 assert( p2>0 && p2+mx<=(p->nMem+1 - p->nCursor)+1 ); 2230 }else{ 2231 assert( p1>0 && p1+n<=(p->nMem+1 - p->nCursor)+1 ); 2232 assert( p2>0 && p2+n<=(p->nMem+1 - p->nCursor)+1 ); 2233 } 2234 #endif /* SQLITE_DEBUG */ 2235 for(i=0; i<n; i++){ 2236 idx = aPermute ? aPermute[i] : (u32)i; 2237 assert( memIsValid(&aMem[p1+idx]) ); 2238 assert( memIsValid(&aMem[p2+idx]) ); 2239 REGISTER_TRACE(p1+idx, &aMem[p1+idx]); 2240 REGISTER_TRACE(p2+idx, &aMem[p2+idx]); 2241 assert( i<pKeyInfo->nKeyField ); 2242 pColl = pKeyInfo->aColl[i]; 2243 bRev = (pKeyInfo->aSortFlags[i] & KEYINFO_ORDER_DESC); 2244 iCompare = sqlite3MemCompare(&aMem[p1+idx], &aMem[p2+idx], pColl); 2245 if( iCompare ){ 2246 if( (pKeyInfo->aSortFlags[i] & KEYINFO_ORDER_BIGNULL) 2247 && ((aMem[p1+idx].flags & MEM_Null) || (aMem[p2+idx].flags & MEM_Null)) 2248 ){ 2249 iCompare = -iCompare; 2250 } 2251 if( bRev ) iCompare = -iCompare; 2252 break; 2253 } 2254 } 2255 break; 2256 } 2257 2258 /* Opcode: Jump P1 P2 P3 * * 2259 ** 2260 ** Jump to the instruction at address P1, P2, or P3 depending on whether 2261 ** in the most recent OP_Compare instruction the P1 vector was less than 2262 ** equal to, or greater than the P2 vector, respectively. 2263 */ 2264 case OP_Jump: { /* jump */ 2265 if( iCompare<0 ){ 2266 VdbeBranchTaken(0,4); pOp = &aOp[pOp->p1 - 1]; 2267 }else if( iCompare==0 ){ 2268 VdbeBranchTaken(1,4); pOp = &aOp[pOp->p2 - 1]; 2269 }else{ 2270 VdbeBranchTaken(2,4); pOp = &aOp[pOp->p3 - 1]; 2271 } 2272 break; 2273 } 2274 2275 /* Opcode: And P1 P2 P3 * * 2276 ** Synopsis: r[P3]=(r[P1] && r[P2]) 2277 ** 2278 ** Take the logical AND of the values in registers P1 and P2 and 2279 ** write the result into register P3. 2280 ** 2281 ** If either P1 or P2 is 0 (false) then the result is 0 even if 2282 ** the other input is NULL. A NULL and true or two NULLs give 2283 ** a NULL output. 2284 */ 2285 /* Opcode: Or P1 P2 P3 * * 2286 ** Synopsis: r[P3]=(r[P1] || r[P2]) 2287 ** 2288 ** Take the logical OR of the values in register P1 and P2 and 2289 ** store the answer in register P3. 2290 ** 2291 ** If either P1 or P2 is nonzero (true) then the result is 1 (true) 2292 ** even if the other input is NULL. A NULL and false or two NULLs 2293 ** give a NULL output. 2294 */ 2295 case OP_And: /* same as TK_AND, in1, in2, out3 */ 2296 case OP_Or: { /* same as TK_OR, in1, in2, out3 */ 2297 int v1; /* Left operand: 0==FALSE, 1==TRUE, 2==UNKNOWN or NULL */ 2298 int v2; /* Right operand: 0==FALSE, 1==TRUE, 2==UNKNOWN or NULL */ 2299 2300 v1 = sqlite3VdbeBooleanValue(&aMem[pOp->p1], 2); 2301 v2 = sqlite3VdbeBooleanValue(&aMem[pOp->p2], 2); 2302 if( pOp->opcode==OP_And ){ 2303 static const unsigned char and_logic[] = { 0, 0, 0, 0, 1, 2, 0, 2, 2 }; 2304 v1 = and_logic[v1*3+v2]; 2305 }else{ 2306 static const unsigned char or_logic[] = { 0, 1, 2, 1, 1, 1, 2, 1, 2 }; 2307 v1 = or_logic[v1*3+v2]; 2308 } 2309 pOut = &aMem[pOp->p3]; 2310 if( v1==2 ){ 2311 MemSetTypeFlag(pOut, MEM_Null); 2312 }else{ 2313 pOut->u.i = v1; 2314 MemSetTypeFlag(pOut, MEM_Int); 2315 } 2316 break; 2317 } 2318 2319 /* Opcode: IsTrue P1 P2 P3 P4 * 2320 ** Synopsis: r[P2] = coalesce(r[P1]==TRUE,P3) ^ P4 2321 ** 2322 ** This opcode implements the IS TRUE, IS FALSE, IS NOT TRUE, and 2323 ** IS NOT FALSE operators. 2324 ** 2325 ** Interpret the value in register P1 as a boolean value. Store that 2326 ** boolean (a 0 or 1) in register P2. Or if the value in register P1 is 2327 ** NULL, then the P3 is stored in register P2. Invert the answer if P4 2328 ** is 1. 2329 ** 2330 ** The logic is summarized like this: 2331 ** 2332 ** <ul> 2333 ** <li> If P3==0 and P4==0 then r[P2] := r[P1] IS TRUE 2334 ** <li> If P3==1 and P4==1 then r[P2] := r[P1] IS FALSE 2335 ** <li> If P3==0 and P4==1 then r[P2] := r[P1] IS NOT TRUE 2336 ** <li> If P3==1 and P4==0 then r[P2] := r[P1] IS NOT FALSE 2337 ** </ul> 2338 */ 2339 case OP_IsTrue: { /* in1, out2 */ 2340 assert( pOp->p4type==P4_INT32 ); 2341 assert( pOp->p4.i==0 || pOp->p4.i==1 ); 2342 assert( pOp->p3==0 || pOp->p3==1 ); 2343 sqlite3VdbeMemSetInt64(&aMem[pOp->p2], 2344 sqlite3VdbeBooleanValue(&aMem[pOp->p1], pOp->p3) ^ pOp->p4.i); 2345 break; 2346 } 2347 2348 /* Opcode: Not P1 P2 * * * 2349 ** Synopsis: r[P2]= !r[P1] 2350 ** 2351 ** Interpret the value in register P1 as a boolean value. Store the 2352 ** boolean complement in register P2. If the value in register P1 is 2353 ** NULL, then a NULL is stored in P2. 2354 */ 2355 case OP_Not: { /* same as TK_NOT, in1, out2 */ 2356 pIn1 = &aMem[pOp->p1]; 2357 pOut = &aMem[pOp->p2]; 2358 if( (pIn1->flags & MEM_Null)==0 ){ 2359 sqlite3VdbeMemSetInt64(pOut, !sqlite3VdbeBooleanValue(pIn1,0)); 2360 }else{ 2361 sqlite3VdbeMemSetNull(pOut); 2362 } 2363 break; 2364 } 2365 2366 /* Opcode: BitNot P1 P2 * * * 2367 ** Synopsis: r[P2]= ~r[P1] 2368 ** 2369 ** Interpret the content of register P1 as an integer. Store the 2370 ** ones-complement of the P1 value into register P2. If P1 holds 2371 ** a NULL then store a NULL in P2. 2372 */ 2373 case OP_BitNot: { /* same as TK_BITNOT, in1, out2 */ 2374 pIn1 = &aMem[pOp->p1]; 2375 pOut = &aMem[pOp->p2]; 2376 sqlite3VdbeMemSetNull(pOut); 2377 if( (pIn1->flags & MEM_Null)==0 ){ 2378 pOut->flags = MEM_Int; 2379 pOut->u.i = ~sqlite3VdbeIntValue(pIn1); 2380 } 2381 break; 2382 } 2383 2384 /* Opcode: Once P1 P2 * * * 2385 ** 2386 ** Fall through to the next instruction the first time this opcode is 2387 ** encountered on each invocation of the byte-code program. Jump to P2 2388 ** on the second and all subsequent encounters during the same invocation. 2389 ** 2390 ** Top-level programs determine first invocation by comparing the P1 2391 ** operand against the P1 operand on the OP_Init opcode at the beginning 2392 ** of the program. If the P1 values differ, then fall through and make 2393 ** the P1 of this opcode equal to the P1 of OP_Init. If P1 values are 2394 ** the same then take the jump. 2395 ** 2396 ** For subprograms, there is a bitmask in the VdbeFrame that determines 2397 ** whether or not the jump should be taken. The bitmask is necessary 2398 ** because the self-altering code trick does not work for recursive 2399 ** triggers. 2400 */ 2401 case OP_Once: { /* jump */ 2402 u32 iAddr; /* Address of this instruction */ 2403 assert( p->aOp[0].opcode==OP_Init ); 2404 if( p->pFrame ){ 2405 iAddr = (int)(pOp - p->aOp); 2406 if( (p->pFrame->aOnce[iAddr/8] & (1<<(iAddr & 7)))!=0 ){ 2407 VdbeBranchTaken(1, 2); 2408 goto jump_to_p2; 2409 } 2410 p->pFrame->aOnce[iAddr/8] |= 1<<(iAddr & 7); 2411 }else{ 2412 if( p->aOp[0].p1==pOp->p1 ){ 2413 VdbeBranchTaken(1, 2); 2414 goto jump_to_p2; 2415 } 2416 } 2417 VdbeBranchTaken(0, 2); 2418 pOp->p1 = p->aOp[0].p1; 2419 break; 2420 } 2421 2422 /* Opcode: If P1 P2 P3 * * 2423 ** 2424 ** Jump to P2 if the value in register P1 is true. The value 2425 ** is considered true if it is numeric and non-zero. If the value 2426 ** in P1 is NULL then take the jump if and only if P3 is non-zero. 2427 */ 2428 case OP_If: { /* jump, in1 */ 2429 int c; 2430 c = sqlite3VdbeBooleanValue(&aMem[pOp->p1], pOp->p3); 2431 VdbeBranchTaken(c!=0, 2); 2432 if( c ) goto jump_to_p2; 2433 break; 2434 } 2435 2436 /* Opcode: IfNot P1 P2 P3 * * 2437 ** 2438 ** Jump to P2 if the value in register P1 is False. The value 2439 ** is considered false if it has a numeric value of zero. If the value 2440 ** in P1 is NULL then take the jump if and only if P3 is non-zero. 2441 */ 2442 case OP_IfNot: { /* jump, in1 */ 2443 int c; 2444 c = !sqlite3VdbeBooleanValue(&aMem[pOp->p1], !pOp->p3); 2445 VdbeBranchTaken(c!=0, 2); 2446 if( c ) goto jump_to_p2; 2447 break; 2448 } 2449 2450 /* Opcode: IsNull P1 P2 * * * 2451 ** Synopsis: if r[P1]==NULL goto P2 2452 ** 2453 ** Jump to P2 if the value in register P1 is NULL. 2454 */ 2455 case OP_IsNull: { /* same as TK_ISNULL, jump, in1 */ 2456 pIn1 = &aMem[pOp->p1]; 2457 VdbeBranchTaken( (pIn1->flags & MEM_Null)!=0, 2); 2458 if( (pIn1->flags & MEM_Null)!=0 ){ 2459 goto jump_to_p2; 2460 } 2461 break; 2462 } 2463 2464 /* Opcode: ZeroOrNull P1 P2 P3 * * 2465 ** Synopsis: r[P2] = 0 OR NULL 2466 ** 2467 ** If all both registers P1 and P3 are NOT NULL, then store a zero in 2468 ** register P2. If either registers P1 or P3 are NULL then put 2469 ** a NULL in register P2. 2470 */ 2471 case OP_ZeroOrNull: { /* in1, in2, out2, in3 */ 2472 if( (aMem[pOp->p1].flags & MEM_Null)!=0 2473 || (aMem[pOp->p3].flags & MEM_Null)!=0 2474 ){ 2475 sqlite3VdbeMemSetNull(aMem + pOp->p2); 2476 }else{ 2477 sqlite3VdbeMemSetInt64(aMem + pOp->p2, 0); 2478 } 2479 break; 2480 } 2481 2482 /* Opcode: NotNull P1 P2 * * * 2483 ** Synopsis: if r[P1]!=NULL goto P2 2484 ** 2485 ** Jump to P2 if the value in register P1 is not NULL. 2486 */ 2487 case OP_NotNull: { /* same as TK_NOTNULL, jump, in1 */ 2488 pIn1 = &aMem[pOp->p1]; 2489 VdbeBranchTaken( (pIn1->flags & MEM_Null)==0, 2); 2490 if( (pIn1->flags & MEM_Null)==0 ){ 2491 goto jump_to_p2; 2492 } 2493 break; 2494 } 2495 2496 /* Opcode: IfNullRow P1 P2 P3 * * 2497 ** Synopsis: if P1.nullRow then r[P3]=NULL, goto P2 2498 ** 2499 ** Check the cursor P1 to see if it is currently pointing at a NULL row. 2500 ** If it is, then set register P3 to NULL and jump immediately to P2. 2501 ** If P1 is not on a NULL row, then fall through without making any 2502 ** changes. 2503 */ 2504 case OP_IfNullRow: { /* jump */ 2505 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 2506 assert( p->apCsr[pOp->p1]!=0 ); 2507 if( p->apCsr[pOp->p1]->nullRow ){ 2508 sqlite3VdbeMemSetNull(aMem + pOp->p3); 2509 goto jump_to_p2; 2510 } 2511 break; 2512 } 2513 2514 #ifdef SQLITE_ENABLE_OFFSET_SQL_FUNC 2515 /* Opcode: Offset P1 P2 P3 * * 2516 ** Synopsis: r[P3] = sqlite_offset(P1) 2517 ** 2518 ** Store in register r[P3] the byte offset into the database file that is the 2519 ** start of the payload for the record at which that cursor P1 is currently 2520 ** pointing. 2521 ** 2522 ** P2 is the column number for the argument to the sqlite_offset() function. 2523 ** This opcode does not use P2 itself, but the P2 value is used by the 2524 ** code generator. The P1, P2, and P3 operands to this opcode are the 2525 ** same as for OP_Column. 2526 ** 2527 ** This opcode is only available if SQLite is compiled with the 2528 ** -DSQLITE_ENABLE_OFFSET_SQL_FUNC option. 2529 */ 2530 case OP_Offset: { /* out3 */ 2531 VdbeCursor *pC; /* The VDBE cursor */ 2532 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 2533 pC = p->apCsr[pOp->p1]; 2534 pOut = &p->aMem[pOp->p3]; 2535 if( NEVER(pC==0) || pC->eCurType!=CURTYPE_BTREE ){ 2536 sqlite3VdbeMemSetNull(pOut); 2537 }else{ 2538 sqlite3VdbeMemSetInt64(pOut, sqlite3BtreeOffset(pC->uc.pCursor)); 2539 } 2540 break; 2541 } 2542 #endif /* SQLITE_ENABLE_OFFSET_SQL_FUNC */ 2543 2544 /* Opcode: Column P1 P2 P3 P4 P5 2545 ** Synopsis: r[P3]=PX 2546 ** 2547 ** Interpret the data that cursor P1 points to as a structure built using 2548 ** the MakeRecord instruction. (See the MakeRecord opcode for additional 2549 ** information about the format of the data.) Extract the P2-th column 2550 ** from this record. If there are less that (P2+1) 2551 ** values in the record, extract a NULL. 2552 ** 2553 ** The value extracted is stored in register P3. 2554 ** 2555 ** If the record contains fewer than P2 fields, then extract a NULL. Or, 2556 ** if the P4 argument is a P4_MEM use the value of the P4 argument as 2557 ** the result. 2558 ** 2559 ** If the OPFLAG_LENGTHARG and OPFLAG_TYPEOFARG bits are set on P5 then 2560 ** the result is guaranteed to only be used as the argument of a length() 2561 ** or typeof() function, respectively. The loading of large blobs can be 2562 ** skipped for length() and all content loading can be skipped for typeof(). 2563 */ 2564 case OP_Column: { 2565 u32 p2; /* column number to retrieve */ 2566 VdbeCursor *pC; /* The VDBE cursor */ 2567 BtCursor *pCrsr; /* The BTree cursor */ 2568 u32 *aOffset; /* aOffset[i] is offset to start of data for i-th column */ 2569 int len; /* The length of the serialized data for the column */ 2570 int i; /* Loop counter */ 2571 Mem *pDest; /* Where to write the extracted value */ 2572 Mem sMem; /* For storing the record being decoded */ 2573 const u8 *zData; /* Part of the record being decoded */ 2574 const u8 *zHdr; /* Next unparsed byte of the header */ 2575 const u8 *zEndHdr; /* Pointer to first byte after the header */ 2576 u64 offset64; /* 64-bit offset */ 2577 u32 t; /* A type code from the record header */ 2578 Mem *pReg; /* PseudoTable input register */ 2579 2580 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 2581 pC = p->apCsr[pOp->p1]; 2582 assert( pC!=0 ); 2583 p2 = (u32)pOp->p2; 2584 2585 /* If the cursor cache is stale (meaning it is not currently point at 2586 ** the correct row) then bring it up-to-date by doing the necessary 2587 ** B-Tree seek. */ 2588 rc = sqlite3VdbeCursorMoveto(&pC, &p2); 2589 if( rc ) goto abort_due_to_error; 2590 2591 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) ); 2592 pDest = &aMem[pOp->p3]; 2593 memAboutToChange(p, pDest); 2594 assert( pC!=0 ); 2595 assert( p2<(u32)pC->nField ); 2596 aOffset = pC->aOffset; 2597 assert( pC->eCurType!=CURTYPE_VTAB ); 2598 assert( pC->eCurType!=CURTYPE_PSEUDO || pC->nullRow ); 2599 assert( pC->eCurType!=CURTYPE_SORTER ); 2600 2601 if( pC->cacheStatus!=p->cacheCtr ){ /*OPTIMIZATION-IF-FALSE*/ 2602 if( pC->nullRow ){ 2603 if( pC->eCurType==CURTYPE_PSEUDO ){ 2604 /* For the special case of as pseudo-cursor, the seekResult field 2605 ** identifies the register that holds the record */ 2606 assert( pC->seekResult>0 ); 2607 pReg = &aMem[pC->seekResult]; 2608 assert( pReg->flags & MEM_Blob ); 2609 assert( memIsValid(pReg) ); 2610 pC->payloadSize = pC->szRow = pReg->n; 2611 pC->aRow = (u8*)pReg->z; 2612 }else{ 2613 sqlite3VdbeMemSetNull(pDest); 2614 goto op_column_out; 2615 } 2616 }else{ 2617 pCrsr = pC->uc.pCursor; 2618 assert( pC->eCurType==CURTYPE_BTREE ); 2619 assert( pCrsr ); 2620 assert( sqlite3BtreeCursorIsValid(pCrsr) ); 2621 pC->payloadSize = sqlite3BtreePayloadSize(pCrsr); 2622 pC->aRow = sqlite3BtreePayloadFetch(pCrsr, &pC->szRow); 2623 assert( pC->szRow<=pC->payloadSize ); 2624 assert( pC->szRow<=65536 ); /* Maximum page size is 64KiB */ 2625 if( pC->payloadSize > (u32)db->aLimit[SQLITE_LIMIT_LENGTH] ){ 2626 goto too_big; 2627 } 2628 } 2629 pC->cacheStatus = p->cacheCtr; 2630 pC->iHdrOffset = getVarint32(pC->aRow, aOffset[0]); 2631 pC->nHdrParsed = 0; 2632 2633 2634 if( pC->szRow<aOffset[0] ){ /*OPTIMIZATION-IF-FALSE*/ 2635 /* pC->aRow does not have to hold the entire row, but it does at least 2636 ** need to cover the header of the record. If pC->aRow does not contain 2637 ** the complete header, then set it to zero, forcing the header to be 2638 ** dynamically allocated. */ 2639 pC->aRow = 0; 2640 pC->szRow = 0; 2641 2642 /* Make sure a corrupt database has not given us an oversize header. 2643 ** Do this now to avoid an oversize memory allocation. 2644 ** 2645 ** Type entries can be between 1 and 5 bytes each. But 4 and 5 byte 2646 ** types use so much data space that there can only be 4096 and 32 of 2647 ** them, respectively. So the maximum header length results from a 2648 ** 3-byte type for each of the maximum of 32768 columns plus three 2649 ** extra bytes for the header length itself. 32768*3 + 3 = 98307. 2650 */ 2651 if( aOffset[0] > 98307 || aOffset[0] > pC->payloadSize ){ 2652 goto op_column_corrupt; 2653 } 2654 }else{ 2655 /* This is an optimization. By skipping over the first few tests 2656 ** (ex: pC->nHdrParsed<=p2) in the next section, we achieve a 2657 ** measurable performance gain. 2658 ** 2659 ** This branch is taken even if aOffset[0]==0. Such a record is never 2660 ** generated by SQLite, and could be considered corruption, but we 2661 ** accept it for historical reasons. When aOffset[0]==0, the code this 2662 ** branch jumps to reads past the end of the record, but never more 2663 ** than a few bytes. Even if the record occurs at the end of the page 2664 ** content area, the "page header" comes after the page content and so 2665 ** this overread is harmless. Similar overreads can occur for a corrupt 2666 ** database file. 2667 */ 2668 zData = pC->aRow; 2669 assert( pC->nHdrParsed<=p2 ); /* Conditional skipped */ 2670 testcase( aOffset[0]==0 ); 2671 goto op_column_read_header; 2672 } 2673 } 2674 2675 /* Make sure at least the first p2+1 entries of the header have been 2676 ** parsed and valid information is in aOffset[] and pC->aType[]. 2677 */ 2678 if( pC->nHdrParsed<=p2 ){ 2679 /* If there is more header available for parsing in the record, try 2680 ** to extract additional fields up through the p2+1-th field 2681 */ 2682 if( pC->iHdrOffset<aOffset[0] ){ 2683 /* Make sure zData points to enough of the record to cover the header. */ 2684 if( pC->aRow==0 ){ 2685 memset(&sMem, 0, sizeof(sMem)); 2686 rc = sqlite3VdbeMemFromBtreeZeroOffset(pC->uc.pCursor,aOffset[0],&sMem); 2687 if( rc!=SQLITE_OK ) goto abort_due_to_error; 2688 zData = (u8*)sMem.z; 2689 }else{ 2690 zData = pC->aRow; 2691 } 2692 2693 /* Fill in pC->aType[i] and aOffset[i] values through the p2-th field. */ 2694 op_column_read_header: 2695 i = pC->nHdrParsed; 2696 offset64 = aOffset[i]; 2697 zHdr = zData + pC->iHdrOffset; 2698 zEndHdr = zData + aOffset[0]; 2699 testcase( zHdr>=zEndHdr ); 2700 do{ 2701 if( (pC->aType[i] = t = zHdr[0])<0x80 ){ 2702 zHdr++; 2703 offset64 += sqlite3VdbeOneByteSerialTypeLen(t); 2704 }else{ 2705 zHdr += sqlite3GetVarint32(zHdr, &t); 2706 pC->aType[i] = t; 2707 offset64 += sqlite3VdbeSerialTypeLen(t); 2708 } 2709 aOffset[++i] = (u32)(offset64 & 0xffffffff); 2710 }while( (u32)i<=p2 && zHdr<zEndHdr ); 2711 2712 /* The record is corrupt if any of the following are true: 2713 ** (1) the bytes of the header extend past the declared header size 2714 ** (2) the entire header was used but not all data was used 2715 ** (3) the end of the data extends beyond the end of the record. 2716 */ 2717 if( (zHdr>=zEndHdr && (zHdr>zEndHdr || offset64!=pC->payloadSize)) 2718 || (offset64 > pC->payloadSize) 2719 ){ 2720 if( aOffset[0]==0 ){ 2721 i = 0; 2722 zHdr = zEndHdr; 2723 }else{ 2724 if( pC->aRow==0 ) sqlite3VdbeMemRelease(&sMem); 2725 goto op_column_corrupt; 2726 } 2727 } 2728 2729 pC->nHdrParsed = i; 2730 pC->iHdrOffset = (u32)(zHdr - zData); 2731 if( pC->aRow==0 ) sqlite3VdbeMemRelease(&sMem); 2732 }else{ 2733 t = 0; 2734 } 2735 2736 /* If after trying to extract new entries from the header, nHdrParsed is 2737 ** still not up to p2, that means that the record has fewer than p2 2738 ** columns. So the result will be either the default value or a NULL. 2739 */ 2740 if( pC->nHdrParsed<=p2 ){ 2741 if( pOp->p4type==P4_MEM ){ 2742 sqlite3VdbeMemShallowCopy(pDest, pOp->p4.pMem, MEM_Static); 2743 }else{ 2744 sqlite3VdbeMemSetNull(pDest); 2745 } 2746 goto op_column_out; 2747 } 2748 }else{ 2749 t = pC->aType[p2]; 2750 } 2751 2752 /* Extract the content for the p2+1-th column. Control can only 2753 ** reach this point if aOffset[p2], aOffset[p2+1], and pC->aType[p2] are 2754 ** all valid. 2755 */ 2756 assert( p2<pC->nHdrParsed ); 2757 assert( rc==SQLITE_OK ); 2758 assert( sqlite3VdbeCheckMemInvariants(pDest) ); 2759 if( VdbeMemDynamic(pDest) ){ 2760 sqlite3VdbeMemSetNull(pDest); 2761 } 2762 assert( t==pC->aType[p2] ); 2763 if( pC->szRow>=aOffset[p2+1] ){ 2764 /* This is the common case where the desired content fits on the original 2765 ** page - where the content is not on an overflow page */ 2766 zData = pC->aRow + aOffset[p2]; 2767 if( t<12 ){ 2768 sqlite3VdbeSerialGet(zData, t, pDest); 2769 }else{ 2770 /* If the column value is a string, we need a persistent value, not 2771 ** a MEM_Ephem value. This branch is a fast short-cut that is equivalent 2772 ** to calling sqlite3VdbeSerialGet() and sqlite3VdbeDeephemeralize(). 2773 */ 2774 static const u16 aFlag[] = { MEM_Blob, MEM_Str|MEM_Term }; 2775 pDest->n = len = (t-12)/2; 2776 pDest->enc = encoding; 2777 if( pDest->szMalloc < len+2 ){ 2778 pDest->flags = MEM_Null; 2779 if( sqlite3VdbeMemGrow(pDest, len+2, 0) ) goto no_mem; 2780 }else{ 2781 pDest->z = pDest->zMalloc; 2782 } 2783 memcpy(pDest->z, zData, len); 2784 pDest->z[len] = 0; 2785 pDest->z[len+1] = 0; 2786 pDest->flags = aFlag[t&1]; 2787 } 2788 }else{ 2789 pDest->enc = encoding; 2790 /* This branch happens only when content is on overflow pages */ 2791 if( ((pOp->p5 & (OPFLAG_LENGTHARG|OPFLAG_TYPEOFARG))!=0 2792 && ((t>=12 && (t&1)==0) || (pOp->p5 & OPFLAG_TYPEOFARG)!=0)) 2793 || (len = sqlite3VdbeSerialTypeLen(t))==0 2794 ){ 2795 /* Content is irrelevant for 2796 ** 1. the typeof() function, 2797 ** 2. the length(X) function if X is a blob, and 2798 ** 3. if the content length is zero. 2799 ** So we might as well use bogus content rather than reading 2800 ** content from disk. 2801 ** 2802 ** Although sqlite3VdbeSerialGet() may read at most 8 bytes from the 2803 ** buffer passed to it, debugging function VdbeMemPrettyPrint() may 2804 ** read more. Use the global constant sqlite3CtypeMap[] as the array, 2805 ** as that array is 256 bytes long (plenty for VdbeMemPrettyPrint()) 2806 ** and it begins with a bunch of zeros. 2807 */ 2808 sqlite3VdbeSerialGet((u8*)sqlite3CtypeMap, t, pDest); 2809 }else{ 2810 rc = sqlite3VdbeMemFromBtree(pC->uc.pCursor, aOffset[p2], len, pDest); 2811 if( rc!=SQLITE_OK ) goto abort_due_to_error; 2812 sqlite3VdbeSerialGet((const u8*)pDest->z, t, pDest); 2813 pDest->flags &= ~MEM_Ephem; 2814 } 2815 } 2816 2817 op_column_out: 2818 UPDATE_MAX_BLOBSIZE(pDest); 2819 REGISTER_TRACE(pOp->p3, pDest); 2820 break; 2821 2822 op_column_corrupt: 2823 if( aOp[0].p3>0 ){ 2824 pOp = &aOp[aOp[0].p3-1]; 2825 break; 2826 }else{ 2827 rc = SQLITE_CORRUPT_BKPT; 2828 goto abort_due_to_error; 2829 } 2830 } 2831 2832 /* Opcode: Affinity P1 P2 * P4 * 2833 ** Synopsis: affinity(r[P1@P2]) 2834 ** 2835 ** Apply affinities to a range of P2 registers starting with P1. 2836 ** 2837 ** P4 is a string that is P2 characters long. The N-th character of the 2838 ** string indicates the column affinity that should be used for the N-th 2839 ** memory cell in the range. 2840 */ 2841 case OP_Affinity: { 2842 const char *zAffinity; /* The affinity to be applied */ 2843 2844 zAffinity = pOp->p4.z; 2845 assert( zAffinity!=0 ); 2846 assert( pOp->p2>0 ); 2847 assert( zAffinity[pOp->p2]==0 ); 2848 pIn1 = &aMem[pOp->p1]; 2849 while( 1 /*exit-by-break*/ ){ 2850 assert( pIn1 <= &p->aMem[(p->nMem+1 - p->nCursor)] ); 2851 assert( zAffinity[0]==SQLITE_AFF_NONE || memIsValid(pIn1) ); 2852 applyAffinity(pIn1, zAffinity[0], encoding); 2853 if( zAffinity[0]==SQLITE_AFF_REAL && (pIn1->flags & MEM_Int)!=0 ){ 2854 /* When applying REAL affinity, if the result is still an MEM_Int 2855 ** that will fit in 6 bytes, then change the type to MEM_IntReal 2856 ** so that we keep the high-resolution integer value but know that 2857 ** the type really wants to be REAL. */ 2858 testcase( pIn1->u.i==140737488355328LL ); 2859 testcase( pIn1->u.i==140737488355327LL ); 2860 testcase( pIn1->u.i==-140737488355328LL ); 2861 testcase( pIn1->u.i==-140737488355329LL ); 2862 if( pIn1->u.i<=140737488355327LL && pIn1->u.i>=-140737488355328LL ){ 2863 pIn1->flags |= MEM_IntReal; 2864 pIn1->flags &= ~MEM_Int; 2865 }else{ 2866 pIn1->u.r = (double)pIn1->u.i; 2867 pIn1->flags |= MEM_Real; 2868 pIn1->flags &= ~MEM_Int; 2869 } 2870 } 2871 REGISTER_TRACE((int)(pIn1-aMem), pIn1); 2872 zAffinity++; 2873 if( zAffinity[0]==0 ) break; 2874 pIn1++; 2875 } 2876 break; 2877 } 2878 2879 /* Opcode: MakeRecord P1 P2 P3 P4 * 2880 ** Synopsis: r[P3]=mkrec(r[P1@P2]) 2881 ** 2882 ** Convert P2 registers beginning with P1 into the [record format] 2883 ** use as a data record in a database table or as a key 2884 ** in an index. The OP_Column opcode can decode the record later. 2885 ** 2886 ** P4 may be a string that is P2 characters long. The N-th character of the 2887 ** string indicates the column affinity that should be used for the N-th 2888 ** field of the index key. 2889 ** 2890 ** The mapping from character to affinity is given by the SQLITE_AFF_ 2891 ** macros defined in sqliteInt.h. 2892 ** 2893 ** If P4 is NULL then all index fields have the affinity BLOB. 2894 ** 2895 ** The meaning of P5 depends on whether or not the SQLITE_ENABLE_NULL_TRIM 2896 ** compile-time option is enabled: 2897 ** 2898 ** * If SQLITE_ENABLE_NULL_TRIM is enabled, then the P5 is the index 2899 ** of the right-most table that can be null-trimmed. 2900 ** 2901 ** * If SQLITE_ENABLE_NULL_TRIM is omitted, then P5 has the value 2902 ** OPFLAG_NOCHNG_MAGIC if the OP_MakeRecord opcode is allowed to 2903 ** accept no-change records with serial_type 10. This value is 2904 ** only used inside an assert() and does not affect the end result. 2905 */ 2906 case OP_MakeRecord: { 2907 Mem *pRec; /* The new record */ 2908 u64 nData; /* Number of bytes of data space */ 2909 int nHdr; /* Number of bytes of header space */ 2910 i64 nByte; /* Data space required for this record */ 2911 i64 nZero; /* Number of zero bytes at the end of the record */ 2912 int nVarint; /* Number of bytes in a varint */ 2913 u32 serial_type; /* Type field */ 2914 Mem *pData0; /* First field to be combined into the record */ 2915 Mem *pLast; /* Last field of the record */ 2916 int nField; /* Number of fields in the record */ 2917 char *zAffinity; /* The affinity string for the record */ 2918 int file_format; /* File format to use for encoding */ 2919 u32 len; /* Length of a field */ 2920 u8 *zHdr; /* Where to write next byte of the header */ 2921 u8 *zPayload; /* Where to write next byte of the payload */ 2922 2923 /* Assuming the record contains N fields, the record format looks 2924 ** like this: 2925 ** 2926 ** ------------------------------------------------------------------------ 2927 ** | hdr-size | type 0 | type 1 | ... | type N-1 | data0 | ... | data N-1 | 2928 ** ------------------------------------------------------------------------ 2929 ** 2930 ** Data(0) is taken from register P1. Data(1) comes from register P1+1 2931 ** and so forth. 2932 ** 2933 ** Each type field is a varint representing the serial type of the 2934 ** corresponding data element (see sqlite3VdbeSerialType()). The 2935 ** hdr-size field is also a varint which is the offset from the beginning 2936 ** of the record to data0. 2937 */ 2938 nData = 0; /* Number of bytes of data space */ 2939 nHdr = 0; /* Number of bytes of header space */ 2940 nZero = 0; /* Number of zero bytes at the end of the record */ 2941 nField = pOp->p1; 2942 zAffinity = pOp->p4.z; 2943 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 ); 2944 pData0 = &aMem[nField]; 2945 nField = pOp->p2; 2946 pLast = &pData0[nField-1]; 2947 file_format = p->minWriteFileFormat; 2948 2949 /* Identify the output register */ 2950 assert( pOp->p3<pOp->p1 || pOp->p3>=pOp->p1+pOp->p2 ); 2951 pOut = &aMem[pOp->p3]; 2952 memAboutToChange(p, pOut); 2953 2954 /* Apply the requested affinity to all inputs 2955 */ 2956 assert( pData0<=pLast ); 2957 if( zAffinity ){ 2958 pRec = pData0; 2959 do{ 2960 applyAffinity(pRec, zAffinity[0], encoding); 2961 if( zAffinity[0]==SQLITE_AFF_REAL && (pRec->flags & MEM_Int) ){ 2962 pRec->flags |= MEM_IntReal; 2963 pRec->flags &= ~(MEM_Int); 2964 } 2965 REGISTER_TRACE((int)(pRec-aMem), pRec); 2966 zAffinity++; 2967 pRec++; 2968 assert( zAffinity[0]==0 || pRec<=pLast ); 2969 }while( zAffinity[0] ); 2970 } 2971 2972 #ifdef SQLITE_ENABLE_NULL_TRIM 2973 /* NULLs can be safely trimmed from the end of the record, as long as 2974 ** as the schema format is 2 or more and none of the omitted columns 2975 ** have a non-NULL default value. Also, the record must be left with 2976 ** at least one field. If P5>0 then it will be one more than the 2977 ** index of the right-most column with a non-NULL default value */ 2978 if( pOp->p5 ){ 2979 while( (pLast->flags & MEM_Null)!=0 && nField>pOp->p5 ){ 2980 pLast--; 2981 nField--; 2982 } 2983 } 2984 #endif 2985 2986 /* Loop through the elements that will make up the record to figure 2987 ** out how much space is required for the new record. After this loop, 2988 ** the Mem.uTemp field of each term should hold the serial-type that will 2989 ** be used for that term in the generated record: 2990 ** 2991 ** Mem.uTemp value type 2992 ** --------------- --------------- 2993 ** 0 NULL 2994 ** 1 1-byte signed integer 2995 ** 2 2-byte signed integer 2996 ** 3 3-byte signed integer 2997 ** 4 4-byte signed integer 2998 ** 5 6-byte signed integer 2999 ** 6 8-byte signed integer 3000 ** 7 IEEE float 3001 ** 8 Integer constant 0 3002 ** 9 Integer constant 1 3003 ** 10,11 reserved for expansion 3004 ** N>=12 and even BLOB 3005 ** N>=13 and odd text 3006 ** 3007 ** The following additional values are computed: 3008 ** nHdr Number of bytes needed for the record header 3009 ** nData Number of bytes of data space needed for the record 3010 ** nZero Zero bytes at the end of the record 3011 */ 3012 pRec = pLast; 3013 do{ 3014 assert( memIsValid(pRec) ); 3015 if( pRec->flags & MEM_Null ){ 3016 if( pRec->flags & MEM_Zero ){ 3017 /* Values with MEM_Null and MEM_Zero are created by xColumn virtual 3018 ** table methods that never invoke sqlite3_result_xxxxx() while 3019 ** computing an unchanging column value in an UPDATE statement. 3020 ** Give such values a special internal-use-only serial-type of 10 3021 ** so that they can be passed through to xUpdate and have 3022 ** a true sqlite3_value_nochange(). */ 3023 #ifndef SQLITE_ENABLE_NULL_TRIM 3024 assert( pOp->p5==OPFLAG_NOCHNG_MAGIC || CORRUPT_DB ); 3025 #endif 3026 pRec->uTemp = 10; 3027 }else{ 3028 pRec->uTemp = 0; 3029 } 3030 nHdr++; 3031 }else if( pRec->flags & (MEM_Int|MEM_IntReal) ){ 3032 /* Figure out whether to use 1, 2, 4, 6 or 8 bytes. */ 3033 i64 i = pRec->u.i; 3034 u64 uu; 3035 testcase( pRec->flags & MEM_Int ); 3036 testcase( pRec->flags & MEM_IntReal ); 3037 if( i<0 ){ 3038 uu = ~i; 3039 }else{ 3040 uu = i; 3041 } 3042 nHdr++; 3043 testcase( uu==127 ); testcase( uu==128 ); 3044 testcase( uu==32767 ); testcase( uu==32768 ); 3045 testcase( uu==8388607 ); testcase( uu==8388608 ); 3046 testcase( uu==2147483647 ); testcase( uu==2147483648 ); 3047 testcase( uu==140737488355327LL ); testcase( uu==140737488355328LL ); 3048 if( uu<=127 ){ 3049 if( (i&1)==i && file_format>=4 ){ 3050 pRec->uTemp = 8+(u32)uu; 3051 }else{ 3052 nData++; 3053 pRec->uTemp = 1; 3054 } 3055 }else if( uu<=32767 ){ 3056 nData += 2; 3057 pRec->uTemp = 2; 3058 }else if( uu<=8388607 ){ 3059 nData += 3; 3060 pRec->uTemp = 3; 3061 }else if( uu<=2147483647 ){ 3062 nData += 4; 3063 pRec->uTemp = 4; 3064 }else if( uu<=140737488355327LL ){ 3065 nData += 6; 3066 pRec->uTemp = 5; 3067 }else{ 3068 nData += 8; 3069 if( pRec->flags & MEM_IntReal ){ 3070 /* If the value is IntReal and is going to take up 8 bytes to store 3071 ** as an integer, then we might as well make it an 8-byte floating 3072 ** point value */ 3073 pRec->u.r = (double)pRec->u.i; 3074 pRec->flags &= ~MEM_IntReal; 3075 pRec->flags |= MEM_Real; 3076 pRec->uTemp = 7; 3077 }else{ 3078 pRec->uTemp = 6; 3079 } 3080 } 3081 }else if( pRec->flags & MEM_Real ){ 3082 nHdr++; 3083 nData += 8; 3084 pRec->uTemp = 7; 3085 }else{ 3086 assert( db->mallocFailed || pRec->flags&(MEM_Str|MEM_Blob) ); 3087 assert( pRec->n>=0 ); 3088 len = (u32)pRec->n; 3089 serial_type = (len*2) + 12 + ((pRec->flags & MEM_Str)!=0); 3090 if( pRec->flags & MEM_Zero ){ 3091 serial_type += pRec->u.nZero*2; 3092 if( nData ){ 3093 if( sqlite3VdbeMemExpandBlob(pRec) ) goto no_mem; 3094 len += pRec->u.nZero; 3095 }else{ 3096 nZero += pRec->u.nZero; 3097 } 3098 } 3099 nData += len; 3100 nHdr += sqlite3VarintLen(serial_type); 3101 pRec->uTemp = serial_type; 3102 } 3103 if( pRec==pData0 ) break; 3104 pRec--; 3105 }while(1); 3106 3107 /* EVIDENCE-OF: R-22564-11647 The header begins with a single varint 3108 ** which determines the total number of bytes in the header. The varint 3109 ** value is the size of the header in bytes including the size varint 3110 ** itself. */ 3111 testcase( nHdr==126 ); 3112 testcase( nHdr==127 ); 3113 if( nHdr<=126 ){ 3114 /* The common case */ 3115 nHdr += 1; 3116 }else{ 3117 /* Rare case of a really large header */ 3118 nVarint = sqlite3VarintLen(nHdr); 3119 nHdr += nVarint; 3120 if( nVarint<sqlite3VarintLen(nHdr) ) nHdr++; 3121 } 3122 nByte = nHdr+nData; 3123 3124 /* Make sure the output register has a buffer large enough to store 3125 ** the new record. The output register (pOp->p3) is not allowed to 3126 ** be one of the input registers (because the following call to 3127 ** sqlite3VdbeMemClearAndResize() could clobber the value before it is used). 3128 */ 3129 if( nByte+nZero<=pOut->szMalloc ){ 3130 /* The output register is already large enough to hold the record. 3131 ** No error checks or buffer enlargement is required */ 3132 pOut->z = pOut->zMalloc; 3133 }else{ 3134 /* Need to make sure that the output is not too big and then enlarge 3135 ** the output register to hold the full result */ 3136 if( nByte+nZero>db->aLimit[SQLITE_LIMIT_LENGTH] ){ 3137 goto too_big; 3138 } 3139 if( sqlite3VdbeMemClearAndResize(pOut, (int)nByte) ){ 3140 goto no_mem; 3141 } 3142 } 3143 pOut->n = (int)nByte; 3144 pOut->flags = MEM_Blob; 3145 if( nZero ){ 3146 pOut->u.nZero = nZero; 3147 pOut->flags |= MEM_Zero; 3148 } 3149 UPDATE_MAX_BLOBSIZE(pOut); 3150 zHdr = (u8 *)pOut->z; 3151 zPayload = zHdr + nHdr; 3152 3153 /* Write the record */ 3154 zHdr += putVarint32(zHdr, nHdr); 3155 assert( pData0<=pLast ); 3156 pRec = pData0; 3157 do{ 3158 serial_type = pRec->uTemp; 3159 /* EVIDENCE-OF: R-06529-47362 Following the size varint are one or more 3160 ** additional varints, one per column. */ 3161 zHdr += putVarint32(zHdr, serial_type); /* serial type */ 3162 /* EVIDENCE-OF: R-64536-51728 The values for each column in the record 3163 ** immediately follow the header. */ 3164 zPayload += sqlite3VdbeSerialPut(zPayload, pRec, serial_type); /* content */ 3165 }while( (++pRec)<=pLast ); 3166 assert( nHdr==(int)(zHdr - (u8*)pOut->z) ); 3167 assert( nByte==(int)(zPayload - (u8*)pOut->z) ); 3168 3169 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) ); 3170 REGISTER_TRACE(pOp->p3, pOut); 3171 break; 3172 } 3173 3174 /* Opcode: Count P1 P2 p3 * * 3175 ** Synopsis: r[P2]=count() 3176 ** 3177 ** Store the number of entries (an integer value) in the table or index 3178 ** opened by cursor P1 in register P2. 3179 ** 3180 ** If P3==0, then an exact count is obtained, which involves visiting 3181 ** every btree page of the table. But if P3 is non-zero, an estimate 3182 ** is returned based on the current cursor position. 3183 */ 3184 case OP_Count: { /* out2 */ 3185 i64 nEntry; 3186 BtCursor *pCrsr; 3187 3188 assert( p->apCsr[pOp->p1]->eCurType==CURTYPE_BTREE ); 3189 pCrsr = p->apCsr[pOp->p1]->uc.pCursor; 3190 assert( pCrsr ); 3191 if( pOp->p3 ){ 3192 nEntry = sqlite3BtreeRowCountEst(pCrsr); 3193 }else{ 3194 nEntry = 0; /* Not needed. Only used to silence a warning. */ 3195 rc = sqlite3BtreeCount(db, pCrsr, &nEntry); 3196 if( rc ) goto abort_due_to_error; 3197 } 3198 pOut = out2Prerelease(p, pOp); 3199 pOut->u.i = nEntry; 3200 goto check_for_interrupt; 3201 } 3202 3203 /* Opcode: Savepoint P1 * * P4 * 3204 ** 3205 ** Open, release or rollback the savepoint named by parameter P4, depending 3206 ** on the value of P1. To open a new savepoint set P1==0 (SAVEPOINT_BEGIN). 3207 ** To release (commit) an existing savepoint set P1==1 (SAVEPOINT_RELEASE). 3208 ** To rollback an existing savepoint set P1==2 (SAVEPOINT_ROLLBACK). 3209 */ 3210 case OP_Savepoint: { 3211 int p1; /* Value of P1 operand */ 3212 char *zName; /* Name of savepoint */ 3213 int nName; 3214 Savepoint *pNew; 3215 Savepoint *pSavepoint; 3216 Savepoint *pTmp; 3217 int iSavepoint; 3218 int ii; 3219 3220 p1 = pOp->p1; 3221 zName = pOp->p4.z; 3222 3223 /* Assert that the p1 parameter is valid. Also that if there is no open 3224 ** transaction, then there cannot be any savepoints. 3225 */ 3226 assert( db->pSavepoint==0 || db->autoCommit==0 ); 3227 assert( p1==SAVEPOINT_BEGIN||p1==SAVEPOINT_RELEASE||p1==SAVEPOINT_ROLLBACK ); 3228 assert( db->pSavepoint || db->isTransactionSavepoint==0 ); 3229 assert( checkSavepointCount(db) ); 3230 assert( p->bIsReader ); 3231 3232 if( p1==SAVEPOINT_BEGIN ){ 3233 if( db->nVdbeWrite>0 ){ 3234 /* A new savepoint cannot be created if there are active write 3235 ** statements (i.e. open read/write incremental blob handles). 3236 */ 3237 sqlite3VdbeError(p, "cannot open savepoint - SQL statements in progress"); 3238 rc = SQLITE_BUSY; 3239 }else{ 3240 nName = sqlite3Strlen30(zName); 3241 3242 #ifndef SQLITE_OMIT_VIRTUALTABLE 3243 /* This call is Ok even if this savepoint is actually a transaction 3244 ** savepoint (and therefore should not prompt xSavepoint()) callbacks. 3245 ** If this is a transaction savepoint being opened, it is guaranteed 3246 ** that the db->aVTrans[] array is empty. */ 3247 assert( db->autoCommit==0 || db->nVTrans==0 ); 3248 rc = sqlite3VtabSavepoint(db, SAVEPOINT_BEGIN, 3249 db->nStatement+db->nSavepoint); 3250 if( rc!=SQLITE_OK ) goto abort_due_to_error; 3251 #endif 3252 3253 /* Create a new savepoint structure. */ 3254 pNew = sqlite3DbMallocRawNN(db, sizeof(Savepoint)+nName+1); 3255 if( pNew ){ 3256 pNew->zName = (char *)&pNew[1]; 3257 memcpy(pNew->zName, zName, nName+1); 3258 3259 /* If there is no open transaction, then mark this as a special 3260 ** "transaction savepoint". */ 3261 if( db->autoCommit ){ 3262 db->autoCommit = 0; 3263 db->isTransactionSavepoint = 1; 3264 }else{ 3265 db->nSavepoint++; 3266 } 3267 3268 /* Link the new savepoint into the database handle's list. */ 3269 pNew->pNext = db->pSavepoint; 3270 db->pSavepoint = pNew; 3271 pNew->nDeferredCons = db->nDeferredCons; 3272 pNew->nDeferredImmCons = db->nDeferredImmCons; 3273 } 3274 } 3275 }else{ 3276 assert( p1==SAVEPOINT_RELEASE || p1==SAVEPOINT_ROLLBACK ); 3277 iSavepoint = 0; 3278 3279 /* Find the named savepoint. If there is no such savepoint, then an 3280 ** an error is returned to the user. */ 3281 for( 3282 pSavepoint = db->pSavepoint; 3283 pSavepoint && sqlite3StrICmp(pSavepoint->zName, zName); 3284 pSavepoint = pSavepoint->pNext 3285 ){ 3286 iSavepoint++; 3287 } 3288 if( !pSavepoint ){ 3289 sqlite3VdbeError(p, "no such savepoint: %s", zName); 3290 rc = SQLITE_ERROR; 3291 }else if( db->nVdbeWrite>0 && p1==SAVEPOINT_RELEASE ){ 3292 /* It is not possible to release (commit) a savepoint if there are 3293 ** active write statements. 3294 */ 3295 sqlite3VdbeError(p, "cannot release savepoint - " 3296 "SQL statements in progress"); 3297 rc = SQLITE_BUSY; 3298 }else{ 3299 3300 /* Determine whether or not this is a transaction savepoint. If so, 3301 ** and this is a RELEASE command, then the current transaction 3302 ** is committed. 3303 */ 3304 int isTransaction = pSavepoint->pNext==0 && db->isTransactionSavepoint; 3305 if( isTransaction && p1==SAVEPOINT_RELEASE ){ 3306 if( (rc = sqlite3VdbeCheckFk(p, 1))!=SQLITE_OK ){ 3307 goto vdbe_return; 3308 } 3309 db->autoCommit = 1; 3310 if( sqlite3VdbeHalt(p)==SQLITE_BUSY ){ 3311 p->pc = (int)(pOp - aOp); 3312 db->autoCommit = 0; 3313 p->rc = rc = SQLITE_BUSY; 3314 goto vdbe_return; 3315 } 3316 rc = p->rc; 3317 if( rc ){ 3318 db->autoCommit = 0; 3319 }else{ 3320 db->isTransactionSavepoint = 0; 3321 } 3322 }else{ 3323 int isSchemaChange; 3324 iSavepoint = db->nSavepoint - iSavepoint - 1; 3325 if( p1==SAVEPOINT_ROLLBACK ){ 3326 isSchemaChange = (db->mDbFlags & DBFLAG_SchemaChange)!=0; 3327 for(ii=0; ii<db->nDb; ii++){ 3328 rc = sqlite3BtreeTripAllCursors(db->aDb[ii].pBt, 3329 SQLITE_ABORT_ROLLBACK, 3330 isSchemaChange==0); 3331 if( rc!=SQLITE_OK ) goto abort_due_to_error; 3332 } 3333 }else{ 3334 assert( p1==SAVEPOINT_RELEASE ); 3335 isSchemaChange = 0; 3336 } 3337 for(ii=0; ii<db->nDb; ii++){ 3338 rc = sqlite3BtreeSavepoint(db->aDb[ii].pBt, p1, iSavepoint); 3339 if( rc!=SQLITE_OK ){ 3340 goto abort_due_to_error; 3341 } 3342 } 3343 if( isSchemaChange ){ 3344 sqlite3ExpirePreparedStatements(db, 0); 3345 sqlite3ResetAllSchemasOfConnection(db); 3346 db->mDbFlags |= DBFLAG_SchemaChange; 3347 } 3348 } 3349 if( rc ) goto abort_due_to_error; 3350 3351 /* Regardless of whether this is a RELEASE or ROLLBACK, destroy all 3352 ** savepoints nested inside of the savepoint being operated on. */ 3353 while( db->pSavepoint!=pSavepoint ){ 3354 pTmp = db->pSavepoint; 3355 db->pSavepoint = pTmp->pNext; 3356 sqlite3DbFree(db, pTmp); 3357 db->nSavepoint--; 3358 } 3359 3360 /* If it is a RELEASE, then destroy the savepoint being operated on 3361 ** too. If it is a ROLLBACK TO, then set the number of deferred 3362 ** constraint violations present in the database to the value stored 3363 ** when the savepoint was created. */ 3364 if( p1==SAVEPOINT_RELEASE ){ 3365 assert( pSavepoint==db->pSavepoint ); 3366 db->pSavepoint = pSavepoint->pNext; 3367 sqlite3DbFree(db, pSavepoint); 3368 if( !isTransaction ){ 3369 db->nSavepoint--; 3370 } 3371 }else{ 3372 assert( p1==SAVEPOINT_ROLLBACK ); 3373 db->nDeferredCons = pSavepoint->nDeferredCons; 3374 db->nDeferredImmCons = pSavepoint->nDeferredImmCons; 3375 } 3376 3377 if( !isTransaction || p1==SAVEPOINT_ROLLBACK ){ 3378 rc = sqlite3VtabSavepoint(db, p1, iSavepoint); 3379 if( rc!=SQLITE_OK ) goto abort_due_to_error; 3380 } 3381 } 3382 } 3383 if( rc ) goto abort_due_to_error; 3384 3385 break; 3386 } 3387 3388 /* Opcode: AutoCommit P1 P2 * * * 3389 ** 3390 ** Set the database auto-commit flag to P1 (1 or 0). If P2 is true, roll 3391 ** back any currently active btree transactions. If there are any active 3392 ** VMs (apart from this one), then a ROLLBACK fails. A COMMIT fails if 3393 ** there are active writing VMs or active VMs that use shared cache. 3394 ** 3395 ** This instruction causes the VM to halt. 3396 */ 3397 case OP_AutoCommit: { 3398 int desiredAutoCommit; 3399 int iRollback; 3400 3401 desiredAutoCommit = pOp->p1; 3402 iRollback = pOp->p2; 3403 assert( desiredAutoCommit==1 || desiredAutoCommit==0 ); 3404 assert( desiredAutoCommit==1 || iRollback==0 ); 3405 assert( db->nVdbeActive>0 ); /* At least this one VM is active */ 3406 assert( p->bIsReader ); 3407 3408 if( desiredAutoCommit!=db->autoCommit ){ 3409 if( iRollback ){ 3410 assert( desiredAutoCommit==1 ); 3411 sqlite3RollbackAll(db, SQLITE_ABORT_ROLLBACK); 3412 db->autoCommit = 1; 3413 }else if( desiredAutoCommit && db->nVdbeWrite>0 ){ 3414 /* If this instruction implements a COMMIT and other VMs are writing 3415 ** return an error indicating that the other VMs must complete first. 3416 */ 3417 sqlite3VdbeError(p, "cannot commit transaction - " 3418 "SQL statements in progress"); 3419 rc = SQLITE_BUSY; 3420 goto abort_due_to_error; 3421 }else if( (rc = sqlite3VdbeCheckFk(p, 1))!=SQLITE_OK ){ 3422 goto vdbe_return; 3423 }else{ 3424 db->autoCommit = (u8)desiredAutoCommit; 3425 } 3426 if( sqlite3VdbeHalt(p)==SQLITE_BUSY ){ 3427 p->pc = (int)(pOp - aOp); 3428 db->autoCommit = (u8)(1-desiredAutoCommit); 3429 p->rc = rc = SQLITE_BUSY; 3430 goto vdbe_return; 3431 } 3432 sqlite3CloseSavepoints(db); 3433 if( p->rc==SQLITE_OK ){ 3434 rc = SQLITE_DONE; 3435 }else{ 3436 rc = SQLITE_ERROR; 3437 } 3438 goto vdbe_return; 3439 }else{ 3440 sqlite3VdbeError(p, 3441 (!desiredAutoCommit)?"cannot start a transaction within a transaction":( 3442 (iRollback)?"cannot rollback - no transaction is active": 3443 "cannot commit - no transaction is active")); 3444 3445 rc = SQLITE_ERROR; 3446 goto abort_due_to_error; 3447 } 3448 /*NOTREACHED*/ assert(0); 3449 } 3450 3451 /* Opcode: Transaction P1 P2 P3 P4 P5 3452 ** 3453 ** Begin a transaction on database P1 if a transaction is not already 3454 ** active. 3455 ** If P2 is non-zero, then a write-transaction is started, or if a 3456 ** read-transaction is already active, it is upgraded to a write-transaction. 3457 ** If P2 is zero, then a read-transaction is started. If P2 is 2 or more 3458 ** then an exclusive transaction is started. 3459 ** 3460 ** P1 is the index of the database file on which the transaction is 3461 ** started. Index 0 is the main database file and index 1 is the 3462 ** file used for temporary tables. Indices of 2 or more are used for 3463 ** attached databases. 3464 ** 3465 ** If a write-transaction is started and the Vdbe.usesStmtJournal flag is 3466 ** true (this flag is set if the Vdbe may modify more than one row and may 3467 ** throw an ABORT exception), a statement transaction may also be opened. 3468 ** More specifically, a statement transaction is opened iff the database 3469 ** connection is currently not in autocommit mode, or if there are other 3470 ** active statements. A statement transaction allows the changes made by this 3471 ** VDBE to be rolled back after an error without having to roll back the 3472 ** entire transaction. If no error is encountered, the statement transaction 3473 ** will automatically commit when the VDBE halts. 3474 ** 3475 ** If P5!=0 then this opcode also checks the schema cookie against P3 3476 ** and the schema generation counter against P4. 3477 ** The cookie changes its value whenever the database schema changes. 3478 ** This operation is used to detect when that the cookie has changed 3479 ** and that the current process needs to reread the schema. If the schema 3480 ** cookie in P3 differs from the schema cookie in the database header or 3481 ** if the schema generation counter in P4 differs from the current 3482 ** generation counter, then an SQLITE_SCHEMA error is raised and execution 3483 ** halts. The sqlite3_step() wrapper function might then reprepare the 3484 ** statement and rerun it from the beginning. 3485 */ 3486 case OP_Transaction: { 3487 Btree *pBt; 3488 int iMeta = 0; 3489 3490 assert( p->bIsReader ); 3491 assert( p->readOnly==0 || pOp->p2==0 ); 3492 assert( pOp->p2>=0 && pOp->p2<=2 ); 3493 assert( pOp->p1>=0 && pOp->p1<db->nDb ); 3494 assert( DbMaskTest(p->btreeMask, pOp->p1) ); 3495 if( pOp->p2 && (db->flags & SQLITE_QueryOnly)!=0 ){ 3496 rc = SQLITE_READONLY; 3497 goto abort_due_to_error; 3498 } 3499 pBt = db->aDb[pOp->p1].pBt; 3500 3501 if( pBt ){ 3502 rc = sqlite3BtreeBeginTrans(pBt, pOp->p2, &iMeta); 3503 testcase( rc==SQLITE_BUSY_SNAPSHOT ); 3504 testcase( rc==SQLITE_BUSY_RECOVERY ); 3505 if( rc!=SQLITE_OK ){ 3506 if( (rc&0xff)==SQLITE_BUSY ){ 3507 p->pc = (int)(pOp - aOp); 3508 p->rc = rc; 3509 goto vdbe_return; 3510 } 3511 goto abort_due_to_error; 3512 } 3513 3514 if( p->usesStmtJournal 3515 && pOp->p2 3516 && (db->autoCommit==0 || db->nVdbeRead>1) 3517 ){ 3518 assert( sqlite3BtreeTxnState(pBt)==SQLITE_TXN_WRITE ); 3519 if( p->iStatement==0 ){ 3520 assert( db->nStatement>=0 && db->nSavepoint>=0 ); 3521 db->nStatement++; 3522 p->iStatement = db->nSavepoint + db->nStatement; 3523 } 3524 3525 rc = sqlite3VtabSavepoint(db, SAVEPOINT_BEGIN, p->iStatement-1); 3526 if( rc==SQLITE_OK ){ 3527 rc = sqlite3BtreeBeginStmt(pBt, p->iStatement); 3528 } 3529 3530 /* Store the current value of the database handles deferred constraint 3531 ** counter. If the statement transaction needs to be rolled back, 3532 ** the value of this counter needs to be restored too. */ 3533 p->nStmtDefCons = db->nDeferredCons; 3534 p->nStmtDefImmCons = db->nDeferredImmCons; 3535 } 3536 } 3537 assert( pOp->p5==0 || pOp->p4type==P4_INT32 ); 3538 if( pOp->p5 3539 && (iMeta!=pOp->p3 3540 || db->aDb[pOp->p1].pSchema->iGeneration!=pOp->p4.i) 3541 ){ 3542 /* 3543 ** IMPLEMENTATION-OF: R-03189-51135 As each SQL statement runs, the schema 3544 ** version is checked to ensure that the schema has not changed since the 3545 ** SQL statement was prepared. 3546 */ 3547 sqlite3DbFree(db, p->zErrMsg); 3548 p->zErrMsg = sqlite3DbStrDup(db, "database schema has changed"); 3549 /* If the schema-cookie from the database file matches the cookie 3550 ** stored with the in-memory representation of the schema, do 3551 ** not reload the schema from the database file. 3552 ** 3553 ** If virtual-tables are in use, this is not just an optimization. 3554 ** Often, v-tables store their data in other SQLite tables, which 3555 ** are queried from within xNext() and other v-table methods using 3556 ** prepared queries. If such a query is out-of-date, we do not want to 3557 ** discard the database schema, as the user code implementing the 3558 ** v-table would have to be ready for the sqlite3_vtab structure itself 3559 ** to be invalidated whenever sqlite3_step() is called from within 3560 ** a v-table method. 3561 */ 3562 if( db->aDb[pOp->p1].pSchema->schema_cookie!=iMeta ){ 3563 sqlite3ResetOneSchema(db, pOp->p1); 3564 } 3565 p->expired = 1; 3566 rc = SQLITE_SCHEMA; 3567 } 3568 if( rc ) goto abort_due_to_error; 3569 break; 3570 } 3571 3572 /* Opcode: ReadCookie P1 P2 P3 * * 3573 ** 3574 ** Read cookie number P3 from database P1 and write it into register P2. 3575 ** P3==1 is the schema version. P3==2 is the database format. 3576 ** P3==3 is the recommended pager cache size, and so forth. P1==0 is 3577 ** the main database file and P1==1 is the database file used to store 3578 ** temporary tables. 3579 ** 3580 ** There must be a read-lock on the database (either a transaction 3581 ** must be started or there must be an open cursor) before 3582 ** executing this instruction. 3583 */ 3584 case OP_ReadCookie: { /* out2 */ 3585 int iMeta; 3586 int iDb; 3587 int iCookie; 3588 3589 assert( p->bIsReader ); 3590 iDb = pOp->p1; 3591 iCookie = pOp->p3; 3592 assert( pOp->p3<SQLITE_N_BTREE_META ); 3593 assert( iDb>=0 && iDb<db->nDb ); 3594 assert( db->aDb[iDb].pBt!=0 ); 3595 assert( DbMaskTest(p->btreeMask, iDb) ); 3596 3597 sqlite3BtreeGetMeta(db->aDb[iDb].pBt, iCookie, (u32 *)&iMeta); 3598 pOut = out2Prerelease(p, pOp); 3599 pOut->u.i = iMeta; 3600 break; 3601 } 3602 3603 /* Opcode: SetCookie P1 P2 P3 * P5 3604 ** 3605 ** Write the integer value P3 into cookie number P2 of database P1. 3606 ** P2==1 is the schema version. P2==2 is the database format. 3607 ** P2==3 is the recommended pager cache 3608 ** size, and so forth. P1==0 is the main database file and P1==1 is the 3609 ** database file used to store temporary tables. 3610 ** 3611 ** A transaction must be started before executing this opcode. 3612 ** 3613 ** If P2 is the SCHEMA_VERSION cookie (cookie number 1) then the internal 3614 ** schema version is set to P3-P5. The "PRAGMA schema_version=N" statement 3615 ** has P5 set to 1, so that the internal schema version will be different 3616 ** from the database schema version, resulting in a schema reset. 3617 */ 3618 case OP_SetCookie: { 3619 Db *pDb; 3620 3621 sqlite3VdbeIncrWriteCounter(p, 0); 3622 assert( pOp->p2<SQLITE_N_BTREE_META ); 3623 assert( pOp->p1>=0 && pOp->p1<db->nDb ); 3624 assert( DbMaskTest(p->btreeMask, pOp->p1) ); 3625 assert( p->readOnly==0 ); 3626 pDb = &db->aDb[pOp->p1]; 3627 assert( pDb->pBt!=0 ); 3628 assert( sqlite3SchemaMutexHeld(db, pOp->p1, 0) ); 3629 /* See note about index shifting on OP_ReadCookie */ 3630 rc = sqlite3BtreeUpdateMeta(pDb->pBt, pOp->p2, pOp->p3); 3631 if( pOp->p2==BTREE_SCHEMA_VERSION ){ 3632 /* When the schema cookie changes, record the new cookie internally */ 3633 pDb->pSchema->schema_cookie = pOp->p3 - pOp->p5; 3634 db->mDbFlags |= DBFLAG_SchemaChange; 3635 }else if( pOp->p2==BTREE_FILE_FORMAT ){ 3636 /* Record changes in the file format */ 3637 pDb->pSchema->file_format = pOp->p3; 3638 } 3639 if( pOp->p1==1 ){ 3640 /* Invalidate all prepared statements whenever the TEMP database 3641 ** schema is changed. Ticket #1644 */ 3642 sqlite3ExpirePreparedStatements(db, 0); 3643 p->expired = 0; 3644 } 3645 if( rc ) goto abort_due_to_error; 3646 break; 3647 } 3648 3649 /* Opcode: OpenRead P1 P2 P3 P4 P5 3650 ** Synopsis: root=P2 iDb=P3 3651 ** 3652 ** Open a read-only cursor for the database table whose root page is 3653 ** P2 in a database file. The database file is determined by P3. 3654 ** P3==0 means the main database, P3==1 means the database used for 3655 ** temporary tables, and P3>1 means used the corresponding attached 3656 ** database. Give the new cursor an identifier of P1. The P1 3657 ** values need not be contiguous but all P1 values should be small integers. 3658 ** It is an error for P1 to be negative. 3659 ** 3660 ** Allowed P5 bits: 3661 ** <ul> 3662 ** <li> <b>0x02 OPFLAG_SEEKEQ</b>: This cursor will only be used for 3663 ** equality lookups (implemented as a pair of opcodes OP_SeekGE/OP_IdxGT 3664 ** of OP_SeekLE/OP_IdxLT) 3665 ** </ul> 3666 ** 3667 ** The P4 value may be either an integer (P4_INT32) or a pointer to 3668 ** a KeyInfo structure (P4_KEYINFO). If it is a pointer to a KeyInfo 3669 ** object, then table being opened must be an [index b-tree] where the 3670 ** KeyInfo object defines the content and collating 3671 ** sequence of that index b-tree. Otherwise, if P4 is an integer 3672 ** value, then the table being opened must be a [table b-tree] with a 3673 ** number of columns no less than the value of P4. 3674 ** 3675 ** See also: OpenWrite, ReopenIdx 3676 */ 3677 /* Opcode: ReopenIdx P1 P2 P3 P4 P5 3678 ** Synopsis: root=P2 iDb=P3 3679 ** 3680 ** The ReopenIdx opcode works like OP_OpenRead except that it first 3681 ** checks to see if the cursor on P1 is already open on the same 3682 ** b-tree and if it is this opcode becomes a no-op. In other words, 3683 ** if the cursor is already open, do not reopen it. 3684 ** 3685 ** The ReopenIdx opcode may only be used with P5==0 or P5==OPFLAG_SEEKEQ 3686 ** and with P4 being a P4_KEYINFO object. Furthermore, the P3 value must 3687 ** be the same as every other ReopenIdx or OpenRead for the same cursor 3688 ** number. 3689 ** 3690 ** Allowed P5 bits: 3691 ** <ul> 3692 ** <li> <b>0x02 OPFLAG_SEEKEQ</b>: This cursor will only be used for 3693 ** equality lookups (implemented as a pair of opcodes OP_SeekGE/OP_IdxGT 3694 ** of OP_SeekLE/OP_IdxLT) 3695 ** </ul> 3696 ** 3697 ** See also: OP_OpenRead, OP_OpenWrite 3698 */ 3699 /* Opcode: OpenWrite P1 P2 P3 P4 P5 3700 ** Synopsis: root=P2 iDb=P3 3701 ** 3702 ** Open a read/write cursor named P1 on the table or index whose root 3703 ** page is P2 (or whose root page is held in register P2 if the 3704 ** OPFLAG_P2ISREG bit is set in P5 - see below). 3705 ** 3706 ** The P4 value may be either an integer (P4_INT32) or a pointer to 3707 ** a KeyInfo structure (P4_KEYINFO). If it is a pointer to a KeyInfo 3708 ** object, then table being opened must be an [index b-tree] where the 3709 ** KeyInfo object defines the content and collating 3710 ** sequence of that index b-tree. Otherwise, if P4 is an integer 3711 ** value, then the table being opened must be a [table b-tree] with a 3712 ** number of columns no less than the value of P4. 3713 ** 3714 ** Allowed P5 bits: 3715 ** <ul> 3716 ** <li> <b>0x02 OPFLAG_SEEKEQ</b>: This cursor will only be used for 3717 ** equality lookups (implemented as a pair of opcodes OP_SeekGE/OP_IdxGT 3718 ** of OP_SeekLE/OP_IdxLT) 3719 ** <li> <b>0x08 OPFLAG_FORDELETE</b>: This cursor is used only to seek 3720 ** and subsequently delete entries in an index btree. This is a 3721 ** hint to the storage engine that the storage engine is allowed to 3722 ** ignore. The hint is not used by the official SQLite b*tree storage 3723 ** engine, but is used by COMDB2. 3724 ** <li> <b>0x10 OPFLAG_P2ISREG</b>: Use the content of register P2 3725 ** as the root page, not the value of P2 itself. 3726 ** </ul> 3727 ** 3728 ** This instruction works like OpenRead except that it opens the cursor 3729 ** in read/write mode. 3730 ** 3731 ** See also: OP_OpenRead, OP_ReopenIdx 3732 */ 3733 case OP_ReopenIdx: { 3734 int nField; 3735 KeyInfo *pKeyInfo; 3736 u32 p2; 3737 int iDb; 3738 int wrFlag; 3739 Btree *pX; 3740 VdbeCursor *pCur; 3741 Db *pDb; 3742 3743 assert( pOp->p5==0 || pOp->p5==OPFLAG_SEEKEQ ); 3744 assert( pOp->p4type==P4_KEYINFO ); 3745 pCur = p->apCsr[pOp->p1]; 3746 if( pCur && pCur->pgnoRoot==(u32)pOp->p2 ){ 3747 assert( pCur->iDb==pOp->p3 ); /* Guaranteed by the code generator */ 3748 goto open_cursor_set_hints; 3749 } 3750 /* If the cursor is not currently open or is open on a different 3751 ** index, then fall through into OP_OpenRead to force a reopen */ 3752 case OP_OpenRead: 3753 case OP_OpenWrite: 3754 3755 assert( pOp->opcode==OP_OpenWrite || pOp->p5==0 || pOp->p5==OPFLAG_SEEKEQ ); 3756 assert( p->bIsReader ); 3757 assert( pOp->opcode==OP_OpenRead || pOp->opcode==OP_ReopenIdx 3758 || p->readOnly==0 ); 3759 3760 if( p->expired==1 ){ 3761 rc = SQLITE_ABORT_ROLLBACK; 3762 goto abort_due_to_error; 3763 } 3764 3765 nField = 0; 3766 pKeyInfo = 0; 3767 p2 = (u32)pOp->p2; 3768 iDb = pOp->p3; 3769 assert( iDb>=0 && iDb<db->nDb ); 3770 assert( DbMaskTest(p->btreeMask, iDb) ); 3771 pDb = &db->aDb[iDb]; 3772 pX = pDb->pBt; 3773 assert( pX!=0 ); 3774 if( pOp->opcode==OP_OpenWrite ){ 3775 assert( OPFLAG_FORDELETE==BTREE_FORDELETE ); 3776 wrFlag = BTREE_WRCSR | (pOp->p5 & OPFLAG_FORDELETE); 3777 assert( sqlite3SchemaMutexHeld(db, iDb, 0) ); 3778 if( pDb->pSchema->file_format < p->minWriteFileFormat ){ 3779 p->minWriteFileFormat = pDb->pSchema->file_format; 3780 } 3781 }else{ 3782 wrFlag = 0; 3783 } 3784 if( pOp->p5 & OPFLAG_P2ISREG ){ 3785 assert( p2>0 ); 3786 assert( p2<=(u32)(p->nMem+1 - p->nCursor) ); 3787 assert( pOp->opcode==OP_OpenWrite ); 3788 pIn2 = &aMem[p2]; 3789 assert( memIsValid(pIn2) ); 3790 assert( (pIn2->flags & MEM_Int)!=0 ); 3791 sqlite3VdbeMemIntegerify(pIn2); 3792 p2 = (int)pIn2->u.i; 3793 /* The p2 value always comes from a prior OP_CreateBtree opcode and 3794 ** that opcode will always set the p2 value to 2 or more or else fail. 3795 ** If there were a failure, the prepared statement would have halted 3796 ** before reaching this instruction. */ 3797 assert( p2>=2 ); 3798 } 3799 if( pOp->p4type==P4_KEYINFO ){ 3800 pKeyInfo = pOp->p4.pKeyInfo; 3801 assert( pKeyInfo->enc==ENC(db) ); 3802 assert( pKeyInfo->db==db ); 3803 nField = pKeyInfo->nAllField; 3804 }else if( pOp->p4type==P4_INT32 ){ 3805 nField = pOp->p4.i; 3806 } 3807 assert( pOp->p1>=0 ); 3808 assert( nField>=0 ); 3809 testcase( nField==0 ); /* Table with INTEGER PRIMARY KEY and nothing else */ 3810 pCur = allocateCursor(p, pOp->p1, nField, iDb, CURTYPE_BTREE); 3811 if( pCur==0 ) goto no_mem; 3812 pCur->nullRow = 1; 3813 pCur->isOrdered = 1; 3814 pCur->pgnoRoot = p2; 3815 #ifdef SQLITE_DEBUG 3816 pCur->wrFlag = wrFlag; 3817 #endif 3818 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor); 3819 pCur->pKeyInfo = pKeyInfo; 3820 /* Set the VdbeCursor.isTable variable. Previous versions of 3821 ** SQLite used to check if the root-page flags were sane at this point 3822 ** and report database corruption if they were not, but this check has 3823 ** since moved into the btree layer. */ 3824 pCur->isTable = pOp->p4type!=P4_KEYINFO; 3825 3826 open_cursor_set_hints: 3827 assert( OPFLAG_BULKCSR==BTREE_BULKLOAD ); 3828 assert( OPFLAG_SEEKEQ==BTREE_SEEK_EQ ); 3829 testcase( pOp->p5 & OPFLAG_BULKCSR ); 3830 testcase( pOp->p2 & OPFLAG_SEEKEQ ); 3831 sqlite3BtreeCursorHintFlags(pCur->uc.pCursor, 3832 (pOp->p5 & (OPFLAG_BULKCSR|OPFLAG_SEEKEQ))); 3833 if( rc ) goto abort_due_to_error; 3834 break; 3835 } 3836 3837 /* Opcode: OpenDup P1 P2 * * * 3838 ** 3839 ** Open a new cursor P1 that points to the same ephemeral table as 3840 ** cursor P2. The P2 cursor must have been opened by a prior OP_OpenEphemeral 3841 ** opcode. Only ephemeral cursors may be duplicated. 3842 ** 3843 ** Duplicate ephemeral cursors are used for self-joins of materialized views. 3844 */ 3845 case OP_OpenDup: { 3846 VdbeCursor *pOrig; /* The original cursor to be duplicated */ 3847 VdbeCursor *pCx; /* The new cursor */ 3848 3849 pOrig = p->apCsr[pOp->p2]; 3850 assert( pOrig ); 3851 assert( pOrig->isEphemeral ); /* Only ephemeral cursors can be duplicated */ 3852 3853 pCx = allocateCursor(p, pOp->p1, pOrig->nField, -1, CURTYPE_BTREE); 3854 if( pCx==0 ) goto no_mem; 3855 pCx->nullRow = 1; 3856 pCx->isEphemeral = 1; 3857 pCx->pKeyInfo = pOrig->pKeyInfo; 3858 pCx->isTable = pOrig->isTable; 3859 pCx->pgnoRoot = pOrig->pgnoRoot; 3860 pCx->isOrdered = pOrig->isOrdered; 3861 pCx->pBtx = pOrig->pBtx; 3862 pCx->hasBeenDuped = 1; 3863 pOrig->hasBeenDuped = 1; 3864 rc = sqlite3BtreeCursor(pCx->pBtx, pCx->pgnoRoot, BTREE_WRCSR, 3865 pCx->pKeyInfo, pCx->uc.pCursor); 3866 /* The sqlite3BtreeCursor() routine can only fail for the first cursor 3867 ** opened for a database. Since there is already an open cursor when this 3868 ** opcode is run, the sqlite3BtreeCursor() cannot fail */ 3869 assert( rc==SQLITE_OK ); 3870 break; 3871 } 3872 3873 3874 /* Opcode: OpenEphemeral P1 P2 P3 P4 P5 3875 ** Synopsis: nColumn=P2 3876 ** 3877 ** Open a new cursor P1 to a transient table. 3878 ** The cursor is always opened read/write even if 3879 ** the main database is read-only. The ephemeral 3880 ** table is deleted automatically when the cursor is closed. 3881 ** 3882 ** If the cursor P1 is already opened on an ephemeral table, the table 3883 ** is cleared (all content is erased). 3884 ** 3885 ** P2 is the number of columns in the ephemeral table. 3886 ** The cursor points to a BTree table if P4==0 and to a BTree index 3887 ** if P4 is not 0. If P4 is not NULL, it points to a KeyInfo structure 3888 ** that defines the format of keys in the index. 3889 ** 3890 ** The P5 parameter can be a mask of the BTREE_* flags defined 3891 ** in btree.h. These flags control aspects of the operation of 3892 ** the btree. The BTREE_OMIT_JOURNAL and BTREE_SINGLE flags are 3893 ** added automatically. 3894 ** 3895 ** If P3 is positive, then reg[P3] is modified slightly so that it 3896 ** can be used as zero-length data for OP_Insert. This is an optimization 3897 ** that avoids an extra OP_Blob opcode to initialize that register. 3898 */ 3899 /* Opcode: OpenAutoindex P1 P2 * P4 * 3900 ** Synopsis: nColumn=P2 3901 ** 3902 ** This opcode works the same as OP_OpenEphemeral. It has a 3903 ** different name to distinguish its use. Tables created using 3904 ** by this opcode will be used for automatically created transient 3905 ** indices in joins. 3906 */ 3907 case OP_OpenAutoindex: 3908 case OP_OpenEphemeral: { 3909 VdbeCursor *pCx; 3910 KeyInfo *pKeyInfo; 3911 3912 static const int vfsFlags = 3913 SQLITE_OPEN_READWRITE | 3914 SQLITE_OPEN_CREATE | 3915 SQLITE_OPEN_EXCLUSIVE | 3916 SQLITE_OPEN_DELETEONCLOSE | 3917 SQLITE_OPEN_TRANSIENT_DB; 3918 assert( pOp->p1>=0 ); 3919 assert( pOp->p2>=0 ); 3920 if( pOp->p3>0 ){ 3921 /* Make register reg[P3] into a value that can be used as the data 3922 ** form sqlite3BtreeInsert() where the length of the data is zero. */ 3923 assert( pOp->p2==0 ); /* Only used when number of columns is zero */ 3924 assert( pOp->opcode==OP_OpenEphemeral ); 3925 assert( aMem[pOp->p3].flags & MEM_Null ); 3926 aMem[pOp->p3].n = 0; 3927 aMem[pOp->p3].z = ""; 3928 } 3929 pCx = p->apCsr[pOp->p1]; 3930 if( pCx && !pCx->hasBeenDuped ){ 3931 /* If the ephermeral table is already open and has no duplicates from 3932 ** OP_OpenDup, then erase all existing content so that the table is 3933 ** empty again, rather than creating a new table. */ 3934 assert( pCx->isEphemeral ); 3935 pCx->seqCount = 0; 3936 pCx->cacheStatus = CACHE_STALE; 3937 rc = sqlite3BtreeClearTable(pCx->pBtx, pCx->pgnoRoot, 0); 3938 }else{ 3939 pCx = allocateCursor(p, pOp->p1, pOp->p2, -1, CURTYPE_BTREE); 3940 if( pCx==0 ) goto no_mem; 3941 pCx->isEphemeral = 1; 3942 rc = sqlite3BtreeOpen(db->pVfs, 0, db, &pCx->pBtx, 3943 BTREE_OMIT_JOURNAL | BTREE_SINGLE | pOp->p5, 3944 vfsFlags); 3945 if( rc==SQLITE_OK ){ 3946 rc = sqlite3BtreeBeginTrans(pCx->pBtx, 1, 0); 3947 if( rc==SQLITE_OK ){ 3948 /* If a transient index is required, create it by calling 3949 ** sqlite3BtreeCreateTable() with the BTREE_BLOBKEY flag before 3950 ** opening it. If a transient table is required, just use the 3951 ** automatically created table with root-page 1 (an BLOB_INTKEY table). 3952 */ 3953 if( (pCx->pKeyInfo = pKeyInfo = pOp->p4.pKeyInfo)!=0 ){ 3954 assert( pOp->p4type==P4_KEYINFO ); 3955 rc = sqlite3BtreeCreateTable(pCx->pBtx, &pCx->pgnoRoot, 3956 BTREE_BLOBKEY | pOp->p5); 3957 if( rc==SQLITE_OK ){ 3958 assert( pCx->pgnoRoot==SCHEMA_ROOT+1 ); 3959 assert( pKeyInfo->db==db ); 3960 assert( pKeyInfo->enc==ENC(db) ); 3961 rc = sqlite3BtreeCursor(pCx->pBtx, pCx->pgnoRoot, BTREE_WRCSR, 3962 pKeyInfo, pCx->uc.pCursor); 3963 } 3964 pCx->isTable = 0; 3965 }else{ 3966 pCx->pgnoRoot = SCHEMA_ROOT; 3967 rc = sqlite3BtreeCursor(pCx->pBtx, SCHEMA_ROOT, BTREE_WRCSR, 3968 0, pCx->uc.pCursor); 3969 pCx->isTable = 1; 3970 } 3971 } 3972 pCx->isOrdered = (pOp->p5!=BTREE_UNORDERED); 3973 if( rc ){ 3974 sqlite3BtreeClose(pCx->pBtx); 3975 } 3976 } 3977 } 3978 if( rc ) goto abort_due_to_error; 3979 pCx->nullRow = 1; 3980 break; 3981 } 3982 3983 /* Opcode: SorterOpen P1 P2 P3 P4 * 3984 ** 3985 ** This opcode works like OP_OpenEphemeral except that it opens 3986 ** a transient index that is specifically designed to sort large 3987 ** tables using an external merge-sort algorithm. 3988 ** 3989 ** If argument P3 is non-zero, then it indicates that the sorter may 3990 ** assume that a stable sort considering the first P3 fields of each 3991 ** key is sufficient to produce the required results. 3992 */ 3993 case OP_SorterOpen: { 3994 VdbeCursor *pCx; 3995 3996 assert( pOp->p1>=0 ); 3997 assert( pOp->p2>=0 ); 3998 pCx = allocateCursor(p, pOp->p1, pOp->p2, -1, CURTYPE_SORTER); 3999 if( pCx==0 ) goto no_mem; 4000 pCx->pKeyInfo = pOp->p4.pKeyInfo; 4001 assert( pCx->pKeyInfo->db==db ); 4002 assert( pCx->pKeyInfo->enc==ENC(db) ); 4003 rc = sqlite3VdbeSorterInit(db, pOp->p3, pCx); 4004 if( rc ) goto abort_due_to_error; 4005 break; 4006 } 4007 4008 /* Opcode: SequenceTest P1 P2 * * * 4009 ** Synopsis: if( cursor[P1].ctr++ ) pc = P2 4010 ** 4011 ** P1 is a sorter cursor. If the sequence counter is currently zero, jump 4012 ** to P2. Regardless of whether or not the jump is taken, increment the 4013 ** the sequence value. 4014 */ 4015 case OP_SequenceTest: { 4016 VdbeCursor *pC; 4017 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4018 pC = p->apCsr[pOp->p1]; 4019 assert( isSorter(pC) ); 4020 if( (pC->seqCount++)==0 ){ 4021 goto jump_to_p2; 4022 } 4023 break; 4024 } 4025 4026 /* Opcode: OpenPseudo P1 P2 P3 * * 4027 ** Synopsis: P3 columns in r[P2] 4028 ** 4029 ** Open a new cursor that points to a fake table that contains a single 4030 ** row of data. The content of that one row is the content of memory 4031 ** register P2. In other words, cursor P1 becomes an alias for the 4032 ** MEM_Blob content contained in register P2. 4033 ** 4034 ** A pseudo-table created by this opcode is used to hold a single 4035 ** row output from the sorter so that the row can be decomposed into 4036 ** individual columns using the OP_Column opcode. The OP_Column opcode 4037 ** is the only cursor opcode that works with a pseudo-table. 4038 ** 4039 ** P3 is the number of fields in the records that will be stored by 4040 ** the pseudo-table. 4041 */ 4042 case OP_OpenPseudo: { 4043 VdbeCursor *pCx; 4044 4045 assert( pOp->p1>=0 ); 4046 assert( pOp->p3>=0 ); 4047 pCx = allocateCursor(p, pOp->p1, pOp->p3, -1, CURTYPE_PSEUDO); 4048 if( pCx==0 ) goto no_mem; 4049 pCx->nullRow = 1; 4050 pCx->seekResult = pOp->p2; 4051 pCx->isTable = 1; 4052 /* Give this pseudo-cursor a fake BtCursor pointer so that pCx 4053 ** can be safely passed to sqlite3VdbeCursorMoveto(). This avoids a test 4054 ** for pCx->eCurType==CURTYPE_BTREE inside of sqlite3VdbeCursorMoveto() 4055 ** which is a performance optimization */ 4056 pCx->uc.pCursor = sqlite3BtreeFakeValidCursor(); 4057 assert( pOp->p5==0 ); 4058 break; 4059 } 4060 4061 /* Opcode: Close P1 * * * * 4062 ** 4063 ** Close a cursor previously opened as P1. If P1 is not 4064 ** currently open, this instruction is a no-op. 4065 */ 4066 case OP_Close: { 4067 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4068 sqlite3VdbeFreeCursor(p, p->apCsr[pOp->p1]); 4069 p->apCsr[pOp->p1] = 0; 4070 break; 4071 } 4072 4073 #ifdef SQLITE_ENABLE_COLUMN_USED_MASK 4074 /* Opcode: ColumnsUsed P1 * * P4 * 4075 ** 4076 ** This opcode (which only exists if SQLite was compiled with 4077 ** SQLITE_ENABLE_COLUMN_USED_MASK) identifies which columns of the 4078 ** table or index for cursor P1 are used. P4 is a 64-bit integer 4079 ** (P4_INT64) in which the first 63 bits are one for each of the 4080 ** first 63 columns of the table or index that are actually used 4081 ** by the cursor. The high-order bit is set if any column after 4082 ** the 64th is used. 4083 */ 4084 case OP_ColumnsUsed: { 4085 VdbeCursor *pC; 4086 pC = p->apCsr[pOp->p1]; 4087 assert( pC->eCurType==CURTYPE_BTREE ); 4088 pC->maskUsed = *(u64*)pOp->p4.pI64; 4089 break; 4090 } 4091 #endif 4092 4093 /* Opcode: SeekGE P1 P2 P3 P4 * 4094 ** Synopsis: key=r[P3@P4] 4095 ** 4096 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys), 4097 ** use the value in register P3 as the key. If cursor P1 refers 4098 ** to an SQL index, then P3 is the first in an array of P4 registers 4099 ** that are used as an unpacked index key. 4100 ** 4101 ** Reposition cursor P1 so that it points to the smallest entry that 4102 ** is greater than or equal to the key value. If there are no records 4103 ** greater than or equal to the key and P2 is not zero, then jump to P2. 4104 ** 4105 ** If the cursor P1 was opened using the OPFLAG_SEEKEQ flag, then this 4106 ** opcode will either land on a record that exactly matches the key, or 4107 ** else it will cause a jump to P2. When the cursor is OPFLAG_SEEKEQ, 4108 ** this opcode must be followed by an IdxLE opcode with the same arguments. 4109 ** The IdxGT opcode will be skipped if this opcode succeeds, but the 4110 ** IdxGT opcode will be used on subsequent loop iterations. The 4111 ** OPFLAG_SEEKEQ flags is a hint to the btree layer to say that this 4112 ** is an equality search. 4113 ** 4114 ** This opcode leaves the cursor configured to move in forward order, 4115 ** from the beginning toward the end. In other words, the cursor is 4116 ** configured to use Next, not Prev. 4117 ** 4118 ** See also: Found, NotFound, SeekLt, SeekGt, SeekLe 4119 */ 4120 /* Opcode: SeekGT P1 P2 P3 P4 * 4121 ** Synopsis: key=r[P3@P4] 4122 ** 4123 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys), 4124 ** use the value in register P3 as a key. If cursor P1 refers 4125 ** to an SQL index, then P3 is the first in an array of P4 registers 4126 ** that are used as an unpacked index key. 4127 ** 4128 ** Reposition cursor P1 so that it points to the smallest entry that 4129 ** is greater than the key value. If there are no records greater than 4130 ** the key and P2 is not zero, then jump to P2. 4131 ** 4132 ** This opcode leaves the cursor configured to move in forward order, 4133 ** from the beginning toward the end. In other words, the cursor is 4134 ** configured to use Next, not Prev. 4135 ** 4136 ** See also: Found, NotFound, SeekLt, SeekGe, SeekLe 4137 */ 4138 /* Opcode: SeekLT P1 P2 P3 P4 * 4139 ** Synopsis: key=r[P3@P4] 4140 ** 4141 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys), 4142 ** use the value in register P3 as a key. If cursor P1 refers 4143 ** to an SQL index, then P3 is the first in an array of P4 registers 4144 ** that are used as an unpacked index key. 4145 ** 4146 ** Reposition cursor P1 so that it points to the largest entry that 4147 ** is less than the key value. If there are no records less than 4148 ** the key and P2 is not zero, then jump to P2. 4149 ** 4150 ** This opcode leaves the cursor configured to move in reverse order, 4151 ** from the end toward the beginning. In other words, the cursor is 4152 ** configured to use Prev, not Next. 4153 ** 4154 ** See also: Found, NotFound, SeekGt, SeekGe, SeekLe 4155 */ 4156 /* Opcode: SeekLE P1 P2 P3 P4 * 4157 ** Synopsis: key=r[P3@P4] 4158 ** 4159 ** If cursor P1 refers to an SQL table (B-Tree that uses integer keys), 4160 ** use the value in register P3 as a key. If cursor P1 refers 4161 ** to an SQL index, then P3 is the first in an array of P4 registers 4162 ** that are used as an unpacked index key. 4163 ** 4164 ** Reposition cursor P1 so that it points to the largest entry that 4165 ** is less than or equal to the key value. If there are no records 4166 ** less than or equal to the key and P2 is not zero, then jump to P2. 4167 ** 4168 ** This opcode leaves the cursor configured to move in reverse order, 4169 ** from the end toward the beginning. In other words, the cursor is 4170 ** configured to use Prev, not Next. 4171 ** 4172 ** If the cursor P1 was opened using the OPFLAG_SEEKEQ flag, then this 4173 ** opcode will either land on a record that exactly matches the key, or 4174 ** else it will cause a jump to P2. When the cursor is OPFLAG_SEEKEQ, 4175 ** this opcode must be followed by an IdxLE opcode with the same arguments. 4176 ** The IdxGE opcode will be skipped if this opcode succeeds, but the 4177 ** IdxGE opcode will be used on subsequent loop iterations. The 4178 ** OPFLAG_SEEKEQ flags is a hint to the btree layer to say that this 4179 ** is an equality search. 4180 ** 4181 ** See also: Found, NotFound, SeekGt, SeekGe, SeekLt 4182 */ 4183 case OP_SeekLT: /* jump, in3, group */ 4184 case OP_SeekLE: /* jump, in3, group */ 4185 case OP_SeekGE: /* jump, in3, group */ 4186 case OP_SeekGT: { /* jump, in3, group */ 4187 int res; /* Comparison result */ 4188 int oc; /* Opcode */ 4189 VdbeCursor *pC; /* The cursor to seek */ 4190 UnpackedRecord r; /* The key to seek for */ 4191 int nField; /* Number of columns or fields in the key */ 4192 i64 iKey; /* The rowid we are to seek to */ 4193 int eqOnly; /* Only interested in == results */ 4194 4195 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4196 assert( pOp->p2!=0 ); 4197 pC = p->apCsr[pOp->p1]; 4198 assert( pC!=0 ); 4199 assert( pC->eCurType==CURTYPE_BTREE ); 4200 assert( OP_SeekLE == OP_SeekLT+1 ); 4201 assert( OP_SeekGE == OP_SeekLT+2 ); 4202 assert( OP_SeekGT == OP_SeekLT+3 ); 4203 assert( pC->isOrdered ); 4204 assert( pC->uc.pCursor!=0 ); 4205 oc = pOp->opcode; 4206 eqOnly = 0; 4207 pC->nullRow = 0; 4208 #ifdef SQLITE_DEBUG 4209 pC->seekOp = pOp->opcode; 4210 #endif 4211 4212 pC->deferredMoveto = 0; 4213 pC->cacheStatus = CACHE_STALE; 4214 if( pC->isTable ){ 4215 u16 flags3, newType; 4216 /* The OPFLAG_SEEKEQ/BTREE_SEEK_EQ flag is only set on index cursors */ 4217 assert( sqlite3BtreeCursorHasHint(pC->uc.pCursor, BTREE_SEEK_EQ)==0 4218 || CORRUPT_DB ); 4219 4220 /* The input value in P3 might be of any type: integer, real, string, 4221 ** blob, or NULL. But it needs to be an integer before we can do 4222 ** the seek, so convert it. */ 4223 pIn3 = &aMem[pOp->p3]; 4224 flags3 = pIn3->flags; 4225 if( (flags3 & (MEM_Int|MEM_Real|MEM_IntReal|MEM_Str))==MEM_Str ){ 4226 applyNumericAffinity(pIn3, 0); 4227 } 4228 iKey = sqlite3VdbeIntValue(pIn3); /* Get the integer key value */ 4229 newType = pIn3->flags; /* Record the type after applying numeric affinity */ 4230 pIn3->flags = flags3; /* But convert the type back to its original */ 4231 4232 /* If the P3 value could not be converted into an integer without 4233 ** loss of information, then special processing is required... */ 4234 if( (newType & (MEM_Int|MEM_IntReal))==0 ){ 4235 if( (newType & MEM_Real)==0 ){ 4236 if( (newType & MEM_Null) || oc>=OP_SeekGE ){ 4237 VdbeBranchTaken(1,2); 4238 goto jump_to_p2; 4239 }else{ 4240 rc = sqlite3BtreeLast(pC->uc.pCursor, &res); 4241 if( rc!=SQLITE_OK ) goto abort_due_to_error; 4242 goto seek_not_found; 4243 } 4244 }else 4245 4246 /* If the approximation iKey is larger than the actual real search 4247 ** term, substitute >= for > and < for <=. e.g. if the search term 4248 ** is 4.9 and the integer approximation 5: 4249 ** 4250 ** (x > 4.9) -> (x >= 5) 4251 ** (x <= 4.9) -> (x < 5) 4252 */ 4253 if( pIn3->u.r<(double)iKey ){ 4254 assert( OP_SeekGE==(OP_SeekGT-1) ); 4255 assert( OP_SeekLT==(OP_SeekLE-1) ); 4256 assert( (OP_SeekLE & 0x0001)==(OP_SeekGT & 0x0001) ); 4257 if( (oc & 0x0001)==(OP_SeekGT & 0x0001) ) oc--; 4258 } 4259 4260 /* If the approximation iKey is smaller than the actual real search 4261 ** term, substitute <= for < and > for >=. */ 4262 else if( pIn3->u.r>(double)iKey ){ 4263 assert( OP_SeekLE==(OP_SeekLT+1) ); 4264 assert( OP_SeekGT==(OP_SeekGE+1) ); 4265 assert( (OP_SeekLT & 0x0001)==(OP_SeekGE & 0x0001) ); 4266 if( (oc & 0x0001)==(OP_SeekLT & 0x0001) ) oc++; 4267 } 4268 } 4269 rc = sqlite3BtreeMovetoUnpacked(pC->uc.pCursor, 0, (u64)iKey, 0, &res); 4270 pC->movetoTarget = iKey; /* Used by OP_Delete */ 4271 if( rc!=SQLITE_OK ){ 4272 goto abort_due_to_error; 4273 } 4274 }else{ 4275 /* For a cursor with the OPFLAG_SEEKEQ/BTREE_SEEK_EQ hint, only the 4276 ** OP_SeekGE and OP_SeekLE opcodes are allowed, and these must be 4277 ** immediately followed by an OP_IdxGT or OP_IdxLT opcode, respectively, 4278 ** with the same key. 4279 */ 4280 if( sqlite3BtreeCursorHasHint(pC->uc.pCursor, BTREE_SEEK_EQ) ){ 4281 eqOnly = 1; 4282 assert( pOp->opcode==OP_SeekGE || pOp->opcode==OP_SeekLE ); 4283 assert( pOp[1].opcode==OP_IdxLT || pOp[1].opcode==OP_IdxGT ); 4284 assert( pOp->opcode==OP_SeekGE || pOp[1].opcode==OP_IdxLT ); 4285 assert( pOp->opcode==OP_SeekLE || pOp[1].opcode==OP_IdxGT ); 4286 assert( pOp[1].p1==pOp[0].p1 ); 4287 assert( pOp[1].p2==pOp[0].p2 ); 4288 assert( pOp[1].p3==pOp[0].p3 ); 4289 assert( pOp[1].p4.i==pOp[0].p4.i ); 4290 } 4291 4292 nField = pOp->p4.i; 4293 assert( pOp->p4type==P4_INT32 ); 4294 assert( nField>0 ); 4295 r.pKeyInfo = pC->pKeyInfo; 4296 r.nField = (u16)nField; 4297 4298 /* The next line of code computes as follows, only faster: 4299 ** if( oc==OP_SeekGT || oc==OP_SeekLE ){ 4300 ** r.default_rc = -1; 4301 ** }else{ 4302 ** r.default_rc = +1; 4303 ** } 4304 */ 4305 r.default_rc = ((1 & (oc - OP_SeekLT)) ? -1 : +1); 4306 assert( oc!=OP_SeekGT || r.default_rc==-1 ); 4307 assert( oc!=OP_SeekLE || r.default_rc==-1 ); 4308 assert( oc!=OP_SeekGE || r.default_rc==+1 ); 4309 assert( oc!=OP_SeekLT || r.default_rc==+1 ); 4310 4311 r.aMem = &aMem[pOp->p3]; 4312 #ifdef SQLITE_DEBUG 4313 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); } 4314 #endif 4315 r.eqSeen = 0; 4316 rc = sqlite3BtreeMovetoUnpacked(pC->uc.pCursor, &r, 0, 0, &res); 4317 if( rc!=SQLITE_OK ){ 4318 goto abort_due_to_error; 4319 } 4320 if( eqOnly && r.eqSeen==0 ){ 4321 assert( res!=0 ); 4322 goto seek_not_found; 4323 } 4324 } 4325 #ifdef SQLITE_TEST 4326 sqlite3_search_count++; 4327 #endif 4328 if( oc>=OP_SeekGE ){ assert( oc==OP_SeekGE || oc==OP_SeekGT ); 4329 if( res<0 || (res==0 && oc==OP_SeekGT) ){ 4330 res = 0; 4331 rc = sqlite3BtreeNext(pC->uc.pCursor, 0); 4332 if( rc!=SQLITE_OK ){ 4333 if( rc==SQLITE_DONE ){ 4334 rc = SQLITE_OK; 4335 res = 1; 4336 }else{ 4337 goto abort_due_to_error; 4338 } 4339 } 4340 }else{ 4341 res = 0; 4342 } 4343 }else{ 4344 assert( oc==OP_SeekLT || oc==OP_SeekLE ); 4345 if( res>0 || (res==0 && oc==OP_SeekLT) ){ 4346 res = 0; 4347 rc = sqlite3BtreePrevious(pC->uc.pCursor, 0); 4348 if( rc!=SQLITE_OK ){ 4349 if( rc==SQLITE_DONE ){ 4350 rc = SQLITE_OK; 4351 res = 1; 4352 }else{ 4353 goto abort_due_to_error; 4354 } 4355 } 4356 }else{ 4357 /* res might be negative because the table is empty. Check to 4358 ** see if this is the case. 4359 */ 4360 res = sqlite3BtreeEof(pC->uc.pCursor); 4361 } 4362 } 4363 seek_not_found: 4364 assert( pOp->p2>0 ); 4365 VdbeBranchTaken(res!=0,2); 4366 if( res ){ 4367 goto jump_to_p2; 4368 }else if( eqOnly ){ 4369 assert( pOp[1].opcode==OP_IdxLT || pOp[1].opcode==OP_IdxGT ); 4370 pOp++; /* Skip the OP_IdxLt or OP_IdxGT that follows */ 4371 } 4372 break; 4373 } 4374 4375 4376 /* Opcode: SeekScan P1 P2 * * * 4377 ** Synopsis: Scan-ahead up to P1 rows 4378 ** 4379 ** This opcode is a prefix opcode to OP_SeekGE. In other words, this 4380 ** opcode must be immediately followed by OP_SeekGE. This constraint is 4381 ** checked by assert() statements. 4382 ** 4383 ** This opcode uses the P1 through P4 operands of the subsequent 4384 ** OP_SeekGE. In the text that follows, the operands of the subsequent 4385 ** OP_SeekGE opcode are denoted as SeekOP.P1 through SeekOP.P4. Only 4386 ** the P1 and P2 operands of this opcode are also used, and are called 4387 ** This.P1 and This.P2. 4388 ** 4389 ** This opcode helps to optimize IN operators on a multi-column index 4390 ** where the IN operator is on the later terms of the index by avoiding 4391 ** unnecessary seeks on the btree, substituting steps to the next row 4392 ** of the b-tree instead. A correct answer is obtained if this opcode 4393 ** is omitted or is a no-op. 4394 ** 4395 ** The SeekGE.P3 and SeekGE.P4 operands identify an unpacked key which 4396 ** is the desired entry that we want the cursor SeekGE.P1 to be pointing 4397 ** to. Call this SeekGE.P4/P5 row the "target". 4398 ** 4399 ** If the SeekGE.P1 cursor is not currently pointing to a valid row, 4400 ** then this opcode is a no-op and control passes through into the OP_SeekGE. 4401 ** 4402 ** If the SeekGE.P1 cursor is pointing to a valid row, then that row 4403 ** might be the target row, or it might be near and slightly before the 4404 ** target row. This opcode attempts to position the cursor on the target 4405 ** row by, perhaps by invoking sqlite3BtreeStep() on the cursor 4406 ** between 0 and This.P1 times. 4407 ** 4408 ** There are three possible outcomes from this opcode:<ol> 4409 ** 4410 ** <li> If after This.P1 steps, the cursor is still pointing to a place that 4411 ** is earlier in the btree than the target row, then fall through 4412 ** into the subsquence OP_SeekGE opcode. 4413 ** 4414 ** <li> If the cursor is successfully moved to the target row by 0 or more 4415 ** sqlite3BtreeNext() calls, then jump to This.P2, which will land just 4416 ** past the OP_IdxGT or OP_IdxGE opcode that follows the OP_SeekGE. 4417 ** 4418 ** <li> If the cursor ends up past the target row (indicating the the target 4419 ** row does not exist in the btree) then jump to SeekOP.P2. 4420 ** </ol> 4421 */ 4422 case OP_SeekScan: { 4423 VdbeCursor *pC; 4424 int res; 4425 int nStep; 4426 UnpackedRecord r; 4427 4428 assert( pOp[1].opcode==OP_SeekGE ); 4429 4430 /* pOp->p2 points to the first instruction past the OP_IdxGT that 4431 ** follows the OP_SeekGE. */ 4432 assert( pOp->p2>=(int)(pOp-aOp)+2 ); 4433 assert( aOp[pOp->p2-1].opcode==OP_IdxGT || aOp[pOp->p2-1].opcode==OP_IdxGE ); 4434 testcase( aOp[pOp->p2-1].opcode==OP_IdxGE ); 4435 assert( pOp[1].p1==aOp[pOp->p2-1].p1 ); 4436 assert( pOp[1].p2==aOp[pOp->p2-1].p2 ); 4437 assert( pOp[1].p3==aOp[pOp->p2-1].p3 ); 4438 4439 assert( pOp->p1>0 ); 4440 pC = p->apCsr[pOp[1].p1]; 4441 assert( pC!=0 ); 4442 assert( pC->eCurType==CURTYPE_BTREE ); 4443 assert( !pC->isTable ); 4444 if( !sqlite3BtreeCursorIsValidNN(pC->uc.pCursor) ){ 4445 #ifdef SQLITE_DEBUG 4446 if( db->flags&SQLITE_VdbeTrace ){ 4447 printf("... cursor not valid - fall through\n"); 4448 } 4449 #endif 4450 break; 4451 } 4452 nStep = pOp->p1; 4453 assert( nStep>=1 ); 4454 r.pKeyInfo = pC->pKeyInfo; 4455 r.nField = (u16)pOp[1].p4.i; 4456 r.default_rc = 0; 4457 r.aMem = &aMem[pOp[1].p3]; 4458 #ifdef SQLITE_DEBUG 4459 { 4460 int i; 4461 for(i=0; i<r.nField; i++){ 4462 assert( memIsValid(&r.aMem[i]) ); 4463 REGISTER_TRACE(pOp[1].p3+i, &aMem[pOp[1].p3+i]); 4464 } 4465 } 4466 #endif 4467 res = 0; /* Not needed. Only used to silence a warning. */ 4468 while(1){ 4469 rc = sqlite3VdbeIdxKeyCompare(db, pC, &r, &res); 4470 if( rc ) goto abort_due_to_error; 4471 if( res>0 ){ 4472 seekscan_search_fail: 4473 #ifdef SQLITE_DEBUG 4474 if( db->flags&SQLITE_VdbeTrace ){ 4475 printf("... %d steps and then skip\n", pOp->p1 - nStep); 4476 } 4477 #endif 4478 VdbeBranchTaken(1,3); 4479 pOp++; 4480 goto jump_to_p2; 4481 } 4482 if( res==0 ){ 4483 #ifdef SQLITE_DEBUG 4484 if( db->flags&SQLITE_VdbeTrace ){ 4485 printf("... %d steps and then success\n", pOp->p1 - nStep); 4486 } 4487 #endif 4488 VdbeBranchTaken(2,3); 4489 goto jump_to_p2; 4490 break; 4491 } 4492 if( nStep<=0 ){ 4493 #ifdef SQLITE_DEBUG 4494 if( db->flags&SQLITE_VdbeTrace ){ 4495 printf("... fall through after %d steps\n", pOp->p1); 4496 } 4497 #endif 4498 VdbeBranchTaken(0,3); 4499 break; 4500 } 4501 nStep--; 4502 rc = sqlite3BtreeNext(pC->uc.pCursor, 0); 4503 if( rc ){ 4504 if( rc==SQLITE_DONE ){ 4505 rc = SQLITE_OK; 4506 goto seekscan_search_fail; 4507 }else{ 4508 goto abort_due_to_error; 4509 } 4510 } 4511 } 4512 4513 break; 4514 } 4515 4516 4517 /* Opcode: SeekHit P1 P2 P3 * * 4518 ** Synopsis: set P2<=seekHit<=P3 4519 ** 4520 ** Increase or decrease the seekHit value for cursor P1, if necessary, 4521 ** so that it is no less than P2 and no greater than P3. 4522 ** 4523 ** The seekHit integer represents the maximum of terms in an index for which 4524 ** there is known to be at least one match. If the seekHit value is smaller 4525 ** than the total number of equality terms in an index lookup, then the 4526 ** OP_IfNoHope opcode might run to see if the IN loop can be abandoned 4527 ** early, thus saving work. This is part of the IN-early-out optimization. 4528 ** 4529 ** P1 must be a valid b-tree cursor. 4530 */ 4531 case OP_SeekHit: { 4532 VdbeCursor *pC; 4533 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4534 pC = p->apCsr[pOp->p1]; 4535 assert( pC!=0 ); 4536 assert( pOp->p3>=pOp->p2 ); 4537 if( pC->seekHit<pOp->p2 ){ 4538 pC->seekHit = pOp->p2; 4539 }else if( pC->seekHit>pOp->p3 ){ 4540 pC->seekHit = pOp->p3; 4541 } 4542 break; 4543 } 4544 4545 /* Opcode: IfNotOpen P1 P2 * * * 4546 ** Synopsis: if( !csr[P1] ) goto P2 4547 ** 4548 ** If cursor P1 is not open, jump to instruction P2. Otherwise, fall through. 4549 */ 4550 case OP_IfNotOpen: { /* jump */ 4551 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4552 VdbeBranchTaken(p->apCsr[pOp->p1]==0, 2); 4553 if( !p->apCsr[pOp->p1] ){ 4554 goto jump_to_p2_and_check_for_interrupt; 4555 } 4556 break; 4557 } 4558 4559 /* Opcode: Found P1 P2 P3 P4 * 4560 ** Synopsis: key=r[P3@P4] 4561 ** 4562 ** If P4==0 then register P3 holds a blob constructed by MakeRecord. If 4563 ** P4>0 then register P3 is the first of P4 registers that form an unpacked 4564 ** record. 4565 ** 4566 ** Cursor P1 is on an index btree. If the record identified by P3 and P4 4567 ** is a prefix of any entry in P1 then a jump is made to P2 and 4568 ** P1 is left pointing at the matching entry. 4569 ** 4570 ** This operation leaves the cursor in a state where it can be 4571 ** advanced in the forward direction. The Next instruction will work, 4572 ** but not the Prev instruction. 4573 ** 4574 ** See also: NotFound, NoConflict, NotExists. SeekGe 4575 */ 4576 /* Opcode: NotFound P1 P2 P3 P4 * 4577 ** Synopsis: key=r[P3@P4] 4578 ** 4579 ** If P4==0 then register P3 holds a blob constructed by MakeRecord. If 4580 ** P4>0 then register P3 is the first of P4 registers that form an unpacked 4581 ** record. 4582 ** 4583 ** Cursor P1 is on an index btree. If the record identified by P3 and P4 4584 ** is not the prefix of any entry in P1 then a jump is made to P2. If P1 4585 ** does contain an entry whose prefix matches the P3/P4 record then control 4586 ** falls through to the next instruction and P1 is left pointing at the 4587 ** matching entry. 4588 ** 4589 ** This operation leaves the cursor in a state where it cannot be 4590 ** advanced in either direction. In other words, the Next and Prev 4591 ** opcodes do not work after this operation. 4592 ** 4593 ** See also: Found, NotExists, NoConflict, IfNoHope 4594 */ 4595 /* Opcode: IfNoHope P1 P2 P3 P4 * 4596 ** Synopsis: key=r[P3@P4] 4597 ** 4598 ** Register P3 is the first of P4 registers that form an unpacked 4599 ** record. Cursor P1 is an index btree. P2 is a jump destination. 4600 ** In other words, the operands to this opcode are the same as the 4601 ** operands to OP_NotFound and OP_IdxGT. 4602 ** 4603 ** This opcode is an optimization attempt only. If this opcode always 4604 ** falls through, the correct answer is still obtained, but extra works 4605 ** is performed. 4606 ** 4607 ** A value of N in the seekHit flag of cursor P1 means that there exists 4608 ** a key P3:N that will match some record in the index. We want to know 4609 ** if it is possible for a record P3:P4 to match some record in the 4610 ** index. If it is not possible, we can skips some work. So if seekHit 4611 ** is less than P4, attempt to find out if a match is possible by running 4612 ** OP_NotFound. 4613 ** 4614 ** This opcode is used in IN clause processing for a multi-column key. 4615 ** If an IN clause is attached to an element of the key other than the 4616 ** left-most element, and if there are no matches on the most recent 4617 ** seek over the whole key, then it might be that one of the key element 4618 ** to the left is prohibiting a match, and hence there is "no hope" of 4619 ** any match regardless of how many IN clause elements are checked. 4620 ** In such a case, we abandon the IN clause search early, using this 4621 ** opcode. The opcode name comes from the fact that the 4622 ** jump is taken if there is "no hope" of achieving a match. 4623 ** 4624 ** See also: NotFound, SeekHit 4625 */ 4626 /* Opcode: NoConflict P1 P2 P3 P4 * 4627 ** Synopsis: key=r[P3@P4] 4628 ** 4629 ** If P4==0 then register P3 holds a blob constructed by MakeRecord. If 4630 ** P4>0 then register P3 is the first of P4 registers that form an unpacked 4631 ** record. 4632 ** 4633 ** Cursor P1 is on an index btree. If the record identified by P3 and P4 4634 ** contains any NULL value, jump immediately to P2. If all terms of the 4635 ** record are not-NULL then a check is done to determine if any row in the 4636 ** P1 index btree has a matching key prefix. If there are no matches, jump 4637 ** immediately to P2. If there is a match, fall through and leave the P1 4638 ** cursor pointing to the matching row. 4639 ** 4640 ** This opcode is similar to OP_NotFound with the exceptions that the 4641 ** branch is always taken if any part of the search key input is NULL. 4642 ** 4643 ** This operation leaves the cursor in a state where it cannot be 4644 ** advanced in either direction. In other words, the Next and Prev 4645 ** opcodes do not work after this operation. 4646 ** 4647 ** See also: NotFound, Found, NotExists 4648 */ 4649 case OP_IfNoHope: { /* jump, in3 */ 4650 VdbeCursor *pC; 4651 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4652 pC = p->apCsr[pOp->p1]; 4653 assert( pC!=0 ); 4654 if( pC->seekHit>=pOp->p4.i ) break; 4655 /* Fall through into OP_NotFound */ 4656 /* no break */ deliberate_fall_through 4657 } 4658 case OP_NoConflict: /* jump, in3 */ 4659 case OP_NotFound: /* jump, in3 */ 4660 case OP_Found: { /* jump, in3 */ 4661 int alreadyExists; 4662 int takeJump; 4663 int ii; 4664 VdbeCursor *pC; 4665 int res; 4666 UnpackedRecord *pFree; 4667 UnpackedRecord *pIdxKey; 4668 UnpackedRecord r; 4669 4670 #ifdef SQLITE_TEST 4671 if( pOp->opcode!=OP_NoConflict ) sqlite3_found_count++; 4672 #endif 4673 4674 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4675 assert( pOp->p4type==P4_INT32 ); 4676 pC = p->apCsr[pOp->p1]; 4677 assert( pC!=0 ); 4678 #ifdef SQLITE_DEBUG 4679 pC->seekOp = pOp->opcode; 4680 #endif 4681 pIn3 = &aMem[pOp->p3]; 4682 assert( pC->eCurType==CURTYPE_BTREE ); 4683 assert( pC->uc.pCursor!=0 ); 4684 assert( pC->isTable==0 ); 4685 if( pOp->p4.i>0 ){ 4686 r.pKeyInfo = pC->pKeyInfo; 4687 r.nField = (u16)pOp->p4.i; 4688 r.aMem = pIn3; 4689 #ifdef SQLITE_DEBUG 4690 for(ii=0; ii<r.nField; ii++){ 4691 assert( memIsValid(&r.aMem[ii]) ); 4692 assert( (r.aMem[ii].flags & MEM_Zero)==0 || r.aMem[ii].n==0 ); 4693 if( ii ) REGISTER_TRACE(pOp->p3+ii, &r.aMem[ii]); 4694 } 4695 #endif 4696 pIdxKey = &r; 4697 pFree = 0; 4698 }else{ 4699 assert( pIn3->flags & MEM_Blob ); 4700 rc = ExpandBlob(pIn3); 4701 assert( rc==SQLITE_OK || rc==SQLITE_NOMEM ); 4702 if( rc ) goto no_mem; 4703 pFree = pIdxKey = sqlite3VdbeAllocUnpackedRecord(pC->pKeyInfo); 4704 if( pIdxKey==0 ) goto no_mem; 4705 sqlite3VdbeRecordUnpack(pC->pKeyInfo, pIn3->n, pIn3->z, pIdxKey); 4706 } 4707 pIdxKey->default_rc = 0; 4708 takeJump = 0; 4709 if( pOp->opcode==OP_NoConflict ){ 4710 /* For the OP_NoConflict opcode, take the jump if any of the 4711 ** input fields are NULL, since any key with a NULL will not 4712 ** conflict */ 4713 for(ii=0; ii<pIdxKey->nField; ii++){ 4714 if( pIdxKey->aMem[ii].flags & MEM_Null ){ 4715 takeJump = 1; 4716 break; 4717 } 4718 } 4719 } 4720 rc = sqlite3BtreeMovetoUnpacked(pC->uc.pCursor, pIdxKey, 0, 0, &res); 4721 if( pFree ) sqlite3DbFreeNN(db, pFree); 4722 if( rc!=SQLITE_OK ){ 4723 goto abort_due_to_error; 4724 } 4725 pC->seekResult = res; 4726 alreadyExists = (res==0); 4727 pC->nullRow = 1-alreadyExists; 4728 pC->deferredMoveto = 0; 4729 pC->cacheStatus = CACHE_STALE; 4730 if( pOp->opcode==OP_Found ){ 4731 VdbeBranchTaken(alreadyExists!=0,2); 4732 if( alreadyExists ) goto jump_to_p2; 4733 }else{ 4734 VdbeBranchTaken(takeJump||alreadyExists==0,2); 4735 if( takeJump || !alreadyExists ) goto jump_to_p2; 4736 if( pOp->opcode==OP_IfNoHope ) pC->seekHit = pOp->p4.i; 4737 } 4738 break; 4739 } 4740 4741 /* Opcode: SeekRowid P1 P2 P3 * * 4742 ** Synopsis: intkey=r[P3] 4743 ** 4744 ** P1 is the index of a cursor open on an SQL table btree (with integer 4745 ** keys). If register P3 does not contain an integer or if P1 does not 4746 ** contain a record with rowid P3 then jump immediately to P2. 4747 ** Or, if P2 is 0, raise an SQLITE_CORRUPT error. If P1 does contain 4748 ** a record with rowid P3 then 4749 ** leave the cursor pointing at that record and fall through to the next 4750 ** instruction. 4751 ** 4752 ** The OP_NotExists opcode performs the same operation, but with OP_NotExists 4753 ** the P3 register must be guaranteed to contain an integer value. With this 4754 ** opcode, register P3 might not contain an integer. 4755 ** 4756 ** The OP_NotFound opcode performs the same operation on index btrees 4757 ** (with arbitrary multi-value keys). 4758 ** 4759 ** This opcode leaves the cursor in a state where it cannot be advanced 4760 ** in either direction. In other words, the Next and Prev opcodes will 4761 ** not work following this opcode. 4762 ** 4763 ** See also: Found, NotFound, NoConflict, SeekRowid 4764 */ 4765 /* Opcode: NotExists P1 P2 P3 * * 4766 ** Synopsis: intkey=r[P3] 4767 ** 4768 ** P1 is the index of a cursor open on an SQL table btree (with integer 4769 ** keys). P3 is an integer rowid. If P1 does not contain a record with 4770 ** rowid P3 then jump immediately to P2. Or, if P2 is 0, raise an 4771 ** SQLITE_CORRUPT error. If P1 does contain a record with rowid P3 then 4772 ** leave the cursor pointing at that record and fall through to the next 4773 ** instruction. 4774 ** 4775 ** The OP_SeekRowid opcode performs the same operation but also allows the 4776 ** P3 register to contain a non-integer value, in which case the jump is 4777 ** always taken. This opcode requires that P3 always contain an integer. 4778 ** 4779 ** The OP_NotFound opcode performs the same operation on index btrees 4780 ** (with arbitrary multi-value keys). 4781 ** 4782 ** This opcode leaves the cursor in a state where it cannot be advanced 4783 ** in either direction. In other words, the Next and Prev opcodes will 4784 ** not work following this opcode. 4785 ** 4786 ** See also: Found, NotFound, NoConflict, SeekRowid 4787 */ 4788 case OP_SeekRowid: { /* jump, in3 */ 4789 VdbeCursor *pC; 4790 BtCursor *pCrsr; 4791 int res; 4792 u64 iKey; 4793 4794 pIn3 = &aMem[pOp->p3]; 4795 testcase( pIn3->flags & MEM_Int ); 4796 testcase( pIn3->flags & MEM_IntReal ); 4797 testcase( pIn3->flags & MEM_Real ); 4798 testcase( (pIn3->flags & (MEM_Str|MEM_Int))==MEM_Str ); 4799 if( (pIn3->flags & (MEM_Int|MEM_IntReal))==0 ){ 4800 /* If pIn3->u.i does not contain an integer, compute iKey as the 4801 ** integer value of pIn3. Jump to P2 if pIn3 cannot be converted 4802 ** into an integer without loss of information. Take care to avoid 4803 ** changing the datatype of pIn3, however, as it is used by other 4804 ** parts of the prepared statement. */ 4805 Mem x = pIn3[0]; 4806 applyAffinity(&x, SQLITE_AFF_NUMERIC, encoding); 4807 if( (x.flags & MEM_Int)==0 ) goto jump_to_p2; 4808 iKey = x.u.i; 4809 goto notExistsWithKey; 4810 } 4811 /* Fall through into OP_NotExists */ 4812 /* no break */ deliberate_fall_through 4813 case OP_NotExists: /* jump, in3 */ 4814 pIn3 = &aMem[pOp->p3]; 4815 assert( (pIn3->flags & MEM_Int)!=0 || pOp->opcode==OP_SeekRowid ); 4816 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4817 iKey = pIn3->u.i; 4818 notExistsWithKey: 4819 pC = p->apCsr[pOp->p1]; 4820 assert( pC!=0 ); 4821 #ifdef SQLITE_DEBUG 4822 if( pOp->opcode==OP_SeekRowid ) pC->seekOp = OP_SeekRowid; 4823 #endif 4824 assert( pC->isTable ); 4825 assert( pC->eCurType==CURTYPE_BTREE ); 4826 pCrsr = pC->uc.pCursor; 4827 assert( pCrsr!=0 ); 4828 res = 0; 4829 rc = sqlite3BtreeMovetoUnpacked(pCrsr, 0, iKey, 0, &res); 4830 assert( rc==SQLITE_OK || res==0 ); 4831 pC->movetoTarget = iKey; /* Used by OP_Delete */ 4832 pC->nullRow = 0; 4833 pC->cacheStatus = CACHE_STALE; 4834 pC->deferredMoveto = 0; 4835 VdbeBranchTaken(res!=0,2); 4836 pC->seekResult = res; 4837 if( res!=0 ){ 4838 assert( rc==SQLITE_OK ); 4839 if( pOp->p2==0 ){ 4840 rc = SQLITE_CORRUPT_BKPT; 4841 }else{ 4842 goto jump_to_p2; 4843 } 4844 } 4845 if( rc ) goto abort_due_to_error; 4846 break; 4847 } 4848 4849 /* Opcode: Sequence P1 P2 * * * 4850 ** Synopsis: r[P2]=cursor[P1].ctr++ 4851 ** 4852 ** Find the next available sequence number for cursor P1. 4853 ** Write the sequence number into register P2. 4854 ** The sequence number on the cursor is incremented after this 4855 ** instruction. 4856 */ 4857 case OP_Sequence: { /* out2 */ 4858 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4859 assert( p->apCsr[pOp->p1]!=0 ); 4860 assert( p->apCsr[pOp->p1]->eCurType!=CURTYPE_VTAB ); 4861 pOut = out2Prerelease(p, pOp); 4862 pOut->u.i = p->apCsr[pOp->p1]->seqCount++; 4863 break; 4864 } 4865 4866 4867 /* Opcode: NewRowid P1 P2 P3 * * 4868 ** Synopsis: r[P2]=rowid 4869 ** 4870 ** Get a new integer record number (a.k.a "rowid") used as the key to a table. 4871 ** The record number is not previously used as a key in the database 4872 ** table that cursor P1 points to. The new record number is written 4873 ** written to register P2. 4874 ** 4875 ** If P3>0 then P3 is a register in the root frame of this VDBE that holds 4876 ** the largest previously generated record number. No new record numbers are 4877 ** allowed to be less than this value. When this value reaches its maximum, 4878 ** an SQLITE_FULL error is generated. The P3 register is updated with the ' 4879 ** generated record number. This P3 mechanism is used to help implement the 4880 ** AUTOINCREMENT feature. 4881 */ 4882 case OP_NewRowid: { /* out2 */ 4883 i64 v; /* The new rowid */ 4884 VdbeCursor *pC; /* Cursor of table to get the new rowid */ 4885 int res; /* Result of an sqlite3BtreeLast() */ 4886 int cnt; /* Counter to limit the number of searches */ 4887 #ifndef SQLITE_OMIT_AUTOINCREMENT 4888 Mem *pMem; /* Register holding largest rowid for AUTOINCREMENT */ 4889 VdbeFrame *pFrame; /* Root frame of VDBE */ 4890 #endif 4891 4892 v = 0; 4893 res = 0; 4894 pOut = out2Prerelease(p, pOp); 4895 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 4896 pC = p->apCsr[pOp->p1]; 4897 assert( pC!=0 ); 4898 assert( pC->isTable ); 4899 assert( pC->eCurType==CURTYPE_BTREE ); 4900 assert( pC->uc.pCursor!=0 ); 4901 { 4902 /* The next rowid or record number (different terms for the same 4903 ** thing) is obtained in a two-step algorithm. 4904 ** 4905 ** First we attempt to find the largest existing rowid and add one 4906 ** to that. But if the largest existing rowid is already the maximum 4907 ** positive integer, we have to fall through to the second 4908 ** probabilistic algorithm 4909 ** 4910 ** The second algorithm is to select a rowid at random and see if 4911 ** it already exists in the table. If it does not exist, we have 4912 ** succeeded. If the random rowid does exist, we select a new one 4913 ** and try again, up to 100 times. 4914 */ 4915 assert( pC->isTable ); 4916 4917 #ifdef SQLITE_32BIT_ROWID 4918 # define MAX_ROWID 0x7fffffff 4919 #else 4920 /* Some compilers complain about constants of the form 0x7fffffffffffffff. 4921 ** Others complain about 0x7ffffffffffffffffLL. The following macro seems 4922 ** to provide the constant while making all compilers happy. 4923 */ 4924 # define MAX_ROWID (i64)( (((u64)0x7fffffff)<<32) | (u64)0xffffffff ) 4925 #endif 4926 4927 if( !pC->useRandomRowid ){ 4928 rc = sqlite3BtreeLast(pC->uc.pCursor, &res); 4929 if( rc!=SQLITE_OK ){ 4930 goto abort_due_to_error; 4931 } 4932 if( res ){ 4933 v = 1; /* IMP: R-61914-48074 */ 4934 }else{ 4935 assert( sqlite3BtreeCursorIsValid(pC->uc.pCursor) ); 4936 v = sqlite3BtreeIntegerKey(pC->uc.pCursor); 4937 if( v>=MAX_ROWID ){ 4938 pC->useRandomRowid = 1; 4939 }else{ 4940 v++; /* IMP: R-29538-34987 */ 4941 } 4942 } 4943 } 4944 4945 #ifndef SQLITE_OMIT_AUTOINCREMENT 4946 if( pOp->p3 ){ 4947 /* Assert that P3 is a valid memory cell. */ 4948 assert( pOp->p3>0 ); 4949 if( p->pFrame ){ 4950 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent); 4951 /* Assert that P3 is a valid memory cell. */ 4952 assert( pOp->p3<=pFrame->nMem ); 4953 pMem = &pFrame->aMem[pOp->p3]; 4954 }else{ 4955 /* Assert that P3 is a valid memory cell. */ 4956 assert( pOp->p3<=(p->nMem+1 - p->nCursor) ); 4957 pMem = &aMem[pOp->p3]; 4958 memAboutToChange(p, pMem); 4959 } 4960 assert( memIsValid(pMem) ); 4961 4962 REGISTER_TRACE(pOp->p3, pMem); 4963 sqlite3VdbeMemIntegerify(pMem); 4964 assert( (pMem->flags & MEM_Int)!=0 ); /* mem(P3) holds an integer */ 4965 if( pMem->u.i==MAX_ROWID || pC->useRandomRowid ){ 4966 rc = SQLITE_FULL; /* IMP: R-17817-00630 */ 4967 goto abort_due_to_error; 4968 } 4969 if( v<pMem->u.i+1 ){ 4970 v = pMem->u.i + 1; 4971 } 4972 pMem->u.i = v; 4973 } 4974 #endif 4975 if( pC->useRandomRowid ){ 4976 /* IMPLEMENTATION-OF: R-07677-41881 If the largest ROWID is equal to the 4977 ** largest possible integer (9223372036854775807) then the database 4978 ** engine starts picking positive candidate ROWIDs at random until 4979 ** it finds one that is not previously used. */ 4980 assert( pOp->p3==0 ); /* We cannot be in random rowid mode if this is 4981 ** an AUTOINCREMENT table. */ 4982 cnt = 0; 4983 do{ 4984 sqlite3_randomness(sizeof(v), &v); 4985 v &= (MAX_ROWID>>1); v++; /* Ensure that v is greater than zero */ 4986 }while( ((rc = sqlite3BtreeMovetoUnpacked(pC->uc.pCursor, 0, (u64)v, 4987 0, &res))==SQLITE_OK) 4988 && (res==0) 4989 && (++cnt<100)); 4990 if( rc ) goto abort_due_to_error; 4991 if( res==0 ){ 4992 rc = SQLITE_FULL; /* IMP: R-38219-53002 */ 4993 goto abort_due_to_error; 4994 } 4995 assert( v>0 ); /* EV: R-40812-03570 */ 4996 } 4997 pC->deferredMoveto = 0; 4998 pC->cacheStatus = CACHE_STALE; 4999 } 5000 pOut->u.i = v; 5001 break; 5002 } 5003 5004 /* Opcode: Insert P1 P2 P3 P4 P5 5005 ** Synopsis: intkey=r[P3] data=r[P2] 5006 ** 5007 ** Write an entry into the table of cursor P1. A new entry is 5008 ** created if it doesn't already exist or the data for an existing 5009 ** entry is overwritten. The data is the value MEM_Blob stored in register 5010 ** number P2. The key is stored in register P3. The key must 5011 ** be a MEM_Int. 5012 ** 5013 ** If the OPFLAG_NCHANGE flag of P5 is set, then the row change count is 5014 ** incremented (otherwise not). If the OPFLAG_LASTROWID flag of P5 is set, 5015 ** then rowid is stored for subsequent return by the 5016 ** sqlite3_last_insert_rowid() function (otherwise it is unmodified). 5017 ** 5018 ** If the OPFLAG_USESEEKRESULT flag of P5 is set, the implementation might 5019 ** run faster by avoiding an unnecessary seek on cursor P1. However, 5020 ** the OPFLAG_USESEEKRESULT flag must only be set if there have been no prior 5021 ** seeks on the cursor or if the most recent seek used a key equal to P3. 5022 ** 5023 ** If the OPFLAG_ISUPDATE flag is set, then this opcode is part of an 5024 ** UPDATE operation. Otherwise (if the flag is clear) then this opcode 5025 ** is part of an INSERT operation. The difference is only important to 5026 ** the update hook. 5027 ** 5028 ** Parameter P4 may point to a Table structure, or may be NULL. If it is 5029 ** not NULL, then the update-hook (sqlite3.xUpdateCallback) is invoked 5030 ** following a successful insert. 5031 ** 5032 ** (WARNING/TODO: If P1 is a pseudo-cursor and P2 is dynamically 5033 ** allocated, then ownership of P2 is transferred to the pseudo-cursor 5034 ** and register P2 becomes ephemeral. If the cursor is changed, the 5035 ** value of register P2 will then change. Make sure this does not 5036 ** cause any problems.) 5037 ** 5038 ** This instruction only works on tables. The equivalent instruction 5039 ** for indices is OP_IdxInsert. 5040 */ 5041 case OP_Insert: { 5042 Mem *pData; /* MEM cell holding data for the record to be inserted */ 5043 Mem *pKey; /* MEM cell holding key for the record */ 5044 VdbeCursor *pC; /* Cursor to table into which insert is written */ 5045 int seekResult; /* Result of prior seek or 0 if no USESEEKRESULT flag */ 5046 const char *zDb; /* database name - used by the update hook */ 5047 Table *pTab; /* Table structure - used by update and pre-update hooks */ 5048 BtreePayload x; /* Payload to be inserted */ 5049 5050 pData = &aMem[pOp->p2]; 5051 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5052 assert( memIsValid(pData) ); 5053 pC = p->apCsr[pOp->p1]; 5054 assert( pC!=0 ); 5055 assert( pC->eCurType==CURTYPE_BTREE ); 5056 assert( pC->deferredMoveto==0 ); 5057 assert( pC->uc.pCursor!=0 ); 5058 assert( (pOp->p5 & OPFLAG_ISNOOP) || pC->isTable ); 5059 assert( pOp->p4type==P4_TABLE || pOp->p4type>=P4_STATIC ); 5060 REGISTER_TRACE(pOp->p2, pData); 5061 sqlite3VdbeIncrWriteCounter(p, pC); 5062 5063 pKey = &aMem[pOp->p3]; 5064 assert( pKey->flags & MEM_Int ); 5065 assert( memIsValid(pKey) ); 5066 REGISTER_TRACE(pOp->p3, pKey); 5067 x.nKey = pKey->u.i; 5068 5069 if( pOp->p4type==P4_TABLE && HAS_UPDATE_HOOK(db) ){ 5070 assert( pC->iDb>=0 ); 5071 zDb = db->aDb[pC->iDb].zDbSName; 5072 pTab = pOp->p4.pTab; 5073 assert( (pOp->p5 & OPFLAG_ISNOOP) || HasRowid(pTab) ); 5074 }else{ 5075 pTab = 0; 5076 zDb = 0; /* Not needed. Silence a compiler warning. */ 5077 } 5078 5079 #ifdef SQLITE_ENABLE_PREUPDATE_HOOK 5080 /* Invoke the pre-update hook, if any */ 5081 if( pTab ){ 5082 if( db->xPreUpdateCallback && !(pOp->p5 & OPFLAG_ISUPDATE) ){ 5083 sqlite3VdbePreUpdateHook(p, pC, SQLITE_INSERT, zDb, pTab, x.nKey,pOp->p2); 5084 } 5085 if( db->xUpdateCallback==0 || pTab->aCol==0 ){ 5086 /* Prevent post-update hook from running in cases when it should not */ 5087 pTab = 0; 5088 } 5089 } 5090 if( pOp->p5 & OPFLAG_ISNOOP ) break; 5091 #endif 5092 5093 if( pOp->p5 & OPFLAG_NCHANGE ) p->nChange++; 5094 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = x.nKey; 5095 assert( (pData->flags & (MEM_Blob|MEM_Str))!=0 || pData->n==0 ); 5096 x.pData = pData->z; 5097 x.nData = pData->n; 5098 seekResult = ((pOp->p5 & OPFLAG_USESEEKRESULT) ? pC->seekResult : 0); 5099 if( pData->flags & MEM_Zero ){ 5100 x.nZero = pData->u.nZero; 5101 }else{ 5102 x.nZero = 0; 5103 } 5104 x.pKey = 0; 5105 rc = sqlite3BtreeInsert(pC->uc.pCursor, &x, 5106 (pOp->p5 & (OPFLAG_APPEND|OPFLAG_SAVEPOSITION|OPFLAG_PREFORMAT)), 5107 seekResult 5108 ); 5109 pC->deferredMoveto = 0; 5110 pC->cacheStatus = CACHE_STALE; 5111 5112 /* Invoke the update-hook if required. */ 5113 if( rc ) goto abort_due_to_error; 5114 if( pTab ){ 5115 assert( db->xUpdateCallback!=0 ); 5116 assert( pTab->aCol!=0 ); 5117 db->xUpdateCallback(db->pUpdateArg, 5118 (pOp->p5 & OPFLAG_ISUPDATE) ? SQLITE_UPDATE : SQLITE_INSERT, 5119 zDb, pTab->zName, x.nKey); 5120 } 5121 break; 5122 } 5123 5124 /* Opcode: RowCell P1 P2 P3 * * 5125 ** 5126 ** P1 and P2 are both open cursors. Both must be opened on the same type 5127 ** of table - intkey or index. This opcode is used as part of copying 5128 ** the current row from P2 into P1. If the cursors are opened on intkey 5129 ** tables, register P3 contains the rowid to use with the new record in 5130 ** P1. If they are opened on index tables, P3 is not used. 5131 ** 5132 ** This opcode must be followed by either an Insert or InsertIdx opcode 5133 ** with the OPFLAG_PREFORMAT flag set to complete the insert operation. 5134 */ 5135 case OP_RowCell: { 5136 VdbeCursor *pDest; /* Cursor to write to */ 5137 VdbeCursor *pSrc; /* Cursor to read from */ 5138 i64 iKey; /* Rowid value to insert with */ 5139 assert( pOp[1].opcode==OP_Insert || pOp[1].opcode==OP_IdxInsert ); 5140 assert( pOp[1].opcode==OP_Insert || pOp->p3==0 ); 5141 assert( pOp[1].opcode==OP_IdxInsert || pOp->p3>0 ); 5142 assert( pOp[1].p5 & OPFLAG_PREFORMAT ); 5143 pDest = p->apCsr[pOp->p1]; 5144 pSrc = p->apCsr[pOp->p2]; 5145 iKey = pOp->p3 ? aMem[pOp->p3].u.i : 0; 5146 rc = sqlite3BtreeTransferRow(pDest->uc.pCursor, pSrc->uc.pCursor, iKey); 5147 if( rc!=SQLITE_OK ) goto abort_due_to_error; 5148 break; 5149 }; 5150 5151 /* Opcode: Delete P1 P2 P3 P4 P5 5152 ** 5153 ** Delete the record at which the P1 cursor is currently pointing. 5154 ** 5155 ** If the OPFLAG_SAVEPOSITION bit of the P5 parameter is set, then 5156 ** the cursor will be left pointing at either the next or the previous 5157 ** record in the table. If it is left pointing at the next record, then 5158 ** the next Next instruction will be a no-op. As a result, in this case 5159 ** it is ok to delete a record from within a Next loop. If 5160 ** OPFLAG_SAVEPOSITION bit of P5 is clear, then the cursor will be 5161 ** left in an undefined state. 5162 ** 5163 ** If the OPFLAG_AUXDELETE bit is set on P5, that indicates that this 5164 ** delete one of several associated with deleting a table row and all its 5165 ** associated index entries. Exactly one of those deletes is the "primary" 5166 ** delete. The others are all on OPFLAG_FORDELETE cursors or else are 5167 ** marked with the AUXDELETE flag. 5168 ** 5169 ** If the OPFLAG_NCHANGE flag of P2 (NB: P2 not P5) is set, then the row 5170 ** change count is incremented (otherwise not). 5171 ** 5172 ** P1 must not be pseudo-table. It has to be a real table with 5173 ** multiple rows. 5174 ** 5175 ** If P4 is not NULL then it points to a Table object. In this case either 5176 ** the update or pre-update hook, or both, may be invoked. The P1 cursor must 5177 ** have been positioned using OP_NotFound prior to invoking this opcode in 5178 ** this case. Specifically, if one is configured, the pre-update hook is 5179 ** invoked if P4 is not NULL. The update-hook is invoked if one is configured, 5180 ** P4 is not NULL, and the OPFLAG_NCHANGE flag is set in P2. 5181 ** 5182 ** If the OPFLAG_ISUPDATE flag is set in P2, then P3 contains the address 5183 ** of the memory cell that contains the value that the rowid of the row will 5184 ** be set to by the update. 5185 */ 5186 case OP_Delete: { 5187 VdbeCursor *pC; 5188 const char *zDb; 5189 Table *pTab; 5190 int opflags; 5191 5192 opflags = pOp->p2; 5193 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5194 pC = p->apCsr[pOp->p1]; 5195 assert( pC!=0 ); 5196 assert( pC->eCurType==CURTYPE_BTREE ); 5197 assert( pC->uc.pCursor!=0 ); 5198 assert( pC->deferredMoveto==0 ); 5199 sqlite3VdbeIncrWriteCounter(p, pC); 5200 5201 #ifdef SQLITE_DEBUG 5202 if( pOp->p4type==P4_TABLE 5203 && HasRowid(pOp->p4.pTab) 5204 && pOp->p5==0 5205 && sqlite3BtreeCursorIsValidNN(pC->uc.pCursor) 5206 ){ 5207 /* If p5 is zero, the seek operation that positioned the cursor prior to 5208 ** OP_Delete will have also set the pC->movetoTarget field to the rowid of 5209 ** the row that is being deleted */ 5210 i64 iKey = sqlite3BtreeIntegerKey(pC->uc.pCursor); 5211 assert( CORRUPT_DB || pC->movetoTarget==iKey ); 5212 } 5213 #endif 5214 5215 /* If the update-hook or pre-update-hook will be invoked, set zDb to 5216 ** the name of the db to pass as to it. Also set local pTab to a copy 5217 ** of p4.pTab. Finally, if p5 is true, indicating that this cursor was 5218 ** last moved with OP_Next or OP_Prev, not Seek or NotFound, set 5219 ** VdbeCursor.movetoTarget to the current rowid. */ 5220 if( pOp->p4type==P4_TABLE && HAS_UPDATE_HOOK(db) ){ 5221 assert( pC->iDb>=0 ); 5222 assert( pOp->p4.pTab!=0 ); 5223 zDb = db->aDb[pC->iDb].zDbSName; 5224 pTab = pOp->p4.pTab; 5225 if( (pOp->p5 & OPFLAG_SAVEPOSITION)!=0 && pC->isTable ){ 5226 pC->movetoTarget = sqlite3BtreeIntegerKey(pC->uc.pCursor); 5227 } 5228 }else{ 5229 zDb = 0; /* Not needed. Silence a compiler warning. */ 5230 pTab = 0; /* Not needed. Silence a compiler warning. */ 5231 } 5232 5233 #ifdef SQLITE_ENABLE_PREUPDATE_HOOK 5234 /* Invoke the pre-update-hook if required. */ 5235 if( db->xPreUpdateCallback && pOp->p4.pTab ){ 5236 assert( !(opflags & OPFLAG_ISUPDATE) 5237 || HasRowid(pTab)==0 5238 || (aMem[pOp->p3].flags & MEM_Int) 5239 ); 5240 sqlite3VdbePreUpdateHook(p, pC, 5241 (opflags & OPFLAG_ISUPDATE) ? SQLITE_UPDATE : SQLITE_DELETE, 5242 zDb, pTab, pC->movetoTarget, 5243 pOp->p3 5244 ); 5245 } 5246 if( opflags & OPFLAG_ISNOOP ) break; 5247 #endif 5248 5249 /* Only flags that can be set are SAVEPOISTION and AUXDELETE */ 5250 assert( (pOp->p5 & ~(OPFLAG_SAVEPOSITION|OPFLAG_AUXDELETE))==0 ); 5251 assert( OPFLAG_SAVEPOSITION==BTREE_SAVEPOSITION ); 5252 assert( OPFLAG_AUXDELETE==BTREE_AUXDELETE ); 5253 5254 #ifdef SQLITE_DEBUG 5255 if( p->pFrame==0 ){ 5256 if( pC->isEphemeral==0 5257 && (pOp->p5 & OPFLAG_AUXDELETE)==0 5258 && (pC->wrFlag & OPFLAG_FORDELETE)==0 5259 ){ 5260 nExtraDelete++; 5261 } 5262 if( pOp->p2 & OPFLAG_NCHANGE ){ 5263 nExtraDelete--; 5264 } 5265 } 5266 #endif 5267 5268 rc = sqlite3BtreeDelete(pC->uc.pCursor, pOp->p5); 5269 pC->cacheStatus = CACHE_STALE; 5270 pC->seekResult = 0; 5271 if( rc ) goto abort_due_to_error; 5272 5273 /* Invoke the update-hook if required. */ 5274 if( opflags & OPFLAG_NCHANGE ){ 5275 p->nChange++; 5276 if( db->xUpdateCallback && HasRowid(pTab) ){ 5277 db->xUpdateCallback(db->pUpdateArg, SQLITE_DELETE, zDb, pTab->zName, 5278 pC->movetoTarget); 5279 assert( pC->iDb>=0 ); 5280 } 5281 } 5282 5283 break; 5284 } 5285 /* Opcode: ResetCount * * * * * 5286 ** 5287 ** The value of the change counter is copied to the database handle 5288 ** change counter (returned by subsequent calls to sqlite3_changes()). 5289 ** Then the VMs internal change counter resets to 0. 5290 ** This is used by trigger programs. 5291 */ 5292 case OP_ResetCount: { 5293 sqlite3VdbeSetChanges(db, p->nChange); 5294 p->nChange = 0; 5295 break; 5296 } 5297 5298 /* Opcode: SorterCompare P1 P2 P3 P4 5299 ** Synopsis: if key(P1)!=trim(r[P3],P4) goto P2 5300 ** 5301 ** P1 is a sorter cursor. This instruction compares a prefix of the 5302 ** record blob in register P3 against a prefix of the entry that 5303 ** the sorter cursor currently points to. Only the first P4 fields 5304 ** of r[P3] and the sorter record are compared. 5305 ** 5306 ** If either P3 or the sorter contains a NULL in one of their significant 5307 ** fields (not counting the P4 fields at the end which are ignored) then 5308 ** the comparison is assumed to be equal. 5309 ** 5310 ** Fall through to next instruction if the two records compare equal to 5311 ** each other. Jump to P2 if they are different. 5312 */ 5313 case OP_SorterCompare: { 5314 VdbeCursor *pC; 5315 int res; 5316 int nKeyCol; 5317 5318 pC = p->apCsr[pOp->p1]; 5319 assert( isSorter(pC) ); 5320 assert( pOp->p4type==P4_INT32 ); 5321 pIn3 = &aMem[pOp->p3]; 5322 nKeyCol = pOp->p4.i; 5323 res = 0; 5324 rc = sqlite3VdbeSorterCompare(pC, pIn3, nKeyCol, &res); 5325 VdbeBranchTaken(res!=0,2); 5326 if( rc ) goto abort_due_to_error; 5327 if( res ) goto jump_to_p2; 5328 break; 5329 }; 5330 5331 /* Opcode: SorterData P1 P2 P3 * * 5332 ** Synopsis: r[P2]=data 5333 ** 5334 ** Write into register P2 the current sorter data for sorter cursor P1. 5335 ** Then clear the column header cache on cursor P3. 5336 ** 5337 ** This opcode is normally use to move a record out of the sorter and into 5338 ** a register that is the source for a pseudo-table cursor created using 5339 ** OpenPseudo. That pseudo-table cursor is the one that is identified by 5340 ** parameter P3. Clearing the P3 column cache as part of this opcode saves 5341 ** us from having to issue a separate NullRow instruction to clear that cache. 5342 */ 5343 case OP_SorterData: { 5344 VdbeCursor *pC; 5345 5346 pOut = &aMem[pOp->p2]; 5347 pC = p->apCsr[pOp->p1]; 5348 assert( isSorter(pC) ); 5349 rc = sqlite3VdbeSorterRowkey(pC, pOut); 5350 assert( rc!=SQLITE_OK || (pOut->flags & MEM_Blob) ); 5351 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5352 if( rc ) goto abort_due_to_error; 5353 p->apCsr[pOp->p3]->cacheStatus = CACHE_STALE; 5354 break; 5355 } 5356 5357 /* Opcode: RowData P1 P2 P3 * * 5358 ** Synopsis: r[P2]=data 5359 ** 5360 ** Write into register P2 the complete row content for the row at 5361 ** which cursor P1 is currently pointing. 5362 ** There is no interpretation of the data. 5363 ** It is just copied onto the P2 register exactly as 5364 ** it is found in the database file. 5365 ** 5366 ** If cursor P1 is an index, then the content is the key of the row. 5367 ** If cursor P2 is a table, then the content extracted is the data. 5368 ** 5369 ** If the P1 cursor must be pointing to a valid row (not a NULL row) 5370 ** of a real table, not a pseudo-table. 5371 ** 5372 ** If P3!=0 then this opcode is allowed to make an ephemeral pointer 5373 ** into the database page. That means that the content of the output 5374 ** register will be invalidated as soon as the cursor moves - including 5375 ** moves caused by other cursors that "save" the current cursors 5376 ** position in order that they can write to the same table. If P3==0 5377 ** then a copy of the data is made into memory. P3!=0 is faster, but 5378 ** P3==0 is safer. 5379 ** 5380 ** If P3!=0 then the content of the P2 register is unsuitable for use 5381 ** in OP_Result and any OP_Result will invalidate the P2 register content. 5382 ** The P2 register content is invalidated by opcodes like OP_Function or 5383 ** by any use of another cursor pointing to the same table. 5384 */ 5385 case OP_RowData: { 5386 VdbeCursor *pC; 5387 BtCursor *pCrsr; 5388 u32 n; 5389 5390 pOut = out2Prerelease(p, pOp); 5391 5392 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5393 pC = p->apCsr[pOp->p1]; 5394 assert( pC!=0 ); 5395 assert( pC->eCurType==CURTYPE_BTREE ); 5396 assert( isSorter(pC)==0 ); 5397 assert( pC->nullRow==0 ); 5398 assert( pC->uc.pCursor!=0 ); 5399 pCrsr = pC->uc.pCursor; 5400 5401 /* The OP_RowData opcodes always follow OP_NotExists or 5402 ** OP_SeekRowid or OP_Rewind/Op_Next with no intervening instructions 5403 ** that might invalidate the cursor. 5404 ** If this where not the case, on of the following assert()s 5405 ** would fail. Should this ever change (because of changes in the code 5406 ** generator) then the fix would be to insert a call to 5407 ** sqlite3VdbeCursorMoveto(). 5408 */ 5409 assert( pC->deferredMoveto==0 ); 5410 assert( sqlite3BtreeCursorIsValid(pCrsr) ); 5411 5412 n = sqlite3BtreePayloadSize(pCrsr); 5413 if( n>(u32)db->aLimit[SQLITE_LIMIT_LENGTH] ){ 5414 goto too_big; 5415 } 5416 testcase( n==0 ); 5417 rc = sqlite3VdbeMemFromBtreeZeroOffset(pCrsr, n, pOut); 5418 if( rc ) goto abort_due_to_error; 5419 if( !pOp->p3 ) Deephemeralize(pOut); 5420 UPDATE_MAX_BLOBSIZE(pOut); 5421 REGISTER_TRACE(pOp->p2, pOut); 5422 break; 5423 } 5424 5425 /* Opcode: Rowid P1 P2 * * * 5426 ** Synopsis: r[P2]=rowid 5427 ** 5428 ** Store in register P2 an integer which is the key of the table entry that 5429 ** P1 is currently point to. 5430 ** 5431 ** P1 can be either an ordinary table or a virtual table. There used to 5432 ** be a separate OP_VRowid opcode for use with virtual tables, but this 5433 ** one opcode now works for both table types. 5434 */ 5435 case OP_Rowid: { /* out2 */ 5436 VdbeCursor *pC; 5437 i64 v; 5438 sqlite3_vtab *pVtab; 5439 const sqlite3_module *pModule; 5440 5441 pOut = out2Prerelease(p, pOp); 5442 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5443 pC = p->apCsr[pOp->p1]; 5444 assert( pC!=0 ); 5445 assert( pC->eCurType!=CURTYPE_PSEUDO || pC->nullRow ); 5446 if( pC->nullRow ){ 5447 pOut->flags = MEM_Null; 5448 break; 5449 }else if( pC->deferredMoveto ){ 5450 v = pC->movetoTarget; 5451 #ifndef SQLITE_OMIT_VIRTUALTABLE 5452 }else if( pC->eCurType==CURTYPE_VTAB ){ 5453 assert( pC->uc.pVCur!=0 ); 5454 pVtab = pC->uc.pVCur->pVtab; 5455 pModule = pVtab->pModule; 5456 assert( pModule->xRowid ); 5457 rc = pModule->xRowid(pC->uc.pVCur, &v); 5458 sqlite3VtabImportErrmsg(p, pVtab); 5459 if( rc ) goto abort_due_to_error; 5460 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 5461 }else{ 5462 assert( pC->eCurType==CURTYPE_BTREE ); 5463 assert( pC->uc.pCursor!=0 ); 5464 rc = sqlite3VdbeCursorRestore(pC); 5465 if( rc ) goto abort_due_to_error; 5466 if( pC->nullRow ){ 5467 pOut->flags = MEM_Null; 5468 break; 5469 } 5470 v = sqlite3BtreeIntegerKey(pC->uc.pCursor); 5471 } 5472 pOut->u.i = v; 5473 break; 5474 } 5475 5476 /* Opcode: NullRow P1 * * * * 5477 ** 5478 ** Move the cursor P1 to a null row. Any OP_Column operations 5479 ** that occur while the cursor is on the null row will always 5480 ** write a NULL. 5481 */ 5482 case OP_NullRow: { 5483 VdbeCursor *pC; 5484 5485 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5486 pC = p->apCsr[pOp->p1]; 5487 assert( pC!=0 ); 5488 pC->nullRow = 1; 5489 pC->cacheStatus = CACHE_STALE; 5490 if( pC->eCurType==CURTYPE_BTREE ){ 5491 assert( pC->uc.pCursor!=0 ); 5492 sqlite3BtreeClearCursor(pC->uc.pCursor); 5493 } 5494 #ifdef SQLITE_DEBUG 5495 if( pC->seekOp==0 ) pC->seekOp = OP_NullRow; 5496 #endif 5497 break; 5498 } 5499 5500 /* Opcode: SeekEnd P1 * * * * 5501 ** 5502 ** Position cursor P1 at the end of the btree for the purpose of 5503 ** appending a new entry onto the btree. 5504 ** 5505 ** It is assumed that the cursor is used only for appending and so 5506 ** if the cursor is valid, then the cursor must already be pointing 5507 ** at the end of the btree and so no changes are made to 5508 ** the cursor. 5509 */ 5510 /* Opcode: Last P1 P2 * * * 5511 ** 5512 ** The next use of the Rowid or Column or Prev instruction for P1 5513 ** will refer to the last entry in the database table or index. 5514 ** If the table or index is empty and P2>0, then jump immediately to P2. 5515 ** If P2 is 0 or if the table or index is not empty, fall through 5516 ** to the following instruction. 5517 ** 5518 ** This opcode leaves the cursor configured to move in reverse order, 5519 ** from the end toward the beginning. In other words, the cursor is 5520 ** configured to use Prev, not Next. 5521 */ 5522 case OP_SeekEnd: 5523 case OP_Last: { /* jump */ 5524 VdbeCursor *pC; 5525 BtCursor *pCrsr; 5526 int res; 5527 5528 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5529 pC = p->apCsr[pOp->p1]; 5530 assert( pC!=0 ); 5531 assert( pC->eCurType==CURTYPE_BTREE ); 5532 pCrsr = pC->uc.pCursor; 5533 res = 0; 5534 assert( pCrsr!=0 ); 5535 #ifdef SQLITE_DEBUG 5536 pC->seekOp = pOp->opcode; 5537 #endif 5538 if( pOp->opcode==OP_SeekEnd ){ 5539 assert( pOp->p2==0 ); 5540 pC->seekResult = -1; 5541 if( sqlite3BtreeCursorIsValidNN(pCrsr) ){ 5542 break; 5543 } 5544 } 5545 rc = sqlite3BtreeLast(pCrsr, &res); 5546 pC->nullRow = (u8)res; 5547 pC->deferredMoveto = 0; 5548 pC->cacheStatus = CACHE_STALE; 5549 if( rc ) goto abort_due_to_error; 5550 if( pOp->p2>0 ){ 5551 VdbeBranchTaken(res!=0,2); 5552 if( res ) goto jump_to_p2; 5553 } 5554 break; 5555 } 5556 5557 /* Opcode: IfSmaller P1 P2 P3 * * 5558 ** 5559 ** Estimate the number of rows in the table P1. Jump to P2 if that 5560 ** estimate is less than approximately 2**(0.1*P3). 5561 */ 5562 case OP_IfSmaller: { /* jump */ 5563 VdbeCursor *pC; 5564 BtCursor *pCrsr; 5565 int res; 5566 i64 sz; 5567 5568 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5569 pC = p->apCsr[pOp->p1]; 5570 assert( pC!=0 ); 5571 pCrsr = pC->uc.pCursor; 5572 assert( pCrsr ); 5573 rc = sqlite3BtreeFirst(pCrsr, &res); 5574 if( rc ) goto abort_due_to_error; 5575 if( res==0 ){ 5576 sz = sqlite3BtreeRowCountEst(pCrsr); 5577 if( ALWAYS(sz>=0) && sqlite3LogEst((u64)sz)<pOp->p3 ) res = 1; 5578 } 5579 VdbeBranchTaken(res!=0,2); 5580 if( res ) goto jump_to_p2; 5581 break; 5582 } 5583 5584 5585 /* Opcode: SorterSort P1 P2 * * * 5586 ** 5587 ** After all records have been inserted into the Sorter object 5588 ** identified by P1, invoke this opcode to actually do the sorting. 5589 ** Jump to P2 if there are no records to be sorted. 5590 ** 5591 ** This opcode is an alias for OP_Sort and OP_Rewind that is used 5592 ** for Sorter objects. 5593 */ 5594 /* Opcode: Sort P1 P2 * * * 5595 ** 5596 ** This opcode does exactly the same thing as OP_Rewind except that 5597 ** it increments an undocumented global variable used for testing. 5598 ** 5599 ** Sorting is accomplished by writing records into a sorting index, 5600 ** then rewinding that index and playing it back from beginning to 5601 ** end. We use the OP_Sort opcode instead of OP_Rewind to do the 5602 ** rewinding so that the global variable will be incremented and 5603 ** regression tests can determine whether or not the optimizer is 5604 ** correctly optimizing out sorts. 5605 */ 5606 case OP_SorterSort: /* jump */ 5607 case OP_Sort: { /* jump */ 5608 #ifdef SQLITE_TEST 5609 sqlite3_sort_count++; 5610 sqlite3_search_count--; 5611 #endif 5612 p->aCounter[SQLITE_STMTSTATUS_SORT]++; 5613 /* Fall through into OP_Rewind */ 5614 /* no break */ deliberate_fall_through 5615 } 5616 /* Opcode: Rewind P1 P2 * * * 5617 ** 5618 ** The next use of the Rowid or Column or Next instruction for P1 5619 ** will refer to the first entry in the database table or index. 5620 ** If the table or index is empty, jump immediately to P2. 5621 ** If the table or index is not empty, fall through to the following 5622 ** instruction. 5623 ** 5624 ** This opcode leaves the cursor configured to move in forward order, 5625 ** from the beginning toward the end. In other words, the cursor is 5626 ** configured to use Next, not Prev. 5627 */ 5628 case OP_Rewind: { /* jump */ 5629 VdbeCursor *pC; 5630 BtCursor *pCrsr; 5631 int res; 5632 5633 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5634 assert( pOp->p5==0 ); 5635 pC = p->apCsr[pOp->p1]; 5636 assert( pC!=0 ); 5637 assert( isSorter(pC)==(pOp->opcode==OP_SorterSort) ); 5638 res = 1; 5639 #ifdef SQLITE_DEBUG 5640 pC->seekOp = OP_Rewind; 5641 #endif 5642 if( isSorter(pC) ){ 5643 rc = sqlite3VdbeSorterRewind(pC, &res); 5644 }else{ 5645 assert( pC->eCurType==CURTYPE_BTREE ); 5646 pCrsr = pC->uc.pCursor; 5647 assert( pCrsr ); 5648 rc = sqlite3BtreeFirst(pCrsr, &res); 5649 pC->deferredMoveto = 0; 5650 pC->cacheStatus = CACHE_STALE; 5651 } 5652 if( rc ) goto abort_due_to_error; 5653 pC->nullRow = (u8)res; 5654 assert( pOp->p2>0 && pOp->p2<p->nOp ); 5655 VdbeBranchTaken(res!=0,2); 5656 if( res ) goto jump_to_p2; 5657 break; 5658 } 5659 5660 /* Opcode: Next P1 P2 P3 P4 P5 5661 ** 5662 ** Advance cursor P1 so that it points to the next key/data pair in its 5663 ** table or index. If there are no more key/value pairs then fall through 5664 ** to the following instruction. But if the cursor advance was successful, 5665 ** jump immediately to P2. 5666 ** 5667 ** The Next opcode is only valid following an SeekGT, SeekGE, or 5668 ** OP_Rewind opcode used to position the cursor. Next is not allowed 5669 ** to follow SeekLT, SeekLE, or OP_Last. 5670 ** 5671 ** The P1 cursor must be for a real table, not a pseudo-table. P1 must have 5672 ** been opened prior to this opcode or the program will segfault. 5673 ** 5674 ** The P3 value is a hint to the btree implementation. If P3==1, that 5675 ** means P1 is an SQL index and that this instruction could have been 5676 ** omitted if that index had been unique. P3 is usually 0. P3 is 5677 ** always either 0 or 1. 5678 ** 5679 ** P4 is always of type P4_ADVANCE. The function pointer points to 5680 ** sqlite3BtreeNext(). 5681 ** 5682 ** If P5 is positive and the jump is taken, then event counter 5683 ** number P5-1 in the prepared statement is incremented. 5684 ** 5685 ** See also: Prev 5686 */ 5687 /* Opcode: Prev P1 P2 P3 P4 P5 5688 ** 5689 ** Back up cursor P1 so that it points to the previous key/data pair in its 5690 ** table or index. If there is no previous key/value pairs then fall through 5691 ** to the following instruction. But if the cursor backup was successful, 5692 ** jump immediately to P2. 5693 ** 5694 ** 5695 ** The Prev opcode is only valid following an SeekLT, SeekLE, or 5696 ** OP_Last opcode used to position the cursor. Prev is not allowed 5697 ** to follow SeekGT, SeekGE, or OP_Rewind. 5698 ** 5699 ** The P1 cursor must be for a real table, not a pseudo-table. If P1 is 5700 ** not open then the behavior is undefined. 5701 ** 5702 ** The P3 value is a hint to the btree implementation. If P3==1, that 5703 ** means P1 is an SQL index and that this instruction could have been 5704 ** omitted if that index had been unique. P3 is usually 0. P3 is 5705 ** always either 0 or 1. 5706 ** 5707 ** P4 is always of type P4_ADVANCE. The function pointer points to 5708 ** sqlite3BtreePrevious(). 5709 ** 5710 ** If P5 is positive and the jump is taken, then event counter 5711 ** number P5-1 in the prepared statement is incremented. 5712 */ 5713 /* Opcode: SorterNext P1 P2 * * P5 5714 ** 5715 ** This opcode works just like OP_Next except that P1 must be a 5716 ** sorter object for which the OP_SorterSort opcode has been 5717 ** invoked. This opcode advances the cursor to the next sorted 5718 ** record, or jumps to P2 if there are no more sorted records. 5719 */ 5720 case OP_SorterNext: { /* jump */ 5721 VdbeCursor *pC; 5722 5723 pC = p->apCsr[pOp->p1]; 5724 assert( isSorter(pC) ); 5725 rc = sqlite3VdbeSorterNext(db, pC); 5726 goto next_tail; 5727 case OP_Prev: /* jump */ 5728 case OP_Next: /* jump */ 5729 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5730 assert( pOp->p5<ArraySize(p->aCounter) ); 5731 pC = p->apCsr[pOp->p1]; 5732 assert( pC!=0 ); 5733 assert( pC->deferredMoveto==0 ); 5734 assert( pC->eCurType==CURTYPE_BTREE ); 5735 assert( pOp->opcode!=OP_Next || pOp->p4.xAdvance==sqlite3BtreeNext ); 5736 assert( pOp->opcode!=OP_Prev || pOp->p4.xAdvance==sqlite3BtreePrevious ); 5737 5738 /* The Next opcode is only used after SeekGT, SeekGE, Rewind, and Found. 5739 ** The Prev opcode is only used after SeekLT, SeekLE, and Last. */ 5740 assert( pOp->opcode!=OP_Next 5741 || pC->seekOp==OP_SeekGT || pC->seekOp==OP_SeekGE 5742 || pC->seekOp==OP_Rewind || pC->seekOp==OP_Found 5743 || pC->seekOp==OP_NullRow|| pC->seekOp==OP_SeekRowid 5744 || pC->seekOp==OP_IfNoHope); 5745 assert( pOp->opcode!=OP_Prev 5746 || pC->seekOp==OP_SeekLT || pC->seekOp==OP_SeekLE 5747 || pC->seekOp==OP_Last || pC->seekOp==OP_IfNoHope 5748 || pC->seekOp==OP_NullRow); 5749 5750 rc = pOp->p4.xAdvance(pC->uc.pCursor, pOp->p3); 5751 next_tail: 5752 pC->cacheStatus = CACHE_STALE; 5753 VdbeBranchTaken(rc==SQLITE_OK,2); 5754 if( rc==SQLITE_OK ){ 5755 pC->nullRow = 0; 5756 p->aCounter[pOp->p5]++; 5757 #ifdef SQLITE_TEST 5758 sqlite3_search_count++; 5759 #endif 5760 goto jump_to_p2_and_check_for_interrupt; 5761 } 5762 if( rc!=SQLITE_DONE ) goto abort_due_to_error; 5763 rc = SQLITE_OK; 5764 pC->nullRow = 1; 5765 goto check_for_interrupt; 5766 } 5767 5768 /* Opcode: IdxInsert P1 P2 P3 P4 P5 5769 ** Synopsis: key=r[P2] 5770 ** 5771 ** Register P2 holds an SQL index key made using the 5772 ** MakeRecord instructions. This opcode writes that key 5773 ** into the index P1. Data for the entry is nil. 5774 ** 5775 ** If P4 is not zero, then it is the number of values in the unpacked 5776 ** key of reg(P2). In that case, P3 is the index of the first register 5777 ** for the unpacked key. The availability of the unpacked key can sometimes 5778 ** be an optimization. 5779 ** 5780 ** If P5 has the OPFLAG_APPEND bit set, that is a hint to the b-tree layer 5781 ** that this insert is likely to be an append. 5782 ** 5783 ** If P5 has the OPFLAG_NCHANGE bit set, then the change counter is 5784 ** incremented by this instruction. If the OPFLAG_NCHANGE bit is clear, 5785 ** then the change counter is unchanged. 5786 ** 5787 ** If the OPFLAG_USESEEKRESULT flag of P5 is set, the implementation might 5788 ** run faster by avoiding an unnecessary seek on cursor P1. However, 5789 ** the OPFLAG_USESEEKRESULT flag must only be set if there have been no prior 5790 ** seeks on the cursor or if the most recent seek used a key equivalent 5791 ** to P2. 5792 ** 5793 ** This instruction only works for indices. The equivalent instruction 5794 ** for tables is OP_Insert. 5795 */ 5796 case OP_IdxInsert: { /* in2 */ 5797 VdbeCursor *pC; 5798 BtreePayload x; 5799 5800 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5801 pC = p->apCsr[pOp->p1]; 5802 sqlite3VdbeIncrWriteCounter(p, pC); 5803 assert( pC!=0 ); 5804 assert( !isSorter(pC) ); 5805 pIn2 = &aMem[pOp->p2]; 5806 assert( (pIn2->flags & MEM_Blob) || (pOp->p5 & OPFLAG_PREFORMAT) ); 5807 if( pOp->p5 & OPFLAG_NCHANGE ) p->nChange++; 5808 assert( pC->eCurType==CURTYPE_BTREE ); 5809 assert( pC->isTable==0 ); 5810 rc = ExpandBlob(pIn2); 5811 if( rc ) goto abort_due_to_error; 5812 x.nKey = pIn2->n; 5813 x.pKey = pIn2->z; 5814 x.aMem = aMem + pOp->p3; 5815 x.nMem = (u16)pOp->p4.i; 5816 rc = sqlite3BtreeInsert(pC->uc.pCursor, &x, 5817 (pOp->p5 & (OPFLAG_APPEND|OPFLAG_SAVEPOSITION|OPFLAG_PREFORMAT)), 5818 ((pOp->p5 & OPFLAG_USESEEKRESULT) ? pC->seekResult : 0) 5819 ); 5820 assert( pC->deferredMoveto==0 ); 5821 pC->cacheStatus = CACHE_STALE; 5822 if( rc) goto abort_due_to_error; 5823 break; 5824 } 5825 5826 /* Opcode: SorterInsert P1 P2 * * * 5827 ** Synopsis: key=r[P2] 5828 ** 5829 ** Register P2 holds an SQL index key made using the 5830 ** MakeRecord instructions. This opcode writes that key 5831 ** into the sorter P1. Data for the entry is nil. 5832 */ 5833 case OP_SorterInsert: { /* in2 */ 5834 VdbeCursor *pC; 5835 5836 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5837 pC = p->apCsr[pOp->p1]; 5838 sqlite3VdbeIncrWriteCounter(p, pC); 5839 assert( pC!=0 ); 5840 assert( isSorter(pC) ); 5841 pIn2 = &aMem[pOp->p2]; 5842 assert( pIn2->flags & MEM_Blob ); 5843 assert( pC->isTable==0 ); 5844 rc = ExpandBlob(pIn2); 5845 if( rc ) goto abort_due_to_error; 5846 rc = sqlite3VdbeSorterWrite(pC, pIn2); 5847 if( rc) goto abort_due_to_error; 5848 break; 5849 } 5850 5851 /* Opcode: IdxDelete P1 P2 P3 * P5 5852 ** Synopsis: key=r[P2@P3] 5853 ** 5854 ** The content of P3 registers starting at register P2 form 5855 ** an unpacked index key. This opcode removes that entry from the 5856 ** index opened by cursor P1. 5857 ** 5858 ** If P5 is not zero, then raise an SQLITE_CORRUPT_INDEX error 5859 ** if no matching index entry is found. This happens when running 5860 ** an UPDATE or DELETE statement and the index entry to be updated 5861 ** or deleted is not found. For some uses of IdxDelete 5862 ** (example: the EXCEPT operator) it does not matter that no matching 5863 ** entry is found. For those cases, P5 is zero. 5864 */ 5865 case OP_IdxDelete: { 5866 VdbeCursor *pC; 5867 BtCursor *pCrsr; 5868 int res; 5869 UnpackedRecord r; 5870 5871 assert( pOp->p3>0 ); 5872 assert( pOp->p2>0 && pOp->p2+pOp->p3<=(p->nMem+1 - p->nCursor)+1 ); 5873 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5874 pC = p->apCsr[pOp->p1]; 5875 assert( pC!=0 ); 5876 assert( pC->eCurType==CURTYPE_BTREE ); 5877 sqlite3VdbeIncrWriteCounter(p, pC); 5878 pCrsr = pC->uc.pCursor; 5879 assert( pCrsr!=0 ); 5880 r.pKeyInfo = pC->pKeyInfo; 5881 r.nField = (u16)pOp->p3; 5882 r.default_rc = 0; 5883 r.aMem = &aMem[pOp->p2]; 5884 rc = sqlite3BtreeMovetoUnpacked(pCrsr, &r, 0, 0, &res); 5885 if( rc ) goto abort_due_to_error; 5886 if( res==0 ){ 5887 rc = sqlite3BtreeDelete(pCrsr, BTREE_AUXDELETE); 5888 if( rc ) goto abort_due_to_error; 5889 }else if( pOp->p5 ){ 5890 rc = sqlite3ReportError(SQLITE_CORRUPT_INDEX, __LINE__, "index corruption"); 5891 goto abort_due_to_error; 5892 } 5893 assert( pC->deferredMoveto==0 ); 5894 pC->cacheStatus = CACHE_STALE; 5895 pC->seekResult = 0; 5896 break; 5897 } 5898 5899 /* Opcode: DeferredSeek P1 * P3 P4 * 5900 ** Synopsis: Move P3 to P1.rowid if needed 5901 ** 5902 ** P1 is an open index cursor and P3 is a cursor on the corresponding 5903 ** table. This opcode does a deferred seek of the P3 table cursor 5904 ** to the row that corresponds to the current row of P1. 5905 ** 5906 ** This is a deferred seek. Nothing actually happens until 5907 ** the cursor is used to read a record. That way, if no reads 5908 ** occur, no unnecessary I/O happens. 5909 ** 5910 ** P4 may be an array of integers (type P4_INTARRAY) containing 5911 ** one entry for each column in the P3 table. If array entry a(i) 5912 ** is non-zero, then reading column a(i)-1 from cursor P3 is 5913 ** equivalent to performing the deferred seek and then reading column i 5914 ** from P1. This information is stored in P3 and used to redirect 5915 ** reads against P3 over to P1, thus possibly avoiding the need to 5916 ** seek and read cursor P3. 5917 */ 5918 /* Opcode: IdxRowid P1 P2 * * * 5919 ** Synopsis: r[P2]=rowid 5920 ** 5921 ** Write into register P2 an integer which is the last entry in the record at 5922 ** the end of the index key pointed to by cursor P1. This integer should be 5923 ** the rowid of the table entry to which this index entry points. 5924 ** 5925 ** See also: Rowid, MakeRecord. 5926 */ 5927 case OP_DeferredSeek: 5928 case OP_IdxRowid: { /* out2 */ 5929 VdbeCursor *pC; /* The P1 index cursor */ 5930 VdbeCursor *pTabCur; /* The P2 table cursor (OP_DeferredSeek only) */ 5931 i64 rowid; /* Rowid that P1 current points to */ 5932 5933 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5934 pC = p->apCsr[pOp->p1]; 5935 assert( pC!=0 ); 5936 assert( pC->eCurType==CURTYPE_BTREE ); 5937 assert( pC->uc.pCursor!=0 ); 5938 assert( pC->isTable==0 ); 5939 assert( pC->deferredMoveto==0 ); 5940 assert( !pC->nullRow || pOp->opcode==OP_IdxRowid ); 5941 5942 /* The IdxRowid and Seek opcodes are combined because of the commonality 5943 ** of sqlite3VdbeCursorRestore() and sqlite3VdbeIdxRowid(). */ 5944 rc = sqlite3VdbeCursorRestore(pC); 5945 5946 /* sqlite3VbeCursorRestore() can only fail if the record has been deleted 5947 ** out from under the cursor. That will never happens for an IdxRowid 5948 ** or Seek opcode */ 5949 if( NEVER(rc!=SQLITE_OK) ) goto abort_due_to_error; 5950 5951 if( !pC->nullRow ){ 5952 rowid = 0; /* Not needed. Only used to silence a warning. */ 5953 rc = sqlite3VdbeIdxRowid(db, pC->uc.pCursor, &rowid); 5954 if( rc!=SQLITE_OK ){ 5955 goto abort_due_to_error; 5956 } 5957 if( pOp->opcode==OP_DeferredSeek ){ 5958 assert( pOp->p3>=0 && pOp->p3<p->nCursor ); 5959 pTabCur = p->apCsr[pOp->p3]; 5960 assert( pTabCur!=0 ); 5961 assert( pTabCur->eCurType==CURTYPE_BTREE ); 5962 assert( pTabCur->uc.pCursor!=0 ); 5963 assert( pTabCur->isTable ); 5964 pTabCur->nullRow = 0; 5965 pTabCur->movetoTarget = rowid; 5966 pTabCur->deferredMoveto = 1; 5967 assert( pOp->p4type==P4_INTARRAY || pOp->p4.ai==0 ); 5968 pTabCur->aAltMap = pOp->p4.ai; 5969 assert( !pC->isEphemeral ); 5970 assert( !pTabCur->isEphemeral ); 5971 pTabCur->pAltCursor = pC; 5972 }else{ 5973 pOut = out2Prerelease(p, pOp); 5974 pOut->u.i = rowid; 5975 } 5976 }else{ 5977 assert( pOp->opcode==OP_IdxRowid ); 5978 sqlite3VdbeMemSetNull(&aMem[pOp->p2]); 5979 } 5980 break; 5981 } 5982 5983 /* Opcode: FinishSeek P1 * * * * 5984 ** 5985 ** If cursor P1 was previously moved via OP_DeferredSeek, complete that 5986 ** seek operation now, without further delay. If the cursor seek has 5987 ** already occurred, this instruction is a no-op. 5988 */ 5989 case OP_FinishSeek: { 5990 VdbeCursor *pC; /* The P1 index cursor */ 5991 5992 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 5993 pC = p->apCsr[pOp->p1]; 5994 if( pC->deferredMoveto ){ 5995 rc = sqlite3VdbeFinishMoveto(pC); 5996 if( rc ) goto abort_due_to_error; 5997 } 5998 break; 5999 } 6000 6001 /* Opcode: IdxGE P1 P2 P3 P4 * 6002 ** Synopsis: key=r[P3@P4] 6003 ** 6004 ** The P4 register values beginning with P3 form an unpacked index 6005 ** key that omits the PRIMARY KEY. Compare this key value against the index 6006 ** that P1 is currently pointing to, ignoring the PRIMARY KEY or ROWID 6007 ** fields at the end. 6008 ** 6009 ** If the P1 index entry is greater than or equal to the key value 6010 ** then jump to P2. Otherwise fall through to the next instruction. 6011 */ 6012 /* Opcode: IdxGT P1 P2 P3 P4 * 6013 ** Synopsis: key=r[P3@P4] 6014 ** 6015 ** The P4 register values beginning with P3 form an unpacked index 6016 ** key that omits the PRIMARY KEY. Compare this key value against the index 6017 ** that P1 is currently pointing to, ignoring the PRIMARY KEY or ROWID 6018 ** fields at the end. 6019 ** 6020 ** If the P1 index entry is greater than the key value 6021 ** then jump to P2. Otherwise fall through to the next instruction. 6022 */ 6023 /* Opcode: IdxLT P1 P2 P3 P4 * 6024 ** Synopsis: key=r[P3@P4] 6025 ** 6026 ** The P4 register values beginning with P3 form an unpacked index 6027 ** key that omits the PRIMARY KEY or ROWID. Compare this key value against 6028 ** the index that P1 is currently pointing to, ignoring the PRIMARY KEY or 6029 ** ROWID on the P1 index. 6030 ** 6031 ** If the P1 index entry is less than the key value then jump to P2. 6032 ** Otherwise fall through to the next instruction. 6033 */ 6034 /* Opcode: IdxLE P1 P2 P3 P4 * 6035 ** Synopsis: key=r[P3@P4] 6036 ** 6037 ** The P4 register values beginning with P3 form an unpacked index 6038 ** key that omits the PRIMARY KEY or ROWID. Compare this key value against 6039 ** the index that P1 is currently pointing to, ignoring the PRIMARY KEY or 6040 ** ROWID on the P1 index. 6041 ** 6042 ** If the P1 index entry is less than or equal to the key value then jump 6043 ** to P2. Otherwise fall through to the next instruction. 6044 */ 6045 case OP_IdxLE: /* jump */ 6046 case OP_IdxGT: /* jump */ 6047 case OP_IdxLT: /* jump */ 6048 case OP_IdxGE: { /* jump */ 6049 VdbeCursor *pC; 6050 int res; 6051 UnpackedRecord r; 6052 6053 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 6054 pC = p->apCsr[pOp->p1]; 6055 assert( pC!=0 ); 6056 assert( pC->isOrdered ); 6057 assert( pC->eCurType==CURTYPE_BTREE ); 6058 assert( pC->uc.pCursor!=0); 6059 assert( pC->deferredMoveto==0 ); 6060 assert( pOp->p4type==P4_INT32 ); 6061 r.pKeyInfo = pC->pKeyInfo; 6062 r.nField = (u16)pOp->p4.i; 6063 if( pOp->opcode<OP_IdxLT ){ 6064 assert( pOp->opcode==OP_IdxLE || pOp->opcode==OP_IdxGT ); 6065 r.default_rc = -1; 6066 }else{ 6067 assert( pOp->opcode==OP_IdxGE || pOp->opcode==OP_IdxLT ); 6068 r.default_rc = 0; 6069 } 6070 r.aMem = &aMem[pOp->p3]; 6071 #ifdef SQLITE_DEBUG 6072 { 6073 int i; 6074 for(i=0; i<r.nField; i++){ 6075 assert( memIsValid(&r.aMem[i]) ); 6076 REGISTER_TRACE(pOp->p3+i, &aMem[pOp->p3+i]); 6077 } 6078 } 6079 #endif 6080 6081 /* Inlined version of sqlite3VdbeIdxKeyCompare() */ 6082 { 6083 i64 nCellKey = 0; 6084 BtCursor *pCur; 6085 Mem m; 6086 6087 assert( pC->eCurType==CURTYPE_BTREE ); 6088 pCur = pC->uc.pCursor; 6089 assert( sqlite3BtreeCursorIsValid(pCur) ); 6090 nCellKey = sqlite3BtreePayloadSize(pCur); 6091 /* nCellKey will always be between 0 and 0xffffffff because of the way 6092 ** that btreeParseCellPtr() and sqlite3GetVarint32() are implemented */ 6093 if( nCellKey<=0 || nCellKey>0x7fffffff ){ 6094 rc = SQLITE_CORRUPT_BKPT; 6095 goto abort_due_to_error; 6096 } 6097 sqlite3VdbeMemInit(&m, db, 0); 6098 rc = sqlite3VdbeMemFromBtreeZeroOffset(pCur, (u32)nCellKey, &m); 6099 if( rc ) goto abort_due_to_error; 6100 res = sqlite3VdbeRecordCompareWithSkip(m.n, m.z, &r, 0); 6101 sqlite3VdbeMemRelease(&m); 6102 } 6103 /* End of inlined sqlite3VdbeIdxKeyCompare() */ 6104 6105 assert( (OP_IdxLE&1)==(OP_IdxLT&1) && (OP_IdxGE&1)==(OP_IdxGT&1) ); 6106 if( (pOp->opcode&1)==(OP_IdxLT&1) ){ 6107 assert( pOp->opcode==OP_IdxLE || pOp->opcode==OP_IdxLT ); 6108 res = -res; 6109 }else{ 6110 assert( pOp->opcode==OP_IdxGE || pOp->opcode==OP_IdxGT ); 6111 res++; 6112 } 6113 VdbeBranchTaken(res>0,2); 6114 assert( rc==SQLITE_OK ); 6115 if( res>0 ) goto jump_to_p2; 6116 break; 6117 } 6118 6119 /* Opcode: Destroy P1 P2 P3 * * 6120 ** 6121 ** Delete an entire database table or index whose root page in the database 6122 ** file is given by P1. 6123 ** 6124 ** The table being destroyed is in the main database file if P3==0. If 6125 ** P3==1 then the table to be clear is in the auxiliary database file 6126 ** that is used to store tables create using CREATE TEMPORARY TABLE. 6127 ** 6128 ** If AUTOVACUUM is enabled then it is possible that another root page 6129 ** might be moved into the newly deleted root page in order to keep all 6130 ** root pages contiguous at the beginning of the database. The former 6131 ** value of the root page that moved - its value before the move occurred - 6132 ** is stored in register P2. If no page movement was required (because the 6133 ** table being dropped was already the last one in the database) then a 6134 ** zero is stored in register P2. If AUTOVACUUM is disabled then a zero 6135 ** is stored in register P2. 6136 ** 6137 ** This opcode throws an error if there are any active reader VMs when 6138 ** it is invoked. This is done to avoid the difficulty associated with 6139 ** updating existing cursors when a root page is moved in an AUTOVACUUM 6140 ** database. This error is thrown even if the database is not an AUTOVACUUM 6141 ** db in order to avoid introducing an incompatibility between autovacuum 6142 ** and non-autovacuum modes. 6143 ** 6144 ** See also: Clear 6145 */ 6146 case OP_Destroy: { /* out2 */ 6147 int iMoved; 6148 int iDb; 6149 6150 sqlite3VdbeIncrWriteCounter(p, 0); 6151 assert( p->readOnly==0 ); 6152 assert( pOp->p1>1 ); 6153 pOut = out2Prerelease(p, pOp); 6154 pOut->flags = MEM_Null; 6155 if( db->nVdbeRead > db->nVDestroy+1 ){ 6156 rc = SQLITE_LOCKED; 6157 p->errorAction = OE_Abort; 6158 goto abort_due_to_error; 6159 }else{ 6160 iDb = pOp->p3; 6161 assert( DbMaskTest(p->btreeMask, iDb) ); 6162 iMoved = 0; /* Not needed. Only to silence a warning. */ 6163 rc = sqlite3BtreeDropTable(db->aDb[iDb].pBt, pOp->p1, &iMoved); 6164 pOut->flags = MEM_Int; 6165 pOut->u.i = iMoved; 6166 if( rc ) goto abort_due_to_error; 6167 #ifndef SQLITE_OMIT_AUTOVACUUM 6168 if( iMoved!=0 ){ 6169 sqlite3RootPageMoved(db, iDb, iMoved, pOp->p1); 6170 /* All OP_Destroy operations occur on the same btree */ 6171 assert( resetSchemaOnFault==0 || resetSchemaOnFault==iDb+1 ); 6172 resetSchemaOnFault = iDb+1; 6173 } 6174 #endif 6175 } 6176 break; 6177 } 6178 6179 /* Opcode: Clear P1 P2 P3 6180 ** 6181 ** Delete all contents of the database table or index whose root page 6182 ** in the database file is given by P1. But, unlike Destroy, do not 6183 ** remove the table or index from the database file. 6184 ** 6185 ** The table being clear is in the main database file if P2==0. If 6186 ** P2==1 then the table to be clear is in the auxiliary database file 6187 ** that is used to store tables create using CREATE TEMPORARY TABLE. 6188 ** 6189 ** If the P3 value is non-zero, then the table referred to must be an 6190 ** intkey table (an SQL table, not an index). In this case the row change 6191 ** count is incremented by the number of rows in the table being cleared. 6192 ** If P3 is greater than zero, then the value stored in register P3 is 6193 ** also incremented by the number of rows in the table being cleared. 6194 ** 6195 ** See also: Destroy 6196 */ 6197 case OP_Clear: { 6198 int nChange; 6199 6200 sqlite3VdbeIncrWriteCounter(p, 0); 6201 nChange = 0; 6202 assert( p->readOnly==0 ); 6203 assert( DbMaskTest(p->btreeMask, pOp->p2) ); 6204 rc = sqlite3BtreeClearTable( 6205 db->aDb[pOp->p2].pBt, (u32)pOp->p1, (pOp->p3 ? &nChange : 0) 6206 ); 6207 if( pOp->p3 ){ 6208 p->nChange += nChange; 6209 if( pOp->p3>0 ){ 6210 assert( memIsValid(&aMem[pOp->p3]) ); 6211 memAboutToChange(p, &aMem[pOp->p3]); 6212 aMem[pOp->p3].u.i += nChange; 6213 } 6214 } 6215 if( rc ) goto abort_due_to_error; 6216 break; 6217 } 6218 6219 /* Opcode: ResetSorter P1 * * * * 6220 ** 6221 ** Delete all contents from the ephemeral table or sorter 6222 ** that is open on cursor P1. 6223 ** 6224 ** This opcode only works for cursors used for sorting and 6225 ** opened with OP_OpenEphemeral or OP_SorterOpen. 6226 */ 6227 case OP_ResetSorter: { 6228 VdbeCursor *pC; 6229 6230 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 6231 pC = p->apCsr[pOp->p1]; 6232 assert( pC!=0 ); 6233 if( isSorter(pC) ){ 6234 sqlite3VdbeSorterReset(db, pC->uc.pSorter); 6235 }else{ 6236 assert( pC->eCurType==CURTYPE_BTREE ); 6237 assert( pC->isEphemeral ); 6238 rc = sqlite3BtreeClearTableOfCursor(pC->uc.pCursor); 6239 if( rc ) goto abort_due_to_error; 6240 } 6241 break; 6242 } 6243 6244 /* Opcode: CreateBtree P1 P2 P3 * * 6245 ** Synopsis: r[P2]=root iDb=P1 flags=P3 6246 ** 6247 ** Allocate a new b-tree in the main database file if P1==0 or in the 6248 ** TEMP database file if P1==1 or in an attached database if 6249 ** P1>1. The P3 argument must be 1 (BTREE_INTKEY) for a rowid table 6250 ** it must be 2 (BTREE_BLOBKEY) for an index or WITHOUT ROWID table. 6251 ** The root page number of the new b-tree is stored in register P2. 6252 */ 6253 case OP_CreateBtree: { /* out2 */ 6254 Pgno pgno; 6255 Db *pDb; 6256 6257 sqlite3VdbeIncrWriteCounter(p, 0); 6258 pOut = out2Prerelease(p, pOp); 6259 pgno = 0; 6260 assert( pOp->p3==BTREE_INTKEY || pOp->p3==BTREE_BLOBKEY ); 6261 assert( pOp->p1>=0 && pOp->p1<db->nDb ); 6262 assert( DbMaskTest(p->btreeMask, pOp->p1) ); 6263 assert( p->readOnly==0 ); 6264 pDb = &db->aDb[pOp->p1]; 6265 assert( pDb->pBt!=0 ); 6266 rc = sqlite3BtreeCreateTable(pDb->pBt, &pgno, pOp->p3); 6267 if( rc ) goto abort_due_to_error; 6268 pOut->u.i = pgno; 6269 break; 6270 } 6271 6272 /* Opcode: SqlExec * * * P4 * 6273 ** 6274 ** Run the SQL statement or statements specified in the P4 string. 6275 */ 6276 case OP_SqlExec: { 6277 sqlite3VdbeIncrWriteCounter(p, 0); 6278 db->nSqlExec++; 6279 rc = sqlite3_exec(db, pOp->p4.z, 0, 0, 0); 6280 db->nSqlExec--; 6281 if( rc ) goto abort_due_to_error; 6282 break; 6283 } 6284 6285 /* Opcode: ParseSchema P1 * * P4 * 6286 ** 6287 ** Read and parse all entries from the schema table of database P1 6288 ** that match the WHERE clause P4. If P4 is a NULL pointer, then the 6289 ** entire schema for P1 is reparsed. 6290 ** 6291 ** This opcode invokes the parser to create a new virtual machine, 6292 ** then runs the new virtual machine. It is thus a re-entrant opcode. 6293 */ 6294 case OP_ParseSchema: { 6295 int iDb; 6296 const char *zSchema; 6297 char *zSql; 6298 InitData initData; 6299 6300 /* Any prepared statement that invokes this opcode will hold mutexes 6301 ** on every btree. This is a prerequisite for invoking 6302 ** sqlite3InitCallback(). 6303 */ 6304 #ifdef SQLITE_DEBUG 6305 for(iDb=0; iDb<db->nDb; iDb++){ 6306 assert( iDb==1 || sqlite3BtreeHoldsMutex(db->aDb[iDb].pBt) ); 6307 } 6308 #endif 6309 6310 iDb = pOp->p1; 6311 assert( iDb>=0 && iDb<db->nDb ); 6312 assert( DbHasProperty(db, iDb, DB_SchemaLoaded) || db->mallocFailed ); 6313 6314 #ifndef SQLITE_OMIT_ALTERTABLE 6315 if( pOp->p4.z==0 ){ 6316 sqlite3SchemaClear(db->aDb[iDb].pSchema); 6317 db->mDbFlags &= ~DBFLAG_SchemaKnownOk; 6318 rc = sqlite3InitOne(db, iDb, &p->zErrMsg, pOp->p5); 6319 db->mDbFlags |= DBFLAG_SchemaChange; 6320 p->expired = 0; 6321 }else 6322 #endif 6323 { 6324 zSchema = DFLT_SCHEMA_TABLE; 6325 initData.db = db; 6326 initData.iDb = iDb; 6327 initData.pzErrMsg = &p->zErrMsg; 6328 initData.mInitFlags = 0; 6329 initData.mxPage = sqlite3BtreeLastPage(db->aDb[iDb].pBt); 6330 zSql = sqlite3MPrintf(db, 6331 "SELECT*FROM\"%w\".%s WHERE %s ORDER BY rowid", 6332 db->aDb[iDb].zDbSName, zSchema, pOp->p4.z); 6333 if( zSql==0 ){ 6334 rc = SQLITE_NOMEM_BKPT; 6335 }else{ 6336 assert( db->init.busy==0 ); 6337 db->init.busy = 1; 6338 initData.rc = SQLITE_OK; 6339 initData.nInitRow = 0; 6340 assert( !db->mallocFailed ); 6341 rc = sqlite3_exec(db, zSql, sqlite3InitCallback, &initData, 0); 6342 if( rc==SQLITE_OK ) rc = initData.rc; 6343 if( rc==SQLITE_OK && initData.nInitRow==0 ){ 6344 /* The OP_ParseSchema opcode with a non-NULL P4 argument should parse 6345 ** at least one SQL statement. Any less than that indicates that 6346 ** the sqlite_schema table is corrupt. */ 6347 rc = SQLITE_CORRUPT_BKPT; 6348 } 6349 sqlite3DbFreeNN(db, zSql); 6350 db->init.busy = 0; 6351 } 6352 } 6353 if( rc ){ 6354 sqlite3ResetAllSchemasOfConnection(db); 6355 if( rc==SQLITE_NOMEM ){ 6356 goto no_mem; 6357 } 6358 goto abort_due_to_error; 6359 } 6360 break; 6361 } 6362 6363 #if !defined(SQLITE_OMIT_ANALYZE) 6364 /* Opcode: LoadAnalysis P1 * * * * 6365 ** 6366 ** Read the sqlite_stat1 table for database P1 and load the content 6367 ** of that table into the internal index hash table. This will cause 6368 ** the analysis to be used when preparing all subsequent queries. 6369 */ 6370 case OP_LoadAnalysis: { 6371 assert( pOp->p1>=0 && pOp->p1<db->nDb ); 6372 rc = sqlite3AnalysisLoad(db, pOp->p1); 6373 if( rc ) goto abort_due_to_error; 6374 break; 6375 } 6376 #endif /* !defined(SQLITE_OMIT_ANALYZE) */ 6377 6378 /* Opcode: DropTable P1 * * P4 * 6379 ** 6380 ** Remove the internal (in-memory) data structures that describe 6381 ** the table named P4 in database P1. This is called after a table 6382 ** is dropped from disk (using the Destroy opcode) in order to keep 6383 ** the internal representation of the 6384 ** schema consistent with what is on disk. 6385 */ 6386 case OP_DropTable: { 6387 sqlite3VdbeIncrWriteCounter(p, 0); 6388 sqlite3UnlinkAndDeleteTable(db, pOp->p1, pOp->p4.z); 6389 break; 6390 } 6391 6392 /* Opcode: DropIndex P1 * * P4 * 6393 ** 6394 ** Remove the internal (in-memory) data structures that describe 6395 ** the index named P4 in database P1. This is called after an index 6396 ** is dropped from disk (using the Destroy opcode) 6397 ** in order to keep the internal representation of the 6398 ** schema consistent with what is on disk. 6399 */ 6400 case OP_DropIndex: { 6401 sqlite3VdbeIncrWriteCounter(p, 0); 6402 sqlite3UnlinkAndDeleteIndex(db, pOp->p1, pOp->p4.z); 6403 break; 6404 } 6405 6406 /* Opcode: DropTrigger P1 * * P4 * 6407 ** 6408 ** Remove the internal (in-memory) data structures that describe 6409 ** the trigger named P4 in database P1. This is called after a trigger 6410 ** is dropped from disk (using the Destroy opcode) in order to keep 6411 ** the internal representation of the 6412 ** schema consistent with what is on disk. 6413 */ 6414 case OP_DropTrigger: { 6415 sqlite3VdbeIncrWriteCounter(p, 0); 6416 sqlite3UnlinkAndDeleteTrigger(db, pOp->p1, pOp->p4.z); 6417 break; 6418 } 6419 6420 6421 #ifndef SQLITE_OMIT_INTEGRITY_CHECK 6422 /* Opcode: IntegrityCk P1 P2 P3 P4 P5 6423 ** 6424 ** Do an analysis of the currently open database. Store in 6425 ** register P1 the text of an error message describing any problems. 6426 ** If no problems are found, store a NULL in register P1. 6427 ** 6428 ** The register P3 contains one less than the maximum number of allowed errors. 6429 ** At most reg(P3) errors will be reported. 6430 ** In other words, the analysis stops as soon as reg(P1) errors are 6431 ** seen. Reg(P1) is updated with the number of errors remaining. 6432 ** 6433 ** The root page numbers of all tables in the database are integers 6434 ** stored in P4_INTARRAY argument. 6435 ** 6436 ** If P5 is not zero, the check is done on the auxiliary database 6437 ** file, not the main database file. 6438 ** 6439 ** This opcode is used to implement the integrity_check pragma. 6440 */ 6441 case OP_IntegrityCk: { 6442 int nRoot; /* Number of tables to check. (Number of root pages.) */ 6443 Pgno *aRoot; /* Array of rootpage numbers for tables to be checked */ 6444 int nErr; /* Number of errors reported */ 6445 char *z; /* Text of the error report */ 6446 Mem *pnErr; /* Register keeping track of errors remaining */ 6447 6448 assert( p->bIsReader ); 6449 nRoot = pOp->p2; 6450 aRoot = pOp->p4.ai; 6451 assert( nRoot>0 ); 6452 assert( aRoot[0]==(Pgno)nRoot ); 6453 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) ); 6454 pnErr = &aMem[pOp->p3]; 6455 assert( (pnErr->flags & MEM_Int)!=0 ); 6456 assert( (pnErr->flags & (MEM_Str|MEM_Blob))==0 ); 6457 pIn1 = &aMem[pOp->p1]; 6458 assert( pOp->p5<db->nDb ); 6459 assert( DbMaskTest(p->btreeMask, pOp->p5) ); 6460 z = sqlite3BtreeIntegrityCheck(db, db->aDb[pOp->p5].pBt, &aRoot[1], nRoot, 6461 (int)pnErr->u.i+1, &nErr); 6462 sqlite3VdbeMemSetNull(pIn1); 6463 if( nErr==0 ){ 6464 assert( z==0 ); 6465 }else if( z==0 ){ 6466 goto no_mem; 6467 }else{ 6468 pnErr->u.i -= nErr-1; 6469 sqlite3VdbeMemSetStr(pIn1, z, -1, SQLITE_UTF8, sqlite3_free); 6470 } 6471 UPDATE_MAX_BLOBSIZE(pIn1); 6472 sqlite3VdbeChangeEncoding(pIn1, encoding); 6473 goto check_for_interrupt; 6474 } 6475 #endif /* SQLITE_OMIT_INTEGRITY_CHECK */ 6476 6477 /* Opcode: RowSetAdd P1 P2 * * * 6478 ** Synopsis: rowset(P1)=r[P2] 6479 ** 6480 ** Insert the integer value held by register P2 into a RowSet object 6481 ** held in register P1. 6482 ** 6483 ** An assertion fails if P2 is not an integer. 6484 */ 6485 case OP_RowSetAdd: { /* in1, in2 */ 6486 pIn1 = &aMem[pOp->p1]; 6487 pIn2 = &aMem[pOp->p2]; 6488 assert( (pIn2->flags & MEM_Int)!=0 ); 6489 if( (pIn1->flags & MEM_Blob)==0 ){ 6490 if( sqlite3VdbeMemSetRowSet(pIn1) ) goto no_mem; 6491 } 6492 assert( sqlite3VdbeMemIsRowSet(pIn1) ); 6493 sqlite3RowSetInsert((RowSet*)pIn1->z, pIn2->u.i); 6494 break; 6495 } 6496 6497 /* Opcode: RowSetRead P1 P2 P3 * * 6498 ** Synopsis: r[P3]=rowset(P1) 6499 ** 6500 ** Extract the smallest value from the RowSet object in P1 6501 ** and put that value into register P3. 6502 ** Or, if RowSet object P1 is initially empty, leave P3 6503 ** unchanged and jump to instruction P2. 6504 */ 6505 case OP_RowSetRead: { /* jump, in1, out3 */ 6506 i64 val; 6507 6508 pIn1 = &aMem[pOp->p1]; 6509 assert( (pIn1->flags & MEM_Blob)==0 || sqlite3VdbeMemIsRowSet(pIn1) ); 6510 if( (pIn1->flags & MEM_Blob)==0 6511 || sqlite3RowSetNext((RowSet*)pIn1->z, &val)==0 6512 ){ 6513 /* The boolean index is empty */ 6514 sqlite3VdbeMemSetNull(pIn1); 6515 VdbeBranchTaken(1,2); 6516 goto jump_to_p2_and_check_for_interrupt; 6517 }else{ 6518 /* A value was pulled from the index */ 6519 VdbeBranchTaken(0,2); 6520 sqlite3VdbeMemSetInt64(&aMem[pOp->p3], val); 6521 } 6522 goto check_for_interrupt; 6523 } 6524 6525 /* Opcode: RowSetTest P1 P2 P3 P4 6526 ** Synopsis: if r[P3] in rowset(P1) goto P2 6527 ** 6528 ** Register P3 is assumed to hold a 64-bit integer value. If register P1 6529 ** contains a RowSet object and that RowSet object contains 6530 ** the value held in P3, jump to register P2. Otherwise, insert the 6531 ** integer in P3 into the RowSet and continue on to the 6532 ** next opcode. 6533 ** 6534 ** The RowSet object is optimized for the case where sets of integers 6535 ** are inserted in distinct phases, which each set contains no duplicates. 6536 ** Each set is identified by a unique P4 value. The first set 6537 ** must have P4==0, the final set must have P4==-1, and for all other sets 6538 ** must have P4>0. 6539 ** 6540 ** This allows optimizations: (a) when P4==0 there is no need to test 6541 ** the RowSet object for P3, as it is guaranteed not to contain it, 6542 ** (b) when P4==-1 there is no need to insert the value, as it will 6543 ** never be tested for, and (c) when a value that is part of set X is 6544 ** inserted, there is no need to search to see if the same value was 6545 ** previously inserted as part of set X (only if it was previously 6546 ** inserted as part of some other set). 6547 */ 6548 case OP_RowSetTest: { /* jump, in1, in3 */ 6549 int iSet; 6550 int exists; 6551 6552 pIn1 = &aMem[pOp->p1]; 6553 pIn3 = &aMem[pOp->p3]; 6554 iSet = pOp->p4.i; 6555 assert( pIn3->flags&MEM_Int ); 6556 6557 /* If there is anything other than a rowset object in memory cell P1, 6558 ** delete it now and initialize P1 with an empty rowset 6559 */ 6560 if( (pIn1->flags & MEM_Blob)==0 ){ 6561 if( sqlite3VdbeMemSetRowSet(pIn1) ) goto no_mem; 6562 } 6563 assert( sqlite3VdbeMemIsRowSet(pIn1) ); 6564 assert( pOp->p4type==P4_INT32 ); 6565 assert( iSet==-1 || iSet>=0 ); 6566 if( iSet ){ 6567 exists = sqlite3RowSetTest((RowSet*)pIn1->z, iSet, pIn3->u.i); 6568 VdbeBranchTaken(exists!=0,2); 6569 if( exists ) goto jump_to_p2; 6570 } 6571 if( iSet>=0 ){ 6572 sqlite3RowSetInsert((RowSet*)pIn1->z, pIn3->u.i); 6573 } 6574 break; 6575 } 6576 6577 6578 #ifndef SQLITE_OMIT_TRIGGER 6579 6580 /* Opcode: Program P1 P2 P3 P4 P5 6581 ** 6582 ** Execute the trigger program passed as P4 (type P4_SUBPROGRAM). 6583 ** 6584 ** P1 contains the address of the memory cell that contains the first memory 6585 ** cell in an array of values used as arguments to the sub-program. P2 6586 ** contains the address to jump to if the sub-program throws an IGNORE 6587 ** exception using the RAISE() function. Register P3 contains the address 6588 ** of a memory cell in this (the parent) VM that is used to allocate the 6589 ** memory required by the sub-vdbe at runtime. 6590 ** 6591 ** P4 is a pointer to the VM containing the trigger program. 6592 ** 6593 ** If P5 is non-zero, then recursive program invocation is enabled. 6594 */ 6595 case OP_Program: { /* jump */ 6596 int nMem; /* Number of memory registers for sub-program */ 6597 int nByte; /* Bytes of runtime space required for sub-program */ 6598 Mem *pRt; /* Register to allocate runtime space */ 6599 Mem *pMem; /* Used to iterate through memory cells */ 6600 Mem *pEnd; /* Last memory cell in new array */ 6601 VdbeFrame *pFrame; /* New vdbe frame to execute in */ 6602 SubProgram *pProgram; /* Sub-program to execute */ 6603 void *t; /* Token identifying trigger */ 6604 6605 pProgram = pOp->p4.pProgram; 6606 pRt = &aMem[pOp->p3]; 6607 assert( pProgram->nOp>0 ); 6608 6609 /* If the p5 flag is clear, then recursive invocation of triggers is 6610 ** disabled for backwards compatibility (p5 is set if this sub-program 6611 ** is really a trigger, not a foreign key action, and the flag set 6612 ** and cleared by the "PRAGMA recursive_triggers" command is clear). 6613 ** 6614 ** It is recursive invocation of triggers, at the SQL level, that is 6615 ** disabled. In some cases a single trigger may generate more than one 6616 ** SubProgram (if the trigger may be executed with more than one different 6617 ** ON CONFLICT algorithm). SubProgram structures associated with a 6618 ** single trigger all have the same value for the SubProgram.token 6619 ** variable. */ 6620 if( pOp->p5 ){ 6621 t = pProgram->token; 6622 for(pFrame=p->pFrame; pFrame && pFrame->token!=t; pFrame=pFrame->pParent); 6623 if( pFrame ) break; 6624 } 6625 6626 if( p->nFrame>=db->aLimit[SQLITE_LIMIT_TRIGGER_DEPTH] ){ 6627 rc = SQLITE_ERROR; 6628 sqlite3VdbeError(p, "too many levels of trigger recursion"); 6629 goto abort_due_to_error; 6630 } 6631 6632 /* Register pRt is used to store the memory required to save the state 6633 ** of the current program, and the memory required at runtime to execute 6634 ** the trigger program. If this trigger has been fired before, then pRt 6635 ** is already allocated. Otherwise, it must be initialized. */ 6636 if( (pRt->flags&MEM_Blob)==0 ){ 6637 /* SubProgram.nMem is set to the number of memory cells used by the 6638 ** program stored in SubProgram.aOp. As well as these, one memory 6639 ** cell is required for each cursor used by the program. Set local 6640 ** variable nMem (and later, VdbeFrame.nChildMem) to this value. 6641 */ 6642 nMem = pProgram->nMem + pProgram->nCsr; 6643 assert( nMem>0 ); 6644 if( pProgram->nCsr==0 ) nMem++; 6645 nByte = ROUND8(sizeof(VdbeFrame)) 6646 + nMem * sizeof(Mem) 6647 + pProgram->nCsr * sizeof(VdbeCursor*) 6648 + (pProgram->nOp + 7)/8; 6649 pFrame = sqlite3DbMallocZero(db, nByte); 6650 if( !pFrame ){ 6651 goto no_mem; 6652 } 6653 sqlite3VdbeMemRelease(pRt); 6654 pRt->flags = MEM_Blob|MEM_Dyn; 6655 pRt->z = (char*)pFrame; 6656 pRt->n = nByte; 6657 pRt->xDel = sqlite3VdbeFrameMemDel; 6658 6659 pFrame->v = p; 6660 pFrame->nChildMem = nMem; 6661 pFrame->nChildCsr = pProgram->nCsr; 6662 pFrame->pc = (int)(pOp - aOp); 6663 pFrame->aMem = p->aMem; 6664 pFrame->nMem = p->nMem; 6665 pFrame->apCsr = p->apCsr; 6666 pFrame->nCursor = p->nCursor; 6667 pFrame->aOp = p->aOp; 6668 pFrame->nOp = p->nOp; 6669 pFrame->token = pProgram->token; 6670 #ifdef SQLITE_ENABLE_STMT_SCANSTATUS 6671 pFrame->anExec = p->anExec; 6672 #endif 6673 #ifdef SQLITE_DEBUG 6674 pFrame->iFrameMagic = SQLITE_FRAME_MAGIC; 6675 #endif 6676 6677 pEnd = &VdbeFrameMem(pFrame)[pFrame->nChildMem]; 6678 for(pMem=VdbeFrameMem(pFrame); pMem!=pEnd; pMem++){ 6679 pMem->flags = MEM_Undefined; 6680 pMem->db = db; 6681 } 6682 }else{ 6683 pFrame = (VdbeFrame*)pRt->z; 6684 assert( pRt->xDel==sqlite3VdbeFrameMemDel ); 6685 assert( pProgram->nMem+pProgram->nCsr==pFrame->nChildMem 6686 || (pProgram->nCsr==0 && pProgram->nMem+1==pFrame->nChildMem) ); 6687 assert( pProgram->nCsr==pFrame->nChildCsr ); 6688 assert( (int)(pOp - aOp)==pFrame->pc ); 6689 } 6690 6691 p->nFrame++; 6692 pFrame->pParent = p->pFrame; 6693 pFrame->lastRowid = db->lastRowid; 6694 pFrame->nChange = p->nChange; 6695 pFrame->nDbChange = p->db->nChange; 6696 assert( pFrame->pAuxData==0 ); 6697 pFrame->pAuxData = p->pAuxData; 6698 p->pAuxData = 0; 6699 p->nChange = 0; 6700 p->pFrame = pFrame; 6701 p->aMem = aMem = VdbeFrameMem(pFrame); 6702 p->nMem = pFrame->nChildMem; 6703 p->nCursor = (u16)pFrame->nChildCsr; 6704 p->apCsr = (VdbeCursor **)&aMem[p->nMem]; 6705 pFrame->aOnce = (u8*)&p->apCsr[pProgram->nCsr]; 6706 memset(pFrame->aOnce, 0, (pProgram->nOp + 7)/8); 6707 p->aOp = aOp = pProgram->aOp; 6708 p->nOp = pProgram->nOp; 6709 #ifdef SQLITE_ENABLE_STMT_SCANSTATUS 6710 p->anExec = 0; 6711 #endif 6712 #ifdef SQLITE_DEBUG 6713 /* Verify that second and subsequent executions of the same trigger do not 6714 ** try to reuse register values from the first use. */ 6715 { 6716 int i; 6717 for(i=0; i<p->nMem; i++){ 6718 aMem[i].pScopyFrom = 0; /* Prevent false-positive AboutToChange() errs */ 6719 MemSetTypeFlag(&aMem[i], MEM_Undefined); /* Fault if this reg is reused */ 6720 } 6721 } 6722 #endif 6723 pOp = &aOp[-1]; 6724 goto check_for_interrupt; 6725 } 6726 6727 /* Opcode: Param P1 P2 * * * 6728 ** 6729 ** This opcode is only ever present in sub-programs called via the 6730 ** OP_Program instruction. Copy a value currently stored in a memory 6731 ** cell of the calling (parent) frame to cell P2 in the current frames 6732 ** address space. This is used by trigger programs to access the new.* 6733 ** and old.* values. 6734 ** 6735 ** The address of the cell in the parent frame is determined by adding 6736 ** the value of the P1 argument to the value of the P1 argument to the 6737 ** calling OP_Program instruction. 6738 */ 6739 case OP_Param: { /* out2 */ 6740 VdbeFrame *pFrame; 6741 Mem *pIn; 6742 pOut = out2Prerelease(p, pOp); 6743 pFrame = p->pFrame; 6744 pIn = &pFrame->aMem[pOp->p1 + pFrame->aOp[pFrame->pc].p1]; 6745 sqlite3VdbeMemShallowCopy(pOut, pIn, MEM_Ephem); 6746 break; 6747 } 6748 6749 #endif /* #ifndef SQLITE_OMIT_TRIGGER */ 6750 6751 #ifndef SQLITE_OMIT_FOREIGN_KEY 6752 /* Opcode: FkCounter P1 P2 * * * 6753 ** Synopsis: fkctr[P1]+=P2 6754 ** 6755 ** Increment a "constraint counter" by P2 (P2 may be negative or positive). 6756 ** If P1 is non-zero, the database constraint counter is incremented 6757 ** (deferred foreign key constraints). Otherwise, if P1 is zero, the 6758 ** statement counter is incremented (immediate foreign key constraints). 6759 */ 6760 case OP_FkCounter: { 6761 if( db->flags & SQLITE_DeferFKs ){ 6762 db->nDeferredImmCons += pOp->p2; 6763 }else if( pOp->p1 ){ 6764 db->nDeferredCons += pOp->p2; 6765 }else{ 6766 p->nFkConstraint += pOp->p2; 6767 } 6768 break; 6769 } 6770 6771 /* Opcode: FkIfZero P1 P2 * * * 6772 ** Synopsis: if fkctr[P1]==0 goto P2 6773 ** 6774 ** This opcode tests if a foreign key constraint-counter is currently zero. 6775 ** If so, jump to instruction P2. Otherwise, fall through to the next 6776 ** instruction. 6777 ** 6778 ** If P1 is non-zero, then the jump is taken if the database constraint-counter 6779 ** is zero (the one that counts deferred constraint violations). If P1 is 6780 ** zero, the jump is taken if the statement constraint-counter is zero 6781 ** (immediate foreign key constraint violations). 6782 */ 6783 case OP_FkIfZero: { /* jump */ 6784 if( pOp->p1 ){ 6785 VdbeBranchTaken(db->nDeferredCons==0 && db->nDeferredImmCons==0, 2); 6786 if( db->nDeferredCons==0 && db->nDeferredImmCons==0 ) goto jump_to_p2; 6787 }else{ 6788 VdbeBranchTaken(p->nFkConstraint==0 && db->nDeferredImmCons==0, 2); 6789 if( p->nFkConstraint==0 && db->nDeferredImmCons==0 ) goto jump_to_p2; 6790 } 6791 break; 6792 } 6793 #endif /* #ifndef SQLITE_OMIT_FOREIGN_KEY */ 6794 6795 #ifndef SQLITE_OMIT_AUTOINCREMENT 6796 /* Opcode: MemMax P1 P2 * * * 6797 ** Synopsis: r[P1]=max(r[P1],r[P2]) 6798 ** 6799 ** P1 is a register in the root frame of this VM (the root frame is 6800 ** different from the current frame if this instruction is being executed 6801 ** within a sub-program). Set the value of register P1 to the maximum of 6802 ** its current value and the value in register P2. 6803 ** 6804 ** This instruction throws an error if the memory cell is not initially 6805 ** an integer. 6806 */ 6807 case OP_MemMax: { /* in2 */ 6808 VdbeFrame *pFrame; 6809 if( p->pFrame ){ 6810 for(pFrame=p->pFrame; pFrame->pParent; pFrame=pFrame->pParent); 6811 pIn1 = &pFrame->aMem[pOp->p1]; 6812 }else{ 6813 pIn1 = &aMem[pOp->p1]; 6814 } 6815 assert( memIsValid(pIn1) ); 6816 sqlite3VdbeMemIntegerify(pIn1); 6817 pIn2 = &aMem[pOp->p2]; 6818 sqlite3VdbeMemIntegerify(pIn2); 6819 if( pIn1->u.i<pIn2->u.i){ 6820 pIn1->u.i = pIn2->u.i; 6821 } 6822 break; 6823 } 6824 #endif /* SQLITE_OMIT_AUTOINCREMENT */ 6825 6826 /* Opcode: IfPos P1 P2 P3 * * 6827 ** Synopsis: if r[P1]>0 then r[P1]-=P3, goto P2 6828 ** 6829 ** Register P1 must contain an integer. 6830 ** If the value of register P1 is 1 or greater, subtract P3 from the 6831 ** value in P1 and jump to P2. 6832 ** 6833 ** If the initial value of register P1 is less than 1, then the 6834 ** value is unchanged and control passes through to the next instruction. 6835 */ 6836 case OP_IfPos: { /* jump, in1 */ 6837 pIn1 = &aMem[pOp->p1]; 6838 assert( pIn1->flags&MEM_Int ); 6839 VdbeBranchTaken( pIn1->u.i>0, 2); 6840 if( pIn1->u.i>0 ){ 6841 pIn1->u.i -= pOp->p3; 6842 goto jump_to_p2; 6843 } 6844 break; 6845 } 6846 6847 /* Opcode: OffsetLimit P1 P2 P3 * * 6848 ** Synopsis: if r[P1]>0 then r[P2]=r[P1]+max(0,r[P3]) else r[P2]=(-1) 6849 ** 6850 ** This opcode performs a commonly used computation associated with 6851 ** LIMIT and OFFSET process. r[P1] holds the limit counter. r[P3] 6852 ** holds the offset counter. The opcode computes the combined value 6853 ** of the LIMIT and OFFSET and stores that value in r[P2]. The r[P2] 6854 ** value computed is the total number of rows that will need to be 6855 ** visited in order to complete the query. 6856 ** 6857 ** If r[P3] is zero or negative, that means there is no OFFSET 6858 ** and r[P2] is set to be the value of the LIMIT, r[P1]. 6859 ** 6860 ** if r[P1] is zero or negative, that means there is no LIMIT 6861 ** and r[P2] is set to -1. 6862 ** 6863 ** Otherwise, r[P2] is set to the sum of r[P1] and r[P3]. 6864 */ 6865 case OP_OffsetLimit: { /* in1, out2, in3 */ 6866 i64 x; 6867 pIn1 = &aMem[pOp->p1]; 6868 pIn3 = &aMem[pOp->p3]; 6869 pOut = out2Prerelease(p, pOp); 6870 assert( pIn1->flags & MEM_Int ); 6871 assert( pIn3->flags & MEM_Int ); 6872 x = pIn1->u.i; 6873 if( x<=0 || sqlite3AddInt64(&x, pIn3->u.i>0?pIn3->u.i:0) ){ 6874 /* If the LIMIT is less than or equal to zero, loop forever. This 6875 ** is documented. But also, if the LIMIT+OFFSET exceeds 2^63 then 6876 ** also loop forever. This is undocumented. In fact, one could argue 6877 ** that the loop should terminate. But assuming 1 billion iterations 6878 ** per second (far exceeding the capabilities of any current hardware) 6879 ** it would take nearly 300 years to actually reach the limit. So 6880 ** looping forever is a reasonable approximation. */ 6881 pOut->u.i = -1; 6882 }else{ 6883 pOut->u.i = x; 6884 } 6885 break; 6886 } 6887 6888 /* Opcode: IfNotZero P1 P2 * * * 6889 ** Synopsis: if r[P1]!=0 then r[P1]--, goto P2 6890 ** 6891 ** Register P1 must contain an integer. If the content of register P1 is 6892 ** initially greater than zero, then decrement the value in register P1. 6893 ** If it is non-zero (negative or positive) and then also jump to P2. 6894 ** If register P1 is initially zero, leave it unchanged and fall through. 6895 */ 6896 case OP_IfNotZero: { /* jump, in1 */ 6897 pIn1 = &aMem[pOp->p1]; 6898 assert( pIn1->flags&MEM_Int ); 6899 VdbeBranchTaken(pIn1->u.i<0, 2); 6900 if( pIn1->u.i ){ 6901 if( pIn1->u.i>0 ) pIn1->u.i--; 6902 goto jump_to_p2; 6903 } 6904 break; 6905 } 6906 6907 /* Opcode: DecrJumpZero P1 P2 * * * 6908 ** Synopsis: if (--r[P1])==0 goto P2 6909 ** 6910 ** Register P1 must hold an integer. Decrement the value in P1 6911 ** and jump to P2 if the new value is exactly zero. 6912 */ 6913 case OP_DecrJumpZero: { /* jump, in1 */ 6914 pIn1 = &aMem[pOp->p1]; 6915 assert( pIn1->flags&MEM_Int ); 6916 if( pIn1->u.i>SMALLEST_INT64 ) pIn1->u.i--; 6917 VdbeBranchTaken(pIn1->u.i==0, 2); 6918 if( pIn1->u.i==0 ) goto jump_to_p2; 6919 break; 6920 } 6921 6922 6923 /* Opcode: AggStep * P2 P3 P4 P5 6924 ** Synopsis: accum=r[P3] step(r[P2@P5]) 6925 ** 6926 ** Execute the xStep function for an aggregate. 6927 ** The function has P5 arguments. P4 is a pointer to the 6928 ** FuncDef structure that specifies the function. Register P3 is the 6929 ** accumulator. 6930 ** 6931 ** The P5 arguments are taken from register P2 and its 6932 ** successors. 6933 */ 6934 /* Opcode: AggInverse * P2 P3 P4 P5 6935 ** Synopsis: accum=r[P3] inverse(r[P2@P5]) 6936 ** 6937 ** Execute the xInverse function for an aggregate. 6938 ** The function has P5 arguments. P4 is a pointer to the 6939 ** FuncDef structure that specifies the function. Register P3 is the 6940 ** accumulator. 6941 ** 6942 ** The P5 arguments are taken from register P2 and its 6943 ** successors. 6944 */ 6945 /* Opcode: AggStep1 P1 P2 P3 P4 P5 6946 ** Synopsis: accum=r[P3] step(r[P2@P5]) 6947 ** 6948 ** Execute the xStep (if P1==0) or xInverse (if P1!=0) function for an 6949 ** aggregate. The function has P5 arguments. P4 is a pointer to the 6950 ** FuncDef structure that specifies the function. Register P3 is the 6951 ** accumulator. 6952 ** 6953 ** The P5 arguments are taken from register P2 and its 6954 ** successors. 6955 ** 6956 ** This opcode is initially coded as OP_AggStep0. On first evaluation, 6957 ** the FuncDef stored in P4 is converted into an sqlite3_context and 6958 ** the opcode is changed. In this way, the initialization of the 6959 ** sqlite3_context only happens once, instead of on each call to the 6960 ** step function. 6961 */ 6962 case OP_AggInverse: 6963 case OP_AggStep: { 6964 int n; 6965 sqlite3_context *pCtx; 6966 6967 assert( pOp->p4type==P4_FUNCDEF ); 6968 n = pOp->p5; 6969 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) ); 6970 assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem+1 - p->nCursor)+1) ); 6971 assert( pOp->p3<pOp->p2 || pOp->p3>=pOp->p2+n ); 6972 pCtx = sqlite3DbMallocRawNN(db, n*sizeof(sqlite3_value*) + 6973 (sizeof(pCtx[0]) + sizeof(Mem) - sizeof(sqlite3_value*))); 6974 if( pCtx==0 ) goto no_mem; 6975 pCtx->pMem = 0; 6976 pCtx->pOut = (Mem*)&(pCtx->argv[n]); 6977 sqlite3VdbeMemInit(pCtx->pOut, db, MEM_Null); 6978 pCtx->pFunc = pOp->p4.pFunc; 6979 pCtx->iOp = (int)(pOp - aOp); 6980 pCtx->pVdbe = p; 6981 pCtx->skipFlag = 0; 6982 pCtx->isError = 0; 6983 pCtx->argc = n; 6984 pOp->p4type = P4_FUNCCTX; 6985 pOp->p4.pCtx = pCtx; 6986 6987 /* OP_AggInverse must have P1==1 and OP_AggStep must have P1==0 */ 6988 assert( pOp->p1==(pOp->opcode==OP_AggInverse) ); 6989 6990 pOp->opcode = OP_AggStep1; 6991 /* Fall through into OP_AggStep */ 6992 /* no break */ deliberate_fall_through 6993 } 6994 case OP_AggStep1: { 6995 int i; 6996 sqlite3_context *pCtx; 6997 Mem *pMem; 6998 6999 assert( pOp->p4type==P4_FUNCCTX ); 7000 pCtx = pOp->p4.pCtx; 7001 pMem = &aMem[pOp->p3]; 7002 7003 #ifdef SQLITE_DEBUG 7004 if( pOp->p1 ){ 7005 /* This is an OP_AggInverse call. Verify that xStep has always 7006 ** been called at least once prior to any xInverse call. */ 7007 assert( pMem->uTemp==0x1122e0e3 ); 7008 }else{ 7009 /* This is an OP_AggStep call. Mark it as such. */ 7010 pMem->uTemp = 0x1122e0e3; 7011 } 7012 #endif 7013 7014 /* If this function is inside of a trigger, the register array in aMem[] 7015 ** might change from one evaluation to the next. The next block of code 7016 ** checks to see if the register array has changed, and if so it 7017 ** reinitializes the relavant parts of the sqlite3_context object */ 7018 if( pCtx->pMem != pMem ){ 7019 pCtx->pMem = pMem; 7020 for(i=pCtx->argc-1; i>=0; i--) pCtx->argv[i] = &aMem[pOp->p2+i]; 7021 } 7022 7023 #ifdef SQLITE_DEBUG 7024 for(i=0; i<pCtx->argc; i++){ 7025 assert( memIsValid(pCtx->argv[i]) ); 7026 REGISTER_TRACE(pOp->p2+i, pCtx->argv[i]); 7027 } 7028 #endif 7029 7030 pMem->n++; 7031 assert( pCtx->pOut->flags==MEM_Null ); 7032 assert( pCtx->isError==0 ); 7033 assert( pCtx->skipFlag==0 ); 7034 #ifndef SQLITE_OMIT_WINDOWFUNC 7035 if( pOp->p1 ){ 7036 (pCtx->pFunc->xInverse)(pCtx,pCtx->argc,pCtx->argv); 7037 }else 7038 #endif 7039 (pCtx->pFunc->xSFunc)(pCtx,pCtx->argc,pCtx->argv); /* IMP: R-24505-23230 */ 7040 7041 if( pCtx->isError ){ 7042 if( pCtx->isError>0 ){ 7043 sqlite3VdbeError(p, "%s", sqlite3_value_text(pCtx->pOut)); 7044 rc = pCtx->isError; 7045 } 7046 if( pCtx->skipFlag ){ 7047 assert( pOp[-1].opcode==OP_CollSeq ); 7048 i = pOp[-1].p1; 7049 if( i ) sqlite3VdbeMemSetInt64(&aMem[i], 1); 7050 pCtx->skipFlag = 0; 7051 } 7052 sqlite3VdbeMemRelease(pCtx->pOut); 7053 pCtx->pOut->flags = MEM_Null; 7054 pCtx->isError = 0; 7055 if( rc ) goto abort_due_to_error; 7056 } 7057 assert( pCtx->pOut->flags==MEM_Null ); 7058 assert( pCtx->skipFlag==0 ); 7059 break; 7060 } 7061 7062 /* Opcode: AggFinal P1 P2 * P4 * 7063 ** Synopsis: accum=r[P1] N=P2 7064 ** 7065 ** P1 is the memory location that is the accumulator for an aggregate 7066 ** or window function. Execute the finalizer function 7067 ** for an aggregate and store the result in P1. 7068 ** 7069 ** P2 is the number of arguments that the step function takes and 7070 ** P4 is a pointer to the FuncDef for this function. The P2 7071 ** argument is not used by this opcode. It is only there to disambiguate 7072 ** functions that can take varying numbers of arguments. The 7073 ** P4 argument is only needed for the case where 7074 ** the step function was not previously called. 7075 */ 7076 /* Opcode: AggValue * P2 P3 P4 * 7077 ** Synopsis: r[P3]=value N=P2 7078 ** 7079 ** Invoke the xValue() function and store the result in register P3. 7080 ** 7081 ** P2 is the number of arguments that the step function takes and 7082 ** P4 is a pointer to the FuncDef for this function. The P2 7083 ** argument is not used by this opcode. It is only there to disambiguate 7084 ** functions that can take varying numbers of arguments. The 7085 ** P4 argument is only needed for the case where 7086 ** the step function was not previously called. 7087 */ 7088 case OP_AggValue: 7089 case OP_AggFinal: { 7090 Mem *pMem; 7091 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) ); 7092 assert( pOp->p3==0 || pOp->opcode==OP_AggValue ); 7093 pMem = &aMem[pOp->p1]; 7094 assert( (pMem->flags & ~(MEM_Null|MEM_Agg))==0 ); 7095 #ifndef SQLITE_OMIT_WINDOWFUNC 7096 if( pOp->p3 ){ 7097 memAboutToChange(p, &aMem[pOp->p3]); 7098 rc = sqlite3VdbeMemAggValue(pMem, &aMem[pOp->p3], pOp->p4.pFunc); 7099 pMem = &aMem[pOp->p3]; 7100 }else 7101 #endif 7102 { 7103 rc = sqlite3VdbeMemFinalize(pMem, pOp->p4.pFunc); 7104 } 7105 7106 if( rc ){ 7107 sqlite3VdbeError(p, "%s", sqlite3_value_text(pMem)); 7108 goto abort_due_to_error; 7109 } 7110 sqlite3VdbeChangeEncoding(pMem, encoding); 7111 UPDATE_MAX_BLOBSIZE(pMem); 7112 if( sqlite3VdbeMemTooBig(pMem) ){ 7113 goto too_big; 7114 } 7115 break; 7116 } 7117 7118 #ifndef SQLITE_OMIT_WAL 7119 /* Opcode: Checkpoint P1 P2 P3 * * 7120 ** 7121 ** Checkpoint database P1. This is a no-op if P1 is not currently in 7122 ** WAL mode. Parameter P2 is one of SQLITE_CHECKPOINT_PASSIVE, FULL, 7123 ** RESTART, or TRUNCATE. Write 1 or 0 into mem[P3] if the checkpoint returns 7124 ** SQLITE_BUSY or not, respectively. Write the number of pages in the 7125 ** WAL after the checkpoint into mem[P3+1] and the number of pages 7126 ** in the WAL that have been checkpointed after the checkpoint 7127 ** completes into mem[P3+2]. However on an error, mem[P3+1] and 7128 ** mem[P3+2] are initialized to -1. 7129 */ 7130 case OP_Checkpoint: { 7131 int i; /* Loop counter */ 7132 int aRes[3]; /* Results */ 7133 Mem *pMem; /* Write results here */ 7134 7135 assert( p->readOnly==0 ); 7136 aRes[0] = 0; 7137 aRes[1] = aRes[2] = -1; 7138 assert( pOp->p2==SQLITE_CHECKPOINT_PASSIVE 7139 || pOp->p2==SQLITE_CHECKPOINT_FULL 7140 || pOp->p2==SQLITE_CHECKPOINT_RESTART 7141 || pOp->p2==SQLITE_CHECKPOINT_TRUNCATE 7142 ); 7143 rc = sqlite3Checkpoint(db, pOp->p1, pOp->p2, &aRes[1], &aRes[2]); 7144 if( rc ){ 7145 if( rc!=SQLITE_BUSY ) goto abort_due_to_error; 7146 rc = SQLITE_OK; 7147 aRes[0] = 1; 7148 } 7149 for(i=0, pMem = &aMem[pOp->p3]; i<3; i++, pMem++){ 7150 sqlite3VdbeMemSetInt64(pMem, (i64)aRes[i]); 7151 } 7152 break; 7153 }; 7154 #endif 7155 7156 #ifndef SQLITE_OMIT_PRAGMA 7157 /* Opcode: JournalMode P1 P2 P3 * * 7158 ** 7159 ** Change the journal mode of database P1 to P3. P3 must be one of the 7160 ** PAGER_JOURNALMODE_XXX values. If changing between the various rollback 7161 ** modes (delete, truncate, persist, off and memory), this is a simple 7162 ** operation. No IO is required. 7163 ** 7164 ** If changing into or out of WAL mode the procedure is more complicated. 7165 ** 7166 ** Write a string containing the final journal-mode to register P2. 7167 */ 7168 case OP_JournalMode: { /* out2 */ 7169 Btree *pBt; /* Btree to change journal mode of */ 7170 Pager *pPager; /* Pager associated with pBt */ 7171 int eNew; /* New journal mode */ 7172 int eOld; /* The old journal mode */ 7173 #ifndef SQLITE_OMIT_WAL 7174 const char *zFilename; /* Name of database file for pPager */ 7175 #endif 7176 7177 pOut = out2Prerelease(p, pOp); 7178 eNew = pOp->p3; 7179 assert( eNew==PAGER_JOURNALMODE_DELETE 7180 || eNew==PAGER_JOURNALMODE_TRUNCATE 7181 || eNew==PAGER_JOURNALMODE_PERSIST 7182 || eNew==PAGER_JOURNALMODE_OFF 7183 || eNew==PAGER_JOURNALMODE_MEMORY 7184 || eNew==PAGER_JOURNALMODE_WAL 7185 || eNew==PAGER_JOURNALMODE_QUERY 7186 ); 7187 assert( pOp->p1>=0 && pOp->p1<db->nDb ); 7188 assert( p->readOnly==0 ); 7189 7190 pBt = db->aDb[pOp->p1].pBt; 7191 pPager = sqlite3BtreePager(pBt); 7192 eOld = sqlite3PagerGetJournalMode(pPager); 7193 if( eNew==PAGER_JOURNALMODE_QUERY ) eNew = eOld; 7194 if( !sqlite3PagerOkToChangeJournalMode(pPager) ) eNew = eOld; 7195 7196 #ifndef SQLITE_OMIT_WAL 7197 zFilename = sqlite3PagerFilename(pPager, 1); 7198 7199 /* Do not allow a transition to journal_mode=WAL for a database 7200 ** in temporary storage or if the VFS does not support shared memory 7201 */ 7202 if( eNew==PAGER_JOURNALMODE_WAL 7203 && (sqlite3Strlen30(zFilename)==0 /* Temp file */ 7204 || !sqlite3PagerWalSupported(pPager)) /* No shared-memory support */ 7205 ){ 7206 eNew = eOld; 7207 } 7208 7209 if( (eNew!=eOld) 7210 && (eOld==PAGER_JOURNALMODE_WAL || eNew==PAGER_JOURNALMODE_WAL) 7211 ){ 7212 if( !db->autoCommit || db->nVdbeRead>1 ){ 7213 rc = SQLITE_ERROR; 7214 sqlite3VdbeError(p, 7215 "cannot change %s wal mode from within a transaction", 7216 (eNew==PAGER_JOURNALMODE_WAL ? "into" : "out of") 7217 ); 7218 goto abort_due_to_error; 7219 }else{ 7220 7221 if( eOld==PAGER_JOURNALMODE_WAL ){ 7222 /* If leaving WAL mode, close the log file. If successful, the call 7223 ** to PagerCloseWal() checkpoints and deletes the write-ahead-log 7224 ** file. An EXCLUSIVE lock may still be held on the database file 7225 ** after a successful return. 7226 */ 7227 rc = sqlite3PagerCloseWal(pPager, db); 7228 if( rc==SQLITE_OK ){ 7229 sqlite3PagerSetJournalMode(pPager, eNew); 7230 } 7231 }else if( eOld==PAGER_JOURNALMODE_MEMORY ){ 7232 /* Cannot transition directly from MEMORY to WAL. Use mode OFF 7233 ** as an intermediate */ 7234 sqlite3PagerSetJournalMode(pPager, PAGER_JOURNALMODE_OFF); 7235 } 7236 7237 /* Open a transaction on the database file. Regardless of the journal 7238 ** mode, this transaction always uses a rollback journal. 7239 */ 7240 assert( sqlite3BtreeTxnState(pBt)!=SQLITE_TXN_WRITE ); 7241 if( rc==SQLITE_OK ){ 7242 rc = sqlite3BtreeSetVersion(pBt, (eNew==PAGER_JOURNALMODE_WAL ? 2 : 1)); 7243 } 7244 } 7245 } 7246 #endif /* ifndef SQLITE_OMIT_WAL */ 7247 7248 if( rc ) eNew = eOld; 7249 eNew = sqlite3PagerSetJournalMode(pPager, eNew); 7250 7251 pOut->flags = MEM_Str|MEM_Static|MEM_Term; 7252 pOut->z = (char *)sqlite3JournalModename(eNew); 7253 pOut->n = sqlite3Strlen30(pOut->z); 7254 pOut->enc = SQLITE_UTF8; 7255 sqlite3VdbeChangeEncoding(pOut, encoding); 7256 if( rc ) goto abort_due_to_error; 7257 break; 7258 }; 7259 #endif /* SQLITE_OMIT_PRAGMA */ 7260 7261 #if !defined(SQLITE_OMIT_VACUUM) && !defined(SQLITE_OMIT_ATTACH) 7262 /* Opcode: Vacuum P1 P2 * * * 7263 ** 7264 ** Vacuum the entire database P1. P1 is 0 for "main", and 2 or more 7265 ** for an attached database. The "temp" database may not be vacuumed. 7266 ** 7267 ** If P2 is not zero, then it is a register holding a string which is 7268 ** the file into which the result of vacuum should be written. When 7269 ** P2 is zero, the vacuum overwrites the original database. 7270 */ 7271 case OP_Vacuum: { 7272 assert( p->readOnly==0 ); 7273 rc = sqlite3RunVacuum(&p->zErrMsg, db, pOp->p1, 7274 pOp->p2 ? &aMem[pOp->p2] : 0); 7275 if( rc ) goto abort_due_to_error; 7276 break; 7277 } 7278 #endif 7279 7280 #if !defined(SQLITE_OMIT_AUTOVACUUM) 7281 /* Opcode: IncrVacuum P1 P2 * * * 7282 ** 7283 ** Perform a single step of the incremental vacuum procedure on 7284 ** the P1 database. If the vacuum has finished, jump to instruction 7285 ** P2. Otherwise, fall through to the next instruction. 7286 */ 7287 case OP_IncrVacuum: { /* jump */ 7288 Btree *pBt; 7289 7290 assert( pOp->p1>=0 && pOp->p1<db->nDb ); 7291 assert( DbMaskTest(p->btreeMask, pOp->p1) ); 7292 assert( p->readOnly==0 ); 7293 pBt = db->aDb[pOp->p1].pBt; 7294 rc = sqlite3BtreeIncrVacuum(pBt); 7295 VdbeBranchTaken(rc==SQLITE_DONE,2); 7296 if( rc ){ 7297 if( rc!=SQLITE_DONE ) goto abort_due_to_error; 7298 rc = SQLITE_OK; 7299 goto jump_to_p2; 7300 } 7301 break; 7302 } 7303 #endif 7304 7305 /* Opcode: Expire P1 P2 * * * 7306 ** 7307 ** Cause precompiled statements to expire. When an expired statement 7308 ** is executed using sqlite3_step() it will either automatically 7309 ** reprepare itself (if it was originally created using sqlite3_prepare_v2()) 7310 ** or it will fail with SQLITE_SCHEMA. 7311 ** 7312 ** If P1 is 0, then all SQL statements become expired. If P1 is non-zero, 7313 ** then only the currently executing statement is expired. 7314 ** 7315 ** If P2 is 0, then SQL statements are expired immediately. If P2 is 1, 7316 ** then running SQL statements are allowed to continue to run to completion. 7317 ** The P2==1 case occurs when a CREATE INDEX or similar schema change happens 7318 ** that might help the statement run faster but which does not affect the 7319 ** correctness of operation. 7320 */ 7321 case OP_Expire: { 7322 assert( pOp->p2==0 || pOp->p2==1 ); 7323 if( !pOp->p1 ){ 7324 sqlite3ExpirePreparedStatements(db, pOp->p2); 7325 }else{ 7326 p->expired = pOp->p2+1; 7327 } 7328 break; 7329 } 7330 7331 /* Opcode: CursorLock P1 * * * * 7332 ** 7333 ** Lock the btree to which cursor P1 is pointing so that the btree cannot be 7334 ** written by an other cursor. 7335 */ 7336 case OP_CursorLock: { 7337 VdbeCursor *pC; 7338 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 7339 pC = p->apCsr[pOp->p1]; 7340 assert( pC!=0 ); 7341 assert( pC->eCurType==CURTYPE_BTREE ); 7342 sqlite3BtreeCursorPin(pC->uc.pCursor); 7343 break; 7344 } 7345 7346 /* Opcode: CursorUnlock P1 * * * * 7347 ** 7348 ** Unlock the btree to which cursor P1 is pointing so that it can be 7349 ** written by other cursors. 7350 */ 7351 case OP_CursorUnlock: { 7352 VdbeCursor *pC; 7353 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 7354 pC = p->apCsr[pOp->p1]; 7355 assert( pC!=0 ); 7356 assert( pC->eCurType==CURTYPE_BTREE ); 7357 sqlite3BtreeCursorUnpin(pC->uc.pCursor); 7358 break; 7359 } 7360 7361 #ifndef SQLITE_OMIT_SHARED_CACHE 7362 /* Opcode: TableLock P1 P2 P3 P4 * 7363 ** Synopsis: iDb=P1 root=P2 write=P3 7364 ** 7365 ** Obtain a lock on a particular table. This instruction is only used when 7366 ** the shared-cache feature is enabled. 7367 ** 7368 ** P1 is the index of the database in sqlite3.aDb[] of the database 7369 ** on which the lock is acquired. A readlock is obtained if P3==0 or 7370 ** a write lock if P3==1. 7371 ** 7372 ** P2 contains the root-page of the table to lock. 7373 ** 7374 ** P4 contains a pointer to the name of the table being locked. This is only 7375 ** used to generate an error message if the lock cannot be obtained. 7376 */ 7377 case OP_TableLock: { 7378 u8 isWriteLock = (u8)pOp->p3; 7379 if( isWriteLock || 0==(db->flags&SQLITE_ReadUncommit) ){ 7380 int p1 = pOp->p1; 7381 assert( p1>=0 && p1<db->nDb ); 7382 assert( DbMaskTest(p->btreeMask, p1) ); 7383 assert( isWriteLock==0 || isWriteLock==1 ); 7384 rc = sqlite3BtreeLockTable(db->aDb[p1].pBt, pOp->p2, isWriteLock); 7385 if( rc ){ 7386 if( (rc&0xFF)==SQLITE_LOCKED ){ 7387 const char *z = pOp->p4.z; 7388 sqlite3VdbeError(p, "database table is locked: %s", z); 7389 } 7390 goto abort_due_to_error; 7391 } 7392 } 7393 break; 7394 } 7395 #endif /* SQLITE_OMIT_SHARED_CACHE */ 7396 7397 #ifndef SQLITE_OMIT_VIRTUALTABLE 7398 /* Opcode: VBegin * * * P4 * 7399 ** 7400 ** P4 may be a pointer to an sqlite3_vtab structure. If so, call the 7401 ** xBegin method for that table. 7402 ** 7403 ** Also, whether or not P4 is set, check that this is not being called from 7404 ** within a callback to a virtual table xSync() method. If it is, the error 7405 ** code will be set to SQLITE_LOCKED. 7406 */ 7407 case OP_VBegin: { 7408 VTable *pVTab; 7409 pVTab = pOp->p4.pVtab; 7410 rc = sqlite3VtabBegin(db, pVTab); 7411 if( pVTab ) sqlite3VtabImportErrmsg(p, pVTab->pVtab); 7412 if( rc ) goto abort_due_to_error; 7413 break; 7414 } 7415 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7416 7417 #ifndef SQLITE_OMIT_VIRTUALTABLE 7418 /* Opcode: VCreate P1 P2 * * * 7419 ** 7420 ** P2 is a register that holds the name of a virtual table in database 7421 ** P1. Call the xCreate method for that table. 7422 */ 7423 case OP_VCreate: { 7424 Mem sMem; /* For storing the record being decoded */ 7425 const char *zTab; /* Name of the virtual table */ 7426 7427 memset(&sMem, 0, sizeof(sMem)); 7428 sMem.db = db; 7429 /* Because P2 is always a static string, it is impossible for the 7430 ** sqlite3VdbeMemCopy() to fail */ 7431 assert( (aMem[pOp->p2].flags & MEM_Str)!=0 ); 7432 assert( (aMem[pOp->p2].flags & MEM_Static)!=0 ); 7433 rc = sqlite3VdbeMemCopy(&sMem, &aMem[pOp->p2]); 7434 assert( rc==SQLITE_OK ); 7435 zTab = (const char*)sqlite3_value_text(&sMem); 7436 assert( zTab || db->mallocFailed ); 7437 if( zTab ){ 7438 rc = sqlite3VtabCallCreate(db, pOp->p1, zTab, &p->zErrMsg); 7439 } 7440 sqlite3VdbeMemRelease(&sMem); 7441 if( rc ) goto abort_due_to_error; 7442 break; 7443 } 7444 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7445 7446 #ifndef SQLITE_OMIT_VIRTUALTABLE 7447 /* Opcode: VDestroy P1 * * P4 * 7448 ** 7449 ** P4 is the name of a virtual table in database P1. Call the xDestroy method 7450 ** of that table. 7451 */ 7452 case OP_VDestroy: { 7453 db->nVDestroy++; 7454 rc = sqlite3VtabCallDestroy(db, pOp->p1, pOp->p4.z); 7455 db->nVDestroy--; 7456 assert( p->errorAction==OE_Abort && p->usesStmtJournal ); 7457 if( rc ) goto abort_due_to_error; 7458 break; 7459 } 7460 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7461 7462 #ifndef SQLITE_OMIT_VIRTUALTABLE 7463 /* Opcode: VOpen P1 * * P4 * 7464 ** 7465 ** P4 is a pointer to a virtual table object, an sqlite3_vtab structure. 7466 ** P1 is a cursor number. This opcode opens a cursor to the virtual 7467 ** table and stores that cursor in P1. 7468 */ 7469 case OP_VOpen: { 7470 VdbeCursor *pCur; 7471 sqlite3_vtab_cursor *pVCur; 7472 sqlite3_vtab *pVtab; 7473 const sqlite3_module *pModule; 7474 7475 assert( p->bIsReader ); 7476 pCur = 0; 7477 pVCur = 0; 7478 pVtab = pOp->p4.pVtab->pVtab; 7479 if( pVtab==0 || NEVER(pVtab->pModule==0) ){ 7480 rc = SQLITE_LOCKED; 7481 goto abort_due_to_error; 7482 } 7483 pModule = pVtab->pModule; 7484 rc = pModule->xOpen(pVtab, &pVCur); 7485 sqlite3VtabImportErrmsg(p, pVtab); 7486 if( rc ) goto abort_due_to_error; 7487 7488 /* Initialize sqlite3_vtab_cursor base class */ 7489 pVCur->pVtab = pVtab; 7490 7491 /* Initialize vdbe cursor object */ 7492 pCur = allocateCursor(p, pOp->p1, 0, -1, CURTYPE_VTAB); 7493 if( pCur ){ 7494 pCur->uc.pVCur = pVCur; 7495 pVtab->nRef++; 7496 }else{ 7497 assert( db->mallocFailed ); 7498 pModule->xClose(pVCur); 7499 goto no_mem; 7500 } 7501 break; 7502 } 7503 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7504 7505 #ifndef SQLITE_OMIT_VIRTUALTABLE 7506 /* Opcode: VFilter P1 P2 P3 P4 * 7507 ** Synopsis: iplan=r[P3] zplan='P4' 7508 ** 7509 ** P1 is a cursor opened using VOpen. P2 is an address to jump to if 7510 ** the filtered result set is empty. 7511 ** 7512 ** P4 is either NULL or a string that was generated by the xBestIndex 7513 ** method of the module. The interpretation of the P4 string is left 7514 ** to the module implementation. 7515 ** 7516 ** This opcode invokes the xFilter method on the virtual table specified 7517 ** by P1. The integer query plan parameter to xFilter is stored in register 7518 ** P3. Register P3+1 stores the argc parameter to be passed to the 7519 ** xFilter method. Registers P3+2..P3+1+argc are the argc 7520 ** additional parameters which are passed to 7521 ** xFilter as argv. Register P3+2 becomes argv[0] when passed to xFilter. 7522 ** 7523 ** A jump is made to P2 if the result set after filtering would be empty. 7524 */ 7525 case OP_VFilter: { /* jump */ 7526 int nArg; 7527 int iQuery; 7528 const sqlite3_module *pModule; 7529 Mem *pQuery; 7530 Mem *pArgc; 7531 sqlite3_vtab_cursor *pVCur; 7532 sqlite3_vtab *pVtab; 7533 VdbeCursor *pCur; 7534 int res; 7535 int i; 7536 Mem **apArg; 7537 7538 pQuery = &aMem[pOp->p3]; 7539 pArgc = &pQuery[1]; 7540 pCur = p->apCsr[pOp->p1]; 7541 assert( memIsValid(pQuery) ); 7542 REGISTER_TRACE(pOp->p3, pQuery); 7543 assert( pCur->eCurType==CURTYPE_VTAB ); 7544 pVCur = pCur->uc.pVCur; 7545 pVtab = pVCur->pVtab; 7546 pModule = pVtab->pModule; 7547 7548 /* Grab the index number and argc parameters */ 7549 assert( (pQuery->flags&MEM_Int)!=0 && pArgc->flags==MEM_Int ); 7550 nArg = (int)pArgc->u.i; 7551 iQuery = (int)pQuery->u.i; 7552 7553 /* Invoke the xFilter method */ 7554 res = 0; 7555 apArg = p->apArg; 7556 for(i = 0; i<nArg; i++){ 7557 apArg[i] = &pArgc[i+1]; 7558 } 7559 rc = pModule->xFilter(pVCur, iQuery, pOp->p4.z, nArg, apArg); 7560 sqlite3VtabImportErrmsg(p, pVtab); 7561 if( rc ) goto abort_due_to_error; 7562 res = pModule->xEof(pVCur); 7563 pCur->nullRow = 0; 7564 VdbeBranchTaken(res!=0,2); 7565 if( res ) goto jump_to_p2; 7566 break; 7567 } 7568 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7569 7570 #ifndef SQLITE_OMIT_VIRTUALTABLE 7571 /* Opcode: VColumn P1 P2 P3 * P5 7572 ** Synopsis: r[P3]=vcolumn(P2) 7573 ** 7574 ** Store in register P3 the value of the P2-th column of 7575 ** the current row of the virtual-table of cursor P1. 7576 ** 7577 ** If the VColumn opcode is being used to fetch the value of 7578 ** an unchanging column during an UPDATE operation, then the P5 7579 ** value is OPFLAG_NOCHNG. This will cause the sqlite3_vtab_nochange() 7580 ** function to return true inside the xColumn method of the virtual 7581 ** table implementation. The P5 column might also contain other 7582 ** bits (OPFLAG_LENGTHARG or OPFLAG_TYPEOFARG) but those bits are 7583 ** unused by OP_VColumn. 7584 */ 7585 case OP_VColumn: { 7586 sqlite3_vtab *pVtab; 7587 const sqlite3_module *pModule; 7588 Mem *pDest; 7589 sqlite3_context sContext; 7590 7591 VdbeCursor *pCur = p->apCsr[pOp->p1]; 7592 assert( pCur->eCurType==CURTYPE_VTAB ); 7593 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) ); 7594 pDest = &aMem[pOp->p3]; 7595 memAboutToChange(p, pDest); 7596 if( pCur->nullRow ){ 7597 sqlite3VdbeMemSetNull(pDest); 7598 break; 7599 } 7600 pVtab = pCur->uc.pVCur->pVtab; 7601 pModule = pVtab->pModule; 7602 assert( pModule->xColumn ); 7603 memset(&sContext, 0, sizeof(sContext)); 7604 sContext.pOut = pDest; 7605 assert( pOp->p5==OPFLAG_NOCHNG || pOp->p5==0 ); 7606 if( pOp->p5 & OPFLAG_NOCHNG ){ 7607 sqlite3VdbeMemSetNull(pDest); 7608 pDest->flags = MEM_Null|MEM_Zero; 7609 pDest->u.nZero = 0; 7610 }else{ 7611 MemSetTypeFlag(pDest, MEM_Null); 7612 } 7613 rc = pModule->xColumn(pCur->uc.pVCur, &sContext, pOp->p2); 7614 sqlite3VtabImportErrmsg(p, pVtab); 7615 if( sContext.isError>0 ){ 7616 sqlite3VdbeError(p, "%s", sqlite3_value_text(pDest)); 7617 rc = sContext.isError; 7618 } 7619 sqlite3VdbeChangeEncoding(pDest, encoding); 7620 REGISTER_TRACE(pOp->p3, pDest); 7621 UPDATE_MAX_BLOBSIZE(pDest); 7622 7623 if( sqlite3VdbeMemTooBig(pDest) ){ 7624 goto too_big; 7625 } 7626 if( rc ) goto abort_due_to_error; 7627 break; 7628 } 7629 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7630 7631 #ifndef SQLITE_OMIT_VIRTUALTABLE 7632 /* Opcode: VNext P1 P2 * * * 7633 ** 7634 ** Advance virtual table P1 to the next row in its result set and 7635 ** jump to instruction P2. Or, if the virtual table has reached 7636 ** the end of its result set, then fall through to the next instruction. 7637 */ 7638 case OP_VNext: { /* jump */ 7639 sqlite3_vtab *pVtab; 7640 const sqlite3_module *pModule; 7641 int res; 7642 VdbeCursor *pCur; 7643 7644 res = 0; 7645 pCur = p->apCsr[pOp->p1]; 7646 assert( pCur->eCurType==CURTYPE_VTAB ); 7647 if( pCur->nullRow ){ 7648 break; 7649 } 7650 pVtab = pCur->uc.pVCur->pVtab; 7651 pModule = pVtab->pModule; 7652 assert( pModule->xNext ); 7653 7654 /* Invoke the xNext() method of the module. There is no way for the 7655 ** underlying implementation to return an error if one occurs during 7656 ** xNext(). Instead, if an error occurs, true is returned (indicating that 7657 ** data is available) and the error code returned when xColumn or 7658 ** some other method is next invoked on the save virtual table cursor. 7659 */ 7660 rc = pModule->xNext(pCur->uc.pVCur); 7661 sqlite3VtabImportErrmsg(p, pVtab); 7662 if( rc ) goto abort_due_to_error; 7663 res = pModule->xEof(pCur->uc.pVCur); 7664 VdbeBranchTaken(!res,2); 7665 if( !res ){ 7666 /* If there is data, jump to P2 */ 7667 goto jump_to_p2_and_check_for_interrupt; 7668 } 7669 goto check_for_interrupt; 7670 } 7671 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7672 7673 #ifndef SQLITE_OMIT_VIRTUALTABLE 7674 /* Opcode: VRename P1 * * P4 * 7675 ** 7676 ** P4 is a pointer to a virtual table object, an sqlite3_vtab structure. 7677 ** This opcode invokes the corresponding xRename method. The value 7678 ** in register P1 is passed as the zName argument to the xRename method. 7679 */ 7680 case OP_VRename: { 7681 sqlite3_vtab *pVtab; 7682 Mem *pName; 7683 int isLegacy; 7684 7685 isLegacy = (db->flags & SQLITE_LegacyAlter); 7686 db->flags |= SQLITE_LegacyAlter; 7687 pVtab = pOp->p4.pVtab->pVtab; 7688 pName = &aMem[pOp->p1]; 7689 assert( pVtab->pModule->xRename ); 7690 assert( memIsValid(pName) ); 7691 assert( p->readOnly==0 ); 7692 REGISTER_TRACE(pOp->p1, pName); 7693 assert( pName->flags & MEM_Str ); 7694 testcase( pName->enc==SQLITE_UTF8 ); 7695 testcase( pName->enc==SQLITE_UTF16BE ); 7696 testcase( pName->enc==SQLITE_UTF16LE ); 7697 rc = sqlite3VdbeChangeEncoding(pName, SQLITE_UTF8); 7698 if( rc ) goto abort_due_to_error; 7699 rc = pVtab->pModule->xRename(pVtab, pName->z); 7700 if( isLegacy==0 ) db->flags &= ~(u64)SQLITE_LegacyAlter; 7701 sqlite3VtabImportErrmsg(p, pVtab); 7702 p->expired = 0; 7703 if( rc ) goto abort_due_to_error; 7704 break; 7705 } 7706 #endif 7707 7708 #ifndef SQLITE_OMIT_VIRTUALTABLE 7709 /* Opcode: VUpdate P1 P2 P3 P4 P5 7710 ** Synopsis: data=r[P3@P2] 7711 ** 7712 ** P4 is a pointer to a virtual table object, an sqlite3_vtab structure. 7713 ** This opcode invokes the corresponding xUpdate method. P2 values 7714 ** are contiguous memory cells starting at P3 to pass to the xUpdate 7715 ** invocation. The value in register (P3+P2-1) corresponds to the 7716 ** p2th element of the argv array passed to xUpdate. 7717 ** 7718 ** The xUpdate method will do a DELETE or an INSERT or both. 7719 ** The argv[0] element (which corresponds to memory cell P3) 7720 ** is the rowid of a row to delete. If argv[0] is NULL then no 7721 ** deletion occurs. The argv[1] element is the rowid of the new 7722 ** row. This can be NULL to have the virtual table select the new 7723 ** rowid for itself. The subsequent elements in the array are 7724 ** the values of columns in the new row. 7725 ** 7726 ** If P2==1 then no insert is performed. argv[0] is the rowid of 7727 ** a row to delete. 7728 ** 7729 ** P1 is a boolean flag. If it is set to true and the xUpdate call 7730 ** is successful, then the value returned by sqlite3_last_insert_rowid() 7731 ** is set to the value of the rowid for the row just inserted. 7732 ** 7733 ** P5 is the error actions (OE_Replace, OE_Fail, OE_Ignore, etc) to 7734 ** apply in the case of a constraint failure on an insert or update. 7735 */ 7736 case OP_VUpdate: { 7737 sqlite3_vtab *pVtab; 7738 const sqlite3_module *pModule; 7739 int nArg; 7740 int i; 7741 sqlite_int64 rowid; 7742 Mem **apArg; 7743 Mem *pX; 7744 7745 assert( pOp->p2==1 || pOp->p5==OE_Fail || pOp->p5==OE_Rollback 7746 || pOp->p5==OE_Abort || pOp->p5==OE_Ignore || pOp->p5==OE_Replace 7747 ); 7748 assert( p->readOnly==0 ); 7749 if( db->mallocFailed ) goto no_mem; 7750 sqlite3VdbeIncrWriteCounter(p, 0); 7751 pVtab = pOp->p4.pVtab->pVtab; 7752 if( pVtab==0 || NEVER(pVtab->pModule==0) ){ 7753 rc = SQLITE_LOCKED; 7754 goto abort_due_to_error; 7755 } 7756 pModule = pVtab->pModule; 7757 nArg = pOp->p2; 7758 assert( pOp->p4type==P4_VTAB ); 7759 if( ALWAYS(pModule->xUpdate) ){ 7760 u8 vtabOnConflict = db->vtabOnConflict; 7761 apArg = p->apArg; 7762 pX = &aMem[pOp->p3]; 7763 for(i=0; i<nArg; i++){ 7764 assert( memIsValid(pX) ); 7765 memAboutToChange(p, pX); 7766 apArg[i] = pX; 7767 pX++; 7768 } 7769 db->vtabOnConflict = pOp->p5; 7770 rc = pModule->xUpdate(pVtab, nArg, apArg, &rowid); 7771 db->vtabOnConflict = vtabOnConflict; 7772 sqlite3VtabImportErrmsg(p, pVtab); 7773 if( rc==SQLITE_OK && pOp->p1 ){ 7774 assert( nArg>1 && apArg[0] && (apArg[0]->flags&MEM_Null) ); 7775 db->lastRowid = rowid; 7776 } 7777 if( (rc&0xff)==SQLITE_CONSTRAINT && pOp->p4.pVtab->bConstraint ){ 7778 if( pOp->p5==OE_Ignore ){ 7779 rc = SQLITE_OK; 7780 }else{ 7781 p->errorAction = ((pOp->p5==OE_Replace) ? OE_Abort : pOp->p5); 7782 } 7783 }else{ 7784 p->nChange++; 7785 } 7786 if( rc ) goto abort_due_to_error; 7787 } 7788 break; 7789 } 7790 #endif /* SQLITE_OMIT_VIRTUALTABLE */ 7791 7792 #ifndef SQLITE_OMIT_PAGER_PRAGMAS 7793 /* Opcode: Pagecount P1 P2 * * * 7794 ** 7795 ** Write the current number of pages in database P1 to memory cell P2. 7796 */ 7797 case OP_Pagecount: { /* out2 */ 7798 pOut = out2Prerelease(p, pOp); 7799 pOut->u.i = sqlite3BtreeLastPage(db->aDb[pOp->p1].pBt); 7800 break; 7801 } 7802 #endif 7803 7804 7805 #ifndef SQLITE_OMIT_PAGER_PRAGMAS 7806 /* Opcode: MaxPgcnt P1 P2 P3 * * 7807 ** 7808 ** Try to set the maximum page count for database P1 to the value in P3. 7809 ** Do not let the maximum page count fall below the current page count and 7810 ** do not change the maximum page count value if P3==0. 7811 ** 7812 ** Store the maximum page count after the change in register P2. 7813 */ 7814 case OP_MaxPgcnt: { /* out2 */ 7815 unsigned int newMax; 7816 Btree *pBt; 7817 7818 pOut = out2Prerelease(p, pOp); 7819 pBt = db->aDb[pOp->p1].pBt; 7820 newMax = 0; 7821 if( pOp->p3 ){ 7822 newMax = sqlite3BtreeLastPage(pBt); 7823 if( newMax < (unsigned)pOp->p3 ) newMax = (unsigned)pOp->p3; 7824 } 7825 pOut->u.i = sqlite3BtreeMaxPageCount(pBt, newMax); 7826 break; 7827 } 7828 #endif 7829 7830 /* Opcode: Function P1 P2 P3 P4 * 7831 ** Synopsis: r[P3]=func(r[P2@NP]) 7832 ** 7833 ** Invoke a user function (P4 is a pointer to an sqlite3_context object that 7834 ** contains a pointer to the function to be run) with arguments taken 7835 ** from register P2 and successors. The number of arguments is in 7836 ** the sqlite3_context object that P4 points to. 7837 ** The result of the function is stored 7838 ** in register P3. Register P3 must not be one of the function inputs. 7839 ** 7840 ** P1 is a 32-bit bitmask indicating whether or not each argument to the 7841 ** function was determined to be constant at compile time. If the first 7842 ** argument was constant then bit 0 of P1 is set. This is used to determine 7843 ** whether meta data associated with a user function argument using the 7844 ** sqlite3_set_auxdata() API may be safely retained until the next 7845 ** invocation of this opcode. 7846 ** 7847 ** See also: AggStep, AggFinal, PureFunc 7848 */ 7849 /* Opcode: PureFunc P1 P2 P3 P4 * 7850 ** Synopsis: r[P3]=func(r[P2@NP]) 7851 ** 7852 ** Invoke a user function (P4 is a pointer to an sqlite3_context object that 7853 ** contains a pointer to the function to be run) with arguments taken 7854 ** from register P2 and successors. The number of arguments is in 7855 ** the sqlite3_context object that P4 points to. 7856 ** The result of the function is stored 7857 ** in register P3. Register P3 must not be one of the function inputs. 7858 ** 7859 ** P1 is a 32-bit bitmask indicating whether or not each argument to the 7860 ** function was determined to be constant at compile time. If the first 7861 ** argument was constant then bit 0 of P1 is set. This is used to determine 7862 ** whether meta data associated with a user function argument using the 7863 ** sqlite3_set_auxdata() API may be safely retained until the next 7864 ** invocation of this opcode. 7865 ** 7866 ** This opcode works exactly like OP_Function. The only difference is in 7867 ** its name. This opcode is used in places where the function must be 7868 ** purely non-deterministic. Some built-in date/time functions can be 7869 ** either determinitic of non-deterministic, depending on their arguments. 7870 ** When those function are used in a non-deterministic way, they will check 7871 ** to see if they were called using OP_PureFunc instead of OP_Function, and 7872 ** if they were, they throw an error. 7873 ** 7874 ** See also: AggStep, AggFinal, Function 7875 */ 7876 case OP_PureFunc: /* group */ 7877 case OP_Function: { /* group */ 7878 int i; 7879 sqlite3_context *pCtx; 7880 7881 assert( pOp->p4type==P4_FUNCCTX ); 7882 pCtx = pOp->p4.pCtx; 7883 7884 /* If this function is inside of a trigger, the register array in aMem[] 7885 ** might change from one evaluation to the next. The next block of code 7886 ** checks to see if the register array has changed, and if so it 7887 ** reinitializes the relavant parts of the sqlite3_context object */ 7888 pOut = &aMem[pOp->p3]; 7889 if( pCtx->pOut != pOut ){ 7890 pCtx->pVdbe = p; 7891 pCtx->pOut = pOut; 7892 for(i=pCtx->argc-1; i>=0; i--) pCtx->argv[i] = &aMem[pOp->p2+i]; 7893 } 7894 assert( pCtx->pVdbe==p ); 7895 7896 memAboutToChange(p, pOut); 7897 #ifdef SQLITE_DEBUG 7898 for(i=0; i<pCtx->argc; i++){ 7899 assert( memIsValid(pCtx->argv[i]) ); 7900 REGISTER_TRACE(pOp->p2+i, pCtx->argv[i]); 7901 } 7902 #endif 7903 MemSetTypeFlag(pOut, MEM_Null); 7904 assert( pCtx->isError==0 ); 7905 (*pCtx->pFunc->xSFunc)(pCtx, pCtx->argc, pCtx->argv);/* IMP: R-24505-23230 */ 7906 7907 /* If the function returned an error, throw an exception */ 7908 if( pCtx->isError ){ 7909 if( pCtx->isError>0 ){ 7910 sqlite3VdbeError(p, "%s", sqlite3_value_text(pOut)); 7911 rc = pCtx->isError; 7912 } 7913 sqlite3VdbeDeleteAuxData(db, &p->pAuxData, pCtx->iOp, pOp->p1); 7914 pCtx->isError = 0; 7915 if( rc ) goto abort_due_to_error; 7916 } 7917 7918 /* Copy the result of the function into register P3 */ 7919 if( pOut->flags & (MEM_Str|MEM_Blob) ){ 7920 sqlite3VdbeChangeEncoding(pOut, encoding); 7921 if( sqlite3VdbeMemTooBig(pOut) ) goto too_big; 7922 } 7923 7924 REGISTER_TRACE(pOp->p3, pOut); 7925 UPDATE_MAX_BLOBSIZE(pOut); 7926 break; 7927 } 7928 7929 /* Opcode: Trace P1 P2 * P4 * 7930 ** 7931 ** Write P4 on the statement trace output if statement tracing is 7932 ** enabled. 7933 ** 7934 ** Operand P1 must be 0x7fffffff and P2 must positive. 7935 */ 7936 /* Opcode: Init P1 P2 P3 P4 * 7937 ** Synopsis: Start at P2 7938 ** 7939 ** Programs contain a single instance of this opcode as the very first 7940 ** opcode. 7941 ** 7942 ** If tracing is enabled (by the sqlite3_trace()) interface, then 7943 ** the UTF-8 string contained in P4 is emitted on the trace callback. 7944 ** Or if P4 is blank, use the string returned by sqlite3_sql(). 7945 ** 7946 ** If P2 is not zero, jump to instruction P2. 7947 ** 7948 ** Increment the value of P1 so that OP_Once opcodes will jump the 7949 ** first time they are evaluated for this run. 7950 ** 7951 ** If P3 is not zero, then it is an address to jump to if an SQLITE_CORRUPT 7952 ** error is encountered. 7953 */ 7954 case OP_Trace: 7955 case OP_Init: { /* jump */ 7956 int i; 7957 #ifndef SQLITE_OMIT_TRACE 7958 char *zTrace; 7959 #endif 7960 7961 /* If the P4 argument is not NULL, then it must be an SQL comment string. 7962 ** The "--" string is broken up to prevent false-positives with srcck1.c. 7963 ** 7964 ** This assert() provides evidence for: 7965 ** EVIDENCE-OF: R-50676-09860 The callback can compute the same text that 7966 ** would have been returned by the legacy sqlite3_trace() interface by 7967 ** using the X argument when X begins with "--" and invoking 7968 ** sqlite3_expanded_sql(P) otherwise. 7969 */ 7970 assert( pOp->p4.z==0 || strncmp(pOp->p4.z, "-" "- ", 3)==0 ); 7971 7972 /* OP_Init is always instruction 0 */ 7973 assert( pOp==p->aOp || pOp->opcode==OP_Trace ); 7974 7975 #ifndef SQLITE_OMIT_TRACE 7976 if( (db->mTrace & (SQLITE_TRACE_STMT|SQLITE_TRACE_LEGACY))!=0 7977 && !p->doingRerun 7978 && (zTrace = (pOp->p4.z ? pOp->p4.z : p->zSql))!=0 7979 ){ 7980 #ifndef SQLITE_OMIT_DEPRECATED 7981 if( db->mTrace & SQLITE_TRACE_LEGACY ){ 7982 char *z = sqlite3VdbeExpandSql(p, zTrace); 7983 db->trace.xLegacy(db->pTraceArg, z); 7984 sqlite3_free(z); 7985 }else 7986 #endif 7987 if( db->nVdbeExec>1 ){ 7988 char *z = sqlite3MPrintf(db, "-- %s", zTrace); 7989 (void)db->trace.xV2(SQLITE_TRACE_STMT, db->pTraceArg, p, z); 7990 sqlite3DbFree(db, z); 7991 }else{ 7992 (void)db->trace.xV2(SQLITE_TRACE_STMT, db->pTraceArg, p, zTrace); 7993 } 7994 } 7995 #ifdef SQLITE_USE_FCNTL_TRACE 7996 zTrace = (pOp->p4.z ? pOp->p4.z : p->zSql); 7997 if( zTrace ){ 7998 int j; 7999 for(j=0; j<db->nDb; j++){ 8000 if( DbMaskTest(p->btreeMask, j)==0 ) continue; 8001 sqlite3_file_control(db, db->aDb[j].zDbSName, SQLITE_FCNTL_TRACE, zTrace); 8002 } 8003 } 8004 #endif /* SQLITE_USE_FCNTL_TRACE */ 8005 #ifdef SQLITE_DEBUG 8006 if( (db->flags & SQLITE_SqlTrace)!=0 8007 && (zTrace = (pOp->p4.z ? pOp->p4.z : p->zSql))!=0 8008 ){ 8009 sqlite3DebugPrintf("SQL-trace: %s\n", zTrace); 8010 } 8011 #endif /* SQLITE_DEBUG */ 8012 #endif /* SQLITE_OMIT_TRACE */ 8013 assert( pOp->p2>0 ); 8014 if( pOp->p1>=sqlite3GlobalConfig.iOnceResetThreshold ){ 8015 if( pOp->opcode==OP_Trace ) break; 8016 for(i=1; i<p->nOp; i++){ 8017 if( p->aOp[i].opcode==OP_Once ) p->aOp[i].p1 = 0; 8018 } 8019 pOp->p1 = 0; 8020 } 8021 pOp->p1++; 8022 p->aCounter[SQLITE_STMTSTATUS_RUN]++; 8023 goto jump_to_p2; 8024 } 8025 8026 #ifdef SQLITE_ENABLE_CURSOR_HINTS 8027 /* Opcode: CursorHint P1 * * P4 * 8028 ** 8029 ** Provide a hint to cursor P1 that it only needs to return rows that 8030 ** satisfy the Expr in P4. TK_REGISTER terms in the P4 expression refer 8031 ** to values currently held in registers. TK_COLUMN terms in the P4 8032 ** expression refer to columns in the b-tree to which cursor P1 is pointing. 8033 */ 8034 case OP_CursorHint: { 8035 VdbeCursor *pC; 8036 8037 assert( pOp->p1>=0 && pOp->p1<p->nCursor ); 8038 assert( pOp->p4type==P4_EXPR ); 8039 pC = p->apCsr[pOp->p1]; 8040 if( pC ){ 8041 assert( pC->eCurType==CURTYPE_BTREE ); 8042 sqlite3BtreeCursorHint(pC->uc.pCursor, BTREE_HINT_RANGE, 8043 pOp->p4.pExpr, aMem); 8044 } 8045 break; 8046 } 8047 #endif /* SQLITE_ENABLE_CURSOR_HINTS */ 8048 8049 #ifdef SQLITE_DEBUG 8050 /* Opcode: Abortable * * * * * 8051 ** 8052 ** Verify that an Abort can happen. Assert if an Abort at this point 8053 ** might cause database corruption. This opcode only appears in debugging 8054 ** builds. 8055 ** 8056 ** An Abort is safe if either there have been no writes, or if there is 8057 ** an active statement journal. 8058 */ 8059 case OP_Abortable: { 8060 sqlite3VdbeAssertAbortable(p); 8061 break; 8062 } 8063 #endif 8064 8065 #ifdef SQLITE_DEBUG 8066 /* Opcode: ReleaseReg P1 P2 P3 * P5 8067 ** Synopsis: release r[P1@P2] mask P3 8068 ** 8069 ** Release registers from service. Any content that was in the 8070 ** the registers is unreliable after this opcode completes. 8071 ** 8072 ** The registers released will be the P2 registers starting at P1, 8073 ** except if bit ii of P3 set, then do not release register P1+ii. 8074 ** In other words, P3 is a mask of registers to preserve. 8075 ** 8076 ** Releasing a register clears the Mem.pScopyFrom pointer. That means 8077 ** that if the content of the released register was set using OP_SCopy, 8078 ** a change to the value of the source register for the OP_SCopy will no longer 8079 ** generate an assertion fault in sqlite3VdbeMemAboutToChange(). 8080 ** 8081 ** If P5 is set, then all released registers have their type set 8082 ** to MEM_Undefined so that any subsequent attempt to read the released 8083 ** register (before it is reinitialized) will generate an assertion fault. 8084 ** 8085 ** P5 ought to be set on every call to this opcode. 8086 ** However, there are places in the code generator will release registers 8087 ** before their are used, under the (valid) assumption that the registers 8088 ** will not be reallocated for some other purpose before they are used and 8089 ** hence are safe to release. 8090 ** 8091 ** This opcode is only available in testing and debugging builds. It is 8092 ** not generated for release builds. The purpose of this opcode is to help 8093 ** validate the generated bytecode. This opcode does not actually contribute 8094 ** to computing an answer. 8095 */ 8096 case OP_ReleaseReg: { 8097 Mem *pMem; 8098 int i; 8099 u32 constMask; 8100 assert( pOp->p1>0 ); 8101 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 ); 8102 pMem = &aMem[pOp->p1]; 8103 constMask = pOp->p3; 8104 for(i=0; i<pOp->p2; i++, pMem++){ 8105 if( i>=32 || (constMask & MASKBIT32(i))==0 ){ 8106 pMem->pScopyFrom = 0; 8107 if( i<32 && pOp->p5 ) MemSetTypeFlag(pMem, MEM_Undefined); 8108 } 8109 } 8110 break; 8111 } 8112 #endif 8113 8114 /* Opcode: Noop * * * * * 8115 ** 8116 ** Do nothing. This instruction is often useful as a jump 8117 ** destination. 8118 */ 8119 /* 8120 ** The magic Explain opcode are only inserted when explain==2 (which 8121 ** is to say when the EXPLAIN QUERY PLAN syntax is used.) 8122 ** This opcode records information from the optimizer. It is the 8123 ** the same as a no-op. This opcodesnever appears in a real VM program. 8124 */ 8125 default: { /* This is really OP_Noop, OP_Explain */ 8126 assert( pOp->opcode==OP_Noop || pOp->opcode==OP_Explain ); 8127 8128 break; 8129 } 8130 8131 /***************************************************************************** 8132 ** The cases of the switch statement above this line should all be indented 8133 ** by 6 spaces. But the left-most 6 spaces have been removed to improve the 8134 ** readability. From this point on down, the normal indentation rules are 8135 ** restored. 8136 *****************************************************************************/ 8137 } 8138 8139 #ifdef VDBE_PROFILE 8140 { 8141 u64 endTime = sqlite3NProfileCnt ? sqlite3NProfileCnt : sqlite3Hwtime(); 8142 if( endTime>start ) pOrigOp->cycles += endTime - start; 8143 pOrigOp->cnt++; 8144 } 8145 #endif 8146 8147 /* The following code adds nothing to the actual functionality 8148 ** of the program. It is only here for testing and debugging. 8149 ** On the other hand, it does burn CPU cycles every time through 8150 ** the evaluator loop. So we can leave it out when NDEBUG is defined. 8151 */ 8152 #ifndef NDEBUG 8153 assert( pOp>=&aOp[-1] && pOp<&aOp[p->nOp-1] ); 8154 8155 #ifdef SQLITE_DEBUG 8156 if( db->flags & SQLITE_VdbeTrace ){ 8157 u8 opProperty = sqlite3OpcodeProperty[pOrigOp->opcode]; 8158 if( rc!=0 ) printf("rc=%d\n",rc); 8159 if( opProperty & (OPFLG_OUT2) ){ 8160 registerTrace(pOrigOp->p2, &aMem[pOrigOp->p2]); 8161 } 8162 if( opProperty & OPFLG_OUT3 ){ 8163 registerTrace(pOrigOp->p3, &aMem[pOrigOp->p3]); 8164 } 8165 if( opProperty==0xff ){ 8166 /* Never happens. This code exists to avoid a harmless linkage 8167 ** warning aboud sqlite3VdbeRegisterDump() being defined but not 8168 ** used. */ 8169 sqlite3VdbeRegisterDump(p); 8170 } 8171 } 8172 #endif /* SQLITE_DEBUG */ 8173 #endif /* NDEBUG */ 8174 } /* The end of the for(;;) loop the loops through opcodes */ 8175 8176 /* If we reach this point, it means that execution is finished with 8177 ** an error of some kind. 8178 */ 8179 abort_due_to_error: 8180 if( db->mallocFailed ){ 8181 rc = SQLITE_NOMEM_BKPT; 8182 }else if( rc==SQLITE_IOERR_CORRUPTFS ){ 8183 rc = SQLITE_CORRUPT_BKPT; 8184 } 8185 assert( rc ); 8186 if( p->zErrMsg==0 && rc!=SQLITE_IOERR_NOMEM ){ 8187 sqlite3VdbeError(p, "%s", sqlite3ErrStr(rc)); 8188 } 8189 p->rc = rc; 8190 sqlite3SystemError(db, rc); 8191 testcase( sqlite3GlobalConfig.xLog!=0 ); 8192 sqlite3_log(rc, "statement aborts at %d: [%s] %s", 8193 (int)(pOp - aOp), p->zSql, p->zErrMsg); 8194 sqlite3VdbeHalt(p); 8195 if( rc==SQLITE_IOERR_NOMEM ) sqlite3OomFault(db); 8196 rc = SQLITE_ERROR; 8197 if( resetSchemaOnFault>0 ){ 8198 sqlite3ResetOneSchema(db, resetSchemaOnFault-1); 8199 } 8200 8201 /* This is the only way out of this procedure. We have to 8202 ** release the mutexes on btrees that were acquired at the 8203 ** top. */ 8204 vdbe_return: 8205 #ifndef SQLITE_OMIT_PROGRESS_CALLBACK 8206 while( nVmStep>=nProgressLimit && db->xProgress!=0 ){ 8207 nProgressLimit += db->nProgressOps; 8208 if( db->xProgress(db->pProgressArg) ){ 8209 nProgressLimit = LARGEST_UINT64; 8210 rc = SQLITE_INTERRUPT; 8211 goto abort_due_to_error; 8212 } 8213 } 8214 #endif 8215 p->aCounter[SQLITE_STMTSTATUS_VM_STEP] += (int)nVmStep; 8216 sqlite3VdbeLeave(p); 8217 assert( rc!=SQLITE_OK || nExtraDelete==0 8218 || sqlite3_strlike("DELETE%",p->zSql,0)!=0 8219 ); 8220 return rc; 8221 8222 /* Jump to here if a string or blob larger than SQLITE_MAX_LENGTH 8223 ** is encountered. 8224 */ 8225 too_big: 8226 sqlite3VdbeError(p, "string or blob too big"); 8227 rc = SQLITE_TOOBIG; 8228 goto abort_due_to_error; 8229 8230 /* Jump to here if a malloc() fails. 8231 */ 8232 no_mem: 8233 sqlite3OomFault(db); 8234 sqlite3VdbeError(p, "out of memory"); 8235 rc = SQLITE_NOMEM_BKPT; 8236 goto abort_due_to_error; 8237 8238 /* Jump to here if the sqlite3_interrupt() API sets the interrupt 8239 ** flag. 8240 */ 8241 abort_due_to_interrupt: 8242 assert( AtomicLoad(&db->u1.isInterrupted) ); 8243 rc = SQLITE_INTERRUPT; 8244 goto abort_due_to_error; 8245 } 8246