undefect. CWE-407 — 63 sites patched across 27 ecosystems
Authors: russell@unturf.com · brackishbert@gmail.com · foxhop.net · TimeHexOn.com Patches, unit tests, benchmarks, whitepaper, and outreach briefs. Public domain — no copyright claimed. Use freely.
This commit is contained in:
commit
0a580b313d
70422 changed files with 17213626 additions and 0 deletions
|
|
@ -0,0 +1,81 @@
|
|||
/*
|
||||
* Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2021, Red Hat, Inc. 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 8269088
|
||||
* @summary C2 fails with assert(!n->is_Store() && !n->is_LoadStore()) failed: no node with a side effect
|
||||
*
|
||||
* @requires vm.gc.Serial
|
||||
* @run main/othervm -Xcomp -XX:CompileOnly=TestStoreSunkInInnerLoop::* -XX:CompileCommand=quiet -XX:+UseSerialGC -Xmx256m TestStoreSunkInInnerLoop
|
||||
*
|
||||
*/
|
||||
|
||||
public class TestStoreSunkInInnerLoop {
|
||||
|
||||
public static final int N = 400;
|
||||
|
||||
public static int iFld=-10622;
|
||||
public static long lArrFld[]=new long[N];
|
||||
public float fArrFld[][]=new float[N][N];
|
||||
|
||||
public void mainTest() {
|
||||
|
||||
int i8=-10584, i10=37284, i11=38, i13=-238, i14=-18473, i15=-53564;
|
||||
boolean b1=false;
|
||||
|
||||
TestStoreSunkInInnerLoop.iFld -= TestStoreSunkInInnerLoop.iFld;
|
||||
for (i8 = 224; i8 > 7; i8 -= 2) {
|
||||
i10 = 1;
|
||||
while (++i10 < 232) {
|
||||
TestStoreSunkInInnerLoop.iFld += i8;
|
||||
}
|
||||
for (i11 = 8; i11 < 232; ++i11) {
|
||||
if (b1) continue;
|
||||
TestStoreSunkInInnerLoop.lArrFld[i11] += i10;
|
||||
}
|
||||
}
|
||||
i13 = 1;
|
||||
do {
|
||||
switch ((i13 % 2) + 126) {
|
||||
case 126:
|
||||
for (i14 = 102; i14 > 2; i14 -= 3) {
|
||||
fArrFld[i13][(-126 >>> 1) % N] -= i15;
|
||||
}
|
||||
break;
|
||||
case 127:
|
||||
i15 = (i13 % i10);
|
||||
break;
|
||||
default:
|
||||
}
|
||||
} while (++i13 < 247);
|
||||
}
|
||||
|
||||
public static void main(String[] strArr) {
|
||||
TestStoreSunkInInnerLoop _instance = new TestStoreSunkInInnerLoop();
|
||||
for (int i = 0; i < 10; i++ ) {
|
||||
_instance.mainTest();
|
||||
}
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue