aboutsummaryrefslogtreecommitdiff
path: root/lopcodes.h
diff options
context:
space:
mode:
authorRoberto Ierusalimschy <roberto@inf.puc-rio.br>2020-04-23 14:48:15 -0300
committerRoberto Ierusalimschy <roberto@inf.puc-rio.br>2020-04-23 14:48:15 -0300
commit0ddc0f47bd2a03678e1afbc384550aecb55a318f (patch)
treeb441f7e68329c59aa3f44bb4967f404b5319dbe4 /lopcodes.h
parentcac075a1221f373053196dbb24bdcff4609b8241 (diff)
downloadlua-0ddc0f47bd2a03678e1afbc384550aecb55a318f.tar.gz
lua-0ddc0f47bd2a03678e1afbc384550aecb55a318f.tar.bz2
lua-0ddc0f47bd2a03678e1afbc384550aecb55a318f.zip
Several details about 5.4.0 rc1
Corrected several small details: added 'const', adjusts in tabs x spaces, removed unused #includes and #defines, misspellings, etc.
Diffstat (limited to 'lopcodes.h')
-rw-r--r--lopcodes.h20
1 files changed, 10 insertions, 10 deletions
diff --git a/lopcodes.h b/lopcodes.h
index d3a3f08e..122e5d21 100644
--- a/lopcodes.h
+++ b/lopcodes.h
@@ -201,9 +201,9 @@ OP_MOVE,/* A B R[A] := R[B] */
201OP_LOADI,/* A sBx R[A] := sBx */ 201OP_LOADI,/* A sBx R[A] := sBx */
202OP_LOADF,/* A sBx R[A] := (lua_Number)sBx */ 202OP_LOADF,/* A sBx R[A] := (lua_Number)sBx */
203OP_LOADK,/* A Bx R[A] := K[Bx] */ 203OP_LOADK,/* A Bx R[A] := K[Bx] */
204OP_LOADKX,/* A R[A] := K[extra arg] */ 204OP_LOADKX,/* A R[A] := K[extra arg] */
205OP_LOADFALSE,/* A R[A] := false */ 205OP_LOADFALSE,/* A R[A] := false */
206OP_LFALSESKIP,/*A R[A] := false; pc++ */ 206OP_LFALSESKIP,/*A R[A] := false; pc++ */
207OP_LOADTRUE,/* A R[A] := true */ 207OP_LOADTRUE,/* A R[A] := true */
208OP_LOADNIL,/* A B R[A], R[A+1], ..., R[A+B] := nil */ 208OP_LOADNIL,/* A B R[A], R[A+1], ..., R[A+B] := nil */
209OP_GETUPVAL,/* A B R[A] := UpValue[B] */ 209OP_GETUPVAL,/* A B R[A] := UpValue[B] */
@@ -263,11 +263,11 @@ OP_BNOT,/* A B R[A] := ~R[B] */
263OP_NOT,/* A B R[A] := not R[B] */ 263OP_NOT,/* A B R[A] := not R[B] */
264OP_LEN,/* A B R[A] := length of R[B] */ 264OP_LEN,/* A B R[A] := length of R[B] */
265 265
266OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ 266OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */
267 267
268OP_CLOSE,/* A close all upvalues >= R[A] */ 268OP_CLOSE,/* A close all upvalues >= R[A] */
269OP_TBC,/* A mark variable A "to be closed" */ 269OP_TBC,/* A mark variable A "to be closed" */
270OP_JMP,/* sJ pc += sJ */ 270OP_JMP,/* sJ pc += sJ */
271OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ 271OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */
272OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ 272OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */
273OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ 273OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */
@@ -279,15 +279,15 @@ OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */
279OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ 279OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */
280OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ 280OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */
281 281
282OP_TEST,/* A k if (not R[A] == k) then pc++ */ 282OP_TEST,/* A k if (not R[A] == k) then pc++ */
283OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] */ 283OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] */
284 284
285OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */ 285OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */
286OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */ 286OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */
287 287
288OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ 288OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */
289OP_RETURN0,/* return */ 289OP_RETURN0,/* return */
290OP_RETURN1,/* A return R[A] */ 290OP_RETURN1,/* A return R[A] */
291 291
292OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ 292OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */
293OP_FORPREP,/* A Bx <check values and prepare counters>; 293OP_FORPREP,/* A Bx <check values and prepare counters>;
@@ -301,9 +301,9 @@ OP_SETLIST,/* A B C k R[A][(C-1)*FPF+i] := R[A+i], 1 <= i <= B */
301 301
302OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ 302OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */
303 303
304OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ 304OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */
305 305
306OP_VARARGPREP,/*A (adjust vararg parameters) */ 306OP_VARARGPREP,/*A (adjust vararg parameters) */
307 307
308OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ 308OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */
309} OpCode; 309} OpCode;