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/timer.h>
17 #include <linux/string.h>
18 #include <linux/sockios.h>
19 #include <linux/net.h>
20 #include <linux/spinlock.h>
22 #include <linux/inet.h>
23 #include <linux/netdevice.h>
24 #include <linux/if_arp.h>
25 #include <linux/skbuff.h>
27 #include <asm/uaccess.h>
28 #include <asm/system.h>
29 #include <linux/fcntl.h>
31 #include <linux/interrupt.h>
32 #include <linux/list.h>
33 #include <linux/notifier.h>
34 #include <linux/proc_fs.h>
35 #include <linux/seq_file.h>
36 #include <linux/stat.h>
37 #include <linux/netfilter.h>
38 #include <linux/sysctl.h>
43 * Callsign/UID mapper. This is in kernel space for security on multi-amateur machines.
46 static HLIST_HEAD(ax25_uid_list
);
47 static DEFINE_RWLOCK(ax25_uid_lock
);
51 EXPORT_SYMBOL(ax25_uid_policy
);
53 ax25_uid_assoc
*ax25_findbyuid(uid_t uid
)
55 ax25_uid_assoc
*ax25_uid
, *res
= NULL
;
56 struct hlist_node
*node
;
58 read_lock(&ax25_uid_lock
);
59 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
60 if (ax25_uid
->uid
== uid
) {
61 ax25_uid_hold(ax25_uid
);
66 read_unlock(&ax25_uid_lock
);
71 EXPORT_SYMBOL(ax25_findbyuid
);
73 int ax25_uid_ioctl(int cmd
, struct sockaddr_ax25
*sax
)
75 ax25_uid_assoc
*ax25_uid
;
76 struct hlist_node
*node
;
83 read_lock(&ax25_uid_lock
);
84 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
85 if (ax25cmp(&sax
->sax25_call
, &ax25_uid
->call
) == 0) {
90 read_unlock(&ax25_uid_lock
);
95 if (!capable(CAP_NET_ADMIN
))
97 user
= ax25_findbyuid(sax
->sax25_uid
);
102 if (sax
->sax25_uid
== 0)
104 if ((ax25_uid
= kmalloc(sizeof(*ax25_uid
), GFP_KERNEL
)) == NULL
)
107 atomic_set(&ax25_uid
->refcount
, 1);
108 ax25_uid
->uid
= sax
->sax25_uid
;
109 ax25_uid
->call
= sax
->sax25_call
;
111 write_lock(&ax25_uid_lock
);
112 hlist_add_head(&ax25_uid
->uid_node
, &ax25_uid_list
);
113 write_unlock(&ax25_uid_lock
);
118 if (!capable(CAP_NET_ADMIN
))
122 write_lock(&ax25_uid_lock
);
123 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
124 if (ax25cmp(&sax
->sax25_call
, &ax25_uid
->call
) == 0)
127 if (ax25_uid
== NULL
) {
128 write_unlock(&ax25_uid_lock
);
131 hlist_del_init(&ax25_uid
->uid_node
);
132 ax25_uid_put(ax25_uid
);
133 write_unlock(&ax25_uid_lock
);
141 return -EINVAL
; /*NOTREACHED */
144 #ifdef CONFIG_PROC_FS
146 static void *ax25_uid_seq_start(struct seq_file
*seq
, loff_t
*pos
)
147 __acquires(ax25_uid_lock
)
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
)
171 __releases(ax25_uid_lock
)
173 read_unlock(&ax25_uid_lock
);
176 static int ax25_uid_seq_show(struct seq_file
*seq
, void *v
)
180 if (v
== SEQ_START_TOKEN
)
181 seq_printf(seq
, "Policy: %d\n", ax25_uid_policy
);
183 struct ax25_uid_assoc
*pt
= v
;
185 seq_printf(seq
, "%6d %s\n", pt
->uid
, ax2asc(buf
, &pt
->call
));
190 static const struct seq_operations ax25_uid_seqops
= {
191 .start
= ax25_uid_seq_start
,
192 .next
= ax25_uid_seq_next
,
193 .stop
= ax25_uid_seq_stop
,
194 .show
= ax25_uid_seq_show
,
197 static int ax25_uid_info_open(struct inode
*inode
, struct file
*file
)
199 return seq_open(file
, &ax25_uid_seqops
);
202 const struct file_operations ax25_uid_fops
= {
203 .owner
= THIS_MODULE
,
204 .open
= ax25_uid_info_open
,
207 .release
= seq_release
,
213 * Free all memory associated with UID/Callsign structures.
215 void __exit
ax25_uid_free(void)
217 ax25_uid_assoc
*ax25_uid
;
218 struct hlist_node
*node
;
220 write_lock(&ax25_uid_lock
);
222 ax25_uid_for_each(ax25_uid
, node
, &ax25_uid_list
) {
223 hlist_del_init(&ax25_uid
->uid_node
);
224 ax25_uid_put(ax25_uid
);
227 write_unlock(&ax25_uid_lock
);