Commit 483ec26e authored by Janne Karhunen's avatar Janne Karhunen Committed by Mimi Zohar

ima: ima/lsm policy rule loading logic bug fixes

Keep the ima policy rules around from the beginning even if they appear
invalid at the time of loading, as they may become active after an lsm
policy load.  However, loading a custom IMA policy with unknown LSM
labels is only safe after we have transitioned from the "built-in"
policy rules to a custom IMA policy.

Patch also fixes the rule re-use during the lsm policy reload and makes
some prints a bit more human readable.

Changelog:
v4:
- Do not allow the initial policy load refer to non-existing lsm rules.
v3:
- Fix too wide policy rule matching for non-initialized LSMs
v2:
- Fix log prints

Fixes: b1694245 ("ima: use the lsm policy update notifier")
Cc: Casey Schaufler <casey@schaufler-ca.com>
Reported-by: default avatarMimi Zohar <zohar@linux.ibm.com>
Signed-off-by: default avatarJanne Karhunen <janne.karhunen@gmail.com>
Signed-off-by: default avatarKonsta Karsisto <konsta.karsisto@gmail.com>
Signed-off-by: default avatarMimi Zohar <zohar@linux.ibm.com>
parent 6beea7af
...@@ -265,7 +265,7 @@ static void ima_lsm_free_rule(struct ima_rule_entry *entry) ...@@ -265,7 +265,7 @@ static void ima_lsm_free_rule(struct ima_rule_entry *entry)
static struct ima_rule_entry *ima_lsm_copy_rule(struct ima_rule_entry *entry) static struct ima_rule_entry *ima_lsm_copy_rule(struct ima_rule_entry *entry)
{ {
struct ima_rule_entry *nentry; struct ima_rule_entry *nentry;
int i, result; int i;
nentry = kmalloc(sizeof(*nentry), GFP_KERNEL); nentry = kmalloc(sizeof(*nentry), GFP_KERNEL);
if (!nentry) if (!nentry)
...@@ -279,7 +279,7 @@ static struct ima_rule_entry *ima_lsm_copy_rule(struct ima_rule_entry *entry) ...@@ -279,7 +279,7 @@ static struct ima_rule_entry *ima_lsm_copy_rule(struct ima_rule_entry *entry)
memset(nentry->lsm, 0, FIELD_SIZEOF(struct ima_rule_entry, lsm)); memset(nentry->lsm, 0, FIELD_SIZEOF(struct ima_rule_entry, lsm));
for (i = 0; i < MAX_LSM_RULES; i++) { for (i = 0; i < MAX_LSM_RULES; i++) {
if (!entry->lsm[i].rule) if (!entry->lsm[i].args_p)
continue; continue;
nentry->lsm[i].type = entry->lsm[i].type; nentry->lsm[i].type = entry->lsm[i].type;
...@@ -288,13 +288,13 @@ static struct ima_rule_entry *ima_lsm_copy_rule(struct ima_rule_entry *entry) ...@@ -288,13 +288,13 @@ static struct ima_rule_entry *ima_lsm_copy_rule(struct ima_rule_entry *entry)
if (!nentry->lsm[i].args_p) if (!nentry->lsm[i].args_p)
goto out_err; goto out_err;
result = security_filter_rule_init(nentry->lsm[i].type, security_filter_rule_init(nentry->lsm[i].type,
Audit_equal, Audit_equal,
nentry->lsm[i].args_p, nentry->lsm[i].args_p,
&nentry->lsm[i].rule); &nentry->lsm[i].rule);
if (result == -EINVAL) if (!nentry->lsm[i].rule)
pr_warn("ima: rule for LSM \'%d\' is undefined\n", pr_warn("rule for LSM \'%s\' is undefined\n",
entry->lsm[i].type); (char *)entry->lsm[i].args_p);
} }
return nentry; return nentry;
...@@ -331,7 +331,7 @@ static void ima_lsm_update_rules(void) ...@@ -331,7 +331,7 @@ static void ima_lsm_update_rules(void)
list_for_each_entry_safe(entry, e, &ima_policy_rules, list) { list_for_each_entry_safe(entry, e, &ima_policy_rules, list) {
needs_update = 0; needs_update = 0;
for (i = 0; i < MAX_LSM_RULES; i++) { for (i = 0; i < MAX_LSM_RULES; i++) {
if (entry->lsm[i].rule) { if (entry->lsm[i].args_p) {
needs_update = 1; needs_update = 1;
break; break;
} }
...@@ -341,8 +341,7 @@ static void ima_lsm_update_rules(void) ...@@ -341,8 +341,7 @@ static void ima_lsm_update_rules(void)
result = ima_lsm_update_rule(entry); result = ima_lsm_update_rule(entry);
if (result) { if (result) {
pr_err("ima: lsm rule update error %d\n", pr_err("lsm rule update error %d\n", result);
result);
return; return;
} }
} }
...@@ -403,7 +402,7 @@ static bool ima_match_keyring(struct ima_rule_entry *rule, ...@@ -403,7 +402,7 @@ static bool ima_match_keyring(struct ima_rule_entry *rule,
} }
/** /**
* ima_match_rules - determine whether an inode matches the measure rule. * ima_match_rules - determine whether an inode matches the policy rule.
* @rule: a pointer to a rule * @rule: a pointer to a rule
* @inode: a pointer to an inode * @inode: a pointer to an inode
* @cred: a pointer to a credentials structure for user validation * @cred: a pointer to a credentials structure for user validation
...@@ -466,9 +465,12 @@ static bool ima_match_rules(struct ima_rule_entry *rule, struct inode *inode, ...@@ -466,9 +465,12 @@ static bool ima_match_rules(struct ima_rule_entry *rule, struct inode *inode,
int rc = 0; int rc = 0;
u32 osid; u32 osid;
if (!rule->lsm[i].rule) if (!rule->lsm[i].rule) {
if (!rule->lsm[i].args_p)
continue; continue;
else
return false;
}
switch (i) { switch (i) {
case LSM_OBJ_USER: case LSM_OBJ_USER:
case LSM_OBJ_ROLE: case LSM_OBJ_ROLE:
...@@ -880,8 +882,14 @@ static int ima_lsm_rule_init(struct ima_rule_entry *entry, ...@@ -880,8 +882,14 @@ static int ima_lsm_rule_init(struct ima_rule_entry *entry,
entry->lsm[lsm_rule].args_p, entry->lsm[lsm_rule].args_p,
&entry->lsm[lsm_rule].rule); &entry->lsm[lsm_rule].rule);
if (!entry->lsm[lsm_rule].rule) { if (!entry->lsm[lsm_rule].rule) {
pr_warn("rule for LSM \'%s\' is undefined\n",
(char *)entry->lsm[lsm_rule].args_p);
if (ima_rules == &ima_default_rules) {
kfree(entry->lsm[lsm_rule].args_p); kfree(entry->lsm[lsm_rule].args_p);
return -EINVAL; result = -EINVAL;
} else
result = 0;
} }
return result; return result;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment