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 if (PREDICT_FALSE (rw_len0 > sizeof(ethernet_header_t)))
132 vlib_increment_combined_counter
133 (&adjacency_counters,
134 cpu_index, adj_index0,
135 /* packet increment */ 0,
136 /* byte increment */ rw_len0-sizeof(ethernet_header_t));
137 if (PREDICT_FALSE (rw_len1 > sizeof(ethernet_header_t)))
138 vlib_increment_combined_counter
139 (&adjacency_counters,
140 cpu_index, adj_index1,
141 /* packet increment */ 0,
142 /* byte increment */ rw_len1-sizeof(ethernet_header_t));
144 /* Check MTU of outgoing interface. */
145 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
146 adj0[0].rewrite_header.max_l3_packet_bytes))
148 p0->current_data -= rw_len0;
149 p0->current_length += rw_len0;
151 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
152 adj0[0].rewrite_header.sw_if_index;
153 next0 = adj0[0].rewrite_header.next_index;
154 error0 = IP4_ERROR_NONE;
158 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
163 error0 = IP4_ERROR_MTU_EXCEEDED;
164 next0 = MPLS_OUTPUT_NEXT_DROP;
166 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
167 adj1[0].rewrite_header.max_l3_packet_bytes))
169 p1->current_data -= rw_len1;
170 p1->current_length += rw_len1;
172 vnet_buffer (p1)->sw_if_index[VLIB_TX] =
173 adj1[0].rewrite_header.sw_if_index;
174 next1 = adj1[0].rewrite_header.next_index;
175 error1 = IP4_ERROR_NONE;
179 adj1->sub_type.midchain.fixup_func(vm, adj1, p1);
184 error1 = IP4_ERROR_MTU_EXCEEDED;
185 next1 = MPLS_OUTPUT_NEXT_DROP;
188 p0->error = error_node->errors[error0];
189 p1->error = error_node->errors[error1];
191 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
193 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
195 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
196 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
198 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
200 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
202 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
203 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
206 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
207 to_next, n_left_to_next,
208 pi0, pi1, next0, next1);
211 while (n_left_from > 0 && n_left_to_next > 0)
213 ip_adjacency_t * adj0;
214 mpls_unicast_header_t *hdr0;
216 u32 pi0, rw_len0, adj_index0, next0, error0;
218 pi0 = to_next[0] = from[0];
220 p0 = vlib_get_buffer (vm, pi0);
222 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
224 /* We should never rewrite a pkt using the MISS adjacency */
227 adj0 = adj_get(adj_index0);
228 hdr0 = vlib_buffer_get_current (p0);
230 /* Guess we are only writing on simple Ethernet header. */
231 vnet_rewrite_one_header (adj0[0], hdr0,
232 sizeof (ethernet_header_t));
234 /* Update packet buffer attributes/set output interface. */
235 rw_len0 = adj0[0].rewrite_header.data_bytes;
237 if (PREDICT_FALSE (rw_len0 > sizeof(ethernet_header_t)))
238 vlib_increment_combined_counter
239 (&adjacency_counters,
240 cpu_index, adj_index0,
241 /* packet increment */ 0,
242 /* byte increment */ rw_len0-sizeof(ethernet_header_t));
244 /* Check MTU of outgoing interface. */
245 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
246 adj0[0].rewrite_header.max_l3_packet_bytes))
248 p0->current_data -= rw_len0;
249 p0->current_length += rw_len0;
251 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
252 adj0[0].rewrite_header.sw_if_index;
253 next0 = adj0[0].rewrite_header.next_index;
254 error0 = IP4_ERROR_NONE;
258 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
263 error0 = IP4_ERROR_MTU_EXCEEDED;
264 next0 = MPLS_OUTPUT_NEXT_DROP;
266 p0->error = error_node->errors[error0];
273 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
275 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
277 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
278 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
281 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
282 to_next, n_left_to_next,
286 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
288 vlib_node_increment_counter (vm, mpls_output_node.index,
289 MPLS_ERROR_PKTS_ENCAP,
290 from_frame->n_vectors);
292 return from_frame->n_vectors;
295 static char * mpls_error_strings[] = {
296 #define mpls_error(n,s) s,
302 mpls_output (vlib_main_t * vm,
303 vlib_node_runtime_t * node,
304 vlib_frame_t * from_frame)
306 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
309 VLIB_REGISTER_NODE (mpls_output_node) = {
310 .function = mpls_output,
311 .name = "mpls-output",
312 /* Takes a vector of packets. */
313 .vector_size = sizeof (u32),
314 .n_errors = MPLS_N_ERROR,
315 .error_strings = mpls_error_strings,
317 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
319 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
320 foreach_mpls_output_next
324 .format_trace = format_mpls_output_trace,
327 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
330 mpls_midchain (vlib_main_t * vm,
331 vlib_node_runtime_t * node,
332 vlib_frame_t * from_frame)
334 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
337 VLIB_REGISTER_NODE (mpls_midchain_node) = {
338 .function = mpls_midchain,
339 .name = "mpls-midchain",
340 .vector_size = sizeof (u32),
342 .format_trace = format_mpls_output_trace,
344 .sibling_of = "mpls-output",
347 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
350 * @brief Next index values from the MPLS incomplete adj node
352 #define foreach_mpls_adj_incomplete_next \
353 _(DROP, "error-drop") \
355 _(IP6, "ip6-discover-neighbor")
358 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
359 foreach_mpls_adj_incomplete_next
361 MPLS_ADJ_INCOMPLETE_N_NEXT,
362 } mpls_adj_incomplete_next_t;
365 * @brief A struct to hold tracing information for the MPLS label imposition
368 typedef struct mpls_adj_incomplete_trace_t_
371 } mpls_adj_incomplete_trace_t;
375 * @brief Graph node for incomplete MPLS adjacency.
376 * This node will push traffic to either the v4-arp or v6-nd node
377 * based on the next-hop proto of the adj.
378 * We pay a cost for this 'routing' node, but an incomplete adj is the
382 mpls_adj_incomplete (vlib_main_t * vm,
383 vlib_node_runtime_t * node,
384 vlib_frame_t * from_frame)
386 u32 n_left_from, next_index, * from, * to_next;
388 from = vlib_frame_vector_args (from_frame);
389 n_left_from = from_frame->n_vectors;
390 next_index = node->cached_next_index;
392 while (n_left_from > 0)
396 vlib_get_next_frame (vm, node, next_index,
397 to_next, n_left_to_next);
399 while (n_left_from > 0 && n_left_to_next > 0)
401 u32 pi0, next0, adj_index0;
402 ip_adjacency_t * adj0;
405 pi0 = to_next[0] = from[0];
406 p0 = vlib_get_buffer (vm, pi0);
412 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
415 adj0 = adj_get(adj_index0);
417 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
419 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
423 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
426 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
428 mpls_adj_incomplete_trace_t *tr =
429 vlib_add_trace (vm, node, p0, sizeof (*tr));
433 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
434 to_next, n_left_to_next,
438 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
441 return from_frame->n_vectors;
445 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
447 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
448 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
449 mpls_adj_incomplete_trace_t * t;
452 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
453 indent = format_get_indent (s);
455 s = format (s, "%Unext:%d",
456 format_white_space, indent,
461 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
462 .function = mpls_adj_incomplete,
463 .name = "mpls-adj-incomplete",
464 .format_trace = format_mpls_adj_incomplete_trace,
465 /* Takes a vector of packets. */
466 .vector_size = sizeof (u32),
467 .n_errors = MPLS_N_ERROR,
468 .error_strings = mpls_error_strings,
470 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
472 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
473 foreach_mpls_adj_incomplete_next
478 VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,