From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 2752B385829E; Fri, 16 Feb 2024 12:57:47 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 2752B385829E DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1708088267; bh=RqHtcJgNRjHUX6pm1A9nl9/b2OHl2DQU7nmz4XGjSzM=; h=From:To:Subject:Date:In-Reply-To:References:From; b=AVFwjgkmZwo/Mx0RSAD3bacTfvK4i85tfgleEvYbMe1fIQxaEGKhiqDxAIFUVcyf5 1XKOqhxwTFDLpK8zNqACnh6w+vnbQ8Wy5DHnsxwgyionlV2Xojx/uZw0xFw3o8rCN6 oh4c9ve4TekLXNfMZI/7CEIKrZwK3BSrw/54m9UM= From: "rguenth at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/113910] [12/13 Regression] Factor 15 slowdown compiling AMDGPUDisassembler.cpp on SPARC Date: Fri, 16 Feb 2024 12:57:45 +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: 14.0 X-Bugzilla-Keywords: compile-time-hog, needs-bisection X-Bugzilla-Severity: normal X-Bugzilla-Who: rguenth at gcc dot gnu.org X-Bugzilla-Status: ASSIGNED X-Bugzilla-Resolution: X-Bugzilla-Priority: P2 X-Bugzilla-Assigned-To: rguenth at gcc dot gnu.org X-Bugzilla-Target-Milestone: 12.4 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: Message-ID: In-Reply-To: References: 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: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D113910 --- Comment #17 from Richard Biener --- The following still helps quite a bit on its own. diff --git a/gcc/bitmap.cc b/gcc/bitmap.cc index 459e32c1ad1..a05ad810800 100644 --- a/gcc/bitmap.cc +++ b/gcc/bitmap.cc @@ -2695,18 +2695,21 @@ hashval_t bitmap_hash (const_bitmap head) { const bitmap_element *ptr; - BITMAP_WORD hash =3D 0; + hashval_t hash =3D 0; int ix; gcc_checking_assert (!head->tree_form); for (ptr =3D head->first; ptr; ptr =3D ptr->next) { - hash ^=3D ptr->indx; + hash =3D iterative_hash_hashval_t (ptr->indx, hash); for (ix =3D 0; ix !=3D BITMAP_ELEMENT_WORDS; ix++) - hash ^=3D ptr->bits[ix]; + if (sizeof (BITMAP_WORD) > sizeof (hashval_t)) + hash =3D iterative_hash_host_wide_int (ptr->bits[ix], hash); + else + hash =3D iterative_hash_hashval_t (ptr->bits[ix], hash); } - return iterative_hash (&hash, sizeof (hash), 0); + return hash; } ^L=