x_name.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536
  1. /* crypto/asn1/x_name.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 <ctype.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1t.h>
  62. #include <openssl/x509.h>
  63. #include "asn1_locl.h"
  64. typedef STACK_OF(X509_NAME_ENTRY) STACK_OF_X509_NAME_ENTRY;
  65. DECLARE_STACK_OF(STACK_OF_X509_NAME_ENTRY)
  66. /*
  67. * Maximum length of X509_NAME: much larger than anything we should
  68. * ever see in practice.
  69. */
  70. #define X509_NAME_MAX (1024 * 1024)
  71. static int x509_name_ex_d2i(ASN1_VALUE **val,
  72. const unsigned char **in, long len,
  73. const ASN1_ITEM *it,
  74. int tag, int aclass, char opt, ASN1_TLC *ctx);
  75. static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out,
  76. const ASN1_ITEM *it, int tag, int aclass);
  77. static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it);
  78. static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it);
  79. static int x509_name_encode(X509_NAME *a);
  80. static int x509_name_canon(X509_NAME *a);
  81. static int asn1_string_canon(ASN1_STRING *out, ASN1_STRING *in);
  82. static int i2d_name_canon(STACK_OF(STACK_OF_X509_NAME_ENTRY) * intname,
  83. unsigned char **in);
  84. static int x509_name_ex_print(BIO *out, ASN1_VALUE **pval,
  85. int indent,
  86. const char *fname, const ASN1_PCTX *pctx);
  87. ASN1_SEQUENCE(X509_NAME_ENTRY) = {
  88. ASN1_SIMPLE(X509_NAME_ENTRY, object, ASN1_OBJECT),
  89. ASN1_SIMPLE(X509_NAME_ENTRY, value, ASN1_PRINTABLE)
  90. } ASN1_SEQUENCE_END(X509_NAME_ENTRY)
  91. IMPLEMENT_ASN1_FUNCTIONS(X509_NAME_ENTRY)
  92. IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME_ENTRY)
  93. /*
  94. * For the "Name" type we need a SEQUENCE OF { SET OF X509_NAME_ENTRY } so
  95. * declare two template wrappers for this
  96. */
  97. ASN1_ITEM_TEMPLATE(X509_NAME_ENTRIES) =
  98. ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SET_OF, 0, RDNS, X509_NAME_ENTRY)
  99. ASN1_ITEM_TEMPLATE_END(X509_NAME_ENTRIES)
  100. ASN1_ITEM_TEMPLATE(X509_NAME_INTERNAL) =
  101. ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, Name, X509_NAME_ENTRIES)
  102. ASN1_ITEM_TEMPLATE_END(X509_NAME_INTERNAL)
  103. /*
  104. * Normally that's where it would end: we'd have two nested STACK structures
  105. * representing the ASN1. Unfortunately X509_NAME uses a completely different
  106. * form and caches encodings so we have to process the internal form and
  107. * convert to the external form.
  108. */
  109. const ASN1_EXTERN_FUNCS x509_name_ff = {
  110. NULL,
  111. x509_name_ex_new,
  112. x509_name_ex_free,
  113. 0, /* Default clear behaviour is OK */
  114. x509_name_ex_d2i,
  115. x509_name_ex_i2d,
  116. x509_name_ex_print
  117. };
  118. IMPLEMENT_EXTERN_ASN1(X509_NAME, V_ASN1_SEQUENCE, x509_name_ff)
  119. IMPLEMENT_ASN1_FUNCTIONS(X509_NAME)
  120. IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME)
  121. static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it)
  122. {
  123. X509_NAME *ret = NULL;
  124. ret = OPENSSL_malloc(sizeof(X509_NAME));
  125. if (!ret)
  126. goto memerr;
  127. if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL)
  128. goto memerr;
  129. if ((ret->bytes = BUF_MEM_new()) == NULL)
  130. goto memerr;
  131. ret->canon_enc = NULL;
  132. ret->canon_enclen = 0;
  133. ret->modified = 1;
  134. *val = (ASN1_VALUE *)ret;
  135. return 1;
  136. memerr:
  137. ASN1err(ASN1_F_X509_NAME_EX_NEW, ERR_R_MALLOC_FAILURE);
  138. if (ret) {
  139. if (ret->entries)
  140. sk_X509_NAME_ENTRY_free(ret->entries);
  141. OPENSSL_free(ret);
  142. }
  143. return 0;
  144. }
  145. static void x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
  146. {
  147. X509_NAME *a;
  148. if (!pval || !*pval)
  149. return;
  150. a = (X509_NAME *)*pval;
  151. BUF_MEM_free(a->bytes);
  152. sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free);
  153. if (a->canon_enc)
  154. OPENSSL_free(a->canon_enc);
  155. OPENSSL_free(a);
  156. *pval = NULL;
  157. }
  158. static int x509_name_ex_d2i(ASN1_VALUE **val,
  159. const unsigned char **in, long len,
  160. const ASN1_ITEM *it, int tag, int aclass,
  161. char opt, ASN1_TLC *ctx)
  162. {
  163. const unsigned char *p = *in, *q;
  164. union {
  165. STACK_OF(STACK_OF_X509_NAME_ENTRY) *s;
  166. ASN1_VALUE *a;
  167. } intname = {
  168. NULL
  169. };
  170. union {
  171. X509_NAME *x;
  172. ASN1_VALUE *a;
  173. } nm = {
  174. NULL
  175. };
  176. int i, j, ret;
  177. STACK_OF(X509_NAME_ENTRY) *entries;
  178. X509_NAME_ENTRY *entry;
  179. if (len > X509_NAME_MAX)
  180. len = X509_NAME_MAX;
  181. q = p;
  182. /* Get internal representation of Name */
  183. ret = ASN1_item_ex_d2i(&intname.a,
  184. &p, len, ASN1_ITEM_rptr(X509_NAME_INTERNAL),
  185. tag, aclass, opt, ctx);
  186. if (ret <= 0)
  187. return ret;
  188. if (*val)
  189. x509_name_ex_free(val, NULL);
  190. if (!x509_name_ex_new(&nm.a, NULL))
  191. goto err;
  192. /* We've decoded it: now cache encoding */
  193. if (!BUF_MEM_grow(nm.x->bytes, p - q))
  194. goto err;
  195. memcpy(nm.x->bytes->data, q, p - q);
  196. /* Convert internal representation to X509_NAME structure */
  197. for (i = 0; i < sk_STACK_OF_X509_NAME_ENTRY_num(intname.s); i++) {
  198. entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
  199. for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
  200. entry = sk_X509_NAME_ENTRY_value(entries, j);
  201. entry->set = i;
  202. if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
  203. goto err;
  204. }
  205. sk_X509_NAME_ENTRY_free(entries);
  206. }
  207. sk_STACK_OF_X509_NAME_ENTRY_free(intname.s);
  208. ret = x509_name_canon(nm.x);
  209. if (!ret)
  210. goto err;
  211. nm.x->modified = 0;
  212. *val = nm.a;
  213. *in = p;
  214. return ret;
  215. err:
  216. if (nm.x != NULL)
  217. X509_NAME_free(nm.x);
  218. ASN1err(ASN1_F_X509_NAME_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
  219. return 0;
  220. }
  221. static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out,
  222. const ASN1_ITEM *it, int tag, int aclass)
  223. {
  224. int ret;
  225. X509_NAME *a = (X509_NAME *)*val;
  226. if (a->modified) {
  227. ret = x509_name_encode(a);
  228. if (ret < 0)
  229. return ret;
  230. ret = x509_name_canon(a);
  231. if (ret < 0)
  232. return ret;
  233. }
  234. ret = a->bytes->length;
  235. if (out != NULL) {
  236. memcpy(*out, a->bytes->data, ret);
  237. *out += ret;
  238. }
  239. return ret;
  240. }
  241. static void local_sk_X509_NAME_ENTRY_free(STACK_OF(X509_NAME_ENTRY) *ne)
  242. {
  243. sk_X509_NAME_ENTRY_free(ne);
  244. }
  245. static void local_sk_X509_NAME_ENTRY_pop_free(STACK_OF(X509_NAME_ENTRY) *ne)
  246. {
  247. sk_X509_NAME_ENTRY_pop_free(ne, X509_NAME_ENTRY_free);
  248. }
  249. static int x509_name_encode(X509_NAME *a)
  250. {
  251. union {
  252. STACK_OF(STACK_OF_X509_NAME_ENTRY) *s;
  253. ASN1_VALUE *a;
  254. } intname = {
  255. NULL
  256. };
  257. int len;
  258. unsigned char *p;
  259. STACK_OF(X509_NAME_ENTRY) *entries = NULL;
  260. X509_NAME_ENTRY *entry;
  261. int i, set = -1;
  262. intname.s = sk_STACK_OF_X509_NAME_ENTRY_new_null();
  263. if (!intname.s)
  264. goto memerr;
  265. for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
  266. entry = sk_X509_NAME_ENTRY_value(a->entries, i);
  267. if (entry->set != set) {
  268. entries = sk_X509_NAME_ENTRY_new_null();
  269. if (!entries)
  270. goto memerr;
  271. if (!sk_STACK_OF_X509_NAME_ENTRY_push(intname.s, entries))
  272. goto memerr;
  273. set = entry->set;
  274. }
  275. if (!sk_X509_NAME_ENTRY_push(entries, entry))
  276. goto memerr;
  277. }
  278. len = ASN1_item_ex_i2d(&intname.a, NULL,
  279. ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1);
  280. if (!BUF_MEM_grow(a->bytes, len))
  281. goto memerr;
  282. p = (unsigned char *)a->bytes->data;
  283. ASN1_item_ex_i2d(&intname.a,
  284. &p, ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1);
  285. sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
  286. local_sk_X509_NAME_ENTRY_free);
  287. a->modified = 0;
  288. return len;
  289. memerr:
  290. sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
  291. local_sk_X509_NAME_ENTRY_free);
  292. ASN1err(ASN1_F_X509_NAME_ENCODE, ERR_R_MALLOC_FAILURE);
  293. return -1;
  294. }
  295. static int x509_name_ex_print(BIO *out, ASN1_VALUE **pval,
  296. int indent,
  297. const char *fname, const ASN1_PCTX *pctx)
  298. {
  299. if (X509_NAME_print_ex(out, (X509_NAME *)*pval,
  300. indent, pctx->nm_flags) <= 0)
  301. return 0;
  302. return 2;
  303. }
  304. /*
  305. * This function generates the canonical encoding of the Name structure. In
  306. * it all strings are converted to UTF8, leading, trailing and multiple
  307. * spaces collapsed, converted to lower case and the leading SEQUENCE header
  308. * removed. In future we could also normalize the UTF8 too. By doing this
  309. * comparison of Name structures can be rapidly perfomed by just using
  310. * memcmp() of the canonical encoding. By omitting the leading SEQUENCE name
  311. * constraints of type dirName can also be checked with a simple memcmp().
  312. */
  313. static int x509_name_canon(X509_NAME *a)
  314. {
  315. unsigned char *p;
  316. STACK_OF(STACK_OF_X509_NAME_ENTRY) *intname = NULL;
  317. STACK_OF(X509_NAME_ENTRY) *entries = NULL;
  318. X509_NAME_ENTRY *entry, *tmpentry = NULL;
  319. int i, set = -1, ret = 0;
  320. if (a->canon_enc) {
  321. OPENSSL_free(a->canon_enc);
  322. a->canon_enc = NULL;
  323. }
  324. /* Special case: empty X509_NAME => null encoding */
  325. if (sk_X509_NAME_ENTRY_num(a->entries) == 0) {
  326. a->canon_enclen = 0;
  327. return 1;
  328. }
  329. intname = sk_STACK_OF_X509_NAME_ENTRY_new_null();
  330. if (!intname)
  331. goto err;
  332. for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
  333. entry = sk_X509_NAME_ENTRY_value(a->entries, i);
  334. if (entry->set != set) {
  335. entries = sk_X509_NAME_ENTRY_new_null();
  336. if (!entries)
  337. goto err;
  338. if (!sk_STACK_OF_X509_NAME_ENTRY_push(intname, entries))
  339. goto err;
  340. set = entry->set;
  341. }
  342. tmpentry = X509_NAME_ENTRY_new();
  343. if (!tmpentry)
  344. goto err;
  345. tmpentry->object = OBJ_dup(entry->object);
  346. if (!asn1_string_canon(tmpentry->value, entry->value))
  347. goto err;
  348. if (!sk_X509_NAME_ENTRY_push(entries, tmpentry))
  349. goto err;
  350. tmpentry = NULL;
  351. }
  352. /* Finally generate encoding */
  353. a->canon_enclen = i2d_name_canon(intname, NULL);
  354. p = OPENSSL_malloc(a->canon_enclen);
  355. if (!p)
  356. goto err;
  357. a->canon_enc = p;
  358. i2d_name_canon(intname, &p);
  359. ret = 1;
  360. err:
  361. if (tmpentry)
  362. X509_NAME_ENTRY_free(tmpentry);
  363. if (intname)
  364. sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname,
  365. local_sk_X509_NAME_ENTRY_pop_free);
  366. return ret;
  367. }
  368. /* Bitmap of all the types of string that will be canonicalized. */
  369. #define ASN1_MASK_CANON \
  370. (B_ASN1_UTF8STRING | B_ASN1_BMPSTRING | B_ASN1_UNIVERSALSTRING \
  371. | B_ASN1_PRINTABLESTRING | B_ASN1_T61STRING | B_ASN1_IA5STRING \
  372. | B_ASN1_VISIBLESTRING)
  373. static int asn1_string_canon(ASN1_STRING *out, ASN1_STRING *in)
  374. {
  375. unsigned char *to, *from;
  376. int len, i;
  377. /* If type not in bitmask just copy string across */
  378. if (!(ASN1_tag2bit(in->type) & ASN1_MASK_CANON)) {
  379. if (!ASN1_STRING_copy(out, in))
  380. return 0;
  381. return 1;
  382. }
  383. out->type = V_ASN1_UTF8STRING;
  384. out->length = ASN1_STRING_to_UTF8(&out->data, in);
  385. if (out->length == -1)
  386. return 0;
  387. to = out->data;
  388. from = to;
  389. len = out->length;
  390. /*
  391. * Convert string in place to canonical form. Ultimately we may need to
  392. * handle a wider range of characters but for now ignore anything with
  393. * MSB set and rely on the isspace() and tolower() functions.
  394. */
  395. /* Ignore leading spaces */
  396. while ((len > 0) && !(*from & 0x80) && isspace(*from)) {
  397. from++;
  398. len--;
  399. }
  400. to = from + len - 1;
  401. /* Ignore trailing spaces */
  402. while ((len > 0) && !(*to & 0x80) && isspace(*to)) {
  403. to--;
  404. len--;
  405. }
  406. to = out->data;
  407. i = 0;
  408. while (i < len) {
  409. /* If MSB set just copy across */
  410. if (*from & 0x80) {
  411. *to++ = *from++;
  412. i++;
  413. }
  414. /* Collapse multiple spaces */
  415. else if (isspace(*from)) {
  416. /* Copy one space across */
  417. *to++ = ' ';
  418. /*
  419. * Ignore subsequent spaces. Note: don't need to check len here
  420. * because we know the last character is a non-space so we can't
  421. * overflow.
  422. */
  423. do {
  424. from++;
  425. i++;
  426. }
  427. while (!(*from & 0x80) && isspace(*from));
  428. } else {
  429. *to++ = tolower(*from);
  430. from++;
  431. i++;
  432. }
  433. }
  434. out->length = to - out->data;
  435. return 1;
  436. }
  437. static int i2d_name_canon(STACK_OF(STACK_OF_X509_NAME_ENTRY) * _intname,
  438. unsigned char **in)
  439. {
  440. int i, len, ltmp;
  441. ASN1_VALUE *v;
  442. STACK_OF(ASN1_VALUE) *intname = (STACK_OF(ASN1_VALUE) *)_intname;
  443. len = 0;
  444. for (i = 0; i < sk_ASN1_VALUE_num(intname); i++) {
  445. v = sk_ASN1_VALUE_value(intname, i);
  446. ltmp = ASN1_item_ex_i2d(&v, in,
  447. ASN1_ITEM_rptr(X509_NAME_ENTRIES), -1, -1);
  448. if (ltmp < 0)
  449. return ltmp;
  450. len += ltmp;
  451. }
  452. return len;
  453. }
  454. int X509_NAME_set(X509_NAME **xn, X509_NAME *name)
  455. {
  456. X509_NAME *in;
  457. if (!xn || !name)
  458. return (0);
  459. if (*xn != name) {
  460. in = X509_NAME_dup(name);
  461. if (in != NULL) {
  462. X509_NAME_free(*xn);
  463. *xn = in;
  464. }
  465. }
  466. return (*xn != NULL);
  467. }
  468. IMPLEMENT_STACK_OF(X509_NAME_ENTRY)
  469. IMPLEMENT_ASN1_SET_OF(X509_NAME_ENTRY)