2006-08-03 23:48:37 +00:00
|
|
|
/*
|
|
|
|
* NetLabel Domain Hash Table
|
|
|
|
*
|
|
|
|
* This file manages the domain hash table that NetLabel uses to determine
|
|
|
|
* which network labeling protocol to use for a given domain. The NetLabel
|
|
|
|
* system manages static and dynamic label mappings for network protocols such
|
|
|
|
* as CIPSO and RIPSO.
|
|
|
|
*
|
2011-08-01 11:10:33 +00:00
|
|
|
* Author: Paul Moore <paul@paul-moore.com>
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2008-10-10 14:16:32 +00:00
|
|
|
* (c) Copyright Hewlett-Packard Development Company, L.P., 2006, 2008
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
2008-05-12 19:21:05 +00:00
|
|
|
#include <linux/rculist.h>
|
2006-08-03 23:48:37 +00:00
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/string.h>
|
2006-09-28 21:51:47 +00:00
|
|
|
#include <linux/audit.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 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2006-08-03 23:48:37 +00:00
|
|
|
#include <net/netlabel.h>
|
|
|
|
#include <net/cipso_ipv4.h>
|
|
|
|
#include <asm/bug.h>
|
|
|
|
|
|
|
|
#include "netlabel_mgmt.h"
|
2008-10-10 14:16:32 +00:00
|
|
|
#include "netlabel_addrlist.h"
|
2006-08-03 23:48:37 +00:00
|
|
|
#include "netlabel_domainhash.h"
|
2006-09-28 21:51:47 +00:00
|
|
|
#include "netlabel_user.h"
|
2006-08-03 23:48:37 +00:00
|
|
|
|
|
|
|
struct netlbl_domhsh_tbl {
|
|
|
|
struct list_head *tbl;
|
|
|
|
u32 size;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Domain hash table */
|
2010-04-01 10:43:57 +00:00
|
|
|
/* updates should be so rare that having one spinlock for the entire hash table
|
|
|
|
* should be okay */
|
2006-08-08 04:50:48 +00:00
|
|
|
static DEFINE_SPINLOCK(netlbl_domhsh_lock);
|
2010-04-01 10:43:57 +00:00
|
|
|
#define netlbl_domhsh_rcu_deref(p) \
|
2011-07-08 12:39:41 +00:00
|
|
|
rcu_dereference_check(p, lockdep_is_held(&netlbl_domhsh_lock))
|
2006-08-03 23:48:37 +00:00
|
|
|
static struct netlbl_domhsh_tbl *netlbl_domhsh = NULL;
|
|
|
|
static struct netlbl_dom_map *netlbl_domhsh_def = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Domain Hash Table Helper Functions
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_free_entry - Frees a domain hash table entry
|
|
|
|
* @entry: the entry's RCU field
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This function is designed to be used as a callback to the call_rcu()
|
|
|
|
* function so that the memory allocated to a hash table entry can be released
|
|
|
|
* safely.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static void netlbl_domhsh_free_entry(struct rcu_head *entry)
|
|
|
|
{
|
|
|
|
struct netlbl_dom_map *ptr;
|
2008-10-10 14:16:32 +00:00
|
|
|
struct netlbl_af4list *iter4;
|
|
|
|
struct netlbl_af4list *tmp4;
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
struct netlbl_af6list *iter6;
|
|
|
|
struct netlbl_af6list *tmp6;
|
|
|
|
#endif /* IPv6 */
|
2006-08-03 23:48:37 +00:00
|
|
|
|
|
|
|
ptr = container_of(entry, struct netlbl_dom_map, rcu);
|
2008-10-10 14:16:32 +00:00
|
|
|
if (ptr->type == NETLBL_NLTYPE_ADDRSELECT) {
|
|
|
|
netlbl_af4list_foreach_safe(iter4, tmp4,
|
|
|
|
&ptr->type_def.addrsel->list4) {
|
|
|
|
netlbl_af4list_remove_entry(iter4);
|
|
|
|
kfree(netlbl_domhsh_addr4_entry(iter4));
|
|
|
|
}
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
netlbl_af6list_foreach_safe(iter6, tmp6,
|
|
|
|
&ptr->type_def.addrsel->list6) {
|
|
|
|
netlbl_af6list_remove_entry(iter6);
|
|
|
|
kfree(netlbl_domhsh_addr6_entry(iter6));
|
|
|
|
}
|
|
|
|
#endif /* IPv6 */
|
|
|
|
}
|
2006-08-03 23:48:37 +00:00
|
|
|
kfree(ptr->domain);
|
|
|
|
kfree(ptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_hash - Hashing function for the domain hash table
|
|
|
|
* @domain: the domain name to hash
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This is the hashing function for the domain hash table, it returns the
|
2011-03-31 01:57:33 +00:00
|
|
|
* correct bucket number for the domain. The caller is responsible for
|
2010-04-01 10:43:57 +00:00
|
|
|
* ensuring that the hash table is protected with either a RCU read lock or the
|
|
|
|
* hash table lock.
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
static u32 netlbl_domhsh_hash(const char *key)
|
|
|
|
{
|
|
|
|
u32 iter;
|
|
|
|
u32 val;
|
|
|
|
u32 len;
|
|
|
|
|
|
|
|
/* This is taken (with slight modification) from
|
|
|
|
* security/selinux/ss/symtab.c:symhash() */
|
|
|
|
|
|
|
|
for (iter = 0, val = 0, len = strlen(key); iter < len; iter++)
|
|
|
|
val = (val << 4 | (val >> (8 * sizeof(u32) - 4))) ^ key[iter];
|
2010-04-01 10:43:57 +00:00
|
|
|
return val & (netlbl_domhsh_rcu_deref(netlbl_domhsh)->size - 1);
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_search - Search for a domain entry
|
|
|
|
* @domain: the domain
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Searches the domain hash table and returns a pointer to the hash table
|
2011-03-31 01:57:33 +00:00
|
|
|
* entry if found, otherwise NULL is returned. The caller is responsible for
|
2010-04-01 10:43:57 +00:00
|
|
|
* ensuring that the hash table is protected with either a RCU read lock or the
|
|
|
|
* hash table lock.
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
*/
|
2008-01-29 13:37:54 +00:00
|
|
|
static struct netlbl_dom_map *netlbl_domhsh_search(const char *domain)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
|
|
|
u32 bkt;
|
2008-10-10 14:16:29 +00:00
|
|
|
struct list_head *bkt_list;
|
2006-08-03 23:48:37 +00:00
|
|
|
struct netlbl_dom_map *iter;
|
|
|
|
|
|
|
|
if (domain != NULL) {
|
|
|
|
bkt = netlbl_domhsh_hash(domain);
|
2010-04-01 10:43:57 +00:00
|
|
|
bkt_list = &netlbl_domhsh_rcu_deref(netlbl_domhsh)->tbl[bkt];
|
2008-10-10 14:16:29 +00:00
|
|
|
list_for_each_entry_rcu(iter, bkt_list, list)
|
2006-08-03 23:48:37 +00:00
|
|
|
if (iter->valid && strcmp(iter->domain, domain) == 0)
|
|
|
|
return iter;
|
|
|
|
}
|
|
|
|
|
2008-01-29 13:37:54 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_search_def - Search for a domain entry
|
|
|
|
* @domain: the domain
|
|
|
|
* @def: return default if no match is found
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Searches the domain hash table and returns a pointer to the hash table
|
|
|
|
* entry if an exact match is found, if an exact match is not present in the
|
|
|
|
* hash table then the default entry is returned if valid otherwise NULL is
|
2011-03-31 01:57:33 +00:00
|
|
|
* returned. The caller is responsible ensuring that the hash table is
|
2010-04-01 10:43:57 +00:00
|
|
|
* protected with either a RCU read lock or the hash table lock.
|
2008-01-29 13:37:54 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
static struct netlbl_dom_map *netlbl_domhsh_search_def(const char *domain)
|
|
|
|
{
|
|
|
|
struct netlbl_dom_map *entry;
|
|
|
|
|
|
|
|
entry = netlbl_domhsh_search(domain);
|
|
|
|
if (entry == NULL) {
|
2010-04-01 10:43:57 +00:00
|
|
|
entry = netlbl_domhsh_rcu_deref(netlbl_domhsh_def);
|
2008-02-13 06:15:14 +00:00
|
|
|
if (entry != NULL && !entry->valid)
|
|
|
|
entry = NULL;
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
|
|
|
|
2008-02-13 06:15:14 +00:00
|
|
|
return entry;
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
|
|
|
|
2008-10-10 14:16:32 +00:00
|
|
|
/**
|
|
|
|
* netlbl_domhsh_audit_add - Generate an audit entry for an add event
|
|
|
|
* @entry: the entry being added
|
|
|
|
* @addr4: the IPv4 address information
|
|
|
|
* @addr6: the IPv6 address information
|
|
|
|
* @result: the result code
|
|
|
|
* @audit_info: NetLabel audit information
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Generate an audit record for adding a new NetLabel/LSM mapping entry with
|
2011-03-31 01:57:33 +00:00
|
|
|
* the given information. Caller is responsible for holding the necessary
|
2008-10-10 14:16:32 +00:00
|
|
|
* locks.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static void netlbl_domhsh_audit_add(struct netlbl_dom_map *entry,
|
|
|
|
struct netlbl_af4list *addr4,
|
|
|
|
struct netlbl_af6list *addr6,
|
|
|
|
int result,
|
|
|
|
struct netlbl_audit *audit_info)
|
|
|
|
{
|
|
|
|
struct audit_buffer *audit_buf;
|
|
|
|
struct cipso_v4_doi *cipsov4 = NULL;
|
|
|
|
u32 type;
|
|
|
|
|
|
|
|
audit_buf = netlbl_audit_start_common(AUDIT_MAC_MAP_ADD, audit_info);
|
|
|
|
if (audit_buf != NULL) {
|
|
|
|
audit_log_format(audit_buf, " nlbl_domain=%s",
|
|
|
|
entry->domain ? entry->domain : "(default)");
|
|
|
|
if (addr4 != NULL) {
|
|
|
|
struct netlbl_domaddr4_map *map4;
|
|
|
|
map4 = netlbl_domhsh_addr4_entry(addr4);
|
|
|
|
type = map4->type;
|
|
|
|
cipsov4 = map4->type_def.cipsov4;
|
|
|
|
netlbl_af4list_audit_addr(audit_buf, 0, NULL,
|
|
|
|
addr4->addr, addr4->mask);
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
} else if (addr6 != NULL) {
|
|
|
|
struct netlbl_domaddr6_map *map6;
|
|
|
|
map6 = netlbl_domhsh_addr6_entry(addr6);
|
|
|
|
type = map6->type;
|
|
|
|
netlbl_af6list_audit_addr(audit_buf, 0, NULL,
|
|
|
|
&addr6->addr, &addr6->mask);
|
|
|
|
#endif /* IPv6 */
|
|
|
|
} else {
|
|
|
|
type = entry->type;
|
|
|
|
cipsov4 = entry->type_def.cipsov4;
|
|
|
|
}
|
|
|
|
switch (type) {
|
|
|
|
case NETLBL_NLTYPE_UNLABELED:
|
|
|
|
audit_log_format(audit_buf, " nlbl_protocol=unlbl");
|
|
|
|
break;
|
|
|
|
case NETLBL_NLTYPE_CIPSOV4:
|
|
|
|
BUG_ON(cipsov4 == NULL);
|
|
|
|
audit_log_format(audit_buf,
|
|
|
|
" nlbl_protocol=cipsov4 cipso_doi=%u",
|
|
|
|
cipsov4->doi);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
audit_log_format(audit_buf, " res=%u", result == 0 ? 1 : 0);
|
|
|
|
audit_log_end(audit_buf);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-08-03 23:48:37 +00:00
|
|
|
/*
|
|
|
|
* Domain Hash Table Functions
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_init - Init for the domain hash
|
|
|
|
* @size: the number of bits to use for the hash buckets
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Initializes the domain hash table, should be called only by
|
|
|
|
* netlbl_user_init() during initialization. Returns zero on success, non-zero
|
|
|
|
* values on error.
|
|
|
|
*
|
|
|
|
*/
|
2008-02-18 06:33:57 +00:00
|
|
|
int __init netlbl_domhsh_init(u32 size)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
|
|
|
u32 iter;
|
|
|
|
struct netlbl_domhsh_tbl *hsh_tbl;
|
|
|
|
|
|
|
|
if (size == 0)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
hsh_tbl = kmalloc(sizeof(*hsh_tbl), GFP_KERNEL);
|
|
|
|
if (hsh_tbl == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
hsh_tbl->size = 1 << size;
|
|
|
|
hsh_tbl->tbl = kcalloc(hsh_tbl->size,
|
|
|
|
sizeof(struct list_head),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (hsh_tbl->tbl == NULL) {
|
|
|
|
kfree(hsh_tbl);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
for (iter = 0; iter < hsh_tbl->size; iter++)
|
|
|
|
INIT_LIST_HEAD(&hsh_tbl->tbl[iter]);
|
|
|
|
|
|
|
|
spin_lock(&netlbl_domhsh_lock);
|
2012-01-12 04:41:32 +00:00
|
|
|
rcu_assign_pointer(netlbl_domhsh, hsh_tbl);
|
2006-08-03 23:48:37 +00:00
|
|
|
spin_unlock(&netlbl_domhsh_lock);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_add - Adds a entry to the domain hash table
|
|
|
|
* @entry: the entry to add
|
2006-09-30 00:05:05 +00:00
|
|
|
* @audit_info: NetLabel audit information
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Adds a new entry to the domain hash table and handles any updates to the
|
|
|
|
* lower level protocol handler (i.e. CIPSO). Returns zero on success,
|
|
|
|
* negative on failure.
|
|
|
|
*
|
|
|
|
*/
|
2006-09-30 00:05:05 +00:00
|
|
|
int netlbl_domhsh_add(struct netlbl_dom_map *entry,
|
|
|
|
struct netlbl_audit *audit_info)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
2008-10-10 14:16:32 +00:00
|
|
|
int ret_val = 0;
|
|
|
|
struct netlbl_dom_map *entry_old;
|
|
|
|
struct netlbl_af4list *iter4;
|
|
|
|
struct netlbl_af4list *tmp4;
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
struct netlbl_af6list *iter6;
|
|
|
|
struct netlbl_af6list *tmp6;
|
|
|
|
#endif /* IPv6 */
|
2006-08-03 23:48:37 +00:00
|
|
|
|
2010-04-01 10:43:57 +00:00
|
|
|
/* XXX - we can remove this RCU read lock as the spinlock protects the
|
|
|
|
* entire function, but before we do we need to fixup the
|
|
|
|
* netlbl_af[4,6]list RCU functions to do "the right thing" with
|
|
|
|
* respect to rcu_dereference() when only a spinlock is held. */
|
2006-08-03 23:48:37 +00:00
|
|
|
rcu_read_lock();
|
2008-01-29 13:37:57 +00:00
|
|
|
spin_lock(&netlbl_domhsh_lock);
|
2008-10-10 14:16:32 +00:00
|
|
|
if (entry->domain != NULL)
|
|
|
|
entry_old = netlbl_domhsh_search(entry->domain);
|
|
|
|
else
|
|
|
|
entry_old = netlbl_domhsh_search_def(entry->domain);
|
|
|
|
if (entry_old == NULL) {
|
|
|
|
entry->valid = 1;
|
|
|
|
|
|
|
|
if (entry->domain != NULL) {
|
|
|
|
u32 bkt = netlbl_domhsh_hash(entry->domain);
|
2006-08-03 23:48:37 +00:00
|
|
|
list_add_tail_rcu(&entry->list,
|
2007-08-08 00:53:10 +00:00
|
|
|
&rcu_dereference(netlbl_domhsh)->tbl[bkt]);
|
2008-10-10 14:16:32 +00:00
|
|
|
} else {
|
|
|
|
INIT_LIST_HEAD(&entry->list);
|
2012-01-12 04:41:32 +00:00
|
|
|
rcu_assign_pointer(netlbl_domhsh_def, entry);
|
2006-11-17 22:38:55 +00:00
|
|
|
}
|
2006-08-03 23:48:37 +00:00
|
|
|
|
2008-10-10 14:16:32 +00:00
|
|
|
if (entry->type == NETLBL_NLTYPE_ADDRSELECT) {
|
|
|
|
netlbl_af4list_foreach_rcu(iter4,
|
|
|
|
&entry->type_def.addrsel->list4)
|
|
|
|
netlbl_domhsh_audit_add(entry, iter4, NULL,
|
|
|
|
ret_val, audit_info);
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
netlbl_af6list_foreach_rcu(iter6,
|
|
|
|
&entry->type_def.addrsel->list6)
|
|
|
|
netlbl_domhsh_audit_add(entry, NULL, iter6,
|
|
|
|
ret_val, audit_info);
|
|
|
|
#endif /* IPv6 */
|
|
|
|
} else
|
|
|
|
netlbl_domhsh_audit_add(entry, NULL, NULL,
|
|
|
|
ret_val, audit_info);
|
|
|
|
} else if (entry_old->type == NETLBL_NLTYPE_ADDRSELECT &&
|
|
|
|
entry->type == NETLBL_NLTYPE_ADDRSELECT) {
|
|
|
|
struct list_head *old_list4;
|
|
|
|
struct list_head *old_list6;
|
|
|
|
|
|
|
|
old_list4 = &entry_old->type_def.addrsel->list4;
|
|
|
|
old_list6 = &entry_old->type_def.addrsel->list6;
|
|
|
|
|
|
|
|
/* we only allow the addition of address selectors if all of
|
|
|
|
* the selectors do not exist in the existing domain map */
|
|
|
|
netlbl_af4list_foreach_rcu(iter4,
|
|
|
|
&entry->type_def.addrsel->list4)
|
|
|
|
if (netlbl_af4list_search_exact(iter4->addr,
|
|
|
|
iter4->mask,
|
|
|
|
old_list4)) {
|
|
|
|
ret_val = -EEXIST;
|
|
|
|
goto add_return;
|
|
|
|
}
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
netlbl_af6list_foreach_rcu(iter6,
|
|
|
|
&entry->type_def.addrsel->list6)
|
|
|
|
if (netlbl_af6list_search_exact(&iter6->addr,
|
|
|
|
&iter6->mask,
|
|
|
|
old_list6)) {
|
|
|
|
ret_val = -EEXIST;
|
|
|
|
goto add_return;
|
|
|
|
}
|
|
|
|
#endif /* IPv6 */
|
|
|
|
|
|
|
|
netlbl_af4list_foreach_safe(iter4, tmp4,
|
|
|
|
&entry->type_def.addrsel->list4) {
|
|
|
|
netlbl_af4list_remove_entry(iter4);
|
|
|
|
iter4->valid = 1;
|
|
|
|
ret_val = netlbl_af4list_add(iter4, old_list4);
|
|
|
|
netlbl_domhsh_audit_add(entry_old, iter4, NULL,
|
|
|
|
ret_val, audit_info);
|
|
|
|
if (ret_val != 0)
|
|
|
|
goto add_return;
|
|
|
|
}
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
netlbl_af6list_foreach_safe(iter6, tmp6,
|
|
|
|
&entry->type_def.addrsel->list6) {
|
|
|
|
netlbl_af6list_remove_entry(iter6);
|
|
|
|
iter6->valid = 1;
|
|
|
|
ret_val = netlbl_af6list_add(iter6, old_list6);
|
|
|
|
netlbl_domhsh_audit_add(entry_old, NULL, iter6,
|
|
|
|
ret_val, audit_info);
|
|
|
|
if (ret_val != 0)
|
|
|
|
goto add_return;
|
|
|
|
}
|
|
|
|
#endif /* IPv6 */
|
|
|
|
} else
|
|
|
|
ret_val = -EINVAL;
|
|
|
|
|
|
|
|
add_return:
|
|
|
|
spin_unlock(&netlbl_domhsh_lock);
|
|
|
|
rcu_read_unlock();
|
2006-08-03 23:48:37 +00:00
|
|
|
return ret_val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_add_default - Adds the default entry to the domain hash table
|
|
|
|
* @entry: the entry to add
|
2006-09-30 00:05:05 +00:00
|
|
|
* @audit_info: NetLabel audit information
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Adds a new default entry to the domain hash table and handles any updates
|
|
|
|
* to the lower level protocol handler (i.e. CIPSO). Returns zero on success,
|
|
|
|
* negative on failure.
|
|
|
|
*
|
|
|
|
*/
|
2006-09-30 00:05:05 +00:00
|
|
|
int netlbl_domhsh_add_default(struct netlbl_dom_map *entry,
|
|
|
|
struct netlbl_audit *audit_info)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
2006-09-30 00:05:05 +00:00
|
|
|
return netlbl_domhsh_add(entry, audit_info);
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2008-10-10 14:16:31 +00:00
|
|
|
* netlbl_domhsh_remove_entry - Removes a given entry from the domain table
|
|
|
|
* @entry: the entry to remove
|
2006-09-30 00:05:05 +00:00
|
|
|
* @audit_info: NetLabel audit information
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Removes an entry from the domain hash table and handles any updates to the
|
2008-10-10 14:16:31 +00:00
|
|
|
* lower level protocol handler (i.e. CIPSO). Caller is responsible for
|
|
|
|
* ensuring that the RCU read lock is held. Returns zero on success, negative
|
|
|
|
* on failure.
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
*/
|
2008-10-10 14:16:31 +00:00
|
|
|
int netlbl_domhsh_remove_entry(struct netlbl_dom_map *entry,
|
|
|
|
struct netlbl_audit *audit_info)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
2008-10-10 14:16:31 +00:00
|
|
|
int ret_val = 0;
|
2006-09-28 21:51:47 +00:00
|
|
|
struct audit_buffer *audit_buf;
|
2006-08-03 23:48:37 +00:00
|
|
|
|
|
|
|
if (entry == NULL)
|
2008-10-10 14:16:31 +00:00
|
|
|
return -ENOENT;
|
|
|
|
|
2008-01-29 13:37:57 +00:00
|
|
|
spin_lock(&netlbl_domhsh_lock);
|
|
|
|
if (entry->valid) {
|
|
|
|
entry->valid = 0;
|
|
|
|
if (entry != rcu_dereference(netlbl_domhsh_def))
|
2006-08-03 23:48:37 +00:00
|
|
|
list_del_rcu(&entry->list);
|
2008-01-29 13:37:57 +00:00
|
|
|
else
|
2011-08-01 16:19:00 +00:00
|
|
|
RCU_INIT_POINTER(netlbl_domhsh_def, NULL);
|
2008-10-10 14:16:31 +00:00
|
|
|
} else
|
|
|
|
ret_val = -ENOENT;
|
2008-01-29 13:37:57 +00:00
|
|
|
spin_unlock(&netlbl_domhsh_lock);
|
2006-09-28 21:51:47 +00:00
|
|
|
|
2006-09-30 00:05:05 +00:00
|
|
|
audit_buf = netlbl_audit_start_common(AUDIT_MAC_MAP_DEL, audit_info);
|
2006-11-17 22:38:55 +00:00
|
|
|
if (audit_buf != NULL) {
|
|
|
|
audit_log_format(audit_buf,
|
|
|
|
" nlbl_domain=%s res=%u",
|
|
|
|
entry->domain ? entry->domain : "(default)",
|
|
|
|
ret_val == 0 ? 1 : 0);
|
|
|
|
audit_log_end(audit_buf);
|
|
|
|
}
|
2006-09-30 00:05:05 +00:00
|
|
|
|
2008-10-10 14:16:31 +00:00
|
|
|
if (ret_val == 0) {
|
2008-10-10 14:16:32 +00:00
|
|
|
struct netlbl_af4list *iter4;
|
|
|
|
struct netlbl_domaddr4_map *map4;
|
|
|
|
|
2008-10-10 14:16:31 +00:00
|
|
|
switch (entry->type) {
|
2008-10-10 14:16:32 +00:00
|
|
|
case NETLBL_NLTYPE_ADDRSELECT:
|
|
|
|
netlbl_af4list_foreach_rcu(iter4,
|
|
|
|
&entry->type_def.addrsel->list4) {
|
|
|
|
map4 = netlbl_domhsh_addr4_entry(iter4);
|
|
|
|
cipso_v4_doi_putdef(map4->type_def.cipsov4);
|
|
|
|
}
|
|
|
|
/* no need to check the IPv6 list since we currently
|
|
|
|
* support only unlabeled protocols for IPv6 */
|
|
|
|
break;
|
2008-10-10 14:16:31 +00:00
|
|
|
case NETLBL_NLTYPE_CIPSOV4:
|
|
|
|
cipso_v4_doi_putdef(entry->type_def.cipsov4);
|
|
|
|
break;
|
|
|
|
}
|
2007-10-26 11:29:08 +00:00
|
|
|
call_rcu(&entry->rcu, netlbl_domhsh_free_entry);
|
2008-10-10 14:16:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return ret_val;
|
|
|
|
}
|
|
|
|
|
2008-12-31 17:54:11 +00:00
|
|
|
/**
|
|
|
|
* netlbl_domhsh_remove_af4 - Removes an address selector entry
|
|
|
|
* @domain: the domain
|
|
|
|
* @addr: IPv4 address
|
|
|
|
* @mask: IPv4 address mask
|
|
|
|
* @audit_info: NetLabel audit information
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Removes an individual address selector from a domain mapping and potentially
|
|
|
|
* the entire mapping if it is empty. Returns zero on success, negative values
|
|
|
|
* on failure.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
int netlbl_domhsh_remove_af4(const char *domain,
|
|
|
|
const struct in_addr *addr,
|
|
|
|
const struct in_addr *mask,
|
|
|
|
struct netlbl_audit *audit_info)
|
|
|
|
{
|
|
|
|
struct netlbl_dom_map *entry_map;
|
|
|
|
struct netlbl_af4list *entry_addr;
|
|
|
|
struct netlbl_af4list *iter4;
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-12-31 17:54:11 +00:00
|
|
|
struct netlbl_af6list *iter6;
|
|
|
|
#endif /* IPv6 */
|
|
|
|
struct netlbl_domaddr4_map *entry;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
|
|
|
|
if (domain)
|
|
|
|
entry_map = netlbl_domhsh_search(domain);
|
|
|
|
else
|
|
|
|
entry_map = netlbl_domhsh_search_def(domain);
|
|
|
|
if (entry_map == NULL || entry_map->type != NETLBL_NLTYPE_ADDRSELECT)
|
|
|
|
goto remove_af4_failure;
|
|
|
|
|
|
|
|
spin_lock(&netlbl_domhsh_lock);
|
|
|
|
entry_addr = netlbl_af4list_remove(addr->s_addr, mask->s_addr,
|
|
|
|
&entry_map->type_def.addrsel->list4);
|
|
|
|
spin_unlock(&netlbl_domhsh_lock);
|
|
|
|
|
|
|
|
if (entry_addr == NULL)
|
|
|
|
goto remove_af4_failure;
|
|
|
|
netlbl_af4list_foreach_rcu(iter4, &entry_map->type_def.addrsel->list4)
|
|
|
|
goto remove_af4_single_addr;
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-12-31 17:54:11 +00:00
|
|
|
netlbl_af6list_foreach_rcu(iter6, &entry_map->type_def.addrsel->list6)
|
|
|
|
goto remove_af4_single_addr;
|
|
|
|
#endif /* IPv6 */
|
|
|
|
/* the domain mapping is empty so remove it from the mapping table */
|
|
|
|
netlbl_domhsh_remove_entry(entry_map, audit_info);
|
|
|
|
|
|
|
|
remove_af4_single_addr:
|
|
|
|
rcu_read_unlock();
|
|
|
|
/* yick, we can't use call_rcu here because we don't have a rcu head
|
|
|
|
* pointer but hopefully this should be a rare case so the pause
|
|
|
|
* shouldn't be a problem */
|
|
|
|
synchronize_rcu();
|
|
|
|
entry = netlbl_domhsh_addr4_entry(entry_addr);
|
|
|
|
cipso_v4_doi_putdef(entry->type_def.cipsov4);
|
|
|
|
kfree(entry);
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
remove_af4_failure:
|
|
|
|
rcu_read_unlock();
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2008-10-10 14:16:31 +00:00
|
|
|
/**
|
|
|
|
* netlbl_domhsh_remove - Removes an entry from the domain hash table
|
|
|
|
* @domain: the domain to remove
|
|
|
|
* @audit_info: NetLabel audit information
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Removes an entry from the domain hash table and handles any updates to the
|
|
|
|
* lower level protocol handler (i.e. CIPSO). Returns zero on success,
|
|
|
|
* negative on failure.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
int netlbl_domhsh_remove(const char *domain, struct netlbl_audit *audit_info)
|
|
|
|
{
|
|
|
|
int ret_val;
|
|
|
|
struct netlbl_dom_map *entry;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
if (domain)
|
|
|
|
entry = netlbl_domhsh_search(domain);
|
|
|
|
else
|
|
|
|
entry = netlbl_domhsh_search_def(domain);
|
|
|
|
ret_val = netlbl_domhsh_remove_entry(entry, audit_info);
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
2006-08-03 23:48:37 +00:00
|
|
|
return ret_val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_remove_default - Removes the default entry from the table
|
2006-09-30 00:05:05 +00:00
|
|
|
* @audit_info: NetLabel audit information
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Removes/resets the default entry for the domain hash table and handles any
|
|
|
|
* updates to the lower level protocol handler (i.e. CIPSO). Returns zero on
|
|
|
|
* success, non-zero on failure.
|
|
|
|
*
|
|
|
|
*/
|
2006-09-30 00:05:05 +00:00
|
|
|
int netlbl_domhsh_remove_default(struct netlbl_audit *audit_info)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
2006-09-30 00:05:05 +00:00
|
|
|
return netlbl_domhsh_remove(NULL, audit_info);
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* netlbl_domhsh_getentry - Get an entry from the domain hash table
|
|
|
|
* @domain: the domain name to search for
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Look through the domain hash table searching for an entry to match @domain,
|
2011-03-31 01:57:33 +00:00
|
|
|
* return a pointer to a copy of the entry or NULL. The caller is responsible
|
2006-08-03 23:48:37 +00:00
|
|
|
* for ensuring that rcu_read_[un]lock() is called.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
struct netlbl_dom_map *netlbl_domhsh_getentry(const char *domain)
|
|
|
|
{
|
2008-01-29 13:37:54 +00:00
|
|
|
return netlbl_domhsh_search_def(domain);
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
|
|
|
|
2008-10-10 14:16:32 +00:00
|
|
|
/**
|
|
|
|
* netlbl_domhsh_getentry_af4 - Get an entry from the domain hash table
|
|
|
|
* @domain: the domain name to search for
|
|
|
|
* @addr: the IP address to search for
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Look through the domain hash table searching for an entry to match @domain
|
|
|
|
* and @addr, return a pointer to a copy of the entry or NULL. The caller is
|
|
|
|
* responsible for ensuring that rcu_read_[un]lock() is called.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
struct netlbl_domaddr4_map *netlbl_domhsh_getentry_af4(const char *domain,
|
|
|
|
__be32 addr)
|
|
|
|
{
|
|
|
|
struct netlbl_dom_map *dom_iter;
|
|
|
|
struct netlbl_af4list *addr_iter;
|
|
|
|
|
|
|
|
dom_iter = netlbl_domhsh_search_def(domain);
|
|
|
|
if (dom_iter == NULL)
|
|
|
|
return NULL;
|
|
|
|
if (dom_iter->type != NETLBL_NLTYPE_ADDRSELECT)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
addr_iter = netlbl_af4list_search(addr,
|
|
|
|
&dom_iter->type_def.addrsel->list4);
|
|
|
|
if (addr_iter == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return netlbl_domhsh_addr4_entry(addr_iter);
|
|
|
|
}
|
|
|
|
|
2011-12-10 09:48:31 +00:00
|
|
|
#if IS_ENABLED(CONFIG_IPV6)
|
2008-10-10 14:16:32 +00:00
|
|
|
/**
|
|
|
|
* netlbl_domhsh_getentry_af6 - Get an entry from the domain hash table
|
|
|
|
* @domain: the domain name to search for
|
|
|
|
* @addr: the IP address to search for
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Look through the domain hash table searching for an entry to match @domain
|
|
|
|
* and @addr, return a pointer to a copy of the entry or NULL. The caller is
|
|
|
|
* responsible for ensuring that rcu_read_[un]lock() is called.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
struct netlbl_domaddr6_map *netlbl_domhsh_getentry_af6(const char *domain,
|
|
|
|
const struct in6_addr *addr)
|
|
|
|
{
|
|
|
|
struct netlbl_dom_map *dom_iter;
|
|
|
|
struct netlbl_af6list *addr_iter;
|
|
|
|
|
|
|
|
dom_iter = netlbl_domhsh_search_def(domain);
|
|
|
|
if (dom_iter == NULL)
|
|
|
|
return NULL;
|
|
|
|
if (dom_iter->type != NETLBL_NLTYPE_ADDRSELECT)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
addr_iter = netlbl_af6list_search(addr,
|
|
|
|
&dom_iter->type_def.addrsel->list6);
|
|
|
|
if (addr_iter == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return netlbl_domhsh_addr6_entry(addr_iter);
|
|
|
|
}
|
|
|
|
#endif /* IPv6 */
|
|
|
|
|
2006-08-03 23:48:37 +00:00
|
|
|
/**
|
2006-09-25 22:56:09 +00:00
|
|
|
* netlbl_domhsh_walk - Iterate through the domain mapping hash table
|
|
|
|
* @skip_bkt: the number of buckets to skip at the start
|
|
|
|
* @skip_chain: the number of entries to skip in the first iterated bucket
|
|
|
|
* @callback: callback for each entry
|
|
|
|
* @cb_arg: argument for the callback function
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
* Description:
|
2006-09-25 22:56:09 +00:00
|
|
|
* Interate over the domain mapping hash table, skipping the first @skip_bkt
|
|
|
|
* buckets and @skip_chain entries. For each entry in the table call
|
|
|
|
* @callback, if @callback returns a negative value stop 'walking' through the
|
|
|
|
* table and return. Updates the values in @skip_bkt and @skip_chain on
|
tree-wide: fix assorted typos all over the place
That is "success", "unknown", "through", "performance", "[re|un]mapping"
, "access", "default", "reasonable", "[con]currently", "temperature"
, "channel", "[un]used", "application", "example","hierarchy", "therefore"
, "[over|under]flow", "contiguous", "threshold", "enough" and others.
Signed-off-by: André Goddard Rosa <andre.goddard@gmail.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
2009-11-14 15:09:05 +00:00
|
|
|
* return. Returns zero on success, negative values on failure.
|
2006-08-03 23:48:37 +00:00
|
|
|
*
|
|
|
|
*/
|
2006-09-25 22:56:09 +00:00
|
|
|
int netlbl_domhsh_walk(u32 *skip_bkt,
|
|
|
|
u32 *skip_chain,
|
|
|
|
int (*callback) (struct netlbl_dom_map *entry, void *arg),
|
|
|
|
void *cb_arg)
|
2006-08-03 23:48:37 +00:00
|
|
|
{
|
2006-09-25 22:56:09 +00:00
|
|
|
int ret_val = -ENOENT;
|
|
|
|
u32 iter_bkt;
|
2008-10-10 14:16:29 +00:00
|
|
|
struct list_head *iter_list;
|
2006-09-25 22:56:09 +00:00
|
|
|
struct netlbl_dom_map *iter_entry;
|
|
|
|
u32 chain_cnt = 0;
|
2006-08-03 23:48:37 +00:00
|
|
|
|
|
|
|
rcu_read_lock();
|
2006-09-25 22:56:09 +00:00
|
|
|
for (iter_bkt = *skip_bkt;
|
|
|
|
iter_bkt < rcu_dereference(netlbl_domhsh)->size;
|
|
|
|
iter_bkt++, chain_cnt = 0) {
|
2008-10-10 14:16:29 +00:00
|
|
|
iter_list = &rcu_dereference(netlbl_domhsh)->tbl[iter_bkt];
|
|
|
|
list_for_each_entry_rcu(iter_entry, iter_list, list)
|
2006-09-25 22:56:09 +00:00
|
|
|
if (iter_entry->valid) {
|
|
|
|
if (chain_cnt++ < *skip_chain)
|
|
|
|
continue;
|
|
|
|
ret_val = callback(iter_entry, cb_arg);
|
|
|
|
if (ret_val < 0) {
|
|
|
|
chain_cnt--;
|
|
|
|
goto walk_return;
|
|
|
|
}
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|
2006-09-25 22:56:09 +00:00
|
|
|
}
|
2006-08-03 23:48:37 +00:00
|
|
|
|
2006-09-25 22:56:09 +00:00
|
|
|
walk_return:
|
2006-08-03 23:48:37 +00:00
|
|
|
rcu_read_unlock();
|
2006-09-25 22:56:09 +00:00
|
|
|
*skip_bkt = iter_bkt;
|
|
|
|
*skip_chain = chain_cnt;
|
|
|
|
return ret_val;
|
2006-08-03 23:48:37 +00:00
|
|
|
}
|