use println!()
This commit is contained in:
parent
117cdf35d4
commit
5355a16150
7 changed files with 26 additions and 26 deletions
|
@ -226,21 +226,21 @@ impl CodegenBackend for LlvmCodegenBackend {
|
||||||
for &(name, _) in back::write::RELOC_MODEL_ARGS.iter() {
|
for &(name, _) in back::write::RELOC_MODEL_ARGS.iter() {
|
||||||
println!(" {}", name);
|
println!(" {}", name);
|
||||||
}
|
}
|
||||||
println!("");
|
println!();
|
||||||
}
|
}
|
||||||
PrintRequest::CodeModels => {
|
PrintRequest::CodeModels => {
|
||||||
println!("Available code models:");
|
println!("Available code models:");
|
||||||
for &(name, _) in back::write::CODE_GEN_MODEL_ARGS.iter(){
|
for &(name, _) in back::write::CODE_GEN_MODEL_ARGS.iter(){
|
||||||
println!(" {}", name);
|
println!(" {}", name);
|
||||||
}
|
}
|
||||||
println!("");
|
println!();
|
||||||
}
|
}
|
||||||
PrintRequest::TlsModels => {
|
PrintRequest::TlsModels => {
|
||||||
println!("Available TLS models:");
|
println!("Available TLS models:");
|
||||||
for &(name, _) in back::write::TLS_MODEL_ARGS.iter(){
|
for &(name, _) in back::write::TLS_MODEL_ARGS.iter(){
|
||||||
println!(" {}", name);
|
println!(" {}", name);
|
||||||
}
|
}
|
||||||
println!("");
|
println!();
|
||||||
}
|
}
|
||||||
req => llvm_util::print(req, sess),
|
req => llvm_util::print(req, sess),
|
||||||
}
|
}
|
||||||
|
|
|
@ -422,7 +422,7 @@ impl fmt::Debug for ChildStderr {
|
||||||
/// // Execute `ls` in the current directory of the program.
|
/// // Execute `ls` in the current directory of the program.
|
||||||
/// list_dir.status().expect("process failed to execute");
|
/// list_dir.status().expect("process failed to execute");
|
||||||
///
|
///
|
||||||
/// println!("");
|
/// println!();
|
||||||
///
|
///
|
||||||
/// // Change `ls` to execute in the root directory.
|
/// // Change `ls` to execute in the root directory.
|
||||||
/// list_dir.current_dir("/");
|
/// list_dir.current_dir("/");
|
||||||
|
|
|
@ -242,12 +242,12 @@ fn non_immediate_args(a: BigStruct, b: BigStruct) {
|
||||||
|
|
||||||
fn binding(a: i64, b: u64, c: f64) {
|
fn binding(a: i64, b: u64, c: f64) {
|
||||||
let x = 0; // #break
|
let x = 0; // #break
|
||||||
println!("")
|
println!()
|
||||||
}
|
}
|
||||||
|
|
||||||
fn assignment(mut a: u64, b: u64, c: f64) {
|
fn assignment(mut a: u64, b: u64, c: f64) {
|
||||||
a = b; // #break
|
a = b; // #break
|
||||||
println!("")
|
println!()
|
||||||
}
|
}
|
||||||
|
|
||||||
fn function_call(x: u64, y: u64, z: f64) {
|
fn function_call(x: u64, y: u64, z: f64) {
|
||||||
|
|
|
@ -143,7 +143,7 @@ pub fn main() {
|
||||||
v[0].descend_into_self(&mut c);
|
v[0].descend_into_self(&mut c);
|
||||||
assert!(!c.saw_prev_marked); // <-- different from below, b/c acyclic above
|
assert!(!c.saw_prev_marked); // <-- different from below, b/c acyclic above
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 1: { v[0] -> v[1], v[1] -> v[0] };
|
// Cycle 1: { v[0] -> v[1], v[1] -> v[0] };
|
||||||
// does not exercise `v` itself
|
// does not exercise `v` itself
|
||||||
|
@ -158,7 +158,7 @@ pub fn main() {
|
||||||
v[0].descend_into_self(&mut c);
|
v[0].descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 2: { v[0] -> v, v[1] -> v }
|
// Cycle 2: { v[0] -> v, v[1] -> v }
|
||||||
let v: V = Named::new("v");
|
let v: V = Named::new("v");
|
||||||
|
@ -171,7 +171,7 @@ pub fn main() {
|
||||||
v.descend_into_self(&mut c);
|
v.descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 3: { hk0 -> hv0, hv0 -> hk0, hk1 -> hv1, hv1 -> hk1 };
|
// Cycle 3: { hk0 -> hv0, hv0 -> hk0, hk1 -> hv1, hv1 -> hk1 };
|
||||||
// does not exercise `h` itself
|
// does not exercise `h` itself
|
||||||
|
@ -193,7 +193,7 @@ pub fn main() {
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
}
|
}
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 4: { h -> (hmk0,hmv0,hmk1,hmv1), {hmk0,hmv0,hmk1,hmv1} -> h }
|
// Cycle 4: { h -> (hmk0,hmv0,hmk1,hmv1), {hmk0,hmv0,hmk1,hmv1} -> h }
|
||||||
|
|
||||||
|
@ -216,7 +216,7 @@ pub fn main() {
|
||||||
// break;
|
// break;
|
||||||
}
|
}
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 5: { vd[0] -> vd[1], vd[1] -> vd[0] };
|
// Cycle 5: { vd[0] -> vd[1], vd[1] -> vd[0] };
|
||||||
// does not exercise vd itself
|
// does not exercise vd itself
|
||||||
|
@ -232,7 +232,7 @@ pub fn main() {
|
||||||
vd[0].descend_into_self(&mut c);
|
vd[0].descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 6: { vd -> (vd0, vd1), {vd0, vd1} -> vd }
|
// Cycle 6: { vd -> (vd0, vd1), {vd0, vd1} -> vd }
|
||||||
let mut vd: VecDeque<VD> = VecDeque::new();
|
let mut vd: VecDeque<VD> = VecDeque::new();
|
||||||
|
@ -247,7 +247,7 @@ pub fn main() {
|
||||||
vd[0].descend_into_self(&mut c);
|
vd[0].descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 7: { vm -> (vm0, vm1), {vm0, vm1} -> vm }
|
// Cycle 7: { vm -> (vm0, vm1), {vm0, vm1} -> vm }
|
||||||
let mut vm: HashMap<usize, VM> = HashMap::new();
|
let mut vm: HashMap<usize, VM> = HashMap::new();
|
||||||
|
@ -262,7 +262,7 @@ pub fn main() {
|
||||||
vm[&0].descend_into_self(&mut c);
|
vm[&0].descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 8: { ll -> (ll0, ll1), {ll0, ll1} -> ll }
|
// Cycle 8: { ll -> (ll0, ll1), {ll0, ll1} -> ll }
|
||||||
let mut ll: LinkedList<LL> = LinkedList::new();
|
let mut ll: LinkedList<LL> = LinkedList::new();
|
||||||
|
@ -282,7 +282,7 @@ pub fn main() {
|
||||||
// break;
|
// break;
|
||||||
}
|
}
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 9: { bh -> (bh0, bh1), {bh0, bh1} -> bh }
|
// Cycle 9: { bh -> (bh0, bh1), {bh0, bh1} -> bh }
|
||||||
let mut bh: BinaryHeap<BH> = BinaryHeap::new();
|
let mut bh: BinaryHeap<BH> = BinaryHeap::new();
|
||||||
|
@ -302,7 +302,7 @@ pub fn main() {
|
||||||
// break;
|
// break;
|
||||||
}
|
}
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 10: { btm -> (btk0, btv1), {bt0, bt1} -> btm }
|
// Cycle 10: { btm -> (btk0, btv1), {bt0, bt1} -> btm }
|
||||||
let mut btm: BTreeMap<BTM, BTM> = BTreeMap::new();
|
let mut btm: BTreeMap<BTM, BTM> = BTreeMap::new();
|
||||||
|
@ -323,7 +323,7 @@ pub fn main() {
|
||||||
// break;
|
// break;
|
||||||
}
|
}
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 10: { bts -> (bts0, bts1), {bts0, bts1} -> btm }
|
// Cycle 10: { bts -> (bts0, bts1), {bts0, bts1} -> btm }
|
||||||
let mut bts: BTreeSet<BTS> = BTreeSet::new();
|
let mut bts: BTreeSet<BTS> = BTreeSet::new();
|
||||||
|
@ -343,7 +343,7 @@ pub fn main() {
|
||||||
// break;
|
// break;
|
||||||
}
|
}
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 11: { rc0 -> (rc1, rc2), rc1 -> (), rc2 -> rc0 }
|
// Cycle 11: { rc0 -> (rc1, rc2), rc1 -> (), rc2 -> rc0 }
|
||||||
let (rc0, rc1, rc2): (RCRC, RCRC, RCRC);
|
let (rc0, rc1, rc2): (RCRC, RCRC, RCRC);
|
||||||
|
@ -361,7 +361,7 @@ pub fn main() {
|
||||||
rc0.descend_into_self(&mut c);
|
rc0.descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// We want to take the previous Rc case and generalize it to Arc.
|
// We want to take the previous Rc case and generalize it to Arc.
|
||||||
//
|
//
|
||||||
|
@ -395,7 +395,7 @@ pub fn main() {
|
||||||
arc0.descend_into_self(&mut c);
|
arc0.descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 13: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, rwlocks
|
// Cycle 13: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, rwlocks
|
||||||
let (arc0, arc1, arc2): (ARCRW, ARCRW, ARCRW);
|
let (arc0, arc1, arc2): (ARCRW, ARCRW, ARCRW);
|
||||||
|
@ -413,7 +413,7 @@ pub fn main() {
|
||||||
arc0.descend_into_self(&mut c);
|
arc0.descend_into_self(&mut c);
|
||||||
assert!(c.saw_prev_marked);
|
assert!(c.saw_prev_marked);
|
||||||
|
|
||||||
if PRINT { println!(""); }
|
if PRINT { println!(); }
|
||||||
|
|
||||||
// Cycle 14: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, mutexs
|
// Cycle 14: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, mutexs
|
||||||
let (arc0, arc1, arc2): (ARCM, ARCM, ARCM);
|
let (arc0, arc1, arc2): (ARCM, ARCM, ARCM);
|
||||||
|
|
|
@ -6,6 +6,6 @@ fn main() {
|
||||||
//~| NOTE `&str` is not an iterator
|
//~| NOTE `&str` is not an iterator
|
||||||
//~| HELP the trait `std::iter::Iterator` is not implemented for `&str`
|
//~| HELP the trait `std::iter::Iterator` is not implemented for `&str`
|
||||||
//~| NOTE required by `std::iter::IntoIterator::into_iter`
|
//~| NOTE required by `std::iter::IntoIterator::into_iter`
|
||||||
println!("");
|
println!();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -253,7 +253,7 @@ pub fn parse_config(args: Vec<String>) -> Config {
|
||||||
if args.len() == 1 || args[1] == "-h" || args[1] == "--help" {
|
if args.len() == 1 || args[1] == "-h" || args[1] == "--help" {
|
||||||
let message = format!("Usage: {} [OPTIONS] [TESTNAME...]", argv0);
|
let message = format!("Usage: {} [OPTIONS] [TESTNAME...]", argv0);
|
||||||
println!("{}", opts.usage(&message));
|
println!("{}", opts.usage(&message));
|
||||||
println!("");
|
println!();
|
||||||
panic!()
|
panic!()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -265,7 +265,7 @@ pub fn parse_config(args: Vec<String>) -> Config {
|
||||||
if matches.opt_present("h") || matches.opt_present("help") {
|
if matches.opt_present("h") || matches.opt_present("help") {
|
||||||
let message = format!("Usage: {} [OPTIONS] [TESTNAME...]", argv0);
|
let message = format!("Usage: {} [OPTIONS] [TESTNAME...]", argv0);
|
||||||
println!("{}", opts.usage(&message));
|
println!("{}", opts.usage(&message));
|
||||||
println!("");
|
println!();
|
||||||
panic!()
|
panic!()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -2593,7 +2593,7 @@ impl<'test> TestCx<'test> {
|
||||||
" actual: {}",
|
" actual: {}",
|
||||||
codegen_units_to_str(&actual_item.codegen_units)
|
codegen_units_to_str(&actual_item.codegen_units)
|
||||||
);
|
);
|
||||||
println!("");
|
println!();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -3526,7 +3526,7 @@ impl<'test> TestCx<'test> {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
println!("");
|
println!();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue