asn1_par.c 11 KB

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