From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 31841 invoked by alias); 4 Jun 2004 13:02:07 -0000 Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org Received: (qmail 31832 invoked by uid 48); 4 Jun 2004 13:02:06 -0000 Date: Fri, 04 Jun 2004 13:02:00 -0000 Message-ID: <20040604130206.31831.qmail@sourceware.org> From: "tobi at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20031222120317.13465.toon@moene.indiv.nluug.nl> References: <20031222120317.13465.toon@moene.indiv.nluug.nl> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug fortran/13465] [gfortran] Data statement for large arrays compiles verrrry slllowwwly and shows quadratic behaviour. X-Bugzilla-Reason: CC X-SW-Source: 2004-06/txt/msg00461.txt.bz2 List-Id: ------- Additional Comments From tobi at gcc dot gnu dot org 2004-06-04 13:02 ------- The quadratic complexity comes from linearly traversing the list of data initializers and then calling gfc_assign_data_value which in turn calls gfc_insert_constructor. gfc_insert_constructor searches linearly through the array until it finds the right place to insert the constructor. Hence we have quadratic complexity. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=13465