]>
Commit | Line | Data |
---|---|---|
f0cbd3ec FB |
1 | /* |
2 | * Copyright (c) 1982, 1986, 1988, 1990, 1993 | |
3 | * The Regents of the University of California. All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
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. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | * | |
33 | * @(#)udp_usrreq.c 8.4 (Berkeley) 1/21/94 | |
34 | * udp_usrreq.c,v 1.4 1994/10/02 17:48:45 phk Exp | |
35 | */ | |
36 | ||
37 | /* | |
38 | * Changes and additions relating to SLiRP | |
39 | * Copyright (c) 1995 Danny Gasparovski. | |
40 | * | |
41 | * Please read the file COPYRIGHT for the | |
42 | * terms and conditions of the copyright. | |
43 | */ | |
44 | ||
45 | #include <slirp.h> | |
46 | #include "ip_icmp.h" | |
47 | ||
48 | struct udpstat udpstat; | |
49 | ||
50 | struct socket udb; | |
51 | ||
52 | /* | |
53 | * UDP protocol implementation. | |
54 | * Per RFC 768, August, 1980. | |
55 | */ | |
56 | #ifndef COMPAT_42 | |
57 | int udpcksum = 1; | |
58 | #else | |
59 | int udpcksum = 0; /* XXX */ | |
60 | #endif | |
61 | ||
62 | struct socket *udp_last_so = &udb; | |
63 | ||
64 | void | |
65 | udp_init() | |
66 | { | |
67 | udb.so_next = udb.so_prev = &udb; | |
68 | } | |
69 | /* m->m_data points at ip packet header | |
70 | * m->m_len length ip packet | |
71 | * ip->ip_len length data (IPDU) | |
72 | */ | |
73 | void | |
74 | udp_input(m, iphlen) | |
75 | register struct mbuf *m; | |
76 | int iphlen; | |
77 | { | |
78 | register struct ip *ip; | |
79 | register struct udphdr *uh; | |
80 | /* struct mbuf *opts = 0;*/ | |
81 | int len; | |
82 | struct ip save_ip; | |
83 | struct socket *so; | |
84 | ||
85 | DEBUG_CALL("udp_input"); | |
86 | DEBUG_ARG("m = %lx", (long)m); | |
87 | DEBUG_ARG("iphlen = %d", iphlen); | |
88 | ||
89 | udpstat.udps_ipackets++; | |
90 | ||
91 | /* | |
92 | * Strip IP options, if any; should skip this, | |
93 | * make available to user, and use on returned packets, | |
94 | * but we don't yet have a way to check the checksum | |
95 | * with options still present. | |
96 | */ | |
97 | if(iphlen > sizeof(struct ip)) { | |
98 | ip_stripoptions(m, (struct mbuf *)0); | |
99 | iphlen = sizeof(struct ip); | |
100 | } | |
101 | ||
102 | /* | |
103 | * Get IP and UDP header together in first mbuf. | |
104 | */ | |
105 | ip = mtod(m, struct ip *); | |
106 | uh = (struct udphdr *)((caddr_t)ip + iphlen); | |
107 | ||
108 | /* | |
109 | * Make mbuf data length reflect UDP length. | |
110 | * If not enough data to reflect UDP length, drop. | |
111 | */ | |
112 | len = ntohs((u_int16_t)uh->uh_ulen); | |
113 | ||
114 | if (ip->ip_len != len) { | |
115 | if (len > ip->ip_len) { | |
116 | udpstat.udps_badlen++; | |
117 | goto bad; | |
118 | } | |
119 | m_adj(m, len - ip->ip_len); | |
120 | ip->ip_len = len; | |
121 | } | |
122 | ||
123 | /* | |
124 | * Save a copy of the IP header in case we want restore it | |
125 | * for sending an ICMP error message in response. | |
126 | */ | |
127 | save_ip = *ip; | |
128 | save_ip.ip_len+= iphlen; /* tcp_input subtracts this */ | |
129 | ||
130 | /* | |
131 | * Checksum extended UDP header and data. | |
132 | */ | |
133 | if (udpcksum && uh->uh_sum) { | |
134 | ((struct ipovly *)ip)->ih_next = 0; | |
135 | ((struct ipovly *)ip)->ih_prev = 0; | |
136 | ((struct ipovly *)ip)->ih_x1 = 0; | |
137 | ((struct ipovly *)ip)->ih_len = uh->uh_ulen; | |
138 | /* keep uh_sum for ICMP reply | |
139 | * uh->uh_sum = cksum(m, len + sizeof (struct ip)); | |
140 | * if (uh->uh_sum) { | |
141 | */ | |
142 | if(cksum(m, len + sizeof(struct ip))) { | |
143 | udpstat.udps_badsum++; | |
144 | goto bad; | |
145 | } | |
146 | } | |
147 | ||
148 | /* | |
149 | * handle DHCP/BOOTP | |
150 | */ | |
151 | if (ntohs(uh->uh_dport) == BOOTP_SERVER) { | |
152 | bootp_input(m); | |
153 | goto bad; | |
154 | } | |
155 | ||
c7f74643 FB |
156 | /* |
157 | * handle TFTP | |
158 | */ | |
159 | if (ntohs(uh->uh_dport) == TFTP_SERVER) { | |
160 | tftp_input(m); | |
161 | goto bad; | |
162 | } | |
163 | ||
f0cbd3ec FB |
164 | /* |
165 | * Locate pcb for datagram. | |
166 | */ | |
167 | so = udp_last_so; | |
168 | if (so->so_lport != uh->uh_sport || | |
169 | so->so_laddr.s_addr != ip->ip_src.s_addr) { | |
170 | struct socket *tmp; | |
171 | ||
172 | for (tmp = udb.so_next; tmp != &udb; tmp = tmp->so_next) { | |
173 | if (tmp->so_lport == uh->uh_sport && | |
174 | tmp->so_laddr.s_addr == ip->ip_src.s_addr) { | |
175 | tmp->so_faddr.s_addr = ip->ip_dst.s_addr; | |
176 | tmp->so_fport = uh->uh_dport; | |
177 | so = tmp; | |
178 | break; | |
179 | } | |
180 | } | |
181 | if (tmp == &udb) { | |
182 | so = NULL; | |
183 | } else { | |
184 | udpstat.udpps_pcbcachemiss++; | |
185 | udp_last_so = so; | |
186 | } | |
187 | } | |
188 | ||
189 | if (so == NULL) { | |
190 | /* | |
191 | * If there's no socket for this packet, | |
192 | * create one | |
193 | */ | |
194 | if ((so = socreate()) == NULL) goto bad; | |
195 | if(udp_attach(so) == -1) { | |
196 | DEBUG_MISC((dfd," udp_attach errno = %d-%s\n", | |
197 | errno,strerror(errno))); | |
198 | sofree(so); | |
199 | goto bad; | |
200 | } | |
201 | ||
202 | /* | |
203 | * Setup fields | |
204 | */ | |
205 | /* udp_last_so = so; */ | |
206 | so->so_laddr = ip->ip_src; | |
207 | so->so_lport = uh->uh_sport; | |
208 | so->so_faddr = ip->ip_dst; /* XXX */ | |
209 | so->so_fport = uh->uh_dport; /* XXX */ | |
210 | ||
211 | if ((so->so_iptos = udp_tos(so)) == 0) | |
212 | so->so_iptos = ip->ip_tos; | |
213 | ||
214 | /* | |
215 | * XXXXX Here, check if it's in udpexec_list, | |
216 | * and if it is, do the fork_exec() etc. | |
217 | */ | |
218 | } | |
219 | ||
220 | iphlen += sizeof(struct udphdr); | |
221 | m->m_len -= iphlen; | |
222 | m->m_data += iphlen; | |
223 | ||
224 | /* | |
225 | * Now we sendto() the packet. | |
226 | */ | |
227 | if (so->so_emu) | |
228 | udp_emu(so, m); | |
229 | ||
230 | if(sosendto(so,m) == -1) { | |
231 | m->m_len += iphlen; | |
232 | m->m_data -= iphlen; | |
233 | *ip=save_ip; | |
234 | DEBUG_MISC((dfd,"udp tx errno = %d-%s\n",errno,strerror(errno))); | |
235 | icmp_error(m, ICMP_UNREACH,ICMP_UNREACH_NET, 0,strerror(errno)); | |
236 | } | |
237 | ||
238 | m_free(so->so_m); /* used for ICMP if error on sorecvfrom */ | |
239 | ||
240 | /* restore the orig mbuf packet */ | |
241 | m->m_len += iphlen; | |
242 | m->m_data -= iphlen; | |
243 | *ip=save_ip; | |
244 | so->so_m=m; /* ICMP backup */ | |
245 | ||
246 | return; | |
247 | bad: | |
248 | m_freem(m); | |
249 | /* if (opts) m_freem(opts); */ | |
250 | return; | |
251 | } | |
252 | ||
253 | int udp_output2(struct socket *so, struct mbuf *m, | |
254 | struct sockaddr_in *saddr, struct sockaddr_in *daddr, | |
255 | int iptos) | |
256 | { | |
257 | register struct udpiphdr *ui; | |
258 | int error = 0; | |
259 | ||
260 | DEBUG_CALL("udp_output"); | |
261 | DEBUG_ARG("so = %lx", (long)so); | |
262 | DEBUG_ARG("m = %lx", (long)m); | |
263 | DEBUG_ARG("saddr = %lx", (long)saddr->sin_addr.s_addr); | |
264 | DEBUG_ARG("daddr = %lx", (long)daddr->sin_addr.s_addr); | |
265 | ||
266 | /* | |
267 | * Adjust for header | |
268 | */ | |
269 | m->m_data -= sizeof(struct udpiphdr); | |
270 | m->m_len += sizeof(struct udpiphdr); | |
271 | ||
272 | /* | |
273 | * Fill in mbuf with extended UDP header | |
274 | * and addresses and length put into network format. | |
275 | */ | |
276 | ui = mtod(m, struct udpiphdr *); | |
277 | ui->ui_next = ui->ui_prev = 0; | |
278 | ui->ui_x1 = 0; | |
279 | ui->ui_pr = IPPROTO_UDP; | |
280 | ui->ui_len = htons(m->m_len - sizeof(struct ip)); /* + sizeof (struct udphdr)); */ | |
281 | /* XXXXX Check for from-one-location sockets, or from-any-location sockets */ | |
282 | ui->ui_src = saddr->sin_addr; | |
283 | ui->ui_dst = daddr->sin_addr; | |
284 | ui->ui_sport = saddr->sin_port; | |
285 | ui->ui_dport = daddr->sin_port; | |
286 | ui->ui_ulen = ui->ui_len; | |
287 | ||
288 | /* | |
289 | * Stuff checksum and output datagram. | |
290 | */ | |
291 | ui->ui_sum = 0; | |
292 | if (udpcksum) { | |
293 | if ((ui->ui_sum = cksum(m, /* sizeof (struct udpiphdr) + */ m->m_len)) == 0) | |
294 | ui->ui_sum = 0xffff; | |
295 | } | |
296 | ((struct ip *)ui)->ip_len = m->m_len; | |
297 | ||
298 | ((struct ip *)ui)->ip_ttl = ip_defttl; | |
299 | ((struct ip *)ui)->ip_tos = iptos; | |
300 | ||
301 | udpstat.udps_opackets++; | |
302 | ||
303 | error = ip_output(so, m); | |
304 | ||
305 | return (error); | |
306 | } | |
307 | ||
308 | int udp_output(struct socket *so, struct mbuf *m, | |
309 | struct sockaddr_in *addr) | |
310 | ||
311 | { | |
312 | struct sockaddr_in saddr, daddr; | |
313 | ||
314 | saddr = *addr; | |
315 | if ((so->so_faddr.s_addr & htonl(0xffffff00)) == special_addr.s_addr) | |
316 | saddr.sin_addr.s_addr = so->so_faddr.s_addr; | |
317 | daddr.sin_addr = so->so_laddr; | |
318 | daddr.sin_port = so->so_lport; | |
319 | ||
320 | return udp_output2(so, m, &saddr, &daddr, so->so_iptos); | |
321 | } | |
322 | ||
323 | int | |
324 | udp_attach(so) | |
325 | struct socket *so; | |
326 | { | |
327 | struct sockaddr_in addr; | |
328 | ||
329 | if((so->s = socket(AF_INET,SOCK_DGRAM,0)) != -1) { | |
330 | /* | |
331 | * Here, we bind() the socket. Although not really needed | |
332 | * (sendto() on an unbound socket will bind it), it's done | |
333 | * here so that emulation of ytalk etc. don't have to do it | |
334 | */ | |
335 | addr.sin_family = AF_INET; | |
336 | addr.sin_port = 0; | |
337 | addr.sin_addr.s_addr = INADDR_ANY; | |
338 | if(bind(so->s, (struct sockaddr *)&addr, sizeof(addr))<0) { | |
339 | int lasterrno=errno; | |
379ff53d | 340 | closesocket(so->s); |
f0cbd3ec | 341 | so->s=-1; |
02d2c54c FB |
342 | #ifdef _WIN32 |
343 | WSASetLastError(lasterrno); | |
344 | #else | |
f0cbd3ec | 345 | errno=lasterrno; |
02d2c54c | 346 | #endif |
f0cbd3ec FB |
347 | } else { |
348 | /* success, insert in queue */ | |
349 | so->so_expire = curtime + SO_EXPIRE; | |
350 | insque(so,&udb); | |
351 | } | |
352 | } | |
353 | return(so->s); | |
354 | } | |
355 | ||
356 | void | |
357 | udp_detach(so) | |
358 | struct socket *so; | |
359 | { | |
379ff53d | 360 | closesocket(so->s); |
f0cbd3ec FB |
361 | /* if (so->so_m) m_free(so->so_m); done by sofree */ |
362 | ||
363 | sofree(so); | |
364 | } | |
365 | ||
366 | struct tos_t udptos[] = { | |
367 | {0, 53, IPTOS_LOWDELAY, 0}, /* DNS */ | |
368 | {517, 517, IPTOS_LOWDELAY, EMU_TALK}, /* talk */ | |
369 | {518, 518, IPTOS_LOWDELAY, EMU_NTALK}, /* ntalk */ | |
370 | {0, 7648, IPTOS_LOWDELAY, EMU_CUSEEME}, /* Cu-Seeme */ | |
371 | {0, 0, 0, 0} | |
372 | }; | |
373 | ||
374 | u_int8_t | |
375 | udp_tos(so) | |
376 | struct socket *so; | |
377 | { | |
378 | int i = 0; | |
379 | ||
380 | while(udptos[i].tos) { | |
381 | if ((udptos[i].fport && ntohs(so->so_fport) == udptos[i].fport) || | |
382 | (udptos[i].lport && ntohs(so->so_lport) == udptos[i].lport)) { | |
383 | so->so_emu = udptos[i].emu; | |
384 | return udptos[i].tos; | |
385 | } | |
386 | i++; | |
387 | } | |
388 | ||
389 | return 0; | |
390 | } | |
391 | ||
392 | #ifdef EMULATE_TALK | |
393 | #include "talkd.h" | |
394 | #endif | |
395 | ||
396 | /* | |
397 | * Here, talk/ytalk/ntalk requests must be emulated | |
398 | */ | |
399 | void | |
400 | udp_emu(so, m) | |
401 | struct socket *so; | |
402 | struct mbuf *m; | |
403 | { | |
404 | struct sockaddr_in addr; | |
405 | int addrlen = sizeof(addr); | |
406 | #ifdef EMULATE_TALK | |
407 | CTL_MSG_OLD *omsg; | |
408 | CTL_MSG *nmsg; | |
409 | char buff[sizeof(CTL_MSG)]; | |
410 | u_char type; | |
411 | ||
412 | struct talk_request { | |
413 | struct talk_request *next; | |
414 | struct socket *udp_so; | |
415 | struct socket *tcp_so; | |
416 | } *req; | |
417 | ||
418 | static struct talk_request *req_tbl = 0; | |
419 | ||
420 | #endif | |
421 | ||
422 | struct cu_header { | |
423 | char dest[8]; | |
424 | short family; | |
425 | u_short port; | |
426 | u_long addr; | |
427 | } *cu_head; | |
428 | ||
429 | switch(so->so_emu) { | |
430 | ||
431 | #ifdef EMULATE_TALK | |
432 | case EMU_TALK: | |
433 | case EMU_NTALK: | |
434 | /* | |
435 | * Talk emulation. We always change the ctl_addr to get | |
436 | * some answers from the daemon. When an ANNOUNCE comes, | |
437 | * we send LEAVE_INVITE to the local daemons. Also when a | |
438 | * DELETE comes, we send copies to the local daemons. | |
439 | */ | |
440 | if (getsockname(so->s, (struct sockaddr *)&addr, &addrlen) < 0) | |
441 | return; | |
442 | ||
443 | #define IS_OLD (so->so_emu == EMU_TALK) | |
444 | ||
445 | #define COPY_MSG(dest, src) { dest->type = src->type; \ | |
446 | dest->id_num = src->id_num; \ | |
447 | dest->pid = src->pid; \ | |
448 | dest->addr = src->addr; \ | |
449 | dest->ctl_addr = src->ctl_addr; \ | |
450 | memcpy(&dest->l_name, &src->l_name, NAME_SIZE_OLD); \ | |
451 | memcpy(&dest->r_name, &src->r_name, NAME_SIZE_OLD); \ | |
452 | memcpy(&dest->r_tty, &src->r_tty, TTY_SIZE); } | |
453 | ||
454 | #define OTOSIN(ptr, field) ((struct sockaddr_in *)&ptr->field) | |
455 | /* old_sockaddr to sockaddr_in */ | |
456 | ||
457 | ||
458 | if (IS_OLD) { /* old talk */ | |
459 | omsg = mtod(m, CTL_MSG_OLD*); | |
460 | nmsg = (CTL_MSG *) buff; | |
461 | type = omsg->type; | |
462 | OTOSIN(omsg, ctl_addr)->sin_port = addr.sin_port; | |
463 | OTOSIN(omsg, ctl_addr)->sin_addr = our_addr; | |
464 | strncpy(omsg->l_name, getlogin(), NAME_SIZE_OLD); | |
465 | } else { /* new talk */ | |
466 | omsg = (CTL_MSG_OLD *) buff; | |
467 | nmsg = mtod(m, CTL_MSG *); | |
468 | type = nmsg->type; | |
469 | OTOSIN(nmsg, ctl_addr)->sin_port = addr.sin_port; | |
470 | OTOSIN(nmsg, ctl_addr)->sin_addr = our_addr; | |
471 | strncpy(nmsg->l_name, getlogin(), NAME_SIZE_OLD); | |
472 | } | |
473 | ||
474 | if (type == LOOK_UP) | |
475 | return; /* for LOOK_UP this is enough */ | |
476 | ||
477 | if (IS_OLD) { /* make a copy of the message */ | |
478 | COPY_MSG(nmsg, omsg); | |
479 | nmsg->vers = 1; | |
480 | nmsg->answer = 0; | |
481 | } else | |
482 | COPY_MSG(omsg, nmsg); | |
483 | ||
484 | /* | |
485 | * If if is an ANNOUNCE message, we go through the | |
486 | * request table to see if a tcp port has already | |
487 | * been redirected for this socket. If not, we solisten() | |
488 | * a new socket and add this entry to the table. | |
489 | * The port number of the tcp socket and our IP | |
490 | * are put to the addr field of the message structures. | |
491 | * Then a LEAVE_INVITE is sent to both local daemon | |
492 | * ports, 517 and 518. This is why we have two copies | |
493 | * of the message, one in old talk and one in new talk | |
494 | * format. | |
495 | */ | |
496 | ||
497 | if (type == ANNOUNCE) { | |
498 | int s; | |
499 | u_short temp_port; | |
500 | ||
501 | for(req = req_tbl; req; req = req->next) | |
502 | if (so == req->udp_so) | |
503 | break; /* found it */ | |
504 | ||
505 | if (!req) { /* no entry for so, create new */ | |
506 | req = (struct talk_request *) | |
507 | malloc(sizeof(struct talk_request)); | |
508 | req->udp_so = so; | |
509 | req->tcp_so = solisten(0, | |
510 | OTOSIN(omsg, addr)->sin_addr.s_addr, | |
511 | OTOSIN(omsg, addr)->sin_port, | |
512 | SS_FACCEPTONCE); | |
513 | req->next = req_tbl; | |
514 | req_tbl = req; | |
515 | } | |
516 | ||
517 | /* replace port number in addr field */ | |
518 | addrlen = sizeof(addr); | |
519 | getsockname(req->tcp_so->s, | |
520 | (struct sockaddr *) &addr, | |
521 | &addrlen); | |
522 | OTOSIN(omsg, addr)->sin_port = addr.sin_port; | |
523 | OTOSIN(omsg, addr)->sin_addr = our_addr; | |
524 | OTOSIN(nmsg, addr)->sin_port = addr.sin_port; | |
525 | OTOSIN(nmsg, addr)->sin_addr = our_addr; | |
526 | ||
527 | /* send LEAVE_INVITEs */ | |
528 | temp_port = OTOSIN(omsg, ctl_addr)->sin_port; | |
529 | OTOSIN(omsg, ctl_addr)->sin_port = 0; | |
530 | OTOSIN(nmsg, ctl_addr)->sin_port = 0; | |
531 | omsg->type = nmsg->type = LEAVE_INVITE; | |
532 | ||
533 | s = socket(AF_INET, SOCK_DGRAM, IPPROTO_IP); | |
534 | addr.sin_addr = our_addr; | |
535 | addr.sin_family = AF_INET; | |
536 | addr.sin_port = htons(517); | |
537 | sendto(s, (char *)omsg, sizeof(*omsg), 0, | |
538 | (struct sockaddr *)&addr, sizeof(addr)); | |
539 | addr.sin_port = htons(518); | |
540 | sendto(s, (char *)nmsg, sizeof(*nmsg), 0, | |
541 | (struct sockaddr *) &addr, sizeof(addr)); | |
379ff53d | 542 | closesocket(s) ; |
f0cbd3ec FB |
543 | |
544 | omsg->type = nmsg->type = ANNOUNCE; | |
545 | OTOSIN(omsg, ctl_addr)->sin_port = temp_port; | |
546 | OTOSIN(nmsg, ctl_addr)->sin_port = temp_port; | |
547 | } | |
548 | ||
549 | /* | |
550 | * If it is a DELETE message, we send a copy to the | |
551 | * local daemons. Then we delete the entry corresponding | |
552 | * to our socket from the request table. | |
553 | */ | |
554 | ||
555 | if (type == DELETE) { | |
556 | struct talk_request *temp_req, *req_next; | |
557 | int s; | |
558 | u_short temp_port; | |
559 | ||
560 | temp_port = OTOSIN(omsg, ctl_addr)->sin_port; | |
561 | OTOSIN(omsg, ctl_addr)->sin_port = 0; | |
562 | OTOSIN(nmsg, ctl_addr)->sin_port = 0; | |
563 | ||
564 | s = socket(AF_INET, SOCK_DGRAM, IPPROTO_IP); | |
565 | addr.sin_addr = our_addr; | |
566 | addr.sin_family = AF_INET; | |
567 | addr.sin_port = htons(517); | |
568 | sendto(s, (char *)omsg, sizeof(*omsg), 0, | |
569 | (struct sockaddr *)&addr, sizeof(addr)); | |
570 | addr.sin_port = htons(518); | |
571 | sendto(s, (char *)nmsg, sizeof(*nmsg), 0, | |
572 | (struct sockaddr *)&addr, sizeof(addr)); | |
379ff53d | 573 | closesocket(s); |
f0cbd3ec FB |
574 | |
575 | OTOSIN(omsg, ctl_addr)->sin_port = temp_port; | |
576 | OTOSIN(nmsg, ctl_addr)->sin_port = temp_port; | |
577 | ||
578 | /* delete table entry */ | |
579 | if (so == req_tbl->udp_so) { | |
580 | temp_req = req_tbl; | |
581 | req_tbl = req_tbl->next; | |
582 | free(temp_req); | |
583 | } else { | |
584 | temp_req = req_tbl; | |
585 | for(req = req_tbl->next; req; req = req_next) { | |
586 | req_next = req->next; | |
587 | if (so == req->udp_so) { | |
588 | temp_req->next = req_next; | |
589 | free(req); | |
590 | break; | |
591 | } else { | |
592 | temp_req = req; | |
593 | } | |
594 | } | |
595 | } | |
596 | } | |
597 | ||
598 | return; | |
599 | #endif | |
600 | ||
601 | case EMU_CUSEEME: | |
602 | ||
603 | /* | |
604 | * Cu-SeeMe emulation. | |
605 | * Hopefully the packet is more that 16 bytes long. We don't | |
606 | * do any other tests, just replace the address and port | |
607 | * fields. | |
608 | */ | |
609 | if (m->m_len >= sizeof (*cu_head)) { | |
610 | if (getsockname(so->s, (struct sockaddr *)&addr, &addrlen) < 0) | |
611 | return; | |
612 | cu_head = mtod(m, struct cu_header *); | |
613 | cu_head->port = addr.sin_port; | |
614 | cu_head->addr = (u_long) our_addr.s_addr; | |
615 | } | |
616 | ||
617 | return; | |
618 | } | |
619 | } | |
620 | ||
621 | struct socket * | |
622 | udp_listen(port, laddr, lport, flags) | |
623 | u_int port; | |
624 | u_int32_t laddr; | |
625 | u_int lport; | |
626 | int flags; | |
627 | { | |
628 | struct sockaddr_in addr; | |
629 | struct socket *so; | |
630 | int addrlen = sizeof(struct sockaddr_in), opt = 1; | |
631 | ||
632 | if ((so = socreate()) == NULL) { | |
633 | free(so); | |
634 | return NULL; | |
635 | } | |
636 | so->s = socket(AF_INET,SOCK_DGRAM,0); | |
637 | so->so_expire = curtime + SO_EXPIRE; | |
638 | insque(so,&udb); | |
639 | ||
640 | addr.sin_family = AF_INET; | |
641 | addr.sin_addr.s_addr = INADDR_ANY; | |
642 | addr.sin_port = port; | |
643 | ||
644 | if (bind(so->s,(struct sockaddr *)&addr, addrlen) < 0) { | |
645 | udp_detach(so); | |
646 | return NULL; | |
647 | } | |
648 | setsockopt(so->s,SOL_SOCKET,SO_REUSEADDR,(char *)&opt,sizeof(int)); | |
649 | /* setsockopt(so->s,SOL_SOCKET,SO_OOBINLINE,(char *)&opt,sizeof(int)); */ | |
650 | ||
651 | getsockname(so->s,(struct sockaddr *)&addr,&addrlen); | |
652 | so->so_fport = addr.sin_port; | |
653 | if (addr.sin_addr.s_addr == 0 || addr.sin_addr.s_addr == loopback_addr.s_addr) | |
654 | so->so_faddr = our_addr; | |
655 | else | |
656 | so->so_faddr = addr.sin_addr; | |
657 | ||
658 | so->so_lport = lport; | |
659 | so->so_laddr.s_addr = laddr; | |
660 | if (flags != SS_FACCEPTONCE) | |
661 | so->so_expire = 0; | |
662 | ||
663 | so->so_state = SS_ISFCONNECTED; | |
664 | ||
665 | return so; | |
666 | } |