x509_v3.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274
  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) return(0);
  69. return(sk_X509_EXTENSION_num(x));
  70. }
  71. int X509v3_get_ext_by_NID(const STACK_OF(X509_EXTENSION) *x, int nid,
  72. int lastpos)
  73. {
  74. ASN1_OBJECT *obj;
  75. obj=OBJ_nid2obj(nid);
  76. if (obj == NULL) return(-2);
  77. return(X509v3_get_ext_by_OBJ(x,obj,lastpos));
  78. }
  79. int X509v3_get_ext_by_OBJ(const STACK_OF(X509_EXTENSION) *sk, ASN1_OBJECT *obj,
  80. int lastpos)
  81. {
  82. int n;
  83. X509_EXTENSION *ex;
  84. if (sk == NULL) return(-1);
  85. lastpos++;
  86. if (lastpos < 0)
  87. lastpos=0;
  88. n=sk_X509_EXTENSION_num(sk);
  89. for ( ; lastpos < n; lastpos++)
  90. {
  91. ex=sk_X509_EXTENSION_value(sk,lastpos);
  92. if (OBJ_cmp(ex->object,obj) == 0)
  93. return(lastpos);
  94. }
  95. return(-1);
  96. }
  97. int X509v3_get_ext_by_critical(const STACK_OF(X509_EXTENSION) *sk, int crit,
  98. int lastpos)
  99. {
  100. int n;
  101. X509_EXTENSION *ex;
  102. if (sk == NULL) return(-1);
  103. lastpos++;
  104. if (lastpos < 0)
  105. lastpos=0;
  106. n=sk_X509_EXTENSION_num(sk);
  107. for ( ; lastpos < n; lastpos++)
  108. {
  109. ex=sk_X509_EXTENSION_value(sk,lastpos);
  110. if ( ((ex->critical > 0) && crit) ||
  111. ((ex->critical <= 0) && !crit))
  112. return(lastpos);
  113. }
  114. return(-1);
  115. }
  116. X509_EXTENSION *X509v3_get_ext(const STACK_OF(X509_EXTENSION) *x, int loc)
  117. {
  118. if (x == NULL || sk_X509_EXTENSION_num(x) <= loc || loc < 0)
  119. return NULL;
  120. else
  121. return sk_X509_EXTENSION_value(x,loc);
  122. }
  123. X509_EXTENSION *X509v3_delete_ext(STACK_OF(X509_EXTENSION) *x, int loc)
  124. {
  125. X509_EXTENSION *ret;
  126. if (x == NULL || sk_X509_EXTENSION_num(x) <= loc || loc < 0)
  127. return(NULL);
  128. ret=sk_X509_EXTENSION_delete(x,loc);
  129. return(ret);
  130. }
  131. STACK_OF(X509_EXTENSION) *X509v3_add_ext(STACK_OF(X509_EXTENSION) **x,
  132. X509_EXTENSION *ex, int loc)
  133. {
  134. X509_EXTENSION *new_ex=NULL;
  135. int n;
  136. STACK_OF(X509_EXTENSION) *sk=NULL;
  137. if (x == NULL)
  138. {
  139. X509err(X509_F_X509V3_ADD_EXT,ERR_R_PASSED_NULL_PARAMETER);
  140. goto err2;
  141. }
  142. if (*x == NULL)
  143. {
  144. if ((sk=sk_X509_EXTENSION_new_null()) == NULL)
  145. goto err;
  146. }
  147. else
  148. sk= *x;
  149. n=sk_X509_EXTENSION_num(sk);
  150. if (loc > n) loc=n;
  151. else if (loc < 0) 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) X509_EXTENSION_free(new_ex);
  163. if (sk != NULL) sk_X509_EXTENSION_free(sk);
  164. return(NULL);
  165. }
  166. X509_EXTENSION *X509_EXTENSION_create_by_NID(X509_EXTENSION **ex, int nid,
  167. int crit, ASN1_OCTET_STRING *data)
  168. {
  169. ASN1_OBJECT *obj;
  170. X509_EXTENSION *ret;
  171. obj=OBJ_nid2obj(nid);
  172. if (obj == NULL)
  173. {
  174. X509err(X509_F_X509_EXTENSION_CREATE_BY_NID,X509_R_UNKNOWN_NID);
  175. return(NULL);
  176. }
  177. ret=X509_EXTENSION_create_by_OBJ(ex,obj,crit,data);
  178. if (ret == NULL) ASN1_OBJECT_free(obj);
  179. return(ret);
  180. }
  181. X509_EXTENSION *X509_EXTENSION_create_by_OBJ(X509_EXTENSION **ex,
  182. ASN1_OBJECT *obj, int crit, ASN1_OCTET_STRING *data)
  183. {
  184. X509_EXTENSION *ret;
  185. if ((ex == NULL) || (*ex == NULL))
  186. {
  187. if ((ret=X509_EXTENSION_new()) == NULL)
  188. {
  189. X509err(X509_F_X509_EXTENSION_CREATE_BY_OBJ,ERR_R_MALLOC_FAILURE);
  190. return(NULL);
  191. }
  192. }
  193. else
  194. ret= *ex;
  195. if (!X509_EXTENSION_set_object(ret,obj))
  196. goto err;
  197. if (!X509_EXTENSION_set_critical(ret,crit))
  198. goto err;
  199. if (!X509_EXTENSION_set_data(ret,data))
  200. goto err;
  201. if ((ex != NULL) && (*ex == NULL)) *ex=ret;
  202. return(ret);
  203. err:
  204. if ((ex == NULL) || (ret != *ex))
  205. X509_EXTENSION_free(ret);
  206. return(NULL);
  207. }
  208. int X509_EXTENSION_set_object(X509_EXTENSION *ex, ASN1_OBJECT *obj)
  209. {
  210. if ((ex == NULL) || (obj == NULL))
  211. return(0);
  212. ASN1_OBJECT_free(ex->object);
  213. ex->object=OBJ_dup(obj);
  214. return(1);
  215. }
  216. int X509_EXTENSION_set_critical(X509_EXTENSION *ex, int crit)
  217. {
  218. if (ex == NULL) return(0);
  219. ex->critical=(crit)?0xFF:-1;
  220. return(1);
  221. }
  222. int X509_EXTENSION_set_data(X509_EXTENSION *ex, ASN1_OCTET_STRING *data)
  223. {
  224. int i;
  225. if (ex == NULL) return(0);
  226. i=M_ASN1_OCTET_STRING_set(ex->value,data->data,data->length);
  227. if (!i) return(0);
  228. return(1);
  229. }
  230. ASN1_OBJECT *X509_EXTENSION_get_object(X509_EXTENSION *ex)
  231. {
  232. if (ex == NULL) return(NULL);
  233. return(ex->object);
  234. }
  235. ASN1_OCTET_STRING *X509_EXTENSION_get_data(X509_EXTENSION *ex)
  236. {
  237. if (ex == NULL) return(NULL);
  238. return(ex->value);
  239. }
  240. int X509_EXTENSION_get_critical(X509_EXTENSION *ex)
  241. {
  242. if (ex == NULL) return(0);
  243. if(ex->critical > 0) return 1;
  244. return 0;
  245. }