-
Notifications
You must be signed in to change notification settings - Fork 2
/
queue_test.go
165 lines (151 loc) · 2.79 KB
/
queue_test.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
package xsync
import (
"reflect"
"sync"
"testing"
)
type TaskInt int
func (TaskInt) Exec(*WorkerContext) {}
var immediately = func() <-chan struct{} {
ch := make(chan struct{})
close(ch)
return ch
}()
func TestQueue(t *testing.T) {
for _, test := range []struct {
name string
size int
rcvn int
send []int
priority []byte
recv [][]int
}{
{
size: 1,
rcvn: 1,
send: []int{1, 2, 3},
priority: []byte{0, 0, 0},
recv: [][]int{
{1}, {2}, {3},
},
},
{
size: 1,
rcvn: 1,
send: []int{1, 2, 3},
priority: []byte{1, 2, 3},
recv: [][]int{
{1}, {2}, {3},
},
},
{
size: 2,
rcvn: 1,
send: []int{1, 2, 3},
priority: []byte{1, 2, 3},
recv: [][]int{
{2}, {3}, {1},
},
},
{
size: 3,
rcvn: 1,
send: []int{1, 2, 3},
priority: []byte{1, 2, 3},
recv: [][]int{
{3}, {2}, {1},
},
},
{
size: 3,
rcvn: 4,
send: []int{1, 2, 3},
priority: []byte{1, 2, 3},
recv: [][]int{
{3, 2, 1, -1},
},
},
} {
t.Run(test.name, func(t *testing.T) {
var q queue
q.init(test.size)
var (
sendDone = make(chan struct{})
recvDone = make(chan struct{})
mu sync.Mutex
cond sync.Cond
)
cond.L = &mu
const (
stateSend = 0x1
stateRecv = 0x2
stateSendDone = 0x4
)
state := stateSend
go func() {
defer close(sendDone)
var i int
for j := 0; i < len(test.send); j++ {
mu.Lock()
if state&stateSend == 0 {
cond.Wait()
}
for ; i < len(test.send); i++ {
x := test.send[i]
p := test.priority[i]
err := q.send(Demand{
Priority: BytePriority(p),
Cancel: immediately,
}, TaskInt(x))
if err != nil {
// No space in queue so let the receiving goroutine
// receive tasks.
break
}
}
state = stateRecv
mu.Unlock()
cond.Signal()
}
mu.Lock()
state = stateSendDone
mu.Unlock()
}()
var act [][]int
go func() {
defer close(recvDone)
ts := make([]Task, test.rcvn)
for range test.recv {
mu.Lock()
if state&(stateRecv|stateSendDone) == 0 {
cond.Wait()
}
n, err := q.recvTo(ts, nil)
if err != nil {
t.Fatal(err)
}
xs := make([]int, len(ts))
for i := 0; i < n; i++ {
xs[i] = int((ts[i].(TaskInt)))
}
for i := len(xs) - 1; i >= n; i-- {
xs[i] = -1
}
act = append(act, xs)
state &^= stateRecv
state |= stateSend
mu.Unlock()
cond.Signal()
}
}()
<-sendDone
<-recvDone
for i, exp := range test.recv {
act := act[i]
if !reflect.DeepEqual(act, exp) {
t.Errorf("unexpected #%d recv: %v; want %v", i, act, exp)
}
}
})
}
}