2 * nsh_pop.c - nsh POP only processing
4 * Copyright (c) 2017 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 <vnet/vnet.h>
19 #include <vnet/plugin/plugin.h>
21 #include <vnet/gre/packet.h>
22 #include <vnet/vxlan/vxlan.h>
23 #include <vnet/vxlan-gpe/vxlan_gpe.h>
24 #include <vnet/l2/l2_classify.h>
26 #include <vlibapi/api.h>
27 #include <vlibmemory/api.h>
29 extern nsh_option_map_t * nsh_md2_lookup_option (u16 class, u8 type);
31 extern u8 * format_nsh_header (u8 * s, va_list * args);
32 extern u8 * format_nsh_node_map_trace (u8 * s, va_list * args);
33 extern u8 * format_nsh_pop_header (u8 * s, va_list * args);
34 extern u8 * format_nsh_pop_node_map_trace (u8 * s, va_list * args);
37 nsh_pop_inline (vlib_main_t * vm,
38 vlib_node_runtime_t * node,
39 vlib_frame_t * from_frame)
41 u32 n_left_from, next_index, *from, *to_next;
42 nsh_main_t * nm = &nsh_main;
44 from = vlib_frame_vector_args(from_frame);
45 n_left_from = from_frame->n_vectors;
47 next_index = node->cached_next_index;
49 while (n_left_from > 0)
53 vlib_get_next_frame(vm, node, next_index, to_next, n_left_to_next);
55 while (n_left_from >= 4 && n_left_to_next >= 2)
58 vlib_buffer_t * b0, *b1;
59 u32 next0 = NSH_NODE_NEXT_DROP, next1 = NSH_NODE_NEXT_DROP;
60 uword * entry0, *entry1;
61 nsh_base_header_t * hdr0 = 0, *hdr1 = 0;
62 u32 header_len0 = 0, header_len1 = 0;
63 u32 nsp_nsi0, nsp_nsi1;
65 nsh_map_t * map0 = 0, *map1 = 0;
67 /* Prefetch next iteration. */
69 vlib_buffer_t * p2, *p3;
71 p2 = vlib_get_buffer(vm, from[2]);
72 p3 = vlib_get_buffer(vm, from[3]);
74 vlib_prefetch_buffer_header(p2, LOAD);
75 vlib_prefetch_buffer_header(p3, LOAD);
77 CLIB_PREFETCH(p2->data, 2*CLIB_CACHE_LINE_BYTES, LOAD);
78 CLIB_PREFETCH(p3->data, 2*CLIB_CACHE_LINE_BYTES, LOAD);
93 b0 = vlib_get_buffer(vm, bi0);
94 b1 = vlib_get_buffer(vm, bi1);
95 hdr0 = vlib_buffer_get_current(b0);
96 nsp_nsi0 = hdr0->nsp_nsi;
97 header_len0 = hdr0->length * 4;
99 hdr1 = vlib_buffer_get_current(b1);
100 nsp_nsi1 = hdr1->nsp_nsi;
101 header_len1 = hdr1->length * 4;
103 /* Process packet 0 */
104 entry0 = hash_get_mem(nm->nsh_mapping_by_key, &nsp_nsi0);
105 if (PREDICT_FALSE(entry0 == 0))
107 error0 = NSH_NODE_ERROR_NO_MAPPING;
111 /* Entry should point to a mapping ...*/
112 map0 = pool_elt_at_index(nm->nsh_mappings, entry0[0]);
114 /* set up things for next node to transmit ie which node to handle it and where */
115 next0 = map0->next_node;
116 //vnet_buffer(b0)->sw_if_index[VLIB_TX] = map0->sw_if_index;
118 if(PREDICT_FALSE(map0->nsh_action == NSH_ACTION_POP))
121 if(PREDICT_FALSE(hdr0->md_type == 2))
123 if (PREDICT_FALSE(next0 == NSH_NODE_NEXT_DROP))
125 error0 = NSH_NODE_ERROR_INVALID_OPTIONS;
128 //vnet_buffer(b0)->sw_if_index[VLIB_RX] = map0->sw_if_index;
132 vlib_buffer_advance(b0, (word)header_len0);
136 entry0 = hash_get_mem(nm->nsh_entry_by_key, &map0->mapped_nsp_nsi);
137 if (PREDICT_FALSE(entry0 == 0))
139 error0 = NSH_NODE_ERROR_NO_ENTRY;
143 trace0: b0->error = error0 ? node->errors[error0] : 0;
145 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
147 nsh_input_trace_t *tr = vlib_add_trace(vm, node, b0, sizeof(*tr));
148 clib_memcpy_fast ( &(tr->trace_data), hdr0, (hdr0->length*4) );
151 /* Process packet 1 */
152 entry1 = hash_get_mem(nm->nsh_mapping_by_key, &nsp_nsi1);
153 if (PREDICT_FALSE(entry1 == 0))
155 error1 = NSH_NODE_ERROR_NO_MAPPING;
159 /* Entry should point to a mapping ...*/
160 map1 = pool_elt_at_index(nm->nsh_mappings, entry1[0]);
162 /* set up things for next node to transmit ie which node to handle it and where */
163 next1 = map1->next_node;
164 //vnet_buffer(b1)->sw_if_index[VLIB_TX] = map1->sw_if_index;
166 if(PREDICT_FALSE(map1->nsh_action == NSH_ACTION_POP))
169 if(PREDICT_FALSE(hdr1->md_type == 2))
171 if (PREDICT_FALSE(next1 == NSH_NODE_NEXT_DROP))
173 error1 = NSH_NODE_ERROR_INVALID_OPTIONS;
176 //vnet_buffer(b1)->sw_if_index[VLIB_RX] = map1->sw_if_index;
180 vlib_buffer_advance(b1, (word)header_len1);
184 entry1 = hash_get_mem(nm->nsh_entry_by_key, &map1->mapped_nsp_nsi);
185 if (PREDICT_FALSE(entry1 == 0))
187 error1 = NSH_NODE_ERROR_NO_ENTRY;
192 trace1: b1->error = error1 ? node->errors[error1] : 0;
194 if (PREDICT_FALSE(b1->flags & VLIB_BUFFER_IS_TRACED))
196 nsh_input_trace_t *tr = vlib_add_trace(vm, node, b1, sizeof(*tr));
197 clib_memcpy_fast ( &(tr->trace_data), hdr1, (hdr1->length*4) );
200 vlib_validate_buffer_enqueue_x2(vm, node, next_index, to_next,
201 n_left_to_next, bi0, bi1, next0, next1);
205 while (n_left_from > 0 && n_left_to_next > 0)
208 vlib_buffer_t * b0 = NULL;
209 u32 next0 = NSH_NODE_NEXT_DROP;
211 nsh_base_header_t * hdr0 = 0;
215 nsh_map_t * map0 = 0;
225 b0 = vlib_get_buffer(vm, bi0);
226 hdr0 = vlib_buffer_get_current(b0);
228 nsp_nsi0 = hdr0->nsp_nsi;
229 header_len0 = hdr0->length * 4;
231 entry0 = hash_get_mem(nm->nsh_mapping_by_key, &nsp_nsi0);
233 if (PREDICT_FALSE(entry0 == 0))
235 error0 = NSH_NODE_ERROR_NO_MAPPING;
239 /* Entry should point to a mapping ...*/
240 map0 = pool_elt_at_index(nm->nsh_mappings, entry0[0]);
243 /* set up things for next node to transmit ie which node to handle it and where */
244 next0 = map0->next_node;
245 //vnet_buffer(b0)->sw_if_index[VLIB_TX] = map0->sw_if_index;
247 if(PREDICT_FALSE(map0->nsh_action == NSH_ACTION_POP))
250 if(PREDICT_FALSE(hdr0->md_type == 2))
252 if (PREDICT_FALSE(next0 == NSH_NODE_NEXT_DROP))
254 error0 = NSH_NODE_ERROR_INVALID_OPTIONS;
257 //vnet_buffer(b0)->sw_if_index[VLIB_RX] = map0->sw_if_index;
261 vlib_buffer_advance(b0, (word)header_len0);
265 entry0 = hash_get_mem(nm->nsh_entry_by_key, &map0->mapped_nsp_nsi);
266 if (PREDICT_FALSE(entry0 == 0))
268 error0 = NSH_NODE_ERROR_NO_ENTRY;
272 trace00: b0->error = error0 ? node->errors[error0] : 0;
274 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
276 nsh_input_trace_t *tr = vlib_add_trace(vm, node, b0, sizeof(*tr));
277 clib_memcpy_fast ( &(tr->trace_data[0]), hdr0, (hdr0->length*4) );
280 vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next,
281 n_left_to_next, bi0, next0);
284 vlib_put_next_frame(vm, node, next_index, n_left_to_next);
288 return from_frame->n_vectors;
292 * @brief Graph processing dispatch function for NSH Input
299 * @return from_frame->n_vectors
302 VLIB_NODE_FN (nsh_pop_node) (vlib_main_t * vm, vlib_node_runtime_t * node,
303 vlib_frame_t * from_frame)
305 return nsh_pop_inline (vm, node, from_frame);
308 static char * nsh_pop_node_error_strings[] = {
309 #define _(sym,string) string,
310 foreach_nsh_node_error
314 /* register nsh-input node */
315 VLIB_REGISTER_NODE (nsh_pop_node) = {
317 .vector_size = sizeof (u32),
318 .format_trace = format_nsh_pop_node_map_trace,
319 .format_buffer = format_nsh_pop_header,
320 .type = VLIB_NODE_TYPE_INTERNAL,
322 .n_errors = ARRAY_LEN(nsh_pop_node_error_strings),
323 .error_strings = nsh_pop_node_error_strings,
325 .n_next_nodes = NSH_NODE_N_NEXT,
328 #define _(s,n) [NSH_NODE_NEXT_##s] = n,
329 foreach_nsh_node_next