1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
|
/* $NetBSD: ddp_input.c,v 1.34 2023/03/30 11:21:08 riastradh Exp $ */
/*
* Copyright (c) 1990,1994 Regents of The University of Michigan.
* All Rights Reserved.
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appears in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation, and that the name of The University
* of Michigan not be used in advertising or publicity pertaining to
* distribution of the software without specific, written prior
* permission. This software is supplied as is without expressed or
* implied warranties of any kind.
*
* This product includes software developed by the University of
* California, Berkeley and its contributors.
*
* Research Systems Unix Group
* The University of Michigan
* c/o Wesley Craig
* 535 W. William Street
* Ann Arbor, Michigan
* +1-313-764-2278
* netatalk@umich.edu
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: ddp_input.c,v 1.34 2023/03/30 11:21:08 riastradh Exp $");
#include "opt_atalk.h"
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/mbuf.h>
#include <sys/socket.h>
#include <sys/socketvar.h>
#include <sys/syslog.h>
#include <net/if.h>
#include <net/route.h>
#include <net/if_ether.h>
#include <netinet/in.h>
#include <netatalk/at.h>
#include <netatalk/at_var.h>
#include <netatalk/ddp.h>
#include <netatalk/ddp_var.h>
#include <netatalk/ddp_private.h>
#include <netatalk/at_extern.h>
int ddp_forward = 1;
int ddp_firewall = 0;
extern int ddp_cksum;
void ddp_input(struct mbuf *, struct ifnet *, struct elaphdr *, int);
static struct at_ifaddr *
at_ifaddr_for_ifp(struct ifnet * const ifp, int phase_flag)
{
struct at_ifaddr *aa;
TAILQ_FOREACH(aa, &at_ifaddr, aa_list) {
if (aa->aa_ifp == ifp &&
(aa->aa_flags & AFA_PHASE2) == phase_flag) {
return aa;
}
}
return NULL;
}
void
atintr2(void *arg __unused)
{
struct mbuf *m;
mutex_enter(softnet_lock);
while ((m = pktq_dequeue(at_pktq2)) != NULL) {
struct ifnet *ifp;
m_claimm(m, &atalk_rx_mowner);
ifp = m_get_rcvif_NOMPSAFE(m);
if (at_ifaddr_for_ifp(ifp, AFA_PHASE2) == NULL) {
/* ifp not an appletalk interface */
m_freem(m);
continue;
}
ddp_input(m, ifp, NULL, 2);
}
mutex_exit(softnet_lock);
}
void
atintr1(void *arg __unused)
{
struct mbuf *m;
mutex_enter(softnet_lock);
while ((m = pktq_dequeue(at_pktq1)) != NULL) {
struct ifnet *ifp;
struct elaphdr *elhp, elh;
m_claimm(m, &atalk_rx_mowner);
ifp = m_get_rcvif_NOMPSAFE(m);
if (at_ifaddr_for_ifp(ifp, 0) == NULL) {
/* ifp not an appletalk interface */
m_freem(m);
continue;
}
if (m->m_len < SZ_ELAPHDR &&
((m = m_pullup(m, SZ_ELAPHDR)) == 0)) {
DDP_STATINC(DDP_STAT_TOOSHORT);
continue;
}
elhp = mtod(m, struct elaphdr *);
m_adj(m, SZ_ELAPHDR);
if (elhp->el_type == ELAP_DDPEXTEND) {
ddp_input(m, ifp, NULL, 1);
} else {
memcpy((void *) & elh, (void *) elhp, SZ_ELAPHDR);
ddp_input(m, ifp, &elh, 1);
}
}
mutex_exit(softnet_lock);
}
struct route forwro;
void
ddp_input(struct mbuf *m, struct ifnet *ifp, struct elaphdr *elh, int phase)
{
struct rtentry *rt;
struct sockaddr_at from, to;
struct ddpshdr *dsh, ddps;
struct at_ifaddr *aa;
struct ddpehdr *deh = NULL, ddpe;
struct ddpcb *ddp;
int dlen, mlen;
u_short cksum = 0;
union {
struct sockaddr dst;
struct sockaddr_at dsta;
} u;
memset((void *) & from, 0, sizeof(struct sockaddr_at));
if (elh) {
DDP_STATINC(DDP_STAT_SHORT);
if (m->m_len < sizeof(struct ddpshdr) &&
((m = m_pullup(m, sizeof(struct ddpshdr))) == 0)) {
DDP_STATINC(DDP_STAT_TOOSHORT);
return;
}
dsh = mtod(m, struct ddpshdr *);
memcpy((void *) & ddps, (void *) dsh, sizeof(struct ddpshdr));
ddps.dsh_bytes = ntohl(ddps.dsh_bytes);
dlen = ddps.dsh_len;
to.sat_addr.s_net = ATADDR_ANYNET;
to.sat_addr.s_node = elh->el_dnode;
to.sat_port = ddps.dsh_dport;
from.sat_addr.s_net = ATADDR_ANYNET;
from.sat_addr.s_node = elh->el_snode;
from.sat_port = ddps.dsh_sport;
TAILQ_FOREACH(aa, &at_ifaddr, aa_list) {
if (aa->aa_ifp == ifp &&
(aa->aa_flags & AFA_PHASE2) == 0 &&
(AA_SAT(aa)->sat_addr.s_node ==
to.sat_addr.s_node ||
to.sat_addr.s_node == ATADDR_BCAST))
break;
}
if (aa == NULL) {
m_freem(m);
return;
}
} else {
DDP_STATINC(DDP_STAT_LONG);
if (m->m_len < sizeof(struct ddpehdr) &&
((m = m_pullup(m, sizeof(struct ddpehdr))) == 0)) {
DDP_STATINC(DDP_STAT_TOOSHORT);
return;
}
deh = mtod(m, struct ddpehdr *);
memcpy((void *) & ddpe, (void *) deh, sizeof(struct ddpehdr));
ddpe.deh_bytes = ntohl(ddpe.deh_bytes);
dlen = ddpe.deh_len;
if ((cksum = ddpe.deh_sum) == 0) {
DDP_STATINC(DDP_STAT_NOSUM);
}
from.sat_addr.s_net = ddpe.deh_snet;
from.sat_addr.s_node = ddpe.deh_snode;
from.sat_port = ddpe.deh_sport;
to.sat_addr.s_net = ddpe.deh_dnet;
to.sat_addr.s_node = ddpe.deh_dnode;
to.sat_port = ddpe.deh_dport;
if (to.sat_addr.s_net == ATADDR_ANYNET) {
TAILQ_FOREACH(aa, &at_ifaddr, aa_list) {
if (phase == 1 && (aa->aa_flags & AFA_PHASE2))
continue;
if (phase == 2 &&
(aa->aa_flags & AFA_PHASE2) == 0)
continue;
if (aa->aa_ifp == ifp &&
(AA_SAT(aa)->sat_addr.s_node ==
to.sat_addr.s_node ||
to.sat_addr.s_node == ATADDR_BCAST ||
(ifp->if_flags & IFF_LOOPBACK)))
break;
}
} else {
TAILQ_FOREACH(aa, &at_ifaddr, aa_list) {
if (to.sat_addr.s_net == aa->aa_firstnet &&
to.sat_addr.s_node == 0)
break;
if ((ntohs(to.sat_addr.s_net) <
ntohs(aa->aa_firstnet) ||
ntohs(to.sat_addr.s_net) >
ntohs(aa->aa_lastnet)) &&
(ntohs(to.sat_addr.s_net) < 0xff00 ||
ntohs(to.sat_addr.s_net) > 0xfffe))
continue;
if (to.sat_addr.s_node !=
AA_SAT(aa)->sat_addr.s_node &&
to.sat_addr.s_node != ATADDR_BCAST)
continue;
break;
}
}
}
/*
* Adjust the length, removing any padding that may have been added
* at a link layer. We do this before we attempt to forward a packet,
* possibly on a different media.
*/
mlen = m->m_pkthdr.len;
if (mlen < dlen) {
DDP_STATINC(DDP_STAT_TOOSMALL);
m_freem(m);
return;
}
if (mlen > dlen) {
m_adj(m, dlen - mlen);
}
/*
* XXX Should we deliver broadcasts locally, also, or rely on the
* link layer to give us a copy? For the moment, the latter.
*/
if (aa == NULL || (to.sat_addr.s_node == ATADDR_BCAST &&
aa->aa_ifp != ifp && (ifp->if_flags & IFF_LOOPBACK) == 0)) {
if (ddp_forward == 0) {
m_freem(m);
return;
}
sockaddr_at_init(&u.dsta, &to.sat_addr, 0);
rt = rtcache_lookup(&forwro, &u.dst);
#if 0 /* XXX The if-condition is always false. What was this
* actually trying to test?
*/
if (to.sat_addr.s_net !=
satocsat(rtcache_getdst(&forwro))->sat_addr.s_net &&
ddpe.deh_hops == DDP_MAXHOPS) {
m_freem(m);
return;
}
#endif
if (ddp_firewall && (rt == NULL || rt->rt_ifp != ifp)) {
rtcache_unref(rt, &forwro);
m_freem(m);
return;
}
rtcache_unref(rt, &forwro);
ddpe.deh_hops++;
ddpe.deh_bytes = htonl(ddpe.deh_bytes);
memcpy((void *) deh, (void *) & ddpe, sizeof(u_short));/*XXX*/
if (ddp_route(m, &forwro)) {
DDP_STATINC(DDP_STAT_CANTFORWARD);
} else {
DDP_STATINC(DDP_STAT_FORWARD);
}
return;
}
from.sat_len = sizeof(struct sockaddr_at);
from.sat_family = AF_APPLETALK;
if (elh) {
m_adj(m, sizeof(struct ddpshdr));
} else {
if (ddp_cksum && cksum && cksum != at_cksum(m, sizeof(int))) {
DDP_STATINC(DDP_STAT_BADSUM);
m_freem(m);
return;
}
m_adj(m, sizeof(struct ddpehdr));
}
if ((ddp = ddp_search(&from, &to, aa)) == NULL) {
m_freem(m);
return;
}
if (sbappendaddr(&ddp->ddp_socket->so_rcv, (struct sockaddr *) & from,
m, (struct mbuf *) 0) == 0) {
DDP_STATINC(DDP_STAT_NOSOCKSPACE);
soroverflow(ddp->ddp_socket);
m_freem(m);
return;
}
#if IFA_STATS
if (aa)
aa->aa_ifa.ifa_data.ifad_inbytes += dlen;
#endif
sorwakeup(ddp->ddp_socket);
}
#if 0
#define BPXLEN 48
#define BPALEN 16
#include <ctype.h>
static void
bprint(char *data, int len)
{
char xout[BPXLEN], aout[BPALEN];
int i = 0;
memset(xout, 0, BPXLEN);
memset(aout, 0, BPALEN);
for (;;) {
if (len < 1) {
if (i != 0) {
printf("%s\t%s\n", xout, aout);
}
printf("%s\n", "(end)");
break;
}
xout[(i * 3)] = hexdigits[(*data & 0xf0) >> 4];
xout[(i * 3) + 1] = hexdigits[*data & 0x0f];
if ((u_char) * data < 0x7f && (u_char) * data > 0x20) {
aout[i] = *data;
} else {
aout[i] = '.';
}
xout[(i * 3) + 2] = ' ';
i++;
len--;
data++;
if (i > BPALEN - 2) {
printf("%s\t%s\n", xout, aout);
memset(xout, 0, BPXLEN);
memset(aout, 0, BPALEN);
i = 0;
continue;
}
}
}
static void
m_printm(struct mbuf *m)
{
for (; m; m = m->m_next)
bprint(mtod(m, char *), m->m_len);
}
#endif
|