forked from go-chassis/go-chassis
/
router.go
executable file
·227 lines (204 loc) · 4.92 KB
/
router.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
// Package router expose API for user to get or set route rule
package router
import (
"errors"
"regexp"
"strconv"
"github.com/go-chassis/go-chassis/core/config/model"
"github.com/go-chassis/go-chassis/core/invocation"
"github.com/go-chassis/go-chassis/core/registry"
wp "github.com/go-chassis/go-chassis/core/router/weightpool"
)
//Templates is for source match template settings
var Templates = make(map[string]*model.Match)
//Router return route rule, you can also set custom route rule
type Router interface {
Init(Options) error
InitRouteRuleByKey(string)
SetRouteRule(map[string][]*model.RouteRule)
FetchRouteRule() map[string][]*model.RouteRule
FetchRouteRuleByServiceName(string) []*model.RouteRule
}
// ErrNoExist means if there is no router implementation
var ErrNoExist = errors.New("router not exists")
var routerServices = make(map[string]func() (Router, error))
// DefaultRouter is current router implementation
var DefaultRouter Router
// InstallRouterService install router service for developer
func InstallRouterService(name string, f func() (Router, error)) {
routerServices[name] = f
}
//BuildRouter create a router
func BuildRouter(name string) error {
f, ok := routerServices[name]
if !ok {
return ErrNoExist
}
r, err := f()
if err != nil {
return err
}
DefaultRouter = r
return nil
}
// Route route the APIs
func Route(header map[string]string, si *registry.SourceInfo, inv *invocation.Invocation) error {
rules := SortRules(inv.MicroServiceName)
for _, rule := range rules {
if Match(rule.Match, header, si) {
tag := FitRate(rule.Routes, inv.MicroServiceName)
inv.RouteTags = routeTagToTags(tag)
break
}
}
return nil
}
// FitRate fit rate
func FitRate(tags []*model.RouteTag, dest string) *model.RouteTag {
if tags[0].Weight == 100 {
return tags[0]
}
pool, ok := wp.GetPool().Get(dest)
if !ok {
// first request route to tags[0]
wp.GetPool().Set(dest, wp.NewPool(tags...))
return tags[0]
}
return pool.PickOne()
}
// Match check the route rule
func Match(match model.Match, headers map[string]string, source *registry.SourceInfo) bool {
//validate template first
if refer := match.Refer; refer != "" {
return SourceMatch(Templates[refer], headers, source)
}
//match rule is not set
if match.Source == "" && match.HTTPHeaders == nil && match.Headers == nil {
return true
}
return SourceMatch(&match, headers, source)
}
// SourceMatch check the source route
func SourceMatch(match *model.Match, headers map[string]string, source *registry.SourceInfo) bool {
//source not match
if match.Source != "" && match.Source != source.Name {
return false
}
//source tags not match
if len(match.SourceTags) != 0 {
for k, v := range match.SourceTags {
if v != source.Tags[k] {
return false
}
}
}
//source headers not match
if match.Headers != nil {
for k, v := range match.Headers {
if !isMatch(headers, k, v) {
return false
}
continue
}
}
if match.HTTPHeaders != nil {
for k, v := range match.HTTPHeaders {
if !isMatch(headers, k, v) {
return false
}
continue
}
}
return true
}
// isMatch check the route rule
func isMatch(headers map[string]string, k string, v map[string]string) bool {
header := headers[k]
if regex, ok := v["regex"]; ok {
reg := regexp.MustCompilePOSIX(regex)
if !reg.Match([]byte(header)) {
return false
}
return true
}
if exact, ok := v["exact"]; ok {
if exact != header {
return false
}
return true
}
if noEqu, ok := v["noEqu"]; ok {
if noEqu == header {
return false
}
return true
}
headerInt, err := strconv.Atoi(header)
if err != nil {
return false
}
if noLess, ok := v["noLess"]; ok {
head, _ := strconv.Atoi(noLess)
if head > headerInt {
return false
}
return true
}
if noGreater, ok := v["noGreater"]; ok {
head, _ := strconv.Atoi(noGreater)
if head < headerInt {
return false
}
return true
}
if greater, ok := v["greater"]; ok {
head, _ := strconv.Atoi(greater)
if head >= headerInt {
return false
}
return true
}
if less, ok := v["less"]; ok {
head, _ := strconv.Atoi(less)
if head <= headerInt {
return false
}
}
return true
}
// SortRules sort route rules
func SortRules(name string) []*model.RouteRule {
DefaultRouter.InitRouteRuleByKey(name)
slice := DefaultRouter.FetchRouteRuleByServiceName(name)
return QuickSort(0, len(slice)-1, slice)
}
// QuickSort for sorting the routes it will follow quicksort technique
func QuickSort(left int, right int, rules []*model.RouteRule) (s []*model.RouteRule) {
s = rules
if left >= right {
return
}
i := left
j := right
base := s[left]
var tmp *model.RouteRule
for i != j {
for s[j].Precedence <= base.Precedence && i < j {
j--
}
for s[i].Precedence >= base.Precedence && i < j {
i++
}
if i < j {
tmp = s[i]
s[i] = s[j]
s[j] = tmp
}
}
//move base to the current position of i&j
s[left] = s[i]
s[i] = base
QuickSort(left, i-1, s)
QuickSort(i+1, right, s)
return
}