forked from alexbeltran/gobacnet
-
Notifications
You must be signed in to change notification settings - Fork 0
/
whois.go
144 lines (122 loc) · 3.92 KB
/
whois.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
/*Copyright (C) 2017 Alex Beltran
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
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, write to:
The Free Software Foundation, Inc.
59 Temple Place - Suite 330
Boston, MA 02111-1307, USA.
As a special exception, if other files instantiate templates or
use macros or inline functions from this file, or you compile
this file and link it with other works to produce a work based
on this file, this file does not by itself cause the resulting
work to be covered by the GNU General Public License. However
the source code for this file must still be made available in
accordance with section (3) of the GNU General Public License.
This exception does not invalidate any other reasons why a work
based on this file might be covered by the GNU General Public
License.
*/
package gobacnet
import (
"net"
"github.com/alexbeltran/gobacnet/encoding"
"github.com/alexbeltran/gobacnet/types"
)
// WhoIs finds all devices with ids between the provided low and high values.
// Use constant ArrayAll for both fields to scan the entire network at once.
// Using ArrayAll is highly discouraged for most networks since it can lead
// to a high congested network.
func (c *Client) WhoIs(low, high int) ([]types.Device, error) {
dest := types.UDPToAddress(&net.UDPAddr{
IP: c.broadcastAddress,
Port: DefaultPort,
})
dest.SetBroadcast(true)
return c.internalWhoIs(dest, low, high)
}
// WhoIsDirected sends an unbounded WhoIs to a single IP address.
func (c *Client) WhoIsDirected(addr net.IP, port int) ([]types.Device, error) {
if port == 0 {
port = DefaultPort
}
dest := types.UDPToAddress(&net.UDPAddr{
IP: addr,
Port: port,
})
dest.SetBroadcast(false)
// Unbounded whois, to a single IP
return c.internalWhoIs(dest, ArrayAll, ArrayAll)
}
func (c *Client) internalWhoIs(dest types.Address, low, high int) ([]types.Device, error) {
src, _ := c.localAddress()
enc := encoding.NewEncoder()
npdu := types.NPDU{
Version: types.ProtocolVersion,
Destination: &dest,
Source: &src,
IsNetworkLayerMessage: false,
// We are not expecting a direct reply from a single destination
ExpectingReply: false,
Priority: types.Normal,
HopCount: types.DefaultHopCount,
}
enc.NPDU(npdu)
err := enc.WhoIs(int32(low), int32(high))
if err != nil {
return nil, err
}
// Subscribe to any changes in the the range. If it is a broadcast,
var start, end int
if low == -1 || high == -1 {
start = 0
end = maxInt
} else {
start = low
end = high
}
// Run in parallel
errChan := make(chan error)
go func() {
_, err = c.send(dest, enc.Bytes())
errChan <- err
}()
values, err := c.utsm.Subscribe(start, end)
if err != nil {
return nil, err
}
err = <-errChan
if err != nil {
return nil, err
}
// Weed out values that are not important such as non object type
// and that are not
uniqueMap := make(map[types.ObjectInstance]types.Device)
uniqueList := make([]types.Device, len(uniqueMap))
for _, v := range values {
r, ok := v.(types.IAm)
// Skip non I AM responses
if !ok {
continue
}
// Check to see if we are in the map before inserting
if _, ok := uniqueMap[r.ID.Instance]; !ok {
dev := types.Device{
Addr: r.Addr,
ID: r.ID,
MaxApdu: r.MaxApdu,
Segmentation: r.Segmentation,
Vendor: r.Vendor,
}
uniqueMap[r.ID.Instance] = types.Device(dev)
uniqueList = append(uniqueList, dev)
}
}
return uniqueList, err
}