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.
7 * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
10 #include <linux/capability.h>
11 #include <linux/errno.h>
12 #include <linux/types.h>
13 #include <linux/socket.h>
15 #include <linux/kernel.h>
16 #include <linux/sched.h>
17 #include <linux/timer.h>
18 #include <linux/string.h>
19 #include <linux/sockios.h>
20 #include <linux/net.h>
21 #include <linux/spinlock.h>
23 #include <linux/inet.h>
24 #include <linux/netdevice.h>
25 #include <linux/if_arp.h>
26 #include <linux/skbuff.h>
28 #include <asm/uaccess.h>
29 #include <asm/system.h>
30 #include <linux/fcntl.h>
32 #include <linux/interrupt.h>
33 #include <linux/list.h>
34 #include <linux/notifier.h>
35 #include <linux/proc_fs.h>
36 #include <linux/seq_file.h>
37 #include <linux/stat.h>
38 #include <linux/netfilter.h>
39 #include <linux/sysctl.h>
44 * Callsign/UID mapper. This is in kernel space for security on multi-amateur machines.
47 HLIST_HEAD(ax25_uid_list
);
48 static DEFINE_RWLOCK(ax25_uid_lock
);
50 int ax25_uid_policy
= 0;
52 EXPORT_SYMBOL(ax25_uid_policy
);
54 ax25_uid_assoc
*ax25_findbyuid(uid_t uid
)
56 ax25_uid_assoc
*ax25_uid
, *res
= NULL
;
57 struct hlist_node
*node
;
59 read_lock(&ax25_uid_lock
);
60 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
61 if (ax25_uid
->uid
== uid
) {
62 ax25_uid_hold(ax25_uid
);
67 read_unlock(&ax25_uid_lock
);
72 EXPORT_SYMBOL(ax25_findbyuid
);
74 int ax25_uid_ioctl(int cmd
, struct sockaddr_ax25
*sax
)
76 ax25_uid_assoc
*ax25_uid
;
77 struct hlist_node
*node
;
84 read_lock(&ax25_uid_lock
);
85 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
86 if (ax25cmp(&sax
->sax25_call
, &ax25_uid
->call
) == 0) {
91 read_unlock(&ax25_uid_lock
);
96 if (!capable(CAP_NET_ADMIN
))
98 user
= ax25_findbyuid(sax
->sax25_uid
);
103 if (sax
->sax25_uid
== 0)
105 if ((ax25_uid
= kmalloc(sizeof(*ax25_uid
), GFP_KERNEL
)) == NULL
)
108 atomic_set(&ax25_uid
->refcount
, 1);
109 ax25_uid
->uid
= sax
->sax25_uid
;
110 ax25_uid
->call
= sax
->sax25_call
;
112 write_lock(&ax25_uid_lock
);
113 hlist_add_head(&ax25_uid
->uid_node
, &ax25_uid_list
);
114 write_unlock(&ax25_uid_lock
);
119 if (!capable(CAP_NET_ADMIN
))
123 write_lock(&ax25_uid_lock
);
124 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
125 if (ax25cmp(&sax
->sax25_call
, &ax25_uid
->call
) == 0)
128 if (ax25_uid
== NULL
) {
129 write_unlock(&ax25_uid_lock
);
132 hlist_del_init(&ax25_uid
->uid_node
);
133 ax25_uid_put(ax25_uid
);
134 write_unlock(&ax25_uid_lock
);
142 return -EINVAL
; /*NOTREACHED */
145 #ifdef CONFIG_PROC_FS
147 static void *ax25_uid_seq_start(struct seq_file
*seq
, loff_t
*pos
)
149 struct ax25_uid_assoc
*pt
;
150 struct hlist_node
*node
;
153 read_lock(&ax25_uid_lock
);
154 ax25_uid_for_each(pt
, node
, &ax25_uid_list
) {
162 static void *ax25_uid_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
166 return hlist_entry(((ax25_uid_assoc
*)v
)->uid_node
.next
,
167 ax25_uid_assoc
, uid_node
);
170 static void ax25_uid_seq_stop(struct seq_file
*seq
, void *v
)
172 read_unlock(&ax25_uid_lock
);
175 static int ax25_uid_seq_show(struct seq_file
*seq
, void *v
)
179 if (v
== SEQ_START_TOKEN
)
180 seq_printf(seq
, "Policy: %d\n", ax25_uid_policy
);
182 struct ax25_uid_assoc
*pt
= v
;
184 seq_printf(seq
, "%6d %s\n", pt
->uid
, ax2asc(buf
, &pt
->call
));
189 static struct seq_operations ax25_uid_seqops
= {
190 .start
= ax25_uid_seq_start
,
191 .next
= ax25_uid_seq_next
,
192 .stop
= ax25_uid_seq_stop
,
193 .show
= ax25_uid_seq_show
,
196 static int ax25_uid_info_open(struct inode
*inode
, struct file
*file
)
198 return seq_open(file
, &ax25_uid_seqops
);
201 struct file_operations ax25_uid_fops
= {
202 .owner
= THIS_MODULE
,
203 .open
= ax25_uid_info_open
,
206 .release
= seq_release
,
212 * Free all memory associated with UID/Callsign structures.
214 void __exit
ax25_uid_free(void)
216 ax25_uid_assoc
*ax25_uid
;
217 struct hlist_node
*node
;
219 write_lock(&ax25_uid_lock
);
220 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
221 hlist_del_init(&ax25_uid
->uid_node
);
222 ax25_uid_put(ax25_uid
);
224 write_unlock(&ax25_uid_lock
);