modes/modes_lcl.h: make it indent-friendly.

[openssl.git] / crypto / rc4 / rc4_enc.c

diff --git a/crypto/rc4/rc4_enc.c b/crypto/rc4/rc4_enc.c
index 37ef43c16ca3256e1eda0940363ddabbf6214140..b98e34b8e1aafc21718be7d8c38aeb2d70456c45 100644 (file)
--- a/crypto/rc4/rc4_enc.c
+++ b/crypto/rc4/rc4_enc.c
@@ -59,7 +59,8 @@
 #include <openssl/rc4.h>
 #include "rc4_locl.h"
 
-/* RC4 as implemented from a posting from
+/*-
+ * RC4 as implemented from a posting from
  * Newsgroups: sci.crypt
  * From: sterndark@netcom.com (David Sterndark)
  * Subject: RC4 Algorithm revealed.
@@ -79,7 +80,7 @@ void RC4(RC4_KEY *key, size_t len, const unsigned char *indata,
         d=key->data; 
 
 #if defined(RC4_CHUNK)
-       /*
+       /*-
         * The original reason for implementing this(*) was the fact that
         * pre-21164a Alpha CPUs don't have byte load/store instructions
         * and e.g. a byte store has to be done with 64-bit load, shift,
@@ -126,7 +127,7 @@ void RC4(RC4_KEY *key, size_t len, const unsigned char *indata,
                RC4_CHUNK ichunk,otp;
                const union { long one; char little; } is_endian = {1};
 
-               /*
+               /*-
                 * I reckon we can afford to implement both endian
                 * cases and to decide which way to take at run-time
                 * because the machine code appears to be very compact
@@ -157,7 +158,7 @@ void RC4(RC4_KEY *key, size_t len, const unsigned char *indata,
                if (!is_endian.little)
                        {       /* BIG-ENDIAN CASE */
 # define BESHFT(c)     (((sizeof(RC4_CHUNK)-(c)-1)*8)&(sizeof(RC4_CHUNK)*8-1))
-                       for (;len&-sizeof(RC4_CHUNK);len-=sizeof(RC4_CHUNK))
+                       for (;len&(0-sizeof(RC4_CHUNK));len-=sizeof(RC4_CHUNK))
                                {
                                ichunk  = *(RC4_CHUNK *)indata;
                                otp  = RC4_STEP<<BESHFT(0);
@@ -210,7 +211,7 @@ void RC4(RC4_KEY *key, size_t len, const unsigned char *indata,
                else
                        {       /* LITTLE-ENDIAN CASE */
 # define LESHFT(c)     (((c)*8)&(sizeof(RC4_CHUNK)*8-1))
-                       for (;len&-sizeof(RC4_CHUNK);len-=sizeof(RC4_CHUNK))
+                       for (;len&(0-sizeof(RC4_CHUNK));len-=sizeof(RC4_CHUNK))
                                {
                                ichunk  = *(RC4_CHUNK *)indata;
                                otp  = RC4_STEP;