rust/src/test/ui/recursion/issue-83150.rs

// build-fail

fn main() {
    let mut iter = 0u8..1;
    func(&mut iter)
}

fn func<T: Iterator<Item = u8>>(iter: &mut T) { //~ WARN function cannot return without recursing
    func(&mut iter.map(|x| x + 1))
    //~^ ERROR reached the recursion limit while instantiating
}
prevent very long compilation runtimes in LateBoundRegionNameCollector 2021-03-23 12:41:26 +01:00			`// build-fail`

			`fn main() {`
			`let mut iter = 0u8..1;`
			`func(&mut iter)`
			`}`

Ignore unwinding edges when checking for unconditional recursion The unconditional recursion lint determines if all execution paths eventually lead to a self-recursive call. The implementation always follows unwinding edges which limits its practical utility. For example, it would not lint function `f` because a call to `g` might unwind. It also wouldn't lint function `h` because an overflow check preceding the self-recursive call might unwind: ```rust pub fn f() { g(); f(); } pub fn g() { /* ... */ } pub fn h(a: usize) { h(a + 1); } ``` To avoid the issue, assume that terminators that might continue execution along non-unwinding edges do so. 2022-01-14 00:00:00 +00:00			`fn func<T: Iterator<Item = u8>>(iter: &mut T) { //~ WARN function cannot return without recursing`
prevent very long compilation runtimes in LateBoundRegionNameCollector 2021-03-23 12:41:26 +01:00			`func(&mut iter.map(\|x\| x + 1))`
Allow inlining `#[inline]` functions. 2021-12-13 18:03:22 +01:00			`//~^ ERROR reached the recursion limit while instantiating`
prevent very long compilation runtimes in LateBoundRegionNameCollector 2021-03-23 12:41:26 +01:00			`}`