No empty .Rs/.Re
[netbsd-mini2440.git] / crypto / dist / heimdal / lib / asn1 / der.c
blobfd7efc128f49fc6c437d335af2d3c197979038c5
1 /*
2 * Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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.
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>
41 __RCSID("$Heimdal: der.c 22429 2008-01-13 10:25:50Z lha $"
42 "$NetBSD$");
45 static const char *class_names[] = {
46 "UNIV", /* 0 */
47 "APPL", /* 1 */
48 "CONTEXT", /* 2 */
49 "PRIVATE" /* 3 */
52 static const char *type_names[] = {
53 "PRIM", /* 0 */
54 "CONS" /* 1 */
57 static const char *tag_names[] = {
58 "EndOfContent", /* 0 */
59 "Boolean", /* 1 */
60 "Integer", /* 2 */
61 "BitString", /* 3 */
62 "OctetString", /* 4 */
63 "Null", /* 5 */
64 "ObjectID", /* 6 */
65 NULL, /* 7 */
66 NULL, /* 8 */
67 NULL, /* 9 */
68 "Enumerated", /* 10 */
69 NULL, /* 11 */
70 NULL, /* 12 */
71 NULL, /* 13 */
72 NULL, /* 14 */
73 NULL, /* 15 */
74 "Sequence", /* 16 */
75 "Set", /* 17 */
76 NULL, /* 18 */
77 "PrintableString", /* 19 */
78 NULL, /* 20 */
79 NULL, /* 21 */
80 "IA5String", /* 22 */
81 "UTCTime", /* 23 */
82 "GeneralizedTime", /* 24 */
83 NULL, /* 25 */
84 "VisibleString", /* 26 */
85 "GeneralString", /* 27 */
86 NULL, /* 28 */
87 NULL, /* 29 */
88 "BMPString" /* 30 */
91 static int
92 get_type(const char *name, const char *list[], unsigned len)
94 unsigned i;
95 for (i = 0; i < len; i++)
96 if (list[i] && strcasecmp(list[i], name) == 0)
97 return i;
98 return -1;
101 #define SIZEOF_ARRAY(a) (sizeof((a))/sizeof((a)[0]))
103 const char *
104 der_get_class_name(unsigned num)
106 if (num >= SIZEOF_ARRAY(class_names))
107 return NULL;
108 return class_names[num];
112 der_get_class_num(const char *name)
114 return get_type(name, class_names, SIZEOF_ARRAY(class_names));
117 const char *
118 der_get_type_name(unsigned num)
120 if (num >= SIZEOF_ARRAY(type_names))
121 return NULL;
122 return type_names[num];
126 der_get_type_num(const char *name)
128 return get_type(name, type_names, SIZEOF_ARRAY(type_names));
131 const char *
132 der_get_tag_name(unsigned num)
134 if (num >= SIZEOF_ARRAY(tag_names))
135 return NULL;
136 return tag_names[num];
140 der_get_tag_num(const char *name)
142 return get_type(name, tag_names, SIZEOF_ARRAY(tag_names));