asn1_par.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424
  1. /* crypto/asn1/asn1_par.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 "cryptlib.h"
  60. #include <openssl/buffer.h>
  61. #include <openssl/objects.h>
  62. #include <openssl/asn1.h>
  63. #ifndef ASN1_PARSE_MAXDEPTH
  64. #define ASN1_PARSE_MAXDEPTH 128
  65. #endif
  66. static int asn1_print_info(BIO *bp, int tag, int xclass, int constructed,
  67. int indent);
  68. static int asn1_parse2(BIO *bp, const unsigned char **pp, long length,
  69. int offset, int depth, int indent, int dump);
  70. static int asn1_print_info(BIO *bp, int tag, int xclass, int constructed,
  71. int indent)
  72. {
  73. static const char fmt[] = "%-18s";
  74. char str[128];
  75. const char *p;
  76. if (constructed & V_ASN1_CONSTRUCTED)
  77. p = "cons: ";
  78. else
  79. p = "prim: ";
  80. if (BIO_write(bp, p, 6) < 6)
  81. goto err;
  82. BIO_indent(bp, indent, 128);
  83. p = str;
  84. if ((xclass & V_ASN1_PRIVATE) == V_ASN1_PRIVATE)
  85. BIO_snprintf(str, sizeof str, "priv [ %d ] ", tag);
  86. else if ((xclass & V_ASN1_CONTEXT_SPECIFIC) == V_ASN1_CONTEXT_SPECIFIC)
  87. BIO_snprintf(str, sizeof str, "cont [ %d ]", tag);
  88. else if ((xclass & V_ASN1_APPLICATION) == V_ASN1_APPLICATION)
  89. BIO_snprintf(str, sizeof str, "appl [ %d ]", tag);
  90. else if (tag > 30)
  91. BIO_snprintf(str, sizeof str, "<ASN1 %d>", tag);
  92. else
  93. p = ASN1_tag2str(tag);
  94. if (BIO_printf(bp, fmt, p) <= 0)
  95. goto err;
  96. return (1);
  97. err:
  98. return (0);
  99. }
  100. int ASN1_parse(BIO *bp, const unsigned char *pp, long len, int indent)
  101. {
  102. return (asn1_parse2(bp, &pp, len, 0, 0, indent, 0));
  103. }
  104. int ASN1_parse_dump(BIO *bp, const unsigned char *pp, long len, int indent,
  105. int dump)
  106. {
  107. return (asn1_parse2(bp, &pp, len, 0, 0, indent, dump));
  108. }
  109. static int asn1_parse2(BIO *bp, const unsigned char **pp, long length,
  110. int offset, int depth, int indent, int dump)
  111. {
  112. const unsigned char *p, *ep, *tot, *op, *opp;
  113. long len;
  114. int tag, xclass, ret = 0;
  115. int nl, hl, j, r;
  116. ASN1_OBJECT *o = NULL;
  117. ASN1_OCTET_STRING *os = NULL;
  118. /* ASN1_BMPSTRING *bmp=NULL; */
  119. int dump_indent;
  120. #if 0
  121. dump_indent = indent;
  122. #else
  123. dump_indent = 6; /* Because we know BIO_dump_indent() */
  124. #endif
  125. if (depth > ASN1_PARSE_MAXDEPTH) {
  126. BIO_puts(bp, "BAD RECURSION DEPTH\n");
  127. return 0;
  128. }
  129. p = *pp;
  130. tot = p + length;
  131. op = p - 1;
  132. while ((p < tot) && (op < p)) {
  133. op = p;
  134. j = ASN1_get_object(&p, &len, &tag, &xclass, length);
  135. #ifdef LINT
  136. j = j;
  137. #endif
  138. if (j & 0x80) {
  139. if (BIO_write(bp, "Error in encoding\n", 18) <= 0)
  140. goto end;
  141. ret = 0;
  142. goto end;
  143. }
  144. hl = (p - op);
  145. length -= hl;
  146. /*
  147. * if j == 0x21 it is a constructed indefinite length object
  148. */
  149. if (BIO_printf(bp, "%5ld:", (long)offset + (long)(op - *pp))
  150. <= 0)
  151. goto end;
  152. if (j != (V_ASN1_CONSTRUCTED | 1)) {
  153. if (BIO_printf(bp, "d=%-2d hl=%ld l=%4ld ",
  154. depth, (long)hl, len) <= 0)
  155. goto end;
  156. } else {
  157. if (BIO_printf(bp, "d=%-2d hl=%ld l=inf ", depth, (long)hl) <= 0)
  158. goto end;
  159. }
  160. if (!asn1_print_info(bp, tag, xclass, j, (indent) ? depth : 0))
  161. goto end;
  162. if (j & V_ASN1_CONSTRUCTED) {
  163. const unsigned char *sp;
  164. ep = p + len;
  165. if (BIO_write(bp, "\n", 1) <= 0)
  166. goto end;
  167. if (len > length) {
  168. BIO_printf(bp, "length is greater than %ld\n", length);
  169. ret = 0;
  170. goto end;
  171. }
  172. if ((j == 0x21) && (len == 0)) {
  173. sp = p;
  174. for (;;) {
  175. r = asn1_parse2(bp, &p, (long)(tot - p),
  176. offset + (p - *pp), depth + 1,
  177. indent, dump);
  178. if (r == 0) {
  179. ret = 0;
  180. goto end;
  181. }
  182. if ((r == 2) || (p >= tot)) {
  183. len = p - sp;
  184. break;
  185. }
  186. }
  187. } else {
  188. long tmp = len;
  189. while (p < ep) {
  190. sp = p;
  191. r = asn1_parse2(bp, &p, tmp, offset + (p - *pp), depth + 1,
  192. indent, dump);
  193. if (r == 0) {
  194. ret = 0;
  195. goto end;
  196. }
  197. tmp -= p - sp;
  198. }
  199. }
  200. } else if (xclass != 0) {
  201. p += len;
  202. if (BIO_write(bp, "\n", 1) <= 0)
  203. goto end;
  204. } else {
  205. nl = 0;
  206. if ((tag == V_ASN1_PRINTABLESTRING) ||
  207. (tag == V_ASN1_T61STRING) ||
  208. (tag == V_ASN1_IA5STRING) ||
  209. (tag == V_ASN1_VISIBLESTRING) ||
  210. (tag == V_ASN1_NUMERICSTRING) ||
  211. (tag == V_ASN1_UTF8STRING) ||
  212. (tag == V_ASN1_UTCTIME) || (tag == V_ASN1_GENERALIZEDTIME)) {
  213. if (BIO_write(bp, ":", 1) <= 0)
  214. goto end;
  215. if ((len > 0) && BIO_write(bp, (const char *)p, (int)len)
  216. != (int)len)
  217. goto end;
  218. } else if (tag == V_ASN1_OBJECT) {
  219. opp = op;
  220. if (d2i_ASN1_OBJECT(&o, &opp, len + hl) != NULL) {
  221. if (BIO_write(bp, ":", 1) <= 0)
  222. goto end;
  223. i2a_ASN1_OBJECT(bp, o);
  224. } else {
  225. if (BIO_write(bp, ":BAD OBJECT", 11) <= 0)
  226. goto end;
  227. }
  228. } else if (tag == V_ASN1_BOOLEAN) {
  229. int ii;
  230. opp = op;
  231. ii = d2i_ASN1_BOOLEAN(NULL, &opp, len + hl);
  232. if (ii < 0) {
  233. if (BIO_write(bp, "Bad boolean\n", 12) <= 0)
  234. goto end;
  235. }
  236. BIO_printf(bp, ":%d", ii);
  237. } else if (tag == V_ASN1_BMPSTRING) {
  238. /* do the BMP thang */
  239. } else if (tag == V_ASN1_OCTET_STRING) {
  240. int i, printable = 1;
  241. opp = op;
  242. os = d2i_ASN1_OCTET_STRING(NULL, &opp, len + hl);
  243. if (os != NULL && os->length > 0) {
  244. opp = os->data;
  245. /*
  246. * testing whether the octet string is printable
  247. */
  248. for (i = 0; i < os->length; i++) {
  249. if (((opp[i] < ' ') &&
  250. (opp[i] != '\n') &&
  251. (opp[i] != '\r') &&
  252. (opp[i] != '\t')) || (opp[i] > '~')) {
  253. printable = 0;
  254. break;
  255. }
  256. }
  257. if (printable)
  258. /* printable string */
  259. {
  260. if (BIO_write(bp, ":", 1) <= 0)
  261. goto end;
  262. if (BIO_write(bp, (const char *)opp, os->length) <= 0)
  263. goto end;
  264. } else if (!dump)
  265. /*
  266. * not printable => print octet string as hex dump
  267. */
  268. {
  269. if (BIO_write(bp, "[HEX DUMP]:", 11) <= 0)
  270. goto end;
  271. for (i = 0; i < os->length; i++) {
  272. if (BIO_printf(bp, "%02X", opp[i]) <= 0)
  273. goto end;
  274. }
  275. } else
  276. /* print the normal dump */
  277. {
  278. if (!nl) {
  279. if (BIO_write(bp, "\n", 1) <= 0)
  280. goto end;
  281. }
  282. if (BIO_dump_indent(bp,
  283. (const char *)opp,
  284. ((dump == -1 || dump >
  285. os->
  286. length) ? os->length : dump),
  287. dump_indent) <= 0)
  288. goto end;
  289. nl = 1;
  290. }
  291. }
  292. if (os != NULL) {
  293. M_ASN1_OCTET_STRING_free(os);
  294. os = NULL;
  295. }
  296. } else if (tag == V_ASN1_INTEGER) {
  297. ASN1_INTEGER *bs;
  298. int i;
  299. opp = op;
  300. bs = d2i_ASN1_INTEGER(NULL, &opp, len + hl);
  301. if (bs != NULL) {
  302. if (BIO_write(bp, ":", 1) <= 0)
  303. goto end;
  304. if (bs->type == V_ASN1_NEG_INTEGER)
  305. if (BIO_write(bp, "-", 1) <= 0)
  306. goto end;
  307. for (i = 0; i < bs->length; i++) {
  308. if (BIO_printf(bp, "%02X", bs->data[i]) <= 0)
  309. goto end;
  310. }
  311. if (bs->length == 0) {
  312. if (BIO_write(bp, "00", 2) <= 0)
  313. goto end;
  314. }
  315. } else {
  316. if (BIO_write(bp, "BAD INTEGER", 11) <= 0)
  317. goto end;
  318. }
  319. M_ASN1_INTEGER_free(bs);
  320. } else if (tag == V_ASN1_ENUMERATED) {
  321. ASN1_ENUMERATED *bs;
  322. int i;
  323. opp = op;
  324. bs = d2i_ASN1_ENUMERATED(NULL, &opp, len + hl);
  325. if (bs != NULL) {
  326. if (BIO_write(bp, ":", 1) <= 0)
  327. goto end;
  328. if (bs->type == V_ASN1_NEG_ENUMERATED)
  329. if (BIO_write(bp, "-", 1) <= 0)
  330. goto end;
  331. for (i = 0; i < bs->length; i++) {
  332. if (BIO_printf(bp, "%02X", bs->data[i]) <= 0)
  333. goto end;
  334. }
  335. if (bs->length == 0) {
  336. if (BIO_write(bp, "00", 2) <= 0)
  337. goto end;
  338. }
  339. } else {
  340. if (BIO_write(bp, "BAD ENUMERATED", 14) <= 0)
  341. goto end;
  342. }
  343. M_ASN1_ENUMERATED_free(bs);
  344. } else if (len > 0 && dump) {
  345. if (!nl) {
  346. if (BIO_write(bp, "\n", 1) <= 0)
  347. goto end;
  348. }
  349. if (BIO_dump_indent(bp, (const char *)p,
  350. ((dump == -1 || dump > len) ? len : dump),
  351. dump_indent) <= 0)
  352. goto end;
  353. nl = 1;
  354. }
  355. if (!nl) {
  356. if (BIO_write(bp, "\n", 1) <= 0)
  357. goto end;
  358. }
  359. p += len;
  360. if ((tag == V_ASN1_EOC) && (xclass == 0)) {
  361. ret = 2; /* End of sequence */
  362. goto end;
  363. }
  364. }
  365. length -= len;
  366. }
  367. ret = 1;
  368. end:
  369. if (o != NULL)
  370. ASN1_OBJECT_free(o);
  371. if (os != NULL)
  372. M_ASN1_OCTET_STRING_free(os);
  373. *pp = p;
  374. return (ret);
  375. }
  376. const char *ASN1_tag2str(int tag)
  377. {
  378. static const char *const tag2str[] = {
  379. /* 0-4 */
  380. "EOC", "BOOLEAN", "INTEGER", "BIT STRING", "OCTET STRING",
  381. /* 5-9 */
  382. "NULL", "OBJECT", "OBJECT DESCRIPTOR", "EXTERNAL", "REAL",
  383. /* 10-13 */
  384. "ENUMERATED", "<ASN1 11>", "UTF8STRING", "<ASN1 13>",
  385. /* 15-17 */
  386. "<ASN1 14>", "<ASN1 15>", "SEQUENCE", "SET",
  387. /* 18-20 */
  388. "NUMERICSTRING", "PRINTABLESTRING", "T61STRING",
  389. /* 21-24 */
  390. "VIDEOTEXSTRING", "IA5STRING", "UTCTIME", "GENERALIZEDTIME",
  391. /* 25-27 */
  392. "GRAPHICSTRING", "VISIBLESTRING", "GENERALSTRING",
  393. /* 28-30 */
  394. "UNIVERSALSTRING", "<ASN1 29>", "BMPSTRING"
  395. };
  396. if ((tag == V_ASN1_NEG_INTEGER) || (tag == V_ASN1_NEG_ENUMERATED))
  397. tag &= ~0x100;
  398. if (tag < 0 || tag > 30)
  399. return "(unknown)";
  400. return tag2str[tag];
  401. }