This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VALUE (Ada RFC)
- From: Florian Weimer <fw at deneb dot enyo dot de>
- To: Laurent GUERBY <laurent at guerby dot net>
- Cc: Richard Kenner <kenner at vlsi1 dot ultra dot nyu dot edu>, gcc at gcc dot gnu dot org
- Date: Fri, 12 Aug 2005 19:57:14 +0200
- Subject: Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VALUE (Ada RFC)
- References: <10508121553.AA14309@vlsi1.ultra.nyu.edu><1123868928.8058.437.camel@pc.site>
* Laurent GUERBY:
> An implementation model could be for the front-end to generate for each
> family of scalar type T a function Base_Type_Internal_Valid (X, Min,
> Max : in Base_Type_Of_T) return Boolean, generate a call to it at all
> 'Valid uses and then tell the compiler to never do any inlining at all
> on such generated function.
I think you could have a similar effect with an empty machine code
insertion. But it's still a kludge.