mix
8ce050ef7f
Initial feature-complete implementation of the v1.0 specification (phases 0-11 of `docs/implementation-plan.md`). Added: - Panel (Go, single static binary) with SQLite persistence, one-time - Domain management with per-domain DKIM (RSA-2048, generated in pure Go) and - Application (sender identity) management: SASL credentials via `sasldb2`, - Full Postfix relay config generated from env at container start: SMTPS 465, - Journal milter (pure Go, `go-milter`) recording every send to `send_log`; … (6 more in CHANGELOG) Full detail: CHANGELOG.md (0.1.0).
63 lines
1.4 KiB
Go
63 lines
1.4 KiB
Go
package web
|
|
|
|
import (
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
// rateLimiter is a simple fixed-window per-key counter used to throttle the
|
|
// setup and login routes (spec 7.6.1, 7.6.5). Keys are client IPs. It is not a
|
|
// precise sliding window — a coarse backstop against brute-force and log noise
|
|
// is all these routes need.
|
|
type rateLimiter struct {
|
|
max int
|
|
window time.Duration
|
|
|
|
mu sync.Mutex
|
|
buckets map[string]*rlBucket
|
|
}
|
|
|
|
type rlBucket struct {
|
|
count int
|
|
windowEnds time.Time
|
|
}
|
|
|
|
func newRateLimiter(max int, window time.Duration) *rateLimiter {
|
|
return &rateLimiter{
|
|
max: max,
|
|
window: window,
|
|
buckets: make(map[string]*rlBucket),
|
|
}
|
|
}
|
|
|
|
// Allow records an attempt for key and reports whether it is within the limit.
|
|
// The current window is reset lazily once it elapses.
|
|
func (r *rateLimiter) Allow(key string) bool {
|
|
now := time.Now()
|
|
r.mu.Lock()
|
|
defer r.mu.Unlock()
|
|
|
|
b := r.buckets[key]
|
|
if b == nil || now.After(b.windowEnds) {
|
|
r.buckets[key] = &rlBucket{count: 1, windowEnds: now.Add(r.window)}
|
|
r.sweep(now)
|
|
return true
|
|
}
|
|
if b.count >= r.max {
|
|
return false
|
|
}
|
|
b.count++
|
|
return true
|
|
}
|
|
|
|
// sweep drops expired buckets so the map cannot grow without bound. Called
|
|
// under the lock while a window is being reset, which is often enough given the
|
|
// low request volume of these routes.
|
|
func (r *rateLimiter) sweep(now time.Time) {
|
|
for k, b := range r.buckets {
|
|
if now.After(b.windowEnds) {
|
|
delete(r.buckets, k)
|
|
}
|
|
}
|
|
}
|