On 08/23/2017 04:37 AM, Richard Biener wrote:
> On Tue, Aug 22, 2017 at 5:13 PM, Jeff Law wrote:
>> However, there are still cases where we have a conditional equivalence
>> and the names have the same cost to compute. A greatly simplified
>> example can be found in gcc.dg/tree-ssa/20030922-2.c.
On Tue, Aug 22, 2017 at 5:13 PM, Jeff Law wrote:
> This patch addresses some issues with conditional equivalences.
>
> First, it stops recording blindly recording conditional equivalences.
> Which leads to regressions...
>
> So for certain binary expressions (for example x - y), if we lookup the
>
This patch addresses some issues with conditional equivalences.
First, it stops recording blindly recording conditional equivalences.
Which leads to regressions...
So for certain binary expressions (for example x - y), if we lookup the
expression in the hash table and miss, we do a second lookup
