asn1_lib.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462
  1. /* crypto/asn1/asn1_lib.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 <limits.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1.h>
  62. #include <openssl/asn1_mac.h>
  63. static int asn1_get_length(const unsigned char **pp,int *inf,long *rl,int max);
  64. static void asn1_put_length(unsigned char **pp, int length);
  65. const char ASN1_version[]="ASN.1" OPENSSL_VERSION_PTEXT;
  66. static int _asn1_check_infinite_end(const unsigned char **p, long len)
  67. {
  68. /* If there is 0 or 1 byte left, the length check should pick
  69. * things up */
  70. if (len <= 0)
  71. return(1);
  72. else if ((len >= 2) && ((*p)[0] == 0) && ((*p)[1] == 0))
  73. {
  74. (*p)+=2;
  75. return(1);
  76. }
  77. return(0);
  78. }
  79. int ASN1_check_infinite_end(unsigned char **p, long len)
  80. {
  81. return _asn1_check_infinite_end((const unsigned char **)p, len);
  82. }
  83. int ASN1_const_check_infinite_end(const unsigned char **p, long len)
  84. {
  85. return _asn1_check_infinite_end(p, len);
  86. }
  87. int ASN1_get_object(const unsigned char **pp, long *plength, int *ptag,
  88. int *pclass, long omax)
  89. {
  90. int i,ret;
  91. long l;
  92. const unsigned char *p= *pp;
  93. int tag,xclass,inf;
  94. long max=omax;
  95. if (!max) goto err;
  96. ret=(*p&V_ASN1_CONSTRUCTED);
  97. xclass=(*p&V_ASN1_PRIVATE);
  98. i= *p&V_ASN1_PRIMITIVE_TAG;
  99. if (i == V_ASN1_PRIMITIVE_TAG)
  100. { /* high-tag */
  101. p++;
  102. if (--max == 0) goto err;
  103. l=0;
  104. while (*p&0x80)
  105. {
  106. l<<=7L;
  107. l|= *(p++)&0x7f;
  108. if (--max == 0) goto err;
  109. if (l > (INT_MAX >> 7L)) goto err;
  110. }
  111. l<<=7L;
  112. l|= *(p++)&0x7f;
  113. tag=(int)l;
  114. if (--max == 0) goto err;
  115. }
  116. else
  117. {
  118. tag=i;
  119. p++;
  120. if (--max == 0) goto err;
  121. }
  122. *ptag=tag;
  123. *pclass=xclass;
  124. if (!asn1_get_length(&p,&inf,plength,(int)max)) goto err;
  125. #if 0
  126. fprintf(stderr,"p=%d + *plength=%ld > omax=%ld + *pp=%d (%d > %d)\n",
  127. (int)p,*plength,omax,(int)*pp,(int)(p+ *plength),
  128. (int)(omax+ *pp));
  129. #endif
  130. if (*plength > (omax - (p - *pp)))
  131. {
  132. ASN1err(ASN1_F_ASN1_GET_OBJECT,ASN1_R_TOO_LONG);
  133. /* Set this so that even if things are not long enough
  134. * the values are set correctly */
  135. ret|=0x80;
  136. }
  137. *pp=p;
  138. return(ret|inf);
  139. err:
  140. ASN1err(ASN1_F_ASN1_GET_OBJECT,ASN1_R_HEADER_TOO_LONG);
  141. return(0x80);
  142. }
  143. static int asn1_get_length(const unsigned char **pp, int *inf, long *rl, int max)
  144. {
  145. const unsigned char *p= *pp;
  146. unsigned long ret=0;
  147. unsigned int i;
  148. if (max-- < 1) return(0);
  149. if (*p == 0x80)
  150. {
  151. *inf=1;
  152. ret=0;
  153. p++;
  154. }
  155. else
  156. {
  157. *inf=0;
  158. i= *p&0x7f;
  159. if (*(p++) & 0x80)
  160. {
  161. if (i > sizeof(long))
  162. return 0;
  163. if (max-- == 0) return(0);
  164. while (i-- > 0)
  165. {
  166. ret<<=8L;
  167. ret|= *(p++);
  168. if (max-- == 0) return(0);
  169. }
  170. }
  171. else
  172. ret=i;
  173. }
  174. if (ret > LONG_MAX)
  175. return 0;
  176. *pp=p;
  177. *rl=(long)ret;
  178. return(1);
  179. }
  180. /* class 0 is constructed
  181. * constructed == 2 for indefinite length constructed */
  182. void ASN1_put_object(unsigned char **pp, int constructed, int length, int tag,
  183. int xclass)
  184. {
  185. unsigned char *p= *pp;
  186. int i, ttag;
  187. i=(constructed)?V_ASN1_CONSTRUCTED:0;
  188. i|=(xclass&V_ASN1_PRIVATE);
  189. if (tag < 31)
  190. *(p++)=i|(tag&V_ASN1_PRIMITIVE_TAG);
  191. else
  192. {
  193. *(p++)=i|V_ASN1_PRIMITIVE_TAG;
  194. for(i = 0, ttag = tag; ttag > 0; i++) ttag >>=7;
  195. ttag = i;
  196. while(i-- > 0)
  197. {
  198. p[i] = tag & 0x7f;
  199. if(i != (ttag - 1)) p[i] |= 0x80;
  200. tag >>= 7;
  201. }
  202. p += ttag;
  203. }
  204. if (constructed == 2)
  205. *(p++)=0x80;
  206. else
  207. asn1_put_length(&p,length);
  208. *pp=p;
  209. }
  210. int ASN1_put_eoc(unsigned char **pp)
  211. {
  212. unsigned char *p = *pp;
  213. *p++ = 0;
  214. *p++ = 0;
  215. *pp = p;
  216. return 2;
  217. }
  218. static void asn1_put_length(unsigned char **pp, int length)
  219. {
  220. unsigned char *p= *pp;
  221. int i,l;
  222. if (length <= 127)
  223. *(p++)=(unsigned char)length;
  224. else
  225. {
  226. l=length;
  227. for (i=0; l > 0; i++)
  228. l>>=8;
  229. *(p++)=i|0x80;
  230. l=i;
  231. while (i-- > 0)
  232. {
  233. p[i]=length&0xff;
  234. length>>=8;
  235. }
  236. p+=l;
  237. }
  238. *pp=p;
  239. }
  240. int ASN1_object_size(int constructed, int length, int tag)
  241. {
  242. int ret;
  243. ret=length;
  244. ret++;
  245. if (tag >= 31)
  246. {
  247. while (tag > 0)
  248. {
  249. tag>>=7;
  250. ret++;
  251. }
  252. }
  253. if (constructed == 2)
  254. return ret + 3;
  255. ret++;
  256. if (length > 127)
  257. {
  258. while (length > 0)
  259. {
  260. length>>=8;
  261. ret++;
  262. }
  263. }
  264. return(ret);
  265. }
  266. static int _asn1_Finish(ASN1_const_CTX *c)
  267. {
  268. if ((c->inf == (1|V_ASN1_CONSTRUCTED)) && (!c->eos))
  269. {
  270. if (!ASN1_const_check_infinite_end(&c->p,c->slen))
  271. {
  272. c->error=ERR_R_MISSING_ASN1_EOS;
  273. return(0);
  274. }
  275. }
  276. if ( ((c->slen != 0) && !(c->inf & 1)) ||
  277. ((c->slen < 0) && (c->inf & 1)))
  278. {
  279. c->error=ERR_R_ASN1_LENGTH_MISMATCH;
  280. return(0);
  281. }
  282. return(1);
  283. }
  284. int asn1_Finish(ASN1_CTX *c)
  285. {
  286. return _asn1_Finish((ASN1_const_CTX *)c);
  287. }
  288. int asn1_const_Finish(ASN1_const_CTX *c)
  289. {
  290. return _asn1_Finish(c);
  291. }
  292. int asn1_GetSequence(ASN1_const_CTX *c, long *length)
  293. {
  294. const unsigned char *q;
  295. q=c->p;
  296. c->inf=ASN1_get_object(&(c->p),&(c->slen),&(c->tag),&(c->xclass),
  297. *length);
  298. if (c->inf & 0x80)
  299. {
  300. c->error=ERR_R_BAD_GET_ASN1_OBJECT_CALL;
  301. return(0);
  302. }
  303. if (c->tag != V_ASN1_SEQUENCE)
  304. {
  305. c->error=ERR_R_EXPECTING_AN_ASN1_SEQUENCE;
  306. return(0);
  307. }
  308. (*length)-=(c->p-q);
  309. if (c->max && (*length < 0))
  310. {
  311. c->error=ERR_R_ASN1_LENGTH_MISMATCH;
  312. return(0);
  313. }
  314. if (c->inf == (1|V_ASN1_CONSTRUCTED))
  315. c->slen= *length+ *(c->pp)-c->p;
  316. c->eos=0;
  317. return(1);
  318. }
  319. ASN1_STRING *ASN1_STRING_dup(ASN1_STRING *str)
  320. {
  321. ASN1_STRING *ret;
  322. if (str == NULL) return(NULL);
  323. if ((ret=ASN1_STRING_type_new(str->type)) == NULL)
  324. return(NULL);
  325. if (!ASN1_STRING_set(ret,str->data,str->length))
  326. {
  327. ASN1_STRING_free(ret);
  328. return(NULL);
  329. }
  330. ret->flags = str->flags;
  331. return(ret);
  332. }
  333. int ASN1_STRING_set(ASN1_STRING *str, const void *_data, int len)
  334. {
  335. unsigned char *c;
  336. const char *data=_data;
  337. if (len < 0)
  338. {
  339. if (data == NULL)
  340. return(0);
  341. else
  342. len=strlen(data);
  343. }
  344. if ((str->length < len) || (str->data == NULL))
  345. {
  346. c=str->data;
  347. if (c == NULL)
  348. str->data=OPENSSL_malloc(len+1);
  349. else
  350. str->data=OPENSSL_realloc(c,len+1);
  351. if (str->data == NULL)
  352. {
  353. ASN1err(ASN1_F_ASN1_STRING_SET,ERR_R_MALLOC_FAILURE);
  354. str->data=c;
  355. return(0);
  356. }
  357. }
  358. str->length=len;
  359. if (data != NULL)
  360. {
  361. memcpy(str->data,data,len);
  362. /* an allowance for strings :-) */
  363. str->data[len]='\0';
  364. }
  365. return(1);
  366. }
  367. ASN1_STRING *ASN1_STRING_new(void)
  368. {
  369. return(ASN1_STRING_type_new(V_ASN1_OCTET_STRING));
  370. }
  371. ASN1_STRING *ASN1_STRING_type_new(int type)
  372. {
  373. ASN1_STRING *ret;
  374. ret=(ASN1_STRING *)OPENSSL_malloc(sizeof(ASN1_STRING));
  375. if (ret == NULL)
  376. {
  377. ASN1err(ASN1_F_ASN1_STRING_TYPE_NEW,ERR_R_MALLOC_FAILURE);
  378. return(NULL);
  379. }
  380. ret->length=0;
  381. ret->type=type;
  382. ret->data=NULL;
  383. ret->flags=0;
  384. return(ret);
  385. }
  386. void ASN1_STRING_free(ASN1_STRING *a)
  387. {
  388. if (a == NULL) return;
  389. if (a->data != NULL) OPENSSL_free(a->data);
  390. OPENSSL_free(a);
  391. }
  392. int ASN1_STRING_cmp(ASN1_STRING *a, ASN1_STRING *b)
  393. {
  394. int i;
  395. i=(a->length-b->length);
  396. if (i == 0)
  397. {
  398. i=memcmp(a->data,b->data,a->length);
  399. if (i == 0)
  400. return(a->type-b->type);
  401. else
  402. return(i);
  403. }
  404. else
  405. return(i);
  406. }
  407. void asn1_add_error(const unsigned char *address, int offset)
  408. {
  409. char buf1[DECIMAL_SIZE(address)+1],buf2[DECIMAL_SIZE(offset)+1];
  410. BIO_snprintf(buf1,sizeof buf1,"%lu",(unsigned long)address);
  411. BIO_snprintf(buf2,sizeof buf2,"%d",offset);
  412. ERR_add_error_data(4,"address=",buf1," offset=",buf2);
  413. }
  414. int ASN1_STRING_length(ASN1_STRING *x)
  415. { return M_ASN1_STRING_length(x); }
  416. void ASN1_STRING_length_set(ASN1_STRING *x, int len)
  417. { M_ASN1_STRING_length_set(x, len); return; }
  418. int ASN1_STRING_type(ASN1_STRING *x)
  419. { return M_ASN1_STRING_type(x); }
  420. unsigned char * ASN1_STRING_data(ASN1_STRING *x)
  421. { return M_ASN1_STRING_data(x); }