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

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

defects/haproxy/unit/HaproxyPatMatchBinAlgorithmTest.java

@@ -0,0 +1,95 @@
+package unit;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+/**
+ * haproxy-0001: pat_match_bin list walk below LRU threshold vs O(1) map lookup.
+ *
+ * slow() models the defect: linked-list walk (no LRU cache, <20 entries) per request.
+ * fast() models the fix: HashMap lookup at O(1) regardless of pattern count.
+ *
+ * Assert: slowOps > fastOps * 5 for P=15 patterns (below LRU threshold).
+ */
+public class HaproxyPatMatchBinAlgorithmTest {
+
+    static long slowOps;
+    static long fastOps;
+
+    // ---- simulated pattern entry -------------------------------------------
+
+    static class BinPattern {
+        final byte[] data;
+        BinPattern(byte[] data) { this.data = data; }
+    }
+
+    // ---- slow: O(P) list walk (defect) -------------------------------------
+
+    static boolean slowMatchBin(List<BinPattern> patterns, byte[] sample) {
+        for (BinPattern p : patterns) {
+            slowOps++;
+            if (p.data.length == sample.length) {
+                boolean eq = true;
+                for (int i = 0; i < sample.length; i++) {
+                    if (p.data[i] != sample[i]) { eq = false; break; }
+                }
+                if (eq) return true;
+            }
+        }
+        return false;
+    }
+
+    // ---- fast: O(1) HashMap lookup (fix) -----------------------------------
+
+    static boolean fastMatchBin(Map<String, BinPattern> index, byte[] sample) {
+        fastOps++;
+        return index.containsKey(new String(sample));
+    }
+
+    // ---- benchmark driver --------------------------------------------------
+
+    public static void main(String[] args) {
+        final int P = 15;          // patterns: below the LRU threshold of 20
+        final int REQUESTS = 10_000;
+
+        List<BinPattern> patterns = new ArrayList<>();
+        Map<String, BinPattern> index = new HashMap<>();
+
+        for (int i = 0; i < P; i++) {
+            byte[] data = ("pattern_key_" + i).getBytes();
+            BinPattern bp = new BinPattern(data);
+            patterns.add(bp);
+            index.put(new String(data), bp);
+        }
+
+        // Worst-case: match the last pattern (maximum list walk)
+        byte[] sample = ("pattern_key_" + (P - 1)).getBytes();
+
+        slowOps = 0;
+        fastOps = 0;
+
+        for (int r = 0; r < REQUESTS; r++) {
+            boolean s = slowMatchBin(patterns, sample);
+            if (!s) throw new AssertionError("slow: pattern not found");
+        }
+
+        for (int r = 0; r < REQUESTS; r++) {
+            boolean f = fastMatchBin(index, sample);
+            if (!f) throw new AssertionError("fast: pattern not found");
+        }
+
+        long ratio = slowOps / Math.max(fastOps, 1);
+        boolean pass = slowOps > fastOps * (P - 1);
+
+        System.out.printf("haproxy-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, P - 1);
+            System.exit(1);
+        }
+    }
+}