mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-13 21:40:43 +00:00
c2ba1058c3
# What's changed? - Record the location of properties for table types (closes #802) - Implement stricter UTF-8 validations as per the RFC (https://github.com/luau-lang/rfcs/pull/1) - Implement `buffer` as a new type in both the old and new solvers. - Changed errors produced by some `buffer` builtins to be a bit more generic to avoid platform-dependent error messages. - Fixed a bug where `Unifier` would copy some persistent types, tripping some internal assertions. - Type checking rules on relational operators is now a little bit more lax. - Improve dead code elimination for some `if` statements with complex always-false conditions ## New type solver - Dataflow analysis now generates phi nodes on exit of branches. - Dataflow analysis avoids producing a new definition for locals or properties that are not owned by that loop. - If a function parameter has been constrained to `never`, report errors at all uses of that parameter within that function. - Switch to using the new `Luau::Set` to replace `std::unordered_set` to alleviate some poor allocation characteristics which was negatively affecting overall performance. - Subtyping can now report many failing reasons instead of just the first one that we happened to find during the test. - Subtyping now also report reasons for type pack mismatches. - When visiting `if` statements or expressions, the resulting context are the common terms in both branches. ## Native codegen - Implement support for `buffer` builtins to its IR for x64 and A64. - Optimized `table.insert` by not inserting a table barrier if it is fastcalled with a constant. ## Internal Contributors 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: Arseny Kapoulkine <arseny@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: Lily Brown <lbrown@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com>
132 lines
4.1 KiB
C++
132 lines
4.1 KiB
C++
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
#pragma once
|
|
|
|
#include "Luau/Error.h"
|
|
#include "Luau/Linter.h"
|
|
#include "Luau/FileResolver.h"
|
|
#include "Luau/ParseOptions.h"
|
|
#include "Luau/ParseResult.h"
|
|
#include "Luau/Scope.h"
|
|
#include "Luau/TypeArena.h"
|
|
|
|
#include <memory>
|
|
#include <vector>
|
|
#include <unordered_map>
|
|
#include <optional>
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
struct Module;
|
|
|
|
using ScopePtr = std::shared_ptr<struct Scope>;
|
|
using ModulePtr = std::shared_ptr<Module>;
|
|
|
|
class AstType;
|
|
class AstTypePack;
|
|
|
|
/// Root of the AST of a parsed source file
|
|
struct SourceModule
|
|
{
|
|
ModuleName name; // Module identifier or a filename
|
|
std::string humanReadableName;
|
|
|
|
SourceCode::Type type = SourceCode::None;
|
|
std::optional<std::string> environmentName;
|
|
bool cyclic = false;
|
|
|
|
std::shared_ptr<Allocator> allocator;
|
|
std::shared_ptr<AstNameTable> names;
|
|
std::vector<ParseError> parseErrors;
|
|
|
|
AstStatBlock* root = nullptr;
|
|
std::optional<Mode> mode;
|
|
|
|
std::vector<HotComment> hotcomments;
|
|
std::vector<Comment> commentLocations;
|
|
|
|
SourceModule()
|
|
: allocator(new Allocator)
|
|
, names(new AstNameTable(*allocator))
|
|
{
|
|
}
|
|
};
|
|
|
|
bool isWithinComment(const SourceModule& sourceModule, Position pos);
|
|
bool isWithinComment(const ParseResult& result, Position pos);
|
|
|
|
struct RequireCycle
|
|
{
|
|
Location location;
|
|
std::vector<ModuleName> path; // one of the paths for a require() to go all the way back to the originating module
|
|
};
|
|
|
|
struct Module
|
|
{
|
|
~Module();
|
|
|
|
ModuleName name;
|
|
std::string humanReadableName;
|
|
|
|
TypeArena interfaceTypes;
|
|
TypeArena internalTypes;
|
|
|
|
// Scopes and AST types refer to parse data, so we need to keep that alive
|
|
std::shared_ptr<Allocator> allocator;
|
|
std::shared_ptr<AstNameTable> names;
|
|
|
|
std::vector<std::pair<Location, ScopePtr>> scopes; // never empty
|
|
|
|
DenseHashMap<const AstExpr*, TypeId> astTypes{nullptr};
|
|
DenseHashMap<const AstExpr*, TypePackId> astTypePacks{nullptr};
|
|
DenseHashMap<const AstExpr*, TypeId> astExpectedTypes{nullptr};
|
|
|
|
// For AST nodes that are function calls, this map provides the
|
|
// unspecialized type of the function that was called. If a function call
|
|
// resolves to a __call metamethod application, this map will point at that
|
|
// metamethod.
|
|
//
|
|
// This is useful for type checking and Signature Help.
|
|
DenseHashMap<const AstNode*, TypeId> astOriginalCallTypes{nullptr};
|
|
|
|
// The specialization of a function that was selected. If the function is
|
|
// generic, those generic type parameters will be replaced with the actual
|
|
// types that were passed. If the function is an overload, this map will
|
|
// point at the specific overloads that were selected.
|
|
DenseHashMap<const AstNode*, TypeId> astOverloadResolvedTypes{nullptr};
|
|
|
|
// Only used with for...in loops. The computed type of the next() function
|
|
// is kept here for type checking.
|
|
DenseHashMap<const AstNode*, TypeId> astForInNextTypes{nullptr};
|
|
|
|
DenseHashMap<const AstType*, TypeId> astResolvedTypes{nullptr};
|
|
DenseHashMap<const AstTypePack*, TypePackId> astResolvedTypePacks{nullptr};
|
|
|
|
DenseHashMap<TypeId, std::vector<std::pair<Location, TypeId>>> upperBoundContributors{nullptr};
|
|
|
|
// Map AST nodes to the scope they create. Cannot be NotNull<Scope> because
|
|
// we need a sentinel value for the map.
|
|
DenseHashMap<const AstNode*, Scope*> astScopes{nullptr};
|
|
|
|
std::unordered_map<Name, TypeId> declaredGlobals;
|
|
ErrorVec errors;
|
|
LintResult lintResult;
|
|
Mode mode;
|
|
SourceCode::Type type;
|
|
double checkDurationSec = 0.0;
|
|
bool timeout = false;
|
|
bool cancelled = false;
|
|
|
|
TypePackId returnType = nullptr;
|
|
std::unordered_map<Name, TypeFun> exportedTypeBindings;
|
|
|
|
bool hasModuleScope() const;
|
|
ScopePtr getModuleScope() const;
|
|
|
|
// Once a module has been typechecked, we clone its public interface into a
|
|
// separate arena. This helps us to force Type ownership into a DAG rather
|
|
// than a DCG.
|
|
void clonePublicInterface(NotNull<BuiltinTypes> builtinTypes, InternalErrorReporter& ice);
|
|
};
|
|
|
|
} // namespace Luau
|