Comments in 'lopcodes.h'
Both 'R' and 'K' are arrays, so the comments should use square
brackets to index them.
diff --git a/lopcodes.h b/lopcodes.h
index 443a71e..dbef6a6 100644
--- a/lopcodes.h
+++ b/lopcodes.h
@@ -183,9 +183,9 @@
/*
-** R(x) - register
-** K(x) - constant (in constant table)
-** RK(x) == if k(i) then K(x) else R(x)
+** R[x] - register
+** K[x] - constant (in constant table)
+** RK(x) == if k(i) then K[x] else R[x]
*/
@@ -197,109 +197,109 @@
/*----------------------------------------------------------------------
name args description
------------------------------------------------------------------------*/
-OP_MOVE,/* A B R(A) := R(B) */
-OP_LOADI,/* A sBx R(A) := sBx */
-OP_LOADF,/* A sBx R(A) := (lua_Number)sBx */
-OP_LOADK,/* A Bx R(A) := K(Bx) */
-OP_LOADKX,/* A R(A) := K(extra arg) */
-OP_LOADBOOL,/* A B C R(A) := (Bool)B; if (C) pc++ */
-OP_LOADNIL,/* A B R(A), R(A+1), ..., R(A+B) := nil */
-OP_GETUPVAL,/* A B R(A) := UpValue[B] */
-OP_SETUPVAL,/* A B UpValue[B] := R(A) */
+OP_MOVE,/* A B R[A] := R[B] */
+OP_LOADI,/* A sBx R[A] := sBx */
+OP_LOADF,/* A sBx R[A] := (lua_Number)sBx */
+OP_LOADK,/* A Bx R[A] := K[Bx] */
+OP_LOADKX,/* A R[A] := K[extra arg] */
+OP_LOADBOOL,/* A B C R[A] := (Bool)B; if (C) pc++ */
+OP_LOADNIL,/* A B R[A], R[A+1], ..., R[A+B] := nil */
+OP_GETUPVAL,/* A B R[A] := UpValue[B] */
+OP_SETUPVAL,/* A B UpValue[B] := R[A] */
-OP_GETTABUP,/* A B C R(A) := UpValue[B][K(C):string] */
-OP_GETTABLE,/* A B C R(A) := R(B)[R(C)] */
-OP_GETI,/* A B C R(A) := R(B)[C] */
-OP_GETFIELD,/* A B C R(A) := R(B)[K(C):string] */
+OP_GETTABUP,/* A B C R[A] := UpValue[B][K[C]:string] */
+OP_GETTABLE,/* A B C R[A] := R[B][R[C]] */
+OP_GETI,/* A B C R[A] := R[B][C] */
+OP_GETFIELD,/* A B C R[A] := R[B][K[C]:string] */
-OP_SETTABUP,/* A B C UpValue[A][K(B):string] := RK(C) */
-OP_SETTABLE,/* A B C R(A)[R(B)] := RK(C) */
-OP_SETI,/* A B C R(A)[B] := RK(C) */
-OP_SETFIELD,/* A B C R(A)[K(B):string] := RK(C) */
+OP_SETTABUP,/* A B C UpValue[A][K[B]:string] := RK(C) */
+OP_SETTABLE,/* A B C R[A][R[B]] := RK(C) */
+OP_SETI,/* A B C R[A][B] := RK(C) */
+OP_SETFIELD,/* A B C R[A][K[B]:string] := RK(C) */
-OP_NEWTABLE,/* A B C R(A) := {} */
+OP_NEWTABLE,/* A B C R[A] := {} */
-OP_SELF,/* A B C R(A+1) := R(B); R(A) := R(B)[RK(C):string] */
+OP_SELF,/* A B C R[A+1] := R[B]; R[A] := R[B][RK(C):string] */
-OP_ADDI,/* A B sC R(A) := R(B) + sC */
+OP_ADDI,/* A B sC R[A] := R[B] + sC */
-OP_ADDK,/* A B C R(A) := R(B) + K(C) */
-OP_SUBK,/* A B C R(A) := R(B) - K(C) */
-OP_MULK,/* A B C R(A) := R(B) * K(C) */
-OP_MODK,/* A B C R(A) := R(B) % K(C) */
-OP_POWK,/* A B C R(A) := R(B) ^ K(C) */
-OP_DIVK,/* A B C R(A) := R(B) / K(C) */
-OP_IDIVK,/* A B C R(A) := R(B) // K(C) */
+OP_ADDK,/* A B C R[A] := R[B] + K[C] */
+OP_SUBK,/* A B C R[A] := R[B] - K[C] */
+OP_MULK,/* A B C R[A] := R[B] * K[C] */
+OP_MODK,/* A B C R[A] := R[B] % K[C] */
+OP_POWK,/* A B C R[A] := R[B] ^ K[C] */
+OP_DIVK,/* A B C R[A] := R[B] / K[C] */
+OP_IDIVK,/* A B C R[A] := R[B] // K[C] */
-OP_BANDK,/* A B C R(A) := R(B) & K(C):integer */
-OP_BORK,/* A B C R(A) := R(B) | K(C):integer */
-OP_BXORK,/* A B C R(A) := R(B) ~ K(C):integer */
+OP_BANDK,/* A B C R[A] := R[B] & K[C]:integer */
+OP_BORK,/* A B C R[A] := R[B] | K[C]:integer */
+OP_BXORK,/* A B C R[A] := R[B] ~ K[C]:integer */
-OP_SHRI,/* A B sC R(A) := R(B) >> sC */
-OP_SHLI,/* A B sC R(A) := sC << R(B) */
+OP_SHRI,/* A B sC R[A] := R[B] >> sC */
+OP_SHLI,/* A B sC R[A] := sC << R[B] */
-OP_ADD,/* A B C R(A) := R(B) + R(C) */
-OP_SUB,/* A B C R(A) := R(B) - R(C) */
-OP_MUL,/* A B C R(A) := R(B) * R(C) */
-OP_MOD,/* A B C R(A) := R(B) % R(C) */
-OP_POW,/* A B C R(A) := R(B) ^ R(C) */
-OP_DIV,/* A B C R(A) := R(B) / R(C) */
-OP_IDIV,/* A B C R(A) := R(B) // R(C) */
+OP_ADD,/* A B C R[A] := R[B] + R[C] */
+OP_SUB,/* A B C R[A] := R[B] - R[C] */
+OP_MUL,/* A B C R[A] := R[B] * R[C] */
+OP_MOD,/* A B C R[A] := R[B] % R[C] */
+OP_POW,/* A B C R[A] := R[B] ^ R[C] */
+OP_DIV,/* A B C R[A] := R[B] / R[C] */
+OP_IDIV,/* A B C R[A] := R[B] // R[C] */
-OP_BAND,/* A B C R(A) := R(B) & R(C) */
-OP_BOR,/* A B C R(A) := R(B) | R(C) */
-OP_BXOR,/* A B C R(A) := R(B) ~ R(C) */
-OP_SHL,/* A B C R(A) := R(B) << R(C) */
-OP_SHR,/* A B C R(A) := R(B) >> R(C) */
+OP_BAND,/* A B C R[A] := R[B] & R[C] */
+OP_BOR,/* A B C R[A] := R[B] | R[C] */
+OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */
+OP_SHL,/* A B C R[A] := R[B] << R[C] */
+OP_SHR,/* A B C R[A] := R[B] >> R[C] */
-OP_MMBIN,/* A B C call C metamethod over R(A) and R(B) */
-OP_MMBINI,/* A sB C call C metamethod over R(A) and sB */
-OP_MMBINK,/* A B C call C metamethod over R(A) and K(B) */
+OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] */
+OP_MMBINI,/* A sB C call C metamethod over R[A] and sB */
+OP_MMBINK,/* A B C call C metamethod over R[A] and K[B] */
-OP_UNM,/* A B R(A) := -R(B) */
-OP_BNOT,/* A B R(A) := ~R(B) */
-OP_NOT,/* A B R(A) := not R(B) */
-OP_LEN,/* A B R(A) := length of R(B) */
+OP_UNM,/* A B R[A] := -R[B] */
+OP_BNOT,/* A B R[A] := ~R[B] */
+OP_NOT,/* A B R[A] := not R[B] */
+OP_LEN,/* A B R[A] := length of R[B] */
-OP_CONCAT,/* A B R(A) := R(A).. ... ..R(A + B - 1) */
+OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */
-OP_CLOSE,/* A close all upvalues >= R(A) */
+OP_CLOSE,/* A close all upvalues >= R[A] */
OP_TBC,/* A mark variable A "to be closed" */
-OP_JMP,/* k sJ pc += sJ (k is used in code generation) */
-OP_EQ,/* A B if ((R(A) == R(B)) ~= k) then pc++ */
-OP_LT,/* A B if ((R(A) < R(B)) ~= k) then pc++ */
-OP_LE,/* A B if ((R(A) <= R(B)) ~= k) then pc++ */
+OP_JMP,/* sJ pc += sJ */
+OP_EQ,/* A B if ((R[A] == R[B]) ~= k) then pc++ */
+OP_LT,/* A B if ((R[A] < R[B]) ~= k) then pc++ */
+OP_LE,/* A B if ((R[A] <= R[B]) ~= k) then pc++ */
-OP_EQK,/* A B if ((R(A) == K(B)) ~= k) then pc++ */
-OP_EQI,/* A sB if ((R(A) == sB) ~= k) then pc++ */
-OP_LTI,/* A sB if ((R(A) < sB) ~= k) then pc++ */
-OP_LEI,/* A sB if ((R(A) <= sB) ~= k) then pc++ */
-OP_GTI,/* A sB if ((R(A) > sB) ~= k) then pc++ */
-OP_GEI,/* A sB if ((R(A) >= sB) ~= k) then pc++ */
+OP_EQK,/* A B if ((R[A] == K[B]) ~= k) then pc++ */
+OP_EQI,/* A sB if ((R[A] == sB) ~= k) then pc++ */
+OP_LTI,/* A sB if ((R[A] < sB) ~= k) then pc++ */
+OP_LEI,/* A sB if ((R[A] <= sB) ~= k) then pc++ */
+OP_GTI,/* A sB if ((R[A] > sB) ~= k) then pc++ */
+OP_GEI,/* A sB if ((R[A] >= sB) ~= k) then pc++ */
-OP_TEST,/* A if (not R(A) == k) then pc++ */
-OP_TESTSET,/* A B if (not R(B) == k) then pc++ else R(A) := R(B) */
+OP_TEST,/* A if (not R[A] == k) then pc++ */
+OP_TESTSET,/* A B if (not R[B] == k) then pc++ else R[A] := R[B] */
-OP_CALL,/* A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */
-OP_TAILCALL,/* A B C return R(A)(R(A+1), ... ,R(A+B-1)) */
+OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */
+OP_TAILCALL,/* A B C return R[A](R[A+1], ... ,R[A+B-1]) */
-OP_RETURN,/* A B C return R(A), ... ,R(A+B-2) (see note) */
+OP_RETURN,/* A B C return R[A], ... ,R[A+B-2] (see note) */
OP_RETURN0,/* return */
-OP_RETURN1,/* A return R(A) */
+OP_RETURN1,/* A return R[A] */
OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */
OP_FORPREP,/* A Bx <check values and prepare counters>;
if not to run then pc+=Bx+1; */
-OP_TFORPREP,/* A Bx create upvalue for R(A + 3); pc+=Bx */
-OP_TFORCALL,/* A C R(A+4), ... ,R(A+3+C) := R(A)(R(A+1), R(A+2)); */
-OP_TFORLOOP,/* A Bx if R(A+2) ~= nil then { R(A)=R(A+2); pc -= Bx } */
+OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */
+OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */
+OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */
-OP_SETLIST,/* A B C R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B */
+OP_SETLIST,/* A B C R[A][(C-1)*FPF+i] := R[A+i], 1 <= i <= B */
-OP_CLOSURE,/* A Bx R(A) := closure(KPROTO[Bx]) */
+OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */
-OP_VARARG,/* A C R(A), R(A+1), ..., R(A+C-2) = vararg */
+OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */
OP_VARARGPREP,/*A (adjust vararg parameters) */
