]>
Commit | Line | Data |
---|---|---|
7f57883e | 1 | /* |
b748db67 | 2 | * Eigrp Sending and Receiving EIGRP Reply Packets. |
7f57883e DS |
3 | * Copyright (C) 2013-2016 |
4 | * Authors: | |
5 | * Donnie Savage | |
6 | * Jan Janovic | |
7 | * Matej Perina | |
8 | * Peter Orsag | |
9 | * Peter Paluch | |
10 | * Frantisek Gazo | |
11 | * Tomas Hvorkovy | |
12 | * Martin Kontsek | |
13 | * Lukas Koribsky | |
14 | * | |
15 | * This file is part of GNU Zebra. | |
16 | * | |
17 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
18 | * under the terms of the GNU General Public License as published by the | |
19 | * Free Software Foundation; either version 2, or (at your option) any | |
20 | * later version. | |
21 | * | |
22 | * GNU Zebra is distributed in the hope that it will be useful, but | |
23 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
24 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
25 | * General Public License for more details. | |
26 | * | |
896014f4 DL |
27 | * You should have received a copy of the GNU General Public License along |
28 | * with this program; see the file COPYING; if not, write to the Free Software | |
29 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
7f57883e DS |
30 | */ |
31 | ||
32 | #include <zebra.h> | |
33 | ||
34 | #include "thread.h" | |
35 | #include "memory.h" | |
36 | #include "linklist.h" | |
37 | #include "prefix.h" | |
38 | #include "if.h" | |
39 | #include "table.h" | |
40 | #include "sockunion.h" | |
41 | #include "stream.h" | |
42 | #include "log.h" | |
43 | #include "sockopt.h" | |
44 | #include "checksum.h" | |
45 | #include "md5.h" | |
46 | #include "vty.h" | |
47 | #include "keychain.h" | |
48 | #include "plist.h" | |
49 | ||
50 | #include "eigrpd/eigrp_structs.h" | |
51 | #include "eigrpd/eigrpd.h" | |
52 | #include "eigrpd/eigrp_interface.h" | |
53 | #include "eigrpd/eigrp_neighbor.h" | |
54 | #include "eigrpd/eigrp_packet.h" | |
55 | #include "eigrpd/eigrp_zebra.h" | |
56 | #include "eigrpd/eigrp_vty.h" | |
57 | #include "eigrpd/eigrp_dump.h" | |
58 | #include "eigrpd/eigrp_macros.h" | |
59 | #include "eigrpd/eigrp_topology.h" | |
60 | #include "eigrpd/eigrp_fsm.h" | |
61 | #include "eigrpd/eigrp_memory.h" | |
62 | ||
d62a17ae | 63 | void eigrp_send_reply(struct eigrp_neighbor *nbr, struct eigrp_prefix_entry *pe) |
7f57883e | 64 | { |
d62a17ae | 65 | struct eigrp_packet *ep; |
66 | u_int16_t length = EIGRP_HEADER_LEN; | |
71b52ef2 DS |
67 | struct eigrp_interface *ei = nbr->ei; |
68 | struct eigrp *eigrp = ei->eigrp; | |
d62a17ae | 69 | struct eigrp_prefix_entry *pe2; |
70 | ||
71 | // TODO: Work in progress | |
72 | /* Filtering */ | |
73 | /* get list from eigrp process */ | |
d62a17ae | 74 | pe2 = XCALLOC(MTYPE_EIGRP_PREFIX_ENTRY, |
75 | sizeof(struct eigrp_prefix_entry)); | |
76 | memcpy(pe2, pe, sizeof(struct eigrp_prefix_entry)); | |
71b52ef2 DS |
77 | |
78 | if (eigrp_update_prefix_apply(eigrp, ei, | |
79 | EIGRP_FILTER_OUT, | |
80 | pe2->destination)) { | |
d62a17ae | 81 | zlog_info("REPLY SEND: Setting Metric to max"); |
82 | pe2->reported_metric.delay = EIGRP_MAX_METRIC; | |
83 | ||
d62a17ae | 84 | } |
85 | ||
86 | /* | |
87 | * End of filtering | |
88 | */ | |
89 | ||
71b52ef2 | 90 | ep = eigrp_packet_new(ei->ifp->mtu, nbr); |
d62a17ae | 91 | |
92 | /* Prepare EIGRP INIT UPDATE header */ | |
71b52ef2 DS |
93 | eigrp_packet_header_init(EIGRP_OPC_REPLY, eigrp, ep->s, 0, |
94 | eigrp->sequence_number, 0); | |
d62a17ae | 95 | |
96 | // encode Authentication TLV, if needed | |
b748db67 DS |
97 | if (ei->params.auth_type == EIGRP_AUTH_TYPE_MD5 |
98 | && (ei->params.auth_keychain != NULL)) { | |
71b52ef2 | 99 | length += eigrp_add_authTLV_MD5_to_stream(ep->s, ei); |
d62a17ae | 100 | } |
101 | ||
102 | ||
103 | length += eigrp_add_internalTLV_to_stream(ep->s, pe2); | |
104 | ||
b748db67 DS |
105 | if ((ei->params.auth_type == EIGRP_AUTH_TYPE_MD5) |
106 | && (ei->params.auth_keychain != NULL)) { | |
71b52ef2 | 107 | eigrp_make_md5_digest(ei, ep->s, EIGRP_AUTH_UPDATE_FLAG); |
d62a17ae | 108 | } |
109 | ||
110 | /* EIGRP Checksum */ | |
71b52ef2 | 111 | eigrp_packet_checksum(ei, ep->s, length); |
d62a17ae | 112 | |
113 | ep->length = length; | |
114 | ep->dst.s_addr = nbr->src.s_addr; | |
115 | ||
116 | /*This ack number we await from neighbor*/ | |
71b52ef2 | 117 | ep->sequence_number = eigrp->sequence_number; |
d62a17ae | 118 | |
119 | /*Put packet to retransmission queue*/ | |
f90f65a2 | 120 | eigrp_fifo_push(nbr->retrans_queue, ep); |
d62a17ae | 121 | |
122 | if (nbr->retrans_queue->count == 1) { | |
123 | eigrp_send_packet_reliably(nbr); | |
124 | } | |
125 | ||
126 | XFREE(MTYPE_EIGRP_PREFIX_ENTRY, pe2); | |
7f57883e DS |
127 | } |
128 | ||
129 | /*EIGRP REPLY read function*/ | |
d62a17ae | 130 | void eigrp_reply_receive(struct eigrp *eigrp, struct ip *iph, |
131 | struct eigrp_header *eigrph, struct stream *s, | |
132 | struct eigrp_interface *ei, int size) | |
7f57883e | 133 | { |
d62a17ae | 134 | struct eigrp_neighbor *nbr; |
135 | struct TLV_IPv4_Internal_type *tlv; | |
136 | ||
d62a17ae | 137 | u_int16_t type; |
138 | ||
139 | /* increment statistics. */ | |
140 | ei->reply_in++; | |
141 | ||
142 | /* get neighbor struct */ | |
143 | nbr = eigrp_nbr_get(ei, eigrph, iph); | |
144 | ||
145 | /* neighbor must be valid, eigrp_nbr_get creates if none existed */ | |
146 | assert(nbr); | |
147 | ||
148 | nbr->recv_sequence_number = ntohl(eigrph->sequence); | |
149 | ||
150 | while (s->endp > s->getp) { | |
151 | type = stream_getw(s); | |
b42a4a09 DS |
152 | |
153 | if (type != EIGRP_TLV_IPv4_INT) | |
154 | continue; | |
155 | ||
156 | struct prefix dest_addr; | |
157 | ||
158 | stream_set_getp(s, s->getp - sizeof(u_int16_t)); | |
159 | ||
160 | tlv = eigrp_read_ipv4_tlv(s); | |
161 | ||
162 | dest_addr.family = AF_INET; | |
163 | dest_addr.u.prefix4 = tlv->destination; | |
164 | dest_addr.prefixlen = tlv->prefix_length; | |
165 | struct eigrp_prefix_entry *dest = | |
166 | eigrp_topology_table_lookup_ipv4( | |
167 | eigrp->topology_table, &dest_addr); | |
168 | /* | |
169 | * Destination must exists | |
170 | */ | |
171 | if (!dest) { | |
172 | char buf[PREFIX_STRLEN]; | |
2fd89ed7 | 173 | |
b42a4a09 DS |
174 | zlog_err("%s: Received prefix %s which we do not know about", |
175 | __PRETTY_FUNCTION__, | |
2fd89ed7 DS |
176 | prefix2str(&dest_addr, buf, sizeof(buf))); |
177 | eigrp_IPv4_InternalTLV_free(tlv); | |
b42a4a09 DS |
178 | continue; |
179 | } | |
180 | ||
181 | struct eigrp_fsm_action_message msg; | |
182 | struct eigrp_nexthop_entry *entry = | |
183 | eigrp_prefix_entry_lookup(dest->entries, nbr); | |
184 | ||
185 | if (eigrp_update_prefix_apply(eigrp, ei, | |
186 | EIGRP_FILTER_IN, | |
187 | &dest_addr)) { | |
188 | tlv->metric.delay = EIGRP_MAX_METRIC; | |
d62a17ae | 189 | } |
b42a4a09 DS |
190 | /* |
191 | * End of filtering | |
192 | */ | |
193 | ||
194 | msg.packet_type = EIGRP_OPC_REPLY; | |
195 | msg.eigrp = eigrp; | |
196 | msg.data_type = EIGRP_INT; | |
197 | msg.adv_router = nbr; | |
198 | msg.metrics = tlv->metric; | |
199 | msg.entry = entry; | |
200 | msg.prefix = dest; | |
201 | eigrp_fsm_event(&msg); | |
202 | ||
203 | eigrp_IPv4_InternalTLV_free(tlv); | |
d62a17ae | 204 | } |
205 | eigrp_hello_send_ack(nbr); | |
7f57883e | 206 | } |