route_bsd.go 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224
  1. // Copyright 2011 The Go Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style
  3. // license that can be found in the LICENSE file.
  4. // +build darwin dragonfly freebsd netbsd openbsd
  5. // Routing sockets and messages
  6. package unix
  7. import "unsafe"
  8. // Round the length of a raw sockaddr up to align it properly.
  9. func rsaAlignOf(salen int) int {
  10. salign := sizeofPtr
  11. // NOTE: It seems like 64-bit Darwin kernel still requires
  12. // 32-bit aligned access to BSD subsystem. Also NetBSD 6
  13. // kernel and beyond require 64-bit aligned access to routing
  14. // facilities.
  15. if darwin64Bit {
  16. salign = 4
  17. } else if netbsd32Bit {
  18. salign = 8
  19. }
  20. if salen == 0 {
  21. return salign
  22. }
  23. return (salen + salign - 1) & ^(salign - 1)
  24. }
  25. // RouteRIB returns routing information base, as known as RIB,
  26. // which consists of network facility information, states and
  27. // parameters.
  28. func RouteRIB(facility, param int) ([]byte, error) {
  29. mib := []_C_int{CTL_NET, AF_ROUTE, 0, 0, _C_int(facility), _C_int(param)}
  30. // Find size.
  31. n := uintptr(0)
  32. if err := sysctl(mib, nil, &n, nil, 0); err != nil {
  33. return nil, err
  34. }
  35. if n == 0 {
  36. return nil, nil
  37. }
  38. tab := make([]byte, n)
  39. if err := sysctl(mib, &tab[0], &n, nil, 0); err != nil {
  40. return nil, err
  41. }
  42. return tab[:n], nil
  43. }
  44. // RoutingMessage represents a routing message.
  45. type RoutingMessage interface {
  46. sockaddr() []Sockaddr
  47. }
  48. const anyMessageLen = int(unsafe.Sizeof(anyMessage{}))
  49. type anyMessage struct {
  50. Msglen uint16
  51. Version uint8
  52. Type uint8
  53. }
  54. // RouteMessage represents a routing message containing routing
  55. // entries.
  56. type RouteMessage struct {
  57. Header RtMsghdr
  58. Data []byte
  59. }
  60. const rtaRtMask = RTA_DST | RTA_GATEWAY | RTA_NETMASK | RTA_GENMASK
  61. func (m *RouteMessage) sockaddr() []Sockaddr {
  62. var (
  63. af int
  64. sas [4]Sockaddr
  65. )
  66. b := m.Data[:]
  67. for i := uint(0); i < RTAX_MAX; i++ {
  68. if m.Header.Addrs&rtaRtMask&(1<<i) == 0 {
  69. continue
  70. }
  71. rsa := (*RawSockaddr)(unsafe.Pointer(&b[0]))
  72. switch i {
  73. case RTAX_DST, RTAX_GATEWAY:
  74. sa, err := anyToSockaddr((*RawSockaddrAny)(unsafe.Pointer(rsa)))
  75. if err != nil {
  76. return nil
  77. }
  78. if i == RTAX_DST {
  79. af = int(rsa.Family)
  80. }
  81. sas[i] = sa
  82. case RTAX_NETMASK, RTAX_GENMASK:
  83. switch af {
  84. case AF_INET:
  85. rsa4 := (*RawSockaddrInet4)(unsafe.Pointer(&b[0]))
  86. sa := new(SockaddrInet4)
  87. for j := 0; rsa4.Len > 0 && j < int(rsa4.Len)-int(unsafe.Offsetof(rsa4.Addr)); j++ {
  88. sa.Addr[j] = rsa4.Addr[j]
  89. }
  90. sas[i] = sa
  91. case AF_INET6:
  92. rsa6 := (*RawSockaddrInet6)(unsafe.Pointer(&b[0]))
  93. sa := new(SockaddrInet6)
  94. for j := 0; rsa6.Len > 0 && j < int(rsa6.Len)-int(unsafe.Offsetof(rsa6.Addr)); j++ {
  95. sa.Addr[j] = rsa6.Addr[j]
  96. }
  97. sas[i] = sa
  98. }
  99. }
  100. b = b[rsaAlignOf(int(rsa.Len)):]
  101. }
  102. return sas[:]
  103. }
  104. // InterfaceMessage represents a routing message containing
  105. // network interface entries.
  106. type InterfaceMessage struct {
  107. Header IfMsghdr
  108. Data []byte
  109. }
  110. func (m *InterfaceMessage) sockaddr() (sas []Sockaddr) {
  111. if m.Header.Addrs&RTA_IFP == 0 {
  112. return nil
  113. }
  114. sa, err := anyToSockaddr((*RawSockaddrAny)(unsafe.Pointer(&m.Data[0])))
  115. if err != nil {
  116. return nil
  117. }
  118. return append(sas, sa)
  119. }
  120. // InterfaceAddrMessage represents a routing message containing
  121. // network interface address entries.
  122. type InterfaceAddrMessage struct {
  123. Header IfaMsghdr
  124. Data []byte
  125. }
  126. const rtaIfaMask = RTA_IFA | RTA_NETMASK | RTA_BRD
  127. func (m *InterfaceAddrMessage) sockaddr() (sas []Sockaddr) {
  128. if m.Header.Addrs&rtaIfaMask == 0 {
  129. return nil
  130. }
  131. b := m.Data[:]
  132. // We still see AF_UNSPEC in socket addresses on some
  133. // platforms. To identify each address family correctly, we
  134. // will use the address family of RTAX_NETMASK as a preferred
  135. // one on the 32-bit NetBSD kernel, also use the length of
  136. // RTAX_NETMASK socket address on the FreeBSD kernel.
  137. preferredFamily := uint8(AF_UNSPEC)
  138. for i := uint(0); i < RTAX_MAX; i++ {
  139. if m.Header.Addrs&rtaIfaMask&(1<<i) == 0 {
  140. continue
  141. }
  142. rsa := (*RawSockaddr)(unsafe.Pointer(&b[0]))
  143. switch i {
  144. case RTAX_IFA:
  145. if rsa.Family == AF_UNSPEC {
  146. rsa.Family = preferredFamily
  147. }
  148. sa, err := anyToSockaddr((*RawSockaddrAny)(unsafe.Pointer(rsa)))
  149. if err != nil {
  150. return nil
  151. }
  152. sas = append(sas, sa)
  153. case RTAX_NETMASK:
  154. switch rsa.Family {
  155. case AF_UNSPEC:
  156. switch rsa.Len {
  157. case SizeofSockaddrInet4:
  158. rsa.Family = AF_INET
  159. case SizeofSockaddrInet6:
  160. rsa.Family = AF_INET6
  161. default:
  162. rsa.Family = AF_INET // an old fashion, AF_UNSPEC means AF_INET
  163. }
  164. case AF_INET, AF_INET6:
  165. preferredFamily = rsa.Family
  166. default:
  167. return nil
  168. }
  169. sa, err := anyToSockaddr((*RawSockaddrAny)(unsafe.Pointer(rsa)))
  170. if err != nil {
  171. return nil
  172. }
  173. sas = append(sas, sa)
  174. case RTAX_BRD:
  175. // nothing to do
  176. }
  177. b = b[rsaAlignOf(int(rsa.Len)):]
  178. }
  179. return sas
  180. }
  181. // ParseRoutingMessage parses b as routing messages and returns the
  182. // slice containing the RoutingMessage interfaces.
  183. func ParseRoutingMessage(b []byte) (msgs []RoutingMessage, err error) {
  184. msgCount := 0
  185. for len(b) >= anyMessageLen {
  186. msgCount++
  187. any := (*anyMessage)(unsafe.Pointer(&b[0]))
  188. if any.Version != RTM_VERSION {
  189. b = b[any.Msglen:]
  190. continue
  191. }
  192. msgs = append(msgs, any.toRoutingMessage(b))
  193. b = b[any.Msglen:]
  194. }
  195. // We failed to parse any of the messages - version mismatch?
  196. if msgCount > 0 && len(msgs) == 0 {
  197. return nil, EINVAL
  198. }
  199. return msgs, nil
  200. }
  201. // ParseRoutingMessage parses msg's payload as raw sockaddrs and
  202. // returns the slice containing the Sockaddr interfaces.
  203. func ParseRoutingSockaddr(msg RoutingMessage) (sas []Sockaddr, err error) {
  204. return append(sas, msg.sockaddr()...), nil
  205. }