v3_ncons.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203
  1. /* v3_ncons.c */
  2. /*
  3. * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
  4. * project.
  5. */
  6. /* ====================================================================
  7. * Copyright (c) 2003 The OpenSSL Project. All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions
  11. * are met:
  12. *
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. *
  16. * 2. Redistributions in binary form must reproduce the above copyright
  17. * notice, this list of conditions and the following disclaimer in
  18. * the documentation and/or other materials provided with the
  19. * distribution.
  20. *
  21. * 3. All advertising materials mentioning features or use of this
  22. * software must display the following acknowledgment:
  23. * "This product includes software developed by the OpenSSL Project
  24. * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
  25. *
  26. * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  27. * endorse or promote products derived from this software without
  28. * prior written permission. For written permission, please contact
  29. * licensing@OpenSSL.org.
  30. *
  31. * 5. Products derived from this software may not be called "OpenSSL"
  32. * nor may "OpenSSL" appear in their names without prior written
  33. * permission of the OpenSSL Project.
  34. *
  35. * 6. Redistributions of any form whatsoever must retain the following
  36. * acknowledgment:
  37. * "This product includes software developed by the OpenSSL Project
  38. * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
  39. *
  40. * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  41. * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  42. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  43. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
  44. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  45. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  46. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  47. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  49. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  50. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  51. * OF THE POSSIBILITY OF SUCH DAMAGE.
  52. * ====================================================================
  53. *
  54. * This product includes cryptographic software written by Eric Young
  55. * (eay@cryptsoft.com). This product includes software written by Tim
  56. * Hudson (tjh@cryptsoft.com).
  57. *
  58. */
  59. #include <stdio.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1t.h>
  62. #include <openssl/conf.h>
  63. #include <openssl/x509v3.h>
  64. static void *v2i_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  65. X509V3_CTX *ctx,
  66. STACK_OF(CONF_VALUE) *nval);
  67. static int i2r_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method, void *a, BIO *bp,
  68. int ind);
  69. static int do_i2r_name_constraints(X509V3_EXT_METHOD *method,
  70. STACK_OF(GENERAL_SUBTREE) *trees, BIO *bp,
  71. int ind, char *name);
  72. static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip);
  73. const X509V3_EXT_METHOD v3_name_constraints = {
  74. NID_name_constraints, 0,
  75. ASN1_ITEM_ref(NAME_CONSTRAINTS),
  76. 0, 0, 0, 0,
  77. 0, 0,
  78. 0, v2i_NAME_CONSTRAINTS,
  79. i2r_NAME_CONSTRAINTS, 0,
  80. NULL
  81. };
  82. ASN1_SEQUENCE(GENERAL_SUBTREE) = {
  83. ASN1_SIMPLE(GENERAL_SUBTREE, base, GENERAL_NAME),
  84. ASN1_IMP_OPT(GENERAL_SUBTREE, minimum, ASN1_INTEGER, 0),
  85. ASN1_IMP_OPT(GENERAL_SUBTREE, maximum, ASN1_INTEGER, 1)
  86. } ASN1_SEQUENCE_END(GENERAL_SUBTREE)
  87. ASN1_SEQUENCE(NAME_CONSTRAINTS) = {
  88. ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, permittedSubtrees,
  89. GENERAL_SUBTREE, 0),
  90. ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, excludedSubtrees,
  91. GENERAL_SUBTREE, 1),
  92. } ASN1_SEQUENCE_END(NAME_CONSTRAINTS)
  93. IMPLEMENT_ASN1_ALLOC_FUNCTIONS(GENERAL_SUBTREE)
  94. IMPLEMENT_ASN1_ALLOC_FUNCTIONS(NAME_CONSTRAINTS)
  95. static void *v2i_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  96. X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval)
  97. {
  98. int i;
  99. CONF_VALUE tval, *val;
  100. STACK_OF(GENERAL_SUBTREE) **ptree = NULL;
  101. NAME_CONSTRAINTS *ncons = NULL;
  102. GENERAL_SUBTREE *sub = NULL;
  103. ncons = NAME_CONSTRAINTS_new();
  104. if (!ncons)
  105. goto memerr;
  106. for (i = 0; i < sk_CONF_VALUE_num(nval); i++) {
  107. val = sk_CONF_VALUE_value(nval, i);
  108. if (!strncmp(val->name, "permitted", 9) && val->name[9]) {
  109. ptree = &ncons->permittedSubtrees;
  110. tval.name = val->name + 10;
  111. } else if (!strncmp(val->name, "excluded", 8) && val->name[8]) {
  112. ptree = &ncons->excludedSubtrees;
  113. tval.name = val->name + 9;
  114. } else {
  115. X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, X509V3_R_INVALID_SYNTAX);
  116. goto err;
  117. }
  118. tval.value = val->value;
  119. sub = GENERAL_SUBTREE_new();
  120. if (!v2i_GENERAL_NAME_ex(sub->base, method, ctx, &tval, 1))
  121. goto err;
  122. if (!*ptree)
  123. *ptree = sk_GENERAL_SUBTREE_new_null();
  124. if (!*ptree || !sk_GENERAL_SUBTREE_push(*ptree, sub))
  125. goto memerr;
  126. sub = NULL;
  127. }
  128. return ncons;
  129. memerr:
  130. X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, ERR_R_MALLOC_FAILURE);
  131. err:
  132. if (ncons)
  133. NAME_CONSTRAINTS_free(ncons);
  134. if (sub)
  135. GENERAL_SUBTREE_free(sub);
  136. return NULL;
  137. }
  138. static int i2r_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
  139. void *a, BIO *bp, int ind)
  140. {
  141. NAME_CONSTRAINTS *ncons = a;
  142. do_i2r_name_constraints(method, ncons->permittedSubtrees,
  143. bp, ind, "Permitted");
  144. do_i2r_name_constraints(method, ncons->excludedSubtrees,
  145. bp, ind, "Excluded");
  146. return 1;
  147. }
  148. static int do_i2r_name_constraints(X509V3_EXT_METHOD *method,
  149. STACK_OF(GENERAL_SUBTREE) *trees,
  150. BIO *bp, int ind, char *name)
  151. {
  152. GENERAL_SUBTREE *tree;
  153. int i;
  154. if (sk_GENERAL_SUBTREE_num(trees) > 0)
  155. BIO_printf(bp, "%*s%s:\n", ind, "", name);
  156. for (i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++) {
  157. tree = sk_GENERAL_SUBTREE_value(trees, i);
  158. BIO_printf(bp, "%*s", ind + 2, "");
  159. if (tree->base->type == GEN_IPADD)
  160. print_nc_ipadd(bp, tree->base->d.ip);
  161. else
  162. GENERAL_NAME_print(bp, tree->base);
  163. BIO_puts(bp, "\n");
  164. }
  165. return 1;
  166. }
  167. static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip)
  168. {
  169. int i, len;
  170. unsigned char *p;
  171. p = ip->data;
  172. len = ip->length;
  173. BIO_puts(bp, "IP:");
  174. if (len == 8) {
  175. BIO_printf(bp, "%d.%d.%d.%d/%d.%d.%d.%d",
  176. p[0], p[1], p[2], p[3], p[4], p[5], p[6], p[7]);
  177. } else if (len == 32) {
  178. for (i = 0; i < 16; i++) {
  179. BIO_printf(bp, "%X", p[0] << 8 | p[1]);
  180. p += 2;
  181. if (i == 7)
  182. BIO_puts(bp, "/");
  183. else if (i != 15)
  184. BIO_puts(bp, ":");
  185. }
  186. } else
  187. BIO_printf(bp, "IP Address:<invalid>");
  188. return 1;
  189. }