2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
17 * @brief L2 LISP-GPE decap code.
20 #include <vlib/vlib.h>
21 #include <vnet/pg/pg.h>
22 #include <vnet/lisp-gpe/lisp_gpe.h>
30 } lisp_gpe_rx_trace_t;
33 format_lisp_gpe_rx_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 lisp_gpe_rx_trace_t *t = va_arg (*args, lisp_gpe_rx_trace_t *);
39 if (t->tunnel_index != ~0)
41 s = format (s, "LISP-GPE: tunnel %d next %d error %d", t->tunnel_index,
42 t->next_index, t->error);
46 s = format (s, "LISP-GPE: no tunnel next %d error %d\n", t->next_index,
49 s = format (s, "\n %U", format_lisp_gpe_header_with_length, &t->h,
50 (u32) sizeof (t->h) /* max size */ );
54 static u32 next_proto_to_next_index[LISP_GPE_NEXT_PROTOS] = {
55 LISP_GPE_INPUT_NEXT_DROP,
56 LISP_GPE_INPUT_NEXT_IP4_INPUT,
57 LISP_GPE_INPUT_NEXT_IP6_INPUT,
58 LISP_GPE_INPUT_NEXT_L2_INPUT,
59 LISP_GPE_INPUT_NEXT_DROP
63 next_protocol_to_next_index (lisp_gpe_header_t * lgh, u8 * next_header)
66 if (PREDICT_TRUE ((lgh->flags & LISP_GPE_FLAGS_P)
67 && lgh->next_protocol < LISP_GPE_NEXT_PROTOS))
68 return next_proto_to_next_index[lgh->next_protocol];
69 /* legacy lisp router */
70 else if ((lgh->flags & LISP_GPE_FLAGS_P) == 0)
72 ip4_header_t *iph = (ip4_header_t *) next_header;
73 if ((iph->ip_version_and_header_length & 0xF0) == 0x40)
74 return LISP_GPE_INPUT_NEXT_IP4_INPUT;
75 else if ((iph->ip_version_and_header_length & 0xF0) == 0x60)
76 return LISP_GPE_INPUT_NEXT_IP6_INPUT;
78 return LISP_GPE_INPUT_NEXT_DROP;
81 return LISP_GPE_INPUT_NEXT_DROP;
84 always_inline tunnel_lookup_t *
85 next_index_to_iface (lisp_gpe_main_t * lgm, u32 next_index)
87 if (LISP_GPE_INPUT_NEXT_IP4_INPUT == next_index
88 || LISP_GPE_INPUT_NEXT_IP6_INPUT == next_index)
89 return &lgm->l3_ifaces;
90 else if (LISP_GPE_INPUT_NEXT_L2_INPUT == next_index)
91 return &lgm->l2_ifaces;
92 clib_warning ("next_index not associated to an interface!");
96 static_always_inline void
97 incr_decap_stats (vnet_main_t * vnm, u32 cpu_index, u32 length,
98 u32 sw_if_index, u32 * last_sw_if_index, u32 * n_packets,
101 vnet_interface_main_t *im;
103 if (PREDICT_TRUE (sw_if_index == *last_sw_if_index))
110 if (PREDICT_TRUE (*last_sw_if_index != ~0))
112 im = &vnm->interface_main;
114 vlib_increment_combined_counter (im->combined_sw_if_counters +
115 VNET_INTERFACE_COUNTER_RX,
116 cpu_index, *last_sw_if_index,
117 *n_packets, *n_bytes);
119 *last_sw_if_index = sw_if_index;
126 * @brief LISP-GPE decap dispatcher.
127 * @node lisp_gpe_input_inline
129 * LISP-GPE decap dispatcher.
131 * Decaps IP-UDP-LISP-GPE header and based on the next protocol and in the
132 * GPE header and the vni decides the next node to forward the packet to.
134 * @param[in] vm vlib_main_t corresponding to current thread.
135 * @param[in] node vlib_node_runtime_t data for this node.
136 * @param[in] frame vlib_frame_t whose contents should be dispatched.
138 * @return number of vectors in frame.
141 lisp_gpe_input_inline (vlib_main_t * vm, vlib_node_runtime_t * node,
142 vlib_frame_t * from_frame, u8 is_v4)
144 u32 n_left_from, next_index, *from, *to_next, cpu_index;
145 u32 n_bytes = 0, n_packets = 0, last_sw_if_index = ~0, drops = 0;
146 lisp_gpe_main_t *lgm = vnet_lisp_gpe_get_main ();
148 cpu_index = os_get_cpu_number ();
149 from = vlib_frame_vector_args (from_frame);
150 n_left_from = from_frame->n_vectors;
152 next_index = node->cached_next_index;
154 while (n_left_from > 0)
158 vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
160 while (n_left_from >= 4 && n_left_to_next >= 2)
163 vlib_buffer_t *b0, *b1;
164 ip4_udp_lisp_gpe_header_t *iul4_0, *iul4_1;
165 ip6_udp_lisp_gpe_header_t *iul6_0, *iul6_1;
166 lisp_gpe_header_t *lh0, *lh1;
167 u32 next0, next1, error0, error1;
169 tunnel_lookup_t *tl0, *tl1;
171 /* Prefetch next iteration. */
173 vlib_buffer_t *p2, *p3;
175 p2 = vlib_get_buffer (vm, from[2]);
176 p3 = vlib_get_buffer (vm, from[3]);
178 vlib_prefetch_buffer_header (p2, LOAD);
179 vlib_prefetch_buffer_header (p3, LOAD);
181 CLIB_PREFETCH (p2->data, 2 * CLIB_CACHE_LINE_BYTES, LOAD);
182 CLIB_PREFETCH (p3->data, 2 * CLIB_CACHE_LINE_BYTES, LOAD);
194 b0 = vlib_get_buffer (vm, bi0);
195 b1 = vlib_get_buffer (vm, bi1);
197 /* udp leaves current_data pointing at the lisp header */
200 vlib_buffer_advance (b0,
201 -(word) (sizeof (udp_header_t) +
202 sizeof (ip4_header_t)));
203 vlib_buffer_advance (b1,
204 -(word) (sizeof (udp_header_t) +
205 sizeof (ip4_header_t)));
207 iul4_0 = vlib_buffer_get_current (b0);
208 iul4_1 = vlib_buffer_get_current (b1);
210 /* pop (ip, udp, lisp-gpe) */
211 vlib_buffer_advance (b0, sizeof (*iul4_0));
212 vlib_buffer_advance (b1, sizeof (*iul4_1));
219 vlib_buffer_advance (b0,
220 -(word) (sizeof (udp_header_t) +
221 sizeof (ip6_header_t)));
222 vlib_buffer_advance (b1,
223 -(word) (sizeof (udp_header_t) +
224 sizeof (ip6_header_t)));
226 iul6_0 = vlib_buffer_get_current (b0);
227 iul6_1 = vlib_buffer_get_current (b1);
229 /* pop (ip, udp, lisp-gpe) */
230 vlib_buffer_advance (b0, sizeof (*iul6_0));
231 vlib_buffer_advance (b1, sizeof (*iul6_1));
237 /* determine next_index from lisp-gpe header */
238 next0 = next_protocol_to_next_index (lh0,
239 vlib_buffer_get_current (b0));
240 next1 = next_protocol_to_next_index (lh1,
241 vlib_buffer_get_current (b1));
243 /* determine if tunnel is l2 or l3 */
244 tl0 = next_index_to_iface (lgm, next0);
245 tl1 = next_index_to_iface (lgm, next1);
247 /* map iid/vni to lisp-gpe sw_if_index which is used by ipx_input to
248 * decide the rx vrf and the input features to be applied */
249 si0 = hash_get (tl0->sw_if_index_by_vni,
250 clib_net_to_host_u32 (lh0->iid));
251 si1 = hash_get (tl1->sw_if_index_by_vni,
252 clib_net_to_host_u32 (lh1->iid));
255 /* Required to make the l2 tag push / pop code work on l2 subifs */
256 vnet_update_l2_len (b0);
257 vnet_update_l2_len (b1);
261 incr_decap_stats (lgm->vnet_main, cpu_index,
262 vlib_buffer_length_in_chain (vm, b0), si0[0],
263 &last_sw_if_index, &n_packets, &n_bytes);
264 vnet_buffer (b0)->sw_if_index[VLIB_RX] = si0[0];
269 next0 = LISP_GPE_INPUT_NEXT_DROP;
270 error0 = LISP_GPE_ERROR_NO_TUNNEL;
276 incr_decap_stats (lgm->vnet_main, cpu_index,
277 vlib_buffer_length_in_chain (vm, b1), si1[0],
278 &last_sw_if_index, &n_packets, &n_bytes);
279 vnet_buffer (b1)->sw_if_index[VLIB_RX] = si1[0];
284 next1 = LISP_GPE_INPUT_NEXT_DROP;
285 error1 = LISP_GPE_ERROR_NO_TUNNEL;
289 b0->error = error0 ? node->errors[error0] : 0;
290 b1->error = error1 ? node->errors[error1] : 0;
292 if (PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
294 lisp_gpe_rx_trace_t *tr = vlib_add_trace (vm, node, b0,
296 tr->next_index = next0;
301 if (PREDICT_FALSE (b1->flags & VLIB_BUFFER_IS_TRACED))
303 lisp_gpe_rx_trace_t *tr = vlib_add_trace (vm, node, b1,
305 tr->next_index = next1;
310 vlib_validate_buffer_enqueue_x2 (vm, node, next_index, to_next,
311 n_left_to_next, bi0, bi1, next0,
315 while (n_left_from > 0 && n_left_to_next > 0)
320 ip4_udp_lisp_gpe_header_t *iul4_0;
321 ip6_udp_lisp_gpe_header_t *iul6_0;
322 lisp_gpe_header_t *lh0;
325 tunnel_lookup_t *tl0;
334 b0 = vlib_get_buffer (vm, bi0);
336 /* udp leaves current_data pointing at the lisp header
337 * TODO: there's no difference in processing between v4 and v6
338 * encapsulated packets so the code should be simplified if ip header
339 * info is not going to be used for dp smrs/dpsec */
342 vlib_buffer_advance (b0,
343 -(word) (sizeof (udp_header_t) +
344 sizeof (ip4_header_t)));
346 iul4_0 = vlib_buffer_get_current (b0);
348 /* pop (ip, udp, lisp-gpe) */
349 vlib_buffer_advance (b0, sizeof (*iul4_0));
355 vlib_buffer_advance (b0,
356 -(word) (sizeof (udp_header_t) +
357 sizeof (ip6_header_t)));
359 iul6_0 = vlib_buffer_get_current (b0);
361 /* pop (ip, udp, lisp-gpe) */
362 vlib_buffer_advance (b0, sizeof (*iul6_0));
367 /* TODO if security is to be implemented, something similar to RPF,
368 * probably we'd like to check that the peer is allowed to send us
369 * packets. For this, we should use the tunnel table OR check that
370 * we have a mapping for the source eid and that the outer source of
371 * the packet is one of its locators */
373 /* determine next_index from lisp-gpe header */
374 next0 = next_protocol_to_next_index (lh0,
375 vlib_buffer_get_current (b0));
377 /* determine if tunnel is l2 or l3 */
378 tl0 = next_index_to_iface (lgm, next0);
380 /* map iid/vni to lisp-gpe sw_if_index which is used by ipx_input to
381 * decide the rx vrf and the input features to be applied.
382 * NOTE: vni uses only the first 24 bits */
383 si0 = hash_get (tl0->sw_if_index_by_vni,
384 clib_net_to_host_u32 (lh0->iid << 8));
386 /* Required to make the l2 tag push / pop code work on l2 subifs */
387 vnet_update_l2_len (b0);
391 incr_decap_stats (lgm->vnet_main, cpu_index,
392 vlib_buffer_length_in_chain (vm, b0), si0[0],
393 &last_sw_if_index, &n_packets, &n_bytes);
394 vnet_buffer (b0)->sw_if_index[VLIB_RX] = si0[0];
399 next0 = LISP_GPE_INPUT_NEXT_DROP;
400 error0 = LISP_GPE_ERROR_NO_TUNNEL;
404 /* TODO error handling if security is implemented */
405 b0->error = error0 ? node->errors[error0] : 0;
407 if (PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
409 lisp_gpe_rx_trace_t *tr = vlib_add_trace (vm, node, b0,
411 tr->next_index = next0;
416 vlib_validate_buffer_enqueue_x1 (vm, node, next_index, to_next,
417 n_left_to_next, bi0, next0);
420 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
423 /* flush iface stats */
424 incr_decap_stats (lgm->vnet_main, cpu_index, 0, ~0, &last_sw_if_index,
425 &n_packets, &n_bytes);
426 vlib_node_increment_counter (vm, lisp_gpe_ip4_input_node.index,
427 LISP_GPE_ERROR_NO_TUNNEL, drops);
428 return from_frame->n_vectors;
432 lisp_gpe_ip4_input (vlib_main_t * vm, vlib_node_runtime_t * node,
433 vlib_frame_t * from_frame)
435 return lisp_gpe_input_inline (vm, node, from_frame, 1);
439 lisp_gpe_ip6_input (vlib_main_t * vm, vlib_node_runtime_t * node,
440 vlib_frame_t * from_frame)
442 return lisp_gpe_input_inline (vm, node, from_frame, 0);
445 static char *lisp_gpe_ip4_input_error_strings[] = {
446 #define lisp_gpe_error(n,s) s,
447 #include <vnet/lisp-gpe/lisp_gpe_error.def>
448 #undef lisp_gpe_error
452 VLIB_REGISTER_NODE (lisp_gpe_ip4_input_node) = {
453 .function = lisp_gpe_ip4_input,
454 .name = "lisp-gpe-ip4-input",
455 /* Takes a vector of packets. */
456 .vector_size = sizeof (u32),
457 .n_next_nodes = LISP_GPE_INPUT_N_NEXT,
459 #define _(s,n) [LISP_GPE_INPUT_NEXT_##s] = n,
460 foreach_lisp_gpe_ip_input_next
464 .n_errors = ARRAY_LEN (lisp_gpe_ip4_input_error_strings),
465 .error_strings = lisp_gpe_ip4_input_error_strings,
467 .format_buffer = format_lisp_gpe_header_with_length,
468 .format_trace = format_lisp_gpe_rx_trace,
469 // $$$$ .unformat_buffer = unformat_lisp_gpe_header,
474 VLIB_REGISTER_NODE (lisp_gpe_ip6_input_node) = {
475 .function = lisp_gpe_ip6_input,
476 .name = "lisp-gpe-ip6-input",
477 /* Takes a vector of packets. */
478 .vector_size = sizeof (u32),
479 .n_next_nodes = LISP_GPE_INPUT_N_NEXT,
481 #define _(s,n) [LISP_GPE_INPUT_NEXT_##s] = n,
482 foreach_lisp_gpe_ip_input_next
486 .n_errors = ARRAY_LEN (lisp_gpe_ip4_input_error_strings),
487 .error_strings = lisp_gpe_ip4_input_error_strings,
489 .format_buffer = format_lisp_gpe_header_with_length,
490 .format_trace = format_lisp_gpe_rx_trace,
491 // $$$$ .unformat_buffer = unformat_lisp_gpe_header,
496 * fd.io coding-style-patch-verification: ON
499 * eval: (c-set-style "gnu")