xref: /netbsd/share/man/man4/route.4 (revision 6550d01e)
1.\"	$NetBSD: route.4,v 1.17 2010/11/15 21:19:59 wiz 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 November 13, 2010
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 kernel will provide the process ID for the sender, and the
132sender may use an additional sequence field to distinguish between
133outstanding messages.
134However, message replies may be lost when kernel buffers are exhausted.
135.Pp
136The kernel may reject certain messages, and will indicate this
137by filling in the
138.Ar rtm_errno
139field.
140The routing code returns
141.Dv EEXIST
142if
143requested to duplicate an existing entry,
144.Dv ESRCH
145if
146requested to delete a non-existent entry,
147or
148.Dv ENOBUFS
149if insufficient resources were available
150to install a new route.
151In the current implementation, all routing processes run locally,
152and the values for
153.Ar rtm_errno
154are available through the normal
155.Em errno
156mechanism, even if the routing reply message is lost.
157.Pp
158A process may avoid the expense of reading replies to
159its own messages by issuing a
160.Xr setsockopt 2
161call indicating that the
162.Dv SO_USELOOPBACK
163option
164at the
165.Dv SOL_SOCKET
166level is to be turned off.
167A process may ignore all messages from the routing socket
168by doing a
169.Xr shutdown 2
170system call for further input.
171.Pp
172If a route is in use when it is deleted,
173the routing entry will be marked down and removed from the routing table,
174but the resources associated with it will not
175be reclaimed until all references to it are released.
176User processes can obtain information about the routing
177entry to a specific destination by using a
178.Dv RTM_GET
179message,
180or by reading the
181.Pa /dev/kmem
182device, or by calling
183.Xr sysctl 3 .
184.Pp
185The messages are:
186.Bd -literal
187#define	RTM_ADD		0x1    /* Add Route */
188#define	RTM_DELETE	0x2    /* Delete Route */
189#define	RTM_CHANGE	0x3    /* Change Metrics, Flags, or Gateway */
190#define	RTM_GET		0x4    /* Report Information */
191#define	RTM_LOSING	0x5    /* Kernel Suspects Partitioning */
192#define	RTM_REDIRECT	0x6    /* Told to use different route */
193#define	RTM_MISS	0x7    /* Lookup failed on this address */
194#define	RTM_RESOLVE	0xb    /* request to resolve dst to LL addr */
195#define	RTM_NEWADDR	0xc    /* address being added to iface */
196#define	RTM_DELADDR	0xd    /* address being removed from iface */
197#define	RTM_OOIFINFO	0xe    /* Old (pre-1.5) RTM_IFINFO message */
198#define	RTM_OIFINFO	0xf    /* Old (pre-6.0) RTM_IFINFO message */
199#define	RTM_IFANNOUNCE	0x10   /* iface arrival/departure */
200#define	RTM_IFINFO	0x14   /* iface/link going up/down etc. */
201#define	RTM_CHGADDR	0x15   /* address has changed on iface */
202.Ed
203.Pp
204A message header consists of one of the following:
205.Bd -literal
206struct rt_msghdr {
207    u_short rtm_msglen;        /* to skip over non-understood messages */
208    u_char  rtm_version;       /* future binary compatibility */
209    u_char  rtm_type;          /* message type */
210    u_short rtm_index;         /* index for associated ifp */
211    int     rtm_flags;         /* flags, incl kern \*[Am] message, e.g. DONE */
212    int     rtm_addrs;         /* bitmask identifying sockaddrs in msg */
213    pid_t   rtm_pid;           /* identify sender */
214    int     rtm_seq;           /* for sender to identify action */
215    int     rtm_errno;         /* why failed */
216    int     rtm_use;           /* from rtentry */
217    u_long  rtm_inits;         /* which metrics we are initializing */
218    struct  rt_metrics rtm_rmx;	/* metrics themselves */
219};
220
221struct if_msghdr {
222    u_short ifm_msglen;        /* to skip over non-understood messages */
223    u_char  ifm_version;       /* future binary compatibility */
224    u_char  ifm_type;          /* message type */
225    int     ifm_addrs;         /* like rtm_addrs */
226    int     ifm_flags;         /* value of if_flags */
227    u_short ifm_index;         /* index for associated ifp */
228    struct  if_data ifm_data;  /* statistics and other data about if */
229};
230
231struct ifa_msghdr {
232    u_short ifam_msglen;       /* to skip over non-understood messages */
233    u_char  ifam_version;      /* future binary compatibility */
234    u_char  ifam_type;         /* message type */
235    int     ifam_addrs;        /* like rtm_addrs */
236    int     ifam_flags;        /* value of ifa_flags */
237    u_short ifam_index;        /* index for associated ifp */
238    int     ifam_metric;       /* value of ifa_metric */
239};
240
241struct if_announcemsghdr {
242    u_short ifan_msglen;       /* to skip over non-understood messages */
243    u_char  ifan_version;      /* future binary compatibility */
244    u_char  ifan_type;         /* message type */
245    u_short ifan_index;        /* index for associated ifp */
246    char    ifan_name[IFNAMSIZ]; /* if name, e.g. "en0" */
247    u_short ifan_what;         /* what type of announcement */
248};
249.Ed
250.Pp
251The
252.Dv RTM_IFINFO
253message uses a
254.Ar if_msghdr
255header, the
256.Dv RTM_NEWADDR ,
257.Dv RTM_CHGADDR ,
258and
259.Dv RTM_DELADDR
260messages use a
261.Ar ifa_msghdr
262header,
263the
264.Dv RTM_IFANNOUNCE
265message uses a
266.Ar if_announcemsghdr
267header,
268and all other messages use the
269.Ar rt_msghdr
270header.
271.Pp
272The metrics structure is:
273.Bd -literal
274struct rt_metrics {
275    u_long rmx_locks;          /* Kernel must leave these values alone */
276    u_long rmx_mtu;            /* MTU for this path */
277    u_long rmx_hopcount;       /* max hops expected */
278    u_long rmx_expire;         /* lifetime for route, e.g. redirect */
279    u_long rmx_recvpipe;       /* inbound delay-bandwidth product */
280    u_long rmx_sendpipe;       /* outbound delay-bandwidth product */
281    u_long rmx_ssthresh;       /* outbound gateway buffer limit */
282    u_long rmx_rtt;            /* estimated round trip time */
283    u_long rmx_rttvar;         /* estimated rtt variance */
284    u_long rmx_pksent;         /* packets sent using this route */
285};
286.Ed
287.Pp
288Flags include the values:
289.Bd -literal
290#define	RTF_UP        0x1      /* route usable */
291#define	RTF_GATEWAY   0x2      /* destination is a gateway */
292#define	RTF_HOST      0x4      /* host entry (net otherwise) */
293#define	RTF_REJECT    0x8      /* host or net unreachable */
294#define	RTF_DYNAMIC   0x10     /* created dynamically (by redirect) */
295#define	RTF_MODIFIED  0x20     /* modified dynamically (by redirect) */
296#define	RTF_DONE      0x40     /* message confirmed */
297#define	RTF_MASK      0x80     /* subnet mask present */
298#define	RTF_CLONING   0x100    /* generate new routes on use */
299#define	RTF_XRESOLVE  0x200    /* external daemon resolves name */
300#define	RTF_LLINFO    0x400    /* generated by ARP or ESIS */
301#define	RTF_STATIC    0x800    /* manually added */
302#define	RTF_BLACKHOLE 0x1000   /* just discard pkts (during updates) */
303#define	RTF_CLONED    0x2000   /* this is a cloned route */
304#define	RTF_PROTO2    0x4000   /* protocol specific routing flag */
305#define	RTF_PROTO1    0x8000   /* protocol specific routing flag */
306.Ed
307.Pp
308Specifiers for metric values in rmx_locks and rtm_inits are:
309.Bd -literal
310#define	RTV_MTU       0x1    /* init or lock _mtu */
311#define	RTV_HOPCOUNT  0x2    /* init or lock _hopcount */
312#define	RTV_EXPIRE    0x4    /* init or lock _expire */
313#define	RTV_RPIPE     0x8    /* init or lock _recvpipe */
314#define	RTV_SPIPE     0x10   /* init or lock _sendpipe */
315#define	RTV_SSTHRESH  0x20   /* init or lock _ssthresh */
316#define	RTV_RTT       0x40   /* init or lock _rtt */
317#define	RTV_RTTVAR    0x80   /* init or lock _rttvar */
318.Ed
319.Pp
320Specifiers for which addresses are present in the messages are:
321.Bd -literal
322#define RTA_DST       0x1    /* destination sockaddr present */
323#define RTA_GATEWAY   0x2    /* gateway sockaddr present */
324#define RTA_NETMASK   0x4    /* netmask sockaddr present */
325#define RTA_GENMASK   0x8    /* cloning mask sockaddr present */
326#define RTA_IFP       0x10   /* interface name sockaddr present */
327#define RTA_IFA       0x20   /* interface addr sockaddr present */
328#define RTA_AUTHOR    0x40   /* sockaddr for author of redirect */
329#define RTA_BRD       0x80   /* for NEWADDR, broadcast or p-p dest addr */
330.Ed
331.Sh SEE ALSO
332.Xr socket 2 ,
333.Xr sysctl 3
334