forked from rust-lang/rust
-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Auto merge of rust-lang#93621 - JohnTitor:rollup-1bcud0x, r=JohnTitor
Rollup of 7 pull requests Successful merges: - rust-lang#92310 (rustdoc: Fix ICE report) - rust-lang#92802 (Deduplicate lines in long const-eval stack trace) - rust-lang#93515 (Factor convenience functions out of main printer implementation) - rust-lang#93566 (Make rustc use `RUST_BACKTRACE=full` by default) - rust-lang#93589 (Use Option::then in two places) - rust-lang#93600 (fix: Remove extra newlines from junit output) - rust-lang#93606 (Correct incorrect description of preorder traversals) Failed merges: r? `@ghost` `@rustbot` modify labels: rollup
- Loading branch information
Showing
12 changed files
with
215 additions
and
105 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,77 @@ | ||
use crate::pp::{BeginToken, BreakToken, Breaks, IndentStyle, Printer, Token, SIZE_INFINITY}; | ||
use std::borrow::Cow; | ||
|
||
impl Printer { | ||
/// "raw box" | ||
pub fn rbox(&mut self, indent: usize, breaks: Breaks) { | ||
self.scan_begin(BeginToken { | ||
indent: IndentStyle::Block { offset: indent as isize }, | ||
breaks, | ||
}) | ||
} | ||
|
||
/// Inconsistent breaking box | ||
pub fn ibox(&mut self, indent: usize) { | ||
self.rbox(indent, Breaks::Inconsistent) | ||
} | ||
|
||
/// Consistent breaking box | ||
pub fn cbox(&mut self, indent: usize) { | ||
self.rbox(indent, Breaks::Consistent) | ||
} | ||
|
||
pub fn visual_align(&mut self) { | ||
self.scan_begin(BeginToken { indent: IndentStyle::Visual, breaks: Breaks::Consistent }); | ||
} | ||
|
||
pub fn break_offset(&mut self, n: usize, off: isize) { | ||
self.scan_break(BreakToken { offset: off, blank_space: n as isize }) | ||
} | ||
|
||
pub fn end(&mut self) { | ||
self.scan_end() | ||
} | ||
|
||
pub fn eof(mut self) -> String { | ||
self.scan_eof(); | ||
self.out | ||
} | ||
|
||
pub fn word<S: Into<Cow<'static, str>>>(&mut self, wrd: S) { | ||
let string = wrd.into(); | ||
self.scan_string(string) | ||
} | ||
|
||
fn spaces(&mut self, n: usize) { | ||
self.break_offset(n, 0) | ||
} | ||
|
||
pub fn zerobreak(&mut self) { | ||
self.spaces(0) | ||
} | ||
|
||
pub fn space(&mut self) { | ||
self.spaces(1) | ||
} | ||
|
||
pub fn hardbreak(&mut self) { | ||
self.spaces(SIZE_INFINITY as usize) | ||
} | ||
|
||
pub fn is_beginning_of_line(&self) -> bool { | ||
match self.last_token() { | ||
Some(last_token) => last_token.is_hardbreak_tok(), | ||
None => true, | ||
} | ||
} | ||
|
||
pub fn hardbreak_tok_offset(off: isize) -> Token { | ||
Token::Break(BreakToken { offset: off, blank_space: SIZE_INFINITY }) | ||
} | ||
} | ||
|
||
impl Token { | ||
pub fn is_hardbreak_tok(&self) -> bool { | ||
matches!(self, Token::Break(BreakToken { offset: 0, blank_space: SIZE_INFINITY })) | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,11 @@ | ||
#![allow(unused)] | ||
|
||
const fn f<T>(x: T) { //~ WARN function cannot return without recursing | ||
f(x); | ||
//~^ ERROR any use of this value will cause an error | ||
//~| WARN this was previously accepted by the compiler | ||
} | ||
|
||
const X: () = f(1); | ||
|
||
fn main() {} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,31 @@ | ||
warning: function cannot return without recursing | ||
--> $DIR/recursive.rs:3:1 | ||
| | ||
LL | const fn f<T>(x: T) { | ||
| ^^^^^^^^^^^^^^^^^^^ cannot return without recursing | ||
LL | f(x); | ||
| ---- recursive call site | ||
| | ||
= note: `#[warn(unconditional_recursion)]` on by default | ||
= help: a `loop` may express intention better if this is on purpose | ||
|
||
error: any use of this value will cause an error | ||
--> $DIR/recursive.rs:4:5 | ||
| | ||
LL | f(x); | ||
| ^^^^ | ||
| | | ||
| reached the configured maximum number of stack frames | ||
| inside `f::<i32>` at $DIR/recursive.rs:4:5 | ||
| [... 126 additional calls inside `f::<i32>` at $DIR/recursive.rs:4:5 ...] | ||
| inside `X` at $DIR/recursive.rs:9:15 | ||
... | ||
LL | const X: () = f(1); | ||
| ------------------- | ||
| | ||
= note: `#[deny(const_err)]` on by default | ||
= warning: this was previously accepted by the compiler but is being phased out; it will become a hard error in a future release! | ||
= note: for more information, see issue #71800 <https://github.com/rust-lang/rust/issues/71800> | ||
|
||
error: aborting due to previous error; 1 warning emitted | ||
|
Oops, something went wrong.