Add two more CTFE stress tests

Author: RalfJung

collector/benchmarks/ctfe-stress-fields/Cargo.lock

@@ -0,0 +1,4 @@
+[package]
+name = "ctfe-stress"
+version = "0.1.0"
+authors = ["Ralf Jung <[email protected]>"]

collector/benchmarks/ctfe-stress-fields/Cargo.toml

@@ -0,0 +1,48 @@
+#![feature(const_fn, const_let)]
+#![allow(unused_must_use)]
+
+// Try to make CTFE actually do a lot of computation, without producing a big result.
+// And without support for loops.
+
+macro_rules! const_repeat {
+    // Base case: Use 16 at the end to avoid function calls at the leaves as much as possibele.
+    ([16] $e: expr, $T: ty) => {{
+        $e; $e; $e; $e;
+        $e; $e; $e; $e;
+        $e; $e; $e; $e;
+        $e; $e; $e; $e
+    }};
+    ([1] $e: expr, $T: ty) => {{
+        $e
+    }};
+    // Recursive case: Take a 16
+    ([16 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e(); e(); e();
+        e(); e(); e(); e();
+        e(); e(); e(); e();
+        e(); e(); e(); e()
+    }};
+    // Recursive case: Take a 8
+    ([8 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e(); e(); e();
+        e(); e(); e(); e()
+    }};
+    // Recursive case: Take a 4
+    ([4 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e(); e(); e()
+    }};
+    // Recursive case: Take a 2
+    ([2 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e()
+    }};
+}
+macro_rules! expensive_static {
+    ($name: ident : $T: ty = $e : expr) =>
+        (pub static $name : $T = const_repeat!([8 16 16 16 16 16] $e, $T);)
+}
+
+expensive_static!(FIELDS: &'static i32 = &("bar", 42, "foo", 3.14).1);

collector/benchmarks/ctfe-stress-fields/src/lib.rs

@@ -0,0 +1,4 @@
+[package]
+name = "ctfe-stress"
+version = "0.1.0"
+authors = ["Ralf Jung <[email protected]>"]

collector/benchmarks/ctfe-stress-unsize-trait/Cargo.lock

@@ -0,0 +1,51 @@
+#![feature(const_fn, const_let)]
+#![allow(unused_must_use)]
+
+// Try to make CTFE actually do a lot of computation, without producing a big result.
+// And without support for loops.
+
+macro_rules! const_repeat {
+    // Base case: Use 16 at the end to avoid function calls at the leaves as much as possibele.
+    ([16] $e: expr, $T: ty) => {{
+        $e; $e; $e; $e;
+        $e; $e; $e; $e;
+        $e; $e; $e; $e;
+        $e; $e; $e; $e
+    }};
+    ([1] $e: expr, $T: ty) => {{
+        $e
+    }};
+    // Recursive case: Take a 16
+    ([16 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e(); e(); e();
+        e(); e(); e(); e();
+        e(); e(); e(); e();
+        e(); e(); e(); e()
+    }};
+    // Recursive case: Take a 8
+    ([8 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e(); e(); e();
+        e(); e(); e(); e()
+    }};
+    // Recursive case: Take a 4
+    ([4 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e(); e(); e()
+    }};
+    // Recursive case: Take a 2
+    ([2 $($n: tt)*] $e: expr, $T: ty) => {{
+        const fn e() -> $T { const_repeat!([$($n)*] $e, $T) }
+        e(); e()
+    }};
+}
+macro_rules! expensive_static {
+    ($name: ident : $T: ty = $e : expr) =>
+        (pub static $name : $T = const_repeat!([16 16 16 16 16 16] $e, $T);)
+}
+
+pub trait Trait: Sync {}
+impl Trait for u32 {}
+
+expensive_static!(UNSIZE_TRAIT: &'static Trait = &42u32);