mirror of
https://github.com/luau-lang/luau.git
synced 2025-01-07 11:59:11 +00:00
ae459a0197
# What's Changed * Add a compiler hint to improve Luau memory allocation inlining ### New Type Solver * Added a system for recommending explicit type annotations to users in cases where we've inferred complex generic types with type families. * Marked string library functions as `@checked` for use in new non-strict mode. * Fixed a bug with new non-strict mode where we would incorrectly report arity mismatches when missing optional arguments. * Implement an occurs check for unifications that would produce self-recursive types. * Fix bug where overload resolution would fail when applied to non-overloaded functions. * Fix bug that caused the subtyping to report an error whenever a generic was instantiated in an invariant context. * Fix crash caused by `SetPropConstraint` not blocking properly. ### Native Code Generation * Implement optimization to eliminate dead stores * Optimize vector ops for X64 when the source is computed (thanks, @zeux!) * Use more efficient lowering for UNM_* (thanks, @zeux!) --- ### 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: David Cope <dcope@roblox.com> Co-authored-by: Lily Brown <lbrown@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> --------- Co-authored-by: Alexander McCord <amccord@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Vighnesh <vvijay@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: David Cope <dcope@roblox.com> Co-authored-by: Lily Brown <lbrown@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com>
232 lines
5.4 KiB
C++
232 lines
5.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/Scope.h"
|
|
|
|
LUAU_FASTFLAG(DebugLuauDeferredConstraintResolution);
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
Scope::Scope(TypePackId returnType)
|
|
: parent(nullptr)
|
|
, returnType(returnType)
|
|
, level(TypeLevel())
|
|
{
|
|
}
|
|
|
|
Scope::Scope(const ScopePtr& parent, int subLevel)
|
|
: parent(parent)
|
|
, returnType(parent->returnType)
|
|
, level(parent->level.incr())
|
|
{
|
|
level = level.incr();
|
|
level.subLevel = subLevel;
|
|
}
|
|
|
|
void Scope::addBuiltinTypeBinding(const Name& name, const TypeFun& tyFun)
|
|
{
|
|
exportedTypeBindings[name] = tyFun;
|
|
builtinTypeNames.insert(name);
|
|
}
|
|
|
|
std::optional<TypeId> Scope::lookup(Symbol sym) const
|
|
{
|
|
auto r = const_cast<Scope*>(this)->lookupEx(sym);
|
|
if (r)
|
|
return r->first->typeId;
|
|
else
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<std::pair<TypeId, Scope*>> Scope::lookupEx(DefId def)
|
|
{
|
|
Scope* s = this;
|
|
|
|
while (true)
|
|
{
|
|
if (TypeId* it = s->lvalueTypes.find(def))
|
|
return std::pair{*it, s};
|
|
else if (TypeId* it = s->rvalueRefinements.find(def))
|
|
return std::pair{*it, s};
|
|
|
|
if (s->parent)
|
|
s = s->parent.get();
|
|
else
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
|
|
std::optional<std::pair<Binding*, Scope*>> Scope::lookupEx(Symbol sym)
|
|
{
|
|
Scope* s = this;
|
|
|
|
while (true)
|
|
{
|
|
auto it = s->bindings.find(sym);
|
|
if (it != s->bindings.end())
|
|
return std::pair{&it->second, s};
|
|
|
|
if (s->parent)
|
|
s = s->parent.get();
|
|
else
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
|
|
std::optional<TypeId> Scope::lookupUnrefinedType(DefId def) const
|
|
{
|
|
for (const Scope* current = this; current; current = current->parent.get())
|
|
{
|
|
if (auto ty = current->lvalueTypes.find(def))
|
|
return *ty;
|
|
}
|
|
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<TypeId> Scope::lookup(DefId def) const
|
|
{
|
|
for (const Scope* current = this; current; current = current->parent.get())
|
|
{
|
|
if (auto ty = current->rvalueRefinements.find(def))
|
|
return *ty;
|
|
if (auto ty = current->lvalueTypes.find(def))
|
|
return *ty;
|
|
}
|
|
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<TypeFun> Scope::lookupType(const Name& name) const
|
|
{
|
|
const Scope* scope = this;
|
|
while (true)
|
|
{
|
|
auto it = scope->exportedTypeBindings.find(name);
|
|
if (it != scope->exportedTypeBindings.end())
|
|
return it->second;
|
|
|
|
it = scope->privateTypeBindings.find(name);
|
|
if (it != scope->privateTypeBindings.end())
|
|
return it->second;
|
|
|
|
if (scope->parent)
|
|
scope = scope->parent.get();
|
|
else
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
|
|
std::optional<TypeFun> Scope::lookupImportedType(const Name& moduleAlias, const Name& name) const
|
|
{
|
|
const Scope* scope = this;
|
|
while (scope)
|
|
{
|
|
auto it = scope->importedTypeBindings.find(moduleAlias);
|
|
if (it == scope->importedTypeBindings.end())
|
|
{
|
|
scope = scope->parent.get();
|
|
continue;
|
|
}
|
|
|
|
auto it2 = it->second.find(name);
|
|
if (it2 == it->second.end())
|
|
{
|
|
scope = scope->parent.get();
|
|
continue;
|
|
}
|
|
|
|
return it2->second;
|
|
}
|
|
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<TypePackId> Scope::lookupPack(const Name& name) const
|
|
{
|
|
const Scope* scope = this;
|
|
while (true)
|
|
{
|
|
auto it = scope->privateTypePackBindings.find(name);
|
|
if (it != scope->privateTypePackBindings.end())
|
|
return it->second;
|
|
|
|
if (scope->parent)
|
|
scope = scope->parent.get();
|
|
else
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
|
|
std::optional<Binding> Scope::linearSearchForBinding(const std::string& name, bool traverseScopeChain) const
|
|
{
|
|
const Scope* scope = this;
|
|
|
|
while (scope)
|
|
{
|
|
for (const auto& [n, binding] : scope->bindings)
|
|
{
|
|
if (n.local && n.local->name == name.c_str())
|
|
return binding;
|
|
else if (n.global.value && n.global == name.c_str())
|
|
return binding;
|
|
}
|
|
|
|
scope = scope->parent.get();
|
|
|
|
if (!traverseScopeChain)
|
|
break;
|
|
}
|
|
|
|
return std::nullopt;
|
|
}
|
|
|
|
// Updates the `this` scope with the assignments from the `childScope` including ones that doesn't exist in `this`.
|
|
void Scope::inheritAssignments(const ScopePtr& childScope)
|
|
{
|
|
if (!FFlag::DebugLuauDeferredConstraintResolution)
|
|
return;
|
|
|
|
for (const auto& [k, a] : childScope->lvalueTypes)
|
|
lvalueTypes[k] = a;
|
|
}
|
|
|
|
// Updates the `this` scope with the refinements from the `childScope` excluding ones that doesn't exist in `this`.
|
|
void Scope::inheritRefinements(const ScopePtr& childScope)
|
|
{
|
|
if (FFlag::DebugLuauDeferredConstraintResolution)
|
|
{
|
|
for (const auto& [k, a] : childScope->rvalueRefinements)
|
|
{
|
|
if (lookup(NotNull{k}))
|
|
rvalueRefinements[k] = a;
|
|
}
|
|
}
|
|
|
|
for (const auto& [k, a] : childScope->refinements)
|
|
{
|
|
Symbol symbol = getBaseSymbol(k);
|
|
if (lookup(symbol))
|
|
refinements[k] = a;
|
|
}
|
|
}
|
|
|
|
bool subsumesStrict(Scope* left, Scope* right)
|
|
{
|
|
while (right)
|
|
{
|
|
if (right->parent.get() == left)
|
|
return true;
|
|
|
|
right = right->parent.get();
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
bool subsumes(Scope* left, Scope* right)
|
|
{
|
|
return left == right || subsumesStrict(left, right);
|
|
}
|
|
|
|
} // namespace Luau
|