blob: 73692d0228395aa1518e1292a39f3607b2fd03b8 [file] [log] [blame]
Gilles Peskine3f775262019-02-13 18:42:06 +01001#include <errno.h>
2#include <stdint.h>
Gilles Peskine029b5d62018-07-16 23:13:37 +02003#include <stdio.h>
4#include <stdlib.h>
5#include <string.h>
6
7#include "psa/crypto.h"
8
Darryl Green608e0912018-10-17 14:48:27 +01009/* This block is present to support Visual Studio builds prior to 2015 */
10#if defined(_MSC_VER) && _MSC_VER < 1900
11#include <stdarg.h>
12int snprintf( char *s, size_t n, const char *fmt, ... )
13{
14 int ret;
15 va_list argp;
16
17 /* Avoid calling the invalid parameter handler by checking ourselves */
18 if( s == NULL || n == 0 || fmt == NULL )
19 return( -1 );
20
21 va_start( argp, fmt );
22#if defined(_TRUNCATE) && !defined(__MINGW32__)
23 ret = _vsnprintf_s( s, n, _TRUNCATE, fmt, argp );
24#else
25 ret = _vsnprintf( s, n, fmt, argp );
26 if( ret < 0 || (size_t) ret == n )
27 {
28 s[n-1] = '\0';
29 ret = -1;
30 }
31#endif
32 va_end( argp );
33
34 return( ret );
35}
36#endif
37
Gilles Peskine029b5d62018-07-16 23:13:37 +020038/* There are different GET_HASH macros for different kinds of algorithms
39 * built from hashes, but the values are all constructed on the
40 * same model. */
41#define PSA_ALG_GET_HASH(alg) \
42 (((alg) & PSA_ALG_HASH_MASK) | PSA_ALG_CATEGORY_HASH)
43
44static void append(char **buffer, size_t buffer_size,
45 size_t *required_size,
46 const char *string, size_t length)
47{
48 *required_size += length;
49 if (*required_size < buffer_size) {
50 memcpy(*buffer, string, length);
51 *buffer += length;
52 }
53}
54
Gilles Peskine0deaf3d2018-08-20 15:06:39 +020055static void append_integer(char **buffer, size_t buffer_size,
56 size_t *required_size,
57 const char *format /*printf format for value*/,
58 unsigned long value)
59{
60 size_t n = snprintf(*buffer, buffer_size - *required_size, format, value);
61 if (n < buffer_size - *required_size) *buffer += n;
62 *required_size += n;
63}
64
Gilles Peskine029b5d62018-07-16 23:13:37 +020065/* The code of these function is automatically generated and included below. */
66static const char *psa_ecc_curve_name(psa_ecc_curve_t curve);
Gilles Peskinedcaefae2019-05-16 12:55:35 +020067static const char *psa_dh_group_name(psa_dh_group_t group);
Gilles Peskine029b5d62018-07-16 23:13:37 +020068static const char *psa_hash_algorithm_name(psa_algorithm_t hash_alg);
69
70static void append_with_curve(char **buffer, size_t buffer_size,
71 size_t *required_size,
72 const char *string, size_t length,
73 psa_ecc_curve_t curve)
74{
75 const char *curve_name = psa_ecc_curve_name(curve);
76 append(buffer, buffer_size, required_size, string, length);
77 append(buffer, buffer_size, required_size, "(", 1);
78 if (curve_name != NULL) {
79 append(buffer, buffer_size, required_size,
80 curve_name, strlen(curve_name));
81 } else {
Gilles Peskine0deaf3d2018-08-20 15:06:39 +020082 append_integer(buffer, buffer_size, required_size,
83 "0x%04x", curve);
Gilles Peskine029b5d62018-07-16 23:13:37 +020084 }
85 append(buffer, buffer_size, required_size, ")", 1);
86}
87
Gilles Peskinedcaefae2019-05-16 12:55:35 +020088static void append_with_group(char **buffer, size_t buffer_size,
89 size_t *required_size,
90 const char *string, size_t length,
91 psa_dh_group_t group)
92{
93 const char *group_name = psa_dh_group_name(group);
94 append(buffer, buffer_size, required_size, string, length);
95 append(buffer, buffer_size, required_size, "(", 1);
96 if (group_name != NULL) {
97 append(buffer, buffer_size, required_size,
98 group_name, strlen(group_name));
99 } else {
100 append_integer(buffer, buffer_size, required_size,
101 "0x%04x", group);
102 }
103 append(buffer, buffer_size, required_size, ")", 1);
104}
105
Gilles Peskine882e57e2019-04-12 00:12:07 +0200106typedef const char *(*psa_get_algorithm_name_func_ptr)(psa_algorithm_t alg);
107
108static void append_with_alg(char **buffer, size_t buffer_size,
109 size_t *required_size,
110 psa_get_algorithm_name_func_ptr get_name,
111 psa_algorithm_t alg)
Gilles Peskine029b5d62018-07-16 23:13:37 +0200112{
Gilles Peskine882e57e2019-04-12 00:12:07 +0200113 const char *name = get_name(alg);
114 if (name != NULL) {
Gilles Peskine029b5d62018-07-16 23:13:37 +0200115 append(buffer, buffer_size, required_size,
Gilles Peskine882e57e2019-04-12 00:12:07 +0200116 name, strlen(name));
Gilles Peskine029b5d62018-07-16 23:13:37 +0200117 } else {
Gilles Peskine0deaf3d2018-08-20 15:06:39 +0200118 append_integer(buffer, buffer_size, required_size,
Gilles Peskine882e57e2019-04-12 00:12:07 +0200119 "0x%08lx", alg);
Gilles Peskine029b5d62018-07-16 23:13:37 +0200120 }
Gilles Peskine029b5d62018-07-16 23:13:37 +0200121}
122
123#include "psa_constant_names_generated.c"
124
125static int psa_snprint_status(char *buffer, size_t buffer_size,
126 psa_status_t status)
127{
128 const char *name = psa_strerror(status);
129 if (name == NULL) {
130 return snprintf(buffer, buffer_size, "%ld", (long) status);
131 } else {
132 size_t length = strlen(name);
133 if (length < buffer_size) {
134 memcpy(buffer, name, length + 1);
Darryl Green18246962018-10-17 15:01:45 +0100135 return (int) length;
Gilles Peskine029b5d62018-07-16 23:13:37 +0200136 } else {
Darryl Green18246962018-10-17 15:01:45 +0100137 return (int) buffer_size;
Gilles Peskine029b5d62018-07-16 23:13:37 +0200138 }
139 }
140}
141
142static int psa_snprint_ecc_curve(char *buffer, size_t buffer_size,
143 psa_ecc_curve_t curve)
144{
145 const char *name = psa_ecc_curve_name(curve);
146 if (name == NULL) {
147 return snprintf(buffer, buffer_size, "0x%04x", (unsigned) curve);
148 } else {
149 size_t length = strlen(name);
150 if (length < buffer_size) {
151 memcpy(buffer, name, length + 1);
Darryl Green18246962018-10-17 15:01:45 +0100152 return (int) length;
Gilles Peskine029b5d62018-07-16 23:13:37 +0200153 } else {
Darryl Green18246962018-10-17 15:01:45 +0100154 return (int) buffer_size;
Gilles Peskine029b5d62018-07-16 23:13:37 +0200155 }
156 }
157}
158
Gilles Peskinedcaefae2019-05-16 12:55:35 +0200159static int psa_snprint_dh_group(char *buffer, size_t buffer_size,
160 psa_dh_group_t group)
161{
162 const char *name = psa_dh_group_name(group);
163 if (name == NULL) {
164 return snprintf(buffer, buffer_size, "0x%04x", (unsigned) group);
165 } else {
166 size_t length = strlen(name);
167 if (length < buffer_size) {
168 memcpy(buffer, name, length + 1);
169 return (int) length;
170 } else {
171 return (int) buffer_size;
172 }
173 }
174}
175
Gilles Peskine029b5d62018-07-16 23:13:37 +0200176static void usage(const char *program_name)
177{
Gilles Peskine567840e2018-09-25 18:27:53 +0200178 printf("Usage: %s TYPE VALUE [VALUE...]\n",
Gilles Peskine029b5d62018-07-16 23:13:37 +0200179 program_name == NULL ? "psa_constant_names" : program_name);
180 printf("Print the symbolic name whose numerical value is VALUE in TYPE.\n");
181 printf("Supported types (with = between aliases):\n");
Gilles Peskine38808fa2018-08-20 15:07:37 +0200182 printf(" alg=algorithm Algorithm (psa_algorithm_t)\n");
Gilles Peskine029b5d62018-07-16 23:13:37 +0200183 printf(" curve=ecc_curve Elliptic curve identifier (psa_ecc_curve_t)\n");
Gilles Peskinedcaefae2019-05-16 12:55:35 +0200184 printf(" group=dh_group Diffie-Hellman group identifier (psa_dh_group_t)\n");
Gilles Peskine38808fa2018-08-20 15:07:37 +0200185 printf(" type=key_type Key type (psa_key_type_t)\n");
Gilles Peskine029b5d62018-07-16 23:13:37 +0200186 printf(" usage=key_usage Key usage (psa_key_usage_t)\n");
187 printf(" error=status Status code (psa_status_t)\n");
188}
189
Gilles Peskine567840e2018-09-25 18:27:53 +0200190typedef enum {
191 TYPE_STATUS,
Gilles Peskine3f775262019-02-13 18:42:06 +0100192} signed_value_type;
193
194int process_signed(signed_value_type type, long min, long max, char **argp)
195{
196 for (; *argp != NULL; argp++) {
197 char buffer[200];
198 char *end;
199 long value = strtol(*argp, &end, 0);
200 if (*end) {
201 printf("Non-numeric value: %s\n", *argp);
202 return EXIT_FAILURE;
203 }
204 if (value < min || (errno == ERANGE && value < 0)) {
205 printf("Value too small: %s\n", *argp);
206 return EXIT_FAILURE;
207 }
208 if (value > max || (errno == ERANGE && value > 0)) {
209 printf("Value too large: %s\n", *argp);
210 return EXIT_FAILURE;
211 }
212
213 switch (type) {
214 case TYPE_STATUS:
215 psa_snprint_status(buffer, sizeof(buffer),
216 (psa_status_t) value);
217 break;
218 }
219 puts(buffer);
220 }
221
222 return EXIT_SUCCESS;
223}
224
225typedef enum {
Gilles Peskine567840e2018-09-25 18:27:53 +0200226 TYPE_ALGORITHM,
227 TYPE_ECC_CURVE,
Gilles Peskinedcaefae2019-05-16 12:55:35 +0200228 TYPE_DH_GROUP,
Gilles Peskine567840e2018-09-25 18:27:53 +0200229 TYPE_KEY_TYPE,
230 TYPE_KEY_USAGE,
Gilles Peskine1b879842019-02-13 18:40:50 +0100231} unsigned_value_type;
Gilles Peskine567840e2018-09-25 18:27:53 +0200232
Gilles Peskine1b879842019-02-13 18:40:50 +0100233int process_unsigned(unsigned_value_type type, unsigned long max, char **argp)
Gilles Peskine029b5d62018-07-16 23:13:37 +0200234{
Gilles Peskine1b879842019-02-13 18:40:50 +0100235 for (; *argp != NULL; argp++) {
Gilles Peskine567840e2018-09-25 18:27:53 +0200236 char buffer[200];
237 char *end;
Gilles Peskine1b879842019-02-13 18:40:50 +0100238 unsigned long value = strtoul(*argp, &end, 0);
Gilles Peskine567840e2018-09-25 18:27:53 +0200239 if (*end) {
Gilles Peskine1b879842019-02-13 18:40:50 +0100240 printf("Non-numeric value: %s\n", *argp);
Gilles Peskine567840e2018-09-25 18:27:53 +0200241 return EXIT_FAILURE;
242 }
Gilles Peskine3f775262019-02-13 18:42:06 +0100243 if (value > max || errno == ERANGE) {
Gilles Peskine1b879842019-02-13 18:40:50 +0100244 printf("Value out of range: %s\n", *argp);
Gilles Peskine265a1712018-10-31 14:52:28 +0100245 return EXIT_FAILURE;
246 }
Gilles Peskine567840e2018-09-25 18:27:53 +0200247
248 switch (type) {
Gilles Peskine567840e2018-09-25 18:27:53 +0200249 case TYPE_ALGORITHM:
250 psa_snprint_algorithm(buffer, sizeof(buffer),
251 (psa_algorithm_t) value);
252 break;
253 case TYPE_ECC_CURVE:
254 psa_snprint_ecc_curve(buffer, sizeof(buffer),
255 (psa_ecc_curve_t) value);
256 break;
Gilles Peskinedcaefae2019-05-16 12:55:35 +0200257 case TYPE_DH_GROUP:
258 psa_snprint_dh_group(buffer, sizeof(buffer),
259 (psa_dh_group_t) value);
260 break;
Gilles Peskine567840e2018-09-25 18:27:53 +0200261 case TYPE_KEY_TYPE:
262 psa_snprint_key_type(buffer, sizeof(buffer),
263 (psa_key_type_t) value);
264 break;
265 case TYPE_KEY_USAGE:
266 psa_snprint_key_usage(buffer, sizeof(buffer),
267 (psa_key_usage_t) value);
268 break;
269 }
270 puts(buffer);
271 }
272
Gilles Peskine029b5d62018-07-16 23:13:37 +0200273 return EXIT_SUCCESS;
274}
Gilles Peskine1b879842019-02-13 18:40:50 +0100275
276int main(int argc, char *argv[])
277{
278 if (argc <= 1 ||
279 !strcmp(argv[1], "help") ||
280 !strcmp(argv[1], "--help"))
281 {
282 usage(argv[0]);
283 return EXIT_FAILURE;
284 }
285
286 if (!strcmp(argv[1], "error") || !strcmp(argv[1], "status")) {
Gilles Peskine3f775262019-02-13 18:42:06 +0100287 /* There's no way to obtain the actual range of a signed type,
288 * so hard-code it here: psa_status_t is int32_t. */
289 return process_signed(TYPE_STATUS, INT32_MIN, INT32_MAX,
290 argv + 2);
Gilles Peskine1b879842019-02-13 18:40:50 +0100291 } else if (!strcmp(argv[1], "alg") || !strcmp(argv[1], "algorithm")) {
292 return process_unsigned(TYPE_ALGORITHM, (psa_algorithm_t) (-1),
293 argv + 2);
294 } else if (!strcmp(argv[1], "curve") || !strcmp(argv[1], "ecc_curve")) {
295 return process_unsigned(TYPE_ECC_CURVE, (psa_ecc_curve_t) (-1),
296 argv + 2);
Gilles Peskinedcaefae2019-05-16 12:55:35 +0200297 } else if (!strcmp(argv[1], "group") || !strcmp(argv[1], "dh_group")) {
298 return process_unsigned(TYPE_DH_GROUP, (psa_dh_group_t) (-1),
299 argv + 2);
Gilles Peskine1b879842019-02-13 18:40:50 +0100300 } else if (!strcmp(argv[1], "type") || !strcmp(argv[1], "key_type")) {
301 return process_unsigned(TYPE_KEY_TYPE, (psa_key_type_t) (-1),
302 argv + 2);
303 } else if (!strcmp(argv[1], "usage") || !strcmp(argv[1], "key_usage")) {
304 return process_unsigned(TYPE_KEY_USAGE, (psa_key_usage_t) (-1),
305 argv + 2);
306 } else {
307 printf("Unknown type: %s\n", argv[1]);
308 return EXIT_FAILURE;
309 }
310}