This is the mail archive of the gcc-patches@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]

[PATCH] Handle BIT_INSERT_EXPR in hashable_expr_equal_p

From: Andrew Pinski <apinski at cavium dot com>
To: GCC Patches <gcc-patches at gcc dot gnu dot org>, Richard Guenther <richard dot guenther at gmail dot com>
Date: Sat, 29 Jul 2017 11:48:13 -0700
Subject: [PATCH] Handle BIT_INSERT_EXPR in hashable_expr_equal_p
Authentication-results: sourceware.org; auth=none
Authentication-results: spf=none (sender IP is ) smtp.mailfrom=Andrew dot Pinski at cavium dot com;
Spamdiagnosticmetadata: NSPM
Spamdiagnosticoutput: 1:99

Hi,
  When I was playing around where lowering of bit-field accesses go in
the pass order, I found that DOM had the same issue as PRE had when it
came to comparing BIT_INSERT_EXPR for equality.  The same exact
testcase was showing the wrong code; gcc.dg/tree-ssa/20040324-1.c.

This fixes DOM the same way as I had fixed PRE, by special casing
BIT_INSERT_EXPR due to the implicit operand.

OK?  Bootstrapped and tested on aarch64-linux-gnu with no regressions.

Thanks,
Andrew Pinski

ChangeLog:
* tree-ssa-scopedtables.c (hashable_expr_equal_p): Check
BIT_INSERT_EXPR's operand 1
to see if the types precision matches.

Attachment: fixdombitinsert.diff.txt
Description: Text document

Follow-Ups:
- Re: [PATCH] Handle BIT_INSERT_EXPR in hashable_expr_equal_p
  - From: Richard Biener

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