ima_fs.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382
  1. /*
  2. * Copyright (C) 2005,2006,2007,2008 IBM Corporation
  3. *
  4. * Authors:
  5. * Kylene Hall <kjhall@us.ibm.com>
  6. * Reiner Sailer <sailer@us.ibm.com>
  7. * Mimi Zohar <zohar@us.ibm.com>
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License as
  11. * published by the Free Software Foundation, version 2 of the
  12. * License.
  13. *
  14. * File: ima_fs.c
  15. * implemenents security file system for reporting
  16. * current measurement list and IMA statistics
  17. */
  18. #include <linux/fcntl.h>
  19. #include <linux/slab.h>
  20. #include <linux/module.h>
  21. #include <linux/seq_file.h>
  22. #include <linux/rculist.h>
  23. #include <linux/rcupdate.h>
  24. #include <linux/parser.h>
  25. #include "ima.h"
  26. static int valid_policy = 1;
  27. #define TMPBUFLEN 12
  28. static ssize_t ima_show_htable_value(char __user *buf, size_t count,
  29. loff_t *ppos, atomic_long_t *val)
  30. {
  31. char tmpbuf[TMPBUFLEN];
  32. ssize_t len;
  33. len = scnprintf(tmpbuf, TMPBUFLEN, "%li\n", atomic_long_read(val));
  34. return simple_read_from_buffer(buf, count, ppos, tmpbuf, len);
  35. }
  36. static ssize_t ima_show_htable_violations(struct file *filp,
  37. char __user *buf,
  38. size_t count, loff_t *ppos)
  39. {
  40. return ima_show_htable_value(buf, count, ppos, &ima_htable.violations);
  41. }
  42. static const struct file_operations ima_htable_violations_ops = {
  43. .read = ima_show_htable_violations,
  44. .llseek = generic_file_llseek,
  45. };
  46. static ssize_t ima_show_measurements_count(struct file *filp,
  47. char __user *buf,
  48. size_t count, loff_t *ppos)
  49. {
  50. return ima_show_htable_value(buf, count, ppos, &ima_htable.len);
  51. }
  52. static const struct file_operations ima_measurements_count_ops = {
  53. .read = ima_show_measurements_count,
  54. .llseek = generic_file_llseek,
  55. };
  56. /* returns pointer to hlist_node */
  57. static void *ima_measurements_start(struct seq_file *m, loff_t *pos)
  58. {
  59. loff_t l = *pos;
  60. struct ima_queue_entry *qe;
  61. /* we need a lock since pos could point beyond last element */
  62. rcu_read_lock();
  63. list_for_each_entry_rcu(qe, &ima_measurements, later) {
  64. if (!l--) {
  65. rcu_read_unlock();
  66. return qe;
  67. }
  68. }
  69. rcu_read_unlock();
  70. return NULL;
  71. }
  72. static void *ima_measurements_next(struct seq_file *m, void *v, loff_t *pos)
  73. {
  74. struct ima_queue_entry *qe = v;
  75. /* lock protects when reading beyond last element
  76. * against concurrent list-extension
  77. */
  78. rcu_read_lock();
  79. qe = list_entry_rcu(qe->later.next, struct ima_queue_entry, later);
  80. rcu_read_unlock();
  81. (*pos)++;
  82. return (&qe->later == &ima_measurements) ? NULL : qe;
  83. }
  84. static void ima_measurements_stop(struct seq_file *m, void *v)
  85. {
  86. }
  87. void ima_putc(struct seq_file *m, void *data, int datalen)
  88. {
  89. while (datalen--)
  90. seq_putc(m, *(char *)data++);
  91. }
  92. /* print format:
  93. * 32bit-le=pcr#
  94. * char[20]=template digest
  95. * 32bit-le=template name size
  96. * char[n]=template name
  97. * [eventdata length]
  98. * eventdata[n]=template specific data
  99. */
  100. static int ima_measurements_show(struct seq_file *m, void *v)
  101. {
  102. /* the list never shrinks, so we don't need a lock here */
  103. struct ima_queue_entry *qe = v;
  104. struct ima_template_entry *e;
  105. int namelen;
  106. u32 pcr = CONFIG_IMA_MEASURE_PCR_IDX;
  107. bool is_ima_template = false;
  108. int i;
  109. /* get entry */
  110. e = qe->entry;
  111. if (e == NULL)
  112. return -1;
  113. /*
  114. * 1st: PCRIndex
  115. * PCR used is always the same (config option) in
  116. * little-endian format
  117. */
  118. ima_putc(m, &pcr, sizeof(pcr));
  119. /* 2nd: template digest */
  120. ima_putc(m, e->digest, TPM_DIGEST_SIZE);
  121. /* 3rd: template name size */
  122. namelen = strlen(e->template_desc->name);
  123. ima_putc(m, &namelen, sizeof(namelen));
  124. /* 4th: template name */
  125. ima_putc(m, e->template_desc->name, namelen);
  126. /* 5th: template length (except for 'ima' template) */
  127. if (strcmp(e->template_desc->name, IMA_TEMPLATE_IMA_NAME) == 0)
  128. is_ima_template = true;
  129. if (!is_ima_template)
  130. ima_putc(m, &e->template_data_len,
  131. sizeof(e->template_data_len));
  132. /* 6th: template specific data */
  133. for (i = 0; i < e->template_desc->num_fields; i++) {
  134. enum ima_show_type show = IMA_SHOW_BINARY;
  135. struct ima_template_field *field = e->template_desc->fields[i];
  136. if (is_ima_template && strcmp(field->field_id, "d") == 0)
  137. show = IMA_SHOW_BINARY_NO_FIELD_LEN;
  138. if (is_ima_template && strcmp(field->field_id, "n") == 0)
  139. show = IMA_SHOW_BINARY_OLD_STRING_FMT;
  140. field->field_show(m, show, &e->template_data[i]);
  141. }
  142. return 0;
  143. }
  144. static const struct seq_operations ima_measurments_seqops = {
  145. .start = ima_measurements_start,
  146. .next = ima_measurements_next,
  147. .stop = ima_measurements_stop,
  148. .show = ima_measurements_show
  149. };
  150. static int ima_measurements_open(struct inode *inode, struct file *file)
  151. {
  152. return seq_open(file, &ima_measurments_seqops);
  153. }
  154. static const struct file_operations ima_measurements_ops = {
  155. .open = ima_measurements_open,
  156. .read = seq_read,
  157. .llseek = seq_lseek,
  158. .release = seq_release,
  159. };
  160. void ima_print_digest(struct seq_file *m, u8 *digest, int size)
  161. {
  162. int i;
  163. for (i = 0; i < size; i++)
  164. seq_printf(m, "%02x", *(digest + i));
  165. }
  166. /* print in ascii */
  167. static int ima_ascii_measurements_show(struct seq_file *m, void *v)
  168. {
  169. /* the list never shrinks, so we don't need a lock here */
  170. struct ima_queue_entry *qe = v;
  171. struct ima_template_entry *e;
  172. int i;
  173. /* get entry */
  174. e = qe->entry;
  175. if (e == NULL)
  176. return -1;
  177. /* 1st: PCR used (config option) */
  178. seq_printf(m, "%2d ", CONFIG_IMA_MEASURE_PCR_IDX);
  179. /* 2nd: SHA1 template hash */
  180. ima_print_digest(m, e->digest, TPM_DIGEST_SIZE);
  181. /* 3th: template name */
  182. seq_printf(m, " %s", e->template_desc->name);
  183. /* 4th: template specific data */
  184. for (i = 0; i < e->template_desc->num_fields; i++) {
  185. seq_puts(m, " ");
  186. if (e->template_data[i].len == 0)
  187. continue;
  188. e->template_desc->fields[i]->field_show(m, IMA_SHOW_ASCII,
  189. &e->template_data[i]);
  190. }
  191. seq_puts(m, "\n");
  192. return 0;
  193. }
  194. static const struct seq_operations ima_ascii_measurements_seqops = {
  195. .start = ima_measurements_start,
  196. .next = ima_measurements_next,
  197. .stop = ima_measurements_stop,
  198. .show = ima_ascii_measurements_show
  199. };
  200. static int ima_ascii_measurements_open(struct inode *inode, struct file *file)
  201. {
  202. return seq_open(file, &ima_ascii_measurements_seqops);
  203. }
  204. static const struct file_operations ima_ascii_measurements_ops = {
  205. .open = ima_ascii_measurements_open,
  206. .read = seq_read,
  207. .llseek = seq_lseek,
  208. .release = seq_release,
  209. };
  210. static ssize_t ima_write_policy(struct file *file, const char __user *buf,
  211. size_t datalen, loff_t *ppos)
  212. {
  213. char *data = NULL;
  214. ssize_t result;
  215. if (datalen >= PAGE_SIZE)
  216. datalen = PAGE_SIZE - 1;
  217. /* No partial writes. */
  218. result = -EINVAL;
  219. if (*ppos != 0)
  220. goto out;
  221. result = -ENOMEM;
  222. data = kmalloc(datalen + 1, GFP_KERNEL);
  223. if (!data)
  224. goto out;
  225. *(data + datalen) = '\0';
  226. result = -EFAULT;
  227. if (copy_from_user(data, buf, datalen))
  228. goto out;
  229. result = ima_parse_add_rule(data);
  230. out:
  231. if (result < 0)
  232. valid_policy = 0;
  233. kfree(data);
  234. return result;
  235. }
  236. static struct dentry *ima_dir;
  237. static struct dentry *binary_runtime_measurements;
  238. static struct dentry *ascii_runtime_measurements;
  239. static struct dentry *runtime_measurements_count;
  240. static struct dentry *violations;
  241. static struct dentry *ima_policy;
  242. static atomic_t policy_opencount = ATOMIC_INIT(1);
  243. /*
  244. * ima_open_policy: sequentialize access to the policy file
  245. */
  246. static int ima_open_policy(struct inode *inode, struct file *filp)
  247. {
  248. /* No point in being allowed to open it if you aren't going to write */
  249. if (!(filp->f_flags & O_WRONLY))
  250. return -EACCES;
  251. if (atomic_dec_and_test(&policy_opencount))
  252. return 0;
  253. return -EBUSY;
  254. }
  255. /*
  256. * ima_release_policy - start using the new measure policy rules.
  257. *
  258. * Initially, ima_measure points to the default policy rules, now
  259. * point to the new policy rules, and remove the securityfs policy file,
  260. * assuming a valid policy.
  261. */
  262. static int ima_release_policy(struct inode *inode, struct file *file)
  263. {
  264. if (!valid_policy) {
  265. ima_delete_rules();
  266. valid_policy = 1;
  267. atomic_set(&policy_opencount, 1);
  268. return 0;
  269. }
  270. ima_update_policy();
  271. securityfs_remove(ima_policy);
  272. ima_policy = NULL;
  273. return 0;
  274. }
  275. static const struct file_operations ima_measure_policy_ops = {
  276. .open = ima_open_policy,
  277. .write = ima_write_policy,
  278. .release = ima_release_policy,
  279. .llseek = generic_file_llseek,
  280. };
  281. int __init ima_fs_init(void)
  282. {
  283. ima_dir = securityfs_create_dir("ima", NULL);
  284. if (IS_ERR(ima_dir))
  285. return -1;
  286. binary_runtime_measurements =
  287. securityfs_create_file("binary_runtime_measurements",
  288. S_IRUSR | S_IRGRP, ima_dir, NULL,
  289. &ima_measurements_ops);
  290. if (IS_ERR(binary_runtime_measurements))
  291. goto out;
  292. ascii_runtime_measurements =
  293. securityfs_create_file("ascii_runtime_measurements",
  294. S_IRUSR | S_IRGRP, ima_dir, NULL,
  295. &ima_ascii_measurements_ops);
  296. if (IS_ERR(ascii_runtime_measurements))
  297. goto out;
  298. runtime_measurements_count =
  299. securityfs_create_file("runtime_measurements_count",
  300. S_IRUSR | S_IRGRP, ima_dir, NULL,
  301. &ima_measurements_count_ops);
  302. if (IS_ERR(runtime_measurements_count))
  303. goto out;
  304. violations =
  305. securityfs_create_file("violations", S_IRUSR | S_IRGRP,
  306. ima_dir, NULL, &ima_htable_violations_ops);
  307. if (IS_ERR(violations))
  308. goto out;
  309. ima_policy = securityfs_create_file("policy",
  310. S_IWUSR,
  311. ima_dir, NULL,
  312. &ima_measure_policy_ops);
  313. if (IS_ERR(ima_policy))
  314. goto out;
  315. return 0;
  316. out:
  317. securityfs_remove(violations);
  318. securityfs_remove(runtime_measurements_count);
  319. securityfs_remove(ascii_runtime_measurements);
  320. securityfs_remove(binary_runtime_measurements);
  321. securityfs_remove(ima_dir);
  322. securityfs_remove(ima_policy);
  323. return -1;
  324. }