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;
129 /* Bump the adj counters for packet and bytes */
130 vlib_increment_combined_counter
131 (&adjacency_counters,
135 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
136 vlib_increment_combined_counter
137 (&adjacency_counters,
141 vlib_buffer_length_in_chain (vm, p1) + rw_len1);
143 /* Check MTU of outgoing interface. */
144 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
145 adj0[0].rewrite_header.max_l3_packet_bytes))
147 p0->current_data -= rw_len0;
148 p0->current_length += rw_len0;
150 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
151 adj0[0].rewrite_header.sw_if_index;
152 next0 = adj0[0].rewrite_header.next_index;
153 error0 = IP4_ERROR_NONE;
155 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
156 vnet_feature_arc_start (mm->output_feature_arc_index,
157 adj0[0].rewrite_header.sw_if_index,
162 error0 = IP4_ERROR_MTU_EXCEEDED;
163 next0 = MPLS_OUTPUT_NEXT_DROP;
165 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
166 adj1[0].rewrite_header.max_l3_packet_bytes))
168 p1->current_data -= rw_len1;
169 p1->current_length += rw_len1;
171 vnet_buffer (p1)->sw_if_index[VLIB_TX] =
172 adj1[0].rewrite_header.sw_if_index;
173 next1 = adj1[0].rewrite_header.next_index;
174 error1 = IP4_ERROR_NONE;
176 if (PREDICT_FALSE(adj1[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
177 vnet_feature_arc_start (mm->output_feature_arc_index,
178 adj1[0].rewrite_header.sw_if_index,
183 error1 = IP4_ERROR_MTU_EXCEEDED;
184 next1 = MPLS_OUTPUT_NEXT_DROP;
188 adj0->sub_type.midchain.fixup_func
190 adj0->sub_type.midchain.fixup_data);
191 adj1->sub_type.midchain.fixup_func
193 adj1->sub_type.midchain.fixup_data);
196 p0->error = error_node->errors[error0];
197 p1->error = error_node->errors[error1];
199 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
201 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
203 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
204 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
206 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
208 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
210 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
211 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
214 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
215 to_next, n_left_to_next,
216 pi0, pi1, next0, next1);
219 while (n_left_from > 0 && n_left_to_next > 0)
221 ip_adjacency_t * adj0;
222 mpls_unicast_header_t *hdr0;
224 u32 pi0, rw_len0, adj_index0, next0, error0;
226 pi0 = to_next[0] = from[0];
228 p0 = vlib_get_buffer (vm, pi0);
230 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
232 adj0 = adj_get(adj_index0);
233 hdr0 = vlib_buffer_get_current (p0);
235 /* Guess we are only writing on simple Ethernet header. */
236 vnet_rewrite_one_header (adj0[0], hdr0,
237 sizeof (ethernet_header_t));
239 /* Update packet buffer attributes/set output interface. */
240 rw_len0 = adj0[0].rewrite_header.data_bytes;
242 vlib_increment_combined_counter
243 (&adjacency_counters,
247 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
249 /* Check MTU of outgoing interface. */
250 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
251 adj0[0].rewrite_header.max_l3_packet_bytes))
253 p0->current_data -= rw_len0;
254 p0->current_length += rw_len0;
256 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
257 adj0[0].rewrite_header.sw_if_index;
258 next0 = adj0[0].rewrite_header.next_index;
259 error0 = IP4_ERROR_NONE;
261 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
262 vnet_feature_arc_start (mm->output_feature_arc_index,
263 adj0[0].rewrite_header.sw_if_index,
268 error0 = IP4_ERROR_MTU_EXCEEDED;
269 next0 = MPLS_OUTPUT_NEXT_DROP;
273 adj0->sub_type.midchain.fixup_func
275 adj0->sub_type.midchain.fixup_data);
278 p0->error = error_node->errors[error0];
285 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
287 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
289 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
290 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
293 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
294 to_next, n_left_to_next,
298 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
300 vlib_node_increment_counter (vm, mpls_output_node.index,
301 MPLS_ERROR_PKTS_ENCAP,
302 from_frame->n_vectors);
304 return from_frame->n_vectors;
307 static char * mpls_error_strings[] = {
308 #define mpls_error(n,s) s,
314 mpls_output (vlib_main_t * vm,
315 vlib_node_runtime_t * node,
316 vlib_frame_t * from_frame)
318 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
321 VLIB_REGISTER_NODE (mpls_output_node) = {
322 .function = mpls_output,
323 .name = "mpls-output",
324 /* Takes a vector of packets. */
325 .vector_size = sizeof (u32),
326 .n_errors = MPLS_N_ERROR,
327 .error_strings = mpls_error_strings,
329 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
331 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
332 foreach_mpls_output_next
336 .format_trace = format_mpls_output_trace,
339 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
342 mpls_midchain (vlib_main_t * vm,
343 vlib_node_runtime_t * node,
344 vlib_frame_t * from_frame)
346 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
349 VLIB_REGISTER_NODE (mpls_midchain_node) = {
350 .function = mpls_midchain,
351 .name = "mpls-midchain",
352 .vector_size = sizeof (u32),
354 .format_trace = format_mpls_output_trace,
356 .sibling_of = "mpls-output",
359 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
362 * @brief Next index values from the MPLS incomplete adj node
364 #define foreach_mpls_adj_incomplete_next \
365 _(DROP, "error-drop") \
367 _(IP6, "ip6-discover-neighbor")
370 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
371 foreach_mpls_adj_incomplete_next
373 MPLS_ADJ_INCOMPLETE_N_NEXT,
374 } mpls_adj_incomplete_next_t;
377 * @brief A struct to hold tracing information for the MPLS label imposition
380 typedef struct mpls_adj_incomplete_trace_t_
383 } mpls_adj_incomplete_trace_t;
387 * @brief Graph node for incomplete MPLS adjacency.
388 * This node will push traffic to either the v4-arp or v6-nd node
389 * based on the next-hop proto of the adj.
390 * We pay a cost for this 'routing' node, but an incomplete adj is the
394 mpls_adj_incomplete (vlib_main_t * vm,
395 vlib_node_runtime_t * node,
396 vlib_frame_t * from_frame)
398 u32 n_left_from, next_index, * from, * to_next;
400 from = vlib_frame_vector_args (from_frame);
401 n_left_from = from_frame->n_vectors;
402 next_index = node->cached_next_index;
404 while (n_left_from > 0)
408 vlib_get_next_frame (vm, node, next_index,
409 to_next, n_left_to_next);
411 while (n_left_from > 0 && n_left_to_next > 0)
413 u32 pi0, next0, adj_index0;
414 ip_adjacency_t * adj0;
417 pi0 = to_next[0] = from[0];
418 p0 = vlib_get_buffer (vm, pi0);
424 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
426 adj0 = adj_get(adj_index0);
428 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
430 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
434 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
437 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
439 mpls_adj_incomplete_trace_t *tr =
440 vlib_add_trace (vm, node, p0, sizeof (*tr));
444 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
445 to_next, n_left_to_next,
449 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
452 return from_frame->n_vectors;
456 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
458 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
459 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
460 mpls_adj_incomplete_trace_t * t;
463 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
464 indent = format_get_indent (s);
466 s = format (s, "%Unext:%d",
467 format_white_space, indent,
472 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
473 .function = mpls_adj_incomplete,
474 .name = "mpls-adj-incomplete",
475 .format_trace = format_mpls_adj_incomplete_trace,
476 /* Takes a vector of packets. */
477 .vector_size = sizeof (u32),
478 .n_errors = MPLS_N_ERROR,
479 .error_strings = mpls_error_strings,
481 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
483 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
484 foreach_mpls_adj_incomplete_next
489 VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,