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>
22 #include <vnet/adj/adj_dp.h>
25 /* Adjacency taken. */
28 } mpls_output_trace_t;
32 MPLS_OUTPUT_MIDCHAIN_MODE
35 #define foreach_mpls_output_next \
36 _(DROP, "error-drop") \
40 #define _(s,n) MPLS_OUTPUT_NEXT_##s,
41 foreach_mpls_output_next
47 format_mpls_output_trace (u8 * s, va_list * args)
49 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
50 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
51 mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
53 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
55 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
61 mpls_output_inline (vlib_main_t * vm,
62 vlib_node_runtime_t * node,
63 vlib_frame_t * from_frame,
64 mpls_output_mode_t mode)
66 u32 n_left_from, next_index, * from, * to_next, thread_index;
67 vlib_node_runtime_t * error_node;
71 thread_index = vlib_get_thread_index();
72 error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
73 from = vlib_frame_vector_args (from_frame);
74 n_left_from = from_frame->n_vectors;
75 next_index = node->cached_next_index;
78 while (n_left_from > 0)
80 vlib_get_next_frame (vm, node, next_index,
81 to_next, n_left_to_next);
83 while (n_left_from >= 4 && n_left_to_next >= 2)
85 ip_adjacency_t * adj0;
86 mpls_unicast_header_t *hdr0;
88 u32 pi0, adj_index0, next0, error0;
91 ip_adjacency_t * adj1;
92 mpls_unicast_header_t *hdr1;
94 u32 pi1, adj_index1, next1, error1;
97 /* Prefetch next iteration. */
99 vlib_buffer_t * p2, * p3;
101 p2 = vlib_get_buffer (vm, from[2]);
102 p3 = vlib_get_buffer (vm, from[3]);
104 vlib_prefetch_buffer_header (p2, STORE);
105 vlib_prefetch_buffer_header (p3, STORE);
107 CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
108 CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
111 pi0 = to_next[0] = from[0];
112 pi1 = to_next[1] = from[1];
119 p0 = vlib_get_buffer (vm, pi0);
120 p1 = vlib_get_buffer (vm, pi1);
122 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
123 adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
125 adj0 = adj_get(adj_index0);
126 adj1 = adj_get(adj_index1);
127 hdr0 = vlib_buffer_get_current (p0);
128 hdr1 = vlib_buffer_get_current (p1);
130 /* Guess we are only writing on simple Ethernet header. */
131 vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
132 sizeof (ethernet_header_t));
134 /* Update packet buffer attributes/set output interface. */
135 rw_len0 = adj0[0].rewrite_header.data_bytes;
136 rw_len1 = adj1[0].rewrite_header.data_bytes;
137 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
138 vnet_buffer (p1)->mpls.save_rewrite_length = rw_len1;
140 /* Bump the adj counters for packet and bytes */
141 vlib_increment_combined_counter
142 (&adjacency_counters,
146 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
147 vlib_increment_combined_counter
148 (&adjacency_counters,
152 vlib_buffer_length_in_chain (vm, p1) + rw_len1);
154 /* Check MTU of outgoing interface. */
155 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
156 adj0[0].rewrite_header.max_l3_packet_bytes))
158 vlib_buffer_advance(p0, -rw_len0);
160 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
161 adj0[0].rewrite_header.sw_if_index;
162 next0 = adj0[0].rewrite_header.next_index;
163 error0 = IP4_ERROR_NONE;
165 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
166 vnet_feature_arc_start (mm->output_feature_arc_index,
167 adj0[0].rewrite_header.sw_if_index,
172 error0 = IP4_ERROR_MTU_EXCEEDED;
173 next0 = MPLS_OUTPUT_NEXT_FRAG;
174 vlib_node_increment_counter (vm, mpls_output_node.index,
175 MPLS_ERROR_PKTS_NEED_FRAG,
178 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
179 adj1[0].rewrite_header.max_l3_packet_bytes))
181 vlib_buffer_advance(p1, -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_FRAG;
197 vlib_node_increment_counter (vm, mpls_output_node.index,
198 MPLS_ERROR_PKTS_NEED_FRAG,
201 if (mode == MPLS_OUTPUT_MIDCHAIN_MODE)
203 adj_midchain_fixup (vm, adj0, p0, VNET_LINK_MPLS);
204 adj_midchain_fixup (vm, adj1, p1, VNET_LINK_MPLS);
207 p0->error = error_node->errors[error0];
208 p1->error = error_node->errors[error1];
210 if (PREDICT_FALSE (p0->flags & VLIB_BUFFER_IS_TRACED))
212 mpls_output_trace_t *tr =
213 vlib_add_trace (vm, node, p0, sizeof (*tr));
214 tr->adj_index = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
215 tr->flow_hash = vnet_buffer (p0)->ip.flow_hash;
217 if (PREDICT_FALSE (p1->flags & VLIB_BUFFER_IS_TRACED))
219 mpls_output_trace_t *tr =
220 vlib_add_trace (vm, node, p1, sizeof (*tr));
221 tr->adj_index = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
222 tr->flow_hash = vnet_buffer (p1)->ip.flow_hash;
225 vlib_validate_buffer_enqueue_x2 (vm, node, next_index, to_next,
226 n_left_to_next, pi0, pi1, next0,
230 while (n_left_from > 0 && n_left_to_next > 0)
232 ip_adjacency_t * adj0;
233 mpls_unicast_header_t *hdr0;
235 u32 pi0, adj_index0, next0, error0;
238 pi0 = to_next[0] = from[0];
240 p0 = vlib_get_buffer (vm, pi0);
242 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
244 adj0 = adj_get(adj_index0);
245 hdr0 = vlib_buffer_get_current (p0);
247 /* Guess we are only writing on simple Ethernet header. */
248 vnet_rewrite_one_header (adj0[0], hdr0,
249 sizeof (ethernet_header_t));
251 /* Update packet buffer attributes/set output interface. */
252 rw_len0 = adj0[0].rewrite_header.data_bytes;
253 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
255 vlib_increment_combined_counter
256 (&adjacency_counters,
260 vlib_buffer_length_in_chain (vm, p0) + rw_len0);
262 /* Check MTU of outgoing interface. */
263 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
264 adj0[0].rewrite_header.max_l3_packet_bytes))
266 vlib_buffer_advance(p0, -rw_len0);
268 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
269 adj0[0].rewrite_header.sw_if_index;
270 next0 = adj0[0].rewrite_header.next_index;
271 error0 = IP4_ERROR_NONE;
273 if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
274 vnet_feature_arc_start (mm->output_feature_arc_index,
275 adj0[0].rewrite_header.sw_if_index,
280 error0 = IP4_ERROR_MTU_EXCEEDED;
281 next0 = MPLS_OUTPUT_NEXT_FRAG;
282 vlib_node_increment_counter (vm, mpls_output_node.index,
283 MPLS_ERROR_PKTS_NEED_FRAG,
286 if (mode == MPLS_OUTPUT_MIDCHAIN_MODE)
288 adj_midchain_fixup (vm, adj0, p0, VNET_LINK_MPLS);
291 p0->error = error_node->errors[error0];
298 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
300 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
302 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
303 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
306 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
307 to_next, n_left_to_next,
311 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
313 vlib_node_increment_counter (vm, mpls_output_node.index,
314 MPLS_ERROR_PKTS_ENCAP,
315 from_frame->n_vectors);
317 return from_frame->n_vectors;
320 static char * mpls_error_strings[] = {
321 #define mpls_error(n,s) s,
326 VLIB_NODE_FN (mpls_output_node) (vlib_main_t * vm,
327 vlib_node_runtime_t * node,
328 vlib_frame_t * from_frame)
330 return (mpls_output_inline(vm, node, from_frame, MPLS_OUTPUT_MODE));
333 VLIB_REGISTER_NODE (mpls_output_node) = {
334 .name = "mpls-output",
335 /* Takes a vector of packets. */
336 .vector_size = sizeof (u32),
337 .n_errors = MPLS_N_ERROR,
338 .error_strings = mpls_error_strings,
340 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
342 [MPLS_OUTPUT_NEXT_DROP] = "mpls-drop",
343 [MPLS_OUTPUT_NEXT_FRAG] = "mpls-frag",
345 .format_trace = format_mpls_output_trace,
348 VLIB_NODE_FN (mpls_midchain_node) (vlib_main_t * vm,
349 vlib_node_runtime_t * node,
350 vlib_frame_t * from_frame)
352 return (mpls_output_inline(vm, node, from_frame, MPLS_OUTPUT_MIDCHAIN_MODE));
355 VLIB_REGISTER_NODE (mpls_midchain_node) = {
356 .name = "mpls-midchain",
357 .vector_size = sizeof (u32),
359 .n_errors = MPLS_N_ERROR,
360 .error_strings = mpls_error_strings,
362 .sibling_of = "mpls-output",
363 .format_trace = format_mpls_output_trace,
366 static char *mpls_frag_error_strings[] = {
367 #define _(sym,string) string,
368 foreach_ip_frag_error
372 typedef struct mpls_frag_trace_t_
380 MPLS_FRAG_NEXT_REWRITE,
381 MPLS_FRAG_NEXT_REWRITE_MIDCHAIN,
382 MPLS_FRAG_NEXT_ICMP4_ERROR,
383 MPLS_FRAG_NEXT_ICMP6_ERROR,
389 mpls_frag (vlib_main_t * vm,
390 vlib_node_runtime_t * node,
391 vlib_frame_t * frame)
393 u32 n_left_from, next_index, * from, * to_next, n_left_to_next, *frags;
395 from = vlib_frame_vector_args (frame);
396 n_left_from = frame->n_vectors;
397 next_index = node->cached_next_index;
400 while (n_left_from > 0)
402 vlib_get_next_frame (vm, node, next_index,
403 to_next, n_left_to_next);
405 while (n_left_from > 0 && n_left_to_next > 0)
407 ip_adjacency_t * adj0;
409 mpls_frag_next_t next0;
411 ip_frag_error_t error0 = IP_FRAG_ERROR_NONE;
415 pi0 = to_next[0] = from[0];
416 p0 = vlib_get_buffer (vm, pi0);
419 is_ip4 = vnet_buffer (p0)->mpls.pyld_proto == DPO_PROTO_IP4;
421 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
422 adj0 = adj_get (adj_index0);
424 /* the size of the MPLS stack */
425 encap_size = vnet_buffer (p0)->l3_hdr_offset - p0->current_data;
426 mtu = adj0->rewrite_header.max_l3_packet_bytes - encap_size;
428 /* IP fragmentation */
430 error0 = ip4_frag_do_fragment (vm, pi0, mtu, encap_size, &frags);
433 if (!(p0->flags & VNET_BUFFER_F_LOCALLY_ORIGINATED))
435 /* only fragment locally generated IPv6 */
436 error0 = IP_FRAG_ERROR_DONT_FRAGMENT_SET;
441 ip6_frag_do_fragment (vm, pi0, mtu, encap_size, &frags);
445 if (PREDICT_FALSE (p0->flags & VLIB_BUFFER_IS_TRACED))
447 mpls_frag_trace_t *tr =
448 vlib_add_trace (vm, node, p0, sizeof (*tr));
450 tr->pkt_size = vlib_buffer_length_in_chain (vm, p0);
453 if (PREDICT_TRUE (error0 == IP_FRAG_ERROR_NONE))
455 /* Free original buffer chain */
456 vlib_buffer_free_one (vm, pi0);
457 next0 = (IP_LOOKUP_NEXT_MIDCHAIN == adj0->lookup_next_index ?
458 MPLS_FRAG_NEXT_REWRITE_MIDCHAIN :
459 MPLS_FRAG_NEXT_REWRITE);
463 vlib_error_count (vm, node->node_index, error0, 1);
465 if (error0 == IP_FRAG_ERROR_DONT_FRAGMENT_SET)
467 vlib_buffer_advance (p0, encap_size);
470 icmp4_error_set_vnet_buffer (
471 p0, ICMP4_destination_unreachable,
472 ICMP4_destination_unreachable_fragmentation_needed_and_dont_fragment_set,
474 next0 = MPLS_FRAG_NEXT_ICMP4_ERROR;
478 icmp6_error_set_vnet_buffer (p0, ICMP6_packet_too_big,
480 next0 = MPLS_FRAG_NEXT_ICMP6_ERROR;
485 next0 = MPLS_FRAG_NEXT_DROP;
488 /* Get rid of the original buffer */
489 vec_add1 (frags, pi0);
492 /* Send fragments that were added in the frame */
493 u32 *frag_from, frag_left;
496 frag_left = vec_len (frags);
498 while (frag_left > 0)
500 while (frag_left > 0 && n_left_to_next > 0)
503 i = to_next[0] = frag_from[0];
509 vlib_validate_buffer_enqueue_x1 (
510 vm, node, next_index, to_next, n_left_to_next, i, next0);
512 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
513 vlib_get_next_frame (vm, node, next_index, to_next,
516 vec_reset_length (frags);
518 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
522 return frame->n_vectors;
526 format_mpls_frag_trace (u8 * s, va_list * args)
528 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
529 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
530 mpls_frag_trace_t *t = va_arg (*args, mpls_frag_trace_t *);
532 s = format (s, "mtu:%d pkt-size:%d", t->mtu, t->pkt_size);
536 VLIB_REGISTER_NODE (mpls_frag_node) = {
537 .function = mpls_frag,
539 .vector_size = sizeof (u32),
540 .format_trace = format_mpls_frag_trace,
541 .type = VLIB_NODE_TYPE_INTERNAL,
543 .n_errors = IP_FRAG_N_ERROR,
544 .error_strings = mpls_frag_error_strings,
546 .n_next_nodes = MPLS_FRAG_N_NEXT,
547 .next_nodes = { [MPLS_FRAG_NEXT_REWRITE] = "mpls-output",
548 [MPLS_FRAG_NEXT_REWRITE_MIDCHAIN] = "mpls-midchain",
549 [MPLS_FRAG_NEXT_ICMP4_ERROR] = "ip4-icmp-error",
550 [MPLS_FRAG_NEXT_ICMP6_ERROR] = "ip6-icmp-error",
551 [MPLS_FRAG_NEXT_DROP] = "mpls-drop" },
555 * @brief Next index values from the MPLS incomplete adj node
557 #define foreach_mpls_adj_incomplete_next \
558 _(DROP, "error-drop") \
560 _(IP6, "ip6-discover-neighbor")
563 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
564 foreach_mpls_adj_incomplete_next
566 MPLS_ADJ_INCOMPLETE_N_NEXT,
567 } mpls_adj_incomplete_next_t;
570 * @brief A struct to hold tracing information for the MPLS label imposition
573 typedef struct mpls_adj_incomplete_trace_t_
576 } mpls_adj_incomplete_trace_t;
580 * @brief Graph node for incomplete MPLS adjacency.
581 * This node will push traffic to either the v4-arp or v6-nd node
582 * based on the next-hop proto of the adj.
583 * We pay a cost for this 'routing' node, but an incomplete adj is the
586 VLIB_NODE_FN (mpls_adj_incomplete_node) (vlib_main_t * vm,
587 vlib_node_runtime_t * node,
588 vlib_frame_t * from_frame)
590 u32 n_left_from, next_index, * from, * to_next;
592 from = vlib_frame_vector_args (from_frame);
593 n_left_from = from_frame->n_vectors;
594 next_index = node->cached_next_index;
596 while (n_left_from > 0)
600 vlib_get_next_frame (vm, node, next_index,
601 to_next, n_left_to_next);
603 while (n_left_from > 0 && n_left_to_next > 0)
605 u32 pi0, next0, adj_index0;
606 ip_adjacency_t * adj0;
609 pi0 = to_next[0] = from[0];
610 p0 = vlib_get_buffer (vm, pi0);
616 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
618 adj0 = adj_get(adj_index0);
620 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
622 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
626 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
629 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
631 mpls_adj_incomplete_trace_t *tr =
632 vlib_add_trace (vm, node, p0, sizeof (*tr));
636 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
637 to_next, n_left_to_next,
641 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
644 return from_frame->n_vectors;
648 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
650 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
651 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
652 mpls_adj_incomplete_trace_t * t;
655 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
656 indent = format_get_indent (s);
658 s = format (s, "%Unext:%d",
659 format_white_space, indent,
664 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
665 .name = "mpls-adj-incomplete",
666 .format_trace = format_mpls_adj_incomplete_trace,
667 /* Takes a vector of packets. */
668 .vector_size = sizeof (u32),
669 .n_errors = MPLS_N_ERROR,
670 .error_strings = mpls_error_strings,
672 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
674 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
675 foreach_mpls_adj_incomplete_next