2 * mpls_output.c: MPLS Adj rewrite
4 * Copyright (c) 2012-2014 Cisco and/or its affiliates.
5 * Licensed under the Apache License, Version 2.0 (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at:
9 * http://www.apache.org/licenses/LICENSE-2.0
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
18 #include <vlib/vlib.h>
19 #include <vnet/pg/pg.h>
20 #include <vnet/ip/ip.h>
21 #include <vnet/mpls/mpls.h>
24 /* Adjacency taken. */
27 } mpls_output_trace_t;
29 #define foreach_mpls_output_next \
33 #define _(s,n) MPLS_OUTPUT_NEXT_##s,
34 foreach_mpls_output_next
40 format_mpls_output_trace (u8 * s, va_list * args)
42 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
43 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
44 mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
46 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
48 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
54 mpls_output_inline (vlib_main_t * vm,
55 vlib_node_runtime_t * node,
56 vlib_frame_t * from_frame,
59 u32 n_left_from, next_index, * from, * to_next, thread_index;
60 vlib_node_runtime_t * error_node;
64 thread_index = vlib_get_thread_index();
65 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
66 from = vlib_frame_vector_args (from_frame);
67 n_left_from = from_frame->n_vectors;
68 next_index = node->cached_next_index;
71 while (n_left_from > 0)
73 vlib_get_next_frame (vm, node, next_index,
74 to_next, n_left_to_next);
76 while (n_left_from >= 4 && n_left_to_next >= 2)
78 ip_adjacency_t * adj0;
79 mpls_unicast_header_t *hdr0;
81 u32 pi0, rw_len0, adj_index0, next0, error0;
83 ip_adjacency_t * adj1;
84 mpls_unicast_header_t *hdr1;
86 u32 pi1, rw_len1, adj_index1, next1, error1;
88 /* Prefetch next iteration. */
90 vlib_buffer_t * p2, * p3;
92 p2 = vlib_get_buffer (vm, from[2]);
93 p3 = vlib_get_buffer (vm, from[3]);
95 vlib_prefetch_buffer_header (p2, STORE);
96 vlib_prefetch_buffer_header (p3, STORE);
98 CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
99 CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
102 pi0 = to_next[0] = from[0];
103 pi1 = to_next[1] = from[1];
110 p0 = vlib_get_buffer (vm, pi0);
111 p1 = vlib_get_buffer (vm, pi1);
113 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
114 adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
116 adj0 = adj_get(adj_index0);
117 adj1 = adj_get(adj_index1);
118 hdr0 = vlib_buffer_get_current (p0);
119 hdr1 = vlib_buffer_get_current (p1);
121 /* Guess we are only writing on simple Ethernet header. */
122 vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
123 sizeof (ethernet_header_t));
125 /* Update packet buffer attributes/set output interface. */
126 rw_len0 = adj0[0].rewrite_header.data_bytes;
127 rw_len1 = adj1[0].rewrite_header.data_bytes;
128 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
129 vnet_buffer (p1)->mpls.save_rewrite_length = rw_len1;
131 /* Bump the adj counters for packet and bytes */
132 vlib_increment_combined_counter
133 (&adjacency_counters,
137 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
138 vlib_increment_combined_counter
139 (&adjacency_counters,
143 vlib_buffer_length_in_chain (vm, p1) + rw_len1);
145 /* Check MTU of outgoing interface. */
146 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
147 adj0[0].rewrite_header.max_l3_packet_bytes))
149 p0->current_data -= rw_len0;
150 p0->current_length += rw_len0;
152 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
153 adj0[0].rewrite_header.sw_if_index;
154 next0 = adj0[0].rewrite_header.next_index;
155 error0 = IP4_ERROR_NONE;
157 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
158 vnet_feature_arc_start (mm->output_feature_arc_index,
159 adj0[0].rewrite_header.sw_if_index,
164 error0 = IP4_ERROR_MTU_EXCEEDED;
165 next0 = MPLS_OUTPUT_NEXT_DROP;
167 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
168 adj1[0].rewrite_header.max_l3_packet_bytes))
170 p1->current_data -= rw_len1;
171 p1->current_length += rw_len1;
173 vnet_buffer (p1)->sw_if_index[VLIB_TX] =
174 adj1[0].rewrite_header.sw_if_index;
175 next1 = adj1[0].rewrite_header.next_index;
176 error1 = IP4_ERROR_NONE;
178 if (PREDICT_FALSE(adj1[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
179 vnet_feature_arc_start (mm->output_feature_arc_index,
180 adj1[0].rewrite_header.sw_if_index,
185 error1 = IP4_ERROR_MTU_EXCEEDED;
186 next1 = MPLS_OUTPUT_NEXT_DROP;
190 adj0->sub_type.midchain.fixup_func
192 adj0->sub_type.midchain.fixup_data);
193 adj1->sub_type.midchain.fixup_func
195 adj1->sub_type.midchain.fixup_data);
198 p0->error = error_node->errors[error0];
199 p1->error = error_node->errors[error1];
201 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
203 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
205 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
206 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
208 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
210 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
212 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
213 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
216 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
217 to_next, n_left_to_next,
218 pi0, pi1, next0, next1);
221 while (n_left_from > 0 && n_left_to_next > 0)
223 ip_adjacency_t * adj0;
224 mpls_unicast_header_t *hdr0;
226 u32 pi0, rw_len0, adj_index0, next0, error0;
228 pi0 = to_next[0] = from[0];
230 p0 = vlib_get_buffer (vm, pi0);
232 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
234 adj0 = adj_get(adj_index0);
235 hdr0 = vlib_buffer_get_current (p0);
237 /* Guess we are only writing on simple Ethernet header. */
238 vnet_rewrite_one_header (adj0[0], hdr0,
239 sizeof (ethernet_header_t));
241 /* Update packet buffer attributes/set output interface. */
242 rw_len0 = adj0[0].rewrite_header.data_bytes;
243 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
245 vlib_increment_combined_counter
246 (&adjacency_counters,
250 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
252 /* Check MTU of outgoing interface. */
253 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
254 adj0[0].rewrite_header.max_l3_packet_bytes))
256 p0->current_data -= rw_len0;
257 p0->current_length += rw_len0;
259 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
260 adj0[0].rewrite_header.sw_if_index;
261 next0 = adj0[0].rewrite_header.next_index;
262 error0 = IP4_ERROR_NONE;
264 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
265 vnet_feature_arc_start (mm->output_feature_arc_index,
266 adj0[0].rewrite_header.sw_if_index,
271 error0 = IP4_ERROR_MTU_EXCEEDED;
272 next0 = MPLS_OUTPUT_NEXT_DROP;
276 adj0->sub_type.midchain.fixup_func
278 adj0->sub_type.midchain.fixup_data);
281 p0->error = error_node->errors[error0];
288 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
290 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
292 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
293 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
296 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
297 to_next, n_left_to_next,
301 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
303 vlib_node_increment_counter (vm, mpls_output_node.index,
304 MPLS_ERROR_PKTS_ENCAP,
305 from_frame->n_vectors);
307 return from_frame->n_vectors;
310 static char * mpls_error_strings[] = {
311 #define mpls_error(n,s) s,
317 mpls_output (vlib_main_t * vm,
318 vlib_node_runtime_t * node,
319 vlib_frame_t * from_frame)
321 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
324 VLIB_REGISTER_NODE (mpls_output_node) = {
325 .function = mpls_output,
326 .name = "mpls-output",
327 /* Takes a vector of packets. */
328 .vector_size = sizeof (u32),
329 .n_errors = MPLS_N_ERROR,
330 .error_strings = mpls_error_strings,
332 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
334 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
335 foreach_mpls_output_next
339 .format_trace = format_mpls_output_trace,
342 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
345 mpls_midchain (vlib_main_t * vm,
346 vlib_node_runtime_t * node,
347 vlib_frame_t * from_frame)
349 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
352 VLIB_REGISTER_NODE (mpls_midchain_node) = {
353 .function = mpls_midchain,
354 .name = "mpls-midchain",
355 .vector_size = sizeof (u32),
357 .format_trace = format_mpls_output_trace,
359 .sibling_of = "mpls-output",
362 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
365 * @brief Next index values from the MPLS incomplete adj node
367 #define foreach_mpls_adj_incomplete_next \
368 _(DROP, "error-drop") \
370 _(IP6, "ip6-discover-neighbor")
373 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
374 foreach_mpls_adj_incomplete_next
376 MPLS_ADJ_INCOMPLETE_N_NEXT,
377 } mpls_adj_incomplete_next_t;
380 * @brief A struct to hold tracing information for the MPLS label imposition
383 typedef struct mpls_adj_incomplete_trace_t_
386 } mpls_adj_incomplete_trace_t;
390 * @brief Graph node for incomplete MPLS adjacency.
391 * This node will push traffic to either the v4-arp or v6-nd node
392 * based on the next-hop proto of the adj.
393 * We pay a cost for this 'routing' node, but an incomplete adj is the
397 mpls_adj_incomplete (vlib_main_t * vm,
398 vlib_node_runtime_t * node,
399 vlib_frame_t * from_frame)
401 u32 n_left_from, next_index, * from, * to_next;
403 from = vlib_frame_vector_args (from_frame);
404 n_left_from = from_frame->n_vectors;
405 next_index = node->cached_next_index;
407 while (n_left_from > 0)
411 vlib_get_next_frame (vm, node, next_index,
412 to_next, n_left_to_next);
414 while (n_left_from > 0 && n_left_to_next > 0)
416 u32 pi0, next0, adj_index0;
417 ip_adjacency_t * adj0;
420 pi0 = to_next[0] = from[0];
421 p0 = vlib_get_buffer (vm, pi0);
427 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
429 adj0 = adj_get(adj_index0);
431 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
433 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
437 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
440 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
442 mpls_adj_incomplete_trace_t *tr =
443 vlib_add_trace (vm, node, p0, sizeof (*tr));
447 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
448 to_next, n_left_to_next,
452 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
455 return from_frame->n_vectors;
459 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
461 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
462 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
463 mpls_adj_incomplete_trace_t * t;
466 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
467 indent = format_get_indent (s);
469 s = format (s, "%Unext:%d",
470 format_white_space, indent,
475 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
476 .function = mpls_adj_incomplete,
477 .name = "mpls-adj-incomplete",
478 .format_trace = format_mpls_adj_incomplete_trace,
479 /* Takes a vector of packets. */
480 .vector_size = sizeof (u32),
481 .n_errors = MPLS_N_ERROR,
482 .error_strings = mpls_error_strings,
484 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
486 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
487 foreach_mpls_adj_incomplete_next
492 VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,