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