# This file is a part of Julia. License is MIT: https://julialang.org/license
using 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.slotnames)
ast = Expr(:block)
ast.args = src.code
walk(ast) do e
if isa(e, Core.Slot)
@test 1 <= e.id <= nl
end
if isa(e, Core.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(:y) 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
# issue #29083
f29083(;μ,σ) = μ + σ*randn()
g29083() = f29083(μ=2.0,σ=0.1)
let c = code_typed(g29083, ())[1][1].code
# make sure no call to kwfunc remains
@test !any(e->(isa(e,Expr) && ((e.head === :invoke && e.args[1].def.name === :kwfunc) ||
(e.head === :foreigncall && e.args[1] === QuoteNode(:jl_get_keyword_sorter)))),
c)
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
@testset "issue #27403: getindex is inlined with Union{Int,Missing}" begin
function sum27403(X::AbstractArray)
s = zero(eltype(X)) + zero(eltype(X))
for x in X
if !ismissing(x)
s += x
end
end
s
end
(src, _) = code_typed(sum27403, Tuple{Vector{Int}})[1]
@test !any(x -> x isa Expr && x.head === :invoke, src.code)
end
# check that type.mutable can be fully eliminated
f_mutable_nothrow(s::String) = Val{typeof(s).mutable}
@test length(code_typed(f_mutable_nothrow, (String,))[1][1].code) == 1
# check that ifelse can be fully eliminated
function f_ifelse(x)
a = ifelse(true, false, true)
b = ifelse(a, true, false)
return b ? x + 1 : x
end
# 2 for now because the compiler leaves a GotoNode around
@test length(code_typed(f_ifelse, (String,))[1][1].code) <= 2