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-gpe/vxlan_gpe.h>
23 #include <vnet/l2/l2_classify.h>
25 #include <vlibapi/api.h>
26 #include <vlibmemory/api.h>
28 extern nsh_option_map_t * nsh_md2_lookup_option (u16 class, u8 type);
30 extern u8 * format_nsh_header (u8 * s, va_list * args);
31 extern u8 * format_nsh_node_map_trace (u8 * s, va_list * args);
32 extern u8 * format_nsh_pop_header (u8 * s, va_list * args);
33 extern u8 * format_nsh_pop_node_map_trace (u8 * s, va_list * args);
36 nsh_pop_inline (vlib_main_t * vm,
37 vlib_node_runtime_t * node,
38 vlib_frame_t * from_frame)
40 u32 n_left_from, next_index, *from, *to_next;
41 nsh_main_t * nm = &nsh_main;
43 from = vlib_frame_vector_args(from_frame);
44 n_left_from = from_frame->n_vectors;
46 next_index = node->cached_next_index;
48 while (n_left_from > 0)
52 vlib_get_next_frame(vm, node, next_index, to_next, n_left_to_next);
54 while (n_left_from >= 4 && n_left_to_next >= 2)
57 vlib_buffer_t * b0, *b1;
58 u32 next0 = NSH_NODE_NEXT_DROP, next1 = NSH_NODE_NEXT_DROP;
59 uword * entry0, *entry1;
60 nsh_base_header_t * hdr0 = 0, *hdr1 = 0;
61 u32 header_len0 = 0, header_len1 = 0;
62 u32 nsp_nsi0, nsp_nsi1;
64 nsh_map_t * map0 = 0, *map1 = 0;
66 /* Prefetch next iteration. */
68 vlib_buffer_t * p2, *p3;
70 p2 = vlib_get_buffer(vm, from[2]);
71 p3 = vlib_get_buffer(vm, from[3]);
73 vlib_prefetch_buffer_header(p2, LOAD);
74 vlib_prefetch_buffer_header(p3, LOAD);
76 CLIB_PREFETCH(p2->data, 2*CLIB_CACHE_LINE_BYTES, LOAD);
77 CLIB_PREFETCH(p3->data, 2*CLIB_CACHE_LINE_BYTES, LOAD);
92 b0 = vlib_get_buffer(vm, bi0);
93 b1 = vlib_get_buffer(vm, bi1);
94 hdr0 = vlib_buffer_get_current(b0);
95 nsp_nsi0 = hdr0->nsp_nsi;
96 header_len0 = hdr0->length * 4;
98 hdr1 = vlib_buffer_get_current(b1);
99 nsp_nsi1 = hdr1->nsp_nsi;
100 header_len1 = hdr1->length * 4;
102 /* Process packet 0 */
103 entry0 = hash_get_mem(nm->nsh_mapping_by_key, &nsp_nsi0);
104 if (PREDICT_FALSE(entry0 == 0))
106 error0 = NSH_NODE_ERROR_NO_MAPPING;
110 /* Entry should point to a mapping ...*/
111 map0 = pool_elt_at_index(nm->nsh_mappings, entry0[0]);
113 /* set up things for next node to transmit ie which node to handle it and where */
114 next0 = map0->next_node;
115 //vnet_buffer(b0)->sw_if_index[VLIB_TX] = map0->sw_if_index;
117 if(PREDICT_FALSE(map0->nsh_action == NSH_ACTION_POP))
120 if(PREDICT_FALSE(hdr0->md_type == 2))
122 if (PREDICT_FALSE(next0 == NSH_NODE_NEXT_DROP))
124 error0 = NSH_NODE_ERROR_INVALID_OPTIONS;
127 //vnet_buffer(b0)->sw_if_index[VLIB_RX] = map0->sw_if_index;
131 vlib_buffer_advance(b0, (word)header_len0);
135 entry0 = hash_get_mem(nm->nsh_entry_by_key, &map0->mapped_nsp_nsi);
136 if (PREDICT_FALSE(entry0 == 0))
138 error0 = NSH_NODE_ERROR_NO_ENTRY;
142 trace0: b0->error = error0 ? node->errors[error0] : 0;
144 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
146 nsh_input_trace_t *tr = vlib_add_trace(vm, node, b0, sizeof(*tr));
147 clib_memcpy_fast ( &(tr->trace_data), hdr0, (hdr0->length*4) );
150 /* Process packet 1 */
151 entry1 = hash_get_mem(nm->nsh_mapping_by_key, &nsp_nsi1);
152 if (PREDICT_FALSE(entry1 == 0))
154 error1 = NSH_NODE_ERROR_NO_MAPPING;
158 /* Entry should point to a mapping ...*/
159 map1 = pool_elt_at_index(nm->nsh_mappings, entry1[0]);
161 /* set up things for next node to transmit ie which node to handle it and where */
162 next1 = map1->next_node;
163 //vnet_buffer(b1)->sw_if_index[VLIB_TX] = map1->sw_if_index;
165 if(PREDICT_FALSE(map1->nsh_action == NSH_ACTION_POP))
168 if(PREDICT_FALSE(hdr1->md_type == 2))
170 if (PREDICT_FALSE(next1 == NSH_NODE_NEXT_DROP))
172 error1 = NSH_NODE_ERROR_INVALID_OPTIONS;
175 //vnet_buffer(b1)->sw_if_index[VLIB_RX] = map1->sw_if_index;
179 vlib_buffer_advance(b1, (word)header_len1);
183 entry1 = hash_get_mem(nm->nsh_entry_by_key, &map1->mapped_nsp_nsi);
184 if (PREDICT_FALSE(entry1 == 0))
186 error1 = NSH_NODE_ERROR_NO_ENTRY;
191 trace1: b1->error = error1 ? node->errors[error1] : 0;
193 if (PREDICT_FALSE(b1->flags & VLIB_BUFFER_IS_TRACED))
195 nsh_input_trace_t *tr = vlib_add_trace(vm, node, b1, sizeof(*tr));
196 clib_memcpy_fast ( &(tr->trace_data), hdr1, (hdr1->length*4) );
199 vlib_validate_buffer_enqueue_x2(vm, node, next_index, to_next,
200 n_left_to_next, bi0, bi1, next0, next1);
204 while (n_left_from > 0 && n_left_to_next > 0)
207 vlib_buffer_t * b0 = NULL;
208 u32 next0 = NSH_NODE_NEXT_DROP;
210 nsh_base_header_t * hdr0 = 0;
214 nsh_map_t * map0 = 0;
224 b0 = vlib_get_buffer(vm, bi0);
225 hdr0 = vlib_buffer_get_current(b0);
227 nsp_nsi0 = hdr0->nsp_nsi;
228 header_len0 = hdr0->length * 4;
230 entry0 = hash_get_mem(nm->nsh_mapping_by_key, &nsp_nsi0);
232 if (PREDICT_FALSE(entry0 == 0))
234 error0 = NSH_NODE_ERROR_NO_MAPPING;
238 /* Entry should point to a mapping ...*/
239 map0 = pool_elt_at_index(nm->nsh_mappings, entry0[0]);
242 /* set up things for next node to transmit ie which node to handle it and where */
243 next0 = map0->next_node;
244 //vnet_buffer(b0)->sw_if_index[VLIB_TX] = map0->sw_if_index;
246 if(PREDICT_FALSE(map0->nsh_action == NSH_ACTION_POP))
249 if(PREDICT_FALSE(hdr0->md_type == 2))
251 if (PREDICT_FALSE(next0 == NSH_NODE_NEXT_DROP))
253 error0 = NSH_NODE_ERROR_INVALID_OPTIONS;
256 //vnet_buffer(b0)->sw_if_index[VLIB_RX] = map0->sw_if_index;
260 vlib_buffer_advance(b0, (word)header_len0);
264 entry0 = hash_get_mem(nm->nsh_entry_by_key, &map0->mapped_nsp_nsi);
265 if (PREDICT_FALSE(entry0 == 0))
267 error0 = NSH_NODE_ERROR_NO_ENTRY;
271 trace00: b0->error = error0 ? node->errors[error0] : 0;
273 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
275 nsh_input_trace_t *tr = vlib_add_trace(vm, node, b0, sizeof(*tr));
276 clib_memcpy_fast ( &(tr->trace_data[0]), hdr0, (hdr0->length*4) );
279 vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next,
280 n_left_to_next, bi0, next0);
283 vlib_put_next_frame(vm, node, next_index, n_left_to_next);
287 return from_frame->n_vectors;
291 * @brief Graph processing dispatch function for NSH Input
298 * @return from_frame->n_vectors
301 VLIB_NODE_FN (nsh_pop_node) (vlib_main_t * vm, vlib_node_runtime_t * node,
302 vlib_frame_t * from_frame)
304 return nsh_pop_inline (vm, node, from_frame);
307 static char * nsh_pop_node_error_strings[] = {
308 #define _(sym,string) string,
309 foreach_nsh_node_error
313 /* register nsh-input node */
314 VLIB_REGISTER_NODE (nsh_pop_node) = {
316 .vector_size = sizeof (u32),
317 .format_trace = format_nsh_pop_node_map_trace,
318 .format_buffer = format_nsh_pop_header,
319 .type = VLIB_NODE_TYPE_INTERNAL,
321 .n_errors = ARRAY_LEN(nsh_pop_node_error_strings),
322 .error_strings = nsh_pop_node_error_strings,
324 .n_next_nodes = NSH_NODE_N_NEXT,
327 #define _(s,n) [NSH_NODE_NEXT_##s] = n,
328 foreach_nsh_node_next