asn1_lib.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483
  1. /* crypto/asn1/asn1_lib.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 <limits.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1.h>
  62. #include <openssl/asn1_mac.h>
  63. static int asn1_get_length(const unsigned char **pp, int *inf, long *rl,
  64. long max);
  65. static void asn1_put_length(unsigned char **pp, int length);
  66. const char ASN1_version[] = "ASN.1" OPENSSL_VERSION_PTEXT;
  67. static int _asn1_check_infinite_end(const unsigned char **p, long len)
  68. {
  69. /*
  70. * If there is 0 or 1 byte left, the length check should pick things up
  71. */
  72. if (len <= 0)
  73. return (1);
  74. else if ((len >= 2) && ((*p)[0] == 0) && ((*p)[1] == 0)) {
  75. (*p) += 2;
  76. return (1);
  77. }
  78. return (0);
  79. }
  80. int ASN1_check_infinite_end(unsigned char **p, long len)
  81. {
  82. return _asn1_check_infinite_end((const unsigned char **)p, len);
  83. }
  84. int ASN1_const_check_infinite_end(const unsigned char **p, long len)
  85. {
  86. return _asn1_check_infinite_end(p, len);
  87. }
  88. int ASN1_get_object(const unsigned char **pp, long *plength, int *ptag,
  89. int *pclass, long omax)
  90. {
  91. int i, ret;
  92. long l;
  93. const unsigned char *p = *pp;
  94. int tag, xclass, inf;
  95. long max = omax;
  96. if (!max)
  97. goto err;
  98. ret = (*p & V_ASN1_CONSTRUCTED);
  99. xclass = (*p & V_ASN1_PRIVATE);
  100. i = *p & V_ASN1_PRIMITIVE_TAG;
  101. if (i == V_ASN1_PRIMITIVE_TAG) { /* high-tag */
  102. p++;
  103. if (--max == 0)
  104. goto err;
  105. l = 0;
  106. while (*p & 0x80) {
  107. l <<= 7L;
  108. l |= *(p++) & 0x7f;
  109. if (--max == 0)
  110. goto err;
  111. if (l > (INT_MAX >> 7L))
  112. goto err;
  113. }
  114. l <<= 7L;
  115. l |= *(p++) & 0x7f;
  116. tag = (int)l;
  117. if (--max == 0)
  118. goto err;
  119. } else {
  120. tag = i;
  121. p++;
  122. if (--max == 0)
  123. goto err;
  124. }
  125. *ptag = tag;
  126. *pclass = xclass;
  127. if (!asn1_get_length(&p, &inf, plength, max))
  128. goto err;
  129. if (inf && !(ret & V_ASN1_CONSTRUCTED))
  130. goto err;
  131. #if 0
  132. fprintf(stderr, "p=%d + *plength=%ld > omax=%ld + *pp=%d (%d > %d)\n",
  133. (int)p, *plength, omax, (int)*pp, (int)(p + *plength),
  134. (int)(omax + *pp));
  135. #endif
  136. if (*plength > (omax - (p - *pp))) {
  137. ASN1err(ASN1_F_ASN1_GET_OBJECT, ASN1_R_TOO_LONG);
  138. /*
  139. * Set this so that even if things are not long enough the values are
  140. * set correctly
  141. */
  142. ret |= 0x80;
  143. }
  144. *pp = p;
  145. return (ret | inf);
  146. err:
  147. ASN1err(ASN1_F_ASN1_GET_OBJECT, ASN1_R_HEADER_TOO_LONG);
  148. return (0x80);
  149. }
  150. static int asn1_get_length(const unsigned char **pp, int *inf, long *rl,
  151. long max)
  152. {
  153. const unsigned char *p = *pp;
  154. unsigned long ret = 0;
  155. unsigned long i;
  156. if (max-- < 1)
  157. return 0;
  158. if (*p == 0x80) {
  159. *inf = 1;
  160. ret = 0;
  161. p++;
  162. } else {
  163. *inf = 0;
  164. i = *p & 0x7f;
  165. if (*(p++) & 0x80) {
  166. if (i > sizeof(ret) || max < (long)i)
  167. return 0;
  168. while (i-- > 0) {
  169. ret <<= 8L;
  170. ret |= *(p++);
  171. }
  172. } else
  173. ret = i;
  174. }
  175. if (ret > LONG_MAX)
  176. return 0;
  177. *pp = p;
  178. *rl = (long)ret;
  179. return 1;
  180. }
  181. /*
  182. * class 0 is constructed constructed == 2 for indefinite length constructed
  183. */
  184. void ASN1_put_object(unsigned char **pp, int constructed, int length, int tag,
  185. int xclass)
  186. {
  187. unsigned char *p = *pp;
  188. int i, ttag;
  189. i = (constructed) ? V_ASN1_CONSTRUCTED : 0;
  190. i |= (xclass & V_ASN1_PRIVATE);
  191. if (tag < 31)
  192. *(p++) = i | (tag & V_ASN1_PRIMITIVE_TAG);
  193. else {
  194. *(p++) = i | V_ASN1_PRIMITIVE_TAG;
  195. for (i = 0, ttag = tag; ttag > 0; i++)
  196. ttag >>= 7;
  197. ttag = i;
  198. while (i-- > 0) {
  199. p[i] = tag & 0x7f;
  200. if (i != (ttag - 1))
  201. p[i] |= 0x80;
  202. tag >>= 7;
  203. }
  204. p += ttag;
  205. }
  206. if (constructed == 2)
  207. *(p++) = 0x80;
  208. else
  209. asn1_put_length(&p, length);
  210. *pp = p;
  211. }
  212. int ASN1_put_eoc(unsigned char **pp)
  213. {
  214. unsigned char *p = *pp;
  215. *p++ = 0;
  216. *p++ = 0;
  217. *pp = p;
  218. return 2;
  219. }
  220. static void asn1_put_length(unsigned char **pp, int length)
  221. {
  222. unsigned char *p = *pp;
  223. int i, l;
  224. if (length <= 127)
  225. *(p++) = (unsigned char)length;
  226. else {
  227. l = length;
  228. for (i = 0; l > 0; i++)
  229. l >>= 8;
  230. *(p++) = i | 0x80;
  231. l = i;
  232. while (i-- > 0) {
  233. p[i] = length & 0xff;
  234. length >>= 8;
  235. }
  236. p += l;
  237. }
  238. *pp = p;
  239. }
  240. int ASN1_object_size(int constructed, int length, int tag)
  241. {
  242. int ret = 1;
  243. if (length < 0)
  244. return -1;
  245. if (tag >= 31) {
  246. while (tag > 0) {
  247. tag >>= 7;
  248. ret++;
  249. }
  250. }
  251. if (constructed == 2) {
  252. ret += 3;
  253. } else {
  254. ret++;
  255. if (length > 127) {
  256. int tmplen = length;
  257. while (tmplen > 0) {
  258. tmplen >>= 8;
  259. ret++;
  260. }
  261. }
  262. }
  263. if (ret >= INT_MAX - length)
  264. return -1;
  265. return ret + length;
  266. }
  267. static int _asn1_Finish(ASN1_const_CTX *c)
  268. {
  269. if ((c->inf == (1 | V_ASN1_CONSTRUCTED)) && (!c->eos)) {
  270. if (!ASN1_const_check_infinite_end(&c->p, c->slen)) {
  271. c->error = ERR_R_MISSING_ASN1_EOS;
  272. return (0);
  273. }
  274. }
  275. if (((c->slen != 0) && !(c->inf & 1)) || ((c->slen < 0) && (c->inf & 1))) {
  276. c->error = ERR_R_ASN1_LENGTH_MISMATCH;
  277. return (0);
  278. }
  279. return (1);
  280. }
  281. int asn1_Finish(ASN1_CTX *c)
  282. {
  283. return _asn1_Finish((ASN1_const_CTX *)c);
  284. }
  285. int asn1_const_Finish(ASN1_const_CTX *c)
  286. {
  287. return _asn1_Finish(c);
  288. }
  289. int asn1_GetSequence(ASN1_const_CTX *c, long *length)
  290. {
  291. const unsigned char *q;
  292. q = c->p;
  293. c->inf = ASN1_get_object(&(c->p), &(c->slen), &(c->tag), &(c->xclass),
  294. *length);
  295. if (c->inf & 0x80) {
  296. c->error = ERR_R_BAD_GET_ASN1_OBJECT_CALL;
  297. return (0);
  298. }
  299. if (c->tag != V_ASN1_SEQUENCE) {
  300. c->error = ERR_R_EXPECTING_AN_ASN1_SEQUENCE;
  301. return (0);
  302. }
  303. (*length) -= (c->p - q);
  304. if (c->max && (*length < 0)) {
  305. c->error = ERR_R_ASN1_LENGTH_MISMATCH;
  306. return (0);
  307. }
  308. if (c->inf == (1 | V_ASN1_CONSTRUCTED))
  309. c->slen = *length;
  310. c->eos = 0;
  311. return (1);
  312. }
  313. int ASN1_STRING_copy(ASN1_STRING *dst, const ASN1_STRING *str)
  314. {
  315. if (str == NULL)
  316. return 0;
  317. dst->type = str->type;
  318. if (!ASN1_STRING_set(dst, str->data, str->length))
  319. return 0;
  320. dst->flags = str->flags;
  321. return 1;
  322. }
  323. ASN1_STRING *ASN1_STRING_dup(const ASN1_STRING *str)
  324. {
  325. ASN1_STRING *ret;
  326. if (!str)
  327. return NULL;
  328. ret = ASN1_STRING_new();
  329. if (!ret)
  330. return NULL;
  331. if (!ASN1_STRING_copy(ret, str)) {
  332. ASN1_STRING_free(ret);
  333. return NULL;
  334. }
  335. return ret;
  336. }
  337. int ASN1_STRING_set(ASN1_STRING *str, const void *_data, int len)
  338. {
  339. unsigned char *c;
  340. const char *data = _data;
  341. if (len < 0) {
  342. if (data == NULL)
  343. return (0);
  344. else
  345. len = strlen(data);
  346. }
  347. if ((str->length <= len) || (str->data == NULL)) {
  348. c = str->data;
  349. if (c == NULL)
  350. str->data = OPENSSL_malloc(len + 1);
  351. else
  352. str->data = OPENSSL_realloc(c, len + 1);
  353. if (str->data == NULL) {
  354. ASN1err(ASN1_F_ASN1_STRING_SET, ERR_R_MALLOC_FAILURE);
  355. str->data = c;
  356. return (0);
  357. }
  358. }
  359. str->length = len;
  360. if (data != NULL) {
  361. memcpy(str->data, data, len);
  362. /* an allowance for strings :-) */
  363. str->data[len] = '\0';
  364. }
  365. return (1);
  366. }
  367. void ASN1_STRING_set0(ASN1_STRING *str, void *data, int len)
  368. {
  369. if (str->data)
  370. OPENSSL_free(str->data);
  371. str->data = data;
  372. str->length = len;
  373. }
  374. ASN1_STRING *ASN1_STRING_new(void)
  375. {
  376. return (ASN1_STRING_type_new(V_ASN1_OCTET_STRING));
  377. }
  378. ASN1_STRING *ASN1_STRING_type_new(int type)
  379. {
  380. ASN1_STRING *ret;
  381. ret = (ASN1_STRING *)OPENSSL_malloc(sizeof(ASN1_STRING));
  382. if (ret == NULL) {
  383. ASN1err(ASN1_F_ASN1_STRING_TYPE_NEW, ERR_R_MALLOC_FAILURE);
  384. return (NULL);
  385. }
  386. ret->length = 0;
  387. ret->type = type;
  388. ret->data = NULL;
  389. ret->flags = 0;
  390. return (ret);
  391. }
  392. void ASN1_STRING_free(ASN1_STRING *a)
  393. {
  394. if (a == NULL)
  395. return;
  396. if (a->data && !(a->flags & ASN1_STRING_FLAG_NDEF))
  397. OPENSSL_free(a->data);
  398. OPENSSL_free(a);
  399. }
  400. void ASN1_STRING_clear_free(ASN1_STRING *a)
  401. {
  402. if (a && a->data && !(a->flags & ASN1_STRING_FLAG_NDEF))
  403. OPENSSL_cleanse(a->data, a->length);
  404. ASN1_STRING_free(a);
  405. }
  406. int ASN1_STRING_cmp(const ASN1_STRING *a, const ASN1_STRING *b)
  407. {
  408. int i;
  409. i = (a->length - b->length);
  410. if (i == 0) {
  411. i = memcmp(a->data, b->data, a->length);
  412. if (i == 0)
  413. return (a->type - b->type);
  414. else
  415. return (i);
  416. } else
  417. return (i);
  418. }
  419. void asn1_add_error(const unsigned char *address, int offset)
  420. {
  421. char buf1[DECIMAL_SIZE(address) + 1], buf2[DECIMAL_SIZE(offset) + 1];
  422. BIO_snprintf(buf1, sizeof(buf1), "%lu", (unsigned long)address);
  423. BIO_snprintf(buf2, sizeof(buf2), "%d", offset);
  424. ERR_add_error_data(4, "address=", buf1, " offset=", buf2);
  425. }
  426. int ASN1_STRING_length(const ASN1_STRING *x)
  427. {
  428. return M_ASN1_STRING_length(x);
  429. }
  430. void ASN1_STRING_length_set(ASN1_STRING *x, int len)
  431. {
  432. M_ASN1_STRING_length_set(x, len);
  433. return;
  434. }
  435. int ASN1_STRING_type(ASN1_STRING *x)
  436. {
  437. return M_ASN1_STRING_type(x);
  438. }
  439. unsigned char *ASN1_STRING_data(ASN1_STRING *x)
  440. {
  441. return M_ASN1_STRING_data(x);
  442. }