From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugzilla@gcc.gnu.org>
Received: by sourceware.org (Postfix, from userid 48)
 id 0A20B39960C8; Sat,  9 Apr 2022 20:25:32 +0000 (GMT)
DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 0A20B39960C8
From: "hubicka at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug ipa/103818] [12 Regression] ICE: in insert, at
 ipa-modref-tree.c:591 since r12-3202-gf5ff3a8ed4ca9173
Date: Sat, 09 Apr 2022 20:25:31 +0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: ipa
X-Bugzilla-Version: 12.0
X-Bugzilla-Keywords: ice-on-valid-code
X-Bugzilla-Severity: normal
X-Bugzilla-Who: hubicka at gcc dot gnu.org
X-Bugzilla-Status: ASSIGNED
X-Bugzilla-Resolution: 
X-Bugzilla-Priority: P1
X-Bugzilla-Assigned-To: hubicka at gcc dot gnu.org
X-Bugzilla-Target-Milestone: 12.0
X-Bugzilla-Flags: 
X-Bugzilla-Changed-Fields: 
Message-ID: <bug-103818-4-k6TvVqdZLt@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-103818-4@http.gcc.gnu.org/bugzilla/>
References: <bug-103818-4@http.gcc.gnu.org/bugzilla/>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/
Auto-Submitted: auto-generated
MIME-Version: 1.0
X-BeenThere: gcc-bugs@gcc.gnu.org
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: Gcc-bugs mailing list <gcc-bugs.gcc.gnu.org>
List-Unsubscribe: <https://gcc.gnu.org/mailman/options/gcc-bugs>,
 <mailto:gcc-bugs-request@gcc.gnu.org?subject=unsubscribe>
List-Archive: <https://gcc.gnu.org/pipermail/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-request@gcc.gnu.org?subject=help>
List-Subscribe: <https://gcc.gnu.org/mailman/listinfo/gcc-bugs>,
 <mailto:gcc-bugs-request@gcc.gnu.org?subject=subscribe>
X-List-Received-Date: Sat, 09 Apr 2022 20:25:32 -0000

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D103818

--- Comment #4 from Jan Hubicka <hubicka at gcc dot gnu.org> ---
We have access list:

      Base 0: alias set 2
        Ref 0: alias set 1
          access: Parm 0 param offset:0 offset:-4611686018427387936 size:32
max_size:32
          access: Parm 0 param offset:0 offset:352 size:32 max_size:32
          access: Parm 0 param offset:0 offset:64 size:32 max_size:32
          access: Parm 0 param offset:0 offset:0 size:32 max_size:32
          access: Parm 0 param offset:0 offset:32800 size:32 max_size:32
          access: Parm 0 param offset:0 offset:160 size:32 max_size:32
          access: Parm 0 param offset:0 offset:4629700416936869888 size:32
max_size:32
          access: Parm 0 param offset:0 offset:-96 size:32 max_size:32
          access: Parm 0 param offset:0 offset:1376 size:32 max_size:32
          access: Parm 0 param offset:0 offset:224 size:32 max_size:32
          access: Parm 0 param offset:0 offset:-288 size:32 max_size:32
          access: Parm 0 param offset:0 offset:448 size:32 max_size:32
          access: Parm 0 param offset:0 offset:288 size:32 max_size:32
          access: Parm 0 param offset:0 offset:1568 size:32 max_size:32
          access: Parm 0 param offset:0 offset:640 size:32 max_size:32
          access: Parm 0 param offset:0 offset:2624 size:32 max_size:32

and we want to merge
         Parm 0 param offset:0 offset:-4611686018427387936 size:32 max_size=
:32
and
         Parm 0 param offset:0 offset:4629700416936869888 size:32 max_size:=
32
into one entry since we think they have small difference.=20=20

So an overflow issue:
      new_max_size =3D max_size2 + offset2 - offset1;=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
      if (known_le (new_max_size, max_size1))=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
        new_max_size =3D max_size1;=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20
So we need 128bit math here.
I need to look into proper way to get this right (and corresponding overflow
that makes the lgoic to choose these two entries as closest to each other.=