ripd/rip_peer.c

   1 /* RIP peer support
   2  * Copyright (C) 2000 Kunihiro Ishiguro <kunihiro@zebra.org>
   3  *
   4  * This file is part of GNU Zebra.
   5  *
   6  * GNU Zebra is free software; you can redistribute it and/or modify it
   7  * under the terms of the GNU General Public License as published by the
   8  * Free Software Foundation; either version 2, or (at your option) any
   9  * later version.
  10  *
  11  * GNU Zebra is distributed in the hope that it will be useful, but
  12  * WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14  * General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU General Public License along
  17  * with this program; see the file COPYING; if not, write to the Free Software
  18  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19  */
  20
  21 #include <zebra.h>
  22
  23 #include "if.h"
  24 #include "prefix.h"
  25 #include "command.h"
  26 #include "linklist.h"
  27 #include "thread.h"
  28 #include "memory.h"
  29
  30 #include "ripd/ripd.h"
  31
  32 DEFINE_MTYPE_STATIC(RIPD, RIP_PEER, "RIP peer")
  33
  34 static struct rip_peer *rip_peer_new(void)
  35 {
  36         return XCALLOC(MTYPE_RIP_PEER, sizeof(struct rip_peer));
  37 }
  38
  39 static void rip_peer_free(struct rip_peer *peer)
  40 {
  41         RIP_TIMER_OFF(peer->t_timeout);
  42         XFREE(MTYPE_RIP_PEER, peer);
  43 }
  44
  45 struct rip_peer *rip_peer_lookup(struct rip *rip, struct in_addr *addr)
  46 {
  47         struct rip_peer *peer;
  48         struct listnode *node, *nnode;
  49
  50         for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) {
  51                 if (IPV4_ADDR_SAME(&peer->addr, addr))
  52                         return peer;
  53         }
  54         return NULL;
  55 }
  56
  57 struct rip_peer *rip_peer_lookup_next(struct rip *rip, struct in_addr *addr)
  58 {
  59         struct rip_peer *peer;
  60         struct listnode *node, *nnode;
  61
  62         for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) {
  63                 if (htonl(peer->addr.s_addr) > htonl(addr->s_addr))
  64                         return peer;
  65         }
  66         return NULL;
  67 }
  68
  69 /* RIP peer is timeout. */
  70 static int rip_peer_timeout(struct thread *t)
  71 {
  72         struct rip_peer *peer;
  73
  74         peer = THREAD_ARG(t);
  75         listnode_delete(peer->rip->peer_list, peer);
  76         rip_peer_free(peer);
  77
  78         return 0;
  79 }
  80
  81 /* Get RIP peer.  At the same time update timeout thread. */
  82 static struct rip_peer *rip_peer_get(struct rip *rip, struct in_addr *addr)
  83 {
  84         struct rip_peer *peer;
  85
  86         peer = rip_peer_lookup(rip, addr);
  87
  88         if (peer) {
  89                 thread_cancel(&peer->t_timeout);
  90         } else {
  91                 peer = rip_peer_new();
  92                 peer->rip = rip;
  93                 peer->addr = *addr;
  94                 listnode_add_sort(rip->peer_list, peer);
  95         }
  96
  97         /* Update timeout thread. */
  98         peer->t_timeout = NULL;
  99         thread_add_timer(master, rip_peer_timeout, peer, RIP_PEER_TIMER_DEFAULT,
 100                          &peer->t_timeout);
 101
 102         /* Last update time set. */
 103         time(&peer->uptime);
 104
 105         return peer;
 106 }
 107
 108 void rip_peer_update(struct rip *rip, struct sockaddr_in *from, uint8_t version)
 109 {
 110         struct rip_peer *peer;
 111         peer = rip_peer_get(rip, &from->sin_addr);
 112         peer->version = version;
 113 }
 114
 115 void rip_peer_bad_route(struct rip *rip, struct sockaddr_in *from)
 116 {
 117         struct rip_peer *peer;
 118         peer = rip_peer_get(rip, &from->sin_addr);
 119         peer->recv_badroutes++;
 120 }
 121
 122 void rip_peer_bad_packet(struct rip *rip, struct sockaddr_in *from)
 123 {
 124         struct rip_peer *peer;
 125         peer = rip_peer_get(rip, &from->sin_addr);
 126         peer->recv_badpackets++;
 127 }
 128
 129 /* Display peer uptime. */
 130 static char *rip_peer_uptime(struct rip_peer *peer, char *buf, size_t len)
 131 {
 132         time_t uptime;
 133
 134         /* If there is no connection has been done before print `never'. */
 135         if (peer->uptime == 0) {
 136                 snprintf(buf, len, "never   ");
 137                 return buf;
 138         }
 139
 140         /* Get current time. */
 141         uptime = time(NULL);
 142         uptime -= peer->uptime;
 143
 144         frrtime_to_interval(uptime, buf, len);
 145
 146         return buf;
 147 }
 148
 149 void rip_peer_display(struct vty *vty, struct rip *rip)
 150 {
 151         struct rip_peer *peer;
 152         struct listnode *node, *nnode;
 153 #define RIP_UPTIME_LEN 25
 154         char timebuf[RIP_UPTIME_LEN];
 155
 156         for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) {
 157                 vty_out(vty, "    %-16pI4 %9d %9d %9d   %s\n",
 158                         &peer->addr, peer->recv_badpackets,
 159                         peer->recv_badroutes, ZEBRA_RIP_DISTANCE_DEFAULT,
 160                         rip_peer_uptime(peer, timebuf, RIP_UPTIME_LEN));
 161         }
 162 }
 163
 164 int rip_peer_list_cmp(struct rip_peer *p1, struct rip_peer *p2)
 165 {
 166         if (p2->addr.s_addr == p1->addr.s_addr)
 167                 return 0;
 168
 169         return (htonl(p1->addr.s_addr) < htonl(p2->addr.s_addr)) ? -1 : 1;
 170 }
 171
 172 void rip_peer_list_del(void *arg)
 173 {
 174         rip_peer_free(arg);
 175 }