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;
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;
68 while (n_left_from > 0)
72 vlib_get_next_frame (vm, node, next_index,
73 to_next, n_left_to_next);
75 while (n_left_from > 0 && n_left_to_next > 0)
77 ip_adjacency_t * adj0;
78 mpls_unicast_header_t *hdr0;
80 u32 pi0, rw_len0, adj_index0, next0, error0;
82 pi0 = to_next[0] = from[0];
84 p0 = vlib_get_buffer (vm, pi0);
86 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
88 /* We should never rewrite a pkt using the MISS adjacency */
91 adj0 = adj_get(adj_index0);
92 hdr0 = vlib_buffer_get_current (p0);
94 /* Guess we are only writing on simple Ethernet header. */
95 vnet_rewrite_one_header (adj0[0], hdr0,
96 sizeof (ethernet_header_t));
98 /* Update packet buffer attributes/set output interface. */
99 rw_len0 = adj0[0].rewrite_header.data_bytes;
101 if (PREDICT_FALSE (rw_len0 > sizeof(ethernet_header_t)))
102 vlib_increment_combined_counter
103 (&adjacency_counters,
104 cpu_index, adj_index0,
105 /* packet increment */ 0,
106 /* byte increment */ rw_len0-sizeof(ethernet_header_t));
108 /* Check MTU of outgoing interface. */
109 error0 = (vlib_buffer_length_in_chain (vm, p0)
110 > adj0[0].rewrite_header.max_l3_packet_bytes
111 ? IP4_ERROR_MTU_EXCEEDED
114 p0->error = error_node->errors[error0];
116 /* Don't adjust the buffer for ttl issue; icmp-error node wants
117 * to see the IP headerr */
118 if (PREDICT_TRUE(error0 == IP4_ERROR_NONE))
120 p0->current_data -= rw_len0;
121 p0->current_length += rw_len0;
123 vnet_buffer (p0)->sw_if_index[VLIB_TX] =
124 adj0[0].rewrite_header.sw_if_index;
125 next0 = adj0[0].rewrite_header.next_index;
129 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
134 next0 = MPLS_OUTPUT_NEXT_DROP;
142 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
144 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
146 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
147 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
150 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
151 to_next, n_left_to_next,
155 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
157 vlib_node_increment_counter (vm, mpls_output_node.index,
158 MPLS_ERROR_PKTS_ENCAP,
159 from_frame->n_vectors);
161 return from_frame->n_vectors;
164 static char * mpls_error_strings[] = {
165 #define mpls_error(n,s) s,
171 mpls_output (vlib_main_t * vm,
172 vlib_node_runtime_t * node,
173 vlib_frame_t * from_frame)
175 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
178 VLIB_REGISTER_NODE (mpls_output_node) = {
179 .function = mpls_output,
180 .name = "mpls-output",
181 /* Takes a vector of packets. */
182 .vector_size = sizeof (u32),
183 .n_errors = MPLS_N_ERROR,
184 .error_strings = mpls_error_strings,
186 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
188 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
189 foreach_mpls_output_next
193 .format_trace = format_mpls_output_trace,
196 VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
199 mpls_midchain (vlib_main_t * vm,
200 vlib_node_runtime_t * node,
201 vlib_frame_t * from_frame)
203 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
206 VLIB_REGISTER_NODE (mpls_midchain_node) = {
207 .function = mpls_midchain,
208 .name = "mpls-midchain",
209 .vector_size = sizeof (u32),
211 .format_trace = format_mpls_output_trace,
213 .sibling_of = "mpls-output",
216 VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
219 * @brief Next index values from the MPLS incomplete adj node
221 #define foreach_mpls_adj_incomplete_next \
222 _(DROP, "error-drop") \
224 _(IP6, "ip6-discover-neighbor")
227 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
228 foreach_mpls_adj_incomplete_next
230 MPLS_ADJ_INCOMPLETE_N_NEXT,
231 } mpls_adj_incomplete_next_t;
234 * @brief A struct to hold tracing information for the MPLS label imposition
237 typedef struct mpls_adj_incomplete_trace_t_
240 } mpls_adj_incomplete_trace_t;
244 * @brief Graph node for incomplete MPLS adjacency.
245 * This node will push traffic to either the v4-arp or v6-nd node
246 * based on the next-hop proto of the adj.
247 * We pay a cost for this 'routing' node, but an incomplete adj is the
251 mpls_adj_incomplete (vlib_main_t * vm,
252 vlib_node_runtime_t * node,
253 vlib_frame_t * from_frame)
255 u32 n_left_from, next_index, * from, * to_next;
257 from = vlib_frame_vector_args (from_frame);
258 n_left_from = from_frame->n_vectors;
259 next_index = node->cached_next_index;
261 while (n_left_from > 0)
265 vlib_get_next_frame (vm, node, next_index,
266 to_next, n_left_to_next);
268 while (n_left_from > 0 && n_left_to_next > 0)
270 u32 pi0, next0, adj_index0;
271 ip_adjacency_t * adj0;
274 pi0 = to_next[0] = from[0];
275 p0 = vlib_get_buffer (vm, pi0);
281 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
284 adj0 = adj_get(adj_index0);
286 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
288 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
292 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
295 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
297 mpls_adj_incomplete_trace_t *tr =
298 vlib_add_trace (vm, node, p0, sizeof (*tr));
302 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
303 to_next, n_left_to_next,
307 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
310 return from_frame->n_vectors;
314 format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
316 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
317 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
318 mpls_adj_incomplete_trace_t * t;
321 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
322 indent = format_get_indent (s);
324 s = format (s, "%Unext:%d",
325 format_white_space, indent,
330 VLIB_REGISTER_NODE (mpls_adj_incomplete_node) = {
331 .function = mpls_adj_incomplete,
332 .name = "mpls-adj-incomplete",
333 .format_trace = format_mpls_adj_incomplete_trace,
334 /* Takes a vector of packets. */
335 .vector_size = sizeof (u32),
336 .n_errors = MPLS_N_ERROR,
337 .error_strings = mpls_error_strings,
339 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
341 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
342 foreach_mpls_adj_incomplete_next
346 .format_trace = format_mpls_output_trace,
349 VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,