Also inline xor_buf, both for immediate effeciency gains and for future

writing of it in assembly.

1 files changed, 0 insertions, 34 deletions

diff --git a/src/bit_ops.cpp b/src/bit_ops.cpp
index 2db947d01..fe2b36d05 100644
--- a/src/bit_ops.cpp
+++ b/src/bit_ops.cpp
@@ -9,40 +9,6 @@
 namespace Botan {
 
 /*************************************************
-* Array XOR                                      *
-*************************************************/
-void xor_buf(byte data[], const byte mask[], u32bit length)
-   {
-   while(length >= 8)
-      {
-      data[0] ^= mask[0]; data[1] ^= mask[1];
-      data[2] ^= mask[2]; data[3] ^= mask[3];
-      data[4] ^= mask[4]; data[5] ^= mask[5];
-      data[6] ^= mask[6]; data[7] ^= mask[7];
-      data += 8; mask += 8; length -= 8;
-      }
-   for(u32bit j = 0; j != length; ++j)
-      data[j] ^= mask[j];
-   }
-
-/*************************************************
-* Array XOR                                      *
-*************************************************/
-void xor_buf(byte out[], const byte in[], const byte mask[], u32bit length)
-   {
-   while(length >= 8)
-      {
-      out[0] = in[0] ^ mask[0]; out[1] = in[1] ^ mask[1];
-      out[2] = in[2] ^ mask[2]; out[3] = in[3] ^ mask[3];
-      out[4] = in[4] ^ mask[4]; out[5] = in[5] ^ mask[5];
-      out[6] = in[6] ^ mask[6]; out[7] = in[7] ^ mask[7];
-      in += 8; out += 8; mask += 8; length -= 8;
-      }
-   for(u32bit j = 0; j != length; ++j)
-      out[j] = in[j] ^ mask[j];
-   }
-
-/*************************************************
 * Return true iff arg is 2**n for some n > 0     *
 *************************************************/
 bool power_of_2(u64bit arg)