diff options
| author | John Johansen <john.johansen@canonical.com> | 2017-09-07 00:57:59 +0300 |
|---|---|---|
| committer | John Johansen <john.johansen@canonical.com> | 2018-02-09 22:30:01 +0300 |
| commit | 6e0654d20ed9679cbf75a0ff7cd786e364f7f09a (patch) | |
| tree | 9c15e28e85b9cc66984e3a6fdb7101a2ae2b0a58 /security/apparmor/include/match.h | |
| parent | cf65fabc2a2c8c12031678d86a2bd4a660865011 (diff) | |
| download | linux-6e0654d20ed9679cbf75a0ff7cd786e364f7f09a.tar.xz | |
apparmor: use the dfa to do label parse string splitting
The current split scheme is actually wrong in that it splits
///&
where that is invalid and should fail. Use the dfa to do a proper
bounded split without having to worry about getting the string
processing right in code.
Signed-off-by: John Johansen <john.johansen@canonical.com>
Acked-by: Seth Arnold <seth.arnold@canonical.com>
Diffstat (limited to 'security/apparmor/include/match.h')
| -rw-r--r-- | security/apparmor/include/match.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/security/apparmor/include/match.h b/security/apparmor/include/match.h index 72b9b89670e6..cd8aeab6ac57 100644 --- a/security/apparmor/include/match.h +++ b/security/apparmor/include/match.h @@ -101,6 +101,7 @@ struct aa_dfa { }; extern struct aa_dfa *nulldfa; +extern struct aa_dfa *stacksplitdfa; #define byte_to_byte(X) (X) |