xref: /OK3568_Linux_fs/kernel/drivers/gpu/arm/midgard/tests/kutf/kutf_resultset.c (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1 /*
2  *
3  * (C) COPYRIGHT 2014, 2017 ARM Limited. All rights reserved.
4  *
5  * This program is free software and is provided to you under the terms of the
6  * GNU General Public License version 2 as published by the Free Software
7  * Foundation, and any use by you of this program is subject to the terms
8  * of such GNU licence.
9  *
10  * A copy of the licence is included with the program, and can also be obtained
11  * from Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
12  * Boston, MA  02110-1301, USA.
13  *
14  */
15 
16 
17 
18 /* Kernel UTF result management functions */
19 
20 #include <linux/list.h>
21 #include <linux/slab.h>
22 #include <linux/printk.h>
23 
24 #include <kutf/kutf_resultset.h>
25 
26 /**
27  * struct kutf_result_set - Represents a set of results.
28  * @results:	Pointer to the linked list where the results are stored.
29  */
30 struct kutf_result_set {
31 	struct list_head          results;
32 };
33 
kutf_create_result_set(void)34 struct kutf_result_set *kutf_create_result_set(void)
35 {
36 	struct kutf_result_set *set;
37 
38 	set = kmalloc(sizeof(*set), GFP_KERNEL);
39 	if (!set) {
40 		pr_err("Failed to allocate resultset");
41 		goto fail_alloc;
42 	}
43 
44 	INIT_LIST_HEAD(&set->results);
45 
46 	return set;
47 
48 fail_alloc:
49 	return NULL;
50 }
51 
kutf_add_result(struct kutf_mempool * mempool,struct kutf_result_set * set,enum kutf_result_status status,const char * message)52 void kutf_add_result(struct kutf_mempool *mempool,
53 		struct kutf_result_set *set,
54 		enum kutf_result_status status,
55 		const char *message)
56 {
57 	/* Create the new result */
58 	struct kutf_result *new_result;
59 
60 	BUG_ON(set == NULL);
61 
62 	new_result = kutf_mempool_alloc(mempool, sizeof(*new_result));
63 	if (!new_result) {
64 		pr_err("Result allocation failed\n");
65 		return;
66 	}
67 
68 	INIT_LIST_HEAD(&new_result->node);
69 	new_result->status = status;
70 	new_result->message = message;
71 
72 	list_add_tail(&new_result->node, &set->results);
73 }
74 
kutf_destroy_result_set(struct kutf_result_set * set)75 void kutf_destroy_result_set(struct kutf_result_set *set)
76 {
77 	if (!list_empty(&set->results))
78 		pr_err("kutf_destroy_result_set: Unread results from test\n");
79 
80 	kfree(set);
81 }
82 
kutf_remove_result(struct kutf_result_set * set)83 struct kutf_result *kutf_remove_result(struct kutf_result_set *set)
84 {
85 	if (!list_empty(&set->results)) {
86 		struct kutf_result *ret;
87 
88 		ret = list_first_entry(&set->results, struct kutf_result, node);
89 		list_del(&ret->node);
90 		return ret;
91 	}
92 
93 	return NULL;
94 }
95 
96