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 vnet_main_t * vnm = vnet_get_main();
39 uword indent = format_get_indent (s);
41 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
43 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
45 s = format (s, "\n%U%U",
46 format_white_space, indent,
47 format_ip_adjacency_packet_data,
49 t->packet_data, sizeof (t->packet_data));
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, cpu_index;
60 vlib_node_runtime_t * error_node;
63 cpu_index = os_get_cpu_number();
64 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
65 from = vlib_frame_vector_args (from_frame);
66 n_left_from = from_frame->n_vectors;
67 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;
159 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
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;
180 adj1->sub_type.midchain.fixup_func(vm, adj1, p1);
185 error1 = IP4_ERROR_MTU_EXCEEDED;
186 next1 = MPLS_OUTPUT_NEXT_DROP;
189 p0->error = error_node->errors[error0];
190 p1->error = error_node->errors[error1];
192 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
194 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
196 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
197 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
199 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
201 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
203 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
204 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
207 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
208 to_next, n_left_to_next,
209 pi0, pi1, next0, next1);
212 while (n_left_from > 0 && n_left_to_next > 0)
214 ip_adjacency_t * adj0;
215 mpls_unicast_header_t *hdr0;
217 u32 pi0, rw_len0, adj_index0, next0, error0;
219 pi0 = to_next[0] = from[0];
221 p0 = vlib_get_buffer (vm, pi0);
223 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
225 /* We should never rewrite a pkt using the MISS adjacency */
228 adj0 = adj_get(adj_index0);
229 hdr0 = vlib_buffer_get_current (p0);
231 /* Guess we are only writing on simple Ethernet header. */
232 vnet_rewrite_one_header (adj0[0], hdr0,
233 sizeof (ethernet_header_t));
235 /* Update packet buffer attributes/set output interface. */
236 rw_len0 = adj0[0].rewrite_header.data_bytes;
238 vlib_increment_combined_counter
239 (&adjacency_counters,
243 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
245 /* Check MTU of outgoing interface. */
246 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
247 adj0[0].rewrite_header.max_l3_packet_bytes))
249 p0->current_data -= rw_len0;
250 p0->current_length += rw_len0;
252 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
253 adj0[0].rewrite_header.sw_if_index;
254 next0 = adj0[0].rewrite_header.next_index;
255 error0 = IP4_ERROR_NONE;
259 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
264 error0 = IP4_ERROR_MTU_EXCEEDED;
265 next0 = MPLS_OUTPUT_NEXT_DROP;
267 p0->error = error_node->errors[error0];
274 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
276 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
278 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
279 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
282 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
283 to_next, n_left_to_next,
287 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
289 vlib_node_increment_counter (vm, mpls_output_node.index,
290 MPLS_ERROR_PKTS_ENCAP,
291 from_frame->n_vectors);
293 return from_frame->n_vectors;
296 static char * mpls_error_strings[] = {
297 #define mpls_error(n,s) s,
303 mpls_output (vlib_main_t * vm,
304 vlib_node_runtime_t * node,
305 vlib_frame_t * from_frame)
307 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
310 VLIB_REGISTER_NODE (mpls_output_node) = {
311 .function = mpls_output,
312 .name = "mpls-output",
313 /* Takes a vector of packets. */
314 .vector_size = sizeof (u32),
315 .n_errors = MPLS_N_ERROR,
316 .error_strings = mpls_error_strings,
318 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
320 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
321 foreach_mpls_output_next
325 .format_trace = format_mpls_output_trace,
328 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
331 mpls_midchain (vlib_main_t * vm,
332 vlib_node_runtime_t * node,
333 vlib_frame_t * from_frame)
335 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
338 VLIB_REGISTER_NODE (mpls_midchain_node) = {
339 .function = mpls_midchain,
340 .name = "mpls-midchain",
341 .vector_size = sizeof (u32),
343 .format_trace = format_mpls_output_trace,
345 .sibling_of = "mpls-output",
348 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
351 * @brief Next index values from the MPLS incomplete adj node
353 #define foreach_mpls_adj_incomplete_next \
354 _(DROP, "error-drop") \
356 _(IP6, "ip6-discover-neighbor")
359 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
360 foreach_mpls_adj_incomplete_next
362 MPLS_ADJ_INCOMPLETE_N_NEXT,
363 } mpls_adj_incomplete_next_t;
366 * @brief A struct to hold tracing information for the MPLS label imposition
369 typedef struct mpls_adj_incomplete_trace_t_
372 } mpls_adj_incomplete_trace_t;
376 * @brief Graph node for incomplete MPLS adjacency.
377 * This node will push traffic to either the v4-arp or v6-nd node
378 * based on the next-hop proto of the adj.
379 * We pay a cost for this 'routing' node, but an incomplete adj is the
383 mpls_adj_incomplete (vlib_main_t * vm,
384 vlib_node_runtime_t * node,
385 vlib_frame_t * from_frame)
387 u32 n_left_from, next_index, * from, * to_next;
389 from = vlib_frame_vector_args (from_frame);
390 n_left_from = from_frame->n_vectors;
391 next_index = node->cached_next_index;
393 while (n_left_from > 0)
397 vlib_get_next_frame (vm, node, next_index,
398 to_next, n_left_to_next);
400 while (n_left_from > 0 && n_left_to_next > 0)
402 u32 pi0, next0, adj_index0;
403 ip_adjacency_t * adj0;
406 pi0 = to_next[0] = from[0];
407 p0 = vlib_get_buffer (vm, pi0);
413 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
416 adj0 = adj_get(adj_index0);
418 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
420 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
424 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
427 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
429 mpls_adj_incomplete_trace_t *tr =
430 vlib_add_trace (vm, node, p0, sizeof (*tr));
434 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
435 to_next, n_left_to_next,
439 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
442 return from_frame->n_vectors;
446 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
448 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
449 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
450 mpls_adj_incomplete_trace_t * t;
453 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
454 indent = format_get_indent (s);
456 s = format (s, "%Unext:%d",
457 format_white_space, indent,
462 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
463 .function = mpls_adj_incomplete,
464 .name = "mpls-adj-incomplete",
465 .format_trace = format_mpls_adj_incomplete_trace,
466 /* Takes a vector of packets. */
467 .vector_size = sizeof (u32),
468 .n_errors = MPLS_N_ERROR,
469 .error_strings = mpls_error_strings,
471 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
473 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
474 foreach_mpls_adj_incomplete_next
479 VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,