static cl::opt<bool> SplitBackedge("spp-split-backedge", cl::Hidden,
cl::init(false));
+// If true, don't wrap calls (the ones present in the IR, and the ones
+// introduced due to polls) in gc.statepoint.
+static cl::opt<bool> NoStatepoints("spp-no-statepoints", cl::Hidden,
+ cl::init(false));
+
// Print tracing output
static cl::opt<bool> TraceLSP("spp-trace", cl::Hidden, cl::init(false));
ParsePointNeeded.insert(ParsePointNeeded.end(), RuntimeCalls.begin(),
RuntimeCalls.end());
}
+
+ // If we've been asked to not wrap the calls with gc.statepoint, then we're
+ // done. In the near future, this option will be "constant folded" to true,
+ // and the code below that deals with insert gc.statepoint calls will be
+ // removed. Wrapping potentially safepointing calls in gc.statepoint will
+ // then become the responsibility of the RewriteStatepointsForGC pass.
+ if (NoStatepoints)
+ return modified;
+
PollsNeeded.clear(); // make sure we don't accidentally use
// The dominator tree has been invalidated by the inlining performed in the
// above loop. TODO: Teach the inliner how to update the dom tree?
--- /dev/null
+; RUN: opt -spp-no-statepoints -S -place-safepoints < %s | FileCheck %s
+
+define void @test() gc "statepoint-example" {
+; CHECK-LABEL: test(
+entry:
+; CHECK: entry:
+; CHECK: call void @do_safepoint()
+ br label %other
+
+other:
+; CHECK: other:
+ call void undef() "gc-leaf-function"
+; CHECK: call void @do_safepoint()
+ br label %other
+}
+
+declare void @do_safepoint()
+define void @gc.safepoint_poll() {
+ call void @do_safepoint()
+ ret void
+}