]>
Commit | Line | Data |
---|---|---|
718e3744 | 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 | * | |
896014f4 DL |
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 | |
718e3744 | 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 | ||
bf8d3d6a | 32 | DEFINE_MTYPE_STATIC(RIPD, RIP_PEER, "RIP peer"); |
814a2585 | 33 | |
d62a17ae | 34 | static struct rip_peer *rip_peer_new(void) |
718e3744 | 35 | { |
d62a17ae | 36 | return XCALLOC(MTYPE_RIP_PEER, sizeof(struct rip_peer)); |
718e3744 | 37 | } |
38 | ||
d62a17ae | 39 | static void rip_peer_free(struct rip_peer *peer) |
718e3744 | 40 | { |
580e37a3 | 41 | THREAD_OFF(peer->t_timeout); |
d62a17ae | 42 | XFREE(MTYPE_RIP_PEER, peer); |
718e3744 | 43 | } |
44 | ||
045c5389 | 45 | struct rip_peer *rip_peer_lookup(struct rip *rip, struct in_addr *addr) |
718e3744 | 46 | { |
d62a17ae | 47 | struct rip_peer *peer; |
48 | struct listnode *node, *nnode; | |
49 | ||
29e897ad | 50 | for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) { |
d62a17ae | 51 | if (IPV4_ADDR_SAME(&peer->addr, addr)) |
52 | return peer; | |
53 | } | |
54 | return NULL; | |
718e3744 | 55 | } |
56 | ||
045c5389 | 57 | struct rip_peer *rip_peer_lookup_next(struct rip *rip, struct in_addr *addr) |
718e3744 | 58 | { |
d62a17ae | 59 | struct rip_peer *peer; |
60 | struct listnode *node, *nnode; | |
61 | ||
29e897ad | 62 | for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) { |
d62a17ae | 63 | if (htonl(peer->addr.s_addr) > htonl(addr->s_addr)) |
64 | return peer; | |
65 | } | |
66 | return NULL; | |
718e3744 | 67 | } |
68 | ||
69 | /* RIP peer is timeout. */ | |
cc9f21da | 70 | static void rip_peer_timeout(struct thread *t) |
718e3744 | 71 | { |
d62a17ae | 72 | struct rip_peer *peer; |
718e3744 | 73 | |
d62a17ae | 74 | peer = THREAD_ARG(t); |
045c5389 | 75 | listnode_delete(peer->rip->peer_list, peer); |
d62a17ae | 76 | rip_peer_free(peer); |
718e3744 | 77 | } |
78 | ||
79 | /* Get RIP peer. At the same time update timeout thread. */ | |
045c5389 | 80 | static struct rip_peer *rip_peer_get(struct rip *rip, struct in_addr *addr) |
718e3744 | 81 | { |
d62a17ae | 82 | struct rip_peer *peer; |
83 | ||
045c5389 | 84 | peer = rip_peer_lookup(rip, addr); |
d62a17ae | 85 | |
86 | if (peer) { | |
f6499a76 | 87 | THREAD_OFF(peer->t_timeout); |
d62a17ae | 88 | } else { |
89 | peer = rip_peer_new(); | |
045c5389 | 90 | peer->rip = rip; |
d62a17ae | 91 | peer->addr = *addr; |
29e897ad | 92 | listnode_add_sort(rip->peer_list, peer); |
d62a17ae | 93 | } |
94 | ||
95 | /* Update timeout thread. */ | |
d62a17ae | 96 | thread_add_timer(master, rip_peer_timeout, peer, RIP_PEER_TIMER_DEFAULT, |
97 | &peer->t_timeout); | |
98 | ||
99 | /* Last update time set. */ | |
100 | time(&peer->uptime); | |
101 | ||
102 | return peer; | |
718e3744 | 103 | } |
104 | ||
045c5389 | 105 | void rip_peer_update(struct rip *rip, struct sockaddr_in *from, uint8_t version) |
718e3744 | 106 | { |
d62a17ae | 107 | struct rip_peer *peer; |
045c5389 | 108 | peer = rip_peer_get(rip, &from->sin_addr); |
d62a17ae | 109 | peer->version = version; |
718e3744 | 110 | } |
111 | ||
045c5389 | 112 | void rip_peer_bad_route(struct rip *rip, struct sockaddr_in *from) |
718e3744 | 113 | { |
d62a17ae | 114 | struct rip_peer *peer; |
045c5389 | 115 | peer = rip_peer_get(rip, &from->sin_addr); |
d62a17ae | 116 | peer->recv_badroutes++; |
718e3744 | 117 | } |
118 | ||
045c5389 | 119 | void rip_peer_bad_packet(struct rip *rip, struct sockaddr_in *from) |
718e3744 | 120 | { |
d62a17ae | 121 | struct rip_peer *peer; |
045c5389 | 122 | peer = rip_peer_get(rip, &from->sin_addr); |
d62a17ae | 123 | peer->recv_badpackets++; |
718e3744 | 124 | } |
125 | ||
126 | /* Display peer uptime. */ | |
d62a17ae | 127 | static char *rip_peer_uptime(struct rip_peer *peer, char *buf, size_t len) |
718e3744 | 128 | { |
d62a17ae | 129 | time_t uptime; |
d62a17ae | 130 | |
131 | /* If there is no connection has been done before print `never'. */ | |
132 | if (peer->uptime == 0) { | |
133 | snprintf(buf, len, "never "); | |
134 | return buf; | |
135 | } | |
136 | ||
137 | /* Get current time. */ | |
138 | uptime = time(NULL); | |
139 | uptime -= peer->uptime; | |
d0636ead MS |
140 | |
141 | frrtime_to_interval(uptime, buf, len); | |
142 | ||
d62a17ae | 143 | return buf; |
718e3744 | 144 | } |
145 | ||
045c5389 | 146 | void rip_peer_display(struct vty *vty, struct rip *rip) |
718e3744 | 147 | { |
d62a17ae | 148 | struct rip_peer *peer; |
149 | struct listnode *node, *nnode; | |
718e3744 | 150 | #define RIP_UPTIME_LEN 25 |
d62a17ae | 151 | char timebuf[RIP_UPTIME_LEN]; |
152 | ||
29e897ad | 153 | for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) { |
53bb7f9b MS |
154 | vty_out(vty, " %-16pI4 %9d %9d %9d %s\n", |
155 | &peer->addr, peer->recv_badpackets, | |
d62a17ae | 156 | peer->recv_badroutes, ZEBRA_RIP_DISTANCE_DEFAULT, |
157 | rip_peer_uptime(peer, timebuf, RIP_UPTIME_LEN)); | |
158 | } | |
718e3744 | 159 | } |
160 | ||
29e897ad | 161 | int rip_peer_list_cmp(struct rip_peer *p1, struct rip_peer *p2) |
718e3744 | 162 | { |
27fa3398 DS |
163 | if (p2->addr.s_addr == p1->addr.s_addr) |
164 | return 0; | |
165 | ||
d17743d3 | 166 | return (htonl(p1->addr.s_addr) < htonl(p2->addr.s_addr)) ? -1 : 1; |
718e3744 | 167 | } |
711915d2 RW |
168 | |
169 | void rip_peer_list_del(void *arg) | |
170 | { | |
171 | rip_peer_free(arg); | |
172 | } |