FD.io VPP  v20.05.1-6-gf53edbc3b
Vector Packet Processing
node.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2015 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 
16 #include <vlib/vlib.h>
17 #include <vnet/vnet.h>
18 #include <vppinfra/error.h>
19 
21 
22 #include <vppinfra/error.h>
23 #include <vppinfra/elog.h>
24 
26 
27 typedef struct
28 {
31 
32 /* packet trace format function */
33 static u8 *
34 format_li_hit_trace (u8 * s, va_list * args)
35 {
36  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
37  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
38  li_hit_trace_t *t = va_arg (*args, li_hit_trace_t *);
39 
40  s = format (s, "LI_HIT: next index %d", t->next_index);
41 
42  return s;
43 }
44 
45 #define foreach_li_hit_error \
46 _(HITS, "LI packets processed") \
47 _(NO_COLLECTOR, "No collector configured") \
48 _(BUFFER_ALLOCATION_FAILURE, "Buffer allocation failure")
49 
50 typedef enum
51 {
52 #define _(sym,str) LI_HIT_ERROR_##sym,
54 #undef _
57 
58 static char *li_hit_error_strings[] = {
59 #define _(sym,string) string,
61 #undef _
62 };
63 
64 typedef enum
65 {
69 
72 {
73  u32 n_left_from, *from, *to_next;
74  li_hit_next_t next_index;
75  vlib_frame_t *int_frame = 0;
76  u32 *to_int_next = 0;
77  li_main_t *lm = &li_main;
78 
80  n_left_from = frame->n_vectors;
81  next_index = node->cached_next_index;
82 
83  if (PREDICT_FALSE (vec_len (lm->collectors) == 0))
84  {
86  LI_HIT_ERROR_NO_COLLECTOR, n_left_from);
87  }
88  else
89  {
90  /* The intercept frame... */
91  int_frame = vlib_get_frame_to_node (vm, ip4_lookup_node.index);
92  to_int_next = vlib_frame_vector_args (int_frame);
93  }
94 
95  while (n_left_from > 0)
96  {
97  u32 n_left_to_next;
98 
99  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
100 
101 #if 0
102  while (n_left_from >= 4 && n_left_to_next >= 2)
103  {
104  u32 next0 = LI_HIT_NEXT_INTERFACE_OUTPUT;
105  u32 next1 = LI_HIT_NEXT_INTERFACE_OUTPUT;
106  u32 sw_if_index0, sw_if_index1;
107  u8 tmp0[6], tmp1[6];
108  ethernet_header_t *en0, *en1;
109  u32 bi0, bi1;
110  vlib_buffer_t *b0, *b1;
111 
112  /* Prefetch next iteration. */
113  {
114  vlib_buffer_t *p2, *p3;
115 
116  p2 = vlib_get_buffer (vm, from[2]);
117  p3 = vlib_get_buffer (vm, from[3]);
118 
119  vlib_prefetch_buffer_header (p2, LOAD);
120  vlib_prefetch_buffer_header (p3, LOAD);
121 
124  }
125 
126  /* speculatively enqueue b0 and b1 to the current next frame */
127  to_next[0] = bi0 = from[0];
128  to_next[1] = bi1 = from[1];
129  from += 2;
130  to_next += 2;
131  n_left_from -= 2;
132  n_left_to_next -= 2;
133 
134  b0 = vlib_get_buffer (vm, bi0);
135  b1 = vlib_get_buffer (vm, bi1);
136 
137  /* $$$$$ Dual loop: process 2 x packets here $$$$$ */
138  ASSERT (b0->current_data == 0);
139  ASSERT (b1->current_data == 0);
140 
141  en0 = vlib_buffer_get_current (b0);
142  en1 = vlib_buffer_get_current (b1);
143 
144  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
145  sw_if_index1 = vnet_buffer (b1)->sw_if_index[VLIB_RX];
146 
147  /* Send pkt back out the RX interface */
148  vnet_buffer (b0)->sw_if_index[VLIB_TX] = sw_if_index0;
149  vnet_buffer (b1)->sw_if_index[VLIB_TX] = sw_if_index1;
150 
151  /* $$$$$ End of processing 2 x packets $$$$$ */
152 
153  if (PREDICT_FALSE ((node->flags & VLIB_NODE_FLAG_TRACE)))
154  {
155  if (b0->flags & VLIB_BUFFER_IS_TRACED)
156  {
157  li_hit_trace_t *t =
158  vlib_add_trace (vm, node, b0, sizeof (*t));
159  t->sw_if_index = sw_if_index0;
160  t->next_index = next0;
161  }
162  if (b1->flags & VLIB_BUFFER_IS_TRACED)
163  {
164  li_hit_trace_t *t =
165  vlib_add_trace (vm, node, b1, sizeof (*t));
166  t->sw_if_index = sw_if_index1;
167  t->next_index = next1;
168  }
169  }
170 
171  /* verify speculative enqueues, maybe switch current next frame */
172  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
173  to_next, n_left_to_next,
174  bi0, bi1, next0, next1);
175  }
176 #endif /* $$$ dual-loop off */
177 
178  while (n_left_from > 0 && n_left_to_next > 0)
179  {
180  u32 bi0;
181  vlib_buffer_t *b0;
182  vlib_buffer_t *c0;
183  ip4_udp_header_t *iu0;
184  ip4_header_t *ip0;
185  udp_header_t *udp0;
186  u32 next0 = LI_HIT_NEXT_ETHERNET;
187 
188  /* speculatively enqueue b0 to the current next frame */
189  bi0 = from[0];
190  to_next[0] = bi0;
191  from += 1;
192  to_next += 1;
193  n_left_from -= 1;
194  n_left_to_next -= 1;
195 
196  b0 = vlib_get_buffer (vm, bi0);
197  if (PREDICT_TRUE (to_int_next != 0))
198  {
199  /* Make an intercept copy. This can fail. */
200  c0 = vlib_buffer_copy (vm, b0);
201 
202  if (PREDICT_FALSE (c0 == 0))
203  {
205  (vm, node->node_index,
206  LI_HIT_ERROR_BUFFER_ALLOCATION_FAILURE, 1);
207  goto skip;
208  }
209 
210  vlib_buffer_advance (c0, -sizeof (*iu0));
211 
212  iu0 = vlib_buffer_get_current (c0);
213  ip0 = &iu0->ip4;
214 
215  ip0->ip_version_and_header_length = 0x45;
216  ip0->ttl = 254;
217  ip0->protocol = IP_PROTOCOL_UDP;
218 
219  ip0->src_address.as_u32 = lm->src_addrs[0].as_u32;
220  ip0->dst_address.as_u32 = lm->collectors[0].as_u32;
221  ip0->length = vlib_buffer_length_in_chain (vm, c0);
222  ip0->checksum = ip4_header_checksum (ip0);
223 
224  udp0 = &iu0->udp;
225  udp0->src_port = udp0->dst_port =
226  clib_host_to_net_u16 (lm->ports[0]);
227  udp0->checksum = 0;
228  udp0->length =
229  clib_net_to_host_u16 (vlib_buffer_length_in_chain (vm, b0));
230 
231  to_int_next[0] = vlib_get_buffer_index (vm, c0);
232  to_int_next++;
233  }
234 
235  skip:
236  if (PREDICT_FALSE ((node->flags & VLIB_NODE_FLAG_TRACE)
237  && (b0->flags & VLIB_BUFFER_IS_TRACED)))
238  {
239  li_hit_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
240  t->next_index = next0;
241  }
242 
243  /* verify speculative enqueue, maybe switch current next frame */
244  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
245  to_next, n_left_to_next,
246  bi0, next0);
247  }
248 
249  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
250  }
251 
252  if (int_frame)
253  {
254  int_frame->n_vectors = frame->n_vectors;
255  vlib_put_frame_to_node (vm, ip4_lookup_node.index, int_frame);
256  }
257 
259  LI_HIT_ERROR_HITS, frame->n_vectors);
260  return frame->n_vectors;
261 }
262 
263 /* *INDENT-OFF* */
265  .name = "li-hit",
266  .vector_size = sizeof (u32),
267  .format_trace = format_li_hit_trace,
269 
270  .n_errors = ARRAY_LEN(li_hit_error_strings),
271  .error_strings = li_hit_error_strings,
272 
273  .n_next_nodes = LI_HIT_N_NEXT,
274 
275  /* edit / add dispositions here */
276  .next_nodes = {
277  [LI_HIT_NEXT_ETHERNET] = "ethernet-input-not-l2",
278  },
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  */
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:124
#define CLIB_UNUSED(x)
Definition: clib.h:86
ip4_address_t src_address
Definition: ip4_packet.h:170
li_main_t li_main
#define PREDICT_TRUE(x)
Definition: clib.h:119
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
Definition: buffer.h:110
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
#define VLIB_NODE_FN(node)
Definition: node.h:202
static u8 * format_li_hit_trace(u8 *s, va_list *args)
Definition: node.c:34
static uword vlib_buffer_length_in_chain(vlib_main_t *vm, vlib_buffer_t *b)
Get length in bytes of the buffer chain.
Definition: buffer_funcs.h:402
u32 next_index
Definition: node.c:29
unsigned char u8
Definition: types.h:56
static vlib_buffer_t * vlib_buffer_copy(vlib_main_t *vm, vlib_buffer_t *b)
vlib_node_registration_t ip4_lookup_node
(constructor) VLIB_REGISTER_NODE (ip4_lookup_node)
Definition: ip4_forward.c:104
static char * li_hit_error_strings[]
Definition: node.c:58
ip4_address_t dst_address
Definition: ip4_packet.h:170
vlib_node_registration_t li_hit_node
(constructor) VLIB_REGISTER_NODE (li_hit_node)
Definition: node.c:264
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:203
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:182
unsigned int u32
Definition: types.h:88
li_hit_next_t
Definition: node.c:64
static u32 vlib_get_buffer_index(vlib_main_t *vm, void *p)
Translate buffer pointer into buffer index.
Definition: buffer_funcs.h:293
vl_api_fib_path_type_t type
Definition: fib_types.api:123
void vlib_put_frame_to_node(vlib_main_t *vm, u32 to_node_index, vlib_frame_t *f)
Definition: main.c:216
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:229
#define PREDICT_FALSE(x)
Definition: clib.h:118
li_hit_error_t
Definition: node.c:50
#define vlib_validate_buffer_enqueue_x2(vm, node, next_index, to_next, n_left_to_next, bi0, bi1, next0, next1)
Finish enqueueing two buffers forward in the graph.
Definition: buffer_node.h:70
#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:224
#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
vlib_main_t * vm
Definition: in2out_ed.c:1599
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1150
The fine-grained event logger allows lightweight, thread-safe event logging at minimum cost...
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
u16 n_vectors
Definition: node.h:399
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:80
u8 data[]
Packet data.
Definition: buffer.h:181
#define foreach_li_hit_error
Definition: node.c:45
#define ARRAY_LEN(x)
Definition: clib.h:66
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:483
vlib_main_t vlib_node_runtime_t * node
Definition: in2out_ed.c:1599
#define ASSERT(truth)
static void vlib_buffer_advance(vlib_buffer_t *b, word l)
Advance current data pointer by the supplied (signed!) amount.
Definition: buffer.h:248
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:55
struct _vlib_node_registration vlib_node_registration_t
Definition: defs.h:47
ip4_address_t * src_addrs
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
VLIB buffer representation.
Definition: buffer.h:102
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:417
vlib_main_t vlib_node_runtime_t vlib_frame_t * frame
Definition: in2out_ed.c:1600
u8 ip_version_and_header_length
Definition: ip4_packet.h:138
#define VLIB_NODE_FLAG_TRACE
Definition: node.h:304
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:85
static u16 ip4_header_checksum(ip4_header_t *i)
Definition: ip4_packet.h:247
Definition: defs.h:46
ip4_address_t * collectors