From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 407883858D35; Mon, 4 May 2020 06:30:17 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 407883858D35 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1588573817; bh=J4gElx/7Mj6QtZFw8VBiAQEsMNDwKdugQEktQ2m4kC8=; h=From:To:Subject:Date:In-Reply-To:References:From; b=EComcQ3DB8aYTNM1BrXkHSuhQMyqUmCqdvmvMSfN6tK+Khj9fx/JAoTqWZjNiVy5y lXRJxAZF4rz2ECkptkTu8q/heQRMBmv7mXuuy/DC0/l7TtgmMXpvjenUfah7EpeZzb URsGsv1ae6s1MvxQRrwN0ZLnpYKDTgeCRCZPhi9c= From: "rguenth at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/94908] Failure to optimally optimize certain shuffle patterns Date: Mon, 04 May 2020 06:30:17 +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: 10.0 X-Bugzilla-Keywords: missed-optimization X-Bugzilla-Severity: normal X-Bugzilla-Who: rguenth at gcc dot gnu.org X-Bugzilla-Status: NEW X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: bug_status cf_reconfirmed_on everconfirmed 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 X-BeenThere: gcc-bugs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-bugs mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 04 May 2020 06:30:17 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D94908 Richard Biener changed: What |Removed |Added ---------------------------------------------------------------------------- Status|UNCONFIRMED |NEW Last reconfirmed| |2020-05-04 Ever confirmed|0 |1 --- Comment #2 from Richard Biener --- Hmm, ideally it would be extract g()[1], insert at a[0]. But yes, we're not trying to split an not handled suffle into two but leave that for targets to sort out ... (x86 has code for many 3-insn shuffles for example).=