void ast_dump_graphviz(AST a, FILE* f)
{
fprintf(f, "digraph mcxx_ast { \n");
ast_dump_graphviz_rec(a, f, 0, 0);
fprintf(f, "}\n");
}
static void ast_dump_graphviz_rec(AST a, FILE* f, int parent_node, int position)
{
// static char* octagon = "octagon";
// static char* doubleoctagon = "doubleoctagon";
static char* ellipse = "ellipse";
static char* mdiamond = "Mdiamond";
static char* box = "box";
char* shape;
int node_actual = nodes_counter++;
if (a != NULL)
{
// Select shape
shape = box;
if (ASTType(a) == AST_AMBIGUITY) shape = ellipse;
if (ASTType(a) == AST_NODE_LIST) shape = mdiamond;
// if (a->construct_type == CT_SPECIFICATION) shape = ellipse;
// else if (a->construct_type == CT_OMP_SPECIFICATION) shape = mdiamond;
// else if (a->construct_type == CT_EXECUTABLE) shape = octagon;
// else if (a->construct_type == CT_OMP_EXECUTABLE) shape = doubleoctagon;
if (ASTText(a))
{
fprintf(f, "n%d[shape=%s,label=\"%s\\nNode=%p\\nParent=%p\\n%s\\nText: -%s-\"]\n",
node_actual, shape, ast_print_node_type(ASTType(a)), a, ASTParent(a), ast_location(a), ASTText(a));
}
else
{
fprintf(f, "n%d[shape=%s,label=\"%s\\nNode=%p\\nParent=%p\\n%s\"]\n",
node_actual, shape, ast_print_node_type(ASTType(a)), a, ASTParent(a), ast_location(a));
}
if (parent_node != 0)
{
fprintf(f, "n%d -> n%d [label=\"%d\"]\n", parent_node, node_actual, position);
}
if (ASTType(a) != AST_AMBIGUITY)
{
int i;
for(i = 0; i < ASTNumChildren(a); i++)
{
ast_dump_graphviz_rec(ASTChild(a, i),f, node_actual, i);
}
}
else if (ASTType(a) == AST_AMBIGUITY)
{
int i;
for(i = 0; i < ast_get_num_ambiguities(a); i++)
{
ast_dump_graphviz_rec(ast_get_ambiguity(a, i), f, node_actual, i);
}
}
}
else
{
fprintf(f, "n%d[shape=circle,label=\"\",fixedsize=true,style=filled,fillcolor=black,height=0.1,width=0.1]\n", node_actual);
if (parent_node != 0)
{
fprintf(f, "n%d -> n%d [label=\"%d\"]\n", parent_node, node_actual, position);
}
}
}
static void ast_dump_graphviz_rec(AST a, FILE* f, size_t parent_node, int position, char is_extended UNUSED_PARAMETER)
{
// static char* octagon = "octagon";
// static char* doubleoctagon = "doubleoctagon";
static char* ellipse = "ellipse";
static char* mdiamond = "Mdiamond";
static char* box = "box";
char* shape;
// I know this is not exact, but there is a %z qualifier in printf
// while there is not such thing for intptr_t
size_t current_node = (size_t)a;
if (a != NULL)
{
// Select shape
shape = box;
if (ASTType(a) == AST_AMBIGUITY) shape = ellipse;
if (ASTType(a) == AST_NODE_LIST) shape = mdiamond;
// if (a->construct_type == CT_SPECIFICATION) shape = ellipse;
// else if (a->construct_type == CT_OMP_SPECIFICATION) shape = mdiamond;
// else if (a->construct_type == CT_EXECUTABLE) shape = octagon;
// else if (a->construct_type == CT_OMP_EXECUTABLE) shape = doubleoctagon;
if (ASTText(a))
{
char *quoted = quote_protect(ASTText(a));
fprintf(f, "n%zd[shape=%s,label=\"%s\\nNode=%p\\nParent=%p\\n%s\\nText: \\\"%s\\\"\"]\n",
current_node, shape, ast_print_node_type(ASTType(a)), a, ASTParent(a), ast_location(a), quoted);
free(quoted);
}
else
{
fprintf(f, "n%zd[shape=%s,label=\"%s\\nNode=%p\\nParent=%p\\n%s\"]\n",
current_node, shape, ast_print_node_type(ASTType(a)), a, ASTParent(a), ast_location(a));
}
// Print this only for non extended referenced nodes
if (parent_node != 0)
{
fprintf(f, "n%zd -> n%zd [label=\"%d\"]\n", parent_node, current_node, position);
}
if (ASTType(a) != AST_AMBIGUITY)
{
int i;
if (!is_extended)
{
for(i = 0; i < ASTNumChildren(a); i++)
{
if (ASTChild(a, i) != NULL)
{
ast_dump_graphviz_rec(ASTChild(a, i), f, current_node, i, /* is_extended */ is_extended);
}
}
}
// Now print all extended trees referenced here
// First get all TL_AST in 'orig' that point to its childrens
extensible_struct_t* extended_data = ast_get_extensible_struct(a);
if (extended_data != NULL
&& !is_extended)
{
int num_fields = 0;
const char** keys = NULL;
const void** values = NULL;
extensible_struct_get_all_data(extended_data, &num_fields, &keys, &values);
for (i = 0; i < num_fields; i++)
{
const char* field_name = keys[i];
tl_type_t* tl_data = (tl_type_t*)values[i];
if (tl_data->kind == TL_AST)
{
if (tl_data->data._ast != a)
{
ast_dump_graphviz_rec(tl_data->data._ast, f, /* parent_node */ 0, /* position */ 0, /* is_extended */ 1);
}
// Add an edge
fprintf(f, "n%zd -> n%zd [label=\"%s\",style=dashed]\n",
current_node,
(size_t)(tl_data->data._ast),
field_name);
}
}
}
}
else if (ASTType(a) == AST_AMBIGUITY)
{
int i;
for(i = 0; i < ast_get_num_ambiguities(a); i++)
{
ast_dump_graphviz_rec(ast_get_ambiguity(a, i), f, current_node, i, /* is_extended */ 0);
}
}
}
else
{
fprintf(f, "n%zd[shape=circle,label=\"\",fixedsize=true,style=filled,fillcolor=black,height=0.1,width=0.1]\n", current_node);
if (parent_node != 0)
{
fprintf(f, "n%zd -> n%zd [label=\"%d\"]\n", parent_node, current_node, position);
}
}
}