2 NNCP -- Node to Node copy, utilities for store-and-forward data exchange
3 Copyright (C) 2016-2019 Sergey Matveev <stargrave@stargrave.org>
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, version 3 of the License.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>.
18 // Show queued NNCP Rx/Tx stats.
28 "github.com/dustin/go-humanize"
29 "go.cypherpunks.ru/nncp/v5"
33 fmt.Fprintf(os.Stderr, nncp.UsageHeader())
34 fmt.Fprintf(os.Stderr, "nncp-stat -- show queued Rx/Tx stats\n\n")
35 fmt.Fprintf(os.Stderr, "Usage: %s [options]\nOptions:\n", os.Args[0])
41 cfgPath = flag.String("cfg", nncp.DefaultCfgPath, "Path to configuration file")
42 nodeRaw = flag.String("node", "", "Process only that node")
43 spoolPath = flag.String("spool", "", "Override path to spool")
44 debug = flag.Bool("debug", false, "Print debug messages")
45 version = flag.Bool("version", false, "Print version information")
46 warranty = flag.Bool("warranty", false, "Print warranty information")
51 fmt.Println(nncp.Warranty)
55 fmt.Println(nncp.VersionGet())
59 ctx, err := nncp.CtxFromCmdline(*cfgPath, *spoolPath, "", false, *debug)
61 log.Fatalln("Error during initialization:", err)
64 var nodeOnly *nncp.Node
66 nodeOnly, err = ctx.FindNode(*nodeRaw)
68 log.Fatalln("Invalid -node specified:", err)
72 nodeNames := make([]string, 0, len(ctx.Neigh))
73 nodeNameToNode := make(map[string]*nncp.Node, len(ctx.Neigh))
74 for _, node := range ctx.Neigh {
75 nodeNames = append(nodeNames, node.Name)
76 nodeNameToNode[node.Name] = node
78 sort.Strings(nodeNames)
82 for _, nodeName := range nodeNames {
83 node = nodeNameToNode[nodeName]
84 if nodeOnly != nil && *node.Id != *nodeOnly.Id {
87 rxNums := make(map[uint8]int)
88 rxBytes := make(map[uint8]int64)
89 for job := range ctx.Jobs(node.Id, nncp.TRx) {
91 rxNums[job.PktEnc.Nice] = rxNums[job.PktEnc.Nice] + 1
92 rxBytes[job.PktEnc.Nice] = rxBytes[job.PktEnc.Nice] + job.Size
94 txNums := make(map[uint8]int)
95 txBytes := make(map[uint8]int64)
96 for job := range ctx.Jobs(node.Id, nncp.TTx) {
98 txNums[job.PktEnc.Nice] = txNums[job.PktEnc.Nice] + 1
99 txBytes[job.PktEnc.Nice] = txBytes[job.PktEnc.Nice] + job.Size
101 fmt.Println(node.Name)
103 for nice = 1; nice > 0; nice++ {
104 rxNum, rxExists := rxNums[nice]
105 txNum, txExists := txNums[nice]
106 if !(rxExists || txExists) {
110 "\tnice:% 4s | Rx: % 10s, % 3d pkts | Tx: % 10s, % 3d pkts\n",
111 nncp.NicenessFmt(nice),
112 humanize.IBytes(uint64(rxBytes[nice])),
114 humanize.IBytes(uint64(txBytes[nice])),