-
Notifications
You must be signed in to change notification settings - Fork 65
/
list.go
370 lines (321 loc) · 7.19 KB
/
list.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
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
// Copyright 2016 Rana Ian, Tamás Gulácsi. All rights reserved.
// Use of this source code is governed by The MIT License
// found in the accompanying LICENSE file.
package ora
import (
"container/list"
"sync"
)
////////////////////////////////////////////////////////////////////////////////
// envList
////////////////////////////////////////////////////////////////////////////////
type envList struct {
items []*Env
mu sync.Mutex
}
func newEnvList() *envList {
return &envList{items: make([]*Env, 0, 2)}
}
func (l *envList) add(e *Env) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, e) // append item
}
func (l *envList) remove(e *Env) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == e {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *envList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}
////////////////////////////////////////////////////////////////////////////////
// srvList
////////////////////////////////////////////////////////////////////////////////
type srvList struct {
items []*Srv
mu sync.Mutex
}
func newSrvList() *srvList {
return &srvList{items: make([]*Srv, 0, 2)}
}
func (l *srvList) add(s *Srv) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, s) // append item
}
func (l *srvList) remove(s *Srv) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == s {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *srvList) closeAll(errs *list.List) {
l.mu.Lock()
defer l.mu.Unlock()
for _, item := range l.items {
err := item.close() // close will not remove Srv from openSrvs
if err != nil {
errs.PushBack(errE(err))
}
}
l.items = l.items[:0] // clear all Srvs from srvList
}
func (l *srvList) clear() {
l.mu.Lock()
defer l.mu.Unlock()
l.items = l.items[:0]
}
func (l *srvList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}
////////////////////////////////////////////////////////////////////////////////
// conList
////////////////////////////////////////////////////////////////////////////////
type conList struct {
items []*Con
mu sync.Mutex
}
func newConList() *conList {
return &conList{items: make([]*Con, 0, 8)}
}
func (l *conList) add(c *Con) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, c) // append item
}
func (l *conList) remove(c *Con) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == c {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *conList) closeAll(errs *list.List) {
l.mu.Lock()
defer l.mu.Unlock()
for _, item := range l.items {
err := item.close() // close will not remove Con from openCons
if err != nil {
errs.PushBack(errE(err))
}
}
l.items = l.items[:0] // clear all Cons from conList
}
func (l *conList) clear() {
l.mu.Lock()
defer l.mu.Unlock()
l.items = l.items[:0]
}
func (l *conList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}
////////////////////////////////////////////////////////////////////////////////
// sesList
////////////////////////////////////////////////////////////////////////////////
type sesList struct {
items []*Ses
mu sync.Mutex
}
func newSesList() *sesList {
return &sesList{items: make([]*Ses, 0, 8)}
}
func (l *sesList) add(s *Ses) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, s) // append item
}
func (l *sesList) remove(s *Ses) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == s {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *sesList) closeAll(errs *list.List) {
l.mu.Lock()
defer l.mu.Unlock()
for _, ses := range l.items {
err := ses.close() // close will not remove Ses from openSess
if err != nil {
errs.PushBack(errE(err))
}
}
l.items = l.items[:0] // clear all Sess from sesList
}
func (l *sesList) clear() {
l.mu.Lock()
defer l.mu.Unlock()
l.items = l.items[:0]
}
func (l *sesList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}
////////////////////////////////////////////////////////////////////////////////
// txList
////////////////////////////////////////////////////////////////////////////////
type txList struct {
items []*Tx
mu sync.Mutex
}
func newTxList() *txList {
return &txList{items: make([]*Tx, 0, 2)}
}
func (l *txList) add(t *Tx) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, t) // append item
}
func (l *txList) remove(t *Tx) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == t {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *txList) closeAll(errs *list.List) {
l.mu.Lock()
defer l.mu.Unlock()
for _, item := range l.items {
err := item.close() // close will not remove Tx from openTxs
if err != nil {
errs.PushBack(errE(err))
}
}
l.items = l.items[:0] // clear all Txs from txList
}
func (l *txList) clear() {
l.mu.Lock()
defer l.mu.Unlock()
l.items = l.items[:0]
}
func (l *txList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}
////////////////////////////////////////////////////////////////////////////////
// stmtList
////////////////////////////////////////////////////////////////////////////////
type stmtList struct {
items []*Stmt
mu sync.Mutex
}
func newStmtList() *stmtList {
return &stmtList{items: make([]*Stmt, 0, 8)}
}
func (l *stmtList) add(s *Stmt) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, s) // append item
}
func (l *stmtList) remove(s *Stmt) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == s {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *stmtList) closeAll(errs *list.List) {
l.mu.Lock()
defer l.mu.Unlock()
for _, item := range l.items {
err := item.close() // close will not remove Stmt from openStmts
if err != nil {
errs.PushBack(errE(err))
}
}
l.items = l.items[:0] // clear all Stmts from stmtList
}
func (l *stmtList) clear() {
l.mu.Lock()
defer l.mu.Unlock()
l.items = l.items[:0]
}
func (l *stmtList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}
////////////////////////////////////////////////////////////////////////////////
// rsetList
////////////////////////////////////////////////////////////////////////////////
type rsetList struct {
items []*Rset
mu sync.Mutex
}
func newRsetList() *rsetList {
return &rsetList{items: make([]*Rset, 0, 8)}
}
func (l *rsetList) add(r *Rset) {
l.mu.Lock()
defer l.mu.Unlock()
l.items = append(l.items, r) // append item
}
func (l *rsetList) remove(r *Rset) {
l.mu.Lock()
defer l.mu.Unlock()
for n, item := range l.items {
if item == r {
l.items[n] = l.items[0]
l.items = l.items[1:]
break
}
}
}
func (l *rsetList) closeAll(errs *list.List) {
l.mu.Lock()
defer l.mu.Unlock()
for _, item := range l.items {
err := item.close() // close will not remove Rset from openRsets
if err != nil {
errs.PushBack(errE(err))
}
}
l.items = l.items[:0] // clear all Rsets from rsetList
}
func (l *rsetList) clear() {
l.mu.Lock()
defer l.mu.Unlock()
l.items = l.items[:0]
}
func (l *rsetList) len() int {
l.mu.Lock()
defer l.mu.Unlock()
return len(l.items)
}