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