1 /* $NetBSD: route.h,v 1.119 2018/04/19 21:20:43 christos Exp $ */ 2 3 /* 4 * Copyright (c) 1980, 1986, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 * 31 * @(#)route.h 8.5 (Berkeley) 2/8/95 32 */ 33 34 #ifndef _NET_ROUTE_H_ 35 #define _NET_ROUTE_H_ 36 37 #include <sys/queue.h> 38 #include <sys/socket.h> 39 #include <sys/types.h> 40 #include <net/if.h> 41 #ifdef _KERNEL 42 #include <sys/rwlock.h> 43 #include <sys/condvar.h> 44 #include <sys/pserialize.h> 45 #endif 46 #include <sys/psref.h> 47 48 #if !(defined(_KERNEL) || defined(_STANDALONE)) 49 #include <stdbool.h> 50 #endif 51 52 /* 53 * Kernel resident routing tables. 54 * 55 * The routing tables are initialized when interface addresses 56 * are set by making entries for all directly connected interfaces. 57 */ 58 59 /* 60 * A route consists of a destination address and a reference 61 * to a routing entry. These are often held by protocols 62 * in their control blocks, e.g. inpcb. 63 */ 64 struct route { 65 struct rtentry *_ro_rt; 66 struct sockaddr *ro_sa; 67 uint64_t ro_rtcache_generation; 68 struct psref ro_psref; 69 int ro_bound; 70 }; 71 72 /* 73 * These numbers are used by reliable protocols for determining 74 * retransmission behavior and are included in the routing structure. 75 */ 76 struct rt_metrics { 77 uint64_t rmx_locks; /* Kernel must leave these values alone */ 78 uint64_t rmx_mtu; /* MTU for this path */ 79 uint64_t rmx_hopcount; /* max hops expected */ 80 uint64_t rmx_recvpipe; /* inbound delay-bandwidth product */ 81 uint64_t rmx_sendpipe; /* outbound delay-bandwidth product */ 82 uint64_t rmx_ssthresh; /* outbound gateway buffer limit */ 83 uint64_t rmx_rtt; /* estimated round trip time */ 84 uint64_t rmx_rttvar; /* estimated rtt variance */ 85 time_t rmx_expire; /* lifetime for route, e.g. redirect */ 86 time_t rmx_pksent; /* packets sent using this route */ 87 }; 88 89 /* 90 * rmx_rtt and rmx_rttvar are stored as microseconds; 91 * RTTTOPRHZ(rtt) converts to a value suitable for use 92 * by a protocol slowtimo counter. 93 */ 94 #define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */ 95 #define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ)) 96 97 /* 98 * We distinguish between routes to hosts and routes to networks, 99 * preferring the former if available. For each route we infer 100 * the interface to use from the gateway address supplied when 101 * the route was entered. Routes that forward packets through 102 * gateways are marked so that the output routines know to address the 103 * gateway rather than the ultimate destination. 104 */ 105 #ifndef RNF_NORMAL 106 #include <net/radix.h> 107 #endif 108 struct rtentry { 109 struct radix_node rt_nodes[2]; /* tree glue, and other values */ 110 #define rt_mask(r) ((const struct sockaddr *)((r)->rt_nodes->rn_mask)) 111 struct sockaddr *rt_gateway; /* value */ 112 int rt_flags; /* up/down?, host/net */ 113 int rt_refcnt; /* # held references */ 114 uint64_t rt_use; /* raw # packets forwarded */ 115 struct ifnet *rt_ifp; /* the answer: interface to use */ 116 struct ifaddr *rt_ifa; /* the answer: interface to use */ 117 uint32_t rt_ifa_seqno; 118 void * rt_llinfo; /* pointer to link level info cache */ 119 struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */ 120 struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */ 121 LIST_HEAD(, rttimer) rt_timer; /* queue of timeouts for misc funcs */ 122 struct rtentry *rt_parent; /* parent of cloned route */ 123 struct sockaddr *_rt_key; 124 struct sockaddr *rt_tag; /* route tagging info */ 125 #ifdef _KERNEL 126 kcondvar_t rt_cv; 127 struct psref_target rt_psref; 128 SLIST_ENTRY(rtentry) rt_free; /* queue of deferred frees */ 129 #endif 130 }; 131 132 static __inline const struct sockaddr * 133 rt_getkey(const struct rtentry *rt) 134 { 135 return rt->_rt_key; 136 } 137 138 /* 139 * Following structure necessary for 4.3 compatibility; 140 * We should eventually move it to a compat file. 141 */ 142 struct ortentry { 143 uint32_t rt_hash; /* to speed lookups */ 144 struct sockaddr rt_dst; /* key */ 145 struct sockaddr rt_gateway; /* value */ 146 int16_t rt_flags; /* up/down?, host/net */ 147 int16_t rt_refcnt; /* # held references */ 148 uint32_t rt_use; /* raw # packets forwarded */ 149 struct ifnet *rt_ifp; /* the answer: interface to use */ 150 }; 151 152 #define RTF_UP 0x1 /* route usable */ 153 #define RTF_GATEWAY 0x2 /* destination is a gateway */ 154 #define RTF_HOST 0x4 /* host entry (net otherwise) */ 155 #define RTF_REJECT 0x8 /* host or net unreachable */ 156 #define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */ 157 #define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */ 158 #define RTF_DONE 0x40 /* message confirmed */ 159 #define RTF_MASK 0x80 /* subnet mask present */ 160 // #define RTF_CLONING 0x100 /* generate new routes on use */ 161 #define RTF_CONNECTED 0x100 /* hosts on this route are neighbours */ 162 // #define RTF_XRESOLVE 0x200 /* external daemon resolves name */ 163 // #define RTF_LLINFO 0x400 /* generated by ARP or NDP */ 164 #define RTF_LLDATA 0x400 /* used by apps to add/del L2 entries */ 165 #define RTF_STATIC 0x800 /* manually added */ 166 #define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */ 167 // #define RTF_CLONED 0x2000 /* this is a cloned route */ 168 #define RTF_PROTO2 0x4000 /* protocol specific routing flag */ 169 #define RTF_PROTO1 0x8000 /* protocol specific routing flag */ 170 #define RTF_SRC 0x10000 /* route has fixed source address */ 171 #define RTF_ANNOUNCE 0x20000 /* announce new ARP or NDP entry */ 172 #define RTF_LOCAL 0x40000 /* route represents a local address */ 173 #define RTF_BROADCAST 0x80000 /* route represents a bcast address */ 174 #define RTF_UPDATING 0x100000 /* route is updating */ 175 176 /* 177 * 0x400 is exposed to userland just for backward compatibility. For that 178 * purpose, it should be shown as LLINFO. 179 */ 180 #define RTFBITS "\020\1UP\2GATEWAY\3HOST\4REJECT\5DYNAMIC\6MODIFIED\7DONE" \ 181 "\010MASK_PRESENT\011CONNECTED\012XRESOLVE\013LLINFO\014STATIC" \ 182 "\015BLACKHOLE\016CLONED\017PROTO2\020PROTO1\021SRC\022ANNOUNCE" \ 183 "\023LOCAL\024BROADCAST\025UPDATING" 184 185 186 /* 187 * Routing statistics. 188 */ 189 struct rtstat { 190 uint64_t rts_badredirect; /* bogus redirect calls */ 191 uint64_t rts_dynamic; /* routes created by redirects */ 192 uint64_t rts_newgateway; /* routes modified by redirects */ 193 uint64_t rts_unreach; /* lookups which failed */ 194 uint64_t rts_wildcard; /* lookups satisfied by a wildcard */ 195 }; 196 197 /* 198 * Structures for routing messages. By forcing the first member to be aligned 199 * at a 64-bit boundary, we also force the size to be a multiple of 64-bits. 200 */ 201 202 #if !defined(_KERNEL) || !defined(COMPAT_RTSOCK) 203 /* 204 * If we aren't being compiled for backwards compatiblity, enforce 64-bit 205 * alignment so any routing message is the same regardless if the kernel 206 * is an ILP32 or LP64 kernel. 207 */ 208 #define __align64 __aligned(sizeof(uint64_t)) 209 #else 210 #define __align64 211 #endif 212 213 struct rt_msghdr { 214 u_short rtm_msglen __align64; 215 /* to skip over non-understood messages */ 216 u_char rtm_version; /* future binary compatibility */ 217 u_char rtm_type; /* message type */ 218 u_short rtm_index; /* index for associated ifp */ 219 int rtm_flags; /* flags, incl. kern & message, e.g. DONE */ 220 int rtm_addrs; /* bitmask identifying sockaddrs in msg */ 221 pid_t rtm_pid; /* identify sender */ 222 int rtm_seq; /* for sender to identify action */ 223 int rtm_errno; /* why failed */ 224 int rtm_use; /* from rtentry */ 225 int rtm_inits; /* which metrics we are initializing */ 226 struct rt_metrics rtm_rmx __align64; 227 /* metrics themselves */ 228 }; 229 230 #undef __align64 231 232 #define RTM_VERSION 4 /* Up the ante and ignore older versions */ 233 234 #define RTM_ADD 0x1 /* Add Route */ 235 #define RTM_DELETE 0x2 /* Delete Route */ 236 #define RTM_CHANGE 0x3 /* Change Metrics or flags */ 237 #define RTM_GET 0x4 /* Report Metrics */ 238 #define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */ 239 #define RTM_REDIRECT 0x6 /* Told to use different route */ 240 #define RTM_MISS 0x7 /* Lookup failed on this address */ 241 #define RTM_LOCK 0x8 /* fix specified metrics */ 242 #define RTM_OLDADD 0x9 /* caused by SIOCADDRT */ 243 #define RTM_OLDDEL 0xa /* caused by SIOCDELRT */ 244 // #define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */ 245 #define RTM_ONEWADDR 0xc /* Old (pre-8.0) RTM_NEWADDR message */ 246 #define RTM_ODELADDR 0xd /* Old (pre-8.0) RTM_DELADDR message */ 247 #define RTM_OOIFINFO 0xe /* Old (pre-1.5) RTM_IFINFO message */ 248 #define RTM_OIFINFO 0xf /* Old (pre-64bit time) RTM_IFINFO message */ 249 #define RTM_IFANNOUNCE 0x10 /* iface arrival/departure */ 250 #define RTM_IEEE80211 0x11 /* IEEE80211 wireless event */ 251 #define RTM_SETGATE 0x12 /* set prototype gateway for clones 252 * (see example in arp_rtrequest). 253 */ 254 #define RTM_LLINFO_UPD 0x13 /* indication to ARP/NDP/etc. that link-layer 255 * address has changed 256 */ 257 #define RTM_IFINFO 0x14 /* iface/link going up/down etc. */ 258 #define RTM_OCHGADDR 0x15 /* Old (pre-8.0) RTM_CHGADDR message */ 259 #define RTM_NEWADDR 0x16 /* address being added to iface */ 260 #define RTM_DELADDR 0x17 /* address being removed from iface */ 261 #define RTM_CHGADDR 0x18 /* address properties changed */ 262 263 /* 264 * setsockopt defines used for the filtering. 265 */ 266 #define RO_MSGFILTER 1 /* array of which rtm_type to send to client */ 267 268 #define RTV_MTU 0x1 /* init or lock _mtu */ 269 #define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */ 270 #define RTV_EXPIRE 0x4 /* init or lock _expire */ 271 #define RTV_RPIPE 0x8 /* init or lock _recvpipe */ 272 #define RTV_SPIPE 0x10 /* init or lock _sendpipe */ 273 #define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */ 274 #define RTV_RTT 0x40 /* init or lock _rtt */ 275 #define RTV_RTTVAR 0x80 /* init or lock _rttvar */ 276 277 #define RTVBITS "\020\1MTU\2HOPCOUNT\3EXPIRE\4RECVPIPE\5SENDPIPE" \ 278 "\6SSTHRESH\7RTT\010RTTVAR" 279 280 /* 281 * Bitmask values for rtm_addr. 282 */ 283 #define RTA_DST 0x1 /* destination sockaddr present */ 284 #define RTA_GATEWAY 0x2 /* gateway sockaddr present */ 285 #define RTA_NETMASK 0x4 /* netmask sockaddr present */ 286 #define RTA_GENMASK 0x8 /* cloning mask sockaddr present */ 287 #define RTA_IFP 0x10 /* interface name sockaddr present */ 288 #define RTA_IFA 0x20 /* interface addr sockaddr present */ 289 #define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */ 290 #define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */ 291 #define RTA_TAG 0x100 /* route tag */ 292 293 #define RTABITS "\020\1DST\2GATEWAY\3NETMASK\4GENMASK\5IFP\6IFA\7AUTHOR" \ 294 "\010BRD\011TAG" 295 296 /* 297 * Index offsets for sockaddr array for alternate internal encoding. 298 */ 299 #define RTAX_DST 0 /* destination sockaddr present */ 300 #define RTAX_GATEWAY 1 /* gateway sockaddr present */ 301 #define RTAX_NETMASK 2 /* netmask sockaddr present */ 302 #define RTAX_GENMASK 3 /* cloning mask sockaddr present */ 303 #define RTAX_IFP 4 /* interface name sockaddr present */ 304 #define RTAX_IFA 5 /* interface addr sockaddr present */ 305 #define RTAX_AUTHOR 6 /* sockaddr for author of redirect */ 306 #define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */ 307 #define RTAX_TAG 8 /* route tag */ 308 #define RTAX_MAX 9 /* size of array to allocate */ 309 310 #define RT_ROUNDUP2(a, n) ((a) > 0 ? (1 + (((a) - 1U) | ((n) - 1))) : (n)) 311 #define RT_ROUNDUP(a) RT_ROUNDUP2((a), sizeof(uint64_t)) 312 #define RT_ADVANCE(x, n) (x += RT_ROUNDUP((n)->sa_len)) 313 314 struct rt_addrinfo { 315 int rti_addrs; 316 const struct sockaddr *rti_info[RTAX_MAX]; 317 int rti_flags; 318 struct ifaddr *rti_ifa; 319 struct ifnet *rti_ifp; 320 }; 321 322 struct route_cb { 323 int ip_count; 324 int ip6_count; 325 int unused1; 326 int mpls_count; 327 int any_count; 328 }; 329 330 /* 331 * This structure, and the prototypes for the rt_timer_{init,remove_all, 332 * add,timer} functions all used with the kind permission of BSDI. 333 * These allow functions to be called for routes at specific times. 334 */ 335 336 struct rttimer { 337 TAILQ_ENTRY(rttimer) rtt_next; /* entry on timer queue */ 338 LIST_ENTRY(rttimer) rtt_link; /* multiple timers per rtentry */ 339 struct rttimer_queue *rtt_queue; /* back pointer to queue */ 340 struct rtentry *rtt_rt; /* Back pointer to the route */ 341 void (*rtt_func)(struct rtentry *, struct rttimer *); 342 time_t rtt_time; /* When this timer was registered */ 343 }; 344 345 struct rttimer_queue { 346 long rtq_timeout; 347 unsigned long rtq_count; 348 TAILQ_HEAD(, rttimer) rtq_head; 349 LIST_ENTRY(rttimer_queue) rtq_link; 350 }; 351 352 353 struct rtbl; 354 typedef struct rtbl rtbl_t; 355 356 #ifdef _KERNEL 357 358 struct rtbl { 359 struct radix_node_head t_rnh; 360 }; 361 362 struct rt_walkarg { 363 int w_op; 364 int w_arg; 365 int w_given; 366 int w_needed; 367 void * w_where; 368 int w_tmemsize; 369 int w_tmemneeded; 370 void * w_tmem; 371 }; 372 373 #if 0 374 #define RT_DPRINTF(__fmt, ...) do { } while (/*CONSTCOND*/0) 375 #else 376 #define RT_DPRINTF(__fmt, ...) /* do nothing */ 377 #endif 378 379 struct rtwalk { 380 int (*rw_f)(struct rtentry *, void *); 381 void *rw_v; 382 }; 383 384 /* 385 * Global data specific to the routing socket. 386 */ 387 struct route_info { 388 struct sockaddr ri_dst; 389 struct sockaddr ri_src; 390 struct route_cb ri_cb; 391 int ri_maxqlen; 392 struct ifqueue ri_intrq; 393 void *ri_sih; 394 }; 395 396 extern struct route_info route_info; 397 extern struct rtstat rtstat; 398 399 struct socket; 400 401 void rt_init(void); 402 403 int rt_timer_add(struct rtentry *, 404 void(*)(struct rtentry *, struct rttimer *), 405 struct rttimer_queue *); 406 unsigned long 407 rt_timer_count(struct rttimer_queue *); 408 void rt_timer_queue_change(struct rttimer_queue *, long); 409 struct rttimer_queue * 410 rt_timer_queue_create(u_int); 411 void rt_timer_queue_destroy(struct rttimer_queue *); 412 413 void rt_free(struct rtentry *); 414 void rt_unref(struct rtentry *); 415 416 int rt_update(struct rtentry *, struct rt_addrinfo *, void *); 417 int rt_update_prepare(struct rtentry *); 418 void rt_update_finish(struct rtentry *); 419 420 void rt_newmsg(const int, const struct rtentry *); 421 struct rtentry * 422 rtalloc1(const struct sockaddr *, int); 423 int rtinit(struct ifaddr *, int, int); 424 void rtredirect(const struct sockaddr *, const struct sockaddr *, 425 const struct sockaddr *, int, const struct sockaddr *, 426 struct rtentry **); 427 int rtrequest(int, const struct sockaddr *, 428 const struct sockaddr *, const struct sockaddr *, int, 429 struct rtentry **); 430 int rtrequest1(int, struct rt_addrinfo *, struct rtentry **); 431 int rtrequest_newmsg(const int, const struct sockaddr *, 432 const struct sockaddr *, const struct sockaddr *, const int); 433 434 int rt_ifa_addlocal(struct ifaddr *); 435 int rt_ifa_remlocal(struct ifaddr *, struct ifaddr *); 436 struct ifaddr * 437 rt_get_ifa(struct rtentry *); 438 void rt_replace_ifa(struct rtentry *, struct ifaddr *); 439 int rt_setgate(struct rtentry *, const struct sockaddr *); 440 441 const struct sockaddr * 442 rt_settag(struct rtentry *, const struct sockaddr *); 443 struct sockaddr * 444 rt_gettag(const struct rtentry *); 445 446 int rt_check_reject_route(const struct rtentry *, const struct ifnet *); 447 void rt_delete_matched_entries(sa_family_t, 448 int (*)(struct rtentry *, void *), void *); 449 int rt_walktree(sa_family_t, int (*)(struct rtentry *, void *), void *); 450 451 static __inline void 452 rt_assert_referenced(const struct rtentry *rt) 453 { 454 455 KASSERT(rt->rt_refcnt > 0); 456 } 457 458 void rtcache_copy(struct route *, struct route *); 459 void rtcache_free(struct route *); 460 struct rtentry * 461 rtcache_init(struct route *); 462 struct rtentry * 463 rtcache_init_noclone(struct route *); 464 struct rtentry * 465 rtcache_lookup2(struct route *, const struct sockaddr *, int, 466 int *); 467 int rtcache_setdst(struct route *, const struct sockaddr *); 468 struct rtentry * 469 rtcache_update(struct route *, int); 470 471 static __inline void 472 rtcache_invariants(const struct route *ro) 473 { 474 475 KASSERT(ro->ro_sa != NULL || ro->_ro_rt == NULL); 476 } 477 478 static __inline struct rtentry * 479 rtcache_lookup1(struct route *ro, const struct sockaddr *dst, int clone) 480 { 481 int hit; 482 483 return rtcache_lookup2(ro, dst, clone, &hit); 484 } 485 486 static __inline struct rtentry * 487 rtcache_lookup(struct route *ro, const struct sockaddr *dst) 488 { 489 return rtcache_lookup1(ro, dst, 1); 490 } 491 492 static __inline const struct sockaddr * 493 rtcache_getdst(const struct route *ro) 494 { 495 496 rtcache_invariants(ro); 497 return ro->ro_sa; 498 } 499 500 struct rtentry * 501 rtcache_validate(struct route *); 502 503 void rtcache_unref(struct rtentry *, struct route *); 504 505 /* rtsock */ 506 void rt_ieee80211msg(struct ifnet *, int, void *, size_t); 507 void rt_ifannouncemsg(struct ifnet *, int); 508 void rt_ifmsg(struct ifnet *); 509 void rt_missmsg(int, const struct rt_addrinfo *, int, int); 510 struct mbuf * 511 rt_msg1(int, struct rt_addrinfo *, void *, int); 512 int rt_msg3(int, struct rt_addrinfo *, void *, struct rt_walkarg *, int *); 513 void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *); 514 void route_enqueue(struct mbuf *, int); 515 516 struct llentry; 517 void rt_clonedmsg(const struct sockaddr *, const struct ifnet *, 518 const struct rtentry *); 519 520 void rt_setmetrics(void *, struct rtentry *); 521 522 /* rtbl */ 523 int rt_addaddr(rtbl_t *, struct rtentry *, const struct sockaddr *); 524 void rt_assert_inactive(const struct rtentry *); 525 struct rtentry * 526 rt_deladdr(rtbl_t *, const struct sockaddr *, 527 const struct sockaddr *); 528 rtbl_t *rt_gettable(sa_family_t); 529 int rt_inithead(rtbl_t **, int); 530 struct rtentry * 531 rt_lookup(rtbl_t *, const struct sockaddr *, 532 const struct sockaddr *); 533 struct rtentry * 534 rt_matchaddr(rtbl_t *, const struct sockaddr *); 535 int rt_refines(const struct sockaddr *, const struct sockaddr *); 536 int rtbl_walktree(sa_family_t, int (*)(struct rtentry *, void *), void *); 537 struct rtentry * 538 rtbl_search_matched_entry(sa_family_t, 539 int (*)(struct rtentry *, void *), void *); 540 void rtbl_init(void); 541 542 #endif /* _KERNEL */ 543 544 #endif /* !_NET_ROUTE_H_ */ 545