2
0

v3_ncons.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220
  1. /* v3_ncons.c */
  2. /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
  3. * project.
  4. */
  5. /* ====================================================================
  6. * Copyright (c) 2003 The OpenSSL Project. All rights reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions
  10. * are met:
  11. *
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. *
  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
  18. * distribution.
  19. *
  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/)"
  24. *
  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.
  29. *
  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.
  33. *
  34. * 6. Redistributions of any form whatsoever must retain the following
  35. * acknowledgment:
  36. * "This product includes software developed by the OpenSSL Project
  37. * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
  38. *
  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. * ====================================================================
  52. *
  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).
  56. *
  57. */
  58. #include <stdio.h>
  59. #include "cryptlib.h"
  60. #include <openssl/asn1t.h>
  61. #include <openssl/conf.h>
  62. #include <openssl/x509v3.h>
  63. static void *v2i_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  64. X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval);
  65. static int i2r_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  66. void *a, BIO *bp, int ind);
  67. static int do_i2r_name_constraints(X509V3_EXT_METHOD *method,
  68. STACK_OF(GENERAL_SUBTREE) *trees,
  69. BIO *bp, int ind, char *name);
  70. static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip);
  71. const X509V3_EXT_METHOD v3_name_constraints = {
  72. NID_name_constraints, 0,
  73. ASN1_ITEM_ref(NAME_CONSTRAINTS),
  74. 0,0,0,0,
  75. 0,0,
  76. 0, v2i_NAME_CONSTRAINTS,
  77. i2r_NAME_CONSTRAINTS,0,
  78. NULL
  79. };
  80. ASN1_SEQUENCE(GENERAL_SUBTREE) = {
  81. ASN1_SIMPLE(GENERAL_SUBTREE, base, GENERAL_NAME),
  82. ASN1_IMP_OPT(GENERAL_SUBTREE, minimum, ASN1_INTEGER, 0),
  83. ASN1_IMP_OPT(GENERAL_SUBTREE, maximum, ASN1_INTEGER, 1)
  84. } ASN1_SEQUENCE_END(GENERAL_SUBTREE)
  85. ASN1_SEQUENCE(NAME_CONSTRAINTS) = {
  86. ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, permittedSubtrees,
  87. GENERAL_SUBTREE, 0),
  88. ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, excludedSubtrees,
  89. GENERAL_SUBTREE, 1),
  90. } ASN1_SEQUENCE_END(NAME_CONSTRAINTS)
  91. IMPLEMENT_ASN1_ALLOC_FUNCTIONS(GENERAL_SUBTREE)
  92. IMPLEMENT_ASN1_ALLOC_FUNCTIONS(NAME_CONSTRAINTS)
  93. static void *v2i_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  94. X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval)
  95. {
  96. int i;
  97. CONF_VALUE tval, *val;
  98. STACK_OF(GENERAL_SUBTREE) **ptree = NULL;
  99. NAME_CONSTRAINTS *ncons = NULL;
  100. GENERAL_SUBTREE *sub = NULL;
  101. ncons = NAME_CONSTRAINTS_new();
  102. if (!ncons)
  103. goto memerr;
  104. for(i = 0; i < sk_CONF_VALUE_num(nval); i++)
  105. {
  106. val = sk_CONF_VALUE_value(nval, i);
  107. if (!strncmp(val->name, "permitted", 9) && val->name[9])
  108. {
  109. ptree = &ncons->permittedSubtrees;
  110. tval.name = val->name + 10;
  111. }
  112. else if (!strncmp(val->name, "excluded", 8) && val->name[8])
  113. {
  114. ptree = &ncons->excludedSubtrees;
  115. tval.name = val->name + 9;
  116. }
  117. else
  118. {
  119. X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, X509V3_R_INVALID_SYNTAX);
  120. goto err;
  121. }
  122. tval.value = val->value;
  123. sub = GENERAL_SUBTREE_new();
  124. if (!v2i_GENERAL_NAME_ex(sub->base, method, ctx, &tval, 1))
  125. goto err;
  126. if (!*ptree)
  127. *ptree = sk_GENERAL_SUBTREE_new_null();
  128. if (!*ptree || !sk_GENERAL_SUBTREE_push(*ptree, sub))
  129. goto memerr;
  130. sub = NULL;
  131. }
  132. return ncons;
  133. memerr:
  134. X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, ERR_R_MALLOC_FAILURE);
  135. err:
  136. if (ncons)
  137. NAME_CONSTRAINTS_free(ncons);
  138. if (sub)
  139. GENERAL_SUBTREE_free(sub);
  140. return NULL;
  141. }
  142. static int i2r_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  143. void *a, BIO *bp, int ind)
  144. {
  145. NAME_CONSTRAINTS *ncons = a;
  146. do_i2r_name_constraints(method, ncons->permittedSubtrees,
  147. bp, ind, "Permitted");
  148. do_i2r_name_constraints(method, ncons->excludedSubtrees,
  149. bp, ind, "Excluded");
  150. return 1;
  151. }
  152. static int do_i2r_name_constraints(X509V3_EXT_METHOD *method,
  153. STACK_OF(GENERAL_SUBTREE) *trees,
  154. BIO *bp, int ind, char *name)
  155. {
  156. GENERAL_SUBTREE *tree;
  157. int i;
  158. if (sk_GENERAL_SUBTREE_num(trees) > 0)
  159. BIO_printf(bp, "%*s%s:\n", ind, "", name);
  160. for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++)
  161. {
  162. tree = sk_GENERAL_SUBTREE_value(trees, i);
  163. BIO_printf(bp, "%*s", ind + 2, "");
  164. if (tree->base->type == GEN_IPADD)
  165. print_nc_ipadd(bp, tree->base->d.ip);
  166. else
  167. GENERAL_NAME_print(bp, tree->base);
  168. tree = sk_GENERAL_SUBTREE_value(trees, i);
  169. BIO_puts(bp, "\n");
  170. }
  171. return 1;
  172. }
  173. static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip)
  174. {
  175. int i, len;
  176. unsigned char *p;
  177. p = ip->data;
  178. len = ip->length;
  179. BIO_puts(bp, "IP:");
  180. if(len == 8)
  181. {
  182. BIO_printf(bp, "%d.%d.%d.%d/%d.%d.%d.%d",
  183. p[0], p[1], p[2], p[3],
  184. p[4], p[5], p[6], p[7]);
  185. }
  186. else if(len == 32)
  187. {
  188. for (i = 0; i < 16; i++)
  189. {
  190. BIO_printf(bp, "%X", p[0] << 8 | p[1]);
  191. p += 2;
  192. if (i == 7)
  193. BIO_puts(bp, "/");
  194. else if (i != 15)
  195. BIO_puts(bp, ":");
  196. }
  197. }
  198. else
  199. BIO_printf(bp, "IP Address:<invalid>");
  200. return 1;
  201. }