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
|
================================================
========== ADAM's BIG ARSE TODO LIST ============
================================================
======== Current Tasks ========
Update spec
<>
Add Unit Tests for each pass
Separate passes into discrete chunks
Push all tests entirely through
Check after each pass
======== Update Core ==========
Add source locaters
======== Check Passes ==========
Well-formed high firrtl
Unique names per module
No name can be a prefix of any other name.
No nested modules
Only modules in circuit (no statements or expressions)
Cannot connect directly to a mem ever
Subfields are only on bundles, before type inference
Can only connect to a Ref or Subfield or Index
UInt only has positive ints
No combinational loops
cannot connect to a pad, or a register. only connct to a reference
onreset can only handle a register
all references are declared
expression in pad must be a ground type
node's value cannot be a bundle with a flip in it
mems cannot be a bundle with flips
2nd arg in dshr/l must be UInt
pred in conditionally must be of type UInt
After adding dynamic assertions, insert bounds check with accessor expansion
Well-formed low firrtl
All things only assigned to once
Width inference
No names
No Unknowns
All widths are positive
Pad's width is greater than value's width
pad's width is greater than value's width
======== Other Passes ========
constant folding (partial eval) pass
Get rid of unnecessary pads
push pad into literal
common subexpression elimination pass
deadcode elimination
Verilog backend
Eliminate skips
======== Consultations ========
Stephen:
width equality
pin stephen on an example
Patrick:
move Infer-Widths to before vec expansion?
talk about primops
======== Think About ========
<>
subword accesses
verilog style guide
annotation system
zero-width wires
expanding mems (consider changing defmem to be size, and element type)
Multi-streams for print statements/asserts (Jack)
Consider def female node. (Patrick)
Talk to palmer/patrick about how writing passes is going to be supported
Figure out how widths propogate for all updated primops (Adam)
Add FIFOs to the IR (Palmer)
Think about supporting generic primops on bundles and vecs (Adam) (wait until front-end more completed)
Union Types
Enums?
Convert to scala
Firrtl interpreter (in scala)
======== Update Spec ========
Add Not to spec
add assertions and printfs
cannot connect directly to a mem (loc can never contain a mem)
Front-end needs to guarantee unique names per module.
FIRRTL rule: No name can be a prefix of any other name.
Future questions to address in spec:
Introduction – motivation, and intended usage
Philosophical justifications for all constructs
More introduction for types, e.g. what is a ground type?
What is a statement? What is an expression? What is a memory? Difference between vector type and memory? What are accessors for?
Why would I ever write an empty statement? Mainly for use by compiler/passes
What is a structural element? Duplication?
Subtracting two unsigned numbers… Should talk to a math guy to figure it out
What are shift left and shift right operations? HW doesn’t have these concepts. Need justification.
What is lowered form? What is it for?
======== Pass Ideas ==========
Bounds checks for accessors
Overflow checks for add/add-wrap
Check combinational
Fast C++ where wires/register/instances are predicated
Verilog backend - put stuff in posedge clock, not assign statements, for speedup
Annotate mems with location stuff
Coverage tests, such as statespace or specific instances (like asserts, sort of)
======== FIRRTL++ =========
Variable size FIFOs
TruthTable node
Custom types? Parameterized Types?
======== Next Layer Components =======
Accelerator with config registers
Schedulable
Decouple
Nack
Scheduler
======== Notes ========
Only for MUXES, AS, and __ can width inference go backwards:
reg r : UInt<5>
r := MUX(p,UInt<?>(1),UInt<?>(2))
==>
reg r : UInt<5>
r := MUX(p,UInt<5>(1),UInt<5>(2))
Which ones
Treat everything as just bits - the only operators that should exist are ones that emit different bits
Go through all primops with Andrew
|
