2019-01-24 20:15:10 +00:00
|
|
|
// Copyright (C) 2019 Storj Labs, Inc.
|
2018-12-17 20:14:16 +00:00
|
|
|
// See LICENSE for copying information.
|
|
|
|
|
|
|
|
package satellitedb
|
|
|
|
|
|
|
|
import (
|
|
|
|
"context"
|
|
|
|
"database/sql"
|
2019-01-29 19:42:43 +00:00
|
|
|
"strings"
|
2019-03-29 08:53:43 +00:00
|
|
|
"time"
|
2018-12-17 20:14:16 +00:00
|
|
|
|
2019-04-10 07:04:24 +01:00
|
|
|
"github.com/golang/protobuf/ptypes"
|
2019-05-19 16:10:46 +01:00
|
|
|
"github.com/lib/pq"
|
|
|
|
sqlite3 "github.com/mattn/go-sqlite3"
|
2019-01-15 16:08:45 +00:00
|
|
|
"github.com/zeebo/errs"
|
2019-03-25 22:25:09 +00:00
|
|
|
monkit "gopkg.in/spacemonkeygo/monkit.v2"
|
2019-01-15 16:08:45 +00:00
|
|
|
|
2019-04-10 07:04:24 +01:00
|
|
|
"storj.io/storj/internal/version"
|
2019-01-15 16:08:45 +00:00
|
|
|
"storj.io/storj/pkg/overlay"
|
|
|
|
"storj.io/storj/pkg/pb"
|
|
|
|
"storj.io/storj/pkg/storj"
|
2018-12-17 20:14:16 +00:00
|
|
|
dbx "storj.io/storj/satellite/satellitedb/dbx"
|
|
|
|
"storj.io/storj/storage"
|
|
|
|
)
|
|
|
|
|
2019-03-25 22:25:09 +00:00
|
|
|
var (
|
|
|
|
mon = monkit.Package()
|
|
|
|
errAuditSuccess = errs.Class("overlay audit success error")
|
|
|
|
errUptime = errs.Class("overlay uptime error")
|
|
|
|
)
|
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
var _ overlay.DB = (*overlaycache)(nil)
|
|
|
|
|
2018-12-17 20:14:16 +00:00
|
|
|
type overlaycache struct {
|
2018-12-27 09:56:25 +00:00
|
|
|
db *dbx.DB
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
func (cache *overlaycache) SelectStorageNodes(ctx context.Context, count int, criteria *overlay.NodeCriteria) (nodes []*pb.Node, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-02-11 16:35:28 +00:00
|
|
|
nodeType := int(pb.NodeType_STORAGE)
|
2019-04-10 07:04:24 +01:00
|
|
|
|
|
|
|
safeQuery := `
|
2019-03-29 08:53:43 +00:00
|
|
|
WHERE type = ? AND free_bandwidth >= ? AND free_disk >= ?
|
|
|
|
AND total_audit_count >= ?
|
2019-01-31 18:49:00 +00:00
|
|
|
AND audit_success_ratio >= ?
|
2019-03-29 08:53:43 +00:00
|
|
|
AND total_uptime_count >= ?
|
|
|
|
AND uptime_ratio >= ?
|
|
|
|
AND last_contact_success > ?
|
2019-04-10 07:04:24 +01:00
|
|
|
AND last_contact_success > last_contact_failure`
|
|
|
|
args := append(make([]interface{}, 0, 13),
|
|
|
|
nodeType, criteria.FreeBandwidth, criteria.FreeDisk,
|
2019-01-31 18:49:00 +00:00
|
|
|
criteria.AuditCount, criteria.AuditSuccessRatio, criteria.UptimeCount, criteria.UptimeSuccessRatio,
|
2019-04-26 13:15:06 +01:00
|
|
|
time.Now().Add(-criteria.OnlineWindow))
|
2019-04-10 07:04:24 +01:00
|
|
|
|
|
|
|
if criteria.MinimumVersion != "" {
|
|
|
|
v, err := version.NewSemVer(criteria.MinimumVersion)
|
|
|
|
if err != nil {
|
|
|
|
return nil, Error.New("invalid node selection criteria version: %v", err)
|
|
|
|
}
|
|
|
|
safeQuery += `
|
2019-05-14 00:55:51 +01:00
|
|
|
AND (major > ? OR (major = ? AND (minor > ? OR (minor = ? AND patch >= ?))))
|
2019-04-10 07:04:24 +01:00
|
|
|
AND release`
|
|
|
|
args = append(args, v.Major, v.Major, v.Minor, v.Minor, v.Patch)
|
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
if !criteria.DistinctIP {
|
|
|
|
nodes, err = cache.queryNodes(ctx, criteria.ExcludedNodes, count, safeQuery, args...)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
return nodes, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// query for distinct IPs
|
|
|
|
for i := 0; i < 3; i++ {
|
|
|
|
moreNodes, err := cache.queryNodesDistinct(ctx, criteria.ExcludedNodes, criteria.ExcludedIPs, count-len(nodes), safeQuery, criteria.DistinctIP, args...)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
for _, n := range moreNodes {
|
|
|
|
nodes = append(nodes, n)
|
|
|
|
criteria.ExcludedNodes = append(criteria.ExcludedNodes, n.Id)
|
|
|
|
criteria.ExcludedIPs = append(criteria.ExcludedIPs, n.LastIp)
|
|
|
|
}
|
|
|
|
if len(nodes) == count {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nodes, nil
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
func (cache *overlaycache) SelectNewStorageNodes(ctx context.Context, count int, criteria *overlay.NodeCriteria) (nodes []*pb.Node, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-02-11 16:35:28 +00:00
|
|
|
nodeType := int(pb.NodeType_STORAGE)
|
2019-04-10 07:04:24 +01:00
|
|
|
|
|
|
|
safeQuery := `
|
2019-03-29 08:53:43 +00:00
|
|
|
WHERE type = ? AND free_bandwidth >= ? AND free_disk >= ?
|
2019-05-01 14:45:52 +01:00
|
|
|
AND total_audit_count < ? AND audit_success_ratio >= ?
|
2019-03-29 08:53:43 +00:00
|
|
|
AND last_contact_success > ?
|
2019-04-10 07:04:24 +01:00
|
|
|
AND last_contact_success > last_contact_failure`
|
|
|
|
args := append(make([]interface{}, 0, 10),
|
2019-04-26 13:15:06 +01:00
|
|
|
nodeType, criteria.FreeBandwidth, criteria.FreeDisk, criteria.AuditCount, criteria.AuditSuccessRatio, time.Now().Add(-criteria.OnlineWindow))
|
2019-04-10 07:04:24 +01:00
|
|
|
|
|
|
|
if criteria.MinimumVersion != "" {
|
|
|
|
v, err := version.NewSemVer(criteria.MinimumVersion)
|
|
|
|
if err != nil {
|
|
|
|
return nil, Error.New("invalid node selection criteria version: %v", err)
|
|
|
|
}
|
|
|
|
safeQuery += `
|
2019-05-14 00:55:51 +01:00
|
|
|
AND (major > ? OR (major = ? AND (minor > ? OR (minor = ? AND patch >= ?))))
|
2019-04-10 07:04:24 +01:00
|
|
|
AND release`
|
|
|
|
args = append(args, v.Major, v.Major, v.Minor, v.Minor, v.Patch)
|
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
if !criteria.DistinctIP {
|
|
|
|
nodes, err = cache.queryNodes(ctx, criteria.ExcludedNodes, count, safeQuery, args...)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
return nodes, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// query for distinct IPs
|
|
|
|
for i := 0; i < 3; i++ {
|
|
|
|
moreNodes, err := cache.queryNodesDistinct(ctx, criteria.ExcludedNodes, criteria.ExcludedIPs, count-len(nodes), safeQuery, criteria.DistinctIP, args...)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
for _, n := range moreNodes {
|
|
|
|
nodes = append(nodes, n)
|
|
|
|
criteria.ExcludedNodes = append(criteria.ExcludedNodes, n.Id)
|
|
|
|
criteria.ExcludedIPs = append(criteria.ExcludedIPs, n.LastIp)
|
|
|
|
}
|
|
|
|
if len(nodes) == count {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nodes, nil
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
func (cache *overlaycache) queryNodes(ctx context.Context, excludedNodes []storj.NodeID, count int, safeQuery string, args ...interface{}) (_ []*pb.Node, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-01-31 18:49:00 +00:00
|
|
|
if count == 0 {
|
|
|
|
return nil, nil
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
|
|
|
|
2019-01-31 18:49:00 +00:00
|
|
|
safeExcludeNodes := ""
|
2019-05-22 21:06:27 +01:00
|
|
|
if len(excludedNodes) > 0 {
|
|
|
|
safeExcludeNodes = ` AND id NOT IN (?` + strings.Repeat(", ?", len(excludedNodes)-1) + `)`
|
|
|
|
for _, id := range excludedNodes {
|
|
|
|
args = append(args, id.Bytes())
|
|
|
|
}
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
2019-05-22 21:06:27 +01:00
|
|
|
|
|
|
|
args = append(args, count)
|
|
|
|
|
|
|
|
var rows *sql.Rows
|
|
|
|
rows, err = cache.db.Query(cache.db.Rebind(`SELECT id,
|
|
|
|
type, address, last_ip, free_bandwidth, free_disk, audit_success_ratio,
|
|
|
|
uptime_ratio, total_audit_count, audit_success_count, total_uptime_count,
|
|
|
|
uptime_success_count
|
|
|
|
FROM nodes
|
|
|
|
`+safeQuery+safeExcludeNodes+`
|
|
|
|
ORDER BY RANDOM()
|
|
|
|
LIMIT ?`), args...)
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
defer func() { err = errs.Combine(err, rows.Close()) }()
|
|
|
|
var nodes []*pb.Node
|
|
|
|
for rows.Next() {
|
|
|
|
dbNode := &dbx.Node{}
|
|
|
|
err = rows.Scan(&dbNode.Id, &dbNode.Type,
|
|
|
|
&dbNode.Address, &dbNode.LastIp, &dbNode.FreeBandwidth, &dbNode.FreeDisk,
|
|
|
|
&dbNode.AuditSuccessRatio, &dbNode.UptimeRatio,
|
|
|
|
&dbNode.TotalAuditCount, &dbNode.AuditSuccessCount,
|
|
|
|
&dbNode.TotalUptimeCount, &dbNode.UptimeSuccessCount)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
dossier, err := convertDBNode(ctx, dbNode)
|
2019-05-22 21:06:27 +01:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
nodes = append(nodes, &dossier.Node)
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
2019-05-22 21:06:27 +01:00
|
|
|
|
|
|
|
return nodes, rows.Err()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (cache *overlaycache) queryNodesDistinct(ctx context.Context, excludedNodes []storj.NodeID, excludedIPs []string, count int, safeQuery string, distinctIP bool, args ...interface{}) (_ []*pb.Node, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
switch t := cache.db.DB.Driver().(type) {
|
|
|
|
case *sqlite3.SQLiteDriver:
|
|
|
|
return cache.sqliteQueryNodesDistinct(ctx, excludedNodes, excludedIPs, count, safeQuery, distinctIP, args...)
|
|
|
|
case *pq.Driver:
|
|
|
|
return cache.postgresQueryNodesDistinct(ctx, excludedNodes, excludedIPs, count, safeQuery, distinctIP, args...)
|
|
|
|
default:
|
|
|
|
return []*pb.Node{}, Error.New("Unsupported database %t", t)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (cache *overlaycache) sqliteQueryNodesDistinct(ctx context.Context, excludedNodes []storj.NodeID, excludedIPs []string, count int, safeQuery string, distinctIP bool, args ...interface{}) (_ []*pb.Node, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
if count == 0 {
|
|
|
|
return nil, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
safeExcludeNodes := ""
|
|
|
|
if len(excludedNodes) > 0 {
|
|
|
|
safeExcludeNodes = ` AND id NOT IN (?` + strings.Repeat(", ?", len(excludedNodes)-1) + `)`
|
|
|
|
for _, id := range excludedNodes {
|
|
|
|
args = append(args, id.Bytes())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
safeExcludeIPs := ""
|
|
|
|
if len(excludedIPs) > 0 {
|
|
|
|
safeExcludeIPs = ` AND last_ip NOT IN (?` + strings.Repeat(", ?", len(excludedIPs)-1) + `)`
|
|
|
|
for _, ip := range excludedIPs {
|
|
|
|
args = append(args, ip)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-01-31 18:49:00 +00:00
|
|
|
args = append(args, count)
|
2019-01-29 19:42:43 +00:00
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
rows, err := cache.db.Query(cache.db.Rebind(`SELECT id,
|
2019-05-22 21:06:27 +01:00
|
|
|
type, address, last_ip, free_bandwidth, free_disk, audit_success_ratio,
|
|
|
|
uptime_ratio, total_audit_count, audit_success_count, total_uptime_count,
|
|
|
|
uptime_success_count
|
|
|
|
FROM (SELECT id, type, address, last_ip, free_bandwidth, free_disk, audit_success_ratio,
|
|
|
|
uptime_ratio, total_audit_count, audit_success_count, total_uptime_count, uptime_success_count,
|
|
|
|
Row_number() OVER(PARTITION BY last_ip ORDER BY RANDOM()) rn
|
|
|
|
FROM nodes
|
|
|
|
`+safeQuery+safeExcludeNodes+safeExcludeIPs+`) n
|
|
|
|
WHERE rn = 1
|
|
|
|
ORDER BY RANDOM()
|
|
|
|
LIMIT ?`), args...)
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
defer func() { err = errs.Combine(err, rows.Close()) }()
|
|
|
|
var nodes []*pb.Node
|
|
|
|
for rows.Next() {
|
|
|
|
dbNode := &dbx.Node{}
|
|
|
|
err = rows.Scan(&dbNode.Id, &dbNode.Type,
|
|
|
|
&dbNode.Address, &dbNode.LastIp, &dbNode.FreeBandwidth, &dbNode.FreeDisk,
|
|
|
|
&dbNode.AuditSuccessRatio, &dbNode.UptimeRatio,
|
|
|
|
&dbNode.TotalAuditCount, &dbNode.AuditSuccessCount,
|
|
|
|
&dbNode.TotalUptimeCount, &dbNode.UptimeSuccessCount)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
dossier, err := convertDBNode(ctx, dbNode)
|
2019-05-22 21:06:27 +01:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
nodes = append(nodes, &dossier.Node)
|
|
|
|
}
|
|
|
|
|
|
|
|
return nodes, rows.Err()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (cache *overlaycache) postgresQueryNodesDistinct(ctx context.Context, excludedNodes []storj.NodeID, excludedIPs []string, count int, safeQuery string, distinctIP bool, args ...interface{}) (_ []*pb.Node, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-05-22 21:06:27 +01:00
|
|
|
if count == 0 {
|
|
|
|
return nil, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
safeExcludeNodes := ""
|
|
|
|
if len(excludedNodes) > 0 {
|
|
|
|
safeExcludeNodes = ` AND id NOT IN (?` + strings.Repeat(", ?", len(excludedNodes)-1) + `)`
|
|
|
|
for _, id := range excludedNodes {
|
|
|
|
args = append(args, id.Bytes())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
safeExcludeIPs := ""
|
|
|
|
if len(excludedIPs) > 0 {
|
|
|
|
safeExcludeIPs = ` AND last_ip NOT IN (?` + strings.Repeat(", ?", len(excludedIPs)-1) + `)`
|
|
|
|
for _, ip := range excludedIPs {
|
|
|
|
args = append(args, ip)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
args = append(args, count)
|
|
|
|
|
|
|
|
rows, err := cache.db.Query(cache.db.Rebind(`SELECT DISTINCT ON (last_ip) id,
|
|
|
|
type, address, last_ip, free_bandwidth, free_disk, audit_success_ratio,
|
|
|
|
uptime_ratio, total_audit_count, audit_success_count, total_uptime_count,
|
|
|
|
uptime_success_count
|
|
|
|
FROM (SELECT id,
|
|
|
|
type, address, last_ip, free_bandwidth, free_disk, audit_success_ratio,
|
2019-03-29 08:53:43 +00:00
|
|
|
uptime_ratio, total_audit_count, audit_success_count, total_uptime_count,
|
2019-01-31 18:49:00 +00:00
|
|
|
uptime_success_count
|
2019-03-29 08:53:43 +00:00
|
|
|
FROM nodes
|
2019-05-22 21:06:27 +01:00
|
|
|
`+safeQuery+safeExcludeNodes+safeExcludeIPs+`
|
2019-01-31 19:33:07 +00:00
|
|
|
ORDER BY RANDOM()
|
2019-05-22 21:06:27 +01:00
|
|
|
LIMIT ?) n`), args...)
|
|
|
|
|
2019-01-29 19:42:43 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2019-01-31 18:49:00 +00:00
|
|
|
defer func() { err = errs.Combine(err, rows.Close()) }()
|
|
|
|
var nodes []*pb.Node
|
2019-01-29 19:42:43 +00:00
|
|
|
for rows.Next() {
|
2019-03-29 08:53:43 +00:00
|
|
|
dbNode := &dbx.Node{}
|
|
|
|
err = rows.Scan(&dbNode.Id, &dbNode.Type,
|
2019-05-22 21:06:27 +01:00
|
|
|
&dbNode.Address, &dbNode.LastIp, &dbNode.FreeBandwidth, &dbNode.FreeDisk,
|
2019-03-29 08:53:43 +00:00
|
|
|
&dbNode.AuditSuccessRatio, &dbNode.UptimeRatio,
|
|
|
|
&dbNode.TotalAuditCount, &dbNode.AuditSuccessCount,
|
|
|
|
&dbNode.TotalUptimeCount, &dbNode.UptimeSuccessCount)
|
2019-01-29 19:42:43 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2019-06-04 12:55:38 +01:00
|
|
|
dossier, err := convertDBNode(ctx, dbNode)
|
2019-01-29 19:42:43 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2019-04-04 17:34:36 +01:00
|
|
|
nodes = append(nodes, &dossier.Node)
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
|
|
|
|
2019-01-31 18:49:00 +00:00
|
|
|
return nodes, rows.Err()
|
2019-01-29 19:42:43 +00:00
|
|
|
}
|
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
// Get looks up the node by nodeID
|
2019-06-04 12:55:38 +01:00
|
|
|
func (cache *overlaycache) Get(ctx context.Context, id storj.NodeID) (_ *overlay.NodeDossier, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
if id.IsZero() {
|
|
|
|
return nil, overlay.ErrEmptyNode
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
node, err := cache.db.Get_Node_By_Id(ctx, dbx.Node_Id(id.Bytes()))
|
2019-01-15 16:08:45 +00:00
|
|
|
if err == sql.ErrNoRows {
|
2019-03-29 08:53:43 +00:00
|
|
|
return nil, overlay.ErrNodeNotFound.New(id.String())
|
2019-01-15 16:08:45 +00:00
|
|
|
}
|
2018-12-17 20:14:16 +00:00
|
|
|
if err != nil {
|
2019-01-15 16:08:45 +00:00
|
|
|
return nil, err
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
return convertDBNode(ctx, node)
|
2019-01-15 16:08:45 +00:00
|
|
|
}
|
|
|
|
|
2019-06-03 15:53:30 +01:00
|
|
|
// IsVetted returns whether or not the node reaches reputable thresholds
|
2019-06-04 12:55:38 +01:00
|
|
|
func (cache *overlaycache) IsVetted(ctx context.Context, id storj.NodeID, criteria *overlay.NodeCriteria) (_ bool, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-05-30 20:52:33 +01:00
|
|
|
row := cache.db.QueryRow(cache.db.Rebind(`SELECT id
|
|
|
|
FROM nodes
|
2019-06-04 12:55:38 +01:00
|
|
|
WHERE id = ?
|
2019-05-30 20:52:33 +01:00
|
|
|
AND type = ?
|
|
|
|
AND total_audit_count >= ?
|
|
|
|
AND audit_success_ratio >= ?
|
|
|
|
AND total_uptime_count >= ?
|
|
|
|
AND uptime_ratio >= ?
|
|
|
|
`), id, pb.NodeType_STORAGE, criteria.AuditCount, criteria.AuditSuccessRatio,
|
|
|
|
criteria.UptimeCount, criteria.UptimeSuccessRatio)
|
|
|
|
var bytes *[]byte
|
2019-06-04 12:55:38 +01:00
|
|
|
err = row.Scan(&bytes)
|
2019-05-30 20:52:33 +01:00
|
|
|
if err != nil {
|
|
|
|
if err == sql.ErrNoRows {
|
|
|
|
return false, nil
|
|
|
|
}
|
|
|
|
return false, err
|
|
|
|
}
|
|
|
|
return true, nil
|
|
|
|
}
|
|
|
|
|
2019-05-01 14:45:52 +01:00
|
|
|
// KnownUnreliableOrOffline filters a set of nodes to unreliable or offlines node, independent of new
|
2019-05-08 18:59:50 +01:00
|
|
|
func (cache *overlaycache) KnownUnreliableOrOffline(ctx context.Context, criteria *overlay.NodeCriteria, nodeIds storj.NodeIDList) (badNodes storj.NodeIDList, err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-05-01 14:45:52 +01:00
|
|
|
if len(nodeIds) == 0 {
|
|
|
|
return nil, Error.New("no ids provided")
|
|
|
|
}
|
|
|
|
|
2019-05-08 18:59:50 +01:00
|
|
|
// get reliable and online nodes
|
2019-05-19 16:10:46 +01:00
|
|
|
var rows *sql.Rows
|
|
|
|
switch t := cache.db.Driver().(type) {
|
|
|
|
case *sqlite3.SQLiteDriver:
|
|
|
|
args := make([]interface{}, 0, len(nodeIds)+3)
|
|
|
|
for i := range nodeIds {
|
|
|
|
args = append(args, nodeIds[i].Bytes())
|
|
|
|
}
|
|
|
|
args = append(args, criteria.AuditSuccessRatio, criteria.UptimeSuccessRatio, time.Now().Add(-criteria.OnlineWindow))
|
|
|
|
|
|
|
|
rows, err = cache.db.Query(cache.db.Rebind(`
|
|
|
|
SELECT id FROM nodes
|
|
|
|
WHERE id IN (?`+strings.Repeat(", ?", len(nodeIds)-1)+`)
|
|
|
|
AND audit_success_ratio >= ? AND uptime_ratio >= ?
|
|
|
|
AND last_contact_success > ? AND last_contact_success > last_contact_failure
|
|
|
|
`), args...)
|
|
|
|
|
|
|
|
case *pq.Driver:
|
|
|
|
rows, err = cache.db.Query(`
|
|
|
|
SELECT id FROM nodes
|
|
|
|
WHERE id = any($1::bytea[])
|
|
|
|
AND audit_success_ratio >= $2 AND uptime_ratio >= $3
|
|
|
|
AND last_contact_success > $4 AND last_contact_success > last_contact_failure
|
|
|
|
`, postgresNodeIDList(nodeIds),
|
|
|
|
criteria.AuditSuccessRatio, criteria.UptimeSuccessRatio,
|
|
|
|
time.Now().Add(-criteria.OnlineWindow),
|
|
|
|
)
|
|
|
|
default:
|
|
|
|
return nil, Error.New("Unsupported database %t", t)
|
|
|
|
}
|
|
|
|
|
2019-05-01 14:45:52 +01:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
defer func() {
|
|
|
|
err = errs.Combine(err, rows.Close())
|
|
|
|
}()
|
2019-05-08 18:59:50 +01:00
|
|
|
|
2019-05-19 16:10:46 +01:00
|
|
|
goodNodes := make(map[storj.NodeID]struct{}, len(nodeIds))
|
2019-05-01 14:45:52 +01:00
|
|
|
for rows.Next() {
|
|
|
|
var id storj.NodeID
|
|
|
|
err = rows.Scan(&id)
|
2018-12-17 20:14:16 +00:00
|
|
|
if err != nil {
|
2019-05-01 14:45:52 +01:00
|
|
|
return nil, err
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
2019-05-19 16:10:46 +01:00
|
|
|
goodNodes[id] = struct{}{}
|
2019-05-08 18:59:50 +01:00
|
|
|
}
|
|
|
|
for _, id := range nodeIds {
|
2019-05-19 16:10:46 +01:00
|
|
|
if _, ok := goodNodes[id]; !ok {
|
2019-05-08 18:59:50 +01:00
|
|
|
badNodes = append(badNodes, id)
|
|
|
|
}
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
2019-05-08 18:59:50 +01:00
|
|
|
return badNodes, nil
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
|
|
|
|
2019-01-30 16:29:18 +00:00
|
|
|
// Paginate will run through
|
2019-06-04 12:55:38 +01:00
|
|
|
func (cache *overlaycache) Paginate(ctx context.Context, offset int64, limit int) (_ []*overlay.NodeDossier, _ bool, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-01-30 16:29:18 +00:00
|
|
|
cursor := storj.NodeID{}
|
|
|
|
|
|
|
|
// more represents end of table. If there are more rows in the database, more will be true.
|
|
|
|
more := true
|
|
|
|
|
|
|
|
if limit <= 0 || limit > storage.LookupLimit {
|
|
|
|
limit = storage.LookupLimit
|
|
|
|
}
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
dbxInfos, err := cache.db.Limited_Node_By_Id_GreaterOrEqual_OrderBy_Asc_Id(ctx, dbx.Node_Id(cursor.Bytes()), limit, offset)
|
2019-01-30 16:29:18 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, false, err
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(dbxInfos) < limit {
|
|
|
|
more = false
|
|
|
|
}
|
|
|
|
|
2019-04-04 17:34:36 +01:00
|
|
|
infos := make([]*overlay.NodeDossier, len(dbxInfos))
|
2019-01-30 16:29:18 +00:00
|
|
|
for i, dbxInfo := range dbxInfos {
|
2019-06-04 12:55:38 +01:00
|
|
|
infos[i], err = convertDBNode(ctx, dbxInfo)
|
2019-01-30 16:29:18 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, false, err
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return infos, more, nil
|
|
|
|
}
|
|
|
|
|
2019-04-22 10:07:50 +01:00
|
|
|
// Update updates node address
|
|
|
|
func (cache *overlaycache) UpdateAddress(ctx context.Context, info *pb.Node) (err error) {
|
2019-06-04 12:55:38 +01:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
if info == nil || info.Id.IsZero() {
|
|
|
|
return overlay.ErrEmptyNode
|
|
|
|
}
|
2018-12-17 20:14:16 +00:00
|
|
|
|
2019-01-15 16:08:45 +00:00
|
|
|
tx, err := cache.db.Open(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(err)
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
2019-01-15 16:08:45 +00:00
|
|
|
// TODO: use upsert
|
2019-03-29 08:53:43 +00:00
|
|
|
_, err = tx.Get_Node_By_Id(ctx, dbx.Node_Id(info.Id.Bytes()))
|
2019-01-15 16:08:45 +00:00
|
|
|
|
|
|
|
address := info.Address
|
|
|
|
if address == nil {
|
|
|
|
address = &pb.NodeAddress{}
|
2018-12-18 20:41:31 +00:00
|
|
|
}
|
2019-01-15 16:08:45 +00:00
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
if err != nil {
|
2019-04-22 10:07:50 +01:00
|
|
|
// add the node to DB for first time
|
2019-03-29 08:53:43 +00:00
|
|
|
_, err = tx.Create_Node(
|
2019-01-15 16:08:45 +00:00
|
|
|
ctx,
|
2019-03-29 08:53:43 +00:00
|
|
|
dbx.Node_Id(info.Id.Bytes()),
|
|
|
|
dbx.Node_Address(address.Address),
|
2019-05-22 21:06:27 +01:00
|
|
|
dbx.Node_LastIp(info.LastIp),
|
2019-03-29 08:53:43 +00:00
|
|
|
dbx.Node_Protocol(int(address.Transport)),
|
2019-04-22 10:07:50 +01:00
|
|
|
dbx.Node_Type(int(pb.NodeType_INVALID)),
|
|
|
|
dbx.Node_Email(""),
|
|
|
|
dbx.Node_Wallet(""),
|
|
|
|
dbx.Node_FreeBandwidth(-1),
|
|
|
|
dbx.Node_FreeDisk(-1),
|
|
|
|
dbx.Node_Major(0),
|
|
|
|
dbx.Node_Minor(0),
|
|
|
|
dbx.Node_Patch(0),
|
|
|
|
dbx.Node_Hash(""),
|
|
|
|
dbx.Node_Timestamp(time.Time{}),
|
|
|
|
dbx.Node_Release(false),
|
|
|
|
dbx.Node_Latency90(0),
|
|
|
|
dbx.Node_AuditSuccessCount(0),
|
|
|
|
dbx.Node_TotalAuditCount(0),
|
2019-05-01 14:45:52 +01:00
|
|
|
dbx.Node_AuditSuccessRatio(1),
|
2019-04-22 10:07:50 +01:00
|
|
|
dbx.Node_UptimeSuccessCount(0),
|
|
|
|
dbx.Node_TotalUptimeCount(0),
|
2019-05-01 14:45:52 +01:00
|
|
|
dbx.Node_UptimeRatio(1),
|
2019-04-01 19:42:06 +01:00
|
|
|
dbx.Node_LastContactSuccess(time.Now()),
|
|
|
|
dbx.Node_LastContactFailure(time.Time{}),
|
2019-05-16 15:11:15 +01:00
|
|
|
dbx.Node_Contained(false),
|
2019-05-30 22:38:23 +01:00
|
|
|
dbx.Node_Disqualified(false),
|
2019-01-15 16:08:45 +00:00
|
|
|
)
|
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(errs.Combine(err, tx.Rollback()))
|
|
|
|
}
|
|
|
|
} else {
|
2019-03-29 08:53:43 +00:00
|
|
|
update := dbx.Node_Update_Fields{
|
|
|
|
Address: dbx.Node_Address(address.Address),
|
2019-05-22 21:06:27 +01:00
|
|
|
LastIp: dbx.Node_LastIp(info.LastIp),
|
2019-03-29 08:53:43 +00:00
|
|
|
Protocol: dbx.Node_Protocol(int(address.Transport)),
|
|
|
|
}
|
|
|
|
|
|
|
|
_, err := tx.Update_Node_By_Id(ctx, dbx.Node_Id(info.Id.Bytes()), update)
|
2019-01-15 16:08:45 +00:00
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(errs.Combine(err, tx.Rollback()))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Error.Wrap(tx.Commit())
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
// CreateStats initializes the stats the provided storagenode
|
|
|
|
func (cache *overlaycache) CreateStats(ctx context.Context, nodeID storj.NodeID, startingStats *overlay.NodeStats) (stats *overlay.NodeStats, err error) {
|
2019-03-25 22:25:09 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
tx, err := cache.db.Open(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return nil, Error.Wrap(err)
|
|
|
|
}
|
|
|
|
dbNode, err := tx.Get_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()))
|
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, Error.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-29 08:53:43 +00:00
|
|
|
}
|
2019-03-25 22:25:09 +00:00
|
|
|
|
|
|
|
if startingStats != nil {
|
2019-06-04 12:55:38 +01:00
|
|
|
auditSuccessRatio, err := checkRatioVars(ctx, startingStats.AuditSuccessCount, startingStats.AuditCount)
|
2019-03-25 22:25:09 +00:00
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, errAuditSuccess.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
uptimeRatio, err := checkRatioVars(ctx, startingStats.UptimeSuccessCount, startingStats.UptimeCount)
|
2019-03-25 22:25:09 +00:00
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, errUptime.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-29 08:53:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
updateFields := dbx.Node_Update_Fields{
|
|
|
|
AuditSuccessCount: dbx.Node_AuditSuccessCount(startingStats.AuditSuccessCount),
|
|
|
|
TotalAuditCount: dbx.Node_TotalAuditCount(startingStats.AuditCount),
|
|
|
|
AuditSuccessRatio: dbx.Node_AuditSuccessRatio(auditSuccessRatio),
|
|
|
|
UptimeSuccessCount: dbx.Node_UptimeSuccessCount(startingStats.UptimeSuccessCount),
|
|
|
|
TotalUptimeCount: dbx.Node_TotalUptimeCount(startingStats.UptimeCount),
|
|
|
|
UptimeRatio: dbx.Node_UptimeRatio(uptimeRatio),
|
|
|
|
}
|
|
|
|
|
|
|
|
dbNode, err = tx.Update_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()), updateFields)
|
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, Error.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-08 18:52:53 +01:00
|
|
|
// TODO: Allegedly tx.Get_Node_By_Id and tx.Update_Node_By_Id should never return a nil value for dbNode,
|
|
|
|
// however we've seen from some crashes that it does. We need to track down the cause of these crashes
|
|
|
|
// but for now we're adding a nil check to prevent a panic.
|
|
|
|
if dbNode == nil {
|
2019-06-03 15:37:43 +01:00
|
|
|
return nil, Error.Wrap(errs.Combine(errs.New("unable to get node by ID: %v", nodeID), tx.Rollback()))
|
2019-04-08 18:52:53 +01:00
|
|
|
}
|
|
|
|
return getNodeStats(dbNode), Error.Wrap(tx.Commit())
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// UpdateStats a single storagenode's stats in the db
|
|
|
|
func (cache *overlaycache) UpdateStats(ctx context.Context, updateReq *overlay.UpdateRequest) (stats *overlay.NodeStats, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
nodeID := updateReq.NodeID
|
|
|
|
|
|
|
|
tx, err := cache.db.Open(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return nil, Error.Wrap(err)
|
|
|
|
}
|
|
|
|
dbNode, err := tx.Get_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()))
|
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, Error.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
auditSuccessCount := dbNode.AuditSuccessCount
|
|
|
|
totalAuditCount := dbNode.TotalAuditCount
|
|
|
|
var auditSuccessRatio float64
|
|
|
|
uptimeSuccessCount := dbNode.UptimeSuccessCount
|
|
|
|
totalUptimeCount := dbNode.TotalUptimeCount
|
|
|
|
var uptimeRatio float64
|
|
|
|
|
|
|
|
auditSuccessCount, totalAuditCount, auditSuccessRatio = updateRatioVars(
|
|
|
|
updateReq.AuditSuccess,
|
|
|
|
auditSuccessCount,
|
|
|
|
totalAuditCount,
|
|
|
|
)
|
|
|
|
|
|
|
|
uptimeSuccessCount, totalUptimeCount, uptimeRatio = updateRatioVars(
|
|
|
|
updateReq.IsUp,
|
|
|
|
uptimeSuccessCount,
|
|
|
|
totalUptimeCount,
|
|
|
|
)
|
|
|
|
|
|
|
|
updateFields := dbx.Node_Update_Fields{
|
|
|
|
AuditSuccessCount: dbx.Node_AuditSuccessCount(auditSuccessCount),
|
|
|
|
TotalAuditCount: dbx.Node_TotalAuditCount(totalAuditCount),
|
|
|
|
AuditSuccessRatio: dbx.Node_AuditSuccessRatio(auditSuccessRatio),
|
|
|
|
UptimeSuccessCount: dbx.Node_UptimeSuccessCount(uptimeSuccessCount),
|
|
|
|
TotalUptimeCount: dbx.Node_TotalUptimeCount(totalUptimeCount),
|
|
|
|
UptimeRatio: dbx.Node_UptimeRatio(uptimeRatio),
|
|
|
|
}
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
if updateReq.IsUp {
|
|
|
|
updateFields.LastContactSuccess = dbx.Node_LastContactSuccess(time.Now())
|
|
|
|
} else {
|
|
|
|
updateFields.LastContactFailure = dbx.Node_LastContactFailure(time.Now())
|
|
|
|
}
|
2019-03-25 22:25:09 +00:00
|
|
|
|
|
|
|
dbNode, err = tx.Update_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()), updateFields)
|
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, Error.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-04-08 18:52:53 +01:00
|
|
|
// TODO: Allegedly tx.Get_Node_By_Id and tx.Update_Node_By_Id should never return a nil value for dbNode,
|
|
|
|
// however we've seen from some crashes that it does. We need to track down the cause of these crashes
|
|
|
|
// but for now we're adding a nil check to prevent a panic.
|
|
|
|
if dbNode == nil {
|
2019-06-03 15:37:43 +01:00
|
|
|
return nil, Error.Wrap(errs.Combine(errs.New("unable to get node by ID: %v", nodeID), tx.Rollback()))
|
2019-04-08 18:52:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return getNodeStats(dbNode), Error.Wrap(tx.Commit())
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-04-10 07:04:24 +01:00
|
|
|
// UpdateNodeInfo updates the email and wallet for a given node ID for satellite payments.
|
|
|
|
func (cache *overlaycache) UpdateNodeInfo(ctx context.Context, nodeID storj.NodeID, nodeInfo *pb.InfoResponse) (stats *overlay.NodeDossier, err error) {
|
2019-03-25 22:25:09 +00:00
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-04-10 07:04:24 +01:00
|
|
|
var updateFields dbx.Node_Update_Fields
|
|
|
|
if nodeInfo != nil {
|
2019-04-22 10:07:50 +01:00
|
|
|
if nodeInfo.GetType() != pb.NodeType_INVALID {
|
|
|
|
updateFields.Type = dbx.Node_Type(int(nodeInfo.GetType()))
|
|
|
|
}
|
2019-04-10 07:04:24 +01:00
|
|
|
if nodeInfo.GetOperator() != nil {
|
|
|
|
updateFields.Wallet = dbx.Node_Wallet(nodeInfo.GetOperator().GetWallet())
|
|
|
|
updateFields.Email = dbx.Node_Email(nodeInfo.GetOperator().GetEmail())
|
|
|
|
}
|
|
|
|
if nodeInfo.GetCapacity() != nil {
|
|
|
|
updateFields.FreeDisk = dbx.Node_FreeDisk(nodeInfo.GetCapacity().GetFreeDisk())
|
|
|
|
updateFields.FreeBandwidth = dbx.Node_FreeBandwidth(nodeInfo.GetCapacity().GetFreeBandwidth())
|
|
|
|
}
|
|
|
|
if nodeInfo.GetVersion() != nil {
|
|
|
|
semVer, err := version.NewSemVer(nodeInfo.GetVersion().GetVersion())
|
|
|
|
if err != nil {
|
2019-04-22 10:07:50 +01:00
|
|
|
return nil, errs.New("unable to convert version to semVer")
|
2019-04-10 07:04:24 +01:00
|
|
|
}
|
|
|
|
pbts, err := ptypes.Timestamp(nodeInfo.GetVersion().GetTimestamp())
|
|
|
|
if err != nil {
|
2019-04-22 10:07:50 +01:00
|
|
|
return nil, errs.New("unable to convert version timestamp")
|
2019-04-10 07:04:24 +01:00
|
|
|
}
|
|
|
|
updateFields.Major = dbx.Node_Major(semVer.Major)
|
|
|
|
updateFields.Minor = dbx.Node_Minor(semVer.Minor)
|
|
|
|
updateFields.Patch = dbx.Node_Patch(semVer.Patch)
|
|
|
|
updateFields.Hash = dbx.Node_Hash(nodeInfo.GetVersion().GetCommitHash())
|
|
|
|
updateFields.Timestamp = dbx.Node_Timestamp(pbts)
|
|
|
|
updateFields.Release = dbx.Node_Release(nodeInfo.GetVersion().GetRelease())
|
|
|
|
}
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-04-04 17:34:36 +01:00
|
|
|
updatedDBNode, err := cache.db.Update_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()), updateFields)
|
2019-03-25 22:25:09 +00:00
|
|
|
if err != nil {
|
2019-04-04 17:34:36 +01:00
|
|
|
return nil, Error.Wrap(err)
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
return convertDBNode(ctx, updatedDBNode)
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// UpdateUptime updates a single storagenode's uptime stats in the db
|
|
|
|
func (cache *overlaycache) UpdateUptime(ctx context.Context, nodeID storj.NodeID, isUp bool) (stats *overlay.NodeStats, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
tx, err := cache.db.Open(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return nil, Error.Wrap(err)
|
|
|
|
}
|
|
|
|
dbNode, err := tx.Get_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()))
|
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, Error.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
uptimeSuccessCount := dbNode.UptimeSuccessCount
|
|
|
|
totalUptimeCount := dbNode.TotalUptimeCount
|
|
|
|
var uptimeRatio float64
|
|
|
|
|
|
|
|
updateFields := dbx.Node_Update_Fields{}
|
|
|
|
|
|
|
|
uptimeSuccessCount, totalUptimeCount, uptimeRatio = updateRatioVars(
|
|
|
|
isUp,
|
|
|
|
uptimeSuccessCount,
|
|
|
|
totalUptimeCount,
|
|
|
|
)
|
|
|
|
|
|
|
|
updateFields.UptimeSuccessCount = dbx.Node_UptimeSuccessCount(uptimeSuccessCount)
|
|
|
|
updateFields.TotalUptimeCount = dbx.Node_TotalUptimeCount(totalUptimeCount)
|
|
|
|
updateFields.UptimeRatio = dbx.Node_UptimeRatio(uptimeRatio)
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
if isUp {
|
|
|
|
updateFields.LastContactSuccess = dbx.Node_LastContactSuccess(time.Now())
|
|
|
|
} else {
|
|
|
|
updateFields.LastContactFailure = dbx.Node_LastContactFailure(time.Now())
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
dbNode, err = tx.Update_Node_By_Id(ctx, dbx.Node_Id(nodeID.Bytes()), updateFields)
|
|
|
|
if err != nil {
|
2019-03-29 12:30:23 +00:00
|
|
|
return nil, Error.Wrap(errs.Combine(err, tx.Rollback()))
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
2019-04-08 18:52:53 +01:00
|
|
|
// TODO: Allegedly tx.Get_Node_By_Id and tx.Update_Node_By_Id should never return a nil value for dbNode,
|
|
|
|
// however we've seen from some crashes that it does. We need to track down the cause of these crashes
|
|
|
|
// but for now we're adding a nil check to prevent a panic.
|
|
|
|
if dbNode == nil {
|
2019-06-03 15:37:43 +01:00
|
|
|
return nil, Error.Wrap(errs.Combine(errs.New("unable to get node by ID: %v", nodeID), tx.Rollback()))
|
2019-04-08 18:52:53 +01:00
|
|
|
}
|
2019-03-25 22:25:09 +00:00
|
|
|
|
2019-04-08 18:52:53 +01:00
|
|
|
return getNodeStats(dbNode), Error.Wrap(tx.Commit())
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
func convertDBNode(ctx context.Context, info *dbx.Node) (_ *overlay.NodeDossier, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-01-15 16:08:45 +00:00
|
|
|
if info == nil {
|
|
|
|
return nil, Error.New("missing info")
|
|
|
|
}
|
|
|
|
|
2019-03-29 08:53:43 +00:00
|
|
|
id, err := storj.NodeIDFromBytes(info.Id)
|
2019-01-15 16:08:45 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2019-04-10 07:04:24 +01:00
|
|
|
ver := &version.SemVer{
|
|
|
|
Major: info.Major,
|
|
|
|
Minor: info.Minor,
|
|
|
|
Patch: info.Patch,
|
|
|
|
}
|
|
|
|
|
|
|
|
pbts, err := ptypes.TimestampProto(info.Timestamp)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2019-01-15 16:08:45 +00:00
|
|
|
|
2019-04-04 17:34:36 +01:00
|
|
|
node := &overlay.NodeDossier{
|
|
|
|
Node: pb.Node{
|
2019-05-22 21:06:27 +01:00
|
|
|
Id: id,
|
|
|
|
LastIp: info.LastIp,
|
2019-04-04 17:34:36 +01:00
|
|
|
Address: &pb.NodeAddress{
|
|
|
|
Address: info.Address,
|
|
|
|
Transport: pb.NodeTransport(info.Protocol),
|
|
|
|
},
|
2019-01-15 16:08:45 +00:00
|
|
|
},
|
2019-04-04 17:34:36 +01:00
|
|
|
Type: pb.NodeType(info.Type),
|
|
|
|
Operator: pb.NodeOperator{
|
2019-03-29 08:53:43 +00:00
|
|
|
Email: info.Email,
|
|
|
|
Wallet: info.Wallet,
|
2019-01-15 16:08:45 +00:00
|
|
|
},
|
2019-04-04 17:34:36 +01:00
|
|
|
Capacity: pb.NodeCapacity{
|
2019-01-15 16:08:45 +00:00
|
|
|
FreeBandwidth: info.FreeBandwidth,
|
|
|
|
FreeDisk: info.FreeDisk,
|
|
|
|
},
|
2019-04-04 17:34:36 +01:00
|
|
|
Reputation: overlay.NodeStats{
|
|
|
|
Latency90: info.Latency90,
|
2019-01-15 16:08:45 +00:00
|
|
|
AuditSuccessRatio: info.AuditSuccessRatio,
|
2019-03-29 08:53:43 +00:00
|
|
|
UptimeRatio: info.UptimeRatio,
|
|
|
|
AuditCount: info.TotalAuditCount,
|
2019-01-15 16:08:45 +00:00
|
|
|
AuditSuccessCount: info.AuditSuccessCount,
|
2019-03-29 08:53:43 +00:00
|
|
|
UptimeCount: info.TotalUptimeCount,
|
2019-01-15 16:08:45 +00:00
|
|
|
UptimeSuccessCount: info.UptimeSuccessCount,
|
2019-04-04 17:34:36 +01:00
|
|
|
LastContactSuccess: info.LastContactSuccess,
|
|
|
|
LastContactFailure: info.LastContactFailure,
|
2019-01-15 16:08:45 +00:00
|
|
|
},
|
2019-04-10 07:04:24 +01:00
|
|
|
Version: pb.NodeVersion{
|
|
|
|
Version: ver.String(),
|
|
|
|
CommitHash: info.Hash,
|
|
|
|
Timestamp: pbts,
|
|
|
|
Release: info.Release,
|
|
|
|
},
|
2019-05-30 22:38:23 +01:00
|
|
|
Contained: info.Contained,
|
|
|
|
Disqualified: info.Disqualified,
|
2019-01-15 16:08:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return node, nil
|
2018-12-17 20:14:16 +00:00
|
|
|
}
|
2019-03-25 22:25:09 +00:00
|
|
|
|
2019-04-08 18:52:53 +01:00
|
|
|
func getNodeStats(dbNode *dbx.Node) *overlay.NodeStats {
|
2019-03-25 22:25:09 +00:00
|
|
|
nodeStats := &overlay.NodeStats{
|
2019-04-04 17:34:36 +01:00
|
|
|
Latency90: dbNode.Latency90,
|
2019-03-25 22:25:09 +00:00
|
|
|
AuditSuccessRatio: dbNode.AuditSuccessRatio,
|
|
|
|
AuditSuccessCount: dbNode.AuditSuccessCount,
|
|
|
|
AuditCount: dbNode.TotalAuditCount,
|
|
|
|
UptimeRatio: dbNode.UptimeRatio,
|
|
|
|
UptimeSuccessCount: dbNode.UptimeSuccessCount,
|
|
|
|
UptimeCount: dbNode.TotalUptimeCount,
|
2019-04-04 17:34:36 +01:00
|
|
|
LastContactSuccess: dbNode.LastContactSuccess,
|
|
|
|
LastContactFailure: dbNode.LastContactFailure,
|
2019-03-25 22:25:09 +00:00
|
|
|
}
|
|
|
|
return nodeStats
|
|
|
|
}
|
|
|
|
|
|
|
|
func updateRatioVars(newStatus bool, successCount, totalCount int64) (int64, int64, float64) {
|
|
|
|
totalCount++
|
|
|
|
if newStatus {
|
|
|
|
successCount++
|
|
|
|
}
|
|
|
|
newRatio := float64(successCount) / float64(totalCount)
|
|
|
|
return successCount, totalCount, newRatio
|
|
|
|
}
|
|
|
|
|
2019-06-04 12:55:38 +01:00
|
|
|
func checkRatioVars(ctx context.Context, successCount, totalCount int64) (ratio float64, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-03-25 22:25:09 +00:00
|
|
|
if successCount < 0 {
|
|
|
|
return 0, errs.New("success count less than 0")
|
|
|
|
}
|
|
|
|
if totalCount < 0 {
|
|
|
|
return 0, errs.New("total count less than 0")
|
|
|
|
}
|
|
|
|
if successCount > totalCount {
|
|
|
|
return 0, errs.New("success count greater than total count")
|
|
|
|
}
|
|
|
|
if totalCount == 0 {
|
|
|
|
return 0, nil
|
|
|
|
}
|
|
|
|
ratio = float64(successCount) / float64(totalCount)
|
|
|
|
return ratio, nil
|
|
|
|
}
|