fix tidy

Author: xacrimon

tests/ui/codegen/tail-call-become.rs

@@ -1,5 +1,4 @@
-@ compile-flags: -C opt-level=0 -Cpanic=abort -C no-prepopulate-passes
-//@ needs-llvm-components: x86
+//@ compile-flags: -C opt-level=0 -Cpanic=abort -C no-prepopulate-passes
 
 #![feature(explicit_tail_calls)]
 #![crate_type = "lib"]

tests/ui/explicit-tail-calls/mutual-recursion.rs

@@ -47,7 +47,8 @@ fn main() {
     assert_eq!(is_odd(10), false);
 
     // Test with an extremely large number that would definitely overflow the stack
-    // without tail call optimization - each call creates 2 stack frames (alternating between functions)
+    // without tail call optimization, each call creates 2 stack frames
+    // as it alternates between functions
     // so 100,000 would create 200,000 stack frames total
     assert_eq!(is_even(100_000), true);
     assert_eq!(is_odd(100_000), false);

tests/ui/explicit-tail-calls/runtime-deep-recursion.rs

@@ -20,7 +20,7 @@ fn countdown_no_tail(n: u32) -> u32 {
 }
 
 // This test is specifically designed to verify tail call optimization
-// We use an extremely large recursion depth (500,000) that would 
+// We use an extremely large recursion depth (500,000) that would
 // absolutely overflow the stack without tail call optimization
 fn main() {
     // Small test to verify correctness