mirror of
https://github.com/lukaszraczylo/traefik-llmgateway.git
synced 2026-10-18 05:47:38 +00:00
fix(resp): bound store-call latency, cap wire lengths, cover fail-closed budget path
Bound respClient's worst-case latency to one respCallTimeout per do/pipeline call instead of per read/write/handshake step. Compute a single absolute deadline at call entry, apply it once via conn.SetDeadline after connecting (covering the AUTH/SELECT handshake and the call's own command I/O), and skip the reconnect-retry when the failing attempt was a timeout (errors.As -> net.Error, Timeout()) — a peer that accepted the connection and went silent must not be asked the same non-question twice. Previously each read, write, and dial got its own fresh 2s budget and every caller queued behind the client's single mutex, so a hung (not merely refused) Redis-compatible server could stall one checkAndCount call for 16-32s+. Cap decodeBulk/decodeArray's wire-declared lengths (respMaxBulkLen 64MiB, respMaxArrayLen 1<<20) before allocating: an unguarded "$9223372036854775807\r\n" overflows n+2 into a negative slice length and panics make([]byte, n+2); a merely huge-but-valid length forces an outsized allocation either way. decodeBulk also now verifies its two trailing bytes are CRLF. Bound readLine to respMaxLineLen (64KiB), reading byte-by-byte so it can bail before ever buffering an unbounded line from a peer that never sends '\n'. Fix TestLimiter_FailClosed_BudgetReadReturnsStoreDownViolation: the erroringStore it used fails incrBy too, so checkAndCount's own increment loop already returned a storeDown violation before evaluateScope (and therefore budgetViolation) ever ran, leaving budgetViolation's storeDown branch uncovered. Replace it with a stub that only fails get, so the test's TokensPerDay limit actually drives evaluateScope into budgetViolation's fail-closed path. Document redis_store.go's incrBy as deliberately at-least-once: the reconnect-retry can re-send INCRBY after a lost reply (possible over-count), and fail-open can additionally count in the fallback — both fail-safe (more restrictive), never fail-open in the unsafe direction. Validate Redis.DB >= 0 in newConfiguredLimiter alongside Address, so a negative db is a constructor error rather than a SELECT -1 on the wire. New tests: a hung (accepts, never replies) fake RESP server proving a respClient call and a failOpen limiter call both stay bounded rather than stacking timeouts; decodeReply subtests for an oversized bulk length, a length just over the cap, a huge array length, a bad bulk trailer, and an oversized line; a negative-DB constructor-rejection test.
This commit is contained in:
@@ -136,3 +136,30 @@ func TestLimiter_FailOpenTrue_DeadRedisAddress_FallsBackAndAllows(t *testing.T)
|
||||
t.Errorf("fallback req:day counter = %d, want 1 (the request must have been counted in the fallback)", got)
|
||||
}
|
||||
}
|
||||
|
||||
// TestLimiter_FailOpenTrue_HungRedisServer_FallsBackQuickly is review item
|
||||
// 1's limiter-level proof: a hung (accepts the connection, never replies)
|
||||
// Redis-compatible server must not make a failOpen=true request wait out
|
||||
// several stacked multi-second timeouts (the pre-fix behavior for a
|
||||
// checkAndCount call that performs several store operations) — each of
|
||||
// checkAndCount's two store ops here (req:min, req:day) is bounded by one
|
||||
// respCallTimeout, not respCallTimeout times every read/write step it
|
||||
// happens to perform, so the whole call stays well under the old
|
||||
// multi-times-respCallTimeout stall.
|
||||
func TestLimiter_FailOpenTrue_HungRedisServer_FallsBackQuickly(t *testing.T) {
|
||||
ln := newHungListener(t)
|
||||
store := newRedisStore(newRESPClient(ln.Addr().String(), "", 0))
|
||||
l := newLimiter(store, true)
|
||||
scopes := []limitScope{{kind: "user", id: "u", limits: &LimitsConfig{RequestsPerMinute: 100}}}
|
||||
|
||||
start := time.Now()
|
||||
v := l.checkAndCount(scopes)
|
||||
elapsed := time.Since(start)
|
||||
|
||||
if v != nil {
|
||||
t.Fatalf("want no violation with failOpen=true and a hung store, got %+v", v)
|
||||
}
|
||||
if elapsed >= 6*time.Second {
|
||||
t.Fatalf("elapsed = %v, want well under the old worst case (two bounded store ops, not many stacked timeouts)", elapsed)
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user