[deliverable/linux.git] / net / ax25 / ax25_uid.c

/*
 * 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.
 *
 * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
 */
#include <linux/errno.h>
#include <linux/types.h>
#include <linux/socket.h>
#include <linux/in.h>
#include <linux/kernel.h>
#include <linux/sched.h>
#include <linux/timer.h>
#include <linux/string.h>
#include <linux/sockios.h>
#include <linux/net.h>
#include <linux/spinlock.h>
#include <net/ax25.h>
#include <linux/inet.h>
#include <linux/netdevice.h>
#include <linux/if_arp.h>
#include <linux/skbuff.h>
#include <net/sock.h>
#include <asm/uaccess.h>
#include <asm/system.h>
#include <linux/fcntl.h>
#include <linux/mm.h>
#include <linux/interrupt.h>
#include <linux/list.h>
#include <linux/notifier.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h>
#include <linux/stat.h>
#include <linux/netfilter.h>
#include <linux/sysctl.h>
#include <net/ip.h>
#include <net/arp.h>

/*
 *	Callsign/UID mapper. This is in kernel space for security on multi-amateur machines.
 */

HLIST_HEAD(ax25_uid_list);
static DEFINE_RWLOCK(ax25_uid_lock);

int ax25_uid_policy = 0;

ax25_uid_assoc *ax25_findbyuid(uid_t uid)
{
	ax25_uid_assoc *ax25_uid, *res = NULL;
	struct hlist_node *node;

	read_lock(&ax25_uid_lock);
	ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
		if (ax25_uid->uid == uid) {
			ax25_uid_hold(ax25_uid);
			res = ax25_uid;
			break;
		}
	}
	read_unlock(&ax25_uid_lock);

	return res;
}

int ax25_uid_ioctl(int cmd, struct sockaddr_ax25 *sax)
{
	ax25_uid_assoc *ax25_uid;
	struct hlist_node *node;
	ax25_uid_assoc *user;
	unsigned long res;

	switch (cmd) {
	case SIOCAX25GETUID:
		res = -ENOENT;
		read_lock(&ax25_uid_lock);
		ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
			if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0) {
				res = ax25_uid->uid;
				break;
			}
		}
		read_unlock(&ax25_uid_lock);

		return res;

	case SIOCAX25ADDUID:
		if (!capable(CAP_NET_ADMIN))
			return -EPERM;
		user = ax25_findbyuid(sax->sax25_uid);
		if (user) {
			ax25_uid_put(user);
			return -EEXIST;
		}
		if (sax->sax25_uid == 0)
			return -EINVAL;
		if ((ax25_uid = kmalloc(sizeof(*ax25_uid), GFP_KERNEL)) == NULL)
			return -ENOMEM;

		atomic_set(&ax25_uid->refcount, 1);
		ax25_uid->uid  = sax->sax25_uid;
		ax25_uid->call = sax->sax25_call;

		write_lock(&ax25_uid_lock);
		hlist_add_head(&ax25_uid->uid_node, &ax25_uid_list);
		write_unlock(&ax25_uid_lock);

		return 0;

	case SIOCAX25DELUID:
		if (!capable(CAP_NET_ADMIN))
			return -EPERM;

		ax25_uid = NULL;
		write_lock(&ax25_uid_lock);
		ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
			if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0)
				break;
		}
		if (ax25_uid == NULL) {
			write_unlock(&ax25_uid_lock);
			return -ENOENT;
		}
		hlist_del_init(&ax25_uid->uid_node);
		ax25_uid_put(ax25_uid);
		write_unlock(&ax25_uid_lock);

		return 0;

	default:
		return -EINVAL;
	}

	return -EINVAL;	/*NOTREACHED */
}

#ifdef CONFIG_PROC_FS

static void *ax25_uid_seq_start(struct seq_file *seq, loff_t *pos)
{
	struct ax25_uid_assoc *pt;
	struct hlist_node *node;
	int i = 0;

	read_lock(&ax25_uid_lock);
	ax25_uid_for_each(pt, node, &ax25_uid_list) {
		if (i == *pos)
			return pt;
		++i;
	}
	return NULL;
}

static void *ax25_uid_seq_next(struct seq_file *seq, void *v, loff_t *pos)
{
	++*pos;

	return hlist_entry(((ax25_uid_assoc *)v)->uid_node.next,
	                   ax25_uid_assoc, uid_node);
}

static void ax25_uid_seq_stop(struct seq_file *seq, void *v)
{
	read_unlock(&ax25_uid_lock);
}

static int ax25_uid_seq_show(struct seq_file *seq, void *v)
{
	char buf[11];

	if (v == SEQ_START_TOKEN)
		seq_printf(seq, "Policy: %d\n", ax25_uid_policy);
	else {
		struct ax25_uid_assoc *pt = v;

		seq_printf(seq, "%6d %s\n", pt->uid, ax2asc(buf, &pt->call));
	}
	return 0;
}

static struct seq_operations ax25_uid_seqops = {
	.start = ax25_uid_seq_start,
	.next = ax25_uid_seq_next,
	.stop = ax25_uid_seq_stop,
	.show = ax25_uid_seq_show,
};

static int ax25_uid_info_open(struct inode *inode, struct file *file)
{
	return seq_open(file, &ax25_uid_seqops);
}

struct file_operations ax25_uid_fops = {
	.owner = THIS_MODULE,
	.open = ax25_uid_info_open,
	.read = seq_read,
	.llseek = seq_lseek,
	.release = seq_release,
};

#endif

/*
 *	Free all memory associated with UID/Callsign structures.
 */
void __exit ax25_uid_free(void)
{
	ax25_uid_assoc *ax25_uid;
	struct hlist_node *node;

	write_lock(&ax25_uid_lock);
	ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
		hlist_del_init(&ax25_uid->uid_node);
		ax25_uid_put(ax25_uid);
	}
	write_unlock(&ax25_uid_lock);
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* This program is free software; you can redistribute it and/or modify
	3	* it under the terms of the GNU General Public License as published by
	4	* the Free Software Foundation; either version 2 of the License, or
	5	* (at your option) any later version.
	6	*
	7	* Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
	8	*/
	9	#include <linux/errno.h>
	10	#include <linux/types.h>
	11	#include <linux/socket.h>
	12	#include <linux/in.h>
	13	#include <linux/kernel.h>
	14	#include <linux/sched.h>
	15	#include <linux/timer.h>
	16	#include <linux/string.h>
	17	#include <linux/sockios.h>
	18	#include <linux/net.h>
	19	#include <linux/spinlock.h>
	20	#include <net/ax25.h>
	21	#include <linux/inet.h>
	22	#include <linux/netdevice.h>
	23	#include <linux/if_arp.h>
	24	#include <linux/skbuff.h>
	25	#include <net/sock.h>
	26	#include <asm/uaccess.h>
	27	#include <asm/system.h>
	28	#include <linux/fcntl.h>
	29	#include <linux/mm.h>
	30	#include <linux/interrupt.h>
01d7dd0e	31	#include <linux/list.h>
1da177e4 LT	32	#include <linux/notifier.h>
	33	#include <linux/proc_fs.h>
	34	#include <linux/seq_file.h>
	35	#include <linux/stat.h>
	36	#include <linux/netfilter.h>
	37	#include <linux/sysctl.h>
	38	#include <net/ip.h>
	39	#include <net/arp.h>
	40
	41	/*
	42	* Callsign/UID mapper. This is in kernel space for security on multi-amateur machines.
	43	*/
	44
01d7dd0e	45	HLIST_HEAD(ax25_uid_list);
1da177e4 LT	46	static DEFINE_RWLOCK(ax25_uid_lock);
	47
	48	int ax25_uid_policy = 0;
	49
01d7dd0e	50	ax25_uid_assoc *ax25_findbyuid(uid_t uid)
1da177e4	51	{
01d7dd0e RB	52	ax25_uid_assoc ax25_uid, res = NULL;
01d7dd0e RB	53	struct hlist_node *node;
1da177e4 LT	54
1da177e4 LT	55	read_lock(&ax25_uid_lock);
01d7dd0e	56	ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
1da177e4	57	if (ax25_uid->uid == uid) {
01d7dd0e RB	58	ax25_uid_hold(ax25_uid);
01d7dd0e RB	59	res = ax25_uid;
1da177e4 LT	60	break;
	61	}
	62	}
	63	read_unlock(&ax25_uid_lock);
	64
01d7dd0e	65	return res;
1da177e4 LT	66	}
	67
	68	int ax25_uid_ioctl(int cmd, struct sockaddr_ax25 *sax)
	69	{
01d7dd0e RB	70	ax25_uid_assoc *ax25_uid;
	71	struct hlist_node *node;
	72	ax25_uid_assoc *user;
1da177e4 LT	73	unsigned long res;
	74
	75	switch (cmd) {
	76	case SIOCAX25GETUID:
	77	res = -ENOENT;
	78	read_lock(&ax25_uid_lock);
01d7dd0e	79	ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
1da177e4 LT	80	if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0) {
	81	res = ax25_uid->uid;
	82	break;
	83	}
	84	}
	85	read_unlock(&ax25_uid_lock);
	86
	87	return res;
	88
	89	case SIOCAX25ADDUID:
	90	if (!capable(CAP_NET_ADMIN))
	91	return -EPERM;
01d7dd0e RB	92	user = ax25_findbyuid(sax->sax25_uid);
	93	if (user) {
	94	ax25_uid_put(user);
1da177e4	95	return -EEXIST;
01d7dd0e	96	}
1da177e4 LT	97	if (sax->sax25_uid == 0)
	98	return -EINVAL;
	99	if ((ax25_uid = kmalloc(sizeof(*ax25_uid), GFP_KERNEL)) == NULL)
	100	return -ENOMEM;
	101
01d7dd0e	102	atomic_set(&ax25_uid->refcount, 1);
1da177e4 LT	103	ax25_uid->uid = sax->sax25_uid;
	104	ax25_uid->call = sax->sax25_call;
	105
	106	write_lock(&ax25_uid_lock);
01d7dd0e	107	hlist_add_head(&ax25_uid->uid_node, &ax25_uid_list);
1da177e4 LT	108	write_unlock(&ax25_uid_lock);
	109
	110	return 0;
	111
	112	case SIOCAX25DELUID:
	113	if (!capable(CAP_NET_ADMIN))
	114	return -EPERM;
	115
01d7dd0e	116	ax25_uid = NULL;
1da177e4	117	write_lock(&ax25_uid_lock);
01d7dd0e RB	118	ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
01d7dd0e RB	119	if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0)
1da177e4	120	break;
1da177e4 LT	121	}
	122	if (ax25_uid == NULL) {
	123	write_unlock(&ax25_uid_lock);
	124	return -ENOENT;
	125	}
01d7dd0e RB	126	hlist_del_init(&ax25_uid->uid_node);
01d7dd0e RB	127	ax25_uid_put(ax25_uid);
1da177e4 LT	128	write_unlock(&ax25_uid_lock);
1da177e4 LT	129
01d7dd0e	130	return 0;
1da177e4 LT	131
	132	default:
	133	return -EINVAL;
	134	}
	135
	136	return -EINVAL; /NOTREACHED /
	137	}
	138
	139	#ifdef CONFIG_PROC_FS
	140
	141	static void ax25_uid_seq_start(struct seq_file seq, loff_t *pos)
	142	{
	143	struct ax25_uid_assoc *pt;
01d7dd0e RB	144	struct hlist_node *node;
01d7dd0e RB	145	int i = 0;
1da177e4 LT	146
1da177e4 LT	147	read_lock(&ax25_uid_lock);
01d7dd0e	148	ax25_uid_for_each(pt, node, &ax25_uid_list) {
1da177e4 LT	149	if (i == *pos)
	150	return pt;
	151	++i;
	152	}
	153	return NULL;
	154	}
	155
	156	static void ax25_uid_seq_next(struct seq_file seq, void v, loff_t pos)
	157	{
	158	++*pos;
01d7dd0e RB	159
	160	return hlist_entry(((ax25_uid_assoc *)v)->uid_node.next,
	161	ax25_uid_assoc, uid_node);
1da177e4 LT	162	}
	163
	164	static void ax25_uid_seq_stop(struct seq_file seq, void v)
	165	{
	166	read_unlock(&ax25_uid_lock);
	167	}
	168
	169	static int ax25_uid_seq_show(struct seq_file seq, void v)
	170	{
f75268cd RB	171	char buf[11];
f75268cd RB	172
1da177e4 LT	173	if (v == SEQ_START_TOKEN)
	174	seq_printf(seq, "Policy: %d\n", ax25_uid_policy);
	175	else {
	176	struct ax25_uid_assoc *pt = v;
1da177e4	177
f75268cd	178	seq_printf(seq, "%6d %s\n", pt->uid, ax2asc(buf, &pt->call));
1da177e4 LT	179	}
	180	return 0;
	181	}
	182
	183	static struct seq_operations ax25_uid_seqops = {
	184	.start = ax25_uid_seq_start,
	185	.next = ax25_uid_seq_next,
	186	.stop = ax25_uid_seq_stop,
	187	.show = ax25_uid_seq_show,
	188	};
	189
	190	static int ax25_uid_info_open(struct inode inode, struct file file)
	191	{
	192	return seq_open(file, &ax25_uid_seqops);
	193	}
	194
	195	struct file_operations ax25_uid_fops = {
	196	.owner = THIS_MODULE,
	197	.open = ax25_uid_info_open,
	198	.read = seq_read,
	199	.llseek = seq_lseek,
	200	.release = seq_release,
	201	};
	202
	203	#endif
	204
	205	/*
	206	* Free all memory associated with UID/Callsign structures.
	207	*/
	208	void __exit ax25_uid_free(void)
	209	{
01d7dd0e RB	210	ax25_uid_assoc *ax25_uid;
01d7dd0e RB	211	struct hlist_node *node;
1da177e4 LT	212
1da177e4 LT	213	write_lock(&ax25_uid_lock);
01d7dd0e RB	214	ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
	215	hlist_del_init(&ax25_uid->uid_node);
	216	ax25_uid_put(ax25_uid);
1da177e4	217	}
1da177e4 LT	218	write_unlock(&ax25_uid_lock);
1da177e4 LT	219	}