filter

Documentation

Index

• type Element
• type ElementType
• type Expression
  • func NewExpression(s string) *Expression
  • func (e *Expression) Compile() Filter
  • func (e *Expression) HasNext() bool
  • func (e *Expression) Next() Element
• type ExpressionToken
• type Filter
• type Filters
  • func (f Filters) Equal(o Filters) bool
  • func (f Filters) Len() int
  • func (f Filters) Less(i, j int) bool
  • func (f Filters) Swap(i, j int)

Types

type Element

type Element interface {
	Type() ElementType
}

type ElementType

type ElementType uint8

const (
	Primitive ElementType = iota
	Composite
	Joiner
)

type Expression

type Expression struct {
	// contains filtered or unexported fields
}

func NewExpression

func NewExpression(s string) *Expression

func (*Expression) Compile

func (e *Expression) Compile() Filter

Compile build an abstract syntax tree of the expression, implemented in a Filter.

func (*Expression) HasNext

func (e *Expression) HasNext() bool

func (*Expression) Next

func (e *Expression) Next() Element

Next get the next element. If none left, return nil. It might return a primitive, a composite or a joiner.

type ExpressionToken

type ExpressionToken int

type Filter

type Filter interface {
	Compile() ([]bpf.Instruction, error)
	Equal(o Filter) bool
	Size() uint8
	IsPrimitive() bool
	Type() ElementType
	Distill() Filter
}

Filter constructed of a tcpdump filter expression

type Filters

type Filters []Filter

func (Filters) Equal

func (f Filters) Equal(o Filters) bool

func (Filters) Len

func (f Filters) Len() int

func (Filters) Less

func (f Filters) Less(i, j int) bool

func (Filters) Swap

func (f Filters) Swap(i, j int)