a_bitstr.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  1. /* crypto/asn1/a_bitstr.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 <limits.h>
  59. #include <stdio.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1.h>
  62. int ASN1_BIT_STRING_set(ASN1_BIT_STRING *x, unsigned char *d, int len)
  63. {
  64. return M_ASN1_BIT_STRING_set(x, d, len);
  65. }
  66. int i2c_ASN1_BIT_STRING(ASN1_BIT_STRING *a, unsigned char **pp)
  67. {
  68. int ret, j, bits, len;
  69. unsigned char *p, *d;
  70. if (a == NULL)
  71. return (0);
  72. len = a->length;
  73. if (len > 0) {
  74. if (a->flags & ASN1_STRING_FLAG_BITS_LEFT) {
  75. bits = (int)a->flags & 0x07;
  76. } else {
  77. for (; len > 0; len--) {
  78. if (a->data[len - 1])
  79. break;
  80. }
  81. j = a->data[len - 1];
  82. if (j & 0x01)
  83. bits = 0;
  84. else if (j & 0x02)
  85. bits = 1;
  86. else if (j & 0x04)
  87. bits = 2;
  88. else if (j & 0x08)
  89. bits = 3;
  90. else if (j & 0x10)
  91. bits = 4;
  92. else if (j & 0x20)
  93. bits = 5;
  94. else if (j & 0x40)
  95. bits = 6;
  96. else if (j & 0x80)
  97. bits = 7;
  98. else
  99. bits = 0; /* should not happen */
  100. }
  101. } else
  102. bits = 0;
  103. ret = 1 + len;
  104. if (pp == NULL)
  105. return (ret);
  106. p = *pp;
  107. *(p++) = (unsigned char)bits;
  108. d = a->data;
  109. if (len > 0) {
  110. memcpy(p, d, len);
  111. p += len;
  112. p[-1] &= (0xff << bits);
  113. }
  114. *pp = p;
  115. return (ret);
  116. }
  117. ASN1_BIT_STRING *c2i_ASN1_BIT_STRING(ASN1_BIT_STRING **a,
  118. const unsigned char **pp, long len)
  119. {
  120. ASN1_BIT_STRING *ret = NULL;
  121. const unsigned char *p;
  122. unsigned char *s;
  123. int i;
  124. if (len < 1) {
  125. i = ASN1_R_STRING_TOO_SHORT;
  126. goto err;
  127. }
  128. if (len > INT_MAX) {
  129. i = ASN1_R_STRING_TOO_LONG;
  130. goto err;
  131. }
  132. if ((a == NULL) || ((*a) == NULL)) {
  133. if ((ret = M_ASN1_BIT_STRING_new()) == NULL)
  134. return (NULL);
  135. } else
  136. ret = (*a);
  137. p = *pp;
  138. i = *(p++);
  139. if (i > 7) {
  140. i = ASN1_R_INVALID_BIT_STRING_BITS_LEFT;
  141. goto err;
  142. }
  143. /*
  144. * We do this to preserve the settings. If we modify the settings, via
  145. * the _set_bit function, we will recalculate on output
  146. */
  147. ret->flags &= ~(ASN1_STRING_FLAG_BITS_LEFT | 0x07); /* clear */
  148. ret->flags |= (ASN1_STRING_FLAG_BITS_LEFT | i); /* set */
  149. if (len-- > 1) { /* using one because of the bits left byte */
  150. s = (unsigned char *)OPENSSL_malloc((int)len);
  151. if (s == NULL) {
  152. i = ERR_R_MALLOC_FAILURE;
  153. goto err;
  154. }
  155. memcpy(s, p, (int)len);
  156. s[len - 1] &= (0xff << i);
  157. p += len;
  158. } else
  159. s = NULL;
  160. ret->length = (int)len;
  161. if (ret->data != NULL)
  162. OPENSSL_free(ret->data);
  163. ret->data = s;
  164. ret->type = V_ASN1_BIT_STRING;
  165. if (a != NULL)
  166. (*a) = ret;
  167. *pp = p;
  168. return (ret);
  169. err:
  170. ASN1err(ASN1_F_C2I_ASN1_BIT_STRING, i);
  171. if ((ret != NULL) && ((a == NULL) || (*a != ret)))
  172. M_ASN1_BIT_STRING_free(ret);
  173. return (NULL);
  174. }
  175. /*
  176. * These next 2 functions from Goetz Babin-Ebell <[email protected]>
  177. */
  178. int ASN1_BIT_STRING_set_bit(ASN1_BIT_STRING *a, int n, int value)
  179. {
  180. int w, v, iv;
  181. unsigned char *c;
  182. w = n / 8;
  183. v = 1 << (7 - (n & 0x07));
  184. iv = ~v;
  185. if (!value)
  186. v = 0;
  187. if (a == NULL)
  188. return 0;
  189. a->flags &= ~(ASN1_STRING_FLAG_BITS_LEFT | 0x07); /* clear, set on write */
  190. if ((a->length < (w + 1)) || (a->data == NULL)) {
  191. if (!value)
  192. return (1); /* Don't need to set */
  193. if (a->data == NULL)
  194. c = (unsigned char *)OPENSSL_malloc(w + 1);
  195. else
  196. c = (unsigned char *)OPENSSL_realloc_clean(a->data,
  197. a->length, w + 1);
  198. if (c == NULL) {
  199. ASN1err(ASN1_F_ASN1_BIT_STRING_SET_BIT, ERR_R_MALLOC_FAILURE);
  200. return 0;
  201. }
  202. if (w + 1 - a->length > 0)
  203. memset(c + a->length, 0, w + 1 - a->length);
  204. a->data = c;
  205. a->length = w + 1;
  206. }
  207. a->data[w] = ((a->data[w]) & iv) | v;
  208. while ((a->length > 0) && (a->data[a->length - 1] == 0))
  209. a->length--;
  210. return (1);
  211. }
  212. int ASN1_BIT_STRING_get_bit(ASN1_BIT_STRING *a, int n)
  213. {
  214. int w, v;
  215. w = n / 8;
  216. v = 1 << (7 - (n & 0x07));
  217. if ((a == NULL) || (a->length < (w + 1)) || (a->data == NULL))
  218. return (0);
  219. return ((a->data[w] & v) != 0);
  220. }
  221. /*
  222. * Checks if the given bit string contains only bits specified by
  223. * the flags vector. Returns 0 if there is at least one bit set in 'a'
  224. * which is not specified in 'flags', 1 otherwise.
  225. * 'len' is the length of 'flags'.
  226. */
  227. int ASN1_BIT_STRING_check(ASN1_BIT_STRING *a,
  228. unsigned char *flags, int flags_len)
  229. {
  230. int i, ok;
  231. /* Check if there is one bit set at all. */
  232. if (!a || !a->data)
  233. return 1;
  234. /*
  235. * Check each byte of the internal representation of the bit string.
  236. */
  237. ok = 1;
  238. for (i = 0; i < a->length && ok; ++i) {
  239. unsigned char mask = i < flags_len ? ~flags[i] : 0xff;
  240. /* We are done if there is an unneeded bit set. */
  241. ok = (a->data[i] & mask) == 0;
  242. }
  243. return ok;
  244. }