asn1_par.c 12 KB

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