1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/*
* XOR operations
* (C) 1999-2008 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#ifndef BOTAN_XOR_BUF_H__
#define BOTAN_XOR_BUF_H__
#include <botan/types.h>
#include <vector>
namespace Botan {
/**
* XOR arrays. Postcondition out[i] = in[i] ^ out[i] forall i = 0...length
* @param out the input/output buffer
* @param in the read-only input buffer
* @param length the length of the buffers
*/
template<typename T>
void xor_buf(T out[], const T in[], size_t length)
{
while(length >= 8)
{
out[0] ^= in[0]; out[1] ^= in[1];
out[2] ^= in[2]; out[3] ^= in[3];
out[4] ^= in[4]; out[5] ^= in[5];
out[6] ^= in[6]; out[7] ^= in[7];
out += 8; in += 8; length -= 8;
}
for(size_t i = 0; i != length; ++i)
out[i] ^= in[i];
}
/**
* XOR arrays. Postcondition out[i] = in[i] ^ in2[i] forall i = 0...length
* @param out the output buffer
* @param in the first input buffer
* @param in2 the second output buffer
* @param length the length of the three buffers
*/
template<typename T> void xor_buf(T out[],
const T in[],
const T in2[],
size_t length)
{
while(length >= 8)
{
out[0] = in[0] ^ in2[0];
out[1] = in[1] ^ in2[1];
out[2] = in[2] ^ in2[2];
out[3] = in[3] ^ in2[3];
out[4] = in[4] ^ in2[4];
out[5] = in[5] ^ in2[5];
out[6] = in[6] ^ in2[6];
out[7] = in[7] ^ in2[7];
in += 8; in2 += 8; out += 8; length -= 8;
}
for(size_t i = 0; i != length; ++i)
out[i] = in[i] ^ in2[i];
}
#if BOTAN_TARGET_UNALIGNED_MEMORY_ACCESS_OK
inline void xor_buf(byte out[], const byte in[], size_t length)
{
while(length >= 8)
{
*reinterpret_cast<u64bit*>(out) ^= *reinterpret_cast<const u64bit*>(in);
out += 8; in += 8; length -= 8;
}
for(size_t i = 0; i != length; ++i)
out[i] ^= in[i];
}
inline void xor_buf(byte out[],
const byte in[],
const byte in2[],
size_t length)
{
while(length >= 8)
{
*reinterpret_cast<u64bit*>(out) =
*reinterpret_cast<const u64bit*>(in) ^
*reinterpret_cast<const u64bit*>(in2);
in += 8; in2 += 8; out += 8; length -= 8;
}
for(size_t i = 0; i != length; ++i)
out[i] = in[i] ^ in2[i];
}
#endif
template<typename Alloc, typename Alloc2>
void xor_buf(std::vector<byte, Alloc>& out,
const std::vector<byte, Alloc2>& in,
size_t n)
{
xor_buf(&out[0], &in[0], n);
}
template<typename Alloc>
void xor_buf(std::vector<byte, Alloc>& out,
const byte* in,
size_t n)
{
xor_buf(&out[0], in, n);
}
template<typename Alloc, typename Alloc2>
void xor_buf(std::vector<byte, Alloc>& out,
const byte* in,
const std::vector<byte, Alloc2>& in2,
size_t n)
{
xor_buf(&out[0], &in[0], &in2[0], n);
}
template<typename T, typename Alloc, typename Alloc2>
std::vector<T, Alloc>&
operator^=(std::vector<T, Alloc>& out,
const std::vector<T, Alloc2>& in)
{
if(out.size() < in.size())
out.resize(in.size());
xor_buf(&out[0], &in[0], in.size());
return out;
}
}
#endif
|
