Merge branch 'for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/cjb/mmc
[cris-mirror.git] / security / integrity / ima / ima_iint.c
blob4ae73040ab7b52fa185fe2913f5145adac6003c8
1 /*
2 * Copyright (C) 2008 IBM Corporation
4 * Authors:
5 * Mimi Zohar <zohar@us.ibm.com>
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License as
9 * published by the Free Software Foundation, version 2 of the
10 * License.
12 * File: ima_iint.c
13 * - implements the IMA hooks: ima_inode_alloc, ima_inode_free
14 * - cache integrity information associated with an inode
15 * using a rbtree tree.
17 #include <linux/slab.h>
18 #include <linux/module.h>
19 #include <linux/spinlock.h>
20 #include <linux/rbtree.h>
21 #include "ima.h"
23 static struct rb_root ima_iint_tree = RB_ROOT;
24 static DEFINE_SPINLOCK(ima_iint_lock);
25 static struct kmem_cache *iint_cache __read_mostly;
27 int iint_initialized = 0;
30 * __ima_iint_find - return the iint associated with an inode
32 static struct ima_iint_cache *__ima_iint_find(struct inode *inode)
34 struct ima_iint_cache *iint;
35 struct rb_node *n = ima_iint_tree.rb_node;
37 assert_spin_locked(&ima_iint_lock);
39 while (n) {
40 iint = rb_entry(n, struct ima_iint_cache, rb_node);
42 if (inode < iint->inode)
43 n = n->rb_left;
44 else if (inode > iint->inode)
45 n = n->rb_right;
46 else
47 break;
49 if (!n)
50 return NULL;
52 return iint;
56 * ima_iint_find - return the iint associated with an inode
58 struct ima_iint_cache *ima_iint_find(struct inode *inode)
60 struct ima_iint_cache *iint;
62 if (!IS_IMA(inode))
63 return NULL;
65 spin_lock(&ima_iint_lock);
66 iint = __ima_iint_find(inode);
67 spin_unlock(&ima_iint_lock);
69 return iint;
72 static void iint_free(struct ima_iint_cache *iint)
74 iint->version = 0;
75 iint->flags = 0UL;
76 kmem_cache_free(iint_cache, iint);
79 /**
80 * ima_inode_alloc - allocate an iint associated with an inode
81 * @inode: pointer to the inode
83 int ima_inode_alloc(struct inode *inode)
85 struct rb_node **p;
86 struct rb_node *new_node, *parent = NULL;
87 struct ima_iint_cache *new_iint, *test_iint;
88 int rc;
90 new_iint = kmem_cache_alloc(iint_cache, GFP_NOFS);
91 if (!new_iint)
92 return -ENOMEM;
94 new_iint->inode = inode;
95 new_node = &new_iint->rb_node;
97 mutex_lock(&inode->i_mutex); /* i_flags */
98 spin_lock(&ima_iint_lock);
100 p = &ima_iint_tree.rb_node;
101 while (*p) {
102 parent = *p;
103 test_iint = rb_entry(parent, struct ima_iint_cache, rb_node);
105 rc = -EEXIST;
106 if (inode < test_iint->inode)
107 p = &(*p)->rb_left;
108 else if (inode > test_iint->inode)
109 p = &(*p)->rb_right;
110 else
111 goto out_err;
114 inode->i_flags |= S_IMA;
115 rb_link_node(new_node, parent, p);
116 rb_insert_color(new_node, &ima_iint_tree);
118 spin_unlock(&ima_iint_lock);
119 mutex_unlock(&inode->i_mutex); /* i_flags */
121 return 0;
122 out_err:
123 spin_unlock(&ima_iint_lock);
124 mutex_unlock(&inode->i_mutex); /* i_flags */
125 iint_free(new_iint);
127 return rc;
131 * ima_inode_free - called on security_inode_free
132 * @inode: pointer to the inode
134 * Free the integrity information(iint) associated with an inode.
136 void ima_inode_free(struct inode *inode)
138 struct ima_iint_cache *iint;
140 if (!IS_IMA(inode))
141 return;
143 spin_lock(&ima_iint_lock);
144 iint = __ima_iint_find(inode);
145 rb_erase(&iint->rb_node, &ima_iint_tree);
146 spin_unlock(&ima_iint_lock);
148 iint_free(iint);
151 static void init_once(void *foo)
153 struct ima_iint_cache *iint = foo;
155 memset(iint, 0, sizeof *iint);
156 iint->version = 0;
157 iint->flags = 0UL;
158 mutex_init(&iint->mutex);
161 static int __init ima_iintcache_init(void)
163 iint_cache =
164 kmem_cache_create("iint_cache", sizeof(struct ima_iint_cache), 0,
165 SLAB_PANIC, init_once);
166 iint_initialized = 1;
167 return 0;
169 security_initcall(ima_iintcache_init);