2023-09-25 01:06:07 +02:00
|
|
|
// apparmor.d - Full set of apparmor profiles
|
2024-02-07 00:16:21 +01:00
|
|
|
// Copyright (C) 2021-2024 Alexandre Pujol <alexandre@pujol.io>
|
2023-09-25 01:06:07 +02:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
|
|
|
|
|
|
|
package aa
|
|
|
|
|
2024-05-05 15:19:25 +02:00
|
|
|
import (
|
|
|
|
"slices"
|
|
|
|
)
|
|
|
|
|
2024-04-23 22:26:09 +02:00
|
|
|
const tokDBUS = "dbus"
|
|
|
|
|
2023-09-25 01:06:07 +02:00
|
|
|
type Dbus struct {
|
2024-04-19 23:43:02 +02:00
|
|
|
RuleBase
|
2023-09-25 01:06:07 +02:00
|
|
|
Qualifier
|
2024-04-23 22:17:25 +02:00
|
|
|
Access []string
|
2023-09-25 01:06:07 +02:00
|
|
|
Bus string
|
|
|
|
Name string
|
|
|
|
Path string
|
|
|
|
Interface string
|
|
|
|
Member string
|
2024-04-15 00:58:34 +02:00
|
|
|
PeerName string
|
|
|
|
PeerLabel string
|
2023-09-25 01:06:07 +02:00
|
|
|
}
|
|
|
|
|
2024-04-19 23:43:02 +02:00
|
|
|
func newDbusFromLog(log map[string]string) Rule {
|
2024-04-15 00:58:34 +02:00
|
|
|
name := ""
|
|
|
|
peerName := ""
|
|
|
|
if log["mask"] == "bind" {
|
|
|
|
name = log["name"]
|
|
|
|
} else {
|
|
|
|
peerName = log["name"]
|
|
|
|
}
|
2023-09-25 01:06:07 +02:00
|
|
|
return &Dbus{
|
2024-04-19 23:43:02 +02:00
|
|
|
RuleBase: newRuleFromLog(log),
|
2024-04-15 00:58:34 +02:00
|
|
|
Qualifier: newQualifierFromLog(log),
|
2024-04-23 22:17:25 +02:00
|
|
|
Access: []string{log["mask"]},
|
2023-09-25 01:06:07 +02:00
|
|
|
Bus: log["bus"],
|
2024-04-15 00:58:34 +02:00
|
|
|
Name: name,
|
2023-09-25 01:06:07 +02:00
|
|
|
Path: log["path"],
|
|
|
|
Interface: log["interface"],
|
|
|
|
Member: log["member"],
|
2024-04-15 00:58:34 +02:00
|
|
|
PeerName: peerName,
|
|
|
|
PeerLabel: log["peer_label"],
|
2023-09-25 01:06:07 +02:00
|
|
|
}
|
|
|
|
}
|
2023-09-25 01:09:11 +02:00
|
|
|
|
|
|
|
func (r *Dbus) Less(other any) bool {
|
|
|
|
o, _ := other.(*Dbus)
|
2024-04-23 22:17:25 +02:00
|
|
|
for i := 0; i < len(r.Access) && i < len(o.Access); i++ {
|
|
|
|
if r.Access[i] != o.Access[i] {
|
|
|
|
return r.Access[i] < o.Access[i]
|
|
|
|
}
|
2023-09-25 01:09:11 +02:00
|
|
|
}
|
2024-04-15 00:58:34 +02:00
|
|
|
if r.Bus != o.Bus {
|
|
|
|
return r.Bus < o.Bus
|
|
|
|
}
|
|
|
|
if r.Name != o.Name {
|
|
|
|
return r.Name < o.Name
|
|
|
|
}
|
|
|
|
if r.Path != o.Path {
|
|
|
|
return r.Path < o.Path
|
|
|
|
}
|
|
|
|
if r.Interface != o.Interface {
|
|
|
|
return r.Interface < o.Interface
|
|
|
|
}
|
|
|
|
if r.Member != o.Member {
|
|
|
|
return r.Member < o.Member
|
|
|
|
}
|
|
|
|
if r.PeerName != o.PeerName {
|
|
|
|
return r.PeerName < o.PeerName
|
|
|
|
}
|
|
|
|
if r.PeerLabel != o.PeerLabel {
|
|
|
|
return r.PeerLabel < o.PeerLabel
|
|
|
|
}
|
2023-09-25 01:09:11 +02:00
|
|
|
return r.Qualifier.Less(o.Qualifier)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Dbus) Equals(other any) bool {
|
|
|
|
o, _ := other.(*Dbus)
|
2024-04-23 22:17:25 +02:00
|
|
|
return slices.Equal(r.Access, o.Access) && r.Bus == o.Bus && r.Name == o.Name &&
|
2023-09-25 01:09:11 +02:00
|
|
|
r.Path == o.Path && r.Interface == o.Interface &&
|
2024-04-15 00:58:34 +02:00
|
|
|
r.Member == o.Member && r.PeerName == o.PeerName &&
|
|
|
|
r.PeerLabel == o.PeerLabel && r.Qualifier.Equals(o.Qualifier)
|
2023-09-25 01:09:11 +02:00
|
|
|
}
|
2024-04-23 22:26:09 +02:00
|
|
|
|
|
|
|
func (r *Dbus) String() string {
|
2024-05-05 00:41:47 +02:00
|
|
|
return renderTemplate(r.Kind(), r)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Dbus) Constraint() constraint {
|
|
|
|
return blockKind
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Dbus) Kind() string {
|
|
|
|
return tokDBUS
|
2024-04-23 22:26:09 +02:00
|
|
|
}
|