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).
66 /* Support for Thawte strong extranet extension */
69 static int sxnet_i2r(X509V3_EXT_METHOD *method, SXNET *sx, BIO *out, int indent);
71 static int sxnet_i2r();
74 X509V3_EXT_METHOD v3_sxnet = {
75 NID_sxnet, X509V3_EXT_MULTILINE,
76 (X509V3_EXT_NEW)SXNET_new,
78 (X509V3_EXT_D2I)d2i_SXNET,
82 (X509V3_EXT_I2R)sxnet_i2r,
89 * ASN1err(ASN1_F_SXNET_NEW,ERR_R_MALLOC_FAILURE);
90 * ASN1err(ASN1_F_D2I_SXNET,ERR_R_MALLOC_FAILURE);
91 * ASN1err(ASN1_F_SXNETID_NEW,ERR_R_MALLOC_FAILURE);
92 * ASN1err(ASN1_F_D2I_SXNETID,ERR_R_MALLOC_FAILURE);
101 M_ASN1_I2D_len (a->version, i2d_ASN1_INTEGER);
102 M_ASN1_I2D_len_SEQUENCE (a->ids, i2d_SXNETID);
104 M_ASN1_I2D_seq_total();
106 M_ASN1_I2D_put (a->version, i2d_ASN1_INTEGER);
107 M_ASN1_I2D_put_SEQUENCE (a->ids, i2d_SXNETID);
116 M_ASN1_New_Malloc(ret, SXNET);
120 M_ASN1_New_Error(ASN1_F_SXNET_NEW);
123 SXNET *d2i_SXNET(a,pp,length)
128 M_ASN1_D2I_vars(a,SXNET *,SXNET_new);
130 M_ASN1_D2I_start_sequence();
131 M_ASN1_D2I_get (ret->version, d2i_ASN1_INTEGER);
132 M_ASN1_D2I_get_seq (ret->ids, d2i_SXNETID, SXNETID_free);
133 M_ASN1_D2I_Finish(a, SXNET_free, ASN1_F_D2I_SXNET);
139 if (a == NULL) return;
140 ASN1_INTEGER_free(a->version);
141 sk_pop_free(a->ids, SXNETID_free);
147 int i2d_SXNETID(a,pp)
153 M_ASN1_I2D_len (a->zone, i2d_ASN1_INTEGER);
154 M_ASN1_I2D_len (a->user, i2d_ASN1_OCTET_STRING);
156 M_ASN1_I2D_seq_total();
158 M_ASN1_I2D_put (a->zone, i2d_ASN1_INTEGER);
159 M_ASN1_I2D_put (a->user, i2d_ASN1_OCTET_STRING);
164 SXNETID *SXNETID_new()
168 M_ASN1_New_Malloc(ret, SXNETID);
170 M_ASN1_New(ret->user,ASN1_OCTET_STRING_new);
172 M_ASN1_New_Error(ASN1_F_SXNETID_NEW);
175 SXNETID *d2i_SXNETID(a,pp,length)
180 M_ASN1_D2I_vars(a,SXNETID *,SXNETID_new);
182 M_ASN1_D2I_start_sequence();
183 M_ASN1_D2I_get(ret->zone, d2i_ASN1_INTEGER);
184 M_ASN1_D2I_get(ret->user, d2i_ASN1_OCTET_STRING);
185 M_ASN1_D2I_Finish(a, SXNETID_free, ASN1_F_D2I_SXNETID);
191 if (a == NULL) return;
192 ASN1_INTEGER_free(a->zone);
193 ASN1_OCTET_STRING_free(a->user);
197 static int sxnet_i2r(method, sx, out, indent)
198 X509V3_EXT_METHOD *method;
207 v = ASN1_INTEGER_get(sx->version);
208 BIO_printf(out, "%*sVersion: %d (0x%X)", indent, "", v + 1, v);
209 for(i = 0; i < sk_num(sx->ids); i++) {
210 id = (SXNETID *)sk_value(sx->ids, i);
211 tmp = i2s_ASN1_INTEGER(NULL, id->zone);
212 BIO_printf(out, "\n%*sZone: %s, User: ", indent, "", tmp);
214 ASN1_OCTET_STRING_print(out, id->user);