1.\" $NetBSD: route.4,v 1.32 2018/07/01 22:27:43 christos Exp $ 2.\" 3.\" Copyright (c) 1990, 1991, 1993 4.\" The Regents of the University of California. All rights reserved. 5.\" 6.\" Redistribution and use in source and binary forms, with or without 7.\" modification, are permitted provided that the following conditions 8.\" are met: 9.\" 1. Redistributions of source code must retain the above copyright 10.\" notice, this list of conditions and the following disclaimer. 11.\" 2. Redistributions in binary form must reproduce the above copyright 12.\" notice, this list of conditions and the following disclaimer in the 13.\" documentation and/or other materials provided with the distribution. 14.\" 3. Neither the name of the University nor the names of its contributors 15.\" may be used to endorse or promote products derived from this software 16.\" without specific prior written permission. 17.\" 18.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 19.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 22.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28.\" SUCH DAMAGE. 29.\" 30.\" @(#)route.4 8.6 (Berkeley) 4/19/94 31.\" 32.Dd July 11, 2018 33.Dt ROUTE 4 34.Os 35.Sh NAME 36.Nm route 37.Nd kernel packet forwarding database 38.Sh SYNOPSIS 39.In sys/socket.h 40.In net/if.h 41.In net/route.h 42.Ft int 43.Fn socket PF_ROUTE SOCK_RAW "int family" 44.Sh DESCRIPTION 45.Ux 46provides some packet routing facilities. 47The kernel maintains a routing information database, which 48is used in selecting the appropriate network interface when 49transmitting packets. 50.Pp 51A user process (or possibly multiple co-operating processes) 52maintains this database by sending messages over a special kind 53of socket. 54This supplants fixed size 55.Xr ioctl 2 Ns 's 56used in earlier releases. 57Routing table changes may only be carried out by the super user. 58.Pp 59The operating system may spontaneously emit routing messages in response 60to external events, such as receipt of a redirect, or failure to 61locate a suitable route for a request. 62The message types are described in greater detail below. 63.Pp 64Routing database entries come in two flavors: for a specific 65host, or for all hosts on a generic subnetwork (as specified 66by a bit mask and value under the mask. 67The effect of wildcard or default route may be achieved by using 68a mask of all zeros, and there may be hierarchical routes. 69.Pp 70When the system is booted and addresses are assigned 71to the network interfaces, each protocol family 72installs a routing table entry for each interface when it is ready for traffic. 73Normally the protocol specifies the route 74through each interface as a 75.Dq direct 76connection to the destination host 77or network. 78If the route is direct, the transport layer of a protocol family 79usually requests the packet be sent to the same host specified in 80the packet. 81Otherwise, the interface is requested to address the packet to the 82gateway listed in the routing entry (i.e. the packet is forwarded). 83.Pp 84When routing a packet, 85the kernel will attempt to find 86the most specific route matching the destination. 87(If there are two different mask and value-under-the-mask pairs 88that match, the more specific is the one with more bits in the mask. 89A route to a host is regarded as being supplied with a mask of 90as many ones as there are bits in the destination). 91If no entry is found, the destination is declared to be unreachable, 92and a routing\-miss message is generated if there are any 93listeners on the routing control socket described below. 94.Pp 95A wildcard routing entry is specified with a zero 96destination address value, and a mask of all zeroes. 97Wildcard routes will be used 98when the system fails to find other routes matching the 99destination. 100The combination of wildcard routes and routing redirects can provide 101an economical mechanism for routing traffic. 102.Pp 103One opens the channel for passing routing control messages 104by using the socket call shown in the synopsis above: 105.Pp 106The 107.Fa family 108parameter may be 109.Dv AF_UNSPEC 110which will provide 111routing information for all address families, or can be restricted 112to a specific address family by specifying which one is desired. 113There can be more than one routing socket open per system. 114.Pp 115Messages are formed by a header followed by a small 116number of sockaddrs (now variable length particularly 117in the 118.Tn ISO 119case), interpreted by position, and delimited 120by the new length entry in the sockaddr. 121An example of a message with four addresses might be an 122.Tn ISO 123redirect: 124Destination, Netmask, Gateway, and Author of the redirect. 125The interpretation of which address are present is given by a 126bit mask within the header, and the sequence is least significant 127to most significant bit within the vector. 128.Pp 129Any messages sent to the kernel are returned, and copies are sent 130to all interested listeners. 131The exception to this is a new address marked as tentative, where copies 132will be sent once Duplicate Address Detection has completed and 133the tentative flag cleared or the duplicated flag set. 134Also, new address messages will also be emitted when other flags on the address 135change such as deprecated and detached. 136The kernel will provide the process ID for the sender, and the 137sender may use an additional sequence field to distinguish between 138outstanding messages. 139However, message replies may be lost when kernel buffers are exhausted. 140.Pp 141The kernel may reject certain messages, and will indicate this 142by filling in the 143.Fa rtm_errno 144field. 145The routing code returns 146.Er EEXIST 147if 148requested to duplicate an existing entry, 149.Er ESRCH 150if 151requested to delete a non-existent entry, 152or 153.Er ENOBUFS 154if insufficient resources were available 155to install a new route. 156In the current implementation, all routing processes run locally, 157and the values for 158.Fa rtm_errno 159are available through the normal 160.Em errno 161mechanism, even if the routing reply message is lost. 162.Pp 163A process may avoid the expense of reading replies to 164its own messages by issuing a 165.Xr setsockopt 2 166call indicating that the 167.Dv SO_USELOOPBACK 168option 169at the 170.Dv SOL_SOCKET 171level is to be turned off. 172A process may ignore all messages from the routing socket 173by doing a 174.Xr shutdown 2 175system call for further input. 176.Pp 177A process can specify which route message types it's interested in by passing 178an array of route messsage types to the 179.Xr setsockopt 2 180call with the 181.Dv RO_MSGFILTER 182option at the 183.Dv PF_ROUTE 184level. 185For example, to only get specific messages: 186.Bd -literal -offset indent 187unsigned char rtfilter[] = { RTM_IFINFO, RTM_IFANNOUNCE }; 188 189if (setsockopt(routefd, PF_ROUTE, RO_MSGFILTER, 190 &rtfilter, (socklen_t)sizeof(rtfilter)) == -1) 191 err(1, "setsockopt(RO_MSGFILTER)"); 192.Ed 193.Pp 194If a route is in use when it is deleted, 195the routing entry will be marked down and removed from the routing table, 196but the resources associated with it will not 197be reclaimed until all references to it are released. 198User processes can obtain information about the routing 199entry to a specific destination by using a 200.Dv RTM_GET 201message, 202or by reading the 203.Pa /dev/kmem 204device, or by calling 205.Xr sysctl 3 . 206.Pp 207The messages are: 208.Bd -literal 209#define RTM_ADD 0x1 /* Add Route */ 210#define RTM_DELETE 0x2 /* Delete Route */ 211#define RTM_CHANGE 0x3 /* Change Metrics, Flags, or Gateway */ 212#define RTM_GET 0x4 /* Report Information */ 213#define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */ 214#define RTM_REDIRECT 0x6 /* Told to use different route */ 215#define RTM_MISS 0x7 /* Lookup failed on this address */ 216#define RTM_LOCK 0x8 /* fix specified metrics */ 217#define RTM_OLDADD 0x9 /* caused by SIOCADDRT */ 218#define RTM_OLDDEL 0xa /* caused by SIOCDELRT */ 219#define RTM_ONEWADDR 0xc /* Old (pre-8.0) RTM_NEWADDR message */ 220// #define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */ 221#define RTM_ODELADDR 0xd /* Old (pre-8.0) RTM_DELADDR message */ 222#define RTM_OOIFINFO 0xe /* Old (pre-1.5) RTM_IFINFO message */ 223#define RTM_OIFINFO 0xf /* Old (pre-6.0) RTM_IFINFO message */ 224#define RTM_IFANNOUNCE 0x10 /* iface arrival/departure */ 225#define RTM_IEEE80211 0x11 /* IEEE80211 wireless event */ 226#define RTM_SETGATE 0x12 /* set prototype gateway for clones 227 * (see example in arp_rtrequest). 228 */ 229#define RTM_LLINFO_UPD 0x13 /* indication to ARP/NDP/etc. that link-layer 230 * address has changed 231 */ 232#define RTM_IFINFO 0x14 /* iface/link going up/down etc. */ 233#define RTM_OCHGADDR 0x15 /* Old (pre-8.0) RTM_CHGADDR message */ 234#define RTM_NEWADDR 0x16 /* address being added to iface */ 235#define RTM_DELADDR 0x17 /* address being removed from iface */ 236#define RTM_CHGADDR 0x18 /* address properties changed */ 237.Ed 238.Pp 239A message header consists of one of the following: 240.Bd -literal 241struct rt_msghdr { 242 u_short rtm_msglen; /* to skip over non-understood messages */ 243 u_char rtm_version; /* future binary compatibility */ 244 u_char rtm_type; /* message type */ 245 u_short rtm_index; /* index for associated ifp */ 246 int rtm_flags; /* flags, incl kern & message, e.g. DONE */ 247 int rtm_addrs; /* bitmask identifying sockaddrs in msg */ 248 pid_t rtm_pid; /* identify sender */ 249 int rtm_seq; /* for sender to identify action */ 250 int rtm_errno; /* why failed */ 251 int rtm_use; /* from rtentry */ 252 u_long rtm_inits; /* which metrics we are initializing */ 253 struct rt_metrics rtm_rmx; /* metrics themselves */ 254}; 255 256struct if_msghdr { 257 u_short ifm_msglen; /* to skip over non-understood messages */ 258 u_char ifm_version; /* future binary compatibility */ 259 u_char ifm_type; /* message type */ 260 int ifm_addrs; /* like rtm_addrs */ 261 int ifm_flags; /* value of if_flags */ 262 u_short ifm_index; /* index for associated ifp */ 263 struct if_data ifm_data; /* statistics and other data about if */ 264}; 265 266struct ifa_msghdr { 267 u_short ifam_msglen; /* to skip over non-understood messages */ 268 u_char ifam_version; /* future binary compatibility */ 269 u_char ifam_type; /* message type */ 270 u_short ifam_index; /* index for associated ifp */ 271 int ifam_flags; /* value of ifa_flags */ 272 int ifam_addrs; /* like rtm_addrs */ 273 pid_t ifam_pid; /* identify sender */ 274 int ifam_addrflags; /* family specific address flags */ 275 int ifam_metric; /* value of ifa_metric */ 276}; 277 278struct if_announcemsghdr { 279 u_short ifan_msglen; /* to skip over non-understood messages */ 280 u_char ifan_version; /* future binary compatibility */ 281 u_char ifan_type; /* message type */ 282 u_short ifan_index; /* index for associated ifp */ 283 char ifan_name[IFNAMSIZ]; /* if name, e.g. "en0" */ 284 u_short ifan_what; /* what type of announcement */ 285}; 286.Ed 287.Pp 288The 289.Dv RTM_IFINFO 290message uses a 291.Vt if_msghdr 292header, the 293.Dv RTM_NEWADDR , 294.Dv RTM_CHGADDR , 295and 296.Dv RTM_DELADDR 297messages use a 298.Vt ifa_msghdr 299header, 300the 301.Dv RTM_IFANNOUNCE 302message uses a 303.Vt if_announcemsghdr 304header, 305and all other messages use the 306.Vt rt_msghdr 307header. 308.Pp 309The metrics structure is: 310.Bd -literal 311struct rt_metrics { 312 u_long rmx_locks; /* Kernel must leave these values alone */ 313 u_long rmx_mtu; /* MTU for this path */ 314 u_long rmx_hopcount; /* max hops expected */ 315 u_long rmx_expire; /* lifetime for route, e.g. redirect */ 316 u_long rmx_recvpipe; /* inbound delay-bandwidth product */ 317 u_long rmx_sendpipe; /* outbound delay-bandwidth product */ 318 u_long rmx_ssthresh; /* outbound gateway buffer limit */ 319 u_long rmx_rtt; /* estimated round trip time */ 320 u_long rmx_rttvar; /* estimated rtt variance */ 321 u_long rmx_pksent; /* packets sent using this route */ 322}; 323.Ed 324.Pp 325Flags include the values: 326.Bd -literal 327#define RTF_UP 0x1 /* route usable */ 328#define RTF_GATEWAY 0x2 /* destination is a gateway */ 329#define RTF_HOST 0x4 /* host entry (net otherwise) */ 330#define RTF_REJECT 0x8 /* host or net unreachable */ 331#define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */ 332#define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */ 333#define RTF_DONE 0x40 /* message confirmed */ 334#define RTF_MASK 0x80 /* subnet mask present */ 335#define RTF_CONNECTED 0x100 /* hosts on this route are neighbours */ 336#define RTF_LLDATA 0x400 /* used by apps to add/del L2 entries */ 337#define RTF_STATIC 0x800 /* manually added */ 338#define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */ 339#define RTF_PROTO2 0x4000 /* protocol specific routing flag */ 340#define RTF_PROTO1 0x8000 /* protocol specific routing flag */ 341#define RTF_SRC 0x10000 /* route has fixed source address */ 342#define RTF_ANNOUNCE 0x20000 /* announce new ARP or NDP entry */ 343#define RTF_LOCAL 0x40000 /* route represents a local address */ 344#define RTF_BROADCAST 0x80000 /* route represents a bcast address */ 345.Ed 346.Pp 347Specifiers for metric values in rmx_locks and rtm_inits are: 348.Bd -literal 349#define RTV_MTU 0x1 /* init or lock _mtu */ 350#define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */ 351#define RTV_EXPIRE 0x4 /* init or lock _expire */ 352#define RTV_RPIPE 0x8 /* init or lock _recvpipe */ 353#define RTV_SPIPE 0x10 /* init or lock _sendpipe */ 354#define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */ 355#define RTV_RTT 0x40 /* init or lock _rtt */ 356#define RTV_RTTVAR 0x80 /* init or lock _rttvar */ 357.Ed 358.Pp 359Specifiers for which addresses are present in the messages are: 360.Bd -literal 361#define RTA_DST 0x1 /* destination sockaddr present */ 362#define RTA_GATEWAY 0x2 /* gateway sockaddr present */ 363#define RTA_NETMASK 0x4 /* netmask sockaddr present */ 364#define RTA_GENMASK 0x8 /* cloning mask sockaddr present */ 365#define RTA_IFP 0x10 /* interface name sockaddr present */ 366#define RTA_IFA 0x20 /* interface addr sockaddr present */ 367#define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */ 368#define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */ 369#define RTA_TAG 0x100 /* route tag */ 370.Ed 371.Pp 372Flags for IPv6 addresses: 373.Bd -literal 374#define IN6_IFF_ANYCAST 0x01 /* anycast address */ 375#define IN6_IFF_TENTATIVE 0x02 /* tentative address */ 376#define IN6_IFF_DUPLICATED 0x04 /* DAD detected duplicate */ 377#define IN6_IFF_DETACHED 0x08 /* may be detached from the link */ 378#define IN6_IFF_DEPRECATED 0x10 /* deprecated address */ 379#define IN6_IFF_NODAD 0x20 /* don't perform DAD on this address 380 * (used only at first SIOC* call) 381 */ 382#define IN6_IFF_AUTOCONF 0x40 /* autoconfigurable address. */ 383#define IN6_IFF_TEMPORARY 0x80 /* temporary (anonymous) address. */ 384.Ed 385.Sh SEE ALSO 386.Xr socket 2 , 387.Xr sysctl 3 388.Sh HISTORY 389Since 390.Nx 8.0 , 391.Cm RTF_CLONED , 392.Cm RTF_CLONING , 393.Cm RTF_LLINFO , 394.Cm RTF_XRESOLVE 395and 396.Cm RTM_RESOLVE 397were obsolete. 398.Cm RTF_CONNECTED 399and 400.Cm RTF_LLDATA 401appeared in 402.Nx 8.0 . 403.Pp 404.Vt ifa_msghdr 405gained the fields ifam_pid and ifam_addrflags in 406.Nx 8.0 . 407