-
Notifications
You must be signed in to change notification settings - Fork 0
/
requeststore.go
147 lines (121 loc) · 3.59 KB
/
requeststore.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
/*
Copyright IBM Corp. 2016 All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package pbft
import "container/list"
type requestContainer struct {
key string
req *Request
}
type orderedRequests struct {
order list.List
presence map[string]*list.Element
}
func (a *orderedRequests) Len() int {
return a.order.Len()
}
func (a *orderedRequests) wrapRequest(req *Request) requestContainer {
return requestContainer{
key: hash(req),
req: req,
}
}
func (a *orderedRequests) has(key string) bool {
_, ok := a.presence[key]
return ok
}
func (a *orderedRequests) add(request *Request) {
rc := a.wrapRequest(request)
if !a.has(rc.key) {
e := a.order.PushBack(rc)
a.presence[rc.key] = e
}
}
func (a *orderedRequests) adds(requests []*Request) {
for _, req := range requests {
a.add(req)
}
}
func (a *orderedRequests) remove(request *Request) bool {
rc := a.wrapRequest(request)
e, ok := a.presence[rc.key]
if !ok {
return false
}
a.order.Remove(e)
delete(a.presence, rc.key)
return true
}
func (a *orderedRequests) removes(requests []*Request) bool {
allSuccess := true
for _, req := range requests {
if !a.remove(req) {
allSuccess = false
}
}
return allSuccess
}
func (a *orderedRequests) empty() {
a.order.Init()
a.presence = make(map[string]*list.Element)
}
type requestStore struct {
outstandingRequests *orderedRequests
pendingRequests *orderedRequests
}
// newRequestStore creates a new requestStore.
func newRequestStore() *requestStore {
rs := &requestStore{
outstandingRequests: &orderedRequests{},
pendingRequests: &orderedRequests{},
}
// initialize data structures
rs.outstandingRequests.empty()
rs.pendingRequests.empty()
return rs
}
// storeOutstanding adds a request to the outstanding request list
func (rs *requestStore) storeOutstanding(request *Request) {
rs.outstandingRequests.add(request)
}
// storePending adds a request to the pending request list
func (rs *requestStore) storePending(request *Request) {
rs.pendingRequests.add(request)
}
// storePending adds a slice of requests to the pending request list
func (rs *requestStore) storePendings(requests []*Request) {
rs.pendingRequests.adds(requests)
}
// remove deletes the request from both the outstanding and pending lists, it returns whether it was found in each list respectively
func (rs *requestStore) remove(request *Request) (outstanding, pending bool) {
outstanding = rs.outstandingRequests.remove(request)
pending = rs.pendingRequests.remove(request)
return
}
// getNextNonPending returns up to the next n outstanding, but not pending requests
func (rs *requestStore) hasNonPending() bool {
return rs.outstandingRequests.Len() > rs.pendingRequests.Len()
}
// getNextNonPending returns up to the next n outstanding, but not pending requests
func (rs *requestStore) getNextNonPending(n int) (result []*Request) {
for oreqc := rs.outstandingRequests.order.Front(); oreqc != nil; oreqc = oreqc.Next() {
oreq := oreqc.Value.(requestContainer)
if rs.pendingRequests.has(oreq.key) {
continue
}
result = append(result, oreq.req)
if len(result) == n {
break
}
}
return result
}