Struct AccessVectorRules 

pub struct AccessVectorRules { /* private fields */ }

Lookup table for SELinux rules, optimized for fast queries. It maps a [RuleKey] (source, target, class) to matching rules.

Rules are grouped into three contiguous arrays based on their payload struct:

1. [AccessRule] (av_rules): allow, auditallow, dontaudit.
2. [TypeRule] (type_rules): transitions.
3. [XpermRule] (xperm_rules): allowxperm, auditallowxperm, dontauditxperm.

Three corresponding HashTables map [RuleKey]s to the index of the first matching rule. Lookups return an iterator that starts at that index and yields rules until the key changes. This works because binary policies guarantee rules for the same key are contiguous.

Implementations

impl AccessVectorRules

pub fn av_rules(&self) -> &[AccessRule]

Returns the standard access vector rules.

pub fn type_rules(&self) -> &[TypeRule]

Returns the type transition, change, and member rules.

pub fn xperm_rules(&self) -> &[XpermRule]

Returns the extended permission rules.

pub fn rule_order(&self) -> &[RuleKind]

Returns the order of rule kinds as parsed from the policy.

Trait Implementations

impl Clone for AccessVectorRules

fn clone(&self) -> AccessVectorRules

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AccessVectorRules

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for AccessVectorRules

impl PartialEq for AccessVectorRules

fn eq(&self, other: &AccessVectorRules) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for AccessVectorRules