fsm.c revision 1.2 1 1.2 christos /* $NetBSD: fsm.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 <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.1 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.1 kefren debugp("Received it on 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.1 kefren fatalp("Cannot alloc a hello info");
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.1 kefren if (ht->length > 4) { /* Common hello parameters */
86 1.1 kefren ht->ch.type = ntohs(ht->ch.type);
87 1.1 kefren ht->ch.length = ntohs(ht->ch.length);
88 1.1 kefren ht->ch.holdtime = ntohs(ht->ch.holdtime);
89 1.1 kefren ht->ch.res = ntohs(ht->ch.res);
90 1.1 kefren debugp("Common hello Type: 0x%.4X Length: %.2d R:%d T:%d"
91 1.1 kefren "Hold time: %d\n", ht->ch.type, ht->ch.length,
92 1.1 kefren ht->ch.tr / 2, ht->ch.tr % 2, ht->ch.holdtime);
93 1.1 kefren if (ht->ch.holdtime)
94 1.1 kefren hi->keepalive = ht->ch.holdtime;
95 1.1 kefren if (!get_ldp_peer(&pduid->ldp_id)) {
96 1.1 kefren /* First of all set peer_addr to announced LDP_ID */
97 1.1 kefren memcpy(&peer_addr, &pduid->ldp_id,
98 1.1 kefren sizeof(struct in_addr));
99 1.1 kefren /*
100 1.1 kefren * Now let's see if there is any transport TLV in
101 1.1 kefren * there
102 1.1 kefren */
103 1.1 kefren if (pduid->length - PDU_PAYLOAD_LENGTH -
104 1.1 kefren sizeof(struct hello_tlv) > 3) {
105 1.1 kefren trtlv = (struct transport_address_tlv *) &ht[1];
106 1.1 kefren if (trtlv->type == TLV_IPV4_TRANSPORT)
107 1.1 kefren memcpy(&peer_addr, &trtlv->address,
108 1.1 kefren sizeof(struct in_addr));
109 1.1 kefren }
110 1.1 kefren /*
111 1.1 kefren * RFC says: If A1 > A2, LSR1 plays the active role;
112 1.1 kefren * otherwise it is passive.
113 1.1 kefren */
114 1.1 kefren if (ntohl(peer_addr.s_addr) < ntohl(ladd->s_addr)) {
115 1.1 kefren #define TRADDR (trtlv && trtlv->type == TLV_IPV4_TRANSPORT) ? &peer_addr : NULL
116 1.1 kefren peer = ldp_peer_new(&pduid->ldp_id, padd,
117 1.1 kefren TRADDR, ht->ch.holdtime, 0);
118 1.1 kefren if (!peer)
119 1.1 kefren return;
120 1.1 kefren if (peer && peer->state == LDP_PEER_CONNECTED)
121 1.1 kefren send_initialize(peer);
122 1.1 kefren }
123 1.1 kefren }
124 1.1 kefren }
125 1.1 kefren }
126 1.1 kefren
127 1.1 kefren struct address_list_tlv *
128 1.1 kefren build_address_list_tlv(void)
129 1.1 kefren {
130 1.1 kefren struct address_list_tlv *t;
131 1.1 kefren struct ifaddrs *ifa, *ifb;
132 1.1 kefren struct sockaddr_in *sa;
133 1.1 kefren struct in_addr *ia;
134 1.1 kefren uint16_t adrcount = 0;
135 1.1 kefren
136 1.1 kefren if (getifaddrs(&ifa) == -1)
137 1.1 kefren return NULL;
138 1.1 kefren
139 1.1 kefren /* Find out the number of addresses */
140 1.1 kefren /* Ignore loopback */
141 1.1 kefren for (ifb = ifa; ifb; ifb = ifb->ifa_next)
142 1.1 kefren if ((ifb->ifa_addr->sa_family == AF_INET) &&
143 1.1 kefren (ifb->ifa_flags & IFF_UP)) {
144 1.1 kefren sa = (struct sockaddr_in *) ifb->ifa_addr;
145 1.1 kefren if (sa->sin_addr.s_addr << 24 >> 24 != 127)
146 1.1 kefren adrcount++;
147 1.1 kefren }
148 1.2 christos t = malloc(sizeof(*t) + (adrcount - 1) * sizeof(struct in_addr));
149 1.1 kefren
150 1.1 kefren if (!t) {
151 1.1 kefren fatalp("build_address_list_tlv: malloc problem\n");
152 1.1 kefren return NULL;
153 1.2 christos }
154 1.1 kefren
155 1.1 kefren t->type = htons(LDP_ADDRESS);
156 1.1 kefren t->length = htons(sizeof(struct address_list_tlv) - TLV_TYPE_LENGTH
157 1.1 kefren + (adrcount - 1) * sizeof(struct in_addr));
158 1.1 kefren t->messageid = htonl(get_message_id());
159 1.1 kefren
160 1.1 kefren t->a_type = htons(TLV_ADDRESS_LIST);
161 1.1 kefren t->a_length = htons(sizeof(t->a_af) +
162 1.1 kefren adrcount * sizeof(struct in_addr));
163 1.1 kefren t->a_af = htons(LDP_AF_INET);
164 1.1 kefren
165 1.1 kefren ia = &t->a_address;
166 1.1 kefren for (adrcount = 0, ifb = ifa; ifb; ifb = ifb->ifa_next) {
167 1.1 kefren if ((ifb->ifa_addr->sa_family != AF_INET) ||
168 1.1 kefren (!(ifb->ifa_flags & IFF_UP)) ||
169 1.1 kefren (ifb->ifa_flags & IFF_LOOPBACK))
170 1.1 kefren continue;
171 1.1 kefren sa = (struct sockaddr_in *) ifb->ifa_addr;
172 1.1 kefren memcpy(&ia[adrcount], &sa->sin_addr, sizeof(struct in_addr));
173 1.1 kefren adrcount++;
174 1.1 kefren }
175 1.1 kefren freeifaddrs(ifa);
176 1.1 kefren
177 1.1 kefren add_my_if_addrs(ia, adrcount);
178 1.1 kefren return t;
179 1.1 kefren }
180 1.1 kefren
181 1.1 kefren /*
182 1.1 kefren * Calculate LDP ID
183 1.1 kefren * Get also mpls pseudo-interface address
184 1.1 kefren */
185 1.1 kefren int
186 1.1 kefren set_my_ldp_id()
187 1.1 kefren {
188 1.1 kefren struct ifaddrs *ifa, *ifb;
189 1.1 kefren struct in_addr a;
190 1.1 kefren struct sockaddr_in *sa;
191 1.1 kefren
192 1.1 kefren a.s_addr = 0;
193 1.1 kefren my_ldp_id[0] = 0;
194 1.1 kefren mplssockaddr.sa_len = 0;
195 1.1 kefren
196 1.1 kefren if (getifaddrs(&ifa) == -1)
197 1.1 kefren return LDP_E_GENERIC;
198 1.1 kefren
199 1.1 kefren for (ifb = ifa; ifb; ifb = ifb->ifa_next)
200 1.1 kefren if(ifb->ifa_flags & IFF_UP) {
201 1.1 kefren if (strncmp("mpls", ifb->ifa_name, 4) == 0 &&
202 1.1 kefren ifb->ifa_addr->sa_family == AF_LINK)
203 1.1 kefren memcpy(&mplssockaddr, ifb->ifa_addr,
204 1.1 kefren ifb->ifa_addr->sa_len);
205 1.1 kefren
206 1.1 kefren if (ifb->ifa_addr->sa_family != AF_INET)
207 1.1 kefren continue;
208 1.1 kefren
209 1.1 kefren sa = (struct sockaddr_in *) ifb->ifa_addr;
210 1.1 kefren if (ntohl(sa->sin_addr.s_addr) >> 24 == 127)
211 1.1 kefren continue; /* No 127/8 */
212 1.1 kefren if (ntohl(sa->sin_addr.s_addr) > ntohl(a.s_addr))
213 1.1 kefren a.s_addr = sa->sin_addr.s_addr;
214 1.1 kefren }
215 1.1 kefren freeifaddrs(ifa);
216 1.1 kefren debugp("LDP ID: %s\n", inet_ntoa(a));
217 1.1 kefren strlcpy(my_ldp_id, inet_ntoa(a), INET_ADDRSTRLEN);
218 1.1 kefren return LDP_E_OK;
219 1.1 kefren }
220