2 * Copyright (c) 2004-2017 Apple Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
29 * Copyright (c) 1982, 1989, 1993
30 * The Regents of the University of California. All rights reserved.
32 * Redistribution and use in source and binary forms, with or without
33 * modification, are permitted provided that the following conditions
35 * 1. Redistributions of source code must retain the above copyright
36 * notice, this list of conditions and the following disclaimer.
37 * 2. Redistributions in binary form must reproduce the above copyright
38 * notice, this list of conditions and the following disclaimer in the
39 * documentation and/or other materials provided with the distribution.
40 * 3. All advertising materials mentioning features or use of this software
41 * must display the following acknowledgement:
42 * This product includes software developed by the University of
43 * California, Berkeley and its contributors.
44 * 4. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 #include <kern/debug.h>
63 #include <netinet/in_arp.h>
64 #include <sys/types.h>
65 #include <sys/param.h>
66 #include <sys/kernel_types.h>
67 #include <sys/syslog.h>
68 #include <sys/systm.h>
70 #include <sys/kernel.h>
72 #include <sys/sysctl.h>
73 #include <sys/mcache.h>
74 #include <sys/protosw.h>
76 #include <net/if_arp.h>
77 #include <net/if_dl.h>
79 #include <net/if_types.h>
80 #include <net/if_llreach.h>
81 #include <net/route.h>
82 #include <net/nwk_wq.h>
84 #include <netinet/if_ether.h>
85 #include <netinet/in_var.h>
86 #include <netinet/ip.h>
87 #include <netinet/ip6.h>
88 #include <kern/zalloc.h>
90 #include <kern/thread.h>
91 #include <kern/sched_prim.h>
93 #define CONST_LLADDR(s) ((const u_char*)((s)->sdl_data + (s)->sdl_nlen))
95 static const size_t MAX_HW_LEN
= 10;
98 * Synchronization notes:
100 * The global list of ARP entries are stored in llinfo_arp; an entry
101 * gets inserted into the list when the route is created and gets
102 * removed from the list when it is deleted; this is done as part
103 * of RTM_ADD/RTM_RESOLVE/RTM_DELETE in arp_rtrequest().
105 * Because rnh_lock and rt_lock for the entry are held during those
106 * operations, the same locks (and thus lock ordering) must be used
107 * elsewhere to access the relevant data structure fields:
109 * la_le.{le_next,le_prev}, la_rt
111 * - Routing lock (rnh_lock)
113 * la_holdq, la_asked, la_llreach, la_lastused, la_flags
115 * - Routing entry lock (rt_lock)
117 * Due to the dependency on rt_lock, llinfo_arp has the same lifetime
118 * as the route entry itself. When a route is deleted (RTM_DELETE),
119 * it is simply removed from the global list but the memory is not
120 * freed until the route itself is freed.
124 * The following are protected by rnh_lock
126 LIST_ENTRY(llinfo_arp
) la_le
;
127 struct rtentry
*la_rt
;
129 * The following are protected by rt_lock
131 class_queue_t la_holdq
; /* packets awaiting resolution */
132 struct if_llreach
*la_llreach
; /* link-layer reachability record */
133 u_int64_t la_lastused
; /* last used timestamp */
134 u_int32_t la_asked
; /* # of requests sent */
135 u_int32_t la_maxtries
; /* retry limit */
136 u_int64_t la_probeexp
; /* probe deadline timestamp */
137 u_int32_t la_prbreq_cnt
; /* probe request count */
139 #define LLINFO_RTRFAIL_EVTSENT 0x1 /* sent an ARP event */
140 #define LLINFO_PROBING 0x2 /* waiting for an ARP reply */
143 static LIST_HEAD(, llinfo_arp
) llinfo_arp
;
145 static thread_call_t arp_timeout_tcall
;
146 static int arp_timeout_run
; /* arp_timeout is scheduled to run */
147 static void arp_timeout(thread_call_param_t arg0
, thread_call_param_t arg1
);
148 static void arp_sched_timeout(struct timeval
*);
150 static thread_call_t arp_probe_tcall
;
151 static int arp_probe_run
; /* arp_probe is scheduled to run */
152 static void arp_probe(thread_call_param_t arg0
, thread_call_param_t arg1
);
153 static void arp_sched_probe(struct timeval
*);
155 static void arptfree(struct llinfo_arp
*, void *);
156 static errno_t
arp_lookup_route(const struct in_addr
*, int,
157 int, route_t
*, unsigned int);
158 static int arp_getstat SYSCTL_HANDLER_ARGS
;
160 static struct llinfo_arp
*arp_llinfo_alloc(int);
161 static void arp_llinfo_free(void *);
162 static uint32_t arp_llinfo_flushq(struct llinfo_arp
*);
163 static void arp_llinfo_purge(struct rtentry
*);
164 static void arp_llinfo_get_ri(struct rtentry
*, struct rt_reach_info
*);
165 static void arp_llinfo_get_iflri(struct rtentry
*, struct ifnet_llreach_info
*);
166 static void arp_llinfo_refresh(struct rtentry
*);
168 static __inline
void arp_llreach_use(struct llinfo_arp
*);
169 static __inline
int arp_llreach_reachable(struct llinfo_arp
*);
170 static void arp_llreach_alloc(struct rtentry
*, struct ifnet
*, void *,
171 unsigned int, boolean_t
, uint32_t *);
173 extern int tvtohz(struct timeval
*);
175 static int arpinit_done
;
177 SYSCTL_DECL(_net_link_ether
);
178 SYSCTL_NODE(_net_link_ether
, PF_INET
, inet
, CTLFLAG_RW
| CTLFLAG_LOCKED
, 0, "");
180 static int arpt_prune
= (5 * 60 * 1); /* walk list every 5 minutes */
181 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, prune_intvl
,
182 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arpt_prune
, 0, "");
184 #define ARP_PROBE_TIME 7 /* seconds */
185 static u_int32_t arpt_probe
= ARP_PROBE_TIME
;
186 SYSCTL_UINT(_net_link_ether_inet
, OID_AUTO
, probe_intvl
,
187 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arpt_probe
, 0, "");
189 static int arpt_keep
= (20 * 60); /* once resolved, good for 20 more minutes */
190 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, max_age
,
191 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arpt_keep
, 0, "");
193 static int arpt_down
= 20; /* once declared down, don't send for 20 sec */
194 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, host_down_time
,
195 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arpt_down
, 0, "");
197 static int arp_llreach_base
= 120; /* seconds */
198 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, arp_llreach_base
,
199 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_llreach_base
, 0,
200 "default ARP link-layer reachability max lifetime (in seconds)");
202 #define ARP_UNICAST_LIMIT 3 /* # of probes until ARP refresh broadcast */
203 static u_int32_t arp_unicast_lim
= ARP_UNICAST_LIMIT
;
204 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, arp_unicast_lim
,
205 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_unicast_lim
, ARP_UNICAST_LIMIT
,
206 "number of unicast ARP refresh probes before using broadcast");
208 static u_int32_t arp_maxtries
= 5;
209 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, maxtries
,
210 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_maxtries
, 0, "");
212 static u_int32_t arp_maxhold
= 16;
213 SYSCTL_UINT(_net_link_ether_inet
, OID_AUTO
, maxhold
,
214 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_maxhold
, 0, "");
216 static int useloopback
= 1; /* use loopback interface for local traffic */
217 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, useloopback
,
218 CTLFLAG_RW
| CTLFLAG_LOCKED
, &useloopback
, 0, "");
220 static int arp_proxyall
= 0;
221 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, proxyall
,
222 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_proxyall
, 0, "");
224 static int arp_sendllconflict
= 0;
225 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, sendllconflict
,
226 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_sendllconflict
, 0, "");
228 static int log_arp_warnings
= 0; /* Thread safe: no accumulated state */
229 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, log_arp_warnings
,
230 CTLFLAG_RW
| CTLFLAG_LOCKED
,
231 &log_arp_warnings
, 0,
232 "log arp warning messages");
234 static int keep_announcements
= 1; /* Thread safe: no aging of state */
235 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, keep_announcements
,
236 CTLFLAG_RW
| CTLFLAG_LOCKED
,
237 &keep_announcements
, 0,
238 "keep arp announcements");
240 static int send_conflicting_probes
= 1; /* Thread safe: no accumulated state */
241 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, send_conflicting_probes
,
242 CTLFLAG_RW
| CTLFLAG_LOCKED
,
243 &send_conflicting_probes
, 0,
244 "send conflicting link-local arp probes");
246 static int arp_verbose
;
247 SYSCTL_INT(_net_link_ether_inet
, OID_AUTO
, verbose
,
248 CTLFLAG_RW
| CTLFLAG_LOCKED
, &arp_verbose
, 0, "");
251 * Generally protected by rnh_lock; use atomic operations on fields
252 * that are also modified outside of that lock (if needed).
254 struct arpstat arpstat
__attribute__((aligned(sizeof(uint64_t))));
255 SYSCTL_PROC(_net_link_ether_inet
, OID_AUTO
, stats
,
256 CTLTYPE_STRUCT
| CTLFLAG_RD
| CTLFLAG_LOCKED
,
257 0, 0, arp_getstat
, "S,arpstat",
258 "ARP statistics (struct arpstat, net/if_arp.h)");
260 static struct zone
*llinfo_arp_zone
;
261 #define LLINFO_ARP_ZONE_MAX 256 /* maximum elements in zone */
262 #define LLINFO_ARP_ZONE_NAME "llinfo_arp" /* name for zone */
267 VERIFY(!arpinit_done
);
269 LIST_INIT(&llinfo_arp
);
271 llinfo_arp_zone
= zinit(sizeof(struct llinfo_arp
),
272 LLINFO_ARP_ZONE_MAX
* sizeof(struct llinfo_arp
), 0,
273 LLINFO_ARP_ZONE_NAME
);
274 if (llinfo_arp_zone
== NULL
) {
275 panic("%s: failed allocating llinfo_arp_zone", __func__
);
278 zone_change(llinfo_arp_zone
, Z_EXPAND
, TRUE
);
279 zone_change(llinfo_arp_zone
, Z_CALLERACCT
, FALSE
);
284 static struct llinfo_arp
*
285 arp_llinfo_alloc(int how
)
287 struct llinfo_arp
*la
;
289 la
= (how
== M_WAITOK
) ? zalloc(llinfo_arp_zone
) :
290 zalloc_noblock(llinfo_arp_zone
);
292 bzero(la
, sizeof(*la
));
294 * The type of queue (Q_DROPHEAD) here is just a hint;
295 * the actual logic that works on this queue performs
296 * a head drop, details in arp_llinfo_addq().
298 _qinit(&la
->la_holdq
, Q_DROPHEAD
, (arp_maxhold
== 0) ?
299 (uint32_t)-1 : arp_maxhold
, QP_MBUF
);
306 arp_llinfo_free(void *arg
)
308 struct llinfo_arp
*la
= arg
;
310 if (la
->la_le
.le_next
!= NULL
|| la
->la_le
.le_prev
!= NULL
) {
311 panic("%s: trying to free %p when it is in use", __func__
, la
);
315 /* Free any held packets */
316 (void) arp_llinfo_flushq(la
);
318 /* Purge any link-layer info caching */
319 VERIFY(la
->la_rt
->rt_llinfo
== la
);
320 if (la
->la_rt
->rt_llinfo_purge
!= NULL
) {
321 la
->la_rt
->rt_llinfo_purge(la
->la_rt
);
324 zfree(llinfo_arp_zone
, la
);
328 arp_llinfo_addq(struct llinfo_arp
*la
, struct mbuf
*m
)
330 if (qlen(&la
->la_holdq
) >= qlimit(&la
->la_holdq
)) {
332 /* prune less than CTL, else take what's at the head */
333 _m
= _getq_scidx_lt(&la
->la_holdq
, SCIDX_CTL
);
335 _m
= _getq(&la
->la_holdq
);
339 log(LOG_DEBUG
, "%s: dropping packet (scidx %u)\n",
340 __func__
, MBUF_SCIDX(mbuf_get_service_class(_m
)));
343 atomic_add_32(&arpstat
.dropped
, 1);
344 atomic_add_32(&arpstat
.held
, -1);
346 _addq(&la
->la_holdq
, m
);
347 atomic_add_32(&arpstat
.held
, 1);
349 log(LOG_DEBUG
, "%s: enqueued packet (scidx %u), qlen now %u\n",
350 __func__
, MBUF_SCIDX(mbuf_get_service_class(m
)),
351 qlen(&la
->la_holdq
));
356 arp_llinfo_flushq(struct llinfo_arp
*la
)
358 uint32_t held
= qlen(&la
->la_holdq
);
361 atomic_add_32(&arpstat
.purged
, held
);
362 atomic_add_32(&arpstat
.held
, -held
);
363 _flushq(&la
->la_holdq
);
365 la
->la_prbreq_cnt
= 0;
366 VERIFY(qempty(&la
->la_holdq
));
371 arp_llinfo_purge(struct rtentry
*rt
)
373 struct llinfo_arp
*la
= rt
->rt_llinfo
;
375 RT_LOCK_ASSERT_HELD(rt
);
376 VERIFY(rt
->rt_llinfo_purge
== arp_llinfo_purge
&& la
!= NULL
);
378 if (la
->la_llreach
!= NULL
) {
380 ifnet_llreach_free(la
->la_llreach
);
381 la
->la_llreach
= NULL
;
387 arp_llinfo_get_ri(struct rtentry
*rt
, struct rt_reach_info
*ri
)
389 struct llinfo_arp
*la
= rt
->rt_llinfo
;
390 struct if_llreach
*lr
= la
->la_llreach
;
393 bzero(ri
, sizeof(*ri
));
394 ri
->ri_rssi
= IFNET_RSSI_UNKNOWN
;
395 ri
->ri_lqm
= IFNET_LQM_THRESH_OFF
;
396 ri
->ri_npm
= IFNET_NPM_THRESH_UNKNOWN
;
399 /* Export to rt_reach_info structure */
401 /* Export ARP send expiration (calendar) time */
403 ifnet_llreach_up2calexp(lr
, la
->la_lastused
);
409 arp_llinfo_get_iflri(struct rtentry
*rt
, struct ifnet_llreach_info
*iflri
)
411 struct llinfo_arp
*la
= rt
->rt_llinfo
;
412 struct if_llreach
*lr
= la
->la_llreach
;
415 bzero(iflri
, sizeof(*iflri
));
416 iflri
->iflri_rssi
= IFNET_RSSI_UNKNOWN
;
417 iflri
->iflri_lqm
= IFNET_LQM_THRESH_OFF
;
418 iflri
->iflri_npm
= IFNET_NPM_THRESH_UNKNOWN
;
421 /* Export to ifnet_llreach_info structure */
422 ifnet_lr2iflri(lr
, iflri
);
423 /* Export ARP send expiration (uptime) time */
424 iflri
->iflri_snd_expire
=
425 ifnet_llreach_up2upexp(lr
, la
->la_lastused
);
431 arp_llinfo_refresh(struct rtentry
*rt
)
433 uint64_t timenow
= net_uptime();
435 * If route entry is permanent or if expiry is less
436 * than timenow and extra time taken for unicast probe
437 * we can't expedite the refresh
439 if ((rt
->rt_expire
== 0) ||
440 (rt
->rt_flags
& RTF_STATIC
) ||
441 !(rt
->rt_flags
& RTF_LLINFO
)) {
445 if (rt
->rt_expire
> timenow
) {
446 rt
->rt_expire
= timenow
;
452 arp_llreach_set_reachable(struct ifnet
*ifp
, void *addr
, unsigned int alen
)
454 /* Nothing more to do if it's disabled */
455 if (arp_llreach_base
== 0) {
459 ifnet_llreach_set_reachable(ifp
, ETHERTYPE_IP
, addr
, alen
);
463 arp_llreach_use(struct llinfo_arp
*la
)
465 if (la
->la_llreach
!= NULL
) {
466 la
->la_lastused
= net_uptime();
471 arp_llreach_reachable(struct llinfo_arp
*la
)
473 struct if_llreach
*lr
;
474 const char *why
= NULL
;
476 /* Nothing more to do if it's disabled; pretend it's reachable */
477 if (arp_llreach_base
== 0) {
481 if ((lr
= la
->la_llreach
) == NULL
) {
483 * Link-layer reachability record isn't present for this
484 * ARP entry; pretend it's reachable and use it as is.
487 } else if (ifnet_llreach_reachable(lr
)) {
489 * Record is present, it's not shared with other ARP
490 * entries and a packet has recently been received
491 * from the remote host; consider it reachable.
493 if (lr
->lr_reqcnt
== 1) {
497 /* Prime it up, if this is the first time */
498 if (la
->la_lastused
== 0) {
499 VERIFY(la
->la_llreach
!= NULL
);
504 * Record is present and shared with one or more ARP
505 * entries, and a packet has recently been received
506 * from the remote host. Since it's shared by more
507 * than one IP addresses, we can't rely on the link-
508 * layer reachability alone; consider it reachable if
509 * this ARP entry has been used "recently."
511 if (ifnet_llreach_reachable_delta(lr
, la
->la_lastused
)) {
515 why
= "has alias(es) and hasn't been used in a while";
517 why
= "haven't heard from it in a while";
520 if (arp_verbose
> 1) {
521 char tmp
[MAX_IPv4_STR_LEN
];
522 u_int64_t now
= net_uptime();
524 log(LOG_DEBUG
, "%s: ARP probe(s) needed for %s; "
525 "%s [lastused %lld, lastrcvd %lld] secs ago\n",
526 if_name(lr
->lr_ifp
), inet_ntop(AF_INET
,
527 &SIN(rt_key(la
->la_rt
))->sin_addr
, tmp
, sizeof(tmp
)), why
,
528 (la
->la_lastused
? (int64_t)(now
- la
->la_lastused
) : -1),
529 (lr
->lr_lastrcvd
? (int64_t)(now
- lr
->lr_lastrcvd
) : -1));
535 * Obtain a link-layer source cache entry for the sender.
537 * NOTE: This is currently only for ARP/Ethernet.
540 arp_llreach_alloc(struct rtentry
*rt
, struct ifnet
*ifp
, void *addr
,
541 unsigned int alen
, boolean_t solicited
, uint32_t *p_rt_event_code
)
543 VERIFY(rt
->rt_expire
== 0 || rt
->rt_rmx
.rmx_expire
!= 0);
544 VERIFY(rt
->rt_expire
!= 0 || rt
->rt_rmx
.rmx_expire
== 0);
546 if (arp_llreach_base
!= 0 && rt
->rt_expire
!= 0 &&
547 !(rt
->rt_ifp
->if_flags
& IFF_LOOPBACK
) &&
548 ifp
->if_addrlen
== IF_LLREACH_MAXLEN
&& /* Ethernet */
549 alen
== ifp
->if_addrlen
) {
550 struct llinfo_arp
*la
= rt
->rt_llinfo
;
551 struct if_llreach
*lr
;
552 const char *why
= NULL
, *type
= "";
554 /* Become a regular mutex, just in case */
557 if ((lr
= la
->la_llreach
) != NULL
) {
558 type
= (solicited
? "ARP reply" : "ARP announcement");
560 * If target has changed, create a new record;
561 * otherwise keep existing record.
564 if (bcmp(addr
, lr
->lr_key
.addr
, alen
) != 0) {
566 /* Purge any link-layer info caching */
567 VERIFY(rt
->rt_llinfo_purge
!= NULL
);
568 rt
->rt_llinfo_purge(rt
);
570 why
= " for different target HW address; "
571 "using new llreach record";
572 *p_rt_event_code
= ROUTE_LLENTRY_CHANGED
;
575 * If we were doing unicast probing, we need to
576 * deliver an event for neighbor cache resolution
578 if (lr
->lr_probes
!= 0) {
579 *p_rt_event_code
= ROUTE_LLENTRY_RESOLVED
;
582 lr
->lr_probes
= 0; /* reset probe count */
585 why
= " for same target HW address; "
586 "keeping existing llreach record";
592 lr
= la
->la_llreach
= ifnet_llreach_alloc(ifp
,
593 ETHERTYPE_IP
, addr
, alen
, arp_llreach_base
);
595 lr
->lr_probes
= 0; /* reset probe count */
597 why
= "creating new llreach record";
600 *p_rt_event_code
= ROUTE_LLENTRY_RESOLVED
;
603 if (arp_verbose
> 1 && lr
!= NULL
&& why
!= NULL
) {
604 char tmp
[MAX_IPv4_STR_LEN
];
606 log(LOG_DEBUG
, "%s: %s%s for %s\n", if_name(ifp
),
607 type
, why
, inet_ntop(AF_INET
,
608 &SIN(rt_key(rt
))->sin_addr
, tmp
, sizeof(tmp
)));
628 arptfree(struct llinfo_arp
*la
, void *arg
)
630 struct arptf_arg
*ap
= arg
;
631 struct rtentry
*rt
= la
->la_rt
;
634 LCK_MTX_ASSERT(rnh_lock
, LCK_MTX_ASSERT_OWNED
);
636 /* rnh_lock acquired by caller protects rt from going away */
639 VERIFY(rt
->rt_expire
== 0 || rt
->rt_rmx
.rmx_expire
!= 0);
640 VERIFY(rt
->rt_expire
!= 0 || rt
->rt_rmx
.rmx_expire
== 0);
643 timenow
= net_uptime();
645 /* If we're probing, flush out held packets upon probe expiration */
646 if (ap
->probing
&& (la
->la_flags
& LLINFO_PROBING
) &&
647 la
->la_probeexp
<= timenow
) {
648 struct sockaddr_dl
*sdl
= SDL(rt
->rt_gateway
);
652 (void) arp_llinfo_flushq(la
);
654 * Enqueue work item to invoke callback for this route entry
656 route_event_enqueue_nwk_wq_entry(rt
, NULL
,
657 ROUTE_LLENTRY_UNREACH
, NULL
, TRUE
);
661 * The following is mostly being used to arm the timer
662 * again and for logging.
663 * qlen is used to re-arm the timer. Therefore, pure probe
664 * requests can be considered as 0 length packets
665 * contributing only to length but not to the size.
667 ap
->qlen
+= qlen(&la
->la_holdq
);
668 ap
->qlen
+= la
->la_prbreq_cnt
;
669 ap
->qsize
+= qsize(&la
->la_holdq
);
671 if (rt
->rt_expire
== 0 || (rt
->rt_flags
& RTF_STATIC
)) {
673 /* ARP entry is permanent? */
674 if (rt
->rt_expire
== 0) {
680 /* ARP entry hasn't expired and we're not draining? */
681 if (!ap
->draining
&& rt
->rt_expire
> timenow
) {
687 if (rt
->rt_refcnt
> 0) {
689 * ARP entry has expired, with outstanding refcnt.
690 * If we're not draining, force ARP query to be
691 * generated next time this entry is used.
693 if (!ap
->draining
&& !ap
->probing
) {
694 struct sockaddr_dl
*sdl
= SDL(rt
->rt_gateway
);
699 rt
->rt_flags
&= ~RTF_REJECT
;
702 } else if (!(rt
->rt_flags
& RTF_STATIC
) && !ap
->probing
) {
704 * ARP entry has no outstanding refcnt, and we're either
705 * draining or it has expired; delete it from the routing
706 * table. Safe to drop rt_lock and use rt_key, since holding
707 * rnh_lock here prevents another thread from calling
708 * rt_setgate() on this route.
711 rtrequest_locked(RTM_DELETE
, rt_key(rt
), NULL
,
712 rt_mask(rt
), 0, NULL
);
716 /* ARP entry is static; let it linger */
722 in_arpdrain(void *arg
)
725 struct llinfo_arp
*la
, *ola
;
726 struct arptf_arg farg
;
729 log(LOG_DEBUG
, "%s: draining ARP entries\n", __func__
);
732 lck_mtx_lock(rnh_lock
);
733 la
= llinfo_arp
.lh_first
;
734 bzero(&farg
, sizeof(farg
));
735 farg
.draining
= TRUE
;
736 while ((ola
= la
) != NULL
) {
737 la
= la
->la_le
.le_next
;
738 arptfree(ola
, &farg
);
741 log(LOG_DEBUG
, "%s: found %u, aging %u, sticky %u, killed %u; "
742 "%u pkts held (%u bytes)\n", __func__
, farg
.found
,
743 farg
.aging
, farg
.sticky
, farg
.killed
, farg
.qlen
,
746 lck_mtx_unlock(rnh_lock
);
750 * Timeout routine. Age arp_tab entries periodically.
753 arp_timeout(thread_call_param_t arg0
, thread_call_param_t arg1
)
755 #pragma unused(arg0, arg1)
756 struct llinfo_arp
*la
, *ola
;
758 struct arptf_arg farg
;
760 lck_mtx_lock(rnh_lock
);
761 la
= llinfo_arp
.lh_first
;
762 bzero(&farg
, sizeof(farg
));
763 while ((ola
= la
) != NULL
) {
764 la
= la
->la_le
.le_next
;
765 arptfree(ola
, &farg
);
768 log(LOG_DEBUG
, "%s: found %u, aging %u, sticky %u, killed %u; "
769 "%u pkts held (%u bytes)\n", __func__
, farg
.found
,
770 farg
.aging
, farg
.sticky
, farg
.killed
, farg
.qlen
,
774 atv
.tv_sec
= MAX(arpt_prune
, 5);
775 /* re-arm the timer if there's work to do */
777 if (farg
.aging
> 0) {
778 arp_sched_timeout(&atv
);
779 } else if (arp_verbose
) {
780 log(LOG_DEBUG
, "%s: not rescheduling timer\n", __func__
);
782 lck_mtx_unlock(rnh_lock
);
786 arp_sched_timeout(struct timeval
*atv
)
788 LCK_MTX_ASSERT(rnh_lock
, LCK_MTX_ASSERT_OWNED
);
790 if (!arp_timeout_run
) {
792 uint64_t deadline
= 0;
794 if (arp_timeout_tcall
== NULL
) {
796 thread_call_allocate(arp_timeout
, NULL
);
797 VERIFY(arp_timeout_tcall
!= NULL
);
802 tv
.tv_sec
= MAX(arpt_prune
/ 5, 1);
806 log(LOG_DEBUG
, "%s: timer scheduled in "
807 "T+%llus.%lluu\n", __func__
,
808 (uint64_t)atv
->tv_sec
, (uint64_t)atv
->tv_usec
);
812 clock_deadline_for_periodic_event(atv
->tv_sec
* NSEC_PER_SEC
,
813 mach_absolute_time(), &deadline
);
814 (void) thread_call_enter_delayed(arp_timeout_tcall
, deadline
);
822 arp_probe(thread_call_param_t arg0
, thread_call_param_t arg1
)
824 #pragma unused(arg0, arg1)
825 struct llinfo_arp
*la
, *ola
;
827 struct arptf_arg farg
;
829 lck_mtx_lock(rnh_lock
);
830 la
= llinfo_arp
.lh_first
;
831 bzero(&farg
, sizeof(farg
));
833 while ((ola
= la
) != NULL
) {
834 la
= la
->la_le
.le_next
;
835 arptfree(ola
, &farg
);
838 log(LOG_DEBUG
, "%s: found %u, aging %u, sticky %u, killed %u; "
839 "%u pkts held (%u bytes)\n", __func__
, farg
.found
,
840 farg
.aging
, farg
.sticky
, farg
.killed
, farg
.qlen
,
844 atv
.tv_sec
= MAX(arpt_probe
, ARP_PROBE_TIME
);
845 /* re-arm the probe if there's work to do */
848 arp_sched_probe(&atv
);
849 } else if (arp_verbose
) {
850 log(LOG_DEBUG
, "%s: not rescheduling probe\n", __func__
);
852 lck_mtx_unlock(rnh_lock
);
856 arp_sched_probe(struct timeval
*atv
)
858 LCK_MTX_ASSERT(rnh_lock
, LCK_MTX_ASSERT_OWNED
);
860 if (!arp_probe_run
) {
862 uint64_t deadline
= 0;
864 if (arp_probe_tcall
== NULL
) {
866 thread_call_allocate(arp_probe
, NULL
);
867 VERIFY(arp_probe_tcall
!= NULL
);
872 tv
.tv_sec
= MAX(arpt_probe
, ARP_PROBE_TIME
);
876 log(LOG_DEBUG
, "%s: probe scheduled in "
877 "T+%llus.%lluu\n", __func__
,
878 (uint64_t)atv
->tv_sec
, (uint64_t)atv
->tv_usec
);
882 clock_deadline_for_periodic_event(atv
->tv_sec
* NSEC_PER_SEC
,
883 mach_absolute_time(), &deadline
);
884 (void) thread_call_enter_delayed(arp_probe_tcall
, deadline
);
889 * ifa_rtrequest() callback
892 arp_rtrequest(int req
, struct rtentry
*rt
, struct sockaddr
*sa
)
895 struct sockaddr
*gate
= rt
->rt_gateway
;
896 struct llinfo_arp
*la
= rt
->rt_llinfo
;
897 static struct sockaddr_dl null_sdl
=
898 { .sdl_len
= sizeof(null_sdl
), .sdl_family
= AF_LINK
};
900 char buf
[MAX_IPv4_STR_LEN
];
902 VERIFY(arpinit_done
);
903 LCK_MTX_ASSERT(rnh_lock
, LCK_MTX_ASSERT_OWNED
);
904 RT_LOCK_ASSERT_HELD(rt
);
906 if (rt
->rt_flags
& RTF_GATEWAY
) {
910 timenow
= net_uptime();
914 * XXX: If this is a manually added route to interface
915 * such as older version of routed or gated might provide,
916 * restore cloning bit.
918 if (!(rt
->rt_flags
& RTF_HOST
) && rt_mask(rt
) != NULL
&&
919 SIN(rt_mask(rt
))->sin_addr
.s_addr
!= INADDR_BROADCAST
) {
920 rt
->rt_flags
|= RTF_CLONING
;
923 if (rt
->rt_flags
& RTF_CLONING
) {
925 * Case 1: This route should come from a route to iface.
927 if (rt_setgate(rt
, rt_key(rt
), SA(&null_sdl
)) == 0) {
928 gate
= rt
->rt_gateway
;
929 SDL(gate
)->sdl_type
= rt
->rt_ifp
->if_type
;
930 SDL(gate
)->sdl_index
= rt
->rt_ifp
->if_index
;
932 * In case we're called before 1.0 sec.
935 rt_setexpire(rt
, MAX(timenow
, 1));
939 /* Announce a new entry if requested. */
940 if (rt
->rt_flags
& RTF_ANNOUNCE
) {
942 arp_llreach_use(la
); /* Mark use timestamp */
945 dlil_send_arp(rt
->rt_ifp
, ARPOP_REQUEST
,
946 SDL(gate
), rt_key(rt
), NULL
, rt_key(rt
), 0);
948 arpstat
.txannounces
++;
952 if (gate
->sa_family
!= AF_LINK
||
953 gate
->sa_len
< sizeof(null_sdl
)) {
954 arpstat
.invalidreqs
++;
955 log(LOG_ERR
, "%s: route to %s has bad gateway address "
956 "(sa_family %u sa_len %u) on %s\n",
957 __func__
, inet_ntop(AF_INET
,
958 &SIN(rt_key(rt
))->sin_addr
.s_addr
, buf
,
959 sizeof(buf
)), gate
->sa_family
, gate
->sa_len
,
960 if_name(rt
->rt_ifp
));
963 SDL(gate
)->sdl_type
= rt
->rt_ifp
->if_type
;
964 SDL(gate
)->sdl_index
= rt
->rt_ifp
->if_index
;
967 break; /* This happens on a route change */
970 * Case 2: This route may come from cloning, or a manual route
971 * add with a LL address.
973 rt
->rt_llinfo
= la
= arp_llinfo_alloc(M_WAITOK
);
978 rt
->rt_llinfo_get_ri
= arp_llinfo_get_ri
;
979 rt
->rt_llinfo_get_iflri
= arp_llinfo_get_iflri
;
980 rt
->rt_llinfo_purge
= arp_llinfo_purge
;
981 rt
->rt_llinfo_free
= arp_llinfo_free
;
982 rt
->rt_llinfo_refresh
= arp_llinfo_refresh
;
983 rt
->rt_flags
|= RTF_LLINFO
;
985 LIST_INSERT_HEAD(&llinfo_arp
, la
, la_le
);
988 /* We have at least one entry; arm the timer if not already */
989 arp_sched_timeout(NULL
);
992 * This keeps the multicast addresses from showing up
993 * in `arp -a' listings as unresolved. It's not actually
994 * functional. Then the same for broadcast. For IPv4
995 * link-local address, keep the entry around even after
998 if (IN_MULTICAST(ntohl(SIN(rt_key(rt
))->sin_addr
.s_addr
))) {
1000 dlil_resolve_multi(rt
->rt_ifp
, rt_key(rt
), gate
,
1001 sizeof(struct sockaddr_dl
));
1003 rt_setexpire(rt
, 0);
1004 } else if (in_broadcast(SIN(rt_key(rt
))->sin_addr
,
1006 struct sockaddr_dl
*gate_ll
= SDL(gate
);
1007 size_t broadcast_len
;
1008 ifnet_llbroadcast_copy_bytes(rt
->rt_ifp
,
1009 LLADDR(gate_ll
), sizeof(gate_ll
->sdl_data
),
1011 gate_ll
->sdl_alen
= broadcast_len
;
1012 gate_ll
->sdl_family
= AF_LINK
;
1013 gate_ll
->sdl_len
= sizeof(struct sockaddr_dl
);
1014 /* In case we're called before 1.0 sec. has elapsed */
1015 rt_setexpire(rt
, MAX(timenow
, 1));
1016 } else if (IN_LINKLOCAL(ntohl(SIN(rt_key(rt
))->
1017 sin_addr
.s_addr
))) {
1018 rt
->rt_flags
|= RTF_STATIC
;
1021 /* Set default maximum number of retries */
1022 la
->la_maxtries
= arp_maxtries
;
1024 /* Become a regular mutex, just in case */
1025 RT_CONVERT_LOCK(rt
);
1026 IFA_LOCK_SPIN(rt
->rt_ifa
);
1027 if (SIN(rt_key(rt
))->sin_addr
.s_addr
==
1028 (IA_SIN(rt
->rt_ifa
))->sin_addr
.s_addr
) {
1029 IFA_UNLOCK(rt
->rt_ifa
);
1031 * This test used to be
1032 * if (loif.if_flags & IFF_UP)
1033 * It allowed local traffic to be forced through the
1034 * hardware by configuring the loopback down. However,
1035 * it causes problems during network configuration
1036 * for boards that can't receive packets they send.
1037 * It is now necessary to clear "useloopback" and
1038 * remove the route to force traffic out to the
1041 rt_setexpire(rt
, 0);
1042 ifnet_lladdr_copy_bytes(rt
->rt_ifp
, LLADDR(SDL(gate
)),
1043 SDL(gate
)->sdl_alen
= rt
->rt_ifp
->if_addrlen
);
1045 if (rt
->rt_ifp
!= lo_ifp
) {
1047 * Purge any link-layer info caching.
1049 if (rt
->rt_llinfo_purge
!= NULL
) {
1050 rt
->rt_llinfo_purge(rt
);
1054 * Adjust route ref count for the
1057 if (rt
->rt_if_ref_fn
!= NULL
) {
1058 rt
->rt_if_ref_fn(lo_ifp
, 1);
1059 rt
->rt_if_ref_fn(rt
->rt_ifp
, -1);
1062 rt
->rt_ifp
= lo_ifp
;
1064 * If rmx_mtu is not locked, update it
1065 * to the MTU used by the new interface.
1067 if (!(rt
->rt_rmx
.rmx_locks
& RTV_MTU
)) {
1068 rt
->rt_rmx
.rmx_mtu
= rt
->rt_ifp
->if_mtu
;
1072 IFA_UNLOCK(rt
->rt_ifa
);
1081 * Unchain it but defer the actual freeing until the route
1082 * itself is to be freed. rt->rt_llinfo still points to
1083 * llinfo_arp, and likewise, la->la_rt still points to this
1084 * route entry, except that RTF_LLINFO is now cleared.
1086 LIST_REMOVE(la
, la_le
);
1087 la
->la_le
.le_next
= NULL
;
1088 la
->la_le
.le_prev
= NULL
;
1092 * Purge any link-layer info caching.
1094 if (rt
->rt_llinfo_purge
!= NULL
) {
1095 rt
->rt_llinfo_purge(rt
);
1098 rt
->rt_flags
&= ~RTF_LLINFO
;
1099 (void) arp_llinfo_flushq(la
);
1104 * convert hardware address to hex string for logging errors.
1107 sdl_addr_to_hex(const struct sockaddr_dl
*sdl
, char *orig_buf
, int buflen
)
1109 char *buf
= orig_buf
;
1111 const u_char
*lladdr
= (u_char
*)(size_t)sdl
->sdl_data
;
1112 int maxbytes
= buflen
/ 3;
1114 if (maxbytes
> sdl
->sdl_alen
) {
1115 maxbytes
= sdl
->sdl_alen
;
1118 for (i
= 0; i
< maxbytes
; i
++) {
1119 snprintf(buf
, 3, "%02x", lladdr
[i
]);
1121 *buf
= (i
== maxbytes
- 1) ? '\0' : ':';
1128 * arp_lookup_route will lookup the route for a given address.
1130 * The address must be for a host on a local network on this interface.
1131 * If the returned route is non-NULL, the route is locked and the caller
1132 * is responsible for unlocking it and releasing its reference.
1135 arp_lookup_route(const struct in_addr
*addr
, int create
, int proxy
,
1136 route_t
*route
, unsigned int ifscope
)
1138 struct sockaddr_inarp sin
=
1139 { sizeof(sin
), AF_INET
, 0, { 0 }, { 0 }, 0, 0 };
1140 const char *why
= NULL
;
1146 sin
.sin_addr
.s_addr
= addr
->s_addr
;
1147 sin
.sin_other
= proxy
? SIN_PROXY
: 0;
1150 * If the destination is a link-local address, don't
1151 * constrain the lookup (don't scope it).
1153 if (IN_LINKLOCAL(ntohl(addr
->s_addr
))) {
1154 ifscope
= IFSCOPE_NONE
;
1157 rt
= rtalloc1_scoped((struct sockaddr
*)&sin
, create
, 0, ifscope
);
1164 if (rt
->rt_flags
& RTF_GATEWAY
) {
1165 why
= "host is not on local network";
1166 error
= ENETUNREACH
;
1167 } else if (!(rt
->rt_flags
& RTF_LLINFO
)) {
1168 why
= "could not allocate llinfo";
1170 } else if (rt
->rt_gateway
->sa_family
!= AF_LINK
) {
1171 why
= "gateway route is not ours";
1172 error
= EPROTONOSUPPORT
;
1176 if (create
&& (arp_verbose
|| log_arp_warnings
)) {
1177 char tmp
[MAX_IPv4_STR_LEN
];
1178 log(LOG_DEBUG
, "%s: link#%d %s failed: %s\n",
1179 __func__
, ifscope
, inet_ntop(AF_INET
, addr
, tmp
,
1184 * If there are no references to this route, and it is
1185 * a cloned route, and not static, and ARP had created
1186 * the route, then purge it from the routing table as
1187 * it is probably bogus.
1189 if (rt
->rt_refcnt
== 1 &&
1190 (rt
->rt_flags
& (RTF_WASCLONED
| RTF_STATIC
)) ==
1193 * Prevent another thread from modiying rt_key,
1194 * rt_gateway via rt_setgate() after rt_lock is
1195 * dropped by marking the route as defunct.
1197 rt
->rt_flags
|= RTF_CONDEMNED
;
1199 rtrequest(RTM_DELETE
, rt_key(rt
), rt
->rt_gateway
,
1200 rt_mask(rt
), rt
->rt_flags
, NULL
);
1203 RT_REMREF_LOCKED(rt
);
1210 * Caller releases reference and does RT_UNLOCK(rt).
1217 arp_is_entry_probing(route_t p_route
)
1219 struct llinfo_arp
*llinfo
= p_route
->rt_llinfo
;
1221 if (llinfo
!= NULL
&&
1222 llinfo
->la_llreach
!= NULL
&&
1223 llinfo
->la_llreach
->lr_probes
!= 0) {
1231 * This is the ARP pre-output routine; care must be taken to ensure that
1232 * the "hint" route never gets freed via rtfree(), since the caller may
1233 * have stored it inside a struct route with a reference held for that
1237 arp_lookup_ip(ifnet_t ifp
, const struct sockaddr_in
*net_dest
,
1238 struct sockaddr_dl
*ll_dest
, size_t ll_dest_len
, route_t hint
,
1241 route_t route
= NULL
; /* output route */
1243 struct sockaddr_dl
*gateway
;
1244 struct llinfo_arp
*llinfo
= NULL
;
1245 boolean_t usable
, probing
= FALSE
;
1247 struct if_llreach
*lr
;
1248 struct ifaddr
*rt_ifa
;
1249 struct sockaddr
*sa
;
1251 struct sockaddr_dl sdl
;
1252 boolean_t send_probe_notif
= FALSE
;
1254 if (ifp
== NULL
|| net_dest
== NULL
) {
1258 if (net_dest
->sin_family
!= AF_INET
) {
1259 return EAFNOSUPPORT
;
1262 if ((ifp
->if_flags
& (IFF_UP
| IFF_RUNNING
)) != (IFF_UP
| IFF_RUNNING
)) {
1267 * If we were given a route, verify the route and grab the gateway
1271 * Callee holds a reference on the route and returns
1272 * with the route entry locked, upon success.
1274 result
= route_to_gwroute((const struct sockaddr
*)
1275 net_dest
, hint
, &route
);
1279 if (route
!= NULL
) {
1280 RT_LOCK_ASSERT_HELD(route
);
1284 if ((packet
!= NULL
&& (packet
->m_flags
& M_BCAST
)) ||
1285 in_broadcast(net_dest
->sin_addr
, ifp
)) {
1286 size_t broadcast_len
;
1287 bzero(ll_dest
, ll_dest_len
);
1288 result
= ifnet_llbroadcast_copy_bytes(ifp
, LLADDR(ll_dest
),
1289 ll_dest_len
- offsetof(struct sockaddr_dl
, sdl_data
),
1292 ll_dest
->sdl_alen
= broadcast_len
;
1293 ll_dest
->sdl_family
= AF_LINK
;
1294 ll_dest
->sdl_len
= sizeof(struct sockaddr_dl
);
1298 if ((packet
!= NULL
&& (packet
->m_flags
& M_MCAST
)) ||
1299 ((ifp
->if_flags
& IFF_MULTICAST
) &&
1300 IN_MULTICAST(ntohl(net_dest
->sin_addr
.s_addr
)))) {
1301 if (route
!= NULL
) {
1304 result
= dlil_resolve_multi(ifp
,
1305 (const struct sockaddr
*)net_dest
,
1306 (struct sockaddr
*)ll_dest
, ll_dest_len
);
1307 if (route
!= NULL
) {
1314 * If we didn't find a route, or the route doesn't have
1315 * link layer information, trigger the creation of the
1316 * route and link layer information.
1318 if (route
== NULL
|| route
->rt_llinfo
== NULL
) {
1319 /* Clean up now while we can */
1320 if (route
!= NULL
) {
1321 if (route
== hint
) {
1322 RT_REMREF_LOCKED(route
);
1330 * Callee holds a reference on the route and returns
1331 * with the route entry locked, upon success.
1333 result
= arp_lookup_route(&net_dest
->sin_addr
, 1, 0, &route
,
1336 RT_LOCK_ASSERT_HELD(route
);
1340 if (result
|| route
== NULL
|| (llinfo
= route
->rt_llinfo
) == NULL
) {
1341 /* In case result is 0 but no route, return an error */
1343 result
= EHOSTUNREACH
;
1346 if (route
!= NULL
&& route
->rt_llinfo
== NULL
) {
1347 char tmp
[MAX_IPv4_STR_LEN
];
1348 log(LOG_ERR
, "%s: can't allocate llinfo for %s\n",
1349 __func__
, inet_ntop(AF_INET
, &net_dest
->sin_addr
,
1356 * Now that we have the right route, is it filled in?
1358 gateway
= SDL(route
->rt_gateway
);
1359 timenow
= net_uptime();
1360 VERIFY(route
->rt_expire
== 0 || route
->rt_rmx
.rmx_expire
!= 0);
1361 VERIFY(route
->rt_expire
!= 0 || route
->rt_rmx
.rmx_expire
== 0);
1363 usable
= ((route
->rt_expire
== 0 || route
->rt_expire
> timenow
) &&
1364 gateway
!= NULL
&& gateway
->sdl_family
== AF_LINK
&&
1365 gateway
->sdl_alen
!= 0);
1368 boolean_t unreachable
= !arp_llreach_reachable(llinfo
);
1370 /* Entry is usable, so fill in info for caller */
1371 bcopy(gateway
, ll_dest
, MIN(gateway
->sdl_len
, ll_dest_len
));
1373 arp_llreach_use(llinfo
); /* Mark use timestamp */
1375 lr
= llinfo
->la_llreach
;
1379 rt_ifa
= route
->rt_ifa
;
1381 /* Become a regular mutex, just in case */
1382 RT_CONVERT_LOCK(route
);
1385 if ((unreachable
|| (llinfo
->la_flags
& LLINFO_PROBING
)) &&
1386 lr
->lr_probes
< arp_unicast_lim
) {
1388 * Thus mark the entry with la_probeexp deadline to
1389 * trigger the probe timer to be scheduled (if not
1390 * already). This gets cleared the moment we get
1394 if (lr
->lr_probes
== 0) {
1395 llinfo
->la_probeexp
= (timenow
+ arpt_probe
);
1396 llinfo
->la_flags
|= LLINFO_PROBING
;
1398 * Provide notification that ARP unicast
1399 * probing has started.
1400 * We only do it for the first unicast probe
1403 send_probe_notif
= TRUE
;
1407 * Start the unicast probe and anticipate a reply;
1408 * afterwards, return existing entry to caller and
1409 * let it be used anyway. If peer is non-existent
1410 * we'll broadcast ARP next time around.
1413 bzero(&sdl
, sizeof(sdl
));
1414 sdl
.sdl_alen
= ifp
->if_addrlen
;
1415 bcopy(&lr
->lr_key
.addr
, LLADDR(&sdl
),
1418 IFA_LOCK_SPIN(rt_ifa
);
1419 IFA_ADDREF_LOCKED(rt_ifa
);
1420 sa
= rt_ifa
->ifa_addr
;
1422 rtflags
= route
->rt_flags
;
1424 dlil_send_arp(ifp
, ARPOP_REQUEST
, NULL
, sa
,
1425 (const struct sockaddr_dl
*)&sdl
,
1426 (const struct sockaddr
*)net_dest
, rtflags
);
1433 !(llinfo
->la_flags
& LLINFO_PROBING
)) {
1435 * Normal case where peer is still reachable,
1436 * we're not probing and if_addrlen is anything
1437 * but IF_LLREACH_MAXLEN.
1444 if (ifp
->if_flags
& IFF_NOARP
) {
1450 * Route wasn't complete/valid; we need to send out ARP request.
1451 * If we've exceeded the limit of la_holdq, drop from the head
1452 * of queue and add this packet to the tail. If we end up with
1453 * RTF_REJECT below, we'll dequeue this from tail and have the
1454 * caller free the packet instead. It's safe to do that since
1455 * we still hold the route's rt_lock.
1457 if (packet
!= NULL
) {
1458 arp_llinfo_addq(llinfo
, packet
);
1460 llinfo
->la_prbreq_cnt
++;
1463 * Regardless of permanent vs. expirable entry, we need to
1464 * avoid having packets sit in la_holdq forever; thus mark the
1465 * entry with la_probeexp deadline to trigger the probe timer
1466 * to be scheduled (if not already). This gets cleared the
1467 * moment we get an ARP reply.
1470 if ((qlen(&llinfo
->la_holdq
) + llinfo
->la_prbreq_cnt
) == 1) {
1471 llinfo
->la_probeexp
= (timenow
+ arpt_probe
);
1472 llinfo
->la_flags
|= LLINFO_PROBING
;
1475 if (route
->rt_expire
) {
1476 route
->rt_flags
&= ~RTF_REJECT
;
1477 if (llinfo
->la_asked
== 0 || route
->rt_expire
!= timenow
) {
1478 rt_setexpire(route
, timenow
);
1479 if (llinfo
->la_asked
++ < llinfo
->la_maxtries
) {
1480 struct kev_msg ev_msg
;
1481 struct kev_in_arpfailure in_arpfailure
;
1482 boolean_t sendkev
= FALSE
;
1484 rt_ifa
= route
->rt_ifa
;
1485 lr
= llinfo
->la_llreach
;
1486 /* Become a regular mutex, just in case */
1487 RT_CONVERT_LOCK(route
);
1488 /* Update probe count, if applicable */
1494 if (ifp
->if_addrlen
== IF_LLREACH_MAXLEN
&&
1495 route
->rt_flags
& RTF_ROUTER
&&
1496 llinfo
->la_asked
> 1) {
1498 llinfo
->la_flags
|= LLINFO_RTRFAIL_EVTSENT
;
1500 IFA_LOCK_SPIN(rt_ifa
);
1501 IFA_ADDREF_LOCKED(rt_ifa
);
1502 sa
= rt_ifa
->ifa_addr
;
1504 arp_llreach_use(llinfo
); /* Mark use tstamp */
1505 rtflags
= route
->rt_flags
;
1507 dlil_send_arp(ifp
, ARPOP_REQUEST
, NULL
, sa
,
1508 NULL
, (const struct sockaddr
*)net_dest
,
1512 bzero(&ev_msg
, sizeof(ev_msg
));
1513 bzero(&in_arpfailure
,
1514 sizeof(in_arpfailure
));
1515 in_arpfailure
.link_data
.if_family
=
1517 in_arpfailure
.link_data
.if_unit
=
1519 strlcpy(in_arpfailure
.link_data
.if_name
,
1520 ifp
->if_name
, IFNAMSIZ
);
1521 ev_msg
.vendor_code
= KEV_VENDOR_APPLE
;
1522 ev_msg
.kev_class
= KEV_NETWORK_CLASS
;
1523 ev_msg
.kev_subclass
= KEV_INET_SUBCLASS
;
1525 KEV_INET_ARPRTRFAILURE
;
1526 ev_msg
.dv
[0].data_ptr
= &in_arpfailure
;
1527 ev_msg
.dv
[0].data_length
=
1530 dlil_post_complete_msg(NULL
, &ev_msg
);
1532 result
= EJUSTRETURN
;
1536 route
->rt_flags
|= RTF_REJECT
;
1538 route
->rt_expire
+ arpt_down
);
1539 llinfo
->la_asked
= 0;
1541 * Remove the packet that was just added above;
1542 * don't free it since we're not returning
1543 * EJUSTRETURN. The caller will handle the
1544 * freeing. Since we haven't dropped rt_lock
1545 * from the time of _addq() above, this packet
1546 * must be at the tail.
1548 if (packet
!= NULL
) {
1550 _getq_tail(&llinfo
->la_holdq
);
1551 atomic_add_32(&arpstat
.held
, -1);
1552 VERIFY(_m
== packet
);
1554 result
= EHOSTUNREACH
;
1557 * Enqueue work item to invoke callback for this route entry
1559 route_event_enqueue_nwk_wq_entry(route
, NULL
,
1560 ROUTE_LLENTRY_UNREACH
, NULL
, TRUE
);
1566 /* The packet is now held inside la_holdq */
1567 result
= EJUSTRETURN
;
1570 if (result
== EHOSTUNREACH
) {
1571 atomic_add_32(&arpstat
.dropped
, 1);
1574 if (route
!= NULL
) {
1575 if (send_probe_notif
) {
1576 route_event_enqueue_nwk_wq_entry(route
, NULL
,
1577 ROUTE_LLENTRY_PROBED
, NULL
, TRUE
);
1579 if (route
->rt_flags
& RTF_ROUTER
) {
1580 struct radix_node_head
*rnh
= NULL
;
1581 struct route_event rt_ev
;
1582 route_event_init(&rt_ev
, route
, NULL
, ROUTE_LLENTRY_PROBED
);
1584 * We already have a reference on rt. The function
1585 * frees it before returning.
1588 lck_mtx_lock(rnh_lock
);
1589 rnh
= rt_tables
[AF_INET
];
1592 (void) rnh
->rnh_walktree(rnh
,
1593 route_event_walktree
, (void *)&rt_ev
);
1595 lck_mtx_unlock(rnh_lock
);
1600 if (route
== hint
) {
1601 RT_REMREF_LOCKED(route
);
1609 /* Do this after we drop rt_lock to preserve ordering */
1610 lck_mtx_lock(rnh_lock
);
1611 arp_sched_probe(NULL
);
1612 lck_mtx_unlock(rnh_lock
);
1618 arp_ip_handle_input(ifnet_t ifp
, u_short arpop
,
1619 const struct sockaddr_dl
*sender_hw
, const struct sockaddr_in
*sender_ip
,
1620 const struct sockaddr_in
*target_ip
)
1622 char ipv4str
[MAX_IPv4_STR_LEN
];
1623 struct sockaddr_dl proxied
;
1624 struct sockaddr_dl
*gateway
, *target_hw
= NULL
;
1626 struct in_ifaddr
*ia
;
1627 struct in_ifaddr
*best_ia
= NULL
;
1628 struct sockaddr_in best_ia_sin
;
1629 route_t route
= NULL
;
1630 char buf
[3 * MAX_HW_LEN
]; /* enough for MAX_HW_LEN byte hw address */
1631 struct llinfo_arp
*llinfo
;
1633 int created_announcement
= 0;
1634 int bridged
= 0, is_bridge
= 0;
1635 uint32_t rt_evcode
= 0;
1638 * Here and other places within this routine where we don't hold
1639 * rnh_lock, trade accuracy for speed for the common scenarios
1640 * and avoid the use of atomic updates.
1644 /* Do not respond to requests for 0.0.0.0 */
1645 if (target_ip
->sin_addr
.s_addr
== INADDR_ANY
&& arpop
== ARPOP_REQUEST
) {
1649 if (ifp
->if_bridge
) {
1652 if (ifp
->if_type
== IFT_BRIDGE
) {
1656 if (arpop
== ARPOP_REPLY
) {
1657 arpstat
.rxreplies
++;
1661 * Determine if this ARP is for us
1662 * For a bridge, we want to check the address irrespective
1663 * of the receive interface.
1665 lck_rw_lock_shared(in_ifaddr_rwlock
);
1666 TAILQ_FOREACH(ia
, INADDR_HASH(target_ip
->sin_addr
.s_addr
), ia_hash
) {
1667 IFA_LOCK_SPIN(&ia
->ia_ifa
);
1668 if (((bridged
&& ia
->ia_ifp
->if_bridge
!= NULL
) ||
1669 (ia
->ia_ifp
== ifp
)) &&
1670 ia
->ia_addr
.sin_addr
.s_addr
== target_ip
->sin_addr
.s_addr
) {
1672 best_ia_sin
= best_ia
->ia_addr
;
1673 IFA_ADDREF_LOCKED(&ia
->ia_ifa
);
1674 IFA_UNLOCK(&ia
->ia_ifa
);
1675 lck_rw_done(in_ifaddr_rwlock
);
1678 IFA_UNLOCK(&ia
->ia_ifa
);
1681 TAILQ_FOREACH(ia
, INADDR_HASH(sender_ip
->sin_addr
.s_addr
), ia_hash
) {
1682 IFA_LOCK_SPIN(&ia
->ia_ifa
);
1683 if (((bridged
&& ia
->ia_ifp
->if_bridge
!= NULL
) ||
1684 (ia
->ia_ifp
== ifp
)) &&
1685 ia
->ia_addr
.sin_addr
.s_addr
== sender_ip
->sin_addr
.s_addr
) {
1687 best_ia_sin
= best_ia
->ia_addr
;
1688 IFA_ADDREF_LOCKED(&ia
->ia_ifa
);
1689 IFA_UNLOCK(&ia
->ia_ifa
);
1690 lck_rw_done(in_ifaddr_rwlock
);
1693 IFA_UNLOCK(&ia
->ia_ifa
);
1696 #define BDG_MEMBER_MATCHES_ARP(addr, ifp, ia) \
1697 (ia->ia_ifp->if_bridge == ifp->if_softc && \
1698 bcmp(IF_LLADDR(ia->ia_ifp), IF_LLADDR(ifp), ifp->if_addrlen) == 0 && \
1699 addr == ia->ia_addr.sin_addr.s_addr)
1701 * Check the case when bridge shares its MAC address with
1702 * some of its children, so packets are claimed by bridge
1703 * itself (bridge_input() does it first), but they are really
1704 * meant to be destined to the bridge member.
1707 TAILQ_FOREACH(ia
, INADDR_HASH(target_ip
->sin_addr
.s_addr
),
1709 IFA_LOCK_SPIN(&ia
->ia_ifa
);
1710 if (BDG_MEMBER_MATCHES_ARP(target_ip
->sin_addr
.s_addr
,
1714 best_ia_sin
= best_ia
->ia_addr
;
1715 IFA_ADDREF_LOCKED(&ia
->ia_ifa
);
1716 IFA_UNLOCK(&ia
->ia_ifa
);
1717 lck_rw_done(in_ifaddr_rwlock
);
1720 IFA_UNLOCK(&ia
->ia_ifa
);
1723 #undef BDG_MEMBER_MATCHES_ARP
1724 lck_rw_done(in_ifaddr_rwlock
);
1727 * No match, use the first inet address on the receive interface
1728 * as a dummy address for the rest of the function; we may be
1729 * proxying for another address.
1731 ifnet_lock_shared(ifp
);
1732 TAILQ_FOREACH(ifa
, &ifp
->if_addrhead
, ifa_link
) {
1734 if (ifa
->ifa_addr
->sa_family
!= AF_INET
) {
1738 best_ia
= (struct in_ifaddr
*)ifa
;
1739 best_ia_sin
= best_ia
->ia_addr
;
1740 IFA_ADDREF_LOCKED(ifa
);
1742 ifnet_lock_done(ifp
);
1745 ifnet_lock_done(ifp
);
1748 * If we're not a bridge member, or if we are but there's no
1749 * IPv4 address to use for the interface, drop the packet.
1751 if (!bridged
|| best_ia
== NULL
) {
1756 /* If the packet is from this interface, ignore the packet */
1757 if (bcmp(CONST_LLADDR(sender_hw
), IF_LLADDR(ifp
),
1758 sender_hw
->sdl_alen
) == 0) {
1762 /* Check for a conflict */
1764 sender_ip
->sin_addr
.s_addr
== best_ia_sin
.sin_addr
.s_addr
) {
1765 struct kev_msg ev_msg
;
1766 struct kev_in_collision
*in_collision
;
1767 u_char storage
[sizeof(struct kev_in_collision
) + MAX_HW_LEN
];
1769 bzero(&ev_msg
, sizeof(struct kev_msg
));
1770 bzero(storage
, (sizeof(struct kev_in_collision
) + MAX_HW_LEN
));
1771 in_collision
= (struct kev_in_collision
*)(void *)storage
;
1772 log(LOG_ERR
, "%s duplicate IP address %s sent from "
1773 "address %s\n", if_name(ifp
),
1774 inet_ntop(AF_INET
, &sender_ip
->sin_addr
, ipv4str
,
1775 sizeof(ipv4str
)), sdl_addr_to_hex(sender_hw
, buf
,
1778 /* Send a kernel event so anyone can learn of the conflict */
1779 in_collision
->link_data
.if_family
= ifp
->if_family
;
1780 in_collision
->link_data
.if_unit
= ifp
->if_unit
;
1781 strlcpy(&in_collision
->link_data
.if_name
[0],
1782 ifp
->if_name
, IFNAMSIZ
);
1783 in_collision
->ia_ipaddr
= sender_ip
->sin_addr
;
1784 in_collision
->hw_len
= (sender_hw
->sdl_alen
< MAX_HW_LEN
) ?
1785 sender_hw
->sdl_alen
: MAX_HW_LEN
;
1786 bcopy(CONST_LLADDR(sender_hw
), (caddr_t
)in_collision
->hw_addr
,
1787 in_collision
->hw_len
);
1788 ev_msg
.vendor_code
= KEV_VENDOR_APPLE
;
1789 ev_msg
.kev_class
= KEV_NETWORK_CLASS
;
1790 ev_msg
.kev_subclass
= KEV_INET_SUBCLASS
;
1791 ev_msg
.event_code
= KEV_INET_ARPCOLLISION
;
1792 ev_msg
.dv
[0].data_ptr
= in_collision
;
1793 ev_msg
.dv
[0].data_length
=
1794 sizeof(struct kev_in_collision
) + in_collision
->hw_len
;
1795 ev_msg
.dv
[1].data_length
= 0;
1796 dlil_post_complete_msg(NULL
, &ev_msg
);
1797 atomic_add_32(&arpstat
.dupips
, 1);
1802 * Look up the routing entry. If it doesn't exist and we are the
1803 * target, and the sender isn't 0.0.0.0, go ahead and create one.
1804 * Callee holds a reference on the route and returns with the route
1805 * entry locked, upon success.
1807 error
= arp_lookup_route(&sender_ip
->sin_addr
,
1808 (target_ip
->sin_addr
.s_addr
== best_ia_sin
.sin_addr
.s_addr
&&
1809 sender_ip
->sin_addr
.s_addr
!= 0), 0, &route
, ifp
->if_index
);
1812 RT_LOCK_ASSERT_HELD(route
);
1815 if (error
|| route
== NULL
|| route
->rt_gateway
== NULL
) {
1816 if (arpop
!= ARPOP_REQUEST
) {
1820 if (arp_sendllconflict
&& send_conflicting_probes
!= 0 &&
1821 (ifp
->if_eflags
& IFEF_ARPLL
) &&
1822 IN_LINKLOCAL(ntohl(target_ip
->sin_addr
.s_addr
)) &&
1823 sender_ip
->sin_addr
.s_addr
== INADDR_ANY
) {
1825 * Verify this ARP probe doesn't conflict with
1826 * an IPv4LL we know of on another interface.
1828 if (route
!= NULL
) {
1829 RT_REMREF_LOCKED(route
);
1834 * Callee holds a reference on the route and returns
1835 * with the route entry locked, upon success.
1837 error
= arp_lookup_route(&target_ip
->sin_addr
, 0, 0,
1838 &route
, ifp
->if_index
);
1840 if (error
!= 0 || route
== NULL
||
1841 route
->rt_gateway
== NULL
) {
1845 RT_LOCK_ASSERT_HELD(route
);
1847 gateway
= SDL(route
->rt_gateway
);
1848 if (route
->rt_ifp
!= ifp
&& gateway
->sdl_alen
!= 0 &&
1849 (gateway
->sdl_alen
!= sender_hw
->sdl_alen
||
1850 bcmp(CONST_LLADDR(gateway
), CONST_LLADDR(sender_hw
),
1851 gateway
->sdl_alen
) != 0)) {
1853 * A node is probing for an IPv4LL we know
1854 * exists on a different interface. We respond
1855 * with a conflicting probe to force the new
1856 * device to pick a different IPv4LL address.
1858 if (arp_verbose
|| log_arp_warnings
) {
1859 log(LOG_INFO
, "arp: %s on %s sent "
1860 "probe for %s, already on %s\n",
1861 sdl_addr_to_hex(sender_hw
, buf
,
1862 sizeof(buf
)), if_name(ifp
),
1864 &target_ip
->sin_addr
, ipv4str
,
1866 if_name(route
->rt_ifp
));
1867 log(LOG_INFO
, "arp: sending "
1868 "conflicting probe to %s on %s\n",
1869 sdl_addr_to_hex(sender_hw
, buf
,
1870 sizeof(buf
)), if_name(ifp
));
1872 /* Mark use timestamp */
1873 if (route
->rt_llinfo
!= NULL
) {
1874 arp_llreach_use(route
->rt_llinfo
);
1876 /* We're done with the route */
1877 RT_REMREF_LOCKED(route
);
1881 * Send a conservative unicast "ARP probe".
1882 * This should force the other device to pick
1883 * a new number. This will not force the
1884 * device to pick a new number if the device
1885 * has already assigned that number. This will
1886 * not imply to the device that we own that
1887 * address. The link address is always
1888 * present; it's never freed.
1890 ifnet_lock_shared(ifp
);
1891 ifa
= ifp
->if_lladdr
;
1893 ifnet_lock_done(ifp
);
1894 dlil_send_arp_internal(ifp
, ARPOP_REQUEST
,
1896 (const struct sockaddr
*)sender_ip
,
1898 (const struct sockaddr
*)target_ip
);
1901 atomic_add_32(&arpstat
.txconflicts
, 1);
1904 } else if (keep_announcements
!= 0 &&
1905 target_ip
->sin_addr
.s_addr
== sender_ip
->sin_addr
.s_addr
) {
1907 * Don't create entry if link-local address and
1908 * link-local is disabled
1910 if (!IN_LINKLOCAL(ntohl(sender_ip
->sin_addr
.s_addr
)) ||
1911 (ifp
->if_eflags
& IFEF_ARPLL
)) {
1912 if (route
!= NULL
) {
1913 RT_REMREF_LOCKED(route
);
1918 * Callee holds a reference on the route and
1919 * returns with the route entry locked, upon
1922 error
= arp_lookup_route(&sender_ip
->sin_addr
,
1923 1, 0, &route
, ifp
->if_index
);
1926 RT_LOCK_ASSERT_HELD(route
);
1929 if (error
== 0 && route
!= NULL
&&
1930 route
->rt_gateway
!= NULL
) {
1931 created_announcement
= 1;
1934 if (created_announcement
== 0) {
1942 RT_LOCK_ASSERT_HELD(route
);
1943 VERIFY(route
->rt_expire
== 0 || route
->rt_rmx
.rmx_expire
!= 0);
1944 VERIFY(route
->rt_expire
!= 0 || route
->rt_rmx
.rmx_expire
== 0);
1946 gateway
= SDL(route
->rt_gateway
);
1947 if (!bridged
&& route
->rt_ifp
!= ifp
) {
1948 if (!IN_LINKLOCAL(ntohl(sender_ip
->sin_addr
.s_addr
)) ||
1949 !(ifp
->if_eflags
& IFEF_ARPLL
)) {
1950 if (arp_verbose
|| log_arp_warnings
) {
1951 log(LOG_ERR
, "arp: %s is on %s but got "
1952 "reply from %s on %s\n",
1953 inet_ntop(AF_INET
, &sender_ip
->sin_addr
,
1954 ipv4str
, sizeof(ipv4str
)),
1955 if_name(route
->rt_ifp
),
1956 sdl_addr_to_hex(sender_hw
, buf
,
1957 sizeof(buf
)), if_name(ifp
));
1961 /* Don't change a permanent address */
1962 if (route
->rt_expire
== 0) {
1967 * We're about to check and/or change the route's ifp
1968 * and ifa, so do the lock dance: drop rt_lock, hold
1969 * rnh_lock and re-hold rt_lock to avoid violating the
1970 * lock ordering. We have an extra reference on the
1971 * route, so it won't go away while we do this.
1974 lck_mtx_lock(rnh_lock
);
1977 * Don't change the cloned route away from the
1978 * parent's interface if the address did resolve
1979 * or if the route is defunct. rt_ifp on both
1980 * the parent and the clone can now be freely
1981 * accessed now that we have acquired rnh_lock.
1983 gateway
= SDL(route
->rt_gateway
);
1984 if ((gateway
->sdl_alen
!= 0 &&
1985 route
->rt_parent
!= NULL
&&
1986 route
->rt_parent
->rt_ifp
== route
->rt_ifp
) ||
1987 (route
->rt_flags
& RTF_CONDEMNED
)) {
1988 RT_REMREF_LOCKED(route
);
1991 lck_mtx_unlock(rnh_lock
);
1994 if (route
->rt_ifp
!= ifp
) {
1996 * Purge any link-layer info caching.
1998 if (route
->rt_llinfo_purge
!= NULL
) {
1999 route
->rt_llinfo_purge(route
);
2002 /* Adjust route ref count for the interfaces */
2003 if (route
->rt_if_ref_fn
!= NULL
) {
2004 route
->rt_if_ref_fn(ifp
, 1);
2005 route
->rt_if_ref_fn(route
->rt_ifp
, -1);
2008 /* Change the interface when the existing route is on */
2009 route
->rt_ifp
= ifp
;
2011 * If rmx_mtu is not locked, update it
2012 * to the MTU used by the new interface.
2014 if (!(route
->rt_rmx
.rmx_locks
& RTV_MTU
)) {
2015 route
->rt_rmx
.rmx_mtu
= route
->rt_ifp
->if_mtu
;
2016 if (INTF_ADJUST_MTU_FOR_CLAT46(ifp
)) {
2017 route
->rt_rmx
.rmx_mtu
= IN6_LINKMTU(route
->rt_ifp
);
2018 /* Further adjust the size for CLAT46 expansion */
2019 route
->rt_rmx
.rmx_mtu
-= CLAT46_HDR_EXPANSION_OVERHD
;
2023 rtsetifa(route
, &best_ia
->ia_ifa
);
2024 gateway
->sdl_index
= ifp
->if_index
;
2026 lck_mtx_unlock(rnh_lock
);
2028 /* Don't bother if the route is down */
2029 if (!(route
->rt_flags
& RTF_UP
)) {
2032 /* Refresh gateway pointer */
2033 gateway
= SDL(route
->rt_gateway
);
2035 RT_LOCK_ASSERT_HELD(route
);
2038 if (gateway
->sdl_alen
!= 0 && bcmp(LLADDR(gateway
),
2039 CONST_LLADDR(sender_hw
), gateway
->sdl_alen
) != 0) {
2040 if (route
->rt_expire
!= 0 &&
2041 (arp_verbose
|| log_arp_warnings
)) {
2042 char buf2
[3 * MAX_HW_LEN
];
2043 log(LOG_INFO
, "arp: %s moved from %s to %s on %s\n",
2044 inet_ntop(AF_INET
, &sender_ip
->sin_addr
, ipv4str
,
2046 sdl_addr_to_hex(gateway
, buf
, sizeof(buf
)),
2047 sdl_addr_to_hex(sender_hw
, buf2
, sizeof(buf2
)),
2049 } else if (route
->rt_expire
== 0) {
2050 if (arp_verbose
|| log_arp_warnings
) {
2051 log(LOG_ERR
, "arp: %s attempts to modify "
2052 "permanent entry for %s on %s\n",
2053 sdl_addr_to_hex(sender_hw
, buf
,
2055 inet_ntop(AF_INET
, &sender_ip
->sin_addr
,
2056 ipv4str
, sizeof(ipv4str
)),
2063 /* Copy the sender hardware address in to the route's gateway address */
2064 gateway
->sdl_alen
= sender_hw
->sdl_alen
;
2065 bcopy(CONST_LLADDR(sender_hw
), LLADDR(gateway
), gateway
->sdl_alen
);
2067 /* Update the expire time for the route and clear the reject flag */
2068 if (route
->rt_expire
!= 0) {
2069 rt_setexpire(route
, net_uptime() + arpt_keep
);
2071 route
->rt_flags
&= ~RTF_REJECT
;
2073 /* cache the gateway (sender HW) address */
2074 arp_llreach_alloc(route
, ifp
, LLADDR(gateway
), gateway
->sdl_alen
,
2075 (arpop
== ARPOP_REPLY
), &rt_evcode
);
2077 llinfo
= route
->rt_llinfo
;
2078 /* send a notification that the route is back up */
2079 if (ifp
->if_addrlen
== IF_LLREACH_MAXLEN
&&
2080 route
->rt_flags
& RTF_ROUTER
&&
2081 llinfo
->la_flags
& LLINFO_RTRFAIL_EVTSENT
) {
2082 struct kev_msg ev_msg
;
2083 struct kev_in_arpalive in_arpalive
;
2085 llinfo
->la_flags
&= ~LLINFO_RTRFAIL_EVTSENT
;
2087 bzero(&ev_msg
, sizeof(ev_msg
));
2088 bzero(&in_arpalive
, sizeof(in_arpalive
));
2089 in_arpalive
.link_data
.if_family
= ifp
->if_family
;
2090 in_arpalive
.link_data
.if_unit
= ifp
->if_unit
;
2091 strlcpy(in_arpalive
.link_data
.if_name
, ifp
->if_name
, IFNAMSIZ
);
2092 ev_msg
.vendor_code
= KEV_VENDOR_APPLE
;
2093 ev_msg
.kev_class
= KEV_NETWORK_CLASS
;
2094 ev_msg
.kev_subclass
= KEV_INET_SUBCLASS
;
2095 ev_msg
.event_code
= KEV_INET_ARPRTRALIVE
;
2096 ev_msg
.dv
[0].data_ptr
= &in_arpalive
;
2097 ev_msg
.dv
[0].data_length
= sizeof(struct kev_in_arpalive
);
2098 dlil_post_complete_msg(NULL
, &ev_msg
);
2101 /* Update the llinfo, send out all queued packets at once */
2102 llinfo
->la_asked
= 0;
2103 llinfo
->la_flags
&= ~LLINFO_PROBING
;
2104 llinfo
->la_prbreq_cnt
= 0;
2108 * Enqueue work item to invoke callback for this route entry
2110 route_event_enqueue_nwk_wq_entry(route
, NULL
, rt_evcode
, NULL
, TRUE
);
2112 if (route
->rt_flags
& RTF_ROUTER
) {
2113 struct radix_node_head
*rnh
= NULL
;
2114 struct route_event rt_ev
;
2115 route_event_init(&rt_ev
, route
, NULL
, rt_evcode
);
2117 * We already have a reference on rt. The function
2118 * frees it before returning.
2121 lck_mtx_lock(rnh_lock
);
2122 rnh
= rt_tables
[AF_INET
];
2125 (void) rnh
->rnh_walktree(rnh
, route_event_walktree
,
2128 lck_mtx_unlock(rnh_lock
);
2133 if (!qempty(&llinfo
->la_holdq
)) {
2136 _getq_all(&llinfo
->la_holdq
, NULL
, &held
, NULL
);
2138 log(LOG_DEBUG
, "%s: sending %u held packets\n",
2141 atomic_add_32(&arpstat
.held
, -held
);
2142 VERIFY(qempty(&llinfo
->la_holdq
));
2144 dlil_output(ifp
, PF_INET
, m0
, (caddr_t
)route
,
2145 rt_key(route
), 0, NULL
);
2151 if (route
!= NULL
) {
2152 /* Mark use timestamp if we're going to send a reply */
2153 if (arpop
== ARPOP_REQUEST
&& route
->rt_llinfo
!= NULL
) {
2154 arp_llreach_use(route
->rt_llinfo
);
2156 RT_REMREF_LOCKED(route
);
2161 if (arpop
!= ARPOP_REQUEST
) {
2165 /* See comments at the beginning of this routine */
2166 arpstat
.rxrequests
++;
2168 /* If we are not the target, check if we should proxy */
2169 if (target_ip
->sin_addr
.s_addr
!= best_ia_sin
.sin_addr
.s_addr
) {
2171 * Find a proxy route; callee holds a reference on the
2172 * route and returns with the route entry locked, upon
2175 error
= arp_lookup_route(&target_ip
->sin_addr
, 0, SIN_PROXY
,
2176 &route
, ifp
->if_index
);
2179 RT_LOCK_ASSERT_HELD(route
);
2181 * Return proxied ARP replies only on the interface
2182 * or bridge cluster where this network resides.
2183 * Otherwise we may conflict with the host we are
2186 if (route
->rt_ifp
!= ifp
&&
2187 (route
->rt_ifp
->if_bridge
!= ifp
->if_bridge
||
2188 ifp
->if_bridge
== NULL
)) {
2189 RT_REMREF_LOCKED(route
);
2193 proxied
= *SDL(route
->rt_gateway
);
2194 target_hw
= &proxied
;
2197 * We don't have a route entry indicating we should
2198 * use proxy. If we aren't supposed to proxy all,
2201 if (!arp_proxyall
) {
2206 * See if we have a route to the target ip before
2209 route
= rtalloc1_scoped((struct sockaddr
*)
2210 (size_t)target_ip
, 0, 0, ifp
->if_index
);
2216 * Don't proxy for hosts already on the same interface.
2219 if (route
->rt_ifp
== ifp
) {
2225 /* Mark use timestamp */
2226 if (route
->rt_llinfo
!= NULL
) {
2227 arp_llreach_use(route
->rt_llinfo
);
2229 RT_REMREF_LOCKED(route
);
2233 dlil_send_arp(ifp
, ARPOP_REPLY
,
2234 target_hw
, (const struct sockaddr
*)target_ip
,
2235 sender_hw
, (const struct sockaddr
*)sender_ip
, 0);
2238 if (best_ia
!= NULL
) {
2239 IFA_REMREF(&best_ia
->ia_ifa
);
2245 arp_ifinit(struct ifnet
*ifp
, struct ifaddr
*ifa
)
2247 struct sockaddr
*sa
;
2250 ifa
->ifa_rtrequest
= arp_rtrequest
;
2251 ifa
->ifa_flags
|= RTF_CLONING
;
2254 dlil_send_arp(ifp
, ARPOP_REQUEST
, NULL
, sa
, NULL
, sa
, 0);
2258 arp_getstat SYSCTL_HANDLER_ARGS
2260 #pragma unused(oidp, arg1, arg2)
2261 if (req
->oldptr
== USER_ADDR_NULL
) {
2262 req
->oldlen
= (size_t)sizeof(struct arpstat
);
2265 return SYSCTL_OUT(req
, &arpstat
, MIN(sizeof(arpstat
), req
->oldlen
));