-
Notifications
You must be signed in to change notification settings - Fork 16
/
LogicData.cpp
257 lines (213 loc) · 4.95 KB
/
LogicData.cpp
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
#include "Arduino.h"
#include "LogicData.h"
// Expect 1 bit per millisecond
#define SAMPLE_RATE 1000
// Push to head; pop from tail
index_t mque::next(index_t x)
{
return ( x + 1 ) % Q_MAX;
}
bool mque::empty() {
return tail == head;
}
bool mque::full() {
return next(tail) == head;
}
index_t mque::size()
{
return (Q_MAX + head - tail) % Q_MAX;
}
// destructive push; pushes even if full
bool mque::push(micros_t t)
{
// NOTE: Caller should have disabled interrupts
trace[head] = t;
head = next(head);
if (tail == head) {
tail = next(tail);
}
}
// destructive pop; no-op if empty
bool mque::pop(micros_t * t)
{
noInterrupts();
if (empty()) return false;
*t = trace[tail];
tail = next(tail);
interrupts();
return true;
}
// drop elements from the tail of the queue; no range-checking!
void mque::drop(index_t n)
{
noInterrupts();
tail += n;
tail %= Q_MAX; // TODO: Check if this is expensive
interrupts();
}
// non-destructive indexed peek
bool mque::peek(index_t index, micros_t * t)
{
if (index >= size()) return false;
noInterrupts();
index += tail;
index %= Q_MAX;
*t = trace[index];
interrupts();
return true;
}
//------------------------------------------------------
void LogicData::Begin() {
pinMode(tx_pin, OUTPUT);
SendBit(MARK); // IDLE-CLOSED
}
void LogicData::PinChange(bool level) {
if (level != prev_level) {
prev_level = level;
micros_t now = micros();
if (pin_idle) {
q.push(BIG_IDLE);
pin_idle = false;
} else {
q.push(now-prev_bit);
}
prev_bit = now;
}
}
void LogicData::Service() {
micros_t idle_time = micros() - prev_bit;
if (!pin_idle && idle_time >= IDLE_TIME) {
noInterrupts();
if (micros() - prev_bit >= IDLE_TIME) {
pin_idle = true;
}
interrupts();
}
}
uint32_t LogicData::ReadTrace() {
index_t fini;
noInterrupts();
fini=q.tail;
bool level = ((q.size() & 1)==0) ^ !prev_level;
interrupts();
micros_t t;
index_t i=0;
//-- Find start-bit (idle)
for (; q.peek(i, &t); i++) {
if (level && t > 40 * SAMPLE_RATE) break;
level = !level;
}
// HACK: show stream of us-times :HACK
if (q.pop(&t)) {
noInterrupts();
t = micros_t(0x12340000) + micros_t(q.head) * 256 + q.tail;
// Huh: this is weird. head and tail always seem to increment by 2. at least until we go empty.
// Wait -- no we don't. Looks like my read timing is wrong on stream.py.
interrupts();
return t;
if (t>0x3fffffff) t=0x3fffffff;
t|= 0x40000000;
// if (level) t|= 0x10000000;
return t;
}
return 0;
//-- Sample signals at mid-point of data rate
uint32_t mask = 1<<31;
uint32_t acc = 0;
acc = 0;
micros_t t_meas = SAMPLE_RATE/2;
for (t=0; mask; mask >>= 1) {
if (t_meas < SAMPLE_RATE) {
if (!q.peek(++i, &t)) break;
level = !level;
t_meas += t;
}
acc += !level ? mask : 0;
t_meas -= SAMPLE_RATE;
}
// ran out of signal before we got whole word
if (mask) return 0;
// We decoded a word and it consumed i samples
noInterrupts();
if (fini == q.tail) {
q.drop(i-1);
} else {
// race fail; return 0 and let the caller try again later
acc = 0;
}
interrupts();
return acc;
}
// Transmit
void LogicData::SendBit(bool bit) {
digitalWrite(tx_pin, bit);
}
void LogicData::MicroDelay(micros_t us) {
// spin-wait until timer advances
while (true) {
Service();
micros_t now = micros();
now -= timer;
if (now >= us) break;
// TODO: if (t-now > 50) usleep(t-now-50);
}
timer += us;
}
void LogicData::Delay(uint16_t ms) {
MicroDelay(micros_t(ms)*1000);
}
void LogicData::SendBit(bool bit, uint16_t ms) {
SendBit(bit);
Delay(ms);
}
void LogicData::Space(uint16_t ms) {
SendBit(SPACE, ms);
}
void LogicData::SendStartBit() {
Space(LOGICDATA_MIN_START_BIT);
}
void LogicData::LogicData::Stop() {
SendBit(MARK); // IDLE-CLOSED
}
void LogicData::Send(uint32_t data) {
SendStartBit();
for (uint32_t i = 0x80000000 ; i; i/=2) {
SendBit((i&data)?SPACE:MARK, 1);
}
SendBit(SPACE); // IDLE-OPEN
}
void LogicData::OpenChannel() {
if (active) return;
active = true;
start = timer = micros();
SendBit(SPACE);
}
void LogicData::CloseChannel() {
// Send a SPACE at least long enough so our command-channel was open for 500ms, or
// just start-bit length if we've already been open that long.
if (!active) return;
// Workaround for stuck timers
Stop();
return;
// BUG: Following timers never expire!
micros_t delta = timer-start;
if (delta/1000 + LOGICDATA_MIN_START_BIT < LOGICDATA_MIN_WINDOW_MS) {
timer=start;
Space(LOGICDATA_MIN_WINDOW_MS);
} else {
Space(LOGICDATA_MIN_START_BIT);
}
Stop();
active = false;
}
void LogicData::Send(uint32_t * data, unsigned count) {
if (!count) return;
OpenChannel();
for (unsigned i = 0; i != count; i++) {
Send(data[i]);
}
CloseChannel();
}
//
// LOGICDATA protocol
//////////////////////////////////////////////////////////