mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-13 21:40:43 +00:00
140e5a1495
* Fixed incorrect lexeme generated for string parts in the middle of an interpolated string (Fixes https://github.com/Roblox/luau/issues/744) * DeprecatedApi lint can report some issues without type inference information * Fixed performance of autocomplete requests when suggestions have large intersection types (Solves https://github.com/Roblox/luau/discussions/847) * Marked `table.getn`/`foreach`/`foreachi` as deprecated ([RFC: Deprecate table.getn/foreach/foreachi](https://github.com/Roblox/luau/blob/master/rfcs/deprecate-table-getn-foreach.md)) * With -O2 optimization level, we now optimize builtin calls based on known argument/return count. Note that this change can be observable if `getfenv/setfenv` is used to substitute a builtin, especially if arity is different. Fastcall heavy tests show a 1-2% improvement. * Luau can now be built with clang-cl (Fixes https://github.com/Roblox/luau/issues/736) We also made many improvements to our experimental components. For our new type solver: * Overhauled data flow analysis system, fixed issues with 'repeat' loops, global variables and type annotations * Type refinements now work on generic table indexing with a string literal * Type refinements will properly track potentially 'nil' values (like t[x] for a missing key) and their further refinements * Internal top table type is now isomorphic to `{}` which fixes issues when `typeof(v) == 'table'` type refinement is handled * References to non-existent types in type annotations no longer resolve to 'error' type like in old solver * Improved handling of class unions in property access expressions * Fixed default type packs * Unsealed tables can now have metatables * Restored expected types for function arguments And for native code generation: * Added min and max IR instructions mapping to vminsd/vmaxsd on x64 * We now speculatively extract direct execution fast-paths based on expected types of expressions which provides better optimization opportunities inside a single basic block * Translated existing math fastcalls to IR form to improve tag guard removal and constant propagation
78 lines
1.6 KiB
C++
78 lines
1.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
|
|
|
|
#include "Luau/NotNull.h"
|
|
#include "Luau/TypedAllocator.h"
|
|
#include "Luau/Variant.h"
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
using BreadcrumbId = NotNull<const struct Breadcrumb>;
|
|
|
|
struct Type;
|
|
using TypeId = const Type*;
|
|
|
|
struct Variadic;
|
|
struct Negation;
|
|
struct Conjunction;
|
|
struct Disjunction;
|
|
struct Equivalence;
|
|
struct Proposition;
|
|
using Refinement = Variant<Variadic, Negation, Conjunction, Disjunction, Equivalence, Proposition>;
|
|
using RefinementId = Refinement*; // Can and most likely is nullptr.
|
|
|
|
struct Variadic
|
|
{
|
|
std::vector<RefinementId> refinements;
|
|
};
|
|
|
|
struct Negation
|
|
{
|
|
RefinementId refinement;
|
|
};
|
|
|
|
struct Conjunction
|
|
{
|
|
RefinementId lhs;
|
|
RefinementId rhs;
|
|
};
|
|
|
|
struct Disjunction
|
|
{
|
|
RefinementId lhs;
|
|
RefinementId rhs;
|
|
};
|
|
|
|
struct Equivalence
|
|
{
|
|
RefinementId lhs;
|
|
RefinementId rhs;
|
|
};
|
|
|
|
struct Proposition
|
|
{
|
|
BreadcrumbId breadcrumb;
|
|
TypeId discriminantTy;
|
|
};
|
|
|
|
template<typename T>
|
|
const T* get(RefinementId refinement)
|
|
{
|
|
return get_if<T>(refinement);
|
|
}
|
|
|
|
struct RefinementArena
|
|
{
|
|
RefinementId variadic(const std::vector<RefinementId>& refis);
|
|
RefinementId negation(RefinementId refinement);
|
|
RefinementId conjunction(RefinementId lhs, RefinementId rhs);
|
|
RefinementId disjunction(RefinementId lhs, RefinementId rhs);
|
|
RefinementId equivalence(RefinementId lhs, RefinementId rhs);
|
|
RefinementId proposition(BreadcrumbId breadcrumb, TypeId discriminantTy);
|
|
|
|
private:
|
|
TypedAllocator<Refinement> allocator;
|
|
};
|
|
|
|
} // namespace Luau
|