diff options
| author | Laurynas Biveinis <laurynas.biveinis@gmail.com> | 2010-04-22 12:42:15 +0000 |
|---|---|---|
| committer | Laurynas Biveinis <lauras@gcc.gnu.org> | 2010-04-22 12:42:15 +0000 |
| commit | f873b20530f315ec0691a6c71ce4b430143975c6 (patch) | |
| tree | 378620453122ae49e7bf7e0d9a64259baa14bbcd /gcc/tree-loop-linear.c | |
| parent | b99279f36bd0bd5865cce14d6bb93db25101a5d4 (diff) | |
| download | gcc-f873b20530f315ec0691a6c71ce4b430143975c6.zip gcc-f873b20530f315ec0691a6c71ce4b430143975c6.tar.gz gcc-f873b20530f315ec0691a6c71ce4b430143975c6.tar.bz2 | |
tree-parloops.c (loop_parallel_p): New argument parloop_obstack.
2010-04-22 Laurynas Biveinis <laurynas.biveinis@gmail.com>
* tree-parloops.c (loop_parallel_p): New argument
parloop_obstack. Pass it down.
(parallelize_loops): New variable parloop_obstack. Initialize it,
pass it down, free it.
* tree-loop-linear.c (linear_transform_loops): Pass down
lambda_obstack.
* tree-data-ref.h (lambda_compute_access_matrices): New argument
of type struct obstack *.
* tree-data-ref.c (analyze_subscript_affine_affine): New variable
scratch_obstack. Initialize it, pass down, free it.
* lambda.h (lambda_loop_new): Remove.
(lambda_matrix_new, lambda_matrix_inverse)
(lambda_trans_matrix_new, lambda_trans_matrix_inverse): New
argument of type struct obstack *.
* lambda-trans.c (lambda_trans_matrix_new): New argument
lambda_obstack. Pass it down, use obstack allocation for ret.
(lambda_trans_matrix_inverse): New argument lambda_obstack. Pass
it down.
* lambda-mat.c (lambda_matrix_get_column)
(lambda_matrix_project_to_null): Remove.
(lambda_matrix_new): New argument lambda_obstack. Use obstack
allocation for mat.
(lambda_matrix_inverse_hard, lambda_matrix_inverse): New argument
lambda_obstack.
* lambda-code.c (lambda_loop_new): New function.
(lambda_lattice_new, compute_nest_using_fourier_motzkin)
(lambda_compute_auxillary_space, lambda_compute_target_space)
(lambda_loopnest_transform, gcc_loop_to_lambda_loop)
(lambda_loopnest_to_gcc_loopnest): Pass down lambda_obstack.
(build_access_matrix): New argument lambda_obstack. Use obstack
allocation for am.
(lambda_compute_step_signs, lambda_compute_access_matrices): New
argument lambda_obstack. Pass it down.
From-SVN: r158644
Diffstat (limited to 'gcc/tree-loop-linear.c')
| -rw-r--r-- | gcc/tree-loop-linear.c | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/gcc/tree-loop-linear.c b/gcc/tree-loop-linear.c index 04731c7..047389c 100644 --- a/gcc/tree-loop-linear.c +++ b/gcc/tree-loop-linear.c @@ -358,14 +358,15 @@ linear_transform_loops (void) goto free_and_continue; lambda_collect_parameters (datarefs, &lambda_parameters); - if (!lambda_compute_access_matrices (datarefs, lambda_parameters, nest)) + if (!lambda_compute_access_matrices (datarefs, lambda_parameters, + nest, &lambda_obstack)) goto free_and_continue; if (dump_file && (dump_flags & TDF_DETAILS)) dump_ddrs (dump_file, dependence_relations); /* Build the transformation matrix. */ - trans = lambda_trans_matrix_new (depth, depth); + trans = lambda_trans_matrix_new (depth, depth, &lambda_obstack); lambda_matrix_id (LTM_MATRIX (trans), depth); trans = try_interchange_loops (trans, depth, dependence_relations, datarefs, loop_nest); |