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 1CFEA3858C53; Wed,  2 Nov 2022 06:36:43 +0000 (GMT)
DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 1CFEA3858C53
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org;
	s=default; t=1667371003;
	bh=RYegV+2BGAcbpdWET9iBaeDXyXQQefg/77pQ7CiMcdc=;
	h=From:To:Subject:Date:In-Reply-To:References:From;
	b=wJkMT7X8nCwsL8mWcUv4KHfGEZGhA124y8s2BdagRUoPS3DbFwzqgdd6R3uLS0Up4
	 QQjfn19GsuQc25sf0uXl9+3M4wSXIhB6KoBYEPhrA6k02iJevB6puqqP+JyAycOBWf
	 81NaeRi7Q+CdyojbmkMVvBFHklOJ5UvW+8uyupWM=
From: "pinskia at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/105532] [11/12/13 Regression] UBSAN:
 gcc/hwint.h:293:61: runtime error: shift exponent 64 is too large for 64-bit
 type 'long unsigned int'
Date: Wed, 02 Nov 2022 06:36:40 +0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: tree-optimization
X-Bugzilla-Version: 13.0
X-Bugzilla-Keywords: ice-on-valid-code
X-Bugzilla-Severity: normal
X-Bugzilla-Who: pinskia at gcc dot gnu.org
X-Bugzilla-Status: ASSIGNED
X-Bugzilla-Resolution: 
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: pinskia at gcc dot gnu.org
X-Bugzilla-Target-Milestone: 11.4
X-Bugzilla-Flags: 
X-Bugzilla-Changed-Fields: assigned_to bug_status
Message-ID: <bug-105532-4-UCuo8iNYBx@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-105532-4@http.gcc.gnu.org/bugzilla/>
References: <bug-105532-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
List-Id: <gcc-bugs.sourceware.org>

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

Andrew Pinski <pinskia at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
           Assignee|unassigned at gcc dot gnu.org      |pinskia at gcc dot =
gnu.org
             Status|NEW                         |ASSIGNED

--- Comment #3 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
I am going to take care of this at least for GCC 13.

There is another invalid use here too:
/* Common POPCOUNT/PARITY simplifications.  */
/* popcount(X&C1) is (X>>C2)&1 when C1 =3D=3D 1<<C2.  Same for parity(X&C1)=
.  */
(for pfun (POPCOUNT PARITY)
  (simplify
    (pfun @0)
    (with { wide_int nz =3D tree_nonzero_bits (@0); }
      (switch
        (if (nz =3D=3D 1)
          (convert @0))
        (if (wi::popcount (nz) =3D=3D 1)
          (with { tree utype =3D unsigned_type_for (TREE_TYPE (@0)); }
            (convert (rshift:utype (convert:utype @0)
                                   { build_int_cst (integer_type_node,
                                                    wi::ctz (nz)); }))))))))

Found while running the testsuite on x86_64.

Another one:
/* POPCOUNT simplifications.  */
/* popcount(X) + popcount(Y) is popcount(X|Y) when X&Y must be zero.  */
(simplify
  (plus (POPCOUNT:s @0) (POPCOUNT:s @1))
  (if (wi::bit_and (tree_nonzero_bits (@0), tree_nonzero_bits (@1)) =3D=3D =
0)
    (POPCOUNT (bit_ior @0 @1))))


Those 3 are only ones I see in match.pd (the other uses of tree_nonzero_bits
checks the type before the call).=