* [PATCH] Use stablesort for sorting association chain
@ 2021-06-11 7:29 Richard Biener
0 siblings, 0 replies; only message in thread
From: Richard Biener @ 2021-06-11 7:29 UTC (permalink / raw)
To: gcc-patches
This should preserve the original association order as much as possible
for the initial SLP discovery attempt and also improve consistency.
Bootstrapped and tested on x86_64-unknown-linux-gnu, pushed.
2021-06-11 Richard Biener <rguenther@suse.de>
* tree-vect-slp.c (vect_build_slp_tree_2): Use stablesort
to sort operands of the associative chain.
---
gcc/tree-vect-slp.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/gcc/tree-vect-slp.c b/gcc/tree-vect-slp.c
index c4f8f38012f..6237a61ffd4 100644
--- a/gcc/tree-vect-slp.c
+++ b/gcc/tree-vect-slp.c
@@ -1865,7 +1865,7 @@ vect_build_slp_tree_2 (vec_info *vinfo, slp_tree node,
/* Now we have a set of chains with the same length. */
/* 1. pre-sort according to def_type and operation. */
for (unsigned lane = 0; lane < group_size; ++lane)
- chains[lane].sort (dt_sort_cmp, vinfo);
+ chains[lane].stablesort (dt_sort_cmp, vinfo);
if (dump_enabled_p ())
{
dump_printf_loc (MSG_NOTE, vect_location,
--
2.26.2
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2021-06-11 7:29 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2021-06-11 7:29 [PATCH] Use stablesort for sorting association chain Richard Biener
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).