aboutsummaryrefslogtreecommitdiff
path: root/dht.go
blob: 30467dec4ac2fc1472a0af38d70a9fe1e4b614ae (plain)
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
package main

import (
	"fmt"
	"net"
	"strconv"
	"time"
)

var (
	routers = []string{
		"router.bittorrent.com:6881",
		"dht.transmissionbt.com:6881",
		"router.utorrent.com:6881",
	}
)

type DHTNode struct {
	id           string
	address      string
	port         int
	conn         *net.UDPConn
	tid          uint32
	kTable       kTable
	peerChan     chan<- peer
	packetsIn    chan packet
	packetsOut   chan packet
	workerTokens chan struct{}
}

// Unprocessed packet from socket
type packet struct {
	b     []byte
	raddr net.UDPAddr
}

func newDHTNode(address string, port int, p chan<- peer) (node *DHTNode) {
	node = &DHTNode{
		address:      address,
		port:         port,
		workerTokens: make(chan struct{}, Config.Advanced.MaxDhtWorkers),
		peerChan:     p,
	}

	// Get random id for this node
	node.id = genInfoHash()
	node.kTable = newKTable(node.id)
	return
}

func (d *DHTNode) run(done <-chan struct{}) error {
	listener, err := net.ListenPacket("udp4", d.address+":"+strconv.Itoa(d.port))
	if err != nil {
		fmt.Printf("Failed to listen: %s\n", err)
		return err
	}
	d.conn = listener.(*net.UDPConn)
	d.port = d.conn.LocalAddr().(*net.UDPAddr).Port

	if Config.Debug {
		fmt.Printf("We are node %x\n", d.id)
		fmt.Printf("Listening at %s:%d\n", d.address, d.port)
	}

	// Packets off the network
	d.packetsIn = make(chan packet)
	d.packetsOut = make(chan packet)

	// Create a slab for allocation
	// Adjust number to suit contention
	byteSlab := newSlab(8192, Config.Advanced.SlabAllocations)

	// Start reading packets from conn into channel
	go func() {
		for {
			b := byteSlab.Alloc()
			c, addr, err := d.conn.ReadFromUDP(b)
			if err != nil {
				fmt.Println("UDP read error", err)
				continue
			}
			dhtBytesIn.Add(int64(c))
			dhtPacketsIn.Add(1)
			// Chop
			b = b[0:c]
			d.packetsIn <- packet{b, *addr}
			byteSlab.Free(b)
		}
	}()

	// Start writing packets from channel to conn
	go func() {
		var p packet
		for {
			select {
			case p = <-d.packetsOut:
				d.conn.SetWriteDeadline(time.Now().Add(time.Second * time.Duration(Config.Advanced.UdpTimeout)))
				b, err := d.conn.WriteToUDP(p.b, &p.raddr)
				if err != nil {
					dhtErrorPackets.Add(1)
					// TODO remove from kTAble
					if Config.Debug {
						fmt.Printf("Error writing packet %s\n", err)
					}
				} else {
					dhtPacketsOut.Add(1)
				}
				dhtBytesOut.Add(int64(b))
			}
		}
	}()

	// TODO configurable
	ticker := time.Tick(5 * time.Second)

	// Read and process packets from incoming channel
	var p packet
	go func() {
		defer d.conn.Close()
		for {
			select {
			case <-done:
				fmt.Println("Stopping")
				return
			case p = <-d.packetsIn:
				d.processPacket(p)
			case <-ticker:
				if btWorkers.Value() < 2 {
					go d.makeNeighbours()
				}
			}
		}
	}()
	return nil
}

func (d *DHTNode) bootstrap() {
	if Config.Debug {
		fmt.Println("Bootstrapping")
	}
	for _, s := range routers {
		addr, err := net.ResolveUDPAddr("udp4", s)
		if err != nil {
			fmt.Printf("Error parsing bootstrap address: %s\n", err)
			return
		}
		rn := newRemoteNode(*addr, "")
		d.findNode(rn, "")
	}
}

func (d *DHTNode) makeNeighbours() {
	// TODO configurable
	if !d.kTable.isFull() {
		if Config.Debug {
			fmt.Println("Making neighbours")
		}
		if d.kTable.isEmpty() {
			d.bootstrap()
		} else {
			for _, rn := range d.kTable.getNodes() {
				d.findNode(rn, rn.id)
			}
			d.kTable.refresh()
		}
	}
}

func (d DHTNode) findNode(rn *remoteNode, target string) {
	var id string
	if target == "" {
		id = d.id
	} else {
		id = genNeighbour(d.id, target)
	}
	// fmt.Printf("Sending find_node msg id:%x target:%x addr:%s\n", id, target, rn.address)
	d.sendQuery(rn, "find_node", map[string]interface{}{
		"id":     id,
		"target": genInfoHash(),
	})
}

// ping sends ping query to the chan.
func (d *DHTNode) ping(rn *remoteNode) {
	d.sendQuery(rn, "ping", map[string]interface{}{
		"id": genNeighbour(d.id, rn.id),
	})
}

// Process another node's response to a find_node query.
func (d *DHTNode) processFindNodeResults(rn *remoteNode, nodeList string) {
	nodeLength := 26
	/*
		if d.config.proto == "udp6" {
			nodeList = m.R.Nodes6
			nodeLength = 38
		} else {
			nodeList = m.R.Nodes
		}

		// Not much to do
		if nodeList == "" {
			return
		}
	*/

	if len(nodeList)%nodeLength != 0 {
		fmt.Printf("Node list is wrong length, got %d\n", len(nodeList))
		return
	}

	// We got a byte array in groups of 26 or 38
	var count int = 0
	for i := 0; i < len(nodeList); i += nodeLength {
		id := nodeList[i : i+ihLength]
		addr := compactNodeInfoToString(nodeList[i+ihLength : i+nodeLength])
		//fmt.Printf("Node list entry %s @ %s\n", id, addr)

		//fmt.Printf("find_node response id len:%d address:%s\n", len(id), addr)

		if d.id == id {
			if Config.Debug {
				fmt.Println("find_nodes ignoring self")
			}
			continue
		}

		address, err := net.ResolveUDPAddr("udp4", addr)
		if err != nil {
			fmt.Printf("Error parsing node from find_find response: %s\n", err)
			continue
		}
		// Check IP and ports are valid and not self
		if (address.IP.String() == d.address &&
			address.Port == d.port) ||
			id == d.id || id == "" {
			fmt.Println("Trying to add invalid node")
			continue
		}
		rn := newRemoteNode(*address, id)
		d.kTable.add(rn)
		count = count + 1
		// TODO check size of kTable
	}
}