OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

genopinit.c (main): Use vec<>::qsort method. 

2014-06-17  Richard Biener  <rguenther@suse.de>

	* genopinit.c (main): Use vec<>::qsort method.
	* tree-ssa-loop-niter.c (discover_iteration_bound_by_body_walk):
	Likewise.
	* tree-vect-data-refs.c (vect_analyze_data_ref_accesses): Likewise.

From-SVN: r211738
This commit is contained in:
Richard Biener 2014-06-17 13:15:53 +00:00 committed by Richard Biener
parent e58b74ea3d
commit 75509ba24a
4 changed files with 10 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -1,3 +1,10 @@
2014-06-17 Richard Biener <rguenther@suse.de>
* genopinit.c (main): Use vec<>::qsort method.
* tree-ssa-loop-niter.c (discover_iteration_bound_by_body_walk):
Likewise.
* tree-vect-data-refs.c (vect_analyze_data_ref_accesses): Likewise.
2014-06-17 Matthew Fortune <matthew.fortune@imgtec.com>
* config/mips/mips-protos.h (mips_expand_fcc_reload): Remove.

3
gcc/genopinit.c
View File

@ -357,8 +357,7 @@ main (int argc, char **argv)
}
/* Sort the collected patterns. */
qsort (patterns.address (), patterns.length (),
sizeof (pattern), pattern_cmp);
patterns.qsort (pattern_cmp);
/* Now that we've handled the "extra" patterns, eliminate them from
the optabs array. That way they don't get in the way below. */

3
gcc/tree-ssa-loop-niter.c
View File

@ -3144,8 +3144,7 @@ discover_iteration_bound_by_body_walk (struct loop *loop)
fprintf (dump_file, " Trying to walk loop body to reduce the bound.\n");
/* Sort the bounds in decreasing order. */
qsort (bounds.address (), bounds.length (),
sizeof (widest_int), wide_int_cmp);
bounds.qsort (wide_int_cmp);
/* For every basic block record the lowest bound that is guaranteed to
terminate the loop. */

3
gcc/tree-vect-data-refs.c
View File

@ -2508,8 +2508,7 @@ vect_analyze_data_ref_accesses (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo)
linear. Don't modify the original vector's order, it is needed for
determining what dependencies are reversed. */
vec<data_reference_p> datarefs_copy = datarefs.copy ();
qsort (datarefs_copy.address (), datarefs_copy.length (),
sizeof (data_reference_p), dr_group_sort_cmp);
datarefs_copy.qsort (dr_group_sort_cmp);
/* Build the interleaving chains. */
for (i = 0; i < datarefs_copy.length () - 1;)