9 #include <botan/loadstor.h>    18    for(
size_t i = 0; i != blocks; ++i)
    24       for(
size_t j = 0; j != 32; ++j)
    27          L += ((R << 4) + K[0]) ^ (R + S) ^ ((R >> 5) + K[1]);
    28          R += ((L << 4) + K[2]) ^ (L + S) ^ ((L >> 5) + K[3]);
    43    for(
size_t i = 0; i != blocks; ++i)
    49       for(
size_t j = 0; j != 32; ++j)
    51          R -= ((L << 4) + K[2]) ^ (L + S) ^ ((L >> 5) + K[3]);
    52          L -= ((R << 4) + K[0]) ^ (R + S) ^ ((R >> 5) + K[1]);
    66 void TEA::key_schedule(
const byte key[], 
size_t)
    68    for(
size_t i = 0; i != 4; ++i)
 
void decrypt_n(const byte in[], byte out[], size_t blocks) const
u32bit load_be< u32bit >(const byte in[], size_t off)
void encrypt_n(const byte in[], byte out[], size_t blocks) const
void store_be(u16bit in, byte out[2])