This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/28632] VRP should understand bitwise OR and AND
- From: "vda dot linux at googlemail dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 11 Aug 2008 12:46:19 -0000
- Subject: [Bug tree-optimization/28632] VRP should understand bitwise OR and AND
- References: <bug-28632-12956@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #11 from vda dot linux at googlemail dot com 2008-08-11 12:46 -------
Created an attachment (id=16050)
--> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=16050&action=view)
Updated patch. Uses double_int calculations instead of trees.
On Mon, 2008-08-04 at 14:26 +0200, Richard Guenther wrote:
> In extract_range_from_binary_expr it looks like the cases for
> BIT_AND_EXPR and BIT_IOR_EXPR can share most (if not all) of
> the code if you use the expression code instead of constant codes.
>
> In bits_always_set and bits_maybe_set it is better to use double_ints
> (see double_int.h) for intermediate calculations, as they do not involve
> allocating new tree constants.
The updated patch is attached (with instrumentation code present but
#defined out).
--
vda dot linux at googlemail dot com changed:
What |Removed |Added
----------------------------------------------------------------------------
Attachment #16009|0 |1
is obsolete| |
Attachment #16011|0 |1
is obsolete| |
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=28632