FD.io VPP  v19.01.3-6-g70449b9b9
Vector Packet Processing
bier_disp_lookup_node.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2016 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:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
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.
14  */
15 
18 
19 /**
20  * @brief A struct to hold tracing information for the MPLS label imposition
21  * node.
22  */
24 {
25  /**
26  * BIER source BP used in the lookup - host order
27  */
29  /**
30  * BIER disp table
31  */
34 
35 /**
36  * Next nodes from BIER disposition lookup
37  */
39 {
43 #define BIER_DISP_LOOKUP_N_NEXT (BIER_DISP_LOOKUP_NEXT_DISPATCH+1)
44 
47  vlib_node_runtime_t * node,
48  vlib_frame_t * from_frame)
49 {
50  u32 n_left_from, next_index, * from, * to_next;
51 
52  from = vlib_frame_vector_args (from_frame);
53  n_left_from = from_frame->n_vectors;
54 
55  next_index = node->cached_next_index;
56 
57  while (n_left_from > 0)
58  {
59  u32 n_left_to_next;
60 
61  vlib_get_next_frame(vm, node, next_index, to_next, n_left_to_next);
62 
63  while (n_left_from > 0 && n_left_to_next > 0)
64  {
65  const bier_hdr_t *hdr0;
66  bier_hdr_src_id_t src0;
67  vlib_buffer_t * b0;
68  u32 bdei0, bdti0;
69  u32 next0, bi0;
70 
71  bi0 = from[0];
72  to_next[0] = bi0;
73  from += 1;
74  to_next += 1;
75  n_left_from -= 1;
76  n_left_to_next -= 1;
77 
78  b0 = vlib_get_buffer (vm, bi0);
79 
80  bdti0 = vnet_buffer(b0)->ip.adj_index[VLIB_TX];
81  hdr0 = vlib_buffer_get_current(b0);
82 
83  /*
84  * lookup - source is in network order.
85  */
86  src0 = bier_hdr_get_src_id(hdr0);
88 
89  bdei0 = bier_disp_table_lookup(bdti0, src0);
90 
91  if (PREDICT_FALSE(INDEX_INVALID == bdei0))
92  {
93  /*
94  * if a specific match misses, try the default
95  */
96  bdei0 = bier_disp_table_lookup(bdti0, 0);
97 
98  if (PREDICT_FALSE(INDEX_INVALID == bdei0))
99  {
101  }
102  }
103 
104  vnet_buffer(b0)->ip.adj_index[VLIB_TX] = bdei0;
105 
106  if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
107  {
109  vlib_add_trace (vm, node, b0, sizeof (*tr));
110  tr->bp = clib_net_to_host_u16(bier_hdr_get_src_id(hdr0));
111  tr->bdti = bdti0;
112  }
113 
114  vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next,
115  n_left_to_next, bi0, next0);
116  }
117  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
118  }
119  return from_frame->n_vectors;
120 }
121 
122 static u8 *
123 format_bier_disp_lookup_trace (u8 * s, va_list * args)
124 {
125  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
126  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
128 
129  t = va_arg (*args, bier_disp_lookup_trace_t *);
130  s = format (s, "tbl:%d src:%d", t->bdti, t->bp);
131 
132  return (s);
133 }
134 
135 static uword
137  vlib_node_runtime_t * node,
138  vlib_frame_t * frame)
139 {
140  return (bier_disp_lookup_inline(vm, node, frame));
141 }
142 
144  .function = bier_disp_lookup,
145  .name = "bier-disp-lookup",
146  .vector_size = sizeof (u32),
147 
148  .format_trace = format_bier_disp_lookup_trace,
149  .n_next_nodes = BIER_DISP_LOOKUP_N_NEXT,
150  .next_nodes = {
151  [BIER_DISP_LOOKUP_NEXT_DROP] = "bier-drop",
152  [BIER_DISP_LOOKUP_NEXT_DISPATCH] = "bier-disp-dispatch",
153  }
154 };
#define CLIB_UNUSED(x)
Definition: clib.h:82
vlib_node_registration_t bier_disp_lookup_node
(constructor) VLIB_REGISTER_NODE (bier_disp_lookup_node)
static uword bier_disp_lookup_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
static u8 * format_bier_disp_lookup_trace(u8 *s, va_list *args)
u32 index_t
A Data-Path Object is an object that represents actions that are applied to packets are they are swit...
Definition: dpo.h:41
#define BIER_DISP_LOOKUP_N_NEXT
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
index_t bdti
BIER disp table.
bier_disp_lookup_next_t_
Next nodes from BIER disposition lookup.
struct bier_disp_lookup_trace_t_ bier_disp_lookup_trace_t
A struct to hold tracing information for the MPLS label imposition node.
unsigned char u8
Definition: types.h:56
#define always_inline
Definition: clib.h:98
unsigned int u32
Definition: types.h:88
u32 bier_bp_t
A bit positon as assigned to egress PEs.
Definition: bier_types.h:294
A struct to hold tracing information for the MPLS label imposition node.
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
Definition: node.h:223
static bier_hdr_src_id_t bier_hdr_get_src_id(const bier_hdr_t *bier_hdr)
u16 bier_hdr_src_id_t
An identifier of the sender of BIER packets this is the source of the 'tree' - the BFIR...
Definition: bier_types.h:307
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:214
#define PREDICT_FALSE(x)
Definition: clib.h:111
#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.
Definition: buffer_node.h:218
#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).
Definition: node_funcs.h:338
enum bier_disp_lookup_next_t_ bier_disp_lookup_next_t
Next nodes from BIER disposition lookup.
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
u16 n_vectors
Definition: node.h:420
vlib_main_t * vm
Definition: buffer.c:301
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.
Definition: main.c:452
static index_t bier_disp_table_lookup(index_t bdti, bier_hdr_src_id_t src)
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:537
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace_funcs.h:57
Definition: defs.h:47
A BIER header of variable length The encoding follows: https://tools.ietf.org/html/draft-ietf-bier-mp...
Definition: bier_types.h:321
#define INDEX_INVALID
Invalid index - used when no index is known blazoned capitals INVALID speak volumes where ~0 does not...
Definition: dpo.h:47
u64 uword
Definition: types.h:112
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:244
#define vnet_buffer(b)
Definition: buffer.h:368
bier_bp_t bp
BIER source BP used in the lookup - host order.
static uword bier_disp_lookup(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:117
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:62