It seems like there's a whole range of issues once boolean_true_node
(or any such global tree node) has been clobbered.
#include
int
main (int argc, char **argv)
{
if ((bool)((1527719483 + 1477819644))) {
}
return 0;
}
bool t1 = true;
---
[EMAIL PROTECTED] gcc]$ ./xgcc -B./ -O3 -S foo2.
A question for the general group.
Is it really the case that it's ok that a testcase clobbers boolean_true_node
and sets overflow? (and is this one case of a more general problem?)
If that's not unintended, ok, but it seems confusing (aka source of bugs).
Or, which is certainly not unexpected, is
