netlabel_domainhash.c 11.7 KB
Newer Older
P
Paul Moore 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
/*
 * 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.
 *
 * Author: Paul Moore <paul.moore@hp.com>
 *
 */

/*
 * (c) Copyright Hewlett-Packard Development Company, L.P., 2006
 *
 * 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>
#include <linux/rcupdate.h>
#include <linux/list.h>
#include <linux/skbuff.h>
#include <linux/spinlock.h>
#include <linux/string.h>
38
#include <linux/audit.h>
P
Paul Moore 已提交
39 40 41 42 43 44
#include <net/netlabel.h>
#include <net/cipso_ipv4.h>
#include <asm/bug.h>

#include "netlabel_mgmt.h"
#include "netlabel_domainhash.h"
45
#include "netlabel_user.h"
P
Paul Moore 已提交
46 47 48 49 50 51 52 53 54

struct netlbl_domhsh_tbl {
	struct list_head *tbl;
	u32 size;
};

/* Domain hash table */
/* XXX - updates should be so rare that having one spinlock for the entire
 * hash table should be okay */
A
Adrian Bunk 已提交
55
static DEFINE_SPINLOCK(netlbl_domhsh_lock);
P
Paul Moore 已提交
56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111
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;

	ptr = container_of(entry, struct netlbl_dom_map, rcu);
	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
 * correct bucket number for the domain.  The caller is responsibile for
 * calling the rcu_read_[un]lock() functions.
 *
 */
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];
	return val & (rcu_dereference(netlbl_domhsh)->size - 1);
}

/**
 * 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
112 113
 * entry if found, otherwise NULL is returned.  The caller is responsibile for
 * the rcu hash table locks (i.e. the caller much call rcu_read_[un]lock()).
P
Paul Moore 已提交
114 115
 *
 */
116
static struct netlbl_dom_map *netlbl_domhsh_search(const char *domain)
P
Paul Moore 已提交
117 118 119 120 121 122
{
	u32 bkt;
	struct netlbl_dom_map *iter;

	if (domain != NULL) {
		bkt = netlbl_domhsh_hash(domain);
123 124 125
		list_for_each_entry_rcu(iter,
				     &rcu_dereference(netlbl_domhsh)->tbl[bkt],
				     list)
P
Paul Moore 已提交
126 127 128 129
			if (iter->valid && strcmp(iter->domain, domain) == 0)
				return iter;
	}

130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152
	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
 * returned.  The caller is responsibile for the rcu hash table locks
 * (i.e. the caller much call rcu_read_[un]lock()).
 *
 */
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) {
		entry = rcu_dereference(netlbl_domhsh_def);
153 154
		if (entry != NULL && !entry->valid)
			entry = NULL;
P
Paul Moore 已提交
155 156
	}

157
	return entry;
P
Paul Moore 已提交
158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205
}

/*
 * 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.
 *
 */
int netlbl_domhsh_init(u32 size)
{
	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);
	rcu_assign_pointer(netlbl_domhsh, hsh_tbl);
	spin_unlock(&netlbl_domhsh_lock);

	return 0;
}

/**
 * netlbl_domhsh_add - Adds a entry to the domain hash table
 * @entry: the entry to add
206
 * @audit_info: NetLabel audit information
P
Paul Moore 已提交
207 208 209 210 211 212 213
 *
 * 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.
 *
 */
214 215
int netlbl_domhsh_add(struct netlbl_dom_map *entry,
		      struct netlbl_audit *audit_info)
P
Paul Moore 已提交
216 217 218
{
	int ret_val;
	u32 bkt;
219
	struct audit_buffer *audit_buf;
P
Paul Moore 已提交
220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238

	switch (entry->type) {
	case NETLBL_NLTYPE_UNLABELED:
		ret_val = 0;
		break;
	case NETLBL_NLTYPE_CIPSOV4:
		ret_val = cipso_v4_doi_domhsh_add(entry->type_def.cipsov4,
						  entry->domain);
		break;
	default:
		return -EINVAL;
	}
	if (ret_val != 0)
		return ret_val;

	entry->valid = 1;
	INIT_RCU_HEAD(&entry->rcu);

	rcu_read_lock();
239
	spin_lock(&netlbl_domhsh_lock);
P
Paul Moore 已提交
240 241
	if (entry->domain != NULL) {
		bkt = netlbl_domhsh_hash(entry->domain);
242
		if (netlbl_domhsh_search(entry->domain) == NULL)
P
Paul Moore 已提交
243
			list_add_tail_rcu(&entry->list,
244
				    &rcu_dereference(netlbl_domhsh)->tbl[bkt]);
P
Paul Moore 已提交
245 246
		else
			ret_val = -EEXIST;
247
	} else {
P
Paul Moore 已提交
248 249 250 251 252
		INIT_LIST_HEAD(&entry->list);
		if (rcu_dereference(netlbl_domhsh_def) == NULL)
			rcu_assign_pointer(netlbl_domhsh_def, entry);
		else
			ret_val = -EEXIST;
253
	}
254
	spin_unlock(&netlbl_domhsh_lock);
255
	audit_buf = netlbl_audit_start_common(AUDIT_MAC_MAP_ADD, audit_info);
256
	if (audit_buf != NULL) {
257
		audit_log_format(audit_buf,
258 259 260 261 262 263 264 265 266 267 268 269 270 271
				 " nlbl_domain=%s",
				 entry->domain ? entry->domain : "(default)");
		switch (entry->type) {
		case NETLBL_NLTYPE_UNLABELED:
			audit_log_format(audit_buf, " nlbl_protocol=unlbl");
			break;
		case NETLBL_NLTYPE_CIPSOV4:
			audit_log_format(audit_buf,
					 " nlbl_protocol=cipsov4 cipso_doi=%u",
					 entry->type_def.cipsov4->doi);
			break;
		}
		audit_log_format(audit_buf, " res=%u", ret_val == 0 ? 1 : 0);
		audit_log_end(audit_buf);
272
	}
P
Paul Moore 已提交
273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
	rcu_read_unlock();

	if (ret_val != 0) {
		switch (entry->type) {
		case NETLBL_NLTYPE_CIPSOV4:
			if (cipso_v4_doi_domhsh_remove(entry->type_def.cipsov4,
						       entry->domain) != 0)
				BUG();
			break;
		}
	}

	return ret_val;
}

/**
 * netlbl_domhsh_add_default - Adds the default entry to the domain hash table
 * @entry: the entry to add
291
 * @audit_info: NetLabel audit information
P
Paul Moore 已提交
292 293 294 295 296 297 298
 *
 * 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.
 *
 */
299 300
int netlbl_domhsh_add_default(struct netlbl_dom_map *entry,
			      struct netlbl_audit *audit_info)
P
Paul Moore 已提交
301
{
302
	return netlbl_domhsh_add(entry, audit_info);
P
Paul Moore 已提交
303 304 305 306 307
}

/**
 * netlbl_domhsh_remove - Removes an entry from the domain hash table
 * @domain: the domain to remove
308
 * @audit_info: NetLabel audit information
P
Paul Moore 已提交
309 310 311 312 313 314 315
 *
 * 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.
 *
 */
316
int netlbl_domhsh_remove(const char *domain, struct netlbl_audit *audit_info)
P
Paul Moore 已提交
317 318 319
{
	int ret_val = -ENOENT;
	struct netlbl_dom_map *entry;
320
	struct audit_buffer *audit_buf;
P
Paul Moore 已提交
321 322

	rcu_read_lock();
323 324 325 326
	if (domain)
		entry = netlbl_domhsh_search(domain);
	else
		entry = netlbl_domhsh_search_def(domain);
P
Paul Moore 已提交
327 328 329 330
	if (entry == NULL)
		goto remove_return;
	switch (entry->type) {
	case NETLBL_NLTYPE_CIPSOV4:
331 332
		cipso_v4_doi_domhsh_remove(entry->type_def.cipsov4,
					   entry->domain);
P
Paul Moore 已提交
333 334
		break;
	}
335 336 337 338
	spin_lock(&netlbl_domhsh_lock);
	if (entry->valid) {
		entry->valid = 0;
		if (entry != rcu_dereference(netlbl_domhsh_def))
P
Paul Moore 已提交
339
			list_del_rcu(&entry->list);
340
		else
P
Paul Moore 已提交
341
			rcu_assign_pointer(netlbl_domhsh_def, NULL);
342
		ret_val = 0;
P
Paul Moore 已提交
343
	}
344
	spin_unlock(&netlbl_domhsh_lock);
345

346
	audit_buf = netlbl_audit_start_common(AUDIT_MAC_MAP_DEL, audit_info);
347 348 349 350 351 352 353
	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);
	}
354

P
Paul Moore 已提交
355 356
remove_return:
	rcu_read_unlock();
357 358
	if (ret_val == 0)
		call_rcu(&entry->rcu, netlbl_domhsh_free_entry);
P
Paul Moore 已提交
359 360 361 362 363
	return ret_val;
}

/**
 * netlbl_domhsh_remove_default - Removes the default entry from the table
364
 * @audit_info: NetLabel audit information
P
Paul Moore 已提交
365 366 367 368 369 370 371
 *
 * 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.
 *
 */
372
int netlbl_domhsh_remove_default(struct netlbl_audit *audit_info)
P
Paul Moore 已提交
373
{
374
	return netlbl_domhsh_remove(NULL, audit_info);
P
Paul Moore 已提交
375 376 377 378 379 380 381 382 383 384 385 386 387 388
}

/**
 * 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,
 * return a pointer to a copy of the entry or NULL.  The caller is responsibile
 * for ensuring that rcu_read_[un]lock() is called.
 *
 */
struct netlbl_dom_map *netlbl_domhsh_getentry(const char *domain)
{
389
	return netlbl_domhsh_search_def(domain);
P
Paul Moore 已提交
390 391 392
}

/**
393 394 395 396 397
 * 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
P
Paul Moore 已提交
398 399
 *
 * Description:
400 401 402 403 404
 * 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
 * return.  Returns zero on succcess, negative values on failure.
P
Paul Moore 已提交
405 406
 *
 */
407 408 409 410
int netlbl_domhsh_walk(u32 *skip_bkt,
		     u32 *skip_chain,
		     int (*callback) (struct netlbl_dom_map *entry, void *arg),
		     void *cb_arg)
P
Paul Moore 已提交
411
{
412 413 414 415
	int ret_val = -ENOENT;
	u32 iter_bkt;
	struct netlbl_dom_map *iter_entry;
	u32 chain_cnt = 0;
P
Paul Moore 已提交
416 417

	rcu_read_lock();
418 419 420 421
	for (iter_bkt = *skip_bkt;
	     iter_bkt < rcu_dereference(netlbl_domhsh)->size;
	     iter_bkt++, chain_cnt = 0) {
		list_for_each_entry_rcu(iter_entry,
422 423
				&rcu_dereference(netlbl_domhsh)->tbl[iter_bkt],
				list)
424 425 426 427 428 429 430 431
			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;
				}
P
Paul Moore 已提交
432
			}
433
	}
P
Paul Moore 已提交
434

435
walk_return:
P
Paul Moore 已提交
436
	rcu_read_unlock();
437 438 439
	*skip_bkt = iter_bkt;
	*skip_chain = chain_cnt;
	return ret_val;
P
Paul Moore 已提交
440
}