asn1_par.c 15 KB

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