prysm-pulse/beacon-chain/rpc/debug/forkchoice.go
Preston Van Loon 7cc32c4dda
Various code inspection resolutions (#7438)
* remove unused code

* remove defer use in loop

* Remove unused methods and constants

* gofmt and gaz

* nilness check

* remove unused args

* Add TODO for refactoring subscribeWithBase to remove unused arg. It seems too involved to include in this sweeping PR. https://github.com/prysmaticlabs/prysm/issues/7437

* replace empty slice declaration

* Remove unnecessary type conversions

* remove redundant type declaration

* rename receivers to be consistent

* Remove bootnode query tool. It is now obsolete by discv5

* Remove relay node. It is no longer used or supported

* Revert "Remove relay node. It is no longer used or supported"

This reverts commit 4bd7717334dad85ef4766ed9bc4da711fb5fa810.

* Delete unused test directory

* Delete unsupported gcp startup script

* Delete old k8s script

* build fixes

* fix build

* go mod tidy

* revert slasher/db/kv/block_header.go

* fix build

* remove redundant nil check

* combine func args

Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com>
Co-authored-by: Victor Farazdagi <simple.square@gmail.com>
2020-10-12 08:11:05 +00:00

45 lines
1.3 KiB
Go

package debug
import (
"context"
"encoding/hex"
ptypes "github.com/gogo/protobuf/types"
pbrpc "github.com/prysmaticlabs/prysm/proto/beacon/rpc/v1"
)
// GetProtoArrayForkChoice returns proto array fork choice store.
func (ds *Server) GetProtoArrayForkChoice(_ context.Context, _ *ptypes.Empty) (*pbrpc.ProtoArrayForkChoiceResponse, error) {
store := ds.HeadFetcher.ProtoArrayStore()
nodes := store.Nodes()
returnedNodes := make([]*pbrpc.ProtoArrayNode, len(nodes))
for i := 0; i < len(returnedNodes); i++ {
r := nodes[i].Root()
returnedNodes[i] = &pbrpc.ProtoArrayNode{
Slot: nodes[i].Slot(),
Root: r[:],
Parent: nodes[i].Parent(),
JustifiedEpoch: nodes[i].JustifiedEpoch(),
FinalizedEpoch: nodes[i].FinalizedEpoch(),
Weight: nodes[i].Weight(),
BestChild: nodes[i].BestChild(),
BestDescendant: nodes[i].BestDescendant(),
}
}
indices := make(map[string]uint64, len(store.NodesIndices()))
for k, v := range store.NodesIndices() {
indices[hex.EncodeToString(k[:])] = v
}
return &pbrpc.ProtoArrayForkChoiceResponse{
PruneThreshold: store.PruneThreshold(),
JustifiedEpoch: store.JustifiedEpoch(),
FinalizedEpoch: store.FinalizedEpoch(),
ProtoArrayNodes: returnedNodes,
Indices: indices,
}, nil
}