/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @bug 6843752
* @summary missing code for an anti-dependent Phi in GCM
*/
public class Test {
static class Item {
public boolean remove;
}
} else {
}
}
} else {
}
}
}
return;
}
boolean done = false;
// the original code "done = (item == last);" triggered an infinite loop
// and was changed slightly in order to produce an exception instead.
}
}
}
for (int i = 0; i < numItems; i++) {
}
}
int caseCnt = 0;
try {
for (; caseCnt < 500000;) {
numItems = 5;
}
}
}
} catch (Exception e) {
}
}
}