// Some basic operations defined on AST nodes, mainly converting to // strings for debugging. #include #include #include #include "ast.h" #include "stdlib/datatypes.h" #include "stdlib/integers.h" #include "stdlib/tables.h" #include "stdlib/text.h" #include "cordhelpers.h" static const char *OP_NAMES[] = { [BINOP_UNKNOWN]="unknown", [BINOP_POWER]="^", [BINOP_MULT]="*", [BINOP_DIVIDE]="/", [BINOP_MOD]="mod", [BINOP_MOD1]="mod1", [BINOP_PLUS]="+", [BINOP_MINUS]="minus", [BINOP_CONCAT]="++", [BINOP_LSHIFT]="<<", [BINOP_ULSHIFT]="<<<", [BINOP_RSHIFT]=">>", [BINOP_URSHIFT]=">>>", [BINOP_MIN]="min", [BINOP_MAX]="max", [BINOP_EQ]="==", [BINOP_NE]="!=", [BINOP_LT]="<", [BINOP_LE]="<=", [BINOP_GT]=">", [BINOP_GE]=">=", [BINOP_CMP]="<>", [BINOP_AND]="and", [BINOP_OR]="or", [BINOP_XOR]="xor", }; const char *binop_method_names[BINOP_XOR+1] = { [BINOP_POWER]="power", [BINOP_MULT]="times", [BINOP_DIVIDE]="divided_by", [BINOP_MOD]="modulo", [BINOP_MOD1]="modulo1", [BINOP_PLUS]="plus", [BINOP_MINUS]="minus", [BINOP_CONCAT]="concatenated_with", [BINOP_LSHIFT]="left_shifted", [BINOP_RSHIFT]="right_shifted", [BINOP_ULSHIFT]="unsigned_left_shifted", [BINOP_URSHIFT]="unsigned_right_shifted", [BINOP_AND]="bit_and", [BINOP_OR]="bit_or", [BINOP_XOR]="bit_xor", }; static CORD ast_list_to_xml(ast_list_t *asts); static CORD arg_list_to_xml(arg_ast_t *args); static CORD when_clauses_to_xml(when_clause_t *clauses); static CORD tags_to_xml(tag_ast_t *tags); static CORD xml_escape(CORD text); static CORD optional_tagged(const char *tag, ast_t *ast); static CORD optional_tagged_type(const char *tag, type_ast_t *ast); CORD xml_escape(CORD text) { text = CORD_replace(text, "&", "&"); text = CORD_replace(text, "<", "<"); text = CORD_replace(text, ">", ">"); return text; } CORD ast_list_to_xml(ast_list_t *asts) { CORD c = CORD_EMPTY; for (; asts; asts = asts->next) { c = CORD_cat(c, ast_to_xml(asts->ast)); } return c; } CORD arg_list_to_xml(arg_ast_t *args) { CORD c = ""; for (; args; args = args->next) { CORD arg_cord = args->name ? CORD_all("name, "\">") : ""; if (args->type) arg_cord = CORD_all(arg_cord, "", type_ast_to_xml(args->type), ""); if (args->value) arg_cord = CORD_all(arg_cord, "", ast_to_xml(args->value), ""); c = CORD_all(c, arg_cord, ""); } return CORD_cat(c, ""); } CORD when_clauses_to_xml(when_clause_t *clauses) { CORD c = CORD_EMPTY; for (; clauses; clauses = clauses->next) { c = CORD_all(c, "", ast_to_xml(clauses->pattern), ast_to_xml(clauses->body), ""); } return c; } CORD tags_to_xml(tag_ast_t *tags) { CORD c = CORD_EMPTY; for (; tags; tags = tags->next) { c = CORD_all(c, "name, "\">", arg_list_to_xml(tags->fields), ""); } return c; } CORD optional_tagged(const char *tag, ast_t *ast) { return ast ? CORD_all("<", tag, ">", ast_to_xml(ast), "") : CORD_EMPTY; } CORD optional_tagged_type(const char *tag, type_ast_t *ast) { return ast ? CORD_all("<", tag, ">", type_ast_to_xml(ast), "") : CORD_EMPTY; } CORD ast_to_xml(ast_t *ast) { if (!ast) return CORD_EMPTY; switch (ast->tag) { #define T(type, ...) case type: { auto data = ast->__data.type; (void)data; return CORD_asprintf(__VA_ARGS__); } T(Unknown, "") T(None, "%r", type_ast_to_xml(data.type)) T(Bool, "", data.b ? "yes" : "no") T(Var, "%s", data.name) T(Int, "%s", data.str) T(Num, "%g", data.n) T(TextLiteral, "%r", xml_escape(data.cord)) T(TextJoin, "%r", data.lang ? CORD_all(" lang=\"", data.lang, "\"") : CORD_EMPTY, ast_list_to_xml(data.children)) T(Path, "%s", data.path) T(Declare, "%r", ast_to_xml(data.var), ast_to_xml(data.value)) T(Assign, "%r%r", ast_list_to_xml(data.targets), ast_list_to_xml(data.values)) T(BinaryOp, "%r %r", xml_escape(OP_NAMES[data.op]), ast_to_xml(data.lhs), ast_to_xml(data.rhs)) T(UpdateAssign, "%r %r", xml_escape(OP_NAMES[data.op]), ast_to_xml(data.lhs), ast_to_xml(data.rhs)) T(Negative, "%r", ast_to_xml(data.value)) T(Not, "%r", ast_to_xml(data.value)) T(HeapAllocate, "%r", ast_to_xml(data.value)) T(StackReference, "%r", ast_to_xml(data.value)) T(Mutexed, "%r", ast_to_xml(data.value)) T(Holding, "%r%r", ast_to_xml(data.mutexed), ast_to_xml(data.body)) T(Min, "%r%r%r", ast_to_xml(data.lhs), ast_to_xml(data.rhs), optional_tagged("key", data.key)) T(Max, "%r%r%r", ast_to_xml(data.lhs), ast_to_xml(data.rhs), optional_tagged("key", data.key)) T(Array, "%r%r", optional_tagged_type("item-type", data.item_type), ast_list_to_xml(data.items)) T(Set, "%r%r", optional_tagged_type("item-type", data.item_type), ast_list_to_xml(data.items)) T(Table, "%r%r%r%r
", optional_tagged_type("key-type", data.key_type), optional_tagged_type("value-type", data.value_type), optional_tagged("default-value", data.default_value), ast_list_to_xml(data.entries), optional_tagged("fallback", data.fallback)) T(TableEntry, "%r%r", ast_to_xml(data.key), ast_to_xml(data.value)) T(Comprehension, "%r%r%r%r%r", optional_tagged("expr", data.expr), ast_list_to_xml(data.vars), optional_tagged("iter", data.iter), optional_tagged("filter", data.filter)) T(FunctionDef, "%r%r%r", ast_to_xml(data.name), arg_list_to_xml(data.args), optional_tagged_type("return-type", data.ret_type), ast_to_xml(data.body)) T(ConvertDef, "%r%r%r", arg_list_to_xml(data.args), optional_tagged_type("return-type", data.ret_type), ast_to_xml(data.body)) T(Lambda, "%r%r%r)", arg_list_to_xml(data.args), optional_tagged_type("return-type", data.ret_type), ast_to_xml(data.body)) T(FunctionCall, "%r%r", ast_to_xml(data.fn), arg_list_to_xml(data.args)) T(MethodCall, "%r%s%r", ast_to_xml(data.self), data.name, arg_list_to_xml(data.args)) T(Block, "%r", ast_list_to_xml(data.statements)) T(For, "%r%r%r%r%r", ast_list_to_xml(data.vars), optional_tagged("iterable", data.iter), optional_tagged("body", data.body), optional_tagged("empty", data.empty)) T(While, "%r%r", optional_tagged("condition", data.condition), optional_tagged("body", data.body)) T(Repeat, "%r", optional_tagged("body", data.body)) T(If, "%r%r%r", optional_tagged("condition", data.condition), optional_tagged("body", data.body), optional_tagged("else", data.else_body)) T(When, "%r%r%r", ast_to_xml(data.subject), when_clauses_to_xml(data.clauses), optional_tagged("else", data.else_body)) T(Reduction, "%r", xml_escape(OP_NAMES[data.op]), optional_tagged("key", data.key), optional_tagged("iterable", data.iter)) T(Skip, "%r", data.target) T(Stop, "%r", data.target) T(PrintStatement, "%r", ast_list_to_xml(data.to_print)) T(Pass, "") T(Defer, "%r", ast_to_xml(data.body)) T(Return, "%r", ast_to_xml(data.value)) T(Extern, "%r", data.name, type_ast_to_xml(data.type)) T(StructDef, "%r%r", data.name, arg_list_to_xml(data.fields), ast_to_xml(data.namespace)) T(EnumDef, "%r%r", data.name, tags_to_xml(data.tags), ast_to_xml(data.namespace)) T(LangDef, "%r", data.name, ast_to_xml(data.namespace)) T(Index, "%r%r", optional_tagged("indexed", data.indexed), optional_tagged("index", data.index)) T(FieldAccess, "%r", data.field, ast_to_xml(data.fielded)) T(Optional, "%r", ast_to_xml(data.value)) T(NonOptional, "%r", ast_to_xml(data.value)) T(Moment, "") T(DocTest, "%r%r", optional_tagged("expression", data.expr), xml_escape(data.output)) T(Use, "%r%r", optional_tagged("var", data.var), xml_escape(data.path)) T(InlineCCode, "%r", xml_escape(data.code)) T(Deserialize, "%r%r", type_ast_to_xml(data.type), ast_to_xml(data.value)) default: return "???"; #undef T } } CORD type_ast_to_xml(type_ast_t *t) { if (!t) return "NULL"; switch (t->tag) { #define T(type, ...) case type: { auto data = t->__data.type; (void)data; return CORD_asprintf(__VA_ARGS__); } T(UnknownTypeAST, "") T(VarTypeAST, "%s", data.name) T(PointerTypeAST, "%r", data.is_stack ? "yes" : "no", type_ast_to_xml(data.pointed)) T(ArrayTypeAST, "%r", type_ast_to_xml(data.item)) T(SetTypeAST, "%r", type_ast_to_xml(data.item)) T(TableTypeAST, "%r %r", type_ast_to_xml(data.key), type_ast_to_xml(data.value)) T(FunctionTypeAST, "%r %r", arg_list_to_xml(data.args), type_ast_to_xml(data.ret)) T(OptionalTypeAST, "%r", data.type) T(MutexedTypeAST, "%r", data.type) #undef T default: return CORD_EMPTY; } } int printf_ast(FILE *stream, const struct printf_info *info, const void *const args[]) { ast_t *ast = *(ast_t**)(args[0]); if (ast) { if (info->alt) return fprintf(stream, "%.*s", (int)(ast->end - ast->start), ast->start); else return CORD_put(ast_to_xml(ast), stream); } else { return fputs("(null)", stream); } } PUREFUNC bool is_idempotent(ast_t *ast) { switch (ast->tag) { case Int: case Bool: case Num: case Var: case None: case TextLiteral: return true; case Index: { auto index = Match(ast, Index); return is_idempotent(index->indexed) && index->index != NULL && is_idempotent(index->index); } case FieldAccess: { auto access = Match(ast, FieldAccess); return is_idempotent(access->fielded); } default: return false; } } void _visit_topologically(ast_t *ast, Table_t definitions, Table_t *visited, Closure_t fn) { void (*visit)(void*, ast_t*) = (void*)fn.fn; if (ast->tag == StructDef) { auto def = Match(ast, StructDef); if (Table$str_get(*visited, def->name)) return; Table$str_set(visited, def->name, (void*)_visit_topologically); for (arg_ast_t *field = def->fields; field; field = field->next) { if (field->type && field->type->tag == VarTypeAST) { const char *field_type_name = Match(field->type, VarTypeAST)->name; ast_t *dependency = Table$str_get(definitions, field_type_name); if (dependency) { _visit_topologically(dependency, definitions, visited, fn); } } } visit(fn.userdata, ast); } else if (ast->tag == EnumDef) { auto def = Match(ast, EnumDef); if (Table$str_get(*visited, def->name)) return; Table$str_set(visited, def->name, (void*)_visit_topologically); for (tag_ast_t *tag = def->tags; tag; tag = tag->next) { for (arg_ast_t *field = tag->fields; field; field = field->next) { if (field->type && field->type->tag == VarTypeAST) { const char *field_type_name = Match(field->type, VarTypeAST)->name; ast_t *dependency = Table$str_get(definitions, field_type_name); if (dependency) { _visit_topologically(dependency, definitions, visited, fn); } } } } visit(fn.userdata, ast); } else if (ast->tag == LangDef) { auto def = Match(ast, LangDef); if (Table$str_get(*visited, def->name)) return; visit(fn.userdata, ast); } else { visit(fn.userdata, ast); } } void visit_topologically(ast_list_t *asts, Closure_t fn) { // Visit each top-level statement in topological order: // - 'use' statements first // - then typedefs // - visiting typedefs' dependencies first // - then function/variable declarations Table_t definitions = {}; for (ast_list_t *stmt = asts; stmt; stmt = stmt->next) { if (stmt->ast->tag == StructDef) { auto def = Match(stmt->ast, StructDef); Table$str_set(&definitions, def->name, stmt->ast); } else if (stmt->ast->tag == EnumDef) { auto def = Match(stmt->ast, EnumDef); Table$str_set(&definitions, def->name, stmt->ast); } else if (stmt->ast->tag == LangDef) { auto def = Match(stmt->ast, LangDef); Table$str_set(&definitions, def->name, stmt->ast); } } void (*visit)(void*, ast_t*) = (void*)fn.fn; Table_t visited = {}; // First: 'use' statements in order: for (ast_list_t *stmt = asts; stmt; stmt = stmt->next) { if (stmt->ast->tag == Use || (stmt->ast->tag == Declare && Match(stmt->ast, Declare)->value->tag == Use)) visit(fn.userdata, stmt->ast); } // Then typedefs in topological order: for (ast_list_t *stmt = asts; stmt; stmt = stmt->next) { if (stmt->ast->tag == StructDef || stmt->ast->tag == EnumDef || stmt->ast->tag == LangDef) _visit_topologically(stmt->ast, definitions, &visited, fn); } // Then everything else in order: for (ast_list_t *stmt = asts; stmt; stmt = stmt->next) { if (!(stmt->ast->tag == StructDef || stmt->ast->tag == EnumDef || stmt->ast->tag == LangDef || stmt->ast->tag == Use || (stmt->ast->tag == Declare && Match(stmt->ast, Declare)->value->tag == Use))) { visit(fn.userdata, stmt->ast); } } } // vim: ts=4 sw=0 et cino=L2,l1,(0,W4,m1,\:0