2 * Copyright (c) 2015 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.
15 #include <vppinfra/error.h>
16 #include <vppinfra/hash.h>
17 #include <vnet/vnet.h>
18 #include <vnet/ip/ip.h>
19 #include <vnet/ethernet/ethernet.h>
20 #include <vnet/lisp-gpe/lisp_gpe.h>
22 /* Statistics (not really errors) */
23 #define foreach_lisp_gpe_encap_error \
24 _(ENCAPSULATED, "good packets encapsulated")
26 static char * lisp_gpe_encap_error_strings[] = {
27 #define _(sym,string) string,
28 foreach_lisp_gpe_encap_error
33 #define _(sym,str) LISP_GPE_ENCAP_ERROR_##sym,
34 foreach_lisp_gpe_encap_error
36 LISP_GPE_ENCAP_N_ERROR,
37 } lisp_gpe_encap_error_t;
40 LISP_GPE_ENCAP_NEXT_IP4_LOOKUP,
41 LISP_GPE_ENCAP_NEXT_DROP,
42 LISP_GPE_ENCAP_N_NEXT,
43 } lisp_gpe_encap_next_t;
47 } lisp_gpe_encap_trace_t;
49 u8 * format_lisp_gpe_encap_trace (u8 * s, va_list * args)
51 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
52 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
53 lisp_gpe_encap_trace_t * t
54 = va_arg (*args, lisp_gpe_encap_trace_t *);
56 s = format (s, "LISP-GPE-ENCAP: tunnel %d", t->tunnel_index);
60 #define foreach_fixed_header_offset \
64 lisp_gpe_encap (vlib_main_t * vm,
65 vlib_node_runtime_t * node,
66 vlib_frame_t * from_frame)
68 u32 n_left_from, next_index, * from, * to_next;
69 lisp_gpe_main_t * ngm = &lisp_gpe_main;
70 vnet_main_t * vnm = ngm->vnet_main;
71 u32 pkts_encapsulated = 0;
74 from = vlib_frame_vector_args (from_frame);
75 n_left_from = from_frame->n_vectors;
77 next_index = node->cached_next_index;
79 while (n_left_from > 0)
83 vlib_get_next_frame (vm, node, next_index,
84 to_next, n_left_to_next);
87 while (n_left_from >= 4 && n_left_to_next >= 2)
90 vlib_buffer_t * b0, * b1;
91 nsh_unicast_header_t * h0, * h1;
96 /* Prefetch next iteration. */
98 vlib_buffer_t * p2, * p3;
100 p2 = vlib_get_buffer (vm, from[2]);
101 p3 = vlib_get_buffer (vm, from[3]);
103 vlib_prefetch_buffer_header (p2, LOAD);
104 vlib_prefetch_buffer_header (p3, LOAD);
106 CLIB_PREFETCH (p2->data, 2*CLIB_CACHE_LINE_BYTES, LOAD);
107 CLIB_PREFETCH (p3->data, 2*CLIB_CACHE_LINE_BYTES, LOAD);
119 b0 = vlib_get_buffer (vm, bi0);
120 b1 = vlib_get_buffer (vm, bi1);
122 h0 = vlib_buffer_get_current (b0);
123 h1 = vlib_buffer_get_current (b1);
125 next0 = next1 = NSH_INPUT_NEXT_IP4_INPUT;
127 label0 = clib_net_to_host_u32 (h0->label_exp_s_ttl);
128 label1 = clib_net_to_host_u32 (h1->label_exp_s_ttl);
131 * Translate label contents into a fib index.
132 * This is a decent sanity check, and guarantees
133 * a sane FIB for the downstream lookup
135 label0 = vnet_nsh_uc_get_label (label0);
136 label1 = vnet_nsh_uc_get_label (label1);
138 /* If 2xlabels match, and match the 1-wide cache, use it */
139 if (label0 == label1 && rt->last_label == label0)
141 vnet_buffer(b0)->sw_if_index[VLIB_TX] = rt->last_fib_index;
142 vnet_buffer(b1)->sw_if_index[VLIB_TX] = rt->last_fib_index;
146 p0 = hash_get (rt->mm->fib_index_by_nsh_label, label0);
147 if (PREDICT_FALSE (p0 == 0))
149 next0 = NSH_INPUT_NEXT_DROP;
150 b0->error = node->errors[NSH_ERROR_BAD_LABEL];
153 vnet_buffer(b0)->sw_if_index[VLIB_TX] = p0[0];
155 p1 = hash_get (rt->mm->fib_index_by_nsh_label, label1);
156 if (PREDICT_FALSE (p1 == 0))
158 next1 = NSH_INPUT_NEXT_DROP;
159 b1->error = node->errors[NSH_ERROR_BAD_LABEL];
163 vnet_buffer(b1)->sw_if_index[VLIB_TX] = p1[0];
164 rt->last_fib_index = p1[0];
165 rt->last_label = label1;
169 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
171 nsh_rx_trace_t *tr = vlib_add_trace (vm, node,
173 tr->label_exp_s_ttl = label0;
175 if (PREDICT_FALSE(b1->flags & VLIB_BUFFER_IS_TRACED))
177 nsh_rx_trace_t *tr = vlib_add_trace (vm, node,
179 tr->label_exp_s_ttl = label1;
182 vlib_buffer_advance (b0, sizeof (*h0));
183 vlib_buffer_advance (b1, sizeof (*h1));
185 vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
186 to_next, n_left_to_next,
187 bi0, bi1, next0, next1);
191 while (n_left_from > 0 && n_left_to_next > 0)
195 u32 next0 = LISP_GPE_ENCAP_NEXT_IP4_LOOKUP;
196 vnet_hw_interface_t * hi0;
199 u64 * copy_src0, * copy_dst0;
200 u32 * copy_src_last0, * copy_dst_last0;
201 lisp_gpe_tunnel_t * t0;
212 b0 = vlib_get_buffer (vm, bi0);
215 hi0 = vnet_get_sup_hw_interface
216 (vnm, vnet_buffer(b0)->sw_if_index[VLIB_TX]);
218 t0 = pool_elt_at_index (ngm->tunnels, hi0->dev_instance);
220 ASSERT(vec_len(t0->rewrite) >= 24);
222 /* Apply the rewrite string. $$$$ vnet_rewrite? */
223 vlib_buffer_advance (b0, -(word)_vec_len(t0->rewrite));
225 ip0 = vlib_buffer_get_current(b0);
226 /* Copy the fixed header */
227 copy_dst0 = (u64 *) ip0;
228 copy_src0 = (u64 *) t0->rewrite;
230 ASSERT (sizeof (ip4_udp_lisp_gpe_header_t) == 36);
232 /* Copy first 32 octets 8-bytes at a time */
233 #define _(offs) copy_dst0[offs] = copy_src0[offs];
234 foreach_fixed_header_offset;
236 /* Last 4 octets. Hopefully gcc will be our friend */
237 copy_dst_last0 = (u32 *)(©_dst0[4]);
238 copy_src_last0 = (u32 *)(©_src0[4]);
240 copy_dst_last0[0] = copy_src_last0[0];
242 /* fix the <bleep>ing outer-IP checksum */
243 sum0 = ip0->checksum;
244 /* old_l0 always 0, see the rewrite setup */
246 clib_host_to_net_u16 (vlib_buffer_length_in_chain (vm, b0));
248 sum0 = ip_csum_update (sum0, old_l0, new_l0, ip4_header_t,
249 length /* changed member */);
250 ip0->checksum = ip_csum_fold (sum0);
251 ip0->length = new_l0;
254 udp0 = (udp_header_t *)(ip0+1);
255 new_l0 = clib_host_to_net_u16 (vlib_buffer_length_in_chain (vm, b0)
258 udp0->length = new_l0;
260 /* Reset to look up tunnel partner in the configured FIB */
261 vnet_buffer(b0)->sw_if_index[VLIB_TX] = t0->encap_fib_index;
262 pkts_encapsulated ++;
264 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
266 lisp_gpe_encap_trace_t *tr =
267 vlib_add_trace (vm, node, b0, sizeof (*tr));
268 tr->tunnel_index = t0 - ngm->tunnels;
270 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
271 to_next, n_left_to_next,
275 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
277 vlib_node_increment_counter (vm, node->node_index,
278 LISP_GPE_ENCAP_ERROR_ENCAPSULATED,
280 return from_frame->n_vectors;
283 VLIB_REGISTER_NODE (lisp_gpe_encap_node) = {
284 .function = lisp_gpe_encap,
285 .name = "lisp-gpe-encap",
286 .vector_size = sizeof (u32),
287 .format_trace = format_lisp_gpe_encap_trace,
288 .type = VLIB_NODE_TYPE_INTERNAL,
290 .n_errors = ARRAY_LEN(lisp_gpe_encap_error_strings),
291 .error_strings = lisp_gpe_encap_error_strings,
293 .n_next_nodes = LISP_GPE_ENCAP_N_NEXT,
296 [LISP_GPE_ENCAP_NEXT_IP4_LOOKUP] = "ip4-lookup",
297 [LISP_GPE_ENCAP_NEXT_DROP] = "error-drop",