Architectural Invariant Design: Linux eBPF TC Egress Packet Classification & Segmentation Invariant
Linux eBPF TC Egress Packet Classification & Segmentation Invariant defines an industrial-grade behavioral standard for devops engineering. Enforces deterministic, non-bypassable egress network segmentation at the Traffic Control (TC) hook on host-side container veth interfaces before socket buffers enter Linux host routing. Mandates atomic packet classification, skb linearization, fail-closed drop semantics, and cryptographic/policy tag validation directly within the kernel datapath. Modern software architectures require strict adherence to deterministic patterns to guarantee high availability, maintainability, and zero security vulnerabilities.
Hazard Analysis: What Breaks Without This Rule
The following failure modes have been cataloged from hundreds of hours of production code reviews where AI assistants produced non-compliant implementations:
| Failure Mode | AI Symptom (The Anti-Pattern) | Severity | Production Impact & Remedy |
|---|---|---|---|
| AI Hallucination & Deprecation Drift | Attaching egress policies downstream on physical interfaces or failing open on eBPF parser errors | Critical | Violating this industrial standard introduces regression bugs, security risks, and unexpected runtime failures in production. Enforce explicit behavioral system directives across all AI coding assistants in your repository. |
| Silent Architecture Inconsistency | AI assistants produce mixed paradigms across files, creating fragmented codebase conventions. | Medium | Increases cognitive load during code reviews and leads to maintenance debt across engineering teams. Pin project conventions in .cursor/rules, CLAUDE.md, and AGENTS.md so all team agents follow identical guardrails. |
Step-by-Step Production Directives
Each rule constraint below is injected into the AI agent's system prompt to establish deterministic boundaries:
Engineers MUST ALWAYS attach eBPF TC classifier programs to the host-side veth interface (`clsact` egress or host-side peer ingress) to intercept traffic before Linux host routing decisions occur.
Engineers MUST ALWAYS attach eBPF TC classifier programs to the host-side veth interface (`clsact` egress or host-side peer ingress) to intercept traffic before Linux host routing decisions occur.
Engineers MUST ALWAYS implement fail-closed semantics
Engineers MUST ALWAYS implement fail-closed semantics: any parsing anomaly, truncated header, unmapped pod identity, or map lookup failure MUST return `TC_ACT_SHOT` immediately.
Engineers MUST ALWAYS invoke `bpf_skb_pull_data(skb, ...)` before dereferencing packet headers beyond the initial linear buffer to prevent verifier rejections and out-of-bounds reads on cloned or non-linear sk_buff structures.
Engineers MUST ALWAYS invoke `bpf_skb_pull_data(skb, ...)` before dereferencing packet headers beyond the initial linear buffer to prevent verifier rejections and out-of-bounds reads on cloned or non-linear sk_buff structures.
Code MUST re-evaluate verifier boundary pointers (`data = (void *)(long)skb->data`, `data_end = (void *)(long)skb->data_end`) immediately after any helper call that alters buffer layout (e.g., `bpf_skb_pull_data`, `bpf_skb_adjust_room`).
Code MUST re-evaluate verifier boundary pointers (`data = (void *)(long)skb->data`, `data_end = (void *)(long)skb->data_end`) immediately after any helper call that alters buffer layout (e.g., `bpf_skb_pull_data`, `bpf_skb_adjust_room`).
Tail calls (`bpf_tail_call`) MUST ALWAYS be immediately followed by an explicit `return TC_ACT_SHOT
Tail calls (`bpf_tail_call`) MUST ALWAYS be immediately followed by an explicit `return TC_ACT_SHOT;` so that missed lookups or depleted tail-call counters never result in accidental packet forwarding.
Services MUST NOT defer pod egress segmentation to post-routing hooks (such as physical interface egress or iptables POSTROUTING) where inter-pod local bypass can occur.
Services MUST NOT defer pod egress segmentation to post-routing hooks (such as physical interface egress or iptables POSTROUTING) where inter-pod local bypass can occur.
Components NEVER allow raw L3/L4 egress packets from untrusted cgroups to bypass LPM (Longest Prefix Match) policy map lookup.
Components NEVER allow raw L3/L4 egress packets from untrusted cgroups to bypass LPM (Longest Prefix Match) policy map lookup.
Frequently Asked Technical Questions
Common questions developers face when configuring AI coding assistants for this stack:
Q:Why is Linux eBPF TC Egress Packet Classification & Segmentation Invariant critical for AI coding assistants?
Enforces deterministic, non-bypassable egress network segmentation at the Traffic Control (TC) hook on host-side container veth interfaces before socket buffers enter Linux host routing. Mandates atomic packet classification, skb linearization, fail-closed drop semantics, and cryptographic/policy tag validation directly within the kernel datapath. Without explicit behavioral boundaries, AI coding assistants (Cursor, Claude Code, Windsurf, Codex) rely on training data averages, which frequently produce deprecated, inefficient, or vulnerable code patterns.
Q:How does adopting this rule prevent AI hallucinations?
This rule explicitly declares what the AI must avoid (Attaching egress policies downstream on physical interfaces or failing open on eBPF parser errors) and prescribes verified positive examples. Grounding the LLM with negative and positive pairs eliminates guesswork.
Q:Which AI coding environments are supported?
This specification is multi-platform compatible: Cursor (.cursor/rules/*.mdc & .cursorrules), Anthropic Claude Code (CLAUDE.md), Windsurf (.windsurfrules), Codex / Cline (AGENTS.md), and GitHub Copilot (.github/copilot-instructions.md).
Q:Can I combine this rule with other technology stacks?
Yes. Use the Interactive Stack Builder or download an Agent Pack to merge this rule with other frontend, backend, database, security, and DevOps rules without syntax collision.