BPF program (the first two made the filter wrong on real hardware): - Compute the TCP payload length from ip->tot_len (IPv4) / payload_len (IPv6) instead of data_end. Ethernet padding on a real NIC added 6 bogus payload bytes, broke expected_seq and dropped every connection after the fourth segment. scripts/xdp_pkt_test.sh reproduces it on synthetic frames and fails against the old code. - Read map values (conn->fails, sent_at) before bpf_map_delete_elem; the LRU element is freed by the delete. - Parse up to two VLAN/QinQ tags before L3; fragments are checked against the blacklist and passed instead of bypassing all filtering; first fragments are no longer dropped. - Unknown non-SYN flows PASS: the program is a stateless filter fed by the conntrack state machine, not a firewall, so spoofed SYNs cannot evict established flows into a drop and replies to the daemon's own outbound TCP keep working. - Reset conn->fails on in-order segments, honour SYN payload (TFO), fix the IPv6 SYN-ACK address swap, count every DROP path, drop SYN with IP options. - Expired prefix bans are no longer deleted with the wrong LPM key; userspace reaps them with the exact key. Loader: - Remember the effective attach flags (native vs generic) and use them for detach/query, verifying the interface is clean afterwards. The old code always detached the native slot, leaving a generic program attached after shutdown. - DetachGuard rolls back the attach if anything after it fails. - ban_cidr validates the prefix length and masks host bits. - Whitelist maps (v4 and the new v6 LPM trie) are populated from the config at startup and fail fast on error. - Stats read all 13 counters, and a test asserts every map's key/value size against the Rust encodings. Tests: xdp_pkt_test (padding, VLAN/QinQ, fragments), xdp_loader (attach flags, rollback, detach), xdp_ban_keys, xdp_whitelist_keys, xdp_services, live xdp_attach_smoke (ignored, needs root).
44 lines
1.8 KiB
C
44 lines
1.8 KiB
C
#ifndef RAMPART_STATS_H
|
|
#define RAMPART_STATS_H
|
|
|
|
#include "common.h"
|
|
#include "maps.h"
|
|
|
|
/**
|
|
* Increment one per-CPU counter.
|
|
*
|
|
* A missing slot (never updated, or an index past max_entries) is ignored so
|
|
* accounting can never change a packet verdict. The slot is private to the
|
|
* current CPU, so a plain read-modify-write is enough: an atomic would only
|
|
* add contention on the hottest path.
|
|
*
|
|
* @param idx STAT_* index into stats_map
|
|
*/
|
|
static __always_inline void inc_stat(__u32 idx)
|
|
{
|
|
__u64 *val = bpf_map_lookup_elem(&stats_map, &idx);
|
|
if (val)
|
|
(*val)++;
|
|
}
|
|
|
|
/**
|
|
* Named wrappers over inc_stat().
|
|
*
|
|
* They keep call sites readable and make the counter a decision of the call
|
|
* site rather than a magic index, so new counters need no edits here.
|
|
*/
|
|
static __always_inline void inc_total(void) { inc_stat(STAT_TOTAL); }
|
|
static __always_inline void inc_tcp(void) { inc_stat(STAT_TCP); }
|
|
static __always_inline void inc_udp(void) { inc_stat(STAT_UDP); }
|
|
static __always_inline void inc_whitelist(void) { inc_stat(STAT_WHITELIST); }
|
|
static __always_inline void inc_blacklist(void) { inc_stat(STAT_BLACKLIST); }
|
|
static __always_inline void inc_syn_throttle(void) { inc_stat(STAT_SYN_THROTTLE); }
|
|
static __always_inline void inc_rate_limit(void) { inc_stat(STAT_RATE_LIMIT); }
|
|
static __always_inline void inc_chal_sent(void) { inc_stat(STAT_CHALLENGE_SENT); }
|
|
static __always_inline void inc_chal_verified(void) { inc_stat(STAT_CHALLENGE_VERIFIED); }
|
|
static __always_inline void inc_chal_failed(void) { inc_stat(STAT_CHALLENGE_FAILED); }
|
|
static __always_inline void inc_fragment_bypass(void) { inc_stat(STAT_FRAGMENT_BYPASS); }
|
|
static __always_inline void inc_pass(void) { inc_stat(STAT_PASS); }
|
|
static __always_inline void inc_drop(void) { inc_stat(STAT_DROP); }
|
|
|
|
#endif /* RAMPART_STATS_H */
|