FD.io VPP  v16.06
Vector Packet Processing
node_format.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  * node_format.c: node formatting
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 #include <vlib/vlib.h>
41 
42 u8 * format_vlib_node_graph (u8 * s, va_list * va)
43 {
44  vlib_node_main_t * nm = va_arg (*va, vlib_node_main_t *);
45  vlib_node_t * n = va_arg (*va, vlib_node_t *);
46  int i, j;
47  uword indent;
48  typedef struct {
49  u32 next_node;
50  u32 next_slot;
51  u32 prev_node;
52  } tmp_t;
53  tmp_t * tmps = 0;
54  tmp_t empty = { .next_node = ~0, .prev_node = ~0 };
55 
56  if (! n)
57  return format (s,
58  "%=26s%=26s%=26s",
59  "Name", "Next", "Previous");
60 
61  s = format (s, "%-26v", n->name);
62 
63  indent = format_get_indent (s);
64 
65  for (i = j = 0; i < vec_len (n->next_nodes); i++)
66  {
68  continue;
69  vec_validate_init_empty (tmps, j, empty);
70  tmps[j].next_node = n->next_nodes[i];
71  tmps[j].next_slot = i;
72  j++;
73  }
74 
75  j = 0;
77  vec_validate_init_empty (tmps, j, empty);
78  tmps[j].prev_node = i;
79  j++;
80  }));
81 
82  for (i = 0; i < vec_len (tmps); i++)
83  {
84  if (i > 0)
85  s = format (s, "\n%U", format_white_space, indent);
86 
87  if (tmps[i].next_node != ~0)
88  {
89  vlib_node_t * x;
90  u8 * t = 0;
91 
92  x = vec_elt (nm->nodes, tmps[i].next_node);
93  t = format (t, "%v [%d]", x->name, tmps[i].next_slot);
94  s = format (s, "%=26v", t);
95  vec_free (t);
96  }
97  else
98  s = format (s, "%26s", "");
99 
100  if (tmps[i].prev_node != ~0)
101  {
102  vlib_node_t * x;
103  x = vec_elt (nm->nodes, tmps[i].prev_node);
104  s = format (s, "%=26v", x->name);
105  }
106  }
107 
108  vec_free (tmps);
109 
110  return s;
111 }
112 
113 u8 * format_vlib_node_and_next (u8 * s, va_list * va)
114 {
115  vlib_main_t * vm = va_arg (*va, vlib_main_t *);
116  vlib_node_t * n = va_arg (*va, vlib_node_t *);
117  u32 next_index = va_arg (*va, u32);
118  vlib_node_t * n_next;
119  u32 * ni;
120 
121  ni = vec_elt_at_index (n->next_nodes, next_index);
122  n_next = vlib_get_node (vm, ni[0]);
123  return format (s, "%v -> %v", n->name, n_next->name);
124 }
125 
126 u8 * format_vlib_node_name (u8 * s, va_list * va)
127 {
128  vlib_main_t * vm = va_arg (*va, vlib_main_t *);
129  u32 node_index = va_arg (*va, u32);
130  vlib_node_t * n = vlib_get_node (vm, node_index);
131 
132  return format (s, "%v", n->name);
133 }
134 
135 u8 * format_vlib_next_node_name (u8 * s, va_list * va)
136 {
137  vlib_main_t * vm = va_arg (*va, vlib_main_t *);
138  u32 node_index = va_arg (*va, u32);
139  u32 next_index = va_arg (*va, u32);
140  vlib_node_t * next = vlib_get_next_node (vm, node_index, next_index);
141  return format (s, "%v", next->name);
142 }
143 
144 /* Parse node name -> node index. */
145 uword unformat_vlib_node (unformat_input_t * input, va_list * args)
146 {
147  vlib_main_t * vm = va_arg (*args, vlib_main_t *);
148  u32 * result = va_arg (*args, u32 *);
149 
151  vm->node_main.node_by_name, result);
152 }
153 
154 u8 * format_vlib_time (u8 * s, va_list * va)
155 {
156  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*va, vlib_main_t *);
157  f64 time = va_arg (*va, f64);
158  return format (s, "%12.4f", time);
159 }
160 
161 u8 * format_vlib_cpu_time (u8 * s, va_list * va)
162 {
163  vlib_main_t * vm = va_arg (*va, vlib_main_t *);
164  u64 cpu_time = va_arg (*va, u64);
165  f64 dt;
166 
167  dt = (cpu_time - vm->clib_time.init_cpu_time) * vm->clib_time.seconds_per_clock;
168  return format (s, "%U", format_vlib_time, vm, dt);
169 }
u32 * next_nodes
Definition: node.h:254
u8 * format_vlib_cpu_time(u8 *s, va_list *va)
Definition: node_format.c:161
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:267
#define CLIB_UNUSED(x)
Definition: clib.h:79
always_inline vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Definition: node_funcs.h:46
clib_time_t clib_time
Definition: main.h:61
u8 * format_white_space(u8 *s, va_list *va)
Definition: std-formats.c:107
vlib_node_t ** nodes
Definition: node.h:570
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
unsigned long u64
Definition: types.h:89
uword unformat_user(unformat_input_t *input, unformat_function_t *func,...)
Definition: unformat.c:953
#define clib_bitmap_foreach(i, ai, body)
Definition: bitmap.h:308
u8 * format_vlib_node_graph(u8 *s, va_list *va)
Definition: node_format.c:42
u8 * format_vlib_time(u8 *s, va_list *va)
Definition: node_format.c:154
f64 seconds_per_clock
Definition: time.h:56
unformat_function_t unformat_hash_vec_string
Definition: hash.h:637
u8 * format_vlib_node_name(u8 *s, va_list *va)
Definition: node_format.c:126
always_inline vlib_node_t * vlib_get_next_node(vlib_main_t *vm, u32 node_index, u32 next_index)
Definition: node_funcs.h:50
u8 * name
Definition: node.h:187
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:298
uword * node_by_name
Definition: node.h:573
unsigned int u32
Definition: types.h:88
u8 * format(u8 *s, char *fmt,...)
Definition: format.c:405
u8 * format_vlib_next_node_name(u8 *s, va_list *va)
Definition: node_format.c:135
uword * prev_node_bitmap
Definition: node.h:271
always_inline uword format_get_indent(u8 *s)
Definition: format.h:72
u64 uword
Definition: types.h:112
#define vec_elt(v, i)
Get vector value at index i.
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
double f64
Definition: types.h:140
unsigned char u8
Definition: types.h:56
vlib_node_main_t node_main
Definition: main.h:115
uword unformat_vlib_node(unformat_input_t *input, va_list *args)
Definition: node_format.c:145
#define VLIB_INVALID_NODE_INDEX
Definition: node.h:289
u64 init_cpu_time
Definition: time.h:59
u8 * format_vlib_node_and_next(u8 *s, va_list *va)
Definition: node_format.c:113
struct _unformat_input_t unformat_input_t
#define vec_validate_init_empty(V, I, INIT)
Make sure vector is long enough for given index and initialize empty space (no header, unspecified alignment)
Definition: vec.h:443