| // Copyright 2012-2014 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. |
| |
| #![feature(asm)] |
| |
| use std::io::process::Command; |
| use std::os; |
| use std::str; |
| |
| // lifted from the test module |
| // Inlining to avoid llvm turning the recursive functions into tail calls, |
| // which doesn't consume stack. |
| #[inline(always)] |
| pub fn black_box<T>(dummy: T) { unsafe { asm!("" : : "r"(&dummy)) } } |
| |
| fn silent_recurse() { |
| let buf = [0, ..1000]; |
| black_box(buf); |
| silent_recurse(); |
| } |
| |
| fn loud_recurse() { |
| println!("hello!"); |
| loud_recurse(); |
| black_box(()); // don't optimize this into a tail call. please. |
| } |
| |
| fn main() { |
| let args = os::args(); |
| let args = args.as_slice(); |
| if args.len() > 1 && args[1].as_slice() == "silent" { |
| silent_recurse(); |
| } else if args.len() > 1 && args[1].as_slice() == "loud" { |
| loud_recurse(); |
| } else { |
| let silent = Command::new(args[0].as_slice()).arg("silent").output().unwrap(); |
| assert!(!silent.status.success()); |
| let error = str::from_utf8_lossy(silent.error.as_slice()); |
| assert!(error.as_slice().contains("has overflowed its stack")); |
| |
| let loud = Command::new(args[0].as_slice()).arg("loud").output().unwrap(); |
| assert!(!loud.status.success()); |
| let error = str::from_utf8_lossy(silent.error.as_slice()); |
| assert!(error.as_slice().contains("has overflowed its stack")); |
| } |
| } |