Security/libsecurity_apple_csp/open_ssl/misc/rc2_locl.h

   1 /*
   2  * Copyright (c) 2000-2001,2011-2012,2014 Apple Inc. All Rights Reserved.
   3  *
   4  * The contents of this file constitute Original Code as defined in and are
   5  * subject to the Apple Public Source License Version 1.2 (the 'License').
   6  * You may not use this file except in compliance with the License. Please obtain
   7  * a copy of the License at http://www.apple.com/publicsource and read it before
   8  * using this file.
   9  *
  10  * This Original Code and all software distributed under the License are
  11  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
  12  * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT
  13  * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
  14  * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the
  15  * specific language governing rights and limitations under the License.
  16  */
  17
  18
  19 /* crypto/rc2/rc2_locl.h */
  20 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  21  * All rights reserved.
  22  *
  23  * This package is an SSL implementation written
  24  * by Eric Young (eay@cryptsoft.com).
  25  * The implementation was written so as to conform with Netscapes SSL.
  26  *
  27  * This library is free for commercial and non-commercial use as long as
  28  * the following conditions are aheared to.  The following conditions
  29  * apply to all code found in this distribution, be it the RC4, RSA,
  30  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  31  * included with this distribution is covered by the same copyright terms
  32  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  33  *
  34  * Copyright remains Eric Young's, and as such any Copyright notices in
  35  * the code are not to be removed.
  36  * If this package is used in a product, Eric Young should be given attribution
  37  * as the author of the parts of the library used.
  38  * This can be in the form of a textual message at program startup or
  39  * in documentation (online or textual) provided with the package.
  40  *
  41  * Redistribution and use in source and binary forms, with or without
  42  * modification, are permitted provided that the following conditions
  43  * are met:
  44  * 1. Redistributions of source code must retain the copyright
  45  *    notice, this list of conditions and the following disclaimer.
  46  * 2. Redistributions in binary form must reproduce the above copyright
  47  *    notice, this list of conditions and the following disclaimer in the
  48  *    documentation and/or other materials provided with the distribution.
  49  * 3. All advertising materials mentioning features or use of this software
  50  *    must display the following acknowledgement:
  51  *    "This product includes cryptographic software written by
  52  *     Eric Young (eay@cryptsoft.com)"
  53  *    The word 'cryptographic' can be left out if the rouines from the library
  54  *    being used are not cryptographic related :-).
  55  * 4. If you include any Windows specific code (or a derivative thereof) from
  56  *    the apps directory (application code) you must include an acknowledgement:
  57  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  58  *
  59  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  60  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  61  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  62  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  63  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  64  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  65  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  66  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  67  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  68  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  69  * SUCH DAMAGE.
  70  *
  71  * The licence and distribution terms for any publically available version or
  72  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  73  * copied and put under another distribution licence
  74  * [including the GNU Public Licence.]
  75  */
  76
  77 #undef c2l
  78 #define c2l(c,l)        (l =((RC2_INT)(*((c)++)))    , \
  79                          l|=((RC2_INT)(*((c)++)))<< 8L, \
  80                          l|=((RC2_INT)(*((c)++)))<<16L, \
  81                          l|=((RC2_INT)(*((c)++)))<<24L)
  82
  83 /* NOTE - c is not incremented as per c2l */
  84 #undef c2ln
  85 #define c2ln(c,l1,l2,n) { \
  86                         c+=n; \
  87                         l1=l2=0; \
  88                         switch (n) { \
  89                         case 8: l2 =((RC2_INT)(*(--(c))))<<24L; \
  90                         case 7: l2|=((RC2_INT)(*(--(c))))<<16L; \
  91                         case 6: l2|=((RC2_INT)(*(--(c))))<< 8L; \
  92                         case 5: l2|=((RC2_INT)(*(--(c))));     \
  93                         case 4: l1 =((RC2_INT)(*(--(c))))<<24L; \
  94                         case 3: l1|=((RC2_INT)(*(--(c))))<<16L; \
  95                         case 2: l1|=((RC2_INT)(*(--(c))))<< 8L; \
  96                         case 1: l1|=((RC2_INT)(*(--(c))));     \
  97                                 } \
  98                         }
  99
 100 #undef l2c
 101 #define l2c(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
 102                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
 103                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
 104                          *((c)++)=(unsigned char)(((l)>>24L)&0xff))
 105
 106 /* NOTE - c is not incremented as per l2c */
 107 #undef l2cn
 108 #define l2cn(l1,l2,c,n) { \
 109                         c+=n; \
 110                         switch (n) { \
 111                         case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
 112                         case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
 113                         case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
 114                         case 5: *(--(c))=(unsigned char)(((l2)     )&0xff); \
 115                         case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
 116                         case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
 117                         case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
 118                         case 1: *(--(c))=(unsigned char)(((l1)     )&0xff); \
 119                                 } \
 120                         }
 121
 122 /* NOTE - c is not incremented as per n2l */
 123 #define n2ln(c,l1,l2,n) { \
 124                         c+=n; \
 125                         l1=l2=0; \
 126                         switch (n) { \
 127                         case 8: l2 =((RC2_INT)(*(--(c))))    ; \
 128                         case 7: l2|=((RC2_INT)(*(--(c))))<< 8; \
 129                         case 6: l2|=((RC2_INT)(*(--(c))))<<16; \
 130                         case 5: l2|=((RC2_INT)(*(--(c))))<<24; \
 131                         case 4: l1 =((RC2_INT)(*(--(c))))    ; \
 132                         case 3: l1|=((RC2_INT)(*(--(c))))<< 8; \
 133                         case 2: l1|=((RC2_INT)(*(--(c))))<<16; \
 134                         case 1: l1|=((RC2_INT)(*(--(c))))<<24; \
 135                                 } \
 136                         }
 137
 138 /* NOTE - c is not incremented as per l2n */
 139 #define l2nn(l1,l2,c,n) { \
 140                         c+=n; \
 141                         switch (n) { \
 142                         case 8: *(--(c))=(unsigned char)(((l2)    )&0xff); \
 143                         case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
 144                         case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
 145                         case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
 146                         case 4: *(--(c))=(unsigned char)(((l1)    )&0xff); \
 147                         case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
 148                         case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
 149                         case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
 150                                 } \
 151                         }
 152
 153 #undef n2l
 154 #define n2l(c,l)        (l =((RC2_INT)(*((c)++)))<<24L, \
 155                          l|=((RC2_INT)(*((c)++)))<<16L, \
 156                          l|=((RC2_INT)(*((c)++)))<< 8L, \
 157                          l|=((RC2_INT)(*((c)++))))
 158
 159 #undef l2n
 160 #define l2n(l,c)        (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
 161                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
 162                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
 163                          *((c)++)=(unsigned char)(((l)     )&0xff))
 164
 165 #define C_RC2(n) \
 166         t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff; \
 167         x0=(t<<1)|(t>>15); \
 168         t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff; \
 169         x1=(t<<2)|(t>>14); \
 170         t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff; \
 171         x2=(t<<3)|(t>>13); \
 172         t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff; \
 173         x3=(t<<5)|(t>>11);
 174