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