blob: e4cb45b4add2b24915b9c023a68e8d9a53b50afa [file] [log] [blame]
Gilles Peskine029b5d62018-07-16 23:13:37 +02001#!/usr/bin/env python
2import os
3import re
4import sys
5
6output_template = '''\
7/* Automatically generated by generate_psa_constant.py. DO NOT EDIT. */
8
9static const char *psa_strerror(psa_status_t status)
10{
11 switch (status) {
12 %(status_cases)s
13 default: return NULL;
14 }
15}
16
17static const char *psa_ecc_curve_name(psa_ecc_curve_t curve)
18{
19 switch (curve) {
20 %(ecc_curve_cases)s
21 default: return NULL;
22 }
23}
24
25static const char *psa_hash_algorithm_name(psa_algorithm_t hash_alg)
26{
27 switch (hash_alg) {
28 %(hash_algorithm_cases)s
29 default: return NULL;
30 }
31}
32
33static int psa_snprint_key_type(char *buffer, size_t buffer_size,
34 psa_key_type_t type)
35{
36 size_t required_size = 0;
37 switch (type) {
38 %(key_type_cases)s
39 default:
40 %(key_type_code)s{
41 return snprintf(buffer, buffer_size,
42 "0x%%08lx", (unsigned long) type);
43 }
44 break;
45 }
46 buffer[0] = 0;
47 return required_size;
48}
49
50static void append_padding_mode(char **buffer, size_t buffer_size,
51 size_t *required_size,
52 psa_algorithm_t padding_mode)
53{
54 size_t n;
55 append(buffer, buffer_size, required_size, " | ", 3);
56 switch (padding_mode) {
57 %(padding_mode_cases)s
58 default:
59 n = snprintf(*buffer, buffer_size - *required_size,
60 "0x%%08lx", (unsigned long) padding_mode);
61 if (n < buffer_size - *required_size) *buffer += n;
62 *required_size += n;
63 break;
64 }
65}
66
67static int psa_snprint_algorithm(char *buffer, size_t buffer_size,
68 psa_algorithm_t alg)
69{
70 size_t required_size = 0;
71 psa_algorithm_t padding_mode = -1;
72 psa_algorithm_t alg_without_padding = alg;
73 if (PSA_ALG_IS_CIPHER(alg) && PSA_ALG_IS_BLOCK_CIPHER(alg)) {
74 padding_mode = alg & PSA_ALG_BLOCK_CIPHER_PADDING_MASK;
75 alg_without_padding = alg & ~PSA_ALG_BLOCK_CIPHER_PADDING_MASK;
76 }
77 switch (alg_without_padding) {
78 %(algorithm_cases)s
79 default:
80 %(algorithm_code)s{
81 return snprintf(buffer, buffer_size,
82 "0x%%08lx", (unsigned long) alg);
83 }
84 break;
85 }
86 if (padding_mode != (psa_algorithm_t) -1) {
87 append_padding_mode(&buffer, buffer_size, &required_size, padding_mode);
88 }
89 buffer[0] = 0;
90 return required_size;
91}
92
93static int psa_snprint_key_usage(char *buffer, size_t buffer_size,
94 psa_key_usage_t usage)
95{
96 size_t required_size = 0;
97 if (usage == 0) {
98 if (buffer_size > 1) {
99 buffer[0] = '0';
100 buffer[1] = 0;
101 } else if (buffer_size == 1) {
102 buffer[0] = 0;
103 }
104 return 1;
105 }
106%(key_usage_code)s
107 if (usage != 0) {
108 if (required_size != 0) {
109 append(&buffer, buffer_size, &required_size, " | ", 3);
110 }
111 required_size += snprintf(buffer, buffer_size - required_size,
112 "0x%%08x", usage);
113 } else {
114 buffer[0] = 0;
115 }
116 return required_size;
117}
118
119/* End of automatically generated file. */
120'''
121
122key_type_from_curve_template = '''if (%(tester)s(type)) {
123 append_with_curve(&buffer, buffer_size, &required_size,
124 "%(builder)s", %(builder_length)s,
125 PSA_KEY_TYPE_GET_CURVE(type));
126 } else '''
127
128algorithm_from_hash_template = '''if (%(tester)s(alg_without_padding)) {
129 append_with_hash(&buffer, buffer_size, &required_size,
130 "%(builder)s", %(builder_length)s,
131 PSA_ALG_GET_HASH(alg_without_padding));
132 } else '''
133
134bit_test_template = '''\
135 if (%(var)s & %(flag)s) {
136 if (required_size != 0) {
137 append(&buffer, buffer_size, &required_size, " | ", 3);
138 }
139 append(&buffer, buffer_size, &required_size, "%(flag)s", %(length)d);
140 %(var)s ^= %(flag)s;
141 }\
142'''
143
144class MacroCollector:
145 def __init__(self):
146 self.statuses = set()
147 self.key_types = set()
148 self.key_types_from_curve = {}
149 self.ecc_curves = set()
150 self.algorithms = set()
151 self.hash_algorithms = set()
152 self.block_cipher_padding_modes = set()
153 self.algorithms_from_hash = {}
154 self.key_usages = set()
155
156 # "#define" followed by a macro name with either no parameters
157 # or a single parameter. Grab the macro name in group 1, the
158 # parameter name if any in group 2 and the definition in group 3.
159 definition_re = re.compile(r'\s*#\s*define\s+(\w+)(?:\s+|\((\w+)\)\s*)(.+)(?:/[*/])?')
160
161 def read_line(self, line):
162 m = re.match(self.definition_re, line)
163 if not m:
164 return
165 name, parameter, definition = m.groups()
166 if name.endswith('_FLAG') or name.endswith('MASK'):
167 # Macro only to build actual values
168 return
169 elif (name.startswith('PSA_ERROR_') or name == 'PSA_SUCCESS') \
170 and not parameter:
171 self.statuses.add(name)
172 elif name.startswith('PSA_KEY_TYPE_') and not parameter:
173 self.key_types.add(name)
174 elif name.startswith('PSA_KEY_TYPE_') and parameter == 'curve':
175 self.key_types_from_curve[name] = name[:13] + 'IS_' + name[13:]
176 elif name.startswith('PSA_ECC_CURVE_') and not parameter:
177 self.ecc_curves.add(name)
178 elif name.startswith('PSA_ALG_BLOCK_CIPHER_PAD_') and not parameter:
179 self.block_cipher_padding_modes.add(name)
180 elif name.startswith('PSA_ALG_') and not parameter:
181 if name in ['PSA_ALG_BLOCK_CIPHER_BASE',
182 'PSA_ALG_ECDSA_BASE',
183 'PSA_ALG_RSA_PKCS1V15_SIGN_BASE']:
184 # Ad hoc skipping of duplicate names for some numerical values
185 return
186 self.algorithms.add(name)
187 # Ad hoc detection of hash algorithms
188 if re.search(r'0x010000[0-9A-Fa-f]{2}', definition):
189 self.hash_algorithms.add(name)
190 elif name.startswith('PSA_ALG_') and parameter == 'hash_alg':
191 if name in ['PSA_ALG_DSA', 'PSA_ALG_ECDSA']:
192 # A naming irregularity
193 tester = name[:8] + 'IS_RANDOMIZED_' + name[8:]
194 else:
195 tester = name[:8] + 'IS_' + name[8:]
196 self.algorithms_from_hash[name] = tester
197 elif name.startswith('PSA_KEY_USAGE_') and not parameter:
198 self.key_usages.add(name)
199 else:
200 # Other macro without parameter
201 return
202
203 def read_file(self, header_file):
204 for line in header_file:
205 self.read_line(line)
206
207 def make_return_case(self, name):
208 return 'case %(name)s: return "%(name)s";' % {'name': name}
209
210 def make_append_case(self, name):
211 template = ('case %(name)s: '
212 'append(&buffer, buffer_size, &required_size, "%(name)s", %(length)d); '
213 'break;')
214 return template % {'name': name, 'length': len(name)}
215
216 def make_inner_append_case(self, name):
217 template = ('case %(name)s: '
218 'append(buffer, buffer_size, required_size, "%(name)s", %(length)d); '
219 'break;')
220 return template % {'name': name, 'length': len(name)}
221
222 def make_bit_test(self, var, flag):
223 return bit_test_template % {'var': var,
224 'flag': flag,
225 'length': len(flag)}
226
227 def make_status_cases(self):
228 return '\n '.join(map(self.make_return_case,
229 sorted(self.statuses)))
230
231 def make_ecc_curve_cases(self):
232 return '\n '.join(map(self.make_return_case,
233 sorted(self.ecc_curves)))
234
235 def make_key_type_cases(self):
236 return '\n '.join(map(self.make_append_case,
237 sorted(self.key_types)))
238
239 def make_key_type_from_curve_code(self, builder, tester):
240 return key_type_from_curve_template % {'builder': builder,
241 'builder_length': len(builder),
242 'tester': tester}
243
244 def make_key_type_code(self):
245 d = self.key_types_from_curve
246 make = self.make_key_type_from_curve_code
247 return '\n '.join([make(k, d[k]) for k in sorted(d.keys())])
248
249 def make_hash_algorithm_cases(self):
250 return '\n '.join(map(self.make_return_case,
251 sorted(self.hash_algorithms)))
252
253 def make_padding_mode_cases(self):
254 return '\n '.join(map(self.make_inner_append_case,
255 sorted(self.block_cipher_padding_modes)))
256
257 def make_algorithm_cases(self):
258 return '\n '.join(map(self.make_append_case,
259 sorted(self.algorithms)))
260
261 def make_algorithm_from_hash_code(self, builder, tester):
262 return algorithm_from_hash_template % {'builder': builder,
263 'builder_length': len(builder),
264 'tester': tester}
265
266 def make_algorithm_code(self):
267 d = self.algorithms_from_hash
268 make = self.make_algorithm_from_hash_code
269 return '\n '.join([make(k, d[k]) for k in sorted(d.keys())])
270
271 def make_key_usage_code(self):
272 return '\n'.join([self.make_bit_test('usage', bit)
273 for bit in sorted(self.key_usages)])
274
275 def write_file(self, output_file):
276 data = {}
277 data['status_cases'] = self.make_status_cases()
278 data['ecc_curve_cases'] = self.make_ecc_curve_cases()
279 data['key_type_cases'] = self.make_key_type_cases()
280 data['key_type_code'] = self.make_key_type_code()
281 data['hash_algorithm_cases'] = self.make_hash_algorithm_cases()
282 data['padding_mode_cases'] = self.make_padding_mode_cases()
283 data['algorithm_cases'] = self.make_algorithm_cases()
284 data['algorithm_code'] = self.make_algorithm_code()
285 data['key_usage_code'] = self.make_key_usage_code()
286 output_file.write(output_template % data)
287
288def generate_psa_constants(header_file_name, output_file_name):
289 collector = MacroCollector()
290 with open(header_file_name) as header_file:
291 collector.read_file(header_file)
292 temp_file_name = output_file_name + '.tmp'
293 with open(temp_file_name, 'w') as output_file:
294 collector.write_file(output_file)
295 os.rename(temp_file_name, output_file_name)
296
297if __name__ == '__main__':
298 if not os.path.isdir('programs') and os.path.isdir('../programs'):
299 os.chdir('..')
300 generate_psa_constants('include/psa/crypto.h',
301 'programs/psa/psa_constant_names_generated.c')