On Fri, Oct 30, 2015 at 9:27 PM, Jeff Law wrote:
> On 10/30/2015 07:57 AM, Andreas Schwab wrote:
>>
>> I'm getting this regression on m68k:
>>
>> FAIL: gcc.dg/tree-ssa/ssa-thread-11.c scan-tree-dump vrp2 "FSM"
>>
>> The generated code looks equivalent, though.
>
> Definitely an artifact of differe
On 10/30/2015 07:57 AM, Andreas Schwab wrote:
I'm getting this regression on m68k:
FAIL: gcc.dg/tree-ssa/ssa-thread-11.c scan-tree-dump vrp2 "FSM"
The generated code looks equivalent, though.
Definitely an artifact of differences in branch costing. Pondering the
best way to fix.
jeff
On 10/30/2015 07:57 AM, Andreas Schwab wrote:
I'm getting this regression on m68k:
FAIL: gcc.dg/tree-ssa/ssa-thread-11.c scan-tree-dump vrp2 "FSM"
The generated code looks equivalent, though.
How cool. This test also shows the FSM bits creating an irreducible
loop in cases where it's no likel
On 10/30/2015 07:57 AM, Andreas Schwab wrote:
I'm getting this regression on m68k:
FAIL: gcc.dg/tree-ssa/ssa-thread-11.c scan-tree-dump vrp2 "FSM"
The generated code looks equivalent, though.
This looks to be an issue with logicals & short-circuiting.. I wouldn't
be surprised if we end up wit
On 10/30/2015 07:57 AM, Andreas Schwab wrote:
I'm getting this regression on m68k:
FAIL: gcc.dg/tree-ssa/ssa-thread-11.c scan-tree-dump vrp2 "FSM"
The generated code looks equivalent, though.
I'll take a look.
THanks,
jeff
I'm getting this regression on m68k:
FAIL: gcc.dg/tree-ssa/ssa-thread-11.c scan-tree-dump vrp2 "FSM"
The generated code looks equivalent, though.
Andreas.
--
Andreas Schwab, sch...@linux-m68k.org
GPG Key fingerprint = 58CA 54C7 6D53 942B 1756 01D3 44D5 214B 8276 4ED5
"And now for something co
As as been noted in the past, the old jump threader's support for
threading across a loop backedge introduces significant complexity. The
most serious complexity is the need to handle processing statements a
second time (as we come around the top of the loop). This requires
invalidation su