mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-14 06:00:39 +00:00
59ae47db43
* Type mismatch errors now mention if unification failed in covariant or invariant context, to explain why sometimes derived class can't be converted to base class or why `T` can't be converted into `T?` and so on * Class type indexing is no longer an error in non-strict mode (still an error in strict mode) * Fixed cyclic type packs not being displayed in the type * Added an error when unrelated types are compared with `==`/`~=` * Fixed false positive errors involving sub-type tests an `never` type * Fixed miscompilation of multiple assignment statements (Fixes https://github.com/Roblox/luau/issues/754) * Type inference stability improvements
104 lines
2.4 KiB
C++
104 lines
2.4 KiB
C++
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
#include "Luau/DataFlowGraph.h"
|
|
#include "Luau/Error.h"
|
|
#include "Luau/Parser.h"
|
|
|
|
#include "AstQueryDsl.h"
|
|
#include "ScopedFlags.h"
|
|
|
|
#include "doctest.h"
|
|
|
|
using namespace Luau;
|
|
|
|
class DataFlowGraphFixture
|
|
{
|
|
// Only needed to fix the operator== reflexivity of an empty Symbol.
|
|
ScopedFastFlag dcr{"DebugLuauDeferredConstraintResolution", true};
|
|
|
|
InternalErrorReporter handle;
|
|
|
|
Allocator allocator;
|
|
AstNameTable names{allocator};
|
|
AstStatBlock* module;
|
|
|
|
std::optional<DataFlowGraph> graph;
|
|
|
|
public:
|
|
void dfg(const std::string& code)
|
|
{
|
|
ParseResult parseResult = Parser::parse(code.c_str(), code.size(), names, allocator);
|
|
if (!parseResult.errors.empty())
|
|
throw ParseErrors(std::move(parseResult.errors));
|
|
module = parseResult.root;
|
|
graph = DataFlowGraphBuilder::build(module, NotNull{&handle});
|
|
}
|
|
|
|
template<typename T, int N>
|
|
std::optional<DefId> getDef(const std::vector<Nth>& nths = {nth<T>(N)})
|
|
{
|
|
T* node = query<T, N>(module, nths);
|
|
REQUIRE(node);
|
|
return graph->getDef(node);
|
|
}
|
|
|
|
template<typename T, int N>
|
|
DefId requireDef(const std::vector<Nth>& nths = {nth<T>(N)})
|
|
{
|
|
auto loc = getDef<T, N>(nths);
|
|
REQUIRE(loc);
|
|
return NotNull{*loc};
|
|
}
|
|
};
|
|
|
|
TEST_SUITE_BEGIN("DataFlowGraphBuilder");
|
|
|
|
TEST_CASE_FIXTURE(DataFlowGraphFixture, "define_locals_in_local_stat")
|
|
{
|
|
dfg(R"(
|
|
local x = 5
|
|
local y = x
|
|
)");
|
|
|
|
REQUIRE(getDef<AstExprLocal, 1>());
|
|
}
|
|
|
|
TEST_CASE_FIXTURE(DataFlowGraphFixture, "define_parameters_in_functions")
|
|
{
|
|
dfg(R"(
|
|
local function f(x)
|
|
local y = x
|
|
end
|
|
)");
|
|
|
|
REQUIRE(getDef<AstExprLocal, 1>());
|
|
}
|
|
|
|
TEST_CASE_FIXTURE(DataFlowGraphFixture, "find_aliases")
|
|
{
|
|
dfg(R"(
|
|
local x = 5
|
|
local y = x
|
|
local z = y
|
|
)");
|
|
|
|
DefId x = requireDef<AstExprLocal, 1>();
|
|
DefId y = requireDef<AstExprLocal, 2>();
|
|
REQUIRE(x != y); // TODO: they should be equal but it's not just locals that can alias, so we'll support this later.
|
|
}
|
|
|
|
TEST_CASE_FIXTURE(DataFlowGraphFixture, "independent_locals")
|
|
{
|
|
dfg(R"(
|
|
local x = 5
|
|
local y = 5
|
|
|
|
local a = x
|
|
local b = y
|
|
)");
|
|
|
|
DefId x = requireDef<AstExprLocal, 1>();
|
|
DefId y = requireDef<AstExprLocal, 2>();
|
|
REQUIRE(x != y);
|
|
}
|
|
|
|
TEST_SUITE_END();
|