Test1.java revision 4502
1472N/A * Copyright (c) 2009, Oracle and/or its affiliates. All rights reserved. 667N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 667N/A * This code is free software; you can redistribute it and/or modify it 667N/A * under the terms of the GNU General Public License version 2 only, as 667N/A * published by the Free Software Foundation. 667N/A * This code is distributed in the hope that it will be useful, but WITHOUT 667N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 667N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 667N/A * version 2 for more details (a copy is included in the LICENSE file that 667N/A * accompanied this code). 667N/A * You should have received a copy of the GNU General Public License version 667N/A * 2 along with this work; if not, write to the Free Software Foundation, 667N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 1472N/A * or visit www.oracle.com if you need additional information or have any 667N/A * @summary SuperWord::co_locate_pack(Node_List* p) generates memory graph that leads to memory order violation. 667N/A // initialize the arrays 667N/A dst[i] =
2;
// yes, dst[i] needed(otherwise src[i] will be replaced with i) 667N/A ref[i] =
src[i];
// src[i] depends on the store src[i] 667N/A // check whether src and ref are equal 667N/A for (
int i=
0; i<
2000; i++) {