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

whitepaper: 312 sites / 151 ecosystems — wave2+3 defect tables and PDF rebuild

Browse source 
Add 88 new defect entries to HIGH and MEDIUM tables:
  HIGH: mysql-0001/0002, mariadb-0001, redis-0001/0002, valkey-0001/0002, openvpn-0001,
        vlc-0001, prometheus-0001, otel-collector-0001, cockroachdb-0001..0004,
        tidb-0001..0008, kubernetes-0001/0002, go-0001, kotlin-0002, scala-0001,
        allegro5-0001, sdl2-0001, grafana-0001, clickhouse-0001, duckdb-0001,
        mongodb-0001, envoy-0001, istio-0001, cilium-0001, linkerd2-0001,
        linux-0001/0002/0003, tor-0002/0003, curl-0001, julia-0001, lua-0001,
        perl5-0001, nats-0001, spring-0003/0004, tomcat-0001, onos-0002, odl-0002

  MEDIUM: helm-0001, mariadb-0002, openssl-0001/0002, memcached-0001,
          cassandra-0001..0004, flink-0001, storm-0001/0002, zookeeper-0001..0003,
          pip-0001, gradle-0001, nginx-0001, haproxy-0001, caddy-0001, varnish-0001,
          ffmpeg-0001, gstreamer-0001, raylib-0001, love2d-0001, php-0001/0002,
          r-source-0001, cpython-0002, ruby-0001, rabbitmq-0003/0004, activemq-0001,
          ovs-0001, onos-0003, odl-0002, jetty-0001

PDF: 976K
This commit is contained in:
russell@unturf.com 2026-03-27 15:23:43 -04:00
parent b3842ab6b8
commit 9934133dcf
260 changed files with 18278 additions and 15 deletions
Download patch file Download diff file Expand all files Collapse all files

80
defects/onos/unit/OnosPipelineHitChainTest.java Normal file
View file

@ -0,0 +1,80 @@
package unit;
/**
* CWE-407 unit test: ONOS PipelineTraceableHitChain.addDataPlaneEntity()
* Defect: ArrayList.contains() O(n) inside O(n) forEach loop = O(n²)
* Fix: LinkedHashSet — O(1) add/contains, insertion order preserved
*
* slow(): ArrayList-backed chain — counts equality comparisons via instrumented elements
* fast(): LinkedHashSet-backed chain — O(1) per add regardless of chain size
* Assert: slowOps > fastOps * 5 (chain of N=200 entries → ~10000 vs ~200 ops)
*/
public class OnosPipelineHitChainTest {
/** Instrumented entity that counts equals() calls. */
static class CountingEntity {
final int id;
static long totalEquals = 0;
CountingEntity(int id) {
this.id = id;
}
@Override
public boolean equals(Object o) {
totalEquals++;
if (!(o instanceof CountingEntity)) return false;
return id == ((CountingEntity) o).id;
}
@Override
public int hashCode() {
return Integer.hashCode(id);
}
}
/** Slow path: ArrayList — .contains() scans linearly before each add. */
static long slow(int n) {
java.util.List<CountingEntity> list = new java.util.ArrayList<>();
CountingEntity.totalEquals = 0;
// Simulate addDataPlaneEntity called for each of n elements (chain copy)
for (int i = 0; i < n; i++) {
CountingEntity e = new CountingEntity(i);
if (!list.contains(e)) { // O(i) scan
list.add(e);
}
}
return CountingEntity.totalEquals;
}
/** Fast path: LinkedHashSet — .add() uses hashCode+equals O(1) average. */
static long fast(int n) {
java.util.LinkedHashSet<CountingEntity> set = new java.util.LinkedHashSet<>();
CountingEntity.totalEquals = 0;
for (int i = 0; i < n; i++) {
set.add(new CountingEntity(i)); // O(1) avg
}
return CountingEntity.totalEquals;
}
public static void main(String[] args) {
int N = 200;
int MULTIPLIER = 5;
long sOps = slow(N);
long fOps = fast(N);
System.out.println("N=" + N);
System.out.println("slow (ArrayList.contains): " + sOps + " equals() calls");
System.out.println("fast (LinkedHashSet.add): " + fOps + " equals() calls");
if (sOps > fOps * MULTIPLIER) {
System.out.println("1/1 PASS (slow=" + sOps + " > fast*" + MULTIPLIER + "=" + (fOps * MULTIPLIER) + ")");
} else {
System.out.println("1/1 FAIL (slow=" + sOps + " not > fast*" + MULTIPLIER + "=" + (fOps * MULTIPLIER) + ")");
System.exit(1);
}
}
}