1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
// SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
/* Copyright 2019 IBM Corp. */
#ifndef pr_fmt
#define pr_fmt(fmt) "SECVAR: " fmt
#endif
#include <stdlib.h>
#include <string.h>
#include <skiboot.h>
#include <opal.h>
#include "secvar.h"
void clear_bank_list(struct list_head *bank)
{
struct secvar_node *node, *next;
if (!bank)
return;
list_for_each_safe(bank, node, next, link) {
list_del(&node->link);
dealloc_secvar(node);
}
}
int copy_bank_list(struct list_head *dst, struct list_head *src)
{
struct secvar_node *node, *tmp;
list_for_each(src, node, link) {
/* Allocate new secvar using actual data size */
tmp = alloc_secvar(node->var->data_size);
if (!tmp)
return OPAL_NO_MEM;
/* Copy over flags metadata */
tmp->flags = node->flags;
/* Full-clone over the secvar struct */
memcpy(tmp->var, node->var, tmp->size + sizeof(struct secvar));
/* Append to new list */
list_add_tail(dst, &tmp->link);
}
return OPAL_SUCCESS;
}
struct secvar_node *alloc_secvar(uint64_t size)
{
struct secvar_node *ret;
ret = zalloc(sizeof(struct secvar_node));
if (!ret)
return NULL;
ret->var = zalloc(sizeof(struct secvar) + size);
if (!ret->var) {
free(ret);
return NULL;
}
ret->size = size;
return ret;
}
struct secvar_node *new_secvar(const char *key, uint64_t key_len,
const char *data, uint64_t data_size,
uint64_t flags)
{
struct secvar_node *ret;
if (!key)
return NULL;
if ((!key_len) || (key_len > SECVAR_MAX_KEY_LEN))
return NULL;
if ((!data) && (data_size))
return NULL;
ret = alloc_secvar(data_size);
if (!ret)
return NULL;
ret->var->key_len = key_len;
ret->var->data_size = data_size;
memcpy(ret->var->key, key, key_len);
ret->flags = flags;
if (data)
memcpy(ret->var->data, data, data_size);
return ret;
}
int realloc_secvar(struct secvar_node *node, uint64_t size)
{
void *tmp;
if (node->size >= size)
return 0;
tmp = zalloc(sizeof(struct secvar) + size);
if (!tmp)
return -1;
memcpy(tmp, node->var, sizeof(struct secvar) + node->size);
free(node->var);
node->var = tmp;
return 0;
}
void dealloc_secvar(struct secvar_node *node)
{
if (!node)
return;
free(node->var);
free(node);
}
struct secvar_node *find_secvar(const char *key, uint64_t key_len, struct list_head *bank)
{
struct secvar_node *node = NULL;
list_for_each(bank, node, link) {
// Prevent matching shorter key subsets / bail early
if (key_len != node->var->key_len)
continue;
if (!memcmp(key, node->var->key, key_len))
return node;
}
return NULL;
}
int is_key_empty(const char *key, uint64_t key_len)
{
int i;
for (i = 0; i < key_len; i++) {
if (key[i] != 0)
return 0;
}
return 1;
}
int list_length(struct list_head *bank)
{
int ret = 0;
struct secvar_node *node;
list_for_each(bank, node, link)
ret++;
return ret;
}
|
