const fn can cause infinite recursion in rustc

[oli-obk]

#![feature(const_fn)]
const fn a() -> usize { b() }
const fn b() -> usize { a() }
const ARR: [i32; a()] = [5; 6];

fn main(){}

thread 'rustc' has overflowed its stack

The same problem happens in trans when using static A: usize = a(); instead.

Since we do not have constant conditionals, there's currently no way recursion ever makes sense.

What about short-circuit behaviour of && and ||, shouldn't it allow you to get
a conditional evaluation inside const? I will note that it also does not work
as of now. Code below overflow stack with const, and works fine without it.

#![feature(const_fn)]
const fn a(i: bool) -> bool { i || a(true) }

fn main() {
  println!("{}", a(false));
}

[oli-obk]

short circuiting has its own bug(#29608) and we're delaying it until we have a single constant evaluator based on MIR, since it'll create some confusion between the two constant evaluators we currently have

[durka]

Why doesn't the recursion limit cover this?

[kylone]

@durka Best guess: Ran out of stack before hitting the recursion limit. This could happen if the function call chain is long enough during the constant evaluator working on evaluating these recursive functions.