1/*
2 * Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 *
17 * 3. Neither the name of the Institute nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#include "der_locl.h"
35#include <com_err.h>
36#include <sys/types.h>
37#include <sys/stat.h>
38#include <getarg.h>
39#include <err.h>
40
41RCSID("$Id$");
42
43
44static const char *class_names[] = {
45    "UNIV",			/* 0 */
46    "APPL",			/* 1 */
47    "CONTEXT",			/* 2 */
48    "PRIVATE"			/* 3 */
49};
50
51static const char *type_names[] = {
52    "PRIM",			/* 0 */
53    "CONS"			/* 1 */
54};
55
56static const char *tag_names[] = {
57    "EndOfContent",		/* 0 */
58    "Boolean",			/* 1 */
59    "Integer",			/* 2 */
60    "BitString",		/* 3 */
61    "OctetString",		/* 4 */
62    "Null",			/* 5 */
63    "ObjectID",			/* 6 */
64    NULL,			/* 7 */
65    NULL,			/* 8 */
66    NULL,			/* 9 */
67    "Enumerated",		/* 10 */
68    NULL,			/* 11 */
69    NULL,			/* 12 */
70    NULL,			/* 13 */
71    NULL,			/* 14 */
72    NULL,			/* 15 */
73    "Sequence",			/* 16 */
74    "Set",			/* 17 */
75    NULL,			/* 18 */
76    "PrintableString",		/* 19 */
77    NULL,			/* 20 */
78    NULL,			/* 21 */
79    "IA5String",		/* 22 */
80    "UTCTime",			/* 23 */
81    "GeneralizedTime",		/* 24 */
82    NULL,			/* 25 */
83    "VisibleString",		/* 26 */
84    "GeneralString",		/* 27 */
85    NULL,			/* 28 */
86    NULL,			/* 29 */
87    "BMPString"			/* 30 */
88};
89
90static int
91get_type(const char *name, const char *list[], unsigned len)
92{
93    unsigned i;
94    for (i = 0; i < len; i++)
95	if (list[i] && strcasecmp(list[i], name) == 0)
96	    return i;
97    return -1;
98}
99
100#define SIZEOF_ARRAY(a) (sizeof((a))/sizeof((a)[0]))
101
102const char *
103der_get_class_name(unsigned num)
104{
105    if (num >= SIZEOF_ARRAY(class_names))
106	return NULL;
107    return class_names[num];
108}
109
110int
111der_get_class_num(const char *name)
112{
113    return get_type(name, class_names, SIZEOF_ARRAY(class_names));
114}
115
116const char *
117der_get_type_name(unsigned num)
118{
119    if (num >= SIZEOF_ARRAY(type_names))
120	return NULL;
121    return type_names[num];
122}
123
124int
125der_get_type_num(const char *name)
126{
127    return get_type(name, type_names, SIZEOF_ARRAY(type_names));
128}
129
130const char *
131der_get_tag_name(unsigned num)
132{
133    if (num >= SIZEOF_ARRAY(tag_names))
134	return NULL;
135    return tag_names[num];
136}
137
138int
139der_get_tag_num(const char *name)
140{
141    return get_type(name, tag_names, SIZEOF_ARRAY(tag_names));
142}
143