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
|
/* $OpenBSD: prune.c,v 1.5 2015/05/05 01:26:37 jsg Exp $ */
/*
* Copyright (c) 2005, 2006 Esben Norby <norby@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netinet/ip.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <strings.h>
#include "igmp.h"
#include "dvmrpd.h"
#include "dvmrp.h"
#include "log.h"
#include "dvmrpe.h"
/* DVMRP prune packet handling */
int
send_prune(struct nbr *nbr, struct prune *p)
{
struct sockaddr_in dst;
struct ibuf *buf;
struct dvmrp_hdr *dvmrp_hdr;
struct prune_hdr prune;
int ret = 0;
log_debug("send_prune: interface %s nbr %s", nbr->iface->name,
inet_ntoa(nbr->addr));
if (nbr->iface->passive)
return (0);
bzero(&prune, sizeof(prune));
dst.sin_family = AF_INET;
dst.sin_len = sizeof(struct sockaddr_in);
dst.sin_addr = nbr->addr;
if ((buf = ibuf_open(nbr->iface->mtu - sizeof(struct ip))) == NULL)
fatal("send_prune");
/* DVMRP header */
if (gen_dvmrp_hdr(buf, nbr->iface, DVMRP_CODE_PRUNE))
goto fail;
prune.src_host_addr = p->origin.s_addr;
prune.group_addr = p->group.s_addr;
/* XXX */
prune.lifetime = htonl(MAX_PRUNE_LIFETIME);
prune.src_netmask = p->netmask.s_addr;
ibuf_add(buf, &prune, sizeof(prune));
/* update chksum */
dvmrp_hdr = ibuf_seek(buf, 0, sizeof(*dvmrp_hdr));
dvmrp_hdr->chksum = in_cksum(buf->buf, buf->wpos);
ret = send_packet(nbr->iface, buf->buf, buf->wpos, &dst);
ibuf_free(buf);
return (ret);
fail:
log_warn("send_prune");
ibuf_free(buf);
return (-1);
}
void
recv_prune(struct nbr *nbr, char *buf, u_int16_t len)
{
struct prune p;
struct prune_hdr *prune;
log_debug("recv_prune: neighbor ID %s", inet_ntoa(nbr->id));
if (len < PRUNE_MIN_LEN) {
log_debug("recv_prune: packet malformed from %s",
inet_ntoa(nbr->id));
return;
}
bzero(&p, sizeof(p));
prune = (struct prune_hdr *)buf;
p.origin.s_addr = prune->src_host_addr;
p.group.s_addr = prune->group_addr;
p.lifetime = prune->lifetime;
if (len >= sizeof(*prune))
p.netmask.s_addr = prune->src_netmask;
p.ifindex = nbr->iface->ifindex;
dvmrpe_imsg_compose_rde(IMSG_RECV_PRUNE, nbr->peerid, 0, &p, sizeof(p));
return;
}
|
