Optimization for vararg tables

A vararg table can be virtual. If the vararg table is used only as
a base in indexing expressions, the code does not need to create an
actual table for it. Instead, it compiles the indexing expressions
into direct accesses to the internal vararg data.

1 files changed, 2 insertions, 0 deletions

diff --git a/lopcodes.h b/lopcodes.h
index c3f7f64d..82bba721 100644
--- a/lopcodes.h
+++ b/lopcodes.h
@@ -338,6 +338,8 @@ OP_CLOSURE,/*	A Bx	R[A] := closure(KPROTO[Bx])			*/
 
 OP_VARARG,/*    A C     R[A], R[A+1], ..., R[A+C-2] = vararg            */
 
+OP_GETVARG, /* A B C    R[A] := R[B][R[C]], R[B] is vararg parameter    */
+
 OP_VARARGPREP,/*        (adjust vararg parameters)                      */
 
 OP_EXTRAARG/*   Ax      extra (larger) argument for previous opcode     */