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.

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]					*/
 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_LOADFALSE,/* A       R[A] := false                                   */
-OP_LFALSESKIP,/*A       R[A] := false; pc++                             */
+OP_LOADKX,/*    A       R[A] := K[extra arg]                            */
+OP_LOADFALSE,/* A       R[A] := false                                   */
+OP_LFALSESKIP,/*A       R[A] := false; pc++                             */
 OP_LOADTRUE,/*  A       R[A] := true                                    */
 OP_LOADNIL,/*   A B     R[A], R[A+1], ..., R[A+B] := nil                */
 OP_GETUPVAL,/*  A B     R[A] := UpValue[B]                              */
@@ -263,11 +263,11 @@ 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_TBC,/*       A       mark variable A "to be closed"                  */
-OP_JMP,/*       sJ      pc += sJ                                        */
+OP_JMP,/*       sJ      pc += sJ                                        */
 OP_EQ,/*        A B k   if ((R[A] == R[B]) ~= k) then pc++              */
 OP_LT,/*        A B k   if ((R[A] <  R[B]) ~= k) then pc++              */
 OP_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++		*/
 OP_GTI,/*       A sB k  if ((R[A] > sB) ~= k) then pc++                 */
 OP_GEI,/*       A sB k  if ((R[A] >= sB) ~= k) then pc++                */
 
-OP_TEST,/*      A k     if (not R[A] == k) then pc++                    */
+OP_TEST,/*      A k     if (not R[A] == k) then pc++                    */
 OP_TESTSET,/*   A B k   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 k return R[A](R[A+1], ... ,R[A+B-1])              */
 
 OP_RETURN,/*    A B C k return R[A], ... ,R[A+B-2]      (see note)      */
-OP_RETURN0,/*           return                                          */
-OP_RETURN1,/*   A       return R[A]                                     */
+OP_RETURN0,/*           return                                          */
+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>;
@@ -301,9 +301,9 @@ OP_SETLIST,/*	A B C k	R[A][(C-1)*FPF+i] := R[A+i], 1 <= i <= B	*/
 
 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)                      */
+OP_VARARGPREP,/*A       (adjust vararg parameters)                      */
 
 OP_EXTRAARG/*   Ax      extra (larger) argument for previous opcode     */
 } OpCode;