diff options
| author | Richard Sandiford <richard.sandiford@arm.com> | 2018-07-31 14:23:48 +0000 |
|---|---|---|
| committer | Richard Sandiford <rsandifo@gcc.gnu.org> | 2018-07-31 14:23:48 +0000 |
| commit | 211ee39b9d1d7d670dd4885bd1f4f038680a1e90 (patch) | |
| tree | 39cc3b566dd8b7db1122b5f3ec283ba082495f7c /gcc/tree-vectorizer.h | |
| parent | 7bcbf2d83269394899f27695e19715dca8f098bf (diff) | |
| download | gcc-211ee39b9d1d7d670dd4885bd1f4f038680a1e90.zip gcc-211ee39b9d1d7d670dd4885bd1f4f038680a1e90.tar.gz gcc-211ee39b9d1d7d670dd4885bd1f4f038680a1e90.tar.bz2 | |
[24/46] Make stmt_info_for_cost use a stmt_vec_info
This patch makes stmt_info_for_cost carry a stmt_vec_info instead
of a gimple stmt. The structure is internal to the vectoriser,
so targets aren't affected.
2018-07-31 Richard Sandiford <richard.sandiford@arm.com>
gcc/
* tree-vectorizer.h (stmt_info_for_cost::stmt): Replace with...
(stmt_info_for_cost::stmt_info): ...this new field.
(add_stmt_costs): Update accordingly.
* tree-vect-loop.c (vect_compute_single_scalar_iteration_cost)
(vect_get_known_peeling_cost): Likewise.
(vect_estimate_min_profitable_iters): Likewise.
* tree-vect-stmts.c (record_stmt_cost): Likewise.
From-SVN: r263139
Diffstat (limited to 'gcc/tree-vectorizer.h')
| -rw-r--r-- | gcc/tree-vectorizer.h | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/gcc/tree-vectorizer.h b/gcc/tree-vectorizer.h index ff3b4c6..fa206a2 100644 --- a/gcc/tree-vectorizer.h +++ b/gcc/tree-vectorizer.h @@ -116,7 +116,7 @@ struct stmt_info_for_cost { int count; enum vect_cost_for_stmt kind; enum vect_cost_model_location where; - gimple *stmt; + stmt_vec_info stmt_info; int misalign; }; @@ -1282,10 +1282,7 @@ add_stmt_costs (void *data, stmt_vector_for_cost *cost_vec) stmt_info_for_cost *cost; unsigned i; FOR_EACH_VEC_ELT (*cost_vec, i, cost) - add_stmt_cost (data, cost->count, cost->kind, - (cost->stmt - ? vinfo_for_stmt (cost->stmt) - : NULL_STMT_VEC_INFO), + add_stmt_cost (data, cost->count, cost->kind, cost->stmt_info, cost->misalign, cost->where); } |