FD.io VPP  v19.01.3-6-g70449b9b9
Vector Packet Processing
adj_l2.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 
16 #include <vnet/vnet.h>
17 #include <vnet/adj/adj_l2.h>
18 #include <vnet/ethernet/ethernet.h>
19 #include <vnet/ip/ip.h>
20 
21 /**
22  * @brief Trace data for a L2 Midchain
23  */
24 typedef struct adj_l2_trace_t_ {
25  /** Adjacency index taken. */
28 
29 static u8 *
30 format_adj_l2_trace (u8 * s, va_list * args)
31 {
32  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
33  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
34  adj_l2_trace_t * t = va_arg (*args, adj_l2_trace_t *);
35 
36  s = format (s, "adj-idx %d : %U",
37  t->adj_index,
39  return s;
40 }
41 
43 {
46 
49  vlib_node_runtime_t * node,
50  vlib_frame_t * frame,
51  int is_midchain)
52 {
53  u32 * from = vlib_frame_vector_args (frame);
54  u32 n_left_from, n_left_to_next, * to_next, next_index;
55  u32 thread_index = vlib_get_thread_index();
57 
58  n_left_from = frame->n_vectors;
59  next_index = node->cached_next_index;
60 
61  while (n_left_from > 0)
62  {
63  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
64 
65  while (n_left_from > 0 && n_left_to_next > 0)
66  {
67  ip_adjacency_t * adj0;
68  vlib_buffer_t * p0;
69  char *h0;
70  u32 pi0, rw_len0, adj_index0, next0 = 0;
71  u32 tx_sw_if_index0;
72 
73  pi0 = to_next[0] = from[0];
74  from += 1;
75  n_left_from -= 1;
76  to_next += 1;
77  n_left_to_next -= 1;
78 
79  p0 = vlib_get_buffer (vm, pi0);
80  h0 = vlib_buffer_get_current (p0);
81 
82  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
83 
84  adj0 = adj_get (adj_index0);
85 
86  /* Guess we are only writing on simple Ethernet header. */
87  vnet_rewrite_one_header (adj0[0], h0,
88  sizeof (ethernet_header_t));
89 
90  /* Update packet buffer attributes/set output interface. */
91  rw_len0 = adj0[0].rewrite_header.data_bytes;
92  vnet_buffer(p0)->ip.save_rewrite_length = rw_len0;
93  vnet_buffer(p0)->sw_if_index[VLIB_TX] = adj0->rewrite_header.sw_if_index;
94  /* since we are coming out of the L2 world, where the vlib_buffer
95  * union is used for other things, make sure it is clean for
96  * MPLS from now on.
97  */
98  vnet_buffer(p0)->mpls.first = 0;
99 
101  thread_index,
102  adj_index0,
103  /* packet increment */ 0,
104  /* byte increment */ rw_len0);
105 
106  /* Check MTU of outgoing interface. */
108  adj0[0].rewrite_header.max_l3_packet_bytes)))
109  {
110  /* Don't adjust the buffer for ttl issue; icmp-error node wants
111  * to see the IP headerr */
112  p0->current_data -= rw_len0;
113  p0->current_length += rw_len0;
114  tx_sw_if_index0 = adj0[0].rewrite_header.sw_if_index;
115 
116  if (is_midchain)
117  {
118  adj0->sub_type.midchain.fixup_func(
119  vm, adj0, p0,
120  adj0->sub_type.midchain.fixup_data);
121  }
122 
123  vnet_buffer (p0)->sw_if_index[VLIB_TX] = tx_sw_if_index0;
124 
125  /*
126  * Follow the feature ARC. this will result eventually in
127  * the midchain-tx node
128  */
129  vnet_feature_arc_start(em->output_feature_arc_index, tx_sw_if_index0, &next0, p0);
130  }
131  else
132  {
133  /* can't fragment L2 */
134  next0 = ADJ_L2_REWRITE_NEXT_DROP;
135  }
136 
137  if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
138  {
139  adj_l2_trace_t *tr = vlib_add_trace (vm, node,
140  p0, sizeof (*tr));
141  tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
142  }
143 
144  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
145  to_next, n_left_to_next,
146  pi0, next0);
147  }
148 
149  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
150  }
151 
152  return frame->n_vectors;
153 }
154 
155 static uword
157  vlib_node_runtime_t * node,
158  vlib_frame_t * frame)
159 {
160  return adj_l2_rewrite_inline (vm, node, frame, 0);
161 }
162 
163 static uword
165  vlib_node_runtime_t * node,
166  vlib_frame_t * frame)
167 {
168  return adj_l2_rewrite_inline (vm, node, frame, 1);
169 }
170 
172  .function = adj_l2_rewrite,
173  .name = "adj-l2-rewrite",
174  .vector_size = sizeof (u32),
175 
176  .format_trace = format_adj_l2_trace,
177 
178  .n_next_nodes = 1,
179  .next_nodes = {
180  [ADJ_L2_REWRITE_NEXT_DROP] = "error-drop",
181  },
182 };
183 
185 
187  .function = adj_l2_midchain,
188  .name = "adj-l2-midchain",
189  .vector_size = sizeof (u32),
190 
191  .format_trace = format_adj_l2_trace,
192 
193  .n_next_nodes = 1,
194  .next_nodes = {
195  [ADJ_L2_REWRITE_NEXT_DROP] = "error-drop",
196  },
197 };
198 
#define vnet_rewrite_one_header(rw0, p0, most_likely_size)
Definition: rewrite.h:277
#define CLIB_UNUSED(x)
Definition: clib.h:82
static void vlib_increment_combined_counter(vlib_combined_counter_main_t *cm, u32 thread_index, u32 index, u64 n_packets, u64 n_bytes)
Increment a combined counter.
Definition: counter.h:220
#define PREDICT_TRUE(x)
Definition: clib.h:112
IP unicast adjacency.
Definition: adj.h:221
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
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:267
unsigned char u8
Definition: types.h:56
ethernet_main_t ethernet_main
Definition: init.c:45
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:433
union ip_adjacency_t_::@42 sub_type
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
Definition: buffer.h:110
format_function_t format_ip_adjacency
Definition: format.h:58
#define always_inline
Definition: clib.h:98
u8 output_feature_arc_index
Definition: ethernet.h:329
unsigned int u32
Definition: types.h:88
vlib_node_registration_t adj_l2_midchain_node
(constructor) VLIB_REGISTER_NODE (adj_l2_midchain_node)
Definition: adj_l2.c:186
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
Definition: node.h:223
u16 current_length
Nbytes between current data and the end of this buffer.
Definition: buffer.h:114
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
static u8 * format_adj_l2_trace(u8 *s, va_list *args)
Definition: adj_l2.c:30
#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
adj_l2_rewrite_next_t_
Definition: adj_l2.c:42
vlib_combined_counter_main_t adjacency_counters
Adjacency packet counters.
Definition: adj.c:25
static uword adj_l2_rewrite(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: adj_l2.c:156
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
u16 n_vectors
Definition: node.h:420
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:212
vlib_main_t * vm
Definition: buffer.c:301
struct adj_l2_trace_t_ adj_l2_trace_t
Trace data for a L2 Midchain.
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
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:537
static uword adj_l2_rewrite_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame, int is_midchain)
Definition: adj_l2.c:48
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
static uword adj_l2_midchain(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: adj_l2.c:164
struct ip_adjacency_t_::@42::@44 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
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
Trace data for a L2 Midchain.
Definition: adj_l2.c:24
#define vnet_buffer(b)
Definition: buffer.h:368
u32 adj_index
Adjacency index taken.
Definition: adj_l2.c:26
vlib_node_registration_t adj_l2_rewrite_node
(constructor) VLIB_REGISTER_NODE (adj_l2_rewrite_node)
Definition: adj_l2.c:171
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
enum adj_l2_rewrite_next_t_ adj_l2_rewrite_next_t
static_always_inline void vnet_feature_arc_start(u8 arc, u32 sw_if_index, u32 *next0, vlib_buffer_t *b0)
Definition: feature.h:275