126 lines
2.9 KiB
Julia
126 lines
2.9 KiB
Julia
# This file is a part of Julia. License is MIT: https://julialang.org/license
|
|
|
|
using Base.Test
|
|
|
|
"""
|
|
Helper to walk the AST and call a function on every node.
|
|
"""
|
|
function walk(func, expr)
|
|
func(expr)
|
|
if isa(expr, Expr)
|
|
func(expr.head)
|
|
for o in expr.args
|
|
walk(func, o)
|
|
end
|
|
end
|
|
end
|
|
|
|
"""
|
|
Helper to test that every slot is in range after inlining.
|
|
"""
|
|
function test_inlined_symbols(func, argtypes)
|
|
src, rettype = code_typed(func, argtypes)[1]
|
|
nl = length(src.slottypes)
|
|
ast = Expr(:body)
|
|
ast.args = src.code
|
|
ast.typ = rettype
|
|
walk(ast) do e
|
|
if isa(e, Slot)
|
|
@test 1 <= e.id <= nl
|
|
end
|
|
if isa(e, NewvarNode)
|
|
@test 1 <= e.slot.id <= nl
|
|
end
|
|
end
|
|
end
|
|
|
|
# Test case 1:
|
|
# Make sure that all symbols are properly escaped after inlining
|
|
# https://github.com/JuliaLang/julia/issues/12620
|
|
@inline function test_inner(count)
|
|
x = 1
|
|
i = 0
|
|
while i <= count
|
|
y = x
|
|
x = x + y
|
|
i += 1
|
|
end
|
|
end
|
|
function test_outer(a)
|
|
test_inner(a)
|
|
end
|
|
test_inlined_symbols(test_outer, Tuple{Int64})
|
|
|
|
# Test case 2:
|
|
# Make sure that an error is thrown for the undeclared
|
|
# y in the else branch.
|
|
# https://github.com/JuliaLang/julia/issues/12620
|
|
@inline function foo_inl(x)
|
|
if x
|
|
y = 2
|
|
else
|
|
return y
|
|
end
|
|
end
|
|
function bar12620()
|
|
for i = 1:3
|
|
foo_inl(i==1)
|
|
end
|
|
end
|
|
@test_throws UndefVarError bar12620()
|
|
|
|
# issue #16165
|
|
@inline f16165(x) = (x = UInt(x) + 1)
|
|
g16165(x) = f16165(x)
|
|
@test g16165(1) === (UInt(1) + 1)
|
|
|
|
# issue #18948
|
|
f18948() = (local bar::Int64; bar=1.5)
|
|
g18948() = (local bar::Int32; bar=0x80000000)
|
|
@test_throws InexactError f18948()
|
|
@test_throws InexactError g18948()
|
|
|
|
# issue #21074
|
|
struct s21074
|
|
x::Tuple{Int, Int}
|
|
end
|
|
@inline Base.getindex(v::s21074, i::Integer) = v.x[i]
|
|
@eval f21074() = $(s21074((1,2))).x[1]
|
|
let (src, _) = code_typed(f21074, ())[1]
|
|
@test src.code[end] == Expr(:return, 1)
|
|
end
|
|
@eval g21074() = $(s21074((1,2)))[1]
|
|
let (src, _) = code_typed(g21074, ())[1]
|
|
@test src.code[end] == Expr(:return, 1)
|
|
end
|
|
|
|
# issue #21311
|
|
counter21311 = Ref(0)
|
|
@noinline function update21311!(x)
|
|
counter21311[] += 1
|
|
x[] = counter21311[]
|
|
return x
|
|
end
|
|
@noinline map21311(t::Tuple{Any}) = (update21311!(t[1]),)
|
|
@inline map21311(t::Tuple) = (update21311!(t[1]), map21311(Base.tail(t))...)
|
|
function read21311()
|
|
xs = Ref(1), Ref(1)
|
|
map21311(xs)
|
|
return xs[1]
|
|
end
|
|
let a = read21311()
|
|
@test a[] == 1
|
|
end
|
|
|
|
@testset "issue #19122: [no]inline of short func. def. with return type annotation" begin
|
|
exf19122 = macroexpand(:(@inline f19122()::Bool = true))
|
|
exg19122 = macroexpand(:(@noinline g19122()::Bool = true))
|
|
@test exf19122.args[2].args[1].args[1] == :inline
|
|
@test exg19122.args[2].args[1].args[1] == :noinline
|
|
|
|
@inline f19122()::Bool = true
|
|
@noinline g19122()::Bool = true
|
|
@test f19122()
|
|
@test g19122()
|
|
end
|