x_long.c 5.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  1. /* x_long.c */
  2. /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
  3. * project 2000.
  4. */
  5. /* ====================================================================
  6. * Copyright (c) 2000 The OpenSSL Project. All rights reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions
  10. * are met:
  11. *
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. *
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in
  17. * the documentation and/or other materials provided with the
  18. * distribution.
  19. *
  20. * 3. All advertising materials mentioning features or use of this
  21. * software must display the following acknowledgment:
  22. * "This product includes software developed by the OpenSSL Project
  23. * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
  24. *
  25. * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  26. * endorse or promote products derived from this software without
  27. * prior written permission. For written permission, please contact
  28. * licensing@OpenSSL.org.
  29. *
  30. * 5. Products derived from this software may not be called "OpenSSL"
  31. * nor may "OpenSSL" appear in their names without prior written
  32. * permission of the OpenSSL Project.
  33. *
  34. * 6. Redistributions of any form whatsoever must retain the following
  35. * acknowledgment:
  36. * "This product includes software developed by the OpenSSL Project
  37. * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
  38. *
  39. * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  40. * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  41. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  42. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
  43. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  44. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  45. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  46. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  47. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  48. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  49. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  50. * OF THE POSSIBILITY OF SUCH DAMAGE.
  51. * ====================================================================
  52. *
  53. * This product includes cryptographic software written by Eric Young
  54. * (eay@cryptsoft.com). This product includes software written by Tim
  55. * Hudson (tjh@cryptsoft.com).
  56. *
  57. */
  58. #include <stdio.h>
  59. #include "cryptlib.h"
  60. #include <openssl/asn1t.h>
  61. #include <openssl/bn.h>
  62. /* Custom primitive type for long handling. This converts between an ASN1_INTEGER
  63. * and a long directly.
  64. */
  65. static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
  66. static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
  67. static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it);
  68. static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it);
  69. static ASN1_PRIMITIVE_FUNCS long_pf = {
  70. NULL, 0,
  71. long_new,
  72. long_free,
  73. long_free, /* Clear should set to initial value */
  74. long_c2i,
  75. long_i2c
  76. };
  77. ASN1_ITEM_start(LONG)
  78. ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, ASN1_LONG_UNDEF, "LONG"
  79. ASN1_ITEM_end(LONG)
  80. ASN1_ITEM_start(ZLONG)
  81. ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, 0, "ZLONG"
  82. ASN1_ITEM_end(ZLONG)
  83. static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it)
  84. {
  85. *(long *)pval = it->size;
  86. return 1;
  87. }
  88. static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
  89. {
  90. *(long *)pval = it->size;
  91. }
  92. static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it)
  93. {
  94. long ltmp;
  95. unsigned long utmp;
  96. int clen, pad, i;
  97. /* this exists to bypass broken gcc optimization */
  98. char *cp = (char *)pval;
  99. /* use memcpy, because we may not be long aligned */
  100. memcpy(&ltmp, cp, sizeof(long));
  101. if(ltmp == it->size) return -1;
  102. /* Convert the long to positive: we subtract one if negative so
  103. * we can cleanly handle the padding if only the MSB of the leading
  104. * octet is set.
  105. */
  106. if(ltmp < 0) utmp = -ltmp - 1;
  107. else utmp = ltmp;
  108. clen = BN_num_bits_word(utmp);
  109. /* If MSB of leading octet set we need to pad */
  110. if(!(clen & 0x7)) pad = 1;
  111. else pad = 0;
  112. /* Convert number of bits to number of octets */
  113. clen = (clen + 7) >> 3;
  114. if(cont) {
  115. if(pad) *cont++ = (ltmp < 0) ? 0xff : 0;
  116. for(i = clen - 1; i >= 0; i--) {
  117. cont[i] = (unsigned char)(utmp & 0xff);
  118. if(ltmp < 0) cont[i] ^= 0xff;
  119. utmp >>= 8;
  120. }
  121. }
  122. return clen + pad;
  123. }
  124. static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
  125. int utype, char *free_cont, const ASN1_ITEM *it)
  126. {
  127. int neg, i;
  128. long ltmp;
  129. unsigned long utmp = 0;
  130. char *cp = (char *)pval;
  131. if(len > (int)sizeof(long)) {
  132. ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG);
  133. return 0;
  134. }
  135. /* Is it negative? */
  136. if(len && (cont[0] & 0x80)) neg = 1;
  137. else neg = 0;
  138. utmp = 0;
  139. for(i = 0; i < len; i++) {
  140. utmp <<= 8;
  141. if(neg) utmp |= cont[i] ^ 0xff;
  142. else utmp |= cont[i];
  143. }
  144. ltmp = (long)utmp;
  145. if(neg) {
  146. ltmp++;
  147. ltmp = -ltmp;
  148. }
  149. if(ltmp == it->size) {
  150. ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG);
  151. return 0;
  152. }
  153. memcpy(cp, &ltmp, sizeof(long));
  154. return 1;
  155. }