Mercurial > audlegacy
comparison sqlite/vdbeInt.h @ 1434:b6b61becdf4e trunk
[svn] - add sqlite/ directory
| author | nenolod |
|---|---|
| date | Thu, 27 Jul 2006 22:41:31 -0700 |
| parents | |
| children |
comparison
equal
deleted
inserted
replaced
| 1433:3cbe3d14ea68 | 1434:b6b61becdf4e |
|---|---|
| 1 /* | |
| 2 ** 2003 September 6 | |
| 3 ** | |
| 4 ** The author disclaims copyright to this source code. In place of | |
| 5 ** a legal notice, here is a blessing: | |
| 6 ** | |
| 7 ** May you do good and not evil. | |
| 8 ** May you find forgiveness for yourself and forgive others. | |
| 9 ** May you share freely, never taking more than you give. | |
| 10 ** | |
| 11 ************************************************************************* | |
| 12 ** This is the header file for information that is private to the | |
| 13 ** VDBE. This information used to all be at the top of the single | |
| 14 ** source code file "vdbe.c". When that file became too big (over | |
| 15 ** 6000 lines long) it was split up into several smaller files and | |
| 16 ** this header information was factored out. | |
| 17 */ | |
| 18 | |
| 19 /* | |
| 20 ** intToKey() and keyToInt() used to transform the rowid. But with | |
| 21 ** the latest versions of the design they are no-ops. | |
| 22 */ | |
| 23 #define keyToInt(X) (X) | |
| 24 #define intToKey(X) (X) | |
| 25 | |
| 26 /* | |
| 27 ** The makefile scans the vdbe.c source file and creates the following | |
| 28 ** array of string constants which are the names of all VDBE opcodes. This | |
| 29 ** array is defined in a separate source code file named opcode.c which is | |
| 30 ** automatically generated by the makefile. | |
| 31 */ | |
| 32 extern char *sqlite3OpcodeNames[]; | |
| 33 | |
| 34 /* | |
| 35 ** SQL is translated into a sequence of instructions to be | |
| 36 ** executed by a virtual machine. Each instruction is an instance | |
| 37 ** of the following structure. | |
| 38 */ | |
| 39 typedef struct VdbeOp Op; | |
| 40 | |
| 41 /* | |
| 42 ** Boolean values | |
| 43 */ | |
| 44 typedef unsigned char Bool; | |
| 45 | |
| 46 /* | |
| 47 ** A cursor is a pointer into a single BTree within a database file. | |
| 48 ** The cursor can seek to a BTree entry with a particular key, or | |
| 49 ** loop over all entries of the Btree. You can also insert new BTree | |
| 50 ** entries or retrieve the key or data from the entry that the cursor | |
| 51 ** is currently pointing to. | |
| 52 ** | |
| 53 ** Every cursor that the virtual machine has open is represented by an | |
| 54 ** instance of the following structure. | |
| 55 ** | |
| 56 ** If the Cursor.isTriggerRow flag is set it means that this cursor is | |
| 57 ** really a single row that represents the NEW or OLD pseudo-table of | |
| 58 ** a row trigger. The data for the row is stored in Cursor.pData and | |
| 59 ** the rowid is in Cursor.iKey. | |
| 60 */ | |
| 61 struct Cursor { | |
| 62 BtCursor *pCursor; /* The cursor structure of the backend */ | |
| 63 int iDb; /* Index of cursor database in db->aDb[] (or -1) */ | |
| 64 i64 lastRowid; /* Last rowid from a Next or NextIdx operation */ | |
| 65 i64 nextRowid; /* Next rowid returned by OP_NewRowid */ | |
| 66 Bool zeroed; /* True if zeroed out and ready for reuse */ | |
| 67 Bool rowidIsValid; /* True if lastRowid is valid */ | |
| 68 Bool atFirst; /* True if pointing to first entry */ | |
| 69 Bool useRandomRowid; /* Generate new record numbers semi-randomly */ | |
| 70 Bool nullRow; /* True if pointing to a row with no data */ | |
| 71 Bool nextRowidValid; /* True if the nextRowid field is valid */ | |
| 72 Bool pseudoTable; /* This is a NEW or OLD pseudo-tables of a trigger */ | |
| 73 Bool deferredMoveto; /* A call to sqlite3BtreeMoveto() is needed */ | |
| 74 Bool isTable; /* True if a table requiring integer keys */ | |
| 75 Bool isIndex; /* True if an index containing keys only - no data */ | |
| 76 u8 bogusIncrKey; /* Something for pIncrKey to point to if pKeyInfo==0 */ | |
| 77 i64 movetoTarget; /* Argument to the deferred sqlite3BtreeMoveto() */ | |
| 78 Btree *pBt; /* Separate file holding temporary table */ | |
| 79 int nData; /* Number of bytes in pData */ | |
| 80 char *pData; /* Data for a NEW or OLD pseudo-table */ | |
| 81 i64 iKey; /* Key for the NEW or OLD pseudo-table row */ | |
| 82 u8 *pIncrKey; /* Pointer to pKeyInfo->incrKey */ | |
| 83 KeyInfo *pKeyInfo; /* Info about index keys needed by index cursors */ | |
| 84 int nField; /* Number of fields in the header */ | |
| 85 i64 seqCount; /* Sequence counter */ | |
| 86 | |
| 87 /* Cached information about the header for the data record that the | |
| 88 ** cursor is currently pointing to. Only valid if cacheValid is true. | |
| 89 ** aRow might point to (ephemeral) data for the current row, or it might | |
| 90 ** be NULL. | |
| 91 */ | |
| 92 int cacheStatus; /* Cache is valid if this matches Vdbe.cacheCtr */ | |
| 93 int payloadSize; /* Total number of bytes in the record */ | |
| 94 u32 *aType; /* Type values for all entries in the record */ | |
| 95 u32 *aOffset; /* Cached offsets to the start of each columns data */ | |
| 96 u8 *aRow; /* Data for the current row, if all on one page */ | |
| 97 }; | |
| 98 typedef struct Cursor Cursor; | |
| 99 | |
| 100 /* | |
| 101 ** Number of bytes of string storage space available to each stack | |
| 102 ** layer without having to malloc. NBFS is short for Number of Bytes | |
| 103 ** For Strings. | |
| 104 */ | |
| 105 #define NBFS 32 | |
| 106 | |
| 107 /* | |
| 108 ** A value for Cursor.cacheValid that means the cache is always invalid. | |
| 109 */ | |
| 110 #define CACHE_STALE 0 | |
| 111 | |
| 112 /* | |
| 113 ** Internally, the vdbe manipulates nearly all SQL values as Mem | |
| 114 ** structures. Each Mem struct may cache multiple representations (string, | |
| 115 ** integer etc.) of the same value. A value (and therefore Mem structure) | |
| 116 ** has the following properties: | |
| 117 ** | |
| 118 ** Each value has a manifest type. The manifest type of the value stored | |
| 119 ** in a Mem struct is returned by the MemType(Mem*) macro. The type is | |
| 120 ** one of SQLITE_NULL, SQLITE_INTEGER, SQLITE_REAL, SQLITE_TEXT or | |
| 121 ** SQLITE_BLOB. | |
| 122 */ | |
| 123 struct Mem { | |
| 124 i64 i; /* Integer value. Or FuncDef* when flags==MEM_Agg */ | |
| 125 double r; /* Real value */ | |
| 126 char *z; /* String or BLOB value */ | |
| 127 int n; /* Number of characters in string value, including '\0' */ | |
| 128 u16 flags; /* Some combination of MEM_Null, MEM_Str, MEM_Dyn, etc. */ | |
| 129 u8 type; /* One of MEM_Null, MEM_Str, etc. */ | |
| 130 u8 enc; /* TEXT_Utf8, TEXT_Utf16le, or TEXT_Utf16be */ | |
| 131 void (*xDel)(void *); /* If not null, call this function to delete Mem.z */ | |
| 132 char zShort[NBFS]; /* Space for short strings */ | |
| 133 }; | |
| 134 typedef struct Mem Mem; | |
| 135 | |
| 136 /* One or more of the following flags are set to indicate the validOK | |
| 137 ** representations of the value stored in the Mem struct. | |
| 138 ** | |
| 139 ** If the MEM_Null flag is set, then the value is an SQL NULL value. | |
| 140 ** No other flags may be set in this case. | |
| 141 ** | |
| 142 ** If the MEM_Str flag is set then Mem.z points at a string representation. | |
| 143 ** Usually this is encoded in the same unicode encoding as the main | |
| 144 ** database (see below for exceptions). If the MEM_Term flag is also | |
| 145 ** set, then the string is nul terminated. The MEM_Int and MEM_Real | |
| 146 ** flags may coexist with the MEM_Str flag. | |
| 147 ** | |
| 148 ** Multiple of these values can appear in Mem.flags. But only one | |
| 149 ** at a time can appear in Mem.type. | |
| 150 */ | |
| 151 #define MEM_Null 0x0001 /* Value is NULL */ | |
| 152 #define MEM_Str 0x0002 /* Value is a string */ | |
| 153 #define MEM_Int 0x0004 /* Value is an integer */ | |
| 154 #define MEM_Real 0x0008 /* Value is a real number */ | |
| 155 #define MEM_Blob 0x0010 /* Value is a BLOB */ | |
| 156 | |
| 157 /* Whenever Mem contains a valid string or blob representation, one of | |
| 158 ** the following flags must be set to determine the memory management | |
| 159 ** policy for Mem.z. The MEM_Term flag tells us whether or not the | |
| 160 ** string is \000 or \u0000 terminated | |
| 161 */ | |
| 162 #define MEM_Term 0x0020 /* String rep is nul terminated */ | |
| 163 #define MEM_Dyn 0x0040 /* Need to call sqliteFree() on Mem.z */ | |
| 164 #define MEM_Static 0x0080 /* Mem.z points to a static string */ | |
| 165 #define MEM_Ephem 0x0100 /* Mem.z points to an ephemeral string */ | |
| 166 #define MEM_Short 0x0200 /* Mem.z points to Mem.zShort */ | |
| 167 #define MEM_Agg 0x0400 /* Mem.z points to an agg function context */ | |
| 168 | |
| 169 | |
| 170 /* A VdbeFunc is just a FuncDef (defined in sqliteInt.h) that contains | |
| 171 ** additional information about auxiliary information bound to arguments | |
| 172 ** of the function. This is used to implement the sqlite3_get_auxdata() | |
| 173 ** and sqlite3_set_auxdata() APIs. The "auxdata" is some auxiliary data | |
| 174 ** that can be associated with a constant argument to a function. This | |
| 175 ** allows functions such as "regexp" to compile their constant regular | |
| 176 ** expression argument once and reused the compiled code for multiple | |
| 177 ** invocations. | |
| 178 */ | |
| 179 struct VdbeFunc { | |
| 180 FuncDef *pFunc; /* The definition of the function */ | |
| 181 int nAux; /* Number of entries allocated for apAux[] */ | |
| 182 struct AuxData { | |
| 183 void *pAux; /* Aux data for the i-th argument */ | |
| 184 void (*xDelete)(void *); /* Destructor for the aux data */ | |
| 185 } apAux[1]; /* One slot for each function argument */ | |
| 186 }; | |
| 187 typedef struct VdbeFunc VdbeFunc; | |
| 188 | |
| 189 /* | |
| 190 ** The "context" argument for a installable function. A pointer to an | |
| 191 ** instance of this structure is the first argument to the routines used | |
| 192 ** implement the SQL functions. | |
| 193 ** | |
| 194 ** There is a typedef for this structure in sqlite.h. So all routines, | |
| 195 ** even the public interface to SQLite, can use a pointer to this structure. | |
| 196 ** But this file is the only place where the internal details of this | |
| 197 ** structure are known. | |
| 198 ** | |
| 199 ** This structure is defined inside of vdbeInt.h because it uses substructures | |
| 200 ** (Mem) which are only defined there. | |
| 201 */ | |
| 202 struct sqlite3_context { | |
| 203 FuncDef *pFunc; /* Pointer to function information. MUST BE FIRST */ | |
| 204 VdbeFunc *pVdbeFunc; /* Auxilary data, if created. */ | |
| 205 Mem s; /* The return value is stored here */ | |
| 206 Mem *pMem; /* Memory cell used to store aggregate context */ | |
| 207 u8 isError; /* Set to true for an error */ | |
| 208 CollSeq *pColl; /* Collating sequence */ | |
| 209 }; | |
| 210 | |
| 211 /* | |
| 212 ** A Set structure is used for quick testing to see if a value | |
| 213 ** is part of a small set. Sets are used to implement code like | |
| 214 ** this: | |
| 215 ** x.y IN ('hi','hoo','hum') | |
| 216 */ | |
| 217 typedef struct Set Set; | |
| 218 struct Set { | |
| 219 Hash hash; /* A set is just a hash table */ | |
| 220 HashElem *prev; /* Previously accessed hash elemen */ | |
| 221 }; | |
| 222 | |
| 223 /* | |
| 224 ** A FifoPage structure holds a single page of valves. Pages are arranged | |
| 225 ** in a list. | |
| 226 */ | |
| 227 typedef struct FifoPage FifoPage; | |
| 228 struct FifoPage { | |
| 229 int nSlot; /* Number of entries aSlot[] */ | |
| 230 int iWrite; /* Push the next value into this entry in aSlot[] */ | |
| 231 int iRead; /* Read the next value from this entry in aSlot[] */ | |
| 232 FifoPage *pNext; /* Next page in the fifo */ | |
| 233 i64 aSlot[1]; /* One or more slots for rowid values */ | |
| 234 }; | |
| 235 | |
| 236 /* | |
| 237 ** The Fifo structure is typedef-ed in vdbeInt.h. But the implementation | |
| 238 ** of that structure is private to this file. | |
| 239 ** | |
| 240 ** The Fifo structure describes the entire fifo. | |
| 241 */ | |
| 242 typedef struct Fifo Fifo; | |
| 243 struct Fifo { | |
| 244 int nEntry; /* Total number of entries */ | |
| 245 FifoPage *pFirst; /* First page on the list */ | |
| 246 FifoPage *pLast; /* Last page on the list */ | |
| 247 }; | |
| 248 | |
| 249 /* | |
| 250 ** A Context stores the last insert rowid, the last statement change count, | |
| 251 ** and the current statement change count (i.e. changes since last statement). | |
| 252 ** The current keylist is also stored in the context. | |
| 253 ** Elements of Context structure type make up the ContextStack, which is | |
| 254 ** updated by the ContextPush and ContextPop opcodes (used by triggers). | |
| 255 ** The context is pushed before executing a trigger a popped when the | |
| 256 ** trigger finishes. | |
| 257 */ | |
| 258 typedef struct Context Context; | |
| 259 struct Context { | |
| 260 i64 lastRowid; /* Last insert rowid (sqlite3.lastRowid) */ | |
| 261 int nChange; /* Statement changes (Vdbe.nChanges) */ | |
| 262 Fifo sFifo; /* Records that will participate in a DELETE or UPDATE */ | |
| 263 }; | |
| 264 | |
| 265 /* | |
| 266 ** An instance of the virtual machine. This structure contains the complete | |
| 267 ** state of the virtual machine. | |
| 268 ** | |
| 269 ** The "sqlite3_stmt" structure pointer that is returned by sqlite3_compile() | |
| 270 ** is really a pointer to an instance of this structure. | |
| 271 */ | |
| 272 struct Vdbe { | |
| 273 sqlite3 *db; /* The whole database */ | |
| 274 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ | |
| 275 FILE *trace; /* Write an execution trace here, if not NULL */ | |
| 276 int nOp; /* Number of instructions in the program */ | |
| 277 int nOpAlloc; /* Number of slots allocated for aOp[] */ | |
| 278 Op *aOp; /* Space to hold the virtual machine's program */ | |
| 279 int nLabel; /* Number of labels used */ | |
| 280 int nLabelAlloc; /* Number of slots allocated in aLabel[] */ | |
| 281 int *aLabel; /* Space to hold the labels */ | |
| 282 Mem *aStack; /* The operand stack, except string values */ | |
| 283 Mem *pTos; /* Top entry in the operand stack */ | |
| 284 Mem **apArg; /* Arguments to currently executing user function */ | |
| 285 Mem *aColName; /* Column names to return */ | |
| 286 int nCursor; /* Number of slots in apCsr[] */ | |
| 287 Cursor **apCsr; /* One element of this array for each open cursor */ | |
| 288 int nVar; /* Number of entries in aVar[] */ | |
| 289 Mem *aVar; /* Values for the OP_Variable opcode. */ | |
| 290 char **azVar; /* Name of variables */ | |
| 291 int okVar; /* True if azVar[] has been initialized */ | |
| 292 int magic; /* Magic number for sanity checking */ | |
| 293 int nMem; /* Number of memory locations currently allocated */ | |
| 294 Mem *aMem; /* The memory locations */ | |
| 295 int nCallback; /* Number of callbacks invoked so far */ | |
| 296 int cacheCtr; /* Cursor row cache generation counter */ | |
| 297 Fifo sFifo; /* A list of ROWIDs */ | |
| 298 int contextStackTop; /* Index of top element in the context stack */ | |
| 299 int contextStackDepth; /* The size of the "context" stack */ | |
| 300 Context *contextStack; /* Stack used by opcodes ContextPush & ContextPop*/ | |
| 301 int pc; /* The program counter */ | |
| 302 int rc; /* Value to return */ | |
| 303 unsigned uniqueCnt; /* Used by OP_MakeRecord when P2!=0 */ | |
| 304 int errorAction; /* Recovery action to do in case of an error */ | |
| 305 int inTempTrans; /* True if temp database is transactioned */ | |
| 306 int returnStack[100]; /* Return address stack for OP_Gosub & OP_Return */ | |
| 307 int returnDepth; /* Next unused element in returnStack[] */ | |
| 308 int nResColumn; /* Number of columns in one row of the result set */ | |
| 309 char **azResColumn; /* Values for one row of result */ | |
| 310 int popStack; /* Pop the stack this much on entry to VdbeExec() */ | |
| 311 char *zErrMsg; /* Error message written here */ | |
| 312 u8 resOnStack; /* True if there are result values on the stack */ | |
| 313 u8 explain; /* True if EXPLAIN present on SQL command */ | |
| 314 u8 changeCntOn; /* True to update the change-counter */ | |
| 315 u8 aborted; /* True if ROLLBACK in another VM causes an abort */ | |
| 316 u8 expired; /* True if the VM needs to be recompiled */ | |
| 317 u8 minWriteFileFormat; /* Minimum file format for writable database files */ | |
| 318 int nChange; /* Number of db changes made since last reset */ | |
| 319 i64 startTime; /* Time when query started - used for profiling */ | |
| 320 #ifdef SQLITE_SSE | |
| 321 int fetchId; /* Statement number used by sqlite3_fetch_statement */ | |
| 322 int lru; /* Counter used for LRU cache replacement */ | |
| 323 #endif | |
| 324 }; | |
| 325 | |
| 326 /* | |
| 327 ** The following are allowed values for Vdbe.magic | |
| 328 */ | |
| 329 #define VDBE_MAGIC_INIT 0x26bceaa5 /* Building a VDBE program */ | |
| 330 #define VDBE_MAGIC_RUN 0xbdf20da3 /* VDBE is ready to execute */ | |
| 331 #define VDBE_MAGIC_HALT 0x519c2973 /* VDBE has completed execution */ | |
| 332 #define VDBE_MAGIC_DEAD 0xb606c3c8 /* The VDBE has been deallocated */ | |
| 333 | |
| 334 /* | |
| 335 ** Function prototypes | |
| 336 */ | |
| 337 void sqlite3VdbeFreeCursor(Cursor*); | |
| 338 void sqliteVdbePopStack(Vdbe*,int); | |
| 339 int sqlite3VdbeCursorMoveto(Cursor*); | |
| 340 #if defined(SQLITE_DEBUG) || defined(VDBE_PROFILE) | |
| 341 void sqlite3VdbePrintOp(FILE*, int, Op*); | |
| 342 #endif | |
| 343 #ifdef SQLITE_DEBUG | |
| 344 void sqlite3VdbePrintSql(Vdbe*); | |
| 345 #endif | |
| 346 int sqlite3VdbeSerialTypeLen(u32); | |
| 347 u32 sqlite3VdbeSerialType(Mem*, int); | |
| 348 int sqlite3VdbeSerialPut(unsigned char*, Mem*, int); | |
| 349 int sqlite3VdbeSerialGet(const unsigned char*, u32, Mem*); | |
| 350 void sqlite3VdbeDeleteAuxData(VdbeFunc*, int); | |
| 351 | |
| 352 int sqlite2BtreeKeyCompare(BtCursor *, const void *, int, int, int *); | |
| 353 int sqlite3VdbeIdxKeyCompare(Cursor*, int , const unsigned char*, int*); | |
| 354 int sqlite3VdbeIdxRowid(BtCursor *, i64 *); | |
| 355 int sqlite3MemCompare(const Mem*, const Mem*, const CollSeq*); | |
| 356 int sqlite3VdbeRecordCompare(void*,int,const void*,int, const void*); | |
| 357 int sqlite3VdbeIdxRowidLen(const u8*); | |
| 358 int sqlite3VdbeExec(Vdbe*); | |
| 359 int sqlite3VdbeList(Vdbe*); | |
| 360 int sqlite3VdbeHalt(Vdbe*); | |
| 361 int sqlite3VdbeChangeEncoding(Mem *, int); | |
| 362 int sqlite3VdbeMemCopy(Mem*, const Mem*); | |
| 363 void sqlite3VdbeMemShallowCopy(Mem*, const Mem*, int); | |
| 364 int sqlite3VdbeMemMove(Mem*, Mem*); | |
| 365 int sqlite3VdbeMemNulTerminate(Mem*); | |
| 366 int sqlite3VdbeMemSetStr(Mem*, const char*, int, u8, void(*)(void*)); | |
| 367 void sqlite3VdbeMemSetInt64(Mem*, i64); | |
| 368 void sqlite3VdbeMemSetDouble(Mem*, double); | |
| 369 void sqlite3VdbeMemSetNull(Mem*); | |
| 370 int sqlite3VdbeMemMakeWriteable(Mem*); | |
| 371 int sqlite3VdbeMemDynamicify(Mem*); | |
| 372 int sqlite3VdbeMemStringify(Mem*, int); | |
| 373 i64 sqlite3VdbeIntValue(Mem*); | |
| 374 int sqlite3VdbeMemIntegerify(Mem*); | |
| 375 double sqlite3VdbeRealValue(Mem*); | |
| 376 void sqlite3VdbeIntegerAffinity(Mem*); | |
| 377 int sqlite3VdbeMemRealify(Mem*); | |
| 378 int sqlite3VdbeMemNumerify(Mem*); | |
| 379 int sqlite3VdbeMemFromBtree(BtCursor*,int,int,int,Mem*); | |
| 380 void sqlite3VdbeMemRelease(Mem *p); | |
| 381 int sqlite3VdbeMemFinalize(Mem*, FuncDef*); | |
| 382 #ifndef NDEBUG | |
| 383 void sqlite3VdbeMemSanity(Mem*); | |
| 384 int sqlite3VdbeOpcodeNoPush(u8); | |
| 385 #endif | |
| 386 int sqlite3VdbeMemTranslate(Mem*, u8); | |
| 387 void sqlite3VdbeMemPrettyPrint(Mem *pMem, char *zBuf); | |
| 388 int sqlite3VdbeMemHandleBom(Mem *pMem); | |
| 389 void sqlite3VdbeFifoInit(Fifo*); | |
| 390 int sqlite3VdbeFifoPush(Fifo*, i64); | |
| 391 int sqlite3VdbeFifoPop(Fifo*, i64*); | |
| 392 void sqlite3VdbeFifoClear(Fifo*); |
