mirror of
https://github.com/luau-lang/luau.git
synced 2025-05-04 10:33:46 +01:00
Clean up: replace lots of #ifdefs with for loops.
This commit is contained in:
parent
dcbb8e6fba
commit
72009dd5be
7 changed files with 100 additions and 222 deletions
|
@ -124,3 +124,11 @@
|
||||||
}
|
}
|
||||||
|
|
||||||
#define LUA_FLOAT4_VECTORS
|
#define LUA_FLOAT4_VECTORS
|
||||||
|
|
||||||
|
#ifdef LUA_FLOAT4_VECTORS
|
||||||
|
#define LUA_VECTOR_SIZE 4
|
||||||
|
#else
|
||||||
|
#define LUA_VECTOR_SIZE 3
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define LUA_EXTRA_VALUE_SIZE LUA_VECTOR_SIZE - 2 // note: this assumes vector size >= 2!
|
|
@ -1016,9 +1016,9 @@ static int luauF_tunpack(lua_State* L, StkId res, TValue* arg0, int nresults, St
|
||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
|
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
|
||||||
static int luauF_vector(lua_State* L, StkId res, TValue* arg0, int nresults, StkId args, int nparams)
|
static int luauF_vector(lua_State* L, StkId res, TValue* arg0, int nresults, StkId args, int nparams)
|
||||||
{
|
{
|
||||||
|
#ifdef LUA_FLOAT4_VECTORS
|
||||||
if (nparams >= 3 && nresults <= 1 && ttisnumber(arg0) && ttisnumber(args) && ttisnumber(args + 1) && ttisnumber(args + 2))
|
if (nparams >= 3 && nresults <= 1 && ttisnumber(arg0) && ttisnumber(args) && ttisnumber(args + 1) && ttisnumber(args + 2))
|
||||||
{
|
{
|
||||||
double x = nvalue(arg0);
|
double x = nvalue(arg0);
|
||||||
|
@ -1029,12 +1029,7 @@ static int luauF_vector(lua_State* L, StkId res, TValue* arg0, int nresults, Stk
|
||||||
setvvalue(res, float(x), float(y), float(z), float(w));
|
setvvalue(res, float(x), float(y), float(z), float(w));
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
#else
|
#else
|
||||||
static int luauF_vector(lua_State* L, StkId res, TValue* arg0, int nresults, StkId args, int nparams)
|
|
||||||
{
|
|
||||||
if (nparams >= 3 && nresults <= 1 && ttisnumber(arg0) && ttisnumber(args) && ttisnumber(args + 1))
|
if (nparams >= 3 && nresults <= 1 && ttisnumber(arg0) && ttisnumber(args) && ttisnumber(args + 1))
|
||||||
{
|
{
|
||||||
double x = nvalue(arg0);
|
double x = nvalue(arg0);
|
||||||
|
@ -1044,10 +1039,10 @@ static int luauF_vector(lua_State* L, StkId res, TValue* arg0, int nresults, Stk
|
||||||
setvvalue(res, float(x), float(y), float(z));
|
setvvalue(res, float(x), float(y), float(z));
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
#endif
|
|
||||||
|
|
||||||
static int luauF_countlz(lua_State* L, StkId res, TValue* arg0, int nresults, StkId args, int nparams)
|
static int luauF_countlz(lua_State* L, StkId res, TValue* arg0, int nresults, StkId args, int nparams)
|
||||||
{
|
{
|
||||||
|
|
|
@ -35,17 +35,15 @@
|
||||||
|
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
#ifdef LUA_FLOAT4_VECTORS
|
||||||
static_assert(sizeof(TValue) == ABISWITCH(24, 24, 24), "size mismatch for value");
|
static_assert(sizeof(TValue) == ABISWITCH(24, 24, 24), "size mismatch for value");
|
||||||
static_assert(offsetof(TString, data) == ABISWITCH(24, 20, 20), "size mismatch for string header");
|
|
||||||
static_assert(offsetof(Udata, data) == ABISWITCH(24, 16, 16), "size mismatch for userdata header");
|
|
||||||
static_assert(sizeof(Table) == ABISWITCH(56, 36, 36), "size mismatch for table header");
|
|
||||||
static_assert(sizeof(LuaNode) == ABISWITCH(48, 48, 48), "size mismatch for table entry");
|
static_assert(sizeof(LuaNode) == ABISWITCH(48, 48, 48), "size mismatch for table entry");
|
||||||
#else
|
#else
|
||||||
static_assert(sizeof(TValue) == ABISWITCH(16, 16, 16), "size mismatch for value");
|
static_assert(sizeof(TValue) == ABISWITCH(16, 16, 16), "size mismatch for value");
|
||||||
|
static_assert(sizeof(LuaNode) == ABISWITCH(32, 32, 32), "size mismatch for table entry");
|
||||||
|
#endif
|
||||||
|
|
||||||
static_assert(offsetof(TString, data) == ABISWITCH(24, 20, 20), "size mismatch for string header");
|
static_assert(offsetof(TString, data) == ABISWITCH(24, 20, 20), "size mismatch for string header");
|
||||||
static_assert(offsetof(Udata, data) == ABISWITCH(24, 16, 16), "size mismatch for userdata header");
|
static_assert(offsetof(Udata, data) == ABISWITCH(24, 16, 16), "size mismatch for userdata header");
|
||||||
static_assert(sizeof(Table) == ABISWITCH(56, 36, 36), "size mismatch for table header");
|
static_assert(sizeof(Table) == ABISWITCH(56, 36, 36), "size mismatch for table header");
|
||||||
static_assert(sizeof(LuaNode) == ABISWITCH(32, 32, 32), "size mismatch for table entry");
|
|
||||||
#endif
|
|
||||||
|
|
||||||
const size_t kSizeClasses = LUA_SIZECLASSES;
|
const size_t kSizeClasses = LUA_SIZECLASSES;
|
||||||
const size_t kMaxSmallSize = 512;
|
const size_t kMaxSmallSize = 512;
|
||||||
|
|
|
@ -47,11 +47,7 @@ typedef union
|
||||||
typedef struct lua_TValue
|
typedef struct lua_TValue
|
||||||
{
|
{
|
||||||
Value value;
|
Value value;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
int extra[LUA_EXTRA_VALUE_SIZE];
|
||||||
int extra[2];
|
|
||||||
#else
|
|
||||||
int extra;
|
|
||||||
#endif
|
|
||||||
int tt;
|
int tt;
|
||||||
} TValue;
|
} TValue;
|
||||||
|
|
||||||
|
@ -381,11 +377,7 @@ typedef struct Closure
|
||||||
typedef struct TKey
|
typedef struct TKey
|
||||||
{
|
{
|
||||||
::Value value;
|
::Value value;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
int extra[LUA_EXTRA_VALUE_SIZE];
|
||||||
int extra[2];
|
|
||||||
#else
|
|
||||||
int extra;
|
|
||||||
#endif
|
|
||||||
unsigned tt : 4;
|
unsigned tt : 4;
|
||||||
int next : 28; /* for chaining */
|
int next : 28; /* for chaining */
|
||||||
} TKey;
|
} TKey;
|
||||||
|
@ -396,15 +388,14 @@ typedef struct LuaNode
|
||||||
TKey key;
|
TKey key;
|
||||||
} LuaNode;
|
} LuaNode;
|
||||||
|
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
|
||||||
/* copy a value into a key */
|
/* copy a value into a key */
|
||||||
#define setnodekey(L, node, obj) \
|
#define setnodekey(L, node, obj) \
|
||||||
{ \
|
{ \
|
||||||
LuaNode* n_ = (node); \
|
LuaNode* n_ = (node); \
|
||||||
const TValue* i_o = (obj); \
|
const TValue* i_o = (obj); \
|
||||||
n_->key.value = i_o->value; \
|
n_->key.value = i_o->value; \
|
||||||
n_->key.extra[0] = i_o->extra[0]; \
|
for (int i = 0; i < LUA_EXTRA_VALUE_SIZE; i++) \
|
||||||
n_->key.extra[1] = i_o->extra[1]; \
|
n_->key.extra[i] = i_o->extra[i]; \
|
||||||
n_->key.tt = i_o->tt; \
|
n_->key.tt = i_o->tt; \
|
||||||
checkliveness(L->global, i_o); \
|
checkliveness(L->global, i_o); \
|
||||||
}
|
}
|
||||||
|
@ -415,34 +406,11 @@ typedef struct LuaNode
|
||||||
TValue* i_o = (obj); \
|
TValue* i_o = (obj); \
|
||||||
const LuaNode* n_ = (node); \
|
const LuaNode* n_ = (node); \
|
||||||
i_o->value = n_->key.value; \
|
i_o->value = n_->key.value; \
|
||||||
i_o->extra[0] = n_->key.extra[0]; \
|
for (int i = 0; i < LUA_EXTRA_VALUE_SIZE; i++) \
|
||||||
i_o->extra[1] = n_->key.extra[1]; \
|
i_o->extra[i] = n_->key.extra[i]; \
|
||||||
i_o->tt = n_->key.tt; \
|
i_o->tt = n_->key.tt; \
|
||||||
checkliveness(L->global, i_o); \
|
checkliveness(L->global, i_o); \
|
||||||
}
|
}
|
||||||
#else
|
|
||||||
/* copy a value into a key */
|
|
||||||
#define setnodekey(L, node, obj) \
|
|
||||||
{ \
|
|
||||||
LuaNode* n_ = (node); \
|
|
||||||
const TValue* i_o = (obj); \
|
|
||||||
n_->key.value = i_o->value; \
|
|
||||||
n_->key.extra = i_o->extra; \
|
|
||||||
n_->key.tt = i_o->tt; \
|
|
||||||
checkliveness(L->global, i_o); \
|
|
||||||
}
|
|
||||||
|
|
||||||
/* copy a value from a key */
|
|
||||||
#define getnodekey(L, obj, node) \
|
|
||||||
{ \
|
|
||||||
TValue* i_o = (obj); \
|
|
||||||
const LuaNode* n_ = (node); \
|
|
||||||
i_o->value = n_->key.value; \
|
|
||||||
i_o->extra = n_->key.extra; \
|
|
||||||
i_o->tt = n_->key.tt; \
|
|
||||||
checkliveness(L->global, i_o); \
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// clang-format off
|
// clang-format off
|
||||||
typedef struct Table
|
typedef struct Table
|
||||||
|
|
|
@ -32,17 +32,10 @@ LUAU_FASTFLAGVARIABLE(LuauArrayBoundary, false)
|
||||||
|
|
||||||
static_assert(offsetof(LuaNode, val) == 0, "Unexpected Node memory layout, pointer cast in gval2slot is incorrect");
|
static_assert(offsetof(LuaNode, val) == 0, "Unexpected Node memory layout, pointer cast in gval2slot is incorrect");
|
||||||
|
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
|
||||||
// TKey is bitpacked for memory efficiency so we need to validate bit counts for worst case
|
// TKey is bitpacked for memory efficiency so we need to validate bit counts for worst case
|
||||||
static_assert(TKey{{NULL}, {0, 0}, LUA_TDEADKEY, 0}.tt == LUA_TDEADKEY, "not enough bits for tt");
|
static_assert(TKey{{NULL}, {0}, LUA_TDEADKEY, 0}.tt == LUA_TDEADKEY, "not enough bits for tt");
|
||||||
static_assert(TKey{{NULL}, {0, 0}, LUA_TNIL, MAXSIZE - 1}.next == MAXSIZE - 1, "not enough bits for next");
|
static_assert(TKey{{NULL}, {0}, LUA_TNIL, MAXSIZE - 1}.next == MAXSIZE - 1, "not enough bits for next");
|
||||||
static_assert(TKey{{NULL}, {0, 0}, LUA_TNIL, -(MAXSIZE - 1)}.next == -(MAXSIZE - 1), "not enough bits for next");
|
static_assert(TKey{{NULL}, {0}, LUA_TNIL, -(MAXSIZE - 1)}.next == -(MAXSIZE - 1), "not enough bits for next");
|
||||||
#else
|
|
||||||
// TKey is bitpacked for memory efficiency so we need to validate bit counts for worst case
|
|
||||||
static_assert(TKey{{NULL}, 0, LUA_TDEADKEY, 0}.tt == LUA_TDEADKEY, "not enough bits for tt");
|
|
||||||
static_assert(TKey{{NULL}, 0, LUA_TNIL, MAXSIZE - 1}.next == MAXSIZE - 1, "not enough bits for next");
|
|
||||||
static_assert(TKey{{NULL}, 0, LUA_TNIL, -(MAXSIZE - 1)}.next == -(MAXSIZE - 1), "not enough bits for next");
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// reset cache of absent metamethods, cache is updated in luaT_gettm
|
// reset cache of absent metamethods, cache is updated in luaT_gettm
|
||||||
#define invalidateTMcache(t) t->flags = 0
|
#define invalidateTMcache(t) t->flags = 0
|
||||||
|
@ -102,53 +95,31 @@ static LuaNode* hashnum(const Table* t, double n)
|
||||||
return hashpow2(t, h2);
|
return hashpow2(t, h2);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static LuaNode* hashvec(const Table* t, const float* v)
|
||||||
|
{
|
||||||
|
unsigned int i[LUA_VECTOR_SIZE];
|
||||||
|
memcpy(i, v, sizeof(i));
|
||||||
|
|
||||||
|
for(int j = 0; j < LUA_VECTOR_SIZE; j++)
|
||||||
|
{
|
||||||
|
// convert -0 to 0 to make sure they hash to the same value
|
||||||
|
i[j] = (i[j] == 0x8000000) ? 0 : i[j];
|
||||||
|
|
||||||
|
// scramble bits to make sure that integer coordinates have entropy in lower bits
|
||||||
|
i[j] ^= i[j] >> 17;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Optimized Spatial Hashing for Collision Detection of Deformable Objects
|
||||||
|
static_assert(LUA_VECTOR_SIZE >= 3, "vector size must be 3 or 4 currently");
|
||||||
|
unsigned int h = (i[0] * 73856093) ^ (i[1] * 19349663) ^ (i[2] * 83492791);
|
||||||
|
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
#ifdef LUA_FLOAT4_VECTORS
|
||||||
static LuaNode* hashvec(const Table* t, const float* v)
|
|
||||||
{
|
|
||||||
unsigned int i[4];
|
|
||||||
memcpy(i, v, sizeof(i));
|
|
||||||
|
|
||||||
// convert -0 to 0 to make sure they hash to the same value
|
|
||||||
i[0] = (i[0] == 0x8000000) ? 0 : i[0];
|
|
||||||
i[1] = (i[1] == 0x8000000) ? 0 : i[1];
|
|
||||||
i[2] = (i[2] == 0x8000000) ? 0 : i[2];
|
|
||||||
i[3] = (i[3] == 0x8000000) ? 0 : i[3];
|
|
||||||
|
|
||||||
// scramble bits to make sure that integer coordinates have entropy in lower bits
|
|
||||||
i[0] ^= i[0] >> 17;
|
|
||||||
i[1] ^= i[1] >> 17;
|
|
||||||
i[2] ^= i[2] >> 17;
|
|
||||||
i[3] ^= i[3] >> 17;
|
|
||||||
|
|
||||||
// Optimized Spatial Hashing for Collision Detection of Deformable Objects
|
|
||||||
unsigned int h = (i[0] * 73856093) ^ (i[1] * 19349663) ^ (i[2] * 83492791);
|
|
||||||
h ^= i[3]; // TODO: proper hashing function for 4D vectors
|
h ^= i[3]; // TODO: proper hashing function for 4D vectors
|
||||||
|
|
||||||
return hashpow2(t, h);
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
static LuaNode* hashvec(const Table* t, const float* v)
|
|
||||||
{
|
|
||||||
unsigned int i[3];
|
|
||||||
memcpy(i, v, sizeof(i));
|
|
||||||
|
|
||||||
// convert -0 to 0 to make sure they hash to the same value
|
|
||||||
i[0] = (i[0] == 0x8000000) ? 0 : i[0];
|
|
||||||
i[1] = (i[1] == 0x8000000) ? 0 : i[1];
|
|
||||||
i[2] = (i[2] == 0x8000000) ? 0 : i[2];
|
|
||||||
|
|
||||||
// scramble bits to make sure that integer coordinates have entropy in lower bits
|
|
||||||
i[0] ^= i[0] >> 17;
|
|
||||||
i[1] ^= i[1] >> 17;
|
|
||||||
i[2] ^= i[2] >> 17;
|
|
||||||
|
|
||||||
// Optimized Spatial Hashing for Collision Detection of Deformable Objects
|
|
||||||
unsigned int h = (i[0] * 73856093) ^ (i[1] * 19349663) ^ (i[2] * 83492791);
|
|
||||||
|
|
||||||
return hashpow2(t, h);
|
|
||||||
}
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
return hashpow2(t, h);
|
||||||
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
** returns the `main' position of an element in a table (that is, the index
|
** returns the `main' position of an element in a table (that is, the index
|
||||||
** of its hash value)
|
** of its hash value)
|
||||||
|
|
|
@ -604,11 +604,9 @@ static void luau_execute(lua_State* L)
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
#ifdef LUA_FLOAT4_VECTORS
|
||||||
if(name[0] == 'w')
|
if(name[0] == 'w')
|
||||||
ic = 3;
|
ic = 3;
|
||||||
|
|
||||||
if (unsigned(ic) < 4 && name[1] == '\0')
|
|
||||||
#else
|
|
||||||
if (unsigned(ic) < 3 && name[1] == '\0')
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
if (unsigned(ic) < LUA_VECTOR_SIZE && name[1] == '\0')
|
||||||
{
|
{
|
||||||
setnvalue(ra, rb->value.v[ic]);
|
setnvalue(ra, rb->value.v[ic]);
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
|
@ -1533,11 +1531,9 @@ static void luau_execute(lua_State* L)
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
const float* vc = rc->value.v;
|
const float* vc = rc->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] + vc[0], vb[1] + vc[1], vb[2] + vc[2], vb[3] + vc[3]);
|
ra->value.v[i] = vb[i] + vc[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] + vc[0], vb[1] + vc[1], vb[2] + vc[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
@ -1583,11 +1579,9 @@ static void luau_execute(lua_State* L)
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
const float* vc = rc->value.v;
|
const float* vc = rc->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] - vc[0], vb[1] - vc[1], vb[2] - vc[2], vb[3] - vc[3]);
|
ra->value.v[i] = vb[i] - vc[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] - vc[0], vb[1] - vc[1], vb[2] - vc[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
@ -1633,33 +1627,27 @@ static void luau_execute(lua_State* L)
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
float vc = cast_to(float, nvalue(rc));
|
float vc = cast_to(float, nvalue(rc));
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] * vc, vb[1] * vc, vb[2] * vc, vb[2] * vc);
|
ra->value.v[i] = vb[i] * vc;
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] * vc, vb[1] * vc, vb[2] * vc);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else if (ttisvector(rb) && ttisvector(rc))
|
else if (ttisvector(rb) && ttisvector(rc))
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
const float* vc = rc->value.v;
|
const float* vc = rc->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] * vc[0], vb[1] * vc[1], vb[2] * vc[2], vb[3] * vc[3]);
|
ra->value.v[i] = vb[i] * vc[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] * vc[0], vb[1] * vc[1], vb[2] * vc[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else if (ttisnumber(rb) && ttisvector(rc))
|
else if (ttisnumber(rb) && ttisvector(rc))
|
||||||
{
|
{
|
||||||
float vb = cast_to(float, nvalue(rb));
|
float vb = cast_to(float, nvalue(rb));
|
||||||
const float* vc = rc->value.v;
|
const float* vc = rc->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb * vc[0], vb * vc[1], vb * vc[2], vb * vc[3]);
|
ra->value.v[i] = vb + vc[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb * vc[0], vb * vc[1], vb * vc[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
@ -1706,33 +1694,27 @@ static void luau_execute(lua_State* L)
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
float vc = cast_to(float, nvalue(rc));
|
float vc = cast_to(float, nvalue(rc));
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] / vc, vb[1] / vc, vb[2] / vc, vb[3] / vc);
|
ra->value.v[i] = vb[i] / vc;
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] / vc, vb[1] / vc, vb[2] / vc);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else if (ttisvector(rb) && ttisvector(rc))
|
else if (ttisvector(rb) && ttisvector(rc))
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
const float* vc = rc->value.v;
|
const float* vc = rc->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] / vc[0], vb[1] / vc[1], vb[2] / vc[2], vb[3] / vc[3]);
|
ra->value.v[i] = vb[i] / vc[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] / vc[0], vb[1] / vc[1], vb[2] / vc[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else if (ttisnumber(rb) && ttisvector(rc))
|
else if (ttisnumber(rb) && ttisvector(rc))
|
||||||
{
|
{
|
||||||
float vb = cast_to(float, nvalue(rb));
|
float vb = cast_to(float, nvalue(rb));
|
||||||
const float* vc = rc->value.v;
|
const float* vc = rc->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb / vc[0], vb / vc[1], vb / vc[2], vb / vc[3]);
|
ra->value.v[i] = vb / vc[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb / vc[0], vb / vc[1], vb / vc[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
@ -1865,11 +1847,9 @@ static void luau_execute(lua_State* L)
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
float vc = cast_to(float, nvalue(kv));
|
float vc = cast_to(float, nvalue(kv));
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] * vc, vb[1] * vc, vb[2] * vc, vb[3] * vc);
|
ra->value.v[i] = vb[i] * vc;
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] * vc, vb[1] * vc, vb[2] * vc);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
@ -1915,11 +1895,9 @@ static void luau_execute(lua_State* L)
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
float vc = cast_to(float, nvalue(kv));
|
float vc = cast_to(float, nvalue(kv));
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, vb[0] / vc, vb[1] / vc, vb[2] / vc, vb[3] / vc);
|
ra->value.v[i] = vb[i] / vc;
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, vb[0] / vc, vb[1] / vc, vb[2] / vc);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
@ -2084,11 +2062,9 @@ static void luau_execute(lua_State* L)
|
||||||
else if (ttisvector(rb))
|
else if (ttisvector(rb))
|
||||||
{
|
{
|
||||||
const float* vb = rb->value.v;
|
const float* vb = rb->value.v;
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
setvvalue(ra, -vb[0], -vb[1], -vb[2], -vb[3]);
|
ra->value.v[i] = -vb[i];
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
setvvalue(ra, -vb[0], -vb[1], -vb[2]);
|
|
||||||
#endif
|
|
||||||
VM_NEXT();
|
VM_NEXT();
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
|
|
@ -398,49 +398,33 @@ void luaV_doarith(lua_State* L, StkId ra, const TValue* rb, const TValue* rc, TM
|
||||||
|
|
||||||
if (vb && vc)
|
if (vb && vc)
|
||||||
{
|
{
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
|
||||||
switch (op)
|
switch (op)
|
||||||
{
|
{
|
||||||
case TM_ADD:
|
case TM_ADD:
|
||||||
setvvalue(ra, vb[0] + vc[0], vb[1] + vc[1], vb[2] + vc[2], vb[3] + vc[3]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = vb[i] + vc[i];
|
||||||
return;
|
return;
|
||||||
case TM_SUB:
|
case TM_SUB:
|
||||||
setvvalue(ra, vb[0] - vc[0], vb[1] - vc[1], vb[2] - vc[2], vb[2] - vc[2]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = vb[i] - vc[i];
|
||||||
return;
|
return;
|
||||||
case TM_MUL:
|
case TM_MUL:
|
||||||
setvvalue(ra, vb[0] * vc[0], vb[1] * vc[1], vb[2] * vc[2], vb[2] * vc[2]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = vb[i] * vc[i];
|
||||||
return;
|
return;
|
||||||
case TM_DIV:
|
case TM_DIV:
|
||||||
setvvalue(ra, vb[0] / vc[0], vb[1] / vc[1], vb[2] / vc[2], vb[2] / vc[2]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = vb[i] / vc[i];
|
||||||
return;
|
return;
|
||||||
case TM_UNM:
|
case TM_UNM:
|
||||||
setvvalue(ra, -vb[0], -vb[1], -vb[2], -vb[3]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = -vb[i];
|
||||||
return;
|
return;
|
||||||
default:
|
default:
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
#else
|
|
||||||
switch (op)
|
setttype(ra, LUA_TVECTOR);
|
||||||
{
|
|
||||||
case TM_ADD:
|
|
||||||
setvvalue(ra, vb[0] + vc[0], vb[1] + vc[1], vb[2] + vc[2]);
|
|
||||||
return;
|
|
||||||
case TM_SUB:
|
|
||||||
setvvalue(ra, vb[0] - vc[0], vb[1] - vc[1], vb[2] - vc[2]);
|
|
||||||
return;
|
|
||||||
case TM_MUL:
|
|
||||||
setvvalue(ra, vb[0] * vc[0], vb[1] * vc[1], vb[2] * vc[2]);
|
|
||||||
return;
|
|
||||||
case TM_DIV:
|
|
||||||
setvvalue(ra, vb[0] / vc[0], vb[1] / vc[1], vb[2] / vc[2]);
|
|
||||||
return;
|
|
||||||
case TM_UNM:
|
|
||||||
setvvalue(ra, -vb[0], -vb[1], -vb[2]);
|
|
||||||
return;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
}
|
||||||
else if (vb)
|
else if (vb)
|
||||||
{
|
{
|
||||||
|
@ -449,31 +433,20 @@ void luaV_doarith(lua_State* L, StkId ra, const TValue* rb, const TValue* rc, TM
|
||||||
if (c)
|
if (c)
|
||||||
{
|
{
|
||||||
float nc = cast_to(float, nvalue(c));
|
float nc = cast_to(float, nvalue(c));
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
|
||||||
switch (op)
|
switch (op)
|
||||||
{
|
{
|
||||||
case TM_MUL:
|
case TM_MUL:
|
||||||
setvvalue(ra, vb[0] * nc, vb[1] * nc, vb[2] * nc, vb[3] * nc);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = vb[i] * nc;
|
||||||
return;
|
return;
|
||||||
case TM_DIV:
|
case TM_DIV:
|
||||||
setvvalue(ra, vb[0] / nc, vb[1] / nc, vb[2] / nc, vb[3] / nc);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = vb[i] / nc;
|
||||||
return;
|
return;
|
||||||
default:
|
default:
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
switch (op)
|
|
||||||
{
|
|
||||||
case TM_MUL:
|
|
||||||
setvvalue(ra, vb[0] * nc, vb[1] * nc, vb[2] * nc);
|
|
||||||
return;
|
|
||||||
case TM_DIV:
|
|
||||||
setvvalue(ra, vb[0] / nc, vb[1] / nc, vb[2] / nc);
|
|
||||||
return;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else if (vc)
|
else if (vc)
|
||||||
|
@ -483,31 +456,20 @@ void luaV_doarith(lua_State* L, StkId ra, const TValue* rb, const TValue* rc, TM
|
||||||
if (b)
|
if (b)
|
||||||
{
|
{
|
||||||
float nb = cast_to(float, nvalue(b));
|
float nb = cast_to(float, nvalue(b));
|
||||||
#ifdef LUA_FLOAT4_VECTORS
|
|
||||||
switch (op)
|
switch (op)
|
||||||
{
|
{
|
||||||
case TM_MUL:
|
case TM_MUL:
|
||||||
setvvalue(ra, nb * vc[0], nb * vc[1], nb * vc[2], nb * vc[3]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = nb * vc[i];
|
||||||
return;
|
return;
|
||||||
case TM_DIV:
|
case TM_DIV:
|
||||||
setvvalue(ra, nb / vc[0], nb / vc[1], nb / vc[2], nb / vc[2]);
|
for (int i = 0; i < LUA_VECTOR_SIZE; i++)
|
||||||
|
ra->value.v[i] = nb / vc[i];
|
||||||
return;
|
return;
|
||||||
default:
|
default:
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
#else
|
setttype(ra, LUA_TVECTOR);
|
||||||
switch (op)
|
|
||||||
{
|
|
||||||
case TM_MUL:
|
|
||||||
setvvalue(ra, nb * vc[0], nb * vc[1], nb * vc[2]);
|
|
||||||
return;
|
|
||||||
case TM_DIV:
|
|
||||||
setvvalue(ra, nb / vc[0], nb / vc[1], nb / vc[2]);
|
|
||||||
return;
|
|
||||||
default:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Add table
Reference in a new issue