2026-01-21 19:57:44 +01:00
|
|
|
#include "ast.h"
|
|
|
|
|
|
2026-01-09 22:50:09 +00:00
|
|
|
#include <assert.h>
|
2026-01-09 22:36:48 +00:00
|
|
|
#include <stdbool.h>
|
2026-01-22 16:46:33 +01:00
|
|
|
#include <stddef.h>
|
2026-01-14 20:42:31 +01:00
|
|
|
#include <stdio.h>
|
2026-01-09 22:50:09 +00:00
|
|
|
#include <stdlib.h>
|
2026-01-09 22:36:48 +00:00
|
|
|
|
2026-01-22 16:46:33 +01:00
|
|
|
void ast_free(struct ast **node)
|
|
|
|
|
{
|
|
|
|
|
if (!node)
|
|
|
|
|
if (*node == NULL)
|
|
|
|
|
return;
|
|
|
|
|
// ast void does not need to be freed.
|
|
|
|
|
if (ast_is_if(*node))
|
|
|
|
|
ast_free_if(ast_get_if(*node));
|
|
|
|
|
else if (ast_is_command(*node))
|
|
|
|
|
ast_free_command(ast_get_command(*node));
|
|
|
|
|
else if (ast_is_list(*node))
|
|
|
|
|
ast_free_list(ast_get_list(*node));
|
|
|
|
|
else if (ast_is_and_or(*node))
|
|
|
|
|
ast_free_and_or(ast_get_and_or(*node));
|
|
|
|
|
else if (ast_is_redir(*node))
|
|
|
|
|
ast_free_redir(ast_get_redir(*node));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct ast *ast_create(enum ast_type type, void *data)
|
|
|
|
|
{
|
|
|
|
|
struct ast *node = malloc(sizeof(struct ast));
|
|
|
|
|
if (!node)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
node->type = type;
|
|
|
|
|
node->data = data;
|
|
|
|
|
|
|
|
|
|
return node;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* struct ast *ast_create_if(struct ast *condition, struct ast *then_clause,
|
|
|
|
|
struct ast *else_clause)
|
|
|
|
|
{
|
|
|
|
|
struct ast_if *if_data = malloc(sizeof(struct ast_if));
|
|
|
|
|
if (!if_data)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
if_data->condition = condition;
|
|
|
|
|
if_data->then_clause = then_clause;
|
|
|
|
|
if_data->else_clause = else_clause;
|
|
|
|
|
|
|
|
|
|
return ast_create(AST_IF, if_data);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct ast *ast_create_cmd(struct list *cmd)
|
|
|
|
|
{
|
|
|
|
|
struct ast_cmd *cmd_data = malloc(sizeof(struct ast_cmd));
|
|
|
|
|
if (!cmd_data)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
cmd_data->cmd = cmd;
|
|
|
|
|
|
|
|
|
|
return ast_create(AST_CMD, cmd_data);
|
|
|
|
|
} */
|
|
|
|
|
/*
|
|
|
|
|
bool ast_is_if(struct ast *node)
|
|
|
|
|
{
|
|
|
|
|
assert(node != NULL);
|
|
|
|
|
return node->type == AST_IF;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool ast_is_cmd(struct ast *node)
|
|
|
|
|
{
|
|
|
|
|
assert(node != NULL);
|
|
|
|
|
return node->type == AST_CMD;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct ast_if *ast_get_if(struct ast *node)
|
|
|
|
|
{
|
|
|
|
|
assert(node != NULL);
|
|
|
|
|
assert(node->type == AST_IF);
|
|
|
|
|
return (struct ast_if *)node->data;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct ast_cmd *ast_get_cmd(struct ast *node)
|
|
|
|
|
{
|
|
|
|
|
assert(node != NULL);
|
|
|
|
|
assert(node->type == AST_CMD);
|
|
|
|
|
return (struct ast_cmd *)node->data;
|
|
|
|
|
}
|
|
|
|
|
*/
|
2026-01-14 20:42:31 +01:00
|
|
|
static void ast_print_dot_recursive(struct ast *node, FILE *out)
|
|
|
|
|
{
|
|
|
|
|
if (!node)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
switch (node->type)
|
|
|
|
|
{
|
2026-01-22 16:46:33 +01:00
|
|
|
case AST_LIST: {
|
|
|
|
|
struct ast_list *ast_list = ast_get_list(node);
|
|
|
|
|
fprintf(out, " node%p [label=\"LIST\"];\n", (void *)node);
|
|
|
|
|
|
|
|
|
|
struct list *elt = ast_list->children;
|
|
|
|
|
while (elt != NULL)
|
|
|
|
|
{
|
|
|
|
|
struct ast *child = (struct ast *)elt->data;
|
|
|
|
|
fprintf(out, " node%p -> node%p;\n", (void *)node, (void *)child);
|
|
|
|
|
ast_print_dot_recursive(child, out);
|
|
|
|
|
elt = elt->next;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
2026-01-21 19:57:44 +01:00
|
|
|
case AST_IF: {
|
2026-01-14 20:42:31 +01:00
|
|
|
struct ast_if *if_data = ast_get_if(node);
|
|
|
|
|
fprintf(out, " node%p [label=\"IF\"];\n", (void *)node);
|
|
|
|
|
|
|
|
|
|
if (if_data->condition)
|
|
|
|
|
{
|
|
|
|
|
fprintf(out, " node%p -> node%p;\n", (void *)node,
|
|
|
|
|
(void *)if_data->condition);
|
2026-01-21 19:57:44 +01:00
|
|
|
fprintf(out,
|
|
|
|
|
" node%p [fillcolor=\"lightyellow\", style=\"filled\"];\n",
|
2026-01-14 20:42:31 +01:00
|
|
|
(void *)if_data->condition);
|
|
|
|
|
ast_print_dot_recursive(if_data->condition, out);
|
|
|
|
|
|
|
|
|
|
if (if_data->then_clause)
|
|
|
|
|
{
|
|
|
|
|
fprintf(out, " node%p -> node%p [label=\"true\"];\n",
|
2026-01-21 19:57:44 +01:00
|
|
|
(void *)if_data->condition,
|
|
|
|
|
(void *)if_data->then_clause);
|
2026-01-14 20:42:31 +01:00
|
|
|
ast_print_dot_recursive(if_data->then_clause, out);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (if_data->else_clause)
|
|
|
|
|
{
|
|
|
|
|
fprintf(out, " node%p -> node%p [label=\"false\"];\n",
|
2026-01-21 19:57:44 +01:00
|
|
|
(void *)if_data->condition,
|
|
|
|
|
(void *)if_data->else_clause);
|
2026-01-14 20:42:31 +01:00
|
|
|
ast_print_dot_recursive(if_data->else_clause, out);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
2026-01-21 19:57:44 +01:00
|
|
|
case AST_CMD: {
|
2026-01-22 16:46:33 +01:00
|
|
|
struct ast_command *command_data = ast_get_command(node);
|
2026-01-14 20:42:31 +01:00
|
|
|
fprintf(out, " node%p [label=\"", (void *)node);
|
2026-01-22 16:46:33 +01:00
|
|
|
struct list *l = command_data->command;
|
2026-01-14 20:42:31 +01:00
|
|
|
while (l)
|
|
|
|
|
{
|
|
|
|
|
fprintf(out, "%s", (char *)l->data);
|
|
|
|
|
if (l->next)
|
|
|
|
|
fprintf(out, " ");
|
|
|
|
|
l = l->next;
|
|
|
|
|
}
|
|
|
|
|
fprintf(out, "\"];\n");
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case AST_END:
|
|
|
|
|
fprintf(out, " node%p [label=\"END\"];\n", (void *)node);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ast_print_dot(struct ast *ast)
|
|
|
|
|
{
|
|
|
|
|
if (!ast)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
FILE *dot_pipe = popen("dot -Tsvg -o ast.svg", "w");
|
|
|
|
|
if (!dot_pipe)
|
|
|
|
|
{
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fprintf(dot_pipe, "digraph AST {\n");
|
|
|
|
|
ast_print_dot_recursive(ast, dot_pipe);
|
|
|
|
|
fprintf(dot_pipe, "}\n");
|
|
|
|
|
pclose(dot_pipe);
|
2026-01-09 22:50:09 +00:00
|
|
|
}
|