blob: 822a8f64e1adce19ab30b961ba0cef79b412f62d [file] [log] [blame]
Ed Warnickecb9cada2015-12-08 15:45:58 -07001/*
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
Dave Barach9b8ffd92016-07-08 08:13:45 -040042u8 *
43format_vlib_node_graph (u8 * s, va_list * va)
Ed Warnickecb9cada2015-12-08 15:45:58 -070044{
Dave Barach9b8ffd92016-07-08 08:13:45 -040045 vlib_node_main_t *nm = va_arg (*va, vlib_node_main_t *);
46 vlib_node_t *n = va_arg (*va, vlib_node_t *);
Ed Warnickecb9cada2015-12-08 15:45:58 -070047 int i, j;
Christophe Fontained3c008d2017-10-02 18:10:54 +020048 u32 indent;
Dave Barach9b8ffd92016-07-08 08:13:45 -040049 typedef struct
50 {
Ed Warnickecb9cada2015-12-08 15:45:58 -070051 u32 next_node;
52 u32 next_slot;
53 u32 prev_node;
54 } tmp_t;
Dave Barach9b8ffd92016-07-08 08:13:45 -040055 tmp_t *tmps = 0;
56 tmp_t empty = {.next_node = ~0,.prev_node = ~0 };
Ed Warnickecb9cada2015-12-08 15:45:58 -070057
Dave Barach9b8ffd92016-07-08 08:13:45 -040058 if (!n)
59 return format (s, "%=26s%=26s%=26s", "Name", "Next", "Previous");
Ed Warnickecb9cada2015-12-08 15:45:58 -070060
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 {
67 if (n->next_nodes[i] == VLIB_INVALID_NODE_INDEX)
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;
Dave Barach9b8ffd92016-07-08 08:13:45 -040076 /* *INDENT-OFF* */
Damjan Marionf0ca1e82020-12-13 23:26:56 +010077 clib_bitmap_foreach (i, n->prev_node_bitmap) {
Ed Warnickecb9cada2015-12-08 15:45:58 -070078 vec_validate_init_empty (tmps, j, empty);
79 tmps[j].prev_node = i;
80 j++;
Damjan Marionf0ca1e82020-12-13 23:26:56 +010081 }
Dave Barach9b8ffd92016-07-08 08:13:45 -040082 /* *INDENT-ON* */
Ed Warnickecb9cada2015-12-08 15:45:58 -070083
84 for (i = 0; i < vec_len (tmps); i++)
85 {
86 if (i > 0)
87 s = format (s, "\n%U", format_white_space, indent);
88
89 if (tmps[i].next_node != ~0)
90 {
Dave Barach9b8ffd92016-07-08 08:13:45 -040091 vlib_node_t *x;
92 u8 *t = 0;
Ed Warnickecb9cada2015-12-08 15:45:58 -070093
94 x = vec_elt (nm->nodes, tmps[i].next_node);
95 t = format (t, "%v [%d]", x->name, tmps[i].next_slot);
96 s = format (s, "%=26v", t);
97 vec_free (t);
98 }
99 else
100 s = format (s, "%26s", "");
101
102 if (tmps[i].prev_node != ~0)
103 {
Dave Barach9b8ffd92016-07-08 08:13:45 -0400104 vlib_node_t *x;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700105 x = vec_elt (nm->nodes, tmps[i].prev_node);
106 s = format (s, "%=26v", x->name);
107 }
108 }
109
110 vec_free (tmps);
111
112 return s;
113}
114
Dave Barach9b8ffd92016-07-08 08:13:45 -0400115u8 *
116format_vlib_node_and_next (u8 * s, va_list * va)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700117{
Dave Barach9b8ffd92016-07-08 08:13:45 -0400118 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
119 vlib_node_t *n = va_arg (*va, vlib_node_t *);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700120 u32 next_index = va_arg (*va, u32);
Dave Barach9b8ffd92016-07-08 08:13:45 -0400121 vlib_node_t *n_next;
122 u32 *ni;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700123
124 ni = vec_elt_at_index (n->next_nodes, next_index);
125 n_next = vlib_get_node (vm, ni[0]);
126 return format (s, "%v -> %v", n->name, n_next->name);
127}
128
Dave Barach9b8ffd92016-07-08 08:13:45 -0400129u8 *
130format_vlib_node_name (u8 * s, va_list * va)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700131{
Dave Barach9b8ffd92016-07-08 08:13:45 -0400132 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700133 u32 node_index = va_arg (*va, u32);
Dave Barach9b8ffd92016-07-08 08:13:45 -0400134 vlib_node_t *n = vlib_get_node (vm, node_index);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700135
136 return format (s, "%v", n->name);
137}
138
Dave Barach9b8ffd92016-07-08 08:13:45 -0400139u8 *
140format_vlib_next_node_name (u8 * s, va_list * va)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700141{
Dave Barach9b8ffd92016-07-08 08:13:45 -0400142 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700143 u32 node_index = va_arg (*va, u32);
144 u32 next_index = va_arg (*va, u32);
Dave Barach9b8ffd92016-07-08 08:13:45 -0400145 vlib_node_t *next = vlib_get_next_node (vm, node_index, next_index);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700146 return format (s, "%v", next->name);
147}
148
149/* Parse node name -> node index. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400150uword
151unformat_vlib_node (unformat_input_t * input, va_list * args)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700152{
Dave Barach9b8ffd92016-07-08 08:13:45 -0400153 vlib_main_t *vm = va_arg (*args, vlib_main_t *);
154 u32 *result = va_arg (*args, u32 *);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700155
156 return unformat_user (input, unformat_hash_vec_string,
157 vm->node_main.node_by_name, result);
158}
159
Dave Barach9b8ffd92016-07-08 08:13:45 -0400160u8 *
161format_vlib_time (u8 * s, va_list * va)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700162{
163 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*va, vlib_main_t *);
164 f64 time = va_arg (*va, f64);
165 return format (s, "%12.4f", time);
166}
167
Dave Barach9b8ffd92016-07-08 08:13:45 -0400168u8 *
169format_vlib_cpu_time (u8 * s, va_list * va)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700170{
Dave Barach9b8ffd92016-07-08 08:13:45 -0400171 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700172 u64 cpu_time = va_arg (*va, u64);
173 f64 dt;
Dave Barach9b8ffd92016-07-08 08:13:45 -0400174
175 dt =
176 (cpu_time -
177 vm->clib_time.init_cpu_time) * vm->clib_time.seconds_per_clock;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700178 return format (s, "%U", format_vlib_time, vm, dt);
179}
Dave Barach9b8ffd92016-07-08 08:13:45 -0400180
181/*
182 * fd.io coding-style-patch-verification: ON
183 *
184 * Local Variables:
185 * eval: (c-set-style "gnu")
186 * End:
187 */