2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Implementation of the kernel access vector cache (AVC).
|
|
|
|
*
|
|
|
|
* Authors: Stephen Smalley, <sds@epoch.ncsc.mil>
|
2008-04-17 18:42:10 +00:00
|
|
|
* James Morris <jmorris@redhat.com>
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Update: KaiGai, Kohei <kaigai@ak.jp.nec.com>
|
2008-04-17 18:42:10 +00:00
|
|
|
* Replaced the avc_lock spinlock by RCU.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Copyright (C) 2003 Red Hat, Inc., James Morris <jmorris@redhat.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2,
|
2008-04-17 18:42:10 +00:00
|
|
|
* as published by the Free Software Foundation.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/dcache.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <linux/percpu.h>
|
|
|
|
#include <net/sock.h>
|
|
|
|
#include <linux/un.h>
|
|
|
|
#include <net/af_unix.h>
|
|
|
|
#include <linux/ip.h>
|
|
|
|
#include <linux/audit.h>
|
|
|
|
#include <linux/ipv6.h>
|
|
|
|
#include <net/ipv6.h>
|
|
|
|
#include "avc.h"
|
|
|
|
#include "avc_ss.h"
|
selinux: dynamic class/perm discovery
Modify SELinux to dynamically discover class and permission values
upon policy load, based on the dynamic object class/perm discovery
logic from libselinux. A mapping is created between kernel-private
class and permission indices used outside the security server and the
policy values used within the security server.
The mappings are only applied upon kernel-internal computations;
similar mappings for the private indices of userspace object managers
is handled on a per-object manager basis by the userspace AVC. The
interfaces for compute_av and transition_sid are split for kernel
vs. userspace; the userspace functions are distinguished by a _user
suffix.
The kernel-private class indices are no longer tied to the policy
values and thus do not need to skip indices for userspace classes;
thus the kernel class index values are compressed. The flask.h
definitions were regenerated by deleting the userspace classes from
refpolicy's definitions and then regenerating the headers. Going
forward, we can just maintain the flask.h, av_permissions.h, and
classmap.h definitions separately from policy as they are no longer
tied to the policy values. The next patch introduces a utility to
automate generation of flask.h and av_permissions.h from the
classmap.h definitions.
The older kernel class and permission string tables are removed and
replaced by a single security class mapping table that is walked at
policy load to generate the mapping. The old kernel class validation
logic is completely replaced by the mapping logic.
The handle unknown logic is reworked. reject_unknown=1 is handled
when the mappings are computed at policy load time, similar to the old
handling by the class validation logic. allow_unknown=1 is handled
when computing and mapping decisions - if the permission was not able
to be mapped (i.e. undefined, mapped to zero), then it is
automatically added to the allowed vector. If the class was not able
to be mapped (i.e. undefined, mapped to zero), then all permissions
are allowed for it if allow_unknown=1.
avc_audit leverages the new security class mapping table to lookup the
class and permission names from the kernel-private indices.
The mdp program is updated to use the new table when generating the
class definitions and allow rules for a minimal boot policy for the
kernel. It should be noted that this policy will not include any
userspace classes, nor will its policy index values for the kernel
classes correspond with the ones in refpolicy (they will instead match
the kernel-private indices).
Signed-off-by: Stephen Smalley <sds@tycho.nsa.gov>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-30 17:37:50 +00:00
|
|
|
#include "classmap.h"
|
2006-11-06 17:38:16 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#define AVC_CACHE_SLOTS 512
|
|
|
|
#define AVC_DEF_CACHE_THRESHOLD 512
|
|
|
|
#define AVC_CACHE_RECLAIM 16
|
|
|
|
|
|
|
|
#ifdef CONFIG_SECURITY_SELINUX_AVC_STATS
|
2011-05-20 01:59:47 +00:00
|
|
|
#define avc_cache_stats_incr(field) this_cpu_inc(avc_cache_stats.field)
|
2005-04-16 22:20:36 +00:00
|
|
|
#else
|
|
|
|
#define avc_cache_stats_incr(field) do {} while (0)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
struct avc_entry {
|
|
|
|
u32 ssid;
|
|
|
|
u32 tsid;
|
|
|
|
u16 tclass;
|
|
|
|
struct av_decision avd;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct avc_node {
|
|
|
|
struct avc_entry ae;
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_node list; /* anchored in avc_cache->slots[i] */
|
2008-04-17 18:42:10 +00:00
|
|
|
struct rcu_head rhead;
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct avc_cache {
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head slots[AVC_CACHE_SLOTS]; /* head for avc_node->list */
|
2005-04-16 22:20:36 +00:00
|
|
|
spinlock_t slots_lock[AVC_CACHE_SLOTS]; /* lock for writes */
|
|
|
|
atomic_t lru_hint; /* LRU hint for reclaim scan */
|
|
|
|
atomic_t active_nodes;
|
|
|
|
u32 latest_notif; /* latest revocation notification */
|
|
|
|
};
|
|
|
|
|
|
|
|
struct avc_callback_node {
|
|
|
|
int (*callback) (u32 event, u32 ssid, u32 tsid,
|
2008-04-17 18:42:10 +00:00
|
|
|
u16 tclass, u32 perms,
|
|
|
|
u32 *out_retained);
|
2005-04-16 22:20:36 +00:00
|
|
|
u32 events;
|
|
|
|
u32 ssid;
|
|
|
|
u32 tsid;
|
|
|
|
u16 tclass;
|
|
|
|
u32 perms;
|
|
|
|
struct avc_callback_node *next;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Exported via selinufs */
|
|
|
|
unsigned int avc_cache_threshold = AVC_DEF_CACHE_THRESHOLD;
|
|
|
|
|
|
|
|
#ifdef CONFIG_SECURITY_SELINUX_AVC_STATS
|
|
|
|
DEFINE_PER_CPU(struct avc_cache_stats, avc_cache_stats) = { 0 };
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static struct avc_cache avc_cache;
|
|
|
|
static struct avc_callback_node *avc_callbacks;
|
2006-12-07 04:33:20 +00:00
|
|
|
static struct kmem_cache *avc_node_cachep;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static inline int avc_hash(u32 ssid, u32 tsid, u16 tclass)
|
|
|
|
{
|
|
|
|
return (ssid ^ (tsid<<2) ^ (tclass<<4)) & (AVC_CACHE_SLOTS - 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_dump_av - Display an access vector in human-readable form.
|
|
|
|
* @tclass: target security class
|
|
|
|
* @av: access vector
|
|
|
|
*/
|
2009-06-18 08:26:13 +00:00
|
|
|
static void avc_dump_av(struct audit_buffer *ab, u16 tclass, u32 av)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
selinux: dynamic class/perm discovery
Modify SELinux to dynamically discover class and permission values
upon policy load, based on the dynamic object class/perm discovery
logic from libselinux. A mapping is created between kernel-private
class and permission indices used outside the security server and the
policy values used within the security server.
The mappings are only applied upon kernel-internal computations;
similar mappings for the private indices of userspace object managers
is handled on a per-object manager basis by the userspace AVC. The
interfaces for compute_av and transition_sid are split for kernel
vs. userspace; the userspace functions are distinguished by a _user
suffix.
The kernel-private class indices are no longer tied to the policy
values and thus do not need to skip indices for userspace classes;
thus the kernel class index values are compressed. The flask.h
definitions were regenerated by deleting the userspace classes from
refpolicy's definitions and then regenerating the headers. Going
forward, we can just maintain the flask.h, av_permissions.h, and
classmap.h definitions separately from policy as they are no longer
tied to the policy values. The next patch introduces a utility to
automate generation of flask.h and av_permissions.h from the
classmap.h definitions.
The older kernel class and permission string tables are removed and
replaced by a single security class mapping table that is walked at
policy load to generate the mapping. The old kernel class validation
logic is completely replaced by the mapping logic.
The handle unknown logic is reworked. reject_unknown=1 is handled
when the mappings are computed at policy load time, similar to the old
handling by the class validation logic. allow_unknown=1 is handled
when computing and mapping decisions - if the permission was not able
to be mapped (i.e. undefined, mapped to zero), then it is
automatically added to the allowed vector. If the class was not able
to be mapped (i.e. undefined, mapped to zero), then all permissions
are allowed for it if allow_unknown=1.
avc_audit leverages the new security class mapping table to lookup the
class and permission names from the kernel-private indices.
The mdp program is updated to use the new table when generating the
class definitions and allow rules for a minimal boot policy for the
kernel. It should be noted that this policy will not include any
userspace classes, nor will its policy index values for the kernel
classes correspond with the ones in refpolicy (they will instead match
the kernel-private indices).
Signed-off-by: Stephen Smalley <sds@tycho.nsa.gov>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-30 17:37:50 +00:00
|
|
|
const char **perms;
|
|
|
|
int i, perm;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (av == 0) {
|
|
|
|
audit_log_format(ab, " null");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
selinux: dynamic class/perm discovery
Modify SELinux to dynamically discover class and permission values
upon policy load, based on the dynamic object class/perm discovery
logic from libselinux. A mapping is created between kernel-private
class and permission indices used outside the security server and the
policy values used within the security server.
The mappings are only applied upon kernel-internal computations;
similar mappings for the private indices of userspace object managers
is handled on a per-object manager basis by the userspace AVC. The
interfaces for compute_av and transition_sid are split for kernel
vs. userspace; the userspace functions are distinguished by a _user
suffix.
The kernel-private class indices are no longer tied to the policy
values and thus do not need to skip indices for userspace classes;
thus the kernel class index values are compressed. The flask.h
definitions were regenerated by deleting the userspace classes from
refpolicy's definitions and then regenerating the headers. Going
forward, we can just maintain the flask.h, av_permissions.h, and
classmap.h definitions separately from policy as they are no longer
tied to the policy values. The next patch introduces a utility to
automate generation of flask.h and av_permissions.h from the
classmap.h definitions.
The older kernel class and permission string tables are removed and
replaced by a single security class mapping table that is walked at
policy load to generate the mapping. The old kernel class validation
logic is completely replaced by the mapping logic.
The handle unknown logic is reworked. reject_unknown=1 is handled
when the mappings are computed at policy load time, similar to the old
handling by the class validation logic. allow_unknown=1 is handled
when computing and mapping decisions - if the permission was not able
to be mapped (i.e. undefined, mapped to zero), then it is
automatically added to the allowed vector. If the class was not able
to be mapped (i.e. undefined, mapped to zero), then all permissions
are allowed for it if allow_unknown=1.
avc_audit leverages the new security class mapping table to lookup the
class and permission names from the kernel-private indices.
The mdp program is updated to use the new table when generating the
class definitions and allow rules for a minimal boot policy for the
kernel. It should be noted that this policy will not include any
userspace classes, nor will its policy index values for the kernel
classes correspond with the ones in refpolicy (they will instead match
the kernel-private indices).
Signed-off-by: Stephen Smalley <sds@tycho.nsa.gov>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-30 17:37:50 +00:00
|
|
|
perms = secclass_map[tclass-1].perms;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
audit_log_format(ab, " {");
|
|
|
|
i = 0;
|
|
|
|
perm = 1;
|
selinux: dynamic class/perm discovery
Modify SELinux to dynamically discover class and permission values
upon policy load, based on the dynamic object class/perm discovery
logic from libselinux. A mapping is created between kernel-private
class and permission indices used outside the security server and the
policy values used within the security server.
The mappings are only applied upon kernel-internal computations;
similar mappings for the private indices of userspace object managers
is handled on a per-object manager basis by the userspace AVC. The
interfaces for compute_av and transition_sid are split for kernel
vs. userspace; the userspace functions are distinguished by a _user
suffix.
The kernel-private class indices are no longer tied to the policy
values and thus do not need to skip indices for userspace classes;
thus the kernel class index values are compressed. The flask.h
definitions were regenerated by deleting the userspace classes from
refpolicy's definitions and then regenerating the headers. Going
forward, we can just maintain the flask.h, av_permissions.h, and
classmap.h definitions separately from policy as they are no longer
tied to the policy values. The next patch introduces a utility to
automate generation of flask.h and av_permissions.h from the
classmap.h definitions.
The older kernel class and permission string tables are removed and
replaced by a single security class mapping table that is walked at
policy load to generate the mapping. The old kernel class validation
logic is completely replaced by the mapping logic.
The handle unknown logic is reworked. reject_unknown=1 is handled
when the mappings are computed at policy load time, similar to the old
handling by the class validation logic. allow_unknown=1 is handled
when computing and mapping decisions - if the permission was not able
to be mapped (i.e. undefined, mapped to zero), then it is
automatically added to the allowed vector. If the class was not able
to be mapped (i.e. undefined, mapped to zero), then all permissions
are allowed for it if allow_unknown=1.
avc_audit leverages the new security class mapping table to lookup the
class and permission names from the kernel-private indices.
The mdp program is updated to use the new table when generating the
class definitions and allow rules for a minimal boot policy for the
kernel. It should be noted that this policy will not include any
userspace classes, nor will its policy index values for the kernel
classes correspond with the ones in refpolicy (they will instead match
the kernel-private indices).
Signed-off-by: Stephen Smalley <sds@tycho.nsa.gov>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-30 17:37:50 +00:00
|
|
|
while (i < (sizeof(av) * 8)) {
|
2009-11-23 21:47:23 +00:00
|
|
|
if ((perm & av) && perms[i]) {
|
selinux: dynamic class/perm discovery
Modify SELinux to dynamically discover class and permission values
upon policy load, based on the dynamic object class/perm discovery
logic from libselinux. A mapping is created between kernel-private
class and permission indices used outside the security server and the
policy values used within the security server.
The mappings are only applied upon kernel-internal computations;
similar mappings for the private indices of userspace object managers
is handled on a per-object manager basis by the userspace AVC. The
interfaces for compute_av and transition_sid are split for kernel
vs. userspace; the userspace functions are distinguished by a _user
suffix.
The kernel-private class indices are no longer tied to the policy
values and thus do not need to skip indices for userspace classes;
thus the kernel class index values are compressed. The flask.h
definitions were regenerated by deleting the userspace classes from
refpolicy's definitions and then regenerating the headers. Going
forward, we can just maintain the flask.h, av_permissions.h, and
classmap.h definitions separately from policy as they are no longer
tied to the policy values. The next patch introduces a utility to
automate generation of flask.h and av_permissions.h from the
classmap.h definitions.
The older kernel class and permission string tables are removed and
replaced by a single security class mapping table that is walked at
policy load to generate the mapping. The old kernel class validation
logic is completely replaced by the mapping logic.
The handle unknown logic is reworked. reject_unknown=1 is handled
when the mappings are computed at policy load time, similar to the old
handling by the class validation logic. allow_unknown=1 is handled
when computing and mapping decisions - if the permission was not able
to be mapped (i.e. undefined, mapped to zero), then it is
automatically added to the allowed vector. If the class was not able
to be mapped (i.e. undefined, mapped to zero), then all permissions
are allowed for it if allow_unknown=1.
avc_audit leverages the new security class mapping table to lookup the
class and permission names from the kernel-private indices.
The mdp program is updated to use the new table when generating the
class definitions and allow rules for a minimal boot policy for the
kernel. It should be noted that this policy will not include any
userspace classes, nor will its policy index values for the kernel
classes correspond with the ones in refpolicy (they will instead match
the kernel-private indices).
Signed-off-by: Stephen Smalley <sds@tycho.nsa.gov>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-30 17:37:50 +00:00
|
|
|
audit_log_format(ab, " %s", perms[i]);
|
2005-04-16 22:20:36 +00:00
|
|
|
av &= ~perm;
|
|
|
|
}
|
|
|
|
i++;
|
|
|
|
perm <<= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (av)
|
|
|
|
audit_log_format(ab, " 0x%x", av);
|
|
|
|
|
|
|
|
audit_log_format(ab, " }");
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_dump_query - Display a SID pair and a class in human-readable form.
|
|
|
|
* @ssid: source security identifier
|
|
|
|
* @tsid: target security identifier
|
|
|
|
* @tclass: target security class
|
|
|
|
*/
|
|
|
|
static void avc_dump_query(struct audit_buffer *ab, u32 ssid, u32 tsid, u16 tclass)
|
|
|
|
{
|
|
|
|
int rc;
|
|
|
|
char *scontext;
|
|
|
|
u32 scontext_len;
|
|
|
|
|
2008-04-17 18:42:10 +00:00
|
|
|
rc = security_sid_to_context(ssid, &scontext, &scontext_len);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (rc)
|
|
|
|
audit_log_format(ab, "ssid=%d", ssid);
|
|
|
|
else {
|
|
|
|
audit_log_format(ab, "scontext=%s", scontext);
|
|
|
|
kfree(scontext);
|
|
|
|
}
|
|
|
|
|
|
|
|
rc = security_sid_to_context(tsid, &scontext, &scontext_len);
|
|
|
|
if (rc)
|
|
|
|
audit_log_format(ab, " tsid=%d", tsid);
|
|
|
|
else {
|
|
|
|
audit_log_format(ab, " tcontext=%s", scontext);
|
|
|
|
kfree(scontext);
|
|
|
|
}
|
2007-03-26 17:36:26 +00:00
|
|
|
|
selinux: dynamic class/perm discovery
Modify SELinux to dynamically discover class and permission values
upon policy load, based on the dynamic object class/perm discovery
logic from libselinux. A mapping is created between kernel-private
class and permission indices used outside the security server and the
policy values used within the security server.
The mappings are only applied upon kernel-internal computations;
similar mappings for the private indices of userspace object managers
is handled on a per-object manager basis by the userspace AVC. The
interfaces for compute_av and transition_sid are split for kernel
vs. userspace; the userspace functions are distinguished by a _user
suffix.
The kernel-private class indices are no longer tied to the policy
values and thus do not need to skip indices for userspace classes;
thus the kernel class index values are compressed. The flask.h
definitions were regenerated by deleting the userspace classes from
refpolicy's definitions and then regenerating the headers. Going
forward, we can just maintain the flask.h, av_permissions.h, and
classmap.h definitions separately from policy as they are no longer
tied to the policy values. The next patch introduces a utility to
automate generation of flask.h and av_permissions.h from the
classmap.h definitions.
The older kernel class and permission string tables are removed and
replaced by a single security class mapping table that is walked at
policy load to generate the mapping. The old kernel class validation
logic is completely replaced by the mapping logic.
The handle unknown logic is reworked. reject_unknown=1 is handled
when the mappings are computed at policy load time, similar to the old
handling by the class validation logic. allow_unknown=1 is handled
when computing and mapping decisions - if the permission was not able
to be mapped (i.e. undefined, mapped to zero), then it is
automatically added to the allowed vector. If the class was not able
to be mapped (i.e. undefined, mapped to zero), then all permissions
are allowed for it if allow_unknown=1.
avc_audit leverages the new security class mapping table to lookup the
class and permission names from the kernel-private indices.
The mdp program is updated to use the new table when generating the
class definitions and allow rules for a minimal boot policy for the
kernel. It should be noted that this policy will not include any
userspace classes, nor will its policy index values for the kernel
classes correspond with the ones in refpolicy (they will instead match
the kernel-private indices).
Signed-off-by: Stephen Smalley <sds@tycho.nsa.gov>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-30 17:37:50 +00:00
|
|
|
BUG_ON(tclass >= ARRAY_SIZE(secclass_map));
|
|
|
|
audit_log_format(ab, " tclass=%s", secclass_map[tclass-1].name);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_init - Initialize the AVC.
|
|
|
|
*
|
|
|
|
* Initialize the access vector cache.
|
|
|
|
*/
|
|
|
|
void __init avc_init(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < AVC_CACHE_SLOTS; i++) {
|
2009-02-12 19:51:04 +00:00
|
|
|
INIT_HLIST_HEAD(&avc_cache.slots[i]);
|
2005-04-16 22:20:36 +00:00
|
|
|
spin_lock_init(&avc_cache.slots_lock[i]);
|
|
|
|
}
|
|
|
|
atomic_set(&avc_cache.active_nodes, 0);
|
|
|
|
atomic_set(&avc_cache.lru_hint, 0);
|
|
|
|
|
|
|
|
avc_node_cachep = kmem_cache_create("avc_node", sizeof(struct avc_node),
|
2007-07-20 01:11:58 +00:00
|
|
|
0, SLAB_PANIC, NULL);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2005-06-22 14:04:33 +00:00
|
|
|
audit_log(current->audit_context, GFP_KERNEL, AUDIT_KERNEL, "AVC INITIALIZED\n");
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int avc_get_hash_stats(char *page)
|
|
|
|
{
|
|
|
|
int i, chain_len, max_chain_len, slots_used;
|
|
|
|
struct avc_node *node;
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head *head;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
|
|
|
|
slots_used = 0;
|
|
|
|
max_chain_len = 0;
|
|
|
|
for (i = 0; i < AVC_CACHE_SLOTS; i++) {
|
2009-02-12 19:50:59 +00:00
|
|
|
head = &avc_cache.slots[i];
|
2009-02-12 19:51:04 +00:00
|
|
|
if (!hlist_empty(head)) {
|
|
|
|
struct hlist_node *next;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
slots_used++;
|
|
|
|
chain_len = 0;
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_for_each_entry_rcu(node, next, head, list)
|
2005-04-16 22:20:36 +00:00
|
|
|
chain_len++;
|
|
|
|
if (chain_len > max_chain_len)
|
|
|
|
max_chain_len = chain_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return scnprintf(page, PAGE_SIZE, "entries: %d\nbuckets used: %d/%d\n"
|
|
|
|
"longest chain: %d\n",
|
|
|
|
atomic_read(&avc_cache.active_nodes),
|
|
|
|
slots_used, AVC_CACHE_SLOTS, max_chain_len);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void avc_node_free(struct rcu_head *rhead)
|
|
|
|
{
|
|
|
|
struct avc_node *node = container_of(rhead, struct avc_node, rhead);
|
|
|
|
kmem_cache_free(avc_node_cachep, node);
|
|
|
|
avc_cache_stats_incr(frees);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void avc_node_delete(struct avc_node *node)
|
|
|
|
{
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_del_rcu(&node->list);
|
2005-04-16 22:20:36 +00:00
|
|
|
call_rcu(&node->rhead, avc_node_free);
|
|
|
|
atomic_dec(&avc_cache.active_nodes);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void avc_node_kill(struct avc_node *node)
|
|
|
|
{
|
|
|
|
kmem_cache_free(avc_node_cachep, node);
|
|
|
|
avc_cache_stats_incr(frees);
|
|
|
|
atomic_dec(&avc_cache.active_nodes);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void avc_node_replace(struct avc_node *new, struct avc_node *old)
|
|
|
|
{
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_replace_rcu(&old->list, &new->list);
|
2005-04-16 22:20:36 +00:00
|
|
|
call_rcu(&old->rhead, avc_node_free);
|
|
|
|
atomic_dec(&avc_cache.active_nodes);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int avc_reclaim_node(void)
|
|
|
|
{
|
|
|
|
struct avc_node *node;
|
|
|
|
int hvalue, try, ecx;
|
|
|
|
unsigned long flags;
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head *head;
|
|
|
|
struct hlist_node *next;
|
2009-02-12 19:50:59 +00:00
|
|
|
spinlock_t *lock;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-04-17 18:42:10 +00:00
|
|
|
for (try = 0, ecx = 0; try < AVC_CACHE_SLOTS; try++) {
|
2005-04-16 22:20:36 +00:00
|
|
|
hvalue = atomic_inc_return(&avc_cache.lru_hint) & (AVC_CACHE_SLOTS - 1);
|
2009-02-12 19:50:59 +00:00
|
|
|
head = &avc_cache.slots[hvalue];
|
|
|
|
lock = &avc_cache.slots_lock[hvalue];
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-02-12 19:50:59 +00:00
|
|
|
if (!spin_trylock_irqsave(lock, flags))
|
2005-04-16 22:20:36 +00:00
|
|
|
continue;
|
|
|
|
|
2008-04-22 01:12:33 +00:00
|
|
|
rcu_read_lock();
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_for_each_entry(node, next, head, list) {
|
2009-02-12 19:50:43 +00:00
|
|
|
avc_node_delete(node);
|
|
|
|
avc_cache_stats_incr(reclaims);
|
|
|
|
ecx++;
|
|
|
|
if (ecx >= AVC_CACHE_RECLAIM) {
|
|
|
|
rcu_read_unlock();
|
2009-02-12 19:50:59 +00:00
|
|
|
spin_unlock_irqrestore(lock, flags);
|
2009-02-12 19:50:43 +00:00
|
|
|
goto out;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
2008-04-22 01:12:33 +00:00
|
|
|
rcu_read_unlock();
|
2009-02-12 19:50:59 +00:00
|
|
|
spin_unlock_irqrestore(lock, flags);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
out:
|
|
|
|
return ecx;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct avc_node *avc_alloc_node(void)
|
|
|
|
{
|
|
|
|
struct avc_node *node;
|
|
|
|
|
2007-02-10 09:45:03 +00:00
|
|
|
node = kmem_cache_zalloc(avc_node_cachep, GFP_ATOMIC);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!node)
|
|
|
|
goto out;
|
|
|
|
|
2009-02-12 19:51:04 +00:00
|
|
|
INIT_HLIST_NODE(&node->list);
|
2005-04-16 22:20:36 +00:00
|
|
|
avc_cache_stats_incr(allocations);
|
|
|
|
|
|
|
|
if (atomic_inc_return(&avc_cache.active_nodes) > avc_cache_threshold)
|
|
|
|
avc_reclaim_node();
|
|
|
|
|
|
|
|
out:
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
2009-02-12 19:50:49 +00:00
|
|
|
static void avc_node_populate(struct avc_node *node, u32 ssid, u32 tsid, u16 tclass, struct av_decision *avd)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
node->ae.ssid = ssid;
|
|
|
|
node->ae.tsid = tsid;
|
|
|
|
node->ae.tclass = tclass;
|
2009-02-12 19:50:49 +00:00
|
|
|
memcpy(&node->ae.avd, avd, sizeof(node->ae.avd));
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct avc_node *avc_search_node(u32 ssid, u32 tsid, u16 tclass)
|
|
|
|
{
|
|
|
|
struct avc_node *node, *ret = NULL;
|
|
|
|
int hvalue;
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head *head;
|
|
|
|
struct hlist_node *next;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
hvalue = avc_hash(ssid, tsid, tclass);
|
2009-02-12 19:50:59 +00:00
|
|
|
head = &avc_cache.slots[hvalue];
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_for_each_entry_rcu(node, next, head, list) {
|
2005-04-16 22:20:36 +00:00
|
|
|
if (ssid == node->ae.ssid &&
|
|
|
|
tclass == node->ae.tclass &&
|
|
|
|
tsid == node->ae.tsid) {
|
|
|
|
ret = node;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_lookup - Look up an AVC entry.
|
|
|
|
* @ssid: source security identifier
|
|
|
|
* @tsid: target security identifier
|
|
|
|
* @tclass: target security class
|
|
|
|
*
|
|
|
|
* Look up an AVC entry that is valid for the
|
|
|
|
* (@ssid, @tsid), interpreting the permissions
|
|
|
|
* based on @tclass. If a valid AVC entry exists,
|
2010-01-15 07:03:18 +00:00
|
|
|
* then this function returns the avc_node.
|
2005-04-16 22:20:36 +00:00
|
|
|
* Otherwise, this function returns NULL.
|
|
|
|
*/
|
2009-02-12 19:50:54 +00:00
|
|
|
static struct avc_node *avc_lookup(u32 ssid, u32 tsid, u16 tclass)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct avc_node *node;
|
|
|
|
|
|
|
|
avc_cache_stats_incr(lookups);
|
|
|
|
node = avc_search_node(ssid, tsid, tclass);
|
|
|
|
|
2009-02-12 19:50:54 +00:00
|
|
|
if (node)
|
2011-05-20 04:22:53 +00:00
|
|
|
return node;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2011-05-20 04:22:53 +00:00
|
|
|
avc_cache_stats_incr(misses);
|
|
|
|
return NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int avc_latest_notif_update(int seqno, int is_insert)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
static DEFINE_SPINLOCK(notif_lock);
|
|
|
|
unsigned long flag;
|
|
|
|
|
|
|
|
spin_lock_irqsave(¬if_lock, flag);
|
|
|
|
if (is_insert) {
|
|
|
|
if (seqno < avc_cache.latest_notif) {
|
2008-04-17 15:52:44 +00:00
|
|
|
printk(KERN_WARNING "SELinux: avc: seqno %d < latest_notif %d\n",
|
2005-04-16 22:20:36 +00:00
|
|
|
seqno, avc_cache.latest_notif);
|
|
|
|
ret = -EAGAIN;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (seqno > avc_cache.latest_notif)
|
|
|
|
avc_cache.latest_notif = seqno;
|
|
|
|
}
|
|
|
|
spin_unlock_irqrestore(¬if_lock, flag);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_insert - Insert an AVC entry.
|
|
|
|
* @ssid: source security identifier
|
|
|
|
* @tsid: target security identifier
|
|
|
|
* @tclass: target security class
|
2009-02-12 19:50:49 +00:00
|
|
|
* @avd: resulting av decision
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Insert an AVC entry for the SID pair
|
|
|
|
* (@ssid, @tsid) and class @tclass.
|
|
|
|
* The access vectors and the sequence number are
|
|
|
|
* normally provided by the security server in
|
|
|
|
* response to a security_compute_av() call. If the
|
2009-02-12 19:50:49 +00:00
|
|
|
* sequence number @avd->seqno is not less than the latest
|
2005-04-16 22:20:36 +00:00
|
|
|
* revocation notification, then the function copies
|
|
|
|
* the access vectors into a cache entry, returns
|
|
|
|
* avc_node inserted. Otherwise, this function returns NULL.
|
|
|
|
*/
|
2009-02-12 19:50:49 +00:00
|
|
|
static struct avc_node *avc_insert(u32 ssid, u32 tsid, u16 tclass, struct av_decision *avd)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct avc_node *pos, *node = NULL;
|
|
|
|
int hvalue;
|
|
|
|
unsigned long flag;
|
|
|
|
|
2009-02-12 19:50:49 +00:00
|
|
|
if (avc_latest_notif_update(avd->seqno, 1))
|
2005-04-16 22:20:36 +00:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
node = avc_alloc_node();
|
|
|
|
if (node) {
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head *head;
|
|
|
|
struct hlist_node *next;
|
2009-02-12 19:50:59 +00:00
|
|
|
spinlock_t *lock;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
hvalue = avc_hash(ssid, tsid, tclass);
|
2009-02-12 19:50:49 +00:00
|
|
|
avc_node_populate(node, ssid, tsid, tclass, avd);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-02-12 19:50:59 +00:00
|
|
|
head = &avc_cache.slots[hvalue];
|
|
|
|
lock = &avc_cache.slots_lock[hvalue];
|
|
|
|
|
|
|
|
spin_lock_irqsave(lock, flag);
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_for_each_entry(pos, next, head, list) {
|
2005-04-16 22:20:36 +00:00
|
|
|
if (pos->ae.ssid == ssid &&
|
|
|
|
pos->ae.tsid == tsid &&
|
|
|
|
pos->ae.tclass == tclass) {
|
2008-04-17 18:42:10 +00:00
|
|
|
avc_node_replace(node, pos);
|
2005-04-16 22:20:36 +00:00
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
}
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_add_head_rcu(&node->list, head);
|
2005-04-16 22:20:36 +00:00
|
|
|
found:
|
2009-02-12 19:50:59 +00:00
|
|
|
spin_unlock_irqrestore(lock, flag);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
out:
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
2009-07-14 16:14:09 +00:00
|
|
|
/**
|
|
|
|
* avc_audit_pre_callback - SELinux specific information
|
|
|
|
* will be called by generic audit code
|
|
|
|
* @ab: the audit buffer
|
|
|
|
* @a: audit_data
|
|
|
|
*/
|
|
|
|
static void avc_audit_pre_callback(struct audit_buffer *ab, void *a)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2009-07-14 16:14:09 +00:00
|
|
|
struct common_audit_data *ad = a;
|
|
|
|
audit_log_format(ab, "avc: %s ",
|
2012-04-03 16:38:00 +00:00
|
|
|
ad->selinux_audit_data->slad->denied ? "denied" : "granted");
|
|
|
|
avc_dump_av(ab, ad->selinux_audit_data->slad->tclass,
|
|
|
|
ad->selinux_audit_data->slad->audited);
|
2009-07-14 16:14:09 +00:00
|
|
|
audit_log_format(ab, " for ");
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2009-07-14 16:14:09 +00:00
|
|
|
/**
|
|
|
|
* avc_audit_post_callback - SELinux specific information
|
|
|
|
* will be called by generic audit code
|
|
|
|
* @ab: the audit buffer
|
|
|
|
* @a: audit_data
|
|
|
|
*/
|
|
|
|
static void avc_audit_post_callback(struct audit_buffer *ab, void *a)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2009-07-14 16:14:09 +00:00
|
|
|
struct common_audit_data *ad = a;
|
|
|
|
audit_log_format(ab, " ");
|
2012-04-03 16:38:00 +00:00
|
|
|
avc_dump_query(ab, ad->selinux_audit_data->slad->ssid,
|
|
|
|
ad->selinux_audit_data->slad->tsid,
|
|
|
|
ad->selinux_audit_data->slad->tclass);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2012-03-23 00:01:41 +00:00
|
|
|
/* This is the slow part of avc audit with big stack footprint */
|
2012-04-04 19:01:42 +00:00
|
|
|
noinline int slow_avc_audit(u32 ssid, u32 tsid, u16 tclass,
|
2012-03-23 00:01:41 +00:00
|
|
|
u32 requested, u32 audited, u32 denied,
|
2012-04-02 17:15:55 +00:00
|
|
|
struct common_audit_data *a,
|
2012-03-23 00:01:41 +00:00
|
|
|
unsigned flags)
|
|
|
|
{
|
|
|
|
struct common_audit_data stack_data;
|
2012-04-03 16:37:02 +00:00
|
|
|
struct selinux_audit_data sad = {0,};
|
2012-04-03 16:38:00 +00:00
|
|
|
struct selinux_late_audit_data slad;
|
2012-03-23 00:01:41 +00:00
|
|
|
|
|
|
|
if (!a) {
|
|
|
|
a = &stack_data;
|
2012-04-04 19:01:42 +00:00
|
|
|
COMMON_AUDIT_DATA_INIT(a, LSM_AUDIT_DATA_NONE);
|
2012-04-03 16:37:02 +00:00
|
|
|
a->selinux_audit_data = &sad;
|
2012-03-23 00:01:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* When in a RCU walk do the audit on the RCU retry. This is because
|
|
|
|
* the collection of the dname in an inode audit message is not RCU
|
|
|
|
* safe. Note this may drop some audits when the situation changes
|
|
|
|
* during retry. However this is logically just as if the operation
|
|
|
|
* happened a little later.
|
|
|
|
*/
|
|
|
|
if ((a->type == LSM_AUDIT_DATA_INODE) &&
|
|
|
|
(flags & MAY_NOT_BLOCK))
|
|
|
|
return -ECHILD;
|
|
|
|
|
2012-04-03 16:38:00 +00:00
|
|
|
slad.tclass = tclass;
|
|
|
|
slad.requested = requested;
|
|
|
|
slad.ssid = ssid;
|
|
|
|
slad.tsid = tsid;
|
|
|
|
slad.audited = audited;
|
|
|
|
slad.denied = denied;
|
|
|
|
|
|
|
|
a->selinux_audit_data->slad = &slad;
|
2012-04-02 22:48:12 +00:00
|
|
|
common_lsm_audit(a, avc_audit_pre_callback, avc_audit_post_callback);
|
2012-03-23 00:01:41 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/**
|
|
|
|
* avc_add_callback - Register a callback for security events.
|
|
|
|
* @callback: callback function
|
|
|
|
* @events: security events
|
|
|
|
* @ssid: source security identifier or %SECSID_WILD
|
|
|
|
* @tsid: target security identifier or %SECSID_WILD
|
|
|
|
* @tclass: target security class
|
|
|
|
* @perms: permissions
|
|
|
|
*
|
|
|
|
* Register a callback function for events in the set @events
|
2010-01-15 07:03:18 +00:00
|
|
|
* related to the SID pair (@ssid, @tsid)
|
2005-04-16 22:20:36 +00:00
|
|
|
* and the permissions @perms, interpreting
|
|
|
|
* @perms based on @tclass. Returns %0 on success or
|
|
|
|
* -%ENOMEM if insufficient memory exists to add the callback.
|
|
|
|
*/
|
|
|
|
int avc_add_callback(int (*callback)(u32 event, u32 ssid, u32 tsid,
|
2008-04-17 18:42:10 +00:00
|
|
|
u16 tclass, u32 perms,
|
|
|
|
u32 *out_retained),
|
|
|
|
u32 events, u32 ssid, u32 tsid,
|
|
|
|
u16 tclass, u32 perms)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct avc_callback_node *c;
|
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
c = kmalloc(sizeof(*c), GFP_ATOMIC);
|
|
|
|
if (!c) {
|
|
|
|
rc = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
c->callback = callback;
|
|
|
|
c->events = events;
|
|
|
|
c->ssid = ssid;
|
|
|
|
c->tsid = tsid;
|
|
|
|
c->perms = perms;
|
|
|
|
c->next = avc_callbacks;
|
|
|
|
avc_callbacks = c;
|
|
|
|
out:
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int avc_sidcmp(u32 x, u32 y)
|
|
|
|
{
|
|
|
|
return (x == y || x == SECSID_WILD || y == SECSID_WILD);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_update_node Update an AVC entry
|
|
|
|
* @event : Updating event
|
|
|
|
* @perms : Permission mask bits
|
|
|
|
* @ssid,@tsid,@tclass : identifier of an AVC entry
|
2009-02-12 19:50:11 +00:00
|
|
|
* @seqno : sequence number when decision was made
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* if a valid AVC entry doesn't exist,this function returns -ENOENT.
|
|
|
|
* if kmalloc() called internal returns NULL, this function returns -ENOMEM.
|
2010-01-15 07:03:18 +00:00
|
|
|
* otherwise, this function updates the AVC entry. The original AVC-entry object
|
2005-04-16 22:20:36 +00:00
|
|
|
* will release later by RCU.
|
|
|
|
*/
|
2009-02-12 19:50:11 +00:00
|
|
|
static int avc_update_node(u32 event, u32 perms, u32 ssid, u32 tsid, u16 tclass,
|
|
|
|
u32 seqno)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
int hvalue, rc = 0;
|
|
|
|
unsigned long flag;
|
|
|
|
struct avc_node *pos, *node, *orig = NULL;
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head *head;
|
|
|
|
struct hlist_node *next;
|
2009-02-12 19:50:59 +00:00
|
|
|
spinlock_t *lock;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
node = avc_alloc_node();
|
|
|
|
if (!node) {
|
|
|
|
rc = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Lock the target slot */
|
|
|
|
hvalue = avc_hash(ssid, tsid, tclass);
|
|
|
|
|
2009-02-12 19:50:59 +00:00
|
|
|
head = &avc_cache.slots[hvalue];
|
|
|
|
lock = &avc_cache.slots_lock[hvalue];
|
|
|
|
|
|
|
|
spin_lock_irqsave(lock, flag);
|
|
|
|
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_for_each_entry(pos, next, head, list) {
|
2008-04-17 18:42:10 +00:00
|
|
|
if (ssid == pos->ae.ssid &&
|
|
|
|
tsid == pos->ae.tsid &&
|
2009-02-12 19:50:11 +00:00
|
|
|
tclass == pos->ae.tclass &&
|
|
|
|
seqno == pos->ae.avd.seqno){
|
2005-04-16 22:20:36 +00:00
|
|
|
orig = pos;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!orig) {
|
|
|
|
rc = -ENOENT;
|
|
|
|
avc_node_kill(node);
|
|
|
|
goto out_unlock;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy and replace original node.
|
|
|
|
*/
|
|
|
|
|
2009-02-12 19:50:49 +00:00
|
|
|
avc_node_populate(node, ssid, tsid, tclass, &orig->ae.avd);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
switch (event) {
|
|
|
|
case AVC_CALLBACK_GRANT:
|
|
|
|
node->ae.avd.allowed |= perms;
|
|
|
|
break;
|
|
|
|
case AVC_CALLBACK_TRY_REVOKE:
|
|
|
|
case AVC_CALLBACK_REVOKE:
|
|
|
|
node->ae.avd.allowed &= ~perms;
|
|
|
|
break;
|
|
|
|
case AVC_CALLBACK_AUDITALLOW_ENABLE:
|
|
|
|
node->ae.avd.auditallow |= perms;
|
|
|
|
break;
|
|
|
|
case AVC_CALLBACK_AUDITALLOW_DISABLE:
|
|
|
|
node->ae.avd.auditallow &= ~perms;
|
|
|
|
break;
|
|
|
|
case AVC_CALLBACK_AUDITDENY_ENABLE:
|
|
|
|
node->ae.avd.auditdeny |= perms;
|
|
|
|
break;
|
|
|
|
case AVC_CALLBACK_AUDITDENY_DISABLE:
|
|
|
|
node->ae.avd.auditdeny &= ~perms;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
avc_node_replace(node, orig);
|
|
|
|
out_unlock:
|
2009-02-12 19:50:59 +00:00
|
|
|
spin_unlock_irqrestore(lock, flag);
|
2005-04-16 22:20:36 +00:00
|
|
|
out:
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2009-09-13 02:54:17 +00:00
|
|
|
* avc_flush - Flush the cache
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2009-09-13 02:54:17 +00:00
|
|
|
static void avc_flush(void)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2009-02-12 19:51:04 +00:00
|
|
|
struct hlist_head *head;
|
|
|
|
struct hlist_node *next;
|
2009-09-13 02:54:17 +00:00
|
|
|
struct avc_node *node;
|
2009-02-12 19:50:59 +00:00
|
|
|
spinlock_t *lock;
|
2009-09-13 02:54:17 +00:00
|
|
|
unsigned long flag;
|
|
|
|
int i;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
for (i = 0; i < AVC_CACHE_SLOTS; i++) {
|
2009-02-12 19:50:59 +00:00
|
|
|
head = &avc_cache.slots[i];
|
|
|
|
lock = &avc_cache.slots_lock[i];
|
|
|
|
|
|
|
|
spin_lock_irqsave(lock, flag);
|
2008-04-22 01:12:33 +00:00
|
|
|
/*
|
|
|
|
* With preemptable RCU, the outer spinlock does not
|
|
|
|
* prevent RCU grace periods from ending.
|
|
|
|
*/
|
|
|
|
rcu_read_lock();
|
2009-02-12 19:51:04 +00:00
|
|
|
hlist_for_each_entry(node, next, head, list)
|
2005-04-16 22:20:36 +00:00
|
|
|
avc_node_delete(node);
|
2008-04-22 01:12:33 +00:00
|
|
|
rcu_read_unlock();
|
2009-02-12 19:50:59 +00:00
|
|
|
spin_unlock_irqrestore(lock, flag);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2009-09-13 02:54:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_ss_reset - Flush the cache and revalidate migrated permissions.
|
|
|
|
* @seqno: policy sequence number
|
|
|
|
*/
|
|
|
|
int avc_ss_reset(u32 seqno)
|
|
|
|
{
|
|
|
|
struct avc_callback_node *c;
|
|
|
|
int rc = 0, tmprc;
|
|
|
|
|
|
|
|
avc_flush();
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
for (c = avc_callbacks; c; c = c->next) {
|
|
|
|
if (c->events & AVC_CALLBACK_RESET) {
|
2006-02-24 21:44:05 +00:00
|
|
|
tmprc = c->callback(AVC_CALLBACK_RESET,
|
2008-04-17 18:42:10 +00:00
|
|
|
0, 0, 0, 0, NULL);
|
2006-02-24 21:44:05 +00:00
|
|
|
/* save the first error encountered for the return
|
|
|
|
value and continue processing the callbacks */
|
|
|
|
if (!rc)
|
|
|
|
rc = tmprc;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
avc_latest_notif_update(seqno, 0);
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2012-03-31 17:58:08 +00:00
|
|
|
/*
|
|
|
|
* Slow-path helper function for avc_has_perm_noaudit,
|
|
|
|
* when the avc_node lookup fails. We get called with
|
|
|
|
* the RCU read lock held, and need to return with it
|
|
|
|
* still held, but drop if for the security compute.
|
|
|
|
*
|
|
|
|
* Don't inline this, since it's the slow-path and just
|
|
|
|
* results in a bigger stack frame.
|
|
|
|
*/
|
|
|
|
static noinline struct avc_node *avc_compute_av(u32 ssid, u32 tsid,
|
|
|
|
u16 tclass, struct av_decision *avd)
|
|
|
|
{
|
|
|
|
rcu_read_unlock();
|
|
|
|
security_compute_av(ssid, tsid, tclass, avd);
|
|
|
|
rcu_read_lock();
|
|
|
|
return avc_insert(ssid, tsid, tclass, avd);
|
|
|
|
}
|
|
|
|
|
|
|
|
static noinline int avc_denied(u32 ssid, u32 tsid,
|
|
|
|
u16 tclass, u32 requested,
|
|
|
|
unsigned flags,
|
|
|
|
struct av_decision *avd)
|
|
|
|
{
|
|
|
|
if (flags & AVC_STRICT)
|
|
|
|
return -EACCES;
|
|
|
|
|
|
|
|
if (selinux_enforcing && !(avd->flags & AVD_FLAGS_PERMISSIVE))
|
|
|
|
return -EACCES;
|
|
|
|
|
|
|
|
avc_update_node(AVC_CALLBACK_GRANT, requested, ssid,
|
|
|
|
tsid, tclass, avd->seqno);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/**
|
|
|
|
* avc_has_perm_noaudit - Check permissions but perform no auditing.
|
|
|
|
* @ssid: source security identifier
|
|
|
|
* @tsid: target security identifier
|
|
|
|
* @tclass: target security class
|
|
|
|
* @requested: requested permissions, interpreted based on @tclass
|
2007-06-07 19:34:10 +00:00
|
|
|
* @flags: AVC_STRICT or 0
|
2005-04-16 22:20:36 +00:00
|
|
|
* @avd: access vector decisions
|
|
|
|
*
|
|
|
|
* Check the AVC to determine whether the @requested permissions are granted
|
|
|
|
* for the SID pair (@ssid, @tsid), interpreting the permissions
|
|
|
|
* based on @tclass, and call the security server on a cache miss to obtain
|
|
|
|
* a new decision and add it to the cache. Return a copy of the decisions
|
|
|
|
* in @avd. Return %0 if all @requested permissions are granted,
|
|
|
|
* -%EACCES if any permissions are denied, or another -errno upon
|
|
|
|
* other errors. This function is typically called by avc_has_perm(),
|
|
|
|
* but may also be called directly to separate permission checking from
|
|
|
|
* auditing, e.g. in cases where a lock must be held for the check but
|
|
|
|
* should be released for the auditing.
|
|
|
|
*/
|
2012-03-31 18:12:57 +00:00
|
|
|
inline int avc_has_perm_noaudit(u32 ssid, u32 tsid,
|
2007-06-07 19:34:10 +00:00
|
|
|
u16 tclass, u32 requested,
|
|
|
|
unsigned flags,
|
2011-05-24 20:48:51 +00:00
|
|
|
struct av_decision *avd)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct avc_node *node;
|
|
|
|
int rc = 0;
|
|
|
|
u32 denied;
|
|
|
|
|
2008-03-11 18:19:34 +00:00
|
|
|
BUG_ON(!requested);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
|
2009-02-12 19:50:54 +00:00
|
|
|
node = avc_lookup(ssid, tsid, tclass);
|
2011-05-20 04:22:53 +00:00
|
|
|
if (unlikely(!node)) {
|
2012-03-31 17:58:08 +00:00
|
|
|
node = avc_compute_av(ssid, tsid, tclass, avd);
|
2009-02-12 19:50:49 +00:00
|
|
|
} else {
|
2011-05-24 20:48:51 +00:00
|
|
|
memcpy(avd, &node->ae.avd, sizeof(*avd));
|
2009-02-12 19:50:49 +00:00
|
|
|
avd = &node->ae.avd;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2009-02-12 19:50:49 +00:00
|
|
|
denied = requested & ~(avd->allowed);
|
2012-03-31 17:58:08 +00:00
|
|
|
if (unlikely(denied))
|
|
|
|
rc = avc_denied(ssid, tsid, tclass, requested, flags, avd);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
rcu_read_unlock();
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* avc_has_perm - Check permissions and perform any appropriate auditing.
|
|
|
|
* @ssid: source security identifier
|
|
|
|
* @tsid: target security identifier
|
|
|
|
* @tclass: target security class
|
|
|
|
* @requested: requested permissions, interpreted based on @tclass
|
|
|
|
* @auditdata: auxiliary audit data
|
2011-04-25 20:26:29 +00:00
|
|
|
* @flags: VFS walk flags
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Check the AVC to determine whether the @requested permissions are granted
|
|
|
|
* for the SID pair (@ssid, @tsid), interpreting the permissions
|
|
|
|
* based on @tclass, and call the security server on a cache miss to obtain
|
|
|
|
* a new decision and add it to the cache. Audit the granting or denial of
|
|
|
|
* permissions in accordance with the policy. Return %0 if all @requested
|
|
|
|
* permissions are granted, -%EACCES if any permissions are denied, or
|
|
|
|
* another -errno upon other errors.
|
|
|
|
*/
|
2011-04-25 20:26:29 +00:00
|
|
|
int avc_has_perm_flags(u32 ssid, u32 tsid, u16 tclass,
|
|
|
|
u32 requested, struct common_audit_data *auditdata,
|
|
|
|
unsigned flags)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct av_decision avd;
|
2011-04-25 20:26:29 +00:00
|
|
|
int rc, rc2;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2007-06-07 19:34:10 +00:00
|
|
|
rc = avc_has_perm_noaudit(ssid, tsid, tclass, requested, 0, &avd);
|
2011-04-25 20:26:29 +00:00
|
|
|
|
|
|
|
rc2 = avc_audit(ssid, tsid, tclass, requested, &avd, rc, auditdata,
|
|
|
|
flags);
|
|
|
|
if (rc2)
|
|
|
|
return rc2;
|
2005-04-16 22:20:36 +00:00
|
|
|
return rc;
|
|
|
|
}
|
2007-09-14 00:27:07 +00:00
|
|
|
|
|
|
|
u32 avc_policy_seqno(void)
|
|
|
|
{
|
|
|
|
return avc_cache.latest_notif;
|
|
|
|
}
|
2009-06-24 21:58:05 +00:00
|
|
|
|
|
|
|
void avc_disable(void)
|
|
|
|
{
|
2009-09-21 01:21:10 +00:00
|
|
|
/*
|
|
|
|
* If you are looking at this because you have realized that we are
|
|
|
|
* not destroying the avc_node_cachep it might be easy to fix, but
|
|
|
|
* I don't know the memory barrier semantics well enough to know. It's
|
|
|
|
* possible that some other task dereferenced security_ops when
|
|
|
|
* it still pointed to selinux operations. If that is the case it's
|
|
|
|
* possible that it is about to use the avc and is about to need the
|
|
|
|
* avc_node_cachep. I know I could wrap the security.c security_ops call
|
|
|
|
* in an rcu_lock, but seriously, it's not worth it. Instead I just flush
|
|
|
|
* the cache and get that memory back.
|
|
|
|
*/
|
|
|
|
if (avc_node_cachep) {
|
|
|
|
avc_flush();
|
|
|
|
/* kmem_cache_destroy(avc_node_cachep); */
|
|
|
|
}
|
2009-06-24 21:58:05 +00:00
|
|
|
}
|