1 .\" Copyright (c) 1983, 1991, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" Redistribution and use in source and binary forms, with or without
5 .\" modification, are permitted provided that the following conditions
7 .\" 1. Redistributions of source code must retain the above copyright
8 .\" notice, this list of conditions and the following disclaimer.
9 .\" 2. Redistributions in binary form must reproduce the above copyright
10 .\" notice, this list of conditions and the following disclaimer in the
11 .\" documentation and/or other materials provided with the distribution.
12 .\" 3. All advertising materials mentioning features or use of this software
13 .\" must display the following acknowledgement:
14 .\" This product includes software developed by the University of
15 .\" California, Berkeley and its contributors.
16 .\" 4. Neither the name of the University nor the names of its contributors
17 .\" may be used to endorse or promote products derived from this software
18 .\" without specific prior written permission.
20 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 .\" @(#)route.8 8.4 (Berkeley) 6/1/94
39 .Nd manually manipulate the routing tables.
50 is a utility used to manually manipulate the network
51 routing tables. It normally is not needed, as a
52 system routing table management daemon such as
54 should tend to this task.
58 utility supports a limited number of general options,
59 but a rich command language, enabling the user to specify
60 any arbitrary request that could be delivered via the
61 programmatic interface discussed in
66 Bypasses attempts to print host and network names symbolically
67 when reporting actions. (The process of translating between symbolic
68 names and numerical equivalents can be quite time consuming, and
69 may require correct operation of the network; thus it may be expedient
70 to forgo this, especially when attempting to repair networking operations),
72 (verbose) Print additional details.
79 utility provides six commands:
81 .Bl -tag -width Fl -compact
87 Delete a specific route.
89 Change aspects of a route (such as its gateway).
91 Lookup and display the route for a destination.
93 Continuously report any changes to the routing information base,
94 routing lookup misses, or suspected network partitionings.
97 The monitor command has the syntax
99 .Bd -filled -offset indent -compact
104 The flush command has the syntax
106 .Bd -filled -offset indent -compact
114 command is specified,
116 will ``flush'' the routing tables of all gateway entries.
117 When the address family may is specified by any of the
122 modifiers, only routes having destinations with addresses in the
123 delineated family will be deleted.
125 The other commands have the following syntax:
127 .Bd -filled -offset indent -compact
130 .Op Fl net No \&| Fl host
131 .Ar destination gateway
136 is the destination host or network,
138 is the next-hop intermediary via which packets should be routed.
139 Routes to a particular host may be distinguished from those to
140 a network by interpreting the Internet address specified as the
141 .Ar destination argument.
142 The optional modifiers
146 force the destination to be interpreted as a network or a host, respectively.
149 has a ``local address part'' of
153 is the symbolic name of a network, then the route is
154 assumed to be to a network; otherwise, it is presumed to be a
160 .Fl host Li 128.0.0.32 ;
163 .Fl host Li 128.32.0.130 ;
168 .Fl net Li 128.32.130
172 If the destination is directly reachable
173 via an interface requiring
174 no intermediary system to act as a gateway, the
176 modifier should be specified;
177 the gateway given is the address of this host on the common network,
178 indicating the interface to be used for transmission.
180 The optional modifiers
185 specify that all subsequent addresses are in the
189 or are specified as link-level addresses,
190 and the names must be numeric specifications rather than
195 qualifier is intended
196 to achieve the effect of an
199 redirect with the netmask option,
200 or to manually add subnet routes with
201 netmasks different from that of the implied network interface
202 (as would otherwise be communicated using the OSPF or ISIS routing protocols).
203 One specifies an additional ensuing address parameter
204 (to be interpreted as a network mask).
205 The implicit network mask generated in the AF_INET case
206 can be overridden by making sure this option follows the destination parameter.
208 Routes have associated flags which influence operation of the protocols
209 when sending to destinations matched by the routes.
210 These flags may be set (or sometimes cleared)
211 by indicating the following corresponding modifiers:
213 -cloning RTF_CLONING - generates a new route on use
214 -xresolve RTF_XRESOLVE - emit mesg on use (for external lookup)
215 -iface ~RTF_GATEWAY - destination is directly reachable
216 -static RTF_STATIC - manually added route
217 -nostatic ~RTF_STATIC - pretend route added by kernel or daemon
218 -reject RTF_REJECT - emit an ICMP unreachable when matched
219 -blackhole RTF_BLACKHOLE - silently discard pkts (during updates)
220 -proto1 RTF_PROTO1 - set protocol specific routing flag #1
221 -proto2 RTF_PROTO2 - set protocol specific routing flag #2
222 -llinfo RTF_LLINFO - validly translates proto addr to link addr
225 The optional modifiers
235 provide initial values to quantities maintained in the routing entry
236 by transport level protocols, such as TCP or TP4.
237 These may be individually locked by preceding each such modifier to
241 meta-modifier, or one can
242 specify that all ensuing metrics may be locked by the
250 command where the destination and gateway are not sufficient to specify
253 case where several interfaces may have the
258 modifiers may be used to determine the interface or interface address.
260 All symbolic names specified for a
264 are looked up first as a host name using
265 .Xr gethostbyname 3 .
266 If this lookup fails,
268 is then used to interpret the name as that of a network.
271 uses a routing socket and the new message types
277 As such, only the super-user may modify
282 .It Sy "add [host \&| network ] %s: gateway %s flags %x"
283 The specified route is being added to the tables. The
284 values printed are from the routing table entry supplied
288 If the gateway address used was not the primary address of the gateway
289 (the first one returned by
290 .Xr gethostbyname 3 ) ,
291 the gateway address is printed numerically as well as symbolically.
292 .It Sy "delete [ host &| network ] %s: gateway %s flags %x"
293 As above, but when deleting an entry.
297 command is specified, each routing table entry deleted
298 is indicated with a message of this form.
299 .It Sy "Network is unreachable"
300 An attempt to add a route failed because the gateway listed was not
301 on a directly-connected network.
302 The next-hop gateway must be given.
303 .It Sy "not in table"
304 A delete operation was attempted for an entry which
305 wasn't present in the tables.
306 .It Sy "routing table overflow"
307 An add operation was attempted, but the system was
308 low on resources and was unable to allocate memory
309 to create the new entry.
323 The first paragraph may have slightly exaggerated