From 54e01eb7e0ea74c01a797f56e2bf602c298a9769 Mon Sep 17 00:00:00 2001
From: Ben Blum <bblum@andrew.cmu.edu>
Date: Mon, 1 Jul 2013 18:05:46 -0400
Subject: [PATCH] Add a run-pass test for recursive copyable stack closures.

---
 .../closure-bounds-recursive-stack-closure.rs | 31 +++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 src/test/run-pass/closure-bounds-recursive-stack-closure.rs

diff --git a/src/test/run-pass/closure-bounds-recursive-stack-closure.rs b/src/test/run-pass/closure-bounds-recursive-stack-closure.rs
new file mode 100644
index 000000000000..8bb57ebaaf58
--- /dev/null
+++ b/src/test/run-pass/closure-bounds-recursive-stack-closure.rs
@@ -0,0 +1,31 @@
+// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
+// file at the top-level directory of this distribution and at
+// http://rust-lang.org/COPYRIGHT.
+//
+// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
+// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// option. This file may not be copied, modified, or distributed
+// except according to those terms.
+
+// Ensures that it's legal to create a recursive stack closure as long as
+// its environment is copyable
+
+struct R<'self> {
+    // This struct is needed to create the
+    // otherwise infinite type of a fn that
+    // accepts itself as argument:
+    c: &'self fn:Copy(&R, uint) -> uint
+}
+
+fn main() {
+    // Stupid version of fibonacci.
+    let fib: &fn:Copy(&R, uint) -> uint = |fib, x| {
+        if x == 0 || x == 1 {
+            x
+        } else {
+            (fib.c)(fib, x-1) + (fib.c)(fib, x-2)
+        }
+    };
+    assert!(fib(&R { c: fib }, 7) == 13);
+}