bf_locl.h 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219
  1. /* crypto/bf/bf_locl.h */
  2. /* Copyright (C) 1995-1997 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. #ifndef HEADER_BF_LOCL_H
  59. #define HEADER_BF_LOCL_H
  60. #include <openssl/opensslconf.h> /* BF_PTR, BF_PTR2 */
  61. #undef c2l
  62. #define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
  63. l|=((unsigned long)(*((c)++)))<< 8L, \
  64. l|=((unsigned long)(*((c)++)))<<16L, \
  65. l|=((unsigned long)(*((c)++)))<<24L)
  66. /* NOTE - c is not incremented as per c2l */
  67. #undef c2ln
  68. #define c2ln(c,l1,l2,n) { \
  69. c+=n; \
  70. l1=l2=0; \
  71. switch (n) { \
  72. case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
  73. case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
  74. case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
  75. case 5: l2|=((unsigned long)(*(--(c)))); \
  76. case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
  77. case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
  78. case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
  79. case 1: l1|=((unsigned long)(*(--(c)))); \
  80. } \
  81. }
  82. #undef l2c
  83. #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
  84. *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
  85. *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
  86. *((c)++)=(unsigned char)(((l)>>24L)&0xff))
  87. /* NOTE - c is not incremented as per l2c */
  88. #undef l2cn
  89. #define l2cn(l1,l2,c,n) { \
  90. c+=n; \
  91. switch (n) { \
  92. case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
  93. case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
  94. case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
  95. case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
  96. case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
  97. case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
  98. case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
  99. case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
  100. } \
  101. }
  102. /* NOTE - c is not incremented as per n2l */
  103. #define n2ln(c,l1,l2,n) { \
  104. c+=n; \
  105. l1=l2=0; \
  106. switch (n) { \
  107. case 8: l2 =((unsigned long)(*(--(c)))) ; \
  108. case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
  109. case 6: l2|=((unsigned long)(*(--(c))))<<16; \
  110. case 5: l2|=((unsigned long)(*(--(c))))<<24; \
  111. case 4: l1 =((unsigned long)(*(--(c)))) ; \
  112. case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
  113. case 2: l1|=((unsigned long)(*(--(c))))<<16; \
  114. case 1: l1|=((unsigned long)(*(--(c))))<<24; \
  115. } \
  116. }
  117. /* NOTE - c is not incremented as per l2n */
  118. #define l2nn(l1,l2,c,n) { \
  119. c+=n; \
  120. switch (n) { \
  121. case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
  122. case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
  123. case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
  124. case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
  125. case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
  126. case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
  127. case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
  128. case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
  129. } \
  130. }
  131. #undef n2l
  132. #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
  133. l|=((unsigned long)(*((c)++)))<<16L, \
  134. l|=((unsigned long)(*((c)++)))<< 8L, \
  135. l|=((unsigned long)(*((c)++))))
  136. #undef l2n
  137. #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
  138. *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
  139. *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
  140. *((c)++)=(unsigned char)(((l) )&0xff))
  141. /* This is actually a big endian algorithm, the most significant byte
  142. * is used to lookup array 0 */
  143. #if defined(BF_PTR2)
  144. /*
  145. * This is basically a special Intel version. Point is that Intel
  146. * doesn't have many registers, but offers a reach choice of addressing
  147. * modes. So we spare some registers by directly traversing BF_KEY
  148. * structure and hiring the most decorated addressing mode. The code
  149. * generated by EGCS is *perfectly* competitive with assembler
  150. * implementation!
  151. */
  152. #define BF_ENC(LL,R,KEY,Pi) (\
  153. LL^=KEY[Pi], \
  154. t= KEY[BF_ROUNDS+2 + 0 + ((R>>24)&0xFF)], \
  155. t+= KEY[BF_ROUNDS+2 + 256 + ((R>>16)&0xFF)], \
  156. t^= KEY[BF_ROUNDS+2 + 512 + ((R>>8 )&0xFF)], \
  157. t+= KEY[BF_ROUNDS+2 + 768 + ((R )&0xFF)], \
  158. LL^=t \
  159. )
  160. #elif defined(BF_PTR)
  161. #ifndef BF_LONG_LOG2
  162. #define BF_LONG_LOG2 2 /* default to BF_LONG being 32 bits */
  163. #endif
  164. #define BF_M (0xFF<<BF_LONG_LOG2)
  165. #define BF_0 (24-BF_LONG_LOG2)
  166. #define BF_1 (16-BF_LONG_LOG2)
  167. #define BF_2 ( 8-BF_LONG_LOG2)
  168. #define BF_3 BF_LONG_LOG2 /* left shift */
  169. /*
  170. * This is normally very good on RISC platforms where normally you
  171. * have to explicitly "multiply" array index by sizeof(BF_LONG)
  172. * in order to calculate the effective address. This implementation
  173. * excuses CPU from this extra work. Power[PC] uses should have most
  174. * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely
  175. * rlwinm. So let'em double-check if their compiler does it.
  176. */
  177. #define BF_ENC(LL,R,S,P) ( \
  178. LL^=P, \
  179. LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
  180. *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
  181. *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
  182. *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))) \
  183. )
  184. #else
  185. /*
  186. * This is a *generic* version. Seem to perform best on platforms that
  187. * offer explicit support for extraction of 8-bit nibbles preferably
  188. * complemented with "multiplying" of array index by sizeof(BF_LONG).
  189. * For the moment of this writing the list comprises Alpha CPU featuring
  190. * extbl and s[48]addq instructions.
  191. */
  192. #define BF_ENC(LL,R,S,P) ( \
  193. LL^=P, \
  194. LL^=((( S[ ((int)(R>>24)&0xff)] + \
  195. S[0x0100+((int)(R>>16)&0xff)])^ \
  196. S[0x0200+((int)(R>> 8)&0xff)])+ \
  197. S[0x0300+((int)(R )&0xff)])&0xffffffffL \
  198. )
  199. #endif
  200. #endif