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.
16 * ppp_node.c: ppp packet processing
18 * Copyright (c) 2010 Eliot Dresselhaus
20 * Permission is hereby granted, free of charge, to any person obtaining
21 * a copy of this software and associated documentation files (the
22 * "Software"), to deal in the Software without restriction, including
23 * without limitation the rights to use, copy, modify, merge, publish,
24 * distribute, sublicense, and/or sell copies of the Software, and to
25 * permit persons to whom the Software is furnished to do so, subject to
26 * the following conditions:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
31 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
40 #include <vlib/vlib.h>
41 #include <vnet/pg/pg.h>
42 #include <vnet/ppp/ppp.h>
43 #include <vppinfra/sparse_vec.h>
45 #define foreach_ppp_input_next \
46 _ (PUNT, "error-punt") \
47 _ (DROP, "error-drop")
50 #define _(s,n) PPP_INPUT_NEXT_##s,
51 foreach_ppp_input_next
60 static u8 * format_ppp_input_trace (u8 * s, va_list * va)
62 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*va, vlib_main_t *);
63 CLIB_UNUSED (vlib_node_t * node) = va_arg (*va, vlib_node_t *);
64 ppp_input_trace_t * t = va_arg (*va, ppp_input_trace_t *);
66 s = format (s, "%U", format_ppp_header, t->packet_data);
72 /* Sparse vector mapping ppp protocol in network byte order
74 u16 * next_by_protocol;
76 u32 * sparse_index_by_next_index;
77 } ppp_input_runtime_t;
80 ppp_input (vlib_main_t * vm,
81 vlib_node_runtime_t * node,
82 vlib_frame_t * from_frame)
84 ppp_input_runtime_t * rt = (void *) node->runtime_data;
85 u32 n_left_from, next_index, i_next, * from, * to_next;
87 from = vlib_frame_vector_args (from_frame);
88 n_left_from = from_frame->n_vectors;
90 if (node->flags & VLIB_NODE_FLAG_TRACE)
91 vlib_trace_frame_buffers_only (vm, node,
95 sizeof (ppp_input_trace_t));
97 next_index = node->cached_next_index;
98 i_next = vec_elt (rt->sparse_index_by_next_index, next_index);
100 while (n_left_from > 0)
104 vlib_get_next_frame (vm, node, next_index,
105 to_next, n_left_to_next);
107 while (n_left_from >= 4 && n_left_to_next >= 2)
110 vlib_buffer_t * b0, * b1;
111 ppp_header_t * h0, * h1;
112 u32 i0, i1, protocol0, protocol1, enqueue_code;
114 /* Prefetch next iteration. */
116 vlib_buffer_t * p2, * p3;
118 p2 = vlib_get_buffer (vm, from[2]);
119 p3 = vlib_get_buffer (vm, from[3]);
121 vlib_prefetch_buffer_header (p2, LOAD);
122 vlib_prefetch_buffer_header (p3, LOAD);
124 CLIB_PREFETCH (p2->data, sizeof (h0[0]), LOAD);
125 CLIB_PREFETCH (p3->data, sizeof (h1[0]), LOAD);
137 b0 = vlib_get_buffer (vm, bi0);
138 b1 = vlib_get_buffer (vm, bi1);
140 h0 = (void *) (b0->data + b0->current_data);
141 h1 = (void *) (b1->data + b1->current_data);
143 b0->current_data += sizeof (h0[0]);
144 b1->current_data += sizeof (h1[0]);
146 b0->current_length -= sizeof (h0[0]);
147 b1->current_length -= sizeof (h1[0]);
149 /* Index sparse array with network byte order. */
150 protocol0 = h0->protocol;
151 protocol1 = h1->protocol;
152 sparse_vec_index2 (rt->next_by_protocol, protocol0, protocol1, &i0, &i1);
154 b0->error = node->errors[i0 == SPARSE_VEC_INVALID_INDEX ? PPP_ERROR_UNKNOWN_PROTOCOL : PPP_ERROR_NONE];
155 b1->error = node->errors[i1 == SPARSE_VEC_INVALID_INDEX ? PPP_ERROR_UNKNOWN_PROTOCOL : PPP_ERROR_NONE];
157 enqueue_code = (i0 != i_next) + 2*(i1 != i_next);
159 if (PREDICT_FALSE (enqueue_code != 0))
161 switch (enqueue_code)
168 vlib_set_next_frame_buffer (vm, node, vec_elt (rt->next_by_protocol, i0), bi0);
175 vlib_set_next_frame_buffer (vm, node, vec_elt (rt->next_by_protocol, i1), bi1);
182 vlib_set_next_frame_buffer (vm, node, vec_elt (rt->next_by_protocol, i0), bi0);
183 vlib_set_next_frame_buffer (vm, node, vec_elt (rt->next_by_protocol, i1), bi1);
186 vlib_put_next_frame (vm, node, next_index,
189 next_index = vec_elt (rt->next_by_protocol, i_next);
190 vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
196 while (n_left_from > 0 && n_left_to_next > 0)
210 b0 = vlib_get_buffer (vm, bi0);
212 h0 = (void *) (b0->data + b0->current_data);
214 b0->current_data += sizeof (h0[0]);
215 b0->current_length -= sizeof (h0[0]);
217 protocol0 = h0->protocol;
218 i0 = sparse_vec_index (rt->next_by_protocol, protocol0);
220 b0->error = node->errors[i0 == SPARSE_VEC_INVALID_INDEX ? PPP_ERROR_UNKNOWN_PROTOCOL : PPP_ERROR_NONE];
222 /* Sent packet to wrong next? */
223 if (PREDICT_FALSE (i0 != i_next))
225 /* Return old frame; remove incorrectly enqueued packet. */
226 vlib_put_next_frame (vm, node, next_index, n_left_to_next + 1);
228 /* Send to correct next. */
230 next_index = vec_elt (rt->next_by_protocol, i_next);
231 vlib_get_next_frame (vm, node, next_index,
232 to_next, n_left_to_next);
239 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
242 return from_frame->n_vectors;
245 static char * ppp_error_strings[] = {
246 #define ppp_error(n,s) s,
251 VLIB_REGISTER_NODE (ppp_input_node) = {
252 .function = ppp_input,
254 /* Takes a vector of packets. */
255 .vector_size = sizeof (u32),
257 .runtime_data_bytes = sizeof (ppp_input_runtime_t),
259 .n_errors = PPP_N_ERROR,
260 .error_strings = ppp_error_strings,
262 .n_next_nodes = PPP_INPUT_N_NEXT,
264 #define _(s,n) [PPP_INPUT_NEXT_##s] = n,
265 foreach_ppp_input_next
269 .format_buffer = format_ppp_header_with_length,
270 .format_trace = format_ppp_input_trace,
271 .unformat_buffer = unformat_ppp_header,
274 static clib_error_t * ppp_input_init (vlib_main_t * vm)
276 ppp_input_runtime_t * rt;
279 clib_error_t * error = vlib_call_init_function (vm, ppp_init);
281 clib_error_report (error);
284 ppp_setup_node (vm, ppp_input_node.index);
286 rt = vlib_node_get_runtime_data (vm, ppp_input_node.index);
288 rt->next_by_protocol = sparse_vec_new
289 (/* elt bytes */ sizeof (rt->next_by_protocol[0]),
290 /* bits in index */ BITS (((ppp_header_t *) 0)->protocol));
292 vec_validate (rt->sparse_index_by_next_index, PPP_INPUT_NEXT_DROP);
293 vec_validate (rt->sparse_index_by_next_index, PPP_INPUT_NEXT_PUNT);
294 rt->sparse_index_by_next_index[PPP_INPUT_NEXT_DROP]
295 = SPARSE_VEC_INVALID_INDEX;
296 rt->sparse_index_by_next_index[PPP_INPUT_NEXT_PUNT]
297 = SPARSE_VEC_INVALID_INDEX;
302 VLIB_INIT_FUNCTION (ppp_input_init);
305 ppp_register_input_protocol (vlib_main_t * vm,
306 ppp_protocol_t protocol,
309 ppp_main_t * em = &ppp_main;
310 ppp_protocol_info_t * pi;
311 ppp_input_runtime_t * rt;
316 clib_error_t * error = vlib_call_init_function (vm, ppp_input_init);
318 clib_error_report (error);
321 pi = ppp_get_protocol_info (em, protocol);
322 pi->node_index = node_index;
323 pi->next_index = vlib_node_add_next (vm,
324 ppp_input_node.index,
327 /* Setup ppp protocol -> next index sparse vector mapping. */
328 rt = vlib_node_get_runtime_data (vm, ppp_input_node.index);
329 n = sparse_vec_validate (rt->next_by_protocol, clib_host_to_net_u16 (protocol));
330 n[0] = pi->next_index;
332 /* Rebuild next index -> sparse index inverse mapping when sparse vector
334 vec_validate (rt->sparse_index_by_next_index, pi->next_index);
335 for (i = 1; i < vec_len (rt->next_by_protocol); i++)
336 rt->sparse_index_by_next_index[rt->next_by_protocol[i]] = i;