blob: 3ccf7acac6df88c01e80a509d6a129f88953acd1 [file] [log] [blame]
Mimi Zohar3323eec2009-02-04 09:06:58 -05001/*
2 * Copyright (C) 2005,2006,2007,2008 IBM Corporation
3 *
4 * Authors:
5 * Reiner Sailer <sailer@watson.ibm.com>
6 * Mimi Zohar <zohar@us.ibm.com>
7 *
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation, version 2 of the
11 * License.
12 *
13 * File: ima.h
14 * internal Integrity Measurement Architecture (IMA) definitions
15 */
16
17#ifndef __LINUX_IMA_H
18#define __LINUX_IMA_H
19
20#include <linux/types.h>
21#include <linux/crypto.h>
22#include <linux/security.h>
23#include <linux/hash.h>
24#include <linux/tpm.h>
25#include <linux/audit.h>
26
Mimi Zoharf381c272011-03-09 14:13:22 -050027#include "../integrity.h"
28
Mimi Zohar3323eec2009-02-04 09:06:58 -050029enum ima_show_type { IMA_SHOW_BINARY, IMA_SHOW_ASCII };
30enum tpm_pcrs { TPM_PCR0 = 0, TPM_PCR8 = 8 };
31
32/* digest size for IMA, fits SHA1 or MD5 */
Mimi Zoharf381c272011-03-09 14:13:22 -050033#define IMA_DIGEST_SIZE SHA1_DIGEST_SIZE
Mimi Zohar3323eec2009-02-04 09:06:58 -050034#define IMA_EVENT_NAME_LEN_MAX 255
35
36#define IMA_HASH_BITS 9
37#define IMA_MEASURE_HTABLE_SIZE (1 << IMA_HASH_BITS)
38
39/* set during initialization */
40extern int ima_initialized;
41extern int ima_used_chip;
42extern char *ima_hash;
43
44/* IMA inode template definition */
45struct ima_template_data {
46 u8 digest[IMA_DIGEST_SIZE]; /* sha1/md5 measurement hash */
47 char file_name[IMA_EVENT_NAME_LEN_MAX + 1]; /* name + \0 */
48};
49
50struct ima_template_entry {
51 u8 digest[IMA_DIGEST_SIZE]; /* sha1 or md5 measurement hash */
Mimi Zohar523979a2009-02-11 11:12:28 -050052 const char *template_name;
Mimi Zohar3323eec2009-02-04 09:06:58 -050053 int template_len;
54 struct ima_template_data template;
55};
56
57struct ima_queue_entry {
58 struct hlist_node hnext; /* place in hash collision list */
59 struct list_head later; /* place in ima_measurements list */
60 struct ima_template_entry *entry;
61};
62extern struct list_head ima_measurements; /* list of all measurements */
63
64/* declarations */
65void integrity_audit_msg(int audit_msgno, struct inode *inode,
66 const unsigned char *fname, const char *op,
67 const char *cause, int result, int info);
68
69/* Internal IMA function definitions */
Mimi Zohar3323eec2009-02-04 09:06:58 -050070int ima_init(void);
Mimi Zoharbab73932009-02-04 09:06:59 -050071void ima_cleanup(void);
72int ima_fs_init(void);
73void ima_fs_cleanup(void);
Eric Parisa178d202010-10-25 14:41:59 -040074int ima_inode_alloc(struct inode *inode);
Mimi Zohar3323eec2009-02-04 09:06:58 -050075int ima_add_template_entry(struct ima_template_entry *entry, int violation,
76 const char *op, struct inode *inode);
77int ima_calc_hash(struct file *file, char *digest);
78int ima_calc_template_hash(int template_len, void *template, char *digest);
79int ima_calc_boot_aggregate(char *digest);
80void ima_add_violation(struct inode *inode, const unsigned char *filename,
81 const char *op, const char *cause);
82
83/*
84 * used to protect h_table and sha_table
85 */
86extern spinlock_t ima_queue_lock;
87
88struct ima_h_table {
89 atomic_long_t len; /* number of stored measurements in the list */
90 atomic_long_t violations;
91 struct hlist_head queue[IMA_MEASURE_HTABLE_SIZE];
92};
93extern struct ima_h_table ima_htable;
94
95static inline unsigned long ima_hash_key(u8 *digest)
96{
97 return hash_long(*digest, IMA_HASH_BITS);
98}
99
Mimi Zohar3323eec2009-02-04 09:06:58 -0500100/* LIM API function definitions */
Mimi Zohar1adace92011-02-22 10:19:43 -0500101int ima_must_measure(struct inode *inode, int mask, int function);
Mimi Zoharf381c272011-03-09 14:13:22 -0500102int ima_collect_measurement(struct integrity_iint_cache *iint,
103 struct file *file);
104void ima_store_measurement(struct integrity_iint_cache *iint, struct file *file,
Mimi Zohar3323eec2009-02-04 09:06:58 -0500105 const unsigned char *filename);
106int ima_store_template(struct ima_template_entry *entry, int violation,
107 struct inode *inode);
Mimi Zoharf381c272011-03-09 14:13:22 -0500108void ima_template_show(struct seq_file *m, void *e, enum ima_show_type show);
Mimi Zohar3323eec2009-02-04 09:06:58 -0500109
Eric Paris85491642010-10-25 14:41:18 -0400110/* rbtree tree calls to lookup, insert, delete
Mimi Zohar3323eec2009-02-04 09:06:58 -0500111 * integrity data associated with an inode.
112 */
Mimi Zoharf381c272011-03-09 14:13:22 -0500113struct integrity_iint_cache *integrity_iint_insert(struct inode *inode);
114struct integrity_iint_cache *integrity_iint_find(struct inode *inode);
Mimi Zohar3323eec2009-02-04 09:06:58 -0500115
116/* IMA policy related functions */
Mimi Zohar1e93d002010-01-26 17:02:41 -0500117enum ima_hooks { FILE_CHECK = 1, FILE_MMAP, BPRM_CHECK };
Mimi Zohar3323eec2009-02-04 09:06:58 -0500118
119int ima_match_policy(struct inode *inode, enum ima_hooks func, int mask);
120void ima_init_policy(void);
121void ima_update_policy(void);
Eric Paris6ccd0452010-04-20 10:20:54 -0400122ssize_t ima_parse_add_rule(char *);
Mimi Zohar4af46622009-02-04 09:07:00 -0500123void ima_delete_rules(void);
124
125/* LSM based policy rules require audit */
126#ifdef CONFIG_IMA_LSM_RULES
127
128#define security_filter_rule_init security_audit_rule_init
129#define security_filter_rule_match security_audit_rule_match
130
131#else
132
133static inline int security_filter_rule_init(u32 field, u32 op, char *rulestr,
134 void **lsmrule)
135{
136 return -EINVAL;
137}
138
139static inline int security_filter_rule_match(u32 secid, u32 field, u32 op,
140 void *lsmrule,
141 struct audit_context *actx)
142{
143 return -EINVAL;
144}
145#endif /* CONFIG_IMA_LSM_RULES */
Mimi Zohar3323eec2009-02-04 09:06:58 -0500146#endif