FD.io VPP  v17.04.2-2-ga8f93f8
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 {
30 
31 /* packet trace format function */
32 static u8 * format_li_hit_trace (u8 * s, va_list * args)
33 {
34  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
35  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
36  li_hit_trace_t * t = va_arg (*args, li_hit_trace_t *);
37 
38  s = format (s, "LI_HIT: next index %d", t->next_index);
39 
40  return s;
41 }
42 
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 #define _(sym,str) LI_HIT_ERROR_##sym,
53 #undef _
56 
57 static char * li_hit_error_strings[] = {
58 #define _(sym,string) string,
60 #undef _
61 };
62 
63 typedef enum {
67 
68 static uword
70  vlib_node_runtime_t * node,
71  vlib_frame_t * frame)
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 
79  from = vlib_frame_vector_args (frame);
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,
87  n_left_from);
88  }
89  else
90  {
91  /* The intercept frame... */
92  int_frame = vlib_get_frame_to_node (vm, ip4_lookup_node.index);
93  to_int_next = vlib_frame_vector_args (int_frame);
94  }
95 
96  while (n_left_from > 0)
97  {
98  u32 n_left_to_next;
99 
100  vlib_get_next_frame (vm, node, next_index,
101  to_next, n_left_to_next);
102 
103 #if 0
104  while (n_left_from >= 4 && n_left_to_next >= 2)
105  {
106  u32 next0 = LI_HIT_NEXT_INTERFACE_OUTPUT;
107  u32 next1 = LI_HIT_NEXT_INTERFACE_OUTPUT;
108  u32 sw_if_index0, sw_if_index1;
109  u8 tmp0[6], tmp1[6];
110  ethernet_header_t *en0, *en1;
111  u32 bi0, bi1;
112  vlib_buffer_t * b0, * b1;
113 
114  /* Prefetch next iteration. */
115  {
116  vlib_buffer_t * p2, * p3;
117 
118  p2 = vlib_get_buffer (vm, from[2]);
119  p3 = vlib_get_buffer (vm, from[3]);
120 
121  vlib_prefetch_buffer_header (p2, LOAD);
122  vlib_prefetch_buffer_header (p3, LOAD);
123 
126  }
127 
128  /* speculatively enqueue b0 and b1 to the current next frame */
129  to_next[0] = bi0 = from[0];
130  to_next[1] = bi1 = from[1];
131  from += 2;
132  to_next += 2;
133  n_left_from -= 2;
134  n_left_to_next -= 2;
135 
136  b0 = vlib_get_buffer (vm, bi0);
137  b1 = vlib_get_buffer (vm, bi1);
138 
139  /* $$$$$ Dual loop: process 2 x packets here $$$$$ */
140  ASSERT (b0->current_data == 0);
141  ASSERT (b1->current_data == 0);
142 
143  en0 = vlib_buffer_get_current (b0);
144  en1 = vlib_buffer_get_current (b1);
145 
146  sw_if_index0 = vnet_buffer(b0)->sw_if_index[VLIB_RX];
147  sw_if_index1 = vnet_buffer(b1)->sw_if_index[VLIB_RX];
148 
149  /* Send pkt back out the RX interface */
150  vnet_buffer(b0)->sw_if_index[VLIB_TX] = sw_if_index0;
151  vnet_buffer(b1)->sw_if_index[VLIB_TX] = sw_if_index1;
152 
153  /* $$$$$ End of processing 2 x packets $$$$$ */
154 
156  {
157  if (b0->flags & VLIB_BUFFER_IS_TRACED)
158  {
159  li_hit_trace_t *t =
160  vlib_add_trace (vm, node, b0, sizeof (*t));
161  t->sw_if_index = sw_if_index0;
162  t->next_index = next0;
163  }
164  if (b1->flags & VLIB_BUFFER_IS_TRACED)
165  {
166  li_hit_trace_t *t =
167  vlib_add_trace (vm, node, b1, sizeof (*t));
168  t->sw_if_index = sw_if_index1;
169  t->next_index = next1;
170  }
171  }
172 
173  /* verify speculative enqueues, maybe switch current next frame */
174  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
175  to_next, n_left_to_next,
176  bi0, bi1, next0, next1);
177  }
178 #endif /* $$$ dual-loop off */
179 
180  while (n_left_from > 0 && n_left_to_next > 0)
181  {
182  u32 bi0;
183  vlib_buffer_t * b0;
184  vlib_buffer_t * c0;
185  ip4_udp_header_t * iu0;
186  ip4_header_t * ip0;
187  udp_header_t * udp0;
188  u32 next0 = LI_HIT_NEXT_ETHERNET;
189 
190  /* speculatively enqueue b0 to the current next frame */
191  bi0 = from[0];
192  to_next[0] = bi0;
193  from += 1;
194  to_next += 1;
195  n_left_from -= 1;
196  n_left_to_next -= 1;
197 
198  b0 = vlib_get_buffer (vm, bi0);
199  if (PREDICT_TRUE(to_int_next != 0))
200  {
201  /* Make an intercept copy. This can fail. */
202  c0 = vlib_buffer_copy (vm, b0);
203 
204  if (PREDICT_FALSE (c0 == 0))
205  {
207  (vm, node->node_index,
208  LI_HIT_ERROR_BUFFER_ALLOCATION_FAILURE, 1);
209  goto skip;
210  }
211 
212  vlib_buffer_advance(c0, -sizeof(*iu0));
213 
214  iu0 = vlib_buffer_get_current(c0);
215  ip0 = &iu0->ip4;
216 
217  ip0->ip_version_and_header_length = 0x45;
218  ip0->ttl = 254;
219  ip0->protocol = IP_PROTOCOL_UDP;
220 
221  ip0->src_address.as_u32 = lm->src_addrs[0].as_u32;
222  ip0->dst_address.as_u32 = lm->collectors[0].as_u32;
223  ip0->length = vlib_buffer_length_in_chain (vm, c0);
224  ip0->checksum = ip4_header_checksum (ip0);
225 
226  udp0 = &iu0->udp;
227  udp0->src_port = udp0->dst_port =
228  clib_host_to_net_u16(lm->ports[0]);
229  udp0->checksum = 0;
230  udp0->length =
231  clib_net_to_host_u16 (vlib_buffer_length_in_chain (vm , b0));
232 
233  to_int_next [0] = vlib_get_buffer_index (vm, c0);
234  to_int_next++;
235  }
236 
237  skip:
239  && (b0->flags & VLIB_BUFFER_IS_TRACED)))
240  {
241  li_hit_trace_t *t =
242  vlib_add_trace (vm, node, b0, sizeof (*t));
243  t->next_index = next0;
244  }
245 
246  /* verify speculative enqueue, maybe switch current next frame */
247  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
248  to_next, n_left_to_next,
249  bi0, next0);
250  }
251 
252  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
253  }
254 
255  if (int_frame)
256  {
257  int_frame->n_vectors = frame->n_vectors;
258  vlib_put_frame_to_node (vm, ip4_lookup_node.index, int_frame);
259  }
260 
262  LI_HIT_ERROR_HITS, frame->n_vectors);
263  return frame->n_vectors;
264 }
265 
267  .function = li_hit_node_fn,
268  .name = "li-hit",
269  .vector_size = sizeof (u32),
270  .format_trace = format_li_hit_trace,
271  .type = VLIB_NODE_TYPE_INTERNAL,
272 
273  .n_errors = ARRAY_LEN(li_hit_error_strings),
274  .error_strings = li_hit_error_strings,
275 
276  .n_next_nodes = LI_HIT_N_NEXT,
277 
278  /* edit / add dispositions here */
279  .next_nodes = {
280  [LI_HIT_NEXT_ETHERNET] = "ethernet-input-not-l2",
281  },
282 };
283 
285 
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:187
#define CLIB_UNUSED(x)
Definition: clib.h:79
ip4_address_t src_address
Definition: ip4_packet.h:163
#define PREDICT_TRUE(x)
Definition: clib.h:98
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:459
struct _vlib_node_registration vlib_node_registration_t
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:418
static u8 * format_li_hit_trace(u8 *s, va_list *args)
Definition: node.c:32
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:100
u32 next_index
Definition: node.c:28
static vlib_buffer_t * vlib_buffer_copy(vlib_main_t *vm, vlib_buffer_t *b)
Definition: buffer_funcs.h:475
vlib_node_registration_t li_hit_node
(constructor) VLIB_REGISTER_NODE (li_hit_node)
Definition: node.c:25
vlib_node_registration_t ip4_lookup_node
(constructor) VLIB_REGISTER_NODE (ip4_lookup_node)
Definition: ip4_forward.c:512
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
Definition: buffer.h:67
ip4_address_t dst_address
Definition: ip4_packet.h:163
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:164
li_hit_error_t
Definition: node.c:50
#define foreach_li_hit_error
Definition: node.c:45
li_hit_next_t
Definition: node.c:63
static u32 vlib_get_buffer_index(vlib_main_t *vm, void *p)
Translate buffer pointer into buffer index.
Definition: buffer_funcs.h:70
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:188
#define PREDICT_FALSE(x)
Definition: clib.h:97
u32 node_index
Node index.
Definition: node.h:436
#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:216
#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:350
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1115
static char * li_hit_error_strings[]
Definition: node.c:57
u16 n_vectors
Definition: node.h:344
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:82
vlib_main_t * vm
Definition: buffer.c:276
#define VLIB_BUFFER_IS_TRACED
Definition: buffer.h:85
#define ARRAY_LEN(x)
Definition: clib.h:59
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:455
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
static uword li_hit_node_fn(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: node.c:69
static void vlib_buffer_advance(vlib_buffer_t *b, word l)
Advance current data pointer by the supplied (signed!) amount.
Definition: buffer.h:201
#define VLIB_NODE_FLAG_TRACE
Definition: node.h:259
u64 uword
Definition: types.h:112
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
Definition: defs.h:47
ip4_address_t * src_addrs
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
unsigned char u8
Definition: types.h:56
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:253
li_main_t li_main
#define vnet_buffer(b)
Definition: buffer.h:294
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:143
u8 data[0]
Packet data.
Definition: buffer.h:152
u16 flags
Copy of main node flags.
Definition: node.h:449
void vlib_put_frame_to_node(vlib_main_t *vm, u32 to_node_index, vlib_frame_t *f)
Definition: main.c:196
u8 ip_version_and_header_length
Definition: ip4_packet.h:131
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
u32 flags
buffer flags: VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:74
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:57
static u16 ip4_header_checksum(ip4_header_t *i)
Definition: ip4_packet.h:238
VLIB_NODE_FUNCTION_MULTIARCH(ethernet_input_not_l2_node, ethernet_input_not_l2)
Definition: node.c:1170
Definition: defs.h:46
ip4_address_t * collectors