/* * Memory Operations * (C) 1999-2009,2012 Jack Lloyd * * Botan is released under the Simplified BSD License (see license.txt) */ #ifndef BOTAN_MEMORY_OPS_H__ #define BOTAN_MEMORY_OPS_H__ #include #include #include namespace Botan { /** * Zeroize memory * @param ptr a pointer to memory to zero out * @param n the number of bytes pointed to by ptr */ BOTAN_DLL void zero_mem(void* ptr, size_t n); /** * Zeroize memory * @param ptr a pointer to an array * @param n the number of Ts pointed to by ptr */ template inline void clear_mem(T* ptr, size_t n) { std::memset(ptr, 0, sizeof(T)*n); } /** * Copy memory * @param out the destination array * @param in the source array * @param n the number of elements of in/out */ template inline void copy_mem(T* out, const T* in, size_t n) { std::memmove(out, in, sizeof(T)*n); } /** * Set memory to a fixed value * @param ptr a pointer to an array * @param n the number of Ts pointed to by ptr * @param val the value to set each byte to */ template inline void set_mem(T* ptr, size_t n, byte val) { std::memset(ptr, val, sizeof(T)*n); } /** * Memory comparison, input insensitive * @param p1 a pointer to an array * @param p2 a pointer to another array * @param n the number of Ts in p1 and p2 * @return true iff p1[i] == p2[i] forall i in [0...n) */ template inline bool same_mem(const T* p1, const T* p2, size_t n) { volatile T difference = 0; for(size_t i = 0; i != n; ++i) difference |= (p1[i] ^ p2[i]); return difference == 0; } /** * 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 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 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 template<> inline void xor_buf(byte out[], const byte in[], size_t length) { while(length >= 8) { *reinterpret_cast(out) ^= *reinterpret_cast(in); out += 8; in += 8; length -= 8; } for(size_t i = 0; i != length; ++i) out[i] ^= in[i]; } template<> inline void xor_buf(byte out[], const byte in[], const byte in2[], size_t length) { while(length >= 8) { *reinterpret_cast(out) = *reinterpret_cast(in) ^ *reinterpret_cast(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 void xor_buf(std::vector& out, const std::vector& in, size_t n) { xor_buf(out.data(), in.data(), n); } template void xor_buf(std::vector& out, const byte* in, size_t n) { xor_buf(out.data(), in, n); } template void xor_buf(std::vector& out, const byte* in, const std::vector& in2, size_t n) { xor_buf(out.data(), in, in2.data(), n); } template std::vector& operator^=(std::vector& out, const std::vector& in) { if(out.size() < in.size()) out.resize(in.size()); xor_buf(out.data(), in.data(), in.size()); return out; } } #endif