fsm.c revision 1.4 1 1.4 kefren /* $NetBSD: fsm.c,v 1.4 2011/06/14 11:23:02 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 <arpa/inet.h>
35 1.1 kefren #include <netinet/in.h>
36 1.1 kefren #include <net/if.h>
37 1.1 kefren
38 1.1 kefren #include <ifaddrs.h>
39 1.1 kefren #include <stdio.h>
40 1.1 kefren #include <stdlib.h>
41 1.1 kefren #include <strings.h>
42 1.1 kefren
43 1.1 kefren #include "ldp.h"
44 1.1 kefren #include "ldp_peer.h"
45 1.1 kefren #include "socketops.h"
46 1.1 kefren #include "ldp_errors.h"
47 1.1 kefren #include "fsm.h"
48 1.1 kefren
49 1.1 kefren char my_ldp_id[20];
50 1.1 kefren struct sockaddr mplssockaddr;
51 1.1 kefren
52 1.1 kefren /* Processing a hello */
53 1.4 kefren void
54 1.1 kefren run_ldp_hello(struct ldp_pdu * pduid, struct hello_tlv * ht,
55 1.1 kefren struct in_addr * padd, struct in_addr * ladd, int mysock)
56 1.1 kefren {
57 1.1 kefren struct ldp_peer *peer = NULL;
58 1.1 kefren struct in_addr peer_addr;
59 1.1 kefren struct transport_address_tlv *trtlv;
60 1.1 kefren struct hello_info *hi;
61 1.1 kefren
62 1.1 kefren if ((!pduid) || (!ht))
63 1.1 kefren return;
64 1.1 kefren
65 1.4 kefren debugp("Hello received for address: %s\n", inet_ntoa(*ladd));
66 1.1 kefren debugp("Hello: Type: 0x%.4X Length: %.2d ID: %.8X\n", ht->type,
67 1.1 kefren ht->length, ht->messageid);
68 1.1 kefren
69 1.1 kefren /* Add it to hello list or just update timer */
70 1.1 kefren SLIST_FOREACH(hi, &hello_info_head, infos)
71 1.1 kefren if (hi->ldp_id.s_addr == pduid->ldp_id.s_addr)
72 1.1 kefren break;
73 1.1 kefren if (hi == NULL) {
74 1.2 christos hi = malloc(sizeof(*hi));
75 1.1 kefren if (!hi) {
76 1.4 kefren fatalp("Cannot alloc a hello info structure");
77 1.1 kefren return;
78 1.1 kefren }
79 1.1 kefren hi->ldp_id.s_addr = pduid->ldp_id.s_addr;
80 1.1 kefren SLIST_INSERT_HEAD(&hello_info_head, hi, infos);
81 1.1 kefren } else
82 1.1 kefren /* Just update timer */
83 1.1 kefren hi->keepalive = LDP_HELLO_KEEP;
84 1.1 kefren
85 1.3 christos if (ht->length <= 4) /* Common hello parameters */
86 1.3 christos return;
87 1.3 christos ht->ch.type = ntohs(ht->ch.type);
88 1.3 christos ht->ch.length = ntohs(ht->ch.length);
89 1.3 christos ht->ch.holdtime = ntohs(ht->ch.holdtime);
90 1.3 christos ht->ch.res = ntohs(ht->ch.res);
91 1.3 christos debugp("Common hello Type: 0x%.4X Length: %.2d R:%d T:%d"
92 1.3 christos "Hold time: %d\n", ht->ch.type, ht->ch.length,
93 1.3 christos ht->ch.tr / 2, ht->ch.tr % 2, ht->ch.holdtime);
94 1.3 christos if (ht->ch.holdtime)
95 1.3 christos hi->keepalive = ht->ch.holdtime;
96 1.3 christos if (!get_ldp_peer(&pduid->ldp_id)) {
97 1.3 christos /* First of all set peer_addr to announced LDP_ID */
98 1.3 christos memcpy(&peer_addr, &pduid->ldp_id,
99 1.3 christos sizeof(struct in_addr));
100 1.3 christos /*
101 1.3 christos * Now let's see if there is any transport TLV in
102 1.3 christos * there
103 1.3 christos */
104 1.3 christos if (pduid->length - PDU_PAYLOAD_LENGTH -
105 1.3 christos sizeof(struct hello_tlv) > 3) {
106 1.3 christos trtlv = (struct transport_address_tlv *) &ht[1];
107 1.3 christos if (trtlv->type == TLV_IPV4_TRANSPORT)
108 1.3 christos memcpy(&peer_addr, &trtlv->address,
109 1.3 christos sizeof(struct in_addr));
110 1.3 christos } else
111 1.3 christos trtlv = NULL;
112 1.3 christos /*
113 1.3 christos * RFC says: If A1 > A2, LSR1 plays the active role;
114 1.3 christos * otherwise it is passive.
115 1.3 christos */
116 1.3 christos if (ntohl(peer_addr.s_addr) < ntohl(ladd->s_addr)) {
117 1.1 kefren #define TRADDR (trtlv && trtlv->type == TLV_IPV4_TRANSPORT) ? &peer_addr : NULL
118 1.3 christos peer = ldp_peer_new(&pduid->ldp_id, padd,
119 1.3 christos TRADDR, ht->ch.holdtime, 0);
120 1.3 christos if (!peer)
121 1.3 christos return;
122 1.3 christos if (peer && peer->state == LDP_PEER_CONNECTED)
123 1.3 christos send_initialize(peer);
124 1.1 kefren }
125 1.1 kefren }
126 1.1 kefren }
127 1.1 kefren
128 1.1 kefren struct address_list_tlv *
129 1.1 kefren build_address_list_tlv(void)
130 1.1 kefren {
131 1.1 kefren struct address_list_tlv *t;
132 1.1 kefren struct ifaddrs *ifa, *ifb;
133 1.1 kefren struct sockaddr_in *sa;
134 1.1 kefren struct in_addr *ia;
135 1.1 kefren uint16_t adrcount = 0;
136 1.1 kefren
137 1.1 kefren if (getifaddrs(&ifa) == -1)
138 1.1 kefren return NULL;
139 1.1 kefren
140 1.1 kefren /* Find out the number of addresses */
141 1.1 kefren /* Ignore loopback */
142 1.1 kefren for (ifb = ifa; ifb; ifb = ifb->ifa_next)
143 1.1 kefren if ((ifb->ifa_addr->sa_family == AF_INET) &&
144 1.1 kefren (ifb->ifa_flags & IFF_UP)) {
145 1.1 kefren sa = (struct sockaddr_in *) ifb->ifa_addr;
146 1.4 kefren if (ntohl(sa->sin_addr.s_addr) >> 24 != IN_LOOPBACKNET)
147 1.1 kefren adrcount++;
148 1.1 kefren }
149 1.2 christos t = malloc(sizeof(*t) + (adrcount - 1) * sizeof(struct in_addr));
150 1.1 kefren
151 1.1 kefren if (!t) {
152 1.1 kefren fatalp("build_address_list_tlv: malloc problem\n");
153 1.4 kefren freeifaddrs(ifa);
154 1.1 kefren return NULL;
155 1.2 christos }
156 1.1 kefren
157 1.1 kefren t->type = htons(LDP_ADDRESS);
158 1.1 kefren t->length = htons(sizeof(struct address_list_tlv) - TLV_TYPE_LENGTH
159 1.1 kefren + (adrcount - 1) * sizeof(struct in_addr));
160 1.1 kefren t->messageid = htonl(get_message_id());
161 1.1 kefren
162 1.1 kefren t->a_type = htons(TLV_ADDRESS_LIST);
163 1.1 kefren t->a_length = htons(sizeof(t->a_af) +
164 1.1 kefren adrcount * sizeof(struct in_addr));
165 1.1 kefren t->a_af = htons(LDP_AF_INET);
166 1.1 kefren
167 1.1 kefren ia = &t->a_address;
168 1.1 kefren for (adrcount = 0, ifb = ifa; ifb; ifb = ifb->ifa_next) {
169 1.1 kefren if ((ifb->ifa_addr->sa_family != AF_INET) ||
170 1.1 kefren (!(ifb->ifa_flags & IFF_UP)) ||
171 1.1 kefren (ifb->ifa_flags & IFF_LOOPBACK))
172 1.1 kefren continue;
173 1.1 kefren sa = (struct sockaddr_in *) ifb->ifa_addr;
174 1.1 kefren memcpy(&ia[adrcount], &sa->sin_addr, sizeof(struct in_addr));
175 1.1 kefren adrcount++;
176 1.1 kefren }
177 1.1 kefren freeifaddrs(ifa);
178 1.1 kefren
179 1.1 kefren add_my_if_addrs(ia, adrcount);
180 1.1 kefren return t;
181 1.1 kefren }
182 1.1 kefren
183 1.1 kefren /*
184 1.1 kefren * Calculate LDP ID
185 1.1 kefren * Get also mpls pseudo-interface address
186 1.1 kefren */
187 1.1 kefren int
188 1.1 kefren set_my_ldp_id()
189 1.1 kefren {
190 1.1 kefren struct ifaddrs *ifa, *ifb;
191 1.1 kefren struct in_addr a;
192 1.1 kefren struct sockaddr_in *sa;
193 1.1 kefren
194 1.1 kefren a.s_addr = 0;
195 1.4 kefren my_ldp_id[0] = '\0';
196 1.1 kefren mplssockaddr.sa_len = 0;
197 1.1 kefren
198 1.1 kefren if (getifaddrs(&ifa) == -1)
199 1.1 kefren return LDP_E_GENERIC;
200 1.1 kefren
201 1.1 kefren for (ifb = ifa; ifb; ifb = ifb->ifa_next)
202 1.1 kefren if(ifb->ifa_flags & IFF_UP) {
203 1.1 kefren if (strncmp("mpls", ifb->ifa_name, 4) == 0 &&
204 1.1 kefren ifb->ifa_addr->sa_family == AF_LINK)
205 1.1 kefren memcpy(&mplssockaddr, ifb->ifa_addr,
206 1.1 kefren ifb->ifa_addr->sa_len);
207 1.1 kefren
208 1.1 kefren if (ifb->ifa_addr->sa_family != AF_INET)
209 1.1 kefren continue;
210 1.1 kefren
211 1.1 kefren sa = (struct sockaddr_in *) ifb->ifa_addr;
212 1.4 kefren if (ntohl(sa->sin_addr.s_addr) >> 24 == IN_LOOPBACKNET)
213 1.1 kefren continue; /* No 127/8 */
214 1.1 kefren if (ntohl(sa->sin_addr.s_addr) > ntohl(a.s_addr))
215 1.1 kefren a.s_addr = sa->sin_addr.s_addr;
216 1.1 kefren }
217 1.1 kefren freeifaddrs(ifa);
218 1.1 kefren debugp("LDP ID: %s\n", inet_ntoa(a));
219 1.1 kefren strlcpy(my_ldp_id, inet_ntoa(a), INET_ADDRSTRLEN);
220 1.1 kefren return LDP_E_OK;
221 1.1 kefren }
222