2019-01-24 20:15:10 +00:00
|
|
|
// Copyright (C) 2019 Storj Labs, Inc.
|
2019-01-14 18:47:22 +00:00
|
|
|
// See LICENSE for copying information.
|
|
|
|
|
|
|
|
package kademlia
|
|
|
|
|
|
|
|
import (
|
|
|
|
"context"
|
|
|
|
|
|
|
|
"storj.io/storj/pkg/identity"
|
|
|
|
"storj.io/storj/pkg/pb"
|
|
|
|
"storj.io/storj/pkg/storj"
|
|
|
|
)
|
|
|
|
|
|
|
|
// Inspector is a gRPC service for inspecting kademlia internals
|
|
|
|
type Inspector struct {
|
2019-02-06 12:37:17 +00:00
|
|
|
dht *Kademlia
|
2019-01-14 18:47:22 +00:00
|
|
|
identity *identity.FullIdentity
|
|
|
|
}
|
|
|
|
|
|
|
|
// NewInspector creates an Inspector
|
2019-02-06 12:37:17 +00:00
|
|
|
func NewInspector(kad *Kademlia, identity *identity.FullIdentity) *Inspector {
|
2019-01-14 18:47:22 +00:00
|
|
|
return &Inspector{
|
|
|
|
dht: kad,
|
|
|
|
identity: identity,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// CountNodes returns the number of nodes in the routing table
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) CountNodes(ctx context.Context, req *pb.CountNodesRequest) (_ *pb.CountNodesResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2019-01-14 18:47:22 +00:00
|
|
|
// TODO: this is definitely the wrong way to get this
|
2019-01-28 22:53:37 +00:00
|
|
|
kadNodes, err := srv.dht.FindNear(ctx, srv.identity.ID, 100000)
|
2019-01-14 18:47:22 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return &pb.CountNodesResponse{
|
|
|
|
Count: int64(len(kadNodes)),
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// GetBuckets returns all kademlia buckets for current kademlia instance
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) GetBuckets(ctx context.Context, req *pb.GetBucketsRequest) (_ *pb.GetBucketsResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-02-16 03:23:35 +00:00
|
|
|
b, err := srv.dht.GetBucketIds()
|
2019-01-14 18:47:22 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
// TODO(bryanchriswhite): should use bucketID type
|
|
|
|
nodeIDs, err := storj.NodeIDsFromBytes(b.ByteSlices())
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
return &pb.GetBucketsResponse{
|
|
|
|
Total: int64(len(b)),
|
|
|
|
// TODO(bryanchriswhite): should use bucketID type
|
|
|
|
Ids: nodeIDs,
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
2019-01-28 22:53:37 +00:00
|
|
|
// FindNear sends back limit of near nodes
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) FindNear(ctx context.Context, req *pb.FindNearRequest) (_ *pb.FindNearResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-01-28 22:53:37 +00:00
|
|
|
start := req.Start
|
|
|
|
limit := req.Limit
|
|
|
|
nodes, err := srv.dht.FindNear(ctx, start, int(limit))
|
2019-01-14 18:47:22 +00:00
|
|
|
if err != nil {
|
2019-01-28 22:53:37 +00:00
|
|
|
return &pb.FindNearResponse{}, err
|
2019-01-14 18:47:22 +00:00
|
|
|
}
|
2019-01-28 22:53:37 +00:00
|
|
|
return &pb.FindNearResponse{
|
2019-01-14 18:47:22 +00:00
|
|
|
Nodes: nodes,
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// PingNode sends a PING RPC to the provided node ID in the Kad network.
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) PingNode(ctx context.Context, req *pb.PingNodeRequest) (_ *pb.PingNodeResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
_, err = srv.dht.Ping(ctx, pb.Node{
|
2019-04-22 10:07:50 +01:00
|
|
|
Id: req.Id,
|
2019-01-14 18:47:22 +00:00
|
|
|
Address: &pb.NodeAddress{
|
|
|
|
Address: req.Address,
|
|
|
|
},
|
|
|
|
})
|
2019-02-06 12:37:17 +00:00
|
|
|
|
|
|
|
res := &pb.PingNodeResponse{Ok: err == nil}
|
2019-01-14 18:47:22 +00:00
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return res, Error.Wrap(err)
|
|
|
|
}
|
|
|
|
return res, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// LookupNode triggers a Kademlia lookup and returns the node the network found.
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) LookupNode(ctx context.Context, req *pb.LookupNodeRequest) (_ *pb.LookupNodeResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-01-14 18:47:22 +00:00
|
|
|
id, err := storj.NodeIDFromString(req.Id)
|
|
|
|
if err != nil {
|
|
|
|
return &pb.LookupNodeResponse{}, err
|
|
|
|
}
|
|
|
|
node, err := srv.dht.FindNode(ctx, id)
|
|
|
|
if err != nil {
|
|
|
|
return &pb.LookupNodeResponse{}, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return &pb.LookupNodeResponse{
|
|
|
|
Node: &node,
|
|
|
|
}, nil
|
|
|
|
}
|
2019-02-25 18:41:51 +00:00
|
|
|
|
2019-02-28 19:55:27 +00:00
|
|
|
// DumpNodes returns all of the nodes in the routing table database.
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) DumpNodes(ctx context.Context, req *pb.DumpNodesRequest) (_ *pb.DumpNodesResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-02-28 19:55:27 +00:00
|
|
|
nodes, err := srv.dht.DumpNodes(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return &pb.DumpNodesResponse{
|
|
|
|
Nodes: nodes,
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
2019-02-25 18:41:51 +00:00
|
|
|
// NodeInfo sends a PING RPC to a node and returns its local info.
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) NodeInfo(ctx context.Context, req *pb.NodeInfoRequest) (_ *pb.NodeInfoResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-03-02 07:34:08 +00:00
|
|
|
info, err := srv.dht.FetchInfo(ctx, pb.Node{
|
|
|
|
Id: req.Id,
|
|
|
|
Address: req.Address,
|
|
|
|
})
|
2019-02-25 18:41:51 +00:00
|
|
|
if err != nil {
|
|
|
|
return &pb.NodeInfoResponse{}, err
|
|
|
|
}
|
|
|
|
return &pb.NodeInfoResponse{
|
|
|
|
Type: info.GetType(),
|
|
|
|
Operator: info.GetOperator(),
|
|
|
|
Capacity: info.GetCapacity(),
|
2019-04-10 07:04:24 +01:00
|
|
|
Version: info.GetVersion(),
|
2019-02-25 18:41:51 +00:00
|
|
|
}, nil
|
|
|
|
}
|
2019-04-22 09:34:11 +01:00
|
|
|
|
|
|
|
// GetBucketList returns the list of buckets with their routing nodes and their cached nodes
|
2019-06-04 12:36:27 +01:00
|
|
|
func (srv *Inspector) GetBucketList(ctx context.Context, req *pb.GetBucketListRequest) (_ *pb.GetBucketListResponse, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-04-22 09:34:11 +01:00
|
|
|
bucketIds, err := srv.dht.GetBucketIds()
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
buckets := make([]*pb.GetBucketListResponse_Bucket, len(bucketIds))
|
|
|
|
|
|
|
|
for i, b := range bucketIds {
|
|
|
|
bucketID := keyToBucketID(b)
|
|
|
|
routingNodes, err := srv.dht.GetNodesWithinKBucket(bucketID)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
cachedNodes := srv.dht.GetCachedNodesWithinKBucket(bucketID)
|
|
|
|
buckets[i] = &pb.GetBucketListResponse_Bucket{
|
|
|
|
BucketId: keyToBucketID(b),
|
|
|
|
RoutingNodes: routingNodes,
|
|
|
|
CachedNodes: cachedNodes,
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
return &pb.GetBucketListResponse{
|
|
|
|
Buckets: buckets,
|
|
|
|
}, nil
|
|
|
|
}
|