Hi!
On 2022-10-17T09:43:37+0200, I wrote:
> On 2022-10-11T10:31:37+0200, Aldy Hernandez via Gcc-patches
> wrote:
>> When solving 0 = _15 & 1, we calculate _15 as:
>>
>> [irange] int [-INF, -2][0, +INF] NONZERO 0xfffe
>>
>> The known value of _15 is [0, 1] NONZERO 0x1 which is intersecte
On Fri, Oct 21, 2022 at 10:38 AM Thomas Schwinge
wrote:
>
> Hi!
>
> On 2022-10-21T00:44:30+0200, Aldy Hernandez wrote:
> > On Thu, Oct 20, 2022 at 9:22 PM Thomas Schwinge
> > wrote:
> >> "Add 'gcc.dg/tree-ssa/pr107195-3.c' [PR107195]" attached?
> >
> > I see 7 different tests in this patch. Di
Hi!
On 2022-10-21T00:44:30+0200, Aldy Hernandez wrote:
> On Thu, Oct 20, 2022 at 9:22 PM Thomas Schwinge
> wrote:
>> "Add 'gcc.dg/tree-ssa/pr107195-3.c' [PR107195]" attached?
>
> I see 7 different tests in this patch. Did the 6 that pass, fail
> before my patch for PR107195 and are now working
On Thu, Oct 20, 2022 at 9:22 PM Thomas Schwinge wrote:
>
> Hi!
>
> On 2022-10-20T14:23:33+0200, Aldy Hernandez wrote:
> >> I understand 'r & 3' to be logically equivalent to '(r & 2) && (r & 1)',
> >> right?
> >
> > For r == 2, r & 3 == 2, whereas (r & 2) && (r & 1) == 0, so no?
>
> Thanks, and n
Hi!
On 2022-10-20T14:23:33+0200, Aldy Hernandez wrote:
>> I understand 'r & 3' to be logically equivalent to '(r & 2) && (r & 1)',
>> right?
>
> For r == 2, r & 3 == 2, whereas (r & 2) && (r & 1) == 0, so no?
Thanks, and now please let me crawl back under my stone, embarassing...
That'd rather b
> I understand 'r & 3' to be logically equivalent to '(r & 2) && (r & 1)',
> right?
For r == 2, r & 3 == 2, whereas (r & 2) && (r & 1) == 0, so no?
Aldy
Hi!
On 2022-10-18T07:41:29+0200, Aldy Hernandez wrote:
> On Mon, Oct 17, 2022 at 4:47 PM Thomas Schwinge
> wrote:
>> On 2022-10-17T15:58:47+0200, Aldy Hernandez wrote:
>> > On Mon, Oct 17, 2022 at 9:44 AM Thomas Schwinge
>> > wrote:
>> >> On 2022-10-11T10:31:37+0200, Aldy Hernandez via Gcc-p
On Mon, Oct 17, 2022 at 4:47 PM Thomas Schwinge wrote:
>
> Hi!
>
> On 2022-10-17T15:58:47+0200, Aldy Hernandez wrote:
> > On Mon, Oct 17, 2022 at 9:44 AM Thomas Schwinge
> > wrote:
> >> On 2022-10-11T10:31:37+0200, Aldy Hernandez via Gcc-patches
> >> wrote:
> >> > When solving 0 = _15 & 1, we
Hi!
On 2022-10-17T15:58:47+0200, Aldy Hernandez wrote:
> On Mon, Oct 17, 2022 at 9:44 AM Thomas Schwinge
> wrote:
>> On 2022-10-11T10:31:37+0200, Aldy Hernandez via Gcc-patches
>> wrote:
>> > When solving 0 = _15 & 1, we calculate _15 as:
>> >
>> > [irange] int [-INF, -2][0, +INF] NONZE
On Mon, Oct 17, 2022 at 9:44 AM Thomas Schwinge wrote:
>
> Hi!
>
> On 2022-10-11T10:31:37+0200, Aldy Hernandez via Gcc-patches
> wrote:
> > When solving 0 = _15 & 1, we calculate _15 as:
> >
> > [irange] int [-INF, -2][0, +INF] NONZERO 0xfffe
> >
> > The known value of _15 is [0, 1] NO
Hi!
On 2022-10-11T10:31:37+0200, Aldy Hernandez via Gcc-patches
wrote:
> When solving 0 = _15 & 1, we calculate _15 as:
>
> [irange] int [-INF, -2][0, +INF] NONZERO 0xfffe
>
> The known value of _15 is [0, 1] NONZERO 0x1 which is intersected with
> the above, yielding:
>
> [0, 1]
When solving 0 = _15 & 1, we calculate _15 as:
[irange] int [-INF, -2][0, +INF] NONZERO 0xfffe
The known value of _15 is [0, 1] NONZERO 0x1 which is intersected with
the above, yielding:
[0, 1] NONZERO 0x0
This eventually gets copied to a _Bool [0, 1] NONZERO 0x0.
This is p
12 matches
Mail list logo