Repository navigation
Expand file tree
/
Copy pathopcodes.h
More file actions
241 lines (239 loc) · 14.8 KB
/
Copy pathopcodes.h
File metadata and controls
241 lines (239 loc) · 14.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
/* Automatically generated. Do not edit */
/* See the tool/mkopcodeh.tcl script for details */
#define OP_Savepoint 0
#define OP_AutoCommit 1
#define OP_Transaction 2
#define OP_Checkpoint 3
#define OP_JournalMode 4
#define OP_Vacuum 5
#define OP_VFilter 6 /* jump, synopsis: iplan=r[P3] zplan='P4' */
#define OP_VUpdate 7 /* synopsis: data=r[P3@P2] */
#define OP_Init 8 /* jump0, synopsis: Start at P2 */
#define OP_Goto 9 /* jump */
#define OP_Gosub 10 /* jump */
#define OP_InitCoroutine 11 /* jump0 */
#define OP_Yield 12 /* jump0 */
#define OP_MustBeInt 13 /* jump0 */
#define OP_Jump 14 /* jump */
#define OP_Once 15 /* jump */
#define OP_If 16 /* jump */
#define OP_IfNot 17 /* jump */
#define OP_IsType 18 /* jump, synopsis: if typeof(P1.P3) in P5 goto P2 */
#define OP_Not 19 /* same as TK_NOT, synopsis: r[P2]= !r[P1] */
#define OP_IfNullRow 20 /* jump, synopsis: if P1.nullRow then r[P3]=NULL, goto P2 */
#define OP_SeekLT 21 /* jump0, synopsis: key=r[P3@P4] */
#define OP_SeekLE 22 /* jump0, synopsis: key=r[P3@P4] */
#define OP_SeekGE 23 /* jump0, synopsis: key=r[P3@P4] */
#define OP_SeekGT 24 /* jump0, synopsis: key=r[P3@P4] */
#define OP_IfNotOpen 25 /* jump, synopsis: if( !csr[P1] ) goto P2 */
#define OP_IfNoHope 26 /* jump, synopsis: key=r[P3@P4] */
#define OP_NoConflict 27 /* jump, synopsis: key=r[P3@P4] */
#define OP_NotFound 28 /* jump, synopsis: key=r[P3@P4] */
#define OP_Found 29 /* jump, synopsis: key=r[P3@P4] */
#define OP_SeekRowid 30 /* jump0, synopsis: intkey=r[P3] */
#define OP_NotExists 31 /* jump, synopsis: intkey=r[P3] */
#define OP_Last 32 /* jump0 */
#define OP_IfSizeBetween 33 /* jump */
#define OP_SorterSort 34 /* jump */
#define OP_Sort 35 /* jump */
#define OP_Rewind 36 /* jump0 */
#define OP_IfEmpty 37 /* jump, synopsis: if( empty(P1) ) goto P2 */
#define OP_SorterNext 38 /* jump */
#define OP_Prev 39 /* jump */
#define OP_Next 40 /* jump */
#define OP_IdxLE 41 /* jump, synopsis: key=r[P3@P4] */
#define OP_IdxGT 42 /* jump, synopsis: key=r[P3@P4] */
#define OP_Or 43 /* same as TK_OR, synopsis: r[P3]=(r[P1] || r[P2]) */
#define OP_And 44 /* same as TK_AND, synopsis: r[P3]=(r[P1] && r[P2]) */
#define OP_IdxLT 45 /* jump, synopsis: key=r[P3@P4] */
#define OP_IdxGE 46 /* jump, synopsis: key=r[P3@P4] */
#define OP_IFindKey 47 /* jump */
#define OP_RowSetRead 48 /* jump, synopsis: r[P3]=rowset(P1) */
#define OP_RowSetTest 49 /* jump, synopsis: if r[P3] in rowset(P1) goto P2 */
#define OP_Program 50 /* jump0 */
#define OP_IsNull 51 /* jump, same as TK_ISNULL, synopsis: if r[P1]==NULL goto P2 */
#define OP_NotNull 52 /* jump, same as TK_NOTNULL, synopsis: if r[P1]!=NULL goto P2 */
#define OP_Ne 53 /* jump, same as TK_NE, synopsis: IF r[P3]!=r[P1] */
#define OP_Eq 54 /* jump, same as TK_EQ, synopsis: IF r[P3]==r[P1] */
#define OP_Gt 55 /* jump, same as TK_GT, synopsis: IF r[P3]>r[P1] */
#define OP_Le 56 /* jump, same as TK_LE, synopsis: IF r[P3]<=r[P1] */
#define OP_Lt 57 /* jump, same as TK_LT, synopsis: IF r[P3]<r[P1] */
#define OP_Ge 58 /* jump, same as TK_GE, synopsis: IF r[P3]>=r[P1] */
#define OP_ElseEq 59 /* jump, same as TK_ESCAPE */
#define OP_FkIfZero 60 /* jump, synopsis: if fkctr[P1]==0 goto P2 */
#define OP_IfPos 61 /* jump, synopsis: if r[P1]>0 then r[P1]-=P3, goto P2 */
#define OP_IfNotZero 62 /* jump, synopsis: if r[P1]!=0 then r[P1]--, goto P2 */
#define OP_DecrJumpZero 63 /* jump, synopsis: if (--r[P1])==0 goto P2 */
#define OP_IncrVacuum 64 /* jump */
#define OP_VNext 65 /* jump */
#define OP_Filter 66 /* jump, synopsis: if key(P3@P4) not in filter(P1) goto P2 */
#define OP_PureFunc 67 /* synopsis: r[P3]=func(r[P2@NP]) */
#define OP_Function 68 /* synopsis: r[P3]=func(r[P2@NP]) */
#define OP_Return 69
#define OP_EndCoroutine 70
#define OP_HaltIfNull 71 /* synopsis: if r[P3]=null halt */
#define OP_Halt 72
#define OP_Integer 73 /* synopsis: r[P2]=P1 */
#define OP_Int64 74 /* synopsis: r[P2]=P4 */
#define OP_String 75 /* synopsis: r[P2]='P4' (len=P1) */
#define OP_BeginSubrtn 76 /* synopsis: r[P2]=NULL */
#define OP_Null 77 /* synopsis: r[P2..P3]=NULL */
#define OP_SoftNull 78 /* synopsis: r[P1]=NULL */
#define OP_Blob 79 /* synopsis: r[P2]=P4 (len=P1) */
#define OP_Variable 80 /* synopsis: r[P2]=parameter(P1) */
#define OP_Move 81 /* synopsis: r[P2@P3]=r[P1@P3] */
#define OP_Copy 82 /* synopsis: r[P2@P3+1]=r[P1@P3+1] */
#define OP_SCopy 83 /* synopsis: r[P2]=r[P1] */
#define OP_IntCopy 84 /* synopsis: r[P2]=r[P1] */
#define OP_FkCheck 85
#define OP_ResultRow 86 /* synopsis: output=r[P1@P2] */
#define OP_CollSeq 87
#define OP_AddImm 88 /* synopsis: r[P1]=r[P1]+P2 */
#define OP_RealAffinity 89
#define OP_Cast 90 /* synopsis: affinity(r[P1]) */
#define OP_Permutation 91
#define OP_Compare 92 /* synopsis: r[P1@P3] <-> r[P2@P3] */
#define OP_IsTrue 93 /* synopsis: r[P2] = coalesce(r[P1]==TRUE,P3) ^ P4 */
#define OP_ZeroOrNull 94 /* synopsis: r[P2] = 0 OR NULL */
#define OP_Offset 95 /* synopsis: r[P3] = sqlite_offset(P1) */
#define OP_Column 96 /* synopsis: r[P3]=PX cursor P1 column P2 */
#define OP_TypeCheck 97 /* synopsis: typecheck(r[P1@P2]) */
#define OP_Affinity 98 /* synopsis: affinity(r[P1@P2]) */
#define OP_MakeRecord 99 /* synopsis: r[P3]=mkrec(r[P1@P2]) */
#define OP_Count 100 /* synopsis: r[P2]=count() */
#define OP_ReadCookie 101
#define OP_SetCookie 102
#define OP_BitAnd 103 /* same as TK_BITAND, synopsis: r[P3]=r[P1]&r[P2] */
#define OP_BitOr 104 /* same as TK_BITOR, synopsis: r[P3]=r[P1]|r[P2] */
#define OP_ShiftLeft 105 /* same as TK_LSHIFT, synopsis: r[P3]=r[P2]<<r[P1] */
#define OP_ShiftRight 106 /* same as TK_RSHIFT, synopsis: r[P3]=r[P2]>>r[P1] */
#define OP_Add 107 /* same as TK_PLUS, synopsis: r[P3]=r[P1]+r[P2] */
#define OP_Subtract 108 /* same as TK_MINUS, synopsis: r[P3]=r[P2]-r[P1] */
#define OP_Multiply 109 /* same as TK_STAR, synopsis: r[P3]=r[P1]*r[P2] */
#define OP_Divide 110 /* same as TK_SLASH, synopsis: r[P3]=r[P2]/r[P1] */
#define OP_Remainder 111 /* same as TK_REM, synopsis: r[P3]=r[P2]%r[P1] */
#define OP_Concat 112 /* same as TK_CONCAT, synopsis: r[P3]=r[P2]+r[P1] */
#define OP_ReopenIdx 113 /* synopsis: root=P2 iDb=P3 */
#define OP_OpenRead 114 /* synopsis: root=P2 iDb=P3 */
#define OP_BitNot 115 /* same as TK_BITNOT, synopsis: r[P2]= ~r[P1] */
#define OP_OpenWrite 116 /* synopsis: root=P2 iDb=P3 */
#define OP_OpenDup 117
#define OP_String8 118 /* same as TK_STRING, synopsis: r[P2]='P4' */
#define OP_OpenAutoindex 119 /* synopsis: nColumn=P2 */
#define OP_OpenEphemeral 120 /* synopsis: nColumn=P2 */
#define OP_SorterOpen 121
#define OP_SequenceTest 122 /* synopsis: if( cursor[P1].ctr++ ) pc = P2 */
#define OP_OpenPseudo 123 /* synopsis: P3 columns in r[P2] */
#define OP_Close 124
#define OP_ColumnsUsed 125
#define OP_SeekScan 126 /* synopsis: Scan-ahead up to P1 rows */
#define OP_SeekHit 127 /* synopsis: set P2<=seekHit<=P3 */
#define OP_Sequence 128 /* synopsis: r[P2]=cursor[P1].ctr++ */
#define OP_NewRowid 129 /* synopsis: r[P2]=rowid */
#define OP_Insert 130 /* synopsis: intkey=r[P3] data=r[P2] */
#define OP_RowCell 131
#define OP_Delete 132
#define OP_ResetCount 133
#define OP_SorterCompare 134 /* synopsis: if key(P1)!=trim(r[P3],P4) goto P2 */
#define OP_SorterData 135 /* synopsis: r[P2]=data */
#define OP_RowData 136 /* synopsis: r[P2]=data */
#define OP_Rowid 137 /* synopsis: r[P2]=PX rowid of P1 */
#define OP_NullRow 138
#define OP_SeekEnd 139
#define OP_IdxInsert 140 /* synopsis: key=r[P2] */
#define OP_SorterInsert 141 /* synopsis: key=r[P2] */
#define OP_IdxDelete 142 /* synopsis: key=r[P2@P3] */
#define OP_DeferredSeek 143 /* synopsis: Move P3 to P1.rowid if needed */
#define OP_IdxRowid 144 /* synopsis: r[P2]=rowid */
#define OP_FinishSeek 145
#define OP_Destroy 146
#define OP_Clear 147
#define OP_ResetSorter 148
#define OP_CreateBtree 149 /* synopsis: r[P2]=root iDb=P1 flags=P3 */
#define OP_SqlExec 150
#define OP_ParseSchema 151
#define OP_LoadAnalysis 152
#define OP_DropTable 153
#define OP_Real 154 /* same as TK_FLOAT, synopsis: r[P2]=P4 */
#define OP_DropIndex 155
#define OP_DropTrigger 156
#define OP_IntegrityCk 157
#define OP_RowSetAdd 158 /* synopsis: rowset(P1)=r[P2] */
#define OP_Param 159
#define OP_FkCounter 160 /* synopsis: fkctr[P1]+=P2 */
#define OP_MemMax 161 /* synopsis: r[P1]=max(r[P1],r[P2]) */
#define OP_OffsetLimit 162 /* synopsis: if r[P1]>0 then r[P2]=r[P1]+max(0,r[P3]) else r[P2]=(-1) */
#define OP_AggInverse 163 /* synopsis: accum=r[P3] inverse(r[P2@P5]) */
#define OP_AggStep 164 /* synopsis: accum=r[P3] step(r[P2@P5]) */
#define OP_AggStep1 165 /* synopsis: accum=r[P3] step(r[P2@P5]) */
#define OP_AggValue 166 /* synopsis: r[P3]=value N=P2 */
#define OP_AggFinal 167 /* synopsis: accum=r[P1] N=P2 */
#define OP_Expire 168
#define OP_CursorLock 169
#define OP_CursorUnlock 170
#define OP_TableLock 171 /* synopsis: iDb=P1 root=P2 write=P3 */
#define OP_VBegin 172
#define OP_VCreate 173
#define OP_VDestroy 174
#define OP_VOpen 175
#define OP_VCheck 176
#define OP_VInitIn 177 /* synopsis: r[P2]=ValueList(P1,P3) */
#define OP_VColumn 178 /* synopsis: r[P3]=vcolumn(P2) */
#define OP_VRename 179
#define OP_Pagecount 180
#define OP_MaxPgcnt 181
#define OP_ClrSubtype 182 /* synopsis: r[P1].subtype = 0 */
#define OP_GetSubtype 183 /* synopsis: r[P2] = r[P1].subtype */
#define OP_SetSubtype 184 /* synopsis: r[P2].subtype = r[P1] */
#define OP_FilterAdd 185 /* synopsis: filter(P1) += key(P3@P4) */
#define OP_Trace 186
#define OP_CursorHint 187
#define OP_ReleaseReg 188 /* synopsis: release r[P1@P2] mask P3 */
#define OP_Noop 189
#define OP_Explain 190
#define OP_Abortable 191
/* Properties such as "out2" or "jump" that are specified in
** comments following the "case" for each opcode in the vdbe.c
** are encoded into bitvectors as follows:
*/
#define OPFLG_JUMP 0x01 /* jump: P2 holds jmp target */
#define OPFLG_IN1 0x02 /* in1: P1 is an input */
#define OPFLG_IN2 0x04 /* in2: P2 is an input */
#define OPFLG_IN3 0x08 /* in3: P3 is an input */
#define OPFLG_OUT2 0x10 /* out2: P2 is an output */
#define OPFLG_OUT3 0x20 /* out3: P3 is an output */
#define OPFLG_NCYCLE 0x40 /* ncycle:Cycles count against P1 */
#define OPFLG_JUMP0 0x80 /* jump0: P2 might be zero */
#define OPFLG_INITIALIZER {\
/* 0 */ 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x41, 0x00,\
/* 8 */ 0x81, 0x01, 0x01, 0x81, 0x83, 0x83, 0x01, 0x01,\
/* 16 */ 0x03, 0x03, 0x01, 0x12, 0x01, 0xc9, 0xc9, 0xc9,\
/* 24 */ 0xc9, 0x01, 0x49, 0x49, 0x49, 0x49, 0xc9, 0x49,\
/* 32 */ 0xc1, 0x01, 0x41, 0x41, 0xc1, 0x01, 0x01, 0x41,\
/* 40 */ 0x41, 0x41, 0x41, 0x26, 0x26, 0x41, 0x41, 0x09,\
/* 48 */ 0x23, 0x0b, 0x81, 0x03, 0x03, 0x0b, 0x0b, 0x0b,\
/* 56 */ 0x0b, 0x0b, 0x0b, 0x01, 0x01, 0x03, 0x03, 0x03,\
/* 64 */ 0x01, 0x41, 0x01, 0x00, 0x00, 0x02, 0x02, 0x08,\
/* 72 */ 0x00, 0x10, 0x10, 0x10, 0x00, 0x10, 0x00, 0x10,\
/* 80 */ 0x10, 0x00, 0x00, 0x10, 0x10, 0x00, 0x00, 0x00,\
/* 88 */ 0x02, 0x02, 0x02, 0x00, 0x00, 0x12, 0x1e, 0x20,\
/* 96 */ 0x40, 0x00, 0x00, 0x00, 0x10, 0x10, 0x00, 0x26,\
/* 104 */ 0x26, 0x26, 0x26, 0x26, 0x26, 0x26, 0x26, 0x26,\
/* 112 */ 0x26, 0x40, 0x40, 0x12, 0x00, 0x40, 0x10, 0x40,\
/* 120 */ 0x40, 0x00, 0x00, 0x00, 0x40, 0x00, 0x40, 0x40,\
/* 128 */ 0x10, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x40,\
/* 136 */ 0x00, 0x50, 0x00, 0x40, 0x04, 0x04, 0x00, 0x40,\
/* 144 */ 0x50, 0x40, 0x10, 0x00, 0x00, 0x10, 0x00, 0x00,\
/* 152 */ 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x06, 0x10,\
/* 160 */ 0x00, 0x04, 0x1a, 0x00, 0x00, 0x00, 0x00, 0x00,\
/* 168 */ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x40,\
/* 176 */ 0x10, 0x50, 0x40, 0x00, 0x10, 0x10, 0x02, 0x12,\
/* 184 */ 0x12, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\
}
/* The resolve3P2Values() routine is able to run faster if it knows
** the value of the largest JUMP opcode. The smaller the maximum
** JUMP opcode the better, so the mkopcodeh.tcl script that
** generated this include file strives to group all JUMP opcodes
** together near the beginning of the list.
*/
#define SQLITE_MX_JUMP_OPCODE 66 /* Maximum JUMP opcode */