diff options
| author | Richard Biener <rguenther@suse.de> | 2013-11-21 13:57:40 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2013-11-21 13:57:40 +0000 |
| commit | b05e02332f86e3168b96708263a88ec8f07c5e5a (patch) | |
| tree | 8e642d44a66bc1192bf5b9d678473043c95ac1e7 /gcc/tree-vect-loop-manip.c | |
| parent | 32f9be169ca3c5e1c56735c8b1e076570d56389c (diff) | |
| download | gcc-b05e02332f86e3168b96708263a88ec8f07c5e5a.zip gcc-b05e02332f86e3168b96708263a88ec8f07c5e5a.tar.gz gcc-b05e02332f86e3168b96708263a88ec8f07c5e5a.tar.bz2 | |
tree-vectorizer.h (LOC, [...]): Remove wrappers and fix all users.
2013-11-21 Richard Biener <rguenther@suse.de>
* tree-vectorizer.h (LOC, UNKNOWN_LOC, EXPR_LOC, LOC_FILE,
LOC_LINE): Remove wrappers and fix all users.
(struct _loop_vec_info): Remove loop_line_number member.
(LOOP_VINFO_LOC): Remove.
* tree-parloops.c, tree-vect-loop-manip.c, tree-vect-slp.c,
tree-vectorizer.c: Fix users of LOC, UNKNOWN_LOC, EXPR_LOC, LOC_FILE
and LOC_LINE.
From-SVN: r205216
Diffstat (limited to 'gcc/tree-vect-loop-manip.c')
| -rw-r--r-- | gcc/tree-vect-loop-manip.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/gcc/tree-vect-loop-manip.c b/gcc/tree-vect-loop-manip.c index a03b54c..f5192e8 100644 --- a/gcc/tree-vect-loop-manip.c +++ b/gcc/tree-vect-loop-manip.c @@ -661,7 +661,7 @@ slpeel_make_loop_iterate_ntimes (struct loop *loop, tree niters) bool insert_after; tree init = build_int_cst (TREE_TYPE (niters), 0); tree step = build_int_cst (TREE_TYPE (niters), 1); - LOC loop_loc; + source_location loop_loc; enum tree_code code; orig_cond = get_loop_exit_condition (loop); @@ -691,9 +691,9 @@ slpeel_make_loop_iterate_ntimes (struct loop *loop, tree niters) loop_loc = find_loop_location (loop); if (dump_enabled_p ()) { - if (LOCATION_LOCUS (loop_loc) != UNKNOWN_LOC) - dump_printf (MSG_NOTE, "\nloop at %s:%d: ", LOC_FILE (loop_loc), - LOC_LINE (loop_loc)); + if (LOCATION_LOCUS (loop_loc) != UNKNOWN_LOCATION) + dump_printf (MSG_NOTE, "\nloop at %s:%d: ", LOCATION_FILE (loop_loc), + LOCATION_LINE (loop_loc)); dump_gimple_stmt (MSG_NOTE, TDF_SLIM, cond_stmt, 0); dump_printf (MSG_NOTE, "\n"); } @@ -1057,7 +1057,7 @@ slpeel_tree_peel_loop_to_edge (struct loop *loop, basic_block new_exit_bb; gimple_stmt_iterator gsi; edge exit_e = single_exit (loop); - LOC loop_loc; + source_location loop_loc; tree cost_pre_condition = NULL_TREE; /* There are many aspects to how likely the first loop is going to be executed. Without histogram we can't really do good job. Simply set it to @@ -1365,7 +1365,7 @@ slpeel_tree_peel_loop_to_edge (struct loop *loop, location is calculated. Return the loop location if succeed and NULL if not. */ -LOC +source_location find_loop_location (struct loop *loop) { gimple stmt = NULL; @@ -1373,7 +1373,7 @@ find_loop_location (struct loop *loop) gimple_stmt_iterator si; if (!loop) - return UNKNOWN_LOC; + return UNKNOWN_LOCATION; stmt = get_loop_exit_condition (loop); @@ -1385,7 +1385,7 @@ find_loop_location (struct loop *loop) try to estimate the loop location */ if (!loop->header) - return UNKNOWN_LOC; + return UNKNOWN_LOCATION; bb = loop->header; @@ -1396,7 +1396,7 @@ find_loop_location (struct loop *loop) return gimple_location (stmt); } - return UNKNOWN_LOC; + return UNKNOWN_LOCATION; } @@ -2224,7 +2224,7 @@ vect_loop_versioning (loop_vec_info loop_vinfo, loop_version (loop, cond_expr, &condition_bb, prob, prob, REG_BR_PROB_BASE - prob, true); - if (LOCATION_LOCUS (vect_location) != UNKNOWN_LOC + if (LOCATION_LOCUS (vect_location) != UNKNOWN_LOCATION && dump_enabled_p ()) { if (version_alias) |