/
in_memory.go
148 lines (118 loc) · 2.79 KB
/
in_memory.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
/* _ _
*__ _____ __ ___ ___ __ _| |_ ___
*\ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
* \ V V / __/ (_| |\ V /| | (_| | || __/
* \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
*
* Copyright © 2016 - 2019 Weaviate. All rights reserved.
* LICENSE: https://github.com/creativesoftwarefdn/weaviate/blob/develop/LICENSE.md
* DESIGN & CONCEPT: Bob van Luijt (@bobvanluijt)
* CONTACT: hello@creativesoftwarefdn.org
*/
package state
import (
"fmt"
"sync"
"time"
"github.com/go-openapi/strfmt"
uuid "github.com/satori/go.uuid"
log "github.com/sirupsen/logrus"
)
type inMemoryState struct {
sync.Mutex
peers map[strfmt.UUID]Peer
}
func NewInMemoryState() State {
state := inMemoryState{
peers: make(map[strfmt.UUID]Peer),
}
go state.garbage_collect()
return State(&state)
}
func (im *inMemoryState) RegisterPeer(name string, uri strfmt.URI) (*Peer, error) {
im.Lock()
defer im.Unlock()
uuid, err := uuid.NewV4()
if err != nil {
panic(err)
}
id := strfmt.UUID(uuid.String())
log.Debugf("Registering peer '%v' with id '%v'", name, id)
peer := Peer{
PeerInfo: PeerInfo{
Id: id,
LastContactAt: time.Now(),
},
name: name,
uri: uri,
}
im.peers[id] = peer
go im.broadcast_update()
return &peer, nil
}
func (im *inMemoryState) ListPeers() ([]Peer, error) {
im.Lock()
defer im.Unlock()
peers := make([]Peer, 0)
for _, v := range im.peers {
peers = append(peers, v)
}
return peers, nil
}
func (im *inMemoryState) RemovePeer(id strfmt.UUID) error {
im.Lock()
defer im.Unlock()
_, ok := im.peers[id]
if ok {
delete(im.peers, id)
}
go im.broadcast_update()
return nil
}
func (im *inMemoryState) UpdateLastContact(id strfmt.UUID, contact_at time.Time, schemaHash string) error {
log.Debugf("Updating last contact for %v", id)
im.Lock()
defer im.Unlock()
peer, ok := im.peers[id]
if !ok {
return fmt.Errorf("No such peer exists")
}
peer.LastContactAt = contact_at
if schemaHash != peer.SchemaHash {
peer.SchemaHash = schemaHash
go im.broadcast_update()
}
im.peers[id] = peer
return nil
}
func (im *inMemoryState) garbage_collect() {
for {
time.Sleep(1 * time.Second)
deleted_some := false
im.Lock()
for key, peer := range im.peers {
peer_times_out_at := peer.PeerInfo.LastContactAt.Add(time.Second * 60)
if time.Now().After(peer_times_out_at) {
log.Infof("Garbage collecting peer %v", peer.Id)
delete(im.peers, key)
deleted_some = true
}
}
im.Unlock()
if deleted_some {
im.broadcast_update()
}
}
}
func (im *inMemoryState) broadcast_update() {
log.Info("Broadcasting peer update")
im.Lock()
defer im.Unlock()
peers := make([]Peer, 0)
for _, peer := range im.peers {
peers = append(peers, peer)
}
for _, peer := range peers {
go broadcast_update(peer, peers)
}
}