/
ports.go
232 lines (213 loc) · 5.28 KB
/
ports.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
package main
import (
"fmt"
"strconv"
"strings"
"github.com/skupperproject/skupper/pkg/qdr"
)
type PortRange struct {
Start int
End int
}
type FreePorts struct {
Available []PortRange
}
const (
MIN_PORT = 1024
MAX_PORT = 65535
)
func newFreePorts() *FreePorts {
return &FreePorts{
Available: []PortRange{
PortRange{
Start: MIN_PORT,
End: MAX_PORT,
},
},
}
}
func (ports *PortRange) extend(port int) bool {
if port == ports.Start-1 {
ports.Start = port
return true
} else if port == ports.End+1 {
ports.End = port
return true
} else {
return false
}
}
func (ports *PortRange) size() int {
return ports.End - ports.Start + 1
}
func (ports PortRange) String() string {
return fmt.Sprintf("(%d-%d)", ports.Start, ports.End)
}
func (ports *PortRange) merge(other PortRange) bool {
if ports.contains(other.Start) && ports.contains(other.End) {
//other wholly contained within ports
return true
} else if other.contains(ports.Start) && other.contains(ports.End) {
//ports wholly contained within other
ports.Start = other.Start
ports.End = other.End
return true
} else if other.Start > ports.End+1 || other.End+1 < ports.Start {
//no overlap
return false
} else if other.Start == (ports.End + 1) {
//adjacent, port precedes other
ports.End = other.End
return true
} else if (other.End + 1) == ports.Start {
//adjacent, other precedes ports
ports.Start = other.Start
return true
} else if ports.Start <= other.Start && ports.End >= other.Start {
//overlap, ports precedes other
ports.End = other.End
return true
} else if other.Start <= ports.Start && other.End >= ports.Start {
//overlap, other precedes ports
ports.Start = other.Start
return true
} else {
return false
}
}
func (ports *PortRange) contains(port int) bool {
return port <= ports.End && port >= ports.Start
}
func removePortRange(ports []PortRange, i int) []PortRange {
if len(ports) > 1 {
if i == len(ports)-1 {
return ports[:i]
} else if i == 0 {
return ports[1:]
} else {
return append(ports[:i], ports[i+1:]...)
}
} else if i == 0 {
return []PortRange{}
} else {
return ports
}
}
func insertPortRange(ports []PortRange, extra PortRange, i int) []PortRange {
if i == 0 {
return append([]PortRange{extra}, ports...)
} else if i+1 > len(ports) {
return append(ports, extra)
} else {
copy := []PortRange{}
for index, v := range ports {
if index == i {
copy = append(copy, extra)
}
copy = append(copy, v)
}
return copy
}
}
func (ports *FreePorts) String() string {
parts := []string{}
for _, r := range ports.Available {
parts = append(parts, r.String())
}
return "[" + strings.Join(parts, ", ") + "]"
}
func (ports *FreePorts) release(port int) bool {
var i int
for i = 0; i < len(ports.Available) && port >= (ports.Available[i].Start-1); i++ {
if ports.Available[i].contains(port) {
return false
} else if ports.Available[i].extend(port) {
if i+1 < len(ports.Available) && ports.Available[i].merge(ports.Available[i+1]) {
//need to remove ports.Available[i+1]
ports.Available = removePortRange(ports.Available, i+1)
}
return true
}
}
//need to append a new range
extra := PortRange{
Start: port,
End: port,
}
ports.Available = insertPortRange(ports.Available, extra, i)
return true
}
func (ports *FreePorts) inuse(port int) bool {
for i := 0; i < len(ports.Available) && port >= ports.Available[i].Start; i++ {
if ports.Available[i].contains(port) {
if port == ports.Available[i].Start {
if ports.Available[i].size() == 1 {
//remove it entirely
ports.Available = removePortRange(ports.Available, i)
} else {
ports.Available[i].Start++
}
} else if port == ports.Available[i].End {
//size must be greater than 1 or clause above would have matched
ports.Available[i].End--
} else {
//need to split the range
extra := PortRange{
Start: port + 1,
End: ports.Available[i].End,
}
ports.Available[i].End = port - 1
ports.Available = insertPortRange(ports.Available, extra, i+1)
}
return true
}
}
return false
}
func (ports *FreePorts) nextFreePort() (int, error) {
if len(ports.Available) > 0 {
next := ports.Available[0].Start
ports.inuse(next)
return next, nil
} else {
return 0, fmt.Errorf("No available ports")
}
}
func portAsInt(port string) int {
result, _ := strconv.Atoi(port)
return result
}
func (ports *FreePorts) getPortAllocations(bridges *qdr.BridgeConfig) map[string][]int {
allocations := map[string][]int{}
addPort := func(address string, port int) {
if curPorts, found := allocations[address]; !found {
allocations[address] = []int{port}
} else {
curPorts = append(curPorts, port)
allocations[address] = curPorts
}
}
if bridges != nil {
for _, b := range bridges.HttpConnectors {
port := portAsInt(b.Port)
ports.inuse(port)
}
for _, b := range bridges.HttpListeners {
address := strings.Split(b.Address, ":")[0]
port := portAsInt(b.Port)
addPort(address, port)
ports.inuse(port)
}
for _, b := range bridges.TcpConnectors {
port := portAsInt(b.Port)
ports.inuse(port)
}
for _, b := range bridges.TcpListeners {
address := strings.Split(b.Address, ":")[0]
port := portAsInt(b.Port)
addPort(address, port)
ports.inuse(port)
}
}
return allocations
}