forked from mvr/barrister
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBits.hpp
157 lines (129 loc) · 3.9 KB
/
Bits.hpp
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#pragma once
#include <stdint.h>
#include "LifeAPI.h"
void inline HalfAdd(uint64_t &out0, uint64_t &out1, const uint64_t ina, const uint64_t inb) {
out0 = ina ^ inb;
out1 = ina & inb;
}
void inline FullAdd(uint64_t &out0, uint64_t &out1, const uint64_t ina, const uint64_t inb, const uint64_t inc) {
uint64_t halftotal = ina ^ inb;
out0 = halftotal ^ inc;
uint64_t halfcarry1 = ina & inb;
uint64_t halfcarry2 = inc & halftotal;
out1 = halfcarry1 | halfcarry2;
}
void inline CountRows(const LifeState &state, LifeState &__restrict__ bit0, LifeState &__restrict__ bit1) {
for (int i = 0; i < N; i++) {
uint64_t a = state.state[i];
uint64_t l = RotateLeft(a);
uint64_t r = RotateRight(a);
bit0.state[i] = l ^ r ^ a;
bit1.state[i] = ((l ^ r) & a) | (l & r);
}
}
void inline CountNeighbourhood(const LifeState &state, LifeState &__restrict__ bit3, LifeState &__restrict__ bit2, LifeState &__restrict__ bit1, LifeState &__restrict__ bit0) {
LifeState col0(false), col1(false);
CountRows(state, col0, col1);
for (int i = 0; i < N; i++) {
int idxU;
int idxB;
if (i == 0)
idxU = N - 1;
else
idxU = i - 1;
if (i == N - 1)
idxB = 0;
else
idxB = i + 1;
uint64_t on3, on2, on1, on0;
{
uint64_t u_on1 = col1.state[idxU];
uint64_t u_on0 = col0.state[idxU];
uint64_t c_on1 = col1.state[i];
uint64_t c_on0 = col0.state[i];
uint64_t l_on1 = col1.state[idxB];
uint64_t l_on0 = col0.state[idxB];
uint64_t uc0, uc1, uc2, uc_carry0;
HalfAdd(uc0, uc_carry0, u_on0, c_on0);
FullAdd(uc1, uc2, u_on1, c_on1, uc_carry0);
uint64_t on_carry1, on_carry0;
HalfAdd(on0, on_carry0, uc0, l_on0);
FullAdd(on1, on_carry1, uc1, l_on1, on_carry0);
HalfAdd(on2, on3, uc2, on_carry1);
bit3.state[i] = on3;
bit2.state[i] = on2;
bit1.state[i] = on1;
bit0.state[i] = on0;
}
}
}
std::array<uint64_t, 4> inline CountNeighbourhoodColumn(const LifeState &state, int column) {
std::array<uint64_t, 4> nearby;
for (int i = 0; i < 4; i++) {
int c = (column + i - 1 + N) % N;
nearby[i] = state[c];
}
std::array<uint64_t, 4> col0;
std::array<uint64_t, 4> col1;
for (int i = 0; i < 4; i++) {
uint64_t a = nearby[i];
uint64_t l = RotateLeft(a);
uint64_t r = RotateRight(a);
col0[i] = l ^ r ^ a;
col1[i] = ((l ^ r) & a) | (l & r);
}
std::array<uint64_t, 4> result;
{
int idxU = 0;
int i = 1;
int idxB = 2;
uint64_t u_on1 = col1[idxU];
uint64_t u_on0 = col0[idxU];
uint64_t c_on1 = col1[i];
uint64_t c_on0 = col0[i];
uint64_t l_on1 = col1[idxB];
uint64_t l_on0 = col0[idxB];
uint64_t uc0, uc1, uc2, uc_carry0;
HalfAdd(uc0, uc_carry0, u_on0, c_on0);
FullAdd(uc1, uc2, u_on1, c_on1, uc_carry0);
uint64_t on_carry1, on_carry0;
HalfAdd(result[3], on_carry0, uc0, l_on0);
FullAdd(result[2], on_carry1, uc1, l_on1, on_carry0);
HalfAdd(result[1], result[0], uc2, on_carry1);
}
return result;
}
template <uint32_t max>
class LifeCountdown {
public:
static constexpr uint32_t lmax = (max == 0) ? 0 : 32 - __builtin_clz(max);
LifeState started;
LifeState finished;
std::array<LifeState, lmax> counter = {0};
uint32_t n;
LifeCountdown() : started{}, finished{}, counter{}, n{0} {};
LifeCountdown(uint32_t n) : started{}, finished{}, counter{}, n{n} {};
void Start(const LifeState &state) {
LifeState newStarted = state & ~started;
for (unsigned i = 0; i < lmax; i++) {
if ((n >> i) & 1) {
counter[i] |= newStarted;
}
}
started |= state;
}
void Reset(const LifeState &state) {
for (unsigned i = 0; i < lmax; i++) {
counter[i] &= ~state;
}
started &= ~state;
}
void Tick() {
auto carry = started;
for (unsigned i = 0; i < lmax; i++) {
counter[i] ^= carry;
carry &= counter[i];
}
finished |= carry;
}
};