2022-03-18 08:46:04 +08:00
|
|
|
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
|
|
|
|
|
|
#include "Luau/AstQuery.h"
|
|
|
|
#include "Luau/BuiltinDefinitions.h"
|
2023-05-06 05:52:49 +08:00
|
|
|
#include "Luau/Frontend.h"
|
2022-03-18 08:46:04 +08:00
|
|
|
#include "Luau/Scope.h"
|
|
|
|
#include "Luau/TypeInfer.h"
|
2023-01-05 04:53:17 +08:00
|
|
|
#include "Luau/Type.h"
|
|
|
|
#include "Luau/VisitType.h"
|
2022-03-18 08:46:04 +08:00
|
|
|
|
|
|
|
#include "Fixture.h"
|
|
|
|
|
|
|
|
#include "doctest.h"
|
|
|
|
|
|
|
|
using namespace Luau;
|
|
|
|
|
2022-09-02 07:14:03 +08:00
|
|
|
LUAU_FASTFLAG(DebugLuauDeferredConstraintResolution)
|
2022-07-29 12:24:07 +08:00
|
|
|
|
2022-03-18 08:46:04 +08:00
|
|
|
TEST_SUITE_BEGIN("TypeInferLoops");
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_loop")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local q
|
|
|
|
for i=0, 50, 2 do
|
|
|
|
q = i
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->numberType, *requireType("q"));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
2023-05-06 05:52:49 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "iteration_no_table_passed")
|
|
|
|
{
|
|
|
|
ScopedFastFlag sff{"DebugLuauDeferredConstraintResolution", true};
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
|
|
|
|
type Iterable = typeof(setmetatable(
|
|
|
|
{},
|
|
|
|
{}::{
|
|
|
|
__iter: (self: Iterable) -> (any, number) -> (number, string)
|
|
|
|
}
|
|
|
|
))
|
|
|
|
|
|
|
|
local t: Iterable
|
|
|
|
|
|
|
|
for a, b in t do end
|
|
|
|
)");
|
|
|
|
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
GenericError* ge = get<GenericError>(result.errors[0]);
|
|
|
|
REQUIRE(ge);
|
|
|
|
CHECK_EQ("__iter metamethod must return (next[, table[, state]])", ge->message);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "iteration_regression_issue_69967")
|
|
|
|
{
|
|
|
|
ScopedFastFlag sff{"DebugLuauDeferredConstraintResolution", true};
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
|
|
|
|
type Iterable = typeof(setmetatable(
|
|
|
|
{},
|
|
|
|
{}::{
|
|
|
|
__iter: (self: Iterable) -> () -> (number, string)
|
|
|
|
}
|
|
|
|
))
|
|
|
|
|
|
|
|
local t: Iterable
|
|
|
|
|
|
|
|
for a, b in t do end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
GenericError* ge = get<GenericError>(result.errors[0]);
|
|
|
|
REQUIRE(ge);
|
|
|
|
CHECK_EQ("__iter metamethod must return (next[, table[, state]])", ge->message);
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_loop")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local n
|
|
|
|
local s
|
|
|
|
for i, v in pairs({ "foo" }) do
|
|
|
|
n = i
|
|
|
|
s = v
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->numberType, *requireType("n"));
|
|
|
|
CHECK_EQ(*builtinTypes->stringType, *requireType("s"));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_loop_with_next")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local n
|
|
|
|
local s
|
|
|
|
for i, v in next, { "foo", "bar" } do
|
|
|
|
n = i
|
|
|
|
s = v
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->numberType, *requireType("n"));
|
|
|
|
CHECK_EQ(*builtinTypes->stringType, *requireType("s"));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_with_an_iterator_of_type_any")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local it: any
|
|
|
|
local a, b
|
|
|
|
for i, v in it do
|
|
|
|
a, b = i, v
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_loop_should_fail_with_non_function_iterator")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local foo = "bar"
|
|
|
|
for i, v in foo do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
2022-04-29 09:24:24 +08:00
|
|
|
CHECK_EQ("Cannot call non-function string", toString(result.errors[0]));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_with_just_one_iterator_is_ok")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local function keys(dictionary)
|
|
|
|
local new = {}
|
|
|
|
local index = 1
|
|
|
|
|
|
|
|
for key in pairs(dictionary) do
|
|
|
|
new[index] = key
|
|
|
|
index = index + 1
|
|
|
|
end
|
|
|
|
|
|
|
|
return new
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
2022-09-02 07:14:03 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_loop_with_zero_iterators_dcr")
|
|
|
|
{
|
|
|
|
ScopedFastFlag sff{"DebugLuauDeferredConstraintResolution", true};
|
|
|
|
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function no_iter() end
|
|
|
|
for key in no_iter() do end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_with_a_custom_iterator_should_type_check")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local function range(l, h): () -> number
|
|
|
|
return function()
|
|
|
|
return l
|
|
|
|
end
|
|
|
|
end
|
|
|
|
|
|
|
|
for n: string in range(1, 10) do
|
|
|
|
print(n)
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_loop_on_error")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function f(x)
|
|
|
|
gobble.prop = x.otherprop
|
|
|
|
end
|
|
|
|
|
|
|
|
local p
|
|
|
|
for _, part in i_am_not_defined do
|
|
|
|
p = part
|
|
|
|
f(part)
|
|
|
|
part.thirdprop = false
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
2022-09-02 07:14:03 +08:00
|
|
|
LUAU_REQUIRE_ERROR_COUNT(2, result);
|
2022-03-18 08:46:04 +08:00
|
|
|
|
|
|
|
TypeId p = requireType("p");
|
2022-11-05 01:33:22 +08:00
|
|
|
CHECK_EQ("*error-type*", toString(p));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_loop_on_non_function")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local bad_iter = 5
|
|
|
|
|
|
|
|
for a in bad_iter() do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
|
|
|
|
REQUIRE(get<CannotCallNonFunction>(result.errors[0]));
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_loop_error_on_factory_not_returning_the_right_amount_of_values")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local function hasDivisors(value: number, table)
|
|
|
|
return false
|
|
|
|
end
|
|
|
|
|
|
|
|
function prime_iter(state, index)
|
|
|
|
while hasDivisors(index, state) do
|
|
|
|
index += 1
|
|
|
|
end
|
|
|
|
|
|
|
|
state[index] = true
|
|
|
|
return index
|
|
|
|
end
|
|
|
|
|
|
|
|
function primes1()
|
|
|
|
return prime_iter, {}
|
|
|
|
end
|
|
|
|
|
|
|
|
function primes2()
|
|
|
|
return prime_iter, {}, ""
|
|
|
|
end
|
|
|
|
|
|
|
|
function primes3()
|
|
|
|
return prime_iter, {}, 2
|
|
|
|
end
|
|
|
|
|
|
|
|
for p in primes1() do print(p) end -- mismatch in argument count
|
|
|
|
|
|
|
|
for p in primes2() do print(p) end -- mismatch in argument types, prime_iter takes {}, number, we are given {}, string
|
|
|
|
|
|
|
|
for p in primes3() do print(p) end -- no error
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(2, result);
|
|
|
|
|
|
|
|
CountMismatch* acm = get<CountMismatch>(result.errors[0]);
|
|
|
|
REQUIRE(acm);
|
|
|
|
CHECK_EQ(acm->context, CountMismatch::Arg);
|
|
|
|
CHECK_EQ(2, acm->expected);
|
|
|
|
CHECK_EQ(1, acm->actual);
|
|
|
|
|
|
|
|
TypeMismatch* tm = get<TypeMismatch>(result.errors[1]);
|
|
|
|
REQUIRE(tm);
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(builtinTypes->numberType, tm->wantedType);
|
|
|
|
CHECK_EQ(builtinTypes->stringType, tm->givenType);
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_loop_error_on_iterator_requiring_args_but_none_given")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function prime_iter(state, index)
|
|
|
|
return 1
|
|
|
|
end
|
|
|
|
|
|
|
|
for p in prime_iter do print(p) end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
|
|
|
|
CountMismatch* acm = get<CountMismatch>(result.errors[0]);
|
|
|
|
REQUIRE(acm);
|
|
|
|
CHECK_EQ(acm->context, CountMismatch::Arg);
|
|
|
|
CHECK_EQ(2, acm->expected);
|
|
|
|
CHECK_EQ(0, acm->actual);
|
|
|
|
}
|
|
|
|
|
2022-09-02 07:14:03 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_loop_with_incompatible_args_to_iterator")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function my_iter(state: string, index: number)
|
|
|
|
return state, index
|
|
|
|
end
|
|
|
|
|
|
|
|
local my_state = {}
|
|
|
|
local first_index = "first"
|
|
|
|
|
|
|
|
-- Type errors here. my_state and first_index cannot be passed to my_iter
|
|
|
|
for a, b in my_iter, my_state, first_index do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(2, result);
|
|
|
|
|
|
|
|
CHECK(get<TypeMismatch>(result.errors[1]));
|
|
|
|
CHECK(Location{{9, 29}, {9, 37}} == result.errors[0].location);
|
|
|
|
|
|
|
|
CHECK(get<TypeMismatch>(result.errors[1]));
|
|
|
|
CHECK(Location{{9, 39}, {9, 50}} == result.errors[1].location);
|
|
|
|
}
|
|
|
|
|
2022-03-18 08:46:04 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_loop_with_custom_iterator")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function primes()
|
|
|
|
return function (state: number) end, 2
|
|
|
|
end
|
|
|
|
|
|
|
|
for p, q in primes do
|
|
|
|
q = ""
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
|
|
|
|
TypeMismatch* tm = get<TypeMismatch>(result.errors[0]);
|
|
|
|
REQUIRE(tm);
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(builtinTypes->numberType, tm->wantedType);
|
|
|
|
CHECK_EQ(builtinTypes->stringType, tm->givenType);
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "while_loop")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local i
|
|
|
|
while true do
|
|
|
|
i = 8
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->numberType, *requireType("i"));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "repeat_loop")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local i
|
|
|
|
repeat
|
|
|
|
i = 'hi'
|
|
|
|
until true
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->stringType, *requireType("i"));
|
2022-03-18 08:46:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "repeat_loop_condition_binds_to_its_block")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
repeat
|
|
|
|
local x = true
|
|
|
|
until x
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "symbols_in_repeat_block_should_not_be_visible_beyond_until_condition")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
repeat
|
|
|
|
local x = true
|
|
|
|
until x
|
|
|
|
|
|
|
|
print(x)
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "varlist_declared_by_for_in_loop_should_be_free")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local T = {}
|
|
|
|
|
|
|
|
function T.f(p)
|
|
|
|
for i, v in pairs(p) do
|
|
|
|
T.f(v)
|
|
|
|
end
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "properly_infer_iteratee_is_a_free_table")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
// In this case, we cannot know the element type of the table {}. It could be anything.
|
|
|
|
// We therefore must initially ascribe a free typevar to iter.
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
for iter in pairs({}) do
|
|
|
|
iter:g().p = true
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "correctly_scope_locals_while")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
while true do
|
|
|
|
local a = 1
|
|
|
|
end
|
|
|
|
|
|
|
|
print(a) -- oops!
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
|
|
|
|
UnknownSymbol* us = get<UnknownSymbol>(result.errors[0]);
|
|
|
|
REQUIRE(us);
|
|
|
|
CHECK_EQ(us->name, "a");
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "ipairs_produces_integral_indices")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local key
|
|
|
|
for i, e in ipairs({}) do key = i end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
|
|
|
|
REQUIRE_EQ("number", toString(requireType("key")));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_in_loop_where_iteratee_is_free")
|
|
|
|
{
|
|
|
|
// This code doesn't pass typechecking. We just care that it doesn't crash.
|
|
|
|
(void)check(R"(
|
|
|
|
--!nonstrict
|
|
|
|
function _:_(...)
|
|
|
|
end
|
|
|
|
|
|
|
|
repeat
|
|
|
|
if _ then
|
|
|
|
else
|
|
|
|
_ = ...
|
|
|
|
end
|
|
|
|
until _
|
|
|
|
|
|
|
|
for _ in _() do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "unreachable_code_after_infinite_loop")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function unreachablecodepath(a): number
|
|
|
|
while true do
|
|
|
|
if a then return 10 end
|
|
|
|
end
|
|
|
|
-- unreachable
|
|
|
|
end
|
|
|
|
unreachablecodepath(4)
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(0, result);
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function reachablecodepath(a): number
|
|
|
|
while true do
|
|
|
|
if a then break end
|
|
|
|
return 10
|
|
|
|
end
|
|
|
|
|
|
|
|
print("x") -- correct error
|
|
|
|
end
|
|
|
|
reachablecodepath(4)
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERRORS(result);
|
|
|
|
CHECK(get<FunctionExitsWithoutReturning>(result.errors[0]));
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function unreachablecodepath(a): number
|
|
|
|
repeat
|
|
|
|
if a then return 10 end
|
|
|
|
until false
|
|
|
|
|
|
|
|
-- unreachable
|
|
|
|
end
|
|
|
|
unreachablecodepath(4)
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(0, result);
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function reachablecodepath(a, b): number
|
|
|
|
repeat
|
|
|
|
if a then break end
|
|
|
|
|
|
|
|
if b then return 10 end
|
|
|
|
until false
|
|
|
|
|
|
|
|
print("x") -- correct error
|
|
|
|
end
|
|
|
|
reachablecodepath(4)
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERRORS(result);
|
|
|
|
CHECK(get<FunctionExitsWithoutReturning>(result.errors[0]));
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function unreachablecodepath(a: number?): number
|
|
|
|
repeat
|
|
|
|
return 10
|
|
|
|
until a ~= nil
|
|
|
|
|
|
|
|
-- unreachable
|
|
|
|
end
|
|
|
|
unreachablecodepath(4)
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(0, result);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-05-14 03:36:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "loop_typecheck_crash_on_empty_optional")
|
2022-03-18 08:46:04 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t = {}
|
|
|
|
for _ in t do
|
|
|
|
for _ in assert(missing()) do
|
|
|
|
end
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(2, result);
|
|
|
|
}
|
|
|
|
|
2022-04-29 09:24:24 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "fuzz_fail_missing_instantitation_follow")
|
|
|
|
{
|
|
|
|
// Just check that this doesn't assert
|
|
|
|
check(R"(
|
|
|
|
--!nonstrict
|
|
|
|
function _(l0:number)
|
|
|
|
return _
|
|
|
|
end
|
|
|
|
for _ in _(8) do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
}
|
|
|
|
|
2022-09-30 06:23:10 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "for_in_with_generic_next")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
for k: number, v: number in next, {1, 2, 3} do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
2022-05-06 08:03:43 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "loop_iter_basic")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t: {string} = {}
|
|
|
|
local key
|
|
|
|
for k: number in t do
|
|
|
|
end
|
|
|
|
for k: number, v: string in t do
|
|
|
|
end
|
|
|
|
for k, v in t do
|
|
|
|
key = k
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
2022-09-02 07:14:03 +08:00
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->numberType, *requireType("key"));
|
2022-05-06 08:03:43 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "loop_iter_trailing_nil")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t: {string} = {}
|
|
|
|
local extra
|
|
|
|
for k, v, e in t do
|
|
|
|
extra = e
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(0, result);
|
2023-03-11 04:21:07 +08:00
|
|
|
CHECK_EQ(*builtinTypes->nilType, *requireType("extra"));
|
2022-05-06 08:03:43 +08:00
|
|
|
}
|
|
|
|
|
2022-07-22 05:16:54 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "loop_iter_no_indexer_strict")
|
2022-05-06 08:03:43 +08:00
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t = {}
|
|
|
|
for k, v in t do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
|
|
|
|
GenericError* ge = get<GenericError>(result.errors[0]);
|
|
|
|
REQUIRE(ge);
|
|
|
|
CHECK_EQ("Cannot iterate over a table without indexer", ge->message);
|
|
|
|
}
|
|
|
|
|
2022-07-22 05:16:54 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "loop_iter_no_indexer_nonstrict")
|
|
|
|
{
|
|
|
|
CheckResult result = check(Mode::Nonstrict, R"(
|
|
|
|
local t = {}
|
|
|
|
for k, v in t do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(0, result);
|
|
|
|
}
|
|
|
|
|
2022-09-30 06:23:10 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "loop_iter_metamethod_nil")
|
2022-05-06 08:03:43 +08:00
|
|
|
{
|
2022-09-30 06:23:10 +08:00
|
|
|
if (!FFlag::DebugLuauDeferredConstraintResolution)
|
|
|
|
return;
|
|
|
|
|
2022-05-06 08:03:43 +08:00
|
|
|
CheckResult result = check(R"(
|
2022-09-30 06:23:10 +08:00
|
|
|
local t = setmetatable({}, { __iter = function(o) return next, nil end, })
|
|
|
|
for k: number, v: string in t do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
CHECK(toString(result.errors[0]) == "Type 'nil' could not be converted into '{- [a]: b -}'");
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "loop_iter_metamethod_not_enough_returns")
|
|
|
|
{
|
|
|
|
if (!FFlag::DebugLuauDeferredConstraintResolution)
|
|
|
|
return;
|
|
|
|
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t = setmetatable({}, { __iter = function(o) end })
|
|
|
|
for k: number, v: string in t do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
CHECK(result.errors[0] == TypeError{
|
2022-10-15 03:48:41 +08:00
|
|
|
Location{{2, 36}, {2, 37}},
|
|
|
|
GenericError{"__iter must return at least one value"},
|
|
|
|
});
|
2022-09-30 06:23:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "loop_iter_metamethod_ok")
|
|
|
|
{
|
|
|
|
if (!FFlag::DebugLuauDeferredConstraintResolution)
|
|
|
|
return;
|
|
|
|
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t = setmetatable({
|
|
|
|
children = {"foo"}
|
|
|
|
}, { __iter = function(o) return next, o.children end })
|
2022-05-06 08:03:43 +08:00
|
|
|
for k: number, v: string in t do
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(0, result);
|
|
|
|
}
|
|
|
|
|
2022-09-30 06:23:10 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "loop_iter_metamethod_ok_with_inference")
|
|
|
|
{
|
|
|
|
if (!FFlag::DebugLuauDeferredConstraintResolution)
|
|
|
|
return;
|
|
|
|
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local t = setmetatable({
|
|
|
|
children = {"foo"}
|
|
|
|
}, { __iter = function(o) return next, o.children end })
|
|
|
|
|
|
|
|
local a, b
|
|
|
|
for k, v in t do
|
|
|
|
a = k
|
|
|
|
b = v
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
CHECK(toString(requireType("a")) == "number");
|
|
|
|
CHECK(toString(requireType("b")) == "string");
|
|
|
|
}
|
|
|
|
|
Sync to upstream/release/562 (#828)
* Fixed rare use-after-free in analysis during table unification
A lot of work these past months went into two new Luau components:
* A near full rewrite of the typechecker using a new deferred constraint
resolution system
* Native code generation for AoT/JiT compilation of VM bytecode into x64
(avx)/arm64 instructions
Both of these components are far from finished and we don't provide
documentation on building and using them at this point.
However, curious community members expressed interest in learning about
changes that go into these components each week, so we are now listing
them here in the 'sync' pull request descriptions.
---
New typechecker can be enabled by setting
DebugLuauDeferredConstraintResolution flag to 'true'.
It is considered unstable right now, so try it at your own risk.
Even though it already provides better type inference than the current
one in some cases, our main goal right now is to reach feature parity
with current typechecker.
Features which improve over the capabilities of the current typechecker
are marked as '(NEW)'.
Changes to new typechecker:
* Regular for loop index and parameters are now typechecked
* Invalid type annotations on local variables are ignored to improve
autocomplete
* Fixed missing autocomplete type suggestions for function arguments
* Type reduction is now performed to produce simpler types to be
presented to the user (error messages, custom LSPs)
* Internally, complex types like '((number | string) & ~(false?)) |
string' can be produced, which is just 'string | number' when simplified
* Fixed spots where support for unknown and never types was missing
* (NEW) Length operator '#' is now valid to use on top table type, this
type comes up when doing typeof(x) == "table" guards and isn't available
in current typechecker
---
Changes to native code generation:
* Additional math library fast calls are now lowered to x64: math.ldexp,
math.round, math.frexp, math.modf, math.sign and math.clamp
2023-02-04 03:26:13 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_loop_lower_bound_is_string")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
for i: unknown = 1, 10 do end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_loop_lower_bound_is_string_2")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
for i: never = 1, 10 do end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
CHECK_EQ("Type 'number' could not be converted into 'never'", toString(result.errors[0]));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "for_loop_lower_bound_is_string_3")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
for i: number | string = 1, 10 do end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
}
|
|
|
|
|
2023-03-18 03:20:37 +08:00
|
|
|
TEST_CASE_FIXTURE(BuiltinsFixture, "cli_68448_iterators_need_not_accept_nil")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
local function makeEnum(members)
|
|
|
|
local enum = {}
|
|
|
|
for _, memberName in ipairs(members) do
|
|
|
|
enum[memberName] = memberName
|
|
|
|
end
|
|
|
|
return enum
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_NO_ERRORS(result);
|
|
|
|
// HACK (CLI-68453): We name this inner table `enum`. For now, use the
|
|
|
|
// exhaustive switch to see past it.
|
|
|
|
CHECK(toString(requireType("makeEnum"), {true}) == "<a>({a}) -> {| [a]: a |}");
|
|
|
|
}
|
|
|
|
|
2023-04-01 02:42:49 +08:00
|
|
|
TEST_CASE_FIXTURE(Fixture, "iterate_over_free_table")
|
|
|
|
{
|
|
|
|
CheckResult result = check(R"(
|
|
|
|
function print(x) end
|
|
|
|
|
|
|
|
function dump(tbl)
|
|
|
|
print(tbl.whatever)
|
|
|
|
for k, v in tbl do
|
|
|
|
print(k)
|
|
|
|
print(v)
|
|
|
|
end
|
|
|
|
end
|
|
|
|
)");
|
|
|
|
|
|
|
|
LUAU_REQUIRE_ERROR_COUNT(1, result);
|
|
|
|
|
|
|
|
GenericError* ge = get<GenericError>(result.errors[0]);
|
|
|
|
REQUIRE(ge);
|
|
|
|
|
|
|
|
CHECK("Cannot iterate over a table without indexer" == ge->message);
|
|
|
|
}
|
|
|
|
|
2022-03-18 08:46:04 +08:00
|
|
|
TEST_SUITE_END();
|