added 2.6.29.6 aldebaran kernel
[nao-ulib.git] / kernel / 2.6.29.6-aldebaran-rt / security / selinux / netnode.c
bloba30712232018a3f12a080a5a74d887236a1a9bc5
1 /*
2 * Network node table
4 * SELinux must keep a mapping of network nodes to labels/SIDs. This
5 * mapping is maintained as part of the normal policy but a fast cache is
6 * needed to reduce the lookup overhead since most of these queries happen on
7 * a per-packet basis.
9 * Author: Paul Moore <paul.moore@hp.com>
11 * This code is heavily based on the "netif" concept originally developed by
12 * James Morris <jmorris@redhat.com>
13 * (see security/selinux/netif.c for more information)
18 * (c) Copyright Hewlett-Packard Development Company, L.P., 2007
20 * This program is free software: you can redistribute it and/or modify
21 * it under the terms of version 2 of the GNU General Public License as
22 * published by the Free Software Foundation.
24 * This program is distributed in the hope that it will be useful,
25 * but WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27 * GNU General Public License for more details.
31 #include <linux/types.h>
32 #include <linux/rcupdate.h>
33 #include <linux/list.h>
34 #include <linux/spinlock.h>
35 #include <linux/in.h>
36 #include <linux/in6.h>
37 #include <linux/ip.h>
38 #include <linux/ipv6.h>
39 #include <net/ip.h>
40 #include <net/ipv6.h>
42 #include "netnode.h"
43 #include "objsec.h"
45 #define SEL_NETNODE_HASH_SIZE 256
46 #define SEL_NETNODE_HASH_BKT_LIMIT 16
48 struct sel_netnode_bkt {
49 unsigned int size;
50 struct list_head list;
53 struct sel_netnode {
54 struct netnode_security_struct nsec;
56 struct list_head list;
57 struct rcu_head rcu;
60 /* NOTE: we are using a combined hash table for both IPv4 and IPv6, the reason
61 * for this is that I suspect most users will not make heavy use of both
62 * address families at the same time so one table will usually end up wasted,
63 * if this becomes a problem we can always add a hash table for each address
64 * family later */
66 static LIST_HEAD(sel_netnode_list);
67 static DEFINE_SPINLOCK(sel_netnode_lock);
68 static struct sel_netnode_bkt sel_netnode_hash[SEL_NETNODE_HASH_SIZE];
70 /**
71 * sel_netnode_free - Frees a node entry
72 * @p: the entry's RCU field
74 * Description:
75 * This function is designed to be used as a callback to the call_rcu()
76 * function so that memory allocated to a hash table node entry can be
77 * released safely.
80 static void sel_netnode_free(struct rcu_head *p)
82 struct sel_netnode *node = container_of(p, struct sel_netnode, rcu);
83 kfree(node);
86 /**
87 * sel_netnode_hashfn_ipv4 - IPv4 hashing function for the node table
88 * @addr: IPv4 address
90 * Description:
91 * This is the IPv4 hashing function for the node interface table, it returns
92 * the bucket number for the given IP address.
95 static unsigned int sel_netnode_hashfn_ipv4(__be32 addr)
97 /* at some point we should determine if the mismatch in byte order
98 * affects the hash function dramatically */
99 return (addr & (SEL_NETNODE_HASH_SIZE - 1));
103 * sel_netnode_hashfn_ipv6 - IPv6 hashing function for the node table
104 * @addr: IPv6 address
106 * Description:
107 * This is the IPv6 hashing function for the node interface table, it returns
108 * the bucket number for the given IP address.
111 static unsigned int sel_netnode_hashfn_ipv6(const struct in6_addr *addr)
113 /* just hash the least significant 32 bits to keep things fast (they
114 * are the most likely to be different anyway), we can revisit this
115 * later if needed */
116 return (addr->s6_addr32[3] & (SEL_NETNODE_HASH_SIZE - 1));
120 * sel_netnode_find - Search for a node record
121 * @addr: IP address
122 * @family: address family
124 * Description:
125 * Search the network node table and return the record matching @addr. If an
126 * entry can not be found in the table return NULL.
129 static struct sel_netnode *sel_netnode_find(const void *addr, u16 family)
131 unsigned int idx;
132 struct sel_netnode *node;
134 switch (family) {
135 case PF_INET:
136 idx = sel_netnode_hashfn_ipv4(*(__be32 *)addr);
137 break;
138 case PF_INET6:
139 idx = sel_netnode_hashfn_ipv6(addr);
140 break;
141 default:
142 BUG();
143 return NULL;
146 list_for_each_entry_rcu(node, &sel_netnode_hash[idx].list, list)
147 if (node->nsec.family == family)
148 switch (family) {
149 case PF_INET:
150 if (node->nsec.addr.ipv4 == *(__be32 *)addr)
151 return node;
152 break;
153 case PF_INET6:
154 if (ipv6_addr_equal(&node->nsec.addr.ipv6,
155 addr))
156 return node;
157 break;
160 return NULL;
164 * sel_netnode_insert - Insert a new node into the table
165 * @node: the new node record
167 * Description:
168 * Add a new node record to the network address hash table.
171 static void sel_netnode_insert(struct sel_netnode *node)
173 unsigned int idx;
175 switch (node->nsec.family) {
176 case PF_INET:
177 idx = sel_netnode_hashfn_ipv4(node->nsec.addr.ipv4);
178 break;
179 case PF_INET6:
180 idx = sel_netnode_hashfn_ipv6(&node->nsec.addr.ipv6);
181 break;
182 default:
183 BUG();
186 INIT_RCU_HEAD(&node->rcu);
188 /* we need to impose a limit on the growth of the hash table so check
189 * this bucket to make sure it is within the specified bounds */
190 list_add_rcu(&node->list, &sel_netnode_hash[idx].list);
191 if (sel_netnode_hash[idx].size == SEL_NETNODE_HASH_BKT_LIMIT) {
192 struct sel_netnode *tail;
193 tail = list_entry(
194 rcu_dereference(sel_netnode_hash[idx].list.prev),
195 struct sel_netnode, list);
196 list_del_rcu(&tail->list);
197 call_rcu(&tail->rcu, sel_netnode_free);
198 } else
199 sel_netnode_hash[idx].size++;
203 * sel_netnode_sid_slow - Lookup the SID of a network address using the policy
204 * @addr: the IP address
205 * @family: the address family
206 * @sid: node SID
208 * Description:
209 * This function determines the SID of a network address by quering the
210 * security policy. The result is added to the network address table to
211 * speedup future queries. Returns zero on success, negative values on
212 * failure.
215 static int sel_netnode_sid_slow(void *addr, u16 family, u32 *sid)
217 int ret = -ENOMEM;
218 struct sel_netnode *node;
219 struct sel_netnode *new = NULL;
221 spin_lock_bh(&sel_netnode_lock);
222 node = sel_netnode_find(addr, family);
223 if (node != NULL) {
224 *sid = node->nsec.sid;
225 spin_unlock_bh(&sel_netnode_lock);
226 return 0;
228 new = kzalloc(sizeof(*new), GFP_ATOMIC);
229 if (new == NULL)
230 goto out;
231 switch (family) {
232 case PF_INET:
233 ret = security_node_sid(PF_INET,
234 addr, sizeof(struct in_addr), sid);
235 new->nsec.addr.ipv4 = *(__be32 *)addr;
236 break;
237 case PF_INET6:
238 ret = security_node_sid(PF_INET6,
239 addr, sizeof(struct in6_addr), sid);
240 ipv6_addr_copy(&new->nsec.addr.ipv6, addr);
241 break;
242 default:
243 BUG();
245 if (ret != 0)
246 goto out;
248 new->nsec.family = family;
249 new->nsec.sid = *sid;
250 sel_netnode_insert(new);
252 out:
253 spin_unlock_bh(&sel_netnode_lock);
254 if (unlikely(ret)) {
255 printk(KERN_WARNING
256 "SELinux: failure in sel_netnode_sid_slow(),"
257 " unable to determine network node label\n");
258 kfree(new);
260 return ret;
264 * sel_netnode_sid - Lookup the SID of a network address
265 * @addr: the IP address
266 * @family: the address family
267 * @sid: node SID
269 * Description:
270 * This function determines the SID of a network address using the fastest
271 * method possible. First the address table is queried, but if an entry
272 * can't be found then the policy is queried and the result is added to the
273 * table to speedup future queries. Returns zero on success, negative values
274 * on failure.
277 int sel_netnode_sid(void *addr, u16 family, u32 *sid)
279 struct sel_netnode *node;
281 rcu_read_lock();
282 node = sel_netnode_find(addr, family);
283 if (node != NULL) {
284 *sid = node->nsec.sid;
285 rcu_read_unlock();
286 return 0;
288 rcu_read_unlock();
290 return sel_netnode_sid_slow(addr, family, sid);
294 * sel_netnode_flush - Flush the entire network address table
296 * Description:
297 * Remove all entries from the network address table.
300 static void sel_netnode_flush(void)
302 unsigned int idx;
303 struct sel_netnode *node, *node_tmp;
305 spin_lock_bh(&sel_netnode_lock);
306 for (idx = 0; idx < SEL_NETNODE_HASH_SIZE; idx++) {
307 list_for_each_entry_safe(node, node_tmp,
308 &sel_netnode_hash[idx].list, list) {
309 list_del_rcu(&node->list);
310 call_rcu(&node->rcu, sel_netnode_free);
312 sel_netnode_hash[idx].size = 0;
314 spin_unlock_bh(&sel_netnode_lock);
317 static int sel_netnode_avc_callback(u32 event, u32 ssid, u32 tsid,
318 u16 class, u32 perms, u32 *retained)
320 if (event == AVC_CALLBACK_RESET) {
321 sel_netnode_flush();
322 synchronize_net();
324 return 0;
327 static __init int sel_netnode_init(void)
329 int iter;
330 int ret;
332 if (!selinux_enabled)
333 return 0;
335 for (iter = 0; iter < SEL_NETNODE_HASH_SIZE; iter++) {
336 INIT_LIST_HEAD(&sel_netnode_hash[iter].list);
337 sel_netnode_hash[iter].size = 0;
340 ret = avc_add_callback(sel_netnode_avc_callback, AVC_CALLBACK_RESET,
341 SECSID_NULL, SECSID_NULL, SECCLASS_NULL, 0);
342 if (ret != 0)
343 panic("avc_add_callback() failed, error %d\n", ret);
345 return ret;
348 __initcall(sel_netnode_init);