ima_queue.c 3.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150
  1. /*
  2. * Copyright (C) 2005,2006,2007,2008 IBM Corporation
  3. *
  4. * Authors:
  5. * Serge Hallyn <serue@us.ibm.com>
  6. * Reiner Sailer <sailer@watson.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_queue.c
  15. * Implements queues that store template measurements and
  16. * maintains aggregate over the stored measurements
  17. * in the pre-configured TPM PCR (if available).
  18. * The measurement list is append-only. No entry is
  19. * ever removed or changed during the boot-cycle.
  20. */
  21. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  22. #include <linux/module.h>
  23. #include <linux/rculist.h>
  24. #include <linux/slab.h>
  25. #include "ima.h"
  26. #define AUDIT_CAUSE_LEN_MAX 32
  27. LIST_HEAD(ima_measurements); /* list of all measurements */
  28. /* key: inode (before secure-hashing a file) */
  29. struct ima_h_table ima_htable = {
  30. .len = ATOMIC_LONG_INIT(0),
  31. .violations = ATOMIC_LONG_INIT(0),
  32. .queue[0 ... IMA_MEASURE_HTABLE_SIZE - 1] = HLIST_HEAD_INIT
  33. };
  34. /* mutex protects atomicity of extending measurement list
  35. * and extending the TPM PCR aggregate. Since tpm_extend can take
  36. * long (and the tpm driver uses a mutex), we can't use the spinlock.
  37. */
  38. static DEFINE_MUTEX(ima_extend_list_mutex);
  39. /* lookup up the digest value in the hash table, and return the entry */
  40. static struct ima_queue_entry *ima_lookup_digest_entry(u8 *digest_value)
  41. {
  42. struct ima_queue_entry *qe, *ret = NULL;
  43. unsigned int key;
  44. int rc;
  45. key = ima_hash_key(digest_value);
  46. rcu_read_lock();
  47. hlist_for_each_entry_rcu(qe, &ima_htable.queue[key], hnext) {
  48. rc = memcmp(qe->entry->digest, digest_value, TPM_DIGEST_SIZE);
  49. if (rc == 0) {
  50. ret = qe;
  51. break;
  52. }
  53. }
  54. rcu_read_unlock();
  55. return ret;
  56. }
  57. /* ima_add_template_entry helper function:
  58. * - Add template entry to measurement list and hash table.
  59. *
  60. * (Called with ima_extend_list_mutex held.)
  61. */
  62. static int ima_add_digest_entry(struct ima_template_entry *entry)
  63. {
  64. struct ima_queue_entry *qe;
  65. unsigned int key;
  66. qe = kmalloc(sizeof(*qe), GFP_KERNEL);
  67. if (qe == NULL) {
  68. pr_err("OUT OF MEMORY ERROR creating queue entry\n");
  69. return -ENOMEM;
  70. }
  71. qe->entry = entry;
  72. INIT_LIST_HEAD(&qe->later);
  73. list_add_tail_rcu(&qe->later, &ima_measurements);
  74. atomic_long_inc(&ima_htable.len);
  75. key = ima_hash_key(entry->digest);
  76. hlist_add_head_rcu(&qe->hnext, &ima_htable.queue[key]);
  77. return 0;
  78. }
  79. static int ima_pcr_extend(const u8 *hash)
  80. {
  81. int result = 0;
  82. if (!ima_used_chip)
  83. return result;
  84. result = tpm_pcr_extend(TPM_ANY_NUM, CONFIG_IMA_MEASURE_PCR_IDX, hash);
  85. if (result != 0)
  86. pr_err("Error Communicating to TPM chip, result: %d\n", result);
  87. return result;
  88. }
  89. /* Add template entry to the measurement list and hash table,
  90. * and extend the pcr.
  91. */
  92. int ima_add_template_entry(struct ima_template_entry *entry, int violation,
  93. const char *op, struct inode *inode,
  94. const unsigned char *filename)
  95. {
  96. u8 digest[TPM_DIGEST_SIZE];
  97. const char *audit_cause = "hash_added";
  98. char tpm_audit_cause[AUDIT_CAUSE_LEN_MAX];
  99. int audit_info = 1;
  100. int result = 0, tpmresult = 0;
  101. mutex_lock(&ima_extend_list_mutex);
  102. if (!violation) {
  103. memcpy(digest, entry->digest, sizeof(digest));
  104. if (ima_lookup_digest_entry(digest)) {
  105. audit_cause = "hash_exists";
  106. result = -EEXIST;
  107. goto out;
  108. }
  109. }
  110. result = ima_add_digest_entry(entry);
  111. if (result < 0) {
  112. audit_cause = "ENOMEM";
  113. audit_info = 0;
  114. goto out;
  115. }
  116. if (violation) /* invalidate pcr */
  117. memset(digest, 0xff, sizeof(digest));
  118. tpmresult = ima_pcr_extend(digest);
  119. if (tpmresult != 0) {
  120. snprintf(tpm_audit_cause, AUDIT_CAUSE_LEN_MAX, "TPM_error(%d)",
  121. tpmresult);
  122. audit_cause = tpm_audit_cause;
  123. audit_info = 0;
  124. }
  125. out:
  126. mutex_unlock(&ima_extend_list_mutex);
  127. integrity_audit_msg(AUDIT_INTEGRITY_PCR, inode, filename,
  128. op, audit_cause, result, audit_info);
  129. return result;
  130. }