mirror of
https://github.com/luau-lang/luau.git
synced 2025-03-04 03:01:41 +00:00

Some checks failed
benchmark / callgrind (map[branch:main name:luau-lang/benchmark-data], ubuntu-22.04) (push) Has been cancelled
build / macos (push) Has been cancelled
build / macos-arm (push) Has been cancelled
build / ubuntu (push) Has been cancelled
build / windows (Win32) (push) Has been cancelled
build / windows (x64) (push) Has been cancelled
build / coverage (push) Has been cancelled
build / web (push) Has been cancelled
release / macos (push) Has been cancelled
release / ubuntu (push) Has been cancelled
release / windows (push) Has been cancelled
release / web (push) Has been cancelled
## What's Changed ### General - Allow types of tables to diverge after using `table.clone` (fixes #1617). - Allow 2-argument vector.create in Luau. - Fix a crash when suggesting autocomplete after encountering parsing errors. - Add lua_tolstringatom C API which returns the string length (whether or not the atom exists) and which extends the existing lua_tostringatom function the same way lua_tolstring/lua_tostring do. - Luau now retains the DFGs of typechecked modules. ### Magic Functions Migration Note We've made a change to the API used to define magic functions. Previously, we had a set of function pointers on each `FunctionType` that would be invoked by the type inference engine at the correct point. The problem we'd run into is that they were all `std::function`s, we'd grown quite a few of them, and Luau allocates tens of thousands of types as it performs type inference. This adds up to a large amount of memory for data that isn't used by 99% of types. To slim things down a bit, we've replaced all of those `std::function`s with a single `shared_ptr` to a new interface called `MagicFunction`. This slims down the memory footprint of each type by about 50 bytes. The virtual methods of `MagicFunction` have roughly 1:1 correspondence with the old interface, so updating things should not be too difficult: * `FunctionType::magicFunction` is now `MagicFunction::handleOldSolver` * `FunctionType::dcrMagicFunction` is now `MagicFunction::infer` * `FunctionType::dcrMagicRefinement` is now `MagicFunction::refine` * `FunctionType::dcrMagicTypeCheck` is now `MagicFunction::typeCheck` **Full Changelog**: https://github.com/luau-lang/luau/compare/0.657...0.658 --- Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Ariel Weiss <aaronweiss@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Talha Pathan <tpathan@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>
228 lines
7.6 KiB
C++
228 lines
7.6 KiB
C++
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
#pragma once
|
|
|
|
// Do not include LValue. It should never be used here.
|
|
#include "Luau/Ast.h"
|
|
#include "Luau/ControlFlow.h"
|
|
#include "Luau/DenseHash.h"
|
|
#include "Luau/Def.h"
|
|
#include "Luau/NotNull.h"
|
|
#include "Luau/Symbol.h"
|
|
#include "Luau/TypedAllocator.h"
|
|
|
|
#include <unordered_map>
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
struct RefinementKey
|
|
{
|
|
const RefinementKey* parent = nullptr;
|
|
DefId def;
|
|
std::optional<std::string> propName;
|
|
};
|
|
|
|
struct RefinementKeyArena
|
|
{
|
|
TypedAllocator<RefinementKey> allocator;
|
|
|
|
const RefinementKey* leaf(DefId def);
|
|
const RefinementKey* node(const RefinementKey* parent, DefId def, const std::string& propName);
|
|
};
|
|
|
|
struct DataFlowGraph
|
|
{
|
|
DataFlowGraph(DataFlowGraph&&) = default;
|
|
DataFlowGraph& operator=(DataFlowGraph&&) = default;
|
|
|
|
DefId getDef(const AstExpr* expr) const;
|
|
// Look up the definition optionally, knowing it may not be present.
|
|
std::optional<DefId> getDefOptional(const AstExpr* expr) const;
|
|
// Look up for the rvalue def for a compound assignment.
|
|
std::optional<DefId> getRValueDefForCompoundAssign(const AstExpr* expr) const;
|
|
|
|
DefId getDef(const AstLocal* local) const;
|
|
|
|
DefId getDef(const AstStatDeclareGlobal* global) const;
|
|
DefId getDef(const AstStatDeclareFunction* func) const;
|
|
|
|
const RefinementKey* getRefinementKey(const AstExpr* expr) const;
|
|
|
|
private:
|
|
DataFlowGraph(NotNull<DefArena> defArena, NotNull<RefinementKeyArena> keyArena);
|
|
|
|
DataFlowGraph(const DataFlowGraph&) = delete;
|
|
DataFlowGraph& operator=(const DataFlowGraph&) = delete;
|
|
|
|
NotNull<DefArena> defArena;
|
|
NotNull<RefinementKeyArena> keyArena;
|
|
|
|
DenseHashMap<const AstExpr*, const Def*> astDefs{nullptr};
|
|
|
|
// Sometimes we don't have the AstExprLocal* but we have AstLocal*, and sometimes we need to extract that DefId.
|
|
DenseHashMap<const AstLocal*, const Def*> localDefs{nullptr};
|
|
|
|
// There's no AstStatDeclaration, and it feels useless to introduce it just to enforce an invariant in one place.
|
|
// All keys in this maps are really only statements that ambiently declares a symbol.
|
|
DenseHashMap<const AstStat*, const Def*> declaredDefs{nullptr};
|
|
|
|
// Compound assignments are in a weird situation where the local being assigned to is also being used at its
|
|
// previous type implicitly in an rvalue position. This map provides the previous binding.
|
|
DenseHashMap<const AstExpr*, const Def*> compoundAssignDefs{nullptr};
|
|
|
|
DenseHashMap<const AstExpr*, const RefinementKey*> astRefinementKeys{nullptr};
|
|
friend struct DataFlowGraphBuilder;
|
|
};
|
|
|
|
struct DfgScope
|
|
{
|
|
enum ScopeType
|
|
{
|
|
Linear,
|
|
Loop,
|
|
Function,
|
|
};
|
|
|
|
DfgScope* parent;
|
|
ScopeType scopeType;
|
|
|
|
using Bindings = DenseHashMap<Symbol, const Def*>;
|
|
using Props = DenseHashMap<const Def*, std::unordered_map<std::string, const Def*>>;
|
|
|
|
Bindings bindings{Symbol{}};
|
|
Props props{nullptr};
|
|
|
|
std::optional<DefId> lookup(Symbol symbol) const;
|
|
std::optional<DefId> lookup(DefId def, const std::string& key) const;
|
|
|
|
void inherit(const DfgScope* childScope);
|
|
|
|
bool canUpdateDefinition(Symbol symbol) const;
|
|
bool canUpdateDefinition(DefId def, const std::string& key) const;
|
|
};
|
|
|
|
struct DataFlowResult
|
|
{
|
|
DefId def;
|
|
const RefinementKey* parent = nullptr;
|
|
};
|
|
|
|
using ScopeStack = std::vector<DfgScope*>;
|
|
|
|
struct DataFlowGraphBuilder
|
|
{
|
|
static DataFlowGraph build(
|
|
AstStatBlock* block,
|
|
NotNull<DefArena> defArena,
|
|
NotNull<RefinementKeyArena> keyArena,
|
|
NotNull<struct InternalErrorReporter> handle
|
|
);
|
|
|
|
private:
|
|
DataFlowGraphBuilder(NotNull<DefArena> defArena, NotNull<RefinementKeyArena> keyArena);
|
|
|
|
DataFlowGraphBuilder(const DataFlowGraphBuilder&) = delete;
|
|
DataFlowGraphBuilder& operator=(const DataFlowGraphBuilder&) = delete;
|
|
|
|
DataFlowGraph graph;
|
|
NotNull<DefArena> defArena;
|
|
NotNull<RefinementKeyArena> keyArena;
|
|
|
|
struct InternalErrorReporter* handle = nullptr;
|
|
|
|
/// The arena owning all of the scope allocations for the dataflow graph being built.
|
|
std::vector<std::unique_ptr<DfgScope>> scopes;
|
|
|
|
/// A stack of scopes used by the visitor to see where we are.
|
|
ScopeStack scopeStack;
|
|
|
|
DfgScope* currentScope();
|
|
|
|
struct FunctionCapture
|
|
{
|
|
std::vector<DefId> captureDefs;
|
|
std::vector<DefId> allVersions;
|
|
size_t versionOffset = 0;
|
|
};
|
|
|
|
DenseHashMap<Symbol, FunctionCapture> captures{Symbol{}};
|
|
void resolveCaptures();
|
|
|
|
DfgScope* makeChildScope(DfgScope::ScopeType scopeType = DfgScope::Linear);
|
|
|
|
void join(DfgScope* p, DfgScope* a, DfgScope* b);
|
|
void joinBindings(DfgScope* p, const DfgScope& a, const DfgScope& b);
|
|
void joinProps(DfgScope* p, const DfgScope& a, const DfgScope& b);
|
|
|
|
DefId lookup(Symbol symbol);
|
|
DefId lookup(DefId def, const std::string& key);
|
|
|
|
ControlFlow visit(AstStatBlock* b);
|
|
ControlFlow visitBlockWithoutChildScope(AstStatBlock* b);
|
|
|
|
ControlFlow visit(AstStat* s);
|
|
ControlFlow visit(AstStatIf* i);
|
|
ControlFlow visit(AstStatWhile* w);
|
|
ControlFlow visit(AstStatRepeat* r);
|
|
ControlFlow visit(AstStatBreak* b);
|
|
ControlFlow visit(AstStatContinue* c);
|
|
ControlFlow visit(AstStatReturn* r);
|
|
ControlFlow visit(AstStatExpr* e);
|
|
ControlFlow visit(AstStatLocal* l);
|
|
ControlFlow visit(AstStatFor* f);
|
|
ControlFlow visit(AstStatForIn* f);
|
|
ControlFlow visit(AstStatAssign* a);
|
|
ControlFlow visit(AstStatCompoundAssign* c);
|
|
ControlFlow visit(AstStatFunction* f);
|
|
ControlFlow visit(AstStatLocalFunction* l);
|
|
ControlFlow visit(AstStatTypeAlias* t);
|
|
ControlFlow visit(AstStatTypeFunction* f);
|
|
ControlFlow visit(AstStatDeclareGlobal* d);
|
|
ControlFlow visit(AstStatDeclareFunction* d);
|
|
ControlFlow visit(AstStatDeclareClass* d);
|
|
ControlFlow visit(AstStatError* error);
|
|
|
|
DataFlowResult visitExpr(AstExpr* e);
|
|
DataFlowResult visitExpr(AstExprGroup* group);
|
|
DataFlowResult visitExpr(AstExprLocal* l);
|
|
DataFlowResult visitExpr(AstExprGlobal* g);
|
|
DataFlowResult visitExpr(AstExprCall* c);
|
|
DataFlowResult visitExpr(AstExprIndexName* i);
|
|
DataFlowResult visitExpr(AstExprIndexExpr* i);
|
|
DataFlowResult visitExpr(AstExprFunction* f);
|
|
DataFlowResult visitExpr(AstExprTable* t);
|
|
DataFlowResult visitExpr(AstExprUnary* u);
|
|
DataFlowResult visitExpr(AstExprBinary* b);
|
|
DataFlowResult visitExpr(AstExprTypeAssertion* t);
|
|
DataFlowResult visitExpr(AstExprIfElse* i);
|
|
DataFlowResult visitExpr(AstExprInterpString* i);
|
|
DataFlowResult visitExpr(AstExprError* error);
|
|
|
|
void visitLValue(AstExpr* e, DefId incomingDef);
|
|
DefId visitLValue(AstExprLocal* l, DefId incomingDef);
|
|
DefId visitLValue(AstExprGlobal* g, DefId incomingDef);
|
|
DefId visitLValue(AstExprIndexName* i, DefId incomingDef);
|
|
DefId visitLValue(AstExprIndexExpr* i, DefId incomingDef);
|
|
DefId visitLValue(AstExprError* e, DefId incomingDef);
|
|
|
|
void visitType(AstType* t);
|
|
void visitType(AstTypeReference* r);
|
|
void visitType(AstTypeTable* t);
|
|
void visitType(AstTypeFunction* f);
|
|
void visitType(AstTypeTypeof* t);
|
|
void visitType(AstTypeUnion* u);
|
|
void visitType(AstTypeIntersection* i);
|
|
void visitType(AstTypeError* error);
|
|
|
|
void visitTypePack(AstTypePack* p);
|
|
void visitTypePack(AstTypePackExplicit* e);
|
|
void visitTypePack(AstTypePackVariadic* v);
|
|
void visitTypePack(AstTypePackGeneric* g);
|
|
|
|
void visitTypeList(AstTypeList l);
|
|
|
|
void visitGenerics(AstArray<AstGenericType> g);
|
|
void visitGenericPacks(AstArray<AstGenericTypePack> g);
|
|
};
|
|
|
|
} // namespace Luau
|