blob: 2a10225eb7ad83d78055e6a4d0e7ba829d6ec01c [file] [log] [blame]
Neale Ranns22e1f1d2019-03-01 15:53:11 +00001/*
2 * drop.c - Punt and drop nodes
3 *
4 * Copyright (c) 2015 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:
8 *
9 * http://www.apache.org/licenses/LICENSE-2.0
10 *
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.
16 */
17
18#include <vlib/vlib.h>
Damjan Marion4c276f02021-11-06 13:17:31 +010019#include <vppinfra/vector/count_equal.h>
Neale Ranns22e1f1d2019-03-01 15:53:11 +000020
21typedef enum
22{
23 ERROR_DISPOSITION_DROP,
24 ERROR_DISPOSITION_PUNT,
25 ERROR_N_DISPOSITION,
26} error_disposition_t;
27
28static u8 *
29validate_error (vlib_main_t * vm, vlib_error_t * e, u32 index)
30{
Dave Barach687c9022019-07-23 10:22:31 -040031 uword node_index = vlib_error_get_node (&vm->node_main, e[0]);
32 uword code = vlib_error_get_code (&vm->node_main, e[0]);
Neale Ranns22e1f1d2019-03-01 15:53:11 +000033 vlib_node_t *n;
34
35 if (node_index >= vec_len (vm->node_main.nodes))
36 return format (0, "[%d], node index out of range 0x%x, error 0x%x",
37 index, node_index, e[0]);
38
39 n = vlib_get_node (vm, node_index);
40 if (code >= n->n_errors)
41 return format (0, "[%d], code %d out of range for node %v",
42 index, code, n->name);
43
44 return 0;
45}
46
47static u8 *
48validate_error_frame (vlib_main_t * vm,
49 vlib_node_runtime_t * node, vlib_frame_t * f)
50{
51 u32 *buffers = vlib_frame_vector_args (f);
52 vlib_buffer_t *b;
53 u8 *msg = 0;
54 uword i;
55
56 for (i = 0; i < f->n_vectors; i++)
57 {
58 b = vlib_get_buffer (vm, buffers[i]);
59 msg = validate_error (vm, &b->error, i);
60 if (msg)
61 return msg;
62 }
63
64 return msg;
65}
66
67always_inline u32
68counter_index (vlib_main_t * vm, vlib_error_t e)
69{
70 vlib_node_t *n;
71 u32 ci, ni;
72
Dave Barach687c9022019-07-23 10:22:31 -040073 ni = vlib_error_get_node (&vm->node_main, e);
Neale Ranns22e1f1d2019-03-01 15:53:11 +000074 n = vlib_get_node (vm, ni);
75
Dave Barach687c9022019-07-23 10:22:31 -040076 ci = vlib_error_get_code (&vm->node_main, e);
Pim van Pelt96158832022-06-03 21:05:26 +000077 if (ci >= n->n_errors)
78 return CLIB_U32_MAX;
Neale Ranns22e1f1d2019-03-01 15:53:11 +000079
80 ci += n->error_heap_index;
81
82 return ci;
83}
84
85static u8 *
86format_error_trace (u8 * s, va_list * va)
87{
88 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
89 CLIB_UNUSED (vlib_node_t * node) = va_arg (*va, vlib_node_t *);
90 vlib_error_t *e = va_arg (*va, vlib_error_t *);
91 vlib_node_t *error_node;
92 vlib_error_main_t *em = &vm->error_main;
93 u32 i;
94
Dave Barach687c9022019-07-23 10:22:31 -040095 error_node = vlib_get_node (vm, vlib_error_get_node (&vm->node_main, e[0]));
Dave Barachbaba24e2019-07-31 09:05:37 -040096 i = counter_index (vm, vlib_error_get_code (&vm->node_main, e[0])) +
97 error_node->error_heap_index;
Pim van Pelt96158832022-06-03 21:05:26 +000098 if (i != CLIB_U32_MAX)
Arthur de Kerhora9bfef72022-08-26 10:57:35 +020099 s = format (s, "%v: %s", error_node->name, em->counters_heap[i].desc);
Neale Ranns22e1f1d2019-03-01 15:53:11 +0000100
101 return s;
102}
103
104static void
105trace_errors (vlib_main_t * vm,
106 vlib_node_runtime_t * node, vlib_frame_t * frame)
107{
108 u32 n_left, *buffers;
109
110 buffers = vlib_frame_vector_args (frame);
111 n_left = frame->n_vectors;
112
113 while (n_left >= 4)
114 {
115 u32 bi0, bi1;
116 vlib_buffer_t *b0, *b1;
117 vlib_error_t *t0, *t1;
118
119 /* Prefetch next iteration. */
120 vlib_prefetch_buffer_with_index (vm, buffers[2], LOAD);
121 vlib_prefetch_buffer_with_index (vm, buffers[3], LOAD);
122
123 bi0 = buffers[0];
124 bi1 = buffers[1];
125
126 b0 = vlib_get_buffer (vm, bi0);
127 b1 = vlib_get_buffer (vm, bi1);
128
129 if (b0->flags & VLIB_BUFFER_IS_TRACED)
130 {
131 t0 = vlib_add_trace (vm, node, b0, sizeof (t0[0]));
132 t0[0] = b0->error;
133 }
134 if (b1->flags & VLIB_BUFFER_IS_TRACED)
135 {
136 t1 = vlib_add_trace (vm, node, b1, sizeof (t1[0]));
137 t1[0] = b1->error;
138 }
139 buffers += 2;
140 n_left -= 2;
141 }
142
143 while (n_left >= 1)
144 {
145 u32 bi0;
146 vlib_buffer_t *b0;
147 vlib_error_t *t0;
148
149 bi0 = buffers[0];
150
151 b0 = vlib_get_buffer (vm, bi0);
152
153 if (b0->flags & VLIB_BUFFER_IS_TRACED)
154 {
155 t0 = vlib_add_trace (vm, node, b0, sizeof (t0[0]));
156 t0[0] = b0->error;
157 }
158 buffers += 1;
159 n_left -= 1;
160 }
161}
162
163static_always_inline uword
164process_drop_punt (vlib_main_t * vm,
165 vlib_node_runtime_t * node,
166 vlib_frame_t * frame, error_disposition_t disposition)
167{
168 u32 errors[VLIB_FRAME_SIZE], *error, *from, n_left;
169 vlib_buffer_t *bufs[VLIB_FRAME_SIZE], **b;
170 vlib_error_main_t *em = &vm->error_main;
171
172 from = vlib_frame_vector_args (frame);
173 n_left = frame->n_vectors;
174 b = bufs;
175 error = errors;
176
177 vlib_get_buffers (vm, from, bufs, n_left);
178
179 if (node->flags & VLIB_NODE_FLAG_TRACE)
180 trace_errors (vm, node, frame);
181
182 /* collect the array of error first ... */
183 while (n_left >= 4)
184 {
185 if (n_left >= 12)
186 {
187 /* Prefetch 8 ahead - there's not much going on in each iteration */
188 vlib_prefetch_buffer_header (b[4], LOAD);
189 vlib_prefetch_buffer_header (b[5], LOAD);
190 vlib_prefetch_buffer_header (b[6], LOAD);
191 vlib_prefetch_buffer_header (b[7], LOAD);
192 }
193 error[0] = b[0]->error;
194 error[1] = b[1]->error;
195 error[2] = b[2]->error;
196 error[3] = b[3]->error;
197
198 error += 4;
199 n_left -= 4;
200 b += 4;
201 }
202 while (n_left)
203 {
204 error[0] = b[0]->error;
205
206 error += 1;
207 n_left -= 1;
208 b += 1;
209 }
210
211 /* ... then count against them in blocks */
212 n_left = frame->n_vectors;
213
214 while (n_left)
215 {
216 u16 off, count;
217 u32 c_index;
218
219 off = frame->n_vectors - n_left;
220
221 error = errors + off;
222
223 count = clib_count_equal_u32 (error, n_left);
224 n_left -= count;
225
226 c_index = counter_index (vm, error[0]);
Pim van Pelt96158832022-06-03 21:05:26 +0000227 if (c_index != CLIB_U32_MAX)
228 em->counters[c_index] += count;
Neale Ranns22e1f1d2019-03-01 15:53:11 +0000229
230 vlib_error_elog_count (vm, c_index, count);
231 }
232
233 if (disposition == ERROR_DISPOSITION_DROP || !vm->os_punt_frame)
234 {
235 vlib_buffer_free (vm, from, frame->n_vectors);
236
237 /* If there is no punt function, free the frame as well. */
238 if (disposition == ERROR_DISPOSITION_PUNT && !vm->os_punt_frame)
Dmitry Valter9f5b3692022-09-05 15:30:18 +0000239 vlib_frame_free (vm, frame);
Neale Ranns22e1f1d2019-03-01 15:53:11 +0000240 }
241 else
242 vm->os_punt_frame (vm, node, frame);
243
244 return frame->n_vectors;
245}
246
247VLIB_NODE_FN (error_drop_node) (vlib_main_t * vm,
248 vlib_node_runtime_t * node,
249 vlib_frame_t * frame)
250{
251 return process_drop_punt (vm, node, frame, ERROR_DISPOSITION_DROP);
252}
253
254VLIB_NODE_FN (error_punt_node) (vlib_main_t * vm,
255 vlib_node_runtime_t * node,
256 vlib_frame_t * frame)
257{
258 return process_drop_punt (vm, node, frame, ERROR_DISPOSITION_PUNT);
259}
260
261/* *INDENT-OFF* */
262VLIB_REGISTER_NODE (error_drop_node) = {
263 .name = "drop",
264 .flags = VLIB_NODE_FLAG_IS_DROP,
265 .vector_size = sizeof (u32),
266 .format_trace = format_error_trace,
267 .validate_frame = validate_error_frame,
268};
269/* *INDENT-ON* */
270
271/* *INDENT-OFF* */
272VLIB_REGISTER_NODE (error_punt_node) = {
273 .name = "punt",
274 .flags = (VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH
275 | VLIB_NODE_FLAG_IS_PUNT),
276 .vector_size = sizeof (u32),
277 .format_trace = format_error_trace,
278 .validate_frame = validate_error_frame,
279};
280/* *INDENT-ON* */
281
282/*
283 * fd.io coding-style-patch-verification: ON
284 *
285 * Local Variables:
286 * eval: (c-set-style "gnu")
287 * End:
288 */