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
|
// SPDX-FileCopyrightText: 2023 The Pion community <https://pion.ly>
// SPDX-License-Identifier: MIT
package jitterbuffer
import (
"runtime"
"sync/atomic"
"testing"
"time"
"github.com/pion/rtp"
"github.com/stretchr/testify/assert"
)
func TestPriorityQueue(t *testing.T) {
assert := assert.New(t)
t.Run("Appends packets in order", func(*testing.T) {
pkt := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5000, Timestamp: 500}, Payload: []byte{0x02}}
q := NewQueue()
q.Push(pkt, pkt.SequenceNumber)
pkt2 := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5004, Timestamp: 500}, Payload: []byte{0x02}}
q.Push(pkt2, pkt2.SequenceNumber)
assert.Equal(q.next.next.val, pkt2)
assert.Equal(q.next.priority, uint16(5000))
assert.Equal(q.next.next.priority, uint16(5004))
})
t.Run("Appends many in order", func(*testing.T) {
queue := NewQueue()
for i := 0; i < 100; i++ {
//nolint:gosec // G115
queue.Push(
&rtp.Packet{
Header: rtp.Header{
SequenceNumber: uint16(5012 + i),
Timestamp: uint32(512 + i),
},
Payload: []byte{0x02},
},
uint16(5012+i),
)
}
assert.Equal(uint16(100), queue.Length())
last := (*node)(nil)
cur := queue.next
for cur != nil {
last = cur
cur = cur.next
if cur != nil {
assert.Equal(cur.priority, last.priority+1)
}
}
assert.Equal(queue.next.priority, uint16(5012))
assert.Equal(last.priority, uint16(5012+99))
})
t.Run("Can remove an element", func(*testing.T) {
pkt := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5000, Timestamp: 500}, Payload: []byte{0x02}}
queue := NewQueue()
queue.Push(pkt, pkt.SequenceNumber)
pkt2 := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5004, Timestamp: 500}, Payload: []byte{0x02}}
queue.Push(pkt2, pkt2.SequenceNumber)
for i := 0; i < 100; i++ {
//nolint:gosec // G115
queue.Push(
&rtp.Packet{
Header: rtp.Header{SequenceNumber: uint16(5012 + i), Timestamp: uint32(512 + i)},
Payload: []byte{0x02},
},
uint16(5012+i),
)
}
popped, _ := queue.Pop()
assert.Equal(popped.SequenceNumber, uint16(5000))
_, _ = queue.Pop()
nextPop, _ := queue.Pop()
assert.Equal(nextPop.SequenceNumber, uint16(5012))
})
t.Run("Appends in order", func(*testing.T) {
queue := NewQueue()
for i := 0; i < 100; i++ {
queue.Push(
&rtp.Packet{
Header: rtp.Header{
SequenceNumber: uint16(5012 + i), //nolint:gosec // G115
Timestamp: uint32(512 + i), //nolint:gosec // G115
},
Payload: []byte{0x02},
},
uint16(5012+i), //nolint:gosec // G115
)
}
assert.Equal(uint16(100), queue.Length())
pkt := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5000, Timestamp: 500}, Payload: []byte{0x02}}
queue.Push(pkt, pkt.SequenceNumber)
assert.Equal(pkt, queue.next.val)
assert.Equal(uint16(101), queue.Length())
assert.Equal(queue.next.priority, uint16(5000))
})
t.Run("Can find", func(*testing.T) {
queue := NewQueue()
for i := 0; i < 100; i++ {
//nolint:gosec // G115
queue.Push(
&rtp.Packet{
Header: rtp.Header{
SequenceNumber: uint16(5012 + i),
Timestamp: uint32(512 + i),
},
Payload: []byte{0x02},
},
uint16(5012+i),
)
}
pkt, err := queue.Find(5012)
assert.Equal(pkt.SequenceNumber, uint16(5012))
assert.Equal(err, nil)
})
t.Run("Updates the length when PopAt* are called", func(*testing.T) {
pkt := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5000, Timestamp: 500}, Payload: []byte{0x02}}
queue := NewQueue()
queue.Push(pkt, pkt.SequenceNumber)
pkt2 := &rtp.Packet{Header: rtp.Header{SequenceNumber: 5004, Timestamp: 500}, Payload: []byte{0x02}}
queue.Push(pkt2, pkt2.SequenceNumber)
for i := 0; i < 100; i++ {
//nolint:gosec // G115
queue.Push(
&rtp.Packet{
Header: rtp.Header{
SequenceNumber: uint16(5012 + i),
Timestamp: uint32(512 + i),
},
Payload: []byte{0x02},
},
uint16(5012+i),
)
}
assert.Equal(uint16(102), queue.Length())
popped, _ := queue.PopAt(uint16(5012))
assert.Equal(popped.SequenceNumber, uint16(5012))
assert.Equal(uint16(101), queue.Length())
popped, err := queue.PopAtTimestamp(uint32(500))
assert.Equal(popped.SequenceNumber, uint16(5000))
assert.Equal(uint16(100), queue.Length())
assert.Equal(err, nil)
})
}
func TestPriorityQueue_Find(t *testing.T) {
packets := NewQueue()
packets.Push(&rtp.Packet{
Header: rtp.Header{
SequenceNumber: 1000,
Timestamp: 5,
SSRC: 5,
},
Payload: []uint8{0xA},
}, 1000)
_, err := packets.PopAt(1000)
assert.NoError(t, err)
_, err = packets.Find(1001)
assert.Error(t, err)
}
func TestPriorityQueue_Clean(t *testing.T) {
packets := NewQueue()
packets.Clear()
packets.Push(&rtp.Packet{
Header: rtp.Header{
SequenceNumber: 1000,
Timestamp: 5,
SSRC: 5,
},
Payload: []uint8{0xA},
}, 1000)
assert.EqualValues(t, 1, packets.Length())
packets.Clear()
}
func TestPriorityQueue_Unreference(t *testing.T) {
packets := NewQueue()
var refs int64
finalizer := func(*rtp.Packet) {
atomic.AddInt64(&refs, -1)
}
numPkts := 100
for i := 0; i < numPkts; i++ {
atomic.AddInt64(&refs, 1)
seq := uint16(i) //nolint:gosec // G115
p := rtp.Packet{
Header: rtp.Header{
SequenceNumber: seq,
Timestamp: uint32(i + 42), //nolint:gosec // G115
},
Payload: []byte{byte(i)},
}
runtime.SetFinalizer(&p, finalizer)
packets.Push(&p, seq)
}
for i := 0; i < numPkts-1; i++ {
switch i % 3 {
case 0:
packets.Pop() //nolint
case 1:
packets.PopAt(uint16(i)) //nolint
case 2:
packets.PopAtTimestamp(uint32(i + 42)) //nolint
}
}
runtime.GC()
time.Sleep(10 * time.Millisecond)
remainedRefs := atomic.LoadInt64(&refs)
runtime.KeepAlive(packets)
// only the last packet should be still referenced
assert.Equal(t, int64(1), remainedRefs)
}
|
