micro/registry/cache/cache.go

473 lines
7.9 KiB
Go
Raw Normal View History

2019-05-31 02:22:43 +03:00
// Package cache provides a registry cache
package cache
import (
"math"
"math/rand"
"sync"
"time"
"github.com/micro/go-micro/v2/logger"
"github.com/micro/go-micro/v2/registry"
2019-05-31 02:22:43 +03:00
)
// Cache is the registry cache interface
type Cache interface {
// embed the registry interface
registry.Registry
// stop the cache watcher
Stop()
}
type Options struct {
// TTL is the cache TTL
TTL time.Duration
}
type Option func(o *Options)
type cache struct {
registry.Registry
opts Options
// registry cache
sync.RWMutex
cache map[string][]*registry.Service
ttls map[string]time.Time
watched map[string]bool
2019-09-25 21:44:46 +03:00
// used to stop the cache
2019-05-31 02:22:43 +03:00
exit chan bool
2019-09-25 21:44:46 +03:00
// indicate whether its running
running bool
2019-09-25 21:44:46 +03:00
// status of the registry
// used to hold onto the cache
// in failure state
status error
2019-05-31 02:22:43 +03:00
}
var (
DefaultTTL = time.Minute
)
func backoff(attempts int) time.Duration {
if attempts == 0 {
return time.Duration(0)
}
return time.Duration(math.Pow(10, float64(attempts))) * time.Millisecond
}
2019-09-25 21:44:46 +03:00
func (c *cache) getStatus() error {
c.RLock()
defer c.RUnlock()
return c.status
}
func (c *cache) setStatus(err error) {
c.Lock()
c.status = err
c.Unlock()
}
2019-05-31 02:22:43 +03:00
// isValid checks if the service is valid
func (c *cache) isValid(services []*registry.Service, ttl time.Time) bool {
// no services exist
if len(services) == 0 {
return false
}
// ttl is invalid
if ttl.IsZero() {
return false
}
// time since ttl is longer than timeout
2019-10-30 09:01:51 +03:00
if time.Since(ttl) > 0 {
2019-05-31 02:22:43 +03:00
return false
}
// ok
return true
}
func (c *cache) quit() bool {
select {
case <-c.exit:
return true
default:
return false
}
}
func (c *cache) del(service string) {
2019-09-25 21:44:46 +03:00
// don't blow away cache in error state
2019-10-04 18:29:56 +03:00
if err := c.status; err != nil {
2019-09-25 21:44:46 +03:00
return
}
// otherwise delete entries
2019-05-31 02:22:43 +03:00
delete(c.cache, service)
delete(c.ttls, service)
}
func (c *cache) get(service string) ([]*registry.Service, error) {
// read lock
c.RLock()
// check the cache first
services := c.cache[service]
// get cache ttl
ttl := c.ttls[service]
2019-10-04 18:29:56 +03:00
// make a copy
cp := registry.Copy(services)
2019-05-31 02:22:43 +03:00
// got services && within ttl so return cache
2019-10-04 18:29:56 +03:00
if c.isValid(cp, ttl) {
2019-10-04 18:40:21 +03:00
c.RUnlock()
// return services
2019-05-31 02:22:43 +03:00
return cp, nil
}
// get does the actual request for a service and cache it
2019-09-25 21:44:46 +03:00
get := func(service string, cached []*registry.Service) ([]*registry.Service, error) {
2019-05-31 02:22:43 +03:00
// ask the registry
services, err := c.Registry.GetService(service)
if err != nil {
2019-09-25 21:44:46 +03:00
// check the cache
if len(cached) > 0 {
// set the error status
c.setStatus(err)
2019-10-04 18:29:56 +03:00
2019-09-25 21:44:46 +03:00
// return the stale cache
2019-10-04 18:29:56 +03:00
return cached, nil
2019-09-25 21:44:46 +03:00
}
// otherwise return error
2019-05-31 02:22:43 +03:00
return nil, err
}
2019-09-25 21:44:46 +03:00
// reset the status
2019-10-11 12:47:42 +03:00
if err := c.getStatus(); err != nil {
2019-09-25 21:44:46 +03:00
c.setStatus(nil)
}
2019-05-31 02:22:43 +03:00
// cache results
c.Lock()
2019-07-04 13:36:49 +03:00
c.set(service, registry.Copy(services))
2019-05-31 02:22:43 +03:00
c.Unlock()
return services, nil
}
// watch service if not watched
_, ok := c.watched[service]
2019-05-31 02:22:43 +03:00
2019-10-04 18:40:21 +03:00
// unlock the read lock
c.RUnlock()
// check if its being watched
if !ok {
c.Lock()
// set to watched
c.watched[service] = true
// only kick it off if not running
if !c.running {
go c.run()
}
c.Unlock()
}
2019-05-31 02:22:43 +03:00
// get and return services
2019-10-04 18:40:21 +03:00
return get(service, cp)
2019-05-31 02:22:43 +03:00
}
func (c *cache) set(service string, services []*registry.Service) {
c.cache[service] = services
c.ttls[service] = time.Now().Add(c.opts.TTL)
}
func (c *cache) update(res *registry.Result) {
if res == nil || res.Service == nil {
return
}
c.Lock()
defer c.Unlock()
// only save watched services
if _, ok := c.watched[res.Service.Name]; !ok {
return
}
2019-05-31 02:22:43 +03:00
services, ok := c.cache[res.Service.Name]
if !ok {
// we're not going to cache anything
// unless there was already a lookup
return
}
if len(res.Service.Nodes) == 0 {
switch res.Action {
case "delete":
c.del(res.Service.Name)
}
return
}
// existing service found
var service *registry.Service
var index int
for i, s := range services {
if s.Version == res.Service.Version {
service = s
index = i
}
}
switch res.Action {
case "create", "update":
if service == nil {
c.set(res.Service.Name, append(services, res.Service))
return
}
// append old nodes to new service
for _, cur := range service.Nodes {
var seen bool
for _, node := range res.Service.Nodes {
if cur.Id == node.Id {
seen = true
break
}
}
if !seen {
res.Service.Nodes = append(res.Service.Nodes, cur)
}
}
services[index] = res.Service
c.set(res.Service.Name, services)
case "delete":
if service == nil {
return
}
var nodes []*registry.Node
// filter cur nodes to remove the dead one
for _, cur := range service.Nodes {
var seen bool
for _, del := range res.Service.Nodes {
if del.Id == cur.Id {
seen = true
break
}
}
if !seen {
nodes = append(nodes, cur)
}
}
// still got nodes, save and return
if len(nodes) > 0 {
service.Nodes = nodes
services[index] = service
c.set(service.Name, services)
return
}
// zero nodes left
// only have one thing to delete
// nuke the thing
if len(services) == 1 {
c.del(service.Name)
return
}
// still have more than 1 service
// check the version and keep what we know
var srvs []*registry.Service
for _, s := range services {
if s.Version != service.Version {
srvs = append(srvs, s)
}
}
// save
c.set(service.Name, srvs)
}
}
// run starts the cache watcher loop
// it creates a new watcher if there's a problem
func (c *cache) run() {
2019-05-31 02:22:43 +03:00
c.Lock()
c.running = true
2019-05-31 02:22:43 +03:00
c.Unlock()
// reset watcher on exit
2019-05-31 02:22:43 +03:00
defer func() {
c.Lock()
c.watched = make(map[string]bool)
c.running = false
2019-05-31 02:22:43 +03:00
c.Unlock()
}()
var a, b int
for {
// exit early if already dead
if c.quit() {
return
}
// jitter before starting
j := rand.Int63n(100)
time.Sleep(time.Duration(j) * time.Millisecond)
// create new watcher
w, err := c.Registry.Watch()
2019-05-31 02:22:43 +03:00
if err != nil {
if c.quit() {
return
}
d := backoff(a)
2019-09-25 21:44:46 +03:00
c.setStatus(err)
2019-05-31 02:22:43 +03:00
if a > 3 {
if logger.V(logger.DebugLevel, logger.DefaultLogger) {
logger.Debug("rcache: ", err, " backing off ", d)
}
2019-05-31 02:22:43 +03:00
a = 0
}
time.Sleep(d)
a++
continue
}
// reset a
a = 0
// watch for events
if err := c.watch(w); err != nil {
if c.quit() {
return
}
d := backoff(b)
2019-09-25 21:44:46 +03:00
c.setStatus(err)
2019-05-31 02:22:43 +03:00
if b > 3 {
if logger.V(logger.DebugLevel, logger.DefaultLogger) {
logger.Debug("rcache: ", err, " backing off ", d)
}
2019-05-31 02:22:43 +03:00
b = 0
}
time.Sleep(d)
b++
continue
}
// reset b
b = 0
}
}
// watch loops the next event and calls update
// it returns if there's an error
func (c *cache) watch(w registry.Watcher) error {
2019-08-02 01:03:11 +03:00
// used to stop the watch
stop := make(chan bool)
2019-05-31 02:22:43 +03:00
// manage this loop
go func() {
2019-08-02 01:03:11 +03:00
defer w.Stop()
select {
2019-05-31 02:22:43 +03:00
// wait for exit
2019-08-02 01:03:11 +03:00
case <-c.exit:
return
// we've been stopped
case <-stop:
return
}
2019-05-31 02:22:43 +03:00
}()
for {
res, err := w.Next()
if err != nil {
2019-08-02 01:03:11 +03:00
close(stop)
2019-05-31 02:22:43 +03:00
return err
}
2019-09-25 21:44:46 +03:00
// reset the error status since we succeeded
if err := c.getStatus(); err != nil {
// reset status
c.setStatus(nil)
}
2019-05-31 02:22:43 +03:00
c.update(res)
}
}
func (c *cache) GetService(service string) ([]*registry.Service, error) {
// get the service
services, err := c.get(service)
if err != nil {
return nil, err
}
// if there's nothing return err
if len(services) == 0 {
return nil, registry.ErrNotFound
}
// return services
return services, nil
}
func (c *cache) Stop() {
c.Lock()
defer c.Unlock()
2019-05-31 02:22:43 +03:00
select {
case <-c.exit:
return
default:
close(c.exit)
}
}
func (c *cache) String() string {
2019-10-15 00:39:26 +03:00
return "cache"
2019-05-31 02:22:43 +03:00
}
// New returns a new cache
func New(r registry.Registry, opts ...Option) Cache {
rand.Seed(time.Now().UnixNano())
options := Options{
TTL: DefaultTTL,
}
for _, o := range opts {
o(&options)
}
return &cache{
Registry: r,
opts: options,
watched: make(map[string]bool),
cache: make(map[string][]*registry.Service),
ttls: make(map[string]time.Time),
exit: make(chan bool),
}
}