2015-02-09 22:48:05 +01:00
|
|
|
; RUN: opt %s -S -place-safepoints | FileCheck %s
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
; Do we insert a simple entry safepoint?
|
2015-02-09 22:50:31 +01:00
|
|
|
define void @test_entry() gc "statepoint-example" {
|
2015-02-09 22:48:05 +01:00
|
|
|
; CHECK-LABEL: @test_entry
|
|
|
|
|
entry:
|
|
|
|
|
; CHECK-LABEL: entry
|
|
|
|
|
; CHECK: statepoint
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-21 01:09:09 +01:00
|
|
|
; On a non-gc function, we should NOT get an entry safepoint
|
|
|
|
|
define void @test_negative() {
|
|
|
|
|
; CHECK-LABEL: @test_negative
|
|
|
|
|
entry:
|
|
|
|
|
; CHECK-NOT: statepoint
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-09 22:48:05 +01:00
|
|
|
; Do we insert a backedge safepoint in a statically
|
|
|
|
|
; infinite loop?
|
2015-02-09 22:50:31 +01:00
|
|
|
define void @test_backedge() gc "statepoint-example" {
|
2015-02-09 22:48:05 +01:00
|
|
|
; CHECK-LABEL: test_backedge
|
|
|
|
|
entry:
|
|
|
|
|
; CHECK-LABEL: entry
|
|
|
|
|
; This statepoint is technically not required, but we don't exploit that yet.
|
|
|
|
|
; CHECK: statepoint
|
|
|
|
|
br label %other
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: other
|
|
|
|
|
; CHECK: statepoint
|
|
|
|
|
other:
|
|
|
|
|
call void undef()
|
|
|
|
|
br label %other
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Check that we remove an unreachable block rather than trying
|
|
|
|
|
; to insert a backedge safepoint
|
2015-02-09 22:50:31 +01:00
|
|
|
define void @test_unreachable() gc "statepoint-example" {
|
2015-02-09 22:48:05 +01:00
|
|
|
; CHECK-LABEL: test_unreachable
|
|
|
|
|
entry:
|
|
|
|
|
; CHECK-LABEL: entry
|
|
|
|
|
; CHECK: statepoint
|
|
|
|
|
ret void
|
|
|
|
|
|
|
|
|
|
; CHECK-NOT: other
|
|
|
|
|
; CHECK-NOT: statepoint
|
|
|
|
|
other:
|
|
|
|
|
br label %other
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
declare void @foo()
|
|
|
|
|
|
|
|
|
|
; Do we turn a call into it's own statepoint
|
2015-02-09 22:50:31 +01:00
|
|
|
define void @test_simple_call() gc "statepoint-example" {
|
2015-02-09 22:48:05 +01:00
|
|
|
; CHECK-LABEL: test_simple_call
|
|
|
|
|
entry:
|
|
|
|
|
br label %other
|
|
|
|
|
other:
|
|
|
|
|
; CHECK-LABEL: other
|
2015-02-10 00:00:40 +01:00
|
|
|
; CHECK: statepoint
|
|
|
|
|
; CHECK-NOT: gc.result
|
2015-02-09 22:48:05 +01:00
|
|
|
call void @foo()
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-10 00:00:40 +01:00
|
|
|
declare zeroext i1 @i1_return_i1(i1)
|
|
|
|
|
|
|
|
|
|
define i1 @test_call_with_result() gc "statepoint-example" {
|
|
|
|
|
; CHECK-LABEL: test_call_with_result
|
|
|
|
|
; This is checking that a statepoint_poll + statepoint + result is
|
|
|
|
|
; inserted for a function that takes 1 argument.
|
|
|
|
|
; CHECK: gc.statepoint.p0f_isVoidf
|
|
|
|
|
; CHECK: gc.statepoint.p0f_i1i1f
|
Extend the statepoint intrinsic to allow statepoints to be marked as transitions from GC-aware code to code that is not GC-aware.
This changes the shape of the statepoint intrinsic from:
@llvm.experimental.gc.statepoint(anyptr target, i32 # call args, i32 unused, ...call args, i32 # deopt args, ...deopt args, ...gc args)
to:
@llvm.experimental.gc.statepoint(anyptr target, i32 # call args, i32 flags, ...call args, i32 # transition args, ...transition args, i32 # deopt args, ...deopt args, ...gc args)
This extension offers the backend the opportunity to insert (somewhat) arbitrary code to manage the transition from GC-aware code to code that is not GC-aware and back.
In order to support the injection of transition code, this extension wraps the STATEPOINT ISD node generated by the usual lowering lowering with two additional nodes: GC_TRANSITION_START and GC_TRANSITION_END. The transition arguments that were passed passed to the intrinsic (if any) are lowered and provided as operands to these nodes and may be used by the backend during code generation.
Eventually, the lowering of the GC_TRANSITION_{START,END} nodes should be informed by the GC strategy in use for the function containing the intrinsic call; for now, these nodes are instead replaced with no-ops.
Differential Revision: http://reviews.llvm.org/D9501
llvm-svn: 236888
2015-05-08 20:07:42 +02:00
|
|
|
; CHECK: (i1 (i1)* @i1_return_i1, i32 1, i32 0, i1 false, i32 0, i32 0)
|
2015-05-12 18:47:30 +02:00
|
|
|
; CHECK: %call1.2 = call i1 @llvm.experimental.gc.result.i1
|
2015-02-10 00:00:40 +01:00
|
|
|
entry:
|
[opaque pointer type] Add textual IR support for explicit type parameter to the call instruction
See r230786 and r230794 for similar changes to gep and load
respectively.
Call is a bit different because it often doesn't have a single explicit
type - usually the type is deduced from the arguments, and just the
return type is explicit. In those cases there's no need to change the
IR.
When that's not the case, the IR usually contains the pointer type of
the first operand - but since typed pointers are going away, that
representation is insufficient so I'm just stripping the "pointerness"
of the explicit type away.
This does make the IR a bit weird - it /sort of/ reads like the type of
the first operand: "call void () %x(" but %x is actually of type "void
()*" and will eventually be just of type "ptr". But this seems not too
bad and I don't think it would benefit from repeating the type
("void (), void () * %x(" and then eventually "void (), ptr %x(") as has
been done with gep and load.
This also has a side benefit: since the explicit type is no longer a
pointer, there's no ambiguity between an explicit type and a function
that returns a function pointer. Previously this case needed an explicit
type (eg: a function returning a void() function was written as
"call void () () * @x(" rather than "call void () * @x(" because of the
ambiguity between a function returning a pointer to a void() function
and a function returning void).
No ambiguity means even function pointer return types can just be
written alone, without writing the whole function's type.
This leaves /only/ the varargs case where the explicit type is required.
Given the special type syntax in call instructions, the regex-fu used
for migration was a bit more involved in its own unique way (as every
one of these is) so here it is. Use it in conjunction with the apply.sh
script and associated find/xargs commands I've provided in rr230786 to
migrate your out of tree tests. Do let me know if any of this doesn't
cover your cases & we can iterate on a more general script/regexes to
help others with out of tree tests.
About 9 test cases couldn't be automatically migrated - half of those
were functions returning function pointers, where I just had to manually
delete the function argument types now that we didn't need an explicit
function type there. The other half were typedefs of function types used
in calls - just had to manually drop the * from those.
import fileinput
import sys
import re
pat = re.compile(r'((?:=|:|^|\s)call\s(?:[^@]*?))(\s*$|\s*(?:(?:\[\[[a-zA-Z0-9_]+\]\]|[@%](?:(")?[\\\?@a-zA-Z0-9_.]*?(?(3)"|)|{{.*}}))(?:\(|$)|undef|inttoptr|bitcast|null|asm).*$)')
addrspace_end = re.compile(r"addrspace\(\d+\)\s*\*$")
func_end = re.compile("(?:void.*|\)\s*)\*$")
def conv(match, line):
if not match or re.search(addrspace_end, match.group(1)) or not re.search(func_end, match.group(1)):
return line
return line[:match.start()] + match.group(1)[:match.group(1).rfind('*')].rstrip() + match.group(2) + line[match.end():]
for line in sys.stdin:
sys.stdout.write(conv(re.search(pat, line), line))
llvm-svn: 235145
2015-04-17 01:24:18 +02:00
|
|
|
%call1 = tail call i1 (i1) @i1_return_i1(i1 false)
|
2015-02-10 00:00:40 +01:00
|
|
|
ret i1 %call1
|
|
|
|
|
}
|
2015-02-09 22:48:05 +01:00
|
|
|
|
|
|
|
|
; This function is inlined when inserting a poll. To avoid recursive
|
|
|
|
|
; issues, make sure we don't place safepoints in it.
|
|
|
|
|
declare void @do_safepoint()
|
|
|
|
|
define void @gc.safepoint_poll() {
|
|
|
|
|
; CHECK-LABEL: gc.safepoint_poll
|
|
|
|
|
; CHECK-LABEL: entry
|
|
|
|
|
; CHECK-NEXT: do_safepoint
|
|
|
|
|
; CHECK-NEXT: ret void
|
|
|
|
|
entry:
|
|
|
|
|
call void @do_safepoint()
|
|
|
|
|
ret void
|
|
|
|
|
}
|
