blob: d82a5a13d8551ca1b857a13c401f706340b88850 [file] [log] [blame]
Mimi Zoharf381c272011-03-09 14:13:22 -05001/*
2 * Copyright (C) 2008 IBM Corporation
3 *
4 * Authors:
5 * Mimi Zohar <zohar@us.ibm.com>
6 *
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.
11 *
12 * File: integrity_iint.c
13 * - implements the integrity hooks: integrity_inode_alloc,
14 * integrity_inode_free
15 * - cache integrity information associated with an inode
16 * using a rbtree tree.
17 */
18#include <linux/slab.h>
19#include <linux/module.h>
20#include <linux/spinlock.h>
21#include <linux/rbtree.h>
22#include "integrity.h"
23
24static struct rb_root integrity_iint_tree = RB_ROOT;
Dmitry Kasatkina10bf262012-02-08 14:15:42 -050025static DEFINE_RWLOCK(integrity_iint_lock);
Mimi Zoharf381c272011-03-09 14:13:22 -050026static struct kmem_cache *iint_cache __read_mostly;
27
28int iint_initialized;
29
30/*
31 * __integrity_iint_find - return the iint associated with an inode
32 */
33static struct integrity_iint_cache *__integrity_iint_find(struct inode *inode)
34{
35 struct integrity_iint_cache *iint;
36 struct rb_node *n = integrity_iint_tree.rb_node;
37
Mimi Zoharf381c272011-03-09 14:13:22 -050038 while (n) {
39 iint = rb_entry(n, struct integrity_iint_cache, rb_node);
40
41 if (inode < iint->inode)
42 n = n->rb_left;
43 else if (inode > iint->inode)
44 n = n->rb_right;
45 else
46 break;
47 }
48 if (!n)
49 return NULL;
50
51 return iint;
52}
53
54/*
55 * integrity_iint_find - return the iint associated with an inode
56 */
57struct integrity_iint_cache *integrity_iint_find(struct inode *inode)
58{
59 struct integrity_iint_cache *iint;
60
61 if (!IS_IMA(inode))
62 return NULL;
63
Dmitry Kasatkina10bf262012-02-08 14:15:42 -050064 read_lock(&integrity_iint_lock);
Mimi Zoharf381c272011-03-09 14:13:22 -050065 iint = __integrity_iint_find(inode);
Dmitry Kasatkina10bf262012-02-08 14:15:42 -050066 read_unlock(&integrity_iint_lock);
Mimi Zoharf381c272011-03-09 14:13:22 -050067
68 return iint;
69}
70
71static void iint_free(struct integrity_iint_cache *iint)
72{
73 iint->version = 0;
74 iint->flags = 0UL;
Mimi Zohar2fe5d6d2012-02-13 10:15:05 -050075 iint->ima_status = INTEGRITY_UNKNOWN;
Dmitry Kasatkinfb788d82011-08-15 15:30:11 +030076 iint->evm_status = INTEGRITY_UNKNOWN;
Mimi Zoharf381c272011-03-09 14:13:22 -050077 kmem_cache_free(iint_cache, iint);
78}
79
80/**
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +030081 * integrity_inode_get - find or allocate an iint associated with an inode
Mimi Zoharf381c272011-03-09 14:13:22 -050082 * @inode: pointer to the inode
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +030083 * @return: allocated iint
84 *
85 * Caller must lock i_mutex
Mimi Zoharf381c272011-03-09 14:13:22 -050086 */
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +030087struct integrity_iint_cache *integrity_inode_get(struct inode *inode)
Mimi Zoharf381c272011-03-09 14:13:22 -050088{
89 struct rb_node **p;
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +030090 struct rb_node *node, *parent = NULL;
91 struct integrity_iint_cache *iint, *test_iint;
Mimi Zoharf381c272011-03-09 14:13:22 -050092
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +030093 iint = integrity_iint_find(inode);
94 if (iint)
95 return iint;
Mimi Zoharf381c272011-03-09 14:13:22 -050096
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +030097 iint = kmem_cache_alloc(iint_cache, GFP_NOFS);
98 if (!iint)
99 return NULL;
Mimi Zoharf381c272011-03-09 14:13:22 -0500100
Dmitry Kasatkina10bf262012-02-08 14:15:42 -0500101 write_lock(&integrity_iint_lock);
Mimi Zoharf381c272011-03-09 14:13:22 -0500102
103 p = &integrity_iint_tree.rb_node;
104 while (*p) {
105 parent = *p;
106 test_iint = rb_entry(parent, struct integrity_iint_cache,
107 rb_node);
Mimi Zoharf381c272011-03-09 14:13:22 -0500108 if (inode < test_iint->inode)
109 p = &(*p)->rb_left;
Mimi Zoharf381c272011-03-09 14:13:22 -0500110 else
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +0300111 p = &(*p)->rb_right;
Mimi Zoharf381c272011-03-09 14:13:22 -0500112 }
113
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +0300114 iint->inode = inode;
115 node = &iint->rb_node;
Mimi Zoharf381c272011-03-09 14:13:22 -0500116 inode->i_flags |= S_IMA;
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +0300117 rb_link_node(node, parent, p);
118 rb_insert_color(node, &integrity_iint_tree);
Mimi Zoharf381c272011-03-09 14:13:22 -0500119
Dmitry Kasatkina10bf262012-02-08 14:15:42 -0500120 write_unlock(&integrity_iint_lock);
Dmitry Kasatkinbf2276d2011-10-19 12:04:40 +0300121 return iint;
Mimi Zoharf381c272011-03-09 14:13:22 -0500122}
123
124/**
125 * integrity_inode_free - called on security_inode_free
126 * @inode: pointer to the inode
127 *
128 * Free the integrity information(iint) associated with an inode.
129 */
130void integrity_inode_free(struct inode *inode)
131{
132 struct integrity_iint_cache *iint;
133
134 if (!IS_IMA(inode))
135 return;
136
Dmitry Kasatkina10bf262012-02-08 14:15:42 -0500137 write_lock(&integrity_iint_lock);
Mimi Zoharf381c272011-03-09 14:13:22 -0500138 iint = __integrity_iint_find(inode);
139 rb_erase(&iint->rb_node, &integrity_iint_tree);
Dmitry Kasatkina10bf262012-02-08 14:15:42 -0500140 write_unlock(&integrity_iint_lock);
Mimi Zoharf381c272011-03-09 14:13:22 -0500141
142 iint_free(iint);
143}
144
145static void init_once(void *foo)
146{
147 struct integrity_iint_cache *iint = foo;
148
149 memset(iint, 0, sizeof *iint);
150 iint->version = 0;
151 iint->flags = 0UL;
Mimi Zohar2fe5d6d2012-02-13 10:15:05 -0500152 iint->ima_status = INTEGRITY_UNKNOWN;
Dmitry Kasatkin24e01982011-05-06 11:34:17 +0300153 iint->evm_status = INTEGRITY_UNKNOWN;
Mimi Zoharf381c272011-03-09 14:13:22 -0500154}
155
156static int __init integrity_iintcache_init(void)
157{
158 iint_cache =
159 kmem_cache_create("iint_cache", sizeof(struct integrity_iint_cache),
160 0, SLAB_PANIC, init_once);
161 iint_initialized = 1;
162 return 0;
163}
164security_initcall(integrity_iintcache_init);