-
Notifications
You must be signed in to change notification settings - Fork 16
/
peers.go
165 lines (151 loc) · 4.43 KB
/
peers.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
/*
* You may redistribute this program and/or modify it under the terms of
* the GNU General Public License as published by the Free Software Foundation,
* either version 3 of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package main
import (
"fmt"
"github.com/inhies/go-cjdns/admin"
)
//TODO(inhies): These functions now live in go-cjdns/cjdns, lets use them
// Log base 2 of a uint64
func log2x64(number admin.Path) uint {
var out uint = 0
for number != 0 {
number = number >> 1
out++
}
return out
}
// return true if packets destine for destination go through midPath.
func isBehind(destination, midPath admin.Path) bool {
if midPath > destination {
return false
}
mask := ^uint64(0) >> (64 - log2x64(midPath))
return (uint64(destination) & mask) == (uint64(midPath) & mask)
}
// Return true if destination is 1 hop away from midPath
// WARNING: this depends on implementation quirks of the router and will be broken in the future.
// NOTE: This may have false positives which isBehind() will remove.
func isOneHop(destination, midPath admin.Path) bool {
if !isBehind(destination, midPath) {
return false
}
// The "why" is here:
// http://gitboria.com/cjd/cjdns/tree/master/switch/NumberCompress.h#L143
c := destination >> log2x64(midPath)
if c&1 != 0 {
return log2x64(c) == 4
}
if c&3 != 0 {
return log2x64(c) == 7
}
return log2x64(c) == 10
}
/**
* Print the peers of a node.
* @param user the admin connection
* @param target the node to get peers for, if it is the switch label 0000.0000.0000.0001
* then this node's peers will be gotten.
*/
func doPeers(user *admin.Conn, target Target) {
table, err := user.NodeStore_dumpTable()
if err != nil {
fmt.Println(err)
return
}
usingPath := false
var tText string
if validIP(target.Supplied) {
hostname, _ := resolveIP(target.Target)
if hostname != "" {
tText = target.Supplied + " (" + hostname + ")"
} else {
tText = target.Supplied
}
// If we were given a path, resolve the IP
} else if validPath(target.Supplied) {
usingPath = true
tText = target.Supplied
//table := getTable(globalData.User)
for _, v := range table {
if v.Path.String() == target.Supplied {
// We have the IP now
tText = target.Supplied + " (" + v.IP.String() + ")"
// Try to get the hostname
hostname, _ := resolveIP(v.IP.String())
if hostname != "" {
tText = target.Supplied + " (" + v.IP.String() + " (" + hostname + "))"
}
}
}
// We were given a hostname, everything is already done for us!
} else if validHost(target.Supplied) {
tText = target.Supplied + " (" + target.Target + ")"
}
fmt.Println("Finding all direct peers of", tText)
var output admin.Routes
for _, node := range table {
if usingPath && node.Path.String() != target.Supplied {
continue
} else if !usingPath && node.IP.String() != target.Target {
continue
}
for _, nodeB := range table {
if isOneHop(*node.Path, *nodeB.Path) || isOneHop(*nodeB.Path, *node.Path) {
for i, existing := range output {
if existing.IP == nodeB.IP {
if *existing.Path > *nodeB.Path {
table[i] = nodeB
}
goto alreadyExists
}
}
output = append(output, nodeB)
alreadyExists:
}
}
}
for _, node := range output {
hostname, _ := resolveIP(node.IP.String())
tText := node.IP.String()
if hostname != "" {
tText += " (" + hostname + ")"
} else {
tText += "\t"
}
tText += "\t\t\t\t"
for i := 40; i < len(tText) && i < 80; i += 16 {
tText = tText[0 : len(tText)-2]
}
fmt.Printf("IP: %v -- Path: %s -- Link: %.0f\n", tText, node.Path, node.Link)
}
}
func doOwnPeers(user *admin.Conn) {
peers, err := user.InterfaceController_peerStats()
if err != nil {
fmt.Println(err)
return
}
for _, node := range peers {
key := node.PublicKey
hostname, _ := resolveIP(key.IP().String())
tText := key.IP().String()
if hostname != "" {
tText += " (" + hostname + ")"
} else {
tText += " "
}
fmt.Printf("Incoming: %t | IP: %s -- Path: %s\n", node.IsIncoming, tText, node.SwitchLabel) //, node., node.Link)
}
}