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;
33 format_mpls_output_trace (u8 * s, va_list * args)
35 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
36 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
37 mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
38 uword indent = format_get_indent (s);
40 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
42 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
44 s = format (s, "\n%U%U",
45 format_white_space, indent,
46 format_ip_adjacency_packet_data,
47 t->adj_index, t->packet_data, sizeof (t->packet_data));
52 mpls_output_inline (vlib_main_t * vm,
53 vlib_node_runtime_t * node,
54 vlib_frame_t * from_frame,
57 u32 n_left_from, next_index, * from, * to_next, cpu_index;
58 vlib_node_runtime_t * error_node;
62 cpu_index = os_get_cpu_number();
63 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
64 from = vlib_frame_vector_args (from_frame);
65 n_left_from = from_frame->n_vectors;
66 next_index = node->cached_next_index;
69 while (n_left_from > 0)
71 vlib_get_next_frame (vm, node, next_index,
72 to_next, n_left_to_next);
74 while (n_left_from >= 4 && n_left_to_next >= 2)
76 ip_adjacency_t * adj0;
77 mpls_unicast_header_t *hdr0;
79 u32 pi0, rw_len0, adj_index0, next0, error0;
81 ip_adjacency_t * adj1;
82 mpls_unicast_header_t *hdr1;
84 u32 pi1, rw_len1, adj_index1, next1, error1;
86 /* Prefetch next iteration. */
88 vlib_buffer_t * p2, * p3;
90 p2 = vlib_get_buffer (vm, from[2]);
91 p3 = vlib_get_buffer (vm, from[3]);
93 vlib_prefetch_buffer_header (p2, STORE);
94 vlib_prefetch_buffer_header (p3, STORE);
96 CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
97 CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
100 pi0 = to_next[0] = from[0];
101 pi1 = to_next[1] = from[1];
108 p0 = vlib_get_buffer (vm, pi0);
109 p1 = vlib_get_buffer (vm, pi1);
111 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
112 adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
114 /* We should never rewrite a pkt using the MISS adjacency */
118 adj0 = adj_get(adj_index0);
119 adj1 = adj_get(adj_index1);
120 hdr0 = vlib_buffer_get_current (p0);
121 hdr1 = vlib_buffer_get_current (p1);
123 /* Guess we are only writing on simple Ethernet header. */
124 vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
125 sizeof (ethernet_header_t));
127 /* Update packet buffer attributes/set output interface. */
128 rw_len0 = adj0[0].rewrite_header.data_bytes;
129 rw_len1 = adj1[0].rewrite_header.data_bytes;
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(vm, adj0, p0);
191 adj1->sub_type.midchain.fixup_func(vm, adj1, p1);
194 p0->error = error_node->errors[error0];
195 p1->error = error_node->errors[error1];
197 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
199 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
201 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
202 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
204 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
206 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
208 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
209 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
212 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
213 to_next, n_left_to_next,
214 pi0, pi1, next0, next1);
217 while (n_left_from > 0 && n_left_to_next > 0)
219 ip_adjacency_t * adj0;
220 mpls_unicast_header_t *hdr0;
222 u32 pi0, rw_len0, adj_index0, next0, error0;
224 pi0 = to_next[0] = from[0];
226 p0 = vlib_get_buffer (vm, pi0);
228 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
230 /* We should never rewrite a pkt using the MISS adjacency */
233 adj0 = adj_get(adj_index0);
234 hdr0 = vlib_buffer_get_current (p0);
236 /* Guess we are only writing on simple Ethernet header. */
237 vnet_rewrite_one_header (adj0[0], hdr0,
238 sizeof (ethernet_header_t));
240 /* Update packet buffer attributes/set output interface. */
241 rw_len0 = adj0[0].rewrite_header.data_bytes;
243 vlib_increment_combined_counter
244 (&adjacency_counters,
248 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
250 /* Check MTU of outgoing interface. */
251 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
252 adj0[0].rewrite_header.max_l3_packet_bytes))
254 p0->current_data -= rw_len0;
255 p0->current_length += rw_len0;
257 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
258 adj0[0].rewrite_header.sw_if_index;
259 next0 = adj0[0].rewrite_header.next_index;
260 error0 = IP4_ERROR_NONE;
262 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
263 vnet_feature_arc_start (mm->output_feature_arc_index,
264 adj0[0].rewrite_header.sw_if_index,
269 error0 = IP4_ERROR_MTU_EXCEEDED;
270 next0 = MPLS_OUTPUT_NEXT_DROP;
274 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
277 p0->error = error_node->errors[error0];
284 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
286 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
288 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
289 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
292 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
293 to_next, n_left_to_next,
297 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
299 vlib_node_increment_counter (vm, mpls_output_node.index,
300 MPLS_ERROR_PKTS_ENCAP,
301 from_frame->n_vectors);
303 return from_frame->n_vectors;
306 static char * mpls_error_strings[] = {
307 #define mpls_error(n,s) s,
313 mpls_output (vlib_main_t * vm,
314 vlib_node_runtime_t * node,
315 vlib_frame_t * from_frame)
317 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
320 VLIB_REGISTER_NODE (mpls_output_node) = {
321 .function = mpls_output,
322 .name = "mpls-output",
323 /* Takes a vector of packets. */
324 .vector_size = sizeof (u32),
325 .n_errors = MPLS_N_ERROR,
326 .error_strings = mpls_error_strings,
328 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
330 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
331 foreach_mpls_output_next
335 .format_trace = format_mpls_output_trace,
338 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
341 mpls_midchain (vlib_main_t * vm,
342 vlib_node_runtime_t * node,
343 vlib_frame_t * from_frame)
345 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
348 VLIB_REGISTER_NODE (mpls_midchain_node) = {
349 .function = mpls_midchain,
350 .name = "mpls-midchain",
351 .vector_size = sizeof (u32),
353 .format_trace = format_mpls_output_trace,
355 .sibling_of = "mpls-output",
358 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
361 * @brief Next index values from the MPLS incomplete adj node
363 #define foreach_mpls_adj_incomplete_next \
364 _(DROP, "error-drop") \
366 _(IP6, "ip6-discover-neighbor")
369 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
370 foreach_mpls_adj_incomplete_next
372 MPLS_ADJ_INCOMPLETE_N_NEXT,
373 } mpls_adj_incomplete_next_t;
376 * @brief A struct to hold tracing information for the MPLS label imposition
379 typedef struct mpls_adj_incomplete_trace_t_
382 } mpls_adj_incomplete_trace_t;
386 * @brief Graph node for incomplete MPLS adjacency.
387 * This node will push traffic to either the v4-arp or v6-nd node
388 * based on the next-hop proto of the adj.
389 * We pay a cost for this 'routing' node, but an incomplete adj is the
393 mpls_adj_incomplete (vlib_main_t * vm,
394 vlib_node_runtime_t * node,
395 vlib_frame_t * from_frame)
397 u32 n_left_from, next_index, * from, * to_next;
399 from = vlib_frame_vector_args (from_frame);
400 n_left_from = from_frame->n_vectors;
401 next_index = node->cached_next_index;
403 while (n_left_from > 0)
407 vlib_get_next_frame (vm, node, next_index,
408 to_next, n_left_to_next);
410 while (n_left_from > 0 && n_left_to_next > 0)
412 u32 pi0, next0, adj_index0;
413 ip_adjacency_t * adj0;
416 pi0 = to_next[0] = from[0];
417 p0 = vlib_get_buffer (vm, pi0);
423 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,