word.h 2.85 KB
Newer Older
Martin Schläffer committed
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
#ifndef WORD_H_
#define WORD_H_

#include <stdint.h>

#include "endian.h"
#include "interleave.h"

typedef union {
  uint64_t w;
  uint8_t b[8];
} word_t;

__forceinline uint8_t ROR8(uint8_t a, int n) { return a >> n | a << (8 - n); }

__forceinline word_t ROR64(word_t a, int n) {
  word_t b;
  b.b[0] = ROR8(a.b[(n + 0) & 0x7], (n + 0) >> 3);
  b.b[1] = ROR8(a.b[(n + 1) & 0x7], (n + 1) >> 3);
  b.b[2] = ROR8(a.b[(n + 2) & 0x7], (n + 2) >> 3);
  b.b[3] = ROR8(a.b[(n + 3) & 0x7], (n + 3) >> 3);
  b.b[4] = ROR8(a.b[(n + 4) & 0x7], (n + 4) >> 3);
  b.b[5] = ROR8(a.b[(n + 5) & 0x7], (n + 5) >> 3);
  b.b[6] = ROR8(a.b[(n + 6) & 0x7], (n + 6) >> 3);
  b.b[7] = ROR8(a.b[(n + 7) & 0x7], (n + 7) >> 3);
  return b;
}

__forceinline word_t WORD_T(uint64_t x) {
  word_t w;
  w.w = x;
  return w;
}

__forceinline uint64_t UINT64_T(word_t w) {
  uint64_t x;
  x = w.w;
  return x;
}

__forceinline word_t U64TOWORD(uint64_t x) { return WORD_T(interleave8(x)); }

__forceinline uint64_t WORDTOU64(word_t w) { return interleave8(UINT64_T(w)); }

__forceinline word_t NOT(word_t a) {
  a.w = ~a.w;
  return a;
}

__forceinline word_t XOR(word_t a, word_t b) {
  a.w ^= b.w;
  return a;
}

__forceinline word_t AND(word_t a, word_t b) {
  a.w &= b.w;
  return a;
}

__forceinline word_t KEYROT(word_t lo2hi, word_t hi2lo) {
  word_t w;
  w.w = lo2hi.w << 32 | hi2lo.w >> 32;
  return w;
}

__forceinline uint8_t NOTZERO(word_t a, word_t b) {
  uint64_t result = a.w | b.w;
  result |= result >> 32;
  result |= result >> 16;
  result |= result >> 8;
  return (uint8_t)result;
}

__forceinline word_t PAD(int i) { return (word_t){.b[7] = 0x80 >> i}; }

__forceinline word_t CLEAR(word_t w, int n) {
  /* undefined for n == 0 */
  uint8_t m = 0xff >> n;
  word_t mask = {
      .b[0] = m,
      .b[1] = m,
      .b[2] = m,
      .b[3] = m,
      .b[4] = m,
      .b[5] = m,
      .b[6] = m,
      .b[7] = m,
  };
  return AND(w, mask);
}

__forceinline uint64_t MASK(int n) {
  /* undefined for n == 0 */
  return ~0ull >> (64 - 8 * n);
}

__forceinline word_t LOAD64(const uint8_t* bytes) {
  uint64_t x = *(uint64_t*)bytes;
  return U64TOWORD(U64BIG(x));
}

__forceinline void STORE64(uint8_t* bytes, word_t w) {
  uint64_t x = WORDTOU64(w);
  *(uint64_t*)bytes = U64BIG(x);
}

__forceinline word_t LOAD(const uint8_t* bytes, int n) {
  uint64_t x = *(uint64_t*)bytes & MASK(n);
  return U64TOWORD(U64BIG(x));
}

__forceinline void STORE(uint8_t* bytes, word_t w, int n) {
  uint64_t x = WORDTOU64(w);
  *(uint64_t*)bytes &= ~MASK(n);
  *(uint64_t*)bytes |= U64BIG(x);
}

__forceinline word_t LOADBYTES(const uint8_t* bytes, int n) {
  uint64_t x = 0;
  for (int i = 0; i < n; ++i) ((uint8_t*)&x)[7 - i] = bytes[i];
  return U64TOWORD(x);
}

__forceinline void STOREBYTES(uint8_t* bytes, word_t w, int n) {
  uint64_t x = WORDTOU64(w);
  for (int i = 0; i < n; ++i) bytes[i] = ((uint8_t*)&x)[7 - i];
}

#endif /* WORD_H_ */