2 /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
5 /* ====================================================================
6 * Copyright (c) 1999 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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
17 * the documentation and/or other materials provided with the
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * licensing@OpenSSL.org.
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
58 /* X509 v3 extension utilities */
68 static char * str_dup(char *str);
69 static char *strip_spaces(char *name);
71 static char *str_dup(str)
75 if(!(tmp = Malloc(strlen(str) + 1))) return NULL;
80 /* Add a CONF_VALUE name value pair to stack */
82 int X509V3_add_value(name, value, extlist)
87 CONF_VALUE *vtmp = NULL;
88 char *tname = NULL, *tvalue = NULL;
89 if(name && !(tname = str_dup(name))) goto err;
90 if(value && !(tvalue = str_dup(value))) goto err;;
91 if(!(vtmp = (CONF_VALUE *)Malloc(sizeof(CONF_VALUE)))) goto err;
92 if(!*extlist && !(*extlist = sk_new(NULL))) goto err;
96 if(!sk_push(*extlist, (char *)vtmp)) goto err;
99 X509V3err(X509V3_F_X509V3_ADD_VALUE,ERR_R_MALLOC_FAILURE);
101 if(tname) Free(tname);
102 if(tvalue) Free(tvalue);
106 /* Free function for STACK of CONF_VALUE */
108 void X509V3_conf_free(conf)
112 if(conf->name) Free(conf->name);
113 if(conf->value) Free(conf->value);
114 if(conf->section) Free(conf->section);
118 int X509V3_add_value_bool(name, asn1_bool, extlist)
123 if(asn1_bool) return X509V3_add_value(name, "TRUE", extlist);
124 return X509V3_add_value(name, "FALSE", extlist);
127 int X509V3_add_value_bool_nf(name, asn1_bool, extlist)
132 if(asn1_bool) return X509V3_add_value(name, "TRUE", extlist);
136 char *i2s_ASN1_INTEGER(method, a)
137 X509V3_EXT_METHOD *method;
140 BIGNUM *bntmp = NULL;
143 if(!(bntmp = ASN1_INTEGER_to_BN(a, NULL)) ||
144 !(strtmp = BN_bn2dec(bntmp)) )
145 X509V3err(X509V3_F_I2S_ASN1_INTEGER,ERR_R_MALLOC_FAILURE);
150 int X509V3_add_value_int(name, aint, extlist)
158 if(!(strtmp = i2s_ASN1_INTEGER(NULL, aint))) return 0;
159 ret = X509V3_add_value(name, strtmp, extlist);
164 int X509V3_get_value_bool(value, asn1_bool)
169 if(!(btmp = value->value)) goto err;
170 if(!strcmp(btmp, "TRUE") || !strcmp(btmp, "true")
171 || !strcmp(btmp, "Y") || !strcmp(btmp, "y")
172 || !strcmp(btmp, "YES") || !strcmp(btmp, "yes")) {
175 } else if(!strcmp(btmp, "FALSE") || !strcmp(btmp, "false")
176 || !strcmp(btmp, "N") || !strcmp(btmp, "n")
177 || !strcmp(btmp, "NO") || !strcmp(btmp, "no")) {
182 X509V3err(X509V3_F_X509V3_VALUE_GET_BOOL,X509V3_R_INVALID_BOOLEAN_STRING);
183 X509V3_conf_err(value);
187 int X509V3_get_value_int(value, aint)
194 X509V3err(X509V3_F_X509V3_GET_VALUE_INT,X509V3_R_INVALID_NULL_VALUE);
195 X509V3_conf_err(value);
198 if(!BN_dec2bn(&bn, value->value)) {
199 X509V3err(X509V3_F_X509V3_GET_VALUE_INT,X509V3_R_BN_DEC2BN_ERROR);
200 X509V3_conf_err(value);
204 if(!(*aint = BN_to_ASN1_INTEGER(bn, NULL))) {
205 X509V3err(X509V3_F_X509V3_GET_VALUE_INT,X509V3_R_BN_TO_ASN1_INTEGER_ERROR);
206 X509V3_conf_err(value);
218 STACK *X509V3_parse_list(line)
223 STACK *values = NULL;
226 /* We are going to modify the line so copy it first */
227 linebuf = str_dup(line);
230 /* Go through all characters */
231 for(p = linebuf, q = linebuf; (c = *p) && (c!='\r') && (c!='\n'); p++) {
238 ntmp = strip_spaces(q);
240 X509V3err(X509V3_F_X509V3_PARSE_LIST, X509V3_R_INVALID_NULL_NAME);
244 } else if(c == ',') {
246 ntmp = strip_spaces(q);
249 printf("%s\n", ntmp);
252 X509V3err(X509V3_F_X509V3_PARSE_LIST, X509V3_R_INVALID_NULL_NAME);
255 X509V3_add_value(ntmp, NULL, &values);
263 vtmp = strip_spaces(q);
265 printf("%s\n", ntmp);
268 X509V3err(X509V3_F_X509V3_PARSE_LIST, X509V3_R_INVALID_NULL_VALUE);
271 X509V3_add_value(ntmp, vtmp, &values);
279 if(state == HDR_VALUE) {
280 vtmp = strip_spaces(q);
282 printf("%s=%s\n", ntmp, vtmp);
285 X509V3err(X509V3_F_X509V3_PARSE_LIST, X509V3_R_INVALID_NULL_VALUE);
288 X509V3_add_value(ntmp, vtmp, &values);
290 ntmp = strip_spaces(q);
292 printf("%s\n", ntmp);
295 X509V3err(X509V3_F_X509V3_PARSE_LIST, X509V3_R_INVALID_NULL_NAME);
298 X509V3_add_value(ntmp, NULL, &values);
305 sk_pop_free(values, X509V3_conf_free);
310 /* Delete leading and trailing spaces from a string */
311 static char *strip_spaces(name)
315 /* Skip over leading spaces */
317 while(*p && isspace(*p)) p++;
319 q = p + strlen(p) - 1;
320 while((q != p) && isspace(*q)) q--;
326 /* hex string utilities */
328 /* Given a buffer of length 'len' return a Malloc'ed string with its
332 char *hex_to_string(buffer, len)
333 unsigned char *buffer;
339 static char hexdig[] = "0123456789ABCDEF";
340 if(!buffer || !len) return NULL;
341 if(!(tmp = Malloc(len * 3 + 1))) {
342 X509V3err(X509V3_F_HEX_TO_STRING,ERR_R_MALLOC_FAILURE);
346 for(i = 0, p = buffer; i < len; i++,p++) {
347 *q++ = hexdig[(*p >> 4) & 0xf];
348 *q++ = hexdig[*p & 0xf];
355 /* Give a string of hex digits convert to
359 unsigned char *string_to_hex(str, len)
363 unsigned char *hexbuf, *q;
364 unsigned char ch, cl, *p;
366 X509V3err(X509V3_F_STRING_TO_HEX,X509V3_R_INVALID_NULL_ARGUMENT);
369 if(!(hexbuf = Malloc(strlen(str) >> 1))) goto err;
370 for(p = (unsigned char *)str, q = hexbuf; *p;) {
372 if(ch == ':') continue;
375 X509V3err(X509V3_F_STRING_TO_HEX,X509V3_R_ODD_NUMBER_OF_DIGITS);
379 if(isupper(ch)) ch = tolower(ch);
380 if(isupper(cl)) cl = tolower(cl);
382 if((ch >= '0') && (ch <= '9')) ch -= '0';
383 else if ((ch >= 'a') && (ch <= 'f')) ch -= 'a' - 10;
386 if((cl >= '0') && (cl <= '9')) cl -= '0';
387 else if ((cl >= 'a') && (cl <= 'f')) cl -= 'a' - 10;
390 *q++ = (ch << 4) | cl;
393 if(len) *len = q - hexbuf;
398 if(hexbuf) Free(hexbuf);
399 X509V3err(X509V3_F_STRING_TO_HEX,ERR_R_MALLOC_FAILURE);
404 X509V3err(X509V3_F_STRING_TO_HEX,X509V3_R_ILLEGAL_HEX_DIGIT);
409 /* V2I name comparison function: returns zero if 'name' matches
413 int name_cmp(name, cmp)
420 if((ret = strncmp(name, cmp, len))) return ret;
422 if(!c || (c=='.')) return 0;