This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Arbitrary precision representation for numeric constants?
- To: gcc at gcc dot gnu dot org
- Subject: Re: Arbitrary precision representation for numeric constants?
- From: Peter Gerwinski <peter at gerwinski dot de>
- Date: Sun, 13 Feb 2000 12:36:41 +0100
- References: <19991017221806.C247@esmeralda.gerwinski.de> <199910181604.RAA16201@phal.cygnus.co.uk> <20000131004828.A14323@esmeralda.gerwinski.de> <20000130203927.A26909@cygnus.com> <20000131153906.D1335@esmeralda.gerwinski.de>
Hello again,
I wrote:
> `fold()'ing this:
> <mult_expr 0x827fb94 [...]
> results in this:
> <integer_cst 0x827fbac type <integer_type 0x8262e24 Longestcard> constant permanent 0>
Okay, maybe the tree node dump was too complicated. ;-)
So once more:
When I use fold() to multiply two `unsigned long long'
constants, the result does not get the "overflow" bit set
(even if it overflows).
Anything that can be done about this?
Peter
--
http://home.pages.de/~Peter.Gerwinski/ - G-N-U GmbH: http://www.g-n-u.de
Maintainer GNU Pascal - http://home.pages.de/~GNU-Pascal/ - gpc-19990118
GnuPG key fingerprint: 9E7C 0FC4 8A62 5536 1730 A932 9834 65DB 2143 9422
keys: ftp://ftp.gerwinski.de/pub/keys/ - AntiSpam: http://spam.abuse.net