916ec63af6
This is a new revision of the discovery server. Relevant changes and non-changes: - Protocol towards clients is unchanged. - Recommended large scale design is still to be deployed nehind nginx (I tested, and it's still a lot faster at terminating TLS). - Database backend is leveldb again, only. It scales enough, is easy to setup, and we don't need any backend to take care of. - Server supports replication. This is a simple TCP channel - protect it with a firewall when deploying over the internet. (We deploy this within the same datacenter, and with firewall.) Any incoming client announces are sent over the replication channel(s) to other peer discosrvs. Incoming replication changes are applied to the database as if they came from clients, but without the TLS/certificate overhead. - Metrics are exposed using the prometheus library, when enabled. - The database values and replication protocol is protobuf, because JSON was quite CPU intensive when I tried that and benchmarked it. - The "Retry-After" value for failed lookups gets slowly increased from a default of 120 seconds, by 5 seconds for each failed lookup, independently by each discosrv. This lowers the query load over time for clients that are never seen. The Retry-After maxes out at 3600 after a couple of weeks of this increase. The number of failed lookups is stored in the database, now and then (avoiding making each lookup a database put). All in all this means clients can be pointed towards a cluster using just multiple A / AAAA records to gain both load sharing and redundancy (if one is down, clients will talk to the remaining ones). GitHub-Pull-Request: https://github.com/syncthing/syncthing/pull/4648
96 lines
2.0 KiB
Go
96 lines
2.0 KiB
Go
// The Test package is used for testing logrus. It is here for backwards
|
|
// compatibility from when logrus' organization was upper-case. Please use
|
|
// lower-case logrus and the `null` package instead of this one.
|
|
package test
|
|
|
|
import (
|
|
"io/ioutil"
|
|
"sync"
|
|
|
|
"github.com/sirupsen/logrus"
|
|
)
|
|
|
|
// Hook is a hook designed for dealing with logs in test scenarios.
|
|
type Hook struct {
|
|
// Entries is an array of all entries that have been received by this hook.
|
|
// For safe access, use the AllEntries() method, rather than reading this
|
|
// value directly.
|
|
Entries []*logrus.Entry
|
|
mu sync.RWMutex
|
|
}
|
|
|
|
// NewGlobal installs a test hook for the global logger.
|
|
func NewGlobal() *Hook {
|
|
|
|
hook := new(Hook)
|
|
logrus.AddHook(hook)
|
|
|
|
return hook
|
|
|
|
}
|
|
|
|
// NewLocal installs a test hook for a given local logger.
|
|
func NewLocal(logger *logrus.Logger) *Hook {
|
|
|
|
hook := new(Hook)
|
|
logger.Hooks.Add(hook)
|
|
|
|
return hook
|
|
|
|
}
|
|
|
|
// NewNullLogger creates a discarding logger and installs the test hook.
|
|
func NewNullLogger() (*logrus.Logger, *Hook) {
|
|
|
|
logger := logrus.New()
|
|
logger.Out = ioutil.Discard
|
|
|
|
return logger, NewLocal(logger)
|
|
|
|
}
|
|
|
|
func (t *Hook) Fire(e *logrus.Entry) error {
|
|
t.mu.Lock()
|
|
defer t.mu.Unlock()
|
|
t.Entries = append(t.Entries, e)
|
|
return nil
|
|
}
|
|
|
|
func (t *Hook) Levels() []logrus.Level {
|
|
return logrus.AllLevels
|
|
}
|
|
|
|
// LastEntry returns the last entry that was logged or nil.
|
|
func (t *Hook) LastEntry() *logrus.Entry {
|
|
t.mu.RLock()
|
|
defer t.mu.RUnlock()
|
|
i := len(t.Entries) - 1
|
|
if i < 0 {
|
|
return nil
|
|
}
|
|
// Make a copy, for safety
|
|
e := *t.Entries[i]
|
|
return &e
|
|
}
|
|
|
|
// AllEntries returns all entries that were logged.
|
|
func (t *Hook) AllEntries() []*logrus.Entry {
|
|
t.mu.RLock()
|
|
defer t.mu.RUnlock()
|
|
// Make a copy so the returned value won't race with future log requests
|
|
entries := make([]*logrus.Entry, len(t.Entries))
|
|
for i, entry := range t.Entries {
|
|
// Make a copy, for safety
|
|
e := *entry
|
|
entries[i] = &e
|
|
}
|
|
return entries
|
|
}
|
|
|
|
// Reset removes all Entries from this test hook.
|
|
func (t *Hook) Reset() {
|
|
t.mu.Lock()
|
|
defer t.mu.Unlock()
|
|
t.Entries = make([]*logrus.Entry, 0)
|
|
}
|