proxmox-mirrors/mirror_frr
1
0
Fork 0
mirror of https://git.proxmox.com/git/mirror_frr synced 2025-08-07 10:49:24 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

tools: Pretty print graph after input permutations

Browse Source 
Signed-off-by: Quentin Young <qlyoung@cumulusnetworks.com>
This commit is contained in:
Quentin Young 2016-10-07 18:39:24 +00:00
parent 066242b5c6
commit 943624d733
1 changed files with 33 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
tools/permutations.c
View File

@ -30,6 +30,8 @@
void void
permute (struct graph_node *); permute (struct graph_node *);
void
pretty_print_graph (struct graph_node *start, int level);
int main (int argc, char *argv[]) int main (int argc, char *argv[])
{ {
@ -38,7 +40,6 @@ int main (int argc, char *argv[])
fprintf(stdout, USAGE"\n"); fprintf(stdout, USAGE"\n");
exit(EXIT_SUCCESS); exit(EXIT_SUCCESS);
} }
struct cmd_element *cmd = calloc (1, sizeof (struct cmd_element)); struct cmd_element *cmd = calloc (1, sizeof (struct cmd_element));
cmd->string = strdup(argv[1]); cmd->string = strdup(argv[1]);
@ -48,6 +49,7 @@ int main (int argc, char *argv[])
command_parse_format (graph, cmd); command_parse_format (graph, cmd);
permute (vector_slot (graph->nodes, 0)); permute (vector_slot (graph->nodes, 0));
pretty_print_graph (vector_slot (graph->nodes, 0), 0);
} }
void void
@ -79,3 +81,33 @@ permute (struct graph_node *start)
} }
list_delete_node (position, listtail(position)); list_delete_node (position, listtail(position));
} }
void
pretty_print_graph (struct graph_node *start, int level)
{
// print this node
struct cmd_token *tok = start->data;
fprintf (stdout, "%s[%d] ", tok->text, tok->type);
int numto = vector_active (start->to);
if (numto)
{
if (numto > 1)
fprintf (stdout, "\n");
for (unsigned int i = 0; i < vector_active (start->to); i++)
{
struct graph_node *adj = vector_slot (start->to, i);
// if we're listing multiple children, indent!
if (numto > 1)
for (int j = 0; j < level+1; j++)
fprintf (stdout, " ");
// if this node is a vararg, just print *
if (adj == start)
fprintf (stdout, "*");
else
pretty_print_graph (adj, numto > 1 ? level+1 : level);
}
}
else
fprintf(stdout, "\n");
}