inline.jl
# This file is a part of Julia. License is MIT: http://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[1] == Expr(:return, 1)
end
@eval g21074() = $(s21074((1,2)))[1]
let (src, _) = code_typed(g21074, ())[1]
@test src.code[1] == Expr(:return, 1)
end