Home | History | Annotate | Line # | Download | only in ldpd
mpls_interface.c revision 1.2
      1  1.2  christos /* $NetBSD: mpls_interface.c,v 1.2 2010/12/09 00:10:59 christos 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 <arpa/inet.h>
     33  1.1    kefren #include <netinet/in.h>
     34  1.1    kefren #include <netmpls/mpls.h>
     35  1.1    kefren 
     36  1.1    kefren #include <sys/param.h>
     37  1.1    kefren 
     38  1.1    kefren #include <assert.h>
     39  1.1    kefren #include <stdio.h>
     40  1.1    kefren #include <string.h>
     41  1.1    kefren #include <stdlib.h>
     42  1.1    kefren #include <unistd.h>
     43  1.1    kefren 
     44  1.1    kefren #include "ldp.h"
     45  1.1    kefren #include "ldp_peer.h"
     46  1.1    kefren #include "ldp_errors.h"
     47  1.1    kefren #include "tlv_stack.h"
     48  1.1    kefren #include "label.h"
     49  1.1    kefren #include "mpls_interface.h"
     50  1.1    kefren #include "mpls_routes.h"
     51  1.1    kefren 
     52  1.1    kefren #define ROUNDUP(a) \
     53  1.1    kefren 	((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
     54  1.1    kefren 
     55  1.1    kefren int
     56  1.1    kefren mpls_add_label(struct ldp_peer * p, struct rt_msg * inh_rg,
     57  1.1    kefren     struct in_addr * addr, int len, int label, int rlookup)
     58  1.1    kefren {
     59  1.1    kefren 	char            padd[20];
     60  1.1    kefren 	int             kount = 0, rv;
     61  1.1    kefren 	union sockunion *so_dest, *so_pref = NULL, *so_gate, *so_nexthop, *so_tag,
     62  1.1    kefren 		*so_oldifa = NULL, *so_ifa;
     63  1.1    kefren 	struct rt_msg   rg;
     64  1.1    kefren 	struct rt_msg	*rgp = &rg;
     65  1.1    kefren 	struct label	*lab;
     66  1.1    kefren 
     67  1.1    kefren 	strlcpy(padd, inet_ntoa(p->address), 20);
     68  1.1    kefren 	debugp("Trying to add %s/%d as label %d to peer %s\n", inet_ntoa(*addr),
     69  1.1    kefren 		len, label, padd);
     70  1.1    kefren 
     71  1.1    kefren 	/* Don't accept default route XXX: should be option-able */
     72  1.1    kefren 	if (!len)
     73  1.1    kefren 		return LDP_E_BAD_AF;
     74  1.1    kefren 
     75  1.1    kefren 	/* Is there a label mapping for this ? */
     76  1.1    kefren 	if (ldp_peer_get_lm(p, addr, len) == NULL)
     77  1.1    kefren 		return LDP_E_NOENT;
     78  1.1    kefren 
     79  1.1    kefren 	if (!inh_rg || (inh_rg->m_rtm.rtm_addrs & RTA_IFA) == 0) {
     80  1.1    kefren 		/*
     81  1.1    kefren 		 * XXX: Check if we have a route for that.
     82  1.1    kefren 		 * Why the hell isn't kernel inserting the route immediatly ?
     83  1.1    kefren 		 * let's loop until we have it..
     84  1.1    kefren 		 */
     85  1.1    kefren 
     86  1.1    kefren 		so_dest = make_inet_union(inet_ntoa(*addr));
     87  1.1    kefren 		if (len != 32)
     88  1.1    kefren 			so_pref = from_cidr_to_union(len);
     89  1.1    kefren 
     90  1.1    kefren 		do {
     91  1.1    kefren 			if (kount == rlookup) {
     92  1.1    kefren 				debugp("No route for this prefix\n");
     93  1.1    kefren 				return LDP_E_NO_SUCH_ROUTE;
     94  1.1    kefren 			}
     95  1.1    kefren 			kount++;
     96  1.1    kefren 			/* Last time give it a higher chance */
     97  1.1    kefren 			if (kount == rlookup)
     98  1.1    kefren 				usleep(5000);
     99  1.1    kefren 
    100  1.1    kefren 			rv = get_route(rgp, so_dest, so_pref, 1);
    101  1.1    kefren 			if (rv != LDP_E_OK && len == 32)
    102  1.1    kefren 				/* Host maybe ? */
    103  1.1    kefren 				rv = get_route(rgp, so_dest, NULL, 1);
    104  1.1    kefren 		} while (rv != LDP_E_OK);
    105  1.1    kefren 
    106  1.1    kefren 		free(so_dest);
    107  1.1    kefren 		if (so_pref)
    108  1.1    kefren 			free(so_pref);
    109  1.1    kefren 
    110  1.1    kefren 	} else
    111  1.1    kefren 		rgp = inh_rg;
    112  1.1    kefren 
    113  1.1    kefren 	/* Check if it's an IPv4 route */
    114  1.1    kefren 
    115  1.1    kefren 	so_gate = (union sockunion *) rgp->m_space;
    116  1.1    kefren 	so_gate = (union sockunion *)((char*)so_gate +
    117  1.1    kefren 	    ROUNDUP(so_gate->sa.sa_len));
    118  1.1    kefren 	if (rgp->m_rtm.rtm_addrs & RTA_IFA) {
    119  1.1    kefren 		int li = 1;
    120  1.1    kefren 		so_oldifa = so_gate;
    121  1.1    kefren 		if (rgp->m_rtm.rtm_addrs & RTA_NETMASK)
    122  1.1    kefren 			li++;
    123  1.1    kefren 		if (rgp->m_rtm.rtm_addrs & RTA_GENMASK)
    124  1.1    kefren 			li++;
    125  1.1    kefren 		if (rgp->m_rtm.rtm_addrs & RTA_IFP)
    126  1.1    kefren 			li++;
    127  1.1    kefren 		for (int i = 0; i < li; i++)
    128  1.1    kefren 			so_oldifa = (union sockunion *)((char*)so_oldifa +
    129  1.1    kefren 			    ROUNDUP(so_oldifa->sa.sa_len));
    130  1.1    kefren 	}
    131  1.1    kefren 
    132  1.1    kefren 	if (so_gate->sa.sa_family != AF_INET) {
    133  1.1    kefren 		debugp("Failed at family check - only INET supoprted for now\n");
    134  1.1    kefren 		return LDP_E_BAD_AF;
    135  1.1    kefren 	}
    136  1.1    kefren 
    137  1.1    kefren 	/* Check if the address is bounded to the peer */
    138  1.1    kefren 	if (check_ifaddr(p, &so_gate->sin.sin_addr) == NULL) {
    139  1.1    kefren 		debugp("Failed at next-hop check\n");
    140  1.1    kefren 		return LDP_E_ROUTE_ERROR;
    141  1.1    kefren 	}
    142  1.1    kefren 
    143  1.1    kefren 	/* CHECK IF WE HAVE A BINDING FOR THAT */
    144  1.1    kefren 	lab = label_get_by_prefix(addr, len);
    145  1.1    kefren 
    146  1.1    kefren 	/* We should have a label because we have a route */
    147  1.1    kefren 	assert (lab);
    148  1.1    kefren 
    149  1.1    kefren 	if (lab->binding == MPLS_LABEL_IMPLNULL) {
    150  1.1    kefren 		change_local_label(lab, get_free_local_label());
    151  1.1    kefren 		if (!lab->binding) {
    152  1.1    kefren 			fatalp("No more free labels !!!\n");
    153  1.1    kefren 			return LDP_E_TOO_MANY_LABELS;
    154  1.1    kefren 		}
    155  1.1    kefren 	}
    156  1.1    kefren 
    157  1.1    kefren 	warnp("[mpls_add_label] Adding %s/%d as local binding %d, label %d"
    158  1.1    kefren 	    " to peer %s\n",
    159  1.1    kefren 		inet_ntoa(*addr), len, lab->binding, label, padd);
    160  1.1    kefren 
    161  1.1    kefren 	/* Modify existing label */
    162  1.1    kefren 	lab->label = label;
    163  1.1    kefren 	lab->p = p;
    164  1.1    kefren 
    165  1.1    kefren 	/* Add switching route */
    166  1.1    kefren 	so_dest = make_mpls_union(lab->binding);
    167  1.2  christos 	so_nexthop = malloc(sizeof(*so_nexthop));
    168  1.2  christos 	if (!so_nexthop) {
    169  1.2  christos 		fatalp("Out of memory\n");
    170  1.2  christos 		return LDP_E_MEMORY;
    171  1.2  christos 	}
    172  1.1    kefren 	memcpy(so_nexthop, so_gate, so_gate->sa.sa_len);
    173  1.1    kefren 	so_tag = make_mpls_union(label);
    174  1.1    kefren 	if (add_route(so_dest, NULL, so_nexthop, NULL, so_tag, FREESO, RTM_ADD) != LDP_E_OK)
    175  1.1    kefren 		return LDP_E_ROUTE_ERROR;
    176  1.1    kefren 
    177  1.1    kefren 	/* Now, let's add tag to IPv4 route and point it to mpls interface */
    178  1.1    kefren 	so_dest = make_inet_union(inet_ntoa(*addr));
    179  1.1    kefren 
    180  1.1    kefren 	/* if prefixlen == 32 check if it's inserted as host
    181  1.1    kefren  	* and treat it as host. It may also be set as /32 prefix
    182  1.1    kefren  	* (thanks mlelstv for heads-up about this)
    183  1.1    kefren  	*/
    184  1.1    kefren 	if ((len == 32) && (rgp->m_rtm.rtm_flags & RTF_HOST))
    185  1.1    kefren 		so_pref = NULL;
    186  1.1    kefren 	else
    187  1.1    kefren 		so_pref = from_cidr_to_union(len);
    188  1.1    kefren 
    189  1.1    kefren 	/* Add tag to route */
    190  1.2  christos 	so_nexthop = malloc(sizeof(*so_nexthop));
    191  1.2  christos 	if (!so_nexthop) {
    192  1.2  christos 		fatalp("Out of memory\n");
    193  1.2  christos 		return LDP_E_MEMORY;
    194  1.2  christos 	}
    195  1.1    kefren 	memcpy(so_nexthop, so_gate, so_gate->sa.sa_len);
    196  1.1    kefren 	so_tag = make_mpls_union(label);
    197  1.1    kefren 	if (so_oldifa != NULL) {
    198  1.2  christos 		so_ifa = malloc(sizeof(*so_ifa));
    199  1.2  christos 		if (!so_ifa) {
    200  1.2  christos 			fatalp("Out of memory\n");
    201  1.2  christos 			return LDP_E_MEMORY;
    202  1.2  christos 		}
    203  1.1    kefren 		memcpy(so_ifa, so_oldifa, so_oldifa->sa.sa_len);
    204  1.1    kefren 	} else
    205  1.1    kefren 		so_ifa = NULL;
    206  1.1    kefren 	if (add_route(so_dest, so_pref, so_nexthop, so_ifa, so_tag, FREESO, RTM_CHANGE) != LDP_E_OK)
    207  1.1    kefren 		return LDP_E_ROUTE_ERROR;
    208  1.1    kefren 
    209  1.1    kefren 	debugp("Added %s/%d as label %d to peer %s\n", inet_ntoa(*addr), len,
    210  1.1    kefren 	    label, padd);
    211  1.1    kefren 
    212  1.1    kefren 	return LDP_E_OK;
    213  1.1    kefren }
    214  1.1    kefren 
    215  1.1    kefren int
    216  1.1    kefren mpls_add_ldp_peer(struct ldp_peer * p)
    217  1.1    kefren {
    218  1.1    kefren 	return LDP_E_OK;
    219  1.1    kefren }
    220  1.1    kefren 
    221  1.1    kefren int
    222  1.1    kefren mpls_delete_ldp_peer(struct ldp_peer * p)
    223  1.1    kefren {
    224  1.1    kefren 
    225  1.1    kefren 	/* Reput all the routes also to IPv4 */
    226  1.1    kefren 	label_reattach_all_peer_labels(p, LDP_READD_CHANGE);
    227  1.1    kefren 
    228  1.1    kefren 	return LDP_E_OK;
    229  1.1    kefren }
    230  1.1    kefren 
    231  1.1    kefren int
    232  1.1    kefren mpls_start_ldp()
    233  1.1    kefren {
    234  1.1    kefren 	ldp_peer_init();
    235  1.1    kefren 	label_init();
    236  1.1    kefren 
    237  1.1    kefren 	return LDP_E_OK;
    238  1.1    kefren }
    239