eigrpd/eigrp_interface.c

   1 /*
   2  * EIGRP Interface Functions.
   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  *
  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
  30  */
  31
  32 #include <zebra.h>
  33
  34 #include "thread.h"
  35 #include "linklist.h"
  36 #include "prefix.h"
  37 #include "if.h"
  38 #include "table.h"
  39 #include "memory.h"
  40 #include "command.h"
  41 #include "stream.h"
  42 #include "log.h"
  43 #include "keychain.h"
  44 #include "vrf.h"
  45
  46 #include "eigrpd/eigrp_structs.h"
  47 #include "eigrpd/eigrpd.h"
  48 #include "eigrpd/eigrp_interface.h"
  49 #include "eigrpd/eigrp_neighbor.h"
  50 #include "eigrpd/eigrp_packet.h"
  51 #include "eigrpd/eigrp_zebra.h"
  52 #include "eigrpd/eigrp_vty.h"
  53 #include "eigrpd/eigrp_network.h"
  54 #include "eigrpd/eigrp_topology.h"
  55 #include "eigrpd/eigrp_memory.h"
  56 #include "eigrpd/eigrp_fsm.h"
  57
  58 struct eigrp_interface *eigrp_if_new(struct eigrp *eigrp, struct interface *ifp,
  59                                      struct prefix *p)
  60 {
  61         struct eigrp_interface *ei = ifp->info;
  62         int i;
  63
  64         if (ei)
  65                 return ei;
  66
  67         ei = XCALLOC(MTYPE_EIGRP_IF, sizeof(struct eigrp_interface));
  68
  69         /* Set zebra interface pointer. */
  70         ei->ifp = ifp;
  71         prefix_copy(&ei->address, p);
  72
  73         ifp->info = ei;
  74         listnode_add(eigrp->eiflist, ei);
  75
  76         ei->type = EIGRP_IFTYPE_BROADCAST;
  77
  78         /* Initialize neighbor list. */
  79         ei->nbrs = list_new();
  80
  81         ei->crypt_seqnum = time(NULL);
  82
  83         /* Initialize lists */
  84         for (i = 0; i < EIGRP_FILTER_MAX; i++) {
  85                 ei->list[i] = NULL;
  86                 ei->prefix[i] = NULL;
  87                 ei->routemap[i] = NULL;
  88         }
  89
  90         ei->eigrp = eigrp;
  91
  92         ei->params.v_hello = EIGRP_HELLO_INTERVAL_DEFAULT;
  93         ei->params.v_wait = EIGRP_HOLD_INTERVAL_DEFAULT;
  94         ei->params.bandwidth = EIGRP_BANDWIDTH_DEFAULT;
  95         ei->params.delay = EIGRP_DELAY_DEFAULT;
  96         ei->params.reliability = EIGRP_RELIABILITY_DEFAULT;
  97         ei->params.load = EIGRP_LOAD_DEFAULT;
  98         ei->params.auth_type = EIGRP_AUTH_TYPE_NONE;
  99         ei->params.auth_keychain = NULL;
 100
 101         return ei;
 102 }
 103
 104 int eigrp_if_delete_hook(struct interface *ifp)
 105 {
 106         struct eigrp_interface *ei = ifp->info;
 107         struct eigrp *eigrp;
 108
 109         if (!ei)
 110                 return 0;
 111
 112         list_delete(&ei->nbrs);
 113
 114         eigrp = ei->eigrp;
 115         listnode_delete(eigrp->eiflist, ei);
 116
 117         eigrp_fifo_free(ei->obuf);
 118
 119         XFREE(MTYPE_EIGRP_IF_INFO, ifp->info);
 120         ifp->info = NULL;
 121
 122         return 0;
 123 }
 124
 125 struct list *eigrp_iflist;
 126
 127 void eigrp_if_init(void)
 128 {
 129         /* Initialize Zebra interface data structure. */
 130         // hook_register_prio(if_add, 0, eigrp_if_new);
 131         hook_register_prio(if_del, 0, eigrp_if_delete_hook);
 132 }
 133
 134
 135 void eigrp_del_if_params(struct eigrp_if_params *eip)
 136 {
 137         if (eip->auth_keychain)
 138                 free(eip->auth_keychain);
 139 }
 140
 141 int eigrp_if_up(struct eigrp_interface *ei)
 142 {
 143         struct eigrp_prefix_entry *pe;
 144         struct eigrp_nexthop_entry *ne;
 145         struct eigrp_metrics metric;
 146         struct eigrp_interface *ei2;
 147         struct listnode *node, *nnode;
 148         struct eigrp *eigrp;
 149
 150         if (ei == NULL)
 151                 return 0;
 152
 153         eigrp = ei->eigrp;
 154         eigrp_adjust_sndbuflen(eigrp, ei->ifp->mtu);
 155
 156         eigrp_if_stream_set(ei);
 157
 158         /* Set multicast memberships appropriately for new state. */
 159         eigrp_if_set_multicast(ei);
 160
 161         thread_add_event(master, eigrp_hello_timer, ei, (1), NULL);
 162
 163         /*Prepare metrics*/
 164         metric.bandwidth = eigrp_bandwidth_to_scaled(ei->params.bandwidth);
 165         metric.delay = eigrp_delay_to_scaled(ei->params.delay);
 166         metric.load = ei->params.load;
 167         metric.reliability = ei->params.reliability;
 168         metric.mtu[0] = 0xDC;
 169         metric.mtu[1] = 0x05;
 170         metric.mtu[2] = 0x00;
 171         metric.hop_count = 0;
 172         metric.flags = 0;
 173         metric.tag = 0;
 174
 175         /*Add connected entry to topology table*/
 176
 177         ne = eigrp_nexthop_entry_new();
 178         ne->ei = ei;
 179         ne->reported_metric = metric;
 180         ne->total_metric = metric;
 181         ne->distance = eigrp_calculate_metrics(eigrp, metric);
 182         ne->reported_distance = 0;
 183         ne->adv_router = eigrp->neighbor_self;
 184         ne->flags = EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG;
 185
 186         struct prefix dest_addr;
 187
 188         dest_addr = ei->address;
 189         apply_mask(&dest_addr);
 190         pe = eigrp_topology_table_lookup_ipv4(eigrp->topology_table,
 191                                               &dest_addr);
 192
 193         if (pe == NULL) {
 194                 pe = eigrp_prefix_entry_new();
 195                 pe->serno = eigrp->serno;
 196                 pe->destination = (struct prefix *)prefix_ipv4_new();
 197                 prefix_copy(pe->destination, &dest_addr);
 198                 pe->af = AF_INET;
 199                 pe->nt = EIGRP_TOPOLOGY_TYPE_CONNECTED;
 200
 201                 ne->prefix = pe;
 202                 pe->reported_metric = metric;
 203                 pe->state = EIGRP_FSM_STATE_PASSIVE;
 204                 pe->fdistance = eigrp_calculate_metrics(eigrp, metric);
 205                 pe->req_action |= EIGRP_FSM_NEED_UPDATE;
 206                 eigrp_prefix_entry_add(eigrp->topology_table, pe);
 207                 listnode_add(eigrp->topology_changes_internalIPV4, pe);
 208
 209                 eigrp_nexthop_entry_add(pe, ne);
 210
 211                 for (ALL_LIST_ELEMENTS(eigrp->eiflist, node, nnode, ei2)) {
 212                         eigrp_update_send(ei2);
 213                 }
 214
 215                 pe->req_action &= ~EIGRP_FSM_NEED_UPDATE;
 216                 listnode_delete(eigrp->topology_changes_internalIPV4, pe);
 217         } else {
 218                 struct eigrp_fsm_action_message msg;
 219
 220                 ne->prefix = pe;
 221                 eigrp_nexthop_entry_add(pe, ne);
 222
 223                 msg.packet_type = EIGRP_OPC_UPDATE;
 224                 msg.eigrp = eigrp;
 225                 msg.data_type = EIGRP_CONNECTED;
 226                 msg.adv_router = NULL;
 227                 msg.entry = ne;
 228                 msg.prefix = pe;
 229
 230                 eigrp_fsm_event(&msg);
 231         }
 232
 233         return 1;
 234 }
 235
 236 int eigrp_if_down(struct eigrp_interface *ei)
 237 {
 238         struct listnode *node, *nnode;
 239         struct eigrp_neighbor *nbr;
 240
 241         if (ei == NULL)
 242                 return 0;
 243
 244         /* Shutdown packet reception and sending */
 245         if (ei->t_hello)
 246                 THREAD_OFF(ei->t_hello);
 247
 248         eigrp_if_stream_unset(ei);
 249
 250         /*Set infinite metrics to routes learned by this interface and start
 251          * query process*/
 252         for (ALL_LIST_ELEMENTS(ei->nbrs, node, nnode, nbr)) {
 253                 eigrp_nbr_delete(nbr);
 254         }
 255
 256         return 1;
 257 }
 258
 259 void eigrp_if_stream_set(struct eigrp_interface *ei)
 260 {
 261         /* set output fifo queue. */
 262         if (ei->obuf == NULL)
 263                 ei->obuf = eigrp_fifo_new();
 264 }
 265
 266 void eigrp_if_stream_unset(struct eigrp_interface *ei)
 267 {
 268         struct eigrp *eigrp = ei->eigrp;
 269
 270         if (ei->on_write_q) {
 271                 listnode_delete(eigrp->oi_write_q, ei);
 272                 if (list_isempty(eigrp->oi_write_q))
 273                         thread_cancel(eigrp->t_write);
 274                 ei->on_write_q = 0;
 275         }
 276 }
 277
 278 bool eigrp_if_is_passive(struct eigrp_interface *ei)
 279 {
 280         if (ei->params.passive_interface == EIGRP_IF_ACTIVE)
 281                 return false;
 282
 283         if (ei->eigrp->passive_interface_default == EIGRP_IF_ACTIVE)
 284                 return false;
 285
 286         return true;
 287 }
 288
 289 void eigrp_if_set_multicast(struct eigrp_interface *ei)
 290 {
 291         if (!eigrp_if_is_passive(ei)) {
 292                 /* The interface should belong to the EIGRP-all-routers group.
 293                  */
 294                 if (!ei->member_allrouters
 295                     && (eigrp_if_add_allspfrouters(ei->eigrp, &ei->address,
 296                                                    ei->ifp->ifindex)
 297                         >= 0))
 298                         /* Set the flag only if the system call to join
 299                          * succeeded. */
 300                         ei->member_allrouters = true;
 301         } else {
 302                 /* The interface should NOT belong to the EIGRP-all-routers
 303                  * group. */
 304                 if (ei->member_allrouters) {
 305                         /* Only actually drop if this is the last reference */
 306                         eigrp_if_drop_allspfrouters(ei->eigrp, &ei->address,
 307                                                     ei->ifp->ifindex);
 308                         /* Unset the flag regardless of whether the system call
 309                            to leave
 310                            the group succeeded, since it's much safer to assume
 311                            that
 312                            we are not a member. */
 313                         ei->member_allrouters = false;
 314                 }
 315         }
 316 }
 317
 318 uint8_t eigrp_default_iftype(struct interface *ifp)
 319 {
 320         if (if_is_pointopoint(ifp))
 321                 return EIGRP_IFTYPE_POINTOPOINT;
 322         else if (if_is_loopback(ifp))
 323                 return EIGRP_IFTYPE_LOOPBACK;
 324         else
 325                 return EIGRP_IFTYPE_BROADCAST;
 326 }
 327
 328 void eigrp_if_free(struct eigrp_interface *ei, int source)
 329 {
 330         struct prefix dest_addr;
 331         struct eigrp_prefix_entry *pe;
 332         struct eigrp *eigrp = eigrp_lookup();
 333
 334         if (!eigrp)
 335                 return;
 336
 337         if (source == INTERFACE_DOWN_BY_VTY) {
 338                 THREAD_OFF(ei->t_hello);
 339                 eigrp_hello_send(ei, EIGRP_HELLO_GRACEFUL_SHUTDOWN, NULL);
 340         }
 341
 342         dest_addr = ei->address;
 343         apply_mask(&dest_addr);
 344         pe = eigrp_topology_table_lookup_ipv4(eigrp->topology_table,
 345                                               &dest_addr);
 346         if (pe)
 347                 eigrp_prefix_entry_delete(eigrp->topology_table, pe);
 348
 349         eigrp_if_down(ei);
 350
 351         listnode_delete(ei->eigrp->eiflist, ei);
 352 }
 353
 354 /* Simulate down/up on the interface.  This is needed, for example, when
 355    the MTU changes. */
 356 void eigrp_if_reset(struct interface *ifp)
 357 {
 358         struct eigrp_interface *ei = ifp->info;
 359
 360         if (!ei)
 361                 return;
 362
 363         eigrp_if_down(ei);
 364         eigrp_if_up(ei);
 365 }
 366
 367 struct eigrp_interface *eigrp_if_lookup_by_local_addr(struct eigrp *eigrp,
 368                                                       struct interface *ifp,
 369                                                       struct in_addr address)
 370 {
 371         struct listnode *node;
 372         struct eigrp_interface *ei;
 373
 374         for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, ei)) {
 375                 if (ifp && ei->ifp != ifp)
 376                         continue;
 377
 378                 if (IPV4_ADDR_SAME(&address, &ei->address.u.prefix4))
 379                         return ei;
 380         }
 381
 382         return NULL;
 383 }
 384
 385 /**
 386  * @fn eigrp_if_lookup_by_name
 387  *
 388  * @param[in]           eigrp           EIGRP process
 389  * @param[in]           if_name         Name of the interface
 390  *
 391  * @return struct eigrp_interface *
 392  *
 393  * @par
 394  * Function is used for lookup interface by name.
 395  */
 396 struct eigrp_interface *eigrp_if_lookup_by_name(struct eigrp *eigrp,
 397                                                 const char *if_name)
 398 {
 399         struct eigrp_interface *ei;
 400         struct listnode *node;
 401
 402         /* iterate over all eigrp interfaces */
 403         for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, ei)) {
 404                 /* compare int name with eigrp interface's name */
 405                 if (strcmp(ei->ifp->name, if_name) == 0) {
 406                         return ei;
 407                 }
 408         }
 409
 410         return NULL;
 411 }
 412
 413 uint32_t eigrp_bandwidth_to_scaled(uint32_t bandwidth)
 414 {
 415         uint64_t temp_bandwidth = (256ull * 10000000) / bandwidth;
 416
 417         temp_bandwidth = temp_bandwidth < EIGRP_MAX_METRIC ? temp_bandwidth
 418                                                            : EIGRP_MAX_METRIC;
 419
 420         return (uint32_t)temp_bandwidth;
 421 }
 422
 423 uint32_t eigrp_scaled_to_bandwidth(uint32_t scaled)
 424 {
 425         uint64_t temp_scaled = scaled * (256ull * 10000000);
 426
 427         temp_scaled =
 428                 temp_scaled < EIGRP_MAX_METRIC ? temp_scaled : EIGRP_MAX_METRIC;
 429
 430         return (uint32_t)temp_scaled;
 431 }
 432
 433 uint32_t eigrp_delay_to_scaled(uint32_t delay)
 434 {
 435         return delay * 256;
 436 }
 437
 438 uint32_t eigrp_scaled_to_delay(uint32_t scaled)
 439 {
 440         return scaled / 256;
 441 }