-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathnodes.go
151 lines (138 loc) · 3.62 KB
/
nodes.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
/* ****************************************************************************
* Copyright 2020 51 Degrees Mobile Experts Limited (51degrees.com)
*
* 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 swift
import (
"fmt"
"math/rand"
"regexp"
"sort"
)
type nodes struct {
all []*node // All the nodes in a random order
active []*node // Active nodes ordered by creation time
hash []*node // Active storage nodes ordered by hash value
dict map[string]*node // All the nodes keyed on domain name
}
func newNodes() *nodes {
var ns nodes
ns.all = []*node{}
ns.active = []*node{}
ns.hash = []*node{}
ns.dict = make(map[string]*node)
return &ns
}
func (ns *nodes) getRandomNode(condition func(n *node) bool) *node {
indexes := make([]int, len(ns.active))
for i := 0; i < len(ns.active); i++ {
indexes[i] = i
}
for i := range indexes {
j := rand.Intn(i + 1)
indexes[i], indexes[j] = indexes[j], indexes[i]
}
for _, i := range indexes {
if condition(ns.active[indexes[i]]) {
return ns.active[indexes[i]]
}
}
return nil
}
// Get the hash of the remote address for the request by removing the port if
// present and using the domain or IP address.
func getRemoteAddrHash(xff string, ra string) uint64 {
var a uint64
d := getRemoteAddr(xff, ra)
if len(d) > 0 {
a = getHash(d)
}
return a
}
var regexClientIP, _ = regexp.Compile("[\\d\\.]+|\\[[^\\]]+\\]")
// GetIP gets a requests IP address by reading off the forwarded-for header
// (for proxies) and falls back to use the remote address.
func getRemoteAddr(xff string, ra string) string {
if xff != "" {
b := regexClientIP.FindString(xff)
if b != "" {
return b
}
return xff
}
if ra != "" {
b := regexClientIP.FindString(ra)
if b != "" {
return b
}
return ra
}
return ""
}
// Find the node that has a hash value closest to that of the remote IP address.
func (ns *nodes) getHomeNode(xff string, ra string) (*node, error) {
i := ns.getNodeIndexByHash(getRemoteAddrHash(xff, ra))
if i < 0 || i >= len(ns.hash) {
return nil, fmt.Errorf(
"None of the '%d' available nodes were identified as a home node "+
"for remote address '%s'",
len(ns.hash),
getRemoteAddr(xff, ra))
}
return ns.hash[i], nil
}
func (ns *nodes) getNodeIndexByHash(h uint64) int {
m := 0
l := 0
u := len(ns.hash) - 1
for l <= u {
m = (l + u) / 2
if ns.hash[m].hash < h {
l = m + 1
} else if ns.hash[m].hash > h {
u = m - 1
} else {
break
}
}
return m
}
func (ns *nodes) order() {
ns.active = getActiveOrdered(ns.all)
ns.hash = getHashOrdered(ns.active)
}
func getHashOrdered(active []*node) []*node {
h := make([]*node, 0, len(active))
for _, n := range active {
if n.role == roleStorage {
h = append(h, n)
}
}
sort.Slice(h, func(i, j int) bool {
return h[i].hash < h[j].hash
})
return h
}
func getActiveOrdered(all []*node) []*node {
a := make([]*node, 0, len(all))
for _, n := range all {
if n.isActive() {
a = append(a, n)
}
}
sort.Slice(a, func(i, j int) bool {
return a[i].created.Before(a[j].created)
})
return a
}