rc2_locl.h 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  1. /* crypto/rc2/rc2_locl.h */
  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. #undef c2l
  59. #define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
  60. l|=((unsigned long)(*((c)++)))<< 8L, \
  61. l|=((unsigned long)(*((c)++)))<<16L, \
  62. l|=((unsigned long)(*((c)++)))<<24L)
  63. /* NOTE - c is not incremented as per c2l */
  64. #undef c2ln
  65. #define c2ln(c,l1,l2,n) { \
  66. c+=n; \
  67. l1=l2=0; \
  68. switch (n) { \
  69. case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
  70. case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
  71. case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
  72. case 5: l2|=((unsigned long)(*(--(c)))); \
  73. case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
  74. case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
  75. case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
  76. case 1: l1|=((unsigned long)(*(--(c)))); \
  77. } \
  78. }
  79. #undef l2c
  80. #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
  81. *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
  82. *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
  83. *((c)++)=(unsigned char)(((l)>>24L)&0xff))
  84. /* NOTE - c is not incremented as per l2c */
  85. #undef l2cn
  86. #define l2cn(l1,l2,c,n) { \
  87. c+=n; \
  88. switch (n) { \
  89. case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
  90. case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
  91. case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
  92. case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
  93. case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
  94. case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
  95. case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
  96. case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
  97. } \
  98. }
  99. /* NOTE - c is not incremented as per n2l */
  100. #define n2ln(c,l1,l2,n) { \
  101. c+=n; \
  102. l1=l2=0; \
  103. switch (n) { \
  104. case 8: l2 =((unsigned long)(*(--(c)))) ; \
  105. case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
  106. case 6: l2|=((unsigned long)(*(--(c))))<<16; \
  107. case 5: l2|=((unsigned long)(*(--(c))))<<24; \
  108. case 4: l1 =((unsigned long)(*(--(c)))) ; \
  109. case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
  110. case 2: l1|=((unsigned long)(*(--(c))))<<16; \
  111. case 1: l1|=((unsigned long)(*(--(c))))<<24; \
  112. } \
  113. }
  114. /* NOTE - c is not incremented as per l2n */
  115. #define l2nn(l1,l2,c,n) { \
  116. c+=n; \
  117. switch (n) { \
  118. case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
  119. case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
  120. case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
  121. case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
  122. case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
  123. case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
  124. case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
  125. case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
  126. } \
  127. }
  128. #undef n2l
  129. #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
  130. l|=((unsigned long)(*((c)++)))<<16L, \
  131. l|=((unsigned long)(*((c)++)))<< 8L, \
  132. l|=((unsigned long)(*((c)++))))
  133. #undef l2n
  134. #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
  135. *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
  136. *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
  137. *((c)++)=(unsigned char)(((l) )&0xff))
  138. #define C_RC2(n) \
  139. t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff; \
  140. x0=(t<<1)|(t>>15); \
  141. t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff; \
  142. x1=(t<<2)|(t>>14); \
  143. t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff; \
  144. x2=(t<<3)|(t>>13); \
  145. t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff; \
  146. x3=(t<<5)|(t>>11);