This is the mail archive of the
mailing list for the GCC project.
Re: [PATCH]: Fix PR tree-optimization/18792
- From: Fariborz Jahanian <fjahanian at apple dot com>
- To: Daniel Berlin <dberlin at dberlin dot org>
- Cc: "gcc-patches at gcc dot gnu dot org Patches" <gcc-patches at gcc dot gnu dot org>
- Date: Thu, 9 Dec 2004 17:33:53 -0800
- Subject: Re: [PATCH]: Fix PR tree-optimization/18792
- References: <Pine.LNX.email@example.com>
On Dec 8, 2004, at 4:00 PM, Daniel Berlin wrote:
It turns out we can't depend on loop index numbers being in any
When it didn't happen, like the testcase in 18792,
This fixes it to use loop depth as the index into the distance and
direction vectors when building them, as well as fixing the parts of
tree-loop-linear that indexed into those arrays
This should work, as the function already assumes there are no sibling
loops in the nest, etc.
Bootstrapped and regtested on i686-pc-linux-gnu.
Okay for mainline?
2004-12-07 Daniel Berlin <firstname.lastname@example.org>
Fix PR tree-optimization/18792
* tree-data-ref.c (build_classic_dist_vector): Change first_loop
to first_loop_depth, and use loop depth instead of loop number.
(compute_data_dependences_for_loop): Use depth, not loop number.
* tree-loop-linear.c (try_interchange_loops): Use loop depth, not loop
number. Pass in loops, instead of loop numbers.
This patch has passed bootstrap and dejagnu testing on apple-ppc-darwin.