On Tue, Apr 26, 2022 at 8:44 AM Jakub Jelinek wrote:
>
> Hi!
>
> When working on PR105338, I've noticed that in some cases we emit
> unnecessarily long sequence which has then higher seq_cost than necessary.
>
> E.g. when ix86_expand_int_movcc is called with
> operands[0] (reg/v:SI 83 [ i ])
> ope
Hi!
When working on PR105338, I've noticed that in some cases we emit
unnecessarily long sequence which has then higher seq_cost than necessary.
E.g. when ix86_expand_int_movcc is called with
operands[0] (reg/v:SI 83 [ i ])
operands[1] (eq (reg/v:SI 83 [ i ]) (const_int 0 [0]))
operands[2] (reg/v
On Sat, Apr 23, 2022 at 8:53 AM Jakub Jelinek wrote:
>
> Hi!
>
> The following testcase regressed on x86_64 on the trunk, due to some GIMPLE
> pass changes (r12-7687) we end up an *.optimized dump difference of:
> @@ -8,14 +8,14 @@ int foo (int i)
>
> [local count: 1073741824]:
>if (i_2(D)
Hi!
The following testcase regressed on x86_64 on the trunk, due to some GIMPLE
pass changes (r12-7687) we end up an *.optimized dump difference of:
@@ -8,14 +8,14 @@ int foo (int i)
[local count: 1073741824]:
if (i_2(D) != 0)
-goto ; [35.00%]
+goto ; [35.00%]
else
-goto ;