OpCode.cs 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
  1. namespace Lua.Runtime;
  2. public enum OpCode : byte
  3. {
  4. Move, // A B R(A) := R(B)
  5. LoadK, // A Bx R(A) := Kst(Bx)
  6. LoadKX, // A R(A) := Kst(extra arg)
  7. LoadBool, // A B C R(A) := (Bool)B; if (C) pc++
  8. LoadNil, // A B R(A), R(A+1), ..., R(A+B) := nil
  9. GetUpVal, // A B R(A) := UpValue[B]
  10. GetTabUp, // A B C R(A) := UpValue[B][RK(C)]
  11. GetTable, // A B C R(A) := R(B)[RK(C)]
  12. SetTabUp, // A B C UpValue[A][RK(B)] := RK(C)
  13. SetUpVal, // A B UpValue[B] := R(A)
  14. SetTable, // A B C R(A)[RK(B)] := RK(C)
  15. NewTable, // A B C R(A) := {} (size = B,C)
  16. Self, // A B C R(A+1) := R(B); R(A) := R(B)[RK(C)]
  17. Add, // A B C R(A) := RK(B) + RK(C)
  18. Sub, // A B C R(A) := RK(B) - RK(C)
  19. Mul, // A B C R(A) := RK(B) * RK(C)
  20. Div, // A B C R(A) := RK(B) / RK(C)
  21. Mod, // A B C R(A) := RK(B) % RK(C)
  22. Pow, // A B C R(A) := RK(B) ^ RK(C)
  23. Unm, // A B R(A) := -R(B)
  24. Not, // A B R(A) := not R(B)
  25. Len, // A B R(A) := length of R(B)
  26. Concat, // A B C R(A) := R(B).. ... ..R(C)
  27. Jmp, // A sBx pc+=sBx; if (A) close all upvalues >= R(A - 1)
  28. Eq, // A B C if ((RK(B) == RK(C)) ~= A) then pc++
  29. Lt, // A B C if ((RK(B) < RK(C)) ~= A) then pc++
  30. Le, // A B C if ((RK(B) <= RK(C)) ~= A) then pc++
  31. Test, // A C if not (R(A) <=> C) then pc++
  32. TestSet, // A B C if (R(B) <=> C) then R(A) := R(B) else pc++
  33. Call, // A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1))
  34. TailCall, // A B C return R(A)(R(A+1), ... ,R(A+B-1))
  35. Return, // A B return R(A), ... ,R(A+B-2) (see note)
  36. ForLoop, // A sBx R(A)+=R(A+2);
  37. // if R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }
  38. ForPrep, // A sBx R(A)-=R(A+2); pc+=sBx
  39. TForCall, // A C R(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2));
  40. TForLoop, // A sBx if R(A+1) ~= nil then { R(A)=R(A+1); pc += sBx }
  41. SetList, // A B C R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B
  42. Closure, // A Bx R(A) := closure(KPROTO[Bx])
  43. VarArg, // A B R(A), R(A+1), ..., R(A+B-2) = vararg
  44. ExtraArg // Ax extra (larger) argument for previous opcode
  45. }