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

85
defects/nginx/unit/NginxCacheGetAlgorithmTest.java Normal file
View file

@ -0,0 +1,85 @@
package unit;
import java.util.HashMap;
import java.util.Map;
/**
* nginx-0001: ngx_http_upstream_cache_get linear name scan vs O(1) hash lookup.
*
* slow() models the defect: iterates all cache zone names with string comparison.
* fast() models the fix: uses a HashMap keyed on zone name.
*
* Assert: slowOps > fastOps * 5 for N=16 zones.
*/
public class NginxCacheGetAlgorithmTest {
static long slowOps;
static long fastOps;
// ---- simulated cache zone entry ----------------------------------------
static class CacheZone {
final String name;
CacheZone(String name) { this.name = name; }
}
// ---- slow: O(n) linear strncmp scan (defect) ---------------------------
static CacheZone slowFindCache(CacheZone[] zones, String val) {
for (CacheZone z : zones) {
slowOps++; // one comparison per zone
if (z.name.equals(val)) return z;
}
return null;
}
// ---- fast: O(1) hash lookup (fix) --------------------------------------
static CacheZone fastFindCache(Map<String, CacheZone> index, String val) {
fastOps++; // one map lookup
return index.get(val);
}
// ---- benchmark driver --------------------------------------------------
public static void main(String[] args) {
final int N = 16; // cache zones
final int REQUESTS = 10_000;
// Build zone array and lookup index
CacheZone[] zones = new CacheZone[N];
Map<String, CacheZone> index = new HashMap<>();
for (int i = 0; i < N; i++) {
zones[i] = new CacheZone("cache_zone_" + i);
index.put(zones[i].name, zones[i]);
}
// Worst-case lookup: always the last zone (max linear scan)
String target = "cache_zone_" + (N - 1);
slowOps = 0;
fastOps = 0;
for (int r = 0; r < REQUESTS; r++) {
CacheZone s = slowFindCache(zones, target);
if (s == null) throw new AssertionError("slow: zone not found");
}
for (int r = 0; r < REQUESTS; r++) {
CacheZone f = fastFindCache(index, target);
if (f == null) throw new AssertionError("fast: zone not found");
}
long ratio = slowOps / Math.max(fastOps, 1);
boolean pass = slowOps > fastOps * (N - 1);
System.out.printf("nginx-0001 slow=%d fast=%d ratio=%dx %s%n",
slowOps, fastOps, ratio, pass ? "PASS" : "FAIL");
if (!pass) {
System.err.printf("FAIL: expected slowOps(%d) > fastOps(%d) * %d%n",
slowOps, fastOps, N - 1);
System.exit(1);
}
}
}