-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathwire.hpp
451 lines (393 loc) · 10.7 KB
/
wire.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
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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
/******************************************************************************
* Copyright (c) 2015-2016, Nils Christopher Brause
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*****************************************************************************/
#ifndef WIRE_HPP
#define WIRE_HPP
#include <cassert>
#include <iostream>
#include <map>
#include <memory>
#include <mutex>
#include <limits>
#include <set>
#include <base.hpp>
namespace hdl
{
template<typename T>
class wire;
namespace detail
{
#ifdef MULTIASSIGN
// Resolve multiple assignments to a wire.
// Has to be reimplemented by types with high-Z support.
template <typename T>
T resolve(const std::map<detail::base*, T> &candidates,
const detail::base *w)
{
if(candidates.size() > 1)
{
std::cerr << "ERROR: While updating " << w->getname() << ": resolve() unimplemented for type "
<< typeid(T).name() << ". Drivers: " << std::endl;
for(auto d : candidates)
std::cout << " " << (!d.first ? "NULL" : d.first->getname()) << std::endl;
}
return candidates.begin()->second;
}
#endif
}
template<typename T>
class wire
{
private:
class wire_int : public detail::base
{
private:
T state;
T prev_state;
#ifdef MULTIASSIGN
std::map<base*, T> drivers;
#else
T next_state;
bool been_set;
#ifdef DEBUG
std::set<base*> drivers;
#endif
#endif
bool first;
std::map<base*, bool> seen_event;
std::mutex mutex;
virtual void update(uint64_t)
{
#ifdef MULTIASSIGN
if(drivers.size() > 0)
{
prev_state = state;
state = resolve(drivers, this);
for(auto &c : seen_event)
c.second = false;
}
#else
if(been_set)
{
prev_state = state;
state = next_state;
for(auto &c : seen_event)
c.second = false;
been_set = false;
}
#endif
set_changed(false);
}
template <typename U>
void set(const U &u)
{
T t;
t = u;
#ifdef MULTIASSIGN
{
std::lock_guard<std::mutex> lock(mutex);
drivers[get_cur_part()] = t;
}
if(!changed())
if(t != state)
set_changed(true);
/*
if(resolve(drivers, this) != state)
been_changed = true;
*/
#else
#ifdef DEBUG
{
std::lock_guard<std::mutex> lock(mutex);
drivers.insert(get_cur_part());
}
if(drivers.size() > 1)
{
std::cerr << "ERROR: Wire \"" << getname() << "\" has multiple drivers: " << std::endl;
for(auto d : drivers)
std::cout << " " << (!d ? "NULL" : d->getname()) << std::endl;
}
#endif
next_state = t;
been_set = true;
if(!changed())
if(next_state != state)
set_changed(true);
#endif
}
T get()
{
return state;
}
bool event()
{
std::lock_guard<std::mutex> lock(mutex);
bool seen = seen_event[get_cur_part()];
seen_event[get_cur_part()] = true;
return (prev_state != state) && !seen;
}
std::string print()
{
std::stringstream ss;
ss << get();
return ss.str();
}
wire_int()
: state(T()), prev_state(T()),
#ifndef MULTIASSIGN
been_set(false),
#endif
first(true)
{
}
friend class wire<T>;
};
std::shared_ptr<wire_int> w;
public:
wire()
: w(new wire_int())
{
detail::wires.push_back(w);
}
wire(T initial)
: w(new wire_int())
{
w->set(initial);
detail::wires.push_back(w);
}
bool event() const
{
return w->event();
}
std::string getname() const
{
return w->getname();
}
void setname(std::string name)
{
w->setname(name);
}
// assignment operators
template <typename U>
void operator=(const U &t) const
{
w->set(t);
}
template <typename U>
void operator=(const wire<U> &w2) const
{
w->set(w2.get());
}
void operator=(const wire<T> &w2) const
{
w->set(w2.get());
}
// conversion operators
operator T() const
{
return w->get();
}
T get() const
{
return w->get();
}
operator std::shared_ptr<detail::base>() const
{
return w;
}
operator std::list<std::shared_ptr<detail::base>>() const
{
std::list<std::shared_ptr<detail::base> > result;
result.push_back(w);
return result;
}
// unary operators
#define OPERATOR1(OP) \
decltype(OP T()) operator OP() const \
{ \
return OP w->get(); \
} \
OPERATOR1(!)
OPERATOR1(~)
OPERATOR1(+)
OPERATOR1(-)
// binary operators
#define OPERATOR2(OP) \
template <typename U> \
decltype(T() OP U()) operator OP(const wire<U> &w2) const \
{ \
return w->get() OP w2.get(); \
} \
\
template <typename U> \
decltype(T() OP U()) operator OP(const U &t) const \
{ \
return w->get() OP t; \
}
OPERATOR2(==)
OPERATOR2(!=)
OPERATOR2(>)
OPERATOR2(<)
OPERATOR2(>=)
OPERATOR2(<=)
OPERATOR2(&)
OPERATOR2(|)
OPERATOR2(^)
OPERATOR2(+)
OPERATOR2(-)
OPERATOR2(*)
OPERATOR2(/)
OPERATOR2(%)
OPERATOR2(<<)
OPERATOR2(>>)
// modifying operators
#define OPERATOR3(OP, OP2) \
template <typename U> \
const wire<T> &operator OP(const wire<U> &w2) const \
{ \
w->set(w->get() OP2 w2.get()); \
return *this; \
} \
\
template <typename U> \
const wire<T> &operator OP(const U &t) const \
{ \
w->set(w->get() OP2 static_cast<T>(t)); \
return *this; \
}
OPERATOR3(&=, &)
OPERATOR3(|=, |)
OPERATOR3(^=, ^)
OPERATOR3(+=, +)
OPERATOR3(-=, -)
OPERATOR3(*=, *)
OPERATOR3(/=, /)
OPERATOR3(%=, %)
OPERATOR3(<<=, <<)
OPERATOR3(>>=, >>)
};
template <typename T, unsigned int width>
class bus
{
private:
class bus_int : public detail::named_obj
{
private:
static_assert(width > 0, "width > 0");
std::array<wire<T>, width> wires;
public:
bus_int()
: named_obj("")
{
}
const wire<T> &at(unsigned int n) const
{
return wires.at(n);
}
void setname(std::string name)
{
for(unsigned int c = 0; c < wires.size(); c++)
wires[c].setname(name + "[" + std::to_string(c) + "]");
named_obj::setname(name);
}
};
std::shared_ptr<bus_int> b;
public:
bus()
: b(new bus_int())
{
}
bus(std::initializer_list<T> initial)
: b(new bus_int())
{
assert(initial.size() == width);
unsigned int c = width-1;
for(auto &i : initial)
b->at(c--) = i;
}
bus(std::array<T, width> initial)
: b(new bus_int())
{
operator=(initial);
}
void setname(std::string name)
{
b->setname(name);
}
std::string getname() const
{
return b->getname();
}
const wire<T> &operator[](unsigned int n) const
{
return b->at(n);
}
const wire<T> &at(unsigned int n) const
{
return b->at(n);
}
// assignment operators
void operator=(const std::array<T, width> &b2) const
{
for(unsigned int c = 0; c < width; c++)
b->at(c) = b2[c];
}
void operator=(const bus<T, width> &b2) const
{
for(unsigned int c = 0; c < width; c++)
b->at(c) = b2[c];
}
// conversion operators
operator std::array<T, width>() const
{
std::array<T, width> result;
for(unsigned int c = 0; c < width; c++)
result[c] = b->at(c);
return result;
}
operator std::list<std::shared_ptr<detail::base>>() const
{
std::list<std::shared_ptr<detail::base> > result;
for(unsigned int c = 0; c < width; c++)
result.push_back(b->at(c));
return result;
}
};
template <typename T, unsigned int width>
std::ostream& operator<<(std::ostream& lhs, bus<T, width> const& rhs)
{
for(unsigned int c = 0; c < width; c++)
lhs << rhs[width-c-1].get();
return lhs;
}
template <typename T>
std::ostream& operator<<(std::ostream& lhs, wire<T> const& rhs)
{
lhs << rhs.get();
return lhs;
}
}
#endif