35 s =
format (s,
"IP_CLASSIFY: next_index %d, table %d, entry %d",
43 #define foreach_ip_classify_error \ 44 _(MISS, "Classify misses") \ 45 _(HIT, "Classify hits") \ 46 _(CHAIN_HIT, "Classify hits after chain walk") 50 #define _(sym,str) IP_CLASSIFY_ERROR_##sym, 57 #define _(sym,string) string, 67 u32 n_left_from, *from, *to_next;
90 while (n_left_from > 2)
95 u32 cd_index0, cd_index1;
97 u32 table_index0, table_index1;
145 vnet_buffer (b0)->l2_classify.table_index = table_index0;
147 vnet_buffer (b1)->l2_classify.table_index = table_index1;
153 while (n_left_from > 0)
176 vnet_buffer (b0)->l2_classify.table_index = table_index0;
187 while (n_left_from > 0)
194 while (n_left_from > 0 && n_left_to_next > 0)
201 vnet_classify_entry_t *e0;
213 table_index1 =
vnet_buffer (p1)->l2_classify.table_index;
233 table_index0 =
vnet_buffer (b0)->l2_classify.table_index;
250 e0->next_index : next0;
270 (t0, (
u8 *) h0, hash0, now);
277 e0->next_index : next0;
287 && (b0->
flags & VLIB_BUFFER_IS_TRACED)))
298 to_next, n_left_to_next,
306 IP_CLASSIFY_ERROR_MISS, misses);
308 IP_CLASSIFY_ERROR_HIT, hits);
310 IP_CLASSIFY_ERROR_CHAIN_HIT, chain_hits);
325 .name =
"ip4-classify",
326 .vector_size =
sizeof (
u32),
327 .sibling_of =
"ip4-lookup",
348 .name =
"ip6-classify",
349 .vector_size =
sizeof (
u32),
350 .sibling_of =
"ip6-lookup",
u64 vnet_classify_hash_packet(vnet_classify_table_t *t, u8 *h)
#define foreach_ip_classify_error
static clib_error_t * ip_classify_init(vlib_main_t *vm)
static f64 vlib_time_now(vlib_main_t *vm)
#define ethernet_buffer_header_size(b)
Determine the size of the Ethernet headers of the current frame in the buffer.
ip_lookup_next_t
An adjacency is a representation of an attached L3 peer.
vlib_node_registration_t ip4_classify_node
(constructor) VLIB_REGISTER_NODE (ip4_classify_node)
#define VLIB_INIT_FUNCTION(x)
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
A representation of an MPLS label for imposition in the data-path.
static void vnet_classify_prefetch_bucket(vnet_classify_table_t *t, u64 hash)
static void vnet_classify_prefetch_entry(vnet_classify_table_t *t, u64 hash)
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
static uword ip6_classify(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
static uword ip_classify_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame, int is_ip4)
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
vnet_classify_entry_t * entries
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
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)
Adjacency to drop this packet.
#define VLIB_REGISTER_NODE(x,...)
#define CLIB_PREFETCH(addr, size, type)
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.
struct _vnet_classify_main vnet_classify_main_t
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
static char * ip_classify_error_strings[]
static void vlib_buffer_advance(vlib_buffer_t *b, word l)
Advance current data pointer by the supplied (signed!) amount.
vnet_classify_main_t vnet_classify_main
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
struct _vlib_node_registration vlib_node_registration_t
static u8 * format_ip_classify_trace(u8 *s, va_list *args)
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
static classify_dpo_t * classify_dpo_get(index_t index)
u16 flags
Copy of main node flags.
vlib_node_registration_t ip6_classify_node
(constructor) VLIB_REGISTER_NODE (ip6_classify_node)
#define VLIB_NODE_FLAG_TRACE
static uword ip4_classify(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
#define CLIB_CACHE_LINE_BYTES
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 vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
vnet_classify_entry_t * vnet_classify_find_entry(vnet_classify_table_t *t, u8 *h, u64 hash, f64 now)