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/ip/ip.h>
20 #include <vnet/mpls/mpls.h>
21 #include <vnet/ip/ip_frag.h>
24 /* Adjacency taken. */
27 } mpls_output_trace_t;
31 MPLS_OUTPUT_MIDCHAIN_MODE
34 #define foreach_mpls_output_next \
35 _(DROP, "error-drop") \
39 #define _(s,n) MPLS_OUTPUT_NEXT_##s,
40 foreach_mpls_output_next
46 format_mpls_output_trace (u8 * s, va_list * args)
48 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
49 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
50 mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
52 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
54 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
60 mpls_output_inline (vlib_main_t * vm,
61 vlib_node_runtime_t * node,
62 vlib_frame_t * from_frame,
63 mpls_output_mode_t mode)
65 u32 n_left_from, next_index, * from, * to_next, thread_index;
66 vlib_node_runtime_t * error_node;
70 thread_index = vlib_get_thread_index();
71 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
72 from = vlib_frame_vector_args (from_frame);
73 n_left_from = from_frame->n_vectors;
74 next_index = node->cached_next_index;
77 while (n_left_from > 0)
79 vlib_get_next_frame (vm, node, next_index,
80 to_next, n_left_to_next);
82 while (n_left_from >= 4 && n_left_to_next >= 2)
84 ip_adjacency_t * adj0;
85 mpls_unicast_header_t *hdr0;
87 u32 pi0, adj_index0, next0, error0;
90 ip_adjacency_t * adj1;
91 mpls_unicast_header_t *hdr1;
93 u32 pi1, 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 adj0 = adj_get(adj_index0);
125 adj1 = adj_get(adj_index1);
126 hdr0 = vlib_buffer_get_current (p0);
127 hdr1 = vlib_buffer_get_current (p1);
129 /* Guess we are only writing on simple Ethernet header. */
130 vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
131 sizeof (ethernet_header_t));
133 /* Update packet buffer attributes/set output interface. */
134 rw_len0 = adj0[0].rewrite_header.data_bytes;
135 rw_len1 = adj1[0].rewrite_header.data_bytes;
136 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
137 vnet_buffer (p1)->mpls.save_rewrite_length = rw_len1;
139 /* Bump the adj counters for packet and bytes */
140 vlib_increment_combined_counter
141 (&adjacency_counters,
145 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
146 vlib_increment_combined_counter
147 (&adjacency_counters,
151 vlib_buffer_length_in_chain (vm, p1) + rw_len1);
153 /* Check MTU of outgoing interface. */
154 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
155 adj0[0].rewrite_header.max_l3_packet_bytes))
157 vlib_buffer_advance(p0, -rw_len0);
159 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
160 adj0[0].rewrite_header.sw_if_index;
161 next0 = adj0[0].rewrite_header.next_index;
162 error0 = IP4_ERROR_NONE;
164 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
165 vnet_feature_arc_start (mm->output_feature_arc_index,
166 adj0[0].rewrite_header.sw_if_index,
171 error0 = IP4_ERROR_MTU_EXCEEDED;
172 next0 = MPLS_OUTPUT_NEXT_FRAG;
173 vlib_node_increment_counter (vm, mpls_output_node.index,
174 MPLS_ERROR_PKTS_NEED_FRAG,
177 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
178 adj1[0].rewrite_header.max_l3_packet_bytes))
180 vlib_buffer_advance(p1, -rw_len1);
182 vnet_buffer (p1)->sw_if_index[VLIB_TX] =
183 adj1[0].rewrite_header.sw_if_index;
184 next1 = adj1[0].rewrite_header.next_index;
185 error1 = IP4_ERROR_NONE;
187 if (PREDICT_FALSE(adj1[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
188 vnet_feature_arc_start (mm->output_feature_arc_index,
189 adj1[0].rewrite_header.sw_if_index,
194 error1 = IP4_ERROR_MTU_EXCEEDED;
195 next1 = MPLS_OUTPUT_NEXT_FRAG;
196 vlib_node_increment_counter (vm, mpls_output_node.index,
197 MPLS_ERROR_PKTS_NEED_FRAG,
200 if (mode == MPLS_OUTPUT_MIDCHAIN_MODE)
202 adj0->sub_type.midchain.fixup_func
204 adj0->sub_type.midchain.fixup_data);
205 adj1->sub_type.midchain.fixup_func
207 adj1->sub_type.midchain.fixup_data);
210 p0->error = error_node->errors[error0];
211 p1->error = error_node->errors[error1];
213 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
215 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
217 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
218 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
220 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
222 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
224 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
225 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
228 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
229 to_next, n_left_to_next,
230 pi0, pi1, next0, next1);
233 while (n_left_from > 0 && n_left_to_next > 0)
235 ip_adjacency_t * adj0;
236 mpls_unicast_header_t *hdr0;
238 u32 pi0, adj_index0, next0, error0;
241 pi0 = to_next[0] = from[0];
243 p0 = vlib_get_buffer (vm, pi0);
245 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
247 adj0 = adj_get(adj_index0);
248 hdr0 = vlib_buffer_get_current (p0);
250 /* Guess we are only writing on simple Ethernet header. */
251 vnet_rewrite_one_header (adj0[0], hdr0,
252 sizeof (ethernet_header_t));
254 /* Update packet buffer attributes/set output interface. */
255 rw_len0 = adj0[0].rewrite_header.data_bytes;
256 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
258 vlib_increment_combined_counter
259 (&adjacency_counters,
263 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
265 /* Check MTU of outgoing interface. */
266 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
267 adj0[0].rewrite_header.max_l3_packet_bytes))
269 vlib_buffer_advance(p0, -rw_len0);
271 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
272 adj0[0].rewrite_header.sw_if_index;
273 next0 = adj0[0].rewrite_header.next_index;
274 error0 = IP4_ERROR_NONE;
276 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
277 vnet_feature_arc_start (mm->output_feature_arc_index,
278 adj0[0].rewrite_header.sw_if_index,
283 error0 = IP4_ERROR_MTU_EXCEEDED;
284 next0 = MPLS_OUTPUT_NEXT_FRAG;
285 vlib_node_increment_counter (vm, mpls_output_node.index,
286 MPLS_ERROR_PKTS_NEED_FRAG,
289 if (mode == MPLS_OUTPUT_MIDCHAIN_MODE)
291 adj0->sub_type.midchain.fixup_func
293 adj0->sub_type.midchain.fixup_data);
296 p0->error = error_node->errors[error0];
303 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
305 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
307 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
308 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
311 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
312 to_next, n_left_to_next,
316 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
318 vlib_node_increment_counter (vm, mpls_output_node.index,
319 MPLS_ERROR_PKTS_ENCAP,
320 from_frame->n_vectors);
322 return from_frame->n_vectors;
325 static char * mpls_error_strings[] = {
326 #define mpls_error(n,s) s,
331 VLIB_NODE_FN (mpls_output_node) (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, MPLS_OUTPUT_MODE));
338 VLIB_REGISTER_NODE (mpls_output_node) = {
339 .name = "mpls-output",
340 /* Takes a vector of packets. */
341 .vector_size = sizeof (u32),
342 .n_errors = MPLS_N_ERROR,
343 .error_strings = mpls_error_strings,
345 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
347 [MPLS_OUTPUT_NEXT_DROP] = "mpls-drop",
348 [MPLS_OUTPUT_NEXT_FRAG] = "mpls-frag",
350 .format_trace = format_mpls_output_trace,
353 VLIB_NODE_FN (mpls_midchain_node) (vlib_main_t * vm,
354 vlib_node_runtime_t * node,
355 vlib_frame_t * from_frame)
357 return (mpls_output_inline(vm, node, from_frame, MPLS_OUTPUT_MIDCHAIN_MODE));
360 VLIB_REGISTER_NODE (mpls_midchain_node) = {
361 .name = "mpls-midchain",
362 .vector_size = sizeof (u32),
364 .n_errors = MPLS_N_ERROR,
365 .error_strings = mpls_error_strings,
367 .sibling_of = "mpls-output",
368 .format_trace = format_mpls_output_trace,
371 static char *mpls_frag_error_strings[] = {
372 #define _(sym,string) string,
373 foreach_ip_frag_error
377 typedef struct mpls_frag_trace_t_
385 MPLS_FRAG_NEXT_REWRITE,
386 MPLS_FRAG_NEXT_REWRITE_MIDCHAIN,
387 MPLS_FRAG_NEXT_ICMP_ERROR,
393 mpls_frag (vlib_main_t * vm,
394 vlib_node_runtime_t * node,
395 vlib_frame_t * frame)
397 u32 n_left_from, next_index, * from, * to_next, n_left_to_next, *frags;
398 vlib_node_runtime_t * error_node;
400 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
401 from = vlib_frame_vector_args (frame);
402 n_left_from = frame->n_vectors;
403 next_index = node->cached_next_index;
406 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 ip_adjacency_t * adj0;
415 mpls_frag_next_t next0;
417 ip_frag_error_t error0 = IP_FRAG_ERROR_NONE;
421 pi0 = to_next[0] = from[0];
422 p0 = vlib_get_buffer (vm, pi0);
425 is_ip4 = vnet_buffer (p0)->mpls.pyld_proto == DPO_PROTO_IP4;
427 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
428 adj0 = adj_get(adj_index0);
430 /* the size of the MPLS stack */
431 encap_size = vnet_buffer(p0)->l3_hdr_offset - p0->current_data;
433 /* IP fragmentation */
435 error0 = ip4_frag_do_fragment (vm, pi0,
436 adj0->rewrite_header.max_l3_packet_bytes,
439 error0 = ip6_frag_do_fragment (vm, pi0,
440 adj0->rewrite_header.max_l3_packet_bytes,
443 if (PREDICT_FALSE (p0->flags & VLIB_BUFFER_IS_TRACED))
445 mpls_frag_trace_t *tr =
446 vlib_add_trace (vm, node, p0, sizeof (*tr));
447 tr->mtu = adj0->rewrite_header.max_l3_packet_bytes;
448 tr->pkt_size = vlib_buffer_length_in_chain(vm, p0);
451 if (PREDICT_TRUE(error0 == IP_FRAG_ERROR_NONE))
453 /* Free original buffer chain */
454 vlib_buffer_free_one (vm, pi0); /* Free original packet */
455 next0 = (IP_LOOKUP_NEXT_MIDCHAIN == adj0->lookup_next_index ?
456 MPLS_FRAG_NEXT_REWRITE_MIDCHAIN :
457 MPLS_FRAG_NEXT_REWRITE);
459 else if (is_ip4 && error0 == IP_FRAG_ERROR_DONT_FRAGMENT_SET)
461 icmp4_error_set_vnet_buffer (
462 p0, ICMP4_destination_unreachable,
463 ICMP4_destination_unreachable_fragmentation_needed_and_dont_fragment_set,
464 vnet_buffer (p0)->ip_frag.mtu);
465 next0 = MPLS_FRAG_NEXT_ICMP_ERROR;
469 vlib_error_count (vm, mpls_output_node.index, error0, 1);
470 vec_add1 (frags, pi0); /* Get rid of the original buffer */
471 next0 = MPLS_FRAG_NEXT_DROP;
474 /* Send fragments that were added in the frame */
475 u32 *frag_from, frag_left;
478 frag_left = vec_len (frags);
480 while (frag_left > 0)
482 while (frag_left > 0 && n_left_to_next > 0)
485 i = to_next[0] = frag_from[0];
491 p0 = vlib_get_buffer (vm, i);
492 p0->error = error_node->errors[error0];
494 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
495 to_next, n_left_to_next, i,
498 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
499 vlib_get_next_frame (vm, node, next_index, to_next,
502 vec_reset_length (frags);
504 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
508 return frame->n_vectors;
512 format_mpls_frag_trace (u8 * s, va_list * args)
514 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
515 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
516 mpls_frag_trace_t *t = va_arg (*args, mpls_frag_trace_t *);
518 s = format (s, "mtu:%d pkt-size:%d", t->mtu, t->pkt_size);
522 VLIB_REGISTER_NODE (mpls_frag_node) = {
523 .function = mpls_frag,
525 .vector_size = sizeof (u32),
526 .format_trace = format_mpls_frag_trace,
527 .type = VLIB_NODE_TYPE_INTERNAL,
529 .n_errors = IP_FRAG_N_ERROR,
530 .error_strings = mpls_frag_error_strings,
532 .n_next_nodes = MPLS_FRAG_N_NEXT,
534 [MPLS_FRAG_NEXT_REWRITE] = "mpls-output",
535 [MPLS_FRAG_NEXT_REWRITE_MIDCHAIN] = "mpls-midchain",
536 [MPLS_FRAG_NEXT_ICMP_ERROR] = "ip4-icmp-error",
537 [MPLS_FRAG_NEXT_DROP] = "mpls-drop"
542 * @brief Next index values from the MPLS incomplete adj node
544 #define foreach_mpls_adj_incomplete_next \
545 _(DROP, "error-drop") \
547 _(IP6, "ip6-discover-neighbor")
550 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
551 foreach_mpls_adj_incomplete_next
553 MPLS_ADJ_INCOMPLETE_N_NEXT,
554 } mpls_adj_incomplete_next_t;
557 * @brief A struct to hold tracing information for the MPLS label imposition
560 typedef struct mpls_adj_incomplete_trace_t_
563 } mpls_adj_incomplete_trace_t;
567 * @brief Graph node for incomplete MPLS adjacency.
568 * This node will push traffic to either the v4-arp or v6-nd node
569 * based on the next-hop proto of the adj.
570 * We pay a cost for this 'routing' node, but an incomplete adj is the
573 VLIB_NODE_FN (mpls_adj_incomplete_node) (vlib_main_t * vm,
574 vlib_node_runtime_t * node,
575 vlib_frame_t * from_frame)
577 u32 n_left_from, next_index, * from, * to_next;
579 from = vlib_frame_vector_args (from_frame);
580 n_left_from = from_frame->n_vectors;
581 next_index = node->cached_next_index;
583 while (n_left_from > 0)
587 vlib_get_next_frame (vm, node, next_index,
588 to_next, n_left_to_next);
590 while (n_left_from > 0 && n_left_to_next > 0)
592 u32 pi0, next0, adj_index0;
593 ip_adjacency_t * adj0;
596 pi0 = to_next[0] = from[0];
597 p0 = vlib_get_buffer (vm, pi0);
603 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
605 adj0 = adj_get(adj_index0);
607 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
609 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
613 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
616 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
618 mpls_adj_incomplete_trace_t *tr =
619 vlib_add_trace (vm, node, p0, sizeof (*tr));
623 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
624 to_next, n_left_to_next,
628 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
631 return from_frame->n_vectors;
635 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
637 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
638 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
639 mpls_adj_incomplete_trace_t * t;
642 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
643 indent = format_get_indent (s);
645 s = format (s, "%Unext:%d",
646 format_white_space, indent,
651 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
652 .name = "mpls-adj-incomplete",
653 .format_trace = format_mpls_adj_incomplete_trace,
654 /* Takes a vector of packets. */
655 .vector_size = sizeof (u32),
656 .n_errors = MPLS_N_ERROR,
657 .error_strings = mpls_error_strings,
659 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
661 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
662 foreach_mpls_adj_incomplete_next