x509_v3.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284
  1. /* crypto/x509/x509_v3.c */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young (eay@cryptsoft.com).
  7. * The implementation was written so as to conform with Netscapes SSL.
  8. *
  9. * This library is free for commercial and non-commercial use as long as
  10. * the following conditions are aheared to. The following conditions
  11. * apply to all code found in this distribution, be it the RC4, RSA,
  12. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  13. * included with this distribution is covered by the same copyright terms
  14. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15. *
  16. * Copyright remains Eric Young's, and as such any Copyright notices in
  17. * the code are not to be removed.
  18. * If this package is used in a product, Eric Young should be given attribution
  19. * as the author of the parts of the library used.
  20. * This can be in the form of a textual message at program startup or
  21. * in documentation (online or textual) provided with the package.
  22. *
  23. * Redistribution and use in source and binary forms, with or without
  24. * modification, are permitted provided that the following conditions
  25. * are met:
  26. * 1. Redistributions of source code must retain the copyright
  27. * notice, this list of conditions and the following disclaimer.
  28. * 2. Redistributions in binary form must reproduce the above copyright
  29. * notice, this list of conditions and the following disclaimer in the
  30. * documentation and/or other materials provided with the distribution.
  31. * 3. All advertising materials mentioning features or use of this software
  32. * must display the following acknowledgement:
  33. * "This product includes cryptographic software written by
  34. * Eric Young (eay@cryptsoft.com)"
  35. * The word 'cryptographic' can be left out if the rouines from the library
  36. * being used are not cryptographic related :-).
  37. * 4. If you include any Windows specific code (or a derivative thereof) from
  38. * the apps directory (application code) you must include an acknowledgement:
  39. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40. *
  41. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51. * SUCH DAMAGE.
  52. *
  53. * The licence and distribution terms for any publically available version or
  54. * derivative of this code cannot be changed. i.e. this code cannot simply be
  55. * copied and put under another distribution licence
  56. * [including the GNU Public Licence.]
  57. */
  58. #include <stdio.h>
  59. #include <openssl/stack.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1.h>
  62. #include <openssl/objects.h>
  63. #include <openssl/evp.h>
  64. #include <openssl/x509.h>
  65. #include <openssl/x509v3.h>
  66. int X509v3_get_ext_count(const STACK_OF(X509_EXTENSION) *x)
  67. {
  68. if (x == NULL)
  69. return (0);
  70. return (sk_X509_EXTENSION_num(x));
  71. }
  72. int X509v3_get_ext_by_NID(const STACK_OF(X509_EXTENSION) *x, int nid,
  73. int lastpos)
  74. {
  75. ASN1_OBJECT *obj;
  76. obj = OBJ_nid2obj(nid);
  77. if (obj == NULL)
  78. return (-2);
  79. return (X509v3_get_ext_by_OBJ(x, obj, lastpos));
  80. }
  81. int X509v3_get_ext_by_OBJ(const STACK_OF(X509_EXTENSION) *sk,
  82. ASN1_OBJECT *obj, int lastpos)
  83. {
  84. int n;
  85. X509_EXTENSION *ex;
  86. if (sk == NULL)
  87. return (-1);
  88. lastpos++;
  89. if (lastpos < 0)
  90. lastpos = 0;
  91. n = sk_X509_EXTENSION_num(sk);
  92. for (; lastpos < n; lastpos++) {
  93. ex = sk_X509_EXTENSION_value(sk, lastpos);
  94. if (OBJ_cmp(ex->object, obj) == 0)
  95. return (lastpos);
  96. }
  97. return (-1);
  98. }
  99. int X509v3_get_ext_by_critical(const STACK_OF(X509_EXTENSION) *sk, int crit,
  100. int lastpos)
  101. {
  102. int n;
  103. X509_EXTENSION *ex;
  104. if (sk == NULL)
  105. return (-1);
  106. lastpos++;
  107. if (lastpos < 0)
  108. lastpos = 0;
  109. n = sk_X509_EXTENSION_num(sk);
  110. for (; lastpos < n; lastpos++) {
  111. ex = sk_X509_EXTENSION_value(sk, lastpos);
  112. if (((ex->critical > 0) && crit) || ((ex->critical <= 0) && !crit))
  113. return (lastpos);
  114. }
  115. return (-1);
  116. }
  117. X509_EXTENSION *X509v3_get_ext(const STACK_OF(X509_EXTENSION) *x, int loc)
  118. {
  119. if (x == NULL || sk_X509_EXTENSION_num(x) <= loc || loc < 0)
  120. return NULL;
  121. else
  122. return sk_X509_EXTENSION_value(x, loc);
  123. }
  124. X509_EXTENSION *X509v3_delete_ext(STACK_OF(X509_EXTENSION) *x, int loc)
  125. {
  126. X509_EXTENSION *ret;
  127. if (x == NULL || sk_X509_EXTENSION_num(x) <= loc || loc < 0)
  128. return (NULL);
  129. ret = sk_X509_EXTENSION_delete(x, loc);
  130. return (ret);
  131. }
  132. STACK_OF(X509_EXTENSION) *X509v3_add_ext(STACK_OF(X509_EXTENSION) **x,
  133. X509_EXTENSION *ex, int loc)
  134. {
  135. X509_EXTENSION *new_ex = NULL;
  136. int n;
  137. STACK_OF(X509_EXTENSION) *sk = NULL;
  138. if (x == NULL) {
  139. X509err(X509_F_X509V3_ADD_EXT, ERR_R_PASSED_NULL_PARAMETER);
  140. goto err2;
  141. }
  142. if (*x == NULL) {
  143. if ((sk = sk_X509_EXTENSION_new_null()) == NULL)
  144. goto err;
  145. } else
  146. sk = *x;
  147. n = sk_X509_EXTENSION_num(sk);
  148. if (loc > n)
  149. loc = n;
  150. else if (loc < 0)
  151. loc = n;
  152. if ((new_ex = X509_EXTENSION_dup(ex)) == NULL)
  153. goto err2;
  154. if (!sk_X509_EXTENSION_insert(sk, new_ex, loc))
  155. goto err;
  156. if (*x == NULL)
  157. *x = sk;
  158. return (sk);
  159. err:
  160. X509err(X509_F_X509V3_ADD_EXT, ERR_R_MALLOC_FAILURE);
  161. err2:
  162. if (new_ex != NULL)
  163. X509_EXTENSION_free(new_ex);
  164. if (sk != NULL)
  165. sk_X509_EXTENSION_free(sk);
  166. return (NULL);
  167. }
  168. X509_EXTENSION *X509_EXTENSION_create_by_NID(X509_EXTENSION **ex, int nid,
  169. int crit,
  170. ASN1_OCTET_STRING *data)
  171. {
  172. ASN1_OBJECT *obj;
  173. X509_EXTENSION *ret;
  174. obj = OBJ_nid2obj(nid);
  175. if (obj == NULL) {
  176. X509err(X509_F_X509_EXTENSION_CREATE_BY_NID, X509_R_UNKNOWN_NID);
  177. return (NULL);
  178. }
  179. ret = X509_EXTENSION_create_by_OBJ(ex, obj, crit, data);
  180. if (ret == NULL)
  181. ASN1_OBJECT_free(obj);
  182. return (ret);
  183. }
  184. X509_EXTENSION *X509_EXTENSION_create_by_OBJ(X509_EXTENSION **ex,
  185. ASN1_OBJECT *obj, int crit,
  186. ASN1_OCTET_STRING *data)
  187. {
  188. X509_EXTENSION *ret;
  189. if ((ex == NULL) || (*ex == NULL)) {
  190. if ((ret = X509_EXTENSION_new()) == NULL) {
  191. X509err(X509_F_X509_EXTENSION_CREATE_BY_OBJ,
  192. ERR_R_MALLOC_FAILURE);
  193. return (NULL);
  194. }
  195. } else
  196. ret = *ex;
  197. if (!X509_EXTENSION_set_object(ret, obj))
  198. goto err;
  199. if (!X509_EXTENSION_set_critical(ret, crit))
  200. goto err;
  201. if (!X509_EXTENSION_set_data(ret, data))
  202. goto err;
  203. if ((ex != NULL) && (*ex == NULL))
  204. *ex = ret;
  205. return (ret);
  206. err:
  207. if ((ex == NULL) || (ret != *ex))
  208. X509_EXTENSION_free(ret);
  209. return (NULL);
  210. }
  211. int X509_EXTENSION_set_object(X509_EXTENSION *ex, ASN1_OBJECT *obj)
  212. {
  213. if ((ex == NULL) || (obj == NULL))
  214. return (0);
  215. ASN1_OBJECT_free(ex->object);
  216. ex->object = OBJ_dup(obj);
  217. return (1);
  218. }
  219. int X509_EXTENSION_set_critical(X509_EXTENSION *ex, int crit)
  220. {
  221. if (ex == NULL)
  222. return (0);
  223. ex->critical = (crit) ? 0xFF : -1;
  224. return (1);
  225. }
  226. int X509_EXTENSION_set_data(X509_EXTENSION *ex, ASN1_OCTET_STRING *data)
  227. {
  228. int i;
  229. if (ex == NULL)
  230. return (0);
  231. i = M_ASN1_OCTET_STRING_set(ex->value, data->data, data->length);
  232. if (!i)
  233. return (0);
  234. return (1);
  235. }
  236. ASN1_OBJECT *X509_EXTENSION_get_object(X509_EXTENSION *ex)
  237. {
  238. if (ex == NULL)
  239. return (NULL);
  240. return (ex->object);
  241. }
  242. ASN1_OCTET_STRING *X509_EXTENSION_get_data(X509_EXTENSION *ex)
  243. {
  244. if (ex == NULL)
  245. return (NULL);
  246. return (ex->value);
  247. }
  248. int X509_EXTENSION_get_critical(X509_EXTENSION *ex)
  249. {
  250. if (ex == NULL)
  251. return (0);
  252. if (ex->critical > 0)
  253. return 1;
  254. return 0;
  255. }