From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugs-return-498606-listarch-gcc-bugs=gcc.gnu.org@gcc.gnu.org>
Received: (qmail 108330 invoked by alias); 2 Oct 2015 10:53:58 -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 108281 invoked by uid 48); 2 Oct 2015 10:53:54 -0000
From: "rguenth at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/67816] [6 Regression] ICE in duplicate_thread_path, 186.crafty fails to build
Date: Fri, 02 Oct 2015 10:53: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: 6.0
X-Bugzilla-Keywords:
X-Bugzilla-Severity: normal
X-Bugzilla-Who: rguenth at gcc dot gnu.org
X-Bugzilla-Status: UNCONFIRMED
X-Bugzilla-Resolution:
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org
X-Bugzilla-Target-Milestone: 6.0
X-Bugzilla-Flags:
X-Bugzilla-Changed-Fields:
Message-ID: <bug-67816-4-YQAOsh2SaI@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-67816-4@http.gcc.gnu.org/bugzilla/>
References: <bug-67816-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: 2015-10/txt/msg00161.txt.bz2

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

--- Comment #1 from Richard Biener <rguenth at gcc dot gnu.org> ---
Seen with r228349 btw.  Delta-reduced testcase:

typedef struct {
    int path[65];
} CHESS_PATH;
extern int early_exit;
extern int number_of_solutions;
extern int solutions[10];
extern int solution_type;
extern int iteration_depth;
extern int hash_table_size;
extern int *last[65];
extern signed char searched_this_root_move[256];
extern unsigned int root_nodes[256];
extern CHESS_PATH pv[65];
int Iterate(int wtm, int search_type, int root_list_done)
{
  int *mvp;
  int i, value=0, time_used;
  int correct, correct_count, material=0, sorted, temp;
  for (; iteration_depth<=60; iteration_depth++) {
      for (mvp=last[0]; mvp<last[1]; mvp++)
        searched_this_root_move[mvp-last[0]]=0;
      for (i=0; i<number_of_solutions; i++) {
          if (!solution_type) { 
              if (solutions[i] == pv[1].path[1]) correct=1;         }
          else if (solutions[i] == pv[1].path[1]) correct=0;
      }
      if (correct) correct_count++;
      if (correct_count >= early_exit) break;
      do {
          sorted=1;
          for (mvp=last[0]+1; mvp<last[1]-1; mvp++) {
              if (root_nodes[mvp-last[0]] < root_nodes[mvp-last[0]+1]) {
                  temp=*mvp;
                  *mvp=*(mvp+1);
                  *(mvp+1)=temp;
                  temp=root_nodes[mvp-last[0]];
                  root_nodes[mvp-last[0]]=root_nodes[mvp-last[0]+1];
                  root_nodes[mvp-last[0]+1]=temp;
                  sorted=0;
              }
          }
      }
      while(!sorted);
  }
}