asn1_par.c 15 KB

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