FD.io VPP  v17.01.1-3-gc6833f8
Vector Packet Processing
trace_funcs.h
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  * trace_funcs.h: VLIB trace buffer.
17  *
18  * Copyright (c) 2008 Eliot Dresselhaus
19  *
20  * Permission is hereby granted, free of charge, to any person obtaining
21  * a copy of this software and associated documentation files (the
22  * "Software"), to deal in the Software without restriction, including
23  * without limitation the rights to use, copy, modify, merge, publish,
24  * distribute, sublicense, and/or sell copies of the Software, and to
25  * permit persons to whom the Software is furnished to do so, subject to
26  * the following conditions:
27  *
28  * The above copyright notice and this permission notice shall be
29  * included in all copies or substantial portions of the Software.
30  *
31  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38  */
39 
40 #ifndef included_vlib_trace_funcs_h
41 #define included_vlib_trace_funcs_h
42 
43 always_inline void
45 {
46  /*
47  * this assert seems right, but goes off constantly.
48  * disabling it appears to make the pain go away
49  */
52 }
53 
54 always_inline void *
56  vlib_node_runtime_t * r, vlib_buffer_t * b, u32 n_data_bytes)
57 {
58  vlib_trace_main_t *tm = &vm->trace_main;
60  u32 n_data_words;
61 
62  vlib_validate_trace (tm, b);
63 
64  n_data_bytes = round_pow2 (n_data_bytes, sizeof (h[0]));
65  n_data_words = n_data_bytes / sizeof (h[0]);
67  1 + n_data_words, sizeof (h[0]));
68 
70  h->n_data = n_data_words;
71  h->node_index = r->node_index;
72 
73  return h->data;
74 }
75 
78 {
79  return h + 1 + h->n_data;
80 }
81 
82 always_inline void
84 {
85  vlib_trace_main_t *tm = &vm->trace_main;
86  vlib_validate_trace (tm, b);
87  _vec_len (tm->trace_buffer_pool[b->trace_index]) = 0;
89 }
90 
91 always_inline void
93  vlib_node_runtime_t * r, u32 next_index)
94 {
96  nf = vlib_node_runtime_get_next_frame (vm, r, next_index);
97  nf->flags |= VLIB_FRAME_TRACE;
98 }
99 
100 void trace_apply_filter (vlib_main_t * vm);
101 
102 /* Mark buffer as traced and allocate trace buffer. */
103 always_inline void
106  u32 next_index, vlib_buffer_t * b, int follow_chain)
107 {
108  vlib_trace_main_t *tm = &vm->trace_main;
110 
111  /*
112  * Apply filter to existing traces to keep number of allocated traces low.
113  * Performed each time around the main loop.
114  */
115  if (tm->last_main_loop_count != vm->main_loop_count)
116  {
118  trace_apply_filter (vm);
119  }
120 
121  vlib_trace_next_frame (vm, r, next_index);
122 
123  pool_get (tm->trace_buffer_pool, h);
124 
125  do
126  {
128  b->trace_index = h - tm->trace_buffer_pool;
129  }
130  while (follow_chain && (b = vlib_get_next_buffer (vm, b)));
131 }
132 
133 always_inline void
135  u32 bi_target)
136 {
137  vlib_buffer_t *b_target = vlib_get_buffer (vm, bi_target);
138  b_target->flags |= b->flags & VLIB_BUFFER_IS_TRACED;
139  b_target->trace_index = b->trace_index;
140 }
141 
144 {
145  vlib_trace_main_t *tm = &vm->trace_main;
146  vlib_trace_node_t *tn;
147  int n;
148 
149  if (rt->node_index >= vec_len (tm->nodes))
150  return 0;
151  tn = tm->nodes + rt->node_index;
152  n = tn->limit - tn->count;
153  ASSERT (n >= 0);
154 
155  return n;
156 }
157 
158 always_inline void
160 {
161  vlib_trace_main_t *tm = &vm->trace_main;
163 
164  ASSERT (count <= tn->limit);
165  tn->count = tn->limit - count;
166 }
167 
168 /* Helper function for nodes which only trace buffer data. */
169 void
171  vlib_node_runtime_t * node,
172  u32 * buffers,
173  uword n_buffers,
174  uword next_buffer_stride,
175  uword n_buffer_data_bytes_in_trace);
176 
177 #endif /* included_vlib_trace_funcs_h */
178 
179 /*
180  * fd.io coding-style-patch-verification: ON
181  *
182  * Local Variables:
183  * eval: (c-set-style "gnu")
184  * End:
185  */
void vlib_trace_frame_buffers_only(vlib_main_t *vm, vlib_node_runtime_t *node, u32 *buffers, uword n_buffers, uword next_buffer_stride, uword n_buffer_data_bytes_in_trace)
Definition: trace.c:45
static u32 vlib_get_trace_count(vlib_main_t *vm, vlib_node_runtime_t *rt)
Definition: trace_funcs.h:143
vlib_trace_node_t * nodes
Definition: trace.h:86
static vlib_trace_header_t * vlib_trace_header_next(vlib_trace_header_t *h)
Definition: trace_funcs.h:77
#define vec_add2_aligned(V, P, N, A)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:533
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:200
static void vlib_trace_buffer(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, vlib_buffer_t *b, int follow_chain)
Definition: trace_funcs.h:104
vlib_trace_header_t ** trace_buffer_pool
Definition: trace.h:72
u32 last_main_loop_count
Definition: trace.h:74
#define always_inline
Definition: clib.h:84
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
static void vlib_trace_next_frame(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index)
Definition: trace_funcs.h:92
#define VLIB_FRAME_TRACE
Definition: node.h:382
static vlib_next_frame_t * vlib_node_runtime_get_next_frame(vlib_main_t *vm, vlib_node_runtime_t *n, u32 next_index)
Definition: node_funcs.h:276
static void vlib_free_trace(vlib_main_t *vm, vlib_buffer_t *b)
Definition: trace_funcs.h:83
static void vlib_buffer_copy_trace_flag(vlib_main_t *vm, vlib_buffer_t *b, u32 bi_target)
Definition: trace_funcs.h:134
void trace_apply_filter(vlib_main_t *vm)
Definition: trace.c:228
static vlib_buffer_t * vlib_get_next_buffer(vlib_main_t *vm, vlib_buffer_t *b)
Get next buffer in buffer linklist, or zero for end of list.
Definition: buffer_funcs.h:84
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:211
static uword round_pow2(uword x, uword pow2)
Definition: clib.h:272
#define pool_put_index(p, i)
Free pool element with given index.
Definition: pool.h:228
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
vlib_trace_main_t trace_main
Definition: main.h:121
#define VLIB_BUFFER_IS_TRACED
Definition: buffer.h:95
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
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
static void vlib_validate_trace(vlib_trace_main_t *tm, vlib_buffer_t *b)
Definition: trace_funcs.h:44
static void vlib_set_trace_count(vlib_main_t *vm, vlib_node_runtime_t *rt, u32 count)
Definition: trace_funcs.h:159
u32 flags
buffer flags: VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:85
u32 main_loop_count
Definition: main.h:71
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
u32 trace_index
Specifies index into trace buffer if VLIB_PACKET_IS_TRACED flag is set.
Definition: buffer.h:142
u64 cpu_time_last_node_dispatch
Definition: main.h:65