This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VA

From: Mike Stump <mrs at apple dot com>
To: Laurent GUERBY <laurent at guerby dot net>
Cc: Kai Henningsen <kaih at khms dot westfalen dot de>, gcc at gcc dot gnu dot org
Date: Fri, 12 Aug 2005 16:11:31 -0700
Subject: Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VA
References: <10508121750.AA15217@vlsi1.ultra.nyu.edu> <9bhwbzTXw-B@khms.westfalen.de> <1123886705.7742.5.camel@pc.site>

On Aug 12, 2005, at 3:45 PM, Laurent GUERBY wrote:

Isn't it possible to attach some information on a comparison
statement that tells code generation never to never
optimize away this particular comparison even if it
seems to be able to prove it is always true or false?

Cough, hack, ick.

Follow-Ups:
- Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VA
  - From: Robert Dewar

References:
- Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VALUE (Ada RFC)
  - From: Richard Kenner
- Re: PR 23046. Folding predicates involving TYPE_MAX_VALUE/TYPE_MIN_VA
  - From: Kai Henningsen
- Re: PR 23046. Folding predicates involvingTYPE_MAX_VALUE/TYPE_MIN_VA
  - From: Laurent GUERBY

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]