mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-13 13:30:40 +00:00
443903aa00
# What's changed? * Luau allocation scheme was changed to handle allocations in 513-1024 byte range internally without falling back to global allocator * coroutine/thread creation no longer requires any global allocations, making it up to 15% faster (vs libc malloc) * table construction for 17-32 keys or 33-64 array elements is up to 30% faster (vs libc malloc) ### New Type Solver * Cyclic unary negation type families are reduced to `number` when possible * Class types are skipped when searching for free types in unifier to improve performance * Fixed issues with table type inference when metatables are present * Improved inference of iteration loop types * Fixed an issue with bidirectional inference of method calls * Type simplification will now preserve error suppression markers ### Native Code Generation * Fixed TAG_VECTOR skip optimization to not break instruction use counts (broken optimization wasn't included in 614) * Fixed missing side-effect when optimizing generic loop preparation instruction --- ### Internal Contributors Co-authored-by: Aaron Weiss <aaronweiss@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Lily Brown <lbrown@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> --------- 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: 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>
130 lines
2.8 KiB
Lua
130 lines
2.8 KiB
Lua
-- @original: https://gist.github.com/Reselim/40d62b17d138cc74335a1b0709e19ce2
|
|
local Alphabet = {}
|
|
local Indexes = {}
|
|
|
|
-- A-Z
|
|
for Index = 65, 90 do
|
|
table.insert(Alphabet, Index)
|
|
end
|
|
|
|
-- a-z
|
|
for Index = 97, 122 do
|
|
table.insert(Alphabet, Index)
|
|
end
|
|
|
|
-- 0-9
|
|
for Index = 48, 57 do
|
|
table.insert(Alphabet, Index)
|
|
end
|
|
|
|
table.insert(Alphabet, 43) -- +
|
|
table.insert(Alphabet, 47) -- /
|
|
|
|
for Index, Character in ipairs(Alphabet) do
|
|
Indexes[Character] = Index
|
|
end
|
|
|
|
local Base64 = {}
|
|
|
|
local bit32_rshift = bit32.rshift
|
|
local bit32_lshift = bit32.lshift
|
|
local bit32_band = bit32.band
|
|
|
|
--[[**
|
|
Encodes a string in Base64.
|
|
@param [t:string] Input The input string to encode.
|
|
@returns [t:string] The string encoded in Base64.
|
|
**--]]
|
|
function Base64.Encode(Input)
|
|
local Output = {}
|
|
local Length = 0
|
|
|
|
for Index = 1, #Input, 3 do
|
|
local C1, C2, C3 = string.byte(Input, Index, Index + 2)
|
|
|
|
local A = bit32_rshift(C1, 2)
|
|
local B = bit32_lshift(bit32_band(C1, 3), 4) + bit32_rshift(C2 or 0, 4)
|
|
local C = bit32_lshift(bit32_band(C2 or 0, 15), 2) + bit32_rshift(C3 or 0, 6)
|
|
local D = bit32_band(C3 or 0, 63)
|
|
|
|
Length = Length + 1
|
|
Output[Length] = Alphabet[A + 1]
|
|
|
|
Length = Length + 1
|
|
Output[Length] = Alphabet[B + 1]
|
|
|
|
Length = Length + 1
|
|
Output[Length] = C2 and Alphabet[C + 1] or 61
|
|
|
|
Length = Length + 1
|
|
Output[Length] = C3 and Alphabet[D + 1] or 61
|
|
end
|
|
|
|
local NewOutput = {}
|
|
local NewLength = 0
|
|
local IndexAdd4096Sub1
|
|
|
|
for Index = 1, Length, 4096 do
|
|
NewLength = NewLength + 1
|
|
IndexAdd4096Sub1 = Index + 4096 - 1
|
|
|
|
NewOutput[NewLength] = string.char(
|
|
table.unpack(Output, Index, IndexAdd4096Sub1 > Length and Length or IndexAdd4096Sub1)
|
|
)
|
|
end
|
|
|
|
return table.concat(NewOutput)
|
|
end
|
|
|
|
--[[**
|
|
Decodes a string from Base64.
|
|
@param [t:string] Input The input string to decode.
|
|
@returns [t:string] The newly decoded string.
|
|
**--]]
|
|
function Base64.Decode(Input)
|
|
local Output = {}
|
|
local Length = 0
|
|
|
|
for Index = 1, #Input, 4 do
|
|
local C1, C2, C3, C4 = string.byte(Input, Index, Index + 3)
|
|
|
|
local I1 = Indexes[C1] - 1
|
|
local I2 = Indexes[C2] - 1
|
|
local I3 = (Indexes[C3] or 1) - 1
|
|
local I4 = (Indexes[C4] or 1) - 1
|
|
|
|
local A = bit32_lshift(I1, 2) + bit32_rshift(I2, 4)
|
|
local B = bit32_lshift(bit32_band(I2, 15), 4) + bit32_rshift(I3, 2)
|
|
local C = bit32_lshift(bit32_band(I3, 3), 6) + I4
|
|
|
|
Length = Length + 1
|
|
Output[Length] = A
|
|
|
|
if C3 ~= 61 then
|
|
Length = Length + 1
|
|
Output[Length] = B
|
|
end
|
|
|
|
if C4 ~= 61 then
|
|
Length = Length + 1
|
|
Output[Length] = C
|
|
end
|
|
end
|
|
|
|
local NewOutput = {}
|
|
local NewLength = 0
|
|
local IndexAdd4096Sub1
|
|
|
|
for Index = 1, Length, 4096 do
|
|
NewLength = NewLength + 1
|
|
IndexAdd4096Sub1 = Index + 4096 - 1
|
|
|
|
NewOutput[NewLength] = string.char(
|
|
table.unpack(Output, Index, IndexAdd4096Sub1 > Length and Length or IndexAdd4096Sub1)
|
|
)
|
|
end
|
|
|
|
return table.concat(NewOutput)
|
|
end
|
|
|
|
return Base64
|