]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * EIGRP Daemon Program. | |
3 | * Copyright (C) 2013-2014 | |
4 | * Authors: | |
5 | * Donnie Savage | |
6 | * Jan Janovic | |
7 | * Matej Perina | |
8 | * Peter Orsag | |
9 | * Peter Paluch | |
10 | * | |
11 | * This file is part of GNU Zebra. | |
12 | * | |
13 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
14 | * under the terms of the GNU General Public License as published by the | |
15 | * Free Software Foundation; either version 2, or (at your option) any | |
16 | * later version. | |
17 | * | |
18 | * GNU Zebra is distributed in the hope that it will be useful, but | |
19 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
20 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
21 | * General Public License for more details. | |
22 | * | |
23 | * You should have received a copy of the GNU General Public License along | |
24 | * with this program; see the file COPYING; if not, write to the Free Software | |
25 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
26 | */ | |
27 | ||
28 | #include <zebra.h> | |
29 | ||
30 | #include "thread.h" | |
31 | #include "vty.h" | |
32 | #include "command.h" | |
33 | #include "linklist.h" | |
34 | #include "prefix.h" | |
35 | #include "table.h" | |
36 | #include "if.h" | |
37 | #include "memory.h" | |
38 | #include "stream.h" | |
39 | #include "log.h" | |
40 | #include "sockunion.h" /* for inet_aton () */ | |
41 | #include "zclient.h" | |
42 | #include "plist.h" | |
43 | #include "sockopt.h" | |
44 | #include "keychain.h" | |
45 | #include "libfrr.h" | |
46 | #include "lib_errors.h" | |
47 | #include "distribute.h" | |
48 | ||
49 | #include "eigrpd/eigrp_structs.h" | |
50 | #include "eigrpd/eigrpd.h" | |
51 | #include "eigrpd/eigrp_interface.h" | |
52 | #include "eigrpd/eigrp_zebra.h" | |
53 | #include "eigrpd/eigrp_vty.h" | |
54 | #include "eigrpd/eigrp_neighbor.h" | |
55 | #include "eigrpd/eigrp_packet.h" | |
56 | #include "eigrpd/eigrp_network.h" | |
57 | #include "eigrpd/eigrp_topology.h" | |
58 | #include "eigrpd/eigrp_memory.h" | |
59 | #include "eigrpd/eigrp_filter.h" | |
60 | ||
61 | DEFINE_QOBJ_TYPE(eigrp) | |
62 | ||
63 | static struct eigrp_master eigrp_master; | |
64 | ||
65 | struct eigrp_master *eigrp_om; | |
66 | ||
67 | static struct eigrp *eigrp_new(const char *); | |
68 | ||
69 | extern struct zclient *zclient; | |
70 | extern struct in_addr router_id_zebra; | |
71 | ||
72 | ||
73 | /* | |
74 | * void eigrp_router_id_update(struct eigrp *eigrp) | |
75 | * | |
76 | * Description: | |
77 | * update routerid associated with this instance of EIGRP. | |
78 | * If the id changes, then call if_update for each interface | |
79 | * to resync the topology database with all neighbors | |
80 | * | |
81 | * Select the router ID based on these priorities: | |
82 | * 1. Statically assigned router ID is always the first choice. | |
83 | * 2. If there is no statically assigned router ID, then try to stick | |
84 | * with the most recent value, since changing router ID's is very | |
85 | * disruptive. | |
86 | * 3. Last choice: just go with whatever the zebra daemon recommends. | |
87 | * | |
88 | * Note: | |
89 | * router id for EIGRP is really just a 32 bit number. Cisco historically | |
90 | * displays it in dotted decimal notation, and will pickup an IP address | |
91 | * from an interface so it can be 'auto-configed" to a uniqe value | |
92 | * | |
93 | * This does not work for IPv6, and to make the code simpler, its | |
94 | * stored and processed internerall as a 32bit number | |
95 | */ | |
96 | void eigrp_router_id_update(struct eigrp *eigrp) | |
97 | { | |
98 | struct vrf *vrf = vrf_lookup_by_id(VRF_DEFAULT); | |
99 | struct interface *ifp; | |
100 | struct in_addr router_id, router_id_old; | |
101 | ||
102 | router_id_old = eigrp->router_id; | |
103 | ||
104 | if (eigrp->router_id_static.s_addr != 0) | |
105 | router_id = eigrp->router_id_static; | |
106 | ||
107 | else if (eigrp->router_id.s_addr != 0) | |
108 | router_id = eigrp->router_id; | |
109 | ||
110 | else | |
111 | router_id = router_id_zebra; | |
112 | ||
113 | eigrp->router_id = router_id; | |
114 | if (router_id_old.s_addr != router_id.s_addr) { | |
115 | // if (IS_DEBUG_EIGRP_EVENT) | |
116 | // zlog_debug("Router-ID[NEW:%s]: Update", | |
117 | // inet_ntoa(eigrp->router_id)); | |
118 | ||
119 | /* update eigrp_interface's */ | |
120 | FOR_ALL_INTERFACES (vrf, ifp) | |
121 | eigrp_if_update(ifp); | |
122 | } | |
123 | } | |
124 | ||
125 | void eigrp_master_init(void) | |
126 | { | |
127 | struct timeval tv; | |
128 | ||
129 | memset(&eigrp_master, 0, sizeof(struct eigrp_master)); | |
130 | ||
131 | eigrp_om = &eigrp_master; | |
132 | eigrp_om->eigrp = list_new(); | |
133 | ||
134 | monotime(&tv); | |
135 | eigrp_om->start_time = tv.tv_sec; | |
136 | } | |
137 | ||
138 | /* Allocate new eigrp structure. */ | |
139 | static struct eigrp *eigrp_new(const char *AS) | |
140 | { | |
141 | struct eigrp *eigrp = XCALLOC(MTYPE_EIGRP_TOP, sizeof(struct eigrp)); | |
142 | int eigrp_socket; | |
143 | ||
144 | /* init information relevant to peers */ | |
145 | eigrp->vrid = 0; | |
146 | eigrp->AS = atoi(AS); | |
147 | eigrp->router_id.s_addr = 0; | |
148 | eigrp->router_id_static.s_addr = 0; | |
149 | eigrp->sequence_number = 1; | |
150 | ||
151 | /*Configure default K Values for EIGRP Process*/ | |
152 | eigrp->k_values[0] = EIGRP_K1_DEFAULT; | |
153 | eigrp->k_values[1] = EIGRP_K2_DEFAULT; | |
154 | eigrp->k_values[2] = EIGRP_K3_DEFAULT; | |
155 | eigrp->k_values[3] = EIGRP_K4_DEFAULT; | |
156 | eigrp->k_values[4] = EIGRP_K5_DEFAULT; | |
157 | eigrp->k_values[5] = EIGRP_K6_DEFAULT; | |
158 | ||
159 | /* init internal data structures */ | |
160 | eigrp->eiflist = list_new(); | |
161 | eigrp->passive_interface_default = EIGRP_IF_ACTIVE; | |
162 | eigrp->networks = eigrp_topology_new(); | |
163 | ||
164 | if ((eigrp_socket = eigrp_sock_init()) < 0) { | |
165 | flog_err_sys( | |
166 | EC_LIB_SOCKET, | |
167 | "eigrp_new: fatal error: eigrp_sock_init was unable to open a socket"); | |
168 | exit(1); | |
169 | } | |
170 | ||
171 | eigrp->fd = eigrp_socket; | |
172 | eigrp->maxsndbuflen = getsockopt_so_sendbuf(eigrp->fd); | |
173 | ||
174 | eigrp->ibuf = stream_new(EIGRP_PACKET_MAX_LEN + 1); | |
175 | ||
176 | eigrp->t_read = NULL; | |
177 | thread_add_read(master, eigrp_read, eigrp, eigrp->fd, &eigrp->t_read); | |
178 | eigrp->oi_write_q = list_new(); | |
179 | ||
180 | eigrp->topology_table = route_table_init(); | |
181 | ||
182 | eigrp->neighbor_self = eigrp_nbr_new(NULL); | |
183 | eigrp->neighbor_self->src.s_addr = INADDR_ANY; | |
184 | ||
185 | eigrp->variance = EIGRP_VARIANCE_DEFAULT; | |
186 | eigrp->max_paths = EIGRP_MAX_PATHS_DEFAULT; | |
187 | ||
188 | eigrp->serno = 0; | |
189 | eigrp->serno_last_update = 0; | |
190 | eigrp->topology_changes_externalIPV4 = list_new(); | |
191 | eigrp->topology_changes_internalIPV4 = list_new(); | |
192 | ||
193 | eigrp->list[EIGRP_FILTER_IN] = NULL; | |
194 | eigrp->list[EIGRP_FILTER_OUT] = NULL; | |
195 | ||
196 | eigrp->prefix[EIGRP_FILTER_IN] = NULL; | |
197 | eigrp->prefix[EIGRP_FILTER_OUT] = NULL; | |
198 | ||
199 | eigrp->routemap[EIGRP_FILTER_IN] = NULL; | |
200 | eigrp->routemap[EIGRP_FILTER_OUT] = NULL; | |
201 | ||
202 | /* Distribute list install. */ | |
203 | eigrp->distribute_ctx = distribute_list_ctx_create( | |
204 | vrf_lookup_by_id(VRF_DEFAULT)); | |
205 | distribute_list_add_hook(eigrp->distribute_ctx, | |
206 | eigrp_distribute_update); | |
207 | distribute_list_delete_hook(eigrp->distribute_ctx, | |
208 | eigrp_distribute_update); | |
209 | QOBJ_REG(eigrp, eigrp); | |
210 | return eigrp; | |
211 | } | |
212 | ||
213 | struct eigrp *eigrp_get(const char *AS) | |
214 | { | |
215 | struct eigrp *eigrp; | |
216 | ||
217 | eigrp = eigrp_lookup(); | |
218 | if (eigrp == NULL) { | |
219 | eigrp = eigrp_new(AS); | |
220 | listnode_add(eigrp_om->eigrp, eigrp); | |
221 | } | |
222 | ||
223 | return eigrp; | |
224 | } | |
225 | ||
226 | /* Shut down the entire process */ | |
227 | void eigrp_terminate(void) | |
228 | { | |
229 | struct eigrp *eigrp; | |
230 | struct listnode *node, *nnode; | |
231 | ||
232 | /* shutdown already in progress */ | |
233 | if (CHECK_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN)) | |
234 | return; | |
235 | ||
236 | SET_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN); | |
237 | ||
238 | for (ALL_LIST_ELEMENTS(eigrp_om->eigrp, node, nnode, eigrp)) | |
239 | eigrp_finish(eigrp); | |
240 | ||
241 | frr_fini(); | |
242 | } | |
243 | ||
244 | void eigrp_finish(struct eigrp *eigrp) | |
245 | { | |
246 | eigrp_finish_final(eigrp); | |
247 | ||
248 | /* eigrp being shut-down? If so, was this the last eigrp instance? */ | |
249 | if (CHECK_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN) | |
250 | && (listcount(eigrp_om->eigrp) == 0)) { | |
251 | if (zclient) { | |
252 | zclient_stop(zclient); | |
253 | zclient_free(zclient); | |
254 | } | |
255 | exit(0); | |
256 | } | |
257 | ||
258 | return; | |
259 | } | |
260 | ||
261 | /* Final cleanup of eigrp instance */ | |
262 | void eigrp_finish_final(struct eigrp *eigrp) | |
263 | { | |
264 | struct eigrp_interface *ei; | |
265 | struct eigrp_neighbor *nbr; | |
266 | struct listnode *node, *nnode, *node2, *nnode2; | |
267 | ||
268 | for (ALL_LIST_ELEMENTS(eigrp->eiflist, node, nnode, ei)) { | |
269 | for (ALL_LIST_ELEMENTS(ei->nbrs, node2, nnode2, nbr)) | |
270 | eigrp_nbr_delete(nbr); | |
271 | eigrp_if_free(ei, INTERFACE_DOWN_BY_FINAL); | |
272 | } | |
273 | ||
274 | THREAD_OFF(eigrp->t_write); | |
275 | THREAD_OFF(eigrp->t_read); | |
276 | close(eigrp->fd); | |
277 | ||
278 | list_delete(&eigrp->eiflist); | |
279 | list_delete(&eigrp->oi_write_q); | |
280 | ||
281 | eigrp_topology_free(eigrp->topology_table); | |
282 | ||
283 | eigrp_nbr_delete(eigrp->neighbor_self); | |
284 | ||
285 | list_delete(&eigrp->topology_changes_externalIPV4); | |
286 | list_delete(&eigrp->topology_changes_internalIPV4); | |
287 | ||
288 | listnode_delete(eigrp_om->eigrp, eigrp); | |
289 | ||
290 | stream_free(eigrp->ibuf); | |
291 | distribute_list_delete(&eigrp->distribute_ctx); | |
292 | XFREE(MTYPE_EIGRP_TOP, eigrp); | |
293 | } | |
294 | ||
295 | /*Look for existing eigrp process*/ | |
296 | struct eigrp *eigrp_lookup(void) | |
297 | { | |
298 | if (listcount(eigrp_om->eigrp) == 0) | |
299 | return NULL; | |
300 | ||
301 | return listgetdata(listhead(eigrp_om->eigrp)); | |
302 | } |