ldp_peer.c revision 1.15 1 1.15 kefren /* $NetBSD: ldp_peer.c,v 1.15 2013/07/20 05:16:08 kefren Exp $ */
2 1.1 kefren
3 1.5 kefren /*
4 1.1 kefren * Copyright (c) 2010 The NetBSD Foundation, Inc.
5 1.1 kefren * All rights reserved.
6 1.1 kefren *
7 1.1 kefren * This code is derived from software contributed to The NetBSD Foundation
8 1.1 kefren * by Mihai Chelaru <kefren (at) NetBSD.org>
9 1.1 kefren *
10 1.1 kefren * Redistribution and use in source and binary forms, with or without
11 1.1 kefren * modification, are permitted provided that the following conditions
12 1.1 kefren * are met:
13 1.1 kefren * 1. Redistributions of source code must retain the above copyright
14 1.1 kefren * notice, this list of conditions and the following disclaimer.
15 1.1 kefren * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 kefren * notice, this list of conditions and the following disclaimer in the
17 1.1 kefren * documentation and/or other materials provided with the distribution.
18 1.1 kefren *
19 1.1 kefren * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 kefren * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 kefren * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 kefren * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 kefren * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 kefren * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 kefren * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 kefren * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 kefren * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 kefren * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 kefren * POSSIBILITY OF SUCH DAMAGE.
30 1.1 kefren */
31 1.1 kefren
32 1.1 kefren #include <sys/types.h>
33 1.1 kefren #include <sys/socket.h>
34 1.1 kefren #include <netinet/in.h>
35 1.3 kefren #include <netinet/tcp.h>
36 1.1 kefren #include <netmpls/mpls.h>
37 1.1 kefren #include <arpa/inet.h>
38 1.1 kefren
39 1.5 kefren #include <assert.h>
40 1.5 kefren #include <errno.h>
41 1.15 kefren #include <fcntl.h>
42 1.1 kefren #include <stdlib.h>
43 1.1 kefren #include <strings.h>
44 1.1 kefren #include <stdio.h>
45 1.1 kefren #include <unistd.h>
46 1.3 kefren
47 1.3 kefren #include "conffile.h"
48 1.1 kefren #include "socketops.h"
49 1.1 kefren #include "ldp_errors.h"
50 1.1 kefren #include "ldp.h"
51 1.1 kefren #include "tlv_stack.h"
52 1.1 kefren #include "mpls_interface.h"
53 1.1 kefren #include "notifications.h"
54 1.1 kefren #include "ldp_peer.h"
55 1.1 kefren
56 1.3 kefren extern int ldp_holddown_time;
57 1.3 kefren
58 1.1 kefren void
59 1.1 kefren ldp_peer_init(void)
60 1.1 kefren {
61 1.1 kefren SLIST_INIT(&ldp_peer_head);
62 1.1 kefren }
63 1.1 kefren
64 1.10 kefren int
65 1.5 kefren sockaddr_cmp(const struct sockaddr *a, const struct sockaddr *b)
66 1.5 kefren {
67 1.11 kefren if (a == NULL || b == NULL || a->sa_len != b->sa_len ||
68 1.11 kefren a->sa_family != b->sa_family)
69 1.5 kefren return -1;
70 1.9 kefren return memcmp(a, b, a->sa_len);
71 1.5 kefren }
72 1.1 kefren /*
73 1.1 kefren * soc should be > 1 if there is already a TCP socket for this else we'll
74 1.1 kefren * initiate a new one
75 1.1 kefren */
76 1.1 kefren struct ldp_peer *
77 1.12 kefren ldp_peer_new(const struct in_addr * ldp_id, const struct sockaddr * padd,
78 1.12 kefren const struct sockaddr * tradd, uint16_t holdtime, int soc)
79 1.1 kefren {
80 1.1 kefren struct ldp_peer *p;
81 1.15 kefren int s = soc, sopts;
82 1.15 kefren union sockunion connecting_su;
83 1.3 kefren struct conf_neighbour *cn;
84 1.6 kefren
85 1.15 kefren assert(tradd == NULL || tradd->sa_family == padd->sa_family);
86 1.1 kefren
87 1.5 kefren if (soc < 1) {
88 1.1 kefren s = socket(PF_INET, SOCK_STREAM, 0);
89 1.5 kefren if (s < 0) {
90 1.5 kefren fatalp("ldp_peer_new: cannot create socket\n");
91 1.5 kefren return NULL;
92 1.5 kefren }
93 1.12 kefren if (tradd != NULL) {
94 1.15 kefren assert(tradd->sa_len <= sizeof(connecting_su));
95 1.15 kefren memcpy(&connecting_su, tradd, tradd->sa_len);
96 1.12 kefren } else {
97 1.15 kefren assert(padd->sa_len <= sizeof(connecting_su));
98 1.15 kefren memcpy(&connecting_su, padd, padd->sa_len);
99 1.12 kefren }
100 1.5 kefren
101 1.15 kefren assert(connecting_su.sa.sa_family == AF_INET ||
102 1.15 kefren connecting_su.sa.sa_family == AF_INET6);
103 1.5 kefren
104 1.15 kefren if (connecting_su.sa.sa_family == AF_INET)
105 1.15 kefren connecting_su.sin.sin_port = htons(LDP_PORT);
106 1.1 kefren else
107 1.15 kefren connecting_su.sin6.sin6_port = htons(LDP_PORT);
108 1.1 kefren
109 1.1 kefren set_ttl(s);
110 1.1 kefren }
111 1.1 kefren
112 1.3 kefren /* MD5 authentication needed ? */
113 1.3 kefren SLIST_FOREACH(cn, &conei_head, neilist)
114 1.6 kefren if (cn->authenticate != 0 &&
115 1.6 kefren ldp_id->s_addr == cn->address.s_addr) {
116 1.3 kefren if (setsockopt(s, IPPROTO_TCP, TCP_MD5SIG, &(int){1},
117 1.3 kefren sizeof(int)) != 0)
118 1.3 kefren fatalp("setsockopt TCP_MD5SIG: %s\n",
119 1.3 kefren strerror(errno));
120 1.3 kefren break;
121 1.3 kefren }
122 1.6 kefren
123 1.1 kefren /* Set the peer in CONNECTING/CONNECTED state */
124 1.2 christos p = calloc(1, sizeof(*p));
125 1.1 kefren
126 1.1 kefren if (!p) {
127 1.3 kefren fatalp("ldp_peer_new: calloc problem\n");
128 1.1 kefren return NULL;
129 1.2 christos }
130 1.1 kefren
131 1.1 kefren SLIST_INSERT_HEAD(&ldp_peer_head, p, peers);
132 1.5 kefren p->address = (struct sockaddr *)malloc(padd->sa_len);
133 1.5 kefren memcpy(p->address, padd, padd->sa_len);
134 1.1 kefren memcpy(&p->ldp_id, ldp_id, sizeof(struct in_addr));
135 1.7 kefren if (tradd != NULL) {
136 1.7 kefren p->transport_address = (struct sockaddr *)malloc(tradd->sa_len);
137 1.5 kefren memcpy(p->transport_address, tradd, tradd->sa_len);
138 1.7 kefren } else {
139 1.7 kefren p->transport_address = (struct sockaddr *)malloc(padd->sa_len);
140 1.5 kefren memcpy(p->transport_address, padd, padd->sa_len);
141 1.7 kefren }
142 1.5 kefren p->holdtime=holdtime > ldp_holddown_time ? holdtime : ldp_holddown_time;
143 1.1 kefren p->socket = s;
144 1.1 kefren if (soc < 1) {
145 1.1 kefren p->state = LDP_PEER_CONNECTING;
146 1.1 kefren p->master = 1;
147 1.1 kefren } else {
148 1.1 kefren p->state = LDP_PEER_CONNECTED;
149 1.1 kefren p->master = 0;
150 1.1 kefren set_ttl(p->socket);
151 1.1 kefren }
152 1.1 kefren SLIST_INIT(&p->ldp_peer_address_head);
153 1.1 kefren SLIST_INIT(&p->label_mapping_head);
154 1.1 kefren p->timeout = p->holdtime;
155 1.1 kefren
156 1.15 kefren sopts = fcntl(p->socket, F_GETFL);
157 1.15 kefren if (sopts >= 0) {
158 1.15 kefren sopts |= O_NONBLOCK;
159 1.15 kefren fcntl(p->socket, F_SETFL, &sopts);
160 1.15 kefren }
161 1.15 kefren
162 1.1 kefren /* And connect to peer */
163 1.15 kefren if (soc < 1 &&
164 1.15 kefren connect(s, &connecting_su.sa, connecting_su.sa.sa_len) == -1) {
165 1.15 kefren if (errno == EINTR || errno == EINPROGRESS)
166 1.15 kefren /* We take care of this in big_loop */
167 1.15 kefren return p;
168 1.15 kefren warnp("connect to %s failed: %s\n",
169 1.15 kefren satos(&connecting_su.sa), strerror(errno));
170 1.15 kefren ldp_peer_holddown(p);
171 1.15 kefren return NULL;
172 1.15 kefren }
173 1.1 kefren p->state = LDP_PEER_CONNECTED;
174 1.1 kefren return p;
175 1.1 kefren }
176 1.1 kefren
177 1.1 kefren void
178 1.1 kefren ldp_peer_holddown(struct ldp_peer * p)
179 1.1 kefren {
180 1.15 kefren
181 1.15 kefren if (!p || p->state == LDP_PEER_HOLDDOWN)
182 1.1 kefren return;
183 1.15 kefren if (p->state == LDP_PEER_ESTABLISHED) {
184 1.15 kefren p->state = LDP_PEER_HOLDDOWN;
185 1.1 kefren mpls_delete_ldp_peer(p);
186 1.15 kefren } else
187 1.15 kefren p->state = LDP_PEER_HOLDDOWN;
188 1.15 kefren p->timeout = p->holdtime;
189 1.1 kefren shutdown(p->socket, SHUT_RDWR);
190 1.1 kefren ldp_peer_delete_all_mappings(p);
191 1.1 kefren del_all_ifaddr(p);
192 1.1 kefren fatalp("LDP Neighbour %s is DOWN\n", inet_ntoa(p->ldp_id));
193 1.1 kefren }
194 1.1 kefren
195 1.1 kefren void
196 1.1 kefren ldp_peer_holddown_all()
197 1.1 kefren {
198 1.1 kefren struct ldp_peer *p;
199 1.1 kefren
200 1.1 kefren SLIST_FOREACH(p, &ldp_peer_head, peers) {
201 1.1 kefren if ((p->state == LDP_PEER_ESTABLISHED) ||
202 1.1 kefren (p->state == LDP_PEER_CONNECTED))
203 1.8 kefren send_notification(p, get_message_id(),
204 1.8 kefren NOTIF_FATAL | NOTIF_SHUTDOWN);
205 1.1 kefren ldp_peer_holddown(p);
206 1.1 kefren }
207 1.1 kefren }
208 1.1 kefren
209 1.1 kefren void
210 1.1 kefren ldp_peer_delete(struct ldp_peer * p)
211 1.1 kefren {
212 1.1 kefren
213 1.1 kefren if (!p)
214 1.1 kefren return;
215 1.1 kefren
216 1.1 kefren SLIST_REMOVE(&ldp_peer_head, p, ldp_peer, peers);
217 1.1 kefren close(p->socket);
218 1.1 kefren warnp("LDP Neighbor %s holddown timer expired\n", inet_ntoa(p->ldp_id));
219 1.5 kefren free(p->address);
220 1.5 kefren free(p->transport_address);
221 1.1 kefren free(p);
222 1.1 kefren }
223 1.1 kefren
224 1.1 kefren struct ldp_peer *
225 1.5 kefren get_ldp_peer(const struct sockaddr * a)
226 1.1 kefren {
227 1.1 kefren struct ldp_peer *p;
228 1.5 kefren const struct sockaddr_in *a_inet = (const struct sockaddr_in *)a;
229 1.1 kefren
230 1.1 kefren SLIST_FOREACH(p, &ldp_peer_head, peers) {
231 1.5 kefren if (a->sa_family == AF_INET &&
232 1.5 kefren memcmp((const void *) &a_inet->sin_addr,
233 1.5 kefren (const void *) &p->ldp_id,
234 1.5 kefren sizeof(struct in_addr)) == 0)
235 1.1 kefren return p;
236 1.11 kefren if (sockaddr_cmp(a, p->address) == 0 ||
237 1.11 kefren sockaddr_cmp(a, p->transport_address) == 0 ||
238 1.11 kefren check_ifaddr(p, a))
239 1.1 kefren return p;
240 1.1 kefren }
241 1.1 kefren return NULL;
242 1.1 kefren }
243 1.1 kefren
244 1.1 kefren struct ldp_peer *
245 1.5 kefren get_ldp_peer_by_id(const struct in_addr *a)
246 1.5 kefren {
247 1.5 kefren struct ldp_peer *p;
248 1.5 kefren
249 1.5 kefren SLIST_FOREACH(p, &ldp_peer_head, peers)
250 1.5 kefren if (memcmp((const void*)a,
251 1.5 kefren (const void*)&p->ldp_id, sizeof(*a)) == 0)
252 1.5 kefren return p;
253 1.5 kefren return NULL;
254 1.5 kefren }
255 1.5 kefren
256 1.5 kefren struct ldp_peer *
257 1.1 kefren get_ldp_peer_by_socket(int s)
258 1.1 kefren {
259 1.1 kefren struct ldp_peer *p;
260 1.1 kefren
261 1.1 kefren SLIST_FOREACH(p, &ldp_peer_head, peers)
262 1.1 kefren if (p->socket == s)
263 1.1 kefren return p;
264 1.1 kefren return NULL;
265 1.1 kefren }
266 1.1 kefren
267 1.1 kefren /*
268 1.1 kefren * Adds address list bounded to a specific peer
269 1.1 kefren * Returns the number of addresses inserted successfuly
270 1.1 kefren */
271 1.1 kefren int
272 1.12 kefren add_ifaddresses(struct ldp_peer * p, const struct al_tlv * a)
273 1.1 kefren {
274 1.1 kefren int i, c, n;
275 1.12 kefren const struct in_addr *ia;
276 1.5 kefren struct sockaddr_in ipa;
277 1.1 kefren
278 1.5 kefren memset(&ipa, 0, sizeof(ipa));
279 1.5 kefren ipa.sin_len = sizeof(ipa);
280 1.5 kefren ipa.sin_family = AF_INET;
281 1.1 kefren /*
282 1.1 kefren * Check if tlv is Address type, if it's correct size (at least one
283 1.1 kefren * address) and if it's IPv4
284 1.1 kefren */
285 1.1 kefren
286 1.1 kefren if ((ntohs(a->type) != TLV_ADDRESS_LIST) ||
287 1.1 kefren (ntohs(a->length) < sizeof(a->af) + sizeof(struct in_addr)) ||
288 1.1 kefren (ntohs(a->af) != LDP_AF_INET))
289 1.1 kefren return 0;
290 1.1 kefren
291 1.1 kefren /* Number of addresses to insert */
292 1.1 kefren n = (ntohs(a->length) - sizeof(a->af)) / sizeof(struct in_addr);
293 1.1 kefren
294 1.1 kefren debugp("Trying to add %d addresses to peer %s ... \n", n,
295 1.1 kefren inet_ntoa(p->ldp_id));
296 1.1 kefren
297 1.12 kefren for (ia = (const struct in_addr *) & a->address,c = 0,i = 0; i<n; i++) {
298 1.5 kefren memcpy(&ipa.sin_addr, &ia[i], sizeof(ipa.sin_addr));
299 1.5 kefren if (add_ifaddr(p, (struct sockaddr *)&ipa) == LDP_E_OK)
300 1.1 kefren c++;
301 1.1 kefren }
302 1.1 kefren
303 1.1 kefren debugp("Added %d addresses\n", c);
304 1.1 kefren
305 1.1 kefren return c;
306 1.1 kefren }
307 1.1 kefren
308 1.1 kefren int
309 1.12 kefren del_ifaddresses(struct ldp_peer * p, const struct al_tlv * a)
310 1.1 kefren {
311 1.1 kefren int i, c, n;
312 1.12 kefren const struct in_addr *ia;
313 1.5 kefren struct sockaddr_in ipa;
314 1.1 kefren
315 1.5 kefren memset(&ipa, 0, sizeof(ipa));
316 1.5 kefren ipa.sin_len = sizeof(ipa);
317 1.5 kefren ipa.sin_family = AF_INET;
318 1.1 kefren /*
319 1.1 kefren * Check if tlv is Address type, if it's correct size (at least one
320 1.1 kefren * address) and if it's IPv4
321 1.1 kefren */
322 1.1 kefren
323 1.1 kefren if (ntohs(a->type) != TLV_ADDRESS_LIST ||
324 1.1 kefren ntohs(a->length) > sizeof(a->af) + sizeof(struct in_addr) ||
325 1.1 kefren ntohs(a->af) != LDP_AF_INET)
326 1.1 kefren return -1;
327 1.1 kefren
328 1.1 kefren n = (ntohs(a->length) - sizeof(a->af)) / sizeof(struct in_addr);
329 1.1 kefren
330 1.1 kefren debugp("Trying to delete %d addresses from peer %s ... \n", n,
331 1.1 kefren inet_ntoa(p->ldp_id));
332 1.1 kefren
333 1.12 kefren for (ia = (const struct in_addr *) & a[1], c = 0, i = 0; i < n; i++) {
334 1.5 kefren memcpy(&ipa.sin_addr, &ia[i], sizeof(ipa.sin_addr));
335 1.5 kefren if (del_ifaddr(p, (struct sockaddr *)&ipa) == LDP_E_OK)
336 1.1 kefren c++;
337 1.1 kefren }
338 1.1 kefren
339 1.1 kefren debugp("Deleted %d addresses\n", c);
340 1.1 kefren
341 1.1 kefren return c;
342 1.1 kefren }
343 1.1 kefren
344 1.1 kefren
345 1.5 kefren /* Adds a _SINGLE_ INET address to a specific peer */
346 1.1 kefren int
347 1.12 kefren add_ifaddr(struct ldp_peer * p, const struct sockaddr * a)
348 1.1 kefren {
349 1.1 kefren struct ldp_peer_address *lpa;
350 1.1 kefren
351 1.1 kefren /* Is it already there ? */
352 1.1 kefren if (check_ifaddr(p, a))
353 1.1 kefren return LDP_E_ALREADY_DONE;
354 1.1 kefren
355 1.2 christos lpa = calloc(1, sizeof(*lpa));
356 1.1 kefren
357 1.1 kefren if (!lpa) {
358 1.1 kefren fatalp("add_ifaddr: malloc problem\n");
359 1.1 kefren return LDP_E_MEMORY;
360 1.2 christos }
361 1.1 kefren
362 1.5 kefren assert(a->sa_len <= sizeof(union sockunion));
363 1.5 kefren
364 1.5 kefren memcpy(&lpa->address.sa, a, a->sa_len);
365 1.1 kefren
366 1.1 kefren SLIST_INSERT_HEAD(&p->ldp_peer_address_head, lpa, addresses);
367 1.1 kefren return LDP_E_OK;
368 1.1 kefren }
369 1.1 kefren
370 1.1 kefren /* Deletes an address bounded to a specific peer */
371 1.1 kefren int
372 1.12 kefren del_ifaddr(struct ldp_peer * p, const struct sockaddr * a)
373 1.1 kefren {
374 1.1 kefren struct ldp_peer_address *wp;
375 1.1 kefren
376 1.1 kefren wp = check_ifaddr(p, a);
377 1.1 kefren if (!wp)
378 1.1 kefren return LDP_E_NOENT;
379 1.1 kefren
380 1.1 kefren SLIST_REMOVE(&p->ldp_peer_address_head, wp, ldp_peer_address,
381 1.1 kefren addresses);
382 1.1 kefren free(wp);
383 1.1 kefren return LDP_E_OK;
384 1.1 kefren }
385 1.1 kefren
386 1.1 kefren /* Checks if an address is already bounded */
387 1.1 kefren struct ldp_peer_address *
388 1.12 kefren check_ifaddr(const struct ldp_peer * p, const struct sockaddr * a)
389 1.1 kefren {
390 1.1 kefren struct ldp_peer_address *wp;
391 1.1 kefren
392 1.1 kefren SLIST_FOREACH(wp, &p->ldp_peer_address_head, addresses)
393 1.5 kefren if (sockaddr_cmp(a, &wp->address.sa) == 0)
394 1.1 kefren return wp;
395 1.1 kefren return NULL;
396 1.1 kefren }
397 1.1 kefren
398 1.1 kefren void
399 1.1 kefren del_all_ifaddr(struct ldp_peer * p)
400 1.1 kefren {
401 1.1 kefren struct ldp_peer_address *wp;
402 1.1 kefren
403 1.1 kefren while (!SLIST_EMPTY(&p->ldp_peer_address_head)) {
404 1.1 kefren wp = SLIST_FIRST(&p->ldp_peer_address_head);
405 1.1 kefren SLIST_REMOVE_HEAD(&p->ldp_peer_address_head, addresses);
406 1.1 kefren free(wp);
407 1.1 kefren }
408 1.1 kefren }
409 1.1 kefren
410 1.1 kefren void
411 1.12 kefren print_bounded_addresses(const struct ldp_peer * p)
412 1.1 kefren {
413 1.1 kefren struct ldp_peer_address *wp;
414 1.7 kefren char abuf[512];
415 1.1 kefren
416 1.1 kefren snprintf(abuf, sizeof(abuf), "Addresses bounded to peer %s: ",
417 1.7 kefren satos(p->address));
418 1.1 kefren SLIST_FOREACH(wp, &p->ldp_peer_address_head, addresses) {
419 1.5 kefren strncat(abuf, satos(&wp->address.sa),
420 1.5 kefren sizeof(abuf) -1);
421 1.1 kefren strncat(abuf, " ", sizeof(abuf) -1);
422 1.1 kefren }
423 1.1 kefren warnp("%s\n", abuf);
424 1.1 kefren }
425 1.1 kefren
426 1.1 kefren /* Adds a label and a prefix to a specific peer */
427 1.1 kefren int
428 1.12 kefren ldp_peer_add_mapping(struct ldp_peer * p, const struct sockaddr * a,
429 1.12 kefren int prefix, int label)
430 1.1 kefren {
431 1.1 kefren struct label_mapping *lma;
432 1.1 kefren
433 1.1 kefren if (!p)
434 1.1 kefren return -1;
435 1.14 kefren if ((lma = ldp_peer_get_lm(p, a, prefix)) != NULL) {
436 1.14 kefren /* Change the current label */
437 1.14 kefren lma->label = label;
438 1.14 kefren return LDP_E_OK;
439 1.14 kefren }
440 1.1 kefren
441 1.2 christos lma = malloc(sizeof(*lma));
442 1.1 kefren
443 1.1 kefren if (!lma) {
444 1.1 kefren fatalp("ldp_peer_add_mapping: malloc problem\n");
445 1.1 kefren return LDP_E_MEMORY;
446 1.1 kefren }
447 1.1 kefren
448 1.5 kefren memcpy(&lma->address, a, a->sa_len);
449 1.1 kefren lma->prefix = prefix;
450 1.1 kefren lma->label = label;
451 1.1 kefren
452 1.1 kefren SLIST_INSERT_HEAD(&p->label_mapping_head, lma, mappings);
453 1.1 kefren
454 1.1 kefren return LDP_E_OK;
455 1.1 kefren }
456 1.1 kefren
457 1.1 kefren int
458 1.12 kefren ldp_peer_delete_mapping(struct ldp_peer * p, const struct sockaddr * a,
459 1.12 kefren int prefix)
460 1.1 kefren {
461 1.1 kefren struct label_mapping *lma;
462 1.1 kefren
463 1.1 kefren if (!a)
464 1.15 kefren return LDP_E_NOENT;
465 1.1 kefren
466 1.1 kefren lma = ldp_peer_get_lm(p, a, prefix);
467 1.1 kefren if (!lma)
468 1.1 kefren return LDP_E_NOENT;
469 1.1 kefren
470 1.1 kefren SLIST_REMOVE(&p->label_mapping_head, lma, label_mapping, mappings);
471 1.1 kefren free(lma);
472 1.1 kefren
473 1.1 kefren return LDP_E_OK;
474 1.1 kefren }
475 1.1 kefren
476 1.1 kefren struct label_mapping *
477 1.12 kefren ldp_peer_get_lm(const struct ldp_peer * p, const struct sockaddr * a,
478 1.12 kefren uint prefix)
479 1.1 kefren {
480 1.1 kefren struct label_mapping *rv;
481 1.1 kefren
482 1.1 kefren if (!p)
483 1.1 kefren return NULL;
484 1.1 kefren
485 1.1 kefren SLIST_FOREACH(rv, &p->label_mapping_head, mappings)
486 1.5 kefren if (rv->prefix == prefix && sockaddr_cmp(a, &rv->address.sa)==0)
487 1.1 kefren break;
488 1.1 kefren
489 1.1 kefren return rv;
490 1.1 kefren
491 1.1 kefren }
492 1.1 kefren
493 1.15 kefren void
494 1.1 kefren ldp_peer_delete_all_mappings(struct ldp_peer * p)
495 1.1 kefren {
496 1.1 kefren struct label_mapping *lma;
497 1.1 kefren
498 1.1 kefren while(!SLIST_EMPTY(&p->label_mapping_head)) {
499 1.1 kefren lma = SLIST_FIRST(&p->label_mapping_head);
500 1.1 kefren SLIST_REMOVE_HEAD(&p->label_mapping_head, mappings);
501 1.1 kefren free(lma);
502 1.1 kefren }
503 1.1 kefren }
504 1.1 kefren
505 1.1 kefren /* returns a mapping and its peer */
506 1.1 kefren struct peer_map *
507 1.12 kefren ldp_test_mapping(const struct sockaddr * a, int prefix,
508 1.12 kefren const struct sockaddr * gate)
509 1.1 kefren {
510 1.1 kefren struct ldp_peer *lpeer;
511 1.1 kefren struct peer_map *rv = NULL;
512 1.1 kefren struct label_mapping *lm = NULL;
513 1.1 kefren
514 1.1 kefren /* Checks if it's LPDID, else checks if it's an interface */
515 1.1 kefren
516 1.1 kefren lpeer = get_ldp_peer(gate);
517 1.1 kefren if (!lpeer) {
518 1.5 kefren debugp("ldp_test_mapping: Gateway is not an LDP peer\n");
519 1.1 kefren return NULL;
520 1.1 kefren }
521 1.1 kefren if (lpeer->state != LDP_PEER_ESTABLISHED) {
522 1.9 kefren fatalp("ldp_test_mapping: peer is down ?!\n");
523 1.1 kefren return NULL;
524 1.1 kefren }
525 1.1 kefren lm = ldp_peer_get_lm(lpeer, a, prefix);
526 1.1 kefren
527 1.1 kefren if (!lm) {
528 1.9 kefren debugp("Cannot match prefix %s/%d to the specified peer\n",
529 1.9 kefren satos(a), prefix);
530 1.1 kefren return NULL;
531 1.1 kefren }
532 1.2 christos rv = malloc(sizeof(*rv));
533 1.1 kefren
534 1.1 kefren if (!rv) {
535 1.1 kefren fatalp("ldp_test_mapping: malloc problem\n");
536 1.1 kefren return NULL;
537 1.1 kefren }
538 1.1 kefren
539 1.1 kefren rv->lm = lm;
540 1.1 kefren rv->peer = lpeer;
541 1.1 kefren
542 1.1 kefren return rv;
543 1.1 kefren }
544 1.1 kefren
545 1.1 kefren /* Name from state */
546 1.1 kefren const char * ldp_state_to_name(int state)
547 1.1 kefren {
548 1.1 kefren switch(state) {
549 1.1 kefren case LDP_PEER_CONNECTING:
550 1.1 kefren return "CONNECTING";
551 1.1 kefren case LDP_PEER_CONNECTED:
552 1.1 kefren return "CONNECTED";
553 1.1 kefren case LDP_PEER_ESTABLISHED:
554 1.1 kefren return "ESTABLISHED";
555 1.1 kefren case LDP_PEER_HOLDDOWN:
556 1.1 kefren return "HOLDDOWN";
557 1.1 kefren }
558 1.1 kefren return "UNKNOWN";
559 1.1 kefren }
560