Hi GCC community,
I need to have ability to point to custom repository in gcc_release script.
This small patch 1) does add a parameter "-g" to add custom repository to
gcc_release , 2) does add a line to download prerequisites before building GCC
(download_prerequisites) which is not present
Thanks Jakob for the correction. Sadly, I didn’t have any access to any non x86
architecture. But x86 was fully tested and there was no regression.
In my spare time I will look at implementation of this for short-circuit
targets.
Best wishes,
Navid.
From: Jakub
Hi GCC community,
This patch will add the missed pattern described in bug 103514 [1] to the
match.pd. [1] includes proof of correctness for the patch too.
PR tree-optimization/103514
* match.pd (a & b) ^ (a == b) -> !(a | b): New optimization.
* match.pd (a & b) == (a ^ b) ->
MAINTAINERS: Add myself to write after approval and DCO sections.
* MAINTAINERS: Adding myself.
Best wishes,
Navid.
0001-MAINTAINERS-Add-myself-to-write-after-approval-and-D.patch
Description: 0001-MAINTAINERS-Add-myself-to-write-after-approval-and-D.patch
Hi Marc, thanks for clear explanation.
Actually I have to withdraw this patch. As you noticed there are some problems
with this. I was testing it yesterday, and I did realize I made mistake
combining different types in this pattern.
The same approach would work only and only if the types of
Hi GCC community,
This patch will add the missed pattern described in bug 103514 [1] to the
match.pd. Tested on x86_64 Linux.
tree-optimization/103514 Missing XOR-EQ-AND Optimization
* match.pd (a & b) == (a ^ b) -> !(a | b): New optimization.
* match.pd (a & b) ^ (a == b) ->
, November 30, 2021 15:18
To: Navid Rahimi
Cc: Navid Rahimi via Gcc-patches
Subject: Re: [EXTERNAL] Re: [PATCH] tree-optimization/98956 Optimizing out
boolean left shift
On Tue, Nov 30, 2021 at 3:08 PM Navid Rahimi wrote:
>
> Hi Andrew,
>
> Thanks for your detailed comment. There are t
1) https://compiler-explorer.com/z/r46znh4Tj
2) https://compiler-explorer.com/z/K1so39dbK
3) https://alive2.llvm.org/ce/z/-54zZv
Best wishes,
Navid.
From: Andrew Pinski
Sent: Tuesday, November 30, 2021 14:03
To: Navid Rahimi
Cc: Navid Rahimi via Gcc-patches
Hi GCC community,
This patch will add the missed pattern described in bug 98956 [1] to the
match.pd. The codegen and correctness proof for this pattern is here [2,3] in
case anyone is curious. Tested on x86_64 Linux.
Tree-optimization/98956:
Adding new optimization to match.pd:
om: Jeff Law
Sent: Tuesday, November 23, 2021 12:03
To: Navid Rahimi; Andrew Pinski
Cc: Navid Rahimi via Gcc-patches
Subject: Re: [EXTERNAL] Re: [PATCH][WIP] PR tree-optimization/101808 Boolean
comparison simplification
On 11/23/2021 12:55 PM, Navid Rahimi wrote:
>> Did you test Ada w
12:02
To: Navid Rahimi; Navid Rahimi via Gcc-patches
Subject: Re: [EXTERNAL] Re: [PATCH][WIP] PR tree-optimization/101808 Boolean
comparison simplification
On 11/23/2021 12:42 PM, Navid Rahimi wrote:
> In case of x86_64. This is the code:
>
> src_1(bool, bool):
> cmp dil, s
to check whether it is canonical boolean type or
signed/unsigned, which should prevent messing with odd Boolean types in Ada.
Best wishes,
Navid.
From: Andrew Pinski
Sent: Tuesday, November 23, 2021 11:33
To: Jeff Law
Cc: Navid Rahimi; Navid Rahimi via Gcc
-optimization-manual.pdf
Best wishes,
Navid.
From: Jeff Law
Sent: Tuesday, November 23, 2021 11:14
To: Navid Rahimi; Navid Rahimi via Gcc-patches
Subject: [EXTERNAL] Re: [PATCH][WIP] PR tree-optimization/101808 Boolean
comparison simplification
On 11/23/2021 11
Hi GCC community,
I wanted you take a quick look at this patch to solve this bug [1]. This is the
code example for the optimization [2] which does include a link to proof of
each different optimization.
I think it should be possible to use simpler approach than what Andrew has used
here [3].
Thanks Jeff for this too.
Best wishes,
Navid.
From: Jeff Law
Sent: Monday, November 22, 2021 19:09
To: Richard Biener; Navid Rahimi
Cc: gcc-patches@gcc.gnu.org
Subject: Re: [EXTERNAL] Re: [PATCH] PR tree-optimization/102232 Adding a
missing pattern to
Thanks Jeff.
Best wishes,
Navid.
From: Jeff Law
Sent: Monday, November 22, 2021 16:48
To: Richard Biener; Navid Rahimi
Cc: Navid Rahimi via Gcc-patches
Subject: Re: [EXTERNAL] Re: [PATCH] PR tree-optimization/96779 Adding a missing
pattern to match.pd
ishes,
Navid.
From: Richard Biener
Sent: Friday, November 19, 2021 03:43
To: Navid Rahimi
Cc: Navid Rahimi via Gcc-patches
Subject: [EXTERNAL] Re: [PATCH] PR tree-optimization/96779 Adding a missing
pattern to match.pd
[You don't often get email from r
Hi GCC community,
This patch will add the missed pattern described in bug 102232 [1] to the
match.pd.
Tree-optimization/96779: Adding new optimization to match.pd:
* match.pd (-x == x) -> (x == 0): New optimization.
* gcc.dg/tree-ssa/pr96779.c: testcase for this
Cc: gcc-patches@gcc.gnu.org
Subject: [EXTERNAL] Re: [PATCH] PR tree-optimization/102232 Adding a missing
pattern to match.pd
On Tue, Nov 9, 2021 at 5:12 AM Navid Rahimi via Gcc-patches
wrote:
>
> Hi GCC community,
>
> This patch will add the missed pattern described in bug 1
on behalf of Navid Rahimi via Gcc-patches
Sent: Monday, November 8, 2021 20:11
To: gcc-patches@gcc.gnu.org
Subject: [EXTERNAL] [PATCH] PR tree-optimization/102232 Adding a missing
pattern to match.pd
Hi GCC community,
This patch will add the missed pattern described in bug 102232 [1
Hi GCC community,
This patch will add the missed pattern described in bug 102232 [1] to the
match.pd. The testcase will test whether the multiplication and division has
been removed from the code or not. The correctness proof for this pattern is
here [2] in case anyone is curious.
PR
21 matches
Mail list logo
