From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 27968 invoked by alias); 21 Jun 2010 15:22:53 -0000 Received: (qmail 27771 invoked by uid 48); 21 Jun 2010 15:22:19 -0000 Date: Mon, 21 Jun 2010 15:22:00 -0000 Message-ID: <20100621152219.27770.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug fortran/41137] inefficient zeroing of an array In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "burnus at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2010-06/txt/msg02057.txt.bz2 ------- Comment #8 from burnus at gcc dot gnu dot org 2010-06-21 15:22 ------- (In reply to comment #7) > I get for the example the following values, note especially the newly added > CONTIGUOUS result: For the test case, see attachment 20966 at PR 44612; that PR I have filled because GCC does not optimize away the loops, which only set but never read the value from the variable. (Ifort does this optimization.) Additionally, if one prints the variable, ifort is twice as fast. For curiosity: Using NAG, the timing is 0.6900000 vs. 1.2200000, i.e. the assumed-shape version is actually faster [though, its overall the performance is poor]. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=41137