From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 26463 invoked by alias); 12 Sep 2005 10:03:36 -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 26310 invoked by uid 48); 12 Sep 2005 10:03:11 -0000 Date: Mon, 12 Sep 2005 10:03:00 -0000 Message-ID: <20050912100311.26309.qmail@sourceware.org> From: "rguenth at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20030911065615.12245.gccBug.9.OkianWarrior@SpamGourmet.com> References: <20030911065615.12245.gccBug.9.OkianWarrior@SpamGourmet.com> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug c/12245] [3.4/4.0/4.1 regression] Uses lots of memory when compiling large initialized arrays X-Bugzilla-Reason: CC X-SW-Source: 2005-09/txt/msg01421.txt.bz2 List-Id: ------- Additional Comments From rguenth at gcc dot gnu dot org 2005-09-12 10:03 ------- One problem is that we use integer tree nodes for counting from zero to N, which is just stupid and wastes RAM (because we do not collect during building the initializer). Of course we also store that "index" in the initializer element list. This whole mess asks for a (less general) rewrite. Minimal-invasive surgery is impossible. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=12245