aboutsummaryrefslogtreecommitdiff
path: root/libstdc++-v3/include/std/chrono
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2021-04-06 11:21:47 +0200
committerRichard Biener <rguenther@suse.de>2021-04-06 12:15:30 +0200
commit58cd9fc8a61de09ba181c5ed5ac7fb91ec506414 (patch)
tree6646a9e6dd1527803285dfe079847d69b4a4bd63 /libstdc++-v3/include/std/chrono
parentffc2331d7994d7fabb1f6ebed931024a9bbe69f2 (diff)
downloadgcc-58cd9fc8a61de09ba181c5ed5ac7fb91ec506414.zip
gcc-58cd9fc8a61de09ba181c5ed5ac7fb91ec506414.tar.gz
gcc-58cd9fc8a61de09ba181c5ed5ac7fb91ec506414.tar.bz2
tree-optimization/99924 - visit permute nodes again when partitioning
Since SLP graph partitioning works on scalar stmts (because it's done for costing) we have to make sure to visit permute nodes multiple times since they will not pull partitions together. 2021-04-06 Richard Biener <rguenther@suse.de> PR tree-optimization/99924 * tree-vect-slp.c (vect_bb_partition_graph_r): Do not mark nodes w/o scalar stmts as visited. * gfortran.dg/vect/pr99924.f90: New testcase.
Diffstat (limited to 'libstdc++-v3/include/std/chrono')
0 files changed, 0 insertions, 0 deletions