109 	struct ima_queue_entry *qe, *ret = NULL;  in ima_lookup_digest_entry()  local
117 	hlist_for_each_entry_rcu(qe, &htable[key], hnext) {  in ima_lookup_digest_entry()
118 		rc = memcmp(qe->entry->digests[ima_hash_algo_idx].digest,  in ima_lookup_digest_entry()
120 		if ((rc == 0) && (qe->entry->pcr == pcr)) {  in ima_lookup_digest_entry()
121 			ret = qe;  in ima_lookup_digest_entry()
170 	struct ima_queue_entry *qe;  in ima_add_digest_entry()  local
174 	qe = kmalloc_obj(*qe);  in ima_add_digest_entry()
175 	if (qe == NULL) {  in ima_add_digest_entry()
179 	qe->entry = entry;  in ima_add_digest_entry()
181 	INIT_LIST_HEAD(&qe->later);  in ima_add_digest_entry()
182 	list_add_tail_rcu(&qe->later, &ima_measurements);  in ima_add_digest_entry()
192 		hlist_add_head_rcu(&qe->hnext, &htable[key]);  in ima_add_digest_entry()
427 	struct ima_queue_entry *qe;  in ima_queue_delete_partial()  local
435 	list_for_each_entry_rcu(qe, &ima_measurements, later, true) {  in ima_queue_delete_partial()
436 		size_to_remove += get_binary_runtime_size(qe->entry);  in ima_queue_delete_partial()
454 	 * qe remains valid because ima_fs.c enforces single-writer exclusion.  in ima_queue_delete_partial()
457 			    &qe->later);  in ima_queue_delete_partial()
481 	struct ima_queue_entry *qe, *qe_tmp;  in ima_queue_delete()  local
484 	list_for_each_entry_safe(qe, qe_tmp, head, later) {  in ima_queue_delete()
492 		for (i = 0; i < qe->entry->template_desc->num_fields; i++) {  in ima_queue_delete()
493 			kfree(qe->entry->template_data[i].data);  in ima_queue_delete()
494 			qe->entry->template_data[i].data = NULL;  in ima_queue_delete()
495 			qe->entry->template_data[i].len = 0;  in ima_queue_delete()
498 		list_del(&qe->later);  in ima_queue_delete()
502 			kfree(qe->entry->digests);  in ima_queue_delete()
503 			kfree(qe->entry);  in ima_queue_delete()
504 			kfree(qe);  in ima_queue_delete()