mirror of
https://github.com/luau-lang/luau.git
synced 2024-11-15 22:35:43 +08:00
62483d40f0
* 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
107 lines
3.1 KiB
C++
107 lines
3.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/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; // DataModel path if possible. Filename if not.
|
|
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);
|
|
|
|
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();
|
|
|
|
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};
|
|
|
|
DenseHashMap<const AstNode*, TypeId> astOriginalCallTypes{nullptr};
|
|
DenseHashMap<const AstNode*, TypeId> astOverloadResolvedTypes{nullptr};
|
|
|
|
DenseHashMap<const AstType*, TypeId> astResolvedTypes{nullptr};
|
|
DenseHashMap<const AstType*, TypeId> astOriginalResolvedTypes{nullptr};
|
|
DenseHashMap<const AstTypePack*, TypePackId> astResolvedTypePacks{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::unique_ptr<struct TypeReduction> reduction;
|
|
|
|
std::unordered_map<Name, TypeId> declaredGlobals;
|
|
ErrorVec errors;
|
|
Mode mode;
|
|
SourceCode::Type type;
|
|
bool timeout = 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
|