47 u32 next_buffer_stride,
50 u32 drop_error_node,
u32 drop_error_code)
52 u32 n_left_this_frame, n_buffers_left, *args, n_args_left;
59 n_buffers_left = n_buffers;
60 while (n_buffers_left > 0)
64 n_left_this_frame =
clib_min (n_buffers_left, n_args_left);
65 n_buffers_left -= n_left_this_frame;
66 n_args_left -= n_left_this_frame;
68 while (n_left_this_frame >= 4)
70 u32 bi0, bi1, bi2, bi3;
73 args[0] = bi0 = buffers[0];
74 args[1] = bi1 = buffers[1];
75 args[2] = bi2 = buffers[2];
76 args[3] = bi3 = buffers[3];
83 b0->
error = drop_error;
84 b1->
error = drop_error;
85 b2->
error = drop_error;
86 b3->
error = drop_error;
90 n_left_this_frame -= 4;
93 while (n_left_this_frame >= 1)
98 args[0] = bi0 = buffers[0];
101 b0->
error = drop_error;
105 n_left_this_frame -= 1;
115 __attribute__ ((weak));
118 u64 * notused3,
u64 notused4)
132 u32 node_index,
u32 n_errors,
char *error_strings[])
160 error_strings, n_errors * sizeof (error_strings[0]));
174 n_errors * sizeof (em->
counters[0]));
177 0, n_errors * sizeof (em->
counters[0]));
184 for (i = 0; i < n_errors; i++)
186 error_name =
format (0,
"/err/%v/%s%c", n->
name, error_strings[i], 0);
203 for (i = 0; i < n_errors; i++)
206 n->
name, error_strings[i]);
225 if (
unformat (input,
"verbose %d", &verbose))
227 else if (
unformat (input,
"verbose"))
241 em = &this_vlib_main->error_main;
247 for (ni = 0; ni <
vec_len (this_vlib_main->node_main.nodes); ni++)
250 for (code = 0; code < n->
n_errors; code++)
258 if (c == 0 && verbose < 2)
279 for (code = 0; code < n->
n_errors; code++)
298 .path =
"show errors",
299 .short_help =
"Show error counts",
306 .path =
"show node counters",
307 .short_help =
"Show node counters",
321 em = &this_vlib_main->error_main;
332 .path =
"clear errors",
333 .short_help =
"Clear error counters",
340 .path =
"clear node counters",
341 .short_help =
"Clear node counters",
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
void vlib_stats_register_error_index(void *, u8 *, u64 *, u64)
void * vlib_stats_push_heap(void *)
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
static clib_error_t * show_errors(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
char * format
Format string.
#define clib_memcpy(d, s, n)
void vlib_register_errors(vlib_main_t *vm, u32 node_index, u32 n_errors, char *error_strings[])
u64 * counters_last_clear
void vlib_stats_pop_heap2(void *, u32, void *)
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
elog_event_type_t * error_elog_event_types
vlib_error_t error
Error code for buffers to be enqueued to error handler.
vlib_worker_thread_t * vlib_worker_threads
vlib_error_main_t error_main
uword vlib_error_drop_buffers(vlib_main_t *vm, vlib_node_runtime_t *node, u32 *buffers, u32 next_buffer_stride, u32 n_buffers, u32 next_index, u32 drop_error_node, u32 drop_error_code)
#define foreach_vlib_main(body)
#define vlib_get_next_frame(vm, node, next_index, vectors, n_vectors_left)
Get pointer to next frame vector data by (vlib_node_runtime_t, next_index).
char ** error_strings_heap
static_always_inline uword vlib_get_thread_index(void)
#define vec_free(V)
Free vector's memory (no header).
void vlib_put_next_frame(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, u32 n_vectors_left)
Release pointer to next frame vector data.
#define VLIB_CLI_COMMAND(x,...)
void heap_dealloc(void *v, uword handle)
#define heap_alloc(v, size, handle)
static clib_error_t * clear_error_counters(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
vlib_node_main_t node_main
VLIB buffer representation.
static vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Get vlib node by index.
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.