2 * Copyright (c) 2004-2009 Robert N. M. Watson
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * Copyright (c) 1990, 1994 Regents of The University of Michigan.
28 * Permission to use, copy, modify, and distribute this software and
29 * its documentation for any purpose and without fee is hereby granted,
30 * provided that the above copyright notice appears in all copies and
31 * that both that copyright notice and this permission notice appear
32 * in supporting documentation, and that the name of The University
33 * of Michigan not be used in advertising or publicity pertaining to
34 * distribution of the software without specific, written prior
35 * permission. This software is supplied as is without expressed or
36 * implied warranties of any kind.
38 * This product includes software developed by the University of
39 * California, Berkeley and its contributors.
41 * Research Systems Unix Group
42 * The University of Michigan
44 * 535 W. William Street
52 #include <sys/param.h>
53 #include <sys/kernel.h>
56 #include <sys/signalvar.h>
57 #include <sys/socket.h>
58 #include <sys/socketvar.h>
60 #include <sys/systm.h>
62 #include <net/if_var.h>
63 #include <net/route.h>
65 #include <netatalk/at.h>
66 #include <netatalk/at_var.h>
67 #include <netatalk/ddp.h>
68 #include <netatalk/ddp_var.h>
69 #include <netatalk/ddp_pcb.h>
70 #include <netatalk/at_extern.h>
72 #include <security/mac/mac_framework.h>
74 static volatile int ddp_forward = 1;
75 static volatile int ddp_firewall = 0;
76 static struct ddpstat ddpstat;
78 static struct route forwro;
80 static void ddp_input(struct mbuf *, struct ifnet *, struct elaphdr *, int);
83 * Could probably merge these two code segments a little better...
86 at2intr(struct mbuf *m)
90 * Phase 2 packet handling .
92 ddp_input(m, m->m_pkthdr.rcvif, NULL, 2);
96 at1intr(struct mbuf *m)
98 struct elaphdr *elhp, elh;
101 * Phase 1 packet handling
103 if (m->m_len < SZ_ELAPHDR && ((m = m_pullup(m, SZ_ELAPHDR)) ==
105 ddpstat.ddps_tooshort++;
110 * This seems a little dubious, but I don't know phase 1 so leave it.
112 elhp = mtod(m, struct elaphdr *);
113 m_adj(m, SZ_ELAPHDR);
115 if (elhp->el_type != ELAP_DDPEXTEND) {
116 bcopy((caddr_t)elhp, (caddr_t)&elh, SZ_ELAPHDR);
117 ddp_input(m, m->m_pkthdr.rcvif, &elh, 1);
119 ddp_input(m, m->m_pkthdr.rcvif, NULL, 1);
123 ddp_input(struct mbuf *m, struct ifnet *ifp, struct elaphdr *elh, int phase)
125 struct sockaddr_at from, to;
126 struct ddpshdr *dsh, ddps;
127 struct at_ifaddr *aa;
128 struct ddpehdr *deh = NULL, ddpe;
133 bzero((caddr_t)&from, sizeof(struct sockaddr_at));
134 bzero((caddr_t)&to, sizeof(struct sockaddr_at));
137 * Extract the information in the short header. Network
138 * information is defaulted to ATADDR_ANYNET and node
139 * information comes from the elh info. We must be phase 1.
141 ddpstat.ddps_short++;
143 if (m->m_len < sizeof(struct ddpshdr) &&
144 ((m = m_pullup(m, sizeof(struct ddpshdr))) == NULL)) {
145 ddpstat.ddps_tooshort++;
149 dsh = mtod(m, struct ddpshdr *);
150 bcopy((caddr_t)dsh, (caddr_t)&ddps, sizeof(struct ddpshdr));
151 ddps.dsh_bytes = ntohl(ddps.dsh_bytes);
154 to.sat_addr.s_net = ATADDR_ANYNET;
155 to.sat_addr.s_node = elh->el_dnode;
156 to.sat_port = ddps.dsh_dport;
157 from.sat_addr.s_net = ATADDR_ANYNET;
158 from.sat_addr.s_node = elh->el_snode;
159 from.sat_port = ddps.dsh_sport;
162 * Make sure that we point to the phase1 ifaddr info and that
163 * it's valid for this packet.
166 TAILQ_FOREACH(aa, &at_ifaddrhead, aa_link) {
167 if ((aa->aa_ifp == ifp)
168 && ((aa->aa_flags & AFA_PHASE2) == 0)
169 && ((to.sat_addr.s_node ==
170 AA_SAT(aa)->sat_addr.s_node) ||
171 (to.sat_addr.s_node == ATADDR_BCAST)))
175 * maybe we got a broadcast not meant for us.. ditch it.
184 * There was no 'elh' passed on. This could still be either
185 * phase1 or phase2. We have a long header, but we may be
186 * running on a phase 1 net. Extract out all the info
187 * regarding this packet's src & dst.
191 if (m->m_len < sizeof(struct ddpehdr) &&
192 ((m = m_pullup(m, sizeof(struct ddpehdr))) == NULL)) {
194 ddpstat.ddps_tooshort++;
198 deh = mtod(m, struct ddpehdr *);
199 bcopy((caddr_t)deh, (caddr_t)&ddpe, sizeof(struct ddpehdr));
200 ddpe.deh_bytes = ntohl(ddpe.deh_bytes);
203 if ((cksum = ddpe.deh_sum) == 0)
204 ddpstat.ddps_nosum++;
206 from.sat_addr.s_net = ddpe.deh_snet;
207 from.sat_addr.s_node = ddpe.deh_snode;
208 from.sat_port = ddpe.deh_sport;
209 to.sat_addr.s_net = ddpe.deh_dnet;
210 to.sat_addr.s_node = ddpe.deh_dnode;
211 to.sat_port = ddpe.deh_dport;
214 if (to.sat_addr.s_net == ATADDR_ANYNET) {
216 * The TO address doesn't specify a net, so by
217 * definition it's for this net. Try find ifaddr
218 * info with the right phase, the right interface,
219 * and either to our node, a broadcast, or looped
220 * back (though that SHOULD be covered in the other
223 * XXX If we have multiple interfaces, then the first
224 * with this node number will match (which may NOT be
225 * what we want, but it's probably safe in 99.999% of
228 TAILQ_FOREACH(aa, &at_ifaddrhead, aa_link) {
229 if (phase == 1 && (aa->aa_flags &
232 if (phase == 2 && (aa->aa_flags &
235 if ((aa->aa_ifp == ifp) &&
236 ((to.sat_addr.s_node ==
237 AA_SAT(aa)->sat_addr.s_node) ||
238 (to.sat_addr.s_node == ATADDR_BCAST) ||
239 (ifp->if_flags & IFF_LOOPBACK)))
244 * A destination network was given. We just try to
245 * find which ifaddr info matches it.
247 TAILQ_FOREACH(aa, &at_ifaddrhead, aa_link) {
249 * This is a kludge. Accept packets that are
250 * for any router on a local netrange.
252 if (to.sat_addr.s_net == aa->aa_firstnet &&
253 to.sat_addr.s_node == 0)
256 * Don't use ifaddr info for which we are
257 * totally outside the netrange, and it's not
258 * a startup packet. Startup packets are
259 * always implicitly allowed on to the next
262 if (((ntohs(to.sat_addr.s_net) <
263 ntohs(aa->aa_firstnet)) ||
264 (ntohs(to.sat_addr.s_net) >
265 ntohs(aa->aa_lastnet))) &&
266 ((ntohs(to.sat_addr.s_net) < 0xff00) ||
267 (ntohs(to.sat_addr.s_net) > 0xfffe)))
271 * Don't record a match either if we just
272 * don't have a match in the node address.
273 * This can have if the interface is in
274 * promiscuous mode for example.
276 if ((to.sat_addr.s_node !=
277 AA_SAT(aa)->sat_addr.s_node) &&
278 (to.sat_addr.s_node != ATADDR_BCAST))
285 ifa_ref(&aa->aa_ifa);
289 * Adjust the length, removing any padding that may have been added
290 * at a link layer. We do this before we attempt to forward a
291 * packet, possibly on a different media.
293 mlen = m->m_pkthdr.len;
295 ddpstat.ddps_toosmall++;
299 m_adj(m, dlen - mlen);
302 * If it isn't for a net on any of our interfaces, or it IS for a net
303 * on a different interface than it came in on, (and it is not looped
304 * back) then consider if we should forward it. As we are not really
305 * a router this is a bit cheeky, but it may be useful some day.
307 if ((aa == NULL) || ((to.sat_addr.s_node == ATADDR_BCAST) &&
308 (aa->aa_ifp != ifp) && ((ifp->if_flags & IFF_LOOPBACK) == 0))) {
310 * If we've explicitly disabled it, don't route anything.
312 if (ddp_forward == 0)
316 * If the cached forwarding route is still valid, use it.
318 * XXXRW: Access to the cached route may not be properly
319 * synchronized for parallel input handling.
322 (satosat(&forwro.ro_dst)->sat_addr.s_net !=
324 satosat(&forwro.ro_dst)->sat_addr.s_node !=
325 to.sat_addr.s_node)) {
326 RTFREE(forwro.ro_rt);
331 * If we don't have a cached one (any more) or it's useless,
332 * then get a new route.
334 * XXX this could cause a 'route leak'. Check this!
336 if (forwro.ro_rt == NULL || forwro.ro_rt->rt_ifp == NULL) {
337 forwro.ro_dst.sa_len = sizeof(struct sockaddr_at);
338 forwro.ro_dst.sa_family = AF_APPLETALK;
339 satosat(&forwro.ro_dst)->sat_addr.s_net =
341 satosat(&forwro.ro_dst)->sat_addr.s_node =
347 * If it's not going to get there on this hop, and it's
348 * already done too many hops, then throw it away.
350 if ((to.sat_addr.s_net !=
351 satosat(&forwro.ro_dst)->sat_addr.s_net) &&
352 (ddpe.deh_hops == DDP_MAXHOPS))
356 * A ddp router might use the same interface to forward the
357 * packet, which this would not effect. Don't allow packets
358 * to cross from one interface to another however.
360 if (ddp_firewall && ((forwro.ro_rt == NULL) ||
361 (forwro.ro_rt->rt_ifp != ifp)))
365 * Adjust the header. If it was a short header then it would
366 * have not gotten here, so we can assume there is room to
367 * drop the header in.
369 * XXX what about promiscuous mode, etc...
372 ddpe.deh_bytes = htonl(ddpe.deh_bytes);
374 bcopy((caddr_t)&ddpe, (caddr_t)deh, sizeof(u_short));
375 if (ddp_route(m, &forwro))
376 ddpstat.ddps_cantforward++;
378 ddpstat.ddps_forward++;
380 ifa_free(&aa->aa_ifa);
385 * It was for us, and we have an ifaddr to use with it.
387 from.sat_len = sizeof(struct sockaddr_at);
388 from.sat_family = AF_APPLETALK;
391 * We are no longer interested in the link layer so cut it off.
394 if (ddp_cksum && cksum && cksum !=
395 at_cksum(m, sizeof(int))) {
396 ddpstat.ddps_badsum++;
399 m_adj(m, sizeof(struct ddpehdr));
401 m_adj(m, sizeof(struct ddpshdr));
404 * Search for ddp protocol control blocks that match these addresses.
407 if ((ddp = ddp_search(&from, &to, aa)) == NULL)
411 if (mac_socket_check_deliver(ddp->ddp_socket, m) != 0)
416 * If we found one, deliver the packet to the socket
418 SOCKBUF_LOCK(&ddp->ddp_socket->so_rcv);
419 if (sbappendaddr_locked(&ddp->ddp_socket->so_rcv,
420 (struct sockaddr *)&from, m, NULL) == 0) {
421 SOCKBUF_UNLOCK(&ddp->ddp_socket->so_rcv);
423 * If the socket is full (or similar error) dump the packet.
425 ddpstat.ddps_nosockspace++;
430 * And wake up whatever might be waiting for it
432 sorwakeup_locked(ddp->ddp_socket);
438 ifa_free(&aa->aa_ifa);