mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-18 10:04:42 +02:00
8011706: specjvm2008 test xml.transform gets array bound exception with c1
Loop invariant code motion may move load before store to the same field Reviewed-by: kvn
This commit is contained in:
parent
ca90185607
commit
c99c99aa36
2 changed files with 69 additions and 2 deletions
|
@ -316,6 +316,7 @@ class LoopInvariantCodeMotion : public StackObj {
|
||||||
ShortLoopOptimizer* _short_loop_optimizer;
|
ShortLoopOptimizer* _short_loop_optimizer;
|
||||||
Instruction* _insertion_point;
|
Instruction* _insertion_point;
|
||||||
ValueStack * _state;
|
ValueStack * _state;
|
||||||
|
bool _insert_is_pred;
|
||||||
|
|
||||||
void set_invariant(Value v) const { _gvn->set_processed(v); }
|
void set_invariant(Value v) const { _gvn->set_processed(v); }
|
||||||
bool is_invariant(Value v) const { return _gvn->is_processed(v); }
|
bool is_invariant(Value v) const { return _gvn->is_processed(v); }
|
||||||
|
@ -339,6 +340,7 @@ LoopInvariantCodeMotion::LoopInvariantCodeMotion(ShortLoopOptimizer *slo, Global
|
||||||
|
|
||||||
assert(insertion_block->end()->as_Base() == NULL, "cannot insert into entry block");
|
assert(insertion_block->end()->as_Base() == NULL, "cannot insert into entry block");
|
||||||
_insertion_point = insertion_block->end()->prev();
|
_insertion_point = insertion_block->end()->prev();
|
||||||
|
_insert_is_pred = loop_header->is_predecessor(insertion_block);
|
||||||
|
|
||||||
BlockEnd *block_end = insertion_block->end();
|
BlockEnd *block_end = insertion_block->end();
|
||||||
_state = block_end->state_before();
|
_state = block_end->state_before();
|
||||||
|
@ -379,13 +381,13 @@ void LoopInvariantCodeMotion::process_block(BlockBegin* block) {
|
||||||
} else if (cur->as_LoadField() != NULL) {
|
} else if (cur->as_LoadField() != NULL) {
|
||||||
LoadField* lf = (LoadField*)cur;
|
LoadField* lf = (LoadField*)cur;
|
||||||
// deoptimizes on NullPointerException
|
// deoptimizes on NullPointerException
|
||||||
cur_invariant = !lf->needs_patching() && !lf->field()->is_volatile() && !_short_loop_optimizer->has_field_store(lf->field()->type()->basic_type()) && is_invariant(lf->obj());
|
cur_invariant = !lf->needs_patching() && !lf->field()->is_volatile() && !_short_loop_optimizer->has_field_store(lf->field()->type()->basic_type()) && is_invariant(lf->obj()) && _insert_is_pred;
|
||||||
} else if (cur->as_ArrayLength() != NULL) {
|
} else if (cur->as_ArrayLength() != NULL) {
|
||||||
ArrayLength *length = cur->as_ArrayLength();
|
ArrayLength *length = cur->as_ArrayLength();
|
||||||
cur_invariant = is_invariant(length->array());
|
cur_invariant = is_invariant(length->array());
|
||||||
} else if (cur->as_LoadIndexed() != NULL) {
|
} else if (cur->as_LoadIndexed() != NULL) {
|
||||||
LoadIndexed *li = (LoadIndexed *)cur->as_LoadIndexed();
|
LoadIndexed *li = (LoadIndexed *)cur->as_LoadIndexed();
|
||||||
cur_invariant = !_short_loop_optimizer->has_indexed_store(as_BasicType(cur->type())) && is_invariant(li->array()) && is_invariant(li->index());
|
cur_invariant = !_short_loop_optimizer->has_indexed_store(as_BasicType(cur->type())) && is_invariant(li->array()) && is_invariant(li->index()) && _insert_is_pred;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (cur_invariant) {
|
if (cur_invariant) {
|
||||||
|
|
65
hotspot/test/compiler/8011706/Test8011706.java
Normal file
65
hotspot/test/compiler/8011706/Test8011706.java
Normal file
|
@ -0,0 +1,65 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
|
||||||
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
|
*
|
||||||
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
* 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 8011706
|
||||||
|
* @summary loop invariant code motion may move load before store to the same field
|
||||||
|
* @run main/othervm -XX:-UseOnStackReplacement -XX:-BackgroundCompilation Test8011706
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
public class Test8011706 {
|
||||||
|
int[] array;
|
||||||
|
|
||||||
|
void m(boolean test, int[] array1, int[] array2) {
|
||||||
|
int i = 0;
|
||||||
|
if (test) {
|
||||||
|
array = array1;
|
||||||
|
} else {
|
||||||
|
array = array2;
|
||||||
|
}
|
||||||
|
|
||||||
|
while(true) {
|
||||||
|
int v = array[i];
|
||||||
|
i++;
|
||||||
|
if (i >= 10) return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static public void main(String[] args) {
|
||||||
|
int[] new_array = new int[10];
|
||||||
|
Test8011706 ti = new Test8011706();
|
||||||
|
boolean failed = false;
|
||||||
|
try {
|
||||||
|
for (int i = 0; i < 10000; i++) {
|
||||||
|
ti.array = null;
|
||||||
|
ti.m(true, new_array, new_array);
|
||||||
|
}
|
||||||
|
} catch(NullPointerException ex) {
|
||||||
|
throw new RuntimeException("TEST FAILED", ex);
|
||||||
|
}
|
||||||
|
System.out.println("TEST PASSED");
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
Loading…
Add table
Add a link
Reference in a new issue