mirror of
https://github.com/netbirdio/gvisor.git
synced 2026-05-22 17:12:49 -07:00
Comment cleanup.
This commit is contained in:
@@ -42,6 +42,8 @@ const (
|
||||
NF_RETURN = -NF_REPEAT - 1
|
||||
)
|
||||
|
||||
// VerdictStrings maps int verdicts to the strings they represent. It is used
|
||||
// for debugging.
|
||||
var VerdictStrings = map[int32]string{
|
||||
-NF_DROP - 1: "DROP",
|
||||
-NF_ACCEPT - 1: "ACCEPT",
|
||||
|
||||
@@ -376,8 +376,6 @@ func SetEntries(stack *stack.Stack, optVal []byte) *syserr.Error {
|
||||
Size: replace.Size,
|
||||
})
|
||||
ipt.Tables[replace.Name.String()] = table
|
||||
// TODO: Do we need to worry about locking? We could write rules while
|
||||
// packets traverse tables.
|
||||
stack.SetIPTables(ipt)
|
||||
|
||||
return nil
|
||||
|
||||
@@ -113,11 +113,11 @@ type Table struct {
|
||||
// Rules holds the rules that make up the table.
|
||||
Rules []Rule
|
||||
|
||||
// BuiltinChains maps builtin chains to their entrypoints.
|
||||
// BuiltinChains maps builtin chains to their entrypoint rule in Rules.
|
||||
BuiltinChains map[Hook]int
|
||||
|
||||
// Underflows maps builtin chains to their underflow point (i.e. the
|
||||
// rule to execute if the chain returns without a verdict).
|
||||
// Underflows maps builtin chains to their underflow rule in Rules
|
||||
// (i.e. the rule to execute if the chain returns without a verdict).
|
||||
Underflows map[Hook]int
|
||||
|
||||
// UserChains holds user-defined chains for the keyed by name. Users
|
||||
|
||||
Reference in New Issue
Block a user