2 NNCP -- Node to Node copy, utilities for store-and-forward data exchange
3 Copyright (C) 2016-2018 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, either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
19 // Show queued NNCP Rx/Tx stats.
30 "github.com/dustin/go-humanize"
34 fmt.Fprintf(os.Stderr, nncp.UsageHeader())
35 fmt.Fprintf(os.Stderr, "nncp-stat -- show queued Rx/Tx stats\n\n")
36 fmt.Fprintf(os.Stderr, "Usage: %s [options]\nOptions:\n", os.Args[0])
42 cfgPath = flag.String("cfg", nncp.DefaultCfgPath, "Path to configuration file")
43 nodeRaw = flag.String("node", "", "Process only that node")
44 spoolPath = flag.String("spool", "", "Override path to spool")
45 debug = flag.Bool("debug", false, "Print debug messages")
46 version = flag.Bool("version", false, "Print version information")
47 warranty = flag.Bool("warranty", false, "Print warranty information")
52 fmt.Println(nncp.Warranty)
56 fmt.Println(nncp.VersionGet())
60 ctx, err := nncp.CtxFromCmdline(*cfgPath, *spoolPath, "", false, *debug)
62 log.Fatalln("Error during initialization:", err)
65 var nodeOnly *nncp.Node
67 nodeOnly, err = ctx.FindNode(*nodeRaw)
69 log.Fatalln("Invalid -node specified:", err)
73 nodeNames := make([]string, 0, len(ctx.Neigh))
74 nodeNameToNode := make(map[string]*nncp.Node, len(ctx.Neigh))
75 for _, node := range ctx.Neigh {
76 nodeNames = append(nodeNames, node.Name)
77 nodeNameToNode[node.Name] = node
79 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])),