| bf_locl.h (63249) | bf_locl.h (78064) |
|---|---|
| 1/* $FreeBSD: head/sys/crypto/blowfish/bf_locl.h 62587 2000-07-04 16:35:15Z itojun $ */ 2/* $KAME: bf_locl.h,v 1.3 2000/03/27 04:36:26 sumikawa Exp $ */ | 1/* $FreeBSD: head/sys/crypto/blowfish/bf_locl.h 78064 2001-06-11 12:39:29Z ume $ */ 2/* $KAME: bf_locl.h,v 1.5 2000/08/31 06:03:48 itojun Exp $ */ |
| 3 4/* crypto/bf/bf_local.h */ 5/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au) 6 * All rights reserved. 7 * 8 * This package is an SSL implementation written 9 * by Eric Young (eay@mincom.oz.au). 10 * The implementation was written so as to conform with Netscapes SSL. --- 51 unchanged lines hidden (view full) --- 62 * 63 * Always modify bf_locl.org since bf_locl.h is automatically generated from 64 * it during SSLeay configuration. 65 * 66 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 67 */ 68 69#undef c2l | 3 4/* crypto/bf/bf_local.h */ 5/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au) 6 * All rights reserved. 7 * 8 * This package is an SSL implementation written 9 * by Eric Young (eay@mincom.oz.au). 10 * The implementation was written so as to conform with Netscapes SSL. --- 51 unchanged lines hidden (view full) --- 62 * 63 * Always modify bf_locl.org since bf_locl.h is automatically generated from 64 * it during SSLeay configuration. 65 * 66 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 67 */ 68 69#undef c2l |
| 70#define c2l(c,l) (l =((unsigned long)(*((c)++))) , \ 71 l|=((unsigned long)(*((c)++)))<< 8L, \ 72 l|=((unsigned long)(*((c)++)))<<16L, \ 73 l|=((unsigned long)(*((c)++)))<<24L) | 70#define c2l(c,l) (l =((BF_LONG)(*((c)++))) , \ 71 l|=((BF_LONG)(*((c)++)))<< 8L, \ 72 l|=((BF_LONG)(*((c)++)))<<16L, \ 73 l|=((BF_LONG)(*((c)++)))<<24L) |
| 74 75/* NOTE - c is not incremented as per c2l */ 76#undef c2ln 77#define c2ln(c,l1,l2,n) { \ 78 c+=n; \ 79 l1=l2=0; \ 80 switch (n) { \ | 74 75/* NOTE - c is not incremented as per c2l */ 76#undef c2ln 77#define c2ln(c,l1,l2,n) { \ 78 c+=n; \ 79 l1=l2=0; \ 80 switch (n) { \ |
| 81 case 8: l2 =((unsigned long)(*(--(c))))<<24L; \ 82 case 7: l2|=((unsigned long)(*(--(c))))<<16L; \ 83 case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \ 84 case 5: l2|=((unsigned long)(*(--(c)))); \ 85 case 4: l1 =((unsigned long)(*(--(c))))<<24L; \ 86 case 3: l1|=((unsigned long)(*(--(c))))<<16L; \ 87 case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \ 88 case 1: l1|=((unsigned long)(*(--(c)))); \ | 81 case 8: l2 =((BF_LONG)(*(--(c))))<<24L; \ 82 case 7: l2|=((BF_LONG)(*(--(c))))<<16L; \ 83 case 6: l2|=((BF_LONG)(*(--(c))))<< 8L; \ 84 case 5: l2|=((BF_LONG)(*(--(c)))); \ 85 case 4: l1 =((BF_LONG)(*(--(c))))<<24L; \ 86 case 3: l1|=((BF_LONG)(*(--(c))))<<16L; \ 87 case 2: l1|=((BF_LONG)(*(--(c))))<< 8L; \ 88 case 1: l1|=((BF_LONG)(*(--(c)))); \ |
| 89 } \ 90 } 91 92#undef l2c 93#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 94 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 95 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 96 *((c)++)=(unsigned char)(((l)>>24L)&0xff)) --- 14 unchanged lines hidden (view full) --- 111 } \ 112 } 113 114/* NOTE - c is not incremented as per n2l */ 115#define n2ln(c,l1,l2,n) { \ 116 c+=n; \ 117 l1=l2=0; \ 118 switch (n) { \ | 89 } \ 90 } 91 92#undef l2c 93#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 94 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 95 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 96 *((c)++)=(unsigned char)(((l)>>24L)&0xff)) --- 14 unchanged lines hidden (view full) --- 111 } \ 112 } 113 114/* NOTE - c is not incremented as per n2l */ 115#define n2ln(c,l1,l2,n) { \ 116 c+=n; \ 117 l1=l2=0; \ 118 switch (n) { \ |
| 119 case 8: l2 =((unsigned long)(*(--(c)))) ; \ 120 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \ 121 case 6: l2|=((unsigned long)(*(--(c))))<<16; \ 122 case 5: l2|=((unsigned long)(*(--(c))))<<24; \ 123 case 4: l1 =((unsigned long)(*(--(c)))) ; \ 124 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \ 125 case 2: l1|=((unsigned long)(*(--(c))))<<16; \ 126 case 1: l1|=((unsigned long)(*(--(c))))<<24; \ | 119 case 8: l2 =((BF_LONG)(*(--(c)))) ; \ 120 case 7: l2|=((BF_LONG)(*(--(c))))<< 8; \ 121 case 6: l2|=((BF_LONG)(*(--(c))))<<16; \ 122 case 5: l2|=((BF_LONG)(*(--(c))))<<24; \ 123 case 4: l1 =((BF_LONG)(*(--(c)))) ; \ 124 case 3: l1|=((BF_LONG)(*(--(c))))<< 8; \ 125 case 2: l1|=((BF_LONG)(*(--(c))))<<16; \ 126 case 1: l1|=((BF_LONG)(*(--(c))))<<24; \ |
| 127 } \ 128 } 129 130/* NOTE - c is not incremented as per l2n */ 131#define l2nn(l1,l2,c,n) { \ 132 c+=n; \ 133 switch (n) { \ 134 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \ 135 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ 136 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ 137 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ 138 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \ 139 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ 140 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ 141 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ 142 } \ 143 } 144 145#undef n2l | 127 } \ 128 } 129 130/* NOTE - c is not incremented as per l2n */ 131#define l2nn(l1,l2,c,n) { \ 132 c+=n; \ 133 switch (n) { \ 134 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \ 135 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ 136 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ 137 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ 138 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \ 139 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ 140 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ 141 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ 142 } \ 143 } 144 145#undef n2l |
| 146#define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \ 147 l|=((unsigned long)(*((c)++)))<<16L, \ 148 l|=((unsigned long)(*((c)++)))<< 8L, \ 149 l|=((unsigned long)(*((c)++)))) | 146#define n2l(c,l) (l =((BF_LONG)(*((c)++)))<<24L, \ 147 l|=((BF_LONG)(*((c)++)))<<16L, \ 148 l|=((BF_LONG)(*((c)++)))<< 8L, \ 149 l|=((BF_LONG)(*((c)++)))) |
| 150 151#undef l2n 152#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ 153 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 154 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 155 *((c)++)=(unsigned char)(((l) )&0xff)) 156 157/* This is actually a big endian algorithm, the most significate byte 158 * is used to lookup array 0 */ 159 160/* use BF_PTR2 for intel boxes, 161 * BF_PTR for sparc and MIPS/SGI 162 * use nothing for Alpha and HP. 163 */ | 150 151#undef l2n 152#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ 153 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 154 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 155 *((c)++)=(unsigned char)(((l) )&0xff)) 156 157/* This is actually a big endian algorithm, the most significate byte 158 * is used to lookup array 0 */ 159 160/* use BF_PTR2 for intel boxes, 161 * BF_PTR for sparc and MIPS/SGI 162 * use nothing for Alpha and HP. 163 */ |
| 164#if !defined(BF_PTR) && !defined(BF_PTR2) 165#undef BF_PTR | 164#undef BF_PTR 165#undef BF_PTR2 166#ifdef __NetBSD__ 167#ifdef __i386__ 168#define BF_PTR2 169#else 170#ifdef __mips__ 171#define BF_PTR |
| 166#endif | 172#endif |
| 173#endif 174#endif /*NetBSD*/ |
|
| 167 168#define BF_M 0x3fc 169#define BF_0 22L 170#define BF_1 14L 171#define BF_2 6L 172#define BF_3 2L /* left shift */ 173 174#if defined(BF_PTR2) --- 44 unchanged lines hidden --- | 175 176#define BF_M 0x3fc 177#define BF_0 22L 178#define BF_1 14L 179#define BF_2 6L 180#define BF_3 2L /* left shift */ 181 182#if defined(BF_PTR2) --- 44 unchanged lines hidden --- |