2019-06-01 11:08:55 +03:00
// SPDX-License-Identifier: GPL-2.0-only
2009-02-04 17:06:58 +03:00
/*
* Copyright ( C ) 2005 , 2006 , 2007 , 2008 IBM Corporation
*
* Authors :
* Serge Hallyn < serue @ us . ibm . com >
* Reiner Sailer < sailer @ watson . ibm . com >
* Mimi Zohar < zohar @ us . ibm . com >
*
* File : ima_queue . c
* Implements queues that store template measurements and
* maintains aggregate over the stored measurements
* in the pre - configured TPM PCR ( if available ) .
* The measurement list is append - only . No entry is
* ever removed or changed during the boot - cycle .
*/
2014-02-25 01:59:56 +04:00
2009-02-04 17:06:58 +03:00
# include <linux/rculist.h>
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 11:04:11 +03:00
# include <linux/slab.h>
2009-02-04 17:06:58 +03:00
# include "ima.h"
2011-12-19 18:57:28 +04:00
# define AUDIT_CAUSE_LEN_MAX 32
2019-02-06 19:24:52 +03:00
/* pre-allocated array of tpm_digest structures to extend a PCR */
static struct tpm_digest * digests ;
2009-02-04 17:06:58 +03:00
LIST_HEAD ( ima_measurements ) ; /* list of all measurements */
2016-12-20 03:22:42 +03:00
# ifdef CONFIG_IMA_KEXEC
static unsigned long binary_runtime_size ;
# else
static unsigned long binary_runtime_size = ULONG_MAX ;
# endif
2009-02-04 17:06:58 +03:00
/* key: inode (before secure-hashing a file) */
struct ima_h_table ima_htable = {
. len = ATOMIC_LONG_INIT ( 0 ) ,
. violations = ATOMIC_LONG_INIT ( 0 ) ,
. queue [ 0 . . . IMA_MEASURE_HTABLE_SIZE - 1 ] = HLIST_HEAD_INIT
} ;
/* mutex protects atomicity of extending measurement list
* and extending the TPM PCR aggregate . Since tpm_extend can take
* long ( and the tpm driver uses a mutex ) , we can ' t use the spinlock .
*/
static DEFINE_MUTEX ( ima_extend_list_mutex ) ;
/* lookup up the digest value in the hash table, and return the entry */
2016-06-01 21:14:05 +03:00
static struct ima_queue_entry * ima_lookup_digest_entry ( u8 * digest_value ,
int pcr )
2009-02-04 17:06:58 +03:00
{
struct ima_queue_entry * qe , * ret = NULL ;
unsigned int key ;
int rc ;
key = ima_hash_key ( digest_value ) ;
rcu_read_lock ( ) ;
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 05:06:00 +04:00
hlist_for_each_entry_rcu ( qe , & ima_htable . queue [ key ] , hnext ) {
2020-03-25 13:54:24 +03:00
rc = memcmp ( qe - > entry - > digests [ ima_hash_algo_idx ] . digest ,
digest_value , hash_digest_size [ ima_hash_algo ] ) ;
2016-06-01 21:14:05 +03:00
if ( ( rc = = 0 ) & & ( qe - > entry - > pcr = = pcr ) ) {
2009-02-04 17:06:58 +03:00
ret = qe ;
break ;
}
}
rcu_read_unlock ( ) ;
return ret ;
}
2016-12-20 03:22:42 +03:00
/*
* Calculate the memory required for serializing a single
* binary_runtime_measurement list entry , which contains a
* couple of variable length fields ( e . g template name and data ) .
*/
static int get_binary_runtime_size ( struct ima_template_entry * entry )
{
int size = 0 ;
size + = sizeof ( u32 ) ; /* pcr */
2020-03-25 13:47:09 +03:00
size + = TPM_DIGEST_SIZE ;
2016-12-20 03:22:42 +03:00
size + = sizeof ( int ) ; /* template name size field */
2017-05-16 15:53:47 +03:00
size + = strlen ( entry - > template_desc - > name ) ;
2016-12-20 03:22:42 +03:00
size + = sizeof ( entry - > template_data_len ) ;
size + = entry - > template_data_len ;
return size ;
}
2009-02-04 17:06:58 +03:00
/* ima_add_template_entry helper function:
2016-12-20 03:22:38 +03:00
* - Add template entry to the measurement list and hash table , for
* all entries except those carried across kexec .
2009-02-04 17:06:58 +03:00
*
* ( Called with ima_extend_list_mutex held . )
*/
2016-12-20 03:22:38 +03:00
static int ima_add_digest_entry ( struct ima_template_entry * entry ,
bool update_htable )
2009-02-04 17:06:58 +03:00
{
struct ima_queue_entry * qe ;
unsigned int key ;
qe = kmalloc ( sizeof ( * qe ) , GFP_KERNEL ) ;
if ( qe = = NULL ) {
2014-02-25 01:59:56 +04:00
pr_err ( " OUT OF MEMORY ERROR creating queue entry \n " ) ;
2009-02-04 17:06:58 +03:00
return - ENOMEM ;
}
qe - > entry = entry ;
INIT_LIST_HEAD ( & qe - > later ) ;
list_add_tail_rcu ( & qe - > later , & ima_measurements ) ;
atomic_long_inc ( & ima_htable . len ) ;
2016-12-20 03:22:38 +03:00
if ( update_htable ) {
2020-03-25 13:54:24 +03:00
key = ima_hash_key ( entry - > digests [ ima_hash_algo_idx ] . digest ) ;
2016-12-20 03:22:38 +03:00
hlist_add_head_rcu ( & qe - > hnext , & ima_htable . queue [ key ] ) ;
}
2016-12-20 03:22:42 +03:00
if ( binary_runtime_size ! = ULONG_MAX ) {
int size ;
size = get_binary_runtime_size ( entry ) ;
binary_runtime_size = ( binary_runtime_size < ULONG_MAX - size ) ?
binary_runtime_size + size : ULONG_MAX ;
}
2009-02-04 17:06:58 +03:00
return 0 ;
}
2016-12-20 03:22:42 +03:00
/*
* Return the amount of memory required for serializing the
* entire binary_runtime_measurement list , including the ima_kexec_hdr
* structure .
*/
unsigned long ima_get_binary_runtime_size ( void )
{
if ( binary_runtime_size > = ( ULONG_MAX - sizeof ( struct ima_kexec_hdr ) ) )
return ULONG_MAX ;
else
return binary_runtime_size + sizeof ( struct ima_kexec_hdr ) ;
} ;
2020-03-25 13:53:50 +03:00
static int ima_pcr_extend ( struct tpm_digest * digests_arg , int pcr )
2009-02-04 17:06:58 +03:00
{
int result = 0 ;
2018-06-26 22:09:33 +03:00
if ( ! ima_tpm_chip )
2009-02-04 17:06:58 +03:00
return result ;
2020-03-25 13:53:50 +03:00
result = tpm_pcr_extend ( ima_tpm_chip , pcr , digests_arg ) ;
2009-02-04 17:06:58 +03:00
if ( result ! = 0 )
2014-02-25 01:59:56 +04:00
pr_err ( " Error Communicating to TPM chip, result: %d \n " , result ) ;
2009-02-04 17:06:58 +03:00
return result ;
}
2016-12-20 03:22:42 +03:00
/*
* Add template entry to the measurement list and hash table , and
* extend the pcr .
*
* On systems which support carrying the IMA measurement list across
* kexec , maintain the total memory size required for serializing the
* binary_runtime_measurements .
2009-02-04 17:06:58 +03:00
*/
int ima_add_template_entry ( struct ima_template_entry * entry , int violation ,
2013-06-07 14:16:27 +04:00
const char * op , struct inode * inode ,
const unsigned char * filename )
2009-02-04 17:06:58 +03:00
{
2020-03-25 13:54:24 +03:00
u8 * digest = entry - > digests [ ima_hash_algo_idx ] . digest ;
2020-03-25 13:53:50 +03:00
struct tpm_digest * digests_arg = entry - > digests ;
2009-02-04 17:06:58 +03:00
const char * audit_cause = " hash_added " ;
2011-12-19 18:57:28 +04:00
char tpm_audit_cause [ AUDIT_CAUSE_LEN_MAX ] ;
2009-02-04 17:06:58 +03:00
int audit_info = 1 ;
2011-12-19 18:57:28 +04:00
int result = 0 , tpmresult = 0 ;
2009-02-04 17:06:58 +03:00
mutex_lock ( & ima_extend_list_mutex ) ;
if ( ! violation ) {
2016-06-01 21:14:05 +03:00
if ( ima_lookup_digest_entry ( digest , entry - > pcr ) ) {
2009-02-04 17:06:58 +03:00
audit_cause = " hash_exists " ;
2011-12-19 18:57:27 +04:00
result = - EEXIST ;
2009-02-04 17:06:58 +03:00
goto out ;
}
}
2016-12-20 03:22:38 +03:00
result = ima_add_digest_entry ( entry , 1 ) ;
2009-02-04 17:06:58 +03:00
if ( result < 0 ) {
audit_cause = " ENOMEM " ;
audit_info = 0 ;
goto out ;
}
if ( violation ) /* invalidate pcr */
2020-03-25 13:53:50 +03:00
digests_arg = digests ;
2009-02-04 17:06:58 +03:00
2020-03-25 13:53:50 +03:00
tpmresult = ima_pcr_extend ( digests_arg , entry - > pcr ) ;
2011-12-19 18:57:28 +04:00
if ( tpmresult ! = 0 ) {
snprintf ( tpm_audit_cause , AUDIT_CAUSE_LEN_MAX , " TPM_error(%d) " ,
tpmresult ) ;
audit_cause = tpm_audit_cause ;
2009-02-04 17:06:58 +03:00
audit_info = 0 ;
}
out :
mutex_unlock ( & ima_extend_list_mutex ) ;
2013-06-07 14:16:27 +04:00
integrity_audit_msg ( AUDIT_INTEGRITY_PCR , inode , filename ,
2009-02-04 17:06:58 +03:00
op , audit_cause , result , audit_info ) ;
return result ;
}
2016-12-20 03:22:35 +03:00
int ima_restore_measurement_entry ( struct ima_template_entry * entry )
{
int result = 0 ;
mutex_lock ( & ima_extend_list_mutex ) ;
2016-12-20 03:22:38 +03:00
result = ima_add_digest_entry ( entry , 0 ) ;
2016-12-20 03:22:35 +03:00
mutex_unlock ( & ima_extend_list_mutex ) ;
return result ;
}
2019-02-06 19:24:52 +03:00
int __init ima_init_digests ( void )
{
2020-03-25 13:53:50 +03:00
u16 digest_size ;
u16 crypto_id ;
2019-02-06 19:24:52 +03:00
int i ;
if ( ! ima_tpm_chip )
return 0 ;
digests = kcalloc ( ima_tpm_chip - > nr_allocated_banks , sizeof ( * digests ) ,
GFP_NOFS ) ;
if ( ! digests )
return - ENOMEM ;
2020-03-25 13:53:50 +03:00
for ( i = 0 ; i < ima_tpm_chip - > nr_allocated_banks ; i + + ) {
2019-02-06 19:24:52 +03:00
digests [ i ] . alg_id = ima_tpm_chip - > allocated_banks [ i ] . alg_id ;
2020-03-25 13:53:50 +03:00
digest_size = ima_tpm_chip - > allocated_banks [ i ] . digest_size ;
crypto_id = ima_tpm_chip - > allocated_banks [ i ] . crypto_id ;
/* for unmapped TPM algorithms digest is still a padded SHA1 */
if ( crypto_id = = HASH_ALGO__LAST )
digest_size = SHA1_DIGEST_SIZE ;
memset ( digests [ i ] . digest , 0xff , digest_size ) ;
}
2019-02-06 19:24:52 +03:00
return 0 ;
}