| ... | @@ -1,16 +1,18 @@ | ... | @@ -1,16 +1,18 @@ |
| 1 | const std = @import("std"); | 1 | const std = @import("std"); |
| 2 | const mem = std.mem; | 2 | const mem = std.mem; |
| 3 | const Allocator = std.mem.Allocator; | 3 | const Allocator = std.mem.Allocator; |
| | 4 | const assert = std.debug.assert; |
| | 5 | |
| 4 | const Value = @import("value.zig").Value; | 6 | const Value = @import("value.zig").Value; |
| 5 | const Type = @import("type.zig").Type; | 7 | const Type = @import("type.zig").Type; |
| 6 | const TypedValue = @import("TypedValue.zig"); | 8 | const TypedValue = @import("TypedValue.zig"); |
| 7 | const assert = std.debug.assert; | | |
| 8 | const zir = @import("zir.zig"); | 9 | const zir = @import("zir.zig"); |
| 9 | const Module = @import("Module.zig"); | 10 | const Module = @import("Module.zig"); |
| 10 | const ast = std.zig.ast; | 11 | const ast = std.zig.ast; |
| 11 | const trace = @import("tracy.zig").trace; | 12 | const trace = @import("tracy.zig").trace; |
| 12 | const Scope = Module.Scope; | 13 | const Scope = Module.Scope; |
| 13 | const InnerError = Module.InnerError; | 14 | const InnerError = Module.InnerError; |
| | 15 | const BuiltinFn = @import("BuiltinFn.zig"); |
| 14 | | 16 | |
| 15 | pub const ResultLoc = union(enum) { | 17 | pub const ResultLoc = union(enum) { |
| 16 | /// The expression is the right-hand side of assignment to `_`. Only the side-effects of the | 18 | /// The expression is the right-hand side of assignment to `_`. Only the side-effects of the |
| ... | @@ -172,16 +174,21 @@ fn lvalExpr(mod: *Module, scope: *Scope, node: ast.Node.Index) InnerError!*zir.I | ... | @@ -172,16 +174,21 @@ fn lvalExpr(mod: *Module, scope: *Scope, node: ast.Node.Index) InnerError!*zir.I |
| 172 | .ContainerDecl, | 174 | .ContainerDecl, |
| 173 | .@"comptime", | 175 | .@"comptime", |
| 174 | .@"nosuspend", | 176 | .@"nosuspend", |
| 175 | .builtin_call, | | |
| 176 | .builtin_call_comma, | | |
| 177 | => return mod.failNode(scope, node, "invalid left-hand side to assignment", .{}), | 177 | => return mod.failNode(scope, node, "invalid left-hand side to assignment", .{}), |
| 178 | | 178 | |
| 179 | // `@field` can be assigned to. | 179 | .builtin_call, |
| 180 | .builtin_call_two, .builtin_call_two_comma => { | 180 | .builtin_call_comma, |
| | 181 | .builtin_call_two, |
| | 182 | .builtin_call_two_comma, |
| | 183 | => { |
| 181 | const builtin_token = main_tokens[node]; | 184 | const builtin_token = main_tokens[node]; |
| 182 | const builtin_name = tree.tokenSlice(builtin_token); | 185 | const builtin_name = tree.tokenSlice(builtin_token); |
| 183 | if (!mem.eql(u8, builtin_name, "@field")) { | 186 | // If the builtin is an invalid name, we don't cause an error here; instead |
| 184 | return mod.failNode(scope, node, "invalid left-hand side to assignment", .{}); | 187 | // let it pass, and the error will be "invalid builtin function" later. |
| | 188 | if (BuiltinFn.list.get(builtin_name)) |info| { |
| | 189 | if (!info.allows_lvalue) { |
| | 190 | return mod.failNode(scope, node, "invalid left-hand side to assignment", .{}); |
| | 191 | } |
| 185 | } | 192 | } |
| 186 | }, | 193 | }, |
| 187 | | 194 | |
| ... | @@ -276,22 +283,111 @@ pub fn expr(mod: *Module, scope: *Scope, rl: ResultLoc, node: ast.Node.Index) In | ... | @@ -276,22 +283,111 @@ pub fn expr(mod: *Module, scope: *Scope, rl: ResultLoc, node: ast.Node.Index) In |
| 276 | .multiline_string_literal => return multilineStringLiteral(mod, scope, rl, node), | 283 | .multiline_string_literal => return multilineStringLiteral(mod, scope, rl, node), |
| 277 | | 284 | |
| 278 | .integer_literal => return integerLiteral(mod, scope, rl, node), | 285 | .integer_literal => return integerLiteral(mod, scope, rl, node), |
| | 286 | |
| 279 | .builtin_call => return builtinCall(mod, scope, rl, node), | 287 | .builtin_call => return builtinCall(mod, scope, rl, node), |
| 280 | .call => return callExpr(mod, scope, rl, node), | 288 | |
| 281 | .@"unreachable" => return unreach(mod, scope, node), | 289 | .builtin_call_two, .builtin_call_two_comma => { |
| | 290 | if (datas[node].lhs == 0) { |
| | 291 | const params = [_]ast.Node.Index{}; |
| | 292 | return builtinCall(mod, scope, rl, node, ¶ms); |
| | 293 | } else if (datas[node].rhs == 0) { |
| | 294 | const params = [_]ast.Node.Index{datas[node].lhs}; |
| | 295 | return builtinCall(mod, scope, rl, node, ¶ms); |
| | 296 | } else { |
| | 297 | const params = [_]ast.Node.Index{ datas[node].lhs, datas[node].rhs }; |
| | 298 | return builtinCall(mod, scope, rl, node, ¶ms); |
| | 299 | } |
| | 300 | }, |
| | 301 | .builtin_call, .builtin_call_comma => { |
| | 302 | const params = tree.extra_data[datas[node].lhs..datas[node].rhs]; |
| | 303 | return builtinCall(mod, scope, rl, node, params); |
| | 304 | }, |
| | 305 | |
| | 306 | .call_one, .call_one_comma, .async_call_one, .async_call_one_comma => { |
| | 307 | var params: [1]ast.Node.Index = undefined; |
| | 308 | return callExpr(mod, scope, rl, tree.callOne(¶ms, node)); |
| | 309 | }, |
| | 310 | .call, .call_comma, .async_call, .async_call_comma => { |
| | 311 | return callExpr(mod, scope, rl, tree.callFull(node)); |
| | 312 | }, |
| | 313 | |
| | 314 | .@"unreachable" => { |
| | 315 | const main_token = main_tokens[node]; |
| | 316 | const src = token_starts[main_token]; |
| | 317 | return addZIRNoOp(mod, scope, src, .unreachable_safe); |
| | 318 | }, |
| 282 | .@"return" => return ret(mod, scope, node), | 319 | .@"return" => return ret(mod, scope, node), |
| 283 | .@"if" => return ifExpr(mod, scope, rl, node), | | |
| 284 | .@"while" => return whileExpr(mod, scope, rl, node), | | |
| 285 | .period => return field(mod, scope, rl, node), | 320 | .period => return field(mod, scope, rl, node), |
| 286 | .deref => return rvalue(mod, scope, rl, try deref(mod, scope, node)), | 321 | .float_literal => return floatLiteral(mod, scope, rl, node), |
| 287 | .address_of => return rvalue(mod, scope, rl, try addressOf(mod, scope, node)), | 322 | |
| 288 | .float_literal => return rvalue(mod, scope, rl, try floatLiteral(mod, scope, node)), | 323 | .if_simple => return ifExpr(mod, scope, rl, tree.ifSimple(node)), |
| 289 | .undefined_literal => return rvalue(mod, scope, rl, try undefLiteral(mod, scope, node)), | 324 | .@"if" => return ifExpr(mode, scope, rl, tree.ifFull(node)), |
| 290 | .bool_literal => return rvalue(mod, scope, rl, try boolLiteral(mod, scope, node)), | 325 | |
| 291 | .null_literal => return rvalue(mod, scope, rl, try nullLiteral(mod, scope, node)), | 326 | .while_simple => return whileExpr(mod, scope, rl, tree.whileSimple(node)), |
| 292 | .optional_type => return rvalue(mod, scope, rl, try optionalType(mod, scope, node)), | 327 | .while_cont => return whileExpr(mod, scope, tree.whileCont(node)), |
| 293 | .unwrap_optional => return unwrapOptional(mod, scope, rl, node), | 328 | .@"while" => return whileExpr(mod, scope, rl, tree.whileFull(node)), |
| 294 | | 329 | |
| | 330 | .deref => { |
| | 331 | const lhs = try expr(mod, scope, .none, node_datas[node].lhs); |
| | 332 | const src = token_starts[main_tokens[node]]; |
| | 333 | const result = try addZIRUnOp(mod, scope, src, .deref, lhs); |
| | 334 | return rvalue(mod, scope, rl, result); |
| | 335 | }, |
| | 336 | .address_of => { |
| | 337 | const result = try expr(mod, scope, .ref, node_datas[node].lhs); |
| | 338 | return rvalue(mod, scope, rl, result); |
| | 339 | }, |
| | 340 | .undefined_literal => { |
| | 341 | const main_token = main_tokens[node]; |
| | 342 | const src = token_starts[main_token]; |
| | 343 | const result = try addZIRInstConst(mod, scope, src, .{ |
| | 344 | .ty = Type.initTag(.@"undefined"), |
| | 345 | .val = Value.initTag(.undef), |
| | 346 | }); |
| | 347 | return rvalue(mod, scope, rl, result); |
| | 348 | }, |
| | 349 | .true_literal => { |
| | 350 | const main_token = main_tokens[node]; |
| | 351 | const src = token_starts[main_token]; |
| | 352 | const result = try addZIRInstConst(mod, scope, src, .{ |
| | 353 | .ty = Type.initTag(.bool), |
| | 354 | .val = Value.initTag(.bool_true), |
| | 355 | }); |
| | 356 | return rvalue(mod, scope, rl, result); |
| | 357 | }, |
| | 358 | .false_literal => { |
| | 359 | const main_token = main_tokens[node]; |
| | 360 | const src = token_starts[main_token]; |
| | 361 | const result = try addZIRInstConst(mod, scope, src, .{ |
| | 362 | .ty = Type.initTag(.bool), |
| | 363 | .val = Value.initTag(.bool_false), |
| | 364 | }); |
| | 365 | return rvalue(mod, scope, rl, result); |
| | 366 | }, |
| | 367 | .null_literal => { |
| | 368 | const main_token = main_tokens[node]; |
| | 369 | const src = token_starts[main_token]; |
| | 370 | const result = try addZIRInstConst(mod, scope, src, .{ |
| | 371 | .ty = Type.initTag(.@"null"), |
| | 372 | .val = Value.initTag(.null_value), |
| | 373 | }); |
| | 374 | return rvalue(mod, scope, rl, result); |
| | 375 | }, |
| | 376 | .optional_type => { |
| | 377 | const src = token_starts[main_tokens[node]]; |
| | 378 | const operand = try typeExpr(mod, scope, node_datas[node].lhs); |
| | 379 | const result = try addZIRUnOp(mod, scope, src, .optional_type, operand); |
| | 380 | return rvalue(mod, scope, rl, result); |
| | 381 | }, |
| | 382 | .unwrap_optional => { |
| | 383 | const operand = try expr(mod, scope, rl, node.lhs); |
| | 384 | const op: zir.Inst.Tag = switch (rl) { |
| | 385 | .ref => .optional_payload_safe_ptr, |
| | 386 | else => .optional_payload_safe, |
| | 387 | }; |
| | 388 | const src = token_starts[main_tokens[node]]; |
| | 389 | return addZIRUnOp(mod, scope, src, op, operand); |
| | 390 | }, |
| 295 | .block_two, .block_two_semicolon => { | 391 | .block_two, .block_two_semicolon => { |
| 296 | const statements = [2]ast.Node.Index{ node_datas[node].lhs, node_datas[node].rhs }; | 392 | const statements = [2]ast.Node.Index{ node_datas[node].lhs, node_datas[node].rhs }; |
| 297 | if (node_datas[node].lhs == 0) { | 393 | if (node_datas[node].lhs == 0) { |
| ... | @@ -307,7 +403,6 @@ pub fn expr(mod: *Module, scope: *Scope, rl: ResultLoc, node: ast.Node.Index) In | ... | @@ -307,7 +403,6 @@ pub fn expr(mod: *Module, scope: *Scope, rl: ResultLoc, node: ast.Node.Index) In |
| 307 | return blockExpr(mod, scope, rl, node, statements); | 403 | return blockExpr(mod, scope, rl, node, statements); |
| 308 | }, | 404 | }, |
| 309 | | 405 | |
| 310 | .labeled_block => return labeledBlockExpr(mod, scope, rl, node, .block), | | |
| 311 | .@"break" => return rvalue(mod, scope, rl, try breakExpr(mod, scope, node)), | 406 | .@"break" => return rvalue(mod, scope, rl, try breakExpr(mod, scope, node)), |
| 312 | .@"continue" => return rvalue(mod, scope, rl, try continueExpr(mod, scope, node)), | 407 | .@"continue" => return rvalue(mod, scope, rl, try continueExpr(mod, scope, node)), |
| 313 | .grouped_expression => return expr(mod, scope, rl, node.expr), | 408 | .grouped_expression => return expr(mod, scope, rl, node.expr), |
| ... | @@ -521,7 +616,12 @@ pub fn blockExpr( | ... | @@ -521,7 +616,12 @@ pub fn blockExpr( |
| 521 | const tracy = trace(@src()); | 616 | const tracy = trace(@src()); |
| 522 | defer tracy.end(); | 617 | defer tracy.end(); |
| 523 | | 618 | |
| 524 | try blockExprStmts(mod, scope, &block_node.base, statements); | 619 | const lbrace = main_tokens[node]; |
| | 620 | if (token_tags[lbrace - 1] == .colon) { |
| | 621 | return labeledBlockExpr(mod, scope, rl, block_node, .block); |
| | 622 | } |
| | 623 | |
| | 624 | try blockExprStmts(mod, scope, block_node, statements); |
| 525 | return rvalueVoid(mod, scope, rl, block_node, {}); | 625 | return rvalueVoid(mod, scope, rl, block_node, {}); |
| 526 | } | 626 | } |
| 527 | | 627 | |
| ... | @@ -983,17 +1083,6 @@ fn negation( | ... | @@ -983,17 +1083,6 @@ fn negation( |
| 983 | return addZIRBinOp(mod, scope, src, op_inst_tag, lhs, rhs); | 1083 | return addZIRBinOp(mod, scope, src, op_inst_tag, lhs, rhs); |
| 984 | } | 1084 | } |
| 985 | | 1085 | |
| 986 | fn addressOf(mod: *Module, scope: *Scope, node: *ast.Node.SimplePrefixOp) InnerError!*zir.Inst { | | |
| 987 | return expr(mod, scope, .ref, node.rhs); | | |
| 988 | } | | |
| 989 | | | |
| 990 | fn optionalType(mod: *Module, scope: *Scope, node: *ast.Node.SimplePrefixOp) InnerError!*zir.Inst { | | |
| 991 | const tree = scope.tree(); | | |
| 992 | const src = token_starts[node.op_token]; | | |
| 993 | const operand = try typeExpr(mod, scope, node.rhs); | | |
| 994 | return addZIRUnOp(mod, scope, src, .optional_type, operand); | | |
| 995 | } | | |
| 996 | | | |
| 997 | fn sliceType(mod: *Module, scope: *Scope, node: *ast.Node.slice_type) InnerError!*zir.Inst { | 1086 | fn sliceType(mod: *Module, scope: *Scope, node: *ast.Node.slice_type) InnerError!*zir.Inst { |
| 998 | const tree = scope.tree(); | 1087 | const tree = scope.tree(); |
| 999 | const src = token_starts[node.op_token]; | 1088 | const src = token_starts[node.op_token]; |
| ... | @@ -1123,18 +1212,6 @@ fn enumLiteral(mod: *Module, scope: *Scope, node: *ast.Node.enum_literal) !*zir. | ... | @@ -1123,18 +1212,6 @@ fn enumLiteral(mod: *Module, scope: *Scope, node: *ast.Node.enum_literal) !*zir. |
| 1123 | return addZIRInst(mod, scope, src, zir.Inst.EnumLiteral, .{ .name = name }, .{}); | 1212 | return addZIRInst(mod, scope, src, zir.Inst.EnumLiteral, .{ .name = name }, .{}); |
| 1124 | } | 1213 | } |
| 1125 | | 1214 | |
| 1126 | fn unwrapOptional(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.SimpleSuffixOp) InnerError!*zir.Inst { | | |
| 1127 | const tree = scope.tree(); | | |
| 1128 | const src = token_starts[node.rtoken]; | | |
| 1129 | | | |
| 1130 | const operand = try expr(mod, scope, rl, node.lhs); | | |
| 1131 | const op: zir.Inst.Tag = switch (rl) { | | |
| 1132 | .ref => .optional_payload_safe_ptr, | | |
| 1133 | else => .optional_payload_safe, | | |
| 1134 | }; | | |
| 1135 | return addZIRUnOp(mod, scope, src, op, operand); | | |
| 1136 | } | | |
| 1137 | | | |
| 1138 | fn containerField( | 1215 | fn containerField( |
| 1139 | mod: *Module, | 1216 | mod: *Module, |
| 1140 | scope: *Scope, | 1217 | scope: *Scope, |
| ... | @@ -1583,51 +1660,25 @@ fn tokenIdentEql(mod: *Module, scope: *Scope, token1: ast.TokenIndex, token2: as | ... | @@ -1583,51 +1660,25 @@ fn tokenIdentEql(mod: *Module, scope: *Scope, token1: ast.TokenIndex, token2: as |
| 1583 | return mem.eql(u8, ident_name_1, ident_name_2); | 1660 | return mem.eql(u8, ident_name_1, ident_name_2); |
| 1584 | } | 1661 | } |
| 1585 | | 1662 | |
| 1586 | pub fn field(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.SimpleInfixOp) InnerError!*zir.Inst { | 1663 | pub fn field(mod: *Module, scope: *Scope, rl: ResultLoc, node: ast.Node.Index) InnerError!*zir.Inst { |
| 1587 | const tree = scope.tree(); | 1664 | const tree = scope.tree(); |
| 1588 | const src = token_starts[node.op_token]; | 1665 | const token_starts = tree.tokens.items(.start); |
| 1589 | // TODO custom AST node for field access so that we don't have to go through a node cast here | 1666 | const main_tokens = tree.nodes.items(.main_token); |
| 1590 | const field_name = try mod.identifierTokenString(scope, node.rhs.castTag(.identifier).?.token); | 1667 | const dot_token = main_tokens[node]; |
| | 1668 | const src = token_starts[dot_token]; |
| | 1669 | const field_ident = dot_token + 1; |
| | 1670 | const field_name = try mod.identifierTokenString(scope, field_ident); |
| 1591 | if (rl == .ref) { | 1671 | if (rl == .ref) { |
| 1592 | return addZirInstTag(mod, scope, src, .field_ptr, .{ | 1672 | return addZirInstTag(mod, scope, src, .field_ptr, .{ |
| 1593 | .object = try expr(mod, scope, .ref, node.lhs), | 1673 | .object = try expr(mod, scope, .ref, node.lhs), |
| 1594 | .field_name = field_name, | 1674 | .field_name = field_name, |
| 1595 | }); | 1675 | }); |
| | 1676 | } else { |
| | 1677 | return rvalue(mod, scope, rl, try addZirInstTag(mod, scope, src, .field_val, .{ |
| | 1678 | .object = try expr(mod, scope, .none, node.lhs), |
| | 1679 | .field_name = field_name, |
| | 1680 | })); |
| 1596 | } | 1681 | } |
| 1597 | return rvalue(mod, scope, rl, try addZirInstTag(mod, scope, src, .field_val, .{ | | |
| 1598 | .object = try expr(mod, scope, .none, node.lhs), | | |
| 1599 | .field_name = field_name, | | |
| 1600 | })); | | |
| 1601 | } | | |
| 1602 | | | |
| 1603 | fn namedField( | | |
| 1604 | mod: *Module, | | |
| 1605 | scope: *Scope, | | |
| 1606 | rl: ResultLoc, | | |
| 1607 | call: *ast.Node.builtin_call, | | |
| 1608 | ) InnerError!*zir.Inst { | | |
| 1609 | try ensureBuiltinParamCount(mod, scope, call, 2); | | |
| 1610 | | | |
| 1611 | const tree = scope.tree(); | | |
| 1612 | const src = token_starts[call.builtin_token]; | | |
| 1613 | const params = call.params(); | | |
| 1614 | | | |
| 1615 | const string_type = try addZIRInstConst(mod, scope, src, .{ | | |
| 1616 | .ty = Type.initTag(.type), | | |
| 1617 | .val = Value.initTag(.const_slice_u8_type), | | |
| 1618 | }); | | |
| 1619 | const string_rl: ResultLoc = .{ .ty = string_type }; | | |
| 1620 | | | |
| 1621 | if (rl == .ref) { | | |
| 1622 | return addZirInstTag(mod, scope, src, .field_ptr_named, .{ | | |
| 1623 | .object = try expr(mod, scope, .ref, params[0]), | | |
| 1624 | .field_name = try comptimeExpr(mod, scope, string_rl, params[1]), | | |
| 1625 | }); | | |
| 1626 | } | | |
| 1627 | return rvalue(mod, scope, rl, try addZirInstTag(mod, scope, src, .field_val_named, .{ | | |
| 1628 | .object = try expr(mod, scope, .none, params[0]), | | |
| 1629 | .field_name = try comptimeExpr(mod, scope, string_rl, params[1]), | | |
| 1630 | })); | | |
| 1631 | } | 1682 | } |
| 1632 | | 1683 | |
| 1633 | fn arrayAccess(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.array_access) InnerError!*zir.Inst { | 1684 | fn arrayAccess(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.array_access) InnerError!*zir.Inst { |
| ... | @@ -1681,13 +1732,6 @@ fn sliceExpr(mod: *Module, scope: *Scope, node: *ast.Node.slice) InnerError!*zir | ... | @@ -1681,13 +1732,6 @@ fn sliceExpr(mod: *Module, scope: *Scope, node: *ast.Node.slice) InnerError!*zir |
| 1681 | ); | 1732 | ); |
| 1682 | } | 1733 | } |
| 1683 | | 1734 | |
| 1684 | fn deref(mod: *Module, scope: *Scope, node: *ast.Node.SimpleSuffixOp) InnerError!*zir.Inst { | | |
| 1685 | const tree = scope.tree(); | | |
| 1686 | const src = token_starts[node.rtoken]; | | |
| 1687 | const lhs = try expr(mod, scope, .none, node.lhs); | | |
| 1688 | return addZIRUnOp(mod, scope, src, .deref, lhs); | | |
| 1689 | } | | |
| 1690 | | | |
| 1691 | fn simpleBinOp( | 1735 | fn simpleBinOp( |
| 1692 | mod: *Module, | 1736 | mod: *Module, |
| 1693 | scope: *Scope, | 1737 | scope: *Scope, |
| ... | @@ -1794,83 +1838,12 @@ fn boolBinOp( | ... | @@ -1794,83 +1838,12 @@ fn boolBinOp( |
| 1794 | return rvalue(mod, scope, rl, &block.base); | 1838 | return rvalue(mod, scope, rl, &block.base); |
| 1795 | } | 1839 | } |
| 1796 | | 1840 | |
| 1797 | const CondKind = union(enum) { | 1841 | fn ifExpr( |
| 1798 | bool, | 1842 | mod: *Module, |
| 1799 | optional: ?*zir.Inst, | 1843 | scope: *Scope, |
| 1800 | err_union: ?*zir.Inst, | 1844 | rl: ResultLoc, |
| 1801 | | 1845 | if_full: ast.full.If, |
| 1802 | fn cond(self: *CondKind, mod: *Module, block_scope: *Scope.GenZIR, src: usize, cond_node: *ast.Node) !*zir.Inst { | 1846 | ) InnerError!*zir.Inst { |
| 1803 | switch (self.*) { | | |
| 1804 | .bool => { | | |
| 1805 | const bool_type = try addZIRInstConst(mod, &block_scope.base, src, .{ | | |
| 1806 | .ty = Type.initTag(.type), | | |
| 1807 | .val = Value.initTag(.bool_type), | | |
| 1808 | }); | | |
| 1809 | return try expr(mod, &block_scope.base, .{ .ty = bool_type }, cond_node); | | |
| 1810 | }, | | |
| 1811 | .optional => { | | |
| 1812 | const cond_ptr = try expr(mod, &block_scope.base, .ref, cond_node); | | |
| 1813 | self.* = .{ .optional = cond_ptr }; | | |
| 1814 | const result = try addZIRUnOp(mod, &block_scope.base, src, .deref, cond_ptr); | | |
| 1815 | return try addZIRUnOp(mod, &block_scope.base, src, .is_non_null, result); | | |
| 1816 | }, | | |
| 1817 | .err_union => { | | |
| 1818 | const err_ptr = try expr(mod, &block_scope.base, .ref, cond_node); | | |
| 1819 | self.* = .{ .err_union = err_ptr }; | | |
| 1820 | const result = try addZIRUnOp(mod, &block_scope.base, src, .deref, err_ptr); | | |
| 1821 | return try addZIRUnOp(mod, &block_scope.base, src, .is_err, result); | | |
| 1822 | }, | | |
| 1823 | } | | |
| 1824 | } | | |
| 1825 | | | |
| 1826 | fn thenSubScope(self: CondKind, mod: *Module, then_scope: *Scope.GenZIR, src: usize, payload_node: ?*ast.Node) !*Scope { | | |
| 1827 | if (self == .bool) return &then_scope.base; | | |
| 1828 | | | |
| 1829 | const payload = payload_node.?.castTag(.PointerPayload) orelse { | | |
| 1830 | // condition is error union and payload is not explicitly ignored | | |
| 1831 | _ = try addZIRUnOp(mod, &then_scope.base, src, .ensure_err_payload_void, self.err_union.?); | | |
| 1832 | return &then_scope.base; | | |
| 1833 | }; | | |
| 1834 | const is_ptr = payload.ptr_token != null; | | |
| 1835 | const ident_node = payload.value_symbol.castTag(.identifier).?; | | |
| 1836 | | | |
| 1837 | // This intentionally does not support @"_" syntax. | | |
| 1838 | const ident_name = then_scope.base.tree().tokenSlice(ident_node.token); | | |
| 1839 | if (mem.eql(u8, ident_name, "_")) { | | |
| 1840 | if (is_ptr) | | |
| 1841 | return mod.failTok(&then_scope.base, payload.ptr_token.?, "pointer modifier invalid on discard", .{}); | | |
| 1842 | return &then_scope.base; | | |
| 1843 | } | | |
| 1844 | | | |
| 1845 | return mod.failNode(&then_scope.base, payload.value_symbol, "TODO implement payload symbols", .{}); | | |
| 1846 | } | | |
| 1847 | | | |
| 1848 | fn elseSubScope(self: CondKind, mod: *Module, else_scope: *Scope.GenZIR, src: usize, payload_node: ?*ast.Node) !*Scope { | | |
| 1849 | if (self != .err_union) return &else_scope.base; | | |
| 1850 | | | |
| 1851 | const payload_ptr = try addZIRUnOp(mod, &else_scope.base, src, .err_union_payload_unsafe_ptr, self.err_union.?); | | |
| 1852 | | | |
| 1853 | const payload = payload_node.?.castTag(.Payload).?; | | |
| 1854 | const ident_node = payload.error_symbol.castTag(.identifier).?; | | |
| 1855 | | | |
| 1856 | // This intentionally does not support @"_" syntax. | | |
| 1857 | const ident_name = else_scope.base.tree().tokenSlice(ident_node.token); | | |
| 1858 | if (mem.eql(u8, ident_name, "_")) { | | |
| 1859 | return &else_scope.base; | | |
| 1860 | } | | |
| 1861 | | | |
| 1862 | return mod.failNode(&else_scope.base, payload.error_symbol, "TODO implement payload symbols", .{}); | | |
| 1863 | } | | |
| 1864 | }; | | |
| 1865 | | | |
| 1866 | fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") InnerError!*zir.Inst { | | |
| 1867 | var cond_kind: CondKind = .bool; | | |
| 1868 | if (if_node.payload) |_| cond_kind = .{ .optional = null }; | | |
| 1869 | if (if_node.@"else") |else_node| { | | |
| 1870 | if (else_node.payload) |payload| { | | |
| 1871 | cond_kind = .{ .err_union = null }; | | |
| 1872 | } | | |
| 1873 | } | | |
| 1874 | var block_scope: Scope.GenZIR = .{ | 1847 | var block_scope: Scope.GenZIR = .{ |
| 1875 | .parent = scope, | 1848 | .parent = scope, |
| 1876 | .decl = scope.ownerDecl().?, | 1849 | .decl = scope.ownerDecl().?, |
| ... | @@ -1884,8 +1857,22 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") | ... | @@ -1884,8 +1857,22 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") |
| 1884 | const tree = scope.tree(); | 1857 | const tree = scope.tree(); |
| 1885 | const node_datas = tree.nodes.items(.data); | 1858 | const node_datas = tree.nodes.items(.data); |
| 1886 | const main_tokens = tree.nodes.items(.main_token); | 1859 | const main_tokens = tree.nodes.items(.main_token); |
| 1887 | const if_src = token_starts[if_node.if_token]; | 1860 | const if_src = token_starts[if_full.ast.if_token]; |
| 1888 | const cond = try cond_kind.cond(mod, &block_scope, if_src, if_node.condition); | 1861 | |
| | 1862 | const cond = c: { |
| | 1863 | // TODO https://github.com/ziglang/zig/issues/7929 |
| | 1864 | if (if_full.ast.error_token) |error_token| { |
| | 1865 | return mod.failTok(scope, error_token, "TODO implement if error union", .{}); |
| | 1866 | } else if (if_full.payload_token) |payload_token| { |
| | 1867 | return mod.failTok(scope, payload_token, "TODO implement if optional", .{}); |
| | 1868 | } else { |
| | 1869 | const bool_type = try addZIRInstConst(mod, &block_scope.base, if_src, .{ |
| | 1870 | .ty = Type.initTag(.type), |
| | 1871 | .val = Value.initTag(.bool_type), |
| | 1872 | }); |
| | 1873 | break :c try expr(mod, &block_scope.base, .{ .ty = bool_type }, if_full.ast.cond_expr); |
| | 1874 | } |
| | 1875 | }; |
| 1889 | | 1876 | |
| 1890 | const condbr = try addZIRInstSpecial(mod, &block_scope.base, if_src, zir.Inst.CondBr, .{ | 1877 | const condbr = try addZIRInstSpecial(mod, &block_scope.base, if_src, zir.Inst.CondBr, .{ |
| 1891 | .condition = cond, | 1878 | .condition = cond, |
| ... | @@ -1897,7 +1884,7 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") | ... | @@ -1897,7 +1884,7 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") |
| 1897 | .instructions = try block_scope.arena.dupe(*zir.Inst, block_scope.instructions.items), | 1884 | .instructions = try block_scope.arena.dupe(*zir.Inst, block_scope.instructions.items), |
| 1898 | }); | 1885 | }); |
| 1899 | | 1886 | |
| 1900 | const then_src = token_starts[if_node.body.lastToken()]; | 1887 | const then_src = token_starts[tree.lastToken(if_full.ast.then_expr)]; |
| 1901 | var then_scope: Scope.GenZIR = .{ | 1888 | var then_scope: Scope.GenZIR = .{ |
| 1902 | .parent = scope, | 1889 | .parent = scope, |
| 1903 | .decl = block_scope.decl, | 1890 | .decl = block_scope.decl, |
| ... | @@ -1908,10 +1895,10 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") | ... | @@ -1908,10 +1895,10 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") |
| 1908 | defer then_scope.instructions.deinit(mod.gpa); | 1895 | defer then_scope.instructions.deinit(mod.gpa); |
| 1909 | | 1896 | |
| 1910 | // declare payload to the then_scope | 1897 | // declare payload to the then_scope |
| 1911 | const then_sub_scope = try cond_kind.thenSubScope(mod, &then_scope, then_src, if_node.payload); | 1898 | const then_sub_scope = &then_scope.base; |
| 1912 | | 1899 | |
| 1913 | block_scope.break_count += 1; | 1900 | block_scope.break_count += 1; |
| 1914 | const then_result = try expr(mod, then_sub_scope, block_scope.break_result_loc, if_node.body); | 1901 | const then_result = try expr(mod, then_sub_scope, block_scope.break_result_loc, if_full.ast.then_expr); |
| 1915 | // We hold off on the break instructions as well as copying the then/else | 1902 | // We hold off on the break instructions as well as copying the then/else |
| 1916 | // instructions into place until we know whether to keep store_to_block_ptr | 1903 | // instructions into place until we know whether to keep store_to_block_ptr |
| 1917 | // instructions or not. | 1904 | // instructions or not. |
| ... | @@ -1925,20 +1912,19 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") | ... | @@ -1925,20 +1912,19 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") |
| 1925 | }; | 1912 | }; |
| 1926 | defer else_scope.instructions.deinit(mod.gpa); | 1913 | defer else_scope.instructions.deinit(mod.gpa); |
| 1927 | | 1914 | |
| 1928 | var else_src: usize = undefined; | 1915 | const else_node = if_full.ast.else_expr; |
| 1929 | var else_sub_scope: *Module.Scope = undefined; | 1916 | const else_info: struct { src: usize, result: ?*zir.Inst } = if (else_node != 0) blk: { |
| 1930 | const else_result: ?*zir.Inst = if (if_node.@"else") |else_node| blk: { | | |
| 1931 | else_src = token_starts[else_node.body.lastToken()]; | | |
| 1932 | // declare payload to the then_scope | | |
| 1933 | else_sub_scope = try cond_kind.elseSubScope(mod, &else_scope, else_src, else_node.payload); | | |
| 1934 | | | |
| 1935 | block_scope.break_count += 1; | 1917 | block_scope.break_count += 1; |
| 1936 | break :blk try expr(mod, else_sub_scope, block_scope.break_result_loc, else_node.body); | 1918 | const sub_scope = &else_scope.base; |
| 1937 | } else blk: { | 1919 | break :blk .{ |
| 1938 | else_src = token_starts[if_node.lastToken()]; | 1920 | .src = token_starts[tree.lastToken(else_node)], |
| 1939 | else_sub_scope = &else_scope.base; | 1921 | .result = try expr(mod, sub_scope, block_scope.break_result_loc, else_node), |
| 1940 | break :blk null; | 1922 | }; |
| 1941 | }; | 1923 | } else |
| | 1924 | .{ |
| | 1925 | .src = token_starts[tree.lastToken(if_full.then_expr)], |
| | 1926 | .result = null, |
| | 1927 | }; |
| 1942 | | 1928 | |
| 1943 | return finishThenElseBlock( | 1929 | return finishThenElseBlock( |
| 1944 | mod, | 1930 | mod, |
| ... | @@ -1950,9 +1936,9 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") | ... | @@ -1950,9 +1936,9 @@ fn ifExpr(mod: *Module, scope: *Scope, rl: ResultLoc, if_node: *ast.Node.@"if") |
| 1950 | &condbr.positionals.then_body, | 1936 | &condbr.positionals.then_body, |
| 1951 | &condbr.positionals.else_body, | 1937 | &condbr.positionals.else_body, |
| 1952 | then_src, | 1938 | then_src, |
| 1953 | else_src, | 1939 | else_info.src, |
| 1954 | then_result, | 1940 | then_result, |
| 1955 | else_result, | 1941 | else_info.result, |
| 1956 | block, | 1942 | block, |
| 1957 | block, | 1943 | block, |
| 1958 | ); | 1944 | ); |
| ... | @@ -1983,23 +1969,15 @@ fn whileExpr( | ... | @@ -1983,23 +1969,15 @@ fn whileExpr( |
| 1983 | mod: *Module, | 1969 | mod: *Module, |
| 1984 | scope: *Scope, | 1970 | scope: *Scope, |
| 1985 | rl: ResultLoc, | 1971 | rl: ResultLoc, |
| 1986 | while_node: *ast.Node.@"while", | 1972 | while_full: ast.full.While, |
| 1987 | ) InnerError!*zir.Inst { | 1973 | ) InnerError!*zir.Inst { |
| 1988 | var cond_kind: CondKind = .bool; | 1974 | if (while_full.label_token) |label_token| { |
| 1989 | if (while_node.payload) |_| cond_kind = .{ .optional = null }; | 1975 | try checkLabelRedefinition(mod, scope, label_token); |
| 1990 | if (while_node.@"else") |else_node| { | | |
| 1991 | if (else_node.payload) |payload| { | | |
| 1992 | cond_kind = .{ .err_union = null }; | | |
| 1993 | } | | |
| 1994 | } | 1976 | } |
| 1995 | | 1977 | if (while_full.inline_token) |inline_token| { |
| 1996 | if (while_node.label) |label| { | 1978 | return mod.failTok(scope, inline_token, "TODO inline while", .{}); |
| 1997 | try checkLabelRedefinition(mod, scope, label); | | |
| 1998 | } | 1979 | } |
| 1999 | | 1980 | |
| 2000 | if (while_node.inline_token) |tok| | | |
| 2001 | return mod.failTok(scope, tok, "TODO inline while", .{}); | | |
| 2002 | | | |
| 2003 | var loop_scope: Scope.GenZIR = .{ | 1981 | var loop_scope: Scope.GenZIR = .{ |
| 2004 | .parent = scope, | 1982 | .parent = scope, |
| 2005 | .decl = scope.ownerDecl().?, | 1983 | .decl = scope.ownerDecl().?, |
| ... | @@ -2022,12 +2000,25 @@ fn whileExpr( | ... | @@ -2022,12 +2000,25 @@ fn whileExpr( |
| 2022 | const tree = scope.tree(); | 2000 | const tree = scope.tree(); |
| 2023 | const node_datas = tree.nodes.items(.data); | 2001 | const node_datas = tree.nodes.items(.data); |
| 2024 | const main_tokens = tree.nodes.items(.main_token); | 2002 | const main_tokens = tree.nodes.items(.main_token); |
| 2025 | const while_src = token_starts[while_node.while_token]; | 2003 | const while_src = token_starts[while_full.ast.while_token]; |
| 2026 | const void_type = try addZIRInstConst(mod, scope, while_src, .{ | 2004 | const void_type = try addZIRInstConst(mod, scope, while_src, .{ |
| 2027 | .ty = Type.initTag(.type), | 2005 | .ty = Type.initTag(.type), |
| 2028 | .val = Value.initTag(.void_type), | 2006 | .val = Value.initTag(.void_type), |
| 2029 | }); | 2007 | }); |
| 2030 | const cond = try cond_kind.cond(mod, &continue_scope, while_src, while_node.condition); | 2008 | const cond = c: { |
| | 2009 | // TODO https://github.com/ziglang/zig/issues/7929 |
| | 2010 | if (while_full.ast.error_token) |error_token| { |
| | 2011 | return mod.failTok(scope, error_token, "TODO implement while error union", .{}); |
| | 2012 | } else if (while_full.payload_token) |payload_token| { |
| | 2013 | return mod.failTok(scope, payload_token, "TODO implement while optional", .{}); |
| | 2014 | } else { |
| | 2015 | const bool_type = try addZIRInstConst(mod, &block_scope.base, while_src, .{ |
| | 2016 | .ty = Type.initTag(.type), |
| | 2017 | .val = Value.initTag(.bool_type), |
| | 2018 | }); |
| | 2019 | break :c try expr(mod, &block_scope.base, .{ .ty = bool_type }, while_full.ast.cond_expr); |
| | 2020 | } |
| | 2021 | }; |
| 2031 | | 2022 | |
| 2032 | const condbr = try addZIRInstSpecial(mod, &continue_scope.base, while_src, zir.Inst.CondBr, .{ | 2023 | const condbr = try addZIRInstSpecial(mod, &continue_scope.base, while_src, zir.Inst.CondBr, .{ |
| 2033 | .condition = cond, | 2024 | .condition = cond, |
| ... | @@ -2041,8 +2032,8 @@ fn whileExpr( | ... | @@ -2041,8 +2032,8 @@ fn whileExpr( |
| 2041 | // are no jumps to it. This happens when the last statement of a while body is noreturn | 2032 | // are no jumps to it. This happens when the last statement of a while body is noreturn |
| 2042 | // and there are no `continue` statements. | 2033 | // and there are no `continue` statements. |
| 2043 | // The "repeat" at the end of a loop body is implied. | 2034 | // The "repeat" at the end of a loop body is implied. |
| 2044 | if (while_node.continue_expr) |cont_expr| { | 2035 | if (while_full.ast.cont_expr != 0) { |
| 2045 | _ = try expr(mod, &loop_scope.base, .{ .ty = void_type }, cont_expr); | 2036 | _ = try expr(mod, &loop_scope.base, .{ .ty = void_type }, while_full.ast.cont_expr); |
| 2046 | } | 2037 | } |
| 2047 | const loop = try scope.arena().create(zir.Inst.Loop); | 2038 | const loop = try scope.arena().create(zir.Inst.Loop); |
| 2048 | loop.* = .{ | 2039 | loop.* = .{ |
| ... | @@ -2062,14 +2053,14 @@ fn whileExpr( | ... | @@ -2062,14 +2053,14 @@ fn whileExpr( |
| 2062 | }); | 2053 | }); |
| 2063 | loop_scope.break_block = while_block; | 2054 | loop_scope.break_block = while_block; |
| 2064 | loop_scope.continue_block = cond_block; | 2055 | loop_scope.continue_block = cond_block; |
| 2065 | if (while_node.label) |some| { | 2056 | if (while_full.label_token) |label_token| { |
| 2066 | loop_scope.label = @as(?Scope.GenZIR.Label, Scope.GenZIR.Label{ | 2057 | loop_scope.label = @as(?Scope.GenZIR.Label, Scope.GenZIR.Label{ |
| 2067 | .token = some, | 2058 | .token = label_token, |
| 2068 | .block_inst = while_block, | 2059 | .block_inst = while_block, |
| 2069 | }); | 2060 | }); |
| 2070 | } | 2061 | } |
| 2071 | | 2062 | |
| 2072 | const then_src = token_starts[while_node.body.lastToken()]; | 2063 | const then_src = token_starts[tree.lastToken(while_full.ast.then_expr)]; |
| 2073 | var then_scope: Scope.GenZIR = .{ | 2064 | var then_scope: Scope.GenZIR = .{ |
| 2074 | .parent = &continue_scope.base, | 2065 | .parent = &continue_scope.base, |
| 2075 | .decl = continue_scope.decl, | 2066 | .decl = continue_scope.decl, |
| ... | @@ -2080,10 +2071,10 @@ fn whileExpr( | ... | @@ -2080,10 +2071,10 @@ fn whileExpr( |
| 2080 | defer then_scope.instructions.deinit(mod.gpa); | 2071 | defer then_scope.instructions.deinit(mod.gpa); |
| 2081 | | 2072 | |
| 2082 | // declare payload to the then_scope | 2073 | // declare payload to the then_scope |
| 2083 | const then_sub_scope = try cond_kind.thenSubScope(mod, &then_scope, then_src, while_node.payload); | 2074 | const then_sub_scope = &then_scope.base; |
| 2084 | | 2075 | |
| 2085 | loop_scope.break_count += 1; | 2076 | loop_scope.break_count += 1; |
| 2086 | const then_result = try expr(mod, then_sub_scope, loop_scope.break_result_loc, while_node.body); | 2077 | const then_result = try expr(mod, then_sub_scope, loop_scope.break_result_loc, while_full.ast.then_expr); |
| 2087 | | 2078 | |
| 2088 | var else_scope: Scope.GenZIR = .{ | 2079 | var else_scope: Scope.GenZIR = .{ |
| 2089 | .parent = &continue_scope.base, | 2080 | .parent = &continue_scope.base, |
| ... | @@ -2094,18 +2085,20 @@ fn whileExpr( | ... | @@ -2094,18 +2085,20 @@ fn whileExpr( |
| 2094 | }; | 2085 | }; |
| 2095 | defer else_scope.instructions.deinit(mod.gpa); | 2086 | defer else_scope.instructions.deinit(mod.gpa); |
| 2096 | | 2087 | |
| 2097 | var else_src: usize = undefined; | 2088 | const else_node = if_full.ast.else_expr; |
| 2098 | const else_result: ?*zir.Inst = if (while_node.@"else") |else_node| blk: { | 2089 | const else_info: struct { src: usize, result: ?*zir.Inst } = if (else_node != 0) blk: { |
| 2099 | else_src = token_starts[else_node.body.lastToken()]; | | |
| 2100 | // declare payload to the then_scope | | |
| 2101 | const else_sub_scope = try cond_kind.elseSubScope(mod, &else_scope, else_src, else_node.payload); | | |
| 2102 | | | |
| 2103 | loop_scope.break_count += 1; | 2090 | loop_scope.break_count += 1; |
| 2104 | break :blk try expr(mod, else_sub_scope, loop_scope.break_result_loc, else_node.body); | 2091 | const sub_scope = &else_scope.base; |
| 2105 | } else blk: { | 2092 | break :blk .{ |
| 2106 | else_src = token_starts[while_node.lastToken()]; | 2093 | .src = token_starts[tree.lastToken(else_node)], |
| 2107 | break :blk null; | 2094 | .result = try expr(mod, sub_scope, loop_scope.break_result_loc, else_node), |
| 2108 | }; | 2095 | }; |
| | 2096 | } else |
| | 2097 | .{ |
| | 2098 | .src = token_starts[tree.lastToken(then_node)], |
| | 2099 | .result = null, |
| | 2100 | }; |
| | 2101 | |
| 2109 | if (loop_scope.label) |some| { | 2102 | if (loop_scope.label) |some| { |
| 2110 | if (!some.used) { | 2103 | if (!some.used) { |
| 2111 | return mod.fail(scope, token_starts[some.token], "unused while label", .{}); | 2104 | return mod.fail(scope, token_starts[some.token], "unused while label", .{}); |
| ... | @@ -2121,9 +2114,9 @@ fn whileExpr( | ... | @@ -2121,9 +2114,9 @@ fn whileExpr( |
| 2121 | &condbr.positionals.then_body, | 2114 | &condbr.positionals.then_body, |
| 2122 | &condbr.positionals.else_body, | 2115 | &condbr.positionals.else_body, |
| 2123 | then_src, | 2116 | then_src, |
| 2124 | else_src, | 2117 | else_info.src, |
| 2125 | then_result, | 2118 | then_result, |
| 2126 | else_result, | 2119 | else_info.result, |
| 2127 | while_block, | 2120 | while_block, |
| 2128 | cond_block, | 2121 | cond_block, |
| 2129 | ); | 2122 | ); |
| ... | @@ -2630,12 +2623,13 @@ fn switchCaseExpr( | ... | @@ -2630,12 +2623,13 @@ fn switchCaseExpr( |
| 2630 | } | 2623 | } |
| 2631 | } | 2624 | } |
| 2632 | | 2625 | |
| 2633 | fn ret(mod: *Module, scope: *Scope, cfe: *ast.Node.ControlFlowExpression) InnerError!*zir.Inst { | 2626 | fn ret(mod: *Module, scope: *Scope, node: ast.Node.Index) InnerError!*zir.Inst { |
| 2634 | const tree = scope.tree(); | 2627 | const tree = scope.tree(); |
| 2635 | const node_datas = tree.nodes.items(.data); | 2628 | const node_datas = tree.nodes.items(.data); |
| 2636 | const main_tokens = tree.nodes.items(.main_token); | 2629 | const main_tokens = tree.nodes.items(.main_token); |
| 2637 | const src = token_starts[cfe.ltoken]; | 2630 | const src = token_starts[main_tokens[node]]; |
| 2638 | if (cfe.getRHS()) |rhs_node| { | 2631 | const rhs_node = node_datas[node].lhs; |
| | 2632 | if (rhs_node != 0) { |
| 2639 | if (nodeMayNeedMemoryLocation(rhs_node, scope)) { | 2633 | if (nodeMayNeedMemoryLocation(rhs_node, scope)) { |
| 2640 | const ret_ptr = try addZIRNoOp(mod, scope, src, .ret_ptr); | 2634 | const ret_ptr = try addZIRNoOp(mod, scope, src, .ret_ptr); |
| 2641 | const operand = try expr(mod, scope, .{ .ptr = ret_ptr }, rhs_node); | 2635 | const operand = try expr(mod, scope, .{ .ptr = ret_ptr }, rhs_node); |
| ... | @@ -2885,64 +2879,29 @@ fn integerLiteral( | ... | @@ -2885,64 +2879,29 @@ fn integerLiteral( |
| 2885 | } | 2879 | } |
| 2886 | } | 2880 | } |
| 2887 | | 2881 | |
| 2888 | fn floatLiteral(mod: *Module, scope: *Scope, float_lit: *ast.Node.OneToken) InnerError!*zir.Inst { | 2882 | fn floatLiteral( |
| | 2883 | mod: *Module, |
| | 2884 | scope: *Scope, |
| | 2885 | rl: ResultLoc, |
| | 2886 | float_lit: ast.Node.Index, |
| | 2887 | ) InnerError!*zir.Inst { |
| 2889 | const arena = scope.arena(); | 2888 | const arena = scope.arena(); |
| 2890 | const tree = scope.tree(); | 2889 | const tree = scope.tree(); |
| 2891 | const node_datas = tree.nodes.items(.data); | | |
| 2892 | const main_tokens = tree.nodes.items(.main_token); | 2890 | const main_tokens = tree.nodes.items(.main_token); |
| 2893 | const bytes = tree.tokenSlice(float_lit.token); | 2891 | const main_token = main_tokens[float_lit]; |
| | 2892 | const bytes = tree.tokenSlice(main_token); |
| 2894 | if (bytes.len > 2 and bytes[1] == 'x') { | 2893 | if (bytes.len > 2 and bytes[1] == 'x') { |
| 2895 | return mod.failTok(scope, float_lit.token, "TODO hex floats", .{}); | 2894 | return mod.failTok(scope, main_token, "TODO implement hex floats", .{}); |
| 2896 | } | 2895 | } |
| 2897 | | | |
| 2898 | const float_number = std.fmt.parseFloat(f128, bytes) catch |e| switch (e) { | 2896 | const float_number = std.fmt.parseFloat(f128, bytes) catch |e| switch (e) { |
| 2899 | error.InvalidCharacter => unreachable, // validated by tokenizer | 2897 | error.InvalidCharacter => unreachable, // validated by tokenizer |
| 2900 | }; | 2898 | }; |
| 2901 | const src = token_starts[float_lit.token]; | 2899 | const src = token_starts[main_token]; |
| 2902 | return addZIRInstConst(mod, scope, src, .{ | 2900 | const result = try addZIRInstConst(mod, scope, src, .{ |
| 2903 | .ty = Type.initTag(.comptime_float), | 2901 | .ty = Type.initTag(.comptime_float), |
| 2904 | .val = try Value.Tag.float_128.create(arena, float_number), | 2902 | .val = try Value.Tag.float_128.create(arena, float_number), |
| 2905 | }); | 2903 | }); |
| 2906 | } | 2904 | return rvalue(mod, scope, rl, result); |
| 2907 | | | |
| 2908 | fn undefLiteral(mod: *Module, scope: *Scope, node: *ast.Node.OneToken) InnerError!*zir.Inst { | | |
| 2909 | const arena = scope.arena(); | | |
| 2910 | const tree = scope.tree(); | | |
| 2911 | const node_datas = tree.nodes.items(.data); | | |
| 2912 | const main_tokens = tree.nodes.items(.main_token); | | |
| 2913 | const src = token_starts[node.token]; | | |
| 2914 | return addZIRInstConst(mod, scope, src, .{ | | |
| 2915 | .ty = Type.initTag(.@"undefined"), | | |
| 2916 | .val = Value.initTag(.undef), | | |
| 2917 | }); | | |
| 2918 | } | | |
| 2919 | | | |
| 2920 | fn boolLiteral(mod: *Module, scope: *Scope, node: *ast.Node.OneToken) InnerError!*zir.Inst { | | |
| 2921 | const arena = scope.arena(); | | |
| 2922 | const tree = scope.tree(); | | |
| 2923 | const node_datas = tree.nodes.items(.data); | | |
| 2924 | const main_tokens = tree.nodes.items(.main_token); | | |
| 2925 | const src = token_starts[node.token]; | | |
| 2926 | return addZIRInstConst(mod, scope, src, .{ | | |
| 2927 | .ty = Type.initTag(.bool), | | |
| 2928 | .val = switch (tree.token_ids[node.token]) { | | |
| 2929 | .keyword_true => Value.initTag(.bool_true), | | |
| 2930 | .keyword_false => Value.initTag(.bool_false), | | |
| 2931 | else => unreachable, | | |
| 2932 | }, | | |
| 2933 | }); | | |
| 2934 | } | | |
| 2935 | | | |
| 2936 | fn nullLiteral(mod: *Module, scope: *Scope, node: *ast.Node.OneToken) InnerError!*zir.Inst { | | |
| 2937 | const arena = scope.arena(); | | |
| 2938 | const tree = scope.tree(); | | |
| 2939 | const node_datas = tree.nodes.items(.data); | | |
| 2940 | const main_tokens = tree.nodes.items(.main_token); | | |
| 2941 | const src = token_starts[node.token]; | | |
| 2942 | return addZIRInstConst(mod, scope, src, .{ | | |
| 2943 | .ty = Type.initTag(.@"null"), | | |
| 2944 | .val = Value.initTag(.null_value), | | |
| 2945 | }); | | |
| 2946 | } | 2905 | } |
| 2947 | | 2906 | |
| 2948 | fn assembly(mod: *Module, scope: *Scope, rl: ResultLoc, full: ast.full.Asm) InnerError!*zir.Inst { | 2907 | fn assembly(mod: *Module, scope: *Scope, rl: ResultLoc, full: ast.full.Asm) InnerError!*zir.Inst { |
| ... | @@ -2987,76 +2946,36 @@ fn assembly(mod: *Module, scope: *Scope, rl: ResultLoc, full: ast.full.Asm) Inne | ... | @@ -2987,76 +2946,36 @@ fn assembly(mod: *Module, scope: *Scope, rl: ResultLoc, full: ast.full.Asm) Inne |
| 2987 | return rvalue(mod, scope, rl, asm_inst); | 2946 | return rvalue(mod, scope, rl, asm_inst); |
| 2988 | } | 2947 | } |
| 2989 | | 2948 | |
| 2990 | fn ensureBuiltinParamCount(mod: *Module, scope: *Scope, call: *ast.Node.builtin_call, count: u32) !void { | | |
| 2991 | if (call.params_len == count) | | |
| 2992 | return; | | |
| 2993 | | | |
| 2994 | const s = if (count == 1) "" else "s"; | | |
| 2995 | return mod.failTok(scope, call.builtin_token, "expected {d} parameter{s}, found {d}", .{ count, s, call.params_len }); | | |
| 2996 | } | | |
| 2997 | | | |
| 2998 | fn simpleCast( | | |
| 2999 | mod: *Module, | | |
| 3000 | scope: *Scope, | | |
| 3001 | rl: ResultLoc, | | |
| 3002 | call: *ast.Node.builtin_call, | | |
| 3003 | inst_tag: zir.Inst.Tag, | | |
| 3004 | ) InnerError!*zir.Inst { | | |
| 3005 | try ensureBuiltinParamCount(mod, scope, call, 2); | | |
| 3006 | const tree = scope.tree(); | | |
| 3007 | const node_datas = tree.nodes.items(.data); | | |
| 3008 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3009 | const src = token_starts[call.builtin_token]; | | |
| 3010 | const params = call.params(); | | |
| 3011 | const dest_type = try typeExpr(mod, scope, params[0]); | | |
| 3012 | const rhs = try expr(mod, scope, .none, params[1]); | | |
| 3013 | const result = try addZIRBinOp(mod, scope, src, inst_tag, dest_type, rhs); | | |
| 3014 | return rvalue(mod, scope, rl, result); | | |
| 3015 | } | | |
| 3016 | | | |
| 3017 | fn ptrToInt(mod: *Module, scope: *Scope, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | | |
| 3018 | try ensureBuiltinParamCount(mod, scope, call, 1); | | |
| 3019 | const operand = try expr(mod, scope, .none, call.params()[0]); | | |
| 3020 | const tree = scope.tree(); | | |
| 3021 | const node_datas = tree.nodes.items(.data); | | |
| 3022 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3023 | const src = token_starts[call.builtin_token]; | | |
| 3024 | return addZIRUnOp(mod, scope, src, .ptrtoint, operand); | | |
| 3025 | } | | |
| 3026 | | | |
| 3027 | fn as( | 2949 | fn as( |
| 3028 | mod: *Module, | 2950 | mod: *Module, |
| 3029 | scope: *Scope, | 2951 | scope: *Scope, |
| 3030 | rl: ResultLoc, | 2952 | rl: ResultLoc, |
| 3031 | call: *ast.Node.builtin_call, | 2953 | builtin_token: ast.TokenIndex, |
| | 2954 | src: usize, |
| | 2955 | lhs: ast.Node.Index, |
| | 2956 | rhs: ast.Node.Index, |
| 3032 | ) InnerError!*zir.Inst { | 2957 | ) InnerError!*zir.Inst { |
| 3033 | try ensureBuiltinParamCount(mod, scope, call, 2); | 2958 | const dest_type = try typeExpr(mod, scope, lhs); |
| 3034 | const tree = scope.tree(); | | |
| 3035 | const node_datas = tree.nodes.items(.data); | | |
| 3036 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3037 | const src = token_starts[call.builtin_token]; | | |
| 3038 | const params = call.params(); | | |
| 3039 | const dest_type = try typeExpr(mod, scope, params[0]); | | |
| 3040 | switch (rl) { | 2959 | switch (rl) { |
| 3041 | .none, .discard, .ref, .ty => { | 2960 | .none, .discard, .ref, .ty => { |
| 3042 | const result = try expr(mod, scope, .{ .ty = dest_type }, params[1]); | 2961 | const result = try expr(mod, scope, .{ .ty = dest_type }, rhs); |
| 3043 | return rvalue(mod, scope, rl, result); | 2962 | return rvalue(mod, scope, rl, result); |
| 3044 | }, | 2963 | }, |
| 3045 | | 2964 | |
| 3046 | .ptr => |result_ptr| { | 2965 | .ptr => |result_ptr| { |
| 3047 | return asRlPtr(mod, scope, rl, src, result_ptr, params[1], dest_type); | 2966 | return asRlPtr(mod, scope, rl, src, result_ptr, rhs, dest_type); |
| 3048 | }, | 2967 | }, |
| 3049 | .block_ptr => |block_scope| { | 2968 | .block_ptr => |block_scope| { |
| 3050 | return asRlPtr(mod, scope, rl, src, block_scope.rl_ptr.?, params[1], dest_type); | 2969 | return asRlPtr(mod, scope, rl, src, block_scope.rl_ptr.?, rhs, dest_type); |
| 3051 | }, | 2970 | }, |
| 3052 | | 2971 | |
| 3053 | .bitcasted_ptr => |bitcasted_ptr| { | 2972 | .bitcasted_ptr => |bitcasted_ptr| { |
| 3054 | // TODO here we should be able to resolve the inference; we now have a type for the result. | 2973 | // TODO here we should be able to resolve the inference; we now have a type for the result. |
| 3055 | return mod.failTok(scope, call.builtin_token, "TODO implement @as with result location @bitCast", .{}); | 2974 | return mod.failTok(scope, builtin_token, "TODO implement @as with result location @bitCast", .{}); |
| 3056 | }, | 2975 | }, |
| 3057 | .inferred_ptr => |result_alloc| { | 2976 | .inferred_ptr => |result_alloc| { |
| 3058 | // TODO here we should be able to resolve the inference; we now have a type for the result. | 2977 | // TODO here we should be able to resolve the inference; we now have a type for the result. |
| 3059 | return mod.failTok(scope, call.builtin_token, "TODO implement @as with inferred-type result location pointer", .{}); | 2978 | return mod.failTok(scope, builtin_token, "TODO implement @as with inferred-type result location pointer", .{}); |
| 3060 | }, | 2979 | }, |
| 3061 | } | 2980 | } |
| 3062 | } | 2981 | } |
| ... | @@ -3105,170 +3024,290 @@ fn asRlPtr( | ... | @@ -3105,170 +3024,290 @@ fn asRlPtr( |
| 3105 | } | 3024 | } |
| 3106 | } | 3025 | } |
| 3107 | | 3026 | |
| 3108 | fn bitCast(mod: *Module, scope: *Scope, rl: ResultLoc, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | 3027 | fn bitCast( |
| 3109 | try ensureBuiltinParamCount(mod, scope, call, 2); | 3028 | mod: *Module, |
| 3110 | const tree = scope.tree(); | 3029 | scope: *Scope, |
| 3111 | const node_datas = tree.nodes.items(.data); | 3030 | rl: ResultLoc, |
| 3112 | const main_tokens = tree.nodes.items(.main_token); | 3031 | builtin_token: ast.TokenIndex, |
| 3113 | const src = token_starts[call.builtin_token]; | 3032 | src: usize, |
| 3114 | const params = call.params(); | 3033 | lhs: ast.Node.Index, |
| 3115 | const dest_type = try typeExpr(mod, scope, params[0]); | 3034 | rhs: ast.Node.Index, |
| | 3035 | ) InnerError!*zir.Inst { |
| | 3036 | const dest_type = try typeExpr(mod, scope, lhs); |
| 3116 | switch (rl) { | 3037 | switch (rl) { |
| 3117 | .none => { | 3038 | .none => { |
| 3118 | const operand = try expr(mod, scope, .none, params[1]); | 3039 | const operand = try expr(mod, scope, .none, rhs); |
| 3119 | return addZIRBinOp(mod, scope, src, .bitcast, dest_type, operand); | 3040 | return addZIRBinOp(mod, scope, src, .bitcast, dest_type, operand); |
| 3120 | }, | 3041 | }, |
| 3121 | .discard => { | 3042 | .discard => { |
| 3122 | const operand = try expr(mod, scope, .none, params[1]); | 3043 | const operand = try expr(mod, scope, .none, rhs); |
| 3123 | const result = try addZIRBinOp(mod, scope, src, .bitcast, dest_type, operand); | 3044 | const result = try addZIRBinOp(mod, scope, src, .bitcast, dest_type, operand); |
| 3124 | _ = try addZIRUnOp(mod, scope, result.src, .ensure_result_non_error, result); | 3045 | _ = try addZIRUnOp(mod, scope, result.src, .ensure_result_non_error, result); |
| 3125 | return result; | 3046 | return result; |
| 3126 | }, | 3047 | }, |
| 3127 | .ref => { | 3048 | .ref => { |
| 3128 | const operand = try expr(mod, scope, .ref, params[1]); | 3049 | const operand = try expr(mod, scope, .ref, rhs); |
| 3129 | const result = try addZIRBinOp(mod, scope, src, .bitcast_ref, dest_type, operand); | 3050 | const result = try addZIRBinOp(mod, scope, src, .bitcast_ref, dest_type, operand); |
| 3130 | return result; | 3051 | return result; |
| 3131 | }, | 3052 | }, |
| 3132 | .ty => |result_ty| { | 3053 | .ty => |result_ty| { |
| 3133 | const result = try expr(mod, scope, .none, params[1]); | 3054 | const result = try expr(mod, scope, .none, rhs); |
| 3134 | const bitcasted = try addZIRBinOp(mod, scope, src, .bitcast, dest_type, result); | 3055 | const bitcasted = try addZIRBinOp(mod, scope, src, .bitcast, dest_type, result); |
| 3135 | return addZIRBinOp(mod, scope, src, .as, result_ty, bitcasted); | 3056 | return addZIRBinOp(mod, scope, src, .as, result_ty, bitcasted); |
| 3136 | }, | 3057 | }, |
| 3137 | .ptr => |result_ptr| { | 3058 | .ptr => |result_ptr| { |
| 3138 | const casted_result_ptr = try addZIRUnOp(mod, scope, src, .bitcast_result_ptr, result_ptr); | 3059 | const casted_result_ptr = try addZIRUnOp(mod, scope, src, .bitcast_result_ptr, result_ptr); |
| 3139 | return expr(mod, scope, .{ .bitcasted_ptr = casted_result_ptr.castTag(.bitcast_result_ptr).? }, params[1]); | 3060 | return expr(mod, scope, .{ .bitcasted_ptr = casted_result_ptr.castTag(.bitcast_result_ptr).? }, rhs); |
| 3140 | }, | 3061 | }, |
| 3141 | .bitcasted_ptr => |bitcasted_ptr| { | 3062 | .bitcasted_ptr => |bitcasted_ptr| { |
| 3142 | return mod.failTok(scope, call.builtin_token, "TODO implement @bitCast with result location another @bitCast", .{}); | 3063 | return mod.failTok(scope, builtin_token, "TODO implement @bitCast with result location another @bitCast", .{}); |
| 3143 | }, | 3064 | }, |
| 3144 | .block_ptr => |block_ptr| { | 3065 | .block_ptr => |block_ptr| { |
| 3145 | return mod.failTok(scope, call.builtin_token, "TODO implement @bitCast with result location inferred peer types", .{}); | 3066 | return mod.failTok(scope, builtin_token, "TODO implement @bitCast with result location inferred peer types", .{}); |
| 3146 | }, | 3067 | }, |
| 3147 | .inferred_ptr => |result_alloc| { | 3068 | .inferred_ptr => |result_alloc| { |
| 3148 | // TODO here we should be able to resolve the inference; we now have a type for the result. | 3069 | // TODO here we should be able to resolve the inference; we now have a type for the result. |
| 3149 | return mod.failTok(scope, call.builtin_token, "TODO implement @bitCast with inferred-type result location pointer", .{}); | 3070 | return mod.failTok(scope, builtin_token, "TODO implement @bitCast with inferred-type result location pointer", .{}); |
| 3150 | }, | 3071 | }, |
| 3151 | } | 3072 | } |
| 3152 | } | 3073 | } |
| 3153 | | 3074 | |
| 3154 | fn import(mod: *Module, scope: *Scope, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | 3075 | fn typeOf( |
| 3155 | try ensureBuiltinParamCount(mod, scope, call, 1); | 3076 | mod: *Module, |
| 3156 | const tree = scope.tree(); | 3077 | scope: *Scope, |
| 3157 | const node_datas = tree.nodes.items(.data); | 3078 | rl: ResultLoc, |
| 3158 | const main_tokens = tree.nodes.items(.main_token); | 3079 | builtin_token: ast.TokenIndex, |
| 3159 | const src = token_starts[call.builtin_token]; | 3080 | src: usize, |
| 3160 | const params = call.params(); | 3081 | params: []const ast.Node.Index, |
| 3161 | const target = try expr(mod, scope, .none, params[0]); | 3082 | ) InnerError!*zir.Inst { |
| 3162 | return addZIRUnOp(mod, scope, src, .import, target); | | |
| 3163 | } | | |
| 3164 | | | |
| 3165 | fn compileError(mod: *Module, scope: *Scope, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | | |
| 3166 | try ensureBuiltinParamCount(mod, scope, call, 1); | | |
| 3167 | const tree = scope.tree(); | | |
| 3168 | const node_datas = tree.nodes.items(.data); | | |
| 3169 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3170 | const src = token_starts[call.builtin_token]; | | |
| 3171 | const params = call.params(); | | |
| 3172 | const target = try expr(mod, scope, .none, params[0]); | | |
| 3173 | return addZIRUnOp(mod, scope, src, .compile_error, target); | | |
| 3174 | } | | |
| 3175 | | | |
| 3176 | fn setEvalBranchQuota(mod: *Module, scope: *Scope, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | | |
| 3177 | try ensureBuiltinParamCount(mod, scope, call, 1); | | |
| 3178 | const tree = scope.tree(); | | |
| 3179 | const node_datas = tree.nodes.items(.data); | | |
| 3180 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3181 | const src = token_starts[call.builtin_token]; | | |
| 3182 | const params = call.params(); | | |
| 3183 | const u32_type = try addZIRInstConst(mod, scope, src, .{ | | |
| 3184 | .ty = Type.initTag(.type), | | |
| 3185 | .val = Value.initTag(.u32_type), | | |
| 3186 | }); | | |
| 3187 | const quota = try expr(mod, scope, .{ .ty = u32_type }, params[0]); | | |
| 3188 | return addZIRUnOp(mod, scope, src, .set_eval_branch_quota, quota); | | |
| 3189 | } | | |
| 3190 | | | |
| 3191 | fn typeOf(mod: *Module, scope: *Scope, rl: ResultLoc, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | | |
| 3192 | const tree = scope.tree(); | | |
| 3193 | const node_datas = tree.nodes.items(.data); | | |
| 3194 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3195 | const arena = scope.arena(); | | |
| 3196 | const src = token_starts[call.builtin_token]; | | |
| 3197 | const params = call.params(); | | |
| 3198 | if (params.len < 1) { | 3083 | if (params.len < 1) { |
| 3199 | return mod.failTok(scope, call.builtin_token, "expected at least 1 argument, found 0", .{}); | 3084 | return mod.failTok(scope, builtin_token, "expected at least 1 argument, found 0", .{}); |
| 3200 | } | 3085 | } |
| 3201 | if (params.len == 1) { | 3086 | if (params.len == 1) { |
| 3202 | return rvalue(mod, scope, rl, try addZIRUnOp(mod, scope, src, .typeof, try expr(mod, scope, .none, params[0]))); | 3087 | return rvalue(mod, scope, rl, try addZIRUnOp(mod, scope, src, .typeof, try expr(mod, scope, .none, params[0]))); |
| 3203 | } | 3088 | } |
| | 3089 | const arena = scope.arena(); |
| 3204 | var items = try arena.alloc(*zir.Inst, params.len); | 3090 | var items = try arena.alloc(*zir.Inst, params.len); |
| 3205 | for (params) |param, param_i| | 3091 | for (params) |param, param_i| |
| 3206 | items[param_i] = try expr(mod, scope, .none, param); | 3092 | items[param_i] = try expr(mod, scope, .none, param); |
| 3207 | return rvalue(mod, scope, rl, try addZIRInst(mod, scope, src, zir.Inst.TypeOfPeer, .{ .items = items }, .{})); | 3093 | return rvalue(mod, scope, rl, try addZIRInst(mod, scope, src, zir.Inst.TypeOfPeer, .{ .items = items }, .{})); |
| 3208 | } | 3094 | } |
| 3209 | fn compileLog(mod: *Module, scope: *Scope, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | | |
| 3210 | const tree = scope.tree(); | | |
| 3211 | const node_datas = tree.nodes.items(.data); | | |
| 3212 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3213 | const arena = scope.arena(); | | |
| 3214 | const src = token_starts[call.builtin_token]; | | |
| 3215 | const params = call.params(); | | |
| 3216 | var targets = try arena.alloc(*zir.Inst, params.len); | | |
| 3217 | for (params) |param, param_i| | | |
| 3218 | targets[param_i] = try expr(mod, scope, .none, param); | | |
| 3219 | return addZIRInst(mod, scope, src, zir.Inst.CompileLog, .{ .to_log = targets }, .{}); | | |
| 3220 | } | | |
| 3221 | | 3095 | |
| 3222 | fn builtinCall(mod: *Module, scope: *Scope, rl: ResultLoc, call: *ast.Node.builtin_call) InnerError!*zir.Inst { | 3096 | fn builtinCall( |
| | 3097 | mod: *Module, |
| | 3098 | scope: *Scope, |
| | 3099 | rl: ResultLoc, |
| | 3100 | call: ast.Node.Index, |
| | 3101 | params: []const ast.Node.Index, |
| | 3102 | ) InnerError!*zir.Inst { |
| 3223 | const tree = scope.tree(); | 3103 | const tree = scope.tree(); |
| 3224 | const node_datas = tree.nodes.items(.data); | 3104 | const node_datas = tree.nodes.items(.data); |
| 3225 | const main_tokens = tree.nodes.items(.main_token); | 3105 | const main_tokens = tree.nodes.items(.main_token); |
| 3226 | const builtin_name = tree.tokenSlice(call.builtin_token); | 3106 | const builtin_token = main_tokens[call]; |
| | 3107 | const builtin_name = tree.tokenSlice(builtin_token); |
| 3227 | | 3108 | |
| 3228 | // We handle the different builtins manually because they have different semantics depending | 3109 | // We handle the different builtins manually because they have different semantics depending |
| 3229 | // on the function. For example, `@as` and others participate in result location semantics, | 3110 | // on the function. For example, `@as` and others participate in result location semantics, |
| 3230 | // and `@cImport` creates a special scope that collects a .c source code text buffer. | 3111 | // and `@cImport` creates a special scope that collects a .c source code text buffer. |
| 3231 | // Also, some builtins have a variable number of parameters. | 3112 | // Also, some builtins have a variable number of parameters. |
| 3232 | | 3113 | |
| 3233 | if (mem.eql(u8, builtin_name, "@ptrToInt")) { | 3114 | const info = BuiltinFn.list.get(builtin_name) orelse { |
| 3234 | return rvalue(mod, scope, rl, try ptrToInt(mod, scope, call)); | 3115 | return mod.failTok(scope, builtin_token, "invalid builtin function: '{s}'", .{ |
| 3235 | } else if (mem.eql(u8, builtin_name, "@as")) { | 3116 | builtin_name, |
| 3236 | return as(mod, scope, rl, call); | 3117 | }); |
| 3237 | } else if (mem.eql(u8, builtin_name, "@floatCast")) { | 3118 | }; |
| 3238 | return simpleCast(mod, scope, rl, call, .floatcast); | 3119 | if (info.param_count != params.len) { |
| 3239 | } else if (mem.eql(u8, builtin_name, "@intCast")) { | 3120 | const s = if (params.len == 1) "" else "s"; |
| 3240 | return simpleCast(mod, scope, rl, call, .intcast); | 3121 | return mod.failTok(scope, builtin_token, "expected {d} parameter{s}, found {d}", .{ |
| 3241 | } else if (mem.eql(u8, builtin_name, "@bitCast")) { | 3122 | expected, s, found, |
| 3242 | return bitCast(mod, scope, rl, call); | 3123 | }); |
| 3243 | } else if (mem.eql(u8, builtin_name, "@TypeOf")) { | 3124 | } |
| 3244 | return typeOf(mod, scope, rl, call); | 3125 | const src = token_starts[builtin_token]; |
| 3245 | } else if (mem.eql(u8, builtin_name, "@breakpoint")) { | 3126 | |
| 3246 | const src = token_starts[call.builtin_token]; | 3127 | switch (info.tag) { |
| 3247 | return rvalue(mod, scope, rl, try addZIRNoOp(mod, scope, src, .breakpoint)); | 3128 | .ptr_to_int => { |
| 3248 | } else if (mem.eql(u8, builtin_name, "@import")) { | 3129 | const operand = try expr(mod, scope, .none, params[0]); |
| 3249 | return rvalue(mod, scope, rl, try import(mod, scope, call)); | 3130 | const result = try addZIRUnOp(mod, scope, src, .ptrtoint, operand); |
| 3250 | } else if (mem.eql(u8, builtin_name, "@compileError")) { | 3131 | return rvalue(mod, scope, rl, result); |
| 3251 | return compileError(mod, scope, call); | 3132 | }, |
| 3252 | } else if (mem.eql(u8, builtin_name, "@setEvalBranchQuota")) { | 3133 | .float_cast => { |
| 3253 | return setEvalBranchQuota(mod, scope, call); | 3134 | const dest_type = try typeExpr(mod, scope, params[0]); |
| 3254 | } else if (mem.eql(u8, builtin_name, "@compileLog")) { | 3135 | const rhs = try expr(mod, scope, .none, params[1]); |
| 3255 | return compileLog(mod, scope, call); | 3136 | const result = try addZIRBinOp(mod, scope, src, .floatcast, dest_type, rhs); |
| 3256 | } else if (mem.eql(u8, builtin_name, "@field")) { | 3137 | return rvalue(mod, scope, rl, result); |
| 3257 | return namedField(mod, scope, rl, call); | 3138 | }, |
| 3258 | } else { | 3139 | .int_cast => { |
| 3259 | return mod.failTok(scope, call.builtin_token, "invalid builtin function: '{s}'", .{builtin_name}); | 3140 | const dest_type = try typeExpr(mod, scope, params[0]); |
| | 3141 | const rhs = try expr(mod, scope, .none, params[1]); |
| | 3142 | const result = try addZIRBinOp(mod, scope, src, .intcast, dest_type, rhs); |
| | 3143 | return rvalue(mod, scope, rl, result); |
| | 3144 | }, |
| | 3145 | .breakpoint => { |
| | 3146 | const result = try addZIRNoOp(mod, scope, src, .breakpoint); |
| | 3147 | return rvalue(mod, scope, rl, result); |
| | 3148 | }, |
| | 3149 | .import => { |
| | 3150 | const target = try expr(mod, scope, .none, params[0]); |
| | 3151 | const result = try addZIRUnOp(mod, scope, src, .import, target); |
| | 3152 | return rvalue(mod, scope, rl, result); |
| | 3153 | }, |
| | 3154 | .compile_error => { |
| | 3155 | const target = try expr(mod, scope, .none, params[0]); |
| | 3156 | const result = addZIRUnOp(mod, scope, src, .compile_error, target); |
| | 3157 | return rvalue(mod, scope, rl, result); |
| | 3158 | }, |
| | 3159 | .set_eval_branch_quota => { |
| | 3160 | const u32_type = try addZIRInstConst(mod, scope, src, .{ |
| | 3161 | .ty = Type.initTag(.type), |
| | 3162 | .val = Value.initTag(.u32_type), |
| | 3163 | }); |
| | 3164 | const quota = try expr(mod, scope, .{ .ty = u32_type }, params[0]); |
| | 3165 | const result = try addZIRUnOp(mod, scope, src, .set_eval_branch_quota, quota); |
| | 3166 | return rvalue(mod, scope, rl, result); |
| | 3167 | }, |
| | 3168 | .compile_log => { |
| | 3169 | const arena = scope.arena(); |
| | 3170 | var targets = try arena.alloc(*zir.Inst, params.len); |
| | 3171 | for (params) |param, param_i| |
| | 3172 | targets[param_i] = try expr(mod, scope, .none, param); |
| | 3173 | const result = try addZIRInst(mod, scope, src, zir.Inst.CompileLog, .{ .to_log = targets }, .{}); |
| | 3174 | return rvalue(mod, scope, rl, result); |
| | 3175 | }, |
| | 3176 | .field => { |
| | 3177 | const string_type = try addZIRInstConst(mod, scope, src, .{ |
| | 3178 | .ty = Type.initTag(.type), |
| | 3179 | .val = Value.initTag(.const_slice_u8_type), |
| | 3180 | }); |
| | 3181 | const string_rl: ResultLoc = .{ .ty = string_type }; |
| | 3182 | |
| | 3183 | if (rl == .ref) { |
| | 3184 | return addZirInstTag(mod, scope, src, .field_ptr_named, .{ |
| | 3185 | .object = try expr(mod, scope, .ref, params[0]), |
| | 3186 | .field_name = try comptimeExpr(mod, scope, string_rl, params[1]), |
| | 3187 | }); |
| | 3188 | } |
| | 3189 | return rvalue(mod, scope, rl, try addZirInstTag(mod, scope, src, .field_val_named, .{ |
| | 3190 | .object = try expr(mod, scope, .none, params[0]), |
| | 3191 | .field_name = try comptimeExpr(mod, scope, string_rl, params[1]), |
| | 3192 | })); |
| | 3193 | }, |
| | 3194 | .as => return as(mod, scope, rl, builtin_token, src, params[0], params[1]), |
| | 3195 | .bit_cast => return bitCast(mod, scope, rl, builtin_token, src, params[0], params[1]), |
| | 3196 | .TypeOf => return typeOf(mod, scope, rl, builtin_token, src, params), |
| | 3197 | |
| | 3198 | .add_with_overflow, |
| | 3199 | .align_cast, |
| | 3200 | .align_of, |
| | 3201 | .async_call, |
| | 3202 | .atomic_load, |
| | 3203 | .atomic_rmw, |
| | 3204 | .atomic_store, |
| | 3205 | .bit_offset_of, |
| | 3206 | .bool_to_int, |
| | 3207 | .bit_size_of, |
| | 3208 | .mul_add, |
| | 3209 | .byte_swap, |
| | 3210 | .bit_reverse, |
| | 3211 | .byte_offset_of, |
| | 3212 | .call, |
| | 3213 | .c_define, |
| | 3214 | .c_import, |
| | 3215 | .c_include, |
| | 3216 | .clz, |
| | 3217 | .cmpxchg_strong, |
| | 3218 | .cmpxchg_weak, |
| | 3219 | .ctz, |
| | 3220 | .c_undef, |
| | 3221 | .div_exact, |
| | 3222 | .div_floor, |
| | 3223 | .div_trunc, |
| | 3224 | .embed_file, |
| | 3225 | .enum_to_int, |
| | 3226 | .error_name, |
| | 3227 | .error_return_trace, |
| | 3228 | .error_to_int, |
| | 3229 | .err_set_cast, |
| | 3230 | .@"export", |
| | 3231 | .fence, |
| | 3232 | .field_parent_ptr, |
| | 3233 | .float_to_int, |
| | 3234 | .frame, |
| | 3235 | .Frame, |
| | 3236 | .frame_address, |
| | 3237 | .frame_size, |
| | 3238 | .has_decl, |
| | 3239 | .has_field, |
| | 3240 | .int_to_enum, |
| | 3241 | .int_to_error, |
| | 3242 | .int_to_float, |
| | 3243 | .int_to_ptr, |
| | 3244 | .memcpy, |
| | 3245 | .memset, |
| | 3246 | .wasm_memory_size, |
| | 3247 | .wasm_memory_grow, |
| | 3248 | .mod, |
| | 3249 | .mul_with_overflow, |
| | 3250 | .panic, |
| | 3251 | .pop_count, |
| | 3252 | .ptr_cast, |
| | 3253 | .rem, |
| | 3254 | .return_address, |
| | 3255 | .set_align_stack, |
| | 3256 | .set_cold, |
| | 3257 | .set_float_mode, |
| | 3258 | .set_runtime_safety, |
| | 3259 | .shl_exact, |
| | 3260 | .shl_with_overflow, |
| | 3261 | .shr_exact, |
| | 3262 | .shuffle, |
| | 3263 | .size_of, |
| | 3264 | .splat, |
| | 3265 | .reduce, |
| | 3266 | .src, |
| | 3267 | .sqrt, |
| | 3268 | .sin, |
| | 3269 | .cos, |
| | 3270 | .exp, |
| | 3271 | .exp2, |
| | 3272 | .log, |
| | 3273 | .log2, |
| | 3274 | .log10, |
| | 3275 | .fabs, |
| | 3276 | .floor, |
| | 3277 | .ceil, |
| | 3278 | .trunc, |
| | 3279 | .round, |
| | 3280 | .sub_with_overflow, |
| | 3281 | .tag_name, |
| | 3282 | .This, |
| | 3283 | .truncate, |
| | 3284 | .Type, |
| | 3285 | .type_info, |
| | 3286 | .type_name, |
| | 3287 | .union_init, |
| | 3288 | => return mod.failTok(scope, builtin_token, "TODO: implement builtin function {s}", .{ |
| | 3289 | builtin_name, |
| | 3290 | }), |
| 3260 | } | 3291 | } |
| 3261 | } | 3292 | } |
| 3262 | | 3293 | |
| 3263 | fn callExpr(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.call) InnerError!*zir.Inst { | 3294 | fn callExpr( |
| | 3295 | mod: *Module, |
| | 3296 | scope: *Scope, |
| | 3297 | rl: ResultLoc, |
| | 3298 | call: ast.full.Call, |
| | 3299 | ) InnerError!*zir.Inst { |
| | 3300 | if (call.async_token) |async_token| { |
| | 3301 | return mod.failTok(scope, async_token, "TODO implement async fn call", .{}); |
| | 3302 | } |
| | 3303 | |
| 3264 | const tree = scope.tree(); | 3304 | const tree = scope.tree(); |
| 3265 | const node_datas = tree.nodes.items(.data); | 3305 | const node_datas = tree.nodes.items(.data); |
| 3266 | const main_tokens = tree.nodes.items(.main_token); | 3306 | const main_tokens = tree.nodes.items(.main_token); |
| 3267 | const lhs = try expr(mod, scope, .none, node.lhs); | 3307 | const lhs = try expr(mod, scope, .none, call.ast.fn_expr); |
| 3268 | | 3308 | |
| 3269 | const param_nodes = node.params(); | 3309 | const args = try scope.getGenZIR().arena.alloc(*zir.Inst, call.ast.params.len); |
| 3270 | const args = try scope.getGenZIR().arena.alloc(*zir.Inst, param_nodes.len); | 3310 | for (call.ast.params) |param_node, i| { |
| 3271 | for (param_nodes) |param_node, i| { | | |
| 3272 | const param_src = token_starts[tree.firstToken(param_node)]; | 3311 | const param_src = token_starts[tree.firstToken(param_node)]; |
| 3273 | const param_type = try addZIRInst(mod, scope, param_src, zir.Inst.ParamType, .{ | 3312 | const param_type = try addZIRInst(mod, scope, param_src, zir.Inst.ParamType, .{ |
| 3274 | .func = lhs, | 3313 | .func = lhs, |
| ... | @@ -3277,7 +3316,7 @@ fn callExpr(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.call) In | ... | @@ -3277,7 +3316,7 @@ fn callExpr(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.call) In |
| 3277 | args[i] = try expr(mod, scope, .{ .ty = param_type }, param_node); | 3316 | args[i] = try expr(mod, scope, .{ .ty = param_type }, param_node); |
| 3278 | } | 3317 | } |
| 3279 | | 3318 | |
| 3280 | const src = token_starts[node.lhs.firstToken()]; | 3319 | const src = token_starts[call.ast.lparen]; |
| 3281 | const result = try addZIRInst(mod, scope, src, zir.Inst.Call, .{ | 3320 | const result = try addZIRInst(mod, scope, src, zir.Inst.Call, .{ |
| 3282 | .func = lhs, | 3321 | .func = lhs, |
| 3283 | .args = args, | 3322 | .args = args, |
| ... | @@ -3286,14 +3325,6 @@ fn callExpr(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.call) In | ... | @@ -3286,14 +3325,6 @@ fn callExpr(mod: *Module, scope: *Scope, rl: ResultLoc, node: *ast.Node.call) In |
| 3286 | return rvalue(mod, scope, rl, result); | 3325 | return rvalue(mod, scope, rl, result); |
| 3287 | } | 3326 | } |
| 3288 | | 3327 | |
| 3289 | fn unreach(mod: *Module, scope: *Scope, unreach_node: *ast.Node.OneToken) InnerError!*zir.Inst { | | |
| 3290 | const tree = scope.tree(); | | |
| 3291 | const node_datas = tree.nodes.items(.data); | | |
| 3292 | const main_tokens = tree.nodes.items(.main_token); | | |
| 3293 | const src = token_starts[unreach_node.token]; | | |
| 3294 | return addZIRNoOp(mod, scope, src, .unreachable_safe); | | |
| 3295 | } | | |
| 3296 | | | |
| 3297 | fn getSimplePrimitiveValue(name: []const u8) ?TypedValue { | 3328 | fn getSimplePrimitiveValue(name: []const u8) ?TypedValue { |
| 3298 | const simple_types = std.ComptimeStringMap(Value.Tag, .{ | 3329 | const simple_types = std.ComptimeStringMap(Value.Tag, .{ |
| 3299 | .{ "u8", .u8_type }, | 3330 | .{ "u8", .u8_type }, |
| ... | @@ -3430,17 +3461,25 @@ fn nodeMayNeedMemoryLocation(start_node: *ast.Node, scope: *Scope) bool { | ... | @@ -3430,17 +3461,25 @@ fn nodeMayNeedMemoryLocation(start_node: *ast.Node, scope: *Scope) bool { |
| 3430 | .deref, | 3461 | .deref, |
| 3431 | .array_access, | 3462 | .array_access, |
| 3432 | .block, | 3463 | .block, |
| | 3464 | .while_simple, // This variant cannot have an else expression. |
| | 3465 | .while_cont, // This variant cannot have an else expression. |
| | 3466 | .for_simple, // This variant cannot have an else expression. |
| | 3467 | .if_simple, // This variant cannot have an else expression. |
| 3433 | => return false, | 3468 | => return false, |
| 3434 | | 3469 | |
| 3435 | // Forward the question to a sub-expression. | 3470 | // Forward the question to the LHS sub-expression. |
| 3436 | .grouped_expression => node = node.castTag(.grouped_expression).?.expr, | 3471 | .grouped_expression, |
| 3437 | .@"try" => node = node.castTag(.@"try").?.rhs, | 3472 | .@"try", |
| 3438 | .@"await" => node = node.castTag(.@"await").?.rhs, | 3473 | .@"await", |
| 3439 | .@"catch" => node = node.castTag(.@"catch").?.rhs, | 3474 | .@"comptime", |
| 3440 | .@"orelse" => node = node.castTag(.@"orelse").?.rhs, | 3475 | .@"nosuspend", |
| 3441 | .@"comptime" => node = node.castTag(.@"comptime").?.expr, | 3476 | .unwrap_optional, |
| 3442 | .@"nosuspend" => node = node.castTag(.@"nosuspend").?.expr, | 3477 | => node = datas[node].lhs, |
| 3443 | .unwrap_optional => node = node.castTag(.unwrap_optional).?.lhs, | 3478 | |
| | 3479 | // Forward the question to the RHS sub-expression. |
| | 3480 | .@"catch", |
| | 3481 | .@"orelse", |
| | 3482 | => node = datas[node].rhs, |
| 3444 | | 3483 | |
| 3445 | // True because these are exactly the expressions we need memory locations for. | 3484 | // True because these are exactly the expressions we need memory locations for. |
| 3446 | .ArrayInitializer, | 3485 | .ArrayInitializer, |
| ... | @@ -3451,125 +3490,43 @@ fn nodeMayNeedMemoryLocation(start_node: *ast.Node, scope: *Scope) bool { | ... | @@ -3451,125 +3490,43 @@ fn nodeMayNeedMemoryLocation(start_node: *ast.Node, scope: *Scope) bool { |
| 3451 | | 3490 | |
| 3452 | // True because depending on comptime conditions, sub-expressions | 3491 | // True because depending on comptime conditions, sub-expressions |
| 3453 | // may be the kind that need memory locations. | 3492 | // may be the kind that need memory locations. |
| 3454 | .@"while", | 3493 | .@"while", // This variant always has an else expression. |
| 3455 | .@"for", | 3494 | .@"if", // This variant always has an else expression. |
| | 3495 | .@"for", // This variant always has an else expression. |
| 3456 | .@"switch", | 3496 | .@"switch", |
| | 3497 | .call_one, |
| | 3498 | .call_one_comma, |
| | 3499 | .async_call_one, |
| | 3500 | .async_call_one_comma, |
| 3457 | .call, | 3501 | .call, |
| 3458 | .labeled_block, | 3502 | .call_comma, |
| | 3503 | .async_call, |
| | 3504 | .async_call_comma, |
| 3459 | => return true, | 3505 | => return true, |
| 3460 | | 3506 | |
| 3461 | .builtin_call => { | 3507 | block_two, |
| 3462 | @setEvalBranchQuota(5000); | 3508 | block_two_semicolon, |
| 3463 | const builtin_needs_mem_loc = std.ComptimeStringMap(bool, .{ | 3509 | block, |
| 3464 | .{ "@addWithOverflow", false }, | 3510 | block_semicolon, |
| 3465 | .{ "@alignCast", false }, | 3511 | => { |
| 3466 | .{ "@alignOf", false }, | 3512 | const lbrace = main_tokens[node]; |
| 3467 | .{ "@as", true }, | 3513 | if (token_tags[lbrace - 1] == .colon) { |
| 3468 | .{ "@asyncCall", false }, | 3514 | // Labeled blocks may need a memory location to forward |
| 3469 | .{ "@atomicLoad", false }, | 3515 | // to their break statements. |
| 3470 | .{ "@atomicRmw", false }, | 3516 | return true; |
| 3471 | .{ "@atomicStore", false }, | 3517 | } else { |
| 3472 | .{ "@bitCast", true }, | 3518 | return false; |
| 3473 | .{ "@bitOffsetOf", false }, | 3519 | } |
| 3474 | .{ "@boolToInt", false }, | | |
| 3475 | .{ "@bitSizeOf", false }, | | |
| 3476 | .{ "@breakpoint", false }, | | |
| 3477 | .{ "@mulAdd", false }, | | |
| 3478 | .{ "@byteSwap", false }, | | |
| 3479 | .{ "@bitReverse", false }, | | |
| 3480 | .{ "@byteOffsetOf", false }, | | |
| 3481 | .{ "@call", true }, | | |
| 3482 | .{ "@cDefine", false }, | | |
| 3483 | .{ "@cImport", false }, | | |
| 3484 | .{ "@cInclude", false }, | | |
| 3485 | .{ "@clz", false }, | | |
| 3486 | .{ "@cmpxchgStrong", false }, | | |
| 3487 | .{ "@cmpxchgWeak", false }, | | |
| 3488 | .{ "@compileError", false }, | | |
| 3489 | .{ "@compileLog", false }, | | |
| 3490 | .{ "@ctz", false }, | | |
| 3491 | .{ "@cUndef", false }, | | |
| 3492 | .{ "@divExact", false }, | | |
| 3493 | .{ "@divFloor", false }, | | |
| 3494 | .{ "@divTrunc", false }, | | |
| 3495 | .{ "@embedFile", false }, | | |
| 3496 | .{ "@enumToInt", false }, | | |
| 3497 | .{ "@errorName", false }, | | |
| 3498 | .{ "@errorReturnTrace", false }, | | |
| 3499 | .{ "@errorToInt", false }, | | |
| 3500 | .{ "@errSetCast", false }, | | |
| 3501 | .{ "@export", false }, | | |
| 3502 | .{ "@fence", false }, | | |
| 3503 | .{ "@field", true }, | | |
| 3504 | .{ "@fieldParentPtr", false }, | | |
| 3505 | .{ "@floatCast", false }, | | |
| 3506 | .{ "@floatToInt", false }, | | |
| 3507 | .{ "@frame", false }, | | |
| 3508 | .{ "@Frame", false }, | | |
| 3509 | .{ "@frameAddress", false }, | | |
| 3510 | .{ "@frameSize", false }, | | |
| 3511 | .{ "@hasDecl", false }, | | |
| 3512 | .{ "@hasField", false }, | | |
| 3513 | .{ "@import", false }, | | |
| 3514 | .{ "@intCast", false }, | | |
| 3515 | .{ "@intToEnum", false }, | | |
| 3516 | .{ "@intToError", false }, | | |
| 3517 | .{ "@intToFloat", false }, | | |
| 3518 | .{ "@intToPtr", false }, | | |
| 3519 | .{ "@memcpy", false }, | | |
| 3520 | .{ "@memset", false }, | | |
| 3521 | .{ "@wasmMemorySize", false }, | | |
| 3522 | .{ "@wasmMemoryGrow", false }, | | |
| 3523 | .{ "@mod", false }, | | |
| 3524 | .{ "@mulWithOverflow", false }, | | |
| 3525 | .{ "@panic", false }, | | |
| 3526 | .{ "@popCount", false }, | | |
| 3527 | .{ "@ptrCast", false }, | | |
| 3528 | .{ "@ptrToInt", false }, | | |
| 3529 | .{ "@rem", false }, | | |
| 3530 | .{ "@returnAddress", false }, | | |
| 3531 | .{ "@setAlignStack", false }, | | |
| 3532 | .{ "@setCold", false }, | | |
| 3533 | .{ "@setEvalBranchQuota", false }, | | |
| 3534 | .{ "@setFloatMode", false }, | | |
| 3535 | .{ "@setRuntimeSafety", false }, | | |
| 3536 | .{ "@shlExact", false }, | | |
| 3537 | .{ "@shlWithOverflow", false }, | | |
| 3538 | .{ "@shrExact", false }, | | |
| 3539 | .{ "@shuffle", false }, | | |
| 3540 | .{ "@sizeOf", false }, | | |
| 3541 | .{ "@splat", true }, | | |
| 3542 | .{ "@reduce", false }, | | |
| 3543 | .{ "@src", true }, | | |
| 3544 | .{ "@sqrt", false }, | | |
| 3545 | .{ "@sin", false }, | | |
| 3546 | .{ "@cos", false }, | | |
| 3547 | .{ "@exp", false }, | | |
| 3548 | .{ "@exp2", false }, | | |
| 3549 | .{ "@log", false }, | | |
| 3550 | .{ "@log2", false }, | | |
| 3551 | .{ "@log10", false }, | | |
| 3552 | .{ "@fabs", false }, | | |
| 3553 | .{ "@floor", false }, | | |
| 3554 | .{ "@ceil", false }, | | |
| 3555 | .{ "@trunc", false }, | | |
| 3556 | .{ "@round", false }, | | |
| 3557 | .{ "@subWithOverflow", false }, | | |
| 3558 | .{ "@tagName", false }, | | |
| 3559 | .{ "@This", false }, | | |
| 3560 | .{ "@truncate", false }, | | |
| 3561 | .{ "@Type", false }, | | |
| 3562 | .{ "@typeInfo", false }, | | |
| 3563 | .{ "@typeName", false }, | | |
| 3564 | .{ "@TypeOf", false }, | | |
| 3565 | .{ "@unionInit", true }, | | |
| 3566 | }); | | |
| 3567 | const name = scope.tree().tokenSlice(node.castTag(.builtin_call).?.builtin_token); | | |
| 3568 | return builtin_needs_mem_loc.get(name).?; | | |
| 3569 | }, | 3520 | }, |
| 3570 | | 3521 | |
| 3571 | // Depending on AST properties, they may need memory locations. | 3522 | .builtin_call => { |
| 3572 | .@"if" => return node.castTag(.@"if").?.@"else" != null, | 3523 | const builtin_token = main_tokens[node]; |
| | 3524 | const builtin_name = tree.tokenSlice(builtin_token); |
| | 3525 | // If the builtin is an invalid name, we don't cause an error here; instead |
| | 3526 | // let it pass, and the error will be "invalid builtin function" later. |
| | 3527 | const builtin_info = BuiltinFn.list.get(builtin_name) orelse return false; |
| | 3528 | return builtin_info.needs_mem_loc; |
| | 3529 | }, |
| 3573 | } | 3530 | } |
| 3574 | } | 3531 | } |
| 3575 | } | 3532 | } |
Andrew Kelley <andrew@ziglang.org> 2021-02-15 22:35:50-07:00