------- Comment #2 from steven at gcc dot gnu dot org 2007-11-05 21:38 -------
It seems to me that a recursive function can never be safely treated as
const/pure. In fact, any function in an SCC in the call graph could result in
an endless loop and is therefore not const/pure. I'm assuming here that hanging
in an infinite loop is a "side-effect", and I understand this is a debatable
assumption.
--
steven at gcc dot gnu dot org changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |zadeck at gcc dot gnu dot
| |org
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=33826
