arcfour_crypt.c revision 554ff184129088135ad2643c1c9832174a17be88
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include "../arcfour.h"
/* Initialize the key stream 'key' using the key value */
void
{
/* EXPORT DELETE START */
int i, j;
for (i = j = 0; i < 256; i++, j++) {
if (j == keyvallen)
j = 0;
ext_keyval[i] = keyval[j];
}
for (i = 0; i < 256; i++)
j = 0;
for (i = 0; i < 256; i++) {
}
key->i = 0;
key->j = 0;
/* EXPORT DELETE END */
}
/*
* Encipher 'in' using 'key.
* in and out can point to the same location
*/
void
{
/* EXPORT DELETE START */
int index;
/* Get the 'in' on an 8-byte alignment */
if (index > 0) {
i = key->i;
j = key->j;
i = i + 1;
}
key->i = i;
key->j = j;
}
if (len == 0)
return;
/* See if we're fortunate and 'out' got aligned as well */
/*
* Niagara optimized version for
* the cases where the input and output buffers are aligned on
* a multiple of 8-byte boundary.
*/
#ifdef sun4v
#endif /* sun4v */
i = key->i;
j = key->j;
i = i + 1;
j = j + tmp0;
}
key->i = i;
key->j = j;
#ifdef sun4v
} else {
i = key->i;
j = key->j;
/*
* Want to align base[i] on a 2B boundary -- allows updates
* via [i] to be performed in 2B chunks (reducing # of stores).
* Requires appropriate alias detection.
*/
if (((i+1) % 2) != 0) {
i = i + 1;
j = j + tmp0;
}
/*
* Note - in and out may now be misaligned -
* as updating [out] in 8B chunks need to handle this
* possibility. Also could have a 1B overrun.
* Need to drop out of loop early as a result.
*/
/*
* If i < less than 248, know wont wrap around
* (i % 256), so don't need to bother with masking i
* after each increment
*/
if (i1 < 248) {
/* BYTE 0 */
/*
* Creating this base pointer reduces subsequent
* arihmetic ops required to load [i]
*
* N.B. don't need to check if [j] aliases.
* [i] and [j] end up with the same values
* anyway.
*/
j = j + tmp0;
/*
* Don't store [i] yet
*/
/*
* Check [tmp0] doesn't alias with [i]
*/
/*
* Updating [out] in 8B chunks
*/
merge =
(unsigned long long)(i_accum) << 56;
} else {
merge =
56;
}
/* BYTE 1 */
j = j + tmp0;
/*
* [j] can now alias with [i] and [i-1]
* If alias abort speculation
*/
if ((i1 ^ j) < 2) {
merge |= (unsigned long long)
} else {
/*
* Speculation suceeded! Update [i]
* in 2B chunk
*/
merge |=
48;
}
/*
* Too expensive to perform [i] speculation for
* every byte. Just need to reduce frequency
* of stores until store buffer full stalls
* are not the bottleneck.
*/
/* BYTE 2 */
j = j + tmp0;
/* BYTE 3 */
j = j + tmp0;
/* BYTE 4 */
j = j + tmp0;
/* BYTE 5 */
j = j + tmp0;
/* BYTE 6 */
j = j + tmp0;
merge |=
(unsigned long long)(i_accum) << 8;
} else {
merge |=
8;
}
/* BYTE 7 */
/*
* Perform [i] speculation again. Indentical
* to that performed for BYTE0 and BYTE1.
*/
j = j + tmp0;
if ((i1 ^ j) < 2) {
merge |=
} else {
merge |=
}
i1++;
} else {
/*
* i is too close to wrap-around to allow
* masking to be disregarded
*/
/*
* Same old speculation for BYTE 0 and BYTE 1
*/
/* BYTE 0 */
j = j + tmp0;
merge =
(unsigned long long)(i_accum) << 56;
} else {
merge =
56;
}
/* BYTE 1 */
j = j + tmp0;
if ((jj ^ j) < 2) {
merge |=
48;
} else {
merge |=
48;
}
/* BYTE 2 */
/*
* As know i must be even when enter loop (to
* satisfy alignment), can only wrap around
* on the even bytes. So just need to perform
* mask every 2nd byte
*/
j = j + tmp0;
/* BYTE 3 */
j = j + tmp0;
/* BYTE 4 */
j = j + tmp0;
/* BYTE 5 */
j = j + tmp0;
/* BYTE 6 */
j = j + tmp0;
merge |=
(unsigned long long)(i_accum) << 8;
} else {
merge |=
8;
}
/* BYTE 7 */
i1++;
j = j + tmp0;
if ((jj ^ j) < 2) {
merge |=
} else {
merge |=
}
}
/*
* Perform update to [out]
* Remember could be alignment issues
*/
}
i = i1;
/*
* Handle any overrun
*/
if (shift) {
ii++;
}
/*
* Handle final few bytes
*/
i = i + 1;
j = j + tmp0;
}
key->i = i;
key->j = j;
}
#endif /* sun4v */
/* EXPORT DELETE END */
}