From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 12754 invoked by alias); 7 Dec 2004 23:13:40 -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 12734 invoked by alias); 7 Dec 2004 23:13:38 -0000 Date: Tue, 07 Dec 2004 23:13:00 -0000 Message-ID: <20041207231338.12730.qmail@sourceware.org> From: "rakdver at atrey dot karlin dot mff dot cuni dot cz" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20041202193143.18792.fjahanian@apple.com> References: <20041202193143.18792.fjahanian@apple.com> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug tree-optimization/18792] ICE with -O1 -ftree-loop-linear on small test case X-Bugzilla-Reason: CC X-SW-Source: 2004-12/txt/msg01077.txt.bz2 List-Id: ------- Additional Comments From rakdver at atrey dot karlin dot mff dot cuni dot cz 2004-12-07 23:13 ------- Subject: Re: ICE with -O1 -ftree-loop-linear on small test case > ------- Additional Comments From dberlin at dberlin dot org 2004-12-07 23:09 ------- > Subject: Re: ICE with -O1 -ftree-loop-linear > on small test case > > It's actually a bug in compute_data_dependence then, not linear xforms. > > the dist and dir vector computation functions need to map between the > loops we've asked for, and indexes in their array, in a different way. > > Currently this is done by assuming that the indexes are sequential, and > we just subtract the index of the top of the nest, and use that as the > index into the array. > If the loop indexes aren't sequential in a nest, this won't work. > We'll have to use a mapping array or something. You may use the loop->depth field for indexing the array instead. It is always updated, and of course increases sequentially within the loop nest. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18792