mirror of
https://github.com/octoleo/syncthing.git
synced 2024-11-10 07:11:08 +00:00
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.4 KiB
Go
96 lines
2.4 KiB
Go
// Copyright 2017 The Prometheus Authors
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package procfs
|
|
|
|
import (
|
|
"bufio"
|
|
"fmt"
|
|
"io"
|
|
"os"
|
|
"strconv"
|
|
"strings"
|
|
)
|
|
|
|
// A BuddyInfo is the details parsed from /proc/buddyinfo.
|
|
// The data is comprised of an array of free fragments of each size.
|
|
// The sizes are 2^n*PAGE_SIZE, where n is the array index.
|
|
type BuddyInfo struct {
|
|
Node string
|
|
Zone string
|
|
Sizes []float64
|
|
}
|
|
|
|
// NewBuddyInfo reads the buddyinfo statistics.
|
|
func NewBuddyInfo() ([]BuddyInfo, error) {
|
|
fs, err := NewFS(DefaultMountPoint)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return fs.NewBuddyInfo()
|
|
}
|
|
|
|
// NewBuddyInfo reads the buddyinfo statistics from the specified `proc` filesystem.
|
|
func (fs FS) NewBuddyInfo() ([]BuddyInfo, error) {
|
|
file, err := os.Open(fs.Path("buddyinfo"))
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer file.Close()
|
|
|
|
return parseBuddyInfo(file)
|
|
}
|
|
|
|
func parseBuddyInfo(r io.Reader) ([]BuddyInfo, error) {
|
|
var (
|
|
buddyInfo = []BuddyInfo{}
|
|
scanner = bufio.NewScanner(r)
|
|
bucketCount = -1
|
|
)
|
|
|
|
for scanner.Scan() {
|
|
var err error
|
|
line := scanner.Text()
|
|
parts := strings.Fields(line)
|
|
|
|
if len(parts) < 4 {
|
|
return nil, fmt.Errorf("invalid number of fields when parsing buddyinfo")
|
|
}
|
|
|
|
node := strings.TrimRight(parts[1], ",")
|
|
zone := strings.TrimRight(parts[3], ",")
|
|
arraySize := len(parts[4:])
|
|
|
|
if bucketCount == -1 {
|
|
bucketCount = arraySize
|
|
} else {
|
|
if bucketCount != arraySize {
|
|
return nil, fmt.Errorf("mismatch in number of buddyinfo buckets, previous count %d, new count %d", bucketCount, arraySize)
|
|
}
|
|
}
|
|
|
|
sizes := make([]float64, arraySize)
|
|
for i := 0; i < arraySize; i++ {
|
|
sizes[i], err = strconv.ParseFloat(parts[i+4], 64)
|
|
if err != nil {
|
|
return nil, fmt.Errorf("invalid value in buddyinfo: %s", err)
|
|
}
|
|
}
|
|
|
|
buddyInfo = append(buddyInfo, BuddyInfo{node, zone, sizes})
|
|
}
|
|
|
|
return buddyInfo, scanner.Err()
|
|
}
|