| ... | @@ -800,34 +800,47 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { | ... | @@ -800,34 +800,47 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { |
| 800 | canonicalize: { | 800 | canonicalize: { |
| 801 | if (params.len != 1) break :canonicalize; | 801 | if (params.len != 1) break :canonicalize; |
| 802 | | 802 | |
| 803 | const CastKind = enum { | 803 | const CastKind = enum(u8) { |
| 804 | ptrCast, | 804 | ptrCast, |
| 805 | alignCast, | 805 | alignCast, |
| 806 | addrSpaceCast, | 806 | addrSpaceCast, |
| 807 | constCast, | 807 | constCast, |
| 808 | volatileCast, | 808 | volatileCast, |
| 809 | }; | 809 | }; |
| 810 | const kind = meta.stringToEnum(CastKind, tree.tokenSlice(builtin_token)[1..]) orelse break :canonicalize; | 810 | const kind = meta.stringToEnum( |
| | 811 | CastKind, |
| | 812 | tree.tokenSlice(builtin_token)[1..], |
| | 813 | ) orelse break :canonicalize; |
| 811 | | 814 | |
| 812 | var cast_map = std.EnumMap(CastKind, Ast.TokenIndex).init(.{}); | 815 | var cast_map = std.EnumMap(CastKind, Ast.TokenIndex).init(.{}); |
| 813 | cast_map.put(kind, builtin_token); | 816 | cast_map.put(kind, builtin_token); |
| 814 | | 817 | |
| 815 | var casts_before: usize = 0; | 818 | var casts_before: usize = 0; |
| 816 | if (builtin_token >= 2) { | 819 | var prev_builtin_token = builtin_token; |
| 817 | var prev_builtin_token = builtin_token - 2; | 820 | while (prev_builtin_token >= 2) { |
| 818 | while (tree.tokenTag(prev_builtin_token) == .builtin) : (prev_builtin_token -= 2) { | 821 | prev_builtin_token -= 2; |
| 819 | const prev_kind = meta.stringToEnum(CastKind, tree.tokenSlice(prev_builtin_token)[1..]) orelse break; | 822 | if (tree.tokenTag(prev_builtin_token) != .builtin) break; |
| 820 | if (cast_map.contains(prev_kind)) break :canonicalize; | 823 | const builtin_name = tree.tokenSlice(prev_builtin_token)[1..]; |
| 821 | cast_map.put(prev_kind, prev_builtin_token); | 824 | const prev_kind = meta.stringToEnum(CastKind, builtin_name) orelse break; |
| 822 | casts_before += 1; | 825 | if (cast_map.contains(prev_kind)) break :canonicalize; |
| 823 | } | 826 | // This must be checked after so that cast builtins as arguments to other |
| | 827 | // builtins containing comments are reordered. |
| | 828 | if (hasComment(tree, prev_builtin_token, prev_builtin_token + 2)) |
| | 829 | break :canonicalize; |
| | 830 | cast_map.put(prev_kind, prev_builtin_token); |
| | 831 | casts_before += 1; |
| 824 | } | 832 | } |
| 825 | | 833 | |
| 826 | var next_builtin_token = builtin_token + 2; | 834 | var next_builtin_token = builtin_token + 2; |
| 827 | while (tree.tokenTag(next_builtin_token) == .builtin) : (next_builtin_token += 2) { | 835 | while (true) { |
| 828 | const next_kind = meta.stringToEnum(CastKind, tree.tokenSlice(next_builtin_token)[1..]) orelse break; | 836 | if (hasComment(tree, next_builtin_token - 2, next_builtin_token)) |
| | 837 | break :canonicalize; |
| | 838 | if (tree.tokenTag(next_builtin_token) != .builtin) break; |
| | 839 | const builtin_name = tree.tokenSlice(next_builtin_token)[1..]; |
| | 840 | const next_kind = meta.stringToEnum(CastKind, builtin_name) orelse break; |
| 829 | if (cast_map.contains(next_kind)) break :canonicalize; | 841 | if (cast_map.contains(next_kind)) break :canonicalize; |
| 830 | cast_map.put(next_kind, next_builtin_token); | 842 | cast_map.put(next_kind, next_builtin_token); |
| | 843 | next_builtin_token += 2; |
| 831 | } | 844 | } |
| 832 | | 845 | |
| 833 | var it = cast_map.iterator(); | 846 | var it = cast_map.iterator(); |