]>
Commit | Line | Data |
---|---|---|
1 | // SPDX-License-Identifier: GPL-2.0-or-later | |
2 | /* RIP peer support | |
3 | * Copyright (C) 2000 Kunihiro Ishiguro <kunihiro@zebra.org> | |
4 | */ | |
5 | ||
6 | #include <zebra.h> | |
7 | ||
8 | #include "if.h" | |
9 | #include "prefix.h" | |
10 | #include "command.h" | |
11 | #include "linklist.h" | |
12 | #include "frrevent.h" | |
13 | #include "memory.h" | |
14 | ||
15 | #include "ripd/ripd.h" | |
16 | ||
17 | DEFINE_MTYPE_STATIC(RIPD, RIP_PEER, "RIP peer"); | |
18 | ||
19 | static struct rip_peer *rip_peer_new(void) | |
20 | { | |
21 | return XCALLOC(MTYPE_RIP_PEER, sizeof(struct rip_peer)); | |
22 | } | |
23 | ||
24 | static void rip_peer_free(struct rip_peer *peer) | |
25 | { | |
26 | EVENT_OFF(peer->t_timeout); | |
27 | XFREE(MTYPE_RIP_PEER, peer); | |
28 | } | |
29 | ||
30 | struct rip_peer *rip_peer_lookup(struct rip *rip, struct in_addr *addr) | |
31 | { | |
32 | struct rip_peer *peer; | |
33 | struct listnode *node, *nnode; | |
34 | ||
35 | for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) { | |
36 | if (IPV4_ADDR_SAME(&peer->addr, addr)) | |
37 | return peer; | |
38 | } | |
39 | return NULL; | |
40 | } | |
41 | ||
42 | struct rip_peer *rip_peer_lookup_next(struct rip *rip, struct in_addr *addr) | |
43 | { | |
44 | struct rip_peer *peer; | |
45 | struct listnode *node, *nnode; | |
46 | ||
47 | for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) { | |
48 | if (htonl(peer->addr.s_addr) > htonl(addr->s_addr)) | |
49 | return peer; | |
50 | } | |
51 | return NULL; | |
52 | } | |
53 | ||
54 | /* RIP peer is timeout. */ | |
55 | static void rip_peer_timeout(struct event *t) | |
56 | { | |
57 | struct rip_peer *peer; | |
58 | ||
59 | peer = EVENT_ARG(t); | |
60 | listnode_delete(peer->rip->peer_list, peer); | |
61 | rip_peer_free(peer); | |
62 | } | |
63 | ||
64 | /* Get RIP peer. At the same time update timeout thread. */ | |
65 | static struct rip_peer *rip_peer_get(struct rip *rip, struct in_addr *addr) | |
66 | { | |
67 | struct rip_peer *peer; | |
68 | ||
69 | peer = rip_peer_lookup(rip, addr); | |
70 | ||
71 | if (peer) { | |
72 | EVENT_OFF(peer->t_timeout); | |
73 | } else { | |
74 | peer = rip_peer_new(); | |
75 | peer->rip = rip; | |
76 | peer->addr = *addr; | |
77 | listnode_add_sort(rip->peer_list, peer); | |
78 | } | |
79 | ||
80 | /* Update timeout thread. */ | |
81 | event_add_timer(master, rip_peer_timeout, peer, RIP_PEER_TIMER_DEFAULT, | |
82 | &peer->t_timeout); | |
83 | ||
84 | /* Last update time set. */ | |
85 | time(&peer->uptime); | |
86 | ||
87 | return peer; | |
88 | } | |
89 | ||
90 | void rip_peer_update(struct rip *rip, struct sockaddr_in *from, uint8_t version) | |
91 | { | |
92 | struct rip_peer *peer; | |
93 | peer = rip_peer_get(rip, &from->sin_addr); | |
94 | peer->version = version; | |
95 | } | |
96 | ||
97 | void rip_peer_bad_route(struct rip *rip, struct sockaddr_in *from) | |
98 | { | |
99 | struct rip_peer *peer; | |
100 | peer = rip_peer_get(rip, &from->sin_addr); | |
101 | peer->recv_badroutes++; | |
102 | } | |
103 | ||
104 | void rip_peer_bad_packet(struct rip *rip, struct sockaddr_in *from) | |
105 | { | |
106 | struct rip_peer *peer; | |
107 | peer = rip_peer_get(rip, &from->sin_addr); | |
108 | peer->recv_badpackets++; | |
109 | } | |
110 | ||
111 | /* Display peer uptime. */ | |
112 | static char *rip_peer_uptime(struct rip_peer *peer, char *buf, size_t len) | |
113 | { | |
114 | time_t uptime; | |
115 | ||
116 | /* If there is no connection has been done before print `never'. */ | |
117 | if (peer->uptime == 0) { | |
118 | snprintf(buf, len, "never "); | |
119 | return buf; | |
120 | } | |
121 | ||
122 | /* Get current time. */ | |
123 | uptime = time(NULL); | |
124 | uptime -= peer->uptime; | |
125 | ||
126 | frrtime_to_interval(uptime, buf, len); | |
127 | ||
128 | return buf; | |
129 | } | |
130 | ||
131 | void rip_peer_display(struct vty *vty, struct rip *rip) | |
132 | { | |
133 | struct rip_peer *peer; | |
134 | struct listnode *node, *nnode; | |
135 | #define RIP_UPTIME_LEN 25 | |
136 | char timebuf[RIP_UPTIME_LEN]; | |
137 | ||
138 | for (ALL_LIST_ELEMENTS(rip->peer_list, node, nnode, peer)) { | |
139 | vty_out(vty, " %-16pI4 %9d %9d %9d %s\n", | |
140 | &peer->addr, peer->recv_badpackets, | |
141 | peer->recv_badroutes, ZEBRA_RIP_DISTANCE_DEFAULT, | |
142 | rip_peer_uptime(peer, timebuf, RIP_UPTIME_LEN)); | |
143 | } | |
144 | } | |
145 | ||
146 | int rip_peer_list_cmp(struct rip_peer *p1, struct rip_peer *p2) | |
147 | { | |
148 | if (p2->addr.s_addr == p1->addr.s_addr) | |
149 | return 0; | |
150 | ||
151 | return (htonl(p1->addr.s_addr) < htonl(p2->addr.s_addr)) ? -1 : 1; | |
152 | } | |
153 | ||
154 | void rip_peer_list_del(void *arg) | |
155 | { | |
156 | rip_peer_free(arg); | |
157 | } |