apparmor.d/pkg/aa/mqueue.go

71 lines
1.4 KiB
Go
Raw Normal View History

// apparmor.d - Full set of apparmor profiles
// Copyright (C) 2021-2024 Alexandre Pujol <alexandre@pujol.io>
// SPDX-License-Identifier: GPL-2.0-only
package aa
2024-04-15 00:58:34 +02:00
import (
"strings"
)
2023-12-05 21:47:32 +01:00
const tokMQUEUE = "mqueue"
type Mqueue struct {
RuleBase
Qualifier
Access []string
Type string
Label string
2023-12-05 21:47:32 +01:00
Name string
}
func newMqueueFromLog(log map[string]string) Rule {
2023-12-05 21:47:32 +01:00
mqueueType := "posix"
if strings.Contains(log["class"], "posix") {
mqueueType = "posix"
} else if strings.Contains(log["class"], "sysv") {
mqueueType = "sysv"
}
return &Mqueue{
RuleBase: newRuleFromLog(log),
2024-04-15 00:58:34 +02:00
Qualifier: newQualifierFromLog(log),
Access: toAccess(tokMQUEUE, log["requested"]),
2023-12-05 21:47:32 +01:00
Type: mqueueType,
Label: log["label"],
2023-12-05 21:47:32 +01:00
Name: log["name"],
}
}
func (r *Mqueue) Less(other any) bool {
o, _ := other.(*Mqueue)
if len(r.Access) != len(o.Access) {
return len(r.Access) < len(o.Access)
}
2024-04-15 00:58:34 +02:00
if r.Type != o.Type {
return r.Type < o.Type
}
if r.Label != o.Label {
return r.Label < o.Label
}
return r.Qualifier.Less(o.Qualifier)
}
func (r *Mqueue) Equals(other any) bool {
o, _ := other.(*Mqueue)
return slices.Equal(r.Access, o.Access) && r.Type == o.Type && r.Label == o.Label &&
2024-04-15 00:58:34 +02:00
r.Name == o.Name && r.Qualifier.Equals(o.Qualifier)
}
func (r *Mqueue) String() string {
return renderTemplate(r.Kind(), r)
}
func (r *Mqueue) Constraint() constraint {
return blockKind
}
func (r *Mqueue) Kind() string {
return tokMQUEUE
}