-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathrouters.go
278 lines (246 loc) · 8.5 KB
/
routers.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
package actorkit
import "log"
// AddRoute defines a giving message delivered
// for adding sending address into route list.
//
// Used by the RoundRobin, RandomRouter, HashedRouter and Broadcast Router.
type AddRoute struct{}
// RemoveRoute defines a giving message delivered for
// removing sending address from route list.
//
// Used by the RoundRobin, RandomRouter, HashedRouter and Broadcast Router.
type RemoveRoute struct{}
//***********************************************************
// RoundRobinRouter
//***********************************************************
// RoundRobinRouter implements a router which delivers messages to giving address
// in a round robin manner. The router uses the Address.Addr() value to allow distinct
// addresses regardless if underline serving actor is the same to maintain address uniqueness
// and logic.
//
// It stores address by their Addr.Addr() which means even if two Addr are referencing
// same Actor, they will be respected, added and broadcasted to, as the Addr represents
// a unique capability.
type RoundRobinRouter struct {
addrs *ServiceSet
set *RoundRobinSet
}
// NewRoundRobinRouter returns a new instance of a RoundRobinRouter using
// provided address list if any to setup.
func NewRoundRobinRouter(addrs ...Addr) *RoundRobinRouter {
var service ServiceSet
set := NewRoundRobinSet()
for _, addr := range addrs {
service.Add(addr)
set.Add(addr.Addr())
}
return &RoundRobinRouter{
set: set,
addrs: &service,
}
}
// Action implements the Behaviour interface.
func (rr *RoundRobinRouter) Action(addr Addr, msg Envelope) {
switch msg.Data.(type) {
case AddRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
if rr.addrs.RemoveAddr(msg.Sender) {
rr.set.Remove(msg.Sender.Addr())
}
}
case RemoveRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
if rr.addrs.Add(msg.Sender) {
rr.set.Add(msg.Sender.Addr())
}
}
default:
targetAddr := rr.set.Get()
if target, ok := rr.addrs.Get(targetAddr); ok {
if err := target.Forward(msg); err != nil {
log.Printf("[RoundRobin:Routing] Failed to route message %q to addr %q: %#v", msg.Ref.String(), addr.Addr(), err)
}
return
}
log.Printf("[RoundRobin:Routing] Failed get node for addr %q to route message %q", targetAddr, msg.Ref.String())
}
}
//***********************************************************
// BroadcastRouter
//***********************************************************
// BroadcastRouter implements a router which delivers messages in a fan-out
// manner to all addresses.
//
// It stores address by their Addr.Addr() which means even if two Addr are referencing
// same Actor, they will be respected, added and broadcasted to, as the Addr represents
// a unique capability.
type BroadcastRouter struct {
addrs *ServiceSet
}
// NewBroadcastRouter adds giving set of address, returning a new BroadcastRouter
// which will broadcast incoming messages to all addresses.
func NewBroadcastRouter(addrs ...Addr) *BroadcastRouter {
var service ServiceSet
for _, addr := range addrs {
service.Add(addr)
}
return &BroadcastRouter{
addrs: &service,
}
}
// Action implements the Behaviour interface.
func (rr *BroadcastRouter) Action(addr Addr, msg Envelope) {
switch msg.Data.(type) {
case AddRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
rr.addrs.Add(msg.Sender)
}
case RemoveRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
rr.addrs.RemoveAddr(msg.Sender)
}
default:
rr.addrs.ForEach(func(addr Addr, i int) bool {
if err := addr.Forward(msg); err != nil {
log.Printf("[Broadcast:Routing] Failed to route message %q to addr %q: %#v", msg.Ref.String(), addr.Addr(), err)
}
return true
})
}
}
//***********************************************************
// RandomRouter
//***********************************************************
// RandomRouter implements a router which delivers messages to giving address
// based on one randomly chosen address from it's set of known addresses.
//
// It stores address by their Addr.Addr() which means even if two Addr are referencing
// same Actor, they will be respected, added and broadcasted to, as the Addr represents
// a unique capability.
type RandomRouter struct {
rand *RandomSet
addrs *ServiceSet
}
// NewRandomRouter returns a new instance of a RandomRouter.
func NewRandomRouter(addrs ...Addr) *RandomRouter {
var service ServiceSet
set := NewRandomSet()
for _, addr := range addrs {
service.Add(addr)
set.Add(addr.Addr())
}
return &RandomRouter{
rand: set,
addrs: &service,
}
}
// Action implements the Behaviour interface.
func (rr *RandomRouter) Action(addr Addr, msg Envelope) {
switch msg.Data.(type) {
case AddRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
if rr.addrs.Add(msg.Sender) {
rr.rand.Add(msg.Sender.Addr())
}
}
case RemoveRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
if rr.addrs.RemoveAddr(msg.Sender) {
rr.rand.Remove(msg.Sender.Addr())
}
}
default:
targetAddr := rr.rand.Get()
if target, ok := rr.addrs.Get(targetAddr); ok {
if err := target.Forward(msg); err != nil {
log.Printf("[Random:Routing] Failed to route message %q to addr %q: %#v", msg.Ref.String(), addr.Addr(), err)
}
return
}
log.Printf("[Random:Routing] Failed get node for addr %q to route message %q", targetAddr, msg.Ref.String())
}
}
//***********************************************************
// HashedRouter
//***********************************************************
// Hashed defines a interface where it's implementers must expose a method
// which returns a string hash used for routing purposes.
type Hashed interface {
Hash() string
}
// HashingReference defines a function which is provided to the HashRouter
// which will return a string from a adderess. This allows custom values based
// of giving Addr to be returned as hashing input value.
type HashingReference func(Addr) string
// ProtocolAddrReference defines a function which matches the HashingReference function
// type. It simply returns the ProtocolAddr() value of a Addr object.
func ProtocolAddrReference(addr Addr) string {
return addr.ProtocolAddr()
}
// AddressReference defines a function which matches the HashingReference function
// type and is the default use. It simply returns the Addr() value of a Addr object.
//
// This might not necessarily be desired as the address contains the actor's process id
// details which can become too specific in certain cases.
func AddressReference(addr Addr) string {
return addr.Addr()
}
// HashedRouter implements a router which delivers messages to giving address
// based on hash value from message to possible address.
//
// It stores address by their Addr.Addr() which means even if two Addr are referencing
// same Actor, they will be respected, added and broadcasted to, as the Addr represents
// a unique capability.
type HashedRouter struct {
ref HashingReference
hashes *HashedSet
addrs *ServiceSet
}
// NewHashedRouter returns a new instance of a HashedRouter.
func NewHashedRouter(ref HashingReference, addrs ...Addr) *HashedRouter {
var service ServiceSet
address := make([]string, 0, len(addrs))
for _, addr := range addrs {
if service.Add(addr) {
address = append(address, ref(addr))
}
}
return &HashedRouter{
hashes: NewHashedSet(address),
addrs: &service,
ref: ref,
}
}
// Action implements the Behaviour interface.
func (rr *HashedRouter) Action(addr Addr, msg Envelope) {
switch msg.Data.(type) {
case AddRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
if rr.addrs.Add(msg.Sender) {
rr.hashes.Add(rr.ref(msg.Sender))
}
}
case RemoveRoute:
if msg.Sender != nil && msg.Sender.ID() != addr.ID() {
if rr.addrs.RemoveAddr(msg.Sender) {
rr.hashes.Remove(rr.ref(msg.Sender))
}
}
default:
if hashed, ok := msg.Data.(Hashed); ok {
if targetAddr, found := rr.hashes.Get(hashed.Hash()); found {
if target, got := rr.addrs.Get(targetAddr); got {
if err := target.Forward(msg); err != nil {
log.Printf("[Hashed:Routing] Failed to route message %q to addr %q: %#v", msg.Ref.String(), addr.Addr(), err)
}
return
}
log.Printf("[Hashed:Routing] Failed get node for addr %q to route message %q", targetAddr, msg.Ref.String())
return
}
log.Printf("[Hashed:Routing] Message %q data with hash %q has no routable address", msg.Ref.String(), hashed.Hash())
return
}
log.Printf("[Hashed:Routing] Message %q data of type %T must implement Hashed interface: %#v", msg.Ref.String(), msg.Data, msg)
}
}