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. */
28 /* Packet data, possibly *after* rewrite. */
29 u8 packet_data[64 - 1*sizeof(u32)];
30 } mpls_output_trace_t;
32 #define foreach_mpls_output_next \
36 #define _(s,n) MPLS_OUTPUT_NEXT_##s,
37 foreach_mpls_output_next
43 format_mpls_output_trace (u8 * s, va_list * args)
45 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
46 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
47 mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
48 uword indent = format_get_indent (s);
50 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
52 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
54 s = format (s, "\n%U%U",
55 format_white_space, indent,
56 format_ip_adjacency_packet_data,
57 t->adj_index, t->packet_data, sizeof (t->packet_data));
62 mpls_output_inline (vlib_main_t * vm,
63 vlib_node_runtime_t * node,
64 vlib_frame_t * from_frame,
67 u32 n_left_from, next_index, * from, * to_next, cpu_index;
68 vlib_node_runtime_t * error_node;
72 cpu_index = os_get_cpu_number();
73 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
74 from = vlib_frame_vector_args (from_frame);
75 n_left_from = from_frame->n_vectors;
76 next_index = node->cached_next_index;
79 while (n_left_from > 0)
81 vlib_get_next_frame (vm, node, next_index,
82 to_next, n_left_to_next);
84 while (n_left_from >= 4 && n_left_to_next >= 2)
86 ip_adjacency_t * adj0;
87 mpls_unicast_header_t *hdr0;
89 u32 pi0, rw_len0, adj_index0, next0, error0;
91 ip_adjacency_t * adj1;
92 mpls_unicast_header_t *hdr1;
94 u32 pi1, rw_len1, adj_index1, next1, error1;
96 /* Prefetch next iteration. */
98 vlib_buffer_t * p2, * p3;
100 p2 = vlib_get_buffer (vm, from[2]);
101 p3 = vlib_get_buffer (vm, from[3]);
103 vlib_prefetch_buffer_header (p2, STORE);
104 vlib_prefetch_buffer_header (p3, STORE);
106 CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
107 CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
110 pi0 = to_next[0] = from[0];
111 pi1 = to_next[1] = from[1];
118 p0 = vlib_get_buffer (vm, pi0);
119 p1 = vlib_get_buffer (vm, pi1);
121 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
122 adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
124 /* We should never rewrite a pkt using the MISS adjacency */
128 adj0 = adj_get(adj_index0);
129 adj1 = adj_get(adj_index1);
130 hdr0 = vlib_buffer_get_current (p0);
131 hdr1 = vlib_buffer_get_current (p1);
133 /* Guess we are only writing on simple Ethernet header. */
134 vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
135 sizeof (ethernet_header_t));
137 /* Update packet buffer attributes/set output interface. */
138 rw_len0 = adj0[0].rewrite_header.data_bytes;
139 rw_len1 = adj1[0].rewrite_header.data_bytes;
141 /* Bump the adj counters for packet and bytes */
142 vlib_increment_combined_counter
143 (&adjacency_counters,
147 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
148 vlib_increment_combined_counter
149 (&adjacency_counters,
153 vlib_buffer_length_in_chain (vm, p1) + rw_len1);
155 /* Check MTU of outgoing interface. */
156 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
157 adj0[0].rewrite_header.max_l3_packet_bytes))
159 p0->current_data -= rw_len0;
160 p0->current_length += rw_len0;
162 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
163 adj0[0].rewrite_header.sw_if_index;
164 next0 = adj0[0].rewrite_header.next_index;
165 error0 = IP4_ERROR_NONE;
167 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
168 vnet_feature_arc_start (mm->output_feature_arc_index,
169 adj0[0].rewrite_header.sw_if_index,
174 error0 = IP4_ERROR_MTU_EXCEEDED;
175 next0 = MPLS_OUTPUT_NEXT_DROP;
177 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
178 adj1[0].rewrite_header.max_l3_packet_bytes))
180 p1->current_data -= rw_len1;
181 p1->current_length += rw_len1;
183 vnet_buffer (p1)->sw_if_index[VLIB_TX] =
184 adj1[0].rewrite_header.sw_if_index;
185 next1 = adj1[0].rewrite_header.next_index;
186 error1 = IP4_ERROR_NONE;
188 if (PREDICT_FALSE(adj1[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
189 vnet_feature_arc_start (mm->output_feature_arc_index,
190 adj1[0].rewrite_header.sw_if_index,
195 error1 = IP4_ERROR_MTU_EXCEEDED;
196 next1 = MPLS_OUTPUT_NEXT_DROP;
200 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
201 adj1->sub_type.midchain.fixup_func(vm, adj1, p1);
204 p0->error = error_node->errors[error0];
205 p1->error = error_node->errors[error1];
207 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
209 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
211 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
212 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
214 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
216 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
218 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
219 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
222 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
223 to_next, n_left_to_next,
224 pi0, pi1, next0, next1);
227 while (n_left_from > 0 && n_left_to_next > 0)
229 ip_adjacency_t * adj0;
230 mpls_unicast_header_t *hdr0;
232 u32 pi0, rw_len0, adj_index0, next0, error0;
234 pi0 = to_next[0] = from[0];
236 p0 = vlib_get_buffer (vm, pi0);
238 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
240 /* We should never rewrite a pkt using the MISS adjacency */
243 adj0 = adj_get(adj_index0);
244 hdr0 = vlib_buffer_get_current (p0);
246 /* Guess we are only writing on simple Ethernet header. */
247 vnet_rewrite_one_header (adj0[0], hdr0,
248 sizeof (ethernet_header_t));
250 /* Update packet buffer attributes/set output interface. */
251 rw_len0 = adj0[0].rewrite_header.data_bytes;
253 vlib_increment_combined_counter
254 (&adjacency_counters,
258 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
260 /* Check MTU of outgoing interface. */
261 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
262 adj0[0].rewrite_header.max_l3_packet_bytes))
264 p0->current_data -= rw_len0;
265 p0->current_length += rw_len0;
267 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
268 adj0[0].rewrite_header.sw_if_index;
269 next0 = adj0[0].rewrite_header.next_index;
270 error0 = IP4_ERROR_NONE;
272 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
273 vnet_feature_arc_start (mm->output_feature_arc_index,
274 adj0[0].rewrite_header.sw_if_index,
279 error0 = IP4_ERROR_MTU_EXCEEDED;
280 next0 = MPLS_OUTPUT_NEXT_DROP;
284 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
287 p0->error = error_node->errors[error0];
294 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
296 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
298 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
299 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
302 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
303 to_next, n_left_to_next,
307 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
309 vlib_node_increment_counter (vm, mpls_output_node.index,
310 MPLS_ERROR_PKTS_ENCAP,
311 from_frame->n_vectors);
313 return from_frame->n_vectors;
316 static char * mpls_error_strings[] = {
317 #define mpls_error(n,s) s,
323 mpls_output (vlib_main_t * vm,
324 vlib_node_runtime_t * node,
325 vlib_frame_t * from_frame)
327 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
330 VLIB_REGISTER_NODE (mpls_output_node) = {
331 .function = mpls_output,
332 .name = "mpls-output",
333 /* Takes a vector of packets. */
334 .vector_size = sizeof (u32),
335 .n_errors = MPLS_N_ERROR,
336 .error_strings = mpls_error_strings,
338 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
340 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
341 foreach_mpls_output_next
345 .format_trace = format_mpls_output_trace,
348 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
351 mpls_midchain (vlib_main_t * vm,
352 vlib_node_runtime_t * node,
353 vlib_frame_t * from_frame)
355 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
358 VLIB_REGISTER_NODE (mpls_midchain_node) = {
359 .function = mpls_midchain,
360 .name = "mpls-midchain",
361 .vector_size = sizeof (u32),
363 .format_trace = format_mpls_output_trace,
365 .sibling_of = "mpls-output",
368 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
371 * @brief Next index values from the MPLS incomplete adj node
373 #define foreach_mpls_adj_incomplete_next \
374 _(DROP, "error-drop") \
376 _(IP6, "ip6-discover-neighbor")
379 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
380 foreach_mpls_adj_incomplete_next
382 MPLS_ADJ_INCOMPLETE_N_NEXT,
383 } mpls_adj_incomplete_next_t;
386 * @brief A struct to hold tracing information for the MPLS label imposition
389 typedef struct mpls_adj_incomplete_trace_t_
392 } mpls_adj_incomplete_trace_t;
396 * @brief Graph node for incomplete MPLS adjacency.
397 * This node will push traffic to either the v4-arp or v6-nd node
398 * based on the next-hop proto of the adj.
399 * We pay a cost for this 'routing' node, but an incomplete adj is the
403 mpls_adj_incomplete (vlib_main_t * vm,
404 vlib_node_runtime_t * node,
405 vlib_frame_t * from_frame)
407 u32 n_left_from, next_index, * from, * to_next;
409 from = vlib_frame_vector_args (from_frame);
410 n_left_from = from_frame->n_vectors;
411 next_index = node->cached_next_index;
413 while (n_left_from > 0)
417 vlib_get_next_frame (vm, node, next_index,
418 to_next, n_left_to_next);
420 while (n_left_from > 0 && n_left_to_next > 0)
422 u32 pi0, next0, adj_index0;
423 ip_adjacency_t * adj0;
426 pi0 = to_next[0] = from[0];
427 p0 = vlib_get_buffer (vm, pi0);
433 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
436 adj0 = adj_get(adj_index0);
438 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
440 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
444 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
447 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
449 mpls_adj_incomplete_trace_t *tr =
450 vlib_add_trace (vm, node, p0, sizeof (*tr));
454 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
455 to_next, n_left_to_next,
459 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
462 return from_frame->n_vectors;
466 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
468 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
469 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
470 mpls_adj_incomplete_trace_t * t;
473 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
474 indent = format_get_indent (s);
476 s = format (s, "%Unext:%d",
477 format_white_space, indent,
482 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
483 .function = mpls_adj_incomplete,
484 .name = "mpls-adj-incomplete",
485 .format_trace = format_mpls_adj_incomplete_trace,
486 /* Takes a vector of packets. */
487 .vector_size = sizeof (u32),
488 .n_errors = MPLS_N_ERROR,
489 .error_strings = mpls_error_strings,
491 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
493 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
494 foreach_mpls_adj_incomplete_next
499 VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,