2020-05-22 Richard Biener <rguenther@suse.de>
+ PR tree-optimization/95248
+ * tree-ssa-loop-im.c (sm_seq_valid_bb): Remove bogus early out.
+
+2020-05-22 Richard Biener <rguenther@suse.de>
+
* tree-vectorizer.h (_slp_tree::_slp_tree): New.
(_slp_tree::~_slp_tree): Likewise.
* tree-vect-slp.c (_slp_tree::_slp_tree): Factor out code
+2020-05-22 Richard Biener <rguenther@suse.de>
+
+ PR tree-optimization/95248
+ * gcc.dg/torture/pr95248.c: New testcase.
+
2020-05-21 Patrick Palka <ppalka@redhat.com>
PR c++/94038
--- /dev/null
+/* { dg-do run } */
+/* { dg-require-effective-target int32plus } */
+
+int var_2 = -2013646301;
+int var_3 = -1126567434;
+unsigned int var_12 = 1;
+unsigned int var_19;
+unsigned int arr_25 [24] [21] [15] [17] [15] ;
+
+void __attribute__((noipa)) test()
+{
+ for (int a = 0; a < 3; a = 42)
+ for (int b = 0; b < 20; b++)
+ for (int c = 0; c < 4; c = 4)
+ for (int d = 0; d < 6; d += 4)
+ for (int e = 0; e < 4; e += 2) {
+ arr_25[a][b][c][d][e] = var_2 || var_3;
+ var_19 = var_12;
+ }
+}
+
+int main()
+{
+ test();
+ if (var_19 != 1)
+ __builtin_abort ();
+ return 0;
+}
/* Use the sequence from the first edge and push SMs down. */
for (unsigned i = 0; i < first_edge_seq.length (); ++i)
{
- if (first_edge_seq[i].second == sm_other)
- break;
unsigned id = first_edge_seq[i].first;
seq.safe_push (first_edge_seq[i]);
unsigned new_idx;