aa_dfa_match(9)
aa_dfa_match(9) π β¨ β Kernel API Manual cutie
π NAME π
aa_dfa_match β traverse @dfa to find the state @str stops at. That's the whole vibe: you're walking the dfa with str and seeing where it lands π«
β¨ SYNOPSIS β¨
aa_state_t aa_dfa_match (const struct aa_dfa *dfa , aa_state_t start ,
const char *str );
π ARGUMENTS π
okay bestie, here's what you're feeding it:
dfaβ the dfa to matchstragainst (NOT NULL). no cap, it cannot be null.startβ the state of the dfa to start matching in.strβ the null terminated string of bytes to match against the dfa (NOT NULL). again: not null, bestie.
π¦ DESCRIPTION π¦
aa_dfa_match will match str against the dfa and return the state it finished matching in. The final state can be used to look up the accepting label, or as the start state of a continuing match. That's it β that's the slay π
π RETURN π
final state reached after input is consumed β¨
π SEE ALSO π
Kernel file ./security/apparmor/match.c and the whole friend group:
unpack_table(9)verify_table_headers(9)verify_dfa(9)dfa_free(9)aa_dfa_free_kref(9)remap_data16_to_data32(9)aa_dfa_unpack(9)aa_dfa_match_len(9)aa_dfa_next(9)aa_dfa_match_until(9)aa_dfa_matchn_until(9)aa_dfa_leftmatch(9)
Catch you later, bestie β source/version ./security/apparmor, date October 2026 π«Άπβ¨
π¦ where this page comes from
- nixpkgs unstable: linux-manual 7.3.1
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms