From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugs-return-452461-listarch-gcc-bugs=gcc.gnu.org@gcc.gnu.org>
Received: (qmail 13064 invoked by alias); 25 May 2014 16:12:05 -0000
Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm
Precedence: bulk
List-Id: <gcc-bugs.gcc.gnu.org>
List-Archive: <http://gcc.gnu.org/ml/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-help@gcc.gnu.org>
Sender: gcc-bugs-owner@gcc.gnu.org
Received: (qmail 13032 invoked by uid 48); 25 May 2014 16:12:01 -0000
From: "asolokha at gmx dot com" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/61279] [4.10 Regression] ICE in loop_preheader_edge, at cfgloop.c:1668 w/ -O1 -ftree-loop-vectorize
Date: Sun, 25 May 2014 16:12:00 -0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: tree-optimization
X-Bugzilla-Version: 4.10.0
X-Bugzilla-Keywords: ice-on-valid-code
X-Bugzilla-Severity: normal
X-Bugzilla-Who: asolokha at gmx dot com
X-Bugzilla-Status: WAITING
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: rguenth at gcc dot gnu.org
X-Bugzilla-Target-Milestone: 4.10.0
X-Bugzilla-Flags:
X-Bugzilla-Changed-Fields:
Message-ID: <bug-61279-4-eII5dHnOqI@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-61279-4@http.gcc.gnu.org/bugzilla/>
References: <bug-61279-4@http.gcc.gnu.org/bugzilla/>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 7bit
X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/
Auto-Submitted: auto-generated
MIME-Version: 1.0
X-SW-Source: 2014-05/txt/msg02153.txt.bz2

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=61279

--- Comment #4 from Arseny Solokha <asolokha at gmx dot com> ---
I even have another reproducer which is basically identical to the original one
but not completely.

int t;
int n[1] = { 0 };

void
x(void)
{
  int v;
  int r;
  int i[4] = { 0 };
  for (v = 0; v < 1; ++v) {
    ++i[3];
    for (r = 0; r < 1; ++r) {
      for (t = 0; t < 1; ++t)
        return;
      for (t = 0; t < 1; ++t)
        /* Irregardless of i's declared size, the ICE only occurs
           when the array subscript on lines 18 and 11 is exactly 3
           (I've checked only the nearest values, however). */
        i[3] = n[t];
      for (t = 0; t < 1; ++t)
        return;
    }
  }
}