From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 5BD7B3851C0D; Sat, 17 Jul 2021 03:36:06 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 5BD7B3851C0D From: "pinskia at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/101481] [11/12 Regression] -ftree-loop-distribute-patterns can slow down and increases size of code Date: Sat, 17 Jul 2021 03:36:06 +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: unknown X-Bugzilla-Keywords: missed-optimization X-Bugzilla-Severity: normal X-Bugzilla-Who: pinskia 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: 11.2 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: everconfirmed keywords target_milestone cf_reconfirmed_on short_desc bug_status 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: Sat, 17 Jul 2021 03:36:06 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D101481 Andrew Pinski changed: What |Removed |Added ---------------------------------------------------------------------------- Ever confirmed|0 |1 Keywords| |missed-optimization Target Milestone|--- |11.2 Last reconfirmed| |2021-07-17 Summary|-ftree-loop-distribute-patt |[11/12 Regression] |erns can slow down and |-ftree-loop-distribute-patt |increases size of code |erns can slow down and | |increases size of code Status|UNCONFIRMED |NEW --- Comment #1 from Andrew Pinski --- Confirmed. The ranges should be figured out that the max size is 4. In fact GCC knows the range really (note I think it is really [0,2] but tha= t is a different issue) and the loop bounds is max 4. ;; basic block 6, loop depth 1, count 805306369 (estimated locally), maybe hot ;; prev block 8, next block 9, flags: (NEW, REACHABLE, VISITED) ;; pred: 9 [always] count:603979777 (estimated locally) (FALLTHRU,DFS_BACK) ;; 8 [always] count:201326592 (estimated locally) (FALLTHRU) # RANGE [-1, 2] # i_17 =3D PHI # .MEM_21 =3D PHI <.MEM_15(9), .MEM_9(D)(8)> # RANGE [1, 3] NONZERO 3 _4 =3D i_17 + 1; # VUSE <.MEM_21> _5 =3D a_10(D)->chunksD.1943[i_17]; # .MEM_15 =3D VDEF <.MEM_21> a_10(D)->chunksD.1943[_4] =3D _5; # RANGE [-1, 1] i_16 =3D i_17 + -1; if (i_16 >=3D _20) goto ; [75.00%] else goto ; [25.00%] ;; succ: 9 [75.0% (guessed)] count:603979777 (estimated locally) (TRUE_VALUE,EXECUTABLE) ;; 7 [25.0% (guessed)] count:201326592 (estimated locally) (FALSE_VALUE,EXECUTABLE) ;; basic block 9, loop depth 1, count 603979777 (estimated locally), maybe hot ;; prev block 6, next block 7, flags: (NEW) ;; pred: 6 [75.0% (guessed)] count:603979777 (estimated locally) (TRUE_VALUE,EXECUTABLE) goto ; [100.00%] ;; succ: 6 [always] count:603979777 (estimated locally) (FALLTHRU,DFS_BACK)=