engineering/java-topology
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

undefect. CWE-407 — 63 sites patched across 27 ecosystems

Browse source 
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:
russell@unturf.com 2026-03-26 17:11:57 -04:00
commit 0a580b313d
70422 changed files with 17213626 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

64
test/hotspot/jtreg/compiler/loopopts/Test6659207.java Normal file
View file

@ -0,0 +1,64 @@
/*
* Copyright (c) 1997, 2008, 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 6659207
* @summary access violation in CompilerThread0
*
* @run main compiler.loopopts.Test6659207
*/
package compiler.loopopts;
public class Test6659207 {
static int[] array = new int[12];
static int index(int i) {
if (i == 0) return 0;
for (int n = 0; n < array.length; n++)
if (i < array[n]) return n;
return -1;
}
static int test(int i) {
int result = 0;
i = index(i);
if (i >= 0)
if (array[i] != 0)
result++;
if (i != -1)
array[i]++;
return result;
}
public static void main(String[] args) {
int total = 0;
for (int i = 0; i < 100000; i++) {
total += test(10);
}
System.out.println(total);
}
}