mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-13 21:40:43 +00:00
2e6fdd90a0
Some checks are pending
benchmark / callgrind (map[branch:main name:luau-lang/benchmark-data], ubuntu-22.04) (push) Waiting to run
build / macos (push) Waiting to run
build / macos-arm (push) Waiting to run
build / ubuntu (push) Waiting to run
build / windows (Win32) (push) Waiting to run
build / windows (x64) (push) Waiting to run
build / coverage (push) Waiting to run
build / web (push) Waiting to run
release / macos (push) Waiting to run
release / ubuntu (push) Waiting to run
release / windows (push) Waiting to run
release / web (push) Waiting to run
## New Solver * Type functions should be able to signal whether or not irreducibility is due to an error * Do not generate extra expansion constraint for uninvoked user-defined type functions * Print in a user-defined type function reports as an error instead of logging to stdout * Many e-graphs bugfixes and performance improvements * Many general bugfixes and improvements to the new solver as a whole * Fixed issue with used-defined type functions not being able to call each other * Infer types of globals under new type solver ## Fragment Autocomplete * Miscellaneous fixes to make interop with the old solver better ## Runtime * Support disabling specific built-in functions from being fast-called or constant-evaluated (Closes #1538) * New compiler option `disabledBuiltins` accepts a list of library function names like "tonumber" or "math.cos" * Added constant folding for vector arithmetic * Added constant propagation and type inference for vector globals (Fixes #1511) * New compiler option `librariesWithKnownMembers` accepts a list of libraries for members of which a request for constant value and/or type will be made * `libraryMemberTypeCb` callback is called to get the type of a global, return one of the `LuauBytecodeType` values. 'boolean', 'number', 'string' and 'vector' type are supported. * `libraryMemberConstantCb` callback is called to setup the constant value of a global. To set a value, C API `luau_set_compile_constant_*` or C++ API `setCompileConstant*` functions should be used. --- Co-authored-by: Aaron Weiss <aaronweiss@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: Daniel Angel <danielangel@roblox.com> Co-authored-by: Jonathan Kelaty <jkelaty@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Varun Saini <vsaini@roblox.com> Co-authored-by: Vighnesh Vijay <vvijay@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> --------- Co-authored-by: Aaron Weiss <aaronweiss@roblox.com> Co-authored-by: Alexander McCord <amccord@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: David Cope <dcope@roblox.com> Co-authored-by: Lily Brown <lbrown@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> Co-authored-by: Junseo Yoo <jyoo@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Varun Saini <61795485+vrn-sn@users.noreply.github.com> Co-authored-by: Alexander Youngblood <ayoungblood@roblox.com> Co-authored-by: Varun Saini <vsaini@roblox.com> Co-authored-by: Andrew Miranti <amiranti@roblox.com> Co-authored-by: Shiqi Ai <sai@roblox.com> Co-authored-by: Yohoo Lin <yohoo@roblox.com> Co-authored-by: Daniel Angel <danielangel@roblox.com> Co-authored-by: Jonathan Kelaty <jkelaty@roblox.com>
166 lines
4.8 KiB
Lua
166 lines
4.8 KiB
Lua
--!strict
|
|
local function prequire(name) local success, result = pcall(require, name); return success and result end
|
|
local bench = script and require(script.Parent.bench_support) or prequire("bench_support") or require("../bench_support")
|
|
|
|
function test()
|
|
|
|
type Vertex = { p: vector, uv: vector, n: vector, t: vector, b: vector, h: number }
|
|
|
|
local grid_size = 100
|
|
|
|
local mesh: {
|
|
vertices: {Vertex},
|
|
indices: {number},
|
|
triangle_cone_p: {vector},
|
|
triangle_cone_n: {vector}
|
|
} = {
|
|
vertices = table.create(grid_size * grid_size),
|
|
indices = table.create((grid_size - 1) * (grid_size - 1) * 6),
|
|
triangle_cone_p = table.create((grid_size - 1) * (grid_size - 1) * 2),
|
|
triangle_cone_n = table.create((grid_size - 1) * (grid_size - 1) * 2)
|
|
}
|
|
|
|
function init_vertices()
|
|
local i = 1
|
|
for y = 1,grid_size do
|
|
for x = 1,grid_size do
|
|
local v: Vertex = {}
|
|
|
|
v.p = vector.create(x, y, math.cos(x) + math.sin(y))
|
|
v.uv = vector.create((x-1)/(grid_size-1), (y-1)/(grid_size-1), 0)
|
|
v.n = vector.create(0, 0, 0)
|
|
v.b = vector.create(0, 0, 0)
|
|
v.t = vector.create(0, 0, 0)
|
|
v.h = 0
|
|
|
|
mesh.vertices[i] = v
|
|
i += 1
|
|
end
|
|
end
|
|
end
|
|
|
|
function init_indices()
|
|
local i = 1
|
|
for y = 1,grid_size-1 do
|
|
for x = 1,grid_size-1 do
|
|
mesh.indices[i] = x + (y-1)*grid_size
|
|
i += 1
|
|
mesh.indices[i] = x + y*grid_size
|
|
i += 1
|
|
mesh.indices[i] = (x+1) + (y-1)*grid_size
|
|
i += 1
|
|
mesh.indices[i] = (x+1) + (y-1)*grid_size
|
|
i += 1
|
|
mesh.indices[i] = x + y*grid_size
|
|
i += 1
|
|
mesh.indices[i] = (x+1) + y*grid_size
|
|
i += 1
|
|
end
|
|
end
|
|
end
|
|
|
|
function calculate_normals()
|
|
local norm_sum = 0
|
|
|
|
for i = 1,#mesh.indices,3 do
|
|
local a = mesh.vertices[mesh.indices[i]]
|
|
local b = mesh.vertices[mesh.indices[i + 1]]
|
|
local c = mesh.vertices[mesh.indices[i + 2]]
|
|
|
|
local n = vector.cross(a.p - b.p, a.p - c.p)
|
|
|
|
a.n += n
|
|
b.n += n
|
|
c.n += n
|
|
end
|
|
|
|
for _,v in ipairs(mesh.vertices) do
|
|
v.n = vector.normalize(v.n)
|
|
|
|
norm_sum += vector.dot(v.n, v.n)
|
|
end
|
|
|
|
return norm_sum
|
|
end
|
|
|
|
function compute_triangle_cones()
|
|
local mesh_area = 0
|
|
|
|
local pos = 1
|
|
|
|
for i = 1,#mesh.indices,3 do
|
|
local p0 = mesh.vertices[mesh.indices[i]]
|
|
local p1 = mesh.vertices[mesh.indices[i + 1]]
|
|
local p2 = mesh.vertices[mesh.indices[i + 2]]
|
|
|
|
local p10 = p1.p - p0.p
|
|
local p20 = p2.p - p0.p
|
|
|
|
local normal = vector.cross(p10, p20)
|
|
|
|
local area = vector.magnitude(normal)
|
|
local invarea = (area == 0) and 0 or 1 / area;
|
|
|
|
mesh.triangle_cone_p[pos] = (p0.p + p1.p + p2.p) / 3
|
|
mesh.triangle_cone_n[pos] = normal * invarea
|
|
pos += 1
|
|
|
|
mesh_area += area
|
|
end
|
|
|
|
return mesh_area
|
|
end
|
|
|
|
function compute_tangent_space()
|
|
local checksum = 0
|
|
|
|
for i = 1,#mesh.indices,3 do
|
|
local a = mesh.vertices[mesh.indices[i]]
|
|
local b = mesh.vertices[mesh.indices[i + 1]]
|
|
local c = mesh.vertices[mesh.indices[i + 2]]
|
|
|
|
local vba = b.p - a.p
|
|
local vca = c.p - a.p
|
|
|
|
local uvba = b.uv - a.uv
|
|
local uvca = c.uv - a.uv
|
|
|
|
local r = 1.0 / (uvba.X * uvca.Y - uvca.X * uvba.Y);
|
|
|
|
local sdir = (uvca.Y * vba - uvba.Y * vca) * r
|
|
local tdir = (uvba.X * vca - uvca.X * vba) * r
|
|
|
|
a.t += sdir
|
|
b.t += sdir
|
|
c.t += sdir
|
|
|
|
a.b += tdir
|
|
b.b += tdir
|
|
c.b += tdir
|
|
end
|
|
|
|
for _,v in ipairs(mesh.vertices) do
|
|
local t = v.t
|
|
|
|
-- Gram-Schmidt orthogonalize
|
|
v.t = vector.normalize(t - v.n * vector.dot(v.n, t))
|
|
|
|
local ht = vector.dot(vector.cross(v.n, t), v.b)
|
|
|
|
v.h = ht < 0 and -1 or 1
|
|
|
|
checksum += v.t.X + v.h
|
|
end
|
|
|
|
return checksum
|
|
end
|
|
|
|
|
|
init_vertices()
|
|
init_indices()
|
|
calculate_normals()
|
|
compute_triangle_cones()
|
|
compute_tangent_space()
|
|
end
|
|
|
|
bench.runCode(test, "mesh-normal-vector")
|