1 /* A generic nexthop structure
2 * Copyright (C) 2013 Cumulus Networks, Inc.
4 * This file is part of Quagga.
6 * Quagga is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License as published by the
8 * Free Software Foundation; either version 2, or (at your option) any
11 * Quagga is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
16 * You should have received a copy of the GNU General Public License along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
28 #include "sockunion.h"
35 DEFINE_MTYPE_STATIC(LIB
, NEXTHOP
, "Nexthop")
36 DEFINE_MTYPE_STATIC(LIB
, NH_LABEL
, "Nexthop label")
38 /* check if nexthops are same, non-recursive */
39 int nexthop_same_no_recurse(const struct nexthop
*next1
,
40 const struct nexthop
*next2
)
42 if (next1
->type
!= next2
->type
)
45 switch (next1
->type
) {
46 case NEXTHOP_TYPE_IPV4
:
47 case NEXTHOP_TYPE_IPV4_IFINDEX
:
48 if (!IPV4_ADDR_SAME(&next1
->gate
.ipv4
, &next2
->gate
.ipv4
))
50 if (next1
->ifindex
&& (next1
->ifindex
!= next2
->ifindex
))
53 case NEXTHOP_TYPE_IFINDEX
:
54 if (next1
->ifindex
!= next2
->ifindex
)
57 case NEXTHOP_TYPE_IPV6
:
58 if (!IPV6_ADDR_SAME(&next1
->gate
.ipv6
, &next2
->gate
.ipv6
))
61 case NEXTHOP_TYPE_IPV6_IFINDEX
:
62 if (!IPV6_ADDR_SAME(&next1
->gate
.ipv6
, &next2
->gate
.ipv6
))
64 if (next1
->ifindex
!= next2
->ifindex
)
77 const char *nexthop_type_to_str(enum nexthop_types_t nh_type
)
79 static const char *desc
[] = {
80 "none", "Directly connected",
81 "IPv4 nexthop", "IPv4 nexthop with ifindex",
82 "IPv6 nexthop", "IPv6 nexthop with ifindex",
90 * Check if the labels match for the 2 nexthops specified.
92 int nexthop_labels_match(struct nexthop
*nh1
, struct nexthop
*nh2
)
94 struct nexthop_label
*nhl1
, *nhl2
;
98 if ((nhl1
&& !nhl2
) || (!nhl1
&& nhl2
))
101 if (nhl1
->num_labels
!= nhl2
->num_labels
)
104 if (memcmp(nhl1
->label
, nhl2
->label
, nhl1
->num_labels
))
110 struct nexthop
*nexthop_new(void)
112 return XCALLOC(MTYPE_NEXTHOP
, sizeof(struct nexthop
));
115 /* Add nexthop to the end of a nexthop list. */
116 void nexthop_add(struct nexthop
**target
, struct nexthop
*nexthop
)
118 struct nexthop
*last
;
120 for (last
= *target
; last
&& last
->next
; last
= last
->next
)
123 last
->next
= nexthop
;
126 nexthop
->prev
= last
;
129 void copy_nexthops(struct nexthop
**tnh
, struct nexthop
*nh
,
130 struct nexthop
*rparent
)
132 struct nexthop
*nexthop
;
135 for (nh1
= nh
; nh1
; nh1
= nh1
->next
) {
136 nexthop
= nexthop_new();
137 nexthop
->ifindex
= nh1
->ifindex
;
138 nexthop
->type
= nh1
->type
;
139 nexthop
->flags
= nh1
->flags
;
140 memcpy(&nexthop
->gate
, &nh1
->gate
, sizeof(nh1
->gate
));
141 memcpy(&nexthop
->src
, &nh1
->src
, sizeof(nh1
->src
));
142 memcpy(&nexthop
->rmap_src
, &nh1
->rmap_src
, sizeof(nh1
->rmap_src
));
143 nexthop
->rparent
= rparent
;
145 nexthop_add_labels(nexthop
, nh1
->nh_label_type
,
146 nh1
->nh_label
->num_labels
,
147 &nh1
->nh_label
->label
[0]);
148 nexthop_add(tnh
, nexthop
);
150 if (CHECK_FLAG(nh1
->flags
, NEXTHOP_FLAG_RECURSIVE
))
151 copy_nexthops(&nexthop
->resolved
, nh1
->resolved
,
157 void nexthop_free(struct nexthop
*nexthop
)
159 nexthop_del_labels(nexthop
);
160 if (nexthop
->resolved
)
161 nexthops_free(nexthop
->resolved
);
162 XFREE(MTYPE_NEXTHOP
, nexthop
);
165 /* Frees a list of nexthops */
166 void nexthops_free(struct nexthop
*nexthop
)
168 struct nexthop
*nh
, *next
;
170 for (nh
= nexthop
; nh
; nh
= next
) {
176 /* Update nexthop with label information. */
177 void nexthop_add_labels(struct nexthop
*nexthop
, enum lsp_types_t type
,
178 u_int8_t num_labels
, mpls_label_t
*label
)
180 struct nexthop_label
*nh_label
;
183 nexthop
->nh_label_type
= type
;
184 nh_label
= XCALLOC(MTYPE_NH_LABEL
,
185 sizeof(struct nexthop_label
)
186 + num_labels
* sizeof(mpls_label_t
));
187 nh_label
->num_labels
= num_labels
;
188 for (i
= 0; i
< num_labels
; i
++)
189 nh_label
->label
[i
] = *(label
+ i
);
190 nexthop
->nh_label
= nh_label
;
193 /* Free label information of nexthop, if present. */
194 void nexthop_del_labels(struct nexthop
*nexthop
)
196 if (nexthop
->nh_label
) {
197 XFREE(MTYPE_NH_LABEL
, nexthop
->nh_label
);
198 nexthop
->nh_label_type
= ZEBRA_LSP_NONE
;
202 const char *nexthop2str(struct nexthop
*nexthop
, char *str
, int size
)
204 switch (nexthop
->type
) {
205 case NEXTHOP_TYPE_IFINDEX
:
206 snprintf(str
, size
, "if %u", nexthop
->ifindex
);
208 case NEXTHOP_TYPE_IPV4
:
209 snprintf(str
, size
, "%s", inet_ntoa(nexthop
->gate
.ipv4
));
211 case NEXTHOP_TYPE_IPV4_IFINDEX
:
212 snprintf(str
, size
, "%s if %u", inet_ntoa(nexthop
->gate
.ipv4
),
215 case NEXTHOP_TYPE_IPV6
:
216 snprintf(str
, size
, "%s", inet6_ntoa(nexthop
->gate
.ipv6
));
218 case NEXTHOP_TYPE_IPV6_IFINDEX
:
219 snprintf(str
, size
, "%s if %u", inet6_ntoa(nexthop
->gate
.ipv6
),
222 case NEXTHOP_TYPE_BLACKHOLE
:
223 snprintf(str
, size
, "blackhole");
226 snprintf(str
, size
, "unknown");
234 * Iteration step for ALL_NEXTHOPS macro:
235 * This is the tricky part. Check if `nexthop' has
236 * NEXTHOP_FLAG_RECURSIVE set. If yes, this implies that `nexthop' has
237 * at least one nexthop attached to `nexthop->resolved', which will be
240 * If NEXTHOP_FLAG_RECURSIVE is not set, `nexthop' will progress in its
241 * current chain. In case its current chain end is reached, it will move
242 * upwards in the recursion levels and progress there. Whenever a step
243 * forward in a chain is done, recursion will be checked again.
244 * In a nustshell, it's equivalent to a pre-traversal order assuming that
245 * left branch is 'resolved' and right branch is 'next':
246 * https://en.wikipedia.org/wiki/Tree_traversal#/media/File:Sorted_binary_tree_preorder.svg
248 struct nexthop
*nexthop_next(struct nexthop
*nexthop
)
250 if (CHECK_FLAG(nexthop
->flags
, NEXTHOP_FLAG_RECURSIVE
))
251 return nexthop
->resolved
;
254 return nexthop
->next
;
256 for (struct nexthop
*par
= nexthop
->rparent
; par
; par
= par
->rparent
)
263 unsigned int nexthop_level(struct nexthop
*nexthop
)
267 for (struct nexthop
*par
= nexthop
->rparent
; par
; par
= par
->rparent
)