-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtx.go
245 lines (228 loc) · 6.65 KB
/
tx.go
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
package canard
import (
"math"
"unsafe"
)
// Contains OpenCyphal transmission/transfer logic.
func (q *TxQueue) Push(src NodeID, txDeadline microsecond, metadata *Metadata, payloadSize int, payload []byte) error {
switch {
case q == nil || metadata == nil:
return ErrInvalidArgument
case len(payload) == 0 && payloadSize != 0:
return errEmptyPayload
}
pl_mtu := adjustPresentationLayerMTU(q.MTU)
maybeCan, err := metadata.makeCANID(payloadSize, payload, src, pl_mtu)
if err != nil {
return err
}
if payloadSize > pl_mtu {
_, err := q.pushMultiFrame(txDeadline, maybeCan, metadata.TID, pl_mtu, payloadSize, payload)
return err
}
err = q.pushSingleFrame(txDeadline, maybeCan, metadata.TID, payloadSize, payload)
if err != nil {
return err
}
return nil
}
func (q *TxQueue) Peek() *TxQueueItem {
tqi := findExtremum(q.root, false)
if tqi == nil {
return nil
}
return (*TxQueueItem)(unsafe.Pointer(tqi))
}
// Pop removes item from the TxQueue and returns the removed item.
// If item is nil then the first item is removed from the Queue and returned.
func (q *TxQueue) Pop(item *TxQueueItem) *TxQueueItem {
if item == nil {
item = q.Peek()
if item == nil {
panic("attempted to pop with no items in queue")
}
}
remove(&q.root, &item.base)
q.size--
return item
}
// / Chain of TX frames prepared for insertion into a TX queue.
type txChain struct {
head *TxItem
tail *TxItem
size int
}
func adjustPresentationLayerMTU(mtuBytes int) (mtu int) {
switch {
case mtuBytes < _MTU_CAN_CLASSIC:
mtu = _MTU_CAN_CLASSIC
case mtuBytes <= len(canLengthToDLC)-1:
mtu = int(canDLCToLength[canLengthToDLC[mtuBytes]])
default:
mtu = int(canDLCToLength[canLengthToDLC[len(canLengthToDLC)-1]])
}
return mtu - 1
}
func (q *TxQueue) pushMultiFrame(deadline microsecond, canID uint32, tid TID, pl_mtu, payloadSize int, payload []byte) (int, error) {
switch {
case len(payload) == 0 && payloadSize != 0:
return 0, errEmptyPayload
}
// Number of frames enqueued.
var out int
payloadSizeWithCRC := payloadSize + int(unsafe.Sizeof(CRC(0)))
numFrames := (payloadSizeWithCRC + pl_mtu - 1) / pl_mtu
if numFrames < 2 {
panic("unreachable: pushMultiframe used for single frame transport")
}
if q.size+numFrames > q.Cap {
panic("OOM: tx queue capacity cannot fit multiframe transport")
}
sq := generateMultiFrameChain(deadline, canID, tid, pl_mtu, payloadSize, payload)
if sq.tail == nil {
panic("nil tail")
} else if sq.head == nil {
panic("nil head")
}
next := &sq.head.base
for next != nil {
res, err := search(&q.root, &next.base, predicateTx, avlTrivialFactory)
if err != nil {
return 0, err
}
if res != &next.base || q.root == nil {
panic("bad search result")
}
next = next.nextInTx
}
if numFrames != sq.size || q.size > q.Cap || sq.size > math.MaxInt32 {
panic("unexpected result in multi frame transfer")
}
q.size += sq.size
out = sq.size
return out, nil
}
func generateMultiFrameChain(deadline microsecond, canID uint32, tid TID, pl_mtu, payloadSize int, payload []byte) txChain {
switch {
case pl_mtu <= 0:
panic("bad presentation layer MTU")
case payloadSize <= pl_mtu:
panic("multi frame needs smaller than MTU payload size")
}
const crcSize = int(unsafe.Sizeof(CRC(0)))
payloadWithOffset := payload
var chain txChain
payloadSizeWithCRC := payloadSize + crcSize
crc := newCRC().Add(payload[:payloadSize])
toggle := true // initial toggle state
offset := 0
for offset < payloadSizeWithCRC {
var frameWithTailSize int
chain.size++
if payloadSizeWithCRC-offset < pl_mtu {
frameWithTailSize = roundPayloadSizeUp(payloadSizeWithCRC - offset + 1)
} else {
frameWithTailSize = pl_mtu + 1
}
tqi := newTxItem(deadline, frameWithTailSize, canID)
if chain.head == nil {
chain.head = tqi
} else {
chain.tail.base.nextInTx = &tqi.base
}
chain.tail = tqi
// copy payload into the frame
framePayloadSize := frameWithTailSize - 1
frameOffset := 0
if offset < payloadSize {
moveSize := payloadSize - offset
if moveSize > framePayloadSize {
moveSize = framePayloadSize
}
copy(chain.tail.payloadBuffer[:], payloadWithOffset[:moveSize])
frameOffset += moveSize
offset += moveSize
payloadWithOffset = payloadWithOffset[moveSize:]
}
if offset >= payloadSize {
// Handle the last frame of transfer. Contains padding and CRC.
for frameOffset+crcSize < framePayloadSize {
// Insert padding for last frame and include it in CRC.
chain.tail.payloadBuffer[frameOffset] = 0 // Padding value.
frameOffset++
crc = crc.AddByte(0)
}
if frameOffset < framePayloadSize && offset == payloadSize {
// Insert higher bits of CRC.
chain.tail.payloadBuffer[frameOffset] = byte(crc >> 8)
frameOffset++
offset++
}
if frameOffset < framePayloadSize && offset > payloadSize {
// Insert lower bits of CRC.
chain.tail.payloadBuffer[frameOffset] = byte(crc & 0xff)
frameOffset++
offset++
}
}
if frameOffset+1 != chain.tail.base.frame.payloadSize {
panic("frameOffset+1 != tail frame payloadsize")
}
chain.tail.payloadBuffer[frameOffset] = tailByte(chain.head == chain.tail, offset >= payloadSizeWithCRC, toggle, tid)
toggle = !toggle
}
return chain
}
func (q *TxQueue) pushSingleFrame(deadline microsecond, canID uint32, tid TID, payloadSize int, payload []byte) error {
framePayloadSize := roundPayloadSizeUp(payloadSize + 1)
padding := framePayloadSize - payloadSize - 1
switch {
case len(payload) == 0 && payloadSize != 0:
return errEmptyPayload
case framePayloadSize <= payloadSize:
panic("OOB framePayloadSize <= payloadSize")
case padding+payloadSize+1 != framePayloadSize:
panic("overflow")
}
tqi := newTxItem(deadline, framePayloadSize, canID)
if payloadSize > 0 {
copy(tqi.payloadBuffer[:], payload[:payloadSize])
}
// Set tail byte.
tqi.payloadBuffer[framePayloadSize-1] = tailByte(true, true, true, tid)
res, err := search(&q.root, &tqi.base.base, predicateTx, avlTrivialFactory)
if err != nil {
return err
}
if res != &tqi.base.base {
panic("bad AVL search result")
}
q.size++
if q.size > q.Cap {
panic("OOM on queue size exceed cap")
}
return nil
}
func roundPayloadSizeUp(x int) int {
return int(canDLCToLength[canLengthToDLC[x]])
}
func tailByte(start, end, toggle bool, tid TID) (tail byte) {
tail = byte(tid & TRANSFER_ID_MAX)
tail |= byte(b2i(toggle) << 5)
tail |= byte(b2i(end) << 6)
tail |= byte(b2i(start) << 7)
return tail
}
func newTxItem(deadline microsecond, size int, extendedCANID uint32) *TxItem {
tqi := &TxItem{
base: TxQueueItem{
deadline: deadline,
frame: Frame{
payloadSize: size,
extendedCANID: extendedCANID,
},
},
}
tqi.base.frame.payload = tqi.payloadBuffer[:]
return tqi
}