On Wed, 2 Sep 2020, Richard Biener via Gcc wrote:
> > Or we could decide that the extra multiplication is not that bad if it
> > saves an addition, simplifies the expression, possibly gains more insn
> > parallelism, etc, in which case we could just drop the existing hard
> > single_use check...
>
>>
>> >
>> >>
>> >> >> There is a match-folding issue derived from pr94234. A piece of
>> >> >> code like:
>> >> >>
>> >> >> int foo (int n)
>> >> >> {
>> >> >> int t1 = 8 * n;
>> >> >> int t2 = 8 * (n - 1);
>> >> >>
>> >> >> return t1 - t2;
>> >> >> }
>> >> >>
>> >> >> It
On Wed, Sep 2, 2020 at 9:35 AM Feng Xue OS wrote:
>
> >
> >>
> >> >> There is a match-folding issue derived from pr94234. A piece of code
> >> >> like:
> >> >>
> >> >> int foo (int n)
> >> >> {
> >> >> int t1 = 8 * n;
> >> >> int t2 = 8 * (n - 1);
> >> >>
> >> >> return t1 -
On Wed, Sep 2, 2020 at 9:27 AM Marc Glisse wrote:
>
> On Wed, 2 Sep 2020, Richard Biener via Gcc wrote:
>
> > On Mon, Aug 24, 2020 at 8:20 AM Feng Xue OS via Gcc wrote:
> >>
> There is a match-folding issue derived from pr94234. A piece of code
> like:
>
> int foo (int n
>
>>
>> >> There is a match-folding issue derived from pr94234. A piece of code
>> >> like:
>> >>
>> >> int foo (int n)
>> >> {
>> >> int t1 = 8 * n;
>> >> int t2 = 8 * (n - 1);
>> >>
>> >> return t1 - t2;
>> >> }
>> >>
>> >> It can be perfectly caught by the rule "(A * C)
On Wed, 2 Sep 2020, Richard Biener via Gcc wrote:
On Mon, Aug 24, 2020 at 8:20 AM Feng Xue OS via Gcc wrote:
There is a match-folding issue derived from pr94234. A piece of code like:
int foo (int n)
{
int t1 = 8 * n;
int t2 = 8 * (n - 1);
return t1 - t2;
}
It can
On Mon, Aug 24, 2020 at 8:20 AM Feng Xue OS via Gcc wrote:
>
> >> There is a match-folding issue derived from pr94234. A piece of code
> >> like:
> >>
> >> int foo (int n)
> >> {
> >> int t1 = 8 * n;
> >> int t2 = 8 * (n - 1);
> >>
> >> return t1 - t2;
> >> }
> >>
> >> It
>> There is a match-folding issue derived from pr94234. A piece of code like:
>>
>> int foo (int n)
>> {
>> int t1 = 8 * n;
>> int t2 = 8 * (n - 1);
>>
>> return t1 - t2;
>> }
>>
>> It can be perfectly caught by the rule "(A * C) +- (B * C) -> (A +- B) *
>> C", and
>>
On Fri, 21 Aug 2020, Feng Xue OS via Gcc wrote:
There is a match-folding issue derived from pr94234. A piece of code like:
int foo (int n)
{
int t1 = 8 * n;
int t2 = 8 * (n - 1);
return t1 - t2;
}
It can be perfectly caught by the rule "(A * C) +- (B * C) -> (A +- B) * C", an
Hi,
There is a match-folding issue derived from pr94234. A piece of code like:
int foo (int n)
{
int t1 = 8 * n;
int t2 = 8 * (n - 1);
return t1 - t2;
}
It can be perfectly caught by the rule "(A * C) +- (B * C) -> (A +- B) * C",
and
be folded to constant "8". But thi
10 matches
Mail list logo
