2008-01-29 06:38:13 -07:00
|
|
|
/*
|
|
|
|
* Network node table
|
|
|
|
*
|
|
|
|
* SELinux must keep a mapping of network nodes to labels/SIDs. This
|
|
|
|
* mapping is maintained as part of the normal policy but a fast cache is
|
|
|
|
* needed to reduce the lookup overhead since most of these queries happen on
|
|
|
|
* a per-packet basis.
|
|
|
|
*
|
2011-08-01 05:10:33 -06:00
|
|
|
* Author: Paul Moore <paul@paul-moore.com>
|
2008-01-29 06:38:13 -07:00
|
|
|
*
|
|
|
|
* This code is heavily based on the "netif" concept originally developed by
|
|
|
|
* James Morris <jmorris@redhat.com>
|
|
|
|
* (see security/selinux/netif.c for more information)
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* (c) Copyright Hewlett-Packard Development Company, L.P., 2007
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of version 2 of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/rcupdate.h>
|
|
|
|
#include <linux/list.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2008-01-29 06:38:13 -07:00
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/in.h>
|
|
|
|
#include <linux/in6.h>
|
|
|
|
#include <linux/ip.h>
|
|
|
|
#include <linux/ipv6.h>
|
|
|
|
#include <net/ip.h>
|
|
|
|
#include <net/ipv6.h>
|
|
|
|
|
2008-04-25 13:03:34 -06:00
|
|
|
#include "netnode.h"
|
2008-01-29 06:38:13 -07:00
|
|
|
#include "objsec.h"
|
|
|
|
|
|
|
|
#define SEL_NETNODE_HASH_SIZE 256
|
|
|
|
#define SEL_NETNODE_HASH_BKT_LIMIT 16
|
|
|
|
|
2008-04-25 13:03:34 -06:00
|
|
|
struct sel_netnode_bkt {
|
|
|
|
unsigned int size;
|
|
|
|
struct list_head list;
|
|
|
|
};
|
|
|
|
|
2008-01-29 06:38:13 -07:00
|
|
|
struct sel_netnode {
|
|
|
|
struct netnode_security_struct nsec;
|
|
|
|
|
|
|
|
struct list_head list;
|
|
|
|
struct rcu_head rcu;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* NOTE: we are using a combined hash table for both IPv4 and IPv6, the reason
|
|
|
|
* for this is that I suspect most users will not make heavy use of both
|
|
|
|
* address families at the same time so one table will usually end up wasted,
|
|
|
|
* if this becomes a problem we can always add a hash table for each address
|
|
|
|
* family later */
|
|
|
|
|
|
|
|
static LIST_HEAD(sel_netnode_list);
|
|
|
|
static DEFINE_SPINLOCK(sel_netnode_lock);
|
2008-04-25 13:03:34 -06:00
|
|
|
static struct sel_netnode_bkt sel_netnode_hash[SEL_NETNODE_HASH_SIZE];
|
2008-01-29 06:38:13 -07:00
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_hashfn_ipv4 - IPv4 hashing function for the node table
|
|
|
|
* @addr: IPv4 address
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This is the IPv4 hashing function for the node interface table, it returns
|
|
|
|
* the bucket number for the given IP address.
|
|
|
|
*
|
|
|
|
*/
|
2008-04-25 13:03:34 -06:00
|
|
|
static unsigned int sel_netnode_hashfn_ipv4(__be32 addr)
|
2008-01-29 06:38:13 -07:00
|
|
|
{
|
|
|
|
/* at some point we should determine if the mismatch in byte order
|
|
|
|
* affects the hash function dramatically */
|
|
|
|
return (addr & (SEL_NETNODE_HASH_SIZE - 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_hashfn_ipv6 - IPv6 hashing function for the node table
|
|
|
|
* @addr: IPv6 address
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This is the IPv6 hashing function for the node interface table, it returns
|
|
|
|
* the bucket number for the given IP address.
|
|
|
|
*
|
|
|
|
*/
|
2008-04-25 13:03:34 -06:00
|
|
|
static unsigned int sel_netnode_hashfn_ipv6(const struct in6_addr *addr)
|
2008-01-29 06:38:13 -07:00
|
|
|
{
|
|
|
|
/* just hash the least significant 32 bits to keep things fast (they
|
|
|
|
* are the most likely to be different anyway), we can revisit this
|
|
|
|
* later if needed */
|
|
|
|
return (addr->s6_addr32[3] & (SEL_NETNODE_HASH_SIZE - 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_find - Search for a node record
|
|
|
|
* @addr: IP address
|
|
|
|
* @family: address family
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Search the network node table and return the record matching @addr. If an
|
|
|
|
* entry can not be found in the table return NULL.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static struct sel_netnode *sel_netnode_find(const void *addr, u16 family)
|
|
|
|
{
|
2008-04-25 13:03:34 -06:00
|
|
|
unsigned int idx;
|
2008-01-29 06:38:13 -07:00
|
|
|
struct sel_netnode *node;
|
|
|
|
|
|
|
|
switch (family) {
|
|
|
|
case PF_INET:
|
|
|
|
idx = sel_netnode_hashfn_ipv4(*(__be32 *)addr);
|
|
|
|
break;
|
|
|
|
case PF_INET6:
|
|
|
|
idx = sel_netnode_hashfn_ipv6(addr);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
2011-04-20 08:21:28 -06:00
|
|
|
return NULL;
|
2008-01-29 06:38:13 -07:00
|
|
|
}
|
|
|
|
|
2008-04-25 13:03:34 -06:00
|
|
|
list_for_each_entry_rcu(node, &sel_netnode_hash[idx].list, list)
|
2008-01-29 06:38:13 -07:00
|
|
|
if (node->nsec.family == family)
|
|
|
|
switch (family) {
|
|
|
|
case PF_INET:
|
|
|
|
if (node->nsec.addr.ipv4 == *(__be32 *)addr)
|
|
|
|
return node;
|
|
|
|
break;
|
|
|
|
case PF_INET6:
|
|
|
|
if (ipv6_addr_equal(&node->nsec.addr.ipv6,
|
|
|
|
addr))
|
|
|
|
return node;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_insert - Insert a new node into the table
|
|
|
|
* @node: the new node record
|
|
|
|
*
|
|
|
|
* Description:
|
2008-04-25 13:03:34 -06:00
|
|
|
* Add a new node record to the network address hash table.
|
2008-01-29 06:38:13 -07:00
|
|
|
*
|
|
|
|
*/
|
2008-04-25 13:03:34 -06:00
|
|
|
static void sel_netnode_insert(struct sel_netnode *node)
|
2008-01-29 06:38:13 -07:00
|
|
|
{
|
2008-04-25 13:03:34 -06:00
|
|
|
unsigned int idx;
|
2008-01-29 06:38:13 -07:00
|
|
|
|
|
|
|
switch (node->nsec.family) {
|
|
|
|
case PF_INET:
|
|
|
|
idx = sel_netnode_hashfn_ipv4(node->nsec.addr.ipv4);
|
|
|
|
break;
|
|
|
|
case PF_INET6:
|
|
|
|
idx = sel_netnode_hashfn_ipv6(&node->nsec.addr.ipv6);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
2013-07-23 15:38:38 -06:00
|
|
|
return;
|
2008-01-29 06:38:13 -07:00
|
|
|
}
|
2008-04-25 13:03:34 -06:00
|
|
|
|
2008-01-29 06:38:13 -07:00
|
|
|
/* we need to impose a limit on the growth of the hash table so check
|
|
|
|
* this bucket to make sure it is within the specified bounds */
|
2008-04-25 13:03:34 -06:00
|
|
|
list_add_rcu(&node->list, &sel_netnode_hash[idx].list);
|
|
|
|
if (sel_netnode_hash[idx].size == SEL_NETNODE_HASH_BKT_LIMIT) {
|
|
|
|
struct sel_netnode *tail;
|
|
|
|
tail = list_entry(
|
2012-11-08 17:09:27 -07:00
|
|
|
rcu_dereference_protected(sel_netnode_hash[idx].list.prev,
|
|
|
|
lockdep_is_held(&sel_netnode_lock)),
|
2008-04-25 13:03:34 -06:00
|
|
|
struct sel_netnode, list);
|
|
|
|
list_del_rcu(&tail->list);
|
2011-03-17 22:05:22 -06:00
|
|
|
kfree_rcu(tail, rcu);
|
2008-04-25 13:03:34 -06:00
|
|
|
} else
|
|
|
|
sel_netnode_hash[idx].size++;
|
2008-01-29 06:38:13 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_sid_slow - Lookup the SID of a network address using the policy
|
|
|
|
* @addr: the IP address
|
|
|
|
* @family: the address family
|
|
|
|
* @sid: node SID
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This function determines the SID of a network address by quering the
|
|
|
|
* security policy. The result is added to the network address table to
|
|
|
|
* speedup future queries. Returns zero on success, negative values on
|
|
|
|
* failure.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static int sel_netnode_sid_slow(void *addr, u16 family, u32 *sid)
|
|
|
|
{
|
2008-04-25 13:03:34 -06:00
|
|
|
int ret = -ENOMEM;
|
2008-01-29 06:38:13 -07:00
|
|
|
struct sel_netnode *node;
|
|
|
|
struct sel_netnode *new = NULL;
|
|
|
|
|
|
|
|
spin_lock_bh(&sel_netnode_lock);
|
|
|
|
node = sel_netnode_find(addr, family);
|
|
|
|
if (node != NULL) {
|
|
|
|
*sid = node->nsec.sid;
|
2008-04-25 13:03:34 -06:00
|
|
|
spin_unlock_bh(&sel_netnode_lock);
|
|
|
|
return 0;
|
2008-01-29 06:38:13 -07:00
|
|
|
}
|
|
|
|
new = kzalloc(sizeof(*new), GFP_ATOMIC);
|
2008-04-25 13:03:34 -06:00
|
|
|
if (new == NULL)
|
2008-01-29 06:38:13 -07:00
|
|
|
goto out;
|
|
|
|
switch (family) {
|
|
|
|
case PF_INET:
|
2018-03-01 16:48:02 -07:00
|
|
|
ret = security_node_sid(&selinux_state, PF_INET,
|
2008-04-25 13:03:34 -06:00
|
|
|
addr, sizeof(struct in_addr), sid);
|
2008-01-29 06:38:13 -07:00
|
|
|
new->nsec.addr.ipv4 = *(__be32 *)addr;
|
|
|
|
break;
|
|
|
|
case PF_INET6:
|
2018-03-01 16:48:02 -07:00
|
|
|
ret = security_node_sid(&selinux_state, PF_INET6,
|
2008-04-25 13:03:34 -06:00
|
|
|
addr, sizeof(struct in6_addr), sid);
|
2011-11-20 20:39:03 -07:00
|
|
|
new->nsec.addr.ipv6 = *(struct in6_addr *)addr;
|
2008-01-29 06:38:13 -07:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
2013-07-23 15:38:38 -06:00
|
|
|
ret = -EINVAL;
|
2008-01-29 06:38:13 -07:00
|
|
|
}
|
|
|
|
if (ret != 0)
|
|
|
|
goto out;
|
2008-04-25 13:03:34 -06:00
|
|
|
|
2008-01-29 06:38:13 -07:00
|
|
|
new->nsec.family = family;
|
2008-04-25 13:03:34 -06:00
|
|
|
new->nsec.sid = *sid;
|
|
|
|
sel_netnode_insert(new);
|
2008-01-29 06:38:13 -07:00
|
|
|
|
|
|
|
out:
|
|
|
|
spin_unlock_bh(&sel_netnode_lock);
|
2008-01-29 06:51:16 -07:00
|
|
|
if (unlikely(ret)) {
|
2018-06-12 02:09:12 -06:00
|
|
|
pr_warn("SELinux: failure in %s(), unable to determine network node label\n",
|
|
|
|
__func__);
|
2008-01-29 06:38:13 -07:00
|
|
|
kfree(new);
|
2008-01-29 06:51:16 -07:00
|
|
|
}
|
2008-01-29 06:38:13 -07:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_sid - Lookup the SID of a network address
|
|
|
|
* @addr: the IP address
|
|
|
|
* @family: the address family
|
|
|
|
* @sid: node SID
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This function determines the SID of a network address using the fastest
|
|
|
|
* method possible. First the address table is queried, but if an entry
|
|
|
|
* can't be found then the policy is queried and the result is added to the
|
|
|
|
* table to speedup future queries. Returns zero on success, negative values
|
|
|
|
* on failure.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
int sel_netnode_sid(void *addr, u16 family, u32 *sid)
|
|
|
|
{
|
|
|
|
struct sel_netnode *node;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
node = sel_netnode_find(addr, family);
|
|
|
|
if (node != NULL) {
|
|
|
|
*sid = node->nsec.sid;
|
|
|
|
rcu_read_unlock();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return sel_netnode_sid_slow(addr, family, sid);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sel_netnode_flush - Flush the entire network address table
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Remove all entries from the network address table.
|
|
|
|
*
|
|
|
|
*/
|
2014-06-26 12:33:56 -06:00
|
|
|
void sel_netnode_flush(void)
|
2008-01-29 06:38:13 -07:00
|
|
|
{
|
2008-04-25 13:03:34 -06:00
|
|
|
unsigned int idx;
|
|
|
|
struct sel_netnode *node, *node_tmp;
|
2008-01-29 06:38:13 -07:00
|
|
|
|
|
|
|
spin_lock_bh(&sel_netnode_lock);
|
2008-04-25 13:03:34 -06:00
|
|
|
for (idx = 0; idx < SEL_NETNODE_HASH_SIZE; idx++) {
|
|
|
|
list_for_each_entry_safe(node, node_tmp,
|
|
|
|
&sel_netnode_hash[idx].list, list) {
|
|
|
|
list_del_rcu(&node->list);
|
2011-03-17 22:05:22 -06:00
|
|
|
kfree_rcu(node, rcu);
|
2008-04-25 13:03:34 -06:00
|
|
|
}
|
|
|
|
sel_netnode_hash[idx].size = 0;
|
|
|
|
}
|
2008-01-29 06:38:13 -07:00
|
|
|
spin_unlock_bh(&sel_netnode_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __init int sel_netnode_init(void)
|
|
|
|
{
|
|
|
|
int iter;
|
|
|
|
|
|
|
|
if (!selinux_enabled)
|
|
|
|
return 0;
|
|
|
|
|
2008-04-25 13:03:34 -06:00
|
|
|
for (iter = 0; iter < SEL_NETNODE_HASH_SIZE; iter++) {
|
|
|
|
INIT_LIST_HEAD(&sel_netnode_hash[iter].list);
|
|
|
|
sel_netnode_hash[iter].size = 0;
|
|
|
|
}
|
2008-01-29 06:38:13 -07:00
|
|
|
|
2014-08-07 18:55:30 -06:00
|
|
|
return 0;
|
2008-01-29 06:38:13 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
__initcall(sel_netnode_init);
|