blob: 8292a0cb3d27f9c20b974b80fee56ef52e293986 [file] [log] [blame]
Neale Ranns0bfe5d82016-08-25 15:29:12 +01001/*
2 * mpls_output.c: MPLS Adj rewrite
3 *
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:
8 *
9 * http://www.apache.org/licenses/LICENSE-2.0
10 *
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.
16 */
17
18#include <vlib/vlib.h>
19#include <vnet/pg/pg.h>
Neale Ranns1357f3b2016-10-16 12:01:42 -070020#include <vnet/ip/ip.h>
Neale Ranns0bfe5d82016-08-25 15:29:12 +010021#include <vnet/mpls/mpls.h>
22
23typedef struct {
24 /* Adjacency taken. */
25 u32 adj_index;
26 u32 flow_hash;
27
28 /* Packet data, possibly *after* rewrite. */
29 u8 packet_data[64 - 1*sizeof(u32)];
30} mpls_output_trace_t;
31
32static u8 *
33format_mpls_output_trace (u8 * s, va_list * args)
34{
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);
40
41 s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
42 t->adj_index,
Neale Rannsb80c5362016-10-08 13:03:40 +010043 format_ip_adjacency, t->adj_index, FORMAT_IP_ADJACENCY_NONE,
Neale Ranns0bfe5d82016-08-25 15:29:12 +010044 t->flow_hash);
45 s = format (s, "\n%U%U",
46 format_white_space, indent,
47 format_ip_adjacency_packet_data,
48 vnm, t->adj_index,
49 t->packet_data, sizeof (t->packet_data));
50 return s;
51}
52
53static inline uword
54mpls_output_inline (vlib_main_t * vm,
55 vlib_node_runtime_t * node,
John Loaeb06f42016-10-15 17:45:35 -040056 vlib_frame_t * from_frame,
57 int is_midchain)
Neale Ranns0bfe5d82016-08-25 15:29:12 +010058{
59 u32 n_left_from, next_index, * from, * to_next, cpu_index;
60 vlib_node_runtime_t * error_node;
Neale Ranns9ca18c62016-12-10 21:08:09 +000061 u32 n_left_to_next;
Neale Ranns0bfe5d82016-08-25 15:29:12 +010062
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;
68
69 while (n_left_from > 0)
70 {
Neale Ranns0bfe5d82016-08-25 15:29:12 +010071 vlib_get_next_frame (vm, node, next_index,
72 to_next, n_left_to_next);
73
Neale Ranns9ca18c62016-12-10 21:08:09 +000074 while (n_left_from >= 4 && n_left_to_next >= 2)
75 {
76 ip_adjacency_t * adj0;
77 mpls_unicast_header_t *hdr0;
78 vlib_buffer_t * p0;
79 u32 pi0, rw_len0, adj_index0, next0, error0;
80
81 ip_adjacency_t * adj1;
82 mpls_unicast_header_t *hdr1;
83 vlib_buffer_t * p1;
84 u32 pi1, rw_len1, adj_index1, next1, error1;
85
86 /* Prefetch next iteration. */
87 {
88 vlib_buffer_t * p2, * p3;
89
90 p2 = vlib_get_buffer (vm, from[2]);
91 p3 = vlib_get_buffer (vm, from[3]);
92
93 vlib_prefetch_buffer_header (p2, STORE);
94 vlib_prefetch_buffer_header (p3, STORE);
95
96 CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
97 CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
98 }
99
100 pi0 = to_next[0] = from[0];
101 pi1 = to_next[1] = from[1];
102
103 from += 2;
104 n_left_from -= 2;
105 to_next += 2;
106 n_left_to_next -= 2;
107
108 p0 = vlib_get_buffer (vm, pi0);
109 p1 = vlib_get_buffer (vm, pi1);
110
111 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
112 adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
113
114 /* We should never rewrite a pkt using the MISS adjacency */
115 ASSERT(adj_index0);
116 ASSERT(adj_index1);
117
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);
122
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));
126
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;
130
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));
143
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))
147 {
148 p0->current_data -= rw_len0;
149 p0->current_length += rw_len0;
150
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;
155
156 if (is_midchain)
157 {
158 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
159 }
160 }
161 else
162 {
163 error0 = IP4_ERROR_MTU_EXCEEDED;
164 next0 = MPLS_OUTPUT_NEXT_DROP;
165 }
166 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p1) <=
167 adj1[0].rewrite_header.max_l3_packet_bytes))
168 {
169 p1->current_data -= rw_len1;
170 p1->current_length += rw_len1;
171
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;
176
177 if (is_midchain)
178 {
179 adj1->sub_type.midchain.fixup_func(vm, adj1, p1);
180 }
181 }
182 else
183 {
184 error1 = IP4_ERROR_MTU_EXCEEDED;
185 next1 = MPLS_OUTPUT_NEXT_DROP;
186 }
187
188 p0->error = error_node->errors[error0];
189 p1->error = error_node->errors[error1];
190
191 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
192 {
193 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
194 p0, sizeof (*tr));
195 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
196 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
197 }
198 if (PREDICT_FALSE(p1->flags & VLIB_BUFFER_IS_TRACED))
199 {
200 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
201 p1, sizeof (*tr));
202 tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
203 tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
204 }
205
206 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
207 to_next, n_left_to_next,
208 pi0, pi1, next0, next1);
209 }
210
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100211 while (n_left_from > 0 && n_left_to_next > 0)
212 {
213 ip_adjacency_t * adj0;
214 mpls_unicast_header_t *hdr0;
215 vlib_buffer_t * p0;
216 u32 pi0, rw_len0, adj_index0, next0, error0;
217
218 pi0 = to_next[0] = from[0];
219
220 p0 = vlib_get_buffer (vm, pi0);
221
222 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
223
224 /* We should never rewrite a pkt using the MISS adjacency */
225 ASSERT(adj_index0);
226
227 adj0 = adj_get(adj_index0);
228 hdr0 = vlib_buffer_get_current (p0);
229
230 /* Guess we are only writing on simple Ethernet header. */
231 vnet_rewrite_one_header (adj0[0], hdr0,
232 sizeof (ethernet_header_t));
233
234 /* Update packet buffer attributes/set output interface. */
235 rw_len0 = adj0[0].rewrite_header.data_bytes;
236
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));
243
244 /* Check MTU of outgoing interface. */
Neale Ranns9ca18c62016-12-10 21:08:09 +0000245 if (PREDICT_TRUE(vlib_buffer_length_in_chain (vm, p0) <=
246 adj0[0].rewrite_header.max_l3_packet_bytes))
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100247 {
248 p0->current_data -= rw_len0;
249 p0->current_length += rw_len0;
250
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;
Neale Ranns9ca18c62016-12-10 21:08:09 +0000254 error0 = IP4_ERROR_NONE;
John Loaeb06f42016-10-15 17:45:35 -0400255
256 if (is_midchain)
257 {
258 adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
259 }
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100260 }
261 else
262 {
Neale Ranns9ca18c62016-12-10 21:08:09 +0000263 error0 = IP4_ERROR_MTU_EXCEEDED;
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100264 next0 = MPLS_OUTPUT_NEXT_DROP;
265 }
Neale Ranns9ca18c62016-12-10 21:08:09 +0000266 p0->error = error_node->errors[error0];
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100267
268 from += 1;
269 n_left_from -= 1;
270 to_next += 1;
271 n_left_to_next -= 1;
272
273 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
274 {
275 mpls_output_trace_t *tr = vlib_add_trace (vm, node,
276 p0, sizeof (*tr));
277 tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
278 tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
279 }
280
281 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
282 to_next, n_left_to_next,
283 pi0, next0);
284 }
285
286 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
287 }
288 vlib_node_increment_counter (vm, mpls_output_node.index,
289 MPLS_ERROR_PKTS_ENCAP,
290 from_frame->n_vectors);
291
292 return from_frame->n_vectors;
293}
294
295static char * mpls_error_strings[] = {
296#define mpls_error(n,s) s,
297#include "error.def"
298#undef mpls_error
299};
300
301static inline uword
302mpls_output (vlib_main_t * vm,
303 vlib_node_runtime_t * node,
304 vlib_frame_t * from_frame)
305{
John Loaeb06f42016-10-15 17:45:35 -0400306 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100307}
308
309VLIB_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,
316
317 .n_next_nodes = MPLS_OUTPUT_N_NEXT,
318 .next_nodes = {
319#define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
320 foreach_mpls_output_next
321#undef _
322 },
323
324 .format_trace = format_mpls_output_trace,
325};
326
327VLIB_NODE_FUNCTION_MULTIARCH (mpls_output_node, mpls_output)
328
329static inline uword
330mpls_midchain (vlib_main_t * vm,
331 vlib_node_runtime_t * node,
332 vlib_frame_t * from_frame)
333{
John Loaeb06f42016-10-15 17:45:35 -0400334 return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100335}
336
337VLIB_REGISTER_NODE (mpls_midchain_node) = {
John Loaeb06f42016-10-15 17:45:35 -0400338 .function = mpls_midchain,
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100339 .name = "mpls-midchain",
340 .vector_size = sizeof (u32),
341
342 .format_trace = format_mpls_output_trace,
343
344 .sibling_of = "mpls-output",
345};
346
347VLIB_NODE_FUNCTION_MULTIARCH (mpls_midchain_node, mpls_midchain)
348
349/**
350 * @brief Next index values from the MPLS incomplete adj node
351 */
352#define foreach_mpls_adj_incomplete_next \
353_(DROP, "error-drop") \
354_(IP4, "ip4-arp") \
355_(IP6, "ip6-discover-neighbor")
356
357typedef enum {
358#define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
359 foreach_mpls_adj_incomplete_next
360#undef _
361 MPLS_ADJ_INCOMPLETE_N_NEXT,
362} mpls_adj_incomplete_next_t;
363
364/**
365 * @brief A struct to hold tracing information for the MPLS label imposition
366 * node.
367 */
368typedef struct mpls_adj_incomplete_trace_t_
369{
370 u32 next;
371} mpls_adj_incomplete_trace_t;
372
373
374/**
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
379 * exception case.
380 */
381static inline uword
382mpls_adj_incomplete (vlib_main_t * vm,
383 vlib_node_runtime_t * node,
384 vlib_frame_t * from_frame)
385{
386 u32 n_left_from, next_index, * from, * to_next;
387
388 from = vlib_frame_vector_args (from_frame);
389 n_left_from = from_frame->n_vectors;
390 next_index = node->cached_next_index;
391
392 while (n_left_from > 0)
393 {
394 u32 n_left_to_next;
395
396 vlib_get_next_frame (vm, node, next_index,
397 to_next, n_left_to_next);
398
399 while (n_left_from > 0 && n_left_to_next > 0)
400 {
401 u32 pi0, next0, adj_index0;
402 ip_adjacency_t * adj0;
403 vlib_buffer_t * p0;
404
405 pi0 = to_next[0] = from[0];
406 p0 = vlib_get_buffer (vm, pi0);
407 from += 1;
408 n_left_from -= 1;
409 to_next += 1;
410 n_left_to_next -= 1;
411
412 adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
413 ASSERT(adj_index0);
414
415 adj0 = adj_get(adj_index0);
416
417 if (PREDICT_TRUE(FIB_PROTOCOL_IP4 == adj0->ia_nh_proto))
418 {
419 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
420 }
421 else
422 {
423 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
424 }
425
426 if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
427 {
428 mpls_adj_incomplete_trace_t *tr =
429 vlib_add_trace (vm, node, p0, sizeof (*tr));
430 tr->next = next0;
431 }
432
433 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
434 to_next, n_left_to_next,
435 pi0, next0);
436 }
437
438 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
439 }
440
441 return from_frame->n_vectors;
442}
443
444static u8 *
445format_mpls_adj_incomplete_trace (u8 * s, va_list * args)
446{
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;
450 uword indent;
451
452 t = va_arg (*args, mpls_adj_incomplete_trace_t *);
453 indent = format_get_indent (s);
454
455 s = format (s, "%Unext:%d",
456 format_white_space, indent,
457 t->next);
458 return (s);
459}
460
461VLIB_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,
469
470 .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
471 .next_nodes = {
472#define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
473 foreach_mpls_adj_incomplete_next
474#undef _
475 },
Neale Ranns0bfe5d82016-08-25 15:29:12 +0100476};
477
478VLIB_NODE_FUNCTION_MULTIARCH (mpls_adj_incomplete_node,
479 mpls_adj_incomplete)