diff options
-rw-r--r-- | lopcodes.h | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lopcodes.h,v 1.104 2003/05/14 12:09:12 roberto Exp roberto $ | 2 | ** $Id: lopcodes.h,v 1.105 2003/05/14 21:09:53 roberto Exp roberto $ |
3 | ** Opcodes for Lua virtual machine | 3 | ** Opcodes for Lua virtual machine |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -134,7 +134,7 @@ name args description | |||
134 | ------------------------------------------------------------------------*/ | 134 | ------------------------------------------------------------------------*/ |
135 | OP_MOVE,/* A B R(A) := R(B) */ | 135 | OP_MOVE,/* A B R(A) := R(B) */ |
136 | OP_LOADK,/* A Bx R(A) := Kst(Bx) */ | 136 | OP_LOADK,/* A Bx R(A) := Kst(Bx) */ |
137 | OP_LOADBOOL,/* A B C R(A) := (Bool)B; if (C) PC++ */ | 137 | OP_LOADBOOL,/* A B C R(A) := (Bool)B; if (C) pc++ */ |
138 | OP_LOADNIL,/* A B R(A) := ... := R(B) := nil */ | 138 | OP_LOADNIL,/* A B R(A) := ... := R(B) := nil */ |
139 | OP_GETUPVAL,/* A B R(A) := UpValue[B] */ | 139 | OP_GETUPVAL,/* A B R(A) := UpValue[B] */ |
140 | 140 | ||
@@ -159,7 +159,7 @@ OP_NOT,/* A B R(A) := not R(B) */ | |||
159 | 159 | ||
160 | OP_CONCAT,/* A B C R(A) := R(B).. ... ..R(C) */ | 160 | OP_CONCAT,/* A B C R(A) := R(B).. ... ..R(C) */ |
161 | 161 | ||
162 | OP_JMP,/* sBx PC += sBx */ | 162 | OP_JMP,/* sBx pc+=sBx */ |
163 | 163 | ||
164 | OP_EQ,/* A B C if ((RK(B) == RK(C)) ~= A) then pc++ */ | 164 | OP_EQ,/* A B C if ((RK(B) == RK(C)) ~= A) then pc++ */ |
165 | OP_LT,/* A B C if ((RK(B) < RK(C)) ~= A) then pc++ */ | 165 | OP_LT,/* A B C if ((RK(B) < RK(C)) ~= A) then pc++ */ |
@@ -171,13 +171,13 @@ OP_CALL,/* A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */ | |||
171 | OP_TAILCALL,/* A B C return R(A)(R(A+1), ... ,R(A+B-1)) */ | 171 | OP_TAILCALL,/* A B C return R(A)(R(A+1), ... ,R(A+B-1)) */ |
172 | OP_RETURN,/* A B return R(A), ... ,R(A+B-2) (see note) */ | 172 | OP_RETURN,/* A B return R(A), ... ,R(A+B-2) (see note) */ |
173 | 173 | ||
174 | OP_FORLOOP,/* A sBx R(A)+=R(A+2); if R(A) <?= R(A+1) then PC+= sBx */ | 174 | OP_FORLOOP,/* A sBx R(A)+=R(A+2); if R(A) <?= R(A+1) then pc+=sBx */ |
175 | OP_FORPREP,/* A sBx R(A)-=R(A+2); PC += sBx */ | 175 | OP_FORPREP,/* A sBx R(A)-=R(A+2); pc+=sBx */ |
176 | 176 | ||
177 | OP_TFORLOOP,/* A C R(A+2), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2)); | 177 | OP_TFORLOOP,/* A C R(A+2), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2)); |
178 | if R(A+2) ~= nil then pc++ */ | 178 | if R(A+2) ~= nil then pc++ */ |
179 | OP_TFORPREP,/* A sBx if type(R(A)) == table then R(A+1):=R(A), R(A):=next; | 179 | OP_TFORPREP,/* A sBx if type(R(A)) == table then R(A+1):=R(A), R(A):=next; |
180 | PC += sBx */ | 180 | pc+=sBx */ |
181 | 181 | ||
182 | OP_SETLIST,/* A Bx R(A)[Bx-Bx%FPF+i] := R(A+i), 1 <= i <= Bx%FPF+1 */ | 182 | OP_SETLIST,/* A Bx R(A)[Bx-Bx%FPF+i] := R(A+i), 1 <= i <= Bx%FPF+1 */ |
183 | OP_SETLISTO,/* A Bx */ | 183 | OP_SETLISTO,/* A Bx */ |