| author | |
| committer | |
| log | 024052b4483b13639e998ef34dc097a24860c612 |
| tree | 267af11f1d492a1c532a671079ade5520564299a |
| parent | 9ca9a2c5540683a54bae597c59152d06d095beef |
14 files changed, 358 insertions(+), 127 deletions(-)
README.md+5-4| ... | ... | @@ -27,12 +27,11 @@ readable, safe, optimal, and concise code to solve any computing problem. |
| 27 | 27 | * Source code is UTF-8. |
| 28 | 28 | * Shebang line OK so language can be used for "scripting" as well. |
| 29 | 29 | * Ability to mark functions as test and automatically run them in test mode. |
| 30 | This mode should automatically provide test coverage. | |
| 30 | 31 | * Memory zeroed by default, unless you initialize with "uninitialized". |
| 31 | 32 | |
| 32 | 33 | ## Roadmap |
| 33 | 34 | |
| 34 | * pub/private/export functions | |
| 35 | * make sure that release mode optimizes out empty private functions | |
| 36 | 35 | * test framework to test for compile errors |
| 37 | 36 | * Simple .so library |
| 38 | 37 | * Multiple files |
| ... | ... | @@ -69,11 +68,13 @@ TopLevelDecl : FnDef | ExternBlock |
| 69 | 68 | |
| 70 | 69 | ExternBlock : many(Directive) token(Extern) token(LBrace) many(FnDecl) token(RBrace) |
| 71 | 70 | |
| 72 | FnProto : token(Fn) token(Symbol) ParamDeclList option(token(Arrow) Type) | |
| 71 | FnProto : many(Directive) option(FnVisibleMod) token(Fn) token(Symbol) ParamDeclList option(token(Arrow) Type) | |
| 72 | ||
| 73 | FnVisibleMod : token(Pub) | token(Export) | |
| 73 | 74 | |
| 74 | 75 | FnDecl : FnProto token(Semicolon) |
| 75 | 76 | |
| 76 | FnDef : many(Directive) FnProto Block | |
| 77 | FnDef : FnProto Block | |
| 77 | 78 | |
| 78 | 79 | ParamDeclList : token(LParen) list(ParamDecl, token(Comma)) token(RParen) |
| 79 | 80 |
doc/vim/syntax/zig.vim+1-1| ... | ... | @@ -7,7 +7,7 @@ if exists("b:current_syntax") |
| 7 | 7 | finish |
| 8 | 8 | endif |
| 9 | 9 | |
| 10 | syn keyword zigKeyword fn return mut const extern unreachable | |
| 10 | syn keyword zigKeyword fn return mut const extern unreachable export pub | |
| 11 | 11 | |
| 12 | 12 | let b:current_syntax = "zig" |
| 13 | 13 |
example/hello.zig created+10| ... | ... | @@ -0,0 +1,10 @@ |
| 1 | #link("c") | |
| 2 | extern { | |
| 3 | fn puts(s: *mut u8) -> i32; | |
| 4 | fn exit(code: i32) -> unreachable; | |
| 5 | } | |
| 6 | ||
| 7 | export fn _start() -> unreachable { | |
| 8 | puts("Hello, world!"); | |
| 9 | exit(0); | |
| 10 | } |
src/codegen.cpp+34-14| ... | ... | @@ -26,6 +26,7 @@ struct FnTableEntry { |
| 26 | 26 | AstNode *fn_def_node; |
| 27 | 27 | bool is_extern; |
| 28 | 28 | bool internal_linkage; |
| 29 | unsigned calling_convention; | |
| 29 | 30 | }; |
| 30 | 31 | |
| 31 | 32 | enum TypeId { |
| ... | ... | @@ -51,7 +52,7 @@ struct TypeTableEntry { |
| 51 | 52 | }; |
| 52 | 53 | |
| 53 | 54 | struct CodeGen { |
| 54 | LLVMModuleRef mod; | |
| 55 | LLVMModuleRef module; | |
| 55 | 56 | AstNode *root; |
| 56 | 57 | ZigList<ErrorMsg> errors; |
| 57 | 58 | LLVMBuilderRef builder; |
| ... | ... | @@ -228,6 +229,7 @@ static void find_declarations(CodeGen *g, AstNode *node) { |
| 228 | 229 | FnTableEntry *fn_table_entry = allocate<FnTableEntry>(1); |
| 229 | 230 | fn_table_entry->proto_node = fn_proto; |
| 230 | 231 | fn_table_entry->is_extern = true; |
| 232 | fn_table_entry->calling_convention = LLVMCCallConv; | |
| 231 | 233 | g->fn_table.put(name, fn_table_entry); |
| 232 | 234 | } |
| 233 | 235 | break; |
| ... | ... | @@ -244,6 +246,12 @@ static void find_declarations(CodeGen *g, AstNode *node) { |
| 244 | 246 | FnTableEntry *fn_table_entry = allocate<FnTableEntry>(1); |
| 245 | 247 | fn_table_entry->proto_node = proto_node; |
| 246 | 248 | fn_table_entry->fn_def_node = node; |
| 249 | fn_table_entry->internal_linkage = proto_node->data.fn_proto.visib_mod != FnProtoVisibModExport; | |
| 250 | if (fn_table_entry->internal_linkage) { | |
| 251 | fn_table_entry->calling_convention = LLVMFastCallConv; | |
| 252 | } else { | |
| 253 | fn_table_entry->calling_convention = LLVMCCallConv; | |
| 254 | } | |
| 247 | 255 | g->fn_table.put(proto_name, fn_table_entry); |
| 248 | 256 | g->fn_defs.append(fn_table_entry); |
| 249 | 257 | |
| ... | ... | @@ -512,12 +520,12 @@ void semantic_analyze(CodeGen *g) { |
| 512 | 520 | g->target_data_ref = LLVMGetTargetMachineData(g->target_machine); |
| 513 | 521 | |
| 514 | 522 | |
| 515 | g->mod = LLVMModuleCreateWithName("ZigModule"); | |
| 523 | g->module = LLVMModuleCreateWithName("ZigModule"); | |
| 516 | 524 | |
| 517 | 525 | g->pointer_size_bytes = LLVMPointerSize(g->target_data_ref); |
| 518 | 526 | |
| 519 | 527 | g->builder = LLVMCreateBuilder(); |
| 520 | g->dbuilder = new llvm::DIBuilder(*llvm::unwrap(g->mod), true); | |
| 528 | g->dbuilder = new llvm::DIBuilder(*llvm::unwrap(g->module), true); | |
| 521 | 529 | |
| 522 | 530 | |
| 523 | 531 | add_types(g); |
| ... | ... | @@ -550,8 +558,8 @@ static LLVMValueRef gen_fn_call(CodeGen *g, AstNode *fn_call_node) { |
| 550 | 558 | } |
| 551 | 559 | |
| 552 | 560 | add_debug_source_node(g, fn_call_node); |
| 553 | LLVMValueRef result = LLVMBuildCall(g->builder, fn_table_entry->fn_value, | |
| 554 | param_values, actual_param_count, ""); | |
| 561 | LLVMValueRef result = LLVMZigBuildCall(g->builder, fn_table_entry->fn_value, | |
| 562 | param_values, actual_param_count, fn_table_entry->calling_convention, ""); | |
| 555 | 563 | |
| 556 | 564 | if (type_is_unreachable(fn_table_entry->proto_node->data.fn_proto.return_type)) { |
| 557 | 565 | return LLVMBuildUnreachable(g->builder); |
| ... | ... | @@ -566,7 +574,7 @@ static LLVMValueRef find_or_create_string(CodeGen *g, Buf *str) { |
| 566 | 574 | return entry->value; |
| 567 | 575 | } |
| 568 | 576 | LLVMValueRef text = LLVMConstString(buf_ptr(str), buf_len(str), false); |
| 569 | LLVMValueRef global_value = LLVMAddGlobal(g->mod, LLVMTypeOf(text), ""); | |
| 577 | LLVMValueRef global_value = LLVMAddGlobal(g->module, LLVMTypeOf(text), ""); | |
| 570 | 578 | LLVMSetLinkage(global_value, LLVMPrivateLinkage); |
| 571 | 579 | LLVMSetInitializer(global_value, text); |
| 572 | 580 | LLVMSetGlobalConstant(global_value, true); |
| ... | ... | @@ -615,6 +623,8 @@ static void gen_block(CodeGen *g, AstNode *block_node, bool add_implicit_return) |
| 615 | 623 | g->di_file, block_node->line + 1, block_node->column + 1); |
| 616 | 624 | g->block_scopes.append(di_block); |
| 617 | 625 | |
| 626 | add_debug_source_node(g, block_node); | |
| 627 | ||
| 618 | 628 | for (int i = 0; i < block_node->data.block.statements.length; i += 1) { |
| 619 | 629 | AstNode *statement_node = block_node->data.block.statements.at(i); |
| 620 | 630 | switch (statement_node->type) { |
| ... | ... | @@ -714,16 +724,15 @@ void code_gen(CodeGen *g) { |
| 714 | 724 | param_types[param_decl_i] = to_llvm_type(type_node); |
| 715 | 725 | } |
| 716 | 726 | LLVMTypeRef function_type = LLVMFunctionType(ret_type, param_types, fn_proto->params.length, 0); |
| 717 | LLVMValueRef fn = LLVMAddFunction(g->mod, buf_ptr(&fn_proto->name), function_type); | |
| 727 | LLVMValueRef fn = LLVMAddFunction(g->module, buf_ptr(&fn_proto->name), function_type); | |
| 718 | 728 | |
| 719 | LLVMSetLinkage(fn, fn_table_entry->internal_linkage ? LLVMPrivateLinkage : LLVMExternalLinkage); | |
| 729 | LLVMSetLinkage(fn, fn_table_entry->internal_linkage ? LLVMInternalLinkage : LLVMExternalLinkage); | |
| 720 | 730 | |
| 721 | 731 | if (type_is_unreachable(fn_proto->return_type)) { |
| 722 | 732 | LLVMAddFunctionAttr(fn, LLVMNoReturnAttribute); |
| 723 | 733 | } |
| 724 | if (fn_table_entry->is_extern) { | |
| 725 | LLVMSetFunctionCallConv(fn, LLVMCCallConv); | |
| 726 | } else { | |
| 734 | LLVMSetFunctionCallConv(fn, fn_table_entry->calling_convention); | |
| 735 | if (!fn_table_entry->is_extern) { | |
| 727 | 736 | LLVMAddFunctionAttr(fn, LLVMNoUnwindAttribute); |
| 728 | 737 | } |
| 729 | 738 | |
| ... | ... | @@ -768,10 +777,19 @@ void code_gen(CodeGen *g) { |
| 768 | 777 | |
| 769 | 778 | g->dbuilder->finalize(); |
| 770 | 779 | |
| 771 | LLVMDumpModule(g->mod); | |
| 780 | LLVMDumpModule(g->module); | |
| 772 | 781 | |
| 782 | // in release mode, we're sooooo confident that we've generated correct ir, | |
| 783 | // that we skip the verify module step in order to get better performance. | |
| 784 | #ifndef NDEBUG | |
| 773 | 785 | char *error = nullptr; |
| 774 | LLVMVerifyModule(g->mod, LLVMAbortProcessAction, &error); | |
| 786 | LLVMVerifyModule(g->module, LLVMAbortProcessAction, &error); | |
| 787 | #endif | |
| 788 | } | |
| 789 | ||
| 790 | void code_gen_optimize(CodeGen *g) { | |
| 791 | LLVMZigOptimizeModule(g->target_machine, g->module); | |
| 792 | LLVMDumpModule(g->module); | |
| 775 | 793 | } |
| 776 | 794 | |
| 777 | 795 | ZigList<ErrorMsg> *codegen_error_messages(CodeGen *g) { |
| ... | ... | @@ -907,7 +925,9 @@ void code_gen_link(CodeGen *g, const char *out_file) { |
| 907 | 925 | buf_append_str(&out_file_o, ".o"); |
| 908 | 926 | |
| 909 | 927 | char *err_msg = nullptr; |
| 910 | if (LLVMTargetMachineEmitToFile(g->target_machine, g->mod, buf_ptr(&out_file_o), LLVMObjectFile, &err_msg)) { | |
| 928 | if (LLVMZigTargetMachineEmitToFile(g->target_machine, g->module, buf_ptr(&out_file_o), | |
| 929 | LLVMObjectFile, &err_msg)) | |
| 930 | { | |
| 911 | 931 | zig_panic("unable to write object file: %s", err_msg); |
| 912 | 932 | } |
| 913 | 933 |
src/codegen.hpp+2| ... | ... | @@ -33,6 +33,8 @@ void codegen_set_strip(CodeGen *codegen, bool strip); |
| 33 | 33 | |
| 34 | 34 | void semantic_analyze(CodeGen *g); |
| 35 | 35 | |
| 36 | void code_gen_optimize(CodeGen *g); | |
| 37 | ||
| 36 | 38 | void code_gen(CodeGen *g); |
| 37 | 39 | |
| 38 | 40 | void code_gen_link(CodeGen *g, const char *out_file); |
src/main.cpp+6| ... | ... | @@ -118,6 +118,12 @@ static int build(const char *arg0, const char *in_file, const char *out_file, |
| 118 | 118 | fprintf(stderr, "------------------\n"); |
| 119 | 119 | code_gen(codegen); |
| 120 | 120 | |
| 121 | if (release) { | |
| 122 | fprintf(stderr, "\nOptimization:\n"); | |
| 123 | fprintf(stderr, "---------------\n"); | |
| 124 | code_gen_optimize(codegen); | |
| 125 | } | |
| 126 | ||
| 121 | 127 | fprintf(stderr, "\nLink:\n"); |
| 122 | 128 | fprintf(stderr, "-------\n"); |
| 123 | 129 | code_gen_link(codegen, out_file); |
src/parser.cpp+140-94| ... | ... | @@ -268,6 +268,53 @@ static void ast_expect_token(ParseContext *pc, Token *token, TokenId token_id) { |
| 268 | 268 | } |
| 269 | 269 | } |
| 270 | 270 | |
| 271 | static AstNode *ast_parse_directive(ParseContext *pc, int token_index, int *new_token_index) { | |
| 272 | Token *number_sign = &pc->tokens->at(token_index); | |
| 273 | token_index += 1; | |
| 274 | ast_expect_token(pc, number_sign, TokenIdNumberSign); | |
| 275 | ||
| 276 | AstNode *node = ast_create_node(NodeTypeDirective, number_sign); | |
| 277 | ||
| 278 | Token *name_symbol = &pc->tokens->at(token_index); | |
| 279 | token_index += 1; | |
| 280 | ast_expect_token(pc, name_symbol, TokenIdSymbol); | |
| 281 | ||
| 282 | ast_buf_from_token(pc, name_symbol, &node->data.directive.name); | |
| 283 | ||
| 284 | Token *l_paren = &pc->tokens->at(token_index); | |
| 285 | token_index += 1; | |
| 286 | ast_expect_token(pc, l_paren, TokenIdLParen); | |
| 287 | ||
| 288 | Token *param_str = &pc->tokens->at(token_index); | |
| 289 | token_index += 1; | |
| 290 | ast_expect_token(pc, param_str, TokenIdStringLiteral); | |
| 291 | ||
| 292 | parse_string_literal(pc, param_str, &node->data.directive.param); | |
| 293 | ||
| 294 | Token *r_paren = &pc->tokens->at(token_index); | |
| 295 | token_index += 1; | |
| 296 | ast_expect_token(pc, r_paren, TokenIdRParen); | |
| 297 | ||
| 298 | *new_token_index = token_index; | |
| 299 | return node; | |
| 300 | } | |
| 301 | ||
| 302 | static void ast_parse_directives(ParseContext *pc, int *token_index, | |
| 303 | ZigList<AstNode *> *directives) | |
| 304 | { | |
| 305 | for (;;) { | |
| 306 | Token *token = &pc->tokens->at(*token_index); | |
| 307 | if (token->id == TokenIdNumberSign) { | |
| 308 | AstNode *directive_node = ast_parse_directive(pc, *token_index, token_index); | |
| 309 | directives->append(directive_node); | |
| 310 | } else { | |
| 311 | return; | |
| 312 | } | |
| 313 | } | |
| 314 | zig_unreachable(); | |
| 315 | } | |
| 316 | ||
| 317 | ||
| 271 | 318 | /* |
| 272 | 319 | Type : token(Symbol) | PointerType | token(Unreachable) |
| 273 | 320 | PointerType : token(Star) token(Const) Type | token(Star) token(Mut) Type; |
| ... | ... | @@ -500,48 +547,74 @@ static AstNode *ast_parse_block(ParseContext *pc, int token_index, int *new_toke |
| 500 | 547 | } |
| 501 | 548 | |
| 502 | 549 | /* |
| 503 | FnProto : token(Fn) token(Symbol) ParamDeclList option(token(Arrow) Type) | |
| 550 | FnProto : many(Directive) option(FnVisibleMod) token(Fn) token(Symbol) ParamDeclList option(token(Arrow) Type) | |
| 504 | 551 | */ |
| 505 | static AstNode *ast_parse_fn_proto(ParseContext *pc, int token_index, int *new_token_index) { | |
| 506 | Token *fn_token = &pc->tokens->at(token_index); | |
| 507 | token_index += 1; | |
| 508 | ast_expect_token(pc, fn_token, TokenIdKeywordFn); | |
| 552 | static AstNode *ast_parse_fn_proto(ParseContext *pc, int *token_index, bool mandatory) { | |
| 553 | Token *token = &pc->tokens->at(*token_index); | |
| 509 | 554 | |
| 510 | AstNode *node = ast_create_node(NodeTypeFnProto, fn_token); | |
| 555 | FnProtoVisibMod visib_mod; | |
| 511 | 556 | |
| 557 | if (token->id == TokenIdKeywordPub) { | |
| 558 | visib_mod = FnProtoVisibModPub; | |
| 559 | *token_index += 1; | |
| 512 | 560 | |
| 513 | Token *fn_name = &pc->tokens->at(token_index); | |
| 514 | token_index += 1; | |
| 561 | Token *fn_token = &pc->tokens->at(*token_index); | |
| 562 | *token_index += 1; | |
| 563 | ast_expect_token(pc, fn_token, TokenIdKeywordFn); | |
| 564 | } else if (token->id == TokenIdKeywordExport) { | |
| 565 | visib_mod = FnProtoVisibModExport; | |
| 566 | *token_index += 1; | |
| 567 | ||
| 568 | Token *fn_token = &pc->tokens->at(*token_index); | |
| 569 | *token_index += 1; | |
| 570 | ast_expect_token(pc, fn_token, TokenIdKeywordFn); | |
| 571 | } else if (token->id == TokenIdKeywordFn) { | |
| 572 | visib_mod = FnProtoVisibModPrivate; | |
| 573 | *token_index += 1; | |
| 574 | } else if (mandatory) { | |
| 575 | ast_invalid_token_error(pc, token); | |
| 576 | } else { | |
| 577 | return nullptr; | |
| 578 | } | |
| 579 | ||
| 580 | AstNode *node = ast_create_node(NodeTypeFnProto, token); | |
| 581 | node->data.fn_proto.visib_mod = visib_mod; | |
| 582 | node->data.fn_proto.directives = pc->directive_list; | |
| 583 | pc->directive_list = nullptr; | |
| 584 | ||
| 585 | ||
| 586 | Token *fn_name = &pc->tokens->at(*token_index); | |
| 587 | *token_index += 1; | |
| 515 | 588 | ast_expect_token(pc, fn_name, TokenIdSymbol); |
| 516 | 589 | |
| 517 | 590 | ast_buf_from_token(pc, fn_name, &node->data.fn_proto.name); |
| 518 | 591 | |
| 519 | 592 | |
| 520 | ast_parse_param_decl_list(pc, token_index, &token_index, &node->data.fn_proto.params); | |
| 593 | ast_parse_param_decl_list(pc, *token_index, token_index, &node->data.fn_proto.params); | |
| 521 | 594 | |
| 522 | Token *arrow = &pc->tokens->at(token_index); | |
| 595 | Token *arrow = &pc->tokens->at(*token_index); | |
| 523 | 596 | if (arrow->id == TokenIdArrow) { |
| 524 | token_index += 1; | |
| 525 | node->data.fn_proto.return_type = ast_parse_type(pc, token_index, &token_index); | |
| 597 | *token_index += 1; | |
| 598 | node->data.fn_proto.return_type = ast_parse_type(pc, *token_index, token_index); | |
| 526 | 599 | } else { |
| 527 | 600 | node->data.fn_proto.return_type = ast_create_void_type_node(pc, arrow); |
| 528 | 601 | } |
| 529 | 602 | |
| 530 | *new_token_index = token_index; | |
| 531 | 603 | return node; |
| 532 | 604 | } |
| 533 | 605 | |
| 534 | 606 | /* |
| 535 | 607 | FnDef : FnProto Block |
| 536 | 608 | */ |
| 537 | static AstNode *ast_parse_fn_def(ParseContext *pc, int token_index, int *new_token_index) { | |
| 538 | AstNode *fn_proto = ast_parse_fn_proto(pc, token_index, &token_index); | |
| 609 | static AstNode *ast_parse_fn_def(ParseContext *pc, int *token_index, bool mandatory) { | |
| 610 | AstNode *fn_proto = ast_parse_fn_proto(pc, token_index, mandatory); | |
| 611 | if (!fn_proto) | |
| 612 | return nullptr; | |
| 539 | 613 | AstNode *node = ast_create_node_with_node(NodeTypeFnDef, fn_proto); |
| 540 | 614 | |
| 541 | 615 | node->data.fn_def.fn_proto = fn_proto; |
| 542 | node->data.fn_def.body = ast_parse_block(pc, token_index, &token_index); | |
| 616 | node->data.fn_def.body = ast_parse_block(pc, *token_index, token_index); | |
| 543 | 617 | |
| 544 | *new_token_index = token_index; | |
| 545 | 618 | return node; |
| 546 | 619 | } |
| 547 | 620 | |
| ... | ... | @@ -549,7 +622,7 @@ static AstNode *ast_parse_fn_def(ParseContext *pc, int token_index, int *new_tok |
| 549 | 622 | FnDecl : FnProto token(Semicolon) |
| 550 | 623 | */ |
| 551 | 624 | static AstNode *ast_parse_fn_decl(ParseContext *pc, int token_index, int *new_token_index) { |
| 552 | AstNode *fn_proto = ast_parse_fn_proto(pc, token_index, &token_index); | |
| 625 | AstNode *fn_proto = ast_parse_fn_proto(pc, &token_index, true); | |
| 553 | 626 | AstNode *node = ast_create_node_with_node(NodeTypeFnDecl, fn_proto); |
| 554 | 627 | |
| 555 | 628 | node->data.fn_decl.fn_proto = fn_proto; |
| ... | ... | @@ -565,78 +638,45 @@ static AstNode *ast_parse_fn_decl(ParseContext *pc, int token_index, int *new_to |
| 565 | 638 | /* |
| 566 | 639 | Directive : token(NumberSign) token(Symbol) token(LParen) token(String) token(RParen) |
| 567 | 640 | */ |
| 568 | static AstNode *ast_parse_directive(ParseContext *pc, int token_index, int *new_token_index) { | |
| 569 | Token *number_sign = &pc->tokens->at(token_index); | |
| 570 | token_index += 1; | |
| 571 | ast_expect_token(pc, number_sign, TokenIdNumberSign); | |
| 572 | ||
| 573 | AstNode *node = ast_create_node(NodeTypeDirective, number_sign); | |
| 574 | ||
| 575 | Token *name_symbol = &pc->tokens->at(token_index); | |
| 576 | token_index += 1; | |
| 577 | ast_expect_token(pc, name_symbol, TokenIdSymbol); | |
| 578 | ||
| 579 | ast_buf_from_token(pc, name_symbol, &node->data.directive.name); | |
| 580 | ||
| 581 | Token *l_paren = &pc->tokens->at(token_index); | |
| 582 | token_index += 1; | |
| 583 | ast_expect_token(pc, l_paren, TokenIdLParen); | |
| 584 | ||
| 585 | Token *param_str = &pc->tokens->at(token_index); | |
| 586 | token_index += 1; | |
| 587 | ast_expect_token(pc, param_str, TokenIdStringLiteral); | |
| 588 | ||
| 589 | parse_string_literal(pc, param_str, &node->data.directive.param); | |
| 590 | ||
| 591 | Token *r_paren = &pc->tokens->at(token_index); | |
| 592 | token_index += 1; | |
| 593 | ast_expect_token(pc, r_paren, TokenIdRParen); | |
| 594 | ||
| 595 | *new_token_index = token_index; | |
| 596 | return node; | |
| 597 | } | |
| 598 | ||
| 599 | static void ast_parse_directives(ParseContext *pc, int token_index, int *new_token_index, | |
| 600 | ZigList<AstNode *> *directives) | |
| 601 | { | |
| 602 | for (;;) { | |
| 603 | Token *token = &pc->tokens->at(token_index); | |
| 604 | if (token->id == TokenIdNumberSign) { | |
| 605 | AstNode *directive_node = ast_parse_directive(pc, token_index, &token_index); | |
| 606 | directives->append(directive_node); | |
| 607 | } else { | |
| 608 | *new_token_index = token_index; | |
| 609 | return; | |
| 610 | } | |
| 611 | } | |
| 612 | zig_unreachable(); | |
| 613 | } | |
| 614 | ||
| 615 | 641 | /* |
| 616 | 642 | ExternBlock : many(Directive) token(Extern) token(LBrace) many(FnProtoDecl) token(RBrace) |
| 617 | 643 | */ |
| 618 | static AstNode *ast_parse_extern_block(ParseContext *pc, int token_index, int *new_token_index) { | |
| 619 | Token *extern_kw = &pc->tokens->at(token_index); | |
| 620 | token_index += 1; | |
| 621 | ast_expect_token(pc, extern_kw, TokenIdKeywordExtern); | |
| 644 | static AstNode *ast_parse_extern_block(ParseContext *pc, int *token_index, bool mandatory) { | |
| 645 | Token *extern_kw = &pc->tokens->at(*token_index); | |
| 646 | if (extern_kw->id != TokenIdKeywordExtern) { | |
| 647 | if (mandatory) | |
| 648 | ast_invalid_token_error(pc, extern_kw); | |
| 649 | else | |
| 650 | return nullptr; | |
| 651 | } | |
| 652 | *token_index += 1; | |
| 622 | 653 | |
| 623 | 654 | AstNode *node = ast_create_node(NodeTypeExternBlock, extern_kw); |
| 624 | 655 | |
| 625 | 656 | node->data.extern_block.directives = pc->directive_list; |
| 626 | 657 | pc->directive_list = nullptr; |
| 627 | 658 | |
| 628 | Token *l_brace = &pc->tokens->at(token_index); | |
| 629 | token_index += 1; | |
| 659 | Token *l_brace = &pc->tokens->at(*token_index); | |
| 660 | *token_index += 1; | |
| 630 | 661 | ast_expect_token(pc, l_brace, TokenIdLBrace); |
| 631 | 662 | |
| 632 | 663 | for (;;) { |
| 633 | Token *token = &pc->tokens->at(token_index); | |
| 664 | Token *directive_token = &pc->tokens->at(*token_index); | |
| 665 | assert(!pc->directive_list); | |
| 666 | pc->directive_list = allocate<ZigList<AstNode*>>(1); | |
| 667 | ast_parse_directives(pc, token_index, pc->directive_list); | |
| 668 | ||
| 669 | Token *token = &pc->tokens->at(*token_index); | |
| 634 | 670 | if (token->id == TokenIdRBrace) { |
| 635 | token_index += 1; | |
| 636 | *new_token_index = token_index; | |
| 671 | if (pc->directive_list->length > 0) { | |
| 672 | ast_error(directive_token, "invalid directive"); | |
| 673 | } | |
| 674 | pc->directive_list = nullptr; | |
| 675 | ||
| 676 | *token_index += 1; | |
| 637 | 677 | return node; |
| 638 | 678 | } else { |
| 639 | AstNode *child = ast_parse_fn_decl(pc, token_index, &token_index); | |
| 679 | AstNode *child = ast_parse_fn_decl(pc, *token_index, token_index); | |
| 640 | 680 | node->data.extern_block.fn_decls.append(child); |
| 641 | 681 | } |
| 642 | 682 | } |
| ... | ... | @@ -645,25 +685,31 @@ static AstNode *ast_parse_extern_block(ParseContext *pc, int token_index, int *n |
| 645 | 685 | zig_unreachable(); |
| 646 | 686 | } |
| 647 | 687 | |
| 648 | static void ast_parse_top_level_decls(ParseContext *pc, int token_index, int *new_token_index, | |
| 649 | ZigList<AstNode *> *top_level_decls) | |
| 650 | { | |
| 688 | static void ast_parse_top_level_decls(ParseContext *pc, int *token_index, ZigList<AstNode *> *top_level_decls) { | |
| 651 | 689 | for (;;) { |
| 652 | Token *token = &pc->tokens->at(token_index); | |
| 653 | if (token->id == TokenIdNumberSign) { | |
| 654 | assert(!pc->directive_list); | |
| 655 | pc->directive_list = allocate<ZigList<AstNode*>>(1); | |
| 656 | ast_parse_directives(pc, token_index, &token_index, pc->directive_list); | |
| 657 | } else if (token->id == TokenIdKeywordFn) { | |
| 658 | AstNode *fn_decl_node = ast_parse_fn_def(pc, token_index, &token_index); | |
| 690 | Token *directive_token = &pc->tokens->at(*token_index); | |
| 691 | assert(!pc->directive_list); | |
| 692 | pc->directive_list = allocate<ZigList<AstNode*>>(1); | |
| 693 | ast_parse_directives(pc, token_index, pc->directive_list); | |
| 694 | ||
| 695 | AstNode *fn_decl_node = ast_parse_fn_def(pc, token_index, false); | |
| 696 | if (fn_decl_node) { | |
| 659 | 697 | top_level_decls->append(fn_decl_node); |
| 660 | } else if (token->id == TokenIdKeywordExtern) { | |
| 661 | AstNode *extern_node = ast_parse_extern_block(pc, token_index, &token_index); | |
| 698 | continue; | |
| 699 | } | |
| 700 | ||
| 701 | AstNode *extern_node = ast_parse_extern_block(pc, token_index, false); | |
| 702 | if (extern_node) { | |
| 662 | 703 | top_level_decls->append(extern_node); |
| 663 | } else { | |
| 664 | *new_token_index = token_index; | |
| 665 | return; | |
| 704 | continue; | |
| 666 | 705 | } |
| 706 | ||
| 707 | if (pc->directive_list->length > 0) { | |
| 708 | ast_error(directive_token, "invalid directive"); | |
| 709 | } | |
| 710 | pc->directive_list = nullptr; | |
| 711 | ||
| 712 | return; | |
| 667 | 713 | } |
| 668 | 714 | zig_unreachable(); |
| 669 | 715 | } |
| ... | ... | @@ -674,11 +720,11 @@ AstNode *ast_parse(Buf *buf, ZigList<Token> *tokens) { |
| 674 | 720 | pc.root = ast_create_node(NodeTypeRoot, &tokens->at(0)); |
| 675 | 721 | pc.tokens = tokens; |
| 676 | 722 | |
| 677 | int new_token_index; | |
| 678 | ast_parse_top_level_decls(&pc, 0, &new_token_index, &pc.root->data.root.top_level_decls); | |
| 723 | int token_index = 0; | |
| 724 | ast_parse_top_level_decls(&pc, &token_index, &pc.root->data.root.top_level_decls); | |
| 679 | 725 | |
| 680 | if (new_token_index != tokens->length - 1) { | |
| 681 | ast_invalid_token_error(&pc, &tokens->at(new_token_index)); | |
| 726 | if (token_index != tokens->length - 1) { | |
| 727 | ast_invalid_token_error(&pc, &tokens->at(token_index)); | |
| 682 | 728 | } |
| 683 | 729 | |
| 684 | 730 | return pc.root; |
src/parser.hpp+8| ... | ... | @@ -34,7 +34,15 @@ struct AstNodeRoot { |
| 34 | 34 | ZigList<AstNode *> top_level_decls; |
| 35 | 35 | }; |
| 36 | 36 | |
| 37 | enum FnProtoVisibMod { | |
| 38 | FnProtoVisibModPrivate, | |
| 39 | FnProtoVisibModPub, | |
| 40 | FnProtoVisibModExport, | |
| 41 | }; | |
| 42 | ||
| 37 | 43 | struct AstNodeFnProto { |
| 44 | ZigList<AstNode *> *directives; | |
| 45 | FnProtoVisibMod visib_mod; | |
| 38 | 46 | Buf name; |
| 39 | 47 | ZigList<AstNode *> params; |
| 40 | 48 | AstNode *return_type; |
src/tokenizer.cpp+6| ... | ... | @@ -163,6 +163,10 @@ static void end_token(Tokenize *t) { |
| 163 | 163 | t->cur_tok->id = TokenIdKeywordExtern; |
| 164 | 164 | } else if (mem_eql_str(token_mem, token_len, "unreachable")) { |
| 165 | 165 | t->cur_tok->id = TokenIdKeywordUnreachable; |
| 166 | } else if (mem_eql_str(token_mem, token_len, "pub")) { | |
| 167 | t->cur_tok->id = TokenIdKeywordPub; | |
| 168 | } else if (mem_eql_str(token_mem, token_len, "export")) { | |
| 169 | t->cur_tok->id = TokenIdKeywordExport; | |
| 166 | 170 | } |
| 167 | 171 | |
| 168 | 172 | t->cur_tok = nullptr; |
| ... | ... | @@ -407,6 +411,8 @@ static const char * token_name(Token *token) { |
| 407 | 411 | case TokenIdKeywordReturn: return "Return"; |
| 408 | 412 | case TokenIdKeywordExtern: return "Extern"; |
| 409 | 413 | case TokenIdKeywordUnreachable: return "Unreachable"; |
| 414 | case TokenIdKeywordPub: return "Pub"; | |
| 415 | case TokenIdKeywordExport: return "Export"; | |
| 410 | 416 | case TokenIdLParen: return "LParen"; |
| 411 | 417 | case TokenIdRParen: return "RParen"; |
| 412 | 418 | case TokenIdComma: return "Comma"; |
src/tokenizer.hpp+2| ... | ... | @@ -19,6 +19,8 @@ enum TokenId { |
| 19 | 19 | TokenIdKeywordConst, |
| 20 | 20 | TokenIdKeywordExtern, |
| 21 | 21 | TokenIdKeywordUnreachable, |
| 22 | TokenIdKeywordPub, | |
| 23 | TokenIdKeywordExport, | |
| 22 | 24 | TokenIdLParen, |
| 23 | 25 | TokenIdRParen, |
| 24 | 26 | TokenIdComma, |
src/zig_llvm.cpp+133-1| ... | ... | @@ -10,7 +10,19 @@ |
| 10 | 10 | #include <llvm/InitializePasses.h> |
| 11 | 11 | #include <llvm/PassRegistry.h> |
| 12 | 12 | #include <llvm/MC/SubtargetFeature.h> |
| 13 | ||
| 13 | #include <llvm/Support/raw_ostream.h> | |
| 14 | #include <llvm/Support/FileSystem.h> | |
| 15 | #include <llvm/Target/TargetMachine.h> | |
| 16 | #include <llvm/IR/LegacyPassManager.h> | |
| 17 | #include <llvm/IR/Module.h> | |
| 18 | #include <llvm/IR/Verifier.h> | |
| 19 | #include <llvm/IR/Instructions.h> | |
| 20 | #include <llvm/IR/IRBuilder.h> | |
| 21 | #include <llvm/Analysis/TargetLibraryInfo.h> | |
| 22 | #include <llvm/Analysis/TargetTransformInfo.h> | |
| 23 | #include <llvm/Transforms/IPO.h> | |
| 24 | #include <llvm/Transforms/IPO/PassManagerBuilder.h> | |
| 25 | #include <llvm/Transforms/Scalar.h> | |
| 14 | 26 | |
| 15 | 27 | using namespace llvm; |
| 16 | 28 | |
| ... | ... | @@ -42,3 +54,123 @@ char *LLVMZigGetNativeFeatures(void) { |
| 42 | 54 | |
| 43 | 55 | return strdup(features.getString().c_str()); |
| 44 | 56 | } |
| 57 | ||
| 58 | static void addAddDiscriminatorsPass(const PassManagerBuilder &Builder, legacy::PassManagerBase &PM) { | |
| 59 | PM.add(createAddDiscriminatorsPass()); | |
| 60 | } | |
| 61 | ||
| 62 | ||
| 63 | void LLVMZigOptimizeModule(LLVMTargetMachineRef targ_machine_ref, LLVMModuleRef module_ref) { | |
| 64 | TargetMachine* target_machine = reinterpret_cast<TargetMachine*>(targ_machine_ref); | |
| 65 | Module* module = unwrap(module_ref); | |
| 66 | TargetLibraryInfoImpl tlii(Triple(module->getTargetTriple())); | |
| 67 | ||
| 68 | PassManagerBuilder *PMBuilder = new PassManagerBuilder(); | |
| 69 | PMBuilder->OptLevel = target_machine->getOptLevel(); | |
| 70 | PMBuilder->SizeLevel = 0; | |
| 71 | PMBuilder->BBVectorize = true; | |
| 72 | PMBuilder->SLPVectorize = true; | |
| 73 | PMBuilder->LoopVectorize = true; | |
| 74 | ||
| 75 | PMBuilder->DisableUnitAtATime = false; | |
| 76 | PMBuilder->DisableUnrollLoops = false; | |
| 77 | PMBuilder->MergeFunctions = true; | |
| 78 | PMBuilder->PrepareForLTO = true; | |
| 79 | PMBuilder->RerollLoops = true; | |
| 80 | ||
| 81 | PMBuilder->addExtension(PassManagerBuilder::EP_EarlyAsPossible, addAddDiscriminatorsPass); | |
| 82 | ||
| 83 | PMBuilder->LibraryInfo = &tlii; | |
| 84 | ||
| 85 | PMBuilder->Inliner = createFunctionInliningPass(PMBuilder->OptLevel, PMBuilder->SizeLevel); | |
| 86 | ||
| 87 | // Set up the per-function pass manager. | |
| 88 | legacy::FunctionPassManager *FPM = new legacy::FunctionPassManager(module); | |
| 89 | FPM->add(createTargetTransformInfoWrapperPass(target_machine->getTargetIRAnalysis())); | |
| 90 | #ifndef NDEBUG | |
| 91 | bool verify_module = true; | |
| 92 | #else | |
| 93 | bool verify_module = false; | |
| 94 | #endif | |
| 95 | if (verify_module) { | |
| 96 | FPM->add(createVerifierPass()); | |
| 97 | } | |
| 98 | PMBuilder->populateFunctionPassManager(*FPM); | |
| 99 | ||
| 100 | // Set up the per-module pass manager. | |
| 101 | legacy::PassManager *MPM = new legacy::PassManager(); | |
| 102 | MPM->add(createTargetTransformInfoWrapperPass(target_machine->getTargetIRAnalysis())); | |
| 103 | ||
| 104 | PMBuilder->populateModulePassManager(*MPM); | |
| 105 | ||
| 106 | ||
| 107 | // run per function optimization passes | |
| 108 | FPM->doInitialization(); | |
| 109 | for (Function &F : *module) | |
| 110 | if (!F.isDeclaration()) | |
| 111 | FPM->run(F); | |
| 112 | FPM->doFinalization(); | |
| 113 | ||
| 114 | // run per module optimization passes | |
| 115 | MPM->run(*module); | |
| 116 | } | |
| 117 | ||
| 118 | static LLVMBool LLVMZigTargetMachineEmit(LLVMTargetMachineRef targ_machine_ref, LLVMModuleRef module_ref, | |
| 119 | raw_pwrite_stream &out_stream, LLVMCodeGenFileType codegen, char **err_msg) | |
| 120 | { | |
| 121 | TargetMachine* target_machine = reinterpret_cast<TargetMachine*>(targ_machine_ref); | |
| 122 | Module* module = unwrap(module_ref); | |
| 123 | TargetLibraryInfoImpl tlii(Triple(module->getTargetTriple())); | |
| 124 | ||
| 125 | legacy::PassManager pass; | |
| 126 | ||
| 127 | pass.add(new TargetLibraryInfoWrapperPass(tlii)); | |
| 128 | ||
| 129 | const DataLayout *td = target_machine->getDataLayout(); | |
| 130 | ||
| 131 | if (!td) { | |
| 132 | *err_msg = strdup("No DataLayout in TargetMachine"); | |
| 133 | return true; | |
| 134 | } | |
| 135 | module->setDataLayout(*td); | |
| 136 | ||
| 137 | ||
| 138 | TargetMachine::CodeGenFileType ft; | |
| 139 | switch (codegen) { | |
| 140 | case LLVMAssemblyFile: | |
| 141 | ft = TargetMachine::CGFT_AssemblyFile; | |
| 142 | break; | |
| 143 | default: | |
| 144 | ft = TargetMachine::CGFT_ObjectFile; | |
| 145 | break; | |
| 146 | } | |
| 147 | if (target_machine->addPassesToEmitFile(pass, out_stream, ft)) { | |
| 148 | *err_msg = strdup("TargetMachine can't emit a file of this type"); | |
| 149 | return true; | |
| 150 | } | |
| 151 | ||
| 152 | pass.run(*module); | |
| 153 | ||
| 154 | out_stream.flush(); | |
| 155 | return false; | |
| 156 | } | |
| 157 | ||
| 158 | LLVMBool LLVMZigTargetMachineEmitToFile(LLVMTargetMachineRef targ_machine_ref, LLVMModuleRef module_ref, | |
| 159 | char* filename, LLVMCodeGenFileType codegen, char** err_msg) | |
| 160 | { | |
| 161 | std::error_code error_code; | |
| 162 | raw_fd_ostream dest(filename, error_code, sys::fs::F_None); | |
| 163 | if (error_code) { | |
| 164 | *err_msg = strdup(error_code.message().c_str()); | |
| 165 | return true; | |
| 166 | } | |
| 167 | return LLVMZigTargetMachineEmit(targ_machine_ref, module_ref, dest, codegen, err_msg); | |
| 168 | } | |
| 169 | ||
| 170 | LLVMValueRef LLVMZigBuildCall(LLVMBuilderRef B, LLVMValueRef Fn, LLVMValueRef *Args, | |
| 171 | unsigned NumArgs, unsigned CC, const char *Name) | |
| 172 | { | |
| 173 | CallInst *call_inst = CallInst::Create(unwrap(Fn), makeArrayRef(unwrap(Args), NumArgs), Name); | |
| 174 | call_inst->setCallingConv(CC); | |
| 175 | return wrap(unwrap(B)->Insert(call_inst)); | |
| 176 | } |
src/zig_llvm.hpp+8| ... | ... | @@ -21,4 +21,12 @@ void LLVMZigInitializeUnreachableBlockElimPass(LLVMPassRegistryRef R); |
| 21 | 21 | char *LLVMZigGetHostCPUName(void); |
| 22 | 22 | char *LLVMZigGetNativeFeatures(void); |
| 23 | 23 | |
| 24 | LLVMBool LLVMZigTargetMachineEmitToFile(LLVMTargetMachineRef target_machine, LLVMModuleRef module, | |
| 25 | char* filename, LLVMCodeGenFileType codegen, char** error_msg); | |
| 26 | ||
| 27 | void LLVMZigOptimizeModule(LLVMTargetMachineRef targ_machine_ref, LLVMModuleRef module_ref); | |
| 28 | ||
| 29 | LLVMValueRef LLVMZigBuildCall(LLVMBuilderRef B, LLVMValueRef Fn, LLVMValueRef *Args, | |
| 30 | unsigned NumArgs, unsigned CC, const char *Name); | |
| 31 | ||
| 24 | 32 | #endif |
test/hello.zig deleted-10| ... | ... | @@ -1,10 +0,0 @@ |
| 1 | #link("c") | |
| 2 | extern { | |
| 3 | fn puts(s: *mut u8) -> i32; | |
| 4 | fn exit(code: i32) -> unreachable; | |
| 5 | } | |
| 6 | ||
| 7 | fn _start() -> unreachable { | |
| 8 | puts("Hello, world!"); | |
| 9 | exit(0); | |
| 10 | } |
test/standalone.cpp+3-3| ... | ... | @@ -53,7 +53,7 @@ static void add_all_test_cases(void) { |
| 53 | 53 | fn exit(code: i32) -> unreachable; |
| 54 | 54 | } |
| 55 | 55 | |
| 56 | fn _start() -> unreachable { | |
| 56 | export fn _start() -> unreachable { | |
| 57 | 57 | puts("Hello, world!"); |
| 58 | 58 | exit(0); |
| 59 | 59 | } |
| ... | ... | @@ -69,7 +69,7 @@ static void add_all_test_cases(void) { |
| 69 | 69 | fn empty_function_1() {} |
| 70 | 70 | fn empty_function_2() { return; } |
| 71 | 71 | |
| 72 | fn _start() -> unreachable { | |
| 72 | export fn _start() -> unreachable { | |
| 73 | 73 | empty_function_1(); |
| 74 | 74 | empty_function_2(); |
| 75 | 75 | this_is_a_function(); |
| ... | ... | @@ -95,7 +95,7 @@ static void add_all_test_cases(void) { |
| 95 | 95 | |
| 96 | 96 | /// this is a documentation comment |
| 97 | 97 | /// doc comment line 2 |
| 98 | fn _start() -> unreachable { | |
| 98 | export fn _start() -> unreachable { | |
| 99 | 99 | puts(/* mid-line comment /* nested */ */ "OK"); |
| 100 | 100 | exit(0); |
| 101 | 101 | } |