30 #ifndef CLIB_MARCH_VARIANT 44 #define foreach_nsim_tx_error \ 45 _(TRANSMITTED, "Packets transmitted") 49 #define _(sym,str) NSIM_TX_ERROR_##sym, 55 #ifndef CLIB_MARCH_VARIANT 57 #define _(sym,string) string, 77 uword n_tx_packets = 0;
102 while (n_left_to_next > 0)
108 bi0 = ep->buffer_index;
114 next0 = ep->output_next_index;
118 to_next, n_left_to_next,
131 if (b0->
flags & VLIB_BUFFER_IS_TRACED)
152 NSIM_TX_ERROR_TRANSMITTED, n_tx_packets);
167 #ifndef CLIB_MARCH_VARIANT 171 .name =
"nsim-wheel",
174 .state = VLIB_NODE_STATE_DISABLED,
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
static f64 vlib_time_now(vlib_main_t *vm)
#define VLIB_NODE_FN(node)
u32 node_index
Node index.
#define vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next, n_left_to_next, bi0, next0)
Finish enqueueing one buffer forward in the graph.
#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).
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
#define VLIB_REGISTER_NODE(x,...)
#define CLIB_PREFETCH(addr, size, type)
nsim_wheel_entry_t * entries
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.
vlib_main_t vlib_node_runtime_t * node
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
nsim_wheel_t ** wheel_by_thread
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
VLIB buffer representation.
vlib_main_t vlib_node_runtime_t vlib_frame_t * frame
#define VLIB_NODE_FLAG_TRACE
#define CLIB_CACHE_LINE_BYTES
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.