| author |  Jakub Konka <kubkon@jakubkonka.com> 2021-07-22 09:34:44+02:00 |
| committer | Jakub Konka <kubkon@jakubkonka.com> 2021-07-22 09:34:44+02:00 |
| log | def135918740846d9b206c3188563cb77333f3a9 |
| tree | 2d054e8bca8b70ab2d38e384ff4eaac665b86422 |
| parent | d0edd37f690c3e6cf3f8a7fc7a27016ba9b010ce |
| parent | 8d0671157cdf8bc8b89d047138b42227420a5388 |
Merge remote-tracking branch 'origin/master' into zld-incremental-2
50 files changed, 7644 insertions(+), 6243 deletions(-)
CMakeLists.txt+2-2
| ... | ... | @@ -564,7 +564,7 @@ set(ZIG_STAGE2_SOURCES |
| 564 | 564 | "${CMAKE_SOURCE_DIR}/src/codegen/x86_64.zig" |
| 565 | 565 | "${CMAKE_SOURCE_DIR}/src/glibc.zig" |
| 566 | 566 | "${CMAKE_SOURCE_DIR}/src/introspect.zig" |
| 567 | "${CMAKE_SOURCE_DIR}/src/air.zig" | |
| 567 | "${CMAKE_SOURCE_DIR}/src/Air.zig" | |
| 568 | 568 | "${CMAKE_SOURCE_DIR}/src/libc_installation.zig" |
| 569 | 569 | "${CMAKE_SOURCE_DIR}/src/libcxx.zig" |
| 570 | 570 | "${CMAKE_SOURCE_DIR}/src/libtsan.zig" |
| ... | ... | @@ -593,7 +593,7 @@ set(ZIG_STAGE2_SOURCES |
| 593 | 593 | "${CMAKE_SOURCE_DIR}/src/link/tapi/yaml.zig" |
| 594 | 594 | "${CMAKE_SOURCE_DIR}/src/link/C/zig.h" |
| 595 | 595 | "${CMAKE_SOURCE_DIR}/src/link/msdos-stub.bin" |
| 596 | "${CMAKE_SOURCE_DIR}/src/liveness.zig" | |
| 596 | "${CMAKE_SOURCE_DIR}/src/Liveness.zig" | |
| 597 | 597 | "${CMAKE_SOURCE_DIR}/src/main.zig" |
| 598 | 598 | "${CMAKE_SOURCE_DIR}/src/mingw.zig" |
| 599 | 599 | "${CMAKE_SOURCE_DIR}/src/musl.zig" |
doc/langref.html.in+2-3
| ... | ... | @@ -5725,9 +5725,8 @@ test "turn HashMap into a set with void" { |
| 5725 | 5725 | value is deleted, as seen above. |
| 5726 | 5726 | </p> |
| 5727 | 5727 | <p> |
| 5728 | {#syntax#}void{#endsyntax#} is distinct from {#syntax#}c_void{#endsyntax#}, which is defined like this: | |
| 5729 | {#syntax#}pub const c_void = opaque {};{#endsyntax#}. | |
| 5730 | {#syntax#}void{#endsyntax#} has a known size of 0 bytes, and {#syntax#}c_void{#endsyntax#} has an unknown, but non-zero, size. | |
| 5728 | {#syntax#}void{#endsyntax#} is distinct from {#syntax#}c_void{#endsyntax#}. | |
| 5729 | {#syntax#}void{#endsyntax#} has a known size of 0 bytes, and {#syntax#}c_void{#endsyntax#} has an unknown, but non-zero, size. | |
| 5731 | 5730 | </p> |
| 5732 | 5731 | <p> |
| 5733 | 5732 | Expressions of type {#syntax#}void{#endsyntax#} are the only ones whose value can be ignored. For example: |
lib/std/Progress.zig+61-74
| ... | ... | @@ -63,6 +63,10 @@ done: bool = true, |
| 63 | 63 | /// while it was still being accessed by the `refresh` function. |
| 64 | 64 | update_lock: std.Thread.Mutex = .{}, |
| 65 | 65 | |
| 66 | /// Keeps track of how many columns in the terminal have been output, so that | |
| 67 | /// we can move the cursor back later. | |
| 68 | columns_written: usize = undefined, | |
| 69 | ||
| 66 | 70 | /// Represents one unit of progress. Each node can have children nodes, or |
| 67 | 71 | /// one can use integers with `update`. |
| 68 | 72 | pub const Node = struct { |
| ... | ... | @@ -160,6 +164,7 @@ pub fn start(self: *Progress, name: []const u8, estimated_total_items: usize) !* |
| 160 | 164 | .unprotected_estimated_total_items = estimated_total_items, |
| 161 | 165 | .unprotected_completed_items = 0, |
| 162 | 166 | }; |
| 167 | self.columns_written = 0; | |
| 163 | 168 | self.prev_refresh_timestamp = 0; |
| 164 | 169 | self.timer = try std.time.Timer.start(); |
| 165 | 170 | self.done = false; |
| ... | ... | @@ -187,15 +192,6 @@ pub fn refresh(self: *Progress) void { |
| 187 | 192 | return self.refreshWithHeldLock(); |
| 188 | 193 | } |
| 189 | 194 | |
| 190 | // ED -- Clear screen | |
| 191 | const ED = "\x1b[J"; | |
| 192 | // DECSC -- Save cursor position | |
| 193 | const DECSC = "\x1b7"; | |
| 194 | // DECRC -- Restore cursor position | |
| 195 | const DECRC = "\x1b8"; | |
| 196 | // Note that ESC7/ESC8 are used instead of CSI s/CSI u as the latter are not | |
| 197 | // supported by some terminals (eg. Terminal.app). | |
| 198 | ||
| 199 | 195 | fn refreshWithHeldLock(self: *Progress) void { |
| 200 | 196 | const is_dumb = !self.supports_ansi_escape_codes and !self.is_windows_terminal; |
| 201 | 197 | if (is_dumb and self.dont_print_on_dumb) return; |
| ... | ... | @@ -203,54 +199,59 @@ fn refreshWithHeldLock(self: *Progress) void { |
| 203 | 199 | const file = self.terminal orelse return; |
| 204 | 200 | |
| 205 | 201 | var end: usize = 0; |
| 206 | // Save the cursor position and clear the part of the screen below. | |
| 207 | // Clearing only the line is not enough as the terminal may wrap the line | |
| 208 | // when it becomes too long. | |
| 209 | var saved_cursor_pos: windows.COORD = undefined; | |
| 210 | if (self.supports_ansi_escape_codes) { | |
| 211 | const seq_before = DECSC ++ ED; | |
| 212 | std.mem.copy(u8, self.output_buffer[end..], seq_before); | |
| 213 | end += seq_before.len; | |
| 214 | } else if (std.builtin.os.tag == .windows) winapi: { | |
| 215 | std.debug.assert(self.is_windows_terminal); | |
| 216 | ||
| 217 | var info: windows.CONSOLE_SCREEN_BUFFER_INFO = undefined; | |
| 218 | if (windows.kernel32.GetConsoleScreenBufferInfo(file.handle, &info) != windows.TRUE) | |
| 219 | unreachable; | |
| 220 | ||
| 221 | saved_cursor_pos = info.dwCursorPosition; | |
| 222 | ||
| 223 | const window_height = @intCast(windows.DWORD, info.srWindow.Bottom - info.srWindow.Top + 1); | |
| 224 | const window_width = @intCast(windows.DWORD, info.srWindow.Right - info.srWindow.Left + 1); | |
| 225 | // Number of terminal cells to clear, starting from the cursor position | |
| 226 | // and ending at the window bottom right corner. | |
| 227 | const fill_chars = if (window_width == 0 or window_height == 0) 0 else chars: { | |
| 228 | break :chars window_width * (window_height - | |
| 229 | @intCast(windows.DWORD, info.dwCursorPosition.Y - info.srWindow.Top)) - | |
| 230 | @intCast(windows.DWORD, info.dwCursorPosition.X - info.srWindow.Left); | |
| 231 | }; | |
| 232 | ||
| 233 | var written: windows.DWORD = undefined; | |
| 234 | if (windows.kernel32.FillConsoleOutputAttribute( | |
| 235 | file.handle, | |
| 236 | info.wAttributes, | |
| 237 | fill_chars, | |
| 238 | saved_cursor_pos, | |
| 239 | &written, | |
| 240 | ) != windows.TRUE) { | |
| 241 | // Stop trying to write to this file. | |
| 242 | self.terminal = null; | |
| 243 | break :winapi; | |
| 244 | } | |
| 245 | if (windows.kernel32.FillConsoleOutputCharacterW( | |
| 246 | file.handle, | |
| 247 | ' ', | |
| 248 | fill_chars, | |
| 249 | saved_cursor_pos, | |
| 250 | &written, | |
| 251 | ) != windows.TRUE) { | |
| 252 | unreachable; | |
| 202 | if (self.columns_written > 0) { | |
| 203 | // restore the cursor position by moving the cursor | |
| 204 | // `columns_written` cells to the left, then clear the rest of the | |
| 205 | // line | |
| 206 | if (self.supports_ansi_escape_codes) { | |
| 207 | end += (std.fmt.bufPrint(self.output_buffer[end..], "\x1b[{d}D", .{self.columns_written}) catch unreachable).len; | |
| 208 | end += (std.fmt.bufPrint(self.output_buffer[end..], "\x1b[0K", .{}) catch unreachable).len; | |
| 209 | } else if (std.builtin.os.tag == .windows) winapi: { | |
| 210 | std.debug.assert(self.is_windows_terminal); | |
| 211 | ||
| 212 | var info: windows.CONSOLE_SCREEN_BUFFER_INFO = undefined; | |
| 213 | if (windows.kernel32.GetConsoleScreenBufferInfo(file.handle, &info) != windows.TRUE) | |
| 214 | unreachable; | |
| 215 | ||
| 216 | var cursor_pos = windows.COORD{ | |
| 217 | .X = info.dwCursorPosition.X - @intCast(windows.SHORT, self.columns_written), | |
| 218 | .Y = info.dwCursorPosition.Y, | |
| 219 | }; | |
| 220 | ||
| 221 | if (cursor_pos.X < 0) | |
| 222 | cursor_pos.X = 0; | |
| 223 | ||
| 224 | const fill_chars = @intCast(windows.DWORD, info.dwSize.X - cursor_pos.X); | |
| 225 | ||
| 226 | var written: windows.DWORD = undefined; | |
| 227 | if (windows.kernel32.FillConsoleOutputAttribute( | |
| 228 | file.handle, | |
| 229 | info.wAttributes, | |
| 230 | fill_chars, | |
| 231 | cursor_pos, | |
| 232 | &written, | |
| 233 | ) != windows.TRUE) { | |
| 234 | // Stop trying to write to this file. | |
| 235 | self.terminal = null; | |
| 236 | break :winapi; | |
| 237 | } | |
| 238 | if (windows.kernel32.FillConsoleOutputCharacterW( | |
| 239 | file.handle, | |
| 240 | ' ', | |
| 241 | fill_chars, | |
| 242 | cursor_pos, | |
| 243 | &written, | |
| 244 | ) != windows.TRUE) unreachable; | |
| 245 | ||
| 246 | if (windows.kernel32.SetConsoleCursorPosition(file.handle, cursor_pos) != windows.TRUE) | |
| 247 | unreachable; | |
| 248 | } else { | |
| 249 | // we are in a "dumb" terminal like in acme or writing to a file | |
| 250 | self.output_buffer[end] = '\n'; | |
| 251 | end += 1; | |
| 253 | 252 | } |
| 253 | ||
| 254 | self.columns_written = 0; | |
| 254 | 255 | } |
| 255 | 256 | |
| 256 | 257 | if (!self.done) { |
| ... | ... | @@ -285,28 +286,10 @@ fn refreshWithHeldLock(self: *Progress) void { |
| 285 | 286 | } |
| 286 | 287 | } |
| 287 | 288 | |
| 288 | // We're done printing the updated message, restore the cursor position. | |
| 289 | if (self.supports_ansi_escape_codes) { | |
| 290 | const seq_after = DECRC; | |
| 291 | std.mem.copy(u8, self.output_buffer[end..], seq_after); | |
| 292 | end += seq_after.len; | |
| 293 | } else if (!self.is_windows_terminal) { | |
| 294 | self.output_buffer[end] = '\n'; | |
| 295 | end += 1; | |
| 296 | } | |
| 297 | ||
| 298 | 289 | _ = file.write(self.output_buffer[0..end]) catch { |
| 299 | 290 | // Stop trying to write to this file once it errors. |
| 300 | 291 | self.terminal = null; |
| 301 | 292 | }; |
| 302 | ||
| 303 | if (std.builtin.os.tag == .windows) { | |
| 304 | if (self.is_windows_terminal) { | |
| 305 | const res = windows.kernel32.SetConsoleCursorPosition(file.handle, saved_cursor_pos); | |
| 306 | std.debug.assert(res == windows.TRUE); | |
| 307 | } | |
| 308 | } | |
| 309 | ||
| 310 | 293 | self.prev_refresh_timestamp = self.timer.read(); |
| 311 | 294 | } |
| 312 | 295 | |
| ... | ... | @@ -317,14 +300,17 @@ pub fn log(self: *Progress, comptime format: []const u8, args: anytype) void { |
| 317 | 300 | self.terminal = null; |
| 318 | 301 | return; |
| 319 | 302 | }; |
| 303 | self.columns_written = 0; | |
| 320 | 304 | } |
| 321 | 305 | |
| 322 | 306 | fn bufWrite(self: *Progress, end: *usize, comptime format: []const u8, args: anytype) void { |
| 323 | 307 | if (std.fmt.bufPrint(self.output_buffer[end.*..], format, args)) |written| { |
| 324 | 308 | const amt = written.len; |
| 325 | 309 | end.* += amt; |
| 310 | self.columns_written += amt; | |
| 326 | 311 | } else |err| switch (err) { |
| 327 | 312 | error.NoSpaceLeft => { |
| 313 | self.columns_written += self.output_buffer.len - end.*; | |
| 328 | 314 | end.* = self.output_buffer.len; |
| 329 | 315 | }, |
| 330 | 316 | } |
| ... | ... | @@ -332,6 +318,7 @@ fn bufWrite(self: *Progress, end: *usize, comptime format: []const u8, args: any |
| 332 | 318 | const max_end = self.output_buffer.len - bytes_needed_for_esc_codes_at_end; |
| 333 | 319 | if (end.* > max_end) { |
| 334 | 320 | const suffix = "... "; |
| 321 | self.columns_written = self.columns_written - (end.* - max_end) + suffix.len; | |
| 335 | 322 | std.mem.copy(u8, self.output_buffer[max_end..], suffix); |
| 336 | 323 | end.* = max_end + suffix.len; |
| 337 | 324 | } |
lib/std/Thread.zig+43-21
| ... | ... | @@ -505,8 +505,8 @@ const LinuxThreadImpl = struct { |
| 505 | 505 | /// Ported over from musl libc's pthread detached implementation: |
| 506 | 506 | /// https://github.com/ifduyue/musl/search?q=__unmapself |
| 507 | 507 | fn freeAndExit(self: *ThreadCompletion) noreturn { |
| 508 | const unmap_and_exit: []const u8 = switch (target.cpu.arch) { | |
| 509 | .i386 => ( | |
| 508 | switch (target.cpu.arch) { | |
| 509 | .i386 => asm volatile ( | |
| 510 | 510 | \\ movl $91, %%eax |
| 511 | 511 | \\ movl %[ptr], %%ebx |
| 512 | 512 | \\ movl %[len], %%ecx |
| ... | ... | @@ -514,8 +514,12 @@ const LinuxThreadImpl = struct { |
| 514 | 514 | \\ movl $1, %%eax |
| 515 | 515 | \\ movl $0, %%ebx |
| 516 | 516 | \\ int $128 |
| 517 | : | |
| 518 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 519 | [len] "r" (self.mapped.len) | |
| 520 | : "memory" | |
| 517 | 521 | ), |
| 518 | .x86_64 => ( | |
| 522 | .x86_64 => asm volatile ( | |
| 519 | 523 | \\ movq $11, %%rax |
| 520 | 524 | \\ movq %[ptr], %%rbx |
| 521 | 525 | \\ movq %[len], %%rcx |
| ... | ... | @@ -523,8 +527,12 @@ const LinuxThreadImpl = struct { |
| 523 | 527 | \\ movq $60, %%rax |
| 524 | 528 | \\ movq $1, %%rdi |
| 525 | 529 | \\ syscall |
| 530 | : | |
| 531 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 532 | [len] "r" (self.mapped.len) | |
| 533 | : "memory" | |
| 526 | 534 | ), |
| 527 | .arm, .armeb, .thumb, .thumbeb => ( | |
| 535 | .arm, .armeb, .thumb, .thumbeb => asm volatile ( | |
| 528 | 536 | \\ mov r7, #91 |
| 529 | 537 | \\ mov r0, %[ptr] |
| 530 | 538 | \\ mov r1, %[len] |
| ... | ... | @@ -532,8 +540,12 @@ const LinuxThreadImpl = struct { |
| 532 | 540 | \\ mov r7, #1 |
| 533 | 541 | \\ mov r0, #0 |
| 534 | 542 | \\ svc 0 |
| 543 | : | |
| 544 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 545 | [len] "r" (self.mapped.len) | |
| 546 | : "memory" | |
| 535 | 547 | ), |
| 536 | .aarch64, .aarch64_be, .aarch64_32 => ( | |
| 548 | .aarch64, .aarch64_be, .aarch64_32 => asm volatile ( | |
| 537 | 549 | \\ mov x8, #215 |
| 538 | 550 | \\ mov x0, %[ptr] |
| 539 | 551 | \\ mov x1, %[len] |
| ... | ... | @@ -541,8 +553,12 @@ const LinuxThreadImpl = struct { |
| 541 | 553 | \\ mov x8, #93 |
| 542 | 554 | \\ mov x0, #0 |
| 543 | 555 | \\ svc 0 |
| 556 | : | |
| 557 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 558 | [len] "r" (self.mapped.len) | |
| 559 | : "memory" | |
| 544 | 560 | ), |
| 545 | .mips, .mipsel => ( | |
| 561 | .mips, .mipsel => asm volatile ( | |
| 546 | 562 | \\ move $sp, $25 |
| 547 | 563 | \\ li $2, 4091 |
| 548 | 564 | \\ move $4, %[ptr] |
| ... | ... | @@ -551,8 +567,12 @@ const LinuxThreadImpl = struct { |
| 551 | 567 | \\ li $2, 4001 |
| 552 | 568 | \\ li $4, 0 |
| 553 | 569 | \\ syscall |
| 570 | : | |
| 571 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 572 | [len] "r" (self.mapped.len) | |
| 573 | : "memory" | |
| 554 | 574 | ), |
| 555 | .mips64, .mips64el => ( | |
| 575 | .mips64, .mips64el => asm volatile ( | |
| 556 | 576 | \\ li $2, 4091 |
| 557 | 577 | \\ move $4, %[ptr] |
| 558 | 578 | \\ move $5, %[len] |
| ... | ... | @@ -560,8 +580,12 @@ const LinuxThreadImpl = struct { |
| 560 | 580 | \\ li $2, 4001 |
| 561 | 581 | \\ li $4, 0 |
| 562 | 582 | \\ syscall |
| 583 | : | |
| 584 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 585 | [len] "r" (self.mapped.len) | |
| 586 | : "memory" | |
| 563 | 587 | ), |
| 564 | .powerpc, .powerpcle, .powerpc64, .powerpc64le => ( | |
| 588 | .powerpc, .powerpcle, .powerpc64, .powerpc64le => asm volatile ( | |
| 565 | 589 | \\ li 0, 91 |
| 566 | 590 | \\ mr %[ptr], 3 |
| 567 | 591 | \\ mr %[len], 4 |
| ... | ... | @@ -570,8 +594,12 @@ const LinuxThreadImpl = struct { |
| 570 | 594 | \\ li 3, 0 |
| 571 | 595 | \\ sc |
| 572 | 596 | \\ blr |
| 597 | : | |
| 598 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 599 | [len] "r" (self.mapped.len) | |
| 600 | : "memory" | |
| 573 | 601 | ), |
| 574 | .riscv64 => ( | |
| 602 | .riscv64 => asm volatile ( | |
| 575 | 603 | \\ li a7, 215 |
| 576 | 604 | \\ mv a0, %[ptr] |
| 577 | 605 | \\ mv a1, %[len] |
| ... | ... | @@ -579,19 +607,13 @@ const LinuxThreadImpl = struct { |
| 579 | 607 | \\ li a7, 93 |
| 580 | 608 | \\ mv a0, zero |
| 581 | 609 | \\ ecall |
| 610 | : | |
| 611 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 612 | [len] "r" (self.mapped.len) | |
| 613 | : "memory" | |
| 582 | 614 | ), |
| 583 | else => |cpu_arch| { | |
| 584 | @compileLog("Unsupported linux arch ", cpu_arch); | |
| 585 | }, | |
| 586 | }; | |
| 587 | ||
| 588 | asm volatile (unmap_and_exit | |
| 589 | : | |
| 590 | : [ptr] "r" (@ptrToInt(self.mapped.ptr)), | |
| 591 | [len] "r" (self.mapped.len) | |
| 592 | : "memory" | |
| 593 | ); | |
| 594 | ||
| 615 | else => |cpu_arch| @compileError("Unsupported linux arch: " ++ @tagName(cpu_arch)), | |
| 616 | } | |
| 595 | 617 | unreachable; |
| 596 | 618 | } |
| 597 | 619 | }; |
lib/std/array_list.zig+10-9
| ... | ... | @@ -227,10 +227,11 @@ pub fn ArrayListAligned(comptime T: type, comptime alignment: ?u29) type { |
| 227 | 227 | /// Append the slice of items to the list, asserting the capacity is already |
| 228 | 228 | /// enough to store the new items. **Does not** invalidate pointers. |
| 229 | 229 | pub fn appendSliceAssumeCapacity(self: *Self, items: []const T) void { |
| 230 | const oldlen = self.items.len; | |
| 231 | const newlen = self.items.len + items.len; | |
| 232 | self.items.len = newlen; | |
| 233 | mem.copy(T, self.items[oldlen..], items); | |
| 230 | const old_len = self.items.len; | |
| 231 | const new_len = old_len + items.len; | |
| 232 | assert(new_len <= self.capacity); | |
| 233 | self.items.len = new_len; | |
| 234 | mem.copy(T, self.items[old_len..], items); | |
| 234 | 235 | } |
| 235 | 236 | |
| 236 | 237 | pub usingnamespace if (T != u8) struct {} else struct { |
| ... | ... | @@ -570,11 +571,11 @@ pub fn ArrayListAlignedUnmanaged(comptime T: type, comptime alignment: ?u29) typ |
| 570 | 571 | /// Append the slice of items to the list, asserting the capacity is enough |
| 571 | 572 | /// to store the new items. |
| 572 | 573 | pub fn appendSliceAssumeCapacity(self: *Self, items: []const T) void { |
| 573 | const oldlen = self.items.len; | |
| 574 | const newlen = self.items.len + items.len; | |
| 575 | ||
| 576 | self.items.len = newlen; | |
| 577 | mem.copy(T, self.items[oldlen..], items); | |
| 574 | const old_len = self.items.len; | |
| 575 | const new_len = old_len + items.len; | |
| 576 | assert(new_len <= self.capacity); | |
| 577 | self.items.len = new_len; | |
| 578 | mem.copy(T, self.items[old_len..], items); | |
| 578 | 579 | } |
| 579 | 580 | |
| 580 | 581 | /// Append a value to the list `n` times. |
lib/std/atomic.zig+21-17
| ... | ... | @@ -46,34 +46,38 @@ test "fence/compilerFence" { |
| 46 | 46 | |
| 47 | 47 | /// Signals to the processor that the caller is inside a busy-wait spin-loop. |
| 48 | 48 | pub inline fn spinLoopHint() void { |
| 49 | const hint_instruction = switch (target.cpu.arch) { | |
| 50 | // No-op instruction that can hint to save (or share with a hardware-thread) pipelining/power resources | |
| 49 | switch (target.cpu.arch) { | |
| 50 | // No-op instruction that can hint to save (or share with a hardware-thread) | |
| 51 | // pipelining/power resources | |
| 51 | 52 | // https://software.intel.com/content/www/us/en/develop/articles/benefitting-power-and-performance-sleep-loops.html |
| 52 | .i386, .x86_64 => "pause", | |
| 53 | .i386, .x86_64 => asm volatile ("pause" ::: "memory"), | |
| 53 | 54 | |
| 54 | 55 | // No-op instruction that serves as a hardware-thread resource yield hint. |
| 55 | 56 | // https://stackoverflow.com/a/7588941 |
| 56 | .powerpc64, .powerpc64le => "or 27, 27, 27", | |
| 57 | .powerpc64, .powerpc64le => asm volatile ("or 27, 27, 27" ::: "memory"), | |
| 57 | 58 | |
| 58 | // `isb` appears more reliable for releasing execution resources than `yield` on common aarch64 CPUs. | |
| 59 | // `isb` appears more reliable for releasing execution resources than `yield` | |
| 60 | // on common aarch64 CPUs. | |
| 59 | 61 | // https://bugs.java.com/bugdatabase/view_bug.do?bug_id=8258604 |
| 60 | 62 | // https://bugs.mysql.com/bug.php?id=100664 |
| 61 | .aarch64, .aarch64_be, .aarch64_32 => "isb", | |
| 63 | .aarch64, .aarch64_be, .aarch64_32 => asm volatile ("isb" ::: "memory"), | |
| 62 | 64 | |
| 63 | 65 | // `yield` was introduced in v6k but is also available on v6m. |
| 64 | 66 | // https://www.keil.com/support/man/docs/armasm/armasm_dom1361289926796.htm |
| 65 | .arm, .armeb, .thumb, .thumbeb => blk: { | |
| 66 | const can_yield = comptime std.Target.arm.featureSetHasAny(target.cpu.features, .{ .has_v6k, .has_v6m }); | |
| 67 | const instruction = if (can_yield) "yield" else ""; | |
| 68 | break :blk instruction; | |
| 67 | .arm, .armeb, .thumb, .thumbeb => { | |
| 68 | const can_yield = comptime std.Target.arm.featureSetHasAny(target.cpu.features, .{ | |
| 69 | .has_v6k, .has_v6m, | |
| 70 | }); | |
| 71 | if (can_yield) { | |
| 72 | asm volatile ("yield" ::: "memory"); | |
| 73 | } else { | |
| 74 | asm volatile ("" ::: "memory"); | |
| 75 | } | |
| 69 | 76 | }, |
| 70 | ||
| 71 | else => "", | |
| 72 | }; | |
| 73 | ||
| 74 | // Memory barrier to prevent the compiler from optimizing away the spin-loop | |
| 75 | // even if no hint_instruction was provided. | |
| 76 | asm volatile (hint_instruction ::: "memory"); | |
| 77 | // Memory barrier to prevent the compiler from optimizing away the spin-loop | |
| 78 | // even if no hint_instruction was provided. | |
| 79 | else => asm volatile ("" ::: "memory"), | |
| 80 | } | |
| 77 | 81 | } |
| 78 | 82 | |
| 79 | 83 | test "spinLoopHint" { |
lib/std/atomic/Atomic.zig+70-18
| ... | ... | @@ -178,26 +178,78 @@ pub fn Atomic(comptime T: type) type { |
| 178 | 178 | ) u1 { |
| 179 | 179 | // x86 supports dedicated bitwise instructions |
| 180 | 180 | if (comptime target.cpu.arch.isX86() and @sizeOf(T) >= 2 and @sizeOf(T) <= 8) { |
| 181 | const instruction = switch (op) { | |
| 182 | .Set => "lock bts", | |
| 183 | .Reset => "lock btr", | |
| 184 | .Toggle => "lock btc", | |
| 185 | }; | |
| 186 | ||
| 187 | const suffix = switch (@sizeOf(T)) { | |
| 188 | 2 => "w", | |
| 189 | 4 => "l", | |
| 190 | 8 => "q", | |
| 181 | const old_bit: u8 = switch (@sizeOf(T)) { | |
| 182 | 2 => switch (op) { | |
| 183 | .Set => asm volatile ("lock btsw %[bit], %[ptr]" | |
| 184 | // LLVM doesn't support u1 flag register return values | |
| 185 | : [result] "={@ccc}" (-> u8) | |
| 186 | : [ptr] "*p" (&self.value), | |
| 187 | [bit] "X" (@as(T, bit)) | |
| 188 | : "cc", "memory" | |
| 189 | ), | |
| 190 | .Reset => asm volatile ("lock btrw %[bit], %[ptr]" | |
| 191 | // LLVM doesn't support u1 flag register return values | |
| 192 | : [result] "={@ccc}" (-> u8) | |
| 193 | : [ptr] "*p" (&self.value), | |
| 194 | [bit] "X" (@as(T, bit)) | |
| 195 | : "cc", "memory" | |
| 196 | ), | |
| 197 | .Toggle => asm volatile ("lock btcw %[bit], %[ptr]" | |
| 198 | // LLVM doesn't support u1 flag register return values | |
| 199 | : [result] "={@ccc}" (-> u8) | |
| 200 | : [ptr] "*p" (&self.value), | |
| 201 | [bit] "X" (@as(T, bit)) | |
| 202 | : "cc", "memory" | |
| 203 | ), | |
| 204 | }, | |
| 205 | 4 => switch (op) { | |
| 206 | .Set => asm volatile ("lock btsl %[bit], %[ptr]" | |
| 207 | // LLVM doesn't support u1 flag register return values | |
| 208 | : [result] "={@ccc}" (-> u8) | |
| 209 | : [ptr] "*p" (&self.value), | |
| 210 | [bit] "X" (@as(T, bit)) | |
| 211 | : "cc", "memory" | |
| 212 | ), | |
| 213 | .Reset => asm volatile ("lock btrl %[bit], %[ptr]" | |
| 214 | // LLVM doesn't support u1 flag register return values | |
| 215 | : [result] "={@ccc}" (-> u8) | |
| 216 | : [ptr] "*p" (&self.value), | |
| 217 | [bit] "X" (@as(T, bit)) | |
| 218 | : "cc", "memory" | |
| 219 | ), | |
| 220 | .Toggle => asm volatile ("lock btcl %[bit], %[ptr]" | |
| 221 | // LLVM doesn't support u1 flag register return values | |
| 222 | : [result] "={@ccc}" (-> u8) | |
| 223 | : [ptr] "*p" (&self.value), | |
| 224 | [bit] "X" (@as(T, bit)) | |
| 225 | : "cc", "memory" | |
| 226 | ), | |
| 227 | }, | |
| 228 | 8 => switch (op) { | |
| 229 | .Set => asm volatile ("lock btsq %[bit], %[ptr]" | |
| 230 | // LLVM doesn't support u1 flag register return values | |
| 231 | : [result] "={@ccc}" (-> u8) | |
| 232 | : [ptr] "*p" (&self.value), | |
| 233 | [bit] "X" (@as(T, bit)) | |
| 234 | : "cc", "memory" | |
| 235 | ), | |
| 236 | .Reset => asm volatile ("lock btrq %[bit], %[ptr]" | |
| 237 | // LLVM doesn't support u1 flag register return values | |
| 238 | : [result] "={@ccc}" (-> u8) | |
| 239 | : [ptr] "*p" (&self.value), | |
| 240 | [bit] "X" (@as(T, bit)) | |
| 241 | : "cc", "memory" | |
| 242 | ), | |
| 243 | .Toggle => asm volatile ("lock btcq %[bit], %[ptr]" | |
| 244 | // LLVM doesn't support u1 flag register return values | |
| 245 | : [result] "={@ccc}" (-> u8) | |
| 246 | : [ptr] "*p" (&self.value), | |
| 247 | [bit] "X" (@as(T, bit)) | |
| 248 | : "cc", "memory" | |
| 249 | ), | |
| 250 | }, | |
| 191 | 251 | else => @compileError("Invalid atomic type " ++ @typeName(T)), |
| 192 | 252 | }; |
| 193 | ||
| 194 | const old_bit = asm volatile (instruction ++ suffix ++ " %[bit], %[ptr]" | |
| 195 | : [result] "={@ccc}" (-> u8) // LLVM doesn't support u1 flag register return values | |
| 196 | : [ptr] "*p" (&self.value), | |
| 197 | [bit] "X" (@as(T, bit)) | |
| 198 | : "cc", "memory" | |
| 199 | ); | |
| 200 | ||
| 201 | 253 | return @intCast(u1, old_bit); |
| 202 | 254 | } |
| 203 | 255 |
lib/std/hash/auto_hash.zig+1-4
| ... | ... | @@ -122,12 +122,9 @@ pub fn hash(hasher: anytype, key: anytype, comptime strat: HashStrategy) void { |
| 122 | 122 | .Array => hashArray(hasher, key, strat), |
| 123 | 123 | |
| 124 | 124 | .Vector => |info| { |
| 125 | if (std.meta.bitCount(info.child) % 8 == 0) { | |
| 126 | // If there's no unused bits in the child type, we can just hash | |
| 127 | // this as an array of bytes. | |
| 125 | if (comptime meta.trait.hasUniqueRepresentation(Key)) { | |
| 128 | 126 | hasher.update(mem.asBytes(&key)); |
| 129 | 127 | } else { |
| 130 | // Otherwise, hash every element. | |
| 131 | 128 | comptime var i = 0; |
| 132 | 129 | inline while (i < info.len) : (i += 1) { |
| 133 | 130 | hash(hasher, key[i], strat); |
lib/std/json.zig+4-4
| ... | ... | @@ -2590,7 +2590,7 @@ test "write json then parse it" { |
| 2590 | 2590 | try testing.expect(mem.eql(u8, tree.root.Object.get("str").?.String, "hello")); |
| 2591 | 2591 | } |
| 2592 | 2592 | |
| 2593 | fn test_parse(arena_allocator: *std.mem.Allocator, json_str: []const u8) !Value { | |
| 2593 | fn testParse(arena_allocator: *std.mem.Allocator, json_str: []const u8) !Value { | |
| 2594 | 2594 | var p = Parser.init(arena_allocator, false); |
| 2595 | 2595 | return (try p.parse(json_str)).root; |
| 2596 | 2596 | } |
| ... | ... | @@ -2598,13 +2598,13 @@ fn test_parse(arena_allocator: *std.mem.Allocator, json_str: []const u8) !Value |
| 2598 | 2598 | test "parsing empty string gives appropriate error" { |
| 2599 | 2599 | var arena_allocator = std.heap.ArenaAllocator.init(std.testing.allocator); |
| 2600 | 2600 | defer arena_allocator.deinit(); |
| 2601 | try testing.expectError(error.UnexpectedEndOfJson, test_parse(&arena_allocator.allocator, "")); | |
| 2601 | try testing.expectError(error.UnexpectedEndOfJson, testParse(&arena_allocator.allocator, "")); | |
| 2602 | 2602 | } |
| 2603 | 2603 | |
| 2604 | 2604 | test "integer after float has proper type" { |
| 2605 | 2605 | var arena_allocator = std.heap.ArenaAllocator.init(std.testing.allocator); |
| 2606 | 2606 | defer arena_allocator.deinit(); |
| 2607 | const json = try test_parse(&arena_allocator.allocator, | |
| 2607 | const json = try testParse(&arena_allocator.allocator, | |
| 2608 | 2608 | \\{ |
| 2609 | 2609 | \\ "float": 3.14, |
| 2610 | 2610 | \\ "ints": [1, 2, 3] |
| ... | ... | @@ -2639,7 +2639,7 @@ test "escaped characters" { |
| 2639 | 2639 | \\} |
| 2640 | 2640 | ; |
| 2641 | 2641 | |
| 2642 | const obj = (try test_parse(&arena_allocator.allocator, input)).Object; | |
| 2642 | const obj = (try testParse(&arena_allocator.allocator, input)).Object; | |
| 2643 | 2643 | |
| 2644 | 2644 | try testing.expectEqualSlices(u8, obj.get("backslash").?.String, "\\"); |
| 2645 | 2645 | try testing.expectEqualSlices(u8, obj.get("forwardslash").?.String, "/"); |
lib/std/math/hypot.zig+1-1
| ... | ... | @@ -14,7 +14,7 @@ const math = std.math; |
| 14 | 14 | const expect = std.testing.expect; |
| 15 | 15 | const maxInt = std.math.maxInt; |
| 16 | 16 | |
| 17 | /// Returns sqrt(x * x + y * y), avoiding unncessary overflow and underflow. | |
| 17 | /// Returns sqrt(x * x + y * y), avoiding unnecessary overflow and underflow. | |
| 18 | 18 | /// |
| 19 | 19 | /// Special Cases: |
| 20 | 20 | /// - hypot(+-inf, y) = +inf |
lib/std/meta/trait.zig+4-1
| ... | ... | @@ -582,7 +582,7 @@ pub fn hasUniqueRepresentation(comptime T: type) bool { |
| 582 | 582 | return @sizeOf(T) == sum_size; |
| 583 | 583 | }, |
| 584 | 584 | |
| 585 | .Vector => |info| return comptime hasUniqueRepresentation(info.child), | |
| 585 | .Vector => |info| return comptime hasUniqueRepresentation(info.child) and @sizeOf(T) == @sizeOf(info.child) * info.len, | |
| 586 | 586 | } |
| 587 | 587 | } |
| 588 | 588 | |
| ... | ... | @@ -653,4 +653,7 @@ test "std.meta.trait.hasUniqueRepresentation" { |
| 653 | 653 | |
| 654 | 654 | try testing.expect(!hasUniqueRepresentation([]u8)); |
| 655 | 655 | try testing.expect(!hasUniqueRepresentation([]const u8)); |
| 656 | ||
| 657 | try testing.expect(hasUniqueRepresentation(@Vector(4, u16))); | |
| 658 | try testing.expect(!hasUniqueRepresentation(@Vector(3, u16))); | |
| 656 | 659 | } |
lib/std/os.zig-1
| ... | ... | @@ -385,7 +385,6 @@ pub fn read(fd: fd_t, buf: []u8) ReadError!usize { |
| 385 | 385 | else => |err| return unexpectedErrno(err), |
| 386 | 386 | } |
| 387 | 387 | } |
| 388 | return index; | |
| 389 | 388 | } |
| 390 | 389 | |
| 391 | 390 | /// Number of bytes read is returned. Upon reading end-of-file, zero is returned. |
lib/std/unicode.zig+43-2
| ... | ... | @@ -317,9 +317,9 @@ pub const Utf16LeIterator = struct { |
| 317 | 317 | assert(it.i <= it.bytes.len); |
| 318 | 318 | if (it.i == it.bytes.len) return null; |
| 319 | 319 | const c0: u21 = mem.readIntLittle(u16, it.bytes[it.i..][0..2]); |
| 320 | it.i += 2; | |
| 320 | 321 | if (c0 & ~@as(u21, 0x03ff) == 0xd800) { |
| 321 | 322 | // surrogate pair |
| 322 | it.i += 2; | |
| 323 | 323 | if (it.i >= it.bytes.len) return error.DanglingSurrogateHalf; |
| 324 | 324 | const c1: u21 = mem.readIntLittle(u16, it.bytes[it.i..][0..2]); |
| 325 | 325 | if (c1 & ~@as(u21, 0x03ff) != 0xdc00) return error.ExpectedSecondSurrogateHalf; |
| ... | ... | @@ -328,7 +328,6 @@ pub const Utf16LeIterator = struct { |
| 328 | 328 | } else if (c0 & ~@as(u21, 0x03ff) == 0xdc00) { |
| 329 | 329 | return error.UnexpectedSecondSurrogateHalf; |
| 330 | 330 | } else { |
| 331 | it.i += 2; | |
| 332 | 331 | return c0; |
| 333 | 332 | } |
| 334 | 333 | } |
| ... | ... | @@ -769,6 +768,48 @@ fn calcUtf16LeLen(utf8: []const u8) usize { |
| 769 | 768 | return dest_len; |
| 770 | 769 | } |
| 771 | 770 | |
| 771 | /// Print the given `utf16le` string | |
| 772 | fn formatUtf16le( | |
| 773 | utf16le: []const u16, | |
| 774 | comptime fmt: []const u8, | |
| 775 | options: std.fmt.FormatOptions, | |
| 776 | writer: anytype, | |
| 777 | ) !void { | |
| 778 | const unknown_codepoint = 0xfffd; | |
| 779 | _ = fmt; | |
| 780 | _ = options; | |
| 781 | var buf: [300]u8 = undefined; // just a random size I chose | |
| 782 | var it = Utf16LeIterator.init(utf16le); | |
| 783 | var u8len: usize = 0; | |
| 784 | while (it.nextCodepoint() catch unknown_codepoint) |codepoint| { | |
| 785 | u8len += utf8Encode(codepoint, buf[u8len..]) catch | |
| 786 | utf8Encode(unknown_codepoint, buf[u8len..]) catch unreachable; | |
| 787 | if (u8len + 3 >= buf.len) { | |
| 788 | try writer.writeAll(buf[0..u8len]); | |
| 789 | u8len = 0; | |
| 790 | } | |
| 791 | } | |
| 792 | try writer.writeAll(buf[0..u8len]); | |
| 793 | } | |
| 794 | ||
| 795 | /// Return a Formatter for a Utf16le string | |
| 796 | pub fn fmtUtf16le(utf16le: []const u16) std.fmt.Formatter(formatUtf16le) { | |
| 797 | return .{ .data = utf16le }; | |
| 798 | } | |
| 799 | ||
| 800 | test "fmtUtf16le" { | |
| 801 | const expectFmt = std.testing.expectFmt; | |
| 802 | try expectFmt("", "{}", .{fmtUtf16le(utf8ToUtf16LeStringLiteral(""))}); | |
| 803 | try expectFmt("foo", "{}", .{fmtUtf16le(utf8ToUtf16LeStringLiteral("foo"))}); | |
| 804 | try expectFmt("𐐷", "{}", .{fmtUtf16le(utf8ToUtf16LeStringLiteral("𐐷"))}); | |
| 805 | try expectFmt("", "{}", .{fmtUtf16le(&[_]u16{std.mem.readIntNative(u16, "\xff\xd7")})}); | |
| 806 | try expectFmt("�", "{}", .{fmtUtf16le(&[_]u16{std.mem.readIntNative(u16, "\x00\xd8")})}); | |
| 807 | try expectFmt("�", "{}", .{fmtUtf16le(&[_]u16{std.mem.readIntNative(u16, "\xff\xdb")})}); | |
| 808 | try expectFmt("�", "{}", .{fmtUtf16le(&[_]u16{std.mem.readIntNative(u16, "\x00\xdc")})}); | |
| 809 | try expectFmt("�", "{}", .{fmtUtf16le(&[_]u16{std.mem.readIntNative(u16, "\xff\xdf")})}); | |
| 810 | try expectFmt("", "{}", .{fmtUtf16le(&[_]u16{std.mem.readIntNative(u16, "\x00\xe0")})}); | |
| 811 | } | |
| 812 | ||
| 772 | 813 | test "utf8ToUtf16LeStringLiteral" { |
| 773 | 814 | { |
| 774 | 815 | const bytes = [_:0]u16{ |
lib/std/zig/fmt.zig+1
| ... | ... | @@ -23,6 +23,7 @@ pub fn fmtId(bytes: []const u8) std.fmt.Formatter(formatId) { |
| 23 | 23 | } |
| 24 | 24 | |
| 25 | 25 | pub fn isValidId(bytes: []const u8) bool { |
| 26 | if (mem.eql(u8, bytes, "_")) return false; | |
| 26 | 27 | for (bytes) |c, i| { |
| 27 | 28 | switch (c) { |
| 28 | 29 | '_', 'a'...'z', 'A'...'Z' => {}, |
src/Air.zig created+546
| ... | ... | @@ -0,0 +1,546 @@ |
| 1 | //! Analyzed Intermediate Representation. | |
| 2 | //! This data is produced by Sema and consumed by codegen. | |
| 3 | //! Unlike ZIR where there is one instance for an entire source file, each function | |
| 4 | //! gets its own `Air` instance. | |
| 5 | ||
| 6 | const std = @import("std"); | |
| 7 | const Value = @import("value.zig").Value; | |
| 8 | const Type = @import("type.zig").Type; | |
| 9 | const Module = @import("Module.zig"); | |
| 10 | const assert = std.debug.assert; | |
| 11 | const Air = @This(); | |
| 12 | ||
| 13 | instructions: std.MultiArrayList(Inst).Slice, | |
| 14 | /// The meaning of this data is determined by `Inst.Tag` value. | |
| 15 | /// The first few indexes are reserved. See `ExtraIndex` for the values. | |
| 16 | extra: []const u32, | |
| 17 | values: []const Value, | |
| 18 | variables: []const *Module.Var, | |
| 19 | ||
| 20 | pub const ExtraIndex = enum(u32) { | |
| 21 | /// Payload index of the main `Block` in the `extra` array. | |
| 22 | main_block, | |
| 23 | ||
| 24 | _, | |
| 25 | }; | |
| 26 | ||
| 27 | pub const Inst = struct { | |
| 28 | tag: Tag, | |
| 29 | data: Data, | |
| 30 | ||
| 31 | pub const Tag = enum(u8) { | |
| 32 | /// The first N instructions in the main block must be one arg instruction per | |
| 33 | /// function parameter. This makes function parameters participate in | |
| 34 | /// liveness analysis without any special handling. | |
| 35 | /// Uses the `ty_str` field. | |
| 36 | /// The string is the parameter name. | |
| 37 | arg, | |
| 38 | /// Float or integer addition. For integers, wrapping is undefined behavior. | |
| 39 | /// Both operands are guaranteed to be the same type, and the result type | |
| 40 | /// is the same as both operands. | |
| 41 | /// Uses the `bin_op` field. | |
| 42 | add, | |
| 43 | /// Integer addition. Wrapping is defined to be twos complement wrapping. | |
| 44 | /// Both operands are guaranteed to be the same type, and the result type | |
| 45 | /// is the same as both operands. | |
| 46 | /// Uses the `bin_op` field. | |
| 47 | addwrap, | |
| 48 | /// Float or integer subtraction. For integers, wrapping is undefined behavior. | |
| 49 | /// Both operands are guaranteed to be the same type, and the result type | |
| 50 | /// is the same as both operands. | |
| 51 | /// Uses the `bin_op` field. | |
| 52 | sub, | |
| 53 | /// Integer subtraction. Wrapping is defined to be twos complement wrapping. | |
| 54 | /// Both operands are guaranteed to be the same type, and the result type | |
| 55 | /// is the same as both operands. | |
| 56 | /// Uses the `bin_op` field. | |
| 57 | subwrap, | |
| 58 | /// Float or integer multiplication. For integers, wrapping is undefined behavior. | |
| 59 | /// Both operands are guaranteed to be the same type, and the result type | |
| 60 | /// is the same as both operands. | |
| 61 | /// Uses the `bin_op` field. | |
| 62 | mul, | |
| 63 | /// Integer multiplication. Wrapping is defined to be twos complement wrapping. | |
| 64 | /// Both operands are guaranteed to be the same type, and the result type | |
| 65 | /// is the same as both operands. | |
| 66 | /// Uses the `bin_op` field. | |
| 67 | mulwrap, | |
| 68 | /// Integer or float division. For integers, wrapping is undefined behavior. | |
| 69 | /// Both operands are guaranteed to be the same type, and the result type | |
| 70 | /// is the same as both operands. | |
| 71 | /// Uses the `bin_op` field. | |
| 72 | div, | |
| 73 | /// Allocates stack local memory. | |
| 74 | /// Uses the `ty` field. | |
| 75 | alloc, | |
| 76 | /// Inline assembly. Uses the `ty_pl` field. Payload is `Asm`. | |
| 77 | assembly, | |
| 78 | /// Bitwise AND. `&`. | |
| 79 | /// Result type is the same as both operands. | |
| 80 | /// Uses the `bin_op` field. | |
| 81 | bit_and, | |
| 82 | /// Bitwise OR. `|`. | |
| 83 | /// Result type is the same as both operands. | |
| 84 | /// Uses the `bin_op` field. | |
| 85 | bit_or, | |
| 86 | /// Bitwise XOR. `^` | |
| 87 | /// Uses the `bin_op` field. | |
| 88 | xor, | |
| 89 | /// Boolean or binary NOT. | |
| 90 | /// Uses the `ty_op` field. | |
| 91 | not, | |
| 92 | /// Reinterpret the memory representation of a value as a different type. | |
| 93 | /// Uses the `ty_op` field. | |
| 94 | bitcast, | |
| 95 | /// Uses the `ty_pl` field with payload `Block`. | |
| 96 | block, | |
| 97 | /// A labeled block of code that loops forever. At the end of the body it is implied | |
| 98 | /// to repeat; no explicit "repeat" instruction terminates loop bodies. | |
| 99 | /// Result type is always noreturn; no instructions in a block follow this one. | |
| 100 | /// Uses the `ty_pl` field. Payload is `Block`. | |
| 101 | loop, | |
| 102 | /// Return from a block with a result. | |
| 103 | /// Result type is always noreturn; no instructions in a block follow this one. | |
| 104 | /// Uses the `br` field. | |
| 105 | br, | |
| 106 | /// Lowers to a hardware trap instruction, or the next best thing. | |
| 107 | /// Result type is always void. | |
| 108 | breakpoint, | |
| 109 | /// Function call. | |
| 110 | /// Result type is the return type of the function being called. | |
| 111 | /// Uses the `pl_op` field with the `Call` payload. operand is the callee. | |
| 112 | call, | |
| 113 | /// `<`. Result type is always bool. | |
| 114 | /// Uses the `bin_op` field. | |
| 115 | cmp_lt, | |
| 116 | /// `<=`. Result type is always bool. | |
| 117 | /// Uses the `bin_op` field. | |
| 118 | cmp_lte, | |
| 119 | /// `==`. Result type is always bool. | |
| 120 | /// Uses the `bin_op` field. | |
| 121 | cmp_eq, | |
| 122 | /// `>=`. Result type is always bool. | |
| 123 | /// Uses the `bin_op` field. | |
| 124 | cmp_gte, | |
| 125 | /// `>`. Result type is always bool. | |
| 126 | /// Uses the `bin_op` field. | |
| 127 | cmp_gt, | |
| 128 | /// `!=`. Result type is always bool. | |
| 129 | /// Uses the `bin_op` field. | |
| 130 | cmp_neq, | |
| 131 | /// Conditional branch. | |
| 132 | /// Result type is always noreturn; no instructions in a block follow this one. | |
| 133 | /// Uses the `pl_op` field. Operand is the condition. Payload is `CondBr`. | |
| 134 | cond_br, | |
| 135 | /// Switch branch. | |
| 136 | /// Result type is always noreturn; no instructions in a block follow this one. | |
| 137 | /// Uses the `pl_op` field. Operand is the condition. Payload is `SwitchBr`. | |
| 138 | switch_br, | |
| 139 | /// A comptime-known value. Uses the `ty_pl` field, payload is index of | |
| 140 | /// `values` array. | |
| 141 | constant, | |
| 142 | /// A comptime-known type. Uses the `ty` field. | |
| 143 | const_ty, | |
| 144 | /// Notes the beginning of a source code statement and marks the line and column. | |
| 145 | /// Result type is always void. | |
| 146 | /// Uses the `dbg_stmt` field. | |
| 147 | dbg_stmt, | |
| 148 | /// ?T => bool | |
| 149 | /// Result type is always bool. | |
| 150 | /// Uses the `un_op` field. | |
| 151 | is_null, | |
| 152 | /// ?T => bool (inverted logic) | |
| 153 | /// Result type is always bool. | |
| 154 | /// Uses the `un_op` field. | |
| 155 | is_non_null, | |
| 156 | /// *?T => bool | |
| 157 | /// Result type is always bool. | |
| 158 | /// Uses the `un_op` field. | |
| 159 | is_null_ptr, | |
| 160 | /// *?T => bool (inverted logic) | |
| 161 | /// Result type is always bool. | |
| 162 | /// Uses the `un_op` field. | |
| 163 | is_non_null_ptr, | |
| 164 | /// E!T => bool | |
| 165 | /// Result type is always bool. | |
| 166 | /// Uses the `un_op` field. | |
| 167 | is_err, | |
| 168 | /// E!T => bool (inverted logic) | |
| 169 | /// Result type is always bool. | |
| 170 | /// Uses the `un_op` field. | |
| 171 | is_non_err, | |
| 172 | /// *E!T => bool | |
| 173 | /// Result type is always bool. | |
| 174 | /// Uses the `un_op` field. | |
| 175 | is_err_ptr, | |
| 176 | /// *E!T => bool (inverted logic) | |
| 177 | /// Result type is always bool. | |
| 178 | /// Uses the `un_op` field. | |
| 179 | is_non_err_ptr, | |
| 180 | /// Result type is always bool. | |
| 181 | /// Uses the `bin_op` field. | |
| 182 | bool_and, | |
| 183 | /// Result type is always bool. | |
| 184 | /// Uses the `bin_op` field. | |
| 185 | bool_or, | |
| 186 | /// Read a value from a pointer. | |
| 187 | /// Uses the `ty_op` field. | |
| 188 | load, | |
| 189 | /// Converts a pointer to its address. Result type is always `usize`. | |
| 190 | /// Uses the `un_op` field. | |
| 191 | ptrtoint, | |
| 192 | /// Stores a value onto the stack and returns a pointer to it. | |
| 193 | /// TODO audit where this AIR instruction is emitted, maybe it should instead be emitting | |
| 194 | /// alloca instruction and storing to the alloca. | |
| 195 | /// Uses the `ty_op` field. | |
| 196 | ref, | |
| 197 | /// Return a value from a function. | |
| 198 | /// Result type is always noreturn; no instructions in a block follow this one. | |
| 199 | /// Uses the `un_op` field. | |
| 200 | ret, | |
| 201 | /// Returns a pointer to a global variable. | |
| 202 | /// Uses the `ty_pl` field. Index is into the `variables` array. | |
| 203 | /// TODO this can be modeled simply as a constant with a decl ref and then | |
| 204 | /// the variables array can be removed from Air. | |
| 205 | varptr, | |
| 206 | /// Write a value to a pointer. LHS is pointer, RHS is value. | |
| 207 | /// Result type is always void. | |
| 208 | /// Uses the `bin_op` field. | |
| 209 | store, | |
| 210 | /// Indicates the program counter will never get to this instruction. | |
| 211 | /// Result type is always noreturn; no instructions in a block follow this one. | |
| 212 | unreach, | |
| 213 | /// Convert from one float type to another. | |
| 214 | /// Uses the `ty_op` field. | |
| 215 | floatcast, | |
| 216 | /// TODO audit uses of this. We should have explicit instructions for integer | |
| 217 | /// widening and truncating. | |
| 218 | /// Uses the `ty_op` field. | |
| 219 | intcast, | |
| 220 | /// ?T => T. If the value is null, undefined behavior. | |
| 221 | /// Uses the `ty_op` field. | |
| 222 | optional_payload, | |
| 223 | /// *?T => *T. If the value is null, undefined behavior. | |
| 224 | /// Uses the `ty_op` field. | |
| 225 | optional_payload_ptr, | |
| 226 | /// Given a payload value, wraps it in an optional type. | |
| 227 | /// Uses the `ty_op` field. | |
| 228 | wrap_optional, | |
| 229 | /// E!T -> T. If the value is an error, undefined behavior. | |
| 230 | /// Uses the `ty_op` field. | |
| 231 | unwrap_errunion_payload, | |
| 232 | /// E!T -> E. If the value is not an error, undefined behavior. | |
| 233 | /// Uses the `ty_op` field. | |
| 234 | unwrap_errunion_err, | |
| 235 | /// *(E!T) -> *T. If the value is an error, undefined behavior. | |
| 236 | /// Uses the `ty_op` field. | |
| 237 | unwrap_errunion_payload_ptr, | |
| 238 | /// *(E!T) -> E. If the value is not an error, undefined behavior. | |
| 239 | /// Uses the `ty_op` field. | |
| 240 | unwrap_errunion_err_ptr, | |
| 241 | /// wrap from T to E!T | |
| 242 | /// Uses the `ty_op` field. | |
| 243 | wrap_errunion_payload, | |
| 244 | /// wrap from E to E!T | |
| 245 | /// Uses the `ty_op` field. | |
| 246 | wrap_errunion_err, | |
| 247 | /// Given a pointer to a struct and a field index, returns a pointer to the field. | |
| 248 | /// Uses the `ty_pl` field, payload is `StructField`. | |
| 249 | struct_field_ptr, | |
| 250 | ||
| 251 | pub fn fromCmpOp(op: std.math.CompareOperator) Tag { | |
| 252 | return switch (op) { | |
| 253 | .lt => .cmp_lt, | |
| 254 | .lte => .cmp_lte, | |
| 255 | .eq => .cmp_eq, | |
| 256 | .gte => .cmp_gte, | |
| 257 | .gt => .cmp_gt, | |
| 258 | .neq => .cmp_neq, | |
| 259 | }; | |
| 260 | } | |
| 261 | ||
| 262 | pub fn toCmpOp(tag: Tag) ?std.math.CompareOperator { | |
| 263 | return switch (tag) { | |
| 264 | .cmp_lt => .lt, | |
| 265 | .cmp_lte => .lte, | |
| 266 | .cmp_eq => .eq, | |
| 267 | .cmp_gte => .gte, | |
| 268 | .cmp_gt => .gt, | |
| 269 | .cmp_neq => .neq, | |
| 270 | else => null, | |
| 271 | }; | |
| 272 | } | |
| 273 | }; | |
| 274 | ||
| 275 | /// The position of an AIR instruction within the `Air` instructions array. | |
| 276 | pub const Index = u32; | |
| 277 | ||
| 278 | pub const Ref = @import("Zir.zig").Inst.Ref; | |
| 279 | ||
| 280 | /// All instructions have an 8-byte payload, which is contained within | |
| 281 | /// this union. `Tag` determines which union field is active, as well as | |
| 282 | /// how to interpret the data within. | |
| 283 | pub const Data = union { | |
| 284 | no_op: void, | |
| 285 | un_op: Ref, | |
| 286 | bin_op: struct { | |
| 287 | lhs: Ref, | |
| 288 | rhs: Ref, | |
| 289 | }, | |
| 290 | ty: Type, | |
| 291 | ty_op: struct { | |
| 292 | ty: Ref, | |
| 293 | operand: Ref, | |
| 294 | }, | |
| 295 | ty_pl: struct { | |
| 296 | ty: Ref, | |
| 297 | // Index into a different array. | |
| 298 | payload: u32, | |
| 299 | }, | |
| 300 | ty_str: struct { | |
| 301 | ty: Ref, | |
| 302 | // ZIR string table index. | |
| 303 | str: u32, | |
| 304 | }, | |
| 305 | br: struct { | |
| 306 | block_inst: Index, | |
| 307 | operand: Ref, | |
| 308 | }, | |
| 309 | pl_op: struct { | |
| 310 | operand: Ref, | |
| 311 | payload: u32, | |
| 312 | }, | |
| 313 | dbg_stmt: struct { | |
| 314 | line: u32, | |
| 315 | column: u32, | |
| 316 | }, | |
| 317 | ||
| 318 | // Make sure we don't accidentally add a field to make this union | |
| 319 | // bigger than expected. Note that in Debug builds, Zig is allowed | |
| 320 | // to insert a secret field for safety checks. | |
| 321 | comptime { | |
| 322 | if (std.builtin.mode != .Debug) { | |
| 323 | assert(@sizeOf(Data) == 8); | |
| 324 | } | |
| 325 | } | |
| 326 | }; | |
| 327 | }; | |
| 328 | ||
| 329 | /// Trailing is a list of instruction indexes for every `body_len`. | |
| 330 | pub const Block = struct { | |
| 331 | body_len: u32, | |
| 332 | }; | |
| 333 | ||
| 334 | /// Trailing is a list of `Inst.Ref` for every `args_len`. | |
| 335 | pub const Call = struct { | |
| 336 | args_len: u32, | |
| 337 | }; | |
| 338 | ||
| 339 | /// This data is stored inside extra, with two sets of trailing `Inst.Ref`: | |
| 340 | /// * 0. the then body, according to `then_body_len`. | |
| 341 | /// * 1. the else body, according to `else_body_len`. | |
| 342 | pub const CondBr = struct { | |
| 343 | then_body_len: u32, | |
| 344 | else_body_len: u32, | |
| 345 | }; | |
| 346 | ||
| 347 | /// Trailing: | |
| 348 | /// * 0. `Case` for each `cases_len` | |
| 349 | /// * 1. the else body, according to `else_body_len`. | |
| 350 | pub const SwitchBr = struct { | |
| 351 | cases_len: u32, | |
| 352 | else_body_len: u32, | |
| 353 | ||
| 354 | /// Trailing: | |
| 355 | /// * item: Inst.Ref // for each `items_len`. | |
| 356 | /// * instruction index for each `body_len`. | |
| 357 | pub const Case = struct { | |
| 358 | items_len: u32, | |
| 359 | body_len: u32, | |
| 360 | }; | |
| 361 | }; | |
| 362 | ||
| 363 | pub const StructField = struct { | |
| 364 | struct_ptr: Inst.Ref, | |
| 365 | field_index: u32, | |
| 366 | }; | |
| 367 | ||
| 368 | /// Trailing: | |
| 369 | /// 0. `Inst.Ref` for every outputs_len | |
| 370 | /// 1. `Inst.Ref` for every inputs_len | |
| 371 | pub const Asm = struct { | |
| 372 | /// Index to the corresponding ZIR instruction. | |
| 373 | /// `asm_source`, `outputs_len`, `inputs_len`, `clobbers_len`, `is_volatile`, and | |
| 374 | /// clobbers are found via here. | |
| 375 | zir_index: u32, | |
| 376 | }; | |
| 377 | ||
| 378 | pub fn getMainBody(air: Air) []const Air.Inst.Index { | |
| 379 | const body_index = air.extra[@enumToInt(ExtraIndex.main_block)]; | |
| 380 | const extra = air.extraData(Block, body_index); | |
| 381 | return air.extra[extra.end..][0..extra.data.body_len]; | |
| 382 | } | |
| 383 | ||
| 384 | pub fn typeOf(air: Air, inst: Air.Inst.Ref) Type { | |
| 385 | const ref_int = @enumToInt(inst); | |
| 386 | if (ref_int < Air.Inst.Ref.typed_value_map.len) { | |
| 387 | return Air.Inst.Ref.typed_value_map[ref_int].ty; | |
| 388 | } | |
| 389 | return air.typeOfIndex(@intCast(Air.Inst.Index, ref_int - Air.Inst.Ref.typed_value_map.len)); | |
| 390 | } | |
| 391 | ||
| 392 | pub fn typeOfIndex(air: Air, inst: Air.Inst.Index) Type { | |
| 393 | const datas = air.instructions.items(.data); | |
| 394 | switch (air.instructions.items(.tag)[inst]) { | |
| 395 | .arg => return air.getRefType(datas[inst].ty_str.ty), | |
| 396 | ||
| 397 | .add, | |
| 398 | .addwrap, | |
| 399 | .sub, | |
| 400 | .subwrap, | |
| 401 | .mul, | |
| 402 | .mulwrap, | |
| 403 | .div, | |
| 404 | .bit_and, | |
| 405 | .bit_or, | |
| 406 | .xor, | |
| 407 | => return air.typeOf(datas[inst].bin_op.lhs), | |
| 408 | ||
| 409 | .cmp_lt, | |
| 410 | .cmp_lte, | |
| 411 | .cmp_eq, | |
| 412 | .cmp_gte, | |
| 413 | .cmp_gt, | |
| 414 | .cmp_neq, | |
| 415 | .is_null, | |
| 416 | .is_non_null, | |
| 417 | .is_null_ptr, | |
| 418 | .is_non_null_ptr, | |
| 419 | .is_err, | |
| 420 | .is_non_err, | |
| 421 | .is_err_ptr, | |
| 422 | .is_non_err_ptr, | |
| 423 | .bool_and, | |
| 424 | .bool_or, | |
| 425 | => return Type.initTag(.bool), | |
| 426 | ||
| 427 | .const_ty => return Type.initTag(.type), | |
| 428 | ||
| 429 | .alloc => return datas[inst].ty, | |
| 430 | ||
| 431 | .assembly, | |
| 432 | .block, | |
| 433 | .constant, | |
| 434 | .varptr, | |
| 435 | .struct_field_ptr, | |
| 436 | => return air.getRefType(datas[inst].ty_pl.ty), | |
| 437 | ||
| 438 | .not, | |
| 439 | .bitcast, | |
| 440 | .load, | |
| 441 | .ref, | |
| 442 | .floatcast, | |
| 443 | .intcast, | |
| 444 | .optional_payload, | |
| 445 | .optional_payload_ptr, | |
| 446 | .wrap_optional, | |
| 447 | .unwrap_errunion_payload, | |
| 448 | .unwrap_errunion_err, | |
| 449 | .unwrap_errunion_payload_ptr, | |
| 450 | .unwrap_errunion_err_ptr, | |
| 451 | .wrap_errunion_payload, | |
| 452 | .wrap_errunion_err, | |
| 453 | => return air.getRefType(datas[inst].ty_op.ty), | |
| 454 | ||
| 455 | .loop, | |
| 456 | .br, | |
| 457 | .cond_br, | |
| 458 | .switch_br, | |
| 459 | .ret, | |
| 460 | .unreach, | |
| 461 | => return Type.initTag(.noreturn), | |
| 462 | ||
| 463 | .breakpoint, | |
| 464 | .dbg_stmt, | |
| 465 | .store, | |
| 466 | => return Type.initTag(.void), | |
| 467 | ||
| 468 | .ptrtoint => return Type.initTag(.usize), | |
| 469 | ||
| 470 | .call => { | |
| 471 | const callee_ty = air.typeOf(datas[inst].pl_op.operand); | |
| 472 | return callee_ty.fnReturnType(); | |
| 473 | }, | |
| 474 | } | |
| 475 | } | |
| 476 | ||
| 477 | pub fn getRefType(air: Air, ref: Air.Inst.Ref) Type { | |
| 478 | const ref_int = @enumToInt(ref); | |
| 479 | if (ref_int < Air.Inst.Ref.typed_value_map.len) { | |
| 480 | return Air.Inst.Ref.typed_value_map[ref_int].val.toType(undefined) catch unreachable; | |
| 481 | } | |
| 482 | const inst_index = ref_int - Air.Inst.Ref.typed_value_map.len; | |
| 483 | const air_tags = air.instructions.items(.tag); | |
| 484 | const air_datas = air.instructions.items(.data); | |
| 485 | assert(air_tags[inst_index] == .const_ty); | |
| 486 | return air_datas[inst_index].ty; | |
| 487 | } | |
| 488 | ||
| 489 | /// Returns the requested data, as well as the new index which is at the start of the | |
| 490 | /// trailers for the object. | |
| 491 | pub fn extraData(air: Air, comptime T: type, index: usize) struct { data: T, end: usize } { | |
| 492 | const fields = std.meta.fields(T); | |
| 493 | var i: usize = index; | |
| 494 | var result: T = undefined; | |
| 495 | inline for (fields) |field| { | |
| 496 | @field(result, field.name) = switch (field.field_type) { | |
| 497 | u32 => air.extra[i], | |
| 498 | Inst.Ref => @intToEnum(Inst.Ref, air.extra[i]), | |
| 499 | i32 => @bitCast(i32, air.extra[i]), | |
| 500 | else => @compileError("bad field type"), | |
| 501 | }; | |
| 502 | i += 1; | |
| 503 | } | |
| 504 | return .{ | |
| 505 | .data = result, | |
| 506 | .end = i, | |
| 507 | }; | |
| 508 | } | |
| 509 | ||
| 510 | pub fn deinit(air: *Air, gpa: *std.mem.Allocator) void { | |
| 511 | air.instructions.deinit(gpa); | |
| 512 | gpa.free(air.extra); | |
| 513 | gpa.free(air.values); | |
| 514 | gpa.free(air.variables); | |
| 515 | air.* = undefined; | |
| 516 | } | |
| 517 | ||
| 518 | const ref_start_index: u32 = Air.Inst.Ref.typed_value_map.len; | |
| 519 | ||
| 520 | pub fn indexToRef(inst: Air.Inst.Index) Air.Inst.Ref { | |
| 521 | return @intToEnum(Air.Inst.Ref, ref_start_index + inst); | |
| 522 | } | |
| 523 | ||
| 524 | pub fn refToIndex(inst: Air.Inst.Ref) ?Air.Inst.Index { | |
| 525 | const ref_int = @enumToInt(inst); | |
| 526 | if (ref_int >= ref_start_index) { | |
| 527 | return ref_int - ref_start_index; | |
| 528 | } else { | |
| 529 | return null; | |
| 530 | } | |
| 531 | } | |
| 532 | ||
| 533 | /// Returns `null` if runtime-known. | |
| 534 | pub fn value(air: Air, inst: Air.Inst.Ref) ?Value { | |
| 535 | const ref_int = @enumToInt(inst); | |
| 536 | if (ref_int < Air.Inst.Ref.typed_value_map.len) { | |
| 537 | return Air.Inst.Ref.typed_value_map[ref_int].val; | |
| 538 | } | |
| 539 | const inst_index = @intCast(Air.Inst.Index, ref_int - Air.Inst.Ref.typed_value_map.len); | |
| 540 | const air_datas = air.instructions.items(.data); | |
| 541 | switch (air.instructions.items(.tag)[inst_index]) { | |
| 542 | .constant => return air.values[air_datas[inst_index].ty_pl.payload], | |
| 543 | .const_ty => unreachable, | |
| 544 | else => return air.typeOfIndex(inst_index).onePossibleValue(), | |
| 545 | } | |
| 546 | } |
src/AstGen.zig+118-109
| ... | ... | @@ -36,7 +36,7 @@ compile_errors: ArrayListUnmanaged(Zir.Inst.CompileErrors.Item) = .{}, |
| 36 | 36 | fn_block: ?*GenZir = null, |
| 37 | 37 | /// Maps string table indexes to the first `@import` ZIR instruction |
| 38 | 38 | /// that uses this string as the operand. |
| 39 | imports: std.AutoArrayHashMapUnmanaged(u32, Zir.Inst.Index) = .{}, | |
| 39 | imports: std.AutoArrayHashMapUnmanaged(u32, ast.TokenIndex) = .{}, | |
| 40 | 40 | |
| 41 | 41 | const InnerError = error{ OutOfMemory, AnalysisFail }; |
| 42 | 42 | |
| ... | ... | @@ -132,8 +132,7 @@ pub fn generate(gpa: *Allocator, tree: ast.Tree) Allocator.Error!Zir { |
| 132 | 132 | if (astgen.compile_errors.items.len == 0) { |
| 133 | 133 | astgen.extra.items[err_index] = 0; |
| 134 | 134 | } else { |
| 135 | try astgen.extra.ensureCapacity(gpa, astgen.extra.items.len + | |
| 136 | 1 + astgen.compile_errors.items.len * | |
| 135 | try astgen.extra.ensureUnusedCapacity(gpa, 1 + astgen.compile_errors.items.len * | |
| 137 | 136 | @typeInfo(Zir.Inst.CompileErrors.Item).Struct.fields.len); |
| 138 | 137 | |
| 139 | 138 | astgen.extra.items[err_index] = astgen.addExtraAssumeCapacity(Zir.Inst.CompileErrors{ |
| ... | ... | @@ -149,13 +148,20 @@ pub fn generate(gpa: *Allocator, tree: ast.Tree) Allocator.Error!Zir { |
| 149 | 148 | if (astgen.imports.count() == 0) { |
| 150 | 149 | astgen.extra.items[imports_index] = 0; |
| 151 | 150 | } else { |
| 152 | try astgen.extra.ensureCapacity(gpa, astgen.extra.items.len + | |
| 153 | @typeInfo(Zir.Inst.Imports).Struct.fields.len + astgen.imports.count()); | |
| 151 | try astgen.extra.ensureUnusedCapacity(gpa, @typeInfo(Zir.Inst.Imports).Struct.fields.len + | |
| 152 | astgen.imports.count() * @typeInfo(Zir.Inst.Imports.Item).Struct.fields.len); | |
| 154 | 153 | |
| 155 | 154 | astgen.extra.items[imports_index] = astgen.addExtraAssumeCapacity(Zir.Inst.Imports{ |
| 156 | 155 | .imports_len = @intCast(u32, astgen.imports.count()), |
| 157 | 156 | }); |
| 158 | astgen.extra.appendSliceAssumeCapacity(astgen.imports.values()); | |
| 157 | ||
| 158 | var it = astgen.imports.iterator(); | |
| 159 | while (it.next()) |entry| { | |
| 160 | _ = astgen.addExtraAssumeCapacity(Zir.Inst.Imports.Item{ | |
| 161 | .name = entry.key_ptr.*, | |
| 162 | .token = entry.value_ptr.*, | |
| 163 | }); | |
| 164 | } | |
| 159 | 165 | } |
| 160 | 166 | |
| 161 | 167 | return Zir{ |
| ... | ... | @@ -983,7 +989,7 @@ fn suspendExpr( |
| 983 | 989 | } |
| 984 | 990 | try suspend_scope.setBlockBody(suspend_inst); |
| 985 | 991 | |
| 986 | return gz.indexToRef(suspend_inst); | |
| 992 | return indexToRef(suspend_inst); | |
| 987 | 993 | } |
| 988 | 994 | |
| 989 | 995 | fn awaitExpr( |
| ... | ... | @@ -1294,7 +1300,7 @@ fn arrayInitExprRlPtr( |
| 1294 | 1300 | .lhs = result_ptr, |
| 1295 | 1301 | .rhs = index_inst, |
| 1296 | 1302 | }); |
| 1297 | elem_ptr_list[i] = gz.refToIndex(elem_ptr).?; | |
| 1303 | elem_ptr_list[i] = refToIndex(elem_ptr).?; | |
| 1298 | 1304 | _ = try expr(gz, scope, .{ .ptr = elem_ptr }, elem_init); |
| 1299 | 1305 | } |
| 1300 | 1306 | _ = try gz.addPlNode(.validate_array_init_ptr, node, Zir.Inst.Block{ |
| ... | ... | @@ -1449,7 +1455,7 @@ fn structInitExprRlPtr( |
| 1449 | 1455 | .lhs = result_ptr, |
| 1450 | 1456 | .field_name_start = str_index, |
| 1451 | 1457 | }); |
| 1452 | field_ptr_list[i] = gz.refToIndex(field_ptr).?; | |
| 1458 | field_ptr_list[i] = refToIndex(field_ptr).?; | |
| 1453 | 1459 | _ = try expr(gz, scope, .{ .ptr = field_ptr }, field_init); |
| 1454 | 1460 | } |
| 1455 | 1461 | _ = try gz.addPlNode(.validate_struct_init_ptr, node, Zir.Inst.Block{ |
| ... | ... | @@ -1483,7 +1489,7 @@ fn structInitExprRlTy( |
| 1483 | 1489 | .name_start = str_index, |
| 1484 | 1490 | }); |
| 1485 | 1491 | fields_list[i] = .{ |
| 1486 | .field_type = gz.refToIndex(field_ty_inst).?, | |
| 1492 | .field_type = refToIndex(field_ty_inst).?, | |
| 1487 | 1493 | .init = try expr(gz, scope, .{ .ty = field_ty_inst }, field_init), |
| 1488 | 1494 | }; |
| 1489 | 1495 | } |
| ... | ... | @@ -1780,7 +1786,7 @@ fn labeledBlockExpr( |
| 1780 | 1786 | } |
| 1781 | 1787 | try block_scope.setBlockBody(block_inst); |
| 1782 | 1788 | |
| 1783 | return gz.indexToRef(block_inst); | |
| 1789 | return indexToRef(block_inst); | |
| 1784 | 1790 | }, |
| 1785 | 1791 | .break_operand => { |
| 1786 | 1792 | // All break operands are values that did not use the result location pointer. |
| ... | ... | @@ -1794,7 +1800,7 @@ fn labeledBlockExpr( |
| 1794 | 1800 | } else { |
| 1795 | 1801 | try block_scope.setBlockBody(block_inst); |
| 1796 | 1802 | } |
| 1797 | const block_ref = gz.indexToRef(block_inst); | |
| 1803 | const block_ref = indexToRef(block_inst); | |
| 1798 | 1804 | switch (rl) { |
| 1799 | 1805 | .ref => return block_ref, |
| 1800 | 1806 | else => return rvalue(gz, rl, block_ref, block_node), |
| ... | ... | @@ -1872,7 +1878,7 @@ fn unusedResultExpr(gz: *GenZir, scope: *Scope, statement: ast.Node.Index) Inner |
| 1872 | 1878 | // we want to avoid adding the ZIR instruction if possible for performance. |
| 1873 | 1879 | const maybe_unused_result = try expr(gz, scope, .none, statement); |
| 1874 | 1880 | var noreturn_src_node: ast.Node.Index = 0; |
| 1875 | const elide_check = if (gz.refToIndex(maybe_unused_result)) |inst| b: { | |
| 1881 | const elide_check = if (refToIndex(maybe_unused_result)) |inst| b: { | |
| 1876 | 1882 | // Note that this array becomes invalid after appending more items to it |
| 1877 | 1883 | // in the above while loop. |
| 1878 | 1884 | const zir_tags = gz.astgen.instructions.items(.tag); |
| ... | ... | @@ -1916,8 +1922,6 @@ fn unusedResultExpr(gz: *GenZir, scope: *Scope, statement: ast.Node.Index) Inner |
| 1916 | 1922 | .bool_br_and, |
| 1917 | 1923 | .bool_br_or, |
| 1918 | 1924 | .bool_not, |
| 1919 | .bool_and, | |
| 1920 | .bool_or, | |
| 1921 | 1925 | .call_compile_time, |
| 1922 | 1926 | .call_nosuspend, |
| 1923 | 1927 | .call_async, |
| ... | ... | @@ -2434,7 +2438,7 @@ fn varDecl( |
| 2434 | 2438 | // the alloc instruction and the store_to_block_ptr instruction. |
| 2435 | 2439 | try parent_zir.ensureUnusedCapacity(gpa, init_scope.instructions.items.len); |
| 2436 | 2440 | for (init_scope.instructions.items) |src_inst| { |
| 2437 | if (gz.indexToRef(src_inst) == init_scope.rl_ptr) continue; | |
| 2441 | if (indexToRef(src_inst) == init_scope.rl_ptr) continue; | |
| 2438 | 2442 | if (zir_tags[src_inst] == .store_to_block_ptr) { |
| 2439 | 2443 | if (zir_datas[src_inst].bin.lhs == init_scope.rl_ptr) continue; |
| 2440 | 2444 | } |
| ... | ... | @@ -2737,7 +2741,7 @@ fn ptrType( |
| 2737 | 2741 | } |
| 2738 | 2742 | |
| 2739 | 2743 | const new_index = @intCast(Zir.Inst.Index, gz.astgen.instructions.len); |
| 2740 | const result = gz.indexToRef(new_index); | |
| 2744 | const result = indexToRef(new_index); | |
| 2741 | 2745 | gz.astgen.instructions.appendAssumeCapacity(.{ .tag = .ptr_type, .data = .{ |
| 2742 | 2746 | .ptr_type = .{ |
| 2743 | 2747 | .flags = .{ |
| ... | ... | @@ -3467,7 +3471,7 @@ fn structDeclInner( |
| 3467 | 3471 | .body_len = 0, |
| 3468 | 3472 | .decls_len = 0, |
| 3469 | 3473 | }); |
| 3470 | return gz.indexToRef(decl_inst); | |
| 3474 | return indexToRef(decl_inst); | |
| 3471 | 3475 | } |
| 3472 | 3476 | |
| 3473 | 3477 | const astgen = gz.astgen; |
| ... | ... | @@ -3486,7 +3490,6 @@ fn structDeclInner( |
| 3486 | 3490 | .astgen = astgen, |
| 3487 | 3491 | .force_comptime = true, |
| 3488 | 3492 | .in_defer = false, |
| 3489 | .ref_start_index = gz.ref_start_index, | |
| 3490 | 3493 | }; |
| 3491 | 3494 | defer block_scope.instructions.deinit(gpa); |
| 3492 | 3495 | |
| ... | ... | @@ -3724,7 +3727,7 @@ fn structDeclInner( |
| 3724 | 3727 | } |
| 3725 | 3728 | astgen.extra.appendSliceAssumeCapacity(fields_data.items); |
| 3726 | 3729 | |
| 3727 | return gz.indexToRef(decl_inst); | |
| 3730 | return indexToRef(decl_inst); | |
| 3728 | 3731 | } |
| 3729 | 3732 | |
| 3730 | 3733 | fn unionDeclInner( |
| ... | ... | @@ -3752,7 +3755,6 @@ fn unionDeclInner( |
| 3752 | 3755 | .astgen = astgen, |
| 3753 | 3756 | .force_comptime = true, |
| 3754 | 3757 | .in_defer = false, |
| 3755 | .ref_start_index = gz.ref_start_index, | |
| 3756 | 3758 | }; |
| 3757 | 3759 | defer block_scope.instructions.deinit(gpa); |
| 3758 | 3760 | |
| ... | ... | @@ -4000,7 +4002,7 @@ fn unionDeclInner( |
| 4000 | 4002 | astgen.extra.appendAssumeCapacity(cur_bit_bag); |
| 4001 | 4003 | astgen.extra.appendSliceAssumeCapacity(fields_data.items); |
| 4002 | 4004 | |
| 4003 | return gz.indexToRef(decl_inst); | |
| 4005 | return indexToRef(decl_inst); | |
| 4004 | 4006 | } |
| 4005 | 4007 | |
| 4006 | 4008 | fn containerDecl( |
| ... | ... | @@ -4164,7 +4166,6 @@ fn containerDecl( |
| 4164 | 4166 | .astgen = astgen, |
| 4165 | 4167 | .force_comptime = true, |
| 4166 | 4168 | .in_defer = false, |
| 4167 | .ref_start_index = gz.ref_start_index, | |
| 4168 | 4169 | }; |
| 4169 | 4170 | defer block_scope.instructions.deinit(gpa); |
| 4170 | 4171 | |
| ... | ... | @@ -4392,7 +4393,7 @@ fn containerDecl( |
| 4392 | 4393 | astgen.extra.appendAssumeCapacity(cur_bit_bag); |
| 4393 | 4394 | astgen.extra.appendSliceAssumeCapacity(fields_data.items); |
| 4394 | 4395 | |
| 4395 | return rvalue(gz, rl, gz.indexToRef(decl_inst), node); | |
| 4396 | return rvalue(gz, rl, indexToRef(decl_inst), node); | |
| 4396 | 4397 | }, |
| 4397 | 4398 | .keyword_opaque => { |
| 4398 | 4399 | var namespace: Scope.Namespace = .{ .parent = scope }; |
| ... | ... | @@ -4553,7 +4554,7 @@ fn containerDecl( |
| 4553 | 4554 | } |
| 4554 | 4555 | astgen.extra.appendSliceAssumeCapacity(wip_decls.payload.items); |
| 4555 | 4556 | |
| 4556 | return rvalue(gz, rl, gz.indexToRef(decl_inst), node); | |
| 4557 | return rvalue(gz, rl, indexToRef(decl_inst), node); | |
| 4557 | 4558 | }, |
| 4558 | 4559 | else => unreachable, |
| 4559 | 4560 | } |
| ... | ... | @@ -4791,7 +4792,7 @@ fn finishThenElseBlock( |
| 4791 | 4792 | } |
| 4792 | 4793 | assert(!strat.elide_store_to_block_ptr_instructions); |
| 4793 | 4794 | try setCondBrPayload(condbr, cond, then_scope, else_scope); |
| 4794 | return parent_gz.indexToRef(main_block); | |
| 4795 | return indexToRef(main_block); | |
| 4795 | 4796 | }, |
| 4796 | 4797 | .break_operand => { |
| 4797 | 4798 | if (!parent_gz.refIsNoReturn(then_result)) { |
| ... | ... | @@ -4809,7 +4810,7 @@ fn finishThenElseBlock( |
| 4809 | 4810 | } else { |
| 4810 | 4811 | try setCondBrPayload(condbr, cond, then_scope, else_scope); |
| 4811 | 4812 | } |
| 4812 | const block_ref = parent_gz.indexToRef(main_block); | |
| 4813 | const block_ref = indexToRef(main_block); | |
| 4813 | 4814 | switch (rl) { |
| 4814 | 4815 | .ref => return block_ref, |
| 4815 | 4816 | else => return rvalue(parent_gz, rl, block_ref, node), |
| ... | ... | @@ -4931,7 +4932,7 @@ fn boolBinOp( |
| 4931 | 4932 | } |
| 4932 | 4933 | try rhs_scope.setBoolBrBody(bool_br); |
| 4933 | 4934 | |
| 4934 | const block_ref = gz.indexToRef(bool_br); | |
| 4935 | const block_ref = indexToRef(bool_br); | |
| 4935 | 4936 | return rvalue(gz, rl, block_ref, node); |
| 4936 | 4937 | } |
| 4937 | 4938 | |
| ... | ... | @@ -5953,7 +5954,7 @@ fn switchExpr( |
| 5953 | 5954 | if (!strat.elide_store_to_block_ptr_instructions) { |
| 5954 | 5955 | astgen.extra.appendSliceAssumeCapacity(scalar_cases_payload.items); |
| 5955 | 5956 | astgen.extra.appendSliceAssumeCapacity(multi_cases_payload.items); |
| 5956 | return parent_gz.indexToRef(switch_block); | |
| 5957 | return indexToRef(switch_block); | |
| 5957 | 5958 | } |
| 5958 | 5959 | |
| 5959 | 5960 | // There will necessarily be a store_to_block_ptr for |
| ... | ... | @@ -5997,7 +5998,7 @@ fn switchExpr( |
| 5997 | 5998 | .lhs = block_scope.rl_ty_inst, |
| 5998 | 5999 | .rhs = zir_datas[break_inst].@"break".operand, |
| 5999 | 6000 | }; |
| 6000 | zir_datas[break_inst].@"break".operand = parent_gz.indexToRef(store_inst); | |
| 6001 | zir_datas[break_inst].@"break".operand = indexToRef(store_inst); | |
| 6001 | 6002 | } else { |
| 6002 | 6003 | scalar_cases_payload.items[body_len_index] -= 1; |
| 6003 | 6004 | astgen.extra.appendSliceAssumeCapacity(scalar_cases_payload.items[0..extra_index]); |
| ... | ... | @@ -6039,7 +6040,7 @@ fn switchExpr( |
| 6039 | 6040 | .lhs = block_scope.rl_ty_inst, |
| 6040 | 6041 | .rhs = zir_datas[break_inst].@"break".operand, |
| 6041 | 6042 | }; |
| 6042 | zir_datas[break_inst].@"break".operand = parent_gz.indexToRef(store_inst); | |
| 6043 | zir_datas[break_inst].@"break".operand = indexToRef(store_inst); | |
| 6043 | 6044 | } else { |
| 6044 | 6045 | scalar_cases_payload.items[body_len_index] -= 1; |
| 6045 | 6046 | astgen.extra.appendSliceAssumeCapacity(scalar_cases_payload.items[start_index..extra_index]); |
| ... | ... | @@ -6085,7 +6086,7 @@ fn switchExpr( |
| 6085 | 6086 | .lhs = block_scope.rl_ty_inst, |
| 6086 | 6087 | .rhs = zir_datas[break_inst].@"break".operand, |
| 6087 | 6088 | }; |
| 6088 | zir_datas[break_inst].@"break".operand = parent_gz.indexToRef(store_inst); | |
| 6089 | zir_datas[break_inst].@"break".operand = indexToRef(store_inst); | |
| 6089 | 6090 | } else { |
| 6090 | 6091 | assert(zir_datas[store_inst].bin.lhs == block_scope.rl_ptr); |
| 6091 | 6092 | multi_cases_payload.items[body_len_index] -= 1; |
| ... | ... | @@ -6096,7 +6097,7 @@ fn switchExpr( |
| 6096 | 6097 | } |
| 6097 | 6098 | } |
| 6098 | 6099 | |
| 6099 | const block_ref = parent_gz.indexToRef(switch_block); | |
| 6100 | const block_ref = indexToRef(switch_block); | |
| 6100 | 6101 | switch (rl) { |
| 6101 | 6102 | .ref => return block_ref, |
| 6102 | 6103 | else => return rvalue(parent_gz, rl, block_ref, switch_node), |
| ... | ... | @@ -6156,7 +6157,7 @@ fn switchExpr( |
| 6156 | 6157 | } |
| 6157 | 6158 | } |
| 6158 | 6159 | |
| 6159 | return parent_gz.indexToRef(switch_block); | |
| 6160 | return indexToRef(switch_block); | |
| 6160 | 6161 | }, |
| 6161 | 6162 | } |
| 6162 | 6163 | } |
| ... | ... | @@ -6411,37 +6412,12 @@ fn multilineStringLiteral( |
| 6411 | 6412 | node: ast.Node.Index, |
| 6412 | 6413 | ) InnerError!Zir.Inst.Ref { |
| 6413 | 6414 | const astgen = gz.astgen; |
| 6414 | const tree = astgen.tree; | |
| 6415 | const node_datas = tree.nodes.items(.data); | |
| 6416 | ||
| 6417 | const start = node_datas[node].lhs; | |
| 6418 | const end = node_datas[node].rhs; | |
| 6419 | ||
| 6420 | const gpa = gz.astgen.gpa; | |
| 6421 | const string_bytes = &gz.astgen.string_bytes; | |
| 6422 | const str_index = string_bytes.items.len; | |
| 6423 | ||
| 6424 | // First line: do not append a newline. | |
| 6425 | var tok_i = start; | |
| 6426 | { | |
| 6427 | const slice = tree.tokenSlice(tok_i); | |
| 6428 | const line_bytes = slice[2 .. slice.len - 1]; | |
| 6429 | try string_bytes.appendSlice(gpa, line_bytes); | |
| 6430 | tok_i += 1; | |
| 6431 | } | |
| 6432 | // Following lines: each line prepends a newline. | |
| 6433 | while (tok_i <= end) : (tok_i += 1) { | |
| 6434 | const slice = tree.tokenSlice(tok_i); | |
| 6435 | const line_bytes = slice[2 .. slice.len - 1]; | |
| 6436 | try string_bytes.ensureCapacity(gpa, string_bytes.items.len + line_bytes.len + 1); | |
| 6437 | string_bytes.appendAssumeCapacity('\n'); | |
| 6438 | string_bytes.appendSliceAssumeCapacity(line_bytes); | |
| 6439 | } | |
| 6415 | const str = try astgen.strLitNodeAsString(node); | |
| 6440 | 6416 | const result = try gz.add(.{ |
| 6441 | 6417 | .tag = .str, |
| 6442 | 6418 | .data = .{ .str = .{ |
| 6443 | .start = @intCast(u32, str_index), | |
| 6444 | .len = @intCast(u32, string_bytes.items.len - str_index), | |
| 6419 | .start = str.index, | |
| 6420 | .len = str.len, | |
| 6445 | 6421 | } }, |
| 6446 | 6422 | }); |
| 6447 | 6423 | return rvalue(gz, rl, result, node); |
| ... | ... | @@ -6588,12 +6564,12 @@ fn floatLiteral(gz: *GenZir, rl: ResultLoc, node: ast.Node.Index) InnerError!Zir |
| 6588 | 6564 | } else std.fmt.parseFloat(f128, bytes) catch |err| switch (err) { |
| 6589 | 6565 | error.InvalidCharacter => unreachable, // validated by tokenizer |
| 6590 | 6566 | }; |
| 6591 | // If the value fits into a f32 without losing any precision, store it that way. | |
| 6567 | // If the value fits into a f64 without losing any precision, store it that way. | |
| 6592 | 6568 | @setFloatMode(.Strict); |
| 6593 | const smaller_float = @floatCast(f32, float_number); | |
| 6569 | const smaller_float = @floatCast(f64, float_number); | |
| 6594 | 6570 | const bigger_again: f128 = smaller_float; |
| 6595 | 6571 | if (bigger_again == float_number) { |
| 6596 | const result = try gz.addFloat(smaller_float, node); | |
| 6572 | const result = try gz.addFloat(smaller_float); | |
| 6597 | 6573 | return rvalue(gz, rl, result, node); |
| 6598 | 6574 | } |
| 6599 | 6575 | // We need to use 128 bits. Break the float into 4 u32 values so we can |
| ... | ... | @@ -6619,9 +6595,14 @@ fn asmExpr( |
| 6619 | 6595 | const tree = astgen.tree; |
| 6620 | 6596 | const main_tokens = tree.nodes.items(.main_token); |
| 6621 | 6597 | const node_datas = tree.nodes.items(.data); |
| 6598 | const node_tags = tree.nodes.items(.tag); | |
| 6622 | 6599 | const token_tags = tree.tokens.items(.tag); |
| 6623 | 6600 | |
| 6624 | const asm_source = try comptimeExpr(gz, scope, .{ .ty = .const_slice_u8_type }, full.ast.template); | |
| 6601 | const asm_source = switch (node_tags[full.ast.template]) { | |
| 6602 | .string_literal => try astgen.strLitAsString(main_tokens[full.ast.template]), | |
| 6603 | .multiline_string_literal => try astgen.strLitNodeAsString(full.ast.template), | |
| 6604 | else => return astgen.failNode(full.ast.template, "assembly code must use string literal syntax", .{}), | |
| 6605 | }; | |
| 6625 | 6606 | |
| 6626 | 6607 | // See https://github.com/ziglang/zig/issues/215 and related issues discussing |
| 6627 | 6608 | // possible inline assembly improvements. Until then here is status quo AstGen |
| ... | ... | @@ -6751,7 +6732,7 @@ fn asmExpr( |
| 6751 | 6732 | |
| 6752 | 6733 | const result = try gz.addAsm(.{ |
| 6753 | 6734 | .node = node, |
| 6754 | .asm_source = asm_source, | |
| 6735 | .asm_source = asm_source.index, | |
| 6755 | 6736 | .is_volatile = full.volatile_token != null, |
| 6756 | 6737 | .output_type_bits = output_type_bits, |
| 6757 | 6738 | .outputs = outputs, |
| ... | ... | @@ -6855,7 +6836,7 @@ fn asRlPtr( |
| 6855 | 6836 | const zir_datas = astgen.instructions.items(.data); |
| 6856 | 6837 | try parent_zir.ensureUnusedCapacity(astgen.gpa, as_scope.instructions.items.len); |
| 6857 | 6838 | for (as_scope.instructions.items) |src_inst| { |
| 6858 | if (parent_gz.indexToRef(src_inst) == as_scope.rl_ptr) continue; | |
| 6839 | if (indexToRef(src_inst) == as_scope.rl_ptr) continue; | |
| 6859 | 6840 | if (zir_tags[src_inst] == .store_to_block_ptr) { |
| 6860 | 6841 | if (zir_datas[src_inst].bin.lhs == as_scope.rl_ptr) continue; |
| 6861 | 6842 | } |
| ... | ... | @@ -6986,11 +6967,9 @@ fn builtinCall( |
| 6986 | 6967 | const str_lit_token = main_tokens[operand_node]; |
| 6987 | 6968 | const str = try astgen.strLitAsString(str_lit_token); |
| 6988 | 6969 | const result = try gz.addStrTok(.import, str.index, str_lit_token); |
| 6989 | if (gz.refToIndex(result)) |import_inst_index| { | |
| 6990 | const gop = try astgen.imports.getOrPut(astgen.gpa, str.index); | |
| 6991 | if (!gop.found_existing) { | |
| 6992 | gop.value_ptr.* = import_inst_index; | |
| 6993 | } | |
| 6970 | const gop = try astgen.imports.getOrPut(astgen.gpa, str.index); | |
| 6971 | if (!gop.found_existing) { | |
| 6972 | gop.value_ptr.* = str_lit_token; | |
| 6994 | 6973 | } |
| 6995 | 6974 | return rvalue(gz, rl, result, node); |
| 6996 | 6975 | }, |
| ... | ... | @@ -8580,6 +8559,41 @@ fn strLitAsString(astgen: *AstGen, str_lit_token: ast.TokenIndex) !IndexSlice { |
| 8580 | 8559 | } |
| 8581 | 8560 | } |
| 8582 | 8561 | |
| 8562 | fn strLitNodeAsString(astgen: *AstGen, node: ast.Node.Index) !IndexSlice { | |
| 8563 | const tree = astgen.tree; | |
| 8564 | const node_datas = tree.nodes.items(.data); | |
| 8565 | ||
| 8566 | const start = node_datas[node].lhs; | |
| 8567 | const end = node_datas[node].rhs; | |
| 8568 | ||
| 8569 | const gpa = astgen.gpa; | |
| 8570 | const string_bytes = &astgen.string_bytes; | |
| 8571 | const str_index = string_bytes.items.len; | |
| 8572 | ||
| 8573 | // First line: do not append a newline. | |
| 8574 | var tok_i = start; | |
| 8575 | { | |
| 8576 | const slice = tree.tokenSlice(tok_i); | |
| 8577 | const line_bytes = slice[2 .. slice.len - 1]; | |
| 8578 | try string_bytes.appendSlice(gpa, line_bytes); | |
| 8579 | tok_i += 1; | |
| 8580 | } | |
| 8581 | // Following lines: each line prepends a newline. | |
| 8582 | while (tok_i <= end) : (tok_i += 1) { | |
| 8583 | const slice = tree.tokenSlice(tok_i); | |
| 8584 | const line_bytes = slice[2 .. slice.len - 1]; | |
| 8585 | try string_bytes.ensureCapacity(gpa, string_bytes.items.len + line_bytes.len + 1); | |
| 8586 | string_bytes.appendAssumeCapacity('\n'); | |
| 8587 | string_bytes.appendSliceAssumeCapacity(line_bytes); | |
| 8588 | } | |
| 8589 | const len = string_bytes.items.len - str_index; | |
| 8590 | try string_bytes.append(gpa, 0); | |
| 8591 | return IndexSlice{ | |
| 8592 | .index = @intCast(u32, str_index), | |
| 8593 | .len = @intCast(u32, len), | |
| 8594 | }; | |
| 8595 | } | |
| 8596 | ||
| 8583 | 8597 | fn testNameString(astgen: *AstGen, str_lit_token: ast.TokenIndex) !u32 { |
| 8584 | 8598 | const gpa = astgen.gpa; |
| 8585 | 8599 | const string_bytes = &astgen.string_bytes; |
| ... | ... | @@ -8701,9 +8715,6 @@ const GenZir = struct { |
| 8701 | 8715 | in_defer: bool, |
| 8702 | 8716 | /// How decls created in this scope should be named. |
| 8703 | 8717 | anon_name_strategy: Zir.Inst.NameStrategy = .anon, |
| 8704 | /// The end of special indexes. `Zir.Inst.Ref` subtracts against this number to convert | |
| 8705 | /// to `Zir.Inst.Index`. The default here is correct if there are 0 parameters. | |
| 8706 | ref_start_index: u32 = Zir.Inst.Ref.typed_value_map.len, | |
| 8707 | 8718 | /// The containing decl AST node. |
| 8708 | 8719 | decl_node_index: ast.Node.Index, |
| 8709 | 8720 | /// The containing decl line index, absolute. |
| ... | ... | @@ -8747,7 +8758,6 @@ const GenZir = struct { |
| 8747 | 8758 | return .{ |
| 8748 | 8759 | .force_comptime = gz.force_comptime, |
| 8749 | 8760 | .in_defer = gz.in_defer, |
| 8750 | .ref_start_index = gz.ref_start_index, | |
| 8751 | 8761 | .decl_node_index = gz.decl_node_index, |
| 8752 | 8762 | .decl_line = gz.decl_line, |
| 8753 | 8763 | .parent = scope, |
| ... | ... | @@ -8765,7 +8775,7 @@ const GenZir = struct { |
| 8765 | 8775 | |
| 8766 | 8776 | fn refIsNoReturn(gz: GenZir, inst_ref: Zir.Inst.Ref) bool { |
| 8767 | 8777 | if (inst_ref == .unreachable_value) return true; |
| 8768 | if (gz.refToIndex(inst_ref)) |inst_index| { | |
| 8778 | if (refToIndex(inst_ref)) |inst_index| { | |
| 8769 | 8779 | return gz.astgen.instructions.items(.tag)[inst_index].isNoReturn(); |
| 8770 | 8780 | } |
| 8771 | 8781 | return false; |
| ... | ... | @@ -8803,19 +8813,6 @@ const GenZir = struct { |
| 8803 | 8813 | return gz.astgen.tree.firstToken(gz.decl_node_index); |
| 8804 | 8814 | } |
| 8805 | 8815 | |
| 8806 | fn indexToRef(gz: GenZir, inst: Zir.Inst.Index) Zir.Inst.Ref { | |
| 8807 | return @intToEnum(Zir.Inst.Ref, gz.ref_start_index + inst); | |
| 8808 | } | |
| 8809 | ||
| 8810 | fn refToIndex(gz: GenZir, inst: Zir.Inst.Ref) ?Zir.Inst.Index { | |
| 8811 | const ref_int = @enumToInt(inst); | |
| 8812 | if (ref_int >= gz.ref_start_index) { | |
| 8813 | return ref_int - gz.ref_start_index; | |
| 8814 | } else { | |
| 8815 | return null; | |
| 8816 | } | |
| 8817 | } | |
| 8818 | ||
| 8819 | 8816 | fn setBreakResultLoc(gz: *GenZir, parent_rl: AstGen.ResultLoc) void { |
| 8820 | 8817 | // Depending on whether the result location is a pointer or value, different |
| 8821 | 8818 | // ZIR needs to be generated. In the former case we rely on storing to the |
| ... | ... | @@ -8994,7 +8991,7 @@ const GenZir = struct { |
| 8994 | 8991 | } }, |
| 8995 | 8992 | }); |
| 8996 | 8993 | gz.instructions.appendAssumeCapacity(new_index); |
| 8997 | return gz.indexToRef(new_index); | |
| 8994 | return indexToRef(new_index); | |
| 8998 | 8995 | } else { |
| 8999 | 8996 | try gz.astgen.extra.ensureUnusedCapacity( |
| 9000 | 8997 | gpa, |
| ... | ... | @@ -9021,7 +9018,7 @@ const GenZir = struct { |
| 9021 | 9018 | } }, |
| 9022 | 9019 | }); |
| 9023 | 9020 | gz.instructions.appendAssumeCapacity(new_index); |
| 9024 | return gz.indexToRef(new_index); | |
| 9021 | return indexToRef(new_index); | |
| 9025 | 9022 | } |
| 9026 | 9023 | } |
| 9027 | 9024 | |
| ... | ... | @@ -9075,7 +9072,7 @@ const GenZir = struct { |
| 9075 | 9072 | } }, |
| 9076 | 9073 | }); |
| 9077 | 9074 | gz.instructions.appendAssumeCapacity(new_index); |
| 9078 | return gz.indexToRef(new_index); | |
| 9075 | return indexToRef(new_index); | |
| 9079 | 9076 | } |
| 9080 | 9077 | |
| 9081 | 9078 | fn addCall( |
| ... | ... | @@ -9109,7 +9106,7 @@ const GenZir = struct { |
| 9109 | 9106 | } }, |
| 9110 | 9107 | }); |
| 9111 | 9108 | gz.instructions.appendAssumeCapacity(new_index); |
| 9112 | return gz.indexToRef(new_index); | |
| 9109 | return indexToRef(new_index); | |
| 9113 | 9110 | } |
| 9114 | 9111 | |
| 9115 | 9112 | /// Note that this returns a `Zir.Inst.Index` not a ref. |
| ... | ... | @@ -9160,16 +9157,13 @@ const GenZir = struct { |
| 9160 | 9157 | }); |
| 9161 | 9158 | gz.instructions.appendAssumeCapacity(new_index); |
| 9162 | 9159 | astgen.string_bytes.appendSliceAssumeCapacity(mem.sliceAsBytes(limbs)); |
| 9163 | return gz.indexToRef(new_index); | |
| 9160 | return indexToRef(new_index); | |
| 9164 | 9161 | } |
| 9165 | 9162 | |
| 9166 | fn addFloat(gz: *GenZir, number: f32, src_node: ast.Node.Index) !Zir.Inst.Ref { | |
| 9163 | fn addFloat(gz: *GenZir, number: f64) !Zir.Inst.Ref { | |
| 9167 | 9164 | return gz.add(.{ |
| 9168 | 9165 | .tag = .float, |
| 9169 | .data = .{ .float = .{ | |
| 9170 | .src_node = gz.nodeIndexToRelative(src_node), | |
| 9171 | .number = number, | |
| 9172 | } }, | |
| 9166 | .data = .{ .float = number }, | |
| 9173 | 9167 | }); |
| 9174 | 9168 | } |
| 9175 | 9169 | |
| ... | ... | @@ -9211,7 +9205,7 @@ const GenZir = struct { |
| 9211 | 9205 | } }, |
| 9212 | 9206 | }); |
| 9213 | 9207 | gz.instructions.appendAssumeCapacity(new_index); |
| 9214 | return gz.indexToRef(new_index); | |
| 9208 | return indexToRef(new_index); | |
| 9215 | 9209 | } |
| 9216 | 9210 | |
| 9217 | 9211 | fn addExtendedPayload( |
| ... | ... | @@ -9235,7 +9229,7 @@ const GenZir = struct { |
| 9235 | 9229 | } }, |
| 9236 | 9230 | }); |
| 9237 | 9231 | gz.instructions.appendAssumeCapacity(new_index); |
| 9238 | return gz.indexToRef(new_index); | |
| 9232 | return indexToRef(new_index); | |
| 9239 | 9233 | } |
| 9240 | 9234 | |
| 9241 | 9235 | fn addExtendedMultiOp( |
| ... | ... | @@ -9268,7 +9262,7 @@ const GenZir = struct { |
| 9268 | 9262 | }); |
| 9269 | 9263 | gz.instructions.appendAssumeCapacity(new_index); |
| 9270 | 9264 | astgen.appendRefsAssumeCapacity(operands); |
| 9271 | return gz.indexToRef(new_index); | |
| 9265 | return indexToRef(new_index); | |
| 9272 | 9266 | } |
| 9273 | 9267 | |
| 9274 | 9268 | fn addArrayTypeSentinel( |
| ... | ... | @@ -9294,7 +9288,7 @@ const GenZir = struct { |
| 9294 | 9288 | } }, |
| 9295 | 9289 | }); |
| 9296 | 9290 | gz.instructions.appendAssumeCapacity(new_index); |
| 9297 | return gz.indexToRef(new_index); | |
| 9291 | return indexToRef(new_index); | |
| 9298 | 9292 | } |
| 9299 | 9293 | |
| 9300 | 9294 | fn addUnTok( |
| ... | ... | @@ -9453,7 +9447,7 @@ const GenZir = struct { |
| 9453 | 9447 | } }, |
| 9454 | 9448 | }); |
| 9455 | 9449 | gz.instructions.appendAssumeCapacity(new_index); |
| 9456 | return gz.indexToRef(new_index); | |
| 9450 | return indexToRef(new_index); | |
| 9457 | 9451 | } |
| 9458 | 9452 | |
| 9459 | 9453 | fn addAsm( |
| ... | ... | @@ -9461,7 +9455,7 @@ const GenZir = struct { |
| 9461 | 9455 | args: struct { |
| 9462 | 9456 | /// Absolute node index. This function does the conversion to offset from Decl. |
| 9463 | 9457 | node: ast.Node.Index, |
| 9464 | asm_source: Zir.Inst.Ref, | |
| 9458 | asm_source: u32, | |
| 9465 | 9459 | output_type_bits: u32, |
| 9466 | 9460 | is_volatile: bool, |
| 9467 | 9461 | outputs: []const Zir.Inst.Asm.Output, |
| ... | ... | @@ -9511,7 +9505,7 @@ const GenZir = struct { |
| 9511 | 9505 | } }, |
| 9512 | 9506 | }); |
| 9513 | 9507 | gz.instructions.appendAssumeCapacity(new_index); |
| 9514 | return gz.indexToRef(new_index); | |
| 9508 | return indexToRef(new_index); | |
| 9515 | 9509 | } |
| 9516 | 9510 | |
| 9517 | 9511 | /// Note that this returns a `Zir.Inst.Index` not a ref. |
| ... | ... | @@ -9689,7 +9683,7 @@ const GenZir = struct { |
| 9689 | 9683 | } |
| 9690 | 9684 | |
| 9691 | 9685 | fn add(gz: *GenZir, inst: Zir.Inst) !Zir.Inst.Ref { |
| 9692 | return gz.indexToRef(try gz.addAsIndex(inst)); | |
| 9686 | return indexToRef(try gz.addAsIndex(inst)); | |
| 9693 | 9687 | } |
| 9694 | 9688 | |
| 9695 | 9689 | fn addAsIndex(gz: *GenZir, inst: Zir.Inst) !Zir.Inst.Index { |
| ... | ... | @@ -9836,3 +9830,18 @@ fn advanceSourceCursor(astgen: *AstGen, source: []const u8, end: usize) void { |
| 9836 | 9830 | astgen.source_line = line; |
| 9837 | 9831 | astgen.source_column = column; |
| 9838 | 9832 | } |
| 9833 | ||
| 9834 | const ref_start_index: u32 = Zir.Inst.Ref.typed_value_map.len; | |
| 9835 | ||
| 9836 | fn indexToRef(inst: Zir.Inst.Index) Zir.Inst.Ref { | |
| 9837 | return @intToEnum(Zir.Inst.Ref, ref_start_index + inst); | |
| 9838 | } | |
| 9839 | ||
| 9840 | fn refToIndex(inst: Zir.Inst.Ref) ?Zir.Inst.Index { | |
| 9841 | const ref_int = @enumToInt(inst); | |
| 9842 | if (ref_int >= ref_start_index) { | |
| 9843 | return ref_int - ref_start_index; | |
| 9844 | } else { | |
| 9845 | return null; | |
| 9846 | } | |
| 9847 | } |
src/Compilation.zig+95-49
| ... | ... | @@ -1,6 +1,7 @@ |
| 1 | 1 | const Compilation = @This(); |
| 2 | 2 | |
| 3 | 3 | const std = @import("std"); |
| 4 | const builtin = @import("builtin"); | |
| 4 | 5 | const mem = std.mem; |
| 5 | 6 | const Allocator = std.mem.Allocator; |
| 6 | 7 | const assert = std.debug.assert; |
| ... | ... | @@ -13,7 +14,7 @@ const target_util = @import("target.zig"); |
| 13 | 14 | const Package = @import("Package.zig"); |
| 14 | 15 | const link = @import("link.zig"); |
| 15 | 16 | const trace = @import("tracy.zig").trace; |
| 16 | const liveness = @import("liveness.zig"); | |
| 17 | const Liveness = @import("Liveness.zig"); | |
| 17 | 18 | const build_options = @import("build_options"); |
| 18 | 19 | const LibCInstallation = @import("libc_installation.zig").LibCInstallation; |
| 19 | 20 | const glibc = @import("glibc.zig"); |
| ... | ... | @@ -148,7 +149,7 @@ emit_docs: ?EmitLoc, |
| 148 | 149 | work_queue_wait_group: WaitGroup, |
| 149 | 150 | astgen_wait_group: WaitGroup, |
| 150 | 151 | |
| 151 | pub const InnerError = Module.InnerError; | |
| 152 | pub const SemaError = Module.SemaError; | |
| 152 | 153 | |
| 153 | 154 | pub const CRTFile = struct { |
| 154 | 155 | lock: Cache.Lock, |
| ... | ... | @@ -168,8 +169,10 @@ pub const CSourceFile = struct { |
| 168 | 169 | }; |
| 169 | 170 | |
| 170 | 171 | const Job = union(enum) { |
| 171 | /// Write the machine code for a Decl to the output file. | |
| 172 | /// Write the constant value for a Decl to the output file. | |
| 172 | 173 | codegen_decl: *Module.Decl, |
| 174 | /// Write the machine code for a function to the output file. | |
| 175 | codegen_func: *Module.Fn, | |
| 173 | 176 | /// Render the .h file snippet for the Decl. |
| 174 | 177 | emit_h_decl: *Module.Decl, |
| 175 | 178 | /// The Decl needs to be analyzed and possibly export itself. |
| ... | ... | @@ -1927,6 +1930,7 @@ pub fn getCompileLogOutput(self: *Compilation) []const u8 { |
| 1927 | 1930 | } |
| 1928 | 1931 | |
| 1929 | 1932 | pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemory }!void { |
| 1933 | const gpa = self.gpa; | |
| 1930 | 1934 | // If the terminal is dumb, we dont want to show the user all the |
| 1931 | 1935 | // output. |
| 1932 | 1936 | var progress: std.Progress = .{ .dont_print_on_dumb = true }; |
| ... | ... | @@ -2008,33 +2012,6 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2008 | 2012 | @panic("sadly stage2 is omitted from this build to save memory on the CI server"); |
| 2009 | 2013 | const module = self.bin_file.options.module.?; |
| 2010 | 2014 | assert(decl.has_tv); |
| 2011 | if (decl.val.castTag(.function)) |payload| { | |
| 2012 | const func = payload.data; | |
| 2013 | switch (func.state) { | |
| 2014 | .queued => module.analyzeFnBody(decl, func) catch |err| switch (err) { | |
| 2015 | error.AnalysisFail => { | |
| 2016 | assert(func.state != .in_progress); | |
| 2017 | continue; | |
| 2018 | }, | |
| 2019 | error.OutOfMemory => return error.OutOfMemory, | |
| 2020 | }, | |
| 2021 | .in_progress => unreachable, | |
| 2022 | .inline_only => unreachable, // don't queue work for this | |
| 2023 | .sema_failure, .dependency_failure => continue, | |
| 2024 | .success => {}, | |
| 2025 | } | |
| 2026 | // Here we tack on additional allocations to the Decl's arena. The allocations | |
| 2027 | // are lifetime annotations in the ZIR. | |
| 2028 | var decl_arena = decl.value_arena.?.promote(module.gpa); | |
| 2029 | defer decl.value_arena.?.* = decl_arena.state; | |
| 2030 | log.debug("analyze liveness of {s}", .{decl.name}); | |
| 2031 | try liveness.analyze(module.gpa, &decl_arena.allocator, func.body); | |
| 2032 | ||
| 2033 | if (std.builtin.mode == .Debug and self.verbose_air) { | |
| 2034 | func.dump(module.*); | |
| 2035 | } | |
| 2036 | } | |
| 2037 | ||
| 2038 | 2015 | assert(decl.ty.hasCodeGenBits()); |
| 2039 | 2016 | |
| 2040 | 2017 | self.bin_file.updateDecl(module, decl) catch |err| switch (err) { |
| ... | ... | @@ -2044,9 +2021,74 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2044 | 2021 | continue; |
| 2045 | 2022 | }, |
| 2046 | 2023 | else => { |
| 2047 | try module.failed_decls.ensureCapacity(module.gpa, module.failed_decls.count() + 1); | |
| 2024 | try module.failed_decls.ensureUnusedCapacity(gpa, 1); | |
| 2025 | module.failed_decls.putAssumeCapacityNoClobber(decl, try Module.ErrorMsg.create( | |
| 2026 | gpa, | |
| 2027 | decl.srcLoc(), | |
| 2028 | "unable to codegen: {s}", | |
| 2029 | .{@errorName(err)}, | |
| 2030 | )); | |
| 2031 | decl.analysis = .codegen_failure_retryable; | |
| 2032 | continue; | |
| 2033 | }, | |
| 2034 | }; | |
| 2035 | }, | |
| 2036 | }, | |
| 2037 | .codegen_func => |func| switch (func.owner_decl.analysis) { | |
| 2038 | .unreferenced => unreachable, | |
| 2039 | .in_progress => unreachable, | |
| 2040 | .outdated => unreachable, | |
| 2041 | ||
| 2042 | .file_failure, | |
| 2043 | .sema_failure, | |
| 2044 | .codegen_failure, | |
| 2045 | .dependency_failure, | |
| 2046 | .sema_failure_retryable, | |
| 2047 | => continue, | |
| 2048 | ||
| 2049 | .complete, .codegen_failure_retryable => { | |
| 2050 | if (build_options.omit_stage2) | |
| 2051 | @panic("sadly stage2 is omitted from this build to save memory on the CI server"); | |
| 2052 | switch (func.state) { | |
| 2053 | .sema_failure, .dependency_failure => continue, | |
| 2054 | .queued => {}, | |
| 2055 | .in_progress => unreachable, | |
| 2056 | .inline_only => unreachable, // don't queue work for this | |
| 2057 | .success => unreachable, // don't queue it twice | |
| 2058 | } | |
| 2059 | ||
| 2060 | const module = self.bin_file.options.module.?; | |
| 2061 | const decl = func.owner_decl; | |
| 2062 | ||
| 2063 | var air = module.analyzeFnBody(decl, func) catch |err| switch (err) { | |
| 2064 | error.AnalysisFail => { | |
| 2065 | assert(func.state != .in_progress); | |
| 2066 | continue; | |
| 2067 | }, | |
| 2068 | error.OutOfMemory => return error.OutOfMemory, | |
| 2069 | }; | |
| 2070 | defer air.deinit(gpa); | |
| 2071 | ||
| 2072 | log.debug("analyze liveness of {s}", .{decl.name}); | |
| 2073 | var liveness = try Liveness.analyze(gpa, air, decl.namespace.file_scope.zir); | |
| 2074 | defer liveness.deinit(gpa); | |
| 2075 | ||
| 2076 | if (builtin.mode == .Debug and self.verbose_air) { | |
| 2077 | std.debug.print("# Begin Function AIR: {s}:\n", .{decl.name}); | |
| 2078 | @import("print_air.zig").dump(gpa, air, decl.namespace.file_scope.zir, liveness); | |
| 2079 | std.debug.print("# End Function AIR: {s}:\n", .{decl.name}); | |
| 2080 | } | |
| 2081 | ||
| 2082 | self.bin_file.updateFunc(module, func, air, liveness) catch |err| switch (err) { | |
| 2083 | error.OutOfMemory => return error.OutOfMemory, | |
| 2084 | error.AnalysisFail => { | |
| 2085 | decl.analysis = .codegen_failure; | |
| 2086 | continue; | |
| 2087 | }, | |
| 2088 | else => { | |
| 2089 | try module.failed_decls.ensureUnusedCapacity(gpa, 1); | |
| 2048 | 2090 | module.failed_decls.putAssumeCapacityNoClobber(decl, try Module.ErrorMsg.create( |
| 2049 | module.gpa, | |
| 2091 | gpa, | |
| 2050 | 2092 | decl.srcLoc(), |
| 2051 | 2093 | "unable to codegen: {s}", |
| 2052 | 2094 | .{@errorName(err)}, |
| ... | ... | @@ -2055,6 +2097,7 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2055 | 2097 | continue; |
| 2056 | 2098 | }, |
| 2057 | 2099 | }; |
| 2100 | continue; | |
| 2058 | 2101 | }, |
| 2059 | 2102 | }, |
| 2060 | 2103 | .emit_h_decl => |decl| switch (decl.analysis) { |
| ... | ... | @@ -2075,7 +2118,7 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2075 | 2118 | @panic("sadly stage2 is omitted from this build to save memory on the CI server"); |
| 2076 | 2119 | const module = self.bin_file.options.module.?; |
| 2077 | 2120 | const emit_h = module.emit_h.?; |
| 2078 | _ = try emit_h.decl_table.getOrPut(module.gpa, decl); | |
| 2121 | _ = try emit_h.decl_table.getOrPut(gpa, decl); | |
| 2079 | 2122 | const decl_emit_h = decl.getEmitH(module); |
| 2080 | 2123 | const fwd_decl = &decl_emit_h.fwd_decl; |
| 2081 | 2124 | fwd_decl.shrinkRetainingCapacity(0); |
| ... | ... | @@ -2084,7 +2127,7 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2084 | 2127 | .module = module, |
| 2085 | 2128 | .error_msg = null, |
| 2086 | 2129 | .decl = decl, |
| 2087 | .fwd_decl = fwd_decl.toManaged(module.gpa), | |
| 2130 | .fwd_decl = fwd_decl.toManaged(gpa), | |
| 2088 | 2131 | // we don't want to emit optionals and error unions to headers since they have no ABI |
| 2089 | 2132 | .typedefs = undefined, |
| 2090 | 2133 | }; |
| ... | ... | @@ -2092,14 +2135,14 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2092 | 2135 | |
| 2093 | 2136 | c_codegen.genHeader(&dg) catch |err| switch (err) { |
| 2094 | 2137 | error.AnalysisFail => { |
| 2095 | try emit_h.failed_decls.put(module.gpa, decl, dg.error_msg.?); | |
| 2138 | try emit_h.failed_decls.put(gpa, decl, dg.error_msg.?); | |
| 2096 | 2139 | continue; |
| 2097 | 2140 | }, |
| 2098 | 2141 | else => |e| return e, |
| 2099 | 2142 | }; |
| 2100 | 2143 | |
| 2101 | 2144 | fwd_decl.* = dg.fwd_decl.moveToUnmanaged(); |
| 2102 | fwd_decl.shrinkAndFree(module.gpa, fwd_decl.items.len); | |
| 2145 | fwd_decl.shrinkAndFree(gpa, fwd_decl.items.len); | |
| 2103 | 2146 | }, |
| 2104 | 2147 | }, |
| 2105 | 2148 | .analyze_decl => |decl| { |
| ... | ... | @@ -2116,9 +2159,9 @@ pub fn performAllTheWork(self: *Compilation) error{ TimerUnsupported, OutOfMemor |
| 2116 | 2159 | @panic("sadly stage2 is omitted from this build to save memory on the CI server"); |
| 2117 | 2160 | const module = self.bin_file.options.module.?; |
| 2118 | 2161 | self.bin_file.updateDeclLineNumber(module, decl) catch |err| { |
| 2119 | try module.failed_decls.ensureCapacity(module.gpa, module.failed_decls.count() + 1); | |
| 2162 | try module.failed_decls.ensureUnusedCapacity(gpa, 1); | |
| 2120 | 2163 | module.failed_decls.putAssumeCapacityNoClobber(decl, try Module.ErrorMsg.create( |
| 2121 | module.gpa, | |
| 2164 | gpa, | |
| 2122 | 2165 | decl.srcLoc(), |
| 2123 | 2166 | "unable to update line number: {s}", |
| 2124 | 2167 | .{@errorName(err)}, |
| ... | ... | @@ -2320,7 +2363,7 @@ const AstGenSrc = union(enum) { |
| 2320 | 2363 | root, |
| 2321 | 2364 | import: struct { |
| 2322 | 2365 | importing_file: *Module.Scope.File, |
| 2323 | import_inst: Zir.Inst.Index, | |
| 2366 | import_tok: std.zig.ast.TokenIndex, | |
| 2324 | 2367 | }, |
| 2325 | 2368 | }; |
| 2326 | 2369 | |
| ... | ... | @@ -2357,11 +2400,15 @@ fn workerAstGenFile( |
| 2357 | 2400 | assert(file.zir_loaded); |
| 2358 | 2401 | const imports_index = file.zir.extra[@enumToInt(Zir.ExtraIndex.imports)]; |
| 2359 | 2402 | if (imports_index != 0) { |
| 2360 | const imports_len = file.zir.extra[imports_index]; | |
| 2403 | const extra = file.zir.extraData(Zir.Inst.Imports, imports_index); | |
| 2404 | var import_i: u32 = 0; | |
| 2405 | var extra_index = extra.end; | |
| 2361 | 2406 | |
| 2362 | for (file.zir.extra[imports_index + 1 ..][0..imports_len]) |import_inst| { | |
| 2363 | const inst_data = file.zir.instructions.items(.data)[import_inst].str_tok; | |
| 2364 | const import_path = inst_data.get(file.zir); | |
| 2407 | while (import_i < extra.data.imports_len) : (import_i += 1) { | |
| 2408 | const item = file.zir.extraData(Zir.Inst.Imports.Item, extra_index); | |
| 2409 | extra_index = item.end; | |
| 2410 | ||
| 2411 | const import_path = file.zir.nullTerminatedString(item.data.name); | |
| 2365 | 2412 | |
| 2366 | 2413 | const import_result = blk: { |
| 2367 | 2414 | const lock = comp.mutex.acquire(); |
| ... | ... | @@ -2375,7 +2422,7 @@ fn workerAstGenFile( |
| 2375 | 2422 | }); |
| 2376 | 2423 | const sub_src: AstGenSrc = .{ .import = .{ |
| 2377 | 2424 | .importing_file = file, |
| 2378 | .import_inst = import_inst, | |
| 2425 | .import_tok = item.data.token, | |
| 2379 | 2426 | } }; |
| 2380 | 2427 | wg.start(); |
| 2381 | 2428 | comp.thread_pool.spawn(workerAstGenFile, .{ |
| ... | ... | @@ -2607,12 +2654,11 @@ fn reportRetryableAstGenError( |
| 2607 | 2654 | }, |
| 2608 | 2655 | .import => |info| blk: { |
| 2609 | 2656 | const importing_file = info.importing_file; |
| 2610 | const import_inst = info.import_inst; | |
| 2611 | const inst_data = importing_file.zir.instructions.items(.data)[import_inst].str_tok; | |
| 2657 | ||
| 2612 | 2658 | break :blk .{ |
| 2613 | 2659 | .file_scope = importing_file, |
| 2614 | 2660 | .parent_decl_node = 0, |
| 2615 | .lazy = .{ .token_offset = inst_data.src_tok }, | |
| 2661 | .lazy = .{ .token_abs = info.import_tok }, | |
| 2616 | 2662 | }; |
| 2617 | 2663 | }, |
| 2618 | 2664 | }; |
| ... | ... | @@ -3149,7 +3195,7 @@ pub fn addCCArgs( |
| 3149 | 3195 | try argv.appendSlice(comp.clang_argv); |
| 3150 | 3196 | } |
| 3151 | 3197 | |
| 3152 | fn failCObj(comp: *Compilation, c_object: *CObject, comptime format: []const u8, args: anytype) InnerError { | |
| 3198 | fn failCObj(comp: *Compilation, c_object: *CObject, comptime format: []const u8, args: anytype) SemaError { | |
| 3153 | 3199 | @setCold(true); |
| 3154 | 3200 | const err_msg = blk: { |
| 3155 | 3201 | const msg = try std.fmt.allocPrint(comp.gpa, format, args); |
| ... | ... | @@ -3170,7 +3216,7 @@ fn failCObjWithOwnedErrorMsg( |
| 3170 | 3216 | comp: *Compilation, |
| 3171 | 3217 | c_object: *CObject, |
| 3172 | 3218 | err_msg: *CObject.ErrorMsg, |
| 3173 | ) InnerError { | |
| 3219 | ) SemaError { | |
| 3174 | 3220 | @setCold(true); |
| 3175 | 3221 | { |
| 3176 | 3222 | const lock = comp.mutex.acquire(); |
src/Liveness.zig created+602
| ... | ... | @@ -0,0 +1,602 @@ |
| 1 | //! For each AIR instruction, we want to know: | |
| 2 | //! * Is the instruction unreferenced (e.g. dies immediately)? | |
| 3 | //! * For each of its operands, does the operand die with this instruction (e.g. is | |
| 4 | //! this the last reference to it)? | |
| 5 | //! Some instructions are special, such as: | |
| 6 | //! * Conditional Branches | |
| 7 | //! * Switch Branches | |
| 8 | const Liveness = @This(); | |
| 9 | const std = @import("std"); | |
| 10 | const trace = @import("tracy.zig").trace; | |
| 11 | const log = std.log.scoped(.liveness); | |
| 12 | const assert = std.debug.assert; | |
| 13 | const Allocator = std.mem.Allocator; | |
| 14 | const Air = @import("Air.zig"); | |
| 15 | const Zir = @import("Zir.zig"); | |
| 16 | const Log2Int = std.math.Log2Int; | |
| 17 | ||
| 18 | /// This array is split into sets of 4 bits per AIR instruction. | |
| 19 | /// The MSB (0bX000) is whether the instruction is unreferenced. | |
| 20 | /// The LSB (0b000X) is the first operand, and so on, up to 3 operands. A set bit means the | |
| 21 | /// operand dies after this instruction. | |
| 22 | /// Instructions which need more data to track liveness have special handling via the | |
| 23 | /// `special` table. | |
| 24 | tomb_bits: []usize, | |
| 25 | /// Sparse table of specially handled instructions. The value is an index into the `extra` | |
| 26 | /// array. The meaning of the data depends on the AIR tag. | |
| 27 | /// * `cond_br` - points to a `CondBr` in `extra` at this index. | |
| 28 | /// * `switch_br` - points to a `SwitchBr` in `extra` at this index. | |
| 29 | /// * `asm`, `call` - the value is a set of bits which are the extra tomb bits of operands. | |
| 30 | /// The main tomb bits are still used and the extra ones are starting with the lsb of the | |
| 31 | /// value here. | |
| 32 | special: std.AutoHashMapUnmanaged(Air.Inst.Index, u32), | |
| 33 | /// Auxilliary data. The way this data is interpreted is determined contextually. | |
| 34 | extra: []const u32, | |
| 35 | ||
| 36 | /// Trailing is the set of instructions whose lifetimes end at the start of the then branch, | |
| 37 | /// followed by the set of instructions whose lifetimes end at the start of the else branch. | |
| 38 | pub const CondBr = struct { | |
| 39 | then_death_count: u32, | |
| 40 | else_death_count: u32, | |
| 41 | }; | |
| 42 | ||
| 43 | /// Trailing is: | |
| 44 | /// * For each case in the same order as in the AIR: | |
| 45 | /// - case_death_count: u32 | |
| 46 | /// - Air.Inst.Index for each `case_death_count`: set of instructions whose lifetimes | |
| 47 | /// end at the start of this case. | |
| 48 | /// * Air.Inst.Index for each `else_death_count`: set of instructions whose lifetimes | |
| 49 | /// end at the start of the else case. | |
| 50 | pub const SwitchBr = struct { | |
| 51 | else_death_count: u32, | |
| 52 | }; | |
| 53 | ||
| 54 | pub fn analyze(gpa: *Allocator, air: Air, zir: Zir) Allocator.Error!Liveness { | |
| 55 | const tracy = trace(@src()); | |
| 56 | defer tracy.end(); | |
| 57 | ||
| 58 | var a: Analysis = .{ | |
| 59 | .gpa = gpa, | |
| 60 | .air = air, | |
| 61 | .table = .{}, | |
| 62 | .tomb_bits = try gpa.alloc( | |
| 63 | usize, | |
| 64 | (air.instructions.len * bpi + @bitSizeOf(usize) - 1) / @bitSizeOf(usize), | |
| 65 | ), | |
| 66 | .extra = .{}, | |
| 67 | .special = .{}, | |
| 68 | .zir = &zir, | |
| 69 | }; | |
| 70 | errdefer gpa.free(a.tomb_bits); | |
| 71 | errdefer a.special.deinit(gpa); | |
| 72 | defer a.extra.deinit(gpa); | |
| 73 | defer a.table.deinit(gpa); | |
| 74 | ||
| 75 | std.mem.set(usize, a.tomb_bits, 0); | |
| 76 | ||
| 77 | const main_body = air.getMainBody(); | |
| 78 | try a.table.ensureTotalCapacity(gpa, @intCast(u32, main_body.len)); | |
| 79 | try analyzeWithContext(&a, null, main_body); | |
| 80 | return Liveness{ | |
| 81 | .tomb_bits = a.tomb_bits, | |
| 82 | .special = a.special, | |
| 83 | .extra = a.extra.toOwnedSlice(gpa), | |
| 84 | }; | |
| 85 | } | |
| 86 | ||
| 87 | pub fn getTombBits(l: Liveness, inst: Air.Inst.Index) Bpi { | |
| 88 | const usize_index = (inst * bpi) / @bitSizeOf(usize); | |
| 89 | return @truncate(Bpi, l.tomb_bits[usize_index] >> | |
| 90 | @intCast(Log2Int(usize), (inst % (@bitSizeOf(usize) / bpi)) * bpi)); | |
| 91 | } | |
| 92 | ||
| 93 | pub fn isUnused(l: Liveness, inst: Air.Inst.Index) bool { | |
| 94 | const usize_index = (inst * bpi) / @bitSizeOf(usize); | |
| 95 | const mask = @as(usize, 1) << | |
| 96 | @intCast(Log2Int(usize), (inst % (@bitSizeOf(usize) / bpi)) * bpi + (bpi - 1)); | |
| 97 | return (l.tomb_bits[usize_index] & mask) != 0; | |
| 98 | } | |
| 99 | ||
| 100 | pub fn operandDies(l: Liveness, inst: Air.Inst.Index, operand: OperandInt) bool { | |
| 101 | assert(operand < bpi - 1); | |
| 102 | const usize_index = (inst * bpi) / @bitSizeOf(usize); | |
| 103 | const mask = @as(usize, 1) << | |
| 104 | @intCast(Log2Int(usize), (inst % (@bitSizeOf(usize) / bpi)) * bpi + operand); | |
| 105 | return (l.tomb_bits[usize_index] & mask) != 0; | |
| 106 | } | |
| 107 | ||
| 108 | pub fn clearOperandDeath(l: Liveness, inst: Air.Inst.Index, operand: OperandInt) void { | |
| 109 | assert(operand < bpi - 1); | |
| 110 | const usize_index = (inst * bpi) / @bitSizeOf(usize); | |
| 111 | const mask = @as(usize, 1) << | |
| 112 | @intCast(Log2Int(usize), (inst % (@bitSizeOf(usize) / bpi)) * bpi + operand); | |
| 113 | l.tomb_bits[usize_index] &= ~mask; | |
| 114 | } | |
| 115 | ||
| 116 | /// Higher level API. | |
| 117 | pub const CondBrSlices = struct { | |
| 118 | then_deaths: []const Air.Inst.Index, | |
| 119 | else_deaths: []const Air.Inst.Index, | |
| 120 | }; | |
| 121 | ||
| 122 | pub fn getCondBr(l: Liveness, inst: Air.Inst.Index) CondBrSlices { | |
| 123 | var index: usize = l.special.get(inst) orelse return .{ | |
| 124 | .then_deaths = &.{}, | |
| 125 | .else_deaths = &.{}, | |
| 126 | }; | |
| 127 | const then_death_count = l.extra[index]; | |
| 128 | index += 1; | |
| 129 | const else_death_count = l.extra[index]; | |
| 130 | index += 1; | |
| 131 | const then_deaths = l.extra[index..][0..then_death_count]; | |
| 132 | index += then_death_count; | |
| 133 | return .{ | |
| 134 | .then_deaths = then_deaths, | |
| 135 | .else_deaths = l.extra[index..][0..else_death_count], | |
| 136 | }; | |
| 137 | } | |
| 138 | ||
| 139 | pub fn deinit(l: *Liveness, gpa: *Allocator) void { | |
| 140 | gpa.free(l.tomb_bits); | |
| 141 | gpa.free(l.extra); | |
| 142 | l.special.deinit(gpa); | |
| 143 | l.* = undefined; | |
| 144 | } | |
| 145 | ||
| 146 | /// How many tomb bits per AIR instruction. | |
| 147 | pub const bpi = 4; | |
| 148 | pub const Bpi = std.meta.Int(.unsigned, bpi); | |
| 149 | pub const OperandInt = std.math.Log2Int(Bpi); | |
| 150 | ||
| 151 | /// In-progress data; on successful analysis converted into `Liveness`. | |
| 152 | const Analysis = struct { | |
| 153 | gpa: *Allocator, | |
| 154 | air: Air, | |
| 155 | table: std.AutoHashMapUnmanaged(Air.Inst.Index, void), | |
| 156 | tomb_bits: []usize, | |
| 157 | special: std.AutoHashMapUnmanaged(Air.Inst.Index, u32), | |
| 158 | extra: std.ArrayListUnmanaged(u32), | |
| 159 | zir: *const Zir, | |
| 160 | ||
| 161 | fn storeTombBits(a: *Analysis, inst: Air.Inst.Index, tomb_bits: Bpi) void { | |
| 162 | const usize_index = (inst * bpi) / @bitSizeOf(usize); | |
| 163 | a.tomb_bits[usize_index] |= @as(usize, tomb_bits) << | |
| 164 | @intCast(Log2Int(usize), (inst % (@bitSizeOf(usize) / bpi)) * bpi); | |
| 165 | } | |
| 166 | ||
| 167 | fn addExtra(a: *Analysis, extra: anytype) Allocator.Error!u32 { | |
| 168 | const fields = std.meta.fields(@TypeOf(extra)); | |
| 169 | try a.extra.ensureUnusedCapacity(a.gpa, fields.len); | |
| 170 | return addExtraAssumeCapacity(a, extra); | |
| 171 | } | |
| 172 | ||
| 173 | fn addExtraAssumeCapacity(a: *Analysis, extra: anytype) u32 { | |
| 174 | const fields = std.meta.fields(@TypeOf(extra)); | |
| 175 | const result = @intCast(u32, a.extra.items.len); | |
| 176 | inline for (fields) |field| { | |
| 177 | a.extra.appendAssumeCapacity(switch (field.field_type) { | |
| 178 | u32 => @field(extra, field.name), | |
| 179 | else => @compileError("bad field type"), | |
| 180 | }); | |
| 181 | } | |
| 182 | return result; | |
| 183 | } | |
| 184 | }; | |
| 185 | ||
| 186 | fn analyzeWithContext( | |
| 187 | a: *Analysis, | |
| 188 | new_set: ?*std.AutoHashMapUnmanaged(Air.Inst.Index, void), | |
| 189 | body: []const Air.Inst.Index, | |
| 190 | ) Allocator.Error!void { | |
| 191 | var i: usize = body.len; | |
| 192 | ||
| 193 | if (new_set) |ns| { | |
| 194 | // We are only interested in doing this for instructions which are born | |
| 195 | // before a conditional branch, so after obtaining the new set for | |
| 196 | // each branch we prune the instructions which were born within. | |
| 197 | while (i != 0) { | |
| 198 | i -= 1; | |
| 199 | const inst = body[i]; | |
| 200 | _ = ns.remove(inst); | |
| 201 | try analyzeInst(a, new_set, inst); | |
| 202 | } | |
| 203 | } else { | |
| 204 | while (i != 0) { | |
| 205 | i -= 1; | |
| 206 | const inst = body[i]; | |
| 207 | try analyzeInst(a, new_set, inst); | |
| 208 | } | |
| 209 | } | |
| 210 | } | |
| 211 | ||
| 212 | fn analyzeInst( | |
| 213 | a: *Analysis, | |
| 214 | new_set: ?*std.AutoHashMapUnmanaged(Air.Inst.Index, void), | |
| 215 | inst: Air.Inst.Index, | |
| 216 | ) Allocator.Error!void { | |
| 217 | const gpa = a.gpa; | |
| 218 | const table = &a.table; | |
| 219 | const inst_tags = a.air.instructions.items(.tag); | |
| 220 | const inst_datas = a.air.instructions.items(.data); | |
| 221 | ||
| 222 | // No tombstone for this instruction means it is never referenced, | |
| 223 | // and its birth marks its own death. Very metal 🤘 | |
| 224 | const main_tomb = !table.contains(inst); | |
| 225 | ||
| 226 | switch (inst_tags[inst]) { | |
| 227 | .add, | |
| 228 | .addwrap, | |
| 229 | .sub, | |
| 230 | .subwrap, | |
| 231 | .mul, | |
| 232 | .mulwrap, | |
| 233 | .div, | |
| 234 | .bit_and, | |
| 235 | .bit_or, | |
| 236 | .xor, | |
| 237 | .cmp_lt, | |
| 238 | .cmp_lte, | |
| 239 | .cmp_eq, | |
| 240 | .cmp_gte, | |
| 241 | .cmp_gt, | |
| 242 | .cmp_neq, | |
| 243 | .bool_and, | |
| 244 | .bool_or, | |
| 245 | .store, | |
| 246 | => { | |
| 247 | const o = inst_datas[inst].bin_op; | |
| 248 | return trackOperands(a, new_set, inst, main_tomb, .{ o.lhs, o.rhs, .none }); | |
| 249 | }, | |
| 250 | ||
| 251 | .arg, | |
| 252 | .alloc, | |
| 253 | .constant, | |
| 254 | .const_ty, | |
| 255 | .breakpoint, | |
| 256 | .dbg_stmt, | |
| 257 | .varptr, | |
| 258 | .unreach, | |
| 259 | => return trackOperands(a, new_set, inst, main_tomb, .{ .none, .none, .none }), | |
| 260 | ||
| 261 | .not, | |
| 262 | .bitcast, | |
| 263 | .load, | |
| 264 | .ref, | |
| 265 | .floatcast, | |
| 266 | .intcast, | |
| 267 | .optional_payload, | |
| 268 | .optional_payload_ptr, | |
| 269 | .wrap_optional, | |
| 270 | .unwrap_errunion_payload, | |
| 271 | .unwrap_errunion_err, | |
| 272 | .unwrap_errunion_payload_ptr, | |
| 273 | .unwrap_errunion_err_ptr, | |
| 274 | .wrap_errunion_payload, | |
| 275 | .wrap_errunion_err, | |
| 276 | => { | |
| 277 | const o = inst_datas[inst].ty_op; | |
| 278 | return trackOperands(a, new_set, inst, main_tomb, .{ o.operand, .none, .none }); | |
| 279 | }, | |
| 280 | ||
| 281 | .is_null, | |
| 282 | .is_non_null, | |
| 283 | .is_null_ptr, | |
| 284 | .is_non_null_ptr, | |
| 285 | .is_err, | |
| 286 | .is_non_err, | |
| 287 | .is_err_ptr, | |
| 288 | .is_non_err_ptr, | |
| 289 | .ptrtoint, | |
| 290 | .ret, | |
| 291 | => { | |
| 292 | const operand = inst_datas[inst].un_op; | |
| 293 | return trackOperands(a, new_set, inst, main_tomb, .{ operand, .none, .none }); | |
| 294 | }, | |
| 295 | ||
| 296 | .call => { | |
| 297 | const inst_data = inst_datas[inst].pl_op; | |
| 298 | const callee = inst_data.operand; | |
| 299 | const extra = a.air.extraData(Air.Call, inst_data.payload); | |
| 300 | const args = @bitCast([]const Air.Inst.Ref, a.air.extra[extra.end..][0..extra.data.args_len]); | |
| 301 | if (args.len <= bpi - 2) { | |
| 302 | var buf = [1]Air.Inst.Ref{.none} ** (bpi - 1); | |
| 303 | buf[0] = callee; | |
| 304 | std.mem.copy(Air.Inst.Ref, buf[1..], args); | |
| 305 | return trackOperands(a, new_set, inst, main_tomb, buf); | |
| 306 | } | |
| 307 | var extra_tombs: ExtraTombs = .{ | |
| 308 | .analysis = a, | |
| 309 | .new_set = new_set, | |
| 310 | .inst = inst, | |
| 311 | .main_tomb = main_tomb, | |
| 312 | }; | |
| 313 | try extra_tombs.feed(callee); | |
| 314 | for (args) |arg| { | |
| 315 | try extra_tombs.feed(arg); | |
| 316 | } | |
| 317 | return extra_tombs.finish(); | |
| 318 | }, | |
| 319 | .struct_field_ptr => { | |
| 320 | const extra = a.air.extraData(Air.StructField, inst_datas[inst].ty_pl.payload).data; | |
| 321 | return trackOperands(a, new_set, inst, main_tomb, .{ extra.struct_ptr, .none, .none }); | |
| 322 | }, | |
| 323 | .br => { | |
| 324 | const br = inst_datas[inst].br; | |
| 325 | return trackOperands(a, new_set, inst, main_tomb, .{ br.operand, .none, .none }); | |
| 326 | }, | |
| 327 | .assembly => { | |
| 328 | const extra = a.air.extraData(Air.Asm, inst_datas[inst].ty_pl.payload); | |
| 329 | const extended = a.zir.instructions.items(.data)[extra.data.zir_index].extended; | |
| 330 | const outputs_len = @truncate(u5, extended.small); | |
| 331 | const inputs_len = @truncate(u5, extended.small >> 5); | |
| 332 | const outputs = @bitCast([]const Air.Inst.Ref, a.air.extra[extra.end..][0..outputs_len]); | |
| 333 | const args = @bitCast([]const Air.Inst.Ref, a.air.extra[extra.end + outputs.len ..][0..inputs_len]); | |
| 334 | if (outputs.len + args.len <= bpi - 1) { | |
| 335 | var buf = [1]Air.Inst.Ref{.none} ** (bpi - 1); | |
| 336 | std.mem.copy(Air.Inst.Ref, &buf, outputs); | |
| 337 | std.mem.copy(Air.Inst.Ref, buf[outputs.len..], args); | |
| 338 | return trackOperands(a, new_set, inst, main_tomb, buf); | |
| 339 | } | |
| 340 | var extra_tombs: ExtraTombs = .{ | |
| 341 | .analysis = a, | |
| 342 | .new_set = new_set, | |
| 343 | .inst = inst, | |
| 344 | .main_tomb = main_tomb, | |
| 345 | }; | |
| 346 | for (outputs) |output| { | |
| 347 | try extra_tombs.feed(output); | |
| 348 | } | |
| 349 | for (args) |arg| { | |
| 350 | try extra_tombs.feed(arg); | |
| 351 | } | |
| 352 | return extra_tombs.finish(); | |
| 353 | }, | |
| 354 | .block => { | |
| 355 | const extra = a.air.extraData(Air.Block, inst_datas[inst].ty_pl.payload); | |
| 356 | const body = a.air.extra[extra.end..][0..extra.data.body_len]; | |
| 357 | try analyzeWithContext(a, new_set, body); | |
| 358 | return trackOperands(a, new_set, inst, main_tomb, .{ .none, .none, .none }); | |
| 359 | }, | |
| 360 | .loop => { | |
| 361 | const extra = a.air.extraData(Air.Block, inst_datas[inst].ty_pl.payload); | |
| 362 | const body = a.air.extra[extra.end..][0..extra.data.body_len]; | |
| 363 | try analyzeWithContext(a, new_set, body); | |
| 364 | return; // Loop has no operands and it is always unreferenced. | |
| 365 | }, | |
| 366 | .cond_br => { | |
| 367 | // Each death that occurs inside one branch, but not the other, needs | |
| 368 | // to be added as a death immediately upon entering the other branch. | |
| 369 | const inst_data = inst_datas[inst].pl_op; | |
| 370 | const condition = inst_data.operand; | |
| 371 | const extra = a.air.extraData(Air.CondBr, inst_data.payload); | |
| 372 | const then_body = a.air.extra[extra.end..][0..extra.data.then_body_len]; | |
| 373 | const else_body = a.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; | |
| 374 | ||
| 375 | var then_table: std.AutoHashMapUnmanaged(Air.Inst.Index, void) = .{}; | |
| 376 | defer then_table.deinit(gpa); | |
| 377 | try analyzeWithContext(a, &then_table, then_body); | |
| 378 | ||
| 379 | // Reset the table back to its state from before the branch. | |
| 380 | { | |
| 381 | var it = then_table.keyIterator(); | |
| 382 | while (it.next()) |key| { | |
| 383 | assert(table.remove(key.*)); | |
| 384 | } | |
| 385 | } | |
| 386 | ||
| 387 | var else_table: std.AutoHashMapUnmanaged(Air.Inst.Index, void) = .{}; | |
| 388 | defer else_table.deinit(gpa); | |
| 389 | try analyzeWithContext(a, &else_table, else_body); | |
| 390 | ||
| 391 | var then_entry_deaths = std.ArrayList(Air.Inst.Index).init(gpa); | |
| 392 | defer then_entry_deaths.deinit(); | |
| 393 | var else_entry_deaths = std.ArrayList(Air.Inst.Index).init(gpa); | |
| 394 | defer else_entry_deaths.deinit(); | |
| 395 | ||
| 396 | { | |
| 397 | var it = else_table.keyIterator(); | |
| 398 | while (it.next()) |key| { | |
| 399 | const else_death = key.*; | |
| 400 | if (!then_table.contains(else_death)) { | |
| 401 | try then_entry_deaths.append(else_death); | |
| 402 | } | |
| 403 | } | |
| 404 | } | |
| 405 | // This loop is the same, except it's for the then branch, and it additionally | |
| 406 | // has to put its items back into the table to undo the reset. | |
| 407 | { | |
| 408 | var it = then_table.keyIterator(); | |
| 409 | while (it.next()) |key| { | |
| 410 | const then_death = key.*; | |
| 411 | if (!else_table.contains(then_death)) { | |
| 412 | try else_entry_deaths.append(then_death); | |
| 413 | } | |
| 414 | try table.put(gpa, then_death, {}); | |
| 415 | } | |
| 416 | } | |
| 417 | // Now we have to correctly populate new_set. | |
| 418 | if (new_set) |ns| { | |
| 419 | try ns.ensureCapacity(gpa, @intCast(u32, ns.count() + then_table.count() + else_table.count())); | |
| 420 | var it = then_table.keyIterator(); | |
| 421 | while (it.next()) |key| { | |
| 422 | _ = ns.putAssumeCapacity(key.*, {}); | |
| 423 | } | |
| 424 | it = else_table.keyIterator(); | |
| 425 | while (it.next()) |key| { | |
| 426 | _ = ns.putAssumeCapacity(key.*, {}); | |
| 427 | } | |
| 428 | } | |
| 429 | const then_death_count = @intCast(u32, then_entry_deaths.items.len); | |
| 430 | const else_death_count = @intCast(u32, else_entry_deaths.items.len); | |
| 431 | ||
| 432 | try a.extra.ensureUnusedCapacity(gpa, std.meta.fields(Air.CondBr).len + | |
| 433 | then_death_count + else_death_count); | |
| 434 | const extra_index = a.addExtraAssumeCapacity(CondBr{ | |
| 435 | .then_death_count = then_death_count, | |
| 436 | .else_death_count = else_death_count, | |
| 437 | }); | |
| 438 | a.extra.appendSliceAssumeCapacity(then_entry_deaths.items); | |
| 439 | a.extra.appendSliceAssumeCapacity(else_entry_deaths.items); | |
| 440 | try a.special.put(gpa, inst, extra_index); | |
| 441 | ||
| 442 | // Continue on with the instruction analysis. The following code will find the condition | |
| 443 | // instruction, and the deaths flag for the CondBr instruction will indicate whether the | |
| 444 | // condition's lifetime ends immediately before entering any branch. | |
| 445 | return trackOperands(a, new_set, inst, main_tomb, .{ condition, .none, .none }); | |
| 446 | }, | |
| 447 | .switch_br => { | |
| 448 | const pl_op = inst_datas[inst].pl_op; | |
| 449 | const condition = pl_op.operand; | |
| 450 | const switch_br = a.air.extraData(Air.SwitchBr, pl_op.payload); | |
| 451 | ||
| 452 | const Table = std.AutoHashMapUnmanaged(Air.Inst.Index, void); | |
| 453 | const case_tables = try gpa.alloc(Table, switch_br.data.cases_len + 1); // +1 for else | |
| 454 | defer gpa.free(case_tables); | |
| 455 | ||
| 456 | std.mem.set(Table, case_tables, .{}); | |
| 457 | defer for (case_tables) |*ct| ct.deinit(gpa); | |
| 458 | ||
| 459 | var air_extra_index: usize = switch_br.end; | |
| 460 | for (case_tables[0..switch_br.data.cases_len]) |*case_table| { | |
| 461 | const case = a.air.extraData(Air.SwitchBr.Case, air_extra_index); | |
| 462 | const case_body = a.air.extra[case.end + case.data.items_len ..][0..case.data.body_len]; | |
| 463 | air_extra_index = case.end + case.data.items_len + case_body.len; | |
| 464 | try analyzeWithContext(a, case_table, case_body); | |
| 465 | ||
| 466 | // Reset the table back to its state from before the case. | |
| 467 | var it = case_table.keyIterator(); | |
| 468 | while (it.next()) |key| { | |
| 469 | assert(table.remove(key.*)); | |
| 470 | } | |
| 471 | } | |
| 472 | { // else | |
| 473 | const else_table = &case_tables[case_tables.len - 1]; | |
| 474 | const else_body = a.air.extra[air_extra_index..][0..switch_br.data.else_body_len]; | |
| 475 | try analyzeWithContext(a, else_table, else_body); | |
| 476 | ||
| 477 | // Reset the table back to its state from before the case. | |
| 478 | var it = else_table.keyIterator(); | |
| 479 | while (it.next()) |key| { | |
| 480 | assert(table.remove(key.*)); | |
| 481 | } | |
| 482 | } | |
| 483 | ||
| 484 | const List = std.ArrayListUnmanaged(Air.Inst.Index); | |
| 485 | const case_deaths = try gpa.alloc(List, case_tables.len); // includes else | |
| 486 | defer gpa.free(case_deaths); | |
| 487 | ||
| 488 | std.mem.set(List, case_deaths, .{}); | |
| 489 | defer for (case_deaths) |*cd| cd.deinit(gpa); | |
| 490 | ||
| 491 | var total_deaths: u32 = 0; | |
| 492 | for (case_tables) |*ct, i| { | |
| 493 | total_deaths += ct.count(); | |
| 494 | var it = ct.keyIterator(); | |
| 495 | while (it.next()) |key| { | |
| 496 | const case_death = key.*; | |
| 497 | for (case_tables) |*ct_inner, j| { | |
| 498 | if (i == j) continue; | |
| 499 | if (!ct_inner.contains(case_death)) { | |
| 500 | // instruction is not referenced in this case | |
| 501 | try case_deaths[j].append(gpa, case_death); | |
| 502 | } | |
| 503 | } | |
| 504 | // undo resetting the table | |
| 505 | try table.put(gpa, case_death, {}); | |
| 506 | } | |
| 507 | } | |
| 508 | ||
| 509 | // Now we have to correctly populate new_set. | |
| 510 | if (new_set) |ns| { | |
| 511 | try ns.ensureUnusedCapacity(gpa, total_deaths); | |
| 512 | for (case_tables) |*ct| { | |
| 513 | var it = ct.keyIterator(); | |
| 514 | while (it.next()) |key| { | |
| 515 | _ = ns.putAssumeCapacity(key.*, {}); | |
| 516 | } | |
| 517 | } | |
| 518 | } | |
| 519 | ||
| 520 | const else_death_count = @intCast(u32, case_deaths[case_deaths.len - 1].items.len); | |
| 521 | const extra_index = try a.addExtra(SwitchBr{ | |
| 522 | .else_death_count = else_death_count, | |
| 523 | }); | |
| 524 | for (case_deaths[0 .. case_deaths.len - 1]) |*cd| { | |
| 525 | const case_death_count = @intCast(u32, cd.items.len); | |
| 526 | try a.extra.ensureUnusedCapacity(gpa, 1 + case_death_count + else_death_count); | |
| 527 | a.extra.appendAssumeCapacity(case_death_count); | |
| 528 | a.extra.appendSliceAssumeCapacity(cd.items); | |
| 529 | } | |
| 530 | a.extra.appendSliceAssumeCapacity(case_deaths[case_deaths.len - 1].items); | |
| 531 | try a.special.put(gpa, inst, extra_index); | |
| 532 | ||
| 533 | return trackOperands(a, new_set, inst, main_tomb, .{ condition, .none, .none }); | |
| 534 | }, | |
| 535 | } | |
| 536 | } | |
| 537 | ||
| 538 | fn trackOperands( | |
| 539 | a: *Analysis, | |
| 540 | new_set: ?*std.AutoHashMapUnmanaged(Air.Inst.Index, void), | |
| 541 | inst: Air.Inst.Index, | |
| 542 | main_tomb: bool, | |
| 543 | operands: [bpi - 1]Air.Inst.Ref, | |
| 544 | ) Allocator.Error!void { | |
| 545 | const table = &a.table; | |
| 546 | const gpa = a.gpa; | |
| 547 | ||
| 548 | var tomb_bits: Bpi = @boolToInt(main_tomb); | |
| 549 | var i = operands.len; | |
| 550 | ||
| 551 | while (i > 0) { | |
| 552 | i -= 1; | |
| 553 | tomb_bits <<= 1; | |
| 554 | const op_int = @enumToInt(operands[i]); | |
| 555 | if (op_int < Air.Inst.Ref.typed_value_map.len) continue; | |
| 556 | const operand: Air.Inst.Index = op_int - @intCast(u32, Air.Inst.Ref.typed_value_map.len); | |
| 557 | const prev = try table.fetchPut(gpa, operand, {}); | |
| 558 | if (prev == null) { | |
| 559 | // Death. | |
| 560 | tomb_bits |= 1; | |
| 561 | if (new_set) |ns| try ns.putNoClobber(gpa, operand, {}); | |
| 562 | } | |
| 563 | } | |
| 564 | a.storeTombBits(inst, tomb_bits); | |
| 565 | } | |
| 566 | ||
| 567 | const ExtraTombs = struct { | |
| 568 | analysis: *Analysis, | |
| 569 | new_set: ?*std.AutoHashMapUnmanaged(Air.Inst.Index, void), | |
| 570 | inst: Air.Inst.Index, | |
| 571 | main_tomb: bool, | |
| 572 | bit_index: usize = 0, | |
| 573 | tomb_bits: Bpi = 0, | |
| 574 | big_tomb_bits: u32 = 0, | |
| 575 | ||
| 576 | fn feed(et: *ExtraTombs, op_ref: Air.Inst.Ref) !void { | |
| 577 | const this_bit_index = et.bit_index; | |
| 578 | assert(this_bit_index < 32); // TODO mechanism for when there are greater than 32 operands | |
| 579 | et.bit_index += 1; | |
| 580 | const gpa = et.analysis.gpa; | |
| 581 | const op_int = @enumToInt(op_ref); | |
| 582 | if (op_int < Air.Inst.Ref.typed_value_map.len) return; | |
| 583 | const op_index: Air.Inst.Index = op_int - @intCast(u32, Air.Inst.Ref.typed_value_map.len); | |
| 584 | const prev = try et.analysis.table.fetchPut(gpa, op_index, {}); | |
| 585 | if (prev == null) { | |
| 586 | // Death. | |
| 587 | if (et.new_set) |ns| try ns.putNoClobber(gpa, op_index, {}); | |
| 588 | if (this_bit_index < bpi - 1) { | |
| 589 | et.tomb_bits |= @as(Bpi, 1) << @intCast(OperandInt, this_bit_index); | |
| 590 | } else { | |
| 591 | const big_bit_index = this_bit_index - (bpi - 1); | |
| 592 | et.big_tomb_bits |= @as(u32, 1) << @intCast(u5, big_bit_index); | |
| 593 | } | |
| 594 | } | |
| 595 | } | |
| 596 | ||
| 597 | fn finish(et: *ExtraTombs) !void { | |
| 598 | et.tomb_bits |= @as(Bpi, @boolToInt(et.main_tomb)) << (bpi - 1); | |
| 599 | et.analysis.storeTombBits(et.inst, et.tomb_bits); | |
| 600 | try et.analysis.special.put(et.analysis.gpa, et.inst, et.big_tomb_bits); | |
| 601 | } | |
| 602 | }; |
src/Module.zig+230-421
| ... | ... | @@ -21,7 +21,7 @@ const Type = @import("type.zig").Type; |
| 21 | 21 | const TypedValue = @import("TypedValue.zig"); |
| 22 | 22 | const Package = @import("Package.zig"); |
| 23 | 23 | const link = @import("link.zig"); |
| 24 | const ir = @import("air.zig"); | |
| 24 | const Air = @import("Air.zig"); | |
| 25 | 25 | const Zir = @import("Zir.zig"); |
| 26 | 26 | const trace = @import("tracy.zig").trace; |
| 27 | 27 | const AstGen = @import("AstGen.zig"); |
| ... | ... | @@ -739,8 +739,6 @@ pub const Union = struct { |
| 739 | 739 | pub const Fn = struct { |
| 740 | 740 | /// The Decl that corresponds to the function itself. |
| 741 | 741 | owner_decl: *Decl, |
| 742 | /// undefined unless analysis state is `success`. | |
| 743 | body: ir.Body, | |
| 744 | 742 | /// The ZIR instruction that is a function instruction. Use this to find |
| 745 | 743 | /// the body. We store this rather than the body directly so that when ZIR |
| 746 | 744 | /// is regenerated on update(), we can map this to the new corresponding |
| ... | ... | @@ -771,11 +769,6 @@ pub const Fn = struct { |
| 771 | 769 | success, |
| 772 | 770 | }; |
| 773 | 771 | |
| 774 | /// For debugging purposes. | |
| 775 | pub fn dump(func: *Fn, mod: Module) void { | |
| 776 | ir.dumpFn(mod, func); | |
| 777 | } | |
| 778 | ||
| 779 | 772 | pub fn deinit(func: *Fn, gpa: *Allocator) void { |
| 780 | 773 | if (func.getInferredErrorSet()) |map| { |
| 781 | 774 | map.deinit(gpa); |
| ... | ... | @@ -1157,7 +1150,7 @@ pub const Scope = struct { |
| 1157 | 1150 | /// This can vary during inline or comptime function calls. See `Sema.owner_decl` |
| 1158 | 1151 | /// for the one that will be the same for all Block instances. |
| 1159 | 1152 | src_decl: *Decl, |
| 1160 | instructions: ArrayListUnmanaged(*ir.Inst), | |
| 1153 | instructions: ArrayListUnmanaged(Air.Inst.Index), | |
| 1161 | 1154 | label: ?*Label = null, |
| 1162 | 1155 | inlining: ?*Inlining, |
| 1163 | 1156 | /// If runtime_index is not 0 then one of these is guaranteed to be non null. |
| ... | ... | @@ -1189,14 +1182,14 @@ pub const Scope = struct { |
| 1189 | 1182 | }; |
| 1190 | 1183 | |
| 1191 | 1184 | pub const Merges = struct { |
| 1192 | block_inst: *ir.Inst.Block, | |
| 1185 | block_inst: Air.Inst.Index, | |
| 1193 | 1186 | /// Separate array list from break_inst_list so that it can be passed directly |
| 1194 | 1187 | /// to resolvePeerTypes. |
| 1195 | results: ArrayListUnmanaged(*ir.Inst), | |
| 1188 | results: ArrayListUnmanaged(Air.Inst.Ref), | |
| 1196 | 1189 | /// Keeps track of the break instructions so that the operand can be replaced |
| 1197 | 1190 | /// if we need to add type coercion at the end of block analysis. |
| 1198 | 1191 | /// Same indexes, capacity, length as `results`. |
| 1199 | br_list: ArrayListUnmanaged(*ir.Inst.Br), | |
| 1192 | br_list: ArrayListUnmanaged(Air.Inst.Index), | |
| 1200 | 1193 | }; |
| 1201 | 1194 | |
| 1202 | 1195 | /// For debugging purposes. |
| ... | ... | @@ -1233,185 +1226,94 @@ pub const Scope = struct { |
| 1233 | 1226 | return block.src_decl.namespace.file_scope; |
| 1234 | 1227 | } |
| 1235 | 1228 | |
| 1236 | pub fn addNoOp( | |
| 1237 | block: *Scope.Block, | |
| 1238 | src: LazySrcLoc, | |
| 1229 | pub fn addTy( | |
| 1230 | block: *Block, | |
| 1231 | tag: Air.Inst.Tag, | |
| 1239 | 1232 | ty: Type, |
| 1240 | comptime tag: ir.Inst.Tag, | |
| 1241 | ) !*ir.Inst { | |
| 1242 | const inst = try block.sema.arena.create(tag.Type()); | |
| 1243 | inst.* = .{ | |
| 1244 | .base = .{ | |
| 1245 | .tag = tag, | |
| 1246 | .ty = ty, | |
| 1247 | .src = src, | |
| 1248 | }, | |
| 1249 | }; | |
| 1250 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1251 | return &inst.base; | |
| 1233 | ) error{OutOfMemory}!Air.Inst.Ref { | |
| 1234 | return block.addInst(.{ | |
| 1235 | .tag = tag, | |
| 1236 | .data = .{ .ty = ty }, | |
| 1237 | }); | |
| 1252 | 1238 | } |
| 1253 | 1239 | |
| 1254 | pub fn addUnOp( | |
| 1255 | block: *Scope.Block, | |
| 1256 | src: LazySrcLoc, | |
| 1240 | pub fn addTyOp( | |
| 1241 | block: *Block, | |
| 1242 | tag: Air.Inst.Tag, | |
| 1257 | 1243 | ty: Type, |
| 1258 | tag: ir.Inst.Tag, | |
| 1259 | operand: *ir.Inst, | |
| 1260 | ) !*ir.Inst { | |
| 1261 | const inst = try block.sema.arena.create(ir.Inst.UnOp); | |
| 1262 | inst.* = .{ | |
| 1263 | .base = .{ | |
| 1264 | .tag = tag, | |
| 1265 | .ty = ty, | |
| 1266 | .src = src, | |
| 1267 | }, | |
| 1268 | .operand = operand, | |
| 1269 | }; | |
| 1270 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1271 | return &inst.base; | |
| 1244 | operand: Air.Inst.Ref, | |
| 1245 | ) error{OutOfMemory}!Air.Inst.Ref { | |
| 1246 | return block.addInst(.{ | |
| 1247 | .tag = tag, | |
| 1248 | .data = .{ .ty_op = .{ | |
| 1249 | .ty = try block.sema.addType(ty), | |
| 1250 | .operand = operand, | |
| 1251 | } }, | |
| 1252 | }); | |
| 1272 | 1253 | } |
| 1273 | 1254 | |
| 1274 | pub fn addBinOp( | |
| 1275 | block: *Scope.Block, | |
| 1276 | src: LazySrcLoc, | |
| 1277 | ty: Type, | |
| 1278 | tag: ir.Inst.Tag, | |
| 1279 | lhs: *ir.Inst, | |
| 1280 | rhs: *ir.Inst, | |
| 1281 | ) !*ir.Inst { | |
| 1282 | const inst = try block.sema.arena.create(ir.Inst.BinOp); | |
| 1283 | inst.* = .{ | |
| 1284 | .base = .{ | |
| 1285 | .tag = tag, | |
| 1286 | .ty = ty, | |
| 1287 | .src = src, | |
| 1288 | }, | |
| 1289 | .lhs = lhs, | |
| 1290 | .rhs = rhs, | |
| 1291 | }; | |
| 1292 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1293 | return &inst.base; | |
| 1255 | pub fn addNoOp(block: *Block, tag: Air.Inst.Tag) error{OutOfMemory}!Air.Inst.Ref { | |
| 1256 | return block.addInst(.{ | |
| 1257 | .tag = tag, | |
| 1258 | .data = .{ .no_op = {} }, | |
| 1259 | }); | |
| 1294 | 1260 | } |
| 1295 | 1261 | |
| 1296 | pub fn addBr( | |
| 1297 | scope_block: *Scope.Block, | |
| 1298 | src: LazySrcLoc, | |
| 1299 | target_block: *ir.Inst.Block, | |
| 1300 | operand: *ir.Inst, | |
| 1301 | ) !*ir.Inst.Br { | |
| 1302 | const inst = try scope_block.sema.arena.create(ir.Inst.Br); | |
| 1303 | inst.* = .{ | |
| 1304 | .base = .{ | |
| 1305 | .tag = .br, | |
| 1306 | .ty = Type.initTag(.noreturn), | |
| 1307 | .src = src, | |
| 1308 | }, | |
| 1309 | .operand = operand, | |
| 1310 | .block = target_block, | |
| 1311 | }; | |
| 1312 | try scope_block.instructions.append(scope_block.sema.gpa, &inst.base); | |
| 1313 | return inst; | |
| 1262 | pub fn addUnOp( | |
| 1263 | block: *Block, | |
| 1264 | tag: Air.Inst.Tag, | |
| 1265 | operand: Air.Inst.Ref, | |
| 1266 | ) error{OutOfMemory}!Air.Inst.Ref { | |
| 1267 | return block.addInst(.{ | |
| 1268 | .tag = tag, | |
| 1269 | .data = .{ .un_op = operand }, | |
| 1270 | }); | |
| 1314 | 1271 | } |
| 1315 | 1272 | |
| 1316 | pub fn addCondBr( | |
| 1317 | block: *Scope.Block, | |
| 1318 | src: LazySrcLoc, | |
| 1319 | condition: *ir.Inst, | |
| 1320 | then_body: ir.Body, | |
| 1321 | else_body: ir.Body, | |
| 1322 | ) !*ir.Inst { | |
| 1323 | const inst = try block.sema.arena.create(ir.Inst.CondBr); | |
| 1324 | inst.* = .{ | |
| 1325 | .base = .{ | |
| 1326 | .tag = .condbr, | |
| 1327 | .ty = Type.initTag(.noreturn), | |
| 1328 | .src = src, | |
| 1329 | }, | |
| 1330 | .condition = condition, | |
| 1331 | .then_body = then_body, | |
| 1332 | .else_body = else_body, | |
| 1333 | }; | |
| 1334 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1335 | return &inst.base; | |
| 1273 | pub fn addBr( | |
| 1274 | block: *Block, | |
| 1275 | target_block: Air.Inst.Index, | |
| 1276 | operand: Air.Inst.Ref, | |
| 1277 | ) error{OutOfMemory}!Air.Inst.Ref { | |
| 1278 | return block.addInst(.{ | |
| 1279 | .tag = .br, | |
| 1280 | .data = .{ .br = .{ | |
| 1281 | .block_inst = target_block, | |
| 1282 | .operand = operand, | |
| 1283 | } }, | |
| 1284 | }); | |
| 1336 | 1285 | } |
| 1337 | 1286 | |
| 1338 | pub fn addCall( | |
| 1339 | block: *Scope.Block, | |
| 1340 | src: LazySrcLoc, | |
| 1341 | ty: Type, | |
| 1342 | func: *ir.Inst, | |
| 1343 | args: []const *ir.Inst, | |
| 1344 | ) !*ir.Inst { | |
| 1345 | const inst = try block.sema.arena.create(ir.Inst.Call); | |
| 1346 | inst.* = .{ | |
| 1347 | .base = .{ | |
| 1348 | .tag = .call, | |
| 1349 | .ty = ty, | |
| 1350 | .src = src, | |
| 1351 | }, | |
| 1352 | .func = func, | |
| 1353 | .args = args, | |
| 1354 | }; | |
| 1355 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1356 | return &inst.base; | |
| 1287 | pub fn addBinOp( | |
| 1288 | block: *Block, | |
| 1289 | tag: Air.Inst.Tag, | |
| 1290 | lhs: Air.Inst.Ref, | |
| 1291 | rhs: Air.Inst.Ref, | |
| 1292 | ) error{OutOfMemory}!Air.Inst.Ref { | |
| 1293 | return block.addInst(.{ | |
| 1294 | .tag = tag, | |
| 1295 | .data = .{ .bin_op = .{ | |
| 1296 | .lhs = lhs, | |
| 1297 | .rhs = rhs, | |
| 1298 | } }, | |
| 1299 | }); | |
| 1357 | 1300 | } |
| 1358 | 1301 | |
| 1359 | pub fn addSwitchBr( | |
| 1360 | block: *Scope.Block, | |
| 1361 | src: LazySrcLoc, | |
| 1362 | operand: *ir.Inst, | |
| 1363 | cases: []ir.Inst.SwitchBr.Case, | |
| 1364 | else_body: ir.Body, | |
| 1365 | ) !*ir.Inst { | |
| 1366 | const inst = try block.sema.arena.create(ir.Inst.SwitchBr); | |
| 1367 | inst.* = .{ | |
| 1368 | .base = .{ | |
| 1369 | .tag = .switchbr, | |
| 1370 | .ty = Type.initTag(.noreturn), | |
| 1371 | .src = src, | |
| 1372 | }, | |
| 1373 | .target = operand, | |
| 1374 | .cases = cases, | |
| 1375 | .else_body = else_body, | |
| 1376 | }; | |
| 1377 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1378 | return &inst.base; | |
| 1302 | pub fn addInst(block: *Block, inst: Air.Inst) error{OutOfMemory}!Air.Inst.Ref { | |
| 1303 | return Air.indexToRef(try block.addInstAsIndex(inst)); | |
| 1379 | 1304 | } |
| 1380 | 1305 | |
| 1381 | pub fn addDbgStmt(block: *Scope.Block, src: LazySrcLoc, line: u32, column: u32) !*ir.Inst { | |
| 1382 | const inst = try block.sema.arena.create(ir.Inst.DbgStmt); | |
| 1383 | inst.* = .{ | |
| 1384 | .base = .{ | |
| 1385 | .tag = .dbg_stmt, | |
| 1386 | .ty = Type.initTag(.void), | |
| 1387 | .src = src, | |
| 1388 | }, | |
| 1389 | .line = line, | |
| 1390 | .column = column, | |
| 1391 | }; | |
| 1392 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1393 | return &inst.base; | |
| 1394 | } | |
| 1306 | pub fn addInstAsIndex(block: *Block, inst: Air.Inst) error{OutOfMemory}!Air.Inst.Index { | |
| 1307 | const sema = block.sema; | |
| 1308 | const gpa = sema.gpa; | |
| 1395 | 1309 | |
| 1396 | pub fn addStructFieldPtr( | |
| 1397 | block: *Scope.Block, | |
| 1398 | src: LazySrcLoc, | |
| 1399 | ty: Type, | |
| 1400 | struct_ptr: *ir.Inst, | |
| 1401 | field_index: u32, | |
| 1402 | ) !*ir.Inst { | |
| 1403 | const inst = try block.sema.arena.create(ir.Inst.StructFieldPtr); | |
| 1404 | inst.* = .{ | |
| 1405 | .base = .{ | |
| 1406 | .tag = .struct_field_ptr, | |
| 1407 | .ty = ty, | |
| 1408 | .src = src, | |
| 1409 | }, | |
| 1410 | .struct_ptr = struct_ptr, | |
| 1411 | .field_index = field_index, | |
| 1412 | }; | |
| 1413 | try block.instructions.append(block.sema.gpa, &inst.base); | |
| 1414 | return &inst.base; | |
| 1310 | try sema.air_instructions.ensureUnusedCapacity(gpa, 1); | |
| 1311 | try block.instructions.ensureUnusedCapacity(gpa, 1); | |
| 1312 | ||
| 1313 | const result_index = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 1314 | sema.air_instructions.appendAssumeCapacity(inst); | |
| 1315 | block.instructions.appendAssumeCapacity(result_index); | |
| 1316 | return result_index; | |
| 1415 | 1317 | } |
| 1416 | 1318 | }; |
| 1417 | 1319 | }; |
| ... | ... | @@ -2130,7 +2032,8 @@ pub const LazySrcLoc = union(enum) { |
| 2130 | 2032 | } |
| 2131 | 2033 | }; |
| 2132 | 2034 | |
| 2133 | pub const InnerError = error{ OutOfMemory, AnalysisFail }; | |
| 2035 | pub const SemaError = error{ OutOfMemory, AnalysisFail }; | |
| 2036 | pub const CompileError = error{ OutOfMemory, AnalysisFail, NeededSourceLocation }; | |
| 2134 | 2037 | |
| 2135 | 2038 | pub fn deinit(mod: *Module) void { |
| 2136 | 2039 | const gpa = mod.gpa; |
| ... | ... | @@ -2769,7 +2672,7 @@ pub fn mapOldZirToNew( |
| 2769 | 2672 | } |
| 2770 | 2673 | } |
| 2771 | 2674 | |
| 2772 | pub fn ensureDeclAnalyzed(mod: *Module, decl: *Decl) InnerError!void { | |
| 2675 | pub fn ensureDeclAnalyzed(mod: *Module, decl: *Decl) SemaError!void { | |
| 2773 | 2676 | const tracy = trace(@src()); |
| 2774 | 2677 | defer tracy.end(); |
| 2775 | 2678 | |
| ... | ... | @@ -2869,7 +2772,7 @@ pub fn semaPkg(mod: *Module, pkg: *Package) !void { |
| 2869 | 2772 | |
| 2870 | 2773 | /// Regardless of the file status, will create a `Decl` so that we |
| 2871 | 2774 | /// can track dependencies and re-analyze when the file becomes outdated. |
| 2872 | pub fn semaFile(mod: *Module, file: *Scope.File) InnerError!void { | |
| 2775 | pub fn semaFile(mod: *Module, file: *Scope.File) SemaError!void { | |
| 2873 | 2776 | const tracy = trace(@src()); |
| 2874 | 2777 | defer tracy.end(); |
| 2875 | 2778 | |
| ... | ... | @@ -2999,6 +2902,7 @@ fn semaDecl(mod: *Module, decl: *Decl) !bool { |
| 2999 | 2902 | decl.generation = mod.generation; |
| 3000 | 2903 | return false; |
| 3001 | 2904 | } |
| 2905 | log.debug("semaDecl {*} ({s})", .{ decl, decl.name }); | |
| 3002 | 2906 | |
| 3003 | 2907 | var block_scope: Scope.Block = .{ |
| 3004 | 2908 | .parent = null, |
| ... | ... | @@ -3035,106 +2939,109 @@ fn semaDecl(mod: *Module, decl: *Decl) !bool { |
| 3035 | 2939 | const decl_arena_state = try decl_arena.allocator.create(std.heap.ArenaAllocator.State); |
| 3036 | 2940 | |
| 3037 | 2941 | if (decl_tv.val.castTag(.function)) |fn_payload| { |
| 3038 | var prev_type_has_bits = false; | |
| 3039 | var prev_is_inline = false; | |
| 3040 | var type_changed = true; | |
| 3041 | ||
| 3042 | if (decl.has_tv) { | |
| 3043 | prev_type_has_bits = decl.ty.hasCodeGenBits(); | |
| 3044 | type_changed = !decl.ty.eql(decl_tv.ty); | |
| 3045 | if (decl.getFunction()) |prev_func| { | |
| 3046 | prev_is_inline = prev_func.state == .inline_only; | |
| 2942 | const func = fn_payload.data; | |
| 2943 | const owns_tv = func.owner_decl == decl; | |
| 2944 | if (owns_tv) { | |
| 2945 | var prev_type_has_bits = false; | |
| 2946 | var prev_is_inline = false; | |
| 2947 | var type_changed = true; | |
| 2948 | ||
| 2949 | if (decl.has_tv) { | |
| 2950 | prev_type_has_bits = decl.ty.hasCodeGenBits(); | |
| 2951 | type_changed = !decl.ty.eql(decl_tv.ty); | |
| 2952 | if (decl.getFunction()) |prev_func| { | |
| 2953 | prev_is_inline = prev_func.state == .inline_only; | |
| 2954 | } | |
| 2955 | decl.clearValues(gpa); | |
| 3047 | 2956 | } |
| 3048 | decl.clearValues(gpa); | |
| 3049 | } | |
| 3050 | ||
| 3051 | decl.ty = try decl_tv.ty.copy(&decl_arena.allocator); | |
| 3052 | decl.val = try decl_tv.val.copy(&decl_arena.allocator); | |
| 3053 | decl.align_val = try align_val.copy(&decl_arena.allocator); | |
| 3054 | decl.linksection_val = try linksection_val.copy(&decl_arena.allocator); | |
| 3055 | decl.has_tv = true; | |
| 3056 | decl.owns_tv = fn_payload.data.owner_decl == decl; | |
| 3057 | decl_arena_state.* = decl_arena.state; | |
| 3058 | decl.value_arena = decl_arena_state; | |
| 3059 | decl.analysis = .complete; | |
| 3060 | decl.generation = mod.generation; | |
| 3061 | 2957 | |
| 3062 | const is_inline = decl_tv.ty.fnCallingConvention() == .Inline; | |
| 3063 | if (!is_inline and decl_tv.ty.hasCodeGenBits()) { | |
| 3064 | // We don't fully codegen the decl until later, but we do need to reserve a global | |
| 3065 | // offset table index for it. This allows us to codegen decls out of dependency order, | |
| 3066 | // increasing how many computations can be done in parallel. | |
| 3067 | try mod.comp.bin_file.allocateDeclIndexes(decl); | |
| 3068 | try mod.comp.work_queue.writeItem(.{ .codegen_decl = decl }); | |
| 3069 | if (type_changed and mod.emit_h != null) { | |
| 3070 | try mod.comp.work_queue.writeItem(.{ .emit_h_decl = decl }); | |
| 2958 | decl.ty = try decl_tv.ty.copy(&decl_arena.allocator); | |
| 2959 | decl.val = try decl_tv.val.copy(&decl_arena.allocator); | |
| 2960 | decl.align_val = try align_val.copy(&decl_arena.allocator); | |
| 2961 | decl.linksection_val = try linksection_val.copy(&decl_arena.allocator); | |
| 2962 | decl.has_tv = true; | |
| 2963 | decl.owns_tv = owns_tv; | |
| 2964 | decl_arena_state.* = decl_arena.state; | |
| 2965 | decl.value_arena = decl_arena_state; | |
| 2966 | decl.analysis = .complete; | |
| 2967 | decl.generation = mod.generation; | |
| 2968 | ||
| 2969 | const is_inline = decl_tv.ty.fnCallingConvention() == .Inline; | |
| 2970 | if (!is_inline and decl_tv.ty.hasCodeGenBits()) { | |
| 2971 | // We don't fully codegen the decl until later, but we do need to reserve a global | |
| 2972 | // offset table index for it. This allows us to codegen decls out of dependency order, | |
| 2973 | // increasing how many computations can be done in parallel. | |
| 2974 | try mod.comp.bin_file.allocateDeclIndexes(decl); | |
| 2975 | try mod.comp.work_queue.writeItem(.{ .codegen_func = func }); | |
| 2976 | if (type_changed and mod.emit_h != null) { | |
| 2977 | try mod.comp.work_queue.writeItem(.{ .emit_h_decl = decl }); | |
| 2978 | } | |
| 2979 | } else if (!prev_is_inline and prev_type_has_bits) { | |
| 2980 | mod.comp.bin_file.freeDecl(decl); | |
| 3071 | 2981 | } |
| 3072 | } else if (!prev_is_inline and prev_type_has_bits) { | |
| 3073 | mod.comp.bin_file.freeDecl(decl); | |
| 3074 | } | |
| 3075 | 2982 | |
| 3076 | if (decl.is_exported) { | |
| 3077 | const export_src = src; // TODO make this point at `export` token | |
| 3078 | if (is_inline) { | |
| 3079 | return mod.fail(&block_scope.base, export_src, "export of inline function", .{}); | |
| 2983 | if (decl.is_exported) { | |
| 2984 | const export_src = src; // TODO make this point at `export` token | |
| 2985 | if (is_inline) { | |
| 2986 | return mod.fail(&block_scope.base, export_src, "export of inline function", .{}); | |
| 2987 | } | |
| 2988 | // The scope needs to have the decl in it. | |
| 2989 | try mod.analyzeExport(&block_scope.base, export_src, mem.spanZ(decl.name), decl); | |
| 3080 | 2990 | } |
| 3081 | // The scope needs to have the decl in it. | |
| 3082 | try mod.analyzeExport(&block_scope.base, export_src, mem.spanZ(decl.name), decl); | |
| 3083 | } | |
| 3084 | return type_changed or is_inline != prev_is_inline; | |
| 3085 | } else { | |
| 3086 | var type_changed = true; | |
| 3087 | if (decl.has_tv) { | |
| 3088 | type_changed = !decl.ty.eql(decl_tv.ty); | |
| 3089 | decl.clearValues(gpa); | |
| 2991 | return type_changed or is_inline != prev_is_inline; | |
| 3090 | 2992 | } |
| 2993 | } | |
| 2994 | var type_changed = true; | |
| 2995 | if (decl.has_tv) { | |
| 2996 | type_changed = !decl.ty.eql(decl_tv.ty); | |
| 2997 | decl.clearValues(gpa); | |
| 2998 | } | |
| 3091 | 2999 | |
| 3092 | decl.owns_tv = false; | |
| 3093 | var queue_linker_work = false; | |
| 3094 | if (decl_tv.val.castTag(.variable)) |payload| { | |
| 3095 | const variable = payload.data; | |
| 3096 | if (variable.owner_decl == decl) { | |
| 3097 | decl.owns_tv = true; | |
| 3098 | queue_linker_work = true; | |
| 3000 | decl.owns_tv = false; | |
| 3001 | var queue_linker_work = false; | |
| 3002 | if (decl_tv.val.castTag(.variable)) |payload| { | |
| 3003 | const variable = payload.data; | |
| 3004 | if (variable.owner_decl == decl) { | |
| 3005 | decl.owns_tv = true; | |
| 3006 | queue_linker_work = true; | |
| 3099 | 3007 | |
| 3100 | const copied_init = try variable.init.copy(&decl_arena.allocator); | |
| 3101 | variable.init = copied_init; | |
| 3102 | } | |
| 3103 | } else if (decl_tv.val.castTag(.extern_fn)) |payload| { | |
| 3104 | const owner_decl = payload.data; | |
| 3105 | if (decl == owner_decl) { | |
| 3106 | decl.owns_tv = true; | |
| 3107 | queue_linker_work = true; | |
| 3108 | } | |
| 3008 | const copied_init = try variable.init.copy(&decl_arena.allocator); | |
| 3009 | variable.init = copied_init; | |
| 3109 | 3010 | } |
| 3011 | } else if (decl_tv.val.castTag(.extern_fn)) |payload| { | |
| 3012 | const owner_decl = payload.data; | |
| 3013 | if (decl == owner_decl) { | |
| 3014 | decl.owns_tv = true; | |
| 3015 | queue_linker_work = true; | |
| 3016 | } | |
| 3017 | } | |
| 3110 | 3018 | |
| 3111 | decl.ty = try decl_tv.ty.copy(&decl_arena.allocator); | |
| 3112 | decl.val = try decl_tv.val.copy(&decl_arena.allocator); | |
| 3113 | decl.align_val = try align_val.copy(&decl_arena.allocator); | |
| 3114 | decl.linksection_val = try linksection_val.copy(&decl_arena.allocator); | |
| 3115 | decl.has_tv = true; | |
| 3116 | decl_arena_state.* = decl_arena.state; | |
| 3117 | decl.value_arena = decl_arena_state; | |
| 3118 | decl.analysis = .complete; | |
| 3119 | decl.generation = mod.generation; | |
| 3120 | ||
| 3121 | if (queue_linker_work and decl.ty.hasCodeGenBits()) { | |
| 3122 | try mod.comp.bin_file.allocateDeclIndexes(decl); | |
| 3123 | try mod.comp.work_queue.writeItem(.{ .codegen_decl = decl }); | |
| 3019 | decl.ty = try decl_tv.ty.copy(&decl_arena.allocator); | |
| 3020 | decl.val = try decl_tv.val.copy(&decl_arena.allocator); | |
| 3021 | decl.align_val = try align_val.copy(&decl_arena.allocator); | |
| 3022 | decl.linksection_val = try linksection_val.copy(&decl_arena.allocator); | |
| 3023 | decl.has_tv = true; | |
| 3024 | decl_arena_state.* = decl_arena.state; | |
| 3025 | decl.value_arena = decl_arena_state; | |
| 3026 | decl.analysis = .complete; | |
| 3027 | decl.generation = mod.generation; | |
| 3124 | 3028 | |
| 3125 | if (type_changed and mod.emit_h != null) { | |
| 3126 | try mod.comp.work_queue.writeItem(.{ .emit_h_decl = decl }); | |
| 3127 | } | |
| 3128 | } | |
| 3029 | if (queue_linker_work and decl.ty.hasCodeGenBits()) { | |
| 3030 | try mod.comp.bin_file.allocateDeclIndexes(decl); | |
| 3031 | try mod.comp.work_queue.writeItem(.{ .codegen_decl = decl }); | |
| 3129 | 3032 | |
| 3130 | if (decl.is_exported) { | |
| 3131 | const export_src = src; // TODO point to the export token | |
| 3132 | // The scope needs to have the decl in it. | |
| 3133 | try mod.analyzeExport(&block_scope.base, export_src, mem.spanZ(decl.name), decl); | |
| 3033 | if (type_changed and mod.emit_h != null) { | |
| 3034 | try mod.comp.work_queue.writeItem(.{ .emit_h_decl = decl }); | |
| 3134 | 3035 | } |
| 3036 | } | |
| 3135 | 3037 | |
| 3136 | return type_changed; | |
| 3038 | if (decl.is_exported) { | |
| 3039 | const export_src = src; // TODO point to the export token | |
| 3040 | // The scope needs to have the decl in it. | |
| 3041 | try mod.analyzeExport(&block_scope.base, export_src, mem.spanZ(decl.name), decl); | |
| 3137 | 3042 | } |
| 3043 | ||
| 3044 | return type_changed; | |
| 3138 | 3045 | } |
| 3139 | 3046 | |
| 3140 | 3047 | /// Returns the depender's index of the dependee. |
| ... | ... | @@ -3284,7 +3191,7 @@ pub fn scanNamespace( |
| 3284 | 3191 | extra_start: usize, |
| 3285 | 3192 | decls_len: u32, |
| 3286 | 3193 | parent_decl: *Decl, |
| 3287 | ) InnerError!usize { | |
| 3194 | ) SemaError!usize { | |
| 3288 | 3195 | const tracy = trace(@src()); |
| 3289 | 3196 | defer tracy.end(); |
| 3290 | 3197 | |
| ... | ... | @@ -3331,7 +3238,7 @@ const ScanDeclIter = struct { |
| 3331 | 3238 | unnamed_test_index: usize = 0, |
| 3332 | 3239 | }; |
| 3333 | 3240 | |
| 3334 | fn scanDecl(iter: *ScanDeclIter, decl_sub_index: usize, flags: u4) InnerError!void { | |
| 3241 | fn scanDecl(iter: *ScanDeclIter, decl_sub_index: usize, flags: u4) SemaError!void { | |
| 3335 | 3242 | const tracy = trace(@src()); |
| 3336 | 3243 | defer tracy.end(); |
| 3337 | 3244 | |
| ... | ... | @@ -3585,39 +3492,25 @@ fn deleteDeclExports(mod: *Module, decl: *Decl) void { |
| 3585 | 3492 | mod.gpa.free(kv.value); |
| 3586 | 3493 | } |
| 3587 | 3494 | |
| 3588 | pub fn analyzeFnBody(mod: *Module, decl: *Decl, func: *Fn) !void { | |
| 3495 | pub fn analyzeFnBody(mod: *Module, decl: *Decl, func: *Fn) SemaError!Air { | |
| 3589 | 3496 | const tracy = trace(@src()); |
| 3590 | 3497 | defer tracy.end(); |
| 3591 | 3498 | |
| 3499 | const gpa = mod.gpa; | |
| 3500 | ||
| 3592 | 3501 | // Use the Decl's arena for function memory. |
| 3593 | var arena = decl.value_arena.?.promote(mod.gpa); | |
| 3502 | var arena = decl.value_arena.?.promote(gpa); | |
| 3594 | 3503 | defer decl.value_arena.?.* = arena.state; |
| 3595 | 3504 | |
| 3596 | 3505 | const fn_ty = decl.ty; |
| 3597 | const param_inst_list = try mod.gpa.alloc(*ir.Inst, fn_ty.fnParamLen()); | |
| 3598 | defer mod.gpa.free(param_inst_list); | |
| 3599 | ||
| 3600 | for (param_inst_list) |*param_inst, param_index| { | |
| 3601 | const param_type = fn_ty.fnParamType(param_index); | |
| 3602 | const arg_inst = try arena.allocator.create(ir.Inst.Arg); | |
| 3603 | arg_inst.* = .{ | |
| 3604 | .base = .{ | |
| 3605 | .tag = .arg, | |
| 3606 | .ty = param_type, | |
| 3607 | .src = .unneeded, | |
| 3608 | }, | |
| 3609 | .name = undefined, // Set in the semantic analysis of the arg instruction. | |
| 3610 | }; | |
| 3611 | param_inst.* = &arg_inst.base; | |
| 3612 | } | |
| 3613 | ||
| 3614 | const zir = decl.namespace.file_scope.zir; | |
| 3506 | const param_inst_list = try gpa.alloc(Air.Inst.Ref, fn_ty.fnParamLen()); | |
| 3507 | defer gpa.free(param_inst_list); | |
| 3615 | 3508 | |
| 3616 | 3509 | var sema: Sema = .{ |
| 3617 | 3510 | .mod = mod, |
| 3618 | .gpa = mod.gpa, | |
| 3511 | .gpa = gpa, | |
| 3619 | 3512 | .arena = &arena.allocator, |
| 3620 | .code = zir, | |
| 3513 | .code = decl.namespace.file_scope.zir, | |
| 3621 | 3514 | .owner_decl = decl, |
| 3622 | 3515 | .namespace = decl.namespace, |
| 3623 | 3516 | .func = func, |
| ... | ... | @@ -3626,6 +3519,11 @@ pub fn analyzeFnBody(mod: *Module, decl: *Decl, func: *Fn) !void { |
| 3626 | 3519 | }; |
| 3627 | 3520 | defer sema.deinit(); |
| 3628 | 3521 | |
| 3522 | // First few indexes of extra are reserved and set at the end. | |
| 3523 | const reserved_count = @typeInfo(Air.ExtraIndex).Enum.fields.len; | |
| 3524 | try sema.air_extra.ensureTotalCapacity(gpa, reserved_count); | |
| 3525 | sema.air_extra.items.len += reserved_count; | |
| 3526 | ||
| 3629 | 3527 | var inner_block: Scope.Block = .{ |
| 3630 | 3528 | .parent = null, |
| 3631 | 3529 | .sema = &sema, |
| ... | ... | @@ -3634,20 +3532,50 @@ pub fn analyzeFnBody(mod: *Module, decl: *Decl, func: *Fn) !void { |
| 3634 | 3532 | .inlining = null, |
| 3635 | 3533 | .is_comptime = false, |
| 3636 | 3534 | }; |
| 3637 | defer inner_block.instructions.deinit(mod.gpa); | |
| 3535 | defer inner_block.instructions.deinit(gpa); | |
| 3638 | 3536 | |
| 3639 | // AIR currently requires the arg parameters to be the first N instructions | |
| 3640 | try inner_block.instructions.appendSlice(mod.gpa, param_inst_list); | |
| 3537 | // AIR requires the arg parameters to be the first N instructions. | |
| 3538 | try inner_block.instructions.ensureTotalCapacity(gpa, param_inst_list.len); | |
| 3539 | for (param_inst_list) |*param_inst, param_index| { | |
| 3540 | const param_type = fn_ty.fnParamType(param_index); | |
| 3541 | const ty_ref = try sema.addType(param_type); | |
| 3542 | const arg_index = @intCast(u32, sema.air_instructions.len); | |
| 3543 | inner_block.instructions.appendAssumeCapacity(arg_index); | |
| 3544 | param_inst.* = Air.indexToRef(arg_index); | |
| 3545 | try sema.air_instructions.append(gpa, .{ | |
| 3546 | .tag = .arg, | |
| 3547 | .data = .{ | |
| 3548 | .ty_str = .{ | |
| 3549 | .ty = ty_ref, | |
| 3550 | .str = undefined, // Set in the semantic analysis of the arg instruction. | |
| 3551 | }, | |
| 3552 | }, | |
| 3553 | }); | |
| 3554 | } | |
| 3641 | 3555 | |
| 3642 | 3556 | func.state = .in_progress; |
| 3643 | 3557 | log.debug("set {s} to in_progress", .{decl.name}); |
| 3644 | 3558 | |
| 3645 | 3559 | try sema.analyzeFnBody(&inner_block, func.zir_body_inst); |
| 3646 | 3560 | |
| 3647 | const instructions = try arena.allocator.dupe(*ir.Inst, inner_block.instructions.items); | |
| 3561 | // Copy the block into place and mark that as the main block. | |
| 3562 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Block).Struct.fields.len + | |
| 3563 | inner_block.instructions.items.len); | |
| 3564 | const main_block_index = sema.addExtraAssumeCapacity(Air.Block{ | |
| 3565 | .body_len = @intCast(u32, inner_block.instructions.items.len), | |
| 3566 | }); | |
| 3567 | sema.air_extra.appendSliceAssumeCapacity(inner_block.instructions.items); | |
| 3568 | sema.air_extra.items[@enumToInt(Air.ExtraIndex.main_block)] = main_block_index; | |
| 3569 | ||
| 3648 | 3570 | func.state = .success; |
| 3649 | func.body = .{ .instructions = instructions }; | |
| 3650 | 3571 | log.debug("set {s} to success", .{decl.name}); |
| 3572 | ||
| 3573 | return Air{ | |
| 3574 | .instructions = sema.air_instructions.toOwnedSlice(), | |
| 3575 | .extra = sema.air_extra.toOwnedSlice(gpa), | |
| 3576 | .values = sema.air_values.toOwnedSlice(gpa), | |
| 3577 | .variables = sema.air_variables.toOwnedSlice(gpa), | |
| 3578 | }; | |
| 3651 | 3579 | } |
| 3652 | 3580 | |
| 3653 | 3581 | fn markOutdatedDecl(mod: *Module, decl: *Decl) !void { |
| ... | ... | @@ -3801,94 +3729,6 @@ pub fn analyzeExport( |
| 3801 | 3729 | de_gop.value_ptr.*[de_gop.value_ptr.len - 1] = new_export; |
| 3802 | 3730 | errdefer de_gop.value_ptr.* = mod.gpa.shrink(de_gop.value_ptr.*, de_gop.value_ptr.len - 1); |
| 3803 | 3731 | } |
| 3804 | pub fn constInst(mod: *Module, arena: *Allocator, src: LazySrcLoc, typed_value: TypedValue) !*ir.Inst { | |
| 3805 | _ = mod; | |
| 3806 | const const_inst = try arena.create(ir.Inst.Constant); | |
| 3807 | const_inst.* = .{ | |
| 3808 | .base = .{ | |
| 3809 | .tag = ir.Inst.Constant.base_tag, | |
| 3810 | .ty = typed_value.ty, | |
| 3811 | .src = src, | |
| 3812 | }, | |
| 3813 | .val = typed_value.val, | |
| 3814 | }; | |
| 3815 | return &const_inst.base; | |
| 3816 | } | |
| 3817 | ||
| 3818 | pub fn constType(mod: *Module, arena: *Allocator, src: LazySrcLoc, ty: Type) !*ir.Inst { | |
| 3819 | return mod.constInst(arena, src, .{ | |
| 3820 | .ty = Type.initTag(.type), | |
| 3821 | .val = try ty.toValue(arena), | |
| 3822 | }); | |
| 3823 | } | |
| 3824 | ||
| 3825 | pub fn constVoid(mod: *Module, arena: *Allocator, src: LazySrcLoc) !*ir.Inst { | |
| 3826 | return mod.constInst(arena, src, .{ | |
| 3827 | .ty = Type.initTag(.void), | |
| 3828 | .val = Value.initTag(.void_value), | |
| 3829 | }); | |
| 3830 | } | |
| 3831 | ||
| 3832 | pub fn constNoReturn(mod: *Module, arena: *Allocator, src: LazySrcLoc) !*ir.Inst { | |
| 3833 | return mod.constInst(arena, src, .{ | |
| 3834 | .ty = Type.initTag(.noreturn), | |
| 3835 | .val = Value.initTag(.unreachable_value), | |
| 3836 | }); | |
| 3837 | } | |
| 3838 | ||
| 3839 | pub fn constUndef(mod: *Module, arena: *Allocator, src: LazySrcLoc, ty: Type) !*ir.Inst { | |
| 3840 | return mod.constInst(arena, src, .{ | |
| 3841 | .ty = ty, | |
| 3842 | .val = Value.initTag(.undef), | |
| 3843 | }); | |
| 3844 | } | |
| 3845 | ||
| 3846 | pub fn constBool(mod: *Module, arena: *Allocator, src: LazySrcLoc, v: bool) !*ir.Inst { | |
| 3847 | return mod.constInst(arena, src, .{ | |
| 3848 | .ty = Type.initTag(.bool), | |
| 3849 | .val = ([2]Value{ Value.initTag(.bool_false), Value.initTag(.bool_true) })[@boolToInt(v)], | |
| 3850 | }); | |
| 3851 | } | |
| 3852 | ||
| 3853 | pub fn constIntUnsigned(mod: *Module, arena: *Allocator, src: LazySrcLoc, ty: Type, int: u64) !*ir.Inst { | |
| 3854 | return mod.constInst(arena, src, .{ | |
| 3855 | .ty = ty, | |
| 3856 | .val = try Value.Tag.int_u64.create(arena, int), | |
| 3857 | }); | |
| 3858 | } | |
| 3859 | ||
| 3860 | pub fn constIntSigned(mod: *Module, arena: *Allocator, src: LazySrcLoc, ty: Type, int: i64) !*ir.Inst { | |
| 3861 | return mod.constInst(arena, src, .{ | |
| 3862 | .ty = ty, | |
| 3863 | .val = try Value.Tag.int_i64.create(arena, int), | |
| 3864 | }); | |
| 3865 | } | |
| 3866 | ||
| 3867 | pub fn constIntBig(mod: *Module, arena: *Allocator, src: LazySrcLoc, ty: Type, big_int: BigIntConst) !*ir.Inst { | |
| 3868 | if (big_int.positive) { | |
| 3869 | if (big_int.to(u64)) |x| { | |
| 3870 | return mod.constIntUnsigned(arena, src, ty, x); | |
| 3871 | } else |err| switch (err) { | |
| 3872 | error.NegativeIntoUnsigned => unreachable, | |
| 3873 | error.TargetTooSmall => {}, // handled below | |
| 3874 | } | |
| 3875 | return mod.constInst(arena, src, .{ | |
| 3876 | .ty = ty, | |
| 3877 | .val = try Value.Tag.int_big_positive.create(arena, big_int.limbs), | |
| 3878 | }); | |
| 3879 | } else { | |
| 3880 | if (big_int.to(i64)) |x| { | |
| 3881 | return mod.constIntSigned(arena, src, ty, x); | |
| 3882 | } else |err| switch (err) { | |
| 3883 | error.NegativeIntoUnsigned => unreachable, | |
| 3884 | error.TargetTooSmall => {}, // handled below | |
| 3885 | } | |
| 3886 | return mod.constInst(arena, src, .{ | |
| 3887 | .ty = ty, | |
| 3888 | .val = try Value.Tag.int_big_negative.create(arena, big_int.limbs), | |
| 3889 | }); | |
| 3890 | } | |
| 3891 | } | |
| 3892 | 3732 | |
| 3893 | 3733 | pub fn deleteAnonDecl(mod: *Module, scope: *Scope, decl: *Decl) void { |
| 3894 | 3734 | const scope_decl = scope.ownerDecl().?; |
| ... | ... | @@ -4006,7 +3846,7 @@ pub fn fail( |
| 4006 | 3846 | src: LazySrcLoc, |
| 4007 | 3847 | comptime format: []const u8, |
| 4008 | 3848 | args: anytype, |
| 4009 | ) InnerError { | |
| 3849 | ) CompileError { | |
| 4010 | 3850 | const err_msg = try mod.errMsg(scope, src, format, args); |
| 4011 | 3851 | return mod.failWithOwnedErrorMsg(scope, err_msg); |
| 4012 | 3852 | } |
| ... | ... | @@ -4019,7 +3859,7 @@ pub fn failTok( |
| 4019 | 3859 | token_index: ast.TokenIndex, |
| 4020 | 3860 | comptime format: []const u8, |
| 4021 | 3861 | args: anytype, |
| 4022 | ) InnerError { | |
| 3862 | ) CompileError { | |
| 4023 | 3863 | const src = scope.srcDecl().?.tokSrcLoc(token_index); |
| 4024 | 3864 | return mod.fail(scope, src, format, args); |
| 4025 | 3865 | } |
| ... | ... | @@ -4032,18 +3872,21 @@ pub fn failNode( |
| 4032 | 3872 | node_index: ast.Node.Index, |
| 4033 | 3873 | comptime format: []const u8, |
| 4034 | 3874 | args: anytype, |
| 4035 | ) InnerError { | |
| 3875 | ) CompileError { | |
| 4036 | 3876 | const src = scope.srcDecl().?.nodeSrcLoc(node_index); |
| 4037 | 3877 | return mod.fail(scope, src, format, args); |
| 4038 | 3878 | } |
| 4039 | 3879 | |
| 4040 | pub fn failWithOwnedErrorMsg(mod: *Module, scope: *Scope, err_msg: *ErrorMsg) InnerError { | |
| 3880 | pub fn failWithOwnedErrorMsg(mod: *Module, scope: *Scope, err_msg: *ErrorMsg) CompileError { | |
| 4041 | 3881 | @setCold(true); |
| 4042 | 3882 | |
| 4043 | 3883 | { |
| 4044 | 3884 | errdefer err_msg.destroy(mod.gpa); |
| 4045 | try mod.failed_decls.ensureCapacity(mod.gpa, mod.failed_decls.count() + 1); | |
| 4046 | try mod.failed_files.ensureCapacity(mod.gpa, mod.failed_files.count() + 1); | |
| 3885 | if (err_msg.src_loc.lazy == .unneeded) { | |
| 3886 | return error.NeededSourceLocation; | |
| 3887 | } | |
| 3888 | try mod.failed_decls.ensureUnusedCapacity(mod.gpa, 1); | |
| 3889 | try mod.failed_files.ensureUnusedCapacity(mod.gpa, 1); | |
| 4047 | 3890 | } |
| 4048 | 3891 | switch (scope.tag) { |
| 4049 | 3892 | .block => { |
| ... | ... | @@ -4301,13 +4144,11 @@ pub fn floatMul( |
| 4301 | 4144 | } |
| 4302 | 4145 | |
| 4303 | 4146 | pub fn simplePtrType( |
| 4304 | mod: *Module, | |
| 4305 | 4147 | arena: *Allocator, |
| 4306 | 4148 | elem_ty: Type, |
| 4307 | 4149 | mutable: bool, |
| 4308 | 4150 | size: std.builtin.TypeInfo.Pointer.Size, |
| 4309 | 4151 | ) Allocator.Error!Type { |
| 4310 | _ = mod; | |
| 4311 | 4152 | if (!mutable and size == .Slice and elem_ty.eql(Type.initTag(.u8))) { |
| 4312 | 4153 | return Type.initTag(.const_slice_u8); |
| 4313 | 4154 | } |
| ... | ... | @@ -4424,38 +4265,6 @@ pub fn errorUnionType( |
| 4424 | 4265 | }); |
| 4425 | 4266 | } |
| 4426 | 4267 | |
| 4427 | pub fn dumpInst(mod: *Module, scope: *Scope, inst: *ir.Inst) void { | |
| 4428 | const zir_module = scope.namespace(); | |
| 4429 | const source = zir_module.getSource(mod) catch @panic("dumpInst failed to get source"); | |
| 4430 | const loc = std.zig.findLineColumn(source, inst.src); | |
| 4431 | if (inst.tag == .constant) { | |
| 4432 | std.debug.print("constant ty={} val={} src={s}:{d}:{d}\n", .{ | |
| 4433 | inst.ty, | |
| 4434 | inst.castTag(.constant).?.val, | |
| 4435 | zir_module.subFilePath(), | |
| 4436 | loc.line + 1, | |
| 4437 | loc.column + 1, | |
| 4438 | }); | |
| 4439 | } else if (inst.deaths == 0) { | |
| 4440 | std.debug.print("{s} ty={} src={s}:{d}:{d}\n", .{ | |
| 4441 | @tagName(inst.tag), | |
| 4442 | inst.ty, | |
| 4443 | zir_module.subFilePath(), | |
| 4444 | loc.line + 1, | |
| 4445 | loc.column + 1, | |
| 4446 | }); | |
| 4447 | } else { | |
| 4448 | std.debug.print("{s} ty={} deaths={b} src={s}:{d}:{d}\n", .{ | |
| 4449 | @tagName(inst.tag), | |
| 4450 | inst.ty, | |
| 4451 | inst.deaths, | |
| 4452 | zir_module.subFilePath(), | |
| 4453 | loc.line + 1, | |
| 4454 | loc.column + 1, | |
| 4455 | }); | |
| 4456 | } | |
| 4457 | } | |
| 4458 | ||
| 4459 | 4268 | pub fn getTarget(mod: Module) Target { |
| 4460 | 4269 | return mod.comp.bin_file.options.target; |
| 4461 | 4270 | } |
| ... | ... | @@ -4576,7 +4385,7 @@ pub const SwitchProngSrc = union(enum) { |
| 4576 | 4385 | } |
| 4577 | 4386 | }; |
| 4578 | 4387 | |
| 4579 | pub fn analyzeStructFields(mod: *Module, struct_obj: *Struct) InnerError!void { | |
| 4388 | pub fn analyzeStructFields(mod: *Module, struct_obj: *Struct) CompileError!void { | |
| 4580 | 4389 | const tracy = trace(@src()); |
| 4581 | 4390 | defer tracy.end(); |
| 4582 | 4391 | |
| ... | ... | @@ -4726,7 +4535,7 @@ pub fn analyzeStructFields(mod: *Module, struct_obj: *Struct) InnerError!void { |
| 4726 | 4535 | } |
| 4727 | 4536 | } |
| 4728 | 4537 | |
| 4729 | pub fn analyzeUnionFields(mod: *Module, union_obj: *Union) InnerError!void { | |
| 4538 | pub fn analyzeUnionFields(mod: *Module, union_obj: *Union) CompileError!void { | |
| 4730 | 4539 | const tracy = trace(@src()); |
| 4731 | 4540 | defer tracy.end(); |
| 4732 | 4541 |
src/Sema.zig+1755-1461
| ... | ... | @@ -1,6 +1,6 @@ |
| 1 | 1 | //! Semantic analysis of ZIR instructions. |
| 2 | 2 | //! Shared to every Block. Stored on the stack. |
| 3 | //! State used for compiling a `Zir` into AIR. | |
| 3 | //! State used for compiling a ZIR into AIR. | |
| 4 | 4 | //! Transforms untyped ZIR instructions into semantically-analyzed AIR instructions. |
| 5 | 5 | //! Does type checking, comptime control flow, and safety-check generation. |
| 6 | 6 | //! This is the the heart of the Zig compiler. |
| ... | ... | @@ -11,6 +11,10 @@ gpa: *Allocator, |
| 11 | 11 | /// Points to the arena allocator of the Decl. |
| 12 | 12 | arena: *Allocator, |
| 13 | 13 | code: Zir, |
| 14 | air_instructions: std.MultiArrayList(Air.Inst) = .{}, | |
| 15 | air_extra: std.ArrayListUnmanaged(u32) = .{}, | |
| 16 | air_values: std.ArrayListUnmanaged(Value) = .{}, | |
| 17 | air_variables: std.ArrayListUnmanaged(*Module.Var) = .{}, | |
| 14 | 18 | /// Maps ZIR to AIR. |
| 15 | 19 | inst_map: InstMap = .{}, |
| 16 | 20 | /// When analyzing an inline function call, owner_decl is the Decl of the caller |
| ... | ... | @@ -32,7 +36,7 @@ func: ?*Module.Fn, |
| 32 | 36 | /// > Denormalized data to make `resolveInst` faster. This is 0 if not inside a function, |
| 33 | 37 | /// > otherwise it is the number of parameters of the function. |
| 34 | 38 | /// > param_count: u32 |
| 35 | param_inst_list: []const *ir.Inst, | |
| 39 | param_inst_list: []const Air.Inst.Ref, | |
| 36 | 40 | branch_quota: u32 = 1000, |
| 37 | 41 | branch_count: u32 = 0, |
| 38 | 42 | /// This field is updated when a new source location becomes active, so that |
| ... | ... | @@ -41,6 +45,7 @@ branch_count: u32 = 0, |
| 41 | 45 | /// contain a mapped source location. |
| 42 | 46 | src: LazySrcLoc = .{ .token_offset = 0 }, |
| 43 | 47 | next_arg_index: usize = 0, |
| 48 | decl_val_table: std.AutoHashMapUnmanaged(*Decl, Air.Inst.Ref) = .{}, | |
| 44 | 49 | |
| 45 | 50 | const std = @import("std"); |
| 46 | 51 | const mem = std.mem; |
| ... | ... | @@ -52,23 +57,28 @@ const Sema = @This(); |
| 52 | 57 | const Value = @import("value.zig").Value; |
| 53 | 58 | const Type = @import("type.zig").Type; |
| 54 | 59 | const TypedValue = @import("TypedValue.zig"); |
| 55 | const ir = @import("air.zig"); | |
| 60 | const Air = @import("Air.zig"); | |
| 56 | 61 | const Zir = @import("Zir.zig"); |
| 57 | 62 | const Module = @import("Module.zig"); |
| 58 | const Inst = ir.Inst; | |
| 59 | const Body = ir.Body; | |
| 60 | 63 | const trace = @import("tracy.zig").trace; |
| 61 | 64 | const Scope = Module.Scope; |
| 62 | const InnerError = Module.InnerError; | |
| 65 | const CompileError = Module.CompileError; | |
| 66 | const SemaError = Module.SemaError; | |
| 63 | 67 | const Decl = Module.Decl; |
| 64 | 68 | const LazySrcLoc = Module.LazySrcLoc; |
| 65 | 69 | const RangeSet = @import("RangeSet.zig"); |
| 66 | 70 | const target_util = @import("target.zig"); |
| 67 | 71 | |
| 68 | pub const InstMap = std.AutoHashMapUnmanaged(Zir.Inst.Index, *ir.Inst); | |
| 72 | pub const InstMap = std.AutoHashMapUnmanaged(Zir.Inst.Index, Air.Inst.Ref); | |
| 69 | 73 | |
| 70 | 74 | pub fn deinit(sema: *Sema) void { |
| 71 | sema.inst_map.deinit(sema.gpa); | |
| 75 | const gpa = sema.gpa; | |
| 76 | sema.air_instructions.deinit(gpa); | |
| 77 | sema.air_extra.deinit(gpa); | |
| 78 | sema.air_values.deinit(gpa); | |
| 79 | sema.air_variables.deinit(gpa); | |
| 80 | sema.inst_map.deinit(gpa); | |
| 81 | sema.decl_val_table.deinit(gpa); | |
| 72 | 82 | sema.* = undefined; |
| 73 | 83 | } |
| 74 | 84 | |
| ... | ... | @@ -76,7 +86,7 @@ pub fn analyzeFnBody( |
| 76 | 86 | sema: *Sema, |
| 77 | 87 | block: *Scope.Block, |
| 78 | 88 | fn_body_inst: Zir.Inst.Index, |
| 79 | ) InnerError!void { | |
| 89 | ) SemaError!void { | |
| 80 | 90 | const tags = sema.code.instructions.items(.tag); |
| 81 | 91 | const datas = sema.code.instructions.items(.data); |
| 82 | 92 | const body: []const Zir.Inst.Index = switch (tags[fn_body_inst]) { |
| ... | ... | @@ -102,13 +112,16 @@ pub fn analyzeFnBody( |
| 102 | 112 | }, |
| 103 | 113 | else => unreachable, |
| 104 | 114 | }; |
| 105 | _ = try sema.analyzeBody(block, body); | |
| 115 | _ = sema.analyzeBody(block, body) catch |err| switch (err) { | |
| 116 | error.NeededSourceLocation => unreachable, | |
| 117 | else => |e| return e, | |
| 118 | }; | |
| 106 | 119 | } |
| 107 | 120 | |
| 108 | 121 | /// Returns only the result from the body that is specified. |
| 109 | 122 | /// Only appropriate to call when it is determined at comptime that this body |
| 110 | 123 | /// has no peers. |
| 111 | fn resolveBody(sema: *Sema, block: *Scope.Block, body: []const Zir.Inst.Index) InnerError!*Inst { | |
| 124 | fn resolveBody(sema: *Sema, block: *Scope.Block, body: []const Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 112 | 125 | const break_inst = try sema.analyzeBody(block, body); |
| 113 | 126 | const operand_ref = sema.code.instructions.items(.data)[break_inst].@"break".operand; |
| 114 | 127 | return sema.resolveInst(operand_ref); |
| ... | ... | @@ -118,7 +131,7 @@ fn resolveBody(sema: *Sema, block: *Scope.Block, body: []const Zir.Inst.Index) I |
| 118 | 131 | /// return type of `analyzeBody` so that we can tail call them. |
| 119 | 132 | /// Only appropriate to return when the instruction is known to be NoReturn |
| 120 | 133 | /// solely based on the ZIR tag. |
| 121 | const always_noreturn: InnerError!Zir.Inst.Index = @as(Zir.Inst.Index, undefined); | |
| 134 | const always_noreturn: CompileError!Zir.Inst.Index = @as(Zir.Inst.Index, undefined); | |
| 122 | 135 | |
| 123 | 136 | /// This function is the main loop of `Sema` and it can be used in two different ways: |
| 124 | 137 | /// * The traditional way where there are N breaks out of the block and peer type |
| ... | ... | @@ -133,7 +146,7 @@ pub fn analyzeBody( |
| 133 | 146 | sema: *Sema, |
| 134 | 147 | block: *Scope.Block, |
| 135 | 148 | body: []const Zir.Inst.Index, |
| 136 | ) InnerError!Zir.Inst.Index { | |
| 149 | ) CompileError!Zir.Inst.Index { | |
| 137 | 150 | // No tracy calls here, to avoid interfering with the tail call mechanism. |
| 138 | 151 | |
| 139 | 152 | const map = &block.sema.inst_map; |
| ... | ... | @@ -149,7 +162,7 @@ pub fn analyzeBody( |
| 149 | 162 | var i: usize = 0; |
| 150 | 163 | while (true) { |
| 151 | 164 | const inst = body[i]; |
| 152 | const air_inst = switch (tags[inst]) { | |
| 165 | const air_inst: Air.Inst.Ref = switch (tags[inst]) { | |
| 153 | 166 | // zig fmt: off |
| 154 | 167 | .arg => try sema.zirArg(block, inst), |
| 155 | 168 | .alloc => try sema.zirAlloc(block, inst), |
| ... | ... | @@ -174,8 +187,6 @@ pub fn analyzeBody( |
| 174 | 187 | .block => try sema.zirBlock(block, inst), |
| 175 | 188 | .suspend_block => try sema.zirSuspendBlock(block, inst), |
| 176 | 189 | .bool_not => try sema.zirBoolNot(block, inst), |
| 177 | .bool_and => try sema.zirBoolOp(block, inst, false), | |
| 178 | .bool_or => try sema.zirBoolOp(block, inst, true), | |
| 179 | 190 | .bool_br_and => try sema.zirBoolBr(block, inst, false), |
| 180 | 191 | .bool_br_or => try sema.zirBoolBr(block, inst, true), |
| 181 | 192 | .c_import => try sema.zirCImport(block, inst), |
| ... | ... | @@ -504,7 +515,7 @@ pub fn analyzeBody( |
| 504 | 515 | const break_inst = try sema.analyzeBody(block, inline_body); |
| 505 | 516 | const break_data = datas[break_inst].@"break"; |
| 506 | 517 | if (inst == break_data.block_inst) { |
| 507 | break :blk try sema.resolveInst(break_data.operand); | |
| 518 | break :blk sema.resolveInst(break_data.operand); | |
| 508 | 519 | } else { |
| 509 | 520 | return break_inst; |
| 510 | 521 | } |
| ... | ... | @@ -520,20 +531,20 @@ pub fn analyzeBody( |
| 520 | 531 | const break_inst = try sema.analyzeBody(block, inline_body); |
| 521 | 532 | const break_data = datas[break_inst].@"break"; |
| 522 | 533 | if (inst == break_data.block_inst) { |
| 523 | break :blk try sema.resolveInst(break_data.operand); | |
| 534 | break :blk sema.resolveInst(break_data.operand); | |
| 524 | 535 | } else { |
| 525 | 536 | return break_inst; |
| 526 | 537 | } |
| 527 | 538 | }, |
| 528 | 539 | }; |
| 529 | if (air_inst.ty.isNoReturn()) | |
| 540 | if (sema.typeOf(air_inst).isNoReturn()) | |
| 530 | 541 | return always_noreturn; |
| 531 | 542 | try map.put(sema.gpa, inst, air_inst); |
| 532 | 543 | i += 1; |
| 533 | 544 | } |
| 534 | 545 | } |
| 535 | 546 | |
| 536 | fn zirExtended(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 547 | fn zirExtended(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 537 | 548 | const extended = sema.code.instructions.items(.data)[inst].extended; |
| 538 | 549 | switch (extended.opcode) { |
| 539 | 550 | // zig fmt: off |
| ... | ... | @@ -552,7 +563,7 @@ fn zirExtended(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 552 | 563 | .frame_address => return sema.zirFrameAddress( block, extended), |
| 553 | 564 | .alloc => return sema.zirAllocExtended( block, extended), |
| 554 | 565 | .builtin_extern => return sema.zirBuiltinExtern( block, extended), |
| 555 | .@"asm" => return sema.zirAsm( block, extended), | |
| 566 | .@"asm" => return sema.zirAsm( block, extended, inst), | |
| 556 | 567 | .typeof_peer => return sema.zirTypeofPeer( block, extended), |
| 557 | 568 | .compile_log => return sema.zirCompileLog( block, extended), |
| 558 | 569 | .add_with_overflow => return sema.zirOverflowArithmetic(block, extended), |
| ... | ... | @@ -568,18 +579,13 @@ fn zirExtended(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 568 | 579 | } |
| 569 | 580 | } |
| 570 | 581 | |
| 571 | /// TODO when we rework AIR memory layout, this function will no longer have a possible error. | |
| 572 | pub fn resolveInst(sema: *Sema, zir_ref: Zir.Inst.Ref) error{OutOfMemory}!*ir.Inst { | |
| 582 | pub fn resolveInst(sema: *Sema, zir_ref: Zir.Inst.Ref) Air.Inst.Ref { | |
| 573 | 583 | var i: usize = @enumToInt(zir_ref); |
| 574 | 584 | |
| 575 | 585 | // First section of indexes correspond to a set number of constant values. |
| 576 | 586 | if (i < Zir.Inst.Ref.typed_value_map.len) { |
| 577 | // TODO when we rework AIR memory layout, this function can be as simple as: | |
| 578 | // if (zir_ref < Zir.const_inst_list.len + sema.param_count) | |
| 579 | // return zir_ref; | |
| 580 | // Until then we allocate memory for a new, mutable `ir.Inst` to match what | |
| 581 | // AIR expects. | |
| 582 | return sema.mod.constInst(sema.arena, .unneeded, Zir.Inst.Ref.typed_value_map[i]); | |
| 587 | // We intentionally map the same indexes to the same values between ZIR and AIR. | |
| 588 | return zir_ref; | |
| 583 | 589 | } |
| 584 | 590 | i -= Zir.Inst.Ref.typed_value_map.len; |
| 585 | 591 | |
| ... | ... | @@ -593,7 +599,7 @@ fn resolveConstBool( |
| 593 | 599 | src: LazySrcLoc, |
| 594 | 600 | zir_ref: Zir.Inst.Ref, |
| 595 | 601 | ) !bool { |
| 596 | const air_inst = try sema.resolveInst(zir_ref); | |
| 602 | const air_inst = sema.resolveInst(zir_ref); | |
| 597 | 603 | const wanted_type = Type.initTag(.bool); |
| 598 | 604 | const coerced_inst = try sema.coerce(block, wanted_type, air_inst, src); |
| 599 | 605 | const val = try sema.resolveConstValue(block, src, coerced_inst); |
| ... | ... | @@ -606,7 +612,7 @@ fn resolveConstString( |
| 606 | 612 | src: LazySrcLoc, |
| 607 | 613 | zir_ref: Zir.Inst.Ref, |
| 608 | 614 | ) ![]u8 { |
| 609 | const air_inst = try sema.resolveInst(zir_ref); | |
| 615 | const air_inst = sema.resolveInst(zir_ref); | |
| 610 | 616 | const wanted_type = Type.initTag(.const_slice_u8); |
| 611 | 617 | const coerced_inst = try sema.coerce(block, wanted_type, air_inst, src); |
| 612 | 618 | const val = try sema.resolveConstValue(block, src, coerced_inst); |
| ... | ... | @@ -614,24 +620,39 @@ fn resolveConstString( |
| 614 | 620 | } |
| 615 | 621 | |
| 616 | 622 | pub fn resolveType(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, zir_ref: Zir.Inst.Ref) !Type { |
| 617 | const air_inst = try sema.resolveInst(zir_ref); | |
| 618 | return sema.resolveAirAsType(block, src, air_inst); | |
| 623 | const air_inst = sema.resolveInst(zir_ref); | |
| 624 | return sema.analyzeAsType(block, src, air_inst); | |
| 619 | 625 | } |
| 620 | 626 | |
| 621 | fn resolveAirAsType(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, air_inst: *ir.Inst) !Type { | |
| 627 | fn analyzeAsType( | |
| 628 | sema: *Sema, | |
| 629 | block: *Scope.Block, | |
| 630 | src: LazySrcLoc, | |
| 631 | air_inst: Air.Inst.Ref, | |
| 632 | ) !Type { | |
| 622 | 633 | const wanted_type = Type.initTag(.@"type"); |
| 623 | 634 | const coerced_inst = try sema.coerce(block, wanted_type, air_inst, src); |
| 624 | 635 | const val = try sema.resolveConstValue(block, src, coerced_inst); |
| 625 | 636 | return val.toType(sema.arena); |
| 626 | 637 | } |
| 627 | 638 | |
| 628 | fn resolveConstValue(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, base: *ir.Inst) !Value { | |
| 629 | return (try sema.resolveDefinedValue(block, src, base)) orelse | |
| 639 | fn resolveConstValue( | |
| 640 | sema: *Sema, | |
| 641 | block: *Scope.Block, | |
| 642 | src: LazySrcLoc, | |
| 643 | air_ref: Air.Inst.Ref, | |
| 644 | ) CompileError!Value { | |
| 645 | return (try sema.resolveDefinedValue(block, src, air_ref)) orelse | |
| 630 | 646 | return sema.failWithNeededComptime(block, src); |
| 631 | 647 | } |
| 632 | 648 | |
| 633 | fn resolveDefinedValue(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, base: *ir.Inst) !?Value { | |
| 634 | if (try sema.resolvePossiblyUndefinedValue(block, src, base)) |val| { | |
| 649 | fn resolveDefinedValue( | |
| 650 | sema: *Sema, | |
| 651 | block: *Scope.Block, | |
| 652 | src: LazySrcLoc, | |
| 653 | air_ref: Air.Inst.Ref, | |
| 654 | ) CompileError!?Value { | |
| 655 | if (try sema.resolvePossiblyUndefinedValue(block, src, air_ref)) |val| { | |
| 635 | 656 | if (val.isUndef()) { |
| 636 | 657 | return sema.failWithUseOfUndef(block, src); |
| 637 | 658 | } |
| ... | ... | @@ -644,20 +665,36 @@ fn resolvePossiblyUndefinedValue( |
| 644 | 665 | sema: *Sema, |
| 645 | 666 | block: *Scope.Block, |
| 646 | 667 | src: LazySrcLoc, |
| 647 | base: *ir.Inst, | |
| 648 | ) !?Value { | |
| 649 | if (try sema.typeHasOnePossibleValue(block, src, base.ty)) |opv| { | |
| 668 | inst: Air.Inst.Ref, | |
| 669 | ) CompileError!?Value { | |
| 670 | // First section of indexes correspond to a set number of constant values. | |
| 671 | var i: usize = @enumToInt(inst); | |
| 672 | if (i < Air.Inst.Ref.typed_value_map.len) { | |
| 673 | return Air.Inst.Ref.typed_value_map[i].val; | |
| 674 | } | |
| 675 | i -= Air.Inst.Ref.typed_value_map.len; | |
| 676 | ||
| 677 | if (try sema.typeHasOnePossibleValue(block, src, sema.typeOf(inst))) |opv| { | |
| 650 | 678 | return opv; |
| 651 | 679 | } |
| 652 | const inst = base.castTag(.constant) orelse return null; | |
| 653 | return inst.val; | |
| 680 | ||
| 681 | switch (sema.air_instructions.items(.tag)[i]) { | |
| 682 | .constant => { | |
| 683 | const ty_pl = sema.air_instructions.items(.data)[i].ty_pl; | |
| 684 | return sema.air_values.items[ty_pl.payload]; | |
| 685 | }, | |
| 686 | .const_ty => { | |
| 687 | return try sema.air_instructions.items(.data)[i].ty.toValue(sema.arena); | |
| 688 | }, | |
| 689 | else => return null, | |
| 690 | } | |
| 654 | 691 | } |
| 655 | 692 | |
| 656 | fn failWithNeededComptime(sema: *Sema, block: *Scope.Block, src: LazySrcLoc) InnerError { | |
| 693 | fn failWithNeededComptime(sema: *Sema, block: *Scope.Block, src: LazySrcLoc) CompileError { | |
| 657 | 694 | return sema.mod.fail(&block.base, src, "unable to resolve comptime value", .{}); |
| 658 | 695 | } |
| 659 | 696 | |
| 660 | fn failWithUseOfUndef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc) InnerError { | |
| 697 | fn failWithUseOfUndef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc) CompileError { | |
| 661 | 698 | return sema.mod.fail(&block.base, src, "use of undefined value here causes undefined behavior", .{}); |
| 662 | 699 | } |
| 663 | 700 | |
| ... | ... | @@ -672,7 +709,7 @@ fn resolveAlreadyCoercedInt( |
| 672 | 709 | comptime Int: type, |
| 673 | 710 | ) !Int { |
| 674 | 711 | comptime assert(@typeInfo(Int).Int.bits <= 64); |
| 675 | const air_inst = try sema.resolveInst(zir_ref); | |
| 712 | const air_inst = sema.resolveInst(zir_ref); | |
| 676 | 713 | const val = try sema.resolveConstValue(block, src, air_inst); |
| 677 | 714 | switch (@typeInfo(Int).Int.signedness) { |
| 678 | 715 | .signed => return @intCast(Int, val.toSignedInt()), |
| ... | ... | @@ -687,7 +724,7 @@ fn resolveInt( |
| 687 | 724 | zir_ref: Zir.Inst.Ref, |
| 688 | 725 | dest_type: Type, |
| 689 | 726 | ) !u64 { |
| 690 | const air_inst = try sema.resolveInst(zir_ref); | |
| 727 | const air_inst = sema.resolveInst(zir_ref); | |
| 691 | 728 | const coerced = try sema.coerce(block, dest_type, air_inst, src); |
| 692 | 729 | const val = try sema.resolveConstValue(block, src, coerced); |
| 693 | 730 | |
| ... | ... | @@ -699,22 +736,22 @@ pub fn resolveInstConst( |
| 699 | 736 | block: *Scope.Block, |
| 700 | 737 | src: LazySrcLoc, |
| 701 | 738 | zir_ref: Zir.Inst.Ref, |
| 702 | ) InnerError!TypedValue { | |
| 703 | const air_inst = try sema.resolveInst(zir_ref); | |
| 704 | const val = try sema.resolveConstValue(block, src, air_inst); | |
| 739 | ) CompileError!TypedValue { | |
| 740 | const air_ref = sema.resolveInst(zir_ref); | |
| 741 | const val = try sema.resolveConstValue(block, src, air_ref); | |
| 705 | 742 | return TypedValue{ |
| 706 | .ty = air_inst.ty, | |
| 743 | .ty = sema.typeOf(air_ref), | |
| 707 | 744 | .val = val, |
| 708 | 745 | }; |
| 709 | 746 | } |
| 710 | 747 | |
| 711 | fn zirBitcastResultPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 748 | fn zirBitcastResultPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 712 | 749 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 713 | 750 | const src = inst_data.src(); |
| 714 | 751 | return sema.mod.fail(&block.base, src, "TODO implement zir_sema.zirBitcastResultPtr", .{}); |
| 715 | 752 | } |
| 716 | 753 | |
| 717 | fn zirCoerceResultPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 754 | fn zirCoerceResultPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 718 | 755 | _ = inst; |
| 719 | 756 | const tracy = trace(@src()); |
| 720 | 757 | defer tracy.end(); |
| ... | ... | @@ -726,7 +763,7 @@ pub fn analyzeStructDecl( |
| 726 | 763 | new_decl: *Decl, |
| 727 | 764 | inst: Zir.Inst.Index, |
| 728 | 765 | struct_obj: *Module.Struct, |
| 729 | ) InnerError!void { | |
| 766 | ) SemaError!void { | |
| 730 | 767 | const extended = sema.code.instructions.items(.data)[inst].extended; |
| 731 | 768 | assert(extended.opcode == .struct_decl); |
| 732 | 769 | const small = @bitCast(Zir.Inst.StructDecl.Small, extended.small); |
| ... | ... | @@ -749,7 +786,7 @@ fn zirStructDecl( |
| 749 | 786 | block: *Scope.Block, |
| 750 | 787 | extended: Zir.Inst.Extended.InstData, |
| 751 | 788 | inst: Zir.Inst.Index, |
| 752 | ) InnerError!*Inst { | |
| 789 | ) CompileError!Air.Inst.Ref { | |
| 753 | 790 | const small = @bitCast(Zir.Inst.StructDecl.Small, extended.small); |
| 754 | 791 | const src: LazySrcLoc = if (small.has_src_node) blk: { |
| 755 | 792 | const node_offset = @bitCast(i32, sema.code.extra[extended.operand]); |
| ... | ... | @@ -820,7 +857,7 @@ fn zirEnumDecl( |
| 820 | 857 | sema: *Sema, |
| 821 | 858 | block: *Scope.Block, |
| 822 | 859 | extended: Zir.Inst.Extended.InstData, |
| 823 | ) InnerError!*Inst { | |
| 860 | ) CompileError!Air.Inst.Ref { | |
| 824 | 861 | const tracy = trace(@src()); |
| 825 | 862 | defer tracy.end(); |
| 826 | 863 | |
| ... | ... | @@ -1017,7 +1054,7 @@ fn zirUnionDecl( |
| 1017 | 1054 | block: *Scope.Block, |
| 1018 | 1055 | extended: Zir.Inst.Extended.InstData, |
| 1019 | 1056 | inst: Zir.Inst.Index, |
| 1020 | ) InnerError!*Inst { | |
| 1057 | ) CompileError!Air.Inst.Ref { | |
| 1021 | 1058 | const tracy = trace(@src()); |
| 1022 | 1059 | defer tracy.end(); |
| 1023 | 1060 | |
| ... | ... | @@ -1081,7 +1118,7 @@ fn zirOpaqueDecl( |
| 1081 | 1118 | block: *Scope.Block, |
| 1082 | 1119 | inst: Zir.Inst.Index, |
| 1083 | 1120 | name_strategy: Zir.Inst.NameStrategy, |
| 1084 | ) InnerError!*Inst { | |
| 1121 | ) CompileError!Air.Inst.Ref { | |
| 1085 | 1122 | const tracy = trace(@src()); |
| 1086 | 1123 | defer tracy.end(); |
| 1087 | 1124 | |
| ... | ... | @@ -1101,7 +1138,7 @@ fn zirErrorSetDecl( |
| 1101 | 1138 | block: *Scope.Block, |
| 1102 | 1139 | inst: Zir.Inst.Index, |
| 1103 | 1140 | name_strategy: Zir.Inst.NameStrategy, |
| 1104 | ) InnerError!*Inst { | |
| 1141 | ) CompileError!Air.Inst.Ref { | |
| 1105 | 1142 | const tracy = trace(@src()); |
| 1106 | 1143 | defer tracy.end(); |
| 1107 | 1144 | |
| ... | ... | @@ -1141,7 +1178,7 @@ fn zirRetPtr( |
| 1141 | 1178 | sema: *Sema, |
| 1142 | 1179 | block: *Scope.Block, |
| 1143 | 1180 | extended: Zir.Inst.Extended.InstData, |
| 1144 | ) InnerError!*Inst { | |
| 1181 | ) CompileError!Air.Inst.Ref { | |
| 1145 | 1182 | const tracy = trace(@src()); |
| 1146 | 1183 | defer tracy.end(); |
| 1147 | 1184 | |
| ... | ... | @@ -1149,16 +1186,16 @@ fn zirRetPtr( |
| 1149 | 1186 | try sema.requireFunctionBlock(block, src); |
| 1150 | 1187 | const fn_ty = sema.func.?.owner_decl.ty; |
| 1151 | 1188 | const ret_type = fn_ty.fnReturnType(); |
| 1152 | const ptr_type = try sema.mod.simplePtrType(sema.arena, ret_type, true, .One); | |
| 1153 | return block.addNoOp(src, ptr_type, .alloc); | |
| 1189 | const ptr_type = try Module.simplePtrType(sema.arena, ret_type, true, .One); | |
| 1190 | return block.addTy(.alloc, ptr_type); | |
| 1154 | 1191 | } |
| 1155 | 1192 | |
| 1156 | fn zirRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1193 | fn zirRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1157 | 1194 | const tracy = trace(@src()); |
| 1158 | 1195 | defer tracy.end(); |
| 1159 | 1196 | |
| 1160 | 1197 | const inst_data = sema.code.instructions.items(.data)[inst].un_tok; |
| 1161 | const operand = try sema.resolveInst(inst_data.operand); | |
| 1198 | const operand = sema.resolveInst(inst_data.operand); | |
| 1162 | 1199 | return sema.analyzeRef(block, inst_data.src(), operand); |
| 1163 | 1200 | } |
| 1164 | 1201 | |
| ... | ... | @@ -1166,7 +1203,7 @@ fn zirRetType( |
| 1166 | 1203 | sema: *Sema, |
| 1167 | 1204 | block: *Scope.Block, |
| 1168 | 1205 | extended: Zir.Inst.Extended.InstData, |
| 1169 | ) InnerError!*Inst { | |
| 1206 | ) CompileError!Air.Inst.Ref { | |
| 1170 | 1207 | const tracy = trace(@src()); |
| 1171 | 1208 | defer tracy.end(); |
| 1172 | 1209 | |
| ... | ... | @@ -1174,15 +1211,15 @@ fn zirRetType( |
| 1174 | 1211 | try sema.requireFunctionBlock(block, src); |
| 1175 | 1212 | const fn_ty = sema.func.?.owner_decl.ty; |
| 1176 | 1213 | const ret_type = fn_ty.fnReturnType(); |
| 1177 | return sema.mod.constType(sema.arena, src, ret_type); | |
| 1214 | return sema.addType(ret_type); | |
| 1178 | 1215 | } |
| 1179 | 1216 | |
| 1180 | fn zirEnsureResultUsed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1217 | fn zirEnsureResultUsed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1181 | 1218 | const tracy = trace(@src()); |
| 1182 | 1219 | defer tracy.end(); |
| 1183 | 1220 | |
| 1184 | 1221 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1185 | const operand = try sema.resolveInst(inst_data.operand); | |
| 1222 | const operand = sema.resolveInst(inst_data.operand); | |
| 1186 | 1223 | const src = inst_data.src(); |
| 1187 | 1224 | |
| 1188 | 1225 | return sema.ensureResultUsed(block, operand, src); |
| ... | ... | @@ -1191,37 +1228,39 @@ fn zirEnsureResultUsed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) I |
| 1191 | 1228 | fn ensureResultUsed( |
| 1192 | 1229 | sema: *Sema, |
| 1193 | 1230 | block: *Scope.Block, |
| 1194 | operand: *Inst, | |
| 1231 | operand: Air.Inst.Ref, | |
| 1195 | 1232 | src: LazySrcLoc, |
| 1196 | ) InnerError!void { | |
| 1197 | switch (operand.ty.zigTypeTag()) { | |
| 1233 | ) CompileError!void { | |
| 1234 | const operand_ty = sema.typeOf(operand); | |
| 1235 | switch (operand_ty.zigTypeTag()) { | |
| 1198 | 1236 | .Void, .NoReturn => return, |
| 1199 | 1237 | else => return sema.mod.fail(&block.base, src, "expression value is ignored", .{}), |
| 1200 | 1238 | } |
| 1201 | 1239 | } |
| 1202 | 1240 | |
| 1203 | fn zirEnsureResultNonError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1241 | fn zirEnsureResultNonError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1204 | 1242 | const tracy = trace(@src()); |
| 1205 | 1243 | defer tracy.end(); |
| 1206 | 1244 | |
| 1207 | 1245 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1208 | const operand = try sema.resolveInst(inst_data.operand); | |
| 1246 | const operand = sema.resolveInst(inst_data.operand); | |
| 1209 | 1247 | const src = inst_data.src(); |
| 1210 | switch (operand.ty.zigTypeTag()) { | |
| 1248 | const operand_ty = sema.typeOf(operand); | |
| 1249 | switch (operand_ty.zigTypeTag()) { | |
| 1211 | 1250 | .ErrorSet, .ErrorUnion => return sema.mod.fail(&block.base, src, "error is discarded", .{}), |
| 1212 | 1251 | else => return, |
| 1213 | 1252 | } |
| 1214 | 1253 | } |
| 1215 | 1254 | |
| 1216 | fn zirIndexablePtrLen(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1255 | fn zirIndexablePtrLen(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1217 | 1256 | const tracy = trace(@src()); |
| 1218 | 1257 | defer tracy.end(); |
| 1219 | 1258 | |
| 1220 | 1259 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1221 | 1260 | const src = inst_data.src(); |
| 1222 | const array_ptr = try sema.resolveInst(inst_data.operand); | |
| 1261 | const array_ptr = sema.resolveInst(inst_data.operand); | |
| 1223 | 1262 | |
| 1224 | const elem_ty = array_ptr.ty.elemType(); | |
| 1263 | const elem_ty = sema.typeOf(array_ptr).elemType(); | |
| 1225 | 1264 | if (!elem_ty.isIndexable()) { |
| 1226 | 1265 | const cond_src: LazySrcLoc = .{ .node_offset_for_cond = inst_data.src_node }; |
| 1227 | 1266 | const msg = msg: { |
| ... | ... | @@ -1244,46 +1283,47 @@ fn zirIndexablePtrLen(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) In |
| 1244 | 1283 | return sema.mod.failWithOwnedErrorMsg(&block.base, msg); |
| 1245 | 1284 | } |
| 1246 | 1285 | const result_ptr = try sema.namedFieldPtr(block, src, array_ptr, "len", src); |
| 1247 | return sema.analyzeLoad(block, src, result_ptr, result_ptr.src); | |
| 1286 | const result_ptr_src = src; | |
| 1287 | return sema.analyzeLoad(block, src, result_ptr, result_ptr_src); | |
| 1248 | 1288 | } |
| 1249 | 1289 | |
| 1250 | fn zirArg(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1290 | fn zirArg(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1251 | 1291 | const inst_data = sema.code.instructions.items(.data)[inst].str_tok; |
| 1252 | 1292 | const arg_name = inst_data.get(sema.code); |
| 1253 | 1293 | const arg_index = sema.next_arg_index; |
| 1254 | 1294 | sema.next_arg_index += 1; |
| 1255 | 1295 | |
| 1256 | 1296 | // TODO check if arg_name shadows a Decl |
| 1297 | _ = arg_name; | |
| 1257 | 1298 | |
| 1258 | 1299 | if (block.inlining) |_| { |
| 1259 | 1300 | return sema.param_inst_list[arg_index]; |
| 1260 | 1301 | } |
| 1261 | 1302 | |
| 1262 | // Need to set the name of the Air.Arg instruction. | |
| 1263 | const air_arg = sema.param_inst_list[arg_index].castTag(.arg).?; | |
| 1264 | air_arg.name = arg_name; | |
| 1265 | return &air_arg.base; | |
| 1303 | // Set the name of the Air.Arg instruction for use by codegen debug info. | |
| 1304 | const air_arg = sema.param_inst_list[arg_index]; | |
| 1305 | sema.air_instructions.items(.data)[Air.refToIndex(air_arg).?].ty_str.str = inst_data.start; | |
| 1306 | return air_arg; | |
| 1266 | 1307 | } |
| 1267 | 1308 | |
| 1268 | 1309 | fn zirAllocExtended( |
| 1269 | 1310 | sema: *Sema, |
| 1270 | 1311 | block: *Scope.Block, |
| 1271 | 1312 | extended: Zir.Inst.Extended.InstData, |
| 1272 | ) InnerError!*Inst { | |
| 1313 | ) CompileError!Air.Inst.Ref { | |
| 1273 | 1314 | const extra = sema.code.extraData(Zir.Inst.AllocExtended, extended.operand); |
| 1274 | 1315 | const src: LazySrcLoc = .{ .node_offset = extra.data.src_node }; |
| 1275 | 1316 | return sema.mod.fail(&block.base, src, "TODO implement Sema.zirAllocExtended", .{}); |
| 1276 | 1317 | } |
| 1277 | 1318 | |
| 1278 | fn zirAllocComptime(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1319 | fn zirAllocComptime(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1279 | 1320 | const tracy = trace(@src()); |
| 1280 | 1321 | defer tracy.end(); |
| 1281 | 1322 | |
| 1282 | 1323 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1283 | const src = inst_data.src(); | |
| 1284 | 1324 | const ty_src: LazySrcLoc = .{ .node_offset_var_decl_ty = inst_data.src_node }; |
| 1285 | 1325 | const var_type = try sema.resolveType(block, ty_src, inst_data.operand); |
| 1286 | const ptr_type = try sema.mod.simplePtrType(sema.arena, var_type, true, .One); | |
| 1326 | const ptr_type = try Module.simplePtrType(sema.arena, var_type, true, .One); | |
| 1287 | 1327 | |
| 1288 | 1328 | const val_payload = try sema.arena.create(Value.Payload.ComptimeAlloc); |
| 1289 | 1329 | val_payload.* = .{ |
| ... | ... | @@ -1292,19 +1332,16 @@ fn zirAllocComptime(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inne |
| 1292 | 1332 | .val = undefined, // astgen guarantees there will be a store before the first load |
| 1293 | 1333 | }, |
| 1294 | 1334 | }; |
| 1295 | return sema.mod.constInst(sema.arena, src, .{ | |
| 1296 | .ty = ptr_type, | |
| 1297 | .val = Value.initPayload(&val_payload.base), | |
| 1298 | }); | |
| 1335 | return sema.addConstant(ptr_type, Value.initPayload(&val_payload.base)); | |
| 1299 | 1336 | } |
| 1300 | 1337 | |
| 1301 | fn zirAllocInferredComptime(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1338 | fn zirAllocInferredComptime(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1302 | 1339 | const src_node = sema.code.instructions.items(.data)[inst].node; |
| 1303 | 1340 | const src: LazySrcLoc = .{ .node_offset = src_node }; |
| 1304 | 1341 | return sema.mod.fail(&block.base, src, "TODO implement Sema.zirAllocInferredComptime", .{}); |
| 1305 | 1342 | } |
| 1306 | 1343 | |
| 1307 | fn zirAlloc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1344 | fn zirAlloc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1308 | 1345 | const tracy = trace(@src()); |
| 1309 | 1346 | defer tracy.end(); |
| 1310 | 1347 | |
| ... | ... | @@ -1312,12 +1349,12 @@ fn zirAlloc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!* |
| 1312 | 1349 | const ty_src: LazySrcLoc = .{ .node_offset_var_decl_ty = inst_data.src_node }; |
| 1313 | 1350 | const var_decl_src = inst_data.src(); |
| 1314 | 1351 | const var_type = try sema.resolveType(block, ty_src, inst_data.operand); |
| 1315 | const ptr_type = try sema.mod.simplePtrType(sema.arena, var_type, true, .One); | |
| 1352 | const ptr_type = try Module.simplePtrType(sema.arena, var_type, true, .One); | |
| 1316 | 1353 | try sema.requireRuntimeBlock(block, var_decl_src); |
| 1317 | return block.addNoOp(var_decl_src, ptr_type, .alloc); | |
| 1354 | return block.addTy(.alloc, ptr_type); | |
| 1318 | 1355 | } |
| 1319 | 1356 | |
| 1320 | fn zirAllocMut(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1357 | fn zirAllocMut(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1321 | 1358 | const tracy = trace(@src()); |
| 1322 | 1359 | defer tracy.end(); |
| 1323 | 1360 | |
| ... | ... | @@ -1326,9 +1363,9 @@ fn zirAllocMut(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 1326 | 1363 | const ty_src: LazySrcLoc = .{ .node_offset_var_decl_ty = inst_data.src_node }; |
| 1327 | 1364 | const var_type = try sema.resolveType(block, ty_src, inst_data.operand); |
| 1328 | 1365 | try sema.validateVarType(block, ty_src, var_type); |
| 1329 | const ptr_type = try sema.mod.simplePtrType(sema.arena, var_type, true, .One); | |
| 1366 | const ptr_type = try Module.simplePtrType(sema.arena, var_type, true, .One); | |
| 1330 | 1367 | try sema.requireRuntimeBlock(block, var_decl_src); |
| 1331 | return block.addNoOp(var_decl_src, ptr_type, .alloc); | |
| 1368 | return block.addTy(.alloc, ptr_type); | |
| 1332 | 1369 | } |
| 1333 | 1370 | |
| 1334 | 1371 | fn zirAllocInferred( |
| ... | ... | @@ -1336,7 +1373,7 @@ fn zirAllocInferred( |
| 1336 | 1373 | block: *Scope.Block, |
| 1337 | 1374 | inst: Zir.Inst.Index, |
| 1338 | 1375 | inferred_alloc_ty: Type, |
| 1339 | ) InnerError!*Inst { | |
| 1376 | ) CompileError!Air.Inst.Ref { | |
| 1340 | 1377 | const tracy = trace(@src()); |
| 1341 | 1378 | defer tracy.end(); |
| 1342 | 1379 | |
| ... | ... | @@ -1351,27 +1388,27 @@ fn zirAllocInferred( |
| 1351 | 1388 | // not needed in the case of constant values. However here, we plan to "downgrade" |
| 1352 | 1389 | // to a normal instruction when we hit `resolve_inferred_alloc`. So we append |
| 1353 | 1390 | // to the block even though it is currently a `.constant`. |
| 1354 | const result = try sema.mod.constInst(sema.arena, src, .{ | |
| 1355 | .ty = inferred_alloc_ty, | |
| 1356 | .val = Value.initPayload(&val_payload.base), | |
| 1357 | }); | |
| 1391 | const result = try sema.addConstant(inferred_alloc_ty, Value.initPayload(&val_payload.base)); | |
| 1358 | 1392 | try sema.requireFunctionBlock(block, src); |
| 1359 | try block.instructions.append(sema.gpa, result); | |
| 1393 | try block.instructions.append(sema.gpa, Air.refToIndex(result).?); | |
| 1360 | 1394 | return result; |
| 1361 | 1395 | } |
| 1362 | 1396 | |
| 1363 | fn zirResolveInferredAlloc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1397 | fn zirResolveInferredAlloc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1364 | 1398 | const tracy = trace(@src()); |
| 1365 | 1399 | defer tracy.end(); |
| 1366 | 1400 | |
| 1367 | 1401 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1368 | 1402 | const ty_src: LazySrcLoc = .{ .node_offset_var_decl_ty = inst_data.src_node }; |
| 1369 | const ptr = try sema.resolveInst(inst_data.operand); | |
| 1370 | const ptr_val = ptr.castTag(.constant).?.val; | |
| 1403 | const ptr = sema.resolveInst(inst_data.operand); | |
| 1404 | const ptr_inst = Air.refToIndex(ptr).?; | |
| 1405 | assert(sema.air_instructions.items(.tag)[ptr_inst] == .constant); | |
| 1406 | const air_datas = sema.air_instructions.items(.data); | |
| 1407 | const ptr_val = sema.air_values.items[air_datas[ptr_inst].ty_pl.payload]; | |
| 1371 | 1408 | const inferred_alloc = ptr_val.castTag(.inferred_alloc).?; |
| 1372 | 1409 | const peer_inst_list = inferred_alloc.data.stored_inst_list.items; |
| 1373 | 1410 | const final_elem_ty = try sema.resolvePeerTypes(block, ty_src, peer_inst_list); |
| 1374 | const var_is_mut = switch (ptr.ty.tag()) { | |
| 1411 | const var_is_mut = switch (sema.typeOf(ptr).tag()) { | |
| 1375 | 1412 | .inferred_alloc_const => false, |
| 1376 | 1413 | .inferred_alloc_mut => true, |
| 1377 | 1414 | else => unreachable, |
| ... | ... | @@ -1379,14 +1416,16 @@ fn zirResolveInferredAlloc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Inde |
| 1379 | 1416 | if (var_is_mut) { |
| 1380 | 1417 | try sema.validateVarType(block, ty_src, final_elem_ty); |
| 1381 | 1418 | } |
| 1382 | const final_ptr_ty = try sema.mod.simplePtrType(sema.arena, final_elem_ty, true, .One); | |
| 1419 | const final_ptr_ty = try Module.simplePtrType(sema.arena, final_elem_ty, true, .One); | |
| 1383 | 1420 | |
| 1384 | 1421 | // Change it to a normal alloc. |
| 1385 | ptr.ty = final_ptr_ty; | |
| 1386 | ptr.tag = .alloc; | |
| 1422 | sema.air_instructions.set(ptr_inst, .{ | |
| 1423 | .tag = .alloc, | |
| 1424 | .data = .{ .ty = final_ptr_ty }, | |
| 1425 | }); | |
| 1387 | 1426 | } |
| 1388 | 1427 | |
| 1389 | fn zirValidateStructInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1428 | fn zirValidateStructInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1390 | 1429 | const tracy = trace(@src()); |
| 1391 | 1430 | defer tracy.end(); |
| 1392 | 1431 | |
| ... | ... | @@ -1400,8 +1439,8 @@ fn zirValidateStructInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Ind |
| 1400 | 1439 | const struct_obj: *Module.Struct = s: { |
| 1401 | 1440 | const field_ptr_data = sema.code.instructions.items(.data)[instrs[0]].pl_node; |
| 1402 | 1441 | const field_ptr_extra = sema.code.extraData(Zir.Inst.Field, field_ptr_data.payload_index).data; |
| 1403 | const object_ptr = try sema.resolveInst(field_ptr_extra.lhs); | |
| 1404 | break :s object_ptr.ty.elemType().castTag(.@"struct").?.data; | |
| 1442 | const object_ptr = sema.resolveInst(field_ptr_extra.lhs); | |
| 1443 | break :s sema.typeOf(object_ptr).elemType().castTag(.@"struct").?.data; | |
| 1405 | 1444 | }; |
| 1406 | 1445 | |
| 1407 | 1446 | // Maps field index to field_ptr index of where it was already initialized. |
| ... | ... | @@ -1459,7 +1498,7 @@ fn zirValidateStructInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Ind |
| 1459 | 1498 | } |
| 1460 | 1499 | } |
| 1461 | 1500 | |
| 1462 | fn zirValidateArrayInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1501 | fn zirValidateArrayInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1463 | 1502 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 1464 | 1503 | const src = inst_data.src(); |
| 1465 | 1504 | return sema.mod.fail(&block.base, src, "TODO implement Sema.zirValidateArrayInitPtr", .{}); |
| ... | ... | @@ -1471,7 +1510,7 @@ fn failWithBadFieldAccess( |
| 1471 | 1510 | struct_obj: *Module.Struct, |
| 1472 | 1511 | field_src: LazySrcLoc, |
| 1473 | 1512 | field_name: []const u8, |
| 1474 | ) InnerError { | |
| 1513 | ) CompileError { | |
| 1475 | 1514 | const mod = sema.mod; |
| 1476 | 1515 | const gpa = sema.gpa; |
| 1477 | 1516 | |
| ... | ... | @@ -1498,7 +1537,7 @@ fn failWithBadUnionFieldAccess( |
| 1498 | 1537 | union_obj: *Module.Union, |
| 1499 | 1538 | field_src: LazySrcLoc, |
| 1500 | 1539 | field_name: []const u8, |
| 1501 | ) InnerError { | |
| 1540 | ) CompileError { | |
| 1502 | 1541 | const mod = sema.mod; |
| 1503 | 1542 | const gpa = sema.gpa; |
| 1504 | 1543 | |
| ... | ... | @@ -1519,7 +1558,7 @@ fn failWithBadUnionFieldAccess( |
| 1519 | 1558 | return mod.failWithOwnedErrorMsg(&block.base, msg); |
| 1520 | 1559 | } |
| 1521 | 1560 | |
| 1522 | fn zirStoreToBlockPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1561 | fn zirStoreToBlockPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1523 | 1562 | const tracy = trace(@src()); |
| 1524 | 1563 | defer tracy.end(); |
| 1525 | 1564 | |
| ... | ... | @@ -1529,37 +1568,41 @@ fn zirStoreToBlockPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) In |
| 1529 | 1568 | // to omit it. |
| 1530 | 1569 | return; |
| 1531 | 1570 | } |
| 1532 | const ptr = try sema.resolveInst(bin_inst.lhs); | |
| 1533 | const value = try sema.resolveInst(bin_inst.rhs); | |
| 1534 | const ptr_ty = try sema.mod.simplePtrType(sema.arena, value.ty, true, .One); | |
| 1571 | const ptr = sema.resolveInst(bin_inst.lhs); | |
| 1572 | const value = sema.resolveInst(bin_inst.rhs); | |
| 1573 | const ptr_ty = try Module.simplePtrType(sema.arena, sema.typeOf(value), true, .One); | |
| 1535 | 1574 | // TODO detect when this store should be done at compile-time. For example, |
| 1536 | 1575 | // if expressions should force it when the condition is compile-time known. |
| 1537 | 1576 | const src: LazySrcLoc = .unneeded; |
| 1538 | 1577 | try sema.requireRuntimeBlock(block, src); |
| 1539 | const bitcasted_ptr = try block.addUnOp(src, ptr_ty, .bitcast, ptr); | |
| 1578 | const bitcasted_ptr = try block.addTyOp(.bitcast, ptr_ty, ptr); | |
| 1540 | 1579 | return sema.storePtr(block, src, bitcasted_ptr, value); |
| 1541 | 1580 | } |
| 1542 | 1581 | |
| 1543 | fn zirStoreToInferredPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1582 | fn zirStoreToInferredPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1544 | 1583 | const tracy = trace(@src()); |
| 1545 | 1584 | defer tracy.end(); |
| 1546 | 1585 | |
| 1547 | 1586 | const src: LazySrcLoc = .unneeded; |
| 1548 | 1587 | const bin_inst = sema.code.instructions.items(.data)[inst].bin; |
| 1549 | const ptr = try sema.resolveInst(bin_inst.lhs); | |
| 1550 | const value = try sema.resolveInst(bin_inst.rhs); | |
| 1551 | const inferred_alloc = ptr.castTag(.constant).?.val.castTag(.inferred_alloc).?; | |
| 1588 | const ptr = sema.resolveInst(bin_inst.lhs); | |
| 1589 | const value = sema.resolveInst(bin_inst.rhs); | |
| 1590 | const ptr_inst = Air.refToIndex(ptr).?; | |
| 1591 | assert(sema.air_instructions.items(.tag)[ptr_inst] == .constant); | |
| 1592 | const air_datas = sema.air_instructions.items(.data); | |
| 1593 | const ptr_val = sema.air_values.items[air_datas[ptr_inst].ty_pl.payload]; | |
| 1594 | const inferred_alloc = ptr_val.castTag(.inferred_alloc).?; | |
| 1552 | 1595 | // Add the stored instruction to the set we will use to resolve peer types |
| 1553 | 1596 | // for the inferred allocation. |
| 1554 | 1597 | try inferred_alloc.data.stored_inst_list.append(sema.arena, value); |
| 1555 | 1598 | // Create a runtime bitcast instruction with exactly the type the pointer wants. |
| 1556 | const ptr_ty = try sema.mod.simplePtrType(sema.arena, value.ty, true, .One); | |
| 1599 | const ptr_ty = try Module.simplePtrType(sema.arena, sema.typeOf(value), true, .One); | |
| 1557 | 1600 | try sema.requireRuntimeBlock(block, src); |
| 1558 | const bitcasted_ptr = try block.addUnOp(src, ptr_ty, .bitcast, ptr); | |
| 1601 | const bitcasted_ptr = try block.addTyOp(.bitcast, ptr_ty, ptr); | |
| 1559 | 1602 | return sema.storePtr(block, src, bitcasted_ptr, value); |
| 1560 | 1603 | } |
| 1561 | 1604 | |
| 1562 | fn zirSetEvalBranchQuota(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1605 | fn zirSetEvalBranchQuota(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1563 | 1606 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1564 | 1607 | const src = inst_data.src(); |
| 1565 | 1608 | const quota = try sema.resolveAlreadyCoercedInt(block, src, inst_data.operand, u32); |
| ... | ... | @@ -1567,51 +1610,54 @@ fn zirSetEvalBranchQuota(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) |
| 1567 | 1610 | sema.branch_quota = quota; |
| 1568 | 1611 | } |
| 1569 | 1612 | |
| 1570 | fn zirStore(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1613 | fn zirStore(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1571 | 1614 | const tracy = trace(@src()); |
| 1572 | 1615 | defer tracy.end(); |
| 1573 | 1616 | |
| 1574 | 1617 | const bin_inst = sema.code.instructions.items(.data)[inst].bin; |
| 1575 | const ptr = try sema.resolveInst(bin_inst.lhs); | |
| 1576 | const value = try sema.resolveInst(bin_inst.rhs); | |
| 1618 | const ptr = sema.resolveInst(bin_inst.lhs); | |
| 1619 | const value = sema.resolveInst(bin_inst.rhs); | |
| 1577 | 1620 | return sema.storePtr(block, sema.src, ptr, value); |
| 1578 | 1621 | } |
| 1579 | 1622 | |
| 1580 | fn zirStoreNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 1623 | fn zirStoreNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 1581 | 1624 | const tracy = trace(@src()); |
| 1582 | 1625 | defer tracy.end(); |
| 1583 | 1626 | |
| 1584 | 1627 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 1585 | 1628 | const src = inst_data.src(); |
| 1586 | 1629 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 1587 | const ptr = try sema.resolveInst(extra.lhs); | |
| 1588 | const value = try sema.resolveInst(extra.rhs); | |
| 1630 | const ptr = sema.resolveInst(extra.lhs); | |
| 1631 | const value = sema.resolveInst(extra.rhs); | |
| 1589 | 1632 | return sema.storePtr(block, src, ptr, value); |
| 1590 | 1633 | } |
| 1591 | 1634 | |
| 1592 | fn zirParamType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1635 | fn zirParamType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1593 | 1636 | const tracy = trace(@src()); |
| 1594 | 1637 | defer tracy.end(); |
| 1595 | 1638 | |
| 1596 | const src: LazySrcLoc = .unneeded; | |
| 1639 | const src = sema.src; | |
| 1640 | const fn_inst_src = sema.src; | |
| 1641 | ||
| 1597 | 1642 | const inst_data = sema.code.instructions.items(.data)[inst].param_type; |
| 1598 | const fn_inst = try sema.resolveInst(inst_data.callee); | |
| 1643 | const fn_inst = sema.resolveInst(inst_data.callee); | |
| 1644 | const fn_inst_ty = sema.typeOf(fn_inst); | |
| 1599 | 1645 | const param_index = inst_data.param_index; |
| 1600 | 1646 | |
| 1601 | const fn_ty: Type = switch (fn_inst.ty.zigTypeTag()) { | |
| 1602 | .Fn => fn_inst.ty, | |
| 1647 | const fn_ty: Type = switch (fn_inst_ty.zigTypeTag()) { | |
| 1648 | .Fn => fn_inst_ty, | |
| 1603 | 1649 | .BoundFn => { |
| 1604 | return sema.mod.fail(&block.base, fn_inst.src, "TODO implement zirParamType for method call syntax", .{}); | |
| 1650 | return sema.mod.fail(&block.base, fn_inst_src, "TODO implement zirParamType for method call syntax", .{}); | |
| 1605 | 1651 | }, |
| 1606 | 1652 | else => { |
| 1607 | return sema.mod.fail(&block.base, fn_inst.src, "expected function, found '{}'", .{fn_inst.ty}); | |
| 1653 | return sema.mod.fail(&block.base, fn_inst_src, "expected function, found '{}'", .{fn_inst_ty}); | |
| 1608 | 1654 | }, |
| 1609 | 1655 | }; |
| 1610 | 1656 | |
| 1611 | 1657 | const param_count = fn_ty.fnParamLen(); |
| 1612 | 1658 | if (param_index >= param_count) { |
| 1613 | 1659 | if (fn_ty.fnIsVarArgs()) { |
| 1614 | return sema.mod.constType(sema.arena, src, Type.initTag(.var_args_param)); | |
| 1660 | return sema.addType(Type.initTag(.var_args_param)); | |
| 1615 | 1661 | } |
| 1616 | 1662 | return sema.mod.fail(&block.base, src, "arg index {d} out of bounds; '{}' has {d} argument(s)", .{ |
| 1617 | 1663 | param_index, |
| ... | ... | @@ -1622,10 +1668,10 @@ fn zirParamType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 1622 | 1668 | |
| 1623 | 1669 | // TODO support generic functions |
| 1624 | 1670 | const param_type = fn_ty.fnParamType(param_index); |
| 1625 | return sema.mod.constType(sema.arena, src, param_type); | |
| 1671 | return sema.addType(param_type); | |
| 1626 | 1672 | } |
| 1627 | 1673 | |
| 1628 | fn zirStr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1674 | fn zirStr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1629 | 1675 | const tracy = trace(@src()); |
| 1630 | 1676 | defer tracy.end(); |
| 1631 | 1677 | |
| ... | ... | @@ -1653,16 +1699,16 @@ fn zirStr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*In |
| 1653 | 1699 | return sema.analyzeDeclRef(block, .unneeded, new_decl); |
| 1654 | 1700 | } |
| 1655 | 1701 | |
| 1656 | fn zirInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1702 | fn zirInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1657 | 1703 | _ = block; |
| 1658 | 1704 | const tracy = trace(@src()); |
| 1659 | 1705 | defer tracy.end(); |
| 1660 | 1706 | |
| 1661 | 1707 | const int = sema.code.instructions.items(.data)[inst].int; |
| 1662 | return sema.mod.constIntUnsigned(sema.arena, .unneeded, Type.initTag(.comptime_int), int); | |
| 1708 | return sema.addIntUnsigned(Type.initTag(.comptime_int), int); | |
| 1663 | 1709 | } |
| 1664 | 1710 | |
| 1665 | fn zirIntBig(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1711 | fn zirIntBig(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1666 | 1712 | _ = block; |
| 1667 | 1713 | const tracy = trace(@src()); |
| 1668 | 1714 | defer tracy.end(); |
| ... | ... | @@ -1674,40 +1720,35 @@ fn zirIntBig(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError! |
| 1674 | 1720 | const limbs = try arena.alloc(std.math.big.Limb, int.len); |
| 1675 | 1721 | mem.copy(u8, mem.sliceAsBytes(limbs), limb_bytes); |
| 1676 | 1722 | |
| 1677 | return sema.mod.constInst(arena, .unneeded, .{ | |
| 1678 | .ty = Type.initTag(.comptime_int), | |
| 1679 | .val = try Value.Tag.int_big_positive.create(arena, limbs), | |
| 1680 | }); | |
| 1723 | return sema.addConstant( | |
| 1724 | Type.initTag(.comptime_int), | |
| 1725 | try Value.Tag.int_big_positive.create(arena, limbs), | |
| 1726 | ); | |
| 1681 | 1727 | } |
| 1682 | 1728 | |
| 1683 | fn zirFloat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1729 | fn zirFloat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1684 | 1730 | _ = block; |
| 1685 | 1731 | const arena = sema.arena; |
| 1686 | const inst_data = sema.code.instructions.items(.data)[inst].float; | |
| 1687 | const src = inst_data.src(); | |
| 1688 | const number = inst_data.number; | |
| 1689 | ||
| 1690 | return sema.mod.constInst(arena, src, .{ | |
| 1691 | .ty = Type.initTag(.comptime_float), | |
| 1692 | .val = try Value.Tag.float_32.create(arena, number), | |
| 1693 | }); | |
| 1732 | const number = sema.code.instructions.items(.data)[inst].float; | |
| 1733 | return sema.addConstant( | |
| 1734 | Type.initTag(.comptime_float), | |
| 1735 | try Value.Tag.float_64.create(arena, number), | |
| 1736 | ); | |
| 1694 | 1737 | } |
| 1695 | 1738 | |
| 1696 | fn zirFloat128(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1739 | fn zirFloat128(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1697 | 1740 | _ = block; |
| 1698 | 1741 | const arena = sema.arena; |
| 1699 | 1742 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 1700 | 1743 | const extra = sema.code.extraData(Zir.Inst.Float128, inst_data.payload_index).data; |
| 1701 | const src = inst_data.src(); | |
| 1702 | 1744 | const number = extra.get(); |
| 1703 | ||
| 1704 | return sema.mod.constInst(arena, src, .{ | |
| 1705 | .ty = Type.initTag(.comptime_float), | |
| 1706 | .val = try Value.Tag.float_128.create(arena, number), | |
| 1707 | }); | |
| 1745 | return sema.addConstant( | |
| 1746 | Type.initTag(.comptime_float), | |
| 1747 | try Value.Tag.float_128.create(arena, number), | |
| 1748 | ); | |
| 1708 | 1749 | } |
| 1709 | 1750 | |
| 1710 | fn zirCompileError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!Zir.Inst.Index { | |
| 1751 | fn zirCompileError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Zir.Inst.Index { | |
| 1711 | 1752 | const tracy = trace(@src()); |
| 1712 | 1753 | defer tracy.end(); |
| 1713 | 1754 | |
| ... | ... | @@ -1722,7 +1763,7 @@ fn zirCompileLog( |
| 1722 | 1763 | sema: *Sema, |
| 1723 | 1764 | block: *Scope.Block, |
| 1724 | 1765 | extended: Zir.Inst.Extended.InstData, |
| 1725 | ) InnerError!*Inst { | |
| 1766 | ) CompileError!Air.Inst.Ref { | |
| 1726 | 1767 | var managed = sema.mod.compile_log_text.toManaged(sema.gpa); |
| 1727 | 1768 | defer sema.mod.compile_log_text = managed.moveToUnmanaged(); |
| 1728 | 1769 | const writer = managed.writer(); |
| ... | ... | @@ -1735,11 +1776,12 @@ fn zirCompileLog( |
| 1735 | 1776 | for (args) |arg_ref, i| { |
| 1736 | 1777 | if (i != 0) try writer.print(", ", .{}); |
| 1737 | 1778 | |
| 1738 | const arg = try sema.resolveInst(arg_ref); | |
| 1779 | const arg = sema.resolveInst(arg_ref); | |
| 1780 | const arg_ty = sema.typeOf(arg); | |
| 1739 | 1781 | if (try sema.resolvePossiblyUndefinedValue(block, src, arg)) |val| { |
| 1740 | try writer.print("@as({}, {})", .{ arg.ty, val }); | |
| 1782 | try writer.print("@as({}, {})", .{ arg_ty, val }); | |
| 1741 | 1783 | } else { |
| 1742 | try writer.print("@as({}, [runtime value])", .{arg.ty}); | |
| 1784 | try writer.print("@as({}, [runtime value])", .{arg_ty}); | |
| 1743 | 1785 | } |
| 1744 | 1786 | } |
| 1745 | 1787 | try writer.print("\n", .{}); |
| ... | ... | @@ -1748,13 +1790,10 @@ fn zirCompileLog( |
| 1748 | 1790 | if (!gop.found_existing) { |
| 1749 | 1791 | gop.value_ptr.* = src_node; |
| 1750 | 1792 | } |
| 1751 | return sema.mod.constInst(sema.arena, src, .{ | |
| 1752 | .ty = Type.initTag(.void), | |
| 1753 | .val = Value.initTag(.void_value), | |
| 1754 | }); | |
| 1793 | return Air.Inst.Ref.void_value; | |
| 1755 | 1794 | } |
| 1756 | 1795 | |
| 1757 | fn zirRepeat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!Zir.Inst.Index { | |
| 1796 | fn zirRepeat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Zir.Inst.Index { | |
| 1758 | 1797 | const tracy = trace(@src()); |
| 1759 | 1798 | defer tracy.end(); |
| 1760 | 1799 | |
| ... | ... | @@ -1764,15 +1803,15 @@ fn zirRepeat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError! |
| 1764 | 1803 | return always_noreturn; |
| 1765 | 1804 | } |
| 1766 | 1805 | |
| 1767 | fn zirPanic(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!Zir.Inst.Index { | |
| 1806 | fn zirPanic(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Zir.Inst.Index { | |
| 1768 | 1807 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 1769 | 1808 | const src: LazySrcLoc = inst_data.src(); |
| 1770 | const msg_inst = try sema.resolveInst(inst_data.operand); | |
| 1809 | const msg_inst = sema.resolveInst(inst_data.operand); | |
| 1771 | 1810 | |
| 1772 | 1811 | return sema.panicWithMsg(block, src, msg_inst); |
| 1773 | 1812 | } |
| 1774 | 1813 | |
| 1775 | fn zirLoop(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1814 | fn zirLoop(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1776 | 1815 | const tracy = trace(@src()); |
| 1777 | 1816 | defer tracy.end(); |
| 1778 | 1817 | |
| ... | ... | @@ -1780,18 +1819,26 @@ fn zirLoop(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) InnerE |
| 1780 | 1819 | const src = inst_data.src(); |
| 1781 | 1820 | const extra = sema.code.extraData(Zir.Inst.Block, inst_data.payload_index); |
| 1782 | 1821 | const body = sema.code.extra[extra.end..][0..extra.data.body_len]; |
| 1822 | const gpa = sema.gpa; | |
| 1783 | 1823 | |
| 1784 | 1824 | // AIR expects a block outside the loop block too. |
| 1785 | const block_inst = try sema.arena.create(Inst.Block); | |
| 1786 | block_inst.* = .{ | |
| 1787 | .base = .{ | |
| 1788 | .tag = Inst.Block.base_tag, | |
| 1789 | .ty = undefined, | |
| 1790 | .src = src, | |
| 1791 | }, | |
| 1792 | .body = undefined, | |
| 1793 | }; | |
| 1794 | ||
| 1825 | // Reserve space for a Loop instruction so that generated Break instructions can | |
| 1826 | // point to it, even if it doesn't end up getting used because the code ends up being | |
| 1827 | // comptime evaluated. | |
| 1828 | const block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 1829 | const loop_inst = block_inst + 1; | |
| 1830 | try sema.air_instructions.ensureUnusedCapacity(gpa, 2); | |
| 1831 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 1832 | .tag = .block, | |
| 1833 | .data = undefined, | |
| 1834 | }); | |
| 1835 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 1836 | .tag = .loop, | |
| 1837 | .data = .{ .ty_pl = .{ | |
| 1838 | .ty = .noreturn_type, | |
| 1839 | .payload = undefined, | |
| 1840 | } }, | |
| 1841 | }); | |
| 1795 | 1842 | var label: Scope.Block.Label = .{ |
| 1796 | 1843 | .zir_block = inst, |
| 1797 | 1844 | .merges = .{ |
| ... | ... | @@ -1807,37 +1854,28 @@ fn zirLoop(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) InnerE |
| 1807 | 1854 | child_block.runtime_index += 1; |
| 1808 | 1855 | const merges = &child_block.label.?.merges; |
| 1809 | 1856 | |
| 1810 | defer child_block.instructions.deinit(sema.gpa); | |
| 1811 | defer merges.results.deinit(sema.gpa); | |
| 1812 | defer merges.br_list.deinit(sema.gpa); | |
| 1813 | ||
| 1814 | // Reserve space for a Loop instruction so that generated Break instructions can | |
| 1815 | // point to it, even if it doesn't end up getting used because the code ends up being | |
| 1816 | // comptime evaluated. | |
| 1817 | const loop_inst = try sema.arena.create(Inst.Loop); | |
| 1818 | loop_inst.* = .{ | |
| 1819 | .base = .{ | |
| 1820 | .tag = Inst.Loop.base_tag, | |
| 1821 | .ty = Type.initTag(.noreturn), | |
| 1822 | .src = src, | |
| 1823 | }, | |
| 1824 | .body = undefined, | |
| 1825 | }; | |
| 1857 | defer child_block.instructions.deinit(gpa); | |
| 1858 | defer merges.results.deinit(gpa); | |
| 1859 | defer merges.br_list.deinit(gpa); | |
| 1826 | 1860 | |
| 1827 | 1861 | var loop_block = child_block.makeSubBlock(); |
| 1828 | defer loop_block.instructions.deinit(sema.gpa); | |
| 1862 | defer loop_block.instructions.deinit(gpa); | |
| 1829 | 1863 | |
| 1830 | 1864 | _ = try sema.analyzeBody(&loop_block, body); |
| 1831 | 1865 | |
| 1832 | 1866 | // Loop repetition is implied so the last instruction may or may not be a noreturn instruction. |
| 1867 | try child_block.instructions.append(gpa, loop_inst); | |
| 1833 | 1868 | |
| 1834 | try child_block.instructions.append(sema.gpa, &loop_inst.base); | |
| 1835 | loop_inst.body = .{ .instructions = try sema.arena.dupe(*Inst, loop_block.instructions.items) }; | |
| 1836 | ||
| 1869 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Block).Struct.fields.len + | |
| 1870 | loop_block.instructions.items.len); | |
| 1871 | sema.air_instructions.items(.data)[loop_inst].ty_pl.payload = sema.addExtraAssumeCapacity( | |
| 1872 | Air.Block{ .body_len = @intCast(u32, loop_block.instructions.items.len) }, | |
| 1873 | ); | |
| 1874 | sema.air_extra.appendSliceAssumeCapacity(loop_block.instructions.items); | |
| 1837 | 1875 | return sema.analyzeBlockBody(parent_block, src, &child_block, merges); |
| 1838 | 1876 | } |
| 1839 | 1877 | |
| 1840 | fn zirCImport(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1878 | fn zirCImport(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1841 | 1879 | const tracy = trace(@src()); |
| 1842 | 1880 | defer tracy.end(); |
| 1843 | 1881 | |
| ... | ... | @@ -1847,33 +1885,34 @@ fn zirCImport(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) Inn |
| 1847 | 1885 | return sema.mod.fail(&parent_block.base, src, "TODO: implement Sema.zirCImport", .{}); |
| 1848 | 1886 | } |
| 1849 | 1887 | |
| 1850 | fn zirSuspendBlock(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1888 | fn zirSuspendBlock(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 1851 | 1889 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 1852 | 1890 | const src = inst_data.src(); |
| 1853 | 1891 | return sema.mod.fail(&parent_block.base, src, "TODO: implement Sema.zirSuspendBlock", .{}); |
| 1854 | 1892 | } |
| 1855 | 1893 | |
| 1856 | fn zirBlock(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 1894 | fn zirBlock( | |
| 1895 | sema: *Sema, | |
| 1896 | parent_block: *Scope.Block, | |
| 1897 | inst: Zir.Inst.Index, | |
| 1898 | ) CompileError!Air.Inst.Ref { | |
| 1857 | 1899 | const tracy = trace(@src()); |
| 1858 | 1900 | defer tracy.end(); |
| 1859 | 1901 | |
| 1860 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; | |
| 1861 | const src = inst_data.src(); | |
| 1862 | const extra = sema.code.extraData(Zir.Inst.Block, inst_data.payload_index); | |
| 1902 | const pl_node = sema.code.instructions.items(.data)[inst].pl_node; | |
| 1903 | const src = pl_node.src(); | |
| 1904 | const extra = sema.code.extraData(Zir.Inst.Block, pl_node.payload_index); | |
| 1863 | 1905 | const body = sema.code.extra[extra.end..][0..extra.data.body_len]; |
| 1906 | const gpa = sema.gpa; | |
| 1864 | 1907 | |
| 1865 | 1908 | // Reserve space for a Block instruction so that generated Break instructions can |
| 1866 | 1909 | // point to it, even if it doesn't end up getting used because the code ends up being |
| 1867 | 1910 | // comptime evaluated. |
| 1868 | const block_inst = try sema.arena.create(Inst.Block); | |
| 1869 | block_inst.* = .{ | |
| 1870 | .base = .{ | |
| 1871 | .tag = Inst.Block.base_tag, | |
| 1872 | .ty = undefined, // Set after analysis. | |
| 1873 | .src = src, | |
| 1874 | }, | |
| 1875 | .body = undefined, | |
| 1876 | }; | |
| 1911 | const block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 1912 | try sema.air_instructions.append(gpa, .{ | |
| 1913 | .tag = .block, | |
| 1914 | .data = undefined, | |
| 1915 | }); | |
| 1877 | 1916 | |
| 1878 | 1917 | var label: Scope.Block.Label = .{ |
| 1879 | 1918 | .zir_block = inst, |
| ... | ... | @@ -1895,9 +1934,9 @@ fn zirBlock(sema: *Sema, parent_block: *Scope.Block, inst: Zir.Inst.Index) Inner |
| 1895 | 1934 | }; |
| 1896 | 1935 | const merges = &child_block.label.?.merges; |
| 1897 | 1936 | |
| 1898 | defer child_block.instructions.deinit(sema.gpa); | |
| 1899 | defer merges.results.deinit(sema.gpa); | |
| 1900 | defer merges.br_list.deinit(sema.gpa); | |
| 1937 | defer child_block.instructions.deinit(gpa); | |
| 1938 | defer merges.results.deinit(gpa); | |
| 1939 | defer merges.br_list.deinit(gpa); | |
| 1901 | 1940 | |
| 1902 | 1941 | _ = try sema.analyzeBody(&child_block, body); |
| 1903 | 1942 | |
| ... | ... | @@ -1911,7 +1950,7 @@ fn resolveBlockBody( |
| 1911 | 1950 | child_block: *Scope.Block, |
| 1912 | 1951 | body: []const Zir.Inst.Index, |
| 1913 | 1952 | merges: *Scope.Block.Merges, |
| 1914 | ) InnerError!*Inst { | |
| 1953 | ) CompileError!Air.Inst.Ref { | |
| 1915 | 1954 | _ = try sema.analyzeBody(child_block, body); |
| 1916 | 1955 | return sema.analyzeBlockBody(parent_block, src, child_block, merges); |
| 1917 | 1956 | } |
| ... | ... | @@ -1922,30 +1961,31 @@ fn analyzeBlockBody( |
| 1922 | 1961 | src: LazySrcLoc, |
| 1923 | 1962 | child_block: *Scope.Block, |
| 1924 | 1963 | merges: *Scope.Block.Merges, |
| 1925 | ) InnerError!*Inst { | |
| 1964 | ) CompileError!Air.Inst.Ref { | |
| 1926 | 1965 | const tracy = trace(@src()); |
| 1927 | 1966 | defer tracy.end(); |
| 1928 | 1967 | |
| 1968 | const gpa = sema.gpa; | |
| 1969 | ||
| 1929 | 1970 | // Blocks must terminate with noreturn instruction. |
| 1930 | 1971 | assert(child_block.instructions.items.len != 0); |
| 1931 | assert(child_block.instructions.items[child_block.instructions.items.len - 1].ty.isNoReturn()); | |
| 1972 | assert(sema.typeOf(Air.indexToRef(child_block.instructions.items[child_block.instructions.items.len - 1])).isNoReturn()); | |
| 1932 | 1973 | |
| 1933 | 1974 | if (merges.results.items.len == 0) { |
| 1934 | 1975 | // No need for a block instruction. We can put the new instructions |
| 1935 | 1976 | // directly into the parent block. |
| 1936 | const copied_instructions = try sema.arena.dupe(*Inst, child_block.instructions.items); | |
| 1937 | try parent_block.instructions.appendSlice(sema.gpa, copied_instructions); | |
| 1938 | return copied_instructions[copied_instructions.len - 1]; | |
| 1977 | try parent_block.instructions.appendSlice(gpa, child_block.instructions.items); | |
| 1978 | return Air.indexToRef(child_block.instructions.items[child_block.instructions.items.len - 1]); | |
| 1939 | 1979 | } |
| 1940 | 1980 | if (merges.results.items.len == 1) { |
| 1941 | 1981 | const last_inst_index = child_block.instructions.items.len - 1; |
| 1942 | 1982 | const last_inst = child_block.instructions.items[last_inst_index]; |
| 1943 | if (last_inst.breakBlock()) |br_block| { | |
| 1983 | if (sema.getBreakBlock(last_inst)) |br_block| { | |
| 1944 | 1984 | if (br_block == merges.block_inst) { |
| 1945 | 1985 | // No need for a block instruction. We can put the new instructions directly |
| 1946 | 1986 | // into the parent block. Here we omit the break instruction. |
| 1947 | const copied_instructions = try sema.arena.dupe(*Inst, child_block.instructions.items[0..last_inst_index]); | |
| 1948 | try parent_block.instructions.appendSlice(sema.gpa, copied_instructions); | |
| 1987 | const without_break = child_block.instructions.items[0..last_inst_index]; | |
| 1988 | try parent_block.instructions.appendSlice(gpa, without_break); | |
| 1949 | 1989 | return merges.results.items[0]; |
| 1950 | 1990 | } |
| 1951 | 1991 | } |
| ... | ... | @@ -1955,50 +1995,70 @@ fn analyzeBlockBody( |
| 1955 | 1995 | |
| 1956 | 1996 | // Need to set the type and emit the Block instruction. This allows machine code generation |
| 1957 | 1997 | // to emit a jump instruction to after the block when it encounters the break. |
| 1958 | try parent_block.instructions.append(sema.gpa, &merges.block_inst.base); | |
| 1998 | try parent_block.instructions.append(gpa, merges.block_inst); | |
| 1959 | 1999 | const resolved_ty = try sema.resolvePeerTypes(parent_block, src, merges.results.items); |
| 1960 | merges.block_inst.base.ty = resolved_ty; | |
| 1961 | merges.block_inst.body = .{ | |
| 1962 | .instructions = try sema.arena.dupe(*Inst, child_block.instructions.items), | |
| 1963 | }; | |
| 2000 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Block).Struct.fields.len + | |
| 2001 | child_block.instructions.items.len); | |
| 2002 | sema.air_instructions.items(.data)[merges.block_inst] = .{ .ty_pl = .{ | |
| 2003 | .ty = try sema.addType(resolved_ty), | |
| 2004 | .payload = sema.addExtraAssumeCapacity(Air.Block{ | |
| 2005 | .body_len = @intCast(u32, child_block.instructions.items.len), | |
| 2006 | }), | |
| 2007 | } }; | |
| 2008 | sema.air_extra.appendSliceAssumeCapacity(child_block.instructions.items); | |
| 1964 | 2009 | // Now that the block has its type resolved, we need to go back into all the break |
| 1965 | 2010 | // instructions, and insert type coercion on the operands. |
| 1966 | 2011 | for (merges.br_list.items) |br| { |
| 1967 | if (br.operand.ty.eql(resolved_ty)) { | |
| 2012 | const br_operand = sema.air_instructions.items(.data)[br].br.operand; | |
| 2013 | const br_operand_src = src; | |
| 2014 | const br_operand_ty = sema.typeOf(br_operand); | |
| 2015 | if (br_operand_ty.eql(resolved_ty)) { | |
| 1968 | 2016 | // No type coercion needed. |
| 1969 | 2017 | continue; |
| 1970 | 2018 | } |
| 1971 | 2019 | var coerce_block = parent_block.makeSubBlock(); |
| 1972 | defer coerce_block.instructions.deinit(sema.gpa); | |
| 1973 | const coerced_operand = try sema.coerce(&coerce_block, resolved_ty, br.operand, br.operand.src); | |
| 2020 | defer coerce_block.instructions.deinit(gpa); | |
| 2021 | const coerced_operand = try sema.coerce(&coerce_block, resolved_ty, br_operand, br_operand_src); | |
| 1974 | 2022 | // If no instructions were produced, such as in the case of a coercion of a |
| 1975 | 2023 | // constant value to a new type, we can simply point the br operand to it. |
| 1976 | 2024 | if (coerce_block.instructions.items.len == 0) { |
| 1977 | br.operand = coerced_operand; | |
| 2025 | sema.air_instructions.items(.data)[br].br.operand = coerced_operand; | |
| 1978 | 2026 | continue; |
| 1979 | 2027 | } |
| 1980 | assert(coerce_block.instructions.items[coerce_block.instructions.items.len - 1] == coerced_operand); | |
| 1981 | // Here we depend on the br instruction having been over-allocated (if necessary) | |
| 1982 | // inside zirBreak so that it can be converted into a br_block_flat instruction. | |
| 1983 | const br_src = br.base.src; | |
| 1984 | const br_ty = br.base.ty; | |
| 1985 | const br_block_flat = @ptrCast(*Inst.BrBlockFlat, br); | |
| 1986 | br_block_flat.* = .{ | |
| 1987 | .base = .{ | |
| 1988 | .src = br_src, | |
| 1989 | .ty = br_ty, | |
| 1990 | .tag = .br_block_flat, | |
| 1991 | }, | |
| 1992 | .block = merges.block_inst, | |
| 1993 | .body = .{ | |
| 1994 | .instructions = try sema.arena.dupe(*Inst, coerce_block.instructions.items), | |
| 1995 | }, | |
| 1996 | }; | |
| 2028 | assert(coerce_block.instructions.items[coerce_block.instructions.items.len - 1] == | |
| 2029 | Air.refToIndex(coerced_operand).?); | |
| 2030 | ||
| 2031 | // Convert the br operand to a block. | |
| 2032 | const br_operand_ty_ref = try sema.addType(br_operand_ty); | |
| 2033 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Block).Struct.fields.len + | |
| 2034 | coerce_block.instructions.items.len); | |
| 2035 | try sema.air_instructions.ensureUnusedCapacity(gpa, 2); | |
| 2036 | const sub_block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 2037 | const sub_br_inst = sub_block_inst + 1; | |
| 2038 | sema.air_instructions.items(.data)[br].br.operand = Air.indexToRef(sub_block_inst); | |
| 2039 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 2040 | .tag = .block, | |
| 2041 | .data = .{ .ty_pl = .{ | |
| 2042 | .ty = br_operand_ty_ref, | |
| 2043 | .payload = sema.addExtraAssumeCapacity(Air.Block{ | |
| 2044 | .body_len = @intCast(u32, coerce_block.instructions.items.len), | |
| 2045 | }), | |
| 2046 | } }, | |
| 2047 | }); | |
| 2048 | sema.air_extra.appendSliceAssumeCapacity(coerce_block.instructions.items); | |
| 2049 | sema.air_extra.appendAssumeCapacity(sub_br_inst); | |
| 2050 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 2051 | .tag = .br, | |
| 2052 | .data = .{ .br = .{ | |
| 2053 | .block_inst = sub_block_inst, | |
| 2054 | .operand = coerced_operand, | |
| 2055 | } }, | |
| 2056 | }); | |
| 1997 | 2057 | } |
| 1998 | return &merges.block_inst.base; | |
| 2058 | return Air.indexToRef(merges.block_inst); | |
| 1999 | 2059 | } |
| 2000 | 2060 | |
| 2001 | fn zirExport(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2061 | fn zirExport(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2002 | 2062 | const tracy = trace(@src()); |
| 2003 | 2063 | defer tracy.end(); |
| 2004 | 2064 | |
| ... | ... | @@ -2034,13 +2094,13 @@ fn zirExport(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError! |
| 2034 | 2094 | try sema.mod.analyzeExport(&block.base, src, export_name, decl); |
| 2035 | 2095 | } |
| 2036 | 2096 | |
| 2037 | fn zirSetAlignStack(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2097 | fn zirSetAlignStack(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2038 | 2098 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2039 | 2099 | const src: LazySrcLoc = inst_data.src(); |
| 2040 | 2100 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirSetAlignStack", .{}); |
| 2041 | 2101 | } |
| 2042 | 2102 | |
| 2043 | fn zirSetCold(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2103 | fn zirSetCold(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2044 | 2104 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2045 | 2105 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2046 | 2106 | const is_cold = try sema.resolveConstBool(block, operand_src, inst_data.operand); |
| ... | ... | @@ -2048,67 +2108,49 @@ fn zirSetCold(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 2048 | 2108 | func.is_cold = is_cold; |
| 2049 | 2109 | } |
| 2050 | 2110 | |
| 2051 | fn zirSetFloatMode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2111 | fn zirSetFloatMode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2052 | 2112 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2053 | 2113 | const src: LazySrcLoc = inst_data.src(); |
| 2054 | 2114 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirSetFloatMode", .{}); |
| 2055 | 2115 | } |
| 2056 | 2116 | |
| 2057 | fn zirSetRuntimeSafety(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2117 | fn zirSetRuntimeSafety(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2058 | 2118 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2059 | 2119 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2060 | 2120 | block.want_safety = try sema.resolveConstBool(block, operand_src, inst_data.operand); |
| 2061 | 2121 | } |
| 2062 | 2122 | |
| 2063 | fn zirBreakpoint(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2123 | fn zirBreakpoint(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2064 | 2124 | const tracy = trace(@src()); |
| 2065 | 2125 | defer tracy.end(); |
| 2066 | 2126 | |
| 2067 | 2127 | const src_node = sema.code.instructions.items(.data)[inst].node; |
| 2068 | 2128 | const src: LazySrcLoc = .{ .node_offset = src_node }; |
| 2069 | 2129 | try sema.requireRuntimeBlock(block, src); |
| 2070 | _ = try block.addNoOp(src, Type.initTag(.void), .breakpoint); | |
| 2130 | _ = try block.addNoOp(.breakpoint); | |
| 2071 | 2131 | } |
| 2072 | 2132 | |
| 2073 | fn zirFence(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2133 | fn zirFence(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2074 | 2134 | const src_node = sema.code.instructions.items(.data)[inst].node; |
| 2075 | 2135 | const src: LazySrcLoc = .{ .node_offset = src_node }; |
| 2076 | 2136 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirFence", .{}); |
| 2077 | 2137 | } |
| 2078 | 2138 | |
| 2079 | fn zirBreak(sema: *Sema, start_block: *Scope.Block, inst: Zir.Inst.Index) InnerError!Zir.Inst.Index { | |
| 2139 | fn zirBreak(sema: *Sema, start_block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Zir.Inst.Index { | |
| 2080 | 2140 | const tracy = trace(@src()); |
| 2081 | 2141 | defer tracy.end(); |
| 2082 | 2142 | |
| 2083 | 2143 | const inst_data = sema.code.instructions.items(.data)[inst].@"break"; |
| 2084 | const src = sema.src; | |
| 2085 | const operand = try sema.resolveInst(inst_data.operand); | |
| 2144 | const operand = sema.resolveInst(inst_data.operand); | |
| 2086 | 2145 | const zir_block = inst_data.block_inst; |
| 2087 | 2146 | |
| 2088 | 2147 | var block = start_block; |
| 2089 | 2148 | while (true) { |
| 2090 | 2149 | if (block.label) |label| { |
| 2091 | 2150 | if (label.zir_block == zir_block) { |
| 2092 | // Here we add a br instruction, but we over-allocate a little bit | |
| 2093 | // (if necessary) to make it possible to convert the instruction into | |
| 2094 | // a br_block_flat instruction later. | |
| 2095 | const br = @ptrCast(*Inst.Br, try sema.arena.alignedAlloc( | |
| 2096 | u8, | |
| 2097 | Inst.convertable_br_align, | |
| 2098 | Inst.convertable_br_size, | |
| 2099 | )); | |
| 2100 | br.* = .{ | |
| 2101 | .base = .{ | |
| 2102 | .tag = .br, | |
| 2103 | .ty = Type.initTag(.noreturn), | |
| 2104 | .src = src, | |
| 2105 | }, | |
| 2106 | .operand = operand, | |
| 2107 | .block = label.merges.block_inst, | |
| 2108 | }; | |
| 2109 | try start_block.instructions.append(sema.gpa, &br.base); | |
| 2151 | const br_ref = try start_block.addBr(label.merges.block_inst, operand); | |
| 2110 | 2152 | try label.merges.results.append(sema.gpa, operand); |
| 2111 | try label.merges.br_list.append(sema.gpa, br); | |
| 2153 | try label.merges.br_list.append(sema.gpa, Air.refToIndex(br_ref).?); | |
| 2112 | 2154 | return inst; |
| 2113 | 2155 | } |
| 2114 | 2156 | } |
| ... | ... | @@ -2116,7 +2158,7 @@ fn zirBreak(sema: *Sema, start_block: *Scope.Block, inst: Zir.Inst.Index) InnerE |
| 2116 | 2158 | } |
| 2117 | 2159 | } |
| 2118 | 2160 | |
| 2119 | fn zirDbgStmt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 2161 | fn zirDbgStmt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 2120 | 2162 | const tracy = trace(@src()); |
| 2121 | 2163 | defer tracy.end(); |
| 2122 | 2164 | |
| ... | ... | @@ -2127,10 +2169,16 @@ fn zirDbgStmt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 2127 | 2169 | if (block.is_comptime) return; |
| 2128 | 2170 | |
| 2129 | 2171 | const inst_data = sema.code.instructions.items(.data)[inst].dbg_stmt; |
| 2130 | _ = try block.addDbgStmt(.unneeded, inst_data.line, inst_data.column); | |
| 2172 | _ = try block.addInst(.{ | |
| 2173 | .tag = .dbg_stmt, | |
| 2174 | .data = .{ .dbg_stmt = .{ | |
| 2175 | .line = inst_data.line, | |
| 2176 | .column = inst_data.column, | |
| 2177 | } }, | |
| 2178 | }); | |
| 2131 | 2179 | } |
| 2132 | 2180 | |
| 2133 | fn zirDeclRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2181 | fn zirDeclRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2134 | 2182 | const inst_data = sema.code.instructions.items(.data)[inst].str_tok; |
| 2135 | 2183 | const src = inst_data.src(); |
| 2136 | 2184 | const decl_name = inst_data.get(sema.code); |
| ... | ... | @@ -2138,7 +2186,7 @@ fn zirDeclRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 2138 | 2186 | return sema.analyzeDeclRef(block, src, decl); |
| 2139 | 2187 | } |
| 2140 | 2188 | |
| 2141 | fn zirDeclVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2189 | fn zirDeclVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2142 | 2190 | const inst_data = sema.code.instructions.items(.data)[inst].str_tok; |
| 2143 | 2191 | const src = inst_data.src(); |
| 2144 | 2192 | const decl_name = inst_data.get(sema.code); |
| ... | ... | @@ -2164,7 +2212,7 @@ fn lookupInNamespace( |
| 2164 | 2212 | sema: *Sema, |
| 2165 | 2213 | namespace: *Scope.Namespace, |
| 2166 | 2214 | ident_name: []const u8, |
| 2167 | ) InnerError!?*Decl { | |
| 2215 | ) CompileError!?*Decl { | |
| 2168 | 2216 | const namespace_decl = namespace.getDecl(); |
| 2169 | 2217 | if (namespace_decl.analysis == .file_failure) { |
| 2170 | 2218 | try sema.mod.declareDeclDependency(sema.owner_decl, namespace_decl); |
| ... | ... | @@ -2192,7 +2240,7 @@ fn zirCall( |
| 2192 | 2240 | inst: Zir.Inst.Index, |
| 2193 | 2241 | modifier: std.builtin.CallOptions.Modifier, |
| 2194 | 2242 | ensure_result_used: bool, |
| 2195 | ) InnerError!*Inst { | |
| 2243 | ) CompileError!Air.Inst.Ref { | |
| 2196 | 2244 | const tracy = trace(@src()); |
| 2197 | 2245 | defer tracy.end(); |
| 2198 | 2246 | |
| ... | ... | @@ -2202,12 +2250,12 @@ fn zirCall( |
| 2202 | 2250 | const extra = sema.code.extraData(Zir.Inst.Call, inst_data.payload_index); |
| 2203 | 2251 | const args = sema.code.refSlice(extra.end, extra.data.args_len); |
| 2204 | 2252 | |
| 2205 | const func = try sema.resolveInst(extra.data.callee); | |
| 2253 | const func = sema.resolveInst(extra.data.callee); | |
| 2206 | 2254 | // TODO handle function calls of generic functions |
| 2207 | const resolved_args = try sema.arena.alloc(*Inst, args.len); | |
| 2255 | const resolved_args = try sema.arena.alloc(Air.Inst.Ref, args.len); | |
| 2208 | 2256 | for (args) |zir_arg, i| { |
| 2209 | 2257 | // the args are already casted to the result of a param type instruction. |
| 2210 | resolved_args[i] = try sema.resolveInst(zir_arg); | |
| 2258 | resolved_args[i] = sema.resolveInst(zir_arg); | |
| 2211 | 2259 | } |
| 2212 | 2260 | |
| 2213 | 2261 | return sema.analyzeCall(block, func, func_src, call_src, modifier, ensure_result_used, resolved_args); |
| ... | ... | @@ -2216,17 +2264,18 @@ fn zirCall( |
| 2216 | 2264 | fn analyzeCall( |
| 2217 | 2265 | sema: *Sema, |
| 2218 | 2266 | block: *Scope.Block, |
| 2219 | func: *ir.Inst, | |
| 2267 | func: Air.Inst.Ref, | |
| 2220 | 2268 | func_src: LazySrcLoc, |
| 2221 | 2269 | call_src: LazySrcLoc, |
| 2222 | 2270 | modifier: std.builtin.CallOptions.Modifier, |
| 2223 | 2271 | ensure_result_used: bool, |
| 2224 | args: []const *ir.Inst, | |
| 2225 | ) InnerError!*ir.Inst { | |
| 2226 | if (func.ty.zigTypeTag() != .Fn) | |
| 2227 | return sema.mod.fail(&block.base, func_src, "type '{}' not a function", .{func.ty}); | |
| 2272 | args: []const Air.Inst.Ref, | |
| 2273 | ) CompileError!Air.Inst.Ref { | |
| 2274 | const func_ty = sema.typeOf(func); | |
| 2275 | if (func_ty.zigTypeTag() != .Fn) | |
| 2276 | return sema.mod.fail(&block.base, func_src, "type '{}' not a function", .{func_ty}); | |
| 2228 | 2277 | |
| 2229 | const cc = func.ty.fnCallingConvention(); | |
| 2278 | const cc = func_ty.fnCallingConvention(); | |
| 2230 | 2279 | if (cc == .Naked) { |
| 2231 | 2280 | // TODO add error note: declared here |
| 2232 | 2281 | return sema.mod.fail( |
| ... | ... | @@ -2236,8 +2285,8 @@ fn analyzeCall( |
| 2236 | 2285 | .{}, |
| 2237 | 2286 | ); |
| 2238 | 2287 | } |
| 2239 | const fn_params_len = func.ty.fnParamLen(); | |
| 2240 | if (func.ty.fnIsVarArgs()) { | |
| 2288 | const fn_params_len = func_ty.fnParamLen(); | |
| 2289 | if (func_ty.fnIsVarArgs()) { | |
| 2241 | 2290 | assert(cc == .C); |
| 2242 | 2291 | if (args.len < fn_params_len) { |
| 2243 | 2292 | // TODO add error note: declared here |
| ... | ... | @@ -2274,12 +2323,12 @@ fn analyzeCall( |
| 2274 | 2323 | }), |
| 2275 | 2324 | } |
| 2276 | 2325 | |
| 2277 | const ret_type = func.ty.fnReturnType(); | |
| 2326 | const gpa = sema.gpa; | |
| 2278 | 2327 | |
| 2279 | 2328 | const is_comptime_call = block.is_comptime or modifier == .compile_time; |
| 2280 | 2329 | const is_inline_call = is_comptime_call or modifier == .always_inline or |
| 2281 | func.ty.fnCallingConvention() == .Inline; | |
| 2282 | const result: *Inst = if (is_inline_call) res: { | |
| 2330 | func_ty.fnCallingConvention() == .Inline; | |
| 2331 | const result: Air.Inst.Ref = if (is_inline_call) res: { | |
| 2283 | 2332 | const func_val = try sema.resolveConstValue(block, func_src, func); |
| 2284 | 2333 | const module_fn = switch (func_val.tag()) { |
| 2285 | 2334 | .function => func_val.castTag(.function).?.data, |
| ... | ... | @@ -2294,15 +2343,11 @@ fn analyzeCall( |
| 2294 | 2343 | // set to in the `Scope.Block`. |
| 2295 | 2344 | // This block instruction will be used to capture the return value from the |
| 2296 | 2345 | // inlined function. |
| 2297 | const block_inst = try sema.arena.create(Inst.Block); | |
| 2298 | block_inst.* = .{ | |
| 2299 | .base = .{ | |
| 2300 | .tag = Inst.Block.base_tag, | |
| 2301 | .ty = ret_type, | |
| 2302 | .src = call_src, | |
| 2303 | }, | |
| 2304 | .body = undefined, | |
| 2305 | }; | |
| 2346 | const block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 2347 | try sema.air_instructions.append(gpa, .{ | |
| 2348 | .tag = .block, | |
| 2349 | .data = undefined, | |
| 2350 | }); | |
| 2306 | 2351 | // This one is shared among sub-blocks within the same callee, but not |
| 2307 | 2352 | // shared among the entire inline/comptime call stack. |
| 2308 | 2353 | var inlining: Scope.Block.Inlining = .{ |
| ... | ... | @@ -2321,7 +2366,7 @@ fn analyzeCall( |
| 2321 | 2366 | const parent_inst_map = sema.inst_map; |
| 2322 | 2367 | sema.inst_map = .{}; |
| 2323 | 2368 | defer { |
| 2324 | sema.inst_map.deinit(sema.gpa); | |
| 2369 | sema.inst_map.deinit(gpa); | |
| 2325 | 2370 | sema.inst_map = parent_inst_map; |
| 2326 | 2371 | } |
| 2327 | 2372 | |
| ... | ... | @@ -2353,9 +2398,9 @@ fn analyzeCall( |
| 2353 | 2398 | |
| 2354 | 2399 | const merges = &child_block.inlining.?.merges; |
| 2355 | 2400 | |
| 2356 | defer child_block.instructions.deinit(sema.gpa); | |
| 2357 | defer merges.results.deinit(sema.gpa); | |
| 2358 | defer merges.br_list.deinit(sema.gpa); | |
| 2401 | defer child_block.instructions.deinit(gpa); | |
| 2402 | defer merges.results.deinit(gpa); | |
| 2403 | defer merges.br_list.deinit(gpa); | |
| 2359 | 2404 | |
| 2360 | 2405 | try sema.emitBackwardBranch(&child_block, call_src); |
| 2361 | 2406 | |
| ... | ... | @@ -2368,7 +2413,19 @@ fn analyzeCall( |
| 2368 | 2413 | break :res result; |
| 2369 | 2414 | } else res: { |
| 2370 | 2415 | try sema.requireRuntimeBlock(block, call_src); |
| 2371 | break :res try block.addCall(call_src, ret_type, func, args); | |
| 2416 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Call).Struct.fields.len + | |
| 2417 | args.len); | |
| 2418 | const func_inst = try block.addInst(.{ | |
| 2419 | .tag = .call, | |
| 2420 | .data = .{ .pl_op = .{ | |
| 2421 | .operand = func, | |
| 2422 | .payload = sema.addExtraAssumeCapacity(Air.Call{ | |
| 2423 | .args_len = @intCast(u32, args.len), | |
| 2424 | }), | |
| 2425 | } }, | |
| 2426 | }); | |
| 2427 | sema.appendRefsAssumeCapacity(args); | |
| 2428 | break :res func_inst; | |
| 2372 | 2429 | }; |
| 2373 | 2430 | |
| 2374 | 2431 | if (ensure_result_used) { |
| ... | ... | @@ -2377,19 +2434,18 @@ fn analyzeCall( |
| 2377 | 2434 | return result; |
| 2378 | 2435 | } |
| 2379 | 2436 | |
| 2380 | fn zirIntType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2437 | fn zirIntType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2381 | 2438 | _ = block; |
| 2382 | 2439 | const tracy = trace(@src()); |
| 2383 | 2440 | defer tracy.end(); |
| 2384 | 2441 | |
| 2385 | 2442 | const int_type = sema.code.instructions.items(.data)[inst].int_type; |
| 2386 | const src = int_type.src(); | |
| 2387 | 2443 | const ty = try Module.makeIntType(sema.arena, int_type.signedness, int_type.bit_count); |
| 2388 | 2444 | |
| 2389 | return sema.mod.constType(sema.arena, src, ty); | |
| 2445 | return sema.addType(ty); | |
| 2390 | 2446 | } |
| 2391 | 2447 | |
| 2392 | fn zirOptionalType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2448 | fn zirOptionalType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2393 | 2449 | const tracy = trace(@src()); |
| 2394 | 2450 | defer tracy.end(); |
| 2395 | 2451 | |
| ... | ... | @@ -2398,20 +2454,19 @@ fn zirOptionalType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inner |
| 2398 | 2454 | const child_type = try sema.resolveType(block, src, inst_data.operand); |
| 2399 | 2455 | const opt_type = try sema.mod.optionalType(sema.arena, child_type); |
| 2400 | 2456 | |
| 2401 | return sema.mod.constType(sema.arena, src, opt_type); | |
| 2457 | return sema.addType(opt_type); | |
| 2402 | 2458 | } |
| 2403 | 2459 | |
| 2404 | fn zirElemType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2460 | fn zirElemType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2405 | 2461 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2406 | 2462 | const src = inst_data.src(); |
| 2407 | 2463 | const array_type = try sema.resolveType(block, src, inst_data.operand); |
| 2408 | 2464 | const elem_type = array_type.elemType(); |
| 2409 | return sema.mod.constType(sema.arena, src, elem_type); | |
| 2465 | return sema.addType(elem_type); | |
| 2410 | 2466 | } |
| 2411 | 2467 | |
| 2412 | fn zirVectorType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2468 | fn zirVectorType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2413 | 2469 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 2414 | const src = inst_data.src(); | |
| 2415 | 2470 | const elem_type_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2416 | 2471 | const len_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; |
| 2417 | 2472 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| ... | ... | @@ -2421,10 +2476,10 @@ fn zirVectorType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerEr |
| 2421 | 2476 | .len = len, |
| 2422 | 2477 | .elem_type = elem_type, |
| 2423 | 2478 | }); |
| 2424 | return sema.mod.constType(sema.arena, src, vector_type); | |
| 2479 | return sema.addType(vector_type); | |
| 2425 | 2480 | } |
| 2426 | 2481 | |
| 2427 | fn zirArrayType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2482 | fn zirArrayType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2428 | 2483 | const tracy = trace(@src()); |
| 2429 | 2484 | defer tracy.end(); |
| 2430 | 2485 | |
| ... | ... | @@ -2434,10 +2489,10 @@ fn zirArrayType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 2434 | 2489 | const elem_type = try sema.resolveType(block, .unneeded, bin_inst.rhs); |
| 2435 | 2490 | const array_ty = try sema.mod.arrayType(sema.arena, len.val.toUnsignedInt(), null, elem_type); |
| 2436 | 2491 | |
| 2437 | return sema.mod.constType(sema.arena, .unneeded, array_ty); | |
| 2492 | return sema.addType(array_ty); | |
| 2438 | 2493 | } |
| 2439 | 2494 | |
| 2440 | fn zirArrayTypeSentinel(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2495 | fn zirArrayTypeSentinel(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2441 | 2496 | const tracy = trace(@src()); |
| 2442 | 2497 | defer tracy.end(); |
| 2443 | 2498 | |
| ... | ... | @@ -2449,29 +2504,27 @@ fn zirArrayTypeSentinel(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) |
| 2449 | 2504 | const elem_type = try sema.resolveType(block, .unneeded, extra.elem_type); |
| 2450 | 2505 | const array_ty = try sema.mod.arrayType(sema.arena, len.val.toUnsignedInt(), sentinel.val, elem_type); |
| 2451 | 2506 | |
| 2452 | return sema.mod.constType(sema.arena, .unneeded, array_ty); | |
| 2507 | return sema.addType(array_ty); | |
| 2453 | 2508 | } |
| 2454 | 2509 | |
| 2455 | fn zirAnyframeType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2510 | fn zirAnyframeType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2456 | 2511 | const tracy = trace(@src()); |
| 2457 | 2512 | defer tracy.end(); |
| 2458 | 2513 | |
| 2459 | 2514 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2460 | const src = inst_data.src(); | |
| 2461 | 2515 | const operand_src: LazySrcLoc = .{ .node_offset_anyframe_type = inst_data.src_node }; |
| 2462 | 2516 | const return_type = try sema.resolveType(block, operand_src, inst_data.operand); |
| 2463 | 2517 | const anyframe_type = try Type.Tag.anyframe_T.create(sema.arena, return_type); |
| 2464 | 2518 | |
| 2465 | return sema.mod.constType(sema.arena, src, anyframe_type); | |
| 2519 | return sema.addType(anyframe_type); | |
| 2466 | 2520 | } |
| 2467 | 2521 | |
| 2468 | fn zirErrorUnionType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2522 | fn zirErrorUnionType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2469 | 2523 | const tracy = trace(@src()); |
| 2470 | 2524 | defer tracy.end(); |
| 2471 | 2525 | |
| 2472 | 2526 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 2473 | 2527 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 2474 | const src: LazySrcLoc = .{ .node_offset_bin_op = inst_data.src_node }; | |
| 2475 | 2528 | const lhs_src: LazySrcLoc = .{ .node_offset_bin_lhs = inst_data.src_node }; |
| 2476 | 2529 | const rhs_src: LazySrcLoc = .{ .node_offset_bin_rhs = inst_data.src_node }; |
| 2477 | 2530 | const error_union = try sema.resolveType(block, lhs_src, extra.lhs); |
| ... | ... | @@ -2483,59 +2536,55 @@ fn zirErrorUnionType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inn |
| 2483 | 2536 | }); |
| 2484 | 2537 | } |
| 2485 | 2538 | const err_union_ty = try sema.mod.errorUnionType(sema.arena, error_union, payload); |
| 2486 | return sema.mod.constType(sema.arena, src, err_union_ty); | |
| 2539 | return sema.addType(err_union_ty); | |
| 2487 | 2540 | } |
| 2488 | 2541 | |
| 2489 | fn zirErrorValue(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2542 | fn zirErrorValue(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2490 | 2543 | _ = block; |
| 2491 | 2544 | const tracy = trace(@src()); |
| 2492 | 2545 | defer tracy.end(); |
| 2493 | 2546 | |
| 2494 | 2547 | const inst_data = sema.code.instructions.items(.data)[inst].str_tok; |
| 2495 | const src = inst_data.src(); | |
| 2496 | 2548 | |
| 2497 | 2549 | // Create an anonymous error set type with only this error value, and return the value. |
| 2498 | 2550 | const kv = try sema.mod.getErrorValue(inst_data.get(sema.code)); |
| 2499 | 2551 | const result_type = try Type.Tag.error_set_single.create(sema.arena, kv.key); |
| 2500 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2501 | .ty = result_type, | |
| 2502 | .val = try Value.Tag.@"error".create(sema.arena, .{ | |
| 2552 | return sema.addConstant( | |
| 2553 | result_type, | |
| 2554 | try Value.Tag.@"error".create(sema.arena, .{ | |
| 2503 | 2555 | .name = kv.key, |
| 2504 | 2556 | }), |
| 2505 | }); | |
| 2557 | ); | |
| 2506 | 2558 | } |
| 2507 | 2559 | |
| 2508 | fn zirErrorToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2560 | fn zirErrorToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2509 | 2561 | const tracy = trace(@src()); |
| 2510 | 2562 | defer tracy.end(); |
| 2511 | 2563 | |
| 2512 | 2564 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2513 | 2565 | const src = inst_data.src(); |
| 2514 | 2566 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2515 | const op = try sema.resolveInst(inst_data.operand); | |
| 2567 | const op = sema.resolveInst(inst_data.operand); | |
| 2516 | 2568 | const op_coerced = try sema.coerce(block, Type.initTag(.anyerror), op, operand_src); |
| 2517 | 2569 | const result_ty = Type.initTag(.u16); |
| 2518 | 2570 | |
| 2519 | 2571 | if (try sema.resolvePossiblyUndefinedValue(block, src, op_coerced)) |val| { |
| 2520 | 2572 | if (val.isUndef()) { |
| 2521 | return sema.mod.constUndef(sema.arena, src, result_ty); | |
| 2573 | return sema.addConstUndef(result_ty); | |
| 2522 | 2574 | } |
| 2523 | 2575 | const payload = try sema.arena.create(Value.Payload.U64); |
| 2524 | 2576 | payload.* = .{ |
| 2525 | 2577 | .base = .{ .tag = .int_u64 }, |
| 2526 | 2578 | .data = (try sema.mod.getErrorValue(val.castTag(.@"error").?.data.name)).value, |
| 2527 | 2579 | }; |
| 2528 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2529 | .ty = result_ty, | |
| 2530 | .val = Value.initPayload(&payload.base), | |
| 2531 | }); | |
| 2580 | return sema.addConstant(result_ty, Value.initPayload(&payload.base)); | |
| 2532 | 2581 | } |
| 2533 | 2582 | |
| 2534 | 2583 | try sema.requireRuntimeBlock(block, src); |
| 2535 | return block.addUnOp(src, result_ty, .bitcast, op_coerced); | |
| 2584 | return block.addTyOp(.bitcast, result_ty, op_coerced); | |
| 2536 | 2585 | } |
| 2537 | 2586 | |
| 2538 | fn zirIntToError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2587 | fn zirIntToError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2539 | 2588 | const tracy = trace(@src()); |
| 2540 | 2589 | defer tracy.end(); |
| 2541 | 2590 | |
| ... | ... | @@ -2543,7 +2592,7 @@ fn zirIntToError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerEr |
| 2543 | 2592 | const src = inst_data.src(); |
| 2544 | 2593 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2545 | 2594 | |
| 2546 | const op = try sema.resolveInst(inst_data.operand); | |
| 2595 | const op = sema.resolveInst(inst_data.operand); | |
| 2547 | 2596 | |
| 2548 | 2597 | if (try sema.resolveDefinedValue(block, operand_src, op)) |value| { |
| 2549 | 2598 | const int = value.toUnsignedInt(); |
| ... | ... | @@ -2554,10 +2603,7 @@ fn zirIntToError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerEr |
| 2554 | 2603 | .base = .{ .tag = .@"error" }, |
| 2555 | 2604 | .data = .{ .name = sema.mod.error_name_list.items[@intCast(usize, int)] }, |
| 2556 | 2605 | }; |
| 2557 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2558 | .ty = Type.initTag(.anyerror), | |
| 2559 | .val = Value.initPayload(&payload.base), | |
| 2560 | }); | |
| 2606 | return sema.addConstant(Type.initTag(.anyerror), Value.initPayload(&payload.base)); | |
| 2561 | 2607 | } |
| 2562 | 2608 | try sema.requireRuntimeBlock(block, src); |
| 2563 | 2609 | if (block.wantSafety()) { |
| ... | ... | @@ -2565,10 +2611,10 @@ fn zirIntToError(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerEr |
| 2565 | 2611 | // const is_gt_max = @panic("TODO get max errors in compilation"); |
| 2566 | 2612 | // try sema.addSafetyCheck(block, is_gt_max, .invalid_error_code); |
| 2567 | 2613 | } |
| 2568 | return block.addUnOp(src, Type.initTag(.anyerror), .bitcast, op); | |
| 2614 | return block.addTyOp(.bitcast, Type.initTag(.anyerror), op); | |
| 2569 | 2615 | } |
| 2570 | 2616 | |
| 2571 | fn zirMergeErrorSets(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2617 | fn zirMergeErrorSets(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2572 | 2618 | const tracy = trace(@src()); |
| 2573 | 2619 | defer tracy.end(); |
| 2574 | 2620 | |
| ... | ... | @@ -2577,9 +2623,9 @@ fn zirMergeErrorSets(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inn |
| 2577 | 2623 | const src: LazySrcLoc = .{ .node_offset_bin_op = inst_data.src_node }; |
| 2578 | 2624 | const lhs_src: LazySrcLoc = .{ .node_offset_bin_lhs = inst_data.src_node }; |
| 2579 | 2625 | const rhs_src: LazySrcLoc = .{ .node_offset_bin_rhs = inst_data.src_node }; |
| 2580 | const lhs = try sema.resolveInst(extra.lhs); | |
| 2581 | const rhs = try sema.resolveInst(extra.rhs); | |
| 2582 | if (rhs.ty.zigTypeTag() == .Bool and lhs.ty.zigTypeTag() == .Bool) { | |
| 2626 | const lhs = sema.resolveInst(extra.lhs); | |
| 2627 | const rhs = sema.resolveInst(extra.rhs); | |
| 2628 | if (sema.typeOf(lhs).zigTypeTag() == .Bool and sema.typeOf(rhs).zigTypeTag() == .Bool) { | |
| 2583 | 2629 | const msg = msg: { |
| 2584 | 2630 | const msg = try sema.mod.errMsg(&block.base, lhs_src, "expected error set type, found 'bool'", .{}); |
| 2585 | 2631 | errdefer msg.destroy(sema.gpa); |
| ... | ... | @@ -2588,19 +2634,16 @@ fn zirMergeErrorSets(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inn |
| 2588 | 2634 | }; |
| 2589 | 2635 | return sema.mod.failWithOwnedErrorMsg(&block.base, msg); |
| 2590 | 2636 | } |
| 2591 | const rhs_ty = try sema.resolveAirAsType(block, rhs_src, rhs); | |
| 2592 | const lhs_ty = try sema.resolveAirAsType(block, lhs_src, lhs); | |
| 2593 | if (rhs_ty.zigTypeTag() != .ErrorSet) | |
| 2594 | return sema.mod.fail(&block.base, rhs_src, "expected error set type, found {}", .{rhs_ty}); | |
| 2637 | const lhs_ty = try sema.analyzeAsType(block, lhs_src, lhs); | |
| 2638 | const rhs_ty = try sema.analyzeAsType(block, rhs_src, rhs); | |
| 2595 | 2639 | if (lhs_ty.zigTypeTag() != .ErrorSet) |
| 2596 | 2640 | return sema.mod.fail(&block.base, lhs_src, "expected error set type, found {}", .{lhs_ty}); |
| 2641 | if (rhs_ty.zigTypeTag() != .ErrorSet) | |
| 2642 | return sema.mod.fail(&block.base, rhs_src, "expected error set type, found {}", .{rhs_ty}); | |
| 2597 | 2643 | |
| 2598 | 2644 | // Anything merged with anyerror is anyerror. |
| 2599 | 2645 | if (lhs_ty.tag() == .anyerror or rhs_ty.tag() == .anyerror) { |
| 2600 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2601 | .ty = Type.initTag(.type), | |
| 2602 | .val = Value.initTag(.anyerror_type), | |
| 2603 | }); | |
| 2646 | return Air.Inst.Ref.anyerror_type; | |
| 2604 | 2647 | } |
| 2605 | 2648 | // When we support inferred error sets, we'll want to use a data structure that can |
| 2606 | 2649 | // represent a merged set of errors without forcing them to be resolved here. Until then |
| ... | ... | @@ -2652,38 +2695,35 @@ fn zirMergeErrorSets(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inn |
| 2652 | 2695 | .names_len = @intCast(u32, new_names.len), |
| 2653 | 2696 | }; |
| 2654 | 2697 | const error_set_ty = try Type.Tag.error_set.create(sema.arena, new_error_set); |
| 2655 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2656 | .ty = Type.initTag(.type), | |
| 2657 | .val = try Value.Tag.ty.create(sema.arena, error_set_ty), | |
| 2658 | }); | |
| 2698 | return sema.addConstant(Type.initTag(.type), try Value.Tag.ty.create(sema.arena, error_set_ty)); | |
| 2659 | 2699 | } |
| 2660 | 2700 | |
| 2661 | fn zirEnumLiteral(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2701 | fn zirEnumLiteral(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2662 | 2702 | _ = block; |
| 2663 | 2703 | const tracy = trace(@src()); |
| 2664 | 2704 | defer tracy.end(); |
| 2665 | 2705 | |
| 2666 | 2706 | const inst_data = sema.code.instructions.items(.data)[inst].str_tok; |
| 2667 | const src = inst_data.src(); | |
| 2668 | 2707 | const duped_name = try sema.arena.dupe(u8, inst_data.get(sema.code)); |
| 2669 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2670 | .ty = Type.initTag(.enum_literal), | |
| 2671 | .val = try Value.Tag.enum_literal.create(sema.arena, duped_name), | |
| 2672 | }); | |
| 2708 | return sema.addConstant( | |
| 2709 | Type.initTag(.enum_literal), | |
| 2710 | try Value.Tag.enum_literal.create(sema.arena, duped_name), | |
| 2711 | ); | |
| 2673 | 2712 | } |
| 2674 | 2713 | |
| 2675 | fn zirEnumToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2714 | fn zirEnumToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2676 | 2715 | const mod = sema.mod; |
| 2677 | 2716 | const arena = sema.arena; |
| 2678 | 2717 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2679 | 2718 | const src = inst_data.src(); |
| 2680 | 2719 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2681 | const operand = try sema.resolveInst(inst_data.operand); | |
| 2720 | const operand = sema.resolveInst(inst_data.operand); | |
| 2721 | const operand_ty = sema.typeOf(operand); | |
| 2682 | 2722 | |
| 2683 | const enum_tag: *Inst = switch (operand.ty.zigTypeTag()) { | |
| 2723 | const enum_tag: Air.Inst.Ref = switch (operand_ty.zigTypeTag()) { | |
| 2684 | 2724 | .Enum => operand, |
| 2685 | 2725 | .Union => { |
| 2686 | //if (!operand.ty.unionHasTag()) { | |
| 2726 | //if (!operand_ty.unionHasTag()) { | |
| 2687 | 2727 | // return mod.fail( |
| 2688 | 2728 | // &block.base, |
| 2689 | 2729 | // operand_src, |
| ... | ... | @@ -2695,91 +2735,73 @@ fn zirEnumToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 2695 | 2735 | }, |
| 2696 | 2736 | else => { |
| 2697 | 2737 | return mod.fail(&block.base, operand_src, "expected enum or tagged union, found {}", .{ |
| 2698 | operand.ty, | |
| 2738 | operand_ty, | |
| 2699 | 2739 | }); |
| 2700 | 2740 | }, |
| 2701 | 2741 | }; |
| 2742 | const enum_tag_ty = sema.typeOf(enum_tag); | |
| 2702 | 2743 | |
| 2703 | 2744 | var int_tag_type_buffer: Type.Payload.Bits = undefined; |
| 2704 | const int_tag_ty = try enum_tag.ty.intTagType(&int_tag_type_buffer).copy(arena); | |
| 2745 | const int_tag_ty = try enum_tag_ty.intTagType(&int_tag_type_buffer).copy(arena); | |
| 2705 | 2746 | |
| 2706 | if (try sema.typeHasOnePossibleValue(block, src, enum_tag.ty)) |opv| { | |
| 2707 | return mod.constInst(arena, src, .{ | |
| 2708 | .ty = int_tag_ty, | |
| 2709 | .val = opv, | |
| 2710 | }); | |
| 2747 | if (try sema.typeHasOnePossibleValue(block, src, enum_tag_ty)) |opv| { | |
| 2748 | return sema.addConstant(int_tag_ty, opv); | |
| 2711 | 2749 | } |
| 2712 | 2750 | |
| 2713 | if (enum_tag.value()) |enum_tag_val| { | |
| 2751 | if (try sema.resolvePossiblyUndefinedValue(block, operand_src, enum_tag)) |enum_tag_val| { | |
| 2714 | 2752 | if (enum_tag_val.castTag(.enum_field_index)) |enum_field_payload| { |
| 2715 | 2753 | const field_index = enum_field_payload.data; |
| 2716 | switch (enum_tag.ty.tag()) { | |
| 2754 | switch (enum_tag_ty.tag()) { | |
| 2717 | 2755 | .enum_full => { |
| 2718 | const enum_full = enum_tag.ty.castTag(.enum_full).?.data; | |
| 2756 | const enum_full = enum_tag_ty.castTag(.enum_full).?.data; | |
| 2719 | 2757 | if (enum_full.values.count() != 0) { |
| 2720 | 2758 | const val = enum_full.values.keys()[field_index]; |
| 2721 | return mod.constInst(arena, src, .{ | |
| 2722 | .ty = int_tag_ty, | |
| 2723 | .val = val, | |
| 2724 | }); | |
| 2759 | return sema.addConstant(int_tag_ty, val); | |
| 2725 | 2760 | } else { |
| 2726 | 2761 | // Field index and integer values are the same. |
| 2727 | 2762 | const val = try Value.Tag.int_u64.create(arena, field_index); |
| 2728 | return mod.constInst(arena, src, .{ | |
| 2729 | .ty = int_tag_ty, | |
| 2730 | .val = val, | |
| 2731 | }); | |
| 2763 | return sema.addConstant(int_tag_ty, val); | |
| 2732 | 2764 | } |
| 2733 | 2765 | }, |
| 2734 | 2766 | .enum_simple => { |
| 2735 | 2767 | // Field index and integer values are the same. |
| 2736 | 2768 | const val = try Value.Tag.int_u64.create(arena, field_index); |
| 2737 | return mod.constInst(arena, src, .{ | |
| 2738 | .ty = int_tag_ty, | |
| 2739 | .val = val, | |
| 2740 | }); | |
| 2769 | return sema.addConstant(int_tag_ty, val); | |
| 2741 | 2770 | }, |
| 2742 | 2771 | else => unreachable, |
| 2743 | 2772 | } |
| 2744 | 2773 | } else { |
| 2745 | 2774 | // Assume it is already an integer and return it directly. |
| 2746 | return mod.constInst(arena, src, .{ | |
| 2747 | .ty = int_tag_ty, | |
| 2748 | .val = enum_tag_val, | |
| 2749 | }); | |
| 2775 | return sema.addConstant(int_tag_ty, enum_tag_val); | |
| 2750 | 2776 | } |
| 2751 | 2777 | } |
| 2752 | 2778 | |
| 2753 | 2779 | try sema.requireRuntimeBlock(block, src); |
| 2754 | return block.addUnOp(src, int_tag_ty, .bitcast, enum_tag); | |
| 2780 | return block.addTyOp(.bitcast, int_tag_ty, enum_tag); | |
| 2755 | 2781 | } |
| 2756 | 2782 | |
| 2757 | fn zirIntToEnum(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2783 | fn zirIntToEnum(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2758 | 2784 | const mod = sema.mod; |
| 2759 | 2785 | const target = mod.getTarget(); |
| 2760 | const arena = sema.arena; | |
| 2761 | 2786 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 2762 | 2787 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 2763 | 2788 | const src = inst_data.src(); |
| 2764 | 2789 | const dest_ty_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 2765 | 2790 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; |
| 2766 | 2791 | const dest_ty = try sema.resolveType(block, dest_ty_src, extra.lhs); |
| 2767 | const operand = try sema.resolveInst(extra.rhs); | |
| 2792 | const operand = sema.resolveInst(extra.rhs); | |
| 2768 | 2793 | |
| 2769 | 2794 | if (dest_ty.zigTypeTag() != .Enum) { |
| 2770 | 2795 | return mod.fail(&block.base, dest_ty_src, "expected enum, found {}", .{dest_ty}); |
| 2771 | 2796 | } |
| 2772 | 2797 | |
| 2773 | if (dest_ty.isNonexhaustiveEnum()) { | |
| 2774 | if (operand.value()) |int_val| { | |
| 2775 | return mod.constInst(arena, src, .{ | |
| 2776 | .ty = dest_ty, | |
| 2777 | .val = int_val, | |
| 2778 | }); | |
| 2798 | if (try sema.resolvePossiblyUndefinedValue(block, operand_src, operand)) |int_val| { | |
| 2799 | if (dest_ty.isNonexhaustiveEnum()) { | |
| 2800 | return sema.addConstant(dest_ty, int_val); | |
| 2801 | } | |
| 2802 | if (int_val.isUndef()) { | |
| 2803 | return sema.failWithUseOfUndef(block, operand_src); | |
| 2779 | 2804 | } |
| 2780 | } | |
| 2781 | ||
| 2782 | if (try sema.resolveDefinedValue(block, operand_src, operand)) |int_val| { | |
| 2783 | 2805 | if (!dest_ty.enumHasInt(int_val, target)) { |
| 2784 | 2806 | const msg = msg: { |
| 2785 | 2807 | const msg = try mod.errMsg( |
| ... | ... | @@ -2799,14 +2821,11 @@ fn zirIntToEnum(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 2799 | 2821 | }; |
| 2800 | 2822 | return mod.failWithOwnedErrorMsg(&block.base, msg); |
| 2801 | 2823 | } |
| 2802 | return mod.constInst(arena, src, .{ | |
| 2803 | .ty = dest_ty, | |
| 2804 | .val = int_val, | |
| 2805 | }); | |
| 2824 | return sema.addConstant(dest_ty, int_val); | |
| 2806 | 2825 | } |
| 2807 | 2826 | |
| 2808 | 2827 | try sema.requireRuntimeBlock(block, src); |
| 2809 | return block.addUnOp(src, dest_ty, .bitcast, operand); | |
| 2828 | return block.addTyOp(.bitcast, dest_ty, operand); | |
| 2810 | 2829 | } |
| 2811 | 2830 | |
| 2812 | 2831 | /// Pointer in, pointer out. |
| ... | ... | @@ -2815,41 +2834,39 @@ fn zirOptionalPayloadPtr( |
| 2815 | 2834 | block: *Scope.Block, |
| 2816 | 2835 | inst: Zir.Inst.Index, |
| 2817 | 2836 | safety_check: bool, |
| 2818 | ) InnerError!*Inst { | |
| 2837 | ) CompileError!Air.Inst.Ref { | |
| 2819 | 2838 | const tracy = trace(@src()); |
| 2820 | 2839 | defer tracy.end(); |
| 2821 | 2840 | |
| 2822 | 2841 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2823 | const optional_ptr = try sema.resolveInst(inst_data.operand); | |
| 2824 | assert(optional_ptr.ty.zigTypeTag() == .Pointer); | |
| 2842 | const optional_ptr = sema.resolveInst(inst_data.operand); | |
| 2843 | const optional_ptr_ty = sema.typeOf(optional_ptr); | |
| 2844 | assert(optional_ptr_ty.zigTypeTag() == .Pointer); | |
| 2825 | 2845 | const src = inst_data.src(); |
| 2826 | 2846 | |
| 2827 | const opt_type = optional_ptr.ty.elemType(); | |
| 2847 | const opt_type = optional_ptr_ty.elemType(); | |
| 2828 | 2848 | if (opt_type.zigTypeTag() != .Optional) { |
| 2829 | 2849 | return sema.mod.fail(&block.base, src, "expected optional type, found {}", .{opt_type}); |
| 2830 | 2850 | } |
| 2831 | 2851 | |
| 2832 | 2852 | const child_type = try opt_type.optionalChildAlloc(sema.arena); |
| 2833 | const child_pointer = try sema.mod.simplePtrType(sema.arena, child_type, !optional_ptr.ty.isConstPtr(), .One); | |
| 2853 | const child_pointer = try Module.simplePtrType(sema.arena, child_type, !optional_ptr_ty.isConstPtr(), .One); | |
| 2834 | 2854 | |
| 2835 | if (optional_ptr.value()) |pointer_val| { | |
| 2855 | if (try sema.resolveDefinedValue(block, src, optional_ptr)) |pointer_val| { | |
| 2836 | 2856 | const val = try pointer_val.pointerDeref(sema.arena); |
| 2837 | 2857 | if (val.isNull()) { |
| 2838 | 2858 | return sema.mod.fail(&block.base, src, "unable to unwrap null", .{}); |
| 2839 | 2859 | } |
| 2840 | 2860 | // The same Value represents the pointer to the optional and the payload. |
| 2841 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2842 | .ty = child_pointer, | |
| 2843 | .val = pointer_val, | |
| 2844 | }); | |
| 2861 | return sema.addConstant(child_pointer, pointer_val); | |
| 2845 | 2862 | } |
| 2846 | 2863 | |
| 2847 | 2864 | try sema.requireRuntimeBlock(block, src); |
| 2848 | 2865 | if (safety_check and block.wantSafety()) { |
| 2849 | const is_non_null = try block.addUnOp(src, Type.initTag(.bool), .is_non_null_ptr, optional_ptr); | |
| 2866 | const is_non_null = try block.addUnOp(.is_non_null_ptr, optional_ptr); | |
| 2850 | 2867 | try sema.addSafetyCheck(block, is_non_null, .unwrap_null); |
| 2851 | 2868 | } |
| 2852 | return block.addUnOp(src, child_pointer, .optional_payload_ptr, optional_ptr); | |
| 2869 | return block.addTyOp(.optional_payload_ptr, child_pointer, optional_ptr); | |
| 2853 | 2870 | } |
| 2854 | 2871 | |
| 2855 | 2872 | /// Value in, value out. |
| ... | ... | @@ -2858,36 +2875,34 @@ fn zirOptionalPayload( |
| 2858 | 2875 | block: *Scope.Block, |
| 2859 | 2876 | inst: Zir.Inst.Index, |
| 2860 | 2877 | safety_check: bool, |
| 2861 | ) InnerError!*Inst { | |
| 2878 | ) CompileError!Air.Inst.Ref { | |
| 2862 | 2879 | const tracy = trace(@src()); |
| 2863 | 2880 | defer tracy.end(); |
| 2864 | 2881 | |
| 2865 | 2882 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2866 | 2883 | const src = inst_data.src(); |
| 2867 | const operand = try sema.resolveInst(inst_data.operand); | |
| 2868 | const opt_type = operand.ty; | |
| 2884 | const operand = sema.resolveInst(inst_data.operand); | |
| 2885 | const operand_ty = sema.typeOf(operand); | |
| 2886 | const opt_type = operand_ty; | |
| 2869 | 2887 | if (opt_type.zigTypeTag() != .Optional) { |
| 2870 | 2888 | return sema.mod.fail(&block.base, src, "expected optional type, found {}", .{opt_type}); |
| 2871 | 2889 | } |
| 2872 | 2890 | |
| 2873 | 2891 | const child_type = try opt_type.optionalChildAlloc(sema.arena); |
| 2874 | 2892 | |
| 2875 | if (operand.value()) |val| { | |
| 2893 | if (try sema.resolveDefinedValue(block, src, operand)) |val| { | |
| 2876 | 2894 | if (val.isNull()) { |
| 2877 | 2895 | return sema.mod.fail(&block.base, src, "unable to unwrap null", .{}); |
| 2878 | 2896 | } |
| 2879 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2880 | .ty = child_type, | |
| 2881 | .val = val, | |
| 2882 | }); | |
| 2897 | return sema.addConstant(child_type, val); | |
| 2883 | 2898 | } |
| 2884 | 2899 | |
| 2885 | 2900 | try sema.requireRuntimeBlock(block, src); |
| 2886 | 2901 | if (safety_check and block.wantSafety()) { |
| 2887 | const is_non_null = try block.addUnOp(src, Type.initTag(.bool), .is_non_null, operand); | |
| 2902 | const is_non_null = try block.addUnOp(.is_non_null, operand); | |
| 2888 | 2903 | try sema.addSafetyCheck(block, is_non_null, .unwrap_null); |
| 2889 | 2904 | } |
| 2890 | return block.addUnOp(src, child_type, .optional_payload, operand); | |
| 2905 | return block.addTyOp(.optional_payload, child_type, operand); | |
| 2891 | 2906 | } |
| 2892 | 2907 | |
| 2893 | 2908 | /// Value in, value out |
| ... | ... | @@ -2896,32 +2911,35 @@ fn zirErrUnionPayload( |
| 2896 | 2911 | block: *Scope.Block, |
| 2897 | 2912 | inst: Zir.Inst.Index, |
| 2898 | 2913 | safety_check: bool, |
| 2899 | ) InnerError!*Inst { | |
| 2914 | ) CompileError!Air.Inst.Ref { | |
| 2900 | 2915 | const tracy = trace(@src()); |
| 2901 | 2916 | defer tracy.end(); |
| 2902 | 2917 | |
| 2903 | 2918 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2904 | 2919 | const src = inst_data.src(); |
| 2905 | const operand = try sema.resolveInst(inst_data.operand); | |
| 2906 | if (operand.ty.zigTypeTag() != .ErrorUnion) | |
| 2907 | return sema.mod.fail(&block.base, operand.src, "expected error union type, found '{}'", .{operand.ty}); | |
| 2920 | const operand = sema.resolveInst(inst_data.operand); | |
| 2921 | const operand_src = src; | |
| 2922 | const operand_ty = sema.typeOf(operand); | |
| 2923 | if (operand_ty.zigTypeTag() != .ErrorUnion) | |
| 2924 | return sema.mod.fail(&block.base, operand_src, "expected error union type, found '{}'", .{operand_ty}); | |
| 2908 | 2925 | |
| 2909 | if (operand.value()) |val| { | |
| 2926 | if (try sema.resolveDefinedValue(block, src, operand)) |val| { | |
| 2910 | 2927 | if (val.getError()) |name| { |
| 2911 | 2928 | return sema.mod.fail(&block.base, src, "caught unexpected error '{s}'", .{name}); |
| 2912 | 2929 | } |
| 2913 | 2930 | const data = val.castTag(.error_union).?.data; |
| 2914 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2915 | .ty = operand.ty.castTag(.error_union).?.data.payload, | |
| 2916 | .val = data, | |
| 2917 | }); | |
| 2931 | return sema.addConstant( | |
| 2932 | operand_ty.castTag(.error_union).?.data.payload, | |
| 2933 | data, | |
| 2934 | ); | |
| 2918 | 2935 | } |
| 2919 | 2936 | try sema.requireRuntimeBlock(block, src); |
| 2920 | 2937 | if (safety_check and block.wantSafety()) { |
| 2921 | const is_non_err = try block.addUnOp(src, Type.initTag(.bool), .is_err, operand); | |
| 2938 | const is_non_err = try block.addUnOp(.is_err, operand); | |
| 2922 | 2939 | try sema.addSafetyCheck(block, is_non_err, .unwrap_errunion); |
| 2923 | 2940 | } |
| 2924 | return block.addUnOp(src, operand.ty.castTag(.error_union).?.data.payload, .unwrap_errunion_payload, operand); | |
| 2941 | const result_ty = operand_ty.castTag(.error_union).?.data.payload; | |
| 2942 | return block.addTyOp(.unwrap_errunion_payload, result_ty, operand); | |
| 2925 | 2943 | } |
| 2926 | 2944 | |
| 2927 | 2945 | /// Pointer in, pointer out. |
| ... | ... | @@ -2930,109 +2948,107 @@ fn zirErrUnionPayloadPtr( |
| 2930 | 2948 | block: *Scope.Block, |
| 2931 | 2949 | inst: Zir.Inst.Index, |
| 2932 | 2950 | safety_check: bool, |
| 2933 | ) InnerError!*Inst { | |
| 2951 | ) CompileError!Air.Inst.Ref { | |
| 2934 | 2952 | const tracy = trace(@src()); |
| 2935 | 2953 | defer tracy.end(); |
| 2936 | 2954 | |
| 2937 | 2955 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2938 | 2956 | const src = inst_data.src(); |
| 2939 | const operand = try sema.resolveInst(inst_data.operand); | |
| 2940 | assert(operand.ty.zigTypeTag() == .Pointer); | |
| 2957 | const operand = sema.resolveInst(inst_data.operand); | |
| 2958 | const operand_ty = sema.typeOf(operand); | |
| 2959 | assert(operand_ty.zigTypeTag() == .Pointer); | |
| 2941 | 2960 | |
| 2942 | if (operand.ty.elemType().zigTypeTag() != .ErrorUnion) | |
| 2943 | return sema.mod.fail(&block.base, src, "expected error union type, found {}", .{operand.ty.elemType()}); | |
| 2961 | if (operand_ty.elemType().zigTypeTag() != .ErrorUnion) | |
| 2962 | return sema.mod.fail(&block.base, src, "expected error union type, found {}", .{operand_ty.elemType()}); | |
| 2944 | 2963 | |
| 2945 | const operand_pointer_ty = try sema.mod.simplePtrType(sema.arena, operand.ty.elemType().castTag(.error_union).?.data.payload, !operand.ty.isConstPtr(), .One); | |
| 2964 | const operand_pointer_ty = try Module.simplePtrType(sema.arena, operand_ty.elemType().castTag(.error_union).?.data.payload, !operand_ty.isConstPtr(), .One); | |
| 2946 | 2965 | |
| 2947 | if (operand.value()) |pointer_val| { | |
| 2966 | if (try sema.resolveDefinedValue(block, src, operand)) |pointer_val| { | |
| 2948 | 2967 | const val = try pointer_val.pointerDeref(sema.arena); |
| 2949 | 2968 | if (val.getError()) |name| { |
| 2950 | 2969 | return sema.mod.fail(&block.base, src, "caught unexpected error '{s}'", .{name}); |
| 2951 | 2970 | } |
| 2952 | 2971 | const data = val.castTag(.error_union).?.data; |
| 2953 | 2972 | // The same Value represents the pointer to the error union and the payload. |
| 2954 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2955 | .ty = operand_pointer_ty, | |
| 2956 | .val = try Value.Tag.ref_val.create( | |
| 2973 | return sema.addConstant( | |
| 2974 | operand_pointer_ty, | |
| 2975 | try Value.Tag.ref_val.create( | |
| 2957 | 2976 | sema.arena, |
| 2958 | 2977 | data, |
| 2959 | 2978 | ), |
| 2960 | }); | |
| 2979 | ); | |
| 2961 | 2980 | } |
| 2962 | 2981 | |
| 2963 | 2982 | try sema.requireRuntimeBlock(block, src); |
| 2964 | 2983 | if (safety_check and block.wantSafety()) { |
| 2965 | const is_non_err = try block.addUnOp(src, Type.initTag(.bool), .is_err, operand); | |
| 2984 | const is_non_err = try block.addUnOp(.is_err, operand); | |
| 2966 | 2985 | try sema.addSafetyCheck(block, is_non_err, .unwrap_errunion); |
| 2967 | 2986 | } |
| 2968 | return block.addUnOp(src, operand_pointer_ty, .unwrap_errunion_payload_ptr, operand); | |
| 2987 | return block.addTyOp(.unwrap_errunion_payload_ptr, operand_pointer_ty, operand); | |
| 2969 | 2988 | } |
| 2970 | 2989 | |
| 2971 | 2990 | /// Value in, value out |
| 2972 | fn zirErrUnionCode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 2991 | fn zirErrUnionCode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2973 | 2992 | const tracy = trace(@src()); |
| 2974 | 2993 | defer tracy.end(); |
| 2975 | 2994 | |
| 2976 | 2995 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 2977 | 2996 | const src = inst_data.src(); |
| 2978 | const operand = try sema.resolveInst(inst_data.operand); | |
| 2979 | if (operand.ty.zigTypeTag() != .ErrorUnion) | |
| 2980 | return sema.mod.fail(&block.base, src, "expected error union type, found '{}'", .{operand.ty}); | |
| 2997 | const operand = sema.resolveInst(inst_data.operand); | |
| 2998 | const operand_ty = sema.typeOf(operand); | |
| 2999 | if (operand_ty.zigTypeTag() != .ErrorUnion) | |
| 3000 | return sema.mod.fail(&block.base, src, "expected error union type, found '{}'", .{operand_ty}); | |
| 2981 | 3001 | |
| 2982 | const result_ty = operand.ty.castTag(.error_union).?.data.error_set; | |
| 3002 | const result_ty = operand_ty.castTag(.error_union).?.data.error_set; | |
| 2983 | 3003 | |
| 2984 | if (operand.value()) |val| { | |
| 3004 | if (try sema.resolveDefinedValue(block, src, operand)) |val| { | |
| 2985 | 3005 | assert(val.getError() != null); |
| 2986 | 3006 | const data = val.castTag(.error_union).?.data; |
| 2987 | return sema.mod.constInst(sema.arena, src, .{ | |
| 2988 | .ty = result_ty, | |
| 2989 | .val = data, | |
| 2990 | }); | |
| 3007 | return sema.addConstant(result_ty, data); | |
| 2991 | 3008 | } |
| 2992 | 3009 | |
| 2993 | 3010 | try sema.requireRuntimeBlock(block, src); |
| 2994 | return block.addUnOp(src, result_ty, .unwrap_errunion_err, operand); | |
| 3011 | return block.addTyOp(.unwrap_errunion_err, result_ty, operand); | |
| 2995 | 3012 | } |
| 2996 | 3013 | |
| 2997 | 3014 | /// Pointer in, value out |
| 2998 | fn zirErrUnionCodePtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3015 | fn zirErrUnionCodePtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 2999 | 3016 | const tracy = trace(@src()); |
| 3000 | 3017 | defer tracy.end(); |
| 3001 | 3018 | |
| 3002 | 3019 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 3003 | 3020 | const src = inst_data.src(); |
| 3004 | const operand = try sema.resolveInst(inst_data.operand); | |
| 3005 | assert(operand.ty.zigTypeTag() == .Pointer); | |
| 3021 | const operand = sema.resolveInst(inst_data.operand); | |
| 3022 | const operand_ty = sema.typeOf(operand); | |
| 3023 | assert(operand_ty.zigTypeTag() == .Pointer); | |
| 3006 | 3024 | |
| 3007 | if (operand.ty.elemType().zigTypeTag() != .ErrorUnion) | |
| 3008 | return sema.mod.fail(&block.base, src, "expected error union type, found {}", .{operand.ty.elemType()}); | |
| 3025 | if (operand_ty.elemType().zigTypeTag() != .ErrorUnion) | |
| 3026 | return sema.mod.fail(&block.base, src, "expected error union type, found {}", .{operand_ty.elemType()}); | |
| 3009 | 3027 | |
| 3010 | const result_ty = operand.ty.elemType().castTag(.error_union).?.data.error_set; | |
| 3028 | const result_ty = operand_ty.elemType().castTag(.error_union).?.data.error_set; | |
| 3011 | 3029 | |
| 3012 | if (operand.value()) |pointer_val| { | |
| 3030 | if (try sema.resolveDefinedValue(block, src, operand)) |pointer_val| { | |
| 3013 | 3031 | const val = try pointer_val.pointerDeref(sema.arena); |
| 3014 | 3032 | assert(val.getError() != null); |
| 3015 | 3033 | const data = val.castTag(.error_union).?.data; |
| 3016 | return sema.mod.constInst(sema.arena, src, .{ | |
| 3017 | .ty = result_ty, | |
| 3018 | .val = data, | |
| 3019 | }); | |
| 3034 | return sema.addConstant(result_ty, data); | |
| 3020 | 3035 | } |
| 3021 | 3036 | |
| 3022 | 3037 | try sema.requireRuntimeBlock(block, src); |
| 3023 | return block.addUnOp(src, result_ty, .unwrap_errunion_err_ptr, operand); | |
| 3038 | return block.addTyOp(.unwrap_errunion_err_ptr, result_ty, operand); | |
| 3024 | 3039 | } |
| 3025 | 3040 | |
| 3026 | fn zirEnsureErrPayloadVoid(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!void { | |
| 3041 | fn zirEnsureErrPayloadVoid(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!void { | |
| 3027 | 3042 | const tracy = trace(@src()); |
| 3028 | 3043 | defer tracy.end(); |
| 3029 | 3044 | |
| 3030 | 3045 | const inst_data = sema.code.instructions.items(.data)[inst].un_tok; |
| 3031 | 3046 | const src = inst_data.src(); |
| 3032 | const operand = try sema.resolveInst(inst_data.operand); | |
| 3033 | if (operand.ty.zigTypeTag() != .ErrorUnion) | |
| 3034 | return sema.mod.fail(&block.base, src, "expected error union type, found '{}'", .{operand.ty}); | |
| 3035 | if (operand.ty.castTag(.error_union).?.data.payload.zigTypeTag() != .Void) { | |
| 3047 | const operand = sema.resolveInst(inst_data.operand); | |
| 3048 | const operand_ty = sema.typeOf(operand); | |
| 3049 | if (operand_ty.zigTypeTag() != .ErrorUnion) | |
| 3050 | return sema.mod.fail(&block.base, src, "expected error union type, found '{}'", .{operand_ty}); | |
| 3051 | if (operand_ty.castTag(.error_union).?.data.payload.zigTypeTag() != .Void) { | |
| 3036 | 3052 | return sema.mod.fail(&block.base, src, "expression value is ignored", .{}); |
| 3037 | 3053 | } |
| 3038 | 3054 | } |
| ... | ... | @@ -3042,7 +3058,7 @@ fn zirFunc( |
| 3042 | 3058 | block: *Scope.Block, |
| 3043 | 3059 | inst: Zir.Inst.Index, |
| 3044 | 3060 | inferred_error_set: bool, |
| 3045 | ) InnerError!*Inst { | |
| 3061 | ) CompileError!Air.Inst.Ref { | |
| 3046 | 3062 | const tracy = trace(@src()); |
| 3047 | 3063 | defer tracy.end(); |
| 3048 | 3064 | |
| ... | ... | @@ -3093,7 +3109,7 @@ fn funcCommon( |
| 3093 | 3109 | is_extern: bool, |
| 3094 | 3110 | src_locs: Zir.Inst.Func.SrcLocs, |
| 3095 | 3111 | opt_lib_name: ?[]const u8, |
| 3096 | ) InnerError!*Inst { | |
| 3112 | ) CompileError!Air.Inst.Ref { | |
| 3097 | 3113 | const src: LazySrcLoc = .{ .node_offset = src_node_offset }; |
| 3098 | 3114 | const ret_ty_src: LazySrcLoc = .{ .node_offset_fn_type_ret_ty = src_node_offset }; |
| 3099 | 3115 | const bare_return_type = try sema.resolveType(block, ret_ty_src, zir_return_type); |
| ... | ... | @@ -3199,14 +3215,14 @@ fn funcCommon( |
| 3199 | 3215 | } |
| 3200 | 3216 | |
| 3201 | 3217 | if (is_extern) { |
| 3202 | return sema.mod.constInst(sema.arena, src, .{ | |
| 3203 | .ty = fn_ty, | |
| 3204 | .val = try Value.Tag.extern_fn.create(sema.arena, sema.owner_decl), | |
| 3205 | }); | |
| 3218 | return sema.addConstant( | |
| 3219 | fn_ty, | |
| 3220 | try Value.Tag.extern_fn.create(sema.arena, sema.owner_decl), | |
| 3221 | ); | |
| 3206 | 3222 | } |
| 3207 | 3223 | |
| 3208 | 3224 | if (body_inst == 0) { |
| 3209 | return mod.constType(sema.arena, src, fn_ty); | |
| 3225 | return sema.addType(fn_ty); | |
| 3210 | 3226 | } |
| 3211 | 3227 | |
| 3212 | 3228 | const is_inline = fn_ty.fnCallingConvention() == .Inline; |
| ... | ... | @@ -3217,7 +3233,6 @@ fn funcCommon( |
| 3217 | 3233 | .state = anal_state, |
| 3218 | 3234 | .zir_body_inst = body_inst, |
| 3219 | 3235 | .owner_decl = sema.owner_decl, |
| 3220 | .body = undefined, | |
| 3221 | 3236 | .lbrace_line = src_locs.lbrace_line, |
| 3222 | 3237 | .rbrace_line = src_locs.rbrace_line, |
| 3223 | 3238 | .lbrace_column = @truncate(u16, src_locs.columns), |
| ... | ... | @@ -3227,14 +3242,10 @@ fn funcCommon( |
| 3227 | 3242 | .base = .{ .tag = .function }, |
| 3228 | 3243 | .data = new_func, |
| 3229 | 3244 | }; |
| 3230 | const result = try sema.mod.constInst(sema.arena, src, .{ | |
| 3231 | .ty = fn_ty, | |
| 3232 | .val = Value.initPayload(&fn_payload.base), | |
| 3233 | }); | |
| 3234 | return result; | |
| 3245 | return sema.addConstant(fn_ty, Value.initPayload(&fn_payload.base)); | |
| 3235 | 3246 | } |
| 3236 | 3247 | |
| 3237 | fn zirAs(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3248 | fn zirAs(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3238 | 3249 | const tracy = trace(@src()); |
| 3239 | 3250 | defer tracy.end(); |
| 3240 | 3251 | |
| ... | ... | @@ -3242,7 +3253,7 @@ fn zirAs(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Ins |
| 3242 | 3253 | return sema.analyzeAs(block, .unneeded, bin_inst.lhs, bin_inst.rhs); |
| 3243 | 3254 | } |
| 3244 | 3255 | |
| 3245 | fn zirAsNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3256 | fn zirAsNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3246 | 3257 | const tracy = trace(@src()); |
| 3247 | 3258 | defer tracy.end(); |
| 3248 | 3259 | |
| ... | ... | @@ -3258,30 +3269,30 @@ fn analyzeAs( |
| 3258 | 3269 | src: LazySrcLoc, |
| 3259 | 3270 | zir_dest_type: Zir.Inst.Ref, |
| 3260 | 3271 | zir_operand: Zir.Inst.Ref, |
| 3261 | ) InnerError!*Inst { | |
| 3272 | ) CompileError!Air.Inst.Ref { | |
| 3262 | 3273 | const dest_type = try sema.resolveType(block, src, zir_dest_type); |
| 3263 | const operand = try sema.resolveInst(zir_operand); | |
| 3274 | const operand = sema.resolveInst(zir_operand); | |
| 3264 | 3275 | return sema.coerce(block, dest_type, operand, src); |
| 3265 | 3276 | } |
| 3266 | 3277 | |
| 3267 | fn zirPtrToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3278 | fn zirPtrToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3268 | 3279 | const tracy = trace(@src()); |
| 3269 | 3280 | defer tracy.end(); |
| 3270 | 3281 | |
| 3271 | 3282 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 3272 | const ptr = try sema.resolveInst(inst_data.operand); | |
| 3273 | if (ptr.ty.zigTypeTag() != .Pointer) { | |
| 3283 | const ptr = sema.resolveInst(inst_data.operand); | |
| 3284 | const ptr_ty = sema.typeOf(ptr); | |
| 3285 | if (ptr_ty.zigTypeTag() != .Pointer) { | |
| 3274 | 3286 | const ptr_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 3275 | return sema.mod.fail(&block.base, ptr_src, "expected pointer, found '{}'", .{ptr.ty}); | |
| 3287 | return sema.mod.fail(&block.base, ptr_src, "expected pointer, found '{}'", .{ptr_ty}); | |
| 3276 | 3288 | } |
| 3277 | 3289 | // TODO handle known-pointer-address |
| 3278 | 3290 | const src = inst_data.src(); |
| 3279 | 3291 | try sema.requireRuntimeBlock(block, src); |
| 3280 | const ty = Type.initTag(.usize); | |
| 3281 | return block.addUnOp(src, ty, .ptrtoint, ptr); | |
| 3292 | return block.addUnOp(.ptrtoint, ptr); | |
| 3282 | 3293 | } |
| 3283 | 3294 | |
| 3284 | fn zirFieldVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3295 | fn zirFieldVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3285 | 3296 | const tracy = trace(@src()); |
| 3286 | 3297 | defer tracy.end(); |
| 3287 | 3298 | |
| ... | ... | @@ -3290,16 +3301,17 @@ fn zirFieldVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 3290 | 3301 | const field_name_src: LazySrcLoc = .{ .node_offset_field_name = inst_data.src_node }; |
| 3291 | 3302 | const extra = sema.code.extraData(Zir.Inst.Field, inst_data.payload_index).data; |
| 3292 | 3303 | const field_name = sema.code.nullTerminatedString(extra.field_name_start); |
| 3293 | const object = try sema.resolveInst(extra.lhs); | |
| 3294 | const object_ptr = if (object.ty.zigTypeTag() == .Pointer) | |
| 3304 | const object = sema.resolveInst(extra.lhs); | |
| 3305 | const object_ptr = if (sema.typeOf(object).zigTypeTag() == .Pointer) | |
| 3295 | 3306 | object |
| 3296 | 3307 | else |
| 3297 | 3308 | try sema.analyzeRef(block, src, object); |
| 3298 | 3309 | const result_ptr = try sema.namedFieldPtr(block, src, object_ptr, field_name, field_name_src); |
| 3299 | return sema.analyzeLoad(block, src, result_ptr, result_ptr.src); | |
| 3310 | const result_ptr_src = src; | |
| 3311 | return sema.analyzeLoad(block, src, result_ptr, result_ptr_src); | |
| 3300 | 3312 | } |
| 3301 | 3313 | |
| 3302 | fn zirFieldPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3314 | fn zirFieldPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3303 | 3315 | const tracy = trace(@src()); |
| 3304 | 3316 | defer tracy.end(); |
| 3305 | 3317 | |
| ... | ... | @@ -3308,11 +3320,11 @@ fn zirFieldPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 3308 | 3320 | const field_name_src: LazySrcLoc = .{ .node_offset_field_name = inst_data.src_node }; |
| 3309 | 3321 | const extra = sema.code.extraData(Zir.Inst.Field, inst_data.payload_index).data; |
| 3310 | 3322 | const field_name = sema.code.nullTerminatedString(extra.field_name_start); |
| 3311 | const object_ptr = try sema.resolveInst(extra.lhs); | |
| 3323 | const object_ptr = sema.resolveInst(extra.lhs); | |
| 3312 | 3324 | return sema.namedFieldPtr(block, src, object_ptr, field_name, field_name_src); |
| 3313 | 3325 | } |
| 3314 | 3326 | |
| 3315 | fn zirFieldValNamed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3327 | fn zirFieldValNamed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3316 | 3328 | const tracy = trace(@src()); |
| 3317 | 3329 | defer tracy.end(); |
| 3318 | 3330 | |
| ... | ... | @@ -3320,14 +3332,14 @@ fn zirFieldValNamed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inne |
| 3320 | 3332 | const src = inst_data.src(); |
| 3321 | 3333 | const field_name_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; |
| 3322 | 3334 | const extra = sema.code.extraData(Zir.Inst.FieldNamed, inst_data.payload_index).data; |
| 3323 | const object = try sema.resolveInst(extra.lhs); | |
| 3335 | const object = sema.resolveInst(extra.lhs); | |
| 3324 | 3336 | const field_name = try sema.resolveConstString(block, field_name_src, extra.field_name); |
| 3325 | 3337 | const object_ptr = try sema.analyzeRef(block, src, object); |
| 3326 | 3338 | const result_ptr = try sema.namedFieldPtr(block, src, object_ptr, field_name, field_name_src); |
| 3327 | 3339 | return sema.analyzeLoad(block, src, result_ptr, src); |
| 3328 | 3340 | } |
| 3329 | 3341 | |
| 3330 | fn zirFieldPtrNamed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3342 | fn zirFieldPtrNamed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3331 | 3343 | const tracy = trace(@src()); |
| 3332 | 3344 | defer tracy.end(); |
| 3333 | 3345 | |
| ... | ... | @@ -3335,12 +3347,12 @@ fn zirFieldPtrNamed(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inne |
| 3335 | 3347 | const src = inst_data.src(); |
| 3336 | 3348 | const field_name_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; |
| 3337 | 3349 | const extra = sema.code.extraData(Zir.Inst.FieldNamed, inst_data.payload_index).data; |
| 3338 | const object_ptr = try sema.resolveInst(extra.lhs); | |
| 3350 | const object_ptr = sema.resolveInst(extra.lhs); | |
| 3339 | 3351 | const field_name = try sema.resolveConstString(block, field_name_src, extra.field_name); |
| 3340 | 3352 | return sema.namedFieldPtr(block, src, object_ptr, field_name, field_name_src); |
| 3341 | 3353 | } |
| 3342 | 3354 | |
| 3343 | fn zirIntCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3355 | fn zirIntCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3344 | 3356 | const tracy = trace(@src()); |
| 3345 | 3357 | defer tracy.end(); |
| 3346 | 3358 | |
| ... | ... | @@ -3351,7 +3363,7 @@ fn zirIntCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 3351 | 3363 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 3352 | 3364 | |
| 3353 | 3365 | const dest_type = try sema.resolveType(block, dest_ty_src, extra.lhs); |
| 3354 | const operand = try sema.resolveInst(extra.rhs); | |
| 3366 | const operand = sema.resolveInst(extra.rhs); | |
| 3355 | 3367 | |
| 3356 | 3368 | const dest_is_comptime_int = switch (dest_type.zigTypeTag()) { |
| 3357 | 3369 | .ComptimeInt => true, |
| ... | ... | @@ -3364,17 +3376,18 @@ fn zirIntCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 3364 | 3376 | ), |
| 3365 | 3377 | }; |
| 3366 | 3378 | |
| 3367 | switch (operand.ty.zigTypeTag()) { | |
| 3379 | const operand_ty = sema.typeOf(operand); | |
| 3380 | switch (operand_ty.zigTypeTag()) { | |
| 3368 | 3381 | .ComptimeInt, .Int => {}, |
| 3369 | 3382 | else => return sema.mod.fail( |
| 3370 | 3383 | &block.base, |
| 3371 | 3384 | operand_src, |
| 3372 | 3385 | "expected integer type, found '{}'", |
| 3373 | .{operand.ty}, | |
| 3386 | .{operand_ty}, | |
| 3374 | 3387 | ), |
| 3375 | 3388 | } |
| 3376 | 3389 | |
| 3377 | if (operand.value() != null) { | |
| 3390 | if (try sema.isComptimeKnown(block, operand_src, operand)) { | |
| 3378 | 3391 | return sema.coerce(block, dest_type, operand, operand_src); |
| 3379 | 3392 | } else if (dest_is_comptime_int) { |
| 3380 | 3393 | return sema.mod.fail(&block.base, src, "unable to cast runtime value to 'comptime_int'", .{}); |
| ... | ... | @@ -3383,20 +3396,21 @@ fn zirIntCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 3383 | 3396 | return sema.mod.fail(&block.base, src, "TODO implement analyze widen or shorten int", .{}); |
| 3384 | 3397 | } |
| 3385 | 3398 | |
| 3386 | fn zirBitcast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3399 | fn zirBitcast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3387 | 3400 | const tracy = trace(@src()); |
| 3388 | 3401 | defer tracy.end(); |
| 3389 | 3402 | |
| 3390 | 3403 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 3391 | 3404 | const dest_ty_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 3405 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; | |
| 3392 | 3406 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 3393 | 3407 | |
| 3394 | 3408 | const dest_type = try sema.resolveType(block, dest_ty_src, extra.lhs); |
| 3395 | const operand = try sema.resolveInst(extra.rhs); | |
| 3396 | return sema.bitcast(block, dest_type, operand); | |
| 3409 | const operand = sema.resolveInst(extra.rhs); | |
| 3410 | return sema.bitcast(block, dest_type, operand, operand_src); | |
| 3397 | 3411 | } |
| 3398 | 3412 | |
| 3399 | fn zirFloatCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3413 | fn zirFloatCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3400 | 3414 | const tracy = trace(@src()); |
| 3401 | 3415 | defer tracy.end(); |
| 3402 | 3416 | |
| ... | ... | @@ -3407,7 +3421,7 @@ fn zirFloatCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 3407 | 3421 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 3408 | 3422 | |
| 3409 | 3423 | const dest_type = try sema.resolveType(block, dest_ty_src, extra.lhs); |
| 3410 | const operand = try sema.resolveInst(extra.rhs); | |
| 3424 | const operand = sema.resolveInst(extra.rhs); | |
| 3411 | 3425 | |
| 3412 | 3426 | const dest_is_comptime_float = switch (dest_type.zigTypeTag()) { |
| 3413 | 3427 | .ComptimeFloat => true, |
| ... | ... | @@ -3420,17 +3434,18 @@ fn zirFloatCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 3420 | 3434 | ), |
| 3421 | 3435 | }; |
| 3422 | 3436 | |
| 3423 | switch (operand.ty.zigTypeTag()) { | |
| 3437 | const operand_ty = sema.typeOf(operand); | |
| 3438 | switch (operand_ty.zigTypeTag()) { | |
| 3424 | 3439 | .ComptimeFloat, .Float, .ComptimeInt => {}, |
| 3425 | 3440 | else => return sema.mod.fail( |
| 3426 | 3441 | &block.base, |
| 3427 | 3442 | operand_src, |
| 3428 | 3443 | "expected float type, found '{}'", |
| 3429 | .{operand.ty}, | |
| 3444 | .{operand_ty}, | |
| 3430 | 3445 | ), |
| 3431 | 3446 | } |
| 3432 | 3447 | |
| 3433 | if (operand.value() != null) { | |
| 3448 | if (try sema.isComptimeKnown(block, operand_src, operand)) { | |
| 3434 | 3449 | return sema.coerce(block, dest_type, operand, operand_src); |
| 3435 | 3450 | } else if (dest_is_comptime_float) { |
| 3436 | 3451 | return sema.mod.fail(&block.base, src, "unable to cast runtime value to 'comptime_float'", .{}); |
| ... | ... | @@ -3439,22 +3454,23 @@ fn zirFloatCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 3439 | 3454 | return sema.mod.fail(&block.base, src, "TODO implement analyze widen or shorten float", .{}); |
| 3440 | 3455 | } |
| 3441 | 3456 | |
| 3442 | fn zirElemVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3457 | fn zirElemVal(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3443 | 3458 | const tracy = trace(@src()); |
| 3444 | 3459 | defer tracy.end(); |
| 3445 | 3460 | |
| 3446 | 3461 | const bin_inst = sema.code.instructions.items(.data)[inst].bin; |
| 3447 | const array = try sema.resolveInst(bin_inst.lhs); | |
| 3448 | const array_ptr = if (array.ty.zigTypeTag() == .Pointer) | |
| 3462 | const array = sema.resolveInst(bin_inst.lhs); | |
| 3463 | const array_ty = sema.typeOf(array); | |
| 3464 | const array_ptr = if (array_ty.zigTypeTag() == .Pointer) | |
| 3449 | 3465 | array |
| 3450 | 3466 | else |
| 3451 | 3467 | try sema.analyzeRef(block, sema.src, array); |
| 3452 | const elem_index = try sema.resolveInst(bin_inst.rhs); | |
| 3468 | const elem_index = sema.resolveInst(bin_inst.rhs); | |
| 3453 | 3469 | const result_ptr = try sema.elemPtr(block, sema.src, array_ptr, elem_index, sema.src); |
| 3454 | 3470 | return sema.analyzeLoad(block, sema.src, result_ptr, sema.src); |
| 3455 | 3471 | } |
| 3456 | 3472 | |
| 3457 | fn zirElemValNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3473 | fn zirElemValNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3458 | 3474 | const tracy = trace(@src()); |
| 3459 | 3475 | defer tracy.end(); |
| 3460 | 3476 | |
| ... | ... | @@ -3462,27 +3478,28 @@ fn zirElemValNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerE |
| 3462 | 3478 | const src = inst_data.src(); |
| 3463 | 3479 | const elem_index_src: LazySrcLoc = .{ .node_offset_array_access_index = inst_data.src_node }; |
| 3464 | 3480 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 3465 | const array = try sema.resolveInst(extra.lhs); | |
| 3466 | const array_ptr = if (array.ty.zigTypeTag() == .Pointer) | |
| 3481 | const array = sema.resolveInst(extra.lhs); | |
| 3482 | const array_ty = sema.typeOf(array); | |
| 3483 | const array_ptr = if (array_ty.zigTypeTag() == .Pointer) | |
| 3467 | 3484 | array |
| 3468 | 3485 | else |
| 3469 | 3486 | try sema.analyzeRef(block, src, array); |
| 3470 | const elem_index = try sema.resolveInst(extra.rhs); | |
| 3487 | const elem_index = sema.resolveInst(extra.rhs); | |
| 3471 | 3488 | const result_ptr = try sema.elemPtr(block, src, array_ptr, elem_index, elem_index_src); |
| 3472 | 3489 | return sema.analyzeLoad(block, src, result_ptr, src); |
| 3473 | 3490 | } |
| 3474 | 3491 | |
| 3475 | fn zirElemPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3492 | fn zirElemPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3476 | 3493 | const tracy = trace(@src()); |
| 3477 | 3494 | defer tracy.end(); |
| 3478 | 3495 | |
| 3479 | 3496 | const bin_inst = sema.code.instructions.items(.data)[inst].bin; |
| 3480 | const array_ptr = try sema.resolveInst(bin_inst.lhs); | |
| 3481 | const elem_index = try sema.resolveInst(bin_inst.rhs); | |
| 3497 | const array_ptr = sema.resolveInst(bin_inst.lhs); | |
| 3498 | const elem_index = sema.resolveInst(bin_inst.rhs); | |
| 3482 | 3499 | return sema.elemPtr(block, sema.src, array_ptr, elem_index, sema.src); |
| 3483 | 3500 | } |
| 3484 | 3501 | |
| 3485 | fn zirElemPtrNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3502 | fn zirElemPtrNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3486 | 3503 | const tracy = trace(@src()); |
| 3487 | 3504 | defer tracy.end(); |
| 3488 | 3505 | |
| ... | ... | @@ -3490,39 +3507,39 @@ fn zirElemPtrNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerE |
| 3490 | 3507 | const src = inst_data.src(); |
| 3491 | 3508 | const elem_index_src: LazySrcLoc = .{ .node_offset_array_access_index = inst_data.src_node }; |
| 3492 | 3509 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 3493 | const array_ptr = try sema.resolveInst(extra.lhs); | |
| 3494 | const elem_index = try sema.resolveInst(extra.rhs); | |
| 3510 | const array_ptr = sema.resolveInst(extra.lhs); | |
| 3511 | const elem_index = sema.resolveInst(extra.rhs); | |
| 3495 | 3512 | return sema.elemPtr(block, src, array_ptr, elem_index, elem_index_src); |
| 3496 | 3513 | } |
| 3497 | 3514 | |
| 3498 | fn zirSliceStart(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3515 | fn zirSliceStart(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3499 | 3516 | const tracy = trace(@src()); |
| 3500 | 3517 | defer tracy.end(); |
| 3501 | 3518 | |
| 3502 | 3519 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 3503 | 3520 | const src = inst_data.src(); |
| 3504 | 3521 | const extra = sema.code.extraData(Zir.Inst.SliceStart, inst_data.payload_index).data; |
| 3505 | const array_ptr = try sema.resolveInst(extra.lhs); | |
| 3506 | const start = try sema.resolveInst(extra.start); | |
| 3522 | const array_ptr = sema.resolveInst(extra.lhs); | |
| 3523 | const start = sema.resolveInst(extra.start); | |
| 3507 | 3524 | |
| 3508 | return sema.analyzeSlice(block, src, array_ptr, start, null, null, .unneeded); | |
| 3525 | return sema.analyzeSlice(block, src, array_ptr, start, .none, .none, .unneeded); | |
| 3509 | 3526 | } |
| 3510 | 3527 | |
| 3511 | fn zirSliceEnd(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3528 | fn zirSliceEnd(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3512 | 3529 | const tracy = trace(@src()); |
| 3513 | 3530 | defer tracy.end(); |
| 3514 | 3531 | |
| 3515 | 3532 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 3516 | 3533 | const src = inst_data.src(); |
| 3517 | 3534 | const extra = sema.code.extraData(Zir.Inst.SliceEnd, inst_data.payload_index).data; |
| 3518 | const array_ptr = try sema.resolveInst(extra.lhs); | |
| 3519 | const start = try sema.resolveInst(extra.start); | |
| 3520 | const end = try sema.resolveInst(extra.end); | |
| 3535 | const array_ptr = sema.resolveInst(extra.lhs); | |
| 3536 | const start = sema.resolveInst(extra.start); | |
| 3537 | const end = sema.resolveInst(extra.end); | |
| 3521 | 3538 | |
| 3522 | return sema.analyzeSlice(block, src, array_ptr, start, end, null, .unneeded); | |
| 3539 | return sema.analyzeSlice(block, src, array_ptr, start, end, .none, .unneeded); | |
| 3523 | 3540 | } |
| 3524 | 3541 | |
| 3525 | fn zirSliceSentinel(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 3542 | fn zirSliceSentinel(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 3526 | 3543 | const tracy = trace(@src()); |
| 3527 | 3544 | defer tracy.end(); |
| 3528 | 3545 | |
| ... | ... | @@ -3530,10 +3547,10 @@ fn zirSliceSentinel(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inne |
| 3530 | 3547 | const src = inst_data.src(); |
| 3531 | 3548 | const sentinel_src: LazySrcLoc = .{ .node_offset_slice_sentinel = inst_data.src_node }; |
| 3532 | 3549 | const extra = sema.code.extraData(Zir.Inst.SliceSentinel, inst_data.payload_index).data; |
| 3533 | const array_ptr = try sema.resolveInst(extra.lhs); | |
| 3534 | const start = try sema.resolveInst(extra.start); | |
| 3535 | const end = try sema.resolveInst(extra.end); | |
| 3536 | const sentinel = try sema.resolveInst(extra.sentinel); | |
| 3550 | const array_ptr = sema.resolveInst(extra.lhs); | |
| 3551 | const start = sema.resolveInst(extra.start); | |
| 3552 | const end = sema.resolveInst(extra.end); | |
| 3553 | const sentinel = sema.resolveInst(extra.sentinel); | |
| 3537 | 3554 | |
| 3538 | 3555 | return sema.analyzeSlice(block, src, array_ptr, start, end, sentinel, sentinel_src); |
| 3539 | 3556 | } |
| ... | ... | @@ -3544,7 +3561,7 @@ fn zirSwitchCapture( |
| 3544 | 3561 | inst: Zir.Inst.Index, |
| 3545 | 3562 | is_multi: bool, |
| 3546 | 3563 | is_ref: bool, |
| 3547 | ) InnerError!*Inst { | |
| 3564 | ) CompileError!Air.Inst.Ref { | |
| 3548 | 3565 | const tracy = trace(@src()); |
| 3549 | 3566 | defer tracy.end(); |
| 3550 | 3567 | |
| ... | ... | @@ -3563,7 +3580,7 @@ fn zirSwitchCaptureElse( |
| 3563 | 3580 | block: *Scope.Block, |
| 3564 | 3581 | inst: Zir.Inst.Index, |
| 3565 | 3582 | is_ref: bool, |
| 3566 | ) InnerError!*Inst { | |
| 3583 | ) CompileError!Air.Inst.Ref { | |
| 3567 | 3584 | const tracy = trace(@src()); |
| 3568 | 3585 | defer tracy.end(); |
| 3569 | 3586 | |
| ... | ... | @@ -3582,7 +3599,7 @@ fn zirSwitchBlock( |
| 3582 | 3599 | inst: Zir.Inst.Index, |
| 3583 | 3600 | is_ref: bool, |
| 3584 | 3601 | special_prong: Zir.SpecialProng, |
| 3585 | ) InnerError!*Inst { | |
| 3602 | ) CompileError!Air.Inst.Ref { | |
| 3586 | 3603 | const tracy = trace(@src()); |
| 3587 | 3604 | defer tracy.end(); |
| 3588 | 3605 | |
| ... | ... | @@ -3591,7 +3608,7 @@ fn zirSwitchBlock( |
| 3591 | 3608 | const operand_src: LazySrcLoc = .{ .node_offset_switch_operand = inst_data.src_node }; |
| 3592 | 3609 | const extra = sema.code.extraData(Zir.Inst.SwitchBlock, inst_data.payload_index); |
| 3593 | 3610 | |
| 3594 | const operand_ptr = try sema.resolveInst(extra.data.operand); | |
| 3611 | const operand_ptr = sema.resolveInst(extra.data.operand); | |
| 3595 | 3612 | const operand = if (is_ref) |
| 3596 | 3613 | try sema.analyzeLoad(block, src, operand_ptr, operand_src) |
| 3597 | 3614 | else |
| ... | ... | @@ -3615,7 +3632,7 @@ fn zirSwitchBlockMulti( |
| 3615 | 3632 | inst: Zir.Inst.Index, |
| 3616 | 3633 | is_ref: bool, |
| 3617 | 3634 | special_prong: Zir.SpecialProng, |
| 3618 | ) InnerError!*Inst { | |
| 3635 | ) CompileError!Air.Inst.Ref { | |
| 3619 | 3636 | const tracy = trace(@src()); |
| 3620 | 3637 | defer tracy.end(); |
| 3621 | 3638 | |
| ... | ... | @@ -3624,7 +3641,7 @@ fn zirSwitchBlockMulti( |
| 3624 | 3641 | const operand_src: LazySrcLoc = .{ .node_offset_switch_operand = inst_data.src_node }; |
| 3625 | 3642 | const extra = sema.code.extraData(Zir.Inst.SwitchBlockMulti, inst_data.payload_index); |
| 3626 | 3643 | |
| 3627 | const operand_ptr = try sema.resolveInst(extra.data.operand); | |
| 3644 | const operand_ptr = sema.resolveInst(extra.data.operand); | |
| 3628 | 3645 | const operand = if (is_ref) |
| 3629 | 3646 | try sema.analyzeLoad(block, src, operand_ptr, operand_src) |
| 3630 | 3647 | else |
| ... | ... | @@ -3645,14 +3662,14 @@ fn zirSwitchBlockMulti( |
| 3645 | 3662 | fn analyzeSwitch( |
| 3646 | 3663 | sema: *Sema, |
| 3647 | 3664 | block: *Scope.Block, |
| 3648 | operand: *Inst, | |
| 3665 | operand: Air.Inst.Ref, | |
| 3649 | 3666 | extra_end: usize, |
| 3650 | 3667 | special_prong: Zir.SpecialProng, |
| 3651 | 3668 | scalar_cases_len: usize, |
| 3652 | 3669 | multi_cases_len: usize, |
| 3653 | 3670 | switch_inst: Zir.Inst.Index, |
| 3654 | 3671 | src_node_offset: i32, |
| 3655 | ) InnerError!*Inst { | |
| 3672 | ) CompileError!Air.Inst.Ref { | |
| 3656 | 3673 | const gpa = sema.gpa; |
| 3657 | 3674 | const mod = sema.mod; |
| 3658 | 3675 | |
| ... | ... | @@ -3671,9 +3688,10 @@ fn analyzeSwitch( |
| 3671 | 3688 | const src: LazySrcLoc = .{ .node_offset = src_node_offset }; |
| 3672 | 3689 | const special_prong_src: LazySrcLoc = .{ .node_offset_switch_special_prong = src_node_offset }; |
| 3673 | 3690 | const operand_src: LazySrcLoc = .{ .node_offset_switch_operand = src_node_offset }; |
| 3691 | const operand_ty = sema.typeOf(operand); | |
| 3674 | 3692 | |
| 3675 | 3693 | // Validate usage of '_' prongs. |
| 3676 | if (special_prong == .under and !operand.ty.isNonexhaustiveEnum()) { | |
| 3694 | if (special_prong == .under and !operand_ty.isNonexhaustiveEnum()) { | |
| 3677 | 3695 | const msg = msg: { |
| 3678 | 3696 | const msg = try mod.errMsg( |
| 3679 | 3697 | &block.base, |
| ... | ... | @@ -3695,9 +3713,9 @@ fn analyzeSwitch( |
| 3695 | 3713 | } |
| 3696 | 3714 | |
| 3697 | 3715 | // Validate for duplicate items, missing else prong, and invalid range. |
| 3698 | switch (operand.ty.zigTypeTag()) { | |
| 3716 | switch (operand_ty.zigTypeTag()) { | |
| 3699 | 3717 | .Enum => { |
| 3700 | var seen_fields = try gpa.alloc(?Module.SwitchProngSrc, operand.ty.enumFieldCount()); | |
| 3718 | var seen_fields = try gpa.alloc(?Module.SwitchProngSrc, operand_ty.enumFieldCount()); | |
| 3701 | 3719 | defer gpa.free(seen_fields); |
| 3702 | 3720 | |
| 3703 | 3721 | mem.set(?Module.SwitchProngSrc, seen_fields, null); |
| ... | ... | @@ -3743,7 +3761,7 @@ fn analyzeSwitch( |
| 3743 | 3761 | ); |
| 3744 | 3762 | } |
| 3745 | 3763 | |
| 3746 | try sema.validateSwitchNoRange(block, ranges_len, operand.ty, src_node_offset); | |
| 3764 | try sema.validateSwitchNoRange(block, ranges_len, operand_ty, src_node_offset); | |
| 3747 | 3765 | } |
| 3748 | 3766 | } |
| 3749 | 3767 | const all_tags_handled = for (seen_fields) |seen_src| { |
| ... | ... | @@ -3764,7 +3782,7 @@ fn analyzeSwitch( |
| 3764 | 3782 | for (seen_fields) |seen_src, i| { |
| 3765 | 3783 | if (seen_src != null) continue; |
| 3766 | 3784 | |
| 3767 | const field_name = operand.ty.enumFieldName(i); | |
| 3785 | const field_name = operand_ty.enumFieldName(i); | |
| 3768 | 3786 | |
| 3769 | 3787 | // TODO have this point to the tag decl instead of here |
| 3770 | 3788 | try mod.errNote( |
| ... | ... | @@ -3776,10 +3794,10 @@ fn analyzeSwitch( |
| 3776 | 3794 | ); |
| 3777 | 3795 | } |
| 3778 | 3796 | try mod.errNoteNonLazy( |
| 3779 | operand.ty.declSrcLoc(), | |
| 3797 | operand_ty.declSrcLoc(), | |
| 3780 | 3798 | msg, |
| 3781 | 3799 | "enum '{}' declared here", |
| 3782 | .{operand.ty}, | |
| 3800 | .{operand_ty}, | |
| 3783 | 3801 | ); |
| 3784 | 3802 | break :msg msg; |
| 3785 | 3803 | }; |
| ... | ... | @@ -3874,12 +3892,12 @@ fn analyzeSwitch( |
| 3874 | 3892 | } |
| 3875 | 3893 | |
| 3876 | 3894 | check_range: { |
| 3877 | if (operand.ty.zigTypeTag() == .Int) { | |
| 3895 | if (operand_ty.zigTypeTag() == .Int) { | |
| 3878 | 3896 | var arena = std.heap.ArenaAllocator.init(gpa); |
| 3879 | 3897 | defer arena.deinit(); |
| 3880 | 3898 | |
| 3881 | const min_int = try operand.ty.minInt(&arena, mod.getTarget()); | |
| 3882 | const max_int = try operand.ty.maxInt(&arena, mod.getTarget()); | |
| 3899 | const min_int = try operand_ty.minInt(&arena, mod.getTarget()); | |
| 3900 | const max_int = try operand_ty.maxInt(&arena, mod.getTarget()); | |
| 3883 | 3901 | if (try range_set.spans(min_int, max_int)) { |
| 3884 | 3902 | if (special_prong == .@"else") { |
| 3885 | 3903 | return mod.fail( |
| ... | ... | @@ -3949,7 +3967,7 @@ fn analyzeSwitch( |
| 3949 | 3967 | ); |
| 3950 | 3968 | } |
| 3951 | 3969 | |
| 3952 | try sema.validateSwitchNoRange(block, ranges_len, operand.ty, src_node_offset); | |
| 3970 | try sema.validateSwitchNoRange(block, ranges_len, operand_ty, src_node_offset); | |
| 3953 | 3971 | } |
| 3954 | 3972 | } |
| 3955 | 3973 | switch (special_prong) { |
| ... | ... | @@ -3981,7 +3999,7 @@ fn analyzeSwitch( |
| 3981 | 3999 | &block.base, |
| 3982 | 4000 | src, |
| 3983 | 4001 | "else prong required when switching on type '{}'", |
| 3984 | .{operand.ty}, | |
| 4002 | .{operand_ty}, | |
| 3985 | 4003 | ); |
| 3986 | 4004 | } |
| 3987 | 4005 | |
| ... | ... | @@ -4029,7 +4047,7 @@ fn analyzeSwitch( |
| 4029 | 4047 | ); |
| 4030 | 4048 | } |
| 4031 | 4049 | |
| 4032 | try sema.validateSwitchNoRange(block, ranges_len, operand.ty, src_node_offset); | |
| 4050 | try sema.validateSwitchNoRange(block, ranges_len, operand_ty, src_node_offset); | |
| 4033 | 4051 | } |
| 4034 | 4052 | } |
| 4035 | 4053 | }, |
| ... | ... | @@ -4049,20 +4067,15 @@ fn analyzeSwitch( |
| 4049 | 4067 | .ComptimeFloat, |
| 4050 | 4068 | .Float, |
| 4051 | 4069 | => return mod.fail(&block.base, operand_src, "invalid switch operand type '{}'", .{ |
| 4052 | operand.ty, | |
| 4070 | operand_ty, | |
| 4053 | 4071 | }), |
| 4054 | 4072 | } |
| 4055 | 4073 | |
| 4056 | const block_inst = try sema.arena.create(Inst.Block); | |
| 4057 | block_inst.* = .{ | |
| 4058 | .base = .{ | |
| 4059 | .tag = Inst.Block.base_tag, | |
| 4060 | .ty = undefined, // Set after analysis. | |
| 4061 | .src = src, | |
| 4062 | }, | |
| 4063 | .body = undefined, | |
| 4064 | }; | |
| 4065 | ||
| 4074 | const block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 4075 | try sema.air_instructions.append(gpa, .{ | |
| 4076 | .tag = .block, | |
| 4077 | .data = undefined, | |
| 4078 | }); | |
| 4066 | 4079 | var label: Scope.Block.Label = .{ |
| 4067 | 4080 | .zir_block = switch_inst, |
| 4068 | 4081 | .merges = .{ |
| ... | ... | @@ -4098,8 +4111,8 @@ fn analyzeSwitch( |
| 4098 | 4111 | const body = sema.code.extra[extra_index..][0..body_len]; |
| 4099 | 4112 | extra_index += body_len; |
| 4100 | 4113 | |
| 4114 | const item = sema.resolveInst(item_ref); | |
| 4101 | 4115 | // Validation above ensured these will succeed. |
| 4102 | const item = sema.resolveInst(item_ref) catch unreachable; | |
| 4103 | 4116 | const item_val = sema.resolveConstValue(&child_block, .unneeded, item) catch unreachable; |
| 4104 | 4117 | if (operand_val.eql(item_val)) { |
| 4105 | 4118 | return sema.resolveBlockBody(block, src, &child_block, body, merges); |
| ... | ... | @@ -4120,9 +4133,9 @@ fn analyzeSwitch( |
| 4120 | 4133 | const body = sema.code.extra[extra_index + 2 * ranges_len ..][0..body_len]; |
| 4121 | 4134 | |
| 4122 | 4135 | for (items) |item_ref| { |
| 4136 | const item = sema.resolveInst(item_ref); | |
| 4123 | 4137 | // Validation above ensured these will succeed. |
| 4124 | const item = sema.resolveInst(item_ref) catch unreachable; | |
| 4125 | const item_val = sema.resolveConstValue(&child_block, item.src, item) catch unreachable; | |
| 4138 | const item_val = sema.resolveConstValue(&child_block, .unneeded, item) catch unreachable; | |
| 4126 | 4139 | if (operand_val.eql(item_val)) { |
| 4127 | 4140 | return sema.resolveBlockBody(block, src, &child_block, body, merges); |
| 4128 | 4141 | } |
| ... | ... | @@ -4157,13 +4170,15 @@ fn analyzeSwitch( |
| 4157 | 4170 | |
| 4158 | 4171 | try sema.requireRuntimeBlock(block, src); |
| 4159 | 4172 | |
| 4160 | // TODO when reworking AIR memory layout make multi cases get generated as cases, | |
| 4161 | // not as part of the "else" block. | |
| 4162 | const cases = try sema.arena.alloc(Inst.SwitchBr.Case, scalar_cases_len); | |
| 4173 | var cases_extra: std.ArrayListUnmanaged(u32) = .{}; | |
| 4174 | defer cases_extra.deinit(gpa); | |
| 4175 | ||
| 4176 | try cases_extra.ensureTotalCapacity(gpa, (scalar_cases_len + multi_cases_len) * | |
| 4177 | @typeInfo(Air.SwitchBr.Case).Struct.fields.len + 2); | |
| 4163 | 4178 | |
| 4164 | 4179 | var case_block = child_block.makeSubBlock(); |
| 4165 | 4180 | case_block.runtime_loop = null; |
| 4166 | case_block.runtime_cond = operand.src; | |
| 4181 | case_block.runtime_cond = operand_src; | |
| 4167 | 4182 | case_block.runtime_index += 1; |
| 4168 | 4183 | defer case_block.instructions.deinit(gpa); |
| 4169 | 4184 | |
| ... | ... | @@ -4179,21 +4194,26 @@ fn analyzeSwitch( |
| 4179 | 4194 | extra_index += body_len; |
| 4180 | 4195 | |
| 4181 | 4196 | case_block.instructions.shrinkRetainingCapacity(0); |
| 4182 | // We validate these above; these two calls are guaranteed to succeed. | |
| 4183 | const item = sema.resolveInst(item_ref) catch unreachable; | |
| 4184 | const item_val = sema.resolveConstValue(&case_block, .unneeded, item) catch unreachable; | |
| 4197 | const item = sema.resolveInst(item_ref); | |
| 4198 | // `item` is already guaranteed to be constant known. | |
| 4185 | 4199 | |
| 4186 | 4200 | _ = try sema.analyzeBody(&case_block, body); |
| 4187 | 4201 | |
| 4188 | cases[scalar_i] = .{ | |
| 4189 | .item = item_val, | |
| 4190 | .body = .{ .instructions = try sema.arena.dupe(*Inst, case_block.instructions.items) }, | |
| 4191 | }; | |
| 4202 | try cases_extra.ensureUnusedCapacity(gpa, 3 + case_block.instructions.items.len); | |
| 4203 | cases_extra.appendAssumeCapacity(1); // items_len | |
| 4204 | cases_extra.appendAssumeCapacity(@intCast(u32, case_block.instructions.items.len)); | |
| 4205 | cases_extra.appendAssumeCapacity(@enumToInt(item)); | |
| 4206 | cases_extra.appendSliceAssumeCapacity(case_block.instructions.items); | |
| 4192 | 4207 | } |
| 4193 | 4208 | |
| 4194 | var first_else_body: Body = undefined; | |
| 4195 | var prev_condbr: ?*Inst.CondBr = null; | |
| 4209 | var is_first = true; | |
| 4210 | var prev_cond_br: Air.Inst.Index = undefined; | |
| 4211 | var first_else_body: []const Air.Inst.Index = &.{}; | |
| 4212 | defer gpa.free(first_else_body); | |
| 4213 | var prev_then_body: []const Air.Inst.Index = &.{}; | |
| 4214 | defer gpa.free(prev_then_body); | |
| 4196 | 4215 | |
| 4216 | var cases_len = scalar_cases_len; | |
| 4197 | 4217 | var multi_i: usize = 0; |
| 4198 | 4218 | while (multi_i < multi_cases_len) : (multi_i += 1) { |
| 4199 | 4219 | const items_len = sema.code.extra[extra_index]; |
| ... | ... | @@ -4207,116 +4227,146 @@ fn analyzeSwitch( |
| 4207 | 4227 | |
| 4208 | 4228 | case_block.instructions.shrinkRetainingCapacity(0); |
| 4209 | 4229 | |
| 4210 | var any_ok: ?*Inst = null; | |
| 4211 | const bool_ty = comptime Type.initTag(.bool); | |
| 4230 | var any_ok: Air.Inst.Ref = .none; | |
| 4212 | 4231 | |
| 4213 | for (items) |item_ref| { | |
| 4214 | const item = try sema.resolveInst(item_ref); | |
| 4215 | _ = try sema.resolveConstValue(&child_block, item.src, item); | |
| 4232 | // If there are any ranges, we have to put all the items into the | |
| 4233 | // else prong. Otherwise, we can take advantage of multiple items | |
| 4234 | // mapping to the same body. | |
| 4235 | if (ranges_len == 0) { | |
| 4236 | cases_len += 1; | |
| 4216 | 4237 | |
| 4217 | const cmp_ok = try case_block.addBinOp(item.src, bool_ty, .cmp_eq, operand, item); | |
| 4218 | if (any_ok) |some| { | |
| 4219 | any_ok = try case_block.addBinOp(item.src, bool_ty, .bool_or, some, cmp_ok); | |
| 4220 | } else { | |
| 4221 | any_ok = cmp_ok; | |
| 4238 | const body = sema.code.extra[extra_index..][0..body_len]; | |
| 4239 | extra_index += body_len; | |
| 4240 | _ = try sema.analyzeBody(&case_block, body); | |
| 4241 | ||
| 4242 | try cases_extra.ensureUnusedCapacity(gpa, 2 + items.len + | |
| 4243 | case_block.instructions.items.len); | |
| 4244 | ||
| 4245 | cases_extra.appendAssumeCapacity(@intCast(u32, items.len)); | |
| 4246 | cases_extra.appendAssumeCapacity(@intCast(u32, case_block.instructions.items.len)); | |
| 4247 | ||
| 4248 | for (items) |item_ref| { | |
| 4249 | const item = sema.resolveInst(item_ref); | |
| 4250 | cases_extra.appendAssumeCapacity(@enumToInt(item)); | |
| 4222 | 4251 | } |
| 4223 | } | |
| 4224 | 4252 | |
| 4225 | var range_i: usize = 0; | |
| 4226 | while (range_i < ranges_len) : (range_i += 1) { | |
| 4227 | const first_ref = @intToEnum(Zir.Inst.Ref, sema.code.extra[extra_index]); | |
| 4228 | extra_index += 1; | |
| 4229 | const last_ref = @intToEnum(Zir.Inst.Ref, sema.code.extra[extra_index]); | |
| 4230 | extra_index += 1; | |
| 4253 | cases_extra.appendSliceAssumeCapacity(case_block.instructions.items); | |
| 4254 | } else { | |
| 4255 | for (items) |item_ref| { | |
| 4256 | const item = sema.resolveInst(item_ref); | |
| 4257 | const cmp_ok = try case_block.addBinOp(.cmp_eq, operand, item); | |
| 4258 | if (any_ok != .none) { | |
| 4259 | any_ok = try case_block.addBinOp(.bool_or, any_ok, cmp_ok); | |
| 4260 | } else { | |
| 4261 | any_ok = cmp_ok; | |
| 4262 | } | |
| 4263 | } | |
| 4231 | 4264 | |
| 4232 | const item_first = try sema.resolveInst(first_ref); | |
| 4233 | const item_last = try sema.resolveInst(last_ref); | |
| 4265 | var range_i: usize = 0; | |
| 4266 | while (range_i < ranges_len) : (range_i += 1) { | |
| 4267 | const first_ref = @intToEnum(Zir.Inst.Ref, sema.code.extra[extra_index]); | |
| 4268 | extra_index += 1; | |
| 4269 | const last_ref = @intToEnum(Zir.Inst.Ref, sema.code.extra[extra_index]); | |
| 4270 | extra_index += 1; | |
| 4234 | 4271 | |
| 4235 | _ = try sema.resolveConstValue(&child_block, item_first.src, item_first); | |
| 4236 | _ = try sema.resolveConstValue(&child_block, item_last.src, item_last); | |
| 4272 | const item_first = sema.resolveInst(first_ref); | |
| 4273 | const item_last = sema.resolveInst(last_ref); | |
| 4237 | 4274 | |
| 4238 | const range_src = item_first.src; | |
| 4275 | // operand >= first and operand <= last | |
| 4276 | const range_first_ok = try case_block.addBinOp( | |
| 4277 | .cmp_gte, | |
| 4278 | operand, | |
| 4279 | item_first, | |
| 4280 | ); | |
| 4281 | const range_last_ok = try case_block.addBinOp( | |
| 4282 | .cmp_lte, | |
| 4283 | operand, | |
| 4284 | item_last, | |
| 4285 | ); | |
| 4286 | const range_ok = try case_block.addBinOp( | |
| 4287 | .bool_and, | |
| 4288 | range_first_ok, | |
| 4289 | range_last_ok, | |
| 4290 | ); | |
| 4291 | if (any_ok != .none) { | |
| 4292 | any_ok = try case_block.addBinOp(.bool_or, any_ok, range_ok); | |
| 4293 | } else { | |
| 4294 | any_ok = range_ok; | |
| 4295 | } | |
| 4296 | } | |
| 4239 | 4297 | |
| 4240 | // operand >= first and operand <= last | |
| 4241 | const range_first_ok = try case_block.addBinOp( | |
| 4242 | item_first.src, | |
| 4243 | bool_ty, | |
| 4244 | .cmp_gte, | |
| 4245 | operand, | |
| 4246 | item_first, | |
| 4247 | ); | |
| 4248 | const range_last_ok = try case_block.addBinOp( | |
| 4249 | item_last.src, | |
| 4250 | bool_ty, | |
| 4251 | .cmp_lte, | |
| 4252 | operand, | |
| 4253 | item_last, | |
| 4254 | ); | |
| 4255 | const range_ok = try case_block.addBinOp( | |
| 4256 | range_src, | |
| 4257 | bool_ty, | |
| 4258 | .bool_and, | |
| 4259 | range_first_ok, | |
| 4260 | range_last_ok, | |
| 4261 | ); | |
| 4262 | if (any_ok) |some| { | |
| 4263 | any_ok = try case_block.addBinOp(range_src, bool_ty, .bool_or, some, range_ok); | |
| 4298 | const new_cond_br = try case_block.addInstAsIndex(.{ .tag = .cond_br, .data = .{ | |
| 4299 | .pl_op = .{ | |
| 4300 | .operand = any_ok, | |
| 4301 | .payload = undefined, | |
| 4302 | }, | |
| 4303 | } }); | |
| 4304 | var cond_body = case_block.instructions.toOwnedSlice(gpa); | |
| 4305 | defer gpa.free(cond_body); | |
| 4306 | ||
| 4307 | case_block.instructions.shrinkRetainingCapacity(0); | |
| 4308 | const body = sema.code.extra[extra_index..][0..body_len]; | |
| 4309 | extra_index += body_len; | |
| 4310 | _ = try sema.analyzeBody(&case_block, body); | |
| 4311 | ||
| 4312 | if (is_first) { | |
| 4313 | is_first = false; | |
| 4314 | first_else_body = cond_body; | |
| 4315 | cond_body = &.{}; | |
| 4264 | 4316 | } else { |
| 4265 | any_ok = range_ok; | |
| 4317 | try sema.air_extra.ensureUnusedCapacity( | |
| 4318 | gpa, | |
| 4319 | @typeInfo(Air.CondBr).Struct.fields.len + prev_then_body.len + cond_body.len, | |
| 4320 | ); | |
| 4321 | ||
| 4322 | sema.air_instructions.items(.data)[prev_cond_br].pl_op.payload = | |
| 4323 | sema.addExtraAssumeCapacity(Air.CondBr{ | |
| 4324 | .then_body_len = @intCast(u32, prev_then_body.len), | |
| 4325 | .else_body_len = @intCast(u32, cond_body.len), | |
| 4326 | }); | |
| 4327 | sema.air_extra.appendSliceAssumeCapacity(prev_then_body); | |
| 4328 | sema.air_extra.appendSliceAssumeCapacity(cond_body); | |
| 4266 | 4329 | } |
| 4330 | prev_then_body = case_block.instructions.toOwnedSlice(gpa); | |
| 4331 | prev_cond_br = new_cond_br; | |
| 4267 | 4332 | } |
| 4333 | } | |
| 4268 | 4334 | |
| 4269 | const new_condbr = try sema.arena.create(Inst.CondBr); | |
| 4270 | new_condbr.* = .{ | |
| 4271 | .base = .{ | |
| 4272 | .tag = .condbr, | |
| 4273 | .ty = Type.initTag(.noreturn), | |
| 4274 | .src = src, | |
| 4275 | }, | |
| 4276 | .condition = any_ok.?, | |
| 4277 | .then_body = undefined, | |
| 4278 | .else_body = undefined, | |
| 4279 | }; | |
| 4280 | try case_block.instructions.append(gpa, &new_condbr.base); | |
| 4281 | ||
| 4282 | const cond_body: Body = .{ | |
| 4283 | .instructions = try sema.arena.dupe(*Inst, case_block.instructions.items), | |
| 4284 | }; | |
| 4285 | ||
| 4335 | var final_else_body: []const Air.Inst.Index = &.{}; | |
| 4336 | if (special.body.len != 0) { | |
| 4286 | 4337 | case_block.instructions.shrinkRetainingCapacity(0); |
| 4287 | const body = sema.code.extra[extra_index..][0..body_len]; | |
| 4288 | extra_index += body_len; | |
| 4289 | _ = try sema.analyzeBody(&case_block, body); | |
| 4290 | new_condbr.then_body = .{ | |
| 4291 | .instructions = try sema.arena.dupe(*Inst, case_block.instructions.items), | |
| 4292 | }; | |
| 4293 | if (prev_condbr) |condbr| { | |
| 4294 | condbr.else_body = cond_body; | |
| 4338 | _ = try sema.analyzeBody(&case_block, special.body); | |
| 4339 | ||
| 4340 | if (is_first) { | |
| 4341 | final_else_body = case_block.instructions.items; | |
| 4295 | 4342 | } else { |
| 4296 | first_else_body = cond_body; | |
| 4343 | try sema.air_extra.ensureUnusedCapacity(gpa, prev_then_body.len + | |
| 4344 | @typeInfo(Air.CondBr).Struct.fields.len + case_block.instructions.items.len); | |
| 4345 | ||
| 4346 | sema.air_instructions.items(.data)[prev_cond_br].pl_op.payload = | |
| 4347 | sema.addExtraAssumeCapacity(Air.CondBr{ | |
| 4348 | .then_body_len = @intCast(u32, prev_then_body.len), | |
| 4349 | .else_body_len = @intCast(u32, case_block.instructions.items.len), | |
| 4350 | }); | |
| 4351 | sema.air_extra.appendSliceAssumeCapacity(prev_then_body); | |
| 4352 | sema.air_extra.appendSliceAssumeCapacity(case_block.instructions.items); | |
| 4353 | final_else_body = first_else_body; | |
| 4297 | 4354 | } |
| 4298 | prev_condbr = new_condbr; | |
| 4299 | 4355 | } |
| 4300 | 4356 | |
| 4301 | const final_else_body: Body = blk: { | |
| 4302 | if (special.body.len != 0) { | |
| 4303 | case_block.instructions.shrinkRetainingCapacity(0); | |
| 4304 | _ = try sema.analyzeBody(&case_block, special.body); | |
| 4305 | const else_body: Body = .{ | |
| 4306 | .instructions = try sema.arena.dupe(*Inst, case_block.instructions.items), | |
| 4307 | }; | |
| 4308 | if (prev_condbr) |condbr| { | |
| 4309 | condbr.else_body = else_body; | |
| 4310 | break :blk first_else_body; | |
| 4311 | } else { | |
| 4312 | break :blk else_body; | |
| 4313 | } | |
| 4314 | } else { | |
| 4315 | break :blk .{ .instructions = &.{} }; | |
| 4316 | } | |
| 4317 | }; | |
| 4357 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.SwitchBr).Struct.fields.len + | |
| 4358 | cases_extra.items.len + final_else_body.len); | |
| 4359 | ||
| 4360 | _ = try child_block.addInst(.{ .tag = .switch_br, .data = .{ .pl_op = .{ | |
| 4361 | .operand = operand, | |
| 4362 | .payload = sema.addExtraAssumeCapacity(Air.SwitchBr{ | |
| 4363 | .cases_len = @intCast(u32, cases_len), | |
| 4364 | .else_body_len = @intCast(u32, final_else_body.len), | |
| 4365 | }), | |
| 4366 | } } }); | |
| 4367 | sema.air_extra.appendSliceAssumeCapacity(cases_extra.items); | |
| 4368 | sema.air_extra.appendSliceAssumeCapacity(final_else_body); | |
| 4318 | 4369 | |
| 4319 | _ = try child_block.addSwitchBr(src, operand, cases, final_else_body); | |
| 4320 | 4370 | return sema.analyzeBlockBody(block, src, &child_block, merges); |
| 4321 | 4371 | } |
| 4322 | 4372 | |
| ... | ... | @@ -4327,20 +4377,24 @@ fn resolveSwitchItemVal( |
| 4327 | 4377 | switch_node_offset: i32, |
| 4328 | 4378 | switch_prong_src: Module.SwitchProngSrc, |
| 4329 | 4379 | range_expand: Module.SwitchProngSrc.RangeExpand, |
| 4330 | ) InnerError!TypedValue { | |
| 4331 | const item = try sema.resolveInst(item_ref); | |
| 4332 | // We have to avoid the other helper functions here because we cannot construct a LazySrcLoc | |
| 4333 | // because we only have the switch AST node. Only if we know for sure we need to report | |
| 4334 | // a compile error do we resolve the full source locations. | |
| 4335 | if (item.value()) |val| { | |
| 4336 | if (val.isUndef()) { | |
| 4380 | ) CompileError!TypedValue { | |
| 4381 | const item = sema.resolveInst(item_ref); | |
| 4382 | const item_ty = sema.typeOf(item); | |
| 4383 | // Constructing a LazySrcLoc is costly because we only have the switch AST node. | |
| 4384 | // Only if we know for sure we need to report a compile error do we resolve the | |
| 4385 | // full source locations. | |
| 4386 | if (sema.resolveConstValue(block, .unneeded, item)) |val| { | |
| 4387 | return TypedValue{ .ty = item_ty, .val = val }; | |
| 4388 | } else |err| switch (err) { | |
| 4389 | error.NeededSourceLocation => { | |
| 4337 | 4390 | const src = switch_prong_src.resolve(sema.gpa, block.src_decl, switch_node_offset, range_expand); |
| 4338 | return sema.failWithUseOfUndef(block, src); | |
| 4339 | } | |
| 4340 | return TypedValue{ .ty = item.ty, .val = val }; | |
| 4391 | return TypedValue{ | |
| 4392 | .ty = item_ty, | |
| 4393 | .val = try sema.resolveConstValue(block, src, item), | |
| 4394 | }; | |
| 4395 | }, | |
| 4396 | else => |e| return e, | |
| 4341 | 4397 | } |
| 4342 | const src = switch_prong_src.resolve(sema.gpa, block.src_decl, switch_node_offset, range_expand); | |
| 4343 | return sema.failWithNeededComptime(block, src); | |
| 4344 | 4398 | } |
| 4345 | 4399 | |
| 4346 | 4400 | fn validateSwitchRange( |
| ... | ... | @@ -4351,7 +4405,7 @@ fn validateSwitchRange( |
| 4351 | 4405 | last_ref: Zir.Inst.Ref, |
| 4352 | 4406 | src_node_offset: i32, |
| 4353 | 4407 | switch_prong_src: Module.SwitchProngSrc, |
| 4354 | ) InnerError!void { | |
| 4408 | ) CompileError!void { | |
| 4355 | 4409 | const first_val = (try sema.resolveSwitchItemVal(block, first_ref, src_node_offset, switch_prong_src, .first)).val; |
| 4356 | 4410 | const last_val = (try sema.resolveSwitchItemVal(block, last_ref, src_node_offset, switch_prong_src, .last)).val; |
| 4357 | 4411 | const maybe_prev_src = try range_set.add(first_val, last_val, switch_prong_src); |
| ... | ... | @@ -4365,7 +4419,7 @@ fn validateSwitchItem( |
| 4365 | 4419 | item_ref: Zir.Inst.Ref, |
| 4366 | 4420 | src_node_offset: i32, |
| 4367 | 4421 | switch_prong_src: Module.SwitchProngSrc, |
| 4368 | ) InnerError!void { | |
| 4422 | ) CompileError!void { | |
| 4369 | 4423 | const item_val = (try sema.resolveSwitchItemVal(block, item_ref, src_node_offset, switch_prong_src, .none)).val; |
| 4370 | 4424 | const maybe_prev_src = try range_set.add(item_val, item_val, switch_prong_src); |
| 4371 | 4425 | return sema.validateSwitchDupe(block, maybe_prev_src, switch_prong_src, src_node_offset); |
| ... | ... | @@ -4378,7 +4432,7 @@ fn validateSwitchItemEnum( |
| 4378 | 4432 | item_ref: Zir.Inst.Ref, |
| 4379 | 4433 | src_node_offset: i32, |
| 4380 | 4434 | switch_prong_src: Module.SwitchProngSrc, |
| 4381 | ) InnerError!void { | |
| 4435 | ) CompileError!void { | |
| 4382 | 4436 | const mod = sema.mod; |
| 4383 | 4437 | const item_tv = try sema.resolveSwitchItemVal(block, item_ref, src_node_offset, switch_prong_src, .none); |
| 4384 | 4438 | const field_index = item_tv.ty.enumTagFieldIndex(item_tv.val) orelse { |
| ... | ... | @@ -4412,7 +4466,7 @@ fn validateSwitchDupe( |
| 4412 | 4466 | maybe_prev_src: ?Module.SwitchProngSrc, |
| 4413 | 4467 | switch_prong_src: Module.SwitchProngSrc, |
| 4414 | 4468 | src_node_offset: i32, |
| 4415 | ) InnerError!void { | |
| 4469 | ) CompileError!void { | |
| 4416 | 4470 | const prev_prong_src = maybe_prev_src orelse return; |
| 4417 | 4471 | const mod = sema.mod; |
| 4418 | 4472 | const gpa = sema.gpa; |
| ... | ... | @@ -4446,7 +4500,7 @@ fn validateSwitchItemBool( |
| 4446 | 4500 | item_ref: Zir.Inst.Ref, |
| 4447 | 4501 | src_node_offset: i32, |
| 4448 | 4502 | switch_prong_src: Module.SwitchProngSrc, |
| 4449 | ) InnerError!void { | |
| 4503 | ) CompileError!void { | |
| 4450 | 4504 | const item_val = (try sema.resolveSwitchItemVal(block, item_ref, src_node_offset, switch_prong_src, .none)).val; |
| 4451 | 4505 | if (item_val.toBool()) { |
| 4452 | 4506 | true_count.* += 1; |
| ... | ... | @@ -4468,7 +4522,7 @@ fn validateSwitchItemSparse( |
| 4468 | 4522 | item_ref: Zir.Inst.Ref, |
| 4469 | 4523 | src_node_offset: i32, |
| 4470 | 4524 | switch_prong_src: Module.SwitchProngSrc, |
| 4471 | ) InnerError!void { | |
| 4525 | ) CompileError!void { | |
| 4472 | 4526 | const item_val = (try sema.resolveSwitchItemVal(block, item_ref, src_node_offset, switch_prong_src, .none)).val; |
| 4473 | 4527 | const kv = (try seen_values.fetchPut(item_val, switch_prong_src)) orelse return; |
| 4474 | 4528 | return sema.validateSwitchDupe(block, kv.value, switch_prong_src, src_node_offset); |
| ... | ... | @@ -4480,7 +4534,7 @@ fn validateSwitchNoRange( |
| 4480 | 4534 | ranges_len: u32, |
| 4481 | 4535 | operand_ty: Type, |
| 4482 | 4536 | src_node_offset: i32, |
| 4483 | ) InnerError!void { | |
| 4537 | ) CompileError!void { | |
| 4484 | 4538 | if (ranges_len == 0) |
| 4485 | 4539 | return; |
| 4486 | 4540 | |
| ... | ... | @@ -4507,7 +4561,7 @@ fn validateSwitchNoRange( |
| 4507 | 4561 | return sema.mod.failWithOwnedErrorMsg(&block.base, msg); |
| 4508 | 4562 | } |
| 4509 | 4563 | |
| 4510 | fn zirHasField(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4564 | fn zirHasField(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4511 | 4565 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 4512 | 4566 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 4513 | 4567 | _ = extra; |
| ... | ... | @@ -4516,16 +4570,14 @@ fn zirHasField(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 4516 | 4570 | return sema.mod.fail(&block.base, src, "TODO implement zirHasField", .{}); |
| 4517 | 4571 | } |
| 4518 | 4572 | |
| 4519 | fn zirHasDecl(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4573 | fn zirHasDecl(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4520 | 4574 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 4521 | 4575 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 4522 | const src = inst_data.src(); | |
| 4523 | 4576 | const lhs_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 4524 | 4577 | const rhs_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; |
| 4525 | 4578 | const container_type = try sema.resolveType(block, lhs_src, extra.lhs); |
| 4526 | 4579 | const decl_name = try sema.resolveConstString(block, rhs_src, extra.rhs); |
| 4527 | 4580 | const mod = sema.mod; |
| 4528 | const arena = sema.arena; | |
| 4529 | 4581 | |
| 4530 | 4582 | const namespace = container_type.getNamespace() orelse return mod.fail( |
| 4531 | 4583 | &block.base, |
| ... | ... | @@ -4535,13 +4587,13 @@ fn zirHasDecl(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 4535 | 4587 | ); |
| 4536 | 4588 | if (try sema.lookupInNamespace(namespace, decl_name)) |decl| { |
| 4537 | 4589 | if (decl.is_pub or decl.namespace.file_scope == block.base.namespace().file_scope) { |
| 4538 | return mod.constBool(arena, src, true); | |
| 4590 | return Air.Inst.Ref.bool_true; | |
| 4539 | 4591 | } |
| 4540 | 4592 | } |
| 4541 | return mod.constBool(arena, src, false); | |
| 4593 | return Air.Inst.Ref.bool_false; | |
| 4542 | 4594 | } |
| 4543 | 4595 | |
| 4544 | fn zirImport(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4596 | fn zirImport(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4545 | 4597 | const tracy = trace(@src()); |
| 4546 | 4598 | defer tracy.end(); |
| 4547 | 4599 | |
| ... | ... | @@ -4563,16 +4615,16 @@ fn zirImport(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError! |
| 4563 | 4615 | try mod.semaFile(result.file); |
| 4564 | 4616 | const file_root_decl = result.file.root_decl.?; |
| 4565 | 4617 | try sema.mod.declareDeclDependency(sema.owner_decl, file_root_decl); |
| 4566 | return mod.constType(sema.arena, src, file_root_decl.ty); | |
| 4618 | return sema.addType(file_root_decl.ty); | |
| 4567 | 4619 | } |
| 4568 | 4620 | |
| 4569 | fn zirRetErrValueCode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4621 | fn zirRetErrValueCode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4570 | 4622 | _ = block; |
| 4571 | 4623 | _ = inst; |
| 4572 | 4624 | return sema.mod.fail(&block.base, sema.src, "TODO implement zirRetErrValueCode", .{}); |
| 4573 | 4625 | } |
| 4574 | 4626 | |
| 4575 | fn zirShl(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4627 | fn zirShl(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4576 | 4628 | const tracy = trace(@src()); |
| 4577 | 4629 | defer tracy.end(); |
| 4578 | 4630 | |
| ... | ... | @@ -4581,7 +4633,7 @@ fn zirShl(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*In |
| 4581 | 4633 | return sema.mod.fail(&block.base, sema.src, "TODO implement zirShl", .{}); |
| 4582 | 4634 | } |
| 4583 | 4635 | |
| 4584 | fn zirShr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4636 | fn zirShr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4585 | 4637 | const tracy = trace(@src()); |
| 4586 | 4638 | defer tracy.end(); |
| 4587 | 4639 | |
| ... | ... | @@ -4593,8 +4645,8 @@ fn zirBitwise( |
| 4593 | 4645 | sema: *Sema, |
| 4594 | 4646 | block: *Scope.Block, |
| 4595 | 4647 | inst: Zir.Inst.Index, |
| 4596 | ir_tag: ir.Inst.Tag, | |
| 4597 | ) InnerError!*Inst { | |
| 4648 | air_tag: Air.Inst.Tag, | |
| 4649 | ) CompileError!Air.Inst.Ref { | |
| 4598 | 4650 | const tracy = trace(@src()); |
| 4599 | 4651 | defer tracy.end(); |
| 4600 | 4652 | |
| ... | ... | @@ -4603,10 +4655,12 @@ fn zirBitwise( |
| 4603 | 4655 | const lhs_src: LazySrcLoc = .{ .node_offset_bin_lhs = inst_data.src_node }; |
| 4604 | 4656 | const rhs_src: LazySrcLoc = .{ .node_offset_bin_rhs = inst_data.src_node }; |
| 4605 | 4657 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 4606 | const lhs = try sema.resolveInst(extra.lhs); | |
| 4607 | const rhs = try sema.resolveInst(extra.rhs); | |
| 4658 | const lhs = sema.resolveInst(extra.lhs); | |
| 4659 | const rhs = sema.resolveInst(extra.rhs); | |
| 4660 | const lhs_ty = sema.typeOf(lhs); | |
| 4661 | const rhs_ty = sema.typeOf(rhs); | |
| 4608 | 4662 | |
| 4609 | const instructions = &[_]*Inst{ lhs, rhs }; | |
| 4663 | const instructions = &[_]Air.Inst.Ref{ lhs, rhs }; | |
| 4610 | 4664 | const resolved_type = try sema.resolvePeerTypes(block, src, instructions); |
| 4611 | 4665 | const casted_lhs = try sema.coerce(block, resolved_type, lhs, lhs_src); |
| 4612 | 4666 | const casted_rhs = try sema.coerce(block, resolved_type, rhs, rhs_src); |
| ... | ... | @@ -4618,41 +4672,41 @@ fn zirBitwise( |
| 4618 | 4672 | |
| 4619 | 4673 | const scalar_tag = scalar_type.zigTypeTag(); |
| 4620 | 4674 | |
| 4621 | if (lhs.ty.zigTypeTag() == .Vector and rhs.ty.zigTypeTag() == .Vector) { | |
| 4622 | if (lhs.ty.arrayLen() != rhs.ty.arrayLen()) { | |
| 4675 | if (lhs_ty.zigTypeTag() == .Vector and rhs_ty.zigTypeTag() == .Vector) { | |
| 4676 | if (lhs_ty.arrayLen() != rhs_ty.arrayLen()) { | |
| 4623 | 4677 | return sema.mod.fail(&block.base, src, "vector length mismatch: {d} and {d}", .{ |
| 4624 | lhs.ty.arrayLen(), | |
| 4625 | rhs.ty.arrayLen(), | |
| 4678 | lhs_ty.arrayLen(), | |
| 4679 | rhs_ty.arrayLen(), | |
| 4626 | 4680 | }); |
| 4627 | 4681 | } |
| 4628 | 4682 | return sema.mod.fail(&block.base, src, "TODO implement support for vectors in zirBitwise", .{}); |
| 4629 | } else if (lhs.ty.zigTypeTag() == .Vector or rhs.ty.zigTypeTag() == .Vector) { | |
| 4683 | } else if (lhs_ty.zigTypeTag() == .Vector or rhs_ty.zigTypeTag() == .Vector) { | |
| 4630 | 4684 | return sema.mod.fail(&block.base, src, "mixed scalar and vector operands to binary expression: '{}' and '{}'", .{ |
| 4631 | lhs.ty, | |
| 4632 | rhs.ty, | |
| 4685 | lhs_ty, | |
| 4686 | rhs_ty, | |
| 4633 | 4687 | }); |
| 4634 | 4688 | } |
| 4635 | 4689 | |
| 4636 | 4690 | const is_int = scalar_tag == .Int or scalar_tag == .ComptimeInt; |
| 4637 | 4691 | |
| 4638 | 4692 | if (!is_int) { |
| 4639 | return sema.mod.fail(&block.base, src, "invalid operands to binary bitwise expression: '{s}' and '{s}'", .{ @tagName(lhs.ty.zigTypeTag()), @tagName(rhs.ty.zigTypeTag()) }); | |
| 4693 | return sema.mod.fail(&block.base, src, "invalid operands to binary bitwise expression: '{s}' and '{s}'", .{ @tagName(lhs_ty.zigTypeTag()), @tagName(rhs_ty.zigTypeTag()) }); | |
| 4640 | 4694 | } |
| 4641 | 4695 | |
| 4642 | if (casted_lhs.value()) |lhs_val| { | |
| 4643 | if (casted_rhs.value()) |rhs_val| { | |
| 4696 | if (try sema.resolvePossiblyUndefinedValue(block, lhs_src, casted_lhs)) |lhs_val| { | |
| 4697 | if (try sema.resolvePossiblyUndefinedValue(block, rhs_src, casted_rhs)) |rhs_val| { | |
| 4644 | 4698 | if (lhs_val.isUndef() or rhs_val.isUndef()) { |
| 4645 | return sema.mod.constUndef(sema.arena, src, resolved_type); | |
| 4699 | return sema.addConstUndef(resolved_type); | |
| 4646 | 4700 | } |
| 4647 | 4701 | return sema.mod.fail(&block.base, src, "TODO implement comptime bitwise operations", .{}); |
| 4648 | 4702 | } |
| 4649 | 4703 | } |
| 4650 | 4704 | |
| 4651 | 4705 | try sema.requireRuntimeBlock(block, src); |
| 4652 | return block.addBinOp(src, scalar_type, ir_tag, casted_lhs, casted_rhs); | |
| 4706 | return block.addBinOp(air_tag, casted_lhs, casted_rhs); | |
| 4653 | 4707 | } |
| 4654 | 4708 | |
| 4655 | fn zirBitNot(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4709 | fn zirBitNot(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4656 | 4710 | const tracy = trace(@src()); |
| 4657 | 4711 | defer tracy.end(); |
| 4658 | 4712 | |
| ... | ... | @@ -4660,7 +4714,7 @@ fn zirBitNot(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError! |
| 4660 | 4714 | return sema.mod.fail(&block.base, sema.src, "TODO implement zirBitNot", .{}); |
| 4661 | 4715 | } |
| 4662 | 4716 | |
| 4663 | fn zirArrayCat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4717 | fn zirArrayCat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4664 | 4718 | const tracy = trace(@src()); |
| 4665 | 4719 | defer tracy.end(); |
| 4666 | 4720 | |
| ... | ... | @@ -4668,7 +4722,7 @@ fn zirArrayCat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 4668 | 4722 | return sema.mod.fail(&block.base, sema.src, "TODO implement zirArrayCat", .{}); |
| 4669 | 4723 | } |
| 4670 | 4724 | |
| 4671 | fn zirArrayMul(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4725 | fn zirArrayMul(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4672 | 4726 | const tracy = trace(@src()); |
| 4673 | 4727 | defer tracy.end(); |
| 4674 | 4728 | |
| ... | ... | @@ -4681,7 +4735,7 @@ fn zirNegate( |
| 4681 | 4735 | block: *Scope.Block, |
| 4682 | 4736 | inst: Zir.Inst.Index, |
| 4683 | 4737 | tag_override: Zir.Inst.Tag, |
| 4684 | ) InnerError!*Inst { | |
| 4738 | ) CompileError!Air.Inst.Ref { | |
| 4685 | 4739 | const tracy = trace(@src()); |
| 4686 | 4740 | defer tracy.end(); |
| 4687 | 4741 | |
| ... | ... | @@ -4689,13 +4743,13 @@ fn zirNegate( |
| 4689 | 4743 | const src: LazySrcLoc = .{ .node_offset_bin_op = inst_data.src_node }; |
| 4690 | 4744 | const lhs_src: LazySrcLoc = .{ .node_offset_bin_lhs = inst_data.src_node }; |
| 4691 | 4745 | const rhs_src: LazySrcLoc = .{ .node_offset_bin_rhs = inst_data.src_node }; |
| 4692 | const lhs = try sema.resolveInst(.zero); | |
| 4693 | const rhs = try sema.resolveInst(inst_data.operand); | |
| 4746 | const lhs = sema.resolveInst(.zero); | |
| 4747 | const rhs = sema.resolveInst(inst_data.operand); | |
| 4694 | 4748 | |
| 4695 | 4749 | return sema.analyzeArithmetic(block, tag_override, lhs, rhs, src, lhs_src, rhs_src); |
| 4696 | 4750 | } |
| 4697 | 4751 | |
| 4698 | fn zirArithmetic(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4752 | fn zirArithmetic(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4699 | 4753 | const tracy = trace(@src()); |
| 4700 | 4754 | defer tracy.end(); |
| 4701 | 4755 | |
| ... | ... | @@ -4705,8 +4759,8 @@ fn zirArithmetic(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerEr |
| 4705 | 4759 | const lhs_src: LazySrcLoc = .{ .node_offset_bin_lhs = inst_data.src_node }; |
| 4706 | 4760 | const rhs_src: LazySrcLoc = .{ .node_offset_bin_rhs = inst_data.src_node }; |
| 4707 | 4761 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 4708 | const lhs = try sema.resolveInst(extra.lhs); | |
| 4709 | const rhs = try sema.resolveInst(extra.rhs); | |
| 4762 | const lhs = sema.resolveInst(extra.lhs); | |
| 4763 | const rhs = sema.resolveInst(extra.rhs); | |
| 4710 | 4764 | |
| 4711 | 4765 | return sema.analyzeArithmetic(block, tag_override, lhs, rhs, sema.src, lhs_src, rhs_src); |
| 4712 | 4766 | } |
| ... | ... | @@ -4715,7 +4769,7 @@ fn zirOverflowArithmetic( |
| 4715 | 4769 | sema: *Sema, |
| 4716 | 4770 | block: *Scope.Block, |
| 4717 | 4771 | extended: Zir.Inst.Extended.InstData, |
| 4718 | ) InnerError!*Inst { | |
| 4772 | ) CompileError!Air.Inst.Ref { | |
| 4719 | 4773 | const tracy = trace(@src()); |
| 4720 | 4774 | defer tracy.end(); |
| 4721 | 4775 | |
| ... | ... | @@ -4729,13 +4783,30 @@ fn analyzeArithmetic( |
| 4729 | 4783 | sema: *Sema, |
| 4730 | 4784 | block: *Scope.Block, |
| 4731 | 4785 | zir_tag: Zir.Inst.Tag, |
| 4732 | lhs: *Inst, | |
| 4733 | rhs: *Inst, | |
| 4786 | lhs: Air.Inst.Ref, | |
| 4787 | rhs: Air.Inst.Ref, | |
| 4734 | 4788 | src: LazySrcLoc, |
| 4735 | 4789 | lhs_src: LazySrcLoc, |
| 4736 | 4790 | rhs_src: LazySrcLoc, |
| 4737 | ) InnerError!*Inst { | |
| 4738 | const instructions = &[_]*Inst{ lhs, rhs }; | |
| 4791 | ) CompileError!Air.Inst.Ref { | |
| 4792 | const lhs_ty = sema.typeOf(lhs); | |
| 4793 | const rhs_ty = sema.typeOf(rhs); | |
| 4794 | if (lhs_ty.zigTypeTag() == .Vector and rhs_ty.zigTypeTag() == .Vector) { | |
| 4795 | if (lhs_ty.arrayLen() != rhs_ty.arrayLen()) { | |
| 4796 | return sema.mod.fail(&block.base, src, "vector length mismatch: {d} and {d}", .{ | |
| 4797 | lhs_ty.arrayLen(), | |
| 4798 | rhs_ty.arrayLen(), | |
| 4799 | }); | |
| 4800 | } | |
| 4801 | return sema.mod.fail(&block.base, src, "TODO implement support for vectors in zirBinOp", .{}); | |
| 4802 | } else if (lhs_ty.zigTypeTag() == .Vector or rhs_ty.zigTypeTag() == .Vector) { | |
| 4803 | return sema.mod.fail(&block.base, src, "mixed scalar and vector operands to binary expression: '{}' and '{}'", .{ | |
| 4804 | lhs_ty, | |
| 4805 | rhs_ty, | |
| 4806 | }); | |
| 4807 | } | |
| 4808 | ||
| 4809 | const instructions = &[_]Air.Inst.Ref{ lhs, rhs }; | |
| 4739 | 4810 | const resolved_type = try sema.resolvePeerTypes(block, src, instructions); |
| 4740 | 4811 | const casted_lhs = try sema.coerce(block, resolved_type, lhs, lhs_src); |
| 4741 | 4812 | const casted_rhs = try sema.coerce(block, resolved_type, rhs, rhs_src); |
| ... | ... | @@ -4747,42 +4818,24 @@ fn analyzeArithmetic( |
| 4747 | 4818 | |
| 4748 | 4819 | const scalar_tag = scalar_type.zigTypeTag(); |
| 4749 | 4820 | |
| 4750 | if (lhs.ty.zigTypeTag() == .Vector and rhs.ty.zigTypeTag() == .Vector) { | |
| 4751 | if (lhs.ty.arrayLen() != rhs.ty.arrayLen()) { | |
| 4752 | return sema.mod.fail(&block.base, src, "vector length mismatch: {d} and {d}", .{ | |
| 4753 | lhs.ty.arrayLen(), | |
| 4754 | rhs.ty.arrayLen(), | |
| 4755 | }); | |
| 4756 | } | |
| 4757 | return sema.mod.fail(&block.base, src, "TODO implement support for vectors in zirBinOp", .{}); | |
| 4758 | } else if (lhs.ty.zigTypeTag() == .Vector or rhs.ty.zigTypeTag() == .Vector) { | |
| 4759 | return sema.mod.fail(&block.base, src, "mixed scalar and vector operands to binary expression: '{}' and '{}'", .{ | |
| 4760 | lhs.ty, | |
| 4761 | rhs.ty, | |
| 4762 | }); | |
| 4763 | } | |
| 4764 | ||
| 4765 | 4821 | const is_int = scalar_tag == .Int or scalar_tag == .ComptimeInt; |
| 4766 | 4822 | const is_float = scalar_tag == .Float or scalar_tag == .ComptimeFloat; |
| 4767 | 4823 | |
| 4768 | 4824 | if (!is_int and !(is_float and floatOpAllowed(zir_tag))) { |
| 4769 | return sema.mod.fail(&block.base, src, "invalid operands to binary expression: '{s}' and '{s}'", .{ @tagName(lhs.ty.zigTypeTag()), @tagName(rhs.ty.zigTypeTag()) }); | |
| 4825 | return sema.mod.fail(&block.base, src, "invalid operands to binary expression: '{s}' and '{s}'", .{ @tagName(lhs_ty.zigTypeTag()), @tagName(rhs_ty.zigTypeTag()) }); | |
| 4770 | 4826 | } |
| 4771 | 4827 | |
| 4772 | if (casted_lhs.value()) |lhs_val| { | |
| 4773 | if (casted_rhs.value()) |rhs_val| { | |
| 4828 | if (try sema.resolvePossiblyUndefinedValue(block, lhs_src, casted_lhs)) |lhs_val| { | |
| 4829 | if (try sema.resolvePossiblyUndefinedValue(block, rhs_src, casted_rhs)) |rhs_val| { | |
| 4774 | 4830 | if (lhs_val.isUndef() or rhs_val.isUndef()) { |
| 4775 | return sema.mod.constUndef(sema.arena, src, resolved_type); | |
| 4831 | return sema.addConstUndef(resolved_type); | |
| 4776 | 4832 | } |
| 4777 | 4833 | // incase rhs is 0, simply return lhs without doing any calculations |
| 4778 | 4834 | // TODO Once division is implemented we should throw an error when dividing by 0. |
| 4779 | 4835 | if (rhs_val.compareWithZero(.eq)) { |
| 4780 | 4836 | switch (zir_tag) { |
| 4781 | 4837 | .add, .addwrap, .sub, .subwrap => { |
| 4782 | return sema.mod.constInst(sema.arena, src, .{ | |
| 4783 | .ty = scalar_type, | |
| 4784 | .val = lhs_val, | |
| 4785 | }); | |
| 4838 | return sema.addConstant(scalar_type, lhs_val); | |
| 4786 | 4839 | }, |
| 4787 | 4840 | else => {}, |
| 4788 | 4841 | } |
| ... | ... | @@ -4822,15 +4875,12 @@ fn analyzeArithmetic( |
| 4822 | 4875 | |
| 4823 | 4876 | log.debug("{s}({}, {}) result: {}", .{ @tagName(zir_tag), lhs_val, rhs_val, value }); |
| 4824 | 4877 | |
| 4825 | return sema.mod.constInst(sema.arena, src, .{ | |
| 4826 | .ty = scalar_type, | |
| 4827 | .val = value, | |
| 4828 | }); | |
| 4878 | return sema.addConstant(scalar_type, value); | |
| 4829 | 4879 | } |
| 4830 | 4880 | } |
| 4831 | 4881 | |
| 4832 | 4882 | try sema.requireRuntimeBlock(block, src); |
| 4833 | const ir_tag: Inst.Tag = switch (zir_tag) { | |
| 4883 | const air_tag: Air.Inst.Tag = switch (zir_tag) { | |
| 4834 | 4884 | .add => .add, |
| 4835 | 4885 | .addwrap => .addwrap, |
| 4836 | 4886 | .sub => .sub, |
| ... | ... | @@ -4841,17 +4891,17 @@ fn analyzeArithmetic( |
| 4841 | 4891 | else => return sema.mod.fail(&block.base, src, "TODO implement arithmetic for operand '{s}''", .{@tagName(zir_tag)}), |
| 4842 | 4892 | }; |
| 4843 | 4893 | |
| 4844 | return block.addBinOp(src, scalar_type, ir_tag, casted_lhs, casted_rhs); | |
| 4894 | return block.addBinOp(air_tag, casted_lhs, casted_rhs); | |
| 4845 | 4895 | } |
| 4846 | 4896 | |
| 4847 | fn zirLoad(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 4897 | fn zirLoad(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 4848 | 4898 | const tracy = trace(@src()); |
| 4849 | 4899 | defer tracy.end(); |
| 4850 | 4900 | |
| 4851 | 4901 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 4852 | 4902 | const src = inst_data.src(); |
| 4853 | 4903 | const ptr_src: LazySrcLoc = .{ .node_offset_deref_ptr = inst_data.src_node }; |
| 4854 | const ptr = try sema.resolveInst(inst_data.operand); | |
| 4904 | const ptr = sema.resolveInst(inst_data.operand); | |
| 4855 | 4905 | return sema.analyzeLoad(block, src, ptr, ptr_src); |
| 4856 | 4906 | } |
| 4857 | 4907 | |
| ... | ... | @@ -4859,19 +4909,17 @@ fn zirAsm( |
| 4859 | 4909 | sema: *Sema, |
| 4860 | 4910 | block: *Scope.Block, |
| 4861 | 4911 | extended: Zir.Inst.Extended.InstData, |
| 4862 | ) InnerError!*Inst { | |
| 4912 | inst: Zir.Inst.Index, | |
| 4913 | ) CompileError!Air.Inst.Ref { | |
| 4863 | 4914 | const tracy = trace(@src()); |
| 4864 | 4915 | defer tracy.end(); |
| 4865 | 4916 | |
| 4866 | 4917 | const extra = sema.code.extraData(Zir.Inst.Asm, extended.operand); |
| 4867 | 4918 | const src: LazySrcLoc = .{ .node_offset = extra.data.src_node }; |
| 4868 | const asm_source_src: LazySrcLoc = .{ .node_offset_asm_source = extra.data.src_node }; | |
| 4869 | 4919 | const ret_ty_src: LazySrcLoc = .{ .node_offset_asm_ret_ty = extra.data.src_node }; |
| 4870 | const asm_source = try sema.resolveConstString(block, asm_source_src, extra.data.asm_source); | |
| 4871 | 4920 | const outputs_len = @truncate(u5, extended.small); |
| 4872 | 4921 | const inputs_len = @truncate(u5, extended.small >> 5); |
| 4873 | 4922 | const clobbers_len = @truncate(u5, extended.small >> 10); |
| 4874 | const is_volatile = @truncate(u1, extended.small >> 15) != 0; | |
| 4875 | 4923 | |
| 4876 | 4924 | if (outputs_len > 1) { |
| 4877 | 4925 | return sema.mod.fail(&block.base, src, "TODO implement Sema for asm with more than 1 output", .{}); |
| ... | ... | @@ -4899,7 +4947,7 @@ fn zirAsm( |
| 4899 | 4947 | }; |
| 4900 | 4948 | }; |
| 4901 | 4949 | |
| 4902 | const args = try sema.arena.alloc(*Inst, inputs_len); | |
| 4950 | const args = try sema.arena.alloc(Air.Inst.Ref, inputs_len); | |
| 4903 | 4951 | const inputs = try sema.arena.alloc([]const u8, inputs_len); |
| 4904 | 4952 | |
| 4905 | 4953 | for (args) |*arg, arg_i| { |
| ... | ... | @@ -4909,7 +4957,7 @@ fn zirAsm( |
| 4909 | 4957 | const name = sema.code.nullTerminatedString(input.data.name); |
| 4910 | 4958 | _ = name; // TODO: use the name |
| 4911 | 4959 | |
| 4912 | arg.* = try sema.resolveInst(input.data.operand); | |
| 4960 | arg.* = sema.resolveInst(input.data.operand); | |
| 4913 | 4961 | inputs[arg_i] = sema.code.nullTerminatedString(input.data.constraint); |
| 4914 | 4962 | } |
| 4915 | 4963 | |
| ... | ... | @@ -4920,22 +4968,19 @@ fn zirAsm( |
| 4920 | 4968 | } |
| 4921 | 4969 | |
| 4922 | 4970 | try sema.requireRuntimeBlock(block, src); |
| 4923 | const asm_air = try sema.arena.create(Inst.Assembly); | |
| 4924 | asm_air.* = .{ | |
| 4925 | .base = .{ | |
| 4926 | .tag = .assembly, | |
| 4927 | .ty = if (output) |o| o.ty else Type.initTag(.void), | |
| 4928 | .src = src, | |
| 4929 | }, | |
| 4930 | .asm_source = asm_source, | |
| 4931 | .is_volatile = is_volatile, | |
| 4932 | .output_constraint = if (output) |o| o.constraint else null, | |
| 4933 | .inputs = inputs, | |
| 4934 | .clobbers = clobbers, | |
| 4935 | .args = args, | |
| 4936 | }; | |
| 4937 | try block.instructions.append(sema.gpa, &asm_air.base); | |
| 4938 | return &asm_air.base; | |
| 4971 | const gpa = sema.gpa; | |
| 4972 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Asm).Struct.fields.len + args.len); | |
| 4973 | const asm_air = try block.addInst(.{ | |
| 4974 | .tag = .assembly, | |
| 4975 | .data = .{ .ty_pl = .{ | |
| 4976 | .ty = if (output) |o| try sema.addType(o.ty) else Air.Inst.Ref.void_type, | |
| 4977 | .payload = sema.addExtraAssumeCapacity(Air.Asm{ | |
| 4978 | .zir_index = inst, | |
| 4979 | }), | |
| 4980 | } }, | |
| 4981 | }); | |
| 4982 | sema.appendRefsAssumeCapacity(args); | |
| 4983 | return asm_air; | |
| 4939 | 4984 | } |
| 4940 | 4985 | |
| 4941 | 4986 | fn zirCmp( |
| ... | ... | @@ -4943,7 +4988,7 @@ fn zirCmp( |
| 4943 | 4988 | block: *Scope.Block, |
| 4944 | 4989 | inst: Zir.Inst.Index, |
| 4945 | 4990 | op: std.math.CompareOperator, |
| 4946 | ) InnerError!*Inst { | |
| 4991 | ) CompileError!Air.Inst.Ref { | |
| 4947 | 4992 | const tracy = trace(@src()); |
| 4948 | 4993 | defer tracy.end(); |
| 4949 | 4994 | |
| ... | ... | @@ -4954,18 +4999,24 @@ fn zirCmp( |
| 4954 | 4999 | const src: LazySrcLoc = inst_data.src(); |
| 4955 | 5000 | const lhs_src: LazySrcLoc = .{ .node_offset_bin_lhs = inst_data.src_node }; |
| 4956 | 5001 | const rhs_src: LazySrcLoc = .{ .node_offset_bin_rhs = inst_data.src_node }; |
| 4957 | const lhs = try sema.resolveInst(extra.lhs); | |
| 4958 | const rhs = try sema.resolveInst(extra.rhs); | |
| 5002 | const lhs = sema.resolveInst(extra.lhs); | |
| 5003 | const rhs = sema.resolveInst(extra.rhs); | |
| 4959 | 5004 | |
| 4960 | 5005 | const is_equality_cmp = switch (op) { |
| 4961 | 5006 | .eq, .neq => true, |
| 4962 | 5007 | else => false, |
| 4963 | 5008 | }; |
| 4964 | const lhs_ty_tag = lhs.ty.zigTypeTag(); | |
| 4965 | const rhs_ty_tag = rhs.ty.zigTypeTag(); | |
| 5009 | const lhs_ty = sema.typeOf(lhs); | |
| 5010 | const rhs_ty = sema.typeOf(rhs); | |
| 5011 | const lhs_ty_tag = lhs_ty.zigTypeTag(); | |
| 5012 | const rhs_ty_tag = rhs_ty.zigTypeTag(); | |
| 4966 | 5013 | if (is_equality_cmp and lhs_ty_tag == .Null and rhs_ty_tag == .Null) { |
| 4967 | 5014 | // null == null, null != null |
| 4968 | return mod.constBool(sema.arena, src, op == .eq); | |
| 5015 | if (op == .eq) { | |
| 5016 | return Air.Inst.Ref.bool_true; | |
| 5017 | } else { | |
| 5018 | return Air.Inst.Ref.bool_false; | |
| 5019 | } | |
| 4969 | 5020 | } else if (is_equality_cmp and |
| 4970 | 5021 | ((lhs_ty_tag == .Null and rhs_ty_tag == .Optional) or |
| 4971 | 5022 | rhs_ty_tag == .Null and lhs_ty_tag == .Optional)) |
| ... | ... | @@ -4974,11 +5025,11 @@ fn zirCmp( |
| 4974 | 5025 | const opt_operand = if (lhs_ty_tag == .Optional) lhs else rhs; |
| 4975 | 5026 | return sema.analyzeIsNull(block, src, opt_operand, op == .neq); |
| 4976 | 5027 | } else if (is_equality_cmp and |
| 4977 | ((lhs_ty_tag == .Null and rhs.ty.isCPtr()) or (rhs_ty_tag == .Null and lhs.ty.isCPtr()))) | |
| 5028 | ((lhs_ty_tag == .Null and rhs_ty.isCPtr()) or (rhs_ty_tag == .Null and lhs_ty.isCPtr()))) | |
| 4978 | 5029 | { |
| 4979 | 5030 | return mod.fail(&block.base, src, "TODO implement C pointer cmp", .{}); |
| 4980 | 5031 | } else if (lhs_ty_tag == .Null or rhs_ty_tag == .Null) { |
| 4981 | const non_null_type = if (lhs_ty_tag == .Null) rhs.ty else lhs.ty; | |
| 5032 | const non_null_type = if (lhs_ty_tag == .Null) rhs_ty else lhs_ty; | |
| 4982 | 5033 | return mod.fail(&block.base, src, "comparison of '{}' with null", .{non_null_type}); |
| 4983 | 5034 | } else if (is_equality_cmp and |
| 4984 | 5035 | ((lhs_ty_tag == .EnumLiteral and rhs_ty_tag == .Union) or |
| ... | ... | @@ -4989,27 +5040,45 @@ fn zirCmp( |
| 4989 | 5040 | if (!is_equality_cmp) { |
| 4990 | 5041 | return mod.fail(&block.base, src, "{s} operator not allowed for errors", .{@tagName(op)}); |
| 4991 | 5042 | } |
| 4992 | if (rhs.value()) |rval| { | |
| 4993 | if (lhs.value()) |lval| { | |
| 4994 | // TODO optimisation oppurtunity: evaluate if std.mem.eql is faster with the names, or calling to Module.getErrorValue to get the values and then compare them is faster | |
| 4995 | return mod.constBool(sema.arena, src, std.mem.eql(u8, lval.castTag(.@"error").?.data.name, rval.castTag(.@"error").?.data.name) == (op == .eq)); | |
| 5043 | if (try sema.resolvePossiblyUndefinedValue(block, lhs_src, lhs)) |lval| { | |
| 5044 | if (try sema.resolvePossiblyUndefinedValue(block, rhs_src, rhs)) |rval| { | |
| 5045 | if (lval.isUndef() or rval.isUndef()) { | |
| 5046 | return sema.addConstUndef(Type.initTag(.bool)); | |
| 5047 | } | |
| 5048 | // TODO optimisation opportunity: evaluate if mem.eql is faster with the names, | |
| 5049 | // or calling to Module.getErrorValue to get the values and then compare them is | |
| 5050 | // faster. | |
| 5051 | const lhs_name = lval.castTag(.@"error").?.data.name; | |
| 5052 | const rhs_name = rval.castTag(.@"error").?.data.name; | |
| 5053 | if (mem.eql(u8, lhs_name, rhs_name) == (op == .eq)) { | |
| 5054 | return Air.Inst.Ref.bool_true; | |
| 5055 | } else { | |
| 5056 | return Air.Inst.Ref.bool_false; | |
| 5057 | } | |
| 4996 | 5058 | } |
| 4997 | 5059 | } |
| 4998 | 5060 | try sema.requireRuntimeBlock(block, src); |
| 4999 | return block.addBinOp(src, Type.initTag(.bool), if (op == .eq) .cmp_eq else .cmp_neq, lhs, rhs); | |
| 5000 | } else if (lhs.ty.isNumeric() and rhs.ty.isNumeric()) { | |
| 5061 | const tag: Air.Inst.Tag = if (op == .eq) .cmp_eq else .cmp_neq; | |
| 5062 | return block.addBinOp(tag, lhs, rhs); | |
| 5063 | } else if (lhs_ty.isNumeric() and rhs_ty.isNumeric()) { | |
| 5001 | 5064 | // This operation allows any combination of integer and float types, regardless of the |
| 5002 | 5065 | // signed-ness, comptime-ness, and bit-width. So peer type resolution is incorrect for |
| 5003 | 5066 | // numeric types. |
| 5004 | return sema.cmpNumeric(block, src, lhs, rhs, op); | |
| 5067 | return sema.cmpNumeric(block, src, lhs, rhs, op, lhs_src, rhs_src); | |
| 5005 | 5068 | } else if (lhs_ty_tag == .Type and rhs_ty_tag == .Type) { |
| 5006 | 5069 | if (!is_equality_cmp) { |
| 5007 | 5070 | return mod.fail(&block.base, src, "{s} operator not allowed for types", .{@tagName(op)}); |
| 5008 | 5071 | } |
| 5009 | return mod.constBool(sema.arena, src, lhs.value().?.eql(rhs.value().?) == (op == .eq)); | |
| 5072 | const lhs_as_type = try sema.analyzeAsType(block, lhs_src, lhs); | |
| 5073 | const rhs_as_type = try sema.analyzeAsType(block, rhs_src, rhs); | |
| 5074 | if (lhs_as_type.eql(rhs_as_type) == (op == .eq)) { | |
| 5075 | return Air.Inst.Ref.bool_true; | |
| 5076 | } else { | |
| 5077 | return Air.Inst.Ref.bool_false; | |
| 5078 | } | |
| 5010 | 5079 | } |
| 5011 | 5080 | |
| 5012 | const instructions = &[_]*Inst{ lhs, rhs }; | |
| 5081 | const instructions = &[_]Air.Inst.Ref{ lhs, rhs }; | |
| 5013 | 5082 | const resolved_type = try sema.resolvePeerTypes(block, src, instructions); |
| 5014 | 5083 | if (!resolved_type.isSelfComparable(is_equality_cmp)) { |
| 5015 | 5084 | return mod.fail(&block.base, src, "operator not allowed for type '{}'", .{resolved_type}); |
| ... | ... | @@ -5018,18 +5087,21 @@ fn zirCmp( |
| 5018 | 5087 | const casted_lhs = try sema.coerce(block, resolved_type, lhs, lhs_src); |
| 5019 | 5088 | const casted_rhs = try sema.coerce(block, resolved_type, rhs, rhs_src); |
| 5020 | 5089 | |
| 5021 | if (casted_lhs.value()) |lhs_val| { | |
| 5022 | if (casted_rhs.value()) |rhs_val| { | |
| 5090 | if (try sema.resolvePossiblyUndefinedValue(block, lhs_src, casted_lhs)) |lhs_val| { | |
| 5091 | if (try sema.resolvePossiblyUndefinedValue(block, rhs_src, casted_rhs)) |rhs_val| { | |
| 5023 | 5092 | if (lhs_val.isUndef() or rhs_val.isUndef()) { |
| 5024 | return sema.mod.constUndef(sema.arena, src, resolved_type); | |
| 5093 | return sema.addConstUndef(resolved_type); | |
| 5094 | } | |
| 5095 | if (lhs_val.compare(op, rhs_val)) { | |
| 5096 | return Air.Inst.Ref.bool_true; | |
| 5097 | } else { | |
| 5098 | return Air.Inst.Ref.bool_false; | |
| 5025 | 5099 | } |
| 5026 | const result = lhs_val.compare(op, rhs_val); | |
| 5027 | return sema.mod.constBool(sema.arena, src, result); | |
| 5028 | 5100 | } |
| 5029 | 5101 | } |
| 5030 | 5102 | |
| 5031 | 5103 | try sema.requireRuntimeBlock(block, src); |
| 5032 | const tag: Inst.Tag = switch (op) { | |
| 5104 | const tag: Air.Inst.Tag = switch (op) { | |
| 5033 | 5105 | .lt => .cmp_lt, |
| 5034 | 5106 | .lte => .cmp_lte, |
| 5035 | 5107 | .eq => .cmp_eq, |
| ... | ... | @@ -5037,35 +5109,33 @@ fn zirCmp( |
| 5037 | 5109 | .gt => .cmp_gt, |
| 5038 | 5110 | .neq => .cmp_neq, |
| 5039 | 5111 | }; |
| 5040 | const bool_type = Type.initTag(.bool); // TODO handle vectors | |
| 5041 | return block.addBinOp(src, bool_type, tag, casted_lhs, casted_rhs); | |
| 5112 | // TODO handle vectors | |
| 5113 | return block.addBinOp(tag, casted_lhs, casted_rhs); | |
| 5042 | 5114 | } |
| 5043 | 5115 | |
| 5044 | fn zirSizeOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5116 | fn zirSizeOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5045 | 5117 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5046 | const src = inst_data.src(); | |
| 5047 | 5118 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 5048 | 5119 | const operand_ty = try sema.resolveType(block, operand_src, inst_data.operand); |
| 5049 | 5120 | const target = sema.mod.getTarget(); |
| 5050 | 5121 | const abi_size = operand_ty.abiSize(target); |
| 5051 | return sema.mod.constIntUnsigned(sema.arena, src, Type.initTag(.comptime_int), abi_size); | |
| 5122 | return sema.addIntUnsigned(Type.initTag(.comptime_int), abi_size); | |
| 5052 | 5123 | } |
| 5053 | 5124 | |
| 5054 | fn zirBitSizeOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5125 | fn zirBitSizeOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5055 | 5126 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5056 | const src = inst_data.src(); | |
| 5057 | 5127 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| 5058 | 5128 | const operand_ty = try sema.resolveType(block, operand_src, inst_data.operand); |
| 5059 | 5129 | const target = sema.mod.getTarget(); |
| 5060 | 5130 | const bit_size = operand_ty.bitSize(target); |
| 5061 | return sema.mod.constIntUnsigned(sema.arena, src, Type.initTag(.comptime_int), bit_size); | |
| 5131 | return sema.addIntUnsigned(Type.initTag(.comptime_int), bit_size); | |
| 5062 | 5132 | } |
| 5063 | 5133 | |
| 5064 | 5134 | fn zirThis( |
| 5065 | 5135 | sema: *Sema, |
| 5066 | 5136 | block: *Scope.Block, |
| 5067 | 5137 | extended: Zir.Inst.Extended.InstData, |
| 5068 | ) InnerError!*Inst { | |
| 5138 | ) CompileError!Air.Inst.Ref { | |
| 5069 | 5139 | const src: LazySrcLoc = .{ .node_offset = @bitCast(i32, extended.operand) }; |
| 5070 | 5140 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirThis", .{}); |
| 5071 | 5141 | } |
| ... | ... | @@ -5074,7 +5144,7 @@ fn zirRetAddr( |
| 5074 | 5144 | sema: *Sema, |
| 5075 | 5145 | block: *Scope.Block, |
| 5076 | 5146 | extended: Zir.Inst.Extended.InstData, |
| 5077 | ) InnerError!*Inst { | |
| 5147 | ) CompileError!Air.Inst.Ref { | |
| 5078 | 5148 | const src: LazySrcLoc = .{ .node_offset = @bitCast(i32, extended.operand) }; |
| 5079 | 5149 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirRetAddr", .{}); |
| 5080 | 5150 | } |
| ... | ... | @@ -5083,12 +5153,12 @@ fn zirBuiltinSrc( |
| 5083 | 5153 | sema: *Sema, |
| 5084 | 5154 | block: *Scope.Block, |
| 5085 | 5155 | extended: Zir.Inst.Extended.InstData, |
| 5086 | ) InnerError!*Inst { | |
| 5156 | ) CompileError!Air.Inst.Ref { | |
| 5087 | 5157 | const src: LazySrcLoc = .{ .node_offset = @bitCast(i32, extended.operand) }; |
| 5088 | 5158 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirBuiltinSrc", .{}); |
| 5089 | 5159 | } |
| 5090 | 5160 | |
| 5091 | fn zirTypeInfo(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5161 | fn zirTypeInfo(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5092 | 5162 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5093 | 5163 | const src = inst_data.src(); |
| 5094 | 5164 | const ty = try sema.resolveType(block, src, inst_data.operand); |
| ... | ... | @@ -5114,16 +5184,16 @@ fn zirTypeInfo(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 5114 | 5184 | // args: []const FnArg, |
| 5115 | 5185 | field_values[5] = Value.initTag(.null_value); // TODO |
| 5116 | 5186 | |
| 5117 | return sema.mod.constInst(sema.arena, src, .{ | |
| 5118 | .ty = type_info_ty, | |
| 5119 | .val = try Value.Tag.@"union".create(sema.arena, .{ | |
| 5187 | return sema.addConstant( | |
| 5188 | type_info_ty, | |
| 5189 | try Value.Tag.@"union".create(sema.arena, .{ | |
| 5120 | 5190 | .tag = try Value.Tag.enum_field_index.create( |
| 5121 | 5191 | sema.arena, |
| 5122 | 5192 | @enumToInt(@typeInfo(std.builtin.TypeInfo).Union.tag_type.?.Fn), |
| 5123 | 5193 | ), |
| 5124 | 5194 | .val = try Value.Tag.@"struct".create(sema.arena, field_values.ptr), |
| 5125 | 5195 | }), |
| 5126 | }); | |
| 5196 | ); | |
| 5127 | 5197 | }, |
| 5128 | 5198 | else => |t| return sema.mod.fail(&block.base, src, "TODO: implement zirTypeInfo for {s}", .{ |
| 5129 | 5199 | @tagName(t), |
| ... | ... | @@ -5131,31 +5201,30 @@ fn zirTypeInfo(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 5131 | 5201 | } |
| 5132 | 5202 | } |
| 5133 | 5203 | |
| 5134 | fn zirTypeof(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5204 | fn zirTypeof(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5135 | 5205 | _ = block; |
| 5136 | 5206 | const zir_datas = sema.code.instructions.items(.data); |
| 5137 | 5207 | const inst_data = zir_datas[inst].un_node; |
| 5138 | const src = inst_data.src(); | |
| 5139 | const operand = try sema.resolveInst(inst_data.operand); | |
| 5140 | return sema.mod.constType(sema.arena, src, operand.ty); | |
| 5208 | const operand = sema.resolveInst(inst_data.operand); | |
| 5209 | const operand_ty = sema.typeOf(operand); | |
| 5210 | return sema.addType(operand_ty); | |
| 5141 | 5211 | } |
| 5142 | 5212 | |
| 5143 | fn zirTypeofElem(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5213 | fn zirTypeofElem(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5144 | 5214 | _ = block; |
| 5145 | 5215 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5146 | const src = inst_data.src(); | |
| 5147 | const operand_ptr = try sema.resolveInst(inst_data.operand); | |
| 5148 | const elem_ty = operand_ptr.ty.elemType(); | |
| 5149 | return sema.mod.constType(sema.arena, src, elem_ty); | |
| 5216 | const operand_ptr = sema.resolveInst(inst_data.operand); | |
| 5217 | const elem_ty = sema.typeOf(operand_ptr).elemType(); | |
| 5218 | return sema.addType(elem_ty); | |
| 5150 | 5219 | } |
| 5151 | 5220 | |
| 5152 | fn zirTypeofLog2IntType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5221 | fn zirTypeofLog2IntType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5153 | 5222 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5154 | 5223 | const src = inst_data.src(); |
| 5155 | 5224 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirTypeofLog2IntType", .{}); |
| 5156 | 5225 | } |
| 5157 | 5226 | |
| 5158 | fn zirLog2IntType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5227 | fn zirLog2IntType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5159 | 5228 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5160 | 5229 | const src = inst_data.src(); |
| 5161 | 5230 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirLog2IntType", .{}); |
| ... | ... | @@ -5165,7 +5234,7 @@ fn zirTypeofPeer( |
| 5165 | 5234 | sema: *Sema, |
| 5166 | 5235 | block: *Scope.Block, |
| 5167 | 5236 | extended: Zir.Inst.Extended.InstData, |
| 5168 | ) InnerError!*Inst { | |
| 5237 | ) CompileError!Air.Inst.Ref { | |
| 5169 | 5238 | const tracy = trace(@src()); |
| 5170 | 5239 | defer tracy.end(); |
| 5171 | 5240 | |
| ... | ... | @@ -5173,63 +5242,37 @@ fn zirTypeofPeer( |
| 5173 | 5242 | const src: LazySrcLoc = .{ .node_offset = extra.data.src_node }; |
| 5174 | 5243 | const args = sema.code.refSlice(extra.end, extended.small); |
| 5175 | 5244 | |
| 5176 | const inst_list = try sema.gpa.alloc(*ir.Inst, args.len); | |
| 5245 | const inst_list = try sema.gpa.alloc(Air.Inst.Ref, args.len); | |
| 5177 | 5246 | defer sema.gpa.free(inst_list); |
| 5178 | 5247 | |
| 5179 | 5248 | for (args) |arg_ref, i| { |
| 5180 | inst_list[i] = try sema.resolveInst(arg_ref); | |
| 5249 | inst_list[i] = sema.resolveInst(arg_ref); | |
| 5181 | 5250 | } |
| 5182 | 5251 | |
| 5183 | 5252 | const result_type = try sema.resolvePeerTypes(block, src, inst_list); |
| 5184 | return sema.mod.constType(sema.arena, src, result_type); | |
| 5253 | return sema.addType(result_type); | |
| 5185 | 5254 | } |
| 5186 | 5255 | |
| 5187 | fn zirBoolNot(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5256 | fn zirBoolNot(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5188 | 5257 | const tracy = trace(@src()); |
| 5189 | 5258 | defer tracy.end(); |
| 5190 | 5259 | |
| 5191 | 5260 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5192 | 5261 | const src = inst_data.src(); |
| 5193 | const uncasted_operand = try sema.resolveInst(inst_data.operand); | |
| 5262 | const operand_src = src; // TODO put this on the operand, not the `!` | |
| 5263 | const uncasted_operand = sema.resolveInst(inst_data.operand); | |
| 5194 | 5264 | |
| 5195 | 5265 | const bool_type = Type.initTag(.bool); |
| 5196 | const operand = try sema.coerce(block, bool_type, uncasted_operand, uncasted_operand.src); | |
| 5197 | if (try sema.resolveDefinedValue(block, src, operand)) |val| { | |
| 5198 | return sema.mod.constBool(sema.arena, src, !val.toBool()); | |
| 5199 | } | |
| 5200 | try sema.requireRuntimeBlock(block, src); | |
| 5201 | return block.addUnOp(src, bool_type, .not, operand); | |
| 5202 | } | |
| 5203 | ||
| 5204 | fn zirBoolOp( | |
| 5205 | sema: *Sema, | |
| 5206 | block: *Scope.Block, | |
| 5207 | inst: Zir.Inst.Index, | |
| 5208 | comptime is_bool_or: bool, | |
| 5209 | ) InnerError!*Inst { | |
| 5210 | const tracy = trace(@src()); | |
| 5211 | defer tracy.end(); | |
| 5212 | ||
| 5213 | const src: LazySrcLoc = .unneeded; | |
| 5214 | const bool_type = Type.initTag(.bool); | |
| 5215 | const bin_inst = sema.code.instructions.items(.data)[inst].bin; | |
| 5216 | const uncasted_lhs = try sema.resolveInst(bin_inst.lhs); | |
| 5217 | const lhs = try sema.coerce(block, bool_type, uncasted_lhs, uncasted_lhs.src); | |
| 5218 | const uncasted_rhs = try sema.resolveInst(bin_inst.rhs); | |
| 5219 | const rhs = try sema.coerce(block, bool_type, uncasted_rhs, uncasted_rhs.src); | |
| 5220 | ||
| 5221 | if (lhs.value()) |lhs_val| { | |
| 5222 | if (rhs.value()) |rhs_val| { | |
| 5223 | if (is_bool_or) { | |
| 5224 | return sema.mod.constBool(sema.arena, src, lhs_val.toBool() or rhs_val.toBool()); | |
| 5225 | } else { | |
| 5226 | return sema.mod.constBool(sema.arena, src, lhs_val.toBool() and rhs_val.toBool()); | |
| 5227 | } | |
| 5266 | const operand = try sema.coerce(block, bool_type, uncasted_operand, operand_src); | |
| 5267 | if (try sema.resolveDefinedValue(block, operand_src, operand)) |val| { | |
| 5268 | if (val.toBool()) { | |
| 5269 | return Air.Inst.Ref.bool_false; | |
| 5270 | } else { | |
| 5271 | return Air.Inst.Ref.bool_true; | |
| 5228 | 5272 | } |
| 5229 | 5273 | } |
| 5230 | 5274 | try sema.requireRuntimeBlock(block, src); |
| 5231 | const tag: ir.Inst.Tag = if (is_bool_or) .bool_or else .bool_and; | |
| 5232 | return block.addBinOp(src, bool_type, tag, lhs, rhs); | |
| 5275 | return block.addTyOp(.not, bool_type, operand); | |
| 5233 | 5276 | } |
| 5234 | 5277 | |
| 5235 | 5278 | fn zirBoolBr( |
| ... | ... | @@ -5237,20 +5280,25 @@ fn zirBoolBr( |
| 5237 | 5280 | parent_block: *Scope.Block, |
| 5238 | 5281 | inst: Zir.Inst.Index, |
| 5239 | 5282 | is_bool_or: bool, |
| 5240 | ) InnerError!*Inst { | |
| 5283 | ) CompileError!Air.Inst.Ref { | |
| 5241 | 5284 | const tracy = trace(@src()); |
| 5242 | 5285 | defer tracy.end(); |
| 5243 | 5286 | |
| 5244 | 5287 | const datas = sema.code.instructions.items(.data); |
| 5245 | 5288 | const inst_data = datas[inst].bool_br; |
| 5246 | const src: LazySrcLoc = .unneeded; | |
| 5247 | const lhs = try sema.resolveInst(inst_data.lhs); | |
| 5289 | const lhs = sema.resolveInst(inst_data.lhs); | |
| 5290 | const lhs_src = sema.src; | |
| 5248 | 5291 | const extra = sema.code.extraData(Zir.Inst.Block, inst_data.payload_index); |
| 5249 | 5292 | const body = sema.code.extra[extra.end..][0..extra.data.body_len]; |
| 5293 | const gpa = sema.gpa; | |
| 5250 | 5294 | |
| 5251 | if (try sema.resolveDefinedValue(parent_block, src, lhs)) |lhs_val| { | |
| 5295 | if (try sema.resolveDefinedValue(parent_block, lhs_src, lhs)) |lhs_val| { | |
| 5252 | 5296 | if (lhs_val.toBool() == is_bool_or) { |
| 5253 | return sema.mod.constBool(sema.arena, src, is_bool_or); | |
| 5297 | if (is_bool_or) { | |
| 5298 | return Air.Inst.Ref.bool_true; | |
| 5299 | } else { | |
| 5300 | return Air.Inst.Ref.bool_false; | |
| 5301 | } | |
| 5254 | 5302 | } |
| 5255 | 5303 | // comptime-known left-hand side. No need for a block here; the result |
| 5256 | 5304 | // is simply the rhs expression. Here we rely on there only being 1 |
| ... | ... | @@ -5258,62 +5306,72 @@ fn zirBoolBr( |
| 5258 | 5306 | return sema.resolveBody(parent_block, body); |
| 5259 | 5307 | } |
| 5260 | 5308 | |
| 5261 | const block_inst = try sema.arena.create(Inst.Block); | |
| 5262 | block_inst.* = .{ | |
| 5263 | .base = .{ | |
| 5264 | .tag = Inst.Block.base_tag, | |
| 5265 | .ty = Type.initTag(.bool), | |
| 5266 | .src = src, | |
| 5267 | }, | |
| 5268 | .body = undefined, | |
| 5269 | }; | |
| 5309 | const block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 5310 | try sema.air_instructions.append(gpa, .{ | |
| 5311 | .tag = .block, | |
| 5312 | .data = .{ .ty_pl = .{ | |
| 5313 | .ty = .bool_type, | |
| 5314 | .payload = undefined, | |
| 5315 | } }, | |
| 5316 | }); | |
| 5270 | 5317 | |
| 5271 | 5318 | var child_block = parent_block.makeSubBlock(); |
| 5272 | 5319 | child_block.runtime_loop = null; |
| 5273 | child_block.runtime_cond = lhs.src; | |
| 5320 | child_block.runtime_cond = lhs_src; | |
| 5274 | 5321 | child_block.runtime_index += 1; |
| 5275 | defer child_block.instructions.deinit(sema.gpa); | |
| 5322 | defer child_block.instructions.deinit(gpa); | |
| 5276 | 5323 | |
| 5277 | 5324 | var then_block = child_block.makeSubBlock(); |
| 5278 | defer then_block.instructions.deinit(sema.gpa); | |
| 5325 | defer then_block.instructions.deinit(gpa); | |
| 5279 | 5326 | |
| 5280 | 5327 | var else_block = child_block.makeSubBlock(); |
| 5281 | defer else_block.instructions.deinit(sema.gpa); | |
| 5328 | defer else_block.instructions.deinit(gpa); | |
| 5282 | 5329 | |
| 5283 | 5330 | const lhs_block = if (is_bool_or) &then_block else &else_block; |
| 5284 | 5331 | const rhs_block = if (is_bool_or) &else_block else &then_block; |
| 5285 | 5332 | |
| 5286 | const lhs_result = try sema.mod.constInst(sema.arena, src, .{ | |
| 5287 | .ty = Type.initTag(.bool), | |
| 5288 | .val = if (is_bool_or) Value.initTag(.bool_true) else Value.initTag(.bool_false), | |
| 5289 | }); | |
| 5290 | _ = try lhs_block.addBr(src, block_inst, lhs_result); | |
| 5333 | const lhs_result: Air.Inst.Ref = if (is_bool_or) .bool_true else .bool_false; | |
| 5334 | _ = try lhs_block.addBr(block_inst, lhs_result); | |
| 5291 | 5335 | |
| 5292 | 5336 | const rhs_result = try sema.resolveBody(rhs_block, body); |
| 5293 | _ = try rhs_block.addBr(src, block_inst, rhs_result); | |
| 5337 | _ = try rhs_block.addBr(block_inst, rhs_result); | |
| 5294 | 5338 | |
| 5295 | const air_then_body: ir.Body = .{ .instructions = try sema.arena.dupe(*Inst, then_block.instructions.items) }; | |
| 5296 | const air_else_body: ir.Body = .{ .instructions = try sema.arena.dupe(*Inst, else_block.instructions.items) }; | |
| 5297 | _ = try child_block.addCondBr(src, lhs, air_then_body, air_else_body); | |
| 5339 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.CondBr).Struct.fields.len + | |
| 5340 | then_block.instructions.items.len + else_block.instructions.items.len + | |
| 5341 | @typeInfo(Air.Block).Struct.fields.len + child_block.instructions.items.len); | |
| 5298 | 5342 | |
| 5299 | block_inst.body = .{ | |
| 5300 | .instructions = try sema.arena.dupe(*Inst, child_block.instructions.items), | |
| 5301 | }; | |
| 5302 | try parent_block.instructions.append(sema.gpa, &block_inst.base); | |
| 5303 | return &block_inst.base; | |
| 5343 | const cond_br_payload = sema.addExtraAssumeCapacity(Air.CondBr{ | |
| 5344 | .then_body_len = @intCast(u32, then_block.instructions.items.len), | |
| 5345 | .else_body_len = @intCast(u32, else_block.instructions.items.len), | |
| 5346 | }); | |
| 5347 | sema.air_extra.appendSliceAssumeCapacity(then_block.instructions.items); | |
| 5348 | sema.air_extra.appendSliceAssumeCapacity(else_block.instructions.items); | |
| 5349 | ||
| 5350 | _ = try child_block.addInst(.{ .tag = .cond_br, .data = .{ .pl_op = .{ | |
| 5351 | .operand = lhs, | |
| 5352 | .payload = cond_br_payload, | |
| 5353 | } } }); | |
| 5354 | ||
| 5355 | sema.air_instructions.items(.data)[block_inst].ty_pl.payload = sema.addExtraAssumeCapacity( | |
| 5356 | Air.Block{ .body_len = @intCast(u32, child_block.instructions.items.len) }, | |
| 5357 | ); | |
| 5358 | sema.air_extra.appendSliceAssumeCapacity(child_block.instructions.items); | |
| 5359 | ||
| 5360 | try parent_block.instructions.append(gpa, block_inst); | |
| 5361 | return Air.indexToRef(block_inst); | |
| 5304 | 5362 | } |
| 5305 | 5363 | |
| 5306 | 5364 | fn zirIsNonNull( |
| 5307 | 5365 | sema: *Sema, |
| 5308 | 5366 | block: *Scope.Block, |
| 5309 | 5367 | inst: Zir.Inst.Index, |
| 5310 | ) InnerError!*Inst { | |
| 5368 | ) CompileError!Air.Inst.Ref { | |
| 5311 | 5369 | const tracy = trace(@src()); |
| 5312 | 5370 | defer tracy.end(); |
| 5313 | 5371 | |
| 5314 | 5372 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5315 | 5373 | const src = inst_data.src(); |
| 5316 | const operand = try sema.resolveInst(inst_data.operand); | |
| 5374 | const operand = sema.resolveInst(inst_data.operand); | |
| 5317 | 5375 | return sema.analyzeIsNull(block, src, operand, true); |
| 5318 | 5376 | } |
| 5319 | 5377 | |
| ... | ... | @@ -5321,33 +5379,33 @@ fn zirIsNonNullPtr( |
| 5321 | 5379 | sema: *Sema, |
| 5322 | 5380 | block: *Scope.Block, |
| 5323 | 5381 | inst: Zir.Inst.Index, |
| 5324 | ) InnerError!*Inst { | |
| 5382 | ) CompileError!Air.Inst.Ref { | |
| 5325 | 5383 | const tracy = trace(@src()); |
| 5326 | 5384 | defer tracy.end(); |
| 5327 | 5385 | |
| 5328 | 5386 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5329 | 5387 | const src = inst_data.src(); |
| 5330 | const ptr = try sema.resolveInst(inst_data.operand); | |
| 5388 | const ptr = sema.resolveInst(inst_data.operand); | |
| 5331 | 5389 | const loaded = try sema.analyzeLoad(block, src, ptr, src); |
| 5332 | 5390 | return sema.analyzeIsNull(block, src, loaded, true); |
| 5333 | 5391 | } |
| 5334 | 5392 | |
| 5335 | fn zirIsNonErr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5393 | fn zirIsNonErr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5336 | 5394 | const tracy = trace(@src()); |
| 5337 | 5395 | defer tracy.end(); |
| 5338 | 5396 | |
| 5339 | 5397 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5340 | const operand = try sema.resolveInst(inst_data.operand); | |
| 5398 | const operand = sema.resolveInst(inst_data.operand); | |
| 5341 | 5399 | return sema.analyzeIsNonErr(block, inst_data.src(), operand); |
| 5342 | 5400 | } |
| 5343 | 5401 | |
| 5344 | fn zirIsNonErrPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5402 | fn zirIsNonErrPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5345 | 5403 | const tracy = trace(@src()); |
| 5346 | 5404 | defer tracy.end(); |
| 5347 | 5405 | |
| 5348 | 5406 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5349 | 5407 | const src = inst_data.src(); |
| 5350 | const ptr = try sema.resolveInst(inst_data.operand); | |
| 5408 | const ptr = sema.resolveInst(inst_data.operand); | |
| 5351 | 5409 | const loaded = try sema.analyzeLoad(block, src, ptr, src); |
| 5352 | 5410 | return sema.analyzeIsNonErr(block, src, loaded); |
| 5353 | 5411 | } |
| ... | ... | @@ -5356,7 +5414,7 @@ fn zirCondbr( |
| 5356 | 5414 | sema: *Sema, |
| 5357 | 5415 | parent_block: *Scope.Block, |
| 5358 | 5416 | inst: Zir.Inst.Index, |
| 5359 | ) InnerError!Zir.Inst.Index { | |
| 5417 | ) CompileError!Zir.Inst.Index { | |
| 5360 | 5418 | const tracy = trace(@src()); |
| 5361 | 5419 | defer tracy.end(); |
| 5362 | 5420 | |
| ... | ... | @@ -5368,7 +5426,7 @@ fn zirCondbr( |
| 5368 | 5426 | const then_body = sema.code.extra[extra.end..][0..extra.data.then_body_len]; |
| 5369 | 5427 | const else_body = sema.code.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; |
| 5370 | 5428 | |
| 5371 | const uncasted_cond = try sema.resolveInst(extra.data.condition); | |
| 5429 | const uncasted_cond = sema.resolveInst(extra.data.condition); | |
| 5372 | 5430 | const cond = try sema.coerce(parent_block, Type.initTag(.bool), uncasted_cond, cond_src); |
| 5373 | 5431 | |
| 5374 | 5432 | if (try sema.resolveDefinedValue(parent_block, src, cond)) |cond_val| { |
| ... | ... | @@ -5377,29 +5435,39 @@ fn zirCondbr( |
| 5377 | 5435 | return always_noreturn; |
| 5378 | 5436 | } |
| 5379 | 5437 | |
| 5438 | const gpa = sema.gpa; | |
| 5439 | ||
| 5440 | // We'll re-use the sub block to save on memory bandwidth, and yank out the | |
| 5441 | // instructions array in between using it for the then block and else block. | |
| 5380 | 5442 | var sub_block = parent_block.makeSubBlock(); |
| 5381 | 5443 | sub_block.runtime_loop = null; |
| 5382 | sub_block.runtime_cond = cond.src; | |
| 5444 | sub_block.runtime_cond = cond_src; | |
| 5383 | 5445 | sub_block.runtime_index += 1; |
| 5384 | defer sub_block.instructions.deinit(sema.gpa); | |
| 5446 | defer sub_block.instructions.deinit(gpa); | |
| 5385 | 5447 | |
| 5386 | 5448 | _ = try sema.analyzeBody(&sub_block, then_body); |
| 5387 | const air_then_body: ir.Body = .{ | |
| 5388 | .instructions = try sema.arena.dupe(*Inst, sub_block.instructions.items), | |
| 5389 | }; | |
| 5390 | ||
| 5391 | sub_block.instructions.shrinkRetainingCapacity(0); | |
| 5449 | const true_instructions = sub_block.instructions.toOwnedSlice(gpa); | |
| 5450 | defer gpa.free(true_instructions); | |
| 5392 | 5451 | |
| 5393 | 5452 | _ = try sema.analyzeBody(&sub_block, else_body); |
| 5394 | const air_else_body: ir.Body = .{ | |
| 5395 | .instructions = try sema.arena.dupe(*Inst, sub_block.instructions.items), | |
| 5396 | }; | |
| 5397 | ||
| 5398 | _ = try parent_block.addCondBr(src, cond, air_then_body, air_else_body); | |
| 5453 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.CondBr).Struct.fields.len + | |
| 5454 | true_instructions.len + sub_block.instructions.items.len); | |
| 5455 | _ = try parent_block.addInst(.{ | |
| 5456 | .tag = .cond_br, | |
| 5457 | .data = .{ .pl_op = .{ | |
| 5458 | .operand = cond, | |
| 5459 | .payload = sema.addExtraAssumeCapacity(Air.CondBr{ | |
| 5460 | .then_body_len = @intCast(u32, true_instructions.len), | |
| 5461 | .else_body_len = @intCast(u32, sub_block.instructions.items.len), | |
| 5462 | }), | |
| 5463 | } }, | |
| 5464 | }); | |
| 5465 | sema.air_extra.appendSliceAssumeCapacity(true_instructions); | |
| 5466 | sema.air_extra.appendSliceAssumeCapacity(sub_block.instructions.items); | |
| 5399 | 5467 | return always_noreturn; |
| 5400 | 5468 | } |
| 5401 | 5469 | |
| 5402 | fn zirUnreachable(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!Zir.Inst.Index { | |
| 5470 | fn zirUnreachable(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Zir.Inst.Index { | |
| 5403 | 5471 | const tracy = trace(@src()); |
| 5404 | 5472 | defer tracy.end(); |
| 5405 | 5473 | |
| ... | ... | @@ -5411,7 +5479,7 @@ fn zirUnreachable(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerE |
| 5411 | 5479 | if (safety_check and block.wantSafety()) { |
| 5412 | 5480 | return sema.safetyPanic(block, src, .unreach); |
| 5413 | 5481 | } else { |
| 5414 | _ = try block.addNoOp(src, Type.initTag(.noreturn), .unreach); | |
| 5482 | _ = try block.addNoOp(.unreach); | |
| 5415 | 5483 | return always_noreturn; |
| 5416 | 5484 | } |
| 5417 | 5485 | } |
| ... | ... | @@ -5420,7 +5488,7 @@ fn zirRetErrValue( |
| 5420 | 5488 | sema: *Sema, |
| 5421 | 5489 | block: *Scope.Block, |
| 5422 | 5490 | inst: Zir.Inst.Index, |
| 5423 | ) InnerError!Zir.Inst.Index { | |
| 5491 | ) CompileError!Zir.Inst.Index { | |
| 5424 | 5492 | const inst_data = sema.code.instructions.items(.data)[inst].str_tok; |
| 5425 | 5493 | const err_name = inst_data.get(sema.code); |
| 5426 | 5494 | const src = inst_data.src(); |
| ... | ... | @@ -5433,10 +5501,10 @@ fn zirRetErrValue( |
| 5433 | 5501 | } |
| 5434 | 5502 | // Return the error code from the function. |
| 5435 | 5503 | const kv = try sema.mod.getErrorValue(err_name); |
| 5436 | const result_inst = try sema.mod.constInst(sema.arena, src, .{ | |
| 5437 | .ty = try Type.Tag.error_set_single.create(sema.arena, kv.key), | |
| 5438 | .val = try Value.Tag.@"error".create(sema.arena, .{ .name = kv.key }), | |
| 5439 | }); | |
| 5504 | const result_inst = try sema.addConstant( | |
| 5505 | try Type.Tag.error_set_single.create(sema.arena, kv.key), | |
| 5506 | try Value.Tag.@"error".create(sema.arena, .{ .name = kv.key }), | |
| 5507 | ); | |
| 5440 | 5508 | return sema.analyzeRet(block, result_inst, src, true); |
| 5441 | 5509 | } |
| 5442 | 5510 | |
| ... | ... | @@ -5445,23 +5513,23 @@ fn zirRetCoerce( |
| 5445 | 5513 | block: *Scope.Block, |
| 5446 | 5514 | inst: Zir.Inst.Index, |
| 5447 | 5515 | need_coercion: bool, |
| 5448 | ) InnerError!Zir.Inst.Index { | |
| 5516 | ) CompileError!Zir.Inst.Index { | |
| 5449 | 5517 | const tracy = trace(@src()); |
| 5450 | 5518 | defer tracy.end(); |
| 5451 | 5519 | |
| 5452 | 5520 | const inst_data = sema.code.instructions.items(.data)[inst].un_tok; |
| 5453 | const operand = try sema.resolveInst(inst_data.operand); | |
| 5521 | const operand = sema.resolveInst(inst_data.operand); | |
| 5454 | 5522 | const src = inst_data.src(); |
| 5455 | 5523 | |
| 5456 | 5524 | return sema.analyzeRet(block, operand, src, need_coercion); |
| 5457 | 5525 | } |
| 5458 | 5526 | |
| 5459 | fn zirRetNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!Zir.Inst.Index { | |
| 5527 | fn zirRetNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Zir.Inst.Index { | |
| 5460 | 5528 | const tracy = trace(@src()); |
| 5461 | 5529 | defer tracy.end(); |
| 5462 | 5530 | |
| 5463 | 5531 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5464 | const operand = try sema.resolveInst(inst_data.operand); | |
| 5532 | const operand = sema.resolveInst(inst_data.operand); | |
| 5465 | 5533 | const src = inst_data.src(); |
| 5466 | 5534 | |
| 5467 | 5535 | return sema.analyzeRet(block, operand, src, false); |
| ... | ... | @@ -5470,14 +5538,14 @@ fn zirRetNode(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 5470 | 5538 | fn analyzeRet( |
| 5471 | 5539 | sema: *Sema, |
| 5472 | 5540 | block: *Scope.Block, |
| 5473 | operand: *Inst, | |
| 5541 | operand: Air.Inst.Ref, | |
| 5474 | 5542 | src: LazySrcLoc, |
| 5475 | 5543 | need_coercion: bool, |
| 5476 | ) InnerError!Zir.Inst.Index { | |
| 5544 | ) CompileError!Zir.Inst.Index { | |
| 5477 | 5545 | if (block.inlining) |inlining| { |
| 5478 | 5546 | // We are inlining a function call; rewrite the `ret` as a `break`. |
| 5479 | 5547 | try inlining.merges.results.append(sema.gpa, operand); |
| 5480 | _ = try block.addBr(src, inlining.merges.block_inst, operand); | |
| 5548 | _ = try block.addBr(inlining.merges.block_inst, operand); | |
| 5481 | 5549 | return always_noreturn; |
| 5482 | 5550 | } |
| 5483 | 5551 | |
| ... | ... | @@ -5486,14 +5554,11 @@ fn analyzeRet( |
| 5486 | 5554 | const fn_ty = func.owner_decl.ty; |
| 5487 | 5555 | const fn_ret_ty = fn_ty.fnReturnType(); |
| 5488 | 5556 | const casted_operand = try sema.coerce(block, fn_ret_ty, operand, src); |
| 5489 | if (fn_ret_ty.zigTypeTag() == .Void) | |
| 5490 | _ = try block.addNoOp(src, Type.initTag(.noreturn), .retvoid) | |
| 5491 | else | |
| 5492 | _ = try block.addUnOp(src, Type.initTag(.noreturn), .ret, casted_operand); | |
| 5557 | _ = try block.addUnOp(.ret, casted_operand); | |
| 5493 | 5558 | return always_noreturn; |
| 5494 | 5559 | } |
| 5495 | 5560 | } |
| 5496 | _ = try block.addUnOp(src, Type.initTag(.noreturn), .ret, operand); | |
| 5561 | _ = try block.addUnOp(.ret, operand); | |
| 5497 | 5562 | return always_noreturn; |
| 5498 | 5563 | } |
| 5499 | 5564 | |
| ... | ... | @@ -5505,7 +5570,7 @@ fn floatOpAllowed(tag: Zir.Inst.Tag) bool { |
| 5505 | 5570 | }; |
| 5506 | 5571 | } |
| 5507 | 5572 | |
| 5508 | fn zirPtrTypeSimple(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5573 | fn zirPtrTypeSimple(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5509 | 5574 | const tracy = trace(@src()); |
| 5510 | 5575 | defer tracy.end(); |
| 5511 | 5576 | |
| ... | ... | @@ -5523,10 +5588,10 @@ fn zirPtrTypeSimple(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) Inne |
| 5523 | 5588 | inst_data.is_volatile, |
| 5524 | 5589 | inst_data.size, |
| 5525 | 5590 | ); |
| 5526 | return sema.mod.constType(sema.arena, .unneeded, ty); | |
| 5591 | return sema.addType(ty); | |
| 5527 | 5592 | } |
| 5528 | 5593 | |
| 5529 | fn zirPtrType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5594 | fn zirPtrType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5530 | 5595 | const tracy = trace(@src()); |
| 5531 | 5596 | defer tracy.end(); |
| 5532 | 5597 | |
| ... | ... | @@ -5577,10 +5642,10 @@ fn zirPtrType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError |
| 5577 | 5642 | inst_data.flags.is_volatile, |
| 5578 | 5643 | inst_data.size, |
| 5579 | 5644 | ); |
| 5580 | return sema.mod.constType(sema.arena, src, ty); | |
| 5645 | return sema.addType(ty); | |
| 5581 | 5646 | } |
| 5582 | 5647 | |
| 5583 | fn zirStructInitEmpty(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5648 | fn zirStructInitEmpty(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5584 | 5649 | const tracy = trace(@src()); |
| 5585 | 5650 | defer tracy.end(); |
| 5586 | 5651 | |
| ... | ... | @@ -5588,19 +5653,16 @@ fn zirStructInitEmpty(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) In |
| 5588 | 5653 | const src = inst_data.src(); |
| 5589 | 5654 | const struct_type = try sema.resolveType(block, src, inst_data.operand); |
| 5590 | 5655 | |
| 5591 | return sema.mod.constInst(sema.arena, src, .{ | |
| 5592 | .ty = struct_type, | |
| 5593 | .val = Value.initTag(.empty_struct_value), | |
| 5594 | }); | |
| 5656 | return sema.addConstant(struct_type, Value.initTag(.empty_struct_value)); | |
| 5595 | 5657 | } |
| 5596 | 5658 | |
| 5597 | fn zirUnionInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5659 | fn zirUnionInitPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5598 | 5660 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5599 | 5661 | const src = inst_data.src(); |
| 5600 | 5662 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirUnionInitPtr", .{}); |
| 5601 | 5663 | } |
| 5602 | 5664 | |
| 5603 | fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) InnerError!*Inst { | |
| 5665 | fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) CompileError!Air.Inst.Ref { | |
| 5604 | 5666 | const mod = sema.mod; |
| 5605 | 5667 | const gpa = sema.gpa; |
| 5606 | 5668 | const zir_datas = sema.code.instructions.items(.data); |
| ... | ... | @@ -5622,7 +5684,7 @@ fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: |
| 5622 | 5684 | mem.set(Zir.Inst.Index, found_fields, 0); |
| 5623 | 5685 | |
| 5624 | 5686 | // The init values to use for the struct instance. |
| 5625 | const field_inits = try gpa.alloc(*ir.Inst, struct_obj.fields.count()); | |
| 5687 | const field_inits = try gpa.alloc(Air.Inst.Ref, struct_obj.fields.count()); | |
| 5626 | 5688 | defer gpa.free(field_inits); |
| 5627 | 5689 | |
| 5628 | 5690 | var field_i: u32 = 0; |
| ... | ... | @@ -5651,7 +5713,7 @@ fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: |
| 5651 | 5713 | return mod.failWithOwnedErrorMsg(&block.base, msg); |
| 5652 | 5714 | } |
| 5653 | 5715 | found_fields[field_index] = item.data.field_type; |
| 5654 | field_inits[field_index] = try sema.resolveInst(item.data.init); | |
| 5716 | field_inits[field_index] = sema.resolveInst(item.data.init); | |
| 5655 | 5717 | } |
| 5656 | 5718 | |
| 5657 | 5719 | var root_msg: ?*Module.ErrorMsg = null; |
| ... | ... | @@ -5671,10 +5733,7 @@ fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: |
| 5671 | 5733 | root_msg = try mod.errMsg(&block.base, src, template, args); |
| 5672 | 5734 | } |
| 5673 | 5735 | } else { |
| 5674 | field_inits[i] = try mod.constInst(sema.arena, src, .{ | |
| 5675 | .ty = field.ty, | |
| 5676 | .val = field.default_val, | |
| 5677 | }); | |
| 5736 | field_inits[i] = try sema.addConstant(field.ty, field.default_val); | |
| 5678 | 5737 | } |
| 5679 | 5738 | } |
| 5680 | 5739 | if (root_msg) |msg| { |
| ... | ... | @@ -5694,7 +5753,7 @@ fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: |
| 5694 | 5753 | } |
| 5695 | 5754 | |
| 5696 | 5755 | const is_comptime = for (field_inits) |field_init| { |
| 5697 | if (field_init.value() == null) { | |
| 5756 | if (!(try sema.isComptimeKnown(block, src, field_init))) { | |
| 5698 | 5757 | break false; |
| 5699 | 5758 | } |
| 5700 | 5759 | } else true; |
| ... | ... | @@ -5702,18 +5761,15 @@ fn zirStructInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: |
| 5702 | 5761 | if (is_comptime) { |
| 5703 | 5762 | const values = try sema.arena.alloc(Value, field_inits.len); |
| 5704 | 5763 | for (field_inits) |field_init, i| { |
| 5705 | values[i] = field_init.value().?; | |
| 5764 | values[i] = (sema.resolvePossiblyUndefinedValue(block, src, field_init) catch unreachable).?; | |
| 5706 | 5765 | } |
| 5707 | return mod.constInst(sema.arena, src, .{ | |
| 5708 | .ty = struct_ty, | |
| 5709 | .val = try Value.Tag.@"struct".create(sema.arena, values.ptr), | |
| 5710 | }); | |
| 5766 | return sema.addConstant(struct_ty, try Value.Tag.@"struct".create(sema.arena, values.ptr)); | |
| 5711 | 5767 | } |
| 5712 | 5768 | |
| 5713 | 5769 | return mod.fail(&block.base, src, "TODO: Sema.zirStructInit for runtime-known struct values", .{}); |
| 5714 | 5770 | } |
| 5715 | 5771 | |
| 5716 | fn zirStructInitAnon(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) InnerError!*Inst { | |
| 5772 | fn zirStructInitAnon(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) CompileError!Air.Inst.Ref { | |
| 5717 | 5773 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5718 | 5774 | const src = inst_data.src(); |
| 5719 | 5775 | |
| ... | ... | @@ -5721,7 +5777,7 @@ fn zirStructInitAnon(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ |
| 5721 | 5777 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirStructInitAnon", .{}); |
| 5722 | 5778 | } |
| 5723 | 5779 | |
| 5724 | fn zirArrayInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) InnerError!*Inst { | |
| 5780 | fn zirArrayInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) CompileError!Air.Inst.Ref { | |
| 5725 | 5781 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5726 | 5782 | const src = inst_data.src(); |
| 5727 | 5783 | |
| ... | ... | @@ -5729,7 +5785,7 @@ fn zirArrayInit(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: |
| 5729 | 5785 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirArrayInit", .{}); |
| 5730 | 5786 | } |
| 5731 | 5787 | |
| 5732 | fn zirArrayInitAnon(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) InnerError!*Inst { | |
| 5788 | fn zirArrayInitAnon(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_ref: bool) CompileError!Air.Inst.Ref { | |
| 5733 | 5789 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5734 | 5790 | const src = inst_data.src(); |
| 5735 | 5791 | |
| ... | ... | @@ -5737,13 +5793,13 @@ fn zirArrayInitAnon(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index, is_r |
| 5737 | 5793 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirArrayInitAnon", .{}); |
| 5738 | 5794 | } |
| 5739 | 5795 | |
| 5740 | fn zirFieldTypeRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5796 | fn zirFieldTypeRef(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5741 | 5797 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5742 | 5798 | const src = inst_data.src(); |
| 5743 | 5799 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFieldTypeRef", .{}); |
| 5744 | 5800 | } |
| 5745 | 5801 | |
| 5746 | fn zirFieldType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5802 | fn zirFieldType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5747 | 5803 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5748 | 5804 | const extra = sema.code.extraData(Zir.Inst.FieldType, inst_data.payload_index).data; |
| 5749 | 5805 | const src = inst_data.src(); |
| ... | ... | @@ -5758,14 +5814,14 @@ fn zirFieldType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErr |
| 5758 | 5814 | const struct_obj = struct_ty.castTag(.@"struct").?.data; |
| 5759 | 5815 | const field = struct_obj.fields.get(field_name) orelse |
| 5760 | 5816 | return sema.failWithBadFieldAccess(block, struct_obj, src, field_name); |
| 5761 | return sema.mod.constType(sema.arena, src, field.ty); | |
| 5817 | return sema.addType(field.ty); | |
| 5762 | 5818 | } |
| 5763 | 5819 | |
| 5764 | 5820 | fn zirErrorReturnTrace( |
| 5765 | 5821 | sema: *Sema, |
| 5766 | 5822 | block: *Scope.Block, |
| 5767 | 5823 | extended: Zir.Inst.Extended.InstData, |
| 5768 | ) InnerError!*Inst { | |
| 5824 | ) CompileError!Air.Inst.Ref { | |
| 5769 | 5825 | const src: LazySrcLoc = .{ .node_offset = @bitCast(i32, extended.operand) }; |
| 5770 | 5826 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirErrorReturnTrace", .{}); |
| 5771 | 5827 | } |
| ... | ... | @@ -5774,7 +5830,7 @@ fn zirFrame( |
| 5774 | 5830 | sema: *Sema, |
| 5775 | 5831 | block: *Scope.Block, |
| 5776 | 5832 | extended: Zir.Inst.Extended.InstData, |
| 5777 | ) InnerError!*Inst { | |
| 5833 | ) CompileError!Air.Inst.Ref { | |
| 5778 | 5834 | const src: LazySrcLoc = .{ .node_offset = @bitCast(i32, extended.operand) }; |
| 5779 | 5835 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFrame", .{}); |
| 5780 | 5836 | } |
| ... | ... | @@ -5783,91 +5839,91 @@ fn zirFrameAddress( |
| 5783 | 5839 | sema: *Sema, |
| 5784 | 5840 | block: *Scope.Block, |
| 5785 | 5841 | extended: Zir.Inst.Extended.InstData, |
| 5786 | ) InnerError!*Inst { | |
| 5842 | ) CompileError!Air.Inst.Ref { | |
| 5787 | 5843 | const src: LazySrcLoc = .{ .node_offset = @bitCast(i32, extended.operand) }; |
| 5788 | 5844 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFrameAddress", .{}); |
| 5789 | 5845 | } |
| 5790 | 5846 | |
| 5791 | fn zirAlignOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5847 | fn zirAlignOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5792 | 5848 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5793 | 5849 | const src = inst_data.src(); |
| 5794 | 5850 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirAlignOf", .{}); |
| 5795 | 5851 | } |
| 5796 | 5852 | |
| 5797 | fn zirBoolToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5853 | fn zirBoolToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5798 | 5854 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5799 | 5855 | const src = inst_data.src(); |
| 5800 | 5856 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirBoolToInt", .{}); |
| 5801 | 5857 | } |
| 5802 | 5858 | |
| 5803 | fn zirEmbedFile(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5859 | fn zirEmbedFile(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5804 | 5860 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5805 | 5861 | const src = inst_data.src(); |
| 5806 | 5862 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirEmbedFile", .{}); |
| 5807 | 5863 | } |
| 5808 | 5864 | |
| 5809 | fn zirErrorName(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5865 | fn zirErrorName(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5810 | 5866 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5811 | 5867 | const src = inst_data.src(); |
| 5812 | 5868 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirErrorName", .{}); |
| 5813 | 5869 | } |
| 5814 | 5870 | |
| 5815 | fn zirUnaryMath(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5871 | fn zirUnaryMath(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5816 | 5872 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5817 | 5873 | const src = inst_data.src(); |
| 5818 | 5874 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirUnaryMath", .{}); |
| 5819 | 5875 | } |
| 5820 | 5876 | |
| 5821 | fn zirTagName(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5877 | fn zirTagName(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5822 | 5878 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5823 | 5879 | const src = inst_data.src(); |
| 5824 | 5880 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirTagName", .{}); |
| 5825 | 5881 | } |
| 5826 | 5882 | |
| 5827 | fn zirReify(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5883 | fn zirReify(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5828 | 5884 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5829 | 5885 | const src = inst_data.src(); |
| 5830 | 5886 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirReify", .{}); |
| 5831 | 5887 | } |
| 5832 | 5888 | |
| 5833 | fn zirTypeName(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5889 | fn zirTypeName(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5834 | 5890 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5835 | 5891 | const src = inst_data.src(); |
| 5836 | 5892 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirTypeName", .{}); |
| 5837 | 5893 | } |
| 5838 | 5894 | |
| 5839 | fn zirFrameType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5895 | fn zirFrameType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5840 | 5896 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5841 | 5897 | const src = inst_data.src(); |
| 5842 | 5898 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFrameType", .{}); |
| 5843 | 5899 | } |
| 5844 | 5900 | |
| 5845 | fn zirFrameSize(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5901 | fn zirFrameSize(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5846 | 5902 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5847 | 5903 | const src = inst_data.src(); |
| 5848 | 5904 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFrameSize", .{}); |
| 5849 | 5905 | } |
| 5850 | 5906 | |
| 5851 | fn zirFloatToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5907 | fn zirFloatToInt(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5852 | 5908 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5853 | 5909 | const src = inst_data.src(); |
| 5854 | 5910 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFloatToInt", .{}); |
| 5855 | 5911 | } |
| 5856 | 5912 | |
| 5857 | fn zirIntToFloat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5913 | fn zirIntToFloat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5858 | 5914 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5859 | 5915 | const src = inst_data.src(); |
| 5860 | 5916 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirIntToFloat", .{}); |
| 5861 | 5917 | } |
| 5862 | 5918 | |
| 5863 | fn zirIntToPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5919 | fn zirIntToPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5864 | 5920 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5865 | 5921 | const src = inst_data.src(); |
| 5866 | 5922 | |
| 5867 | 5923 | const extra = sema.code.extraData(Zir.Inst.Bin, inst_data.payload_index).data; |
| 5868 | 5924 | |
| 5869 | 5925 | const operand_src: LazySrcLoc = .{ .node_offset_builtin_call_arg1 = inst_data.src_node }; |
| 5870 | const operand_res = try sema.resolveInst(extra.rhs); | |
| 5926 | const operand_res = sema.resolveInst(extra.rhs); | |
| 5871 | 5927 | const operand_coerced = try sema.coerce(block, Type.initTag(.usize), operand_res, operand_src); |
| 5872 | 5928 | |
| 5873 | 5929 | const type_src: LazySrcLoc = .{ .node_offset_builtin_call_arg0 = inst_data.src_node }; |
| ... | ... | @@ -5888,20 +5944,13 @@ fn zirIntToPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 5888 | 5944 | .base = .{ .tag = .int_u64 }, |
| 5889 | 5945 | .data = addr, |
| 5890 | 5946 | }; |
| 5891 | return sema.mod.constInst(sema.arena, src, .{ | |
| 5892 | .ty = type_res, | |
| 5893 | .val = Value.initPayload(&val_payload.base), | |
| 5894 | }); | |
| 5947 | return sema.addConstant(type_res, Value.initPayload(&val_payload.base)); | |
| 5895 | 5948 | } |
| 5896 | 5949 | |
| 5897 | 5950 | try sema.requireRuntimeBlock(block, src); |
| 5898 | 5951 | if (block.wantSafety()) { |
| 5899 | const zero = try sema.mod.constInst(sema.arena, src, .{ | |
| 5900 | .ty = Type.initTag(.u64), | |
| 5901 | .val = Value.initTag(.zero), | |
| 5902 | }); | |
| 5903 | 5952 | if (!type_res.isAllowzeroPtr()) { |
| 5904 | const is_non_zero = try block.addBinOp(src, Type.initTag(.bool), .cmp_neq, operand_coerced, zero); | |
| 5953 | const is_non_zero = try block.addBinOp(.cmp_neq, operand_coerced, .zero_usize); | |
| 5905 | 5954 | try sema.addSafetyCheck(block, is_non_zero, .cast_to_null); |
| 5906 | 5955 | } |
| 5907 | 5956 | |
| ... | ... | @@ -5911,211 +5960,211 @@ fn zirIntToPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerErro |
| 5911 | 5960 | .base = .{ .tag = .int_u64 }, |
| 5912 | 5961 | .data = ptr_align - 1, |
| 5913 | 5962 | }; |
| 5914 | const align_minus_1 = try sema.mod.constInst(sema.arena, src, .{ | |
| 5915 | .ty = Type.initTag(.u64), | |
| 5916 | .val = Value.initPayload(&val_payload.base), | |
| 5917 | }); | |
| 5918 | const remainder = try block.addBinOp(src, Type.initTag(.u64), .bit_and, operand_coerced, align_minus_1); | |
| 5919 | const is_aligned = try block.addBinOp(src, Type.initTag(.bool), .cmp_eq, remainder, zero); | |
| 5963 | const align_minus_1 = try sema.addConstant( | |
| 5964 | Type.initTag(.usize), | |
| 5965 | Value.initPayload(&val_payload.base), | |
| 5966 | ); | |
| 5967 | const remainder = try block.addBinOp(.bit_and, operand_coerced, align_minus_1); | |
| 5968 | const is_aligned = try block.addBinOp(.cmp_eq, remainder, .zero_usize); | |
| 5920 | 5969 | try sema.addSafetyCheck(block, is_aligned, .incorrect_alignment); |
| 5921 | 5970 | } |
| 5922 | 5971 | } |
| 5923 | return block.addUnOp(src, type_res, .bitcast, operand_coerced); | |
| 5972 | return block.addTyOp(.bitcast, type_res, operand_coerced); | |
| 5924 | 5973 | } |
| 5925 | 5974 | |
| 5926 | fn zirErrSetCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5975 | fn zirErrSetCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5927 | 5976 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5928 | 5977 | const src = inst_data.src(); |
| 5929 | 5978 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirErrSetCast", .{}); |
| 5930 | 5979 | } |
| 5931 | 5980 | |
| 5932 | fn zirPtrCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5981 | fn zirPtrCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5933 | 5982 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5934 | 5983 | const src = inst_data.src(); |
| 5935 | 5984 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirPtrCast", .{}); |
| 5936 | 5985 | } |
| 5937 | 5986 | |
| 5938 | fn zirTruncate(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5987 | fn zirTruncate(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5939 | 5988 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5940 | 5989 | const src = inst_data.src(); |
| 5941 | 5990 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirTruncate", .{}); |
| 5942 | 5991 | } |
| 5943 | 5992 | |
| 5944 | fn zirAlignCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5993 | fn zirAlignCast(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5945 | 5994 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5946 | 5995 | const src = inst_data.src(); |
| 5947 | 5996 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirAlignCast", .{}); |
| 5948 | 5997 | } |
| 5949 | 5998 | |
| 5950 | fn zirClz(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 5999 | fn zirClz(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5951 | 6000 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5952 | 6001 | const src = inst_data.src(); |
| 5953 | 6002 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirClz", .{}); |
| 5954 | 6003 | } |
| 5955 | 6004 | |
| 5956 | fn zirCtz(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6005 | fn zirCtz(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5957 | 6006 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5958 | 6007 | const src = inst_data.src(); |
| 5959 | 6008 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirCtz", .{}); |
| 5960 | 6009 | } |
| 5961 | 6010 | |
| 5962 | fn zirPopCount(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6011 | fn zirPopCount(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5963 | 6012 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5964 | 6013 | const src = inst_data.src(); |
| 5965 | 6014 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirPopCount", .{}); |
| 5966 | 6015 | } |
| 5967 | 6016 | |
| 5968 | fn zirByteSwap(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6017 | fn zirByteSwap(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5969 | 6018 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5970 | 6019 | const src = inst_data.src(); |
| 5971 | 6020 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirByteSwap", .{}); |
| 5972 | 6021 | } |
| 5973 | 6022 | |
| 5974 | fn zirBitReverse(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6023 | fn zirBitReverse(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5975 | 6024 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 5976 | 6025 | const src = inst_data.src(); |
| 5977 | 6026 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirBitReverse", .{}); |
| 5978 | 6027 | } |
| 5979 | 6028 | |
| 5980 | fn zirDivExact(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6029 | fn zirDivExact(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5981 | 6030 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5982 | 6031 | const src = inst_data.src(); |
| 5983 | 6032 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirDivExact", .{}); |
| 5984 | 6033 | } |
| 5985 | 6034 | |
| 5986 | fn zirDivFloor(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6035 | fn zirDivFloor(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5987 | 6036 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5988 | 6037 | const src = inst_data.src(); |
| 5989 | 6038 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirDivFloor", .{}); |
| 5990 | 6039 | } |
| 5991 | 6040 | |
| 5992 | fn zirDivTrunc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6041 | fn zirDivTrunc(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5993 | 6042 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 5994 | 6043 | const src = inst_data.src(); |
| 5995 | 6044 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirDivTrunc", .{}); |
| 5996 | 6045 | } |
| 5997 | 6046 | |
| 5998 | fn zirMod(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6047 | fn zirMod(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 5999 | 6048 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6000 | 6049 | const src = inst_data.src(); |
| 6001 | 6050 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirMod", .{}); |
| 6002 | 6051 | } |
| 6003 | 6052 | |
| 6004 | fn zirRem(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6053 | fn zirRem(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6005 | 6054 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6006 | 6055 | const src = inst_data.src(); |
| 6007 | 6056 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirRem", .{}); |
| 6008 | 6057 | } |
| 6009 | 6058 | |
| 6010 | fn zirShlExact(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6059 | fn zirShlExact(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6011 | 6060 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6012 | 6061 | const src = inst_data.src(); |
| 6013 | 6062 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirShlExact", .{}); |
| 6014 | 6063 | } |
| 6015 | 6064 | |
| 6016 | fn zirShrExact(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6065 | fn zirShrExact(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6017 | 6066 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6018 | 6067 | const src = inst_data.src(); |
| 6019 | 6068 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirShrExact", .{}); |
| 6020 | 6069 | } |
| 6021 | 6070 | |
| 6022 | fn zirBitOffsetOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6071 | fn zirBitOffsetOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6023 | 6072 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6024 | 6073 | const src = inst_data.src(); |
| 6025 | 6074 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirBitOffsetOf", .{}); |
| 6026 | 6075 | } |
| 6027 | 6076 | |
| 6028 | fn zirOffsetOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6077 | fn zirOffsetOf(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6029 | 6078 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6030 | 6079 | const src = inst_data.src(); |
| 6031 | 6080 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirOffsetOf", .{}); |
| 6032 | 6081 | } |
| 6033 | 6082 | |
| 6034 | fn zirCmpxchg(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6083 | fn zirCmpxchg(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6035 | 6084 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6036 | 6085 | const src = inst_data.src(); |
| 6037 | 6086 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirCmpxchg", .{}); |
| 6038 | 6087 | } |
| 6039 | 6088 | |
| 6040 | fn zirSplat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6089 | fn zirSplat(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6041 | 6090 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6042 | 6091 | const src = inst_data.src(); |
| 6043 | 6092 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirSplat", .{}); |
| 6044 | 6093 | } |
| 6045 | 6094 | |
| 6046 | fn zirReduce(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6095 | fn zirReduce(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6047 | 6096 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6048 | 6097 | const src = inst_data.src(); |
| 6049 | 6098 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirReduce", .{}); |
| 6050 | 6099 | } |
| 6051 | 6100 | |
| 6052 | fn zirShuffle(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6101 | fn zirShuffle(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6053 | 6102 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6054 | 6103 | const src = inst_data.src(); |
| 6055 | 6104 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirShuffle", .{}); |
| 6056 | 6105 | } |
| 6057 | 6106 | |
| 6058 | fn zirAtomicLoad(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6107 | fn zirAtomicLoad(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6059 | 6108 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6060 | 6109 | const src = inst_data.src(); |
| 6061 | 6110 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirAtomicLoad", .{}); |
| 6062 | 6111 | } |
| 6063 | 6112 | |
| 6064 | fn zirAtomicRmw(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6113 | fn zirAtomicRmw(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6065 | 6114 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6066 | 6115 | const src = inst_data.src(); |
| 6067 | 6116 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirAtomicRmw", .{}); |
| 6068 | 6117 | } |
| 6069 | 6118 | |
| 6070 | fn zirAtomicStore(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6119 | fn zirAtomicStore(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6071 | 6120 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6072 | 6121 | const src = inst_data.src(); |
| 6073 | 6122 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirAtomicStore", .{}); |
| 6074 | 6123 | } |
| 6075 | 6124 | |
| 6076 | fn zirMulAdd(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6125 | fn zirMulAdd(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6077 | 6126 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6078 | 6127 | const src = inst_data.src(); |
| 6079 | 6128 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirMulAdd", .{}); |
| 6080 | 6129 | } |
| 6081 | 6130 | |
| 6082 | fn zirBuiltinCall(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6131 | fn zirBuiltinCall(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6083 | 6132 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6084 | 6133 | const src = inst_data.src(); |
| 6085 | 6134 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirBuiltinCall", .{}); |
| 6086 | 6135 | } |
| 6087 | 6136 | |
| 6088 | fn zirFieldPtrType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6137 | fn zirFieldPtrType(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6089 | 6138 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6090 | 6139 | const src = inst_data.src(); |
| 6091 | 6140 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFieldPtrType", .{}); |
| 6092 | 6141 | } |
| 6093 | 6142 | |
| 6094 | fn zirFieldParentPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6143 | fn zirFieldParentPtr(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6095 | 6144 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6096 | 6145 | const src = inst_data.src(); |
| 6097 | 6146 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirFieldParentPtr", .{}); |
| 6098 | 6147 | } |
| 6099 | 6148 | |
| 6100 | fn zirMemcpy(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6149 | fn zirMemcpy(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6101 | 6150 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6102 | 6151 | const src = inst_data.src(); |
| 6103 | 6152 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirMemcpy", .{}); |
| 6104 | 6153 | } |
| 6105 | 6154 | |
| 6106 | fn zirMemset(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6155 | fn zirMemset(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6107 | 6156 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6108 | 6157 | const src = inst_data.src(); |
| 6109 | 6158 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirMemset", .{}); |
| 6110 | 6159 | } |
| 6111 | 6160 | |
| 6112 | fn zirBuiltinAsyncCall(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6161 | fn zirBuiltinAsyncCall(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6113 | 6162 | const inst_data = sema.code.instructions.items(.data)[inst].pl_node; |
| 6114 | 6163 | const src = inst_data.src(); |
| 6115 | 6164 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirBuiltinAsyncCall", .{}); |
| 6116 | 6165 | } |
| 6117 | 6166 | |
| 6118 | fn zirResume(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) InnerError!*Inst { | |
| 6167 | fn zirResume(sema: *Sema, block: *Scope.Block, inst: Zir.Inst.Index) CompileError!Air.Inst.Ref { | |
| 6119 | 6168 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 6120 | 6169 | const src = inst_data.src(); |
| 6121 | 6170 | return sema.mod.fail(&block.base, src, "TODO: Sema.zirResume", .{}); |
| ... | ... | @@ -6126,7 +6175,7 @@ fn zirAwait( |
| 6126 | 6175 | block: *Scope.Block, |
| 6127 | 6176 | inst: Zir.Inst.Index, |
| 6128 | 6177 | is_nosuspend: bool, |
| 6129 | ) InnerError!*Inst { | |
| 6178 | ) CompileError!Air.Inst.Ref { | |
| 6130 | 6179 | const inst_data = sema.code.instructions.items(.data)[inst].un_node; |
| 6131 | 6180 | const src = inst_data.src(); |
| 6132 | 6181 | |
| ... | ... | @@ -6138,7 +6187,7 @@ fn zirVarExtended( |
| 6138 | 6187 | sema: *Sema, |
| 6139 | 6188 | block: *Scope.Block, |
| 6140 | 6189 | extended: Zir.Inst.Extended.InstData, |
| 6141 | ) InnerError!*Inst { | |
| 6190 | ) CompileError!Air.Inst.Ref { | |
| 6142 | 6191 | const extra = sema.code.extraData(Zir.Inst.ExtendedVar, extended.operand); |
| 6143 | 6192 | const src = sema.src; |
| 6144 | 6193 | const ty_src: LazySrcLoc = src; // TODO add a LazySrcLoc that points at type |
| ... | ... | @@ -6192,10 +6241,10 @@ fn zirVarExtended( |
| 6192 | 6241 | .is_mutable = true, // TODO get rid of this unused field |
| 6193 | 6242 | .is_threadlocal = small.is_threadlocal, |
| 6194 | 6243 | }; |
| 6195 | const result = try sema.mod.constInst(sema.arena, src, .{ | |
| 6196 | .ty = var_ty, | |
| 6197 | .val = try Value.Tag.variable.create(sema.arena, new_var), | |
| 6198 | }); | |
| 6244 | const result = try sema.addConstant( | |
| 6245 | var_ty, | |
| 6246 | try Value.Tag.variable.create(sema.arena, new_var), | |
| 6247 | ); | |
| 6199 | 6248 | return result; |
| 6200 | 6249 | } |
| 6201 | 6250 | |
| ... | ... | @@ -6204,7 +6253,7 @@ fn zirFuncExtended( |
| 6204 | 6253 | block: *Scope.Block, |
| 6205 | 6254 | extended: Zir.Inst.Extended.InstData, |
| 6206 | 6255 | inst: Zir.Inst.Index, |
| 6207 | ) InnerError!*Inst { | |
| 6256 | ) CompileError!Air.Inst.Ref { | |
| 6208 | 6257 | const tracy = trace(@src()); |
| 6209 | 6258 | defer tracy.end(); |
| 6210 | 6259 | |
| ... | ... | @@ -6271,7 +6320,7 @@ fn zirCUndef( |
| 6271 | 6320 | sema: *Sema, |
| 6272 | 6321 | block: *Scope.Block, |
| 6273 | 6322 | extended: Zir.Inst.Extended.InstData, |
| 6274 | ) InnerError!*Inst { | |
| 6323 | ) CompileError!Air.Inst.Ref { | |
| 6275 | 6324 | const extra = sema.code.extraData(Zir.Inst.UnNode, extended.operand).data; |
| 6276 | 6325 | const src: LazySrcLoc = .{ .node_offset = extra.node }; |
| 6277 | 6326 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirCUndef", .{}); |
| ... | ... | @@ -6281,7 +6330,7 @@ fn zirCInclude( |
| 6281 | 6330 | sema: *Sema, |
| 6282 | 6331 | block: *Scope.Block, |
| 6283 | 6332 | extended: Zir.Inst.Extended.InstData, |
| 6284 | ) InnerError!*Inst { | |
| 6333 | ) CompileError!Air.Inst.Ref { | |
| 6285 | 6334 | const extra = sema.code.extraData(Zir.Inst.UnNode, extended.operand).data; |
| 6286 | 6335 | const src: LazySrcLoc = .{ .node_offset = extra.node }; |
| 6287 | 6336 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirCInclude", .{}); |
| ... | ... | @@ -6291,7 +6340,7 @@ fn zirCDefine( |
| 6291 | 6340 | sema: *Sema, |
| 6292 | 6341 | block: *Scope.Block, |
| 6293 | 6342 | extended: Zir.Inst.Extended.InstData, |
| 6294 | ) InnerError!*Inst { | |
| 6343 | ) CompileError!Air.Inst.Ref { | |
| 6295 | 6344 | const extra = sema.code.extraData(Zir.Inst.BinNode, extended.operand).data; |
| 6296 | 6345 | const src: LazySrcLoc = .{ .node_offset = extra.node }; |
| 6297 | 6346 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirCDefine", .{}); |
| ... | ... | @@ -6301,7 +6350,7 @@ fn zirWasmMemorySize( |
| 6301 | 6350 | sema: *Sema, |
| 6302 | 6351 | block: *Scope.Block, |
| 6303 | 6352 | extended: Zir.Inst.Extended.InstData, |
| 6304 | ) InnerError!*Inst { | |
| 6353 | ) CompileError!Air.Inst.Ref { | |
| 6305 | 6354 | const extra = sema.code.extraData(Zir.Inst.UnNode, extended.operand).data; |
| 6306 | 6355 | const src: LazySrcLoc = .{ .node_offset = extra.node }; |
| 6307 | 6356 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirWasmMemorySize", .{}); |
| ... | ... | @@ -6311,7 +6360,7 @@ fn zirWasmMemoryGrow( |
| 6311 | 6360 | sema: *Sema, |
| 6312 | 6361 | block: *Scope.Block, |
| 6313 | 6362 | extended: Zir.Inst.Extended.InstData, |
| 6314 | ) InnerError!*Inst { | |
| 6363 | ) CompileError!Air.Inst.Ref { | |
| 6315 | 6364 | const extra = sema.code.extraData(Zir.Inst.BinNode, extended.operand).data; |
| 6316 | 6365 | const src: LazySrcLoc = .{ .node_offset = extra.node }; |
| 6317 | 6366 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirWasmMemoryGrow", .{}); |
| ... | ... | @@ -6321,7 +6370,7 @@ fn zirBuiltinExtern( |
| 6321 | 6370 | sema: *Sema, |
| 6322 | 6371 | block: *Scope.Block, |
| 6323 | 6372 | extended: Zir.Inst.Extended.InstData, |
| 6324 | ) InnerError!*Inst { | |
| 6373 | ) CompileError!Air.Inst.Ref { | |
| 6325 | 6374 | const extra = sema.code.extraData(Zir.Inst.BinNode, extended.operand).data; |
| 6326 | 6375 | const src: LazySrcLoc = .{ .node_offset = extra.node }; |
| 6327 | 6376 | return sema.mod.fail(&block.base, src, "TODO: implement Sema.zirBuiltinExtern", .{}); |
| ... | ... | @@ -6355,32 +6404,13 @@ pub const PanicId = enum { |
| 6355 | 6404 | invalid_error_code, |
| 6356 | 6405 | }; |
| 6357 | 6406 | |
| 6358 | fn addSafetyCheck(sema: *Sema, parent_block: *Scope.Block, ok: *Inst, panic_id: PanicId) !void { | |
| 6359 | const block_inst = try sema.arena.create(Inst.Block); | |
| 6360 | block_inst.* = .{ | |
| 6361 | .base = .{ | |
| 6362 | .tag = Inst.Block.base_tag, | |
| 6363 | .ty = Type.initTag(.void), | |
| 6364 | .src = ok.src, | |
| 6365 | }, | |
| 6366 | .body = .{ | |
| 6367 | .instructions = try sema.arena.alloc(*Inst, 1), // Only need space for the condbr. | |
| 6368 | }, | |
| 6369 | }; | |
| 6370 | ||
| 6371 | const ok_body: ir.Body = .{ | |
| 6372 | .instructions = try sema.arena.alloc(*Inst, 1), // Only need space for the br_void. | |
| 6373 | }; | |
| 6374 | const br_void = try sema.arena.create(Inst.BrVoid); | |
| 6375 | br_void.* = .{ | |
| 6376 | .base = .{ | |
| 6377 | .tag = .br_void, | |
| 6378 | .ty = Type.initTag(.noreturn), | |
| 6379 | .src = ok.src, | |
| 6380 | }, | |
| 6381 | .block = block_inst, | |
| 6382 | }; | |
| 6383 | ok_body.instructions[0] = &br_void.base; | |
| 6407 | fn addSafetyCheck( | |
| 6408 | sema: *Sema, | |
| 6409 | parent_block: *Scope.Block, | |
| 6410 | ok: Air.Inst.Ref, | |
| 6411 | panic_id: PanicId, | |
| 6412 | ) !void { | |
| 6413 | const gpa = sema.gpa; | |
| 6384 | 6414 | |
| 6385 | 6415 | var fail_block: Scope.Block = .{ |
| 6386 | 6416 | .parent = parent_block, |
| ... | ... | @@ -6391,33 +6421,62 @@ fn addSafetyCheck(sema: *Sema, parent_block: *Scope.Block, ok: *Inst, panic_id: |
| 6391 | 6421 | .is_comptime = parent_block.is_comptime, |
| 6392 | 6422 | }; |
| 6393 | 6423 | |
| 6394 | defer fail_block.instructions.deinit(sema.gpa); | |
| 6424 | defer fail_block.instructions.deinit(gpa); | |
| 6395 | 6425 | |
| 6396 | _ = try sema.safetyPanic(&fail_block, ok.src, panic_id); | |
| 6426 | _ = try sema.safetyPanic(&fail_block, .unneeded, panic_id); | |
| 6397 | 6427 | |
| 6398 | const fail_body: ir.Body = .{ .instructions = try sema.arena.dupe(*Inst, fail_block.instructions.items) }; | |
| 6428 | try parent_block.instructions.ensureUnusedCapacity(gpa, 1); | |
| 6399 | 6429 | |
| 6400 | const condbr = try sema.arena.create(Inst.CondBr); | |
| 6401 | condbr.* = .{ | |
| 6402 | .base = .{ | |
| 6403 | .tag = .condbr, | |
| 6404 | .ty = Type.initTag(.noreturn), | |
| 6405 | .src = ok.src, | |
| 6406 | }, | |
| 6407 | .condition = ok, | |
| 6408 | .then_body = ok_body, | |
| 6409 | .else_body = fail_body, | |
| 6410 | }; | |
| 6411 | block_inst.body.instructions[0] = &condbr.base; | |
| 6430 | try sema.air_extra.ensureUnusedCapacity(gpa, @typeInfo(Air.Block).Struct.fields.len + | |
| 6431 | 1 + // The main block only needs space for the cond_br. | |
| 6432 | @typeInfo(Air.CondBr).Struct.fields.len + | |
| 6433 | 1 + // The ok branch of the cond_br only needs space for the br. | |
| 6434 | fail_block.instructions.items.len); | |
| 6412 | 6435 | |
| 6413 | try parent_block.instructions.append(sema.gpa, &block_inst.base); | |
| 6436 | try sema.air_instructions.ensureUnusedCapacity(gpa, 3); | |
| 6437 | const block_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 6438 | const cond_br_inst = block_inst + 1; | |
| 6439 | const br_inst = cond_br_inst + 1; | |
| 6440 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 6441 | .tag = .block, | |
| 6442 | .data = .{ .ty_pl = .{ | |
| 6443 | .ty = .void_type, | |
| 6444 | .payload = sema.addExtraAssumeCapacity(Air.Block{ | |
| 6445 | .body_len = 1, | |
| 6446 | }), | |
| 6447 | } }, | |
| 6448 | }); | |
| 6449 | sema.air_extra.appendAssumeCapacity(cond_br_inst); | |
| 6450 | ||
| 6451 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 6452 | .tag = .cond_br, | |
| 6453 | .data = .{ .pl_op = .{ | |
| 6454 | .operand = ok, | |
| 6455 | .payload = sema.addExtraAssumeCapacity(Air.CondBr{ | |
| 6456 | .then_body_len = 1, | |
| 6457 | .else_body_len = @intCast(u32, fail_block.instructions.items.len), | |
| 6458 | }), | |
| 6459 | } }, | |
| 6460 | }); | |
| 6461 | sema.air_extra.appendAssumeCapacity(br_inst); | |
| 6462 | sema.air_extra.appendSliceAssumeCapacity(fail_block.instructions.items); | |
| 6463 | ||
| 6464 | sema.air_instructions.appendAssumeCapacity(.{ | |
| 6465 | .tag = .br, | |
| 6466 | .data = .{ .br = .{ | |
| 6467 | .block_inst = block_inst, | |
| 6468 | .operand = .void_value, | |
| 6469 | } }, | |
| 6470 | }); | |
| 6471 | ||
| 6472 | parent_block.instructions.appendAssumeCapacity(block_inst); | |
| 6414 | 6473 | } |
| 6415 | 6474 | |
| 6416 | 6475 | fn panicWithMsg( |
| 6417 | 6476 | sema: *Sema, |
| 6418 | 6477 | block: *Scope.Block, |
| 6419 | 6478 | src: LazySrcLoc, |
| 6420 | msg_inst: *ir.Inst, | |
| 6479 | msg_inst: Air.Inst.Ref, | |
| 6421 | 6480 | ) !Zir.Inst.Index { |
| 6422 | 6481 | const mod = sema.mod; |
| 6423 | 6482 | const arena = sema.arena; |
| ... | ... | @@ -6426,19 +6485,19 @@ fn panicWithMsg( |
| 6426 | 6485 | mod.comp.bin_file.options.object_format == .c; |
| 6427 | 6486 | if (!this_feature_is_implemented_in_the_backend) { |
| 6428 | 6487 | // TODO implement this feature in all the backends and then delete this branch |
| 6429 | _ = try block.addNoOp(src, Type.initTag(.void), .breakpoint); | |
| 6430 | _ = try block.addNoOp(src, Type.initTag(.noreturn), .unreach); | |
| 6488 | _ = try block.addNoOp(.breakpoint); | |
| 6489 | _ = try block.addNoOp(.unreach); | |
| 6431 | 6490 | return always_noreturn; |
| 6432 | 6491 | } |
| 6433 | 6492 | const panic_fn = try sema.getBuiltin(block, src, "panic"); |
| 6434 | 6493 | const unresolved_stack_trace_ty = try sema.getBuiltinType(block, src, "StackTrace"); |
| 6435 | 6494 | const stack_trace_ty = try sema.resolveTypeFields(block, src, unresolved_stack_trace_ty); |
| 6436 | const ptr_stack_trace_ty = try mod.simplePtrType(arena, stack_trace_ty, true, .One); | |
| 6437 | const null_stack_trace = try mod.constInst(arena, src, .{ | |
| 6438 | .ty = try mod.optionalType(arena, ptr_stack_trace_ty), | |
| 6439 | .val = Value.initTag(.null_value), | |
| 6440 | }); | |
| 6441 | const args = try arena.create([2]*ir.Inst); | |
| 6495 | const ptr_stack_trace_ty = try Module.simplePtrType(arena, stack_trace_ty, true, .One); | |
| 6496 | const null_stack_trace = try sema.addConstant( | |
| 6497 | try mod.optionalType(arena, ptr_stack_trace_ty), | |
| 6498 | Value.initTag(.null_value), | |
| 6499 | ); | |
| 6500 | const args = try arena.create([2]Air.Inst.Ref); | |
| 6442 | 6501 | args.* = .{ msg_inst, null_stack_trace }; |
| 6443 | 6502 | _ = try sema.analyzeCall(block, panic_fn, src, src, .auto, false, args); |
| 6444 | 6503 | return always_noreturn; |
| ... | ... | @@ -6478,7 +6537,6 @@ fn safetyPanic( |
| 6478 | 6537 | }; |
| 6479 | 6538 | |
| 6480 | 6539 | const casted_msg_inst = try sema.coerce(block, Type.initTag(.const_slice_u8), msg_inst, src); |
| 6481 | ||
| 6482 | 6540 | return sema.panicWithMsg(block, src, casted_msg_inst); |
| 6483 | 6541 | } |
| 6484 | 6542 | |
| ... | ... | @@ -6494,27 +6552,29 @@ fn namedFieldPtr( |
| 6494 | 6552 | sema: *Sema, |
| 6495 | 6553 | block: *Scope.Block, |
| 6496 | 6554 | src: LazySrcLoc, |
| 6497 | object_ptr: *Inst, | |
| 6555 | object_ptr: Air.Inst.Ref, | |
| 6498 | 6556 | field_name: []const u8, |
| 6499 | 6557 | field_name_src: LazySrcLoc, |
| 6500 | ) InnerError!*Inst { | |
| 6558 | ) CompileError!Air.Inst.Ref { | |
| 6501 | 6559 | const mod = sema.mod; |
| 6502 | 6560 | const arena = sema.arena; |
| 6503 | 6561 | |
| 6504 | const elem_ty = switch (object_ptr.ty.zigTypeTag()) { | |
| 6505 | .Pointer => object_ptr.ty.elemType(), | |
| 6506 | else => return mod.fail(&block.base, object_ptr.src, "expected pointer, found '{}'", .{object_ptr.ty}), | |
| 6562 | const object_ptr_src = src; // TODO better source location | |
| 6563 | const object_ptr_ty = sema.typeOf(object_ptr); | |
| 6564 | const elem_ty = switch (object_ptr_ty.zigTypeTag()) { | |
| 6565 | .Pointer => object_ptr_ty.elemType(), | |
| 6566 | else => return mod.fail(&block.base, object_ptr_src, "expected pointer, found '{}'", .{object_ptr_ty}), | |
| 6507 | 6567 | }; |
| 6508 | 6568 | switch (elem_ty.zigTypeTag()) { |
| 6509 | 6569 | .Array => { |
| 6510 | 6570 | if (mem.eql(u8, field_name, "len")) { |
| 6511 | return mod.constInst(arena, src, .{ | |
| 6512 | .ty = Type.initTag(.single_const_pointer_to_comptime_int), | |
| 6513 | .val = try Value.Tag.ref_val.create( | |
| 6571 | return sema.addConstant( | |
| 6572 | Type.initTag(.single_const_pointer_to_comptime_int), | |
| 6573 | try Value.Tag.ref_val.create( | |
| 6514 | 6574 | arena, |
| 6515 | 6575 | try Value.Tag.int_u64.create(arena, elem_ty.arrayLen()), |
| 6516 | 6576 | ), |
| 6517 | }); | |
| 6577 | ); | |
| 6518 | 6578 | } else { |
| 6519 | 6579 | return mod.fail( |
| 6520 | 6580 | &block.base, |
| ... | ... | @@ -6529,13 +6589,13 @@ fn namedFieldPtr( |
| 6529 | 6589 | switch (ptr_child.zigTypeTag()) { |
| 6530 | 6590 | .Array => { |
| 6531 | 6591 | if (mem.eql(u8, field_name, "len")) { |
| 6532 | return mod.constInst(arena, src, .{ | |
| 6533 | .ty = Type.initTag(.single_const_pointer_to_comptime_int), | |
| 6534 | .val = try Value.Tag.ref_val.create( | |
| 6592 | return sema.addConstant( | |
| 6593 | Type.initTag(.single_const_pointer_to_comptime_int), | |
| 6594 | try Value.Tag.ref_val.create( | |
| 6535 | 6595 | arena, |
| 6536 | 6596 | try Value.Tag.int_u64.create(arena, ptr_child.arrayLen()), |
| 6537 | 6597 | ), |
| 6538 | }); | |
| 6598 | ); | |
| 6539 | 6599 | } else { |
| 6540 | 6600 | return mod.fail( |
| 6541 | 6601 | &block.base, |
| ... | ... | @@ -6549,9 +6609,9 @@ fn namedFieldPtr( |
| 6549 | 6609 | } |
| 6550 | 6610 | }, |
| 6551 | 6611 | .Type => { |
| 6552 | _ = try sema.resolveConstValue(block, object_ptr.src, object_ptr); | |
| 6553 | const result = try sema.analyzeLoad(block, src, object_ptr, object_ptr.src); | |
| 6554 | const val = result.value().?; | |
| 6612 | _ = try sema.resolveConstValue(block, object_ptr_src, object_ptr); | |
| 6613 | const result = try sema.analyzeLoad(block, src, object_ptr, object_ptr_src); | |
| 6614 | const val = (sema.resolveDefinedValue(block, src, result) catch unreachable).?; | |
| 6555 | 6615 | const child_type = try val.toType(arena); |
| 6556 | 6616 | switch (child_type.zigTypeTag()) { |
| 6557 | 6617 | .ErrorSet => { |
| ... | ... | @@ -6572,15 +6632,15 @@ fn namedFieldPtr( |
| 6572 | 6632 | }); |
| 6573 | 6633 | } else (try mod.getErrorValue(field_name)).key; |
| 6574 | 6634 | |
| 6575 | return mod.constInst(arena, src, .{ | |
| 6576 | .ty = try mod.simplePtrType(arena, child_type, false, .One), | |
| 6577 | .val = try Value.Tag.ref_val.create( | |
| 6635 | return sema.addConstant( | |
| 6636 | try Module.simplePtrType(arena, child_type, false, .One), | |
| 6637 | try Value.Tag.ref_val.create( | |
| 6578 | 6638 | arena, |
| 6579 | 6639 | try Value.Tag.@"error".create(arena, .{ |
| 6580 | 6640 | .name = name, |
| 6581 | 6641 | }), |
| 6582 | 6642 | ), |
| 6583 | }); | |
| 6643 | ); | |
| 6584 | 6644 | }, |
| 6585 | 6645 | .Struct, .Opaque, .Union => { |
| 6586 | 6646 | if (child_type.getNamespace()) |namespace| { |
| ... | ... | @@ -6626,10 +6686,10 @@ fn namedFieldPtr( |
| 6626 | 6686 | }; |
| 6627 | 6687 | const field_index_u32 = @intCast(u32, field_index); |
| 6628 | 6688 | const enum_val = try Value.Tag.enum_field_index.create(arena, field_index_u32); |
| 6629 | return mod.constInst(arena, src, .{ | |
| 6630 | .ty = try mod.simplePtrType(arena, child_type, false, .One), | |
| 6631 | .val = try Value.Tag.ref_val.create(arena, enum_val), | |
| 6632 | }); | |
| 6689 | return sema.addConstant( | |
| 6690 | try Module.simplePtrType(arena, child_type, false, .One), | |
| 6691 | try Value.Tag.ref_val.create(arena, enum_val), | |
| 6692 | ); | |
| 6633 | 6693 | }, |
| 6634 | 6694 | else => return mod.fail(&block.base, src, "type '{}' has no members", .{child_type}), |
| 6635 | 6695 | } |
| ... | ... | @@ -6647,7 +6707,7 @@ fn analyzeNamespaceLookup( |
| 6647 | 6707 | src: LazySrcLoc, |
| 6648 | 6708 | namespace: *Scope.Namespace, |
| 6649 | 6709 | decl_name: []const u8, |
| 6650 | ) InnerError!?*Inst { | |
| 6710 | ) CompileError!?Air.Inst.Ref { | |
| 6651 | 6711 | const mod = sema.mod; |
| 6652 | 6712 | const gpa = sema.gpa; |
| 6653 | 6713 | if (try sema.lookupInNamespace(namespace, decl_name)) |decl| { |
| ... | ... | @@ -6671,12 +6731,11 @@ fn analyzeStructFieldPtr( |
| 6671 | 6731 | sema: *Sema, |
| 6672 | 6732 | block: *Scope.Block, |
| 6673 | 6733 | src: LazySrcLoc, |
| 6674 | struct_ptr: *Inst, | |
| 6734 | struct_ptr: Air.Inst.Ref, | |
| 6675 | 6735 | field_name: []const u8, |
| 6676 | 6736 | field_name_src: LazySrcLoc, |
| 6677 | 6737 | unresolved_struct_ty: Type, |
| 6678 | ) InnerError!*Inst { | |
| 6679 | const mod = sema.mod; | |
| 6738 | ) CompileError!Air.Inst.Ref { | |
| 6680 | 6739 | const arena = sema.arena; |
| 6681 | 6740 | assert(unresolved_struct_ty.zigTypeTag() == .Struct); |
| 6682 | 6741 | |
| ... | ... | @@ -6686,31 +6745,40 @@ fn analyzeStructFieldPtr( |
| 6686 | 6745 | const field_index = struct_obj.fields.getIndex(field_name) orelse |
| 6687 | 6746 | return sema.failWithBadFieldAccess(block, struct_obj, field_name_src, field_name); |
| 6688 | 6747 | const field = struct_obj.fields.values()[field_index]; |
| 6689 | const ptr_field_ty = try mod.simplePtrType(arena, field.ty, true, .One); | |
| 6748 | const ptr_field_ty = try Module.simplePtrType(arena, field.ty, true, .One); | |
| 6690 | 6749 | |
| 6691 | 6750 | if (try sema.resolveDefinedValue(block, src, struct_ptr)) |struct_ptr_val| { |
| 6692 | return mod.constInst(arena, src, .{ | |
| 6693 | .ty = ptr_field_ty, | |
| 6694 | .val = try Value.Tag.field_ptr.create(arena, .{ | |
| 6751 | return sema.addConstant( | |
| 6752 | ptr_field_ty, | |
| 6753 | try Value.Tag.field_ptr.create(arena, .{ | |
| 6695 | 6754 | .container_ptr = struct_ptr_val, |
| 6696 | 6755 | .field_index = field_index, |
| 6697 | 6756 | }), |
| 6698 | }); | |
| 6757 | ); | |
| 6699 | 6758 | } |
| 6700 | 6759 | |
| 6701 | 6760 | try sema.requireRuntimeBlock(block, src); |
| 6702 | return block.addStructFieldPtr(src, ptr_field_ty, struct_ptr, @intCast(u32, field_index)); | |
| 6761 | return block.addInst(.{ | |
| 6762 | .tag = .struct_field_ptr, | |
| 6763 | .data = .{ .ty_pl = .{ | |
| 6764 | .ty = try sema.addType(ptr_field_ty), | |
| 6765 | .payload = try sema.addExtra(Air.StructField{ | |
| 6766 | .struct_ptr = struct_ptr, | |
| 6767 | .field_index = @intCast(u32, field_index), | |
| 6768 | }), | |
| 6769 | } }, | |
| 6770 | }); | |
| 6703 | 6771 | } |
| 6704 | 6772 | |
| 6705 | 6773 | fn analyzeUnionFieldPtr( |
| 6706 | 6774 | sema: *Sema, |
| 6707 | 6775 | block: *Scope.Block, |
| 6708 | 6776 | src: LazySrcLoc, |
| 6709 | union_ptr: *Inst, | |
| 6777 | union_ptr: Air.Inst.Ref, | |
| 6710 | 6778 | field_name: []const u8, |
| 6711 | 6779 | field_name_src: LazySrcLoc, |
| 6712 | 6780 | unresolved_union_ty: Type, |
| 6713 | ) InnerError!*Inst { | |
| 6781 | ) CompileError!Air.Inst.Ref { | |
| 6714 | 6782 | const mod = sema.mod; |
| 6715 | 6783 | const arena = sema.arena; |
| 6716 | 6784 | assert(unresolved_union_ty.zigTypeTag() == .Union); |
| ... | ... | @@ -6722,17 +6790,17 @@ fn analyzeUnionFieldPtr( |
| 6722 | 6790 | return sema.failWithBadUnionFieldAccess(block, union_obj, field_name_src, field_name); |
| 6723 | 6791 | |
| 6724 | 6792 | const field = union_obj.fields.values()[field_index]; |
| 6725 | const ptr_field_ty = try mod.simplePtrType(arena, field.ty, true, .One); | |
| 6793 | const ptr_field_ty = try Module.simplePtrType(arena, field.ty, true, .One); | |
| 6726 | 6794 | |
| 6727 | 6795 | if (try sema.resolveDefinedValue(block, src, union_ptr)) |union_ptr_val| { |
| 6728 | 6796 | // TODO detect inactive union field and emit compile error |
| 6729 | return mod.constInst(arena, src, .{ | |
| 6730 | .ty = ptr_field_ty, | |
| 6731 | .val = try Value.Tag.field_ptr.create(arena, .{ | |
| 6797 | return sema.addConstant( | |
| 6798 | ptr_field_ty, | |
| 6799 | try Value.Tag.field_ptr.create(arena, .{ | |
| 6732 | 6800 | .container_ptr = union_ptr_val, |
| 6733 | 6801 | .field_index = field_index, |
| 6734 | 6802 | }), |
| 6735 | }); | |
| 6803 | ); | |
| 6736 | 6804 | } |
| 6737 | 6805 | |
| 6738 | 6806 | try sema.requireRuntimeBlock(block, src); |
| ... | ... | @@ -6743,20 +6811,22 @@ fn elemPtr( |
| 6743 | 6811 | sema: *Sema, |
| 6744 | 6812 | block: *Scope.Block, |
| 6745 | 6813 | src: LazySrcLoc, |
| 6746 | array_ptr: *Inst, | |
| 6747 | elem_index: *Inst, | |
| 6814 | array_ptr: Air.Inst.Ref, | |
| 6815 | elem_index: Air.Inst.Ref, | |
| 6748 | 6816 | elem_index_src: LazySrcLoc, |
| 6749 | ) InnerError!*Inst { | |
| 6750 | const array_ty = switch (array_ptr.ty.zigTypeTag()) { | |
| 6751 | .Pointer => array_ptr.ty.elemType(), | |
| 6752 | else => return sema.mod.fail(&block.base, array_ptr.src, "expected pointer, found '{}'", .{array_ptr.ty}), | |
| 6817 | ) CompileError!Air.Inst.Ref { | |
| 6818 | const array_ptr_src = src; // TODO better source location | |
| 6819 | const array_ptr_ty = sema.typeOf(array_ptr); | |
| 6820 | const array_ty = switch (array_ptr_ty.zigTypeTag()) { | |
| 6821 | .Pointer => array_ptr_ty.elemType(), | |
| 6822 | else => return sema.mod.fail(&block.base, array_ptr_src, "expected pointer, found '{}'", .{array_ptr_ty}), | |
| 6753 | 6823 | }; |
| 6754 | 6824 | if (!array_ty.isIndexable()) { |
| 6755 | 6825 | return sema.mod.fail(&block.base, src, "array access of non-array type '{}'", .{array_ty}); |
| 6756 | 6826 | } |
| 6757 | 6827 | if (array_ty.isSinglePointer() and array_ty.elemType().zigTypeTag() == .Array) { |
| 6758 | 6828 | // we have to deref the ptr operand to get the actual array pointer |
| 6759 | const array_ptr_deref = try sema.analyzeLoad(block, src, array_ptr, array_ptr.src); | |
| 6829 | const array_ptr_deref = try sema.analyzeLoad(block, src, array_ptr, array_ptr_src); | |
| 6760 | 6830 | return sema.elemPtrArray(block, src, array_ptr_deref, elem_index, elem_index_src); |
| 6761 | 6831 | } |
| 6762 | 6832 | if (array_ty.zigTypeTag() == .Array) { |
| ... | ... | @@ -6770,23 +6840,23 @@ fn elemPtrArray( |
| 6770 | 6840 | sema: *Sema, |
| 6771 | 6841 | block: *Scope.Block, |
| 6772 | 6842 | src: LazySrcLoc, |
| 6773 | array_ptr: *Inst, | |
| 6774 | elem_index: *Inst, | |
| 6843 | array_ptr: Air.Inst.Ref, | |
| 6844 | elem_index: Air.Inst.Ref, | |
| 6775 | 6845 | elem_index_src: LazySrcLoc, |
| 6776 | ) InnerError!*Inst { | |
| 6777 | if (array_ptr.value()) |array_ptr_val| { | |
| 6778 | if (elem_index.value()) |index_val| { | |
| 6846 | ) CompileError!Air.Inst.Ref { | |
| 6847 | if (try sema.resolveDefinedValue(block, src, array_ptr)) |array_ptr_val| { | |
| 6848 | if (try sema.resolveDefinedValue(block, src, elem_index)) |index_val| { | |
| 6779 | 6849 | // Both array pointer and index are compile-time known. |
| 6780 | 6850 | const index_u64 = index_val.toUnsignedInt(); |
| 6781 | 6851 | // @intCast here because it would have been impossible to construct a value that |
| 6782 | 6852 | // required a larger index. |
| 6783 | 6853 | const elem_ptr = try array_ptr_val.elemPtr(sema.arena, @intCast(usize, index_u64)); |
| 6784 | const pointee_type = array_ptr.ty.elemType().elemType(); | |
| 6854 | const pointee_type = sema.typeOf(array_ptr).elemType().elemType(); | |
| 6785 | 6855 | |
| 6786 | return sema.mod.constInst(sema.arena, src, .{ | |
| 6787 | .ty = try Type.Tag.single_const_pointer.create(sema.arena, pointee_type), | |
| 6788 | .val = elem_ptr, | |
| 6789 | }); | |
| 6856 | return sema.addConstant( | |
| 6857 | try Type.Tag.single_const_pointer.create(sema.arena, pointee_type), | |
| 6858 | elem_ptr, | |
| 6859 | ); | |
| 6790 | 6860 | } |
| 6791 | 6861 | } |
| 6792 | 6862 | _ = elem_index; |
| ... | ... | @@ -6798,39 +6868,41 @@ fn coerce( |
| 6798 | 6868 | sema: *Sema, |
| 6799 | 6869 | block: *Scope.Block, |
| 6800 | 6870 | dest_type: Type, |
| 6801 | inst: *Inst, | |
| 6871 | inst: Air.Inst.Ref, | |
| 6802 | 6872 | inst_src: LazySrcLoc, |
| 6803 | ) InnerError!*Inst { | |
| 6873 | ) CompileError!Air.Inst.Ref { | |
| 6804 | 6874 | if (dest_type.tag() == .var_args_param) { |
| 6805 | return sema.coerceVarArgParam(block, inst); | |
| 6875 | return sema.coerceVarArgParam(block, inst, inst_src); | |
| 6806 | 6876 | } |
| 6877 | ||
| 6878 | const inst_ty = sema.typeOf(inst); | |
| 6807 | 6879 | // If the types are the same, we can return the operand. |
| 6808 | if (dest_type.eql(inst.ty)) | |
| 6880 | if (dest_type.eql(inst_ty)) | |
| 6809 | 6881 | return inst; |
| 6810 | 6882 | |
| 6811 | const in_memory_result = coerceInMemoryAllowed(dest_type, inst.ty); | |
| 6883 | const in_memory_result = coerceInMemoryAllowed(dest_type, inst_ty); | |
| 6812 | 6884 | if (in_memory_result == .ok) { |
| 6813 | return sema.bitcast(block, dest_type, inst); | |
| 6885 | return sema.bitcast(block, dest_type, inst, inst_src); | |
| 6814 | 6886 | } |
| 6815 | 6887 | |
| 6816 | 6888 | const mod = sema.mod; |
| 6817 | 6889 | const arena = sema.arena; |
| 6818 | 6890 | |
| 6819 | 6891 | // undefined to anything |
| 6820 | if (inst.value()) |val| { | |
| 6821 | if (val.isUndef() or inst.ty.zigTypeTag() == .Undefined) { | |
| 6822 | return mod.constInst(arena, inst_src, .{ .ty = dest_type, .val = val }); | |
| 6892 | if (try sema.resolvePossiblyUndefinedValue(block, inst_src, inst)) |val| { | |
| 6893 | if (val.isUndef() or inst_ty.zigTypeTag() == .Undefined) { | |
| 6894 | return sema.addConstant(dest_type, val); | |
| 6823 | 6895 | } |
| 6824 | 6896 | } |
| 6825 | assert(inst.ty.zigTypeTag() != .Undefined); | |
| 6897 | assert(inst_ty.zigTypeTag() != .Undefined); | |
| 6826 | 6898 | |
| 6827 | 6899 | // T to E!T or E to E!T |
| 6828 | 6900 | if (dest_type.tag() == .error_union) { |
| 6829 | return try sema.wrapErrorUnion(block, dest_type, inst); | |
| 6901 | return try sema.wrapErrorUnion(block, dest_type, inst, inst_src); | |
| 6830 | 6902 | } |
| 6831 | 6903 | |
| 6832 | 6904 | // comptime known number to other number |
| 6833 | if (try sema.coerceNum(block, dest_type, inst)) |some| | |
| 6905 | if (try sema.coerceNum(block, dest_type, inst, inst_src)) |some| | |
| 6834 | 6906 | return some; |
| 6835 | 6907 | |
| 6836 | 6908 | const target = mod.getTarget(); |
| ... | ... | @@ -6838,28 +6910,28 @@ fn coerce( |
| 6838 | 6910 | switch (dest_type.zigTypeTag()) { |
| 6839 | 6911 | .Optional => { |
| 6840 | 6912 | // null to ?T |
| 6841 | if (inst.ty.zigTypeTag() == .Null) { | |
| 6842 | return mod.constInst(arena, inst_src, .{ .ty = dest_type, .val = Value.initTag(.null_value) }); | |
| 6913 | if (inst_ty.zigTypeTag() == .Null) { | |
| 6914 | return sema.addConstant(dest_type, Value.initTag(.null_value)); | |
| 6843 | 6915 | } |
| 6844 | 6916 | |
| 6845 | 6917 | // T to ?T |
| 6846 | 6918 | var buf: Type.Payload.ElemType = undefined; |
| 6847 | 6919 | const child_type = dest_type.optionalChild(&buf); |
| 6848 | if (child_type.eql(inst.ty)) { | |
| 6849 | return sema.wrapOptional(block, dest_type, inst); | |
| 6850 | } else if (try sema.coerceNum(block, child_type, inst)) |some| { | |
| 6851 | return sema.wrapOptional(block, dest_type, some); | |
| 6920 | if (child_type.eql(inst_ty)) { | |
| 6921 | return sema.wrapOptional(block, dest_type, inst, inst_src); | |
| 6922 | } else if (try sema.coerceNum(block, child_type, inst, inst_src)) |some| { | |
| 6923 | return sema.wrapOptional(block, dest_type, some, inst_src); | |
| 6852 | 6924 | } |
| 6853 | 6925 | }, |
| 6854 | 6926 | .Pointer => { |
| 6855 | 6927 | // Coercions where the source is a single pointer to an array. |
| 6856 | 6928 | src_array_ptr: { |
| 6857 | if (!inst.ty.isSinglePointer()) break :src_array_ptr; | |
| 6858 | const array_type = inst.ty.elemType(); | |
| 6929 | if (!inst_ty.isSinglePointer()) break :src_array_ptr; | |
| 6930 | const array_type = inst_ty.elemType(); | |
| 6859 | 6931 | if (array_type.zigTypeTag() != .Array) break :src_array_ptr; |
| 6860 | 6932 | const array_elem_type = array_type.elemType(); |
| 6861 | if (inst.ty.isConstPtr() and !dest_type.isConstPtr()) break :src_array_ptr; | |
| 6862 | if (inst.ty.isVolatilePtr() and !dest_type.isVolatilePtr()) break :src_array_ptr; | |
| 6933 | if (inst_ty.isConstPtr() and !dest_type.isConstPtr()) break :src_array_ptr; | |
| 6934 | if (inst_ty.isVolatilePtr() and !dest_type.isVolatilePtr()) break :src_array_ptr; | |
| 6863 | 6935 | |
| 6864 | 6936 | const dst_elem_type = dest_type.elemType(); |
| 6865 | 6937 | switch (coerceInMemoryAllowed(dst_elem_type, array_elem_type)) { |
| ... | ... | @@ -6870,11 +6942,11 @@ fn coerce( |
| 6870 | 6942 | switch (dest_type.ptrSize()) { |
| 6871 | 6943 | .Slice => { |
| 6872 | 6944 | // *[N]T to []T |
| 6873 | return sema.coerceArrayPtrToSlice(block, dest_type, inst); | |
| 6945 | return sema.coerceArrayPtrToSlice(block, dest_type, inst, inst_src); | |
| 6874 | 6946 | }, |
| 6875 | 6947 | .C => { |
| 6876 | 6948 | // *[N]T to [*c]T |
| 6877 | return sema.coerceArrayPtrToMany(block, dest_type, inst); | |
| 6949 | return sema.coerceArrayPtrToMany(block, dest_type, inst, inst_src); | |
| 6878 | 6950 | }, |
| 6879 | 6951 | .Many => { |
| 6880 | 6952 | // *[N]T to [*]T |
| ... | ... | @@ -6882,12 +6954,12 @@ fn coerce( |
| 6882 | 6954 | const src_sentinel = array_type.sentinel(); |
| 6883 | 6955 | const dst_sentinel = dest_type.sentinel(); |
| 6884 | 6956 | if (src_sentinel == null and dst_sentinel == null) |
| 6885 | return sema.coerceArrayPtrToMany(block, dest_type, inst); | |
| 6957 | return sema.coerceArrayPtrToMany(block, dest_type, inst, inst_src); | |
| 6886 | 6958 | |
| 6887 | 6959 | if (src_sentinel) |src_s| { |
| 6888 | 6960 | if (dst_sentinel) |dst_s| { |
| 6889 | 6961 | if (src_s.eql(dst_s)) { |
| 6890 | return sema.coerceArrayPtrToMany(block, dest_type, inst); | |
| 6962 | return sema.coerceArrayPtrToMany(block, dest_type, inst, inst_src); | |
| 6891 | 6963 | } |
| 6892 | 6964 | } |
| 6893 | 6965 | } |
| ... | ... | @@ -6898,36 +6970,36 @@ fn coerce( |
| 6898 | 6970 | }, |
| 6899 | 6971 | .Int => { |
| 6900 | 6972 | // integer widening |
| 6901 | if (inst.ty.zigTypeTag() == .Int) { | |
| 6902 | assert(inst.value() == null); // handled above | |
| 6973 | if (inst_ty.zigTypeTag() == .Int) { | |
| 6974 | assert(!(try sema.isComptimeKnown(block, inst_src, inst))); // handled above | |
| 6903 | 6975 | |
| 6904 | 6976 | const dst_info = dest_type.intInfo(target); |
| 6905 | const src_info = inst.ty.intInfo(target); | |
| 6977 | const src_info = inst_ty.intInfo(target); | |
| 6906 | 6978 | if ((src_info.signedness == dst_info.signedness and dst_info.bits >= src_info.bits) or |
| 6907 | 6979 | // small enough unsigned ints can get casted to large enough signed ints |
| 6908 | 6980 | (src_info.signedness == .signed and dst_info.signedness == .unsigned and dst_info.bits > src_info.bits)) |
| 6909 | 6981 | { |
| 6910 | 6982 | try sema.requireRuntimeBlock(block, inst_src); |
| 6911 | return block.addUnOp(inst_src, dest_type, .intcast, inst); | |
| 6983 | return block.addTyOp(.intcast, dest_type, inst); | |
| 6912 | 6984 | } |
| 6913 | 6985 | } |
| 6914 | 6986 | }, |
| 6915 | 6987 | .Float => { |
| 6916 | 6988 | // float widening |
| 6917 | if (inst.ty.zigTypeTag() == .Float) { | |
| 6918 | assert(inst.value() == null); // handled above | |
| 6989 | if (inst_ty.zigTypeTag() == .Float) { | |
| 6990 | assert(!(try sema.isComptimeKnown(block, inst_src, inst))); // handled above | |
| 6919 | 6991 | |
| 6920 | const src_bits = inst.ty.floatBits(target); | |
| 6992 | const src_bits = inst_ty.floatBits(target); | |
| 6921 | 6993 | const dst_bits = dest_type.floatBits(target); |
| 6922 | 6994 | if (dst_bits >= src_bits) { |
| 6923 | 6995 | try sema.requireRuntimeBlock(block, inst_src); |
| 6924 | return block.addUnOp(inst_src, dest_type, .floatcast, inst); | |
| 6996 | return block.addTyOp(.floatcast, dest_type, inst); | |
| 6925 | 6997 | } |
| 6926 | 6998 | } |
| 6927 | 6999 | }, |
| 6928 | 7000 | .Enum => { |
| 6929 | 7001 | // enum literal to enum |
| 6930 | if (inst.ty.zigTypeTag() == .EnumLiteral) { | |
| 7002 | if (inst_ty.zigTypeTag() == .EnumLiteral) { | |
| 6931 | 7003 | const val = try sema.resolveConstValue(block, inst_src, inst); |
| 6932 | 7004 | const bytes = val.castTag(.enum_literal).?.data; |
| 6933 | 7005 | const resolved_dest_type = try sema.resolveTypeFields(block, inst_src, dest_type); |
| ... | ... | @@ -6950,16 +7022,16 @@ fn coerce( |
| 6950 | 7022 | }; |
| 6951 | 7023 | return mod.failWithOwnedErrorMsg(&block.base, msg); |
| 6952 | 7024 | }; |
| 6953 | return mod.constInst(arena, inst_src, .{ | |
| 6954 | .ty = resolved_dest_type, | |
| 6955 | .val = try Value.Tag.enum_field_index.create(arena, @intCast(u32, field_index)), | |
| 6956 | }); | |
| 7025 | return sema.addConstant( | |
| 7026 | resolved_dest_type, | |
| 7027 | try Value.Tag.enum_field_index.create(arena, @intCast(u32, field_index)), | |
| 7028 | ); | |
| 6957 | 7029 | } |
| 6958 | 7030 | }, |
| 6959 | 7031 | else => {}, |
| 6960 | 7032 | } |
| 6961 | 7033 | |
| 6962 | return mod.fail(&block.base, inst_src, "expected {}, found {}", .{ dest_type, inst.ty }); | |
| 7034 | return mod.fail(&block.base, inst_src, "expected {}, found {}", .{ dest_type, inst_ty }); | |
| 6963 | 7035 | } |
| 6964 | 7036 | |
| 6965 | 7037 | const InMemoryCoercionResult = enum { |
| ... | ... | @@ -6976,9 +7048,16 @@ fn coerceInMemoryAllowed(dest_type: Type, src_type: Type) InMemoryCoercionResult |
| 6976 | 7048 | return .no_match; |
| 6977 | 7049 | } |
| 6978 | 7050 | |
| 6979 | fn coerceNum(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) InnerError!?*Inst { | |
| 6980 | const val = inst.value() orelse return null; | |
| 6981 | const src_zig_tag = inst.ty.zigTypeTag(); | |
| 7051 | fn coerceNum( | |
| 7052 | sema: *Sema, | |
| 7053 | block: *Scope.Block, | |
| 7054 | dest_type: Type, | |
| 7055 | inst: Air.Inst.Ref, | |
| 7056 | inst_src: LazySrcLoc, | |
| 7057 | ) CompileError!?Air.Inst.Ref { | |
| 7058 | const val = (try sema.resolveDefinedValue(block, inst_src, inst)) orelse return null; | |
| 7059 | const inst_ty = sema.typeOf(inst); | |
| 7060 | const src_zig_tag = inst_ty.zigTypeTag(); | |
| 6982 | 7061 | const dst_zig_tag = dest_type.zigTypeTag(); |
| 6983 | 7062 | |
| 6984 | 7063 | const target = sema.mod.getTarget(); |
| ... | ... | @@ -6986,37 +7065,43 @@ fn coerceNum(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) Inn |
| 6986 | 7065 | if (dst_zig_tag == .ComptimeInt or dst_zig_tag == .Int) { |
| 6987 | 7066 | if (src_zig_tag == .Float or src_zig_tag == .ComptimeFloat) { |
| 6988 | 7067 | if (val.floatHasFraction()) { |
| 6989 | return sema.mod.fail(&block.base, inst.src, "fractional component prevents float value {} from being casted to type '{}'", .{ val, inst.ty }); | |
| 7068 | return sema.mod.fail(&block.base, inst_src, "fractional component prevents float value {} from being casted to type '{}'", .{ val, inst_ty }); | |
| 6990 | 7069 | } |
| 6991 | return sema.mod.fail(&block.base, inst.src, "TODO float to int", .{}); | |
| 7070 | return sema.mod.fail(&block.base, inst_src, "TODO float to int", .{}); | |
| 6992 | 7071 | } else if (src_zig_tag == .Int or src_zig_tag == .ComptimeInt) { |
| 6993 | 7072 | if (!val.intFitsInType(dest_type, target)) { |
| 6994 | return sema.mod.fail(&block.base, inst.src, "type {} cannot represent integer value {}", .{ inst.ty, val }); | |
| 7073 | return sema.mod.fail(&block.base, inst_src, "type {} cannot represent integer value {}", .{ inst_ty, val }); | |
| 6995 | 7074 | } |
| 6996 | return sema.mod.constInst(sema.arena, inst.src, .{ .ty = dest_type, .val = val }); | |
| 7075 | return try sema.addConstant(dest_type, val); | |
| 6997 | 7076 | } |
| 6998 | 7077 | } else if (dst_zig_tag == .ComptimeFloat or dst_zig_tag == .Float) { |
| 6999 | 7078 | if (src_zig_tag == .Float or src_zig_tag == .ComptimeFloat) { |
| 7000 | 7079 | const res = val.floatCast(sema.arena, dest_type, target) catch |err| switch (err) { |
| 7001 | 7080 | error.Overflow => return sema.mod.fail( |
| 7002 | 7081 | &block.base, |
| 7003 | inst.src, | |
| 7082 | inst_src, | |
| 7004 | 7083 | "cast of value {} to type '{}' loses information", |
| 7005 | 7084 | .{ val, dest_type }, |
| 7006 | 7085 | ), |
| 7007 | 7086 | error.OutOfMemory => return error.OutOfMemory, |
| 7008 | 7087 | }; |
| 7009 | return sema.mod.constInst(sema.arena, inst.src, .{ .ty = dest_type, .val = res }); | |
| 7088 | return try sema.addConstant(dest_type, res); | |
| 7010 | 7089 | } else if (src_zig_tag == .Int or src_zig_tag == .ComptimeInt) { |
| 7011 | return sema.mod.fail(&block.base, inst.src, "TODO int to float", .{}); | |
| 7090 | return sema.mod.fail(&block.base, inst_src, "TODO int to float", .{}); | |
| 7012 | 7091 | } |
| 7013 | 7092 | } |
| 7014 | 7093 | return null; |
| 7015 | 7094 | } |
| 7016 | 7095 | |
| 7017 | fn coerceVarArgParam(sema: *Sema, block: *Scope.Block, inst: *Inst) !*Inst { | |
| 7018 | switch (inst.ty.zigTypeTag()) { | |
| 7019 | .ComptimeInt, .ComptimeFloat => return sema.mod.fail(&block.base, inst.src, "integer and float literals in var args function must be casted", .{}), | |
| 7096 | fn coerceVarArgParam( | |
| 7097 | sema: *Sema, | |
| 7098 | block: *Scope.Block, | |
| 7099 | inst: Air.Inst.Ref, | |
| 7100 | inst_src: LazySrcLoc, | |
| 7101 | ) !Air.Inst.Ref { | |
| 7102 | const inst_ty = sema.typeOf(inst); | |
| 7103 | switch (inst_ty.zigTypeTag()) { | |
| 7104 | .ComptimeInt, .ComptimeFloat => return sema.mod.fail(&block.base, inst_src, "integer and float literals in var args function must be casted", .{}), | |
| 7020 | 7105 | else => {}, |
| 7021 | 7106 | } |
| 7022 | 7107 | // TODO implement more of this function. |
| ... | ... | @@ -7027,13 +7112,14 @@ fn storePtr( |
| 7027 | 7112 | sema: *Sema, |
| 7028 | 7113 | block: *Scope.Block, |
| 7029 | 7114 | src: LazySrcLoc, |
| 7030 | ptr: *Inst, | |
| 7031 | uncasted_value: *Inst, | |
| 7115 | ptr: Air.Inst.Ref, | |
| 7116 | uncasted_value: Air.Inst.Ref, | |
| 7032 | 7117 | ) !void { |
| 7033 | if (ptr.ty.isConstPtr()) | |
| 7118 | const ptr_ty = sema.typeOf(ptr); | |
| 7119 | if (ptr_ty.isConstPtr()) | |
| 7034 | 7120 | return sema.mod.fail(&block.base, src, "cannot assign to constant", .{}); |
| 7035 | 7121 | |
| 7036 | const elem_ty = ptr.ty.elemType(); | |
| 7122 | const elem_ty = ptr_ty.elemType(); | |
| 7037 | 7123 | const value = try sema.coerce(block, elem_ty, uncasted_value, src); |
| 7038 | 7124 | if ((try sema.typeHasOnePossibleValue(block, src, elem_ty)) != null) |
| 7039 | 7125 | return; |
| ... | ... | @@ -7073,41 +7159,73 @@ fn storePtr( |
| 7073 | 7159 | // TODO handle if the element type requires comptime |
| 7074 | 7160 | |
| 7075 | 7161 | try sema.requireRuntimeBlock(block, src); |
| 7076 | _ = try block.addBinOp(src, Type.initTag(.void), .store, ptr, value); | |
| 7162 | _ = try block.addBinOp(.store, ptr, value); | |
| 7077 | 7163 | } |
| 7078 | 7164 | |
| 7079 | fn bitcast(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) !*Inst { | |
| 7080 | if (inst.value()) |val| { | |
| 7165 | fn bitcast( | |
| 7166 | sema: *Sema, | |
| 7167 | block: *Scope.Block, | |
| 7168 | dest_type: Type, | |
| 7169 | inst: Air.Inst.Ref, | |
| 7170 | inst_src: LazySrcLoc, | |
| 7171 | ) CompileError!Air.Inst.Ref { | |
| 7172 | if (try sema.resolvePossiblyUndefinedValue(block, inst_src, inst)) |val| { | |
| 7081 | 7173 | // Keep the comptime Value representation; take the new type. |
| 7082 | return sema.mod.constInst(sema.arena, inst.src, .{ .ty = dest_type, .val = val }); | |
| 7174 | return sema.addConstant(dest_type, val); | |
| 7083 | 7175 | } |
| 7084 | 7176 | // TODO validate the type size and other compile errors |
| 7085 | try sema.requireRuntimeBlock(block, inst.src); | |
| 7086 | return block.addUnOp(inst.src, dest_type, .bitcast, inst); | |
| 7177 | try sema.requireRuntimeBlock(block, inst_src); | |
| 7178 | return block.addTyOp(.bitcast, dest_type, inst); | |
| 7087 | 7179 | } |
| 7088 | 7180 | |
| 7089 | fn coerceArrayPtrToSlice(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) !*Inst { | |
| 7090 | if (inst.value()) |val| { | |
| 7181 | fn coerceArrayPtrToSlice( | |
| 7182 | sema: *Sema, | |
| 7183 | block: *Scope.Block, | |
| 7184 | dest_type: Type, | |
| 7185 | inst: Air.Inst.Ref, | |
| 7186 | inst_src: LazySrcLoc, | |
| 7187 | ) CompileError!Air.Inst.Ref { | |
| 7188 | if (try sema.resolveDefinedValue(block, inst_src, inst)) |val| { | |
| 7091 | 7189 | // The comptime Value representation is compatible with both types. |
| 7092 | return sema.mod.constInst(sema.arena, inst.src, .{ .ty = dest_type, .val = val }); | |
| 7190 | return sema.addConstant(dest_type, val); | |
| 7093 | 7191 | } |
| 7094 | return sema.mod.fail(&block.base, inst.src, "TODO implement coerceArrayPtrToSlice runtime instruction", .{}); | |
| 7192 | return sema.mod.fail(&block.base, inst_src, "TODO implement coerceArrayPtrToSlice runtime instruction", .{}); | |
| 7095 | 7193 | } |
| 7096 | 7194 | |
| 7097 | fn coerceArrayPtrToMany(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) !*Inst { | |
| 7098 | if (inst.value()) |val| { | |
| 7195 | fn coerceArrayPtrToMany( | |
| 7196 | sema: *Sema, | |
| 7197 | block: *Scope.Block, | |
| 7198 | dest_type: Type, | |
| 7199 | inst: Air.Inst.Ref, | |
| 7200 | inst_src: LazySrcLoc, | |
| 7201 | ) !Air.Inst.Ref { | |
| 7202 | if (try sema.resolveDefinedValue(block, inst_src, inst)) |val| { | |
| 7099 | 7203 | // The comptime Value representation is compatible with both types. |
| 7100 | return sema.mod.constInst(sema.arena, inst.src, .{ .ty = dest_type, .val = val }); | |
| 7204 | return sema.addConstant(dest_type, val); | |
| 7101 | 7205 | } |
| 7102 | return sema.mod.fail(&block.base, inst.src, "TODO implement coerceArrayPtrToMany runtime instruction", .{}); | |
| 7206 | return sema.mod.fail(&block.base, inst_src, "TODO implement coerceArrayPtrToMany runtime instruction", .{}); | |
| 7103 | 7207 | } |
| 7104 | 7208 | |
| 7105 | fn analyzeDeclVal(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, decl: *Decl) InnerError!*Inst { | |
| 7209 | fn analyzeDeclVal( | |
| 7210 | sema: *Sema, | |
| 7211 | block: *Scope.Block, | |
| 7212 | src: LazySrcLoc, | |
| 7213 | decl: *Decl, | |
| 7214 | ) CompileError!Air.Inst.Ref { | |
| 7215 | if (sema.decl_val_table.get(decl)) |result| { | |
| 7216 | return result; | |
| 7217 | } | |
| 7106 | 7218 | const decl_ref = try sema.analyzeDeclRef(block, src, decl); |
| 7107 | return sema.analyzeLoad(block, src, decl_ref, src); | |
| 7219 | const result = try sema.analyzeLoad(block, src, decl_ref, src); | |
| 7220 | if (Air.refToIndex(result)) |index| { | |
| 7221 | if (sema.air_instructions.items(.tag)[index] == .constant) { | |
| 7222 | sema.decl_val_table.put(sema.gpa, decl, result) catch {}; | |
| 7223 | } | |
| 7224 | } | |
| 7225 | return result; | |
| 7108 | 7226 | } |
| 7109 | 7227 | |
| 7110 | fn analyzeDeclRef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, decl: *Decl) InnerError!*Inst { | |
| 7228 | fn analyzeDeclRef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, decl: *Decl) CompileError!Air.Inst.Ref { | |
| 7111 | 7229 | try sema.mod.declareDeclDependency(sema.owner_decl, decl); |
| 7112 | 7230 | sema.mod.ensureDeclAnalyzed(decl) catch |err| { |
| 7113 | 7231 | if (sema.func) |func| { |
| ... | ... | @@ -7122,136 +7240,140 @@ fn analyzeDeclRef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, decl: *Decl |
| 7122 | 7240 | if (decl_tv.val.tag() == .variable) { |
| 7123 | 7241 | return sema.analyzeVarRef(block, src, decl_tv); |
| 7124 | 7242 | } |
| 7125 | return sema.mod.constInst(sema.arena, src, .{ | |
| 7126 | .ty = try sema.mod.simplePtrType(sema.arena, decl_tv.ty, false, .One), | |
| 7127 | .val = try Value.Tag.decl_ref.create(sema.arena, decl), | |
| 7128 | }); | |
| 7243 | return sema.addConstant( | |
| 7244 | try Module.simplePtrType(sema.arena, decl_tv.ty, false, .One), | |
| 7245 | try Value.Tag.decl_ref.create(sema.arena, decl), | |
| 7246 | ); | |
| 7129 | 7247 | } |
| 7130 | 7248 | |
| 7131 | fn analyzeVarRef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, tv: TypedValue) InnerError!*Inst { | |
| 7249 | fn analyzeVarRef(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, tv: TypedValue) CompileError!Air.Inst.Ref { | |
| 7132 | 7250 | const variable = tv.val.castTag(.variable).?.data; |
| 7133 | 7251 | |
| 7134 | const ty = try sema.mod.simplePtrType(sema.arena, tv.ty, variable.is_mutable, .One); | |
| 7252 | const ty = try Module.simplePtrType(sema.arena, tv.ty, variable.is_mutable, .One); | |
| 7135 | 7253 | if (!variable.is_mutable and !variable.is_extern) { |
| 7136 | return sema.mod.constInst(sema.arena, src, .{ | |
| 7137 | .ty = ty, | |
| 7138 | .val = try Value.Tag.ref_val.create(sema.arena, variable.init), | |
| 7139 | }); | |
| 7254 | return sema.addConstant(ty, try Value.Tag.ref_val.create(sema.arena, variable.init)); | |
| 7140 | 7255 | } |
| 7141 | 7256 | |
| 7257 | const gpa = sema.gpa; | |
| 7142 | 7258 | try sema.requireRuntimeBlock(block, src); |
| 7143 | const inst = try sema.arena.create(Inst.VarPtr); | |
| 7144 | inst.* = .{ | |
| 7145 | .base = .{ | |
| 7146 | .tag = .varptr, | |
| 7147 | .ty = ty, | |
| 7148 | .src = src, | |
| 7149 | }, | |
| 7150 | .variable = variable, | |
| 7151 | }; | |
| 7152 | try block.instructions.append(sema.gpa, &inst.base); | |
| 7153 | return &inst.base; | |
| 7259 | try sema.air_variables.append(gpa, variable); | |
| 7260 | const result_inst = @intCast(Air.Inst.Index, sema.air_instructions.len); | |
| 7261 | try sema.air_instructions.append(gpa, .{ | |
| 7262 | .tag = .varptr, | |
| 7263 | .data = .{ .ty_pl = .{ | |
| 7264 | .ty = try sema.addType(ty), | |
| 7265 | .payload = @intCast(u32, sema.air_variables.items.len - 1), | |
| 7266 | } }, | |
| 7267 | }); | |
| 7268 | try block.instructions.append(gpa, result_inst); | |
| 7269 | return Air.indexToRef(result_inst); | |
| 7154 | 7270 | } |
| 7155 | 7271 | |
| 7156 | 7272 | fn analyzeRef( |
| 7157 | 7273 | sema: *Sema, |
| 7158 | 7274 | block: *Scope.Block, |
| 7159 | 7275 | src: LazySrcLoc, |
| 7160 | operand: *Inst, | |
| 7161 | ) InnerError!*Inst { | |
| 7162 | const ptr_type = try sema.mod.simplePtrType(sema.arena, operand.ty, false, .One); | |
| 7276 | operand: Air.Inst.Ref, | |
| 7277 | ) CompileError!Air.Inst.Ref { | |
| 7278 | const operand_ty = sema.typeOf(operand); | |
| 7279 | const ptr_type = try Module.simplePtrType(sema.arena, operand_ty, false, .One); | |
| 7163 | 7280 | |
| 7164 | 7281 | if (try sema.resolvePossiblyUndefinedValue(block, src, operand)) |val| { |
| 7165 | return sema.mod.constInst(sema.arena, src, .{ | |
| 7166 | .ty = ptr_type, | |
| 7167 | .val = try Value.Tag.ref_val.create(sema.arena, val), | |
| 7168 | }); | |
| 7282 | return sema.addConstant(ptr_type, try Value.Tag.ref_val.create(sema.arena, val)); | |
| 7169 | 7283 | } |
| 7170 | 7284 | |
| 7171 | 7285 | try sema.requireRuntimeBlock(block, src); |
| 7172 | return block.addUnOp(src, ptr_type, .ref, operand); | |
| 7286 | return block.addTyOp(.ref, ptr_type, operand); | |
| 7173 | 7287 | } |
| 7174 | 7288 | |
| 7175 | 7289 | fn analyzeLoad( |
| 7176 | 7290 | sema: *Sema, |
| 7177 | 7291 | block: *Scope.Block, |
| 7178 | 7292 | src: LazySrcLoc, |
| 7179 | ptr: *Inst, | |
| 7293 | ptr: Air.Inst.Ref, | |
| 7180 | 7294 | ptr_src: LazySrcLoc, |
| 7181 | ) InnerError!*Inst { | |
| 7182 | const elem_ty = switch (ptr.ty.zigTypeTag()) { | |
| 7183 | .Pointer => ptr.ty.elemType(), | |
| 7184 | else => return sema.mod.fail(&block.base, ptr_src, "expected pointer, found '{}'", .{ptr.ty}), | |
| 7295 | ) CompileError!Air.Inst.Ref { | |
| 7296 | const ptr_ty = sema.typeOf(ptr); | |
| 7297 | const elem_ty = switch (ptr_ty.zigTypeTag()) { | |
| 7298 | .Pointer => ptr_ty.elemType(), | |
| 7299 | else => return sema.mod.fail(&block.base, ptr_src, "expected pointer, found '{}'", .{ptr_ty}), | |
| 7185 | 7300 | }; |
| 7186 | 7301 | if (try sema.resolveDefinedValue(block, ptr_src, ptr)) |ptr_val| blk: { |
| 7187 | 7302 | if (ptr_val.tag() == .int_u64) |
| 7188 | 7303 | break :blk; // do it at runtime |
| 7189 | 7304 | |
| 7190 | return sema.mod.constInst(sema.arena, src, .{ | |
| 7191 | .ty = elem_ty, | |
| 7192 | .val = try ptr_val.pointerDeref(sema.arena), | |
| 7193 | }); | |
| 7305 | return sema.addConstant(elem_ty, try ptr_val.pointerDeref(sema.arena)); | |
| 7194 | 7306 | } |
| 7195 | 7307 | |
| 7196 | 7308 | try sema.requireRuntimeBlock(block, src); |
| 7197 | return block.addUnOp(src, elem_ty, .load, ptr); | |
| 7309 | return block.addTyOp(.load, elem_ty, ptr); | |
| 7198 | 7310 | } |
| 7199 | 7311 | |
| 7200 | 7312 | fn analyzeIsNull( |
| 7201 | 7313 | sema: *Sema, |
| 7202 | 7314 | block: *Scope.Block, |
| 7203 | 7315 | src: LazySrcLoc, |
| 7204 | operand: *Inst, | |
| 7316 | operand: Air.Inst.Ref, | |
| 7205 | 7317 | invert_logic: bool, |
| 7206 | ) InnerError!*Inst { | |
| 7318 | ) CompileError!Air.Inst.Ref { | |
| 7207 | 7319 | const result_ty = Type.initTag(.bool); |
| 7208 | 7320 | if (try sema.resolvePossiblyUndefinedValue(block, src, operand)) |opt_val| { |
| 7209 | 7321 | if (opt_val.isUndef()) { |
| 7210 | return sema.mod.constUndef(sema.arena, src, result_ty); | |
| 7322 | return sema.addConstUndef(result_ty); | |
| 7211 | 7323 | } |
| 7212 | 7324 | const is_null = opt_val.isNull(); |
| 7213 | 7325 | const bool_value = if (invert_logic) !is_null else is_null; |
| 7214 | return sema.mod.constBool(sema.arena, src, bool_value); | |
| 7326 | if (bool_value) { | |
| 7327 | return Air.Inst.Ref.bool_true; | |
| 7328 | } else { | |
| 7329 | return Air.Inst.Ref.bool_false; | |
| 7330 | } | |
| 7215 | 7331 | } |
| 7216 | 7332 | try sema.requireRuntimeBlock(block, src); |
| 7217 | const inst_tag: Inst.Tag = if (invert_logic) .is_non_null else .is_null; | |
| 7218 | return block.addUnOp(src, result_ty, inst_tag, operand); | |
| 7333 | const air_tag: Air.Inst.Tag = if (invert_logic) .is_non_null else .is_null; | |
| 7334 | return block.addUnOp(air_tag, operand); | |
| 7219 | 7335 | } |
| 7220 | 7336 | |
| 7221 | 7337 | fn analyzeIsNonErr( |
| 7222 | 7338 | sema: *Sema, |
| 7223 | 7339 | block: *Scope.Block, |
| 7224 | 7340 | src: LazySrcLoc, |
| 7225 | operand: *Inst, | |
| 7226 | ) InnerError!*Inst { | |
| 7227 | const ot = operand.ty.zigTypeTag(); | |
| 7228 | if (ot != .ErrorSet and ot != .ErrorUnion) return sema.mod.constBool(sema.arena, src, true); | |
| 7229 | if (ot == .ErrorSet) return sema.mod.constBool(sema.arena, src, false); | |
| 7341 | operand: Air.Inst.Ref, | |
| 7342 | ) CompileError!Air.Inst.Ref { | |
| 7343 | const operand_ty = sema.typeOf(operand); | |
| 7344 | const ot = operand_ty.zigTypeTag(); | |
| 7345 | if (ot != .ErrorSet and ot != .ErrorUnion) return Air.Inst.Ref.bool_true; | |
| 7346 | if (ot == .ErrorSet) return Air.Inst.Ref.bool_false; | |
| 7230 | 7347 | assert(ot == .ErrorUnion); |
| 7231 | 7348 | const result_ty = Type.initTag(.bool); |
| 7232 | 7349 | if (try sema.resolvePossiblyUndefinedValue(block, src, operand)) |err_union| { |
| 7233 | 7350 | if (err_union.isUndef()) { |
| 7234 | return sema.mod.constUndef(sema.arena, src, result_ty); | |
| 7351 | return sema.addConstUndef(result_ty); | |
| 7352 | } | |
| 7353 | if (err_union.getError() == null) { | |
| 7354 | return Air.Inst.Ref.bool_true; | |
| 7355 | } else { | |
| 7356 | return Air.Inst.Ref.bool_false; | |
| 7235 | 7357 | } |
| 7236 | return sema.mod.constBool(sema.arena, src, err_union.getError() == null); | |
| 7237 | 7358 | } |
| 7238 | 7359 | try sema.requireRuntimeBlock(block, src); |
| 7239 | return block.addUnOp(src, result_ty, .is_non_err, operand); | |
| 7360 | return block.addUnOp(.is_non_err, operand); | |
| 7240 | 7361 | } |
| 7241 | 7362 | |
| 7242 | 7363 | fn analyzeSlice( |
| 7243 | 7364 | sema: *Sema, |
| 7244 | 7365 | block: *Scope.Block, |
| 7245 | 7366 | src: LazySrcLoc, |
| 7246 | array_ptr: *Inst, | |
| 7247 | start: *Inst, | |
| 7248 | end_opt: ?*Inst, | |
| 7249 | sentinel_opt: ?*Inst, | |
| 7367 | array_ptr: Air.Inst.Ref, | |
| 7368 | start: Air.Inst.Ref, | |
| 7369 | end_opt: Air.Inst.Ref, | |
| 7370 | sentinel_opt: Air.Inst.Ref, | |
| 7250 | 7371 | sentinel_src: LazySrcLoc, |
| 7251 | ) InnerError!*Inst { | |
| 7252 | const ptr_child = switch (array_ptr.ty.zigTypeTag()) { | |
| 7253 | .Pointer => array_ptr.ty.elemType(), | |
| 7254 | else => return sema.mod.fail(&block.base, src, "expected pointer, found '{}'", .{array_ptr.ty}), | |
| 7372 | ) CompileError!Air.Inst.Ref { | |
| 7373 | const array_ptr_ty = sema.typeOf(array_ptr); | |
| 7374 | const ptr_child = switch (array_ptr_ty.zigTypeTag()) { | |
| 7375 | .Pointer => array_ptr_ty.elemType(), | |
| 7376 | else => return sema.mod.fail(&block.base, src, "expected pointer, found '{}'", .{array_ptr_ty}), | |
| 7255 | 7377 | }; |
| 7256 | 7378 | |
| 7257 | 7379 | var array_type = ptr_child; |
| ... | ... | @@ -7271,16 +7393,16 @@ fn analyzeSlice( |
| 7271 | 7393 | else => return sema.mod.fail(&block.base, src, "slice of non-array type '{}'", .{ptr_child}), |
| 7272 | 7394 | }; |
| 7273 | 7395 | |
| 7274 | const slice_sentinel = if (sentinel_opt) |sentinel| blk: { | |
| 7275 | const casted = try sema.coerce(block, elem_type, sentinel, sentinel.src); | |
| 7396 | const slice_sentinel = if (sentinel_opt != .none) blk: { | |
| 7397 | const casted = try sema.coerce(block, elem_type, sentinel_opt, sentinel_src); | |
| 7276 | 7398 | break :blk try sema.resolveConstValue(block, sentinel_src, casted); |
| 7277 | 7399 | } else null; |
| 7278 | 7400 | |
| 7279 | 7401 | var return_ptr_size: std.builtin.TypeInfo.Pointer.Size = .Slice; |
| 7280 | 7402 | var return_elem_type = elem_type; |
| 7281 | if (end_opt) |end| { | |
| 7282 | if (end.value()) |end_val| { | |
| 7283 | if (start.value()) |start_val| { | |
| 7403 | if (end_opt != .none) { | |
| 7404 | if (try sema.resolveDefinedValue(block, src, end_opt)) |end_val| { | |
| 7405 | if (try sema.resolveDefinedValue(block, src, start)) |start_val| { | |
| 7284 | 7406 | const start_u64 = start_val.toUnsignedInt(); |
| 7285 | 7407 | const end_u64 = end_val.toUnsignedInt(); |
| 7286 | 7408 | if (start_u64 > end_u64) { |
| ... | ... | @@ -7300,7 +7422,7 @@ fn analyzeSlice( |
| 7300 | 7422 | const return_type = try sema.mod.ptrType( |
| 7301 | 7423 | sema.arena, |
| 7302 | 7424 | return_elem_type, |
| 7303 | if (end_opt == null) slice_sentinel else null, | |
| 7425 | if (end_opt == .none) slice_sentinel else null, | |
| 7304 | 7426 | 0, // TODO alignment |
| 7305 | 7427 | 0, |
| 7306 | 7428 | 0, |
| ... | ... | @@ -7319,34 +7441,46 @@ fn cmpNumeric( |
| 7319 | 7441 | sema: *Sema, |
| 7320 | 7442 | block: *Scope.Block, |
| 7321 | 7443 | src: LazySrcLoc, |
| 7322 | lhs: *Inst, | |
| 7323 | rhs: *Inst, | |
| 7444 | lhs: Air.Inst.Ref, | |
| 7445 | rhs: Air.Inst.Ref, | |
| 7324 | 7446 | op: std.math.CompareOperator, |
| 7325 | ) InnerError!*Inst { | |
| 7326 | assert(lhs.ty.isNumeric()); | |
| 7327 | assert(rhs.ty.isNumeric()); | |
| 7447 | lhs_src: LazySrcLoc, | |
| 7448 | rhs_src: LazySrcLoc, | |
| 7449 | ) CompileError!Air.Inst.Ref { | |
| 7450 | const lhs_ty = sema.typeOf(lhs); | |
| 7451 | const rhs_ty = sema.typeOf(rhs); | |
| 7328 | 7452 | |
| 7329 | const lhs_ty_tag = lhs.ty.zigTypeTag(); | |
| 7330 | const rhs_ty_tag = rhs.ty.zigTypeTag(); | |
| 7453 | assert(lhs_ty.isNumeric()); | |
| 7454 | assert(rhs_ty.isNumeric()); | |
| 7455 | ||
| 7456 | const lhs_ty_tag = lhs_ty.zigTypeTag(); | |
| 7457 | const rhs_ty_tag = rhs_ty.zigTypeTag(); | |
| 7331 | 7458 | |
| 7332 | 7459 | if (lhs_ty_tag == .Vector and rhs_ty_tag == .Vector) { |
| 7333 | if (lhs.ty.arrayLen() != rhs.ty.arrayLen()) { | |
| 7460 | if (lhs_ty.arrayLen() != rhs_ty.arrayLen()) { | |
| 7334 | 7461 | return sema.mod.fail(&block.base, src, "vector length mismatch: {d} and {d}", .{ |
| 7335 | lhs.ty.arrayLen(), | |
| 7336 | rhs.ty.arrayLen(), | |
| 7462 | lhs_ty.arrayLen(), | |
| 7463 | rhs_ty.arrayLen(), | |
| 7337 | 7464 | }); |
| 7338 | 7465 | } |
| 7339 | 7466 | return sema.mod.fail(&block.base, src, "TODO implement support for vectors in cmpNumeric", .{}); |
| 7340 | 7467 | } else if (lhs_ty_tag == .Vector or rhs_ty_tag == .Vector) { |
| 7341 | 7468 | return sema.mod.fail(&block.base, src, "mixed scalar and vector operands to comparison operator: '{}' and '{}'", .{ |
| 7342 | lhs.ty, | |
| 7343 | rhs.ty, | |
| 7469 | lhs_ty, | |
| 7470 | rhs_ty, | |
| 7344 | 7471 | }); |
| 7345 | 7472 | } |
| 7346 | 7473 | |
| 7347 | if (lhs.value()) |lhs_val| { | |
| 7348 | if (rhs.value()) |rhs_val| { | |
| 7349 | return sema.mod.constBool(sema.arena, src, Value.compare(lhs_val, op, rhs_val)); | |
| 7474 | if (try sema.resolvePossiblyUndefinedValue(block, lhs_src, lhs)) |lhs_val| { | |
| 7475 | if (try sema.resolvePossiblyUndefinedValue(block, rhs_src, rhs)) |rhs_val| { | |
| 7476 | if (lhs_val.isUndef() or rhs_val.isUndef()) { | |
| 7477 | return sema.addConstUndef(Type.initTag(.bool)); | |
| 7478 | } | |
| 7479 | if (Value.compare(lhs_val, op, rhs_val)) { | |
| 7480 | return Air.Inst.Ref.bool_true; | |
| 7481 | } else { | |
| 7482 | return Air.Inst.Ref.bool_false; | |
| 7483 | } | |
| 7350 | 7484 | } |
| 7351 | 7485 | } |
| 7352 | 7486 | |
| ... | ... | @@ -7372,19 +7506,19 @@ fn cmpNumeric( |
| 7372 | 7506 | // Implicit cast the smaller one to the larger one. |
| 7373 | 7507 | const dest_type = x: { |
| 7374 | 7508 | if (lhs_ty_tag == .ComptimeFloat) { |
| 7375 | break :x rhs.ty; | |
| 7509 | break :x rhs_ty; | |
| 7376 | 7510 | } else if (rhs_ty_tag == .ComptimeFloat) { |
| 7377 | break :x lhs.ty; | |
| 7511 | break :x lhs_ty; | |
| 7378 | 7512 | } |
| 7379 | if (lhs.ty.floatBits(target) >= rhs.ty.floatBits(target)) { | |
| 7380 | break :x lhs.ty; | |
| 7513 | if (lhs_ty.floatBits(target) >= rhs_ty.floatBits(target)) { | |
| 7514 | break :x lhs_ty; | |
| 7381 | 7515 | } else { |
| 7382 | break :x rhs.ty; | |
| 7516 | break :x rhs_ty; | |
| 7383 | 7517 | } |
| 7384 | 7518 | }; |
| 7385 | const casted_lhs = try sema.coerce(block, dest_type, lhs, lhs.src); | |
| 7386 | const casted_rhs = try sema.coerce(block, dest_type, rhs, rhs.src); | |
| 7387 | return block.addBinOp(src, dest_type, Inst.Tag.fromCmpOp(op), casted_lhs, casted_rhs); | |
| 7519 | const casted_lhs = try sema.coerce(block, dest_type, lhs, lhs_src); | |
| 7520 | const casted_rhs = try sema.coerce(block, dest_type, rhs, rhs_src); | |
| 7521 | return block.addBinOp(Air.Inst.Tag.fromCmpOp(op), casted_lhs, casted_rhs); | |
| 7388 | 7522 | } |
| 7389 | 7523 | // For mixed unsigned integer sizes, implicit cast both operands to the larger integer. |
| 7390 | 7524 | // For mixed signed and unsigned integers, implicit cast both operands to a signed |
| ... | ... | @@ -7392,22 +7526,22 @@ fn cmpNumeric( |
| 7392 | 7526 | // For mixed floats and integers, extract the integer part from the float, cast that to |
| 7393 | 7527 | // a signed integer with mantissa bits + 1, and if there was any non-integral part of the float, |
| 7394 | 7528 | // add/subtract 1. |
| 7395 | const lhs_is_signed = if (lhs.value()) |lhs_val| | |
| 7529 | const lhs_is_signed = if (try sema.resolveDefinedValue(block, lhs_src, lhs)) |lhs_val| | |
| 7396 | 7530 | lhs_val.compareWithZero(.lt) |
| 7397 | 7531 | else |
| 7398 | (lhs.ty.isFloat() or lhs.ty.isSignedInt()); | |
| 7399 | const rhs_is_signed = if (rhs.value()) |rhs_val| | |
| 7532 | (lhs_ty.isFloat() or lhs_ty.isSignedInt()); | |
| 7533 | const rhs_is_signed = if (try sema.resolveDefinedValue(block, rhs_src, rhs)) |rhs_val| | |
| 7400 | 7534 | rhs_val.compareWithZero(.lt) |
| 7401 | 7535 | else |
| 7402 | (rhs.ty.isFloat() or rhs.ty.isSignedInt()); | |
| 7536 | (rhs_ty.isFloat() or rhs_ty.isSignedInt()); | |
| 7403 | 7537 | const dest_int_is_signed = lhs_is_signed or rhs_is_signed; |
| 7404 | 7538 | |
| 7405 | 7539 | var dest_float_type: ?Type = null; |
| 7406 | 7540 | |
| 7407 | 7541 | var lhs_bits: usize = undefined; |
| 7408 | if (lhs.value()) |lhs_val| { | |
| 7542 | if (try sema.resolvePossiblyUndefinedValue(block, lhs_src, lhs)) |lhs_val| { | |
| 7409 | 7543 | if (lhs_val.isUndef()) |
| 7410 | return sema.mod.constUndef(sema.arena, src, Type.initTag(.bool)); | |
| 7544 | return sema.addConstUndef(Type.initTag(.bool)); | |
| 7411 | 7545 | const is_unsigned = if (lhs_is_float) x: { |
| 7412 | 7546 | var bigint_space: Value.BigIntSpace = undefined; |
| 7413 | 7547 | var bigint = try lhs_val.toBigInt(&bigint_space).toManaged(sema.gpa); |
| ... | ... | @@ -7415,8 +7549,8 @@ fn cmpNumeric( |
| 7415 | 7549 | const zcmp = lhs_val.orderAgainstZero(); |
| 7416 | 7550 | if (lhs_val.floatHasFraction()) { |
| 7417 | 7551 | switch (op) { |
| 7418 | .eq => return sema.mod.constBool(sema.arena, src, false), | |
| 7419 | .neq => return sema.mod.constBool(sema.arena, src, true), | |
| 7552 | .eq => return Air.Inst.Ref.bool_false, | |
| 7553 | .neq => return Air.Inst.Ref.bool_true, | |
| 7420 | 7554 | else => {}, |
| 7421 | 7555 | } |
| 7422 | 7556 | if (zcmp == .lt) { |
| ... | ... | @@ -7433,16 +7567,16 @@ fn cmpNumeric( |
| 7433 | 7567 | }; |
| 7434 | 7568 | lhs_bits += @boolToInt(is_unsigned and dest_int_is_signed); |
| 7435 | 7569 | } else if (lhs_is_float) { |
| 7436 | dest_float_type = lhs.ty; | |
| 7570 | dest_float_type = lhs_ty; | |
| 7437 | 7571 | } else { |
| 7438 | const int_info = lhs.ty.intInfo(target); | |
| 7572 | const int_info = lhs_ty.intInfo(target); | |
| 7439 | 7573 | lhs_bits = int_info.bits + @boolToInt(int_info.signedness == .unsigned and dest_int_is_signed); |
| 7440 | 7574 | } |
| 7441 | 7575 | |
| 7442 | 7576 | var rhs_bits: usize = undefined; |
| 7443 | if (rhs.value()) |rhs_val| { | |
| 7577 | if (try sema.resolvePossiblyUndefinedValue(block, rhs_src, rhs)) |rhs_val| { | |
| 7444 | 7578 | if (rhs_val.isUndef()) |
| 7445 | return sema.mod.constUndef(sema.arena, src, Type.initTag(.bool)); | |
| 7579 | return sema.addConstUndef(Type.initTag(.bool)); | |
| 7446 | 7580 | const is_unsigned = if (rhs_is_float) x: { |
| 7447 | 7581 | var bigint_space: Value.BigIntSpace = undefined; |
| 7448 | 7582 | var bigint = try rhs_val.toBigInt(&bigint_space).toManaged(sema.gpa); |
| ... | ... | @@ -7450,8 +7584,8 @@ fn cmpNumeric( |
| 7450 | 7584 | const zcmp = rhs_val.orderAgainstZero(); |
| 7451 | 7585 | if (rhs_val.floatHasFraction()) { |
| 7452 | 7586 | switch (op) { |
| 7453 | .eq => return sema.mod.constBool(sema.arena, src, false), | |
| 7454 | .neq => return sema.mod.constBool(sema.arena, src, true), | |
| 7587 | .eq => return Air.Inst.Ref.bool_false, | |
| 7588 | .neq => return Air.Inst.Ref.bool_true, | |
| 7455 | 7589 | else => {}, |
| 7456 | 7590 | } |
| 7457 | 7591 | if (zcmp == .lt) { |
| ... | ... | @@ -7468,9 +7602,9 @@ fn cmpNumeric( |
| 7468 | 7602 | }; |
| 7469 | 7603 | rhs_bits += @boolToInt(is_unsigned and dest_int_is_signed); |
| 7470 | 7604 | } else if (rhs_is_float) { |
| 7471 | dest_float_type = rhs.ty; | |
| 7605 | dest_float_type = rhs_ty; | |
| 7472 | 7606 | } else { |
| 7473 | const int_info = rhs.ty.intInfo(target); | |
| 7607 | const int_info = rhs_ty.intInfo(target); | |
| 7474 | 7608 | rhs_bits = int_info.bits + @boolToInt(int_info.signedness == .unsigned and dest_int_is_signed); |
| 7475 | 7609 | } |
| 7476 | 7610 | |
| ... | ... | @@ -7482,26 +7616,39 @@ fn cmpNumeric( |
| 7482 | 7616 | const signedness: std.builtin.Signedness = if (dest_int_is_signed) .signed else .unsigned; |
| 7483 | 7617 | break :blk try Module.makeIntType(sema.arena, signedness, casted_bits); |
| 7484 | 7618 | }; |
| 7485 | const casted_lhs = try sema.coerce(block, dest_type, lhs, lhs.src); | |
| 7486 | const casted_rhs = try sema.coerce(block, dest_type, rhs, rhs.src); | |
| 7619 | const casted_lhs = try sema.coerce(block, dest_type, lhs, lhs_src); | |
| 7620 | const casted_rhs = try sema.coerce(block, dest_type, rhs, rhs_src); | |
| 7487 | 7621 | |
| 7488 | return block.addBinOp(src, Type.initTag(.bool), Inst.Tag.fromCmpOp(op), casted_lhs, casted_rhs); | |
| 7622 | return block.addBinOp(Air.Inst.Tag.fromCmpOp(op), casted_lhs, casted_rhs); | |
| 7489 | 7623 | } |
| 7490 | 7624 | |
| 7491 | fn wrapOptional(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) !*Inst { | |
| 7492 | if (inst.value()) |val| { | |
| 7493 | return sema.mod.constInst(sema.arena, inst.src, .{ .ty = dest_type, .val = val }); | |
| 7625 | fn wrapOptional( | |
| 7626 | sema: *Sema, | |
| 7627 | block: *Scope.Block, | |
| 7628 | dest_type: Type, | |
| 7629 | inst: Air.Inst.Ref, | |
| 7630 | inst_src: LazySrcLoc, | |
| 7631 | ) !Air.Inst.Ref { | |
| 7632 | if (try sema.resolvePossiblyUndefinedValue(block, inst_src, inst)) |val| { | |
| 7633 | return sema.addConstant(dest_type, val); | |
| 7494 | 7634 | } |
| 7495 | 7635 | |
| 7496 | try sema.requireRuntimeBlock(block, inst.src); | |
| 7497 | return block.addUnOp(inst.src, dest_type, .wrap_optional, inst); | |
| 7636 | try sema.requireRuntimeBlock(block, inst_src); | |
| 7637 | return block.addTyOp(.wrap_optional, dest_type, inst); | |
| 7498 | 7638 | } |
| 7499 | 7639 | |
| 7500 | fn wrapErrorUnion(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst) !*Inst { | |
| 7640 | fn wrapErrorUnion( | |
| 7641 | sema: *Sema, | |
| 7642 | block: *Scope.Block, | |
| 7643 | dest_type: Type, | |
| 7644 | inst: Air.Inst.Ref, | |
| 7645 | inst_src: LazySrcLoc, | |
| 7646 | ) !Air.Inst.Ref { | |
| 7647 | const inst_ty = sema.typeOf(inst); | |
| 7501 | 7648 | const err_union = dest_type.castTag(.error_union).?; |
| 7502 | if (inst.value()) |val| { | |
| 7503 | if (inst.ty.zigTypeTag() != .ErrorSet) { | |
| 7504 | _ = try sema.coerce(block, err_union.data.payload, inst, inst.src); | |
| 7649 | if (try sema.resolvePossiblyUndefinedValue(block, inst_src, inst)) |val| { | |
| 7650 | if (inst_ty.zigTypeTag() != .ErrorSet) { | |
| 7651 | _ = try sema.coerce(block, err_union.data.payload, inst, inst_src); | |
| 7505 | 7652 | } else switch (err_union.data.error_set.tag()) { |
| 7506 | 7653 | .anyerror => {}, |
| 7507 | 7654 | .error_set_single => { |
| ... | ... | @@ -7510,9 +7657,9 @@ fn wrapErrorUnion(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst |
| 7510 | 7657 | if (!mem.eql(u8, expected_name, n)) { |
| 7511 | 7658 | return sema.mod.fail( |
| 7512 | 7659 | &block.base, |
| 7513 | inst.src, | |
| 7660 | inst_src, | |
| 7514 | 7661 | "expected type '{}', found type '{}'", |
| 7515 | .{ err_union.data.error_set, inst.ty }, | |
| 7662 | .{ err_union.data.error_set, inst_ty }, | |
| 7516 | 7663 | ); |
| 7517 | 7664 | } |
| 7518 | 7665 | }, |
| ... | ... | @@ -7528,9 +7675,9 @@ fn wrapErrorUnion(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst |
| 7528 | 7675 | if (!found) { |
| 7529 | 7676 | return sema.mod.fail( |
| 7530 | 7677 | &block.base, |
| 7531 | inst.src, | |
| 7678 | inst_src, | |
| 7532 | 7679 | "expected type '{}', found type '{}'", |
| 7533 | .{ err_union.data.error_set, inst.ty }, | |
| 7680 | .{ err_union.data.error_set, inst_ty }, | |
| 7534 | 7681 | ); |
| 7535 | 7682 | } |
| 7536 | 7683 | }, |
| ... | ... | @@ -7540,109 +7687,113 @@ fn wrapErrorUnion(sema: *Sema, block: *Scope.Block, dest_type: Type, inst: *Inst |
| 7540 | 7687 | if (!map.contains(expected_name)) { |
| 7541 | 7688 | return sema.mod.fail( |
| 7542 | 7689 | &block.base, |
| 7543 | inst.src, | |
| 7690 | inst_src, | |
| 7544 | 7691 | "expected type '{}', found type '{}'", |
| 7545 | .{ err_union.data.error_set, inst.ty }, | |
| 7692 | .{ err_union.data.error_set, inst_ty }, | |
| 7546 | 7693 | ); |
| 7547 | 7694 | } |
| 7548 | 7695 | }, |
| 7549 | 7696 | else => unreachable, |
| 7550 | 7697 | } |
| 7551 | 7698 | |
| 7552 | return sema.mod.constInst(sema.arena, inst.src, .{ | |
| 7553 | .ty = dest_type, | |
| 7554 | // creating a SubValue for the error_union payload | |
| 7555 | .val = try Value.Tag.error_union.create(sema.arena, val), | |
| 7556 | }); | |
| 7699 | // Create a SubValue for the error_union payload. | |
| 7700 | return sema.addConstant(dest_type, try Value.Tag.error_union.create(sema.arena, val)); | |
| 7557 | 7701 | } |
| 7558 | 7702 | |
| 7559 | try sema.requireRuntimeBlock(block, inst.src); | |
| 7703 | try sema.requireRuntimeBlock(block, inst_src); | |
| 7560 | 7704 | |
| 7561 | 7705 | // we are coercing from E to E!T |
| 7562 | if (inst.ty.zigTypeTag() == .ErrorSet) { | |
| 7563 | var coerced = try sema.coerce(block, err_union.data.error_set, inst, inst.src); | |
| 7564 | return block.addUnOp(inst.src, dest_type, .wrap_errunion_err, coerced); | |
| 7706 | if (inst_ty.zigTypeTag() == .ErrorSet) { | |
| 7707 | var coerced = try sema.coerce(block, err_union.data.error_set, inst, inst_src); | |
| 7708 | return block.addTyOp(.wrap_errunion_err, dest_type, coerced); | |
| 7565 | 7709 | } else { |
| 7566 | var coerced = try sema.coerce(block, err_union.data.payload, inst, inst.src); | |
| 7567 | return block.addUnOp(inst.src, dest_type, .wrap_errunion_payload, coerced); | |
| 7710 | var coerced = try sema.coerce(block, err_union.data.payload, inst, inst_src); | |
| 7711 | return block.addTyOp(.wrap_errunion_payload, dest_type, coerced); | |
| 7568 | 7712 | } |
| 7569 | 7713 | } |
| 7570 | 7714 | |
| 7571 | fn resolvePeerTypes(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, instructions: []*Inst) !Type { | |
| 7715 | fn resolvePeerTypes( | |
| 7716 | sema: *Sema, | |
| 7717 | block: *Scope.Block, | |
| 7718 | src: LazySrcLoc, | |
| 7719 | instructions: []Air.Inst.Ref, | |
| 7720 | ) !Type { | |
| 7572 | 7721 | if (instructions.len == 0) |
| 7573 | 7722 | return Type.initTag(.noreturn); |
| 7574 | 7723 | |
| 7575 | 7724 | if (instructions.len == 1) |
| 7576 | return instructions[0].ty; | |
| 7725 | return sema.typeOf(instructions[0]); | |
| 7577 | 7726 | |
| 7578 | 7727 | const target = sema.mod.getTarget(); |
| 7579 | 7728 | |
| 7580 | 7729 | var chosen = instructions[0]; |
| 7581 | 7730 | for (instructions[1..]) |candidate| { |
| 7582 | if (candidate.ty.eql(chosen.ty)) | |
| 7731 | const candidate_ty = sema.typeOf(candidate); | |
| 7732 | const chosen_ty = sema.typeOf(chosen); | |
| 7733 | if (candidate_ty.eql(chosen_ty)) | |
| 7583 | 7734 | continue; |
| 7584 | if (candidate.ty.zigTypeTag() == .NoReturn) | |
| 7735 | if (candidate_ty.zigTypeTag() == .NoReturn) | |
| 7585 | 7736 | continue; |
| 7586 | if (chosen.ty.zigTypeTag() == .NoReturn) { | |
| 7737 | if (chosen_ty.zigTypeTag() == .NoReturn) { | |
| 7587 | 7738 | chosen = candidate; |
| 7588 | 7739 | continue; |
| 7589 | 7740 | } |
| 7590 | if (candidate.ty.zigTypeTag() == .Undefined) | |
| 7741 | if (candidate_ty.zigTypeTag() == .Undefined) | |
| 7591 | 7742 | continue; |
| 7592 | if (chosen.ty.zigTypeTag() == .Undefined) { | |
| 7743 | if (chosen_ty.zigTypeTag() == .Undefined) { | |
| 7593 | 7744 | chosen = candidate; |
| 7594 | 7745 | continue; |
| 7595 | 7746 | } |
| 7596 | if (chosen.ty.isInt() and | |
| 7597 | candidate.ty.isInt() and | |
| 7598 | chosen.ty.isSignedInt() == candidate.ty.isSignedInt()) | |
| 7747 | if (chosen_ty.isInt() and | |
| 7748 | candidate_ty.isInt() and | |
| 7749 | chosen_ty.isSignedInt() == candidate_ty.isSignedInt()) | |
| 7599 | 7750 | { |
| 7600 | if (chosen.ty.intInfo(target).bits < candidate.ty.intInfo(target).bits) { | |
| 7751 | if (chosen_ty.intInfo(target).bits < candidate_ty.intInfo(target).bits) { | |
| 7601 | 7752 | chosen = candidate; |
| 7602 | 7753 | } |
| 7603 | 7754 | continue; |
| 7604 | 7755 | } |
| 7605 | if (chosen.ty.isFloat() and candidate.ty.isFloat()) { | |
| 7606 | if (chosen.ty.floatBits(target) < candidate.ty.floatBits(target)) { | |
| 7756 | if (chosen_ty.isFloat() and candidate_ty.isFloat()) { | |
| 7757 | if (chosen_ty.floatBits(target) < candidate_ty.floatBits(target)) { | |
| 7607 | 7758 | chosen = candidate; |
| 7608 | 7759 | } |
| 7609 | 7760 | continue; |
| 7610 | 7761 | } |
| 7611 | 7762 | |
| 7612 | if (chosen.ty.zigTypeTag() == .ComptimeInt and candidate.ty.isInt()) { | |
| 7763 | if (chosen_ty.zigTypeTag() == .ComptimeInt and candidate_ty.isInt()) { | |
| 7613 | 7764 | chosen = candidate; |
| 7614 | 7765 | continue; |
| 7615 | 7766 | } |
| 7616 | 7767 | |
| 7617 | if (chosen.ty.isInt() and candidate.ty.zigTypeTag() == .ComptimeInt) { | |
| 7768 | if (chosen_ty.isInt() and candidate_ty.zigTypeTag() == .ComptimeInt) { | |
| 7618 | 7769 | continue; |
| 7619 | 7770 | } |
| 7620 | 7771 | |
| 7621 | if (chosen.ty.zigTypeTag() == .ComptimeFloat and candidate.ty.isFloat()) { | |
| 7772 | if (chosen_ty.zigTypeTag() == .ComptimeFloat and candidate_ty.isFloat()) { | |
| 7622 | 7773 | chosen = candidate; |
| 7623 | 7774 | continue; |
| 7624 | 7775 | } |
| 7625 | 7776 | |
| 7626 | if (chosen.ty.isFloat() and candidate.ty.zigTypeTag() == .ComptimeFloat) { | |
| 7777 | if (chosen_ty.isFloat() and candidate_ty.zigTypeTag() == .ComptimeFloat) { | |
| 7627 | 7778 | continue; |
| 7628 | 7779 | } |
| 7629 | 7780 | |
| 7630 | if (chosen.ty.zigTypeTag() == .Enum and candidate.ty.zigTypeTag() == .EnumLiteral) { | |
| 7781 | if (chosen_ty.zigTypeTag() == .Enum and candidate_ty.zigTypeTag() == .EnumLiteral) { | |
| 7631 | 7782 | continue; |
| 7632 | 7783 | } |
| 7633 | if (chosen.ty.zigTypeTag() == .EnumLiteral and candidate.ty.zigTypeTag() == .Enum) { | |
| 7784 | if (chosen_ty.zigTypeTag() == .EnumLiteral and candidate_ty.zigTypeTag() == .Enum) { | |
| 7634 | 7785 | chosen = candidate; |
| 7635 | 7786 | continue; |
| 7636 | 7787 | } |
| 7637 | 7788 | |
| 7638 | 7789 | // TODO error notes pointing out each type |
| 7639 | return sema.mod.fail(&block.base, src, "incompatible types: '{}' and '{}'", .{ chosen.ty, candidate.ty }); | |
| 7790 | return sema.mod.fail(&block.base, src, "incompatible types: '{}' and '{}'", .{ chosen_ty, candidate_ty }); | |
| 7640 | 7791 | } |
| 7641 | 7792 | |
| 7642 | return chosen.ty; | |
| 7793 | return sema.typeOf(chosen); | |
| 7643 | 7794 | } |
| 7644 | 7795 | |
| 7645 | fn resolveTypeFields(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, ty: Type) InnerError!Type { | |
| 7796 | fn resolveTypeFields(sema: *Sema, block: *Scope.Block, src: LazySrcLoc, ty: Type) CompileError!Type { | |
| 7646 | 7797 | switch (ty.tag()) { |
| 7647 | 7798 | .@"struct" => { |
| 7648 | 7799 | const struct_obj = ty.castTag(.@"struct").?.data; |
| ... | ... | @@ -7694,7 +7845,7 @@ fn resolveBuiltinTypeFields( |
| 7694 | 7845 | block: *Scope.Block, |
| 7695 | 7846 | src: LazySrcLoc, |
| 7696 | 7847 | name: []const u8, |
| 7697 | ) InnerError!Type { | |
| 7848 | ) CompileError!Type { | |
| 7698 | 7849 | const resolved_ty = try sema.getBuiltinType(block, src, name); |
| 7699 | 7850 | return sema.resolveTypeFields(block, src, resolved_ty); |
| 7700 | 7851 | } |
| ... | ... | @@ -7704,7 +7855,7 @@ fn getBuiltin( |
| 7704 | 7855 | block: *Scope.Block, |
| 7705 | 7856 | src: LazySrcLoc, |
| 7706 | 7857 | name: []const u8, |
| 7707 | ) InnerError!*ir.Inst { | |
| 7858 | ) CompileError!Air.Inst.Ref { | |
| 7708 | 7859 | const mod = sema.mod; |
| 7709 | 7860 | const std_pkg = mod.root_pkg.table.get("std").?; |
| 7710 | 7861 | const std_file = (mod.importPkg(std_pkg) catch unreachable).file; |
| ... | ... | @@ -7715,7 +7866,7 @@ fn getBuiltin( |
| 7715 | 7866 | "builtin", |
| 7716 | 7867 | ); |
| 7717 | 7868 | const builtin_inst = try sema.analyzeLoad(block, src, opt_builtin_inst.?, src); |
| 7718 | const builtin_ty = try sema.resolveAirAsType(block, src, builtin_inst); | |
| 7869 | const builtin_ty = try sema.analyzeAsType(block, src, builtin_inst); | |
| 7719 | 7870 | const opt_ty_inst = try sema.analyzeNamespaceLookup( |
| 7720 | 7871 | block, |
| 7721 | 7872 | src, |
| ... | ... | @@ -7730,9 +7881,9 @@ fn getBuiltinType( |
| 7730 | 7881 | block: *Scope.Block, |
| 7731 | 7882 | src: LazySrcLoc, |
| 7732 | 7883 | name: []const u8, |
| 7733 | ) InnerError!Type { | |
| 7884 | ) CompileError!Type { | |
| 7734 | 7885 | const ty_inst = try sema.getBuiltin(block, src, name); |
| 7735 | return sema.resolveAirAsType(block, src, ty_inst); | |
| 7886 | return sema.analyzeAsType(block, src, ty_inst); | |
| 7736 | 7887 | } |
| 7737 | 7888 | |
| 7738 | 7889 | /// There is another implementation of this in `Type.onePossibleValue`. This one |
| ... | ... | @@ -7744,7 +7895,7 @@ fn typeHasOnePossibleValue( |
| 7744 | 7895 | block: *Scope.Block, |
| 7745 | 7896 | src: LazySrcLoc, |
| 7746 | 7897 | starting_type: Type, |
| 7747 | ) InnerError!?Value { | |
| 7898 | ) CompileError!?Value { | |
| 7748 | 7899 | var ty = starting_type; |
| 7749 | 7900 | while (true) switch (ty.tag()) { |
| 7750 | 7901 | .f16, |
| ... | ... | @@ -7882,7 +8033,7 @@ fn typeHasOnePossibleValue( |
| 7882 | 8033 | }; |
| 7883 | 8034 | } |
| 7884 | 8035 | |
| 7885 | fn getAstTree(sema: *Sema, block: *Scope.Block) InnerError!*const std.zig.ast.Tree { | |
| 8036 | fn getAstTree(sema: *Sema, block: *Scope.Block) CompileError!*const std.zig.ast.Tree { | |
| 7886 | 8037 | return block.src_decl.namespace.file_scope.getTree(sema.gpa) catch |err| { |
| 7887 | 8038 | log.err("unable to load AST to report compile error: {s}", .{@errorName(err)}); |
| 7888 | 8039 | return error.AnalysisFail; |
| ... | ... | @@ -7931,3 +8082,146 @@ fn enumFieldSrcLoc( |
| 7931 | 8082 | } |
| 7932 | 8083 | } else unreachable; |
| 7933 | 8084 | } |
| 8085 | ||
| 8086 | /// Returns the type of the AIR instruction. | |
| 8087 | fn typeOf(sema: *Sema, inst: Air.Inst.Ref) Type { | |
| 8088 | return sema.getTmpAir().typeOf(inst); | |
| 8089 | } | |
| 8090 | ||
| 8091 | fn getTmpAir(sema: Sema) Air { | |
| 8092 | return .{ | |
| 8093 | .instructions = sema.air_instructions.slice(), | |
| 8094 | .extra = sema.air_extra.items, | |
| 8095 | .values = sema.air_values.items, | |
| 8096 | .variables = sema.air_variables.items, | |
| 8097 | }; | |
| 8098 | } | |
| 8099 | ||
| 8100 | pub fn addType(sema: *Sema, ty: Type) !Air.Inst.Ref { | |
| 8101 | switch (ty.tag()) { | |
| 8102 | .u8 => return .u8_type, | |
| 8103 | .i8 => return .i8_type, | |
| 8104 | .u16 => return .u16_type, | |
| 8105 | .i16 => return .i16_type, | |
| 8106 | .u32 => return .u32_type, | |
| 8107 | .i32 => return .i32_type, | |
| 8108 | .u64 => return .u64_type, | |
| 8109 | .i64 => return .i64_type, | |
| 8110 | .u128 => return .u128_type, | |
| 8111 | .i128 => return .i128_type, | |
| 8112 | .usize => return .usize_type, | |
| 8113 | .isize => return .isize_type, | |
| 8114 | .c_short => return .c_short_type, | |
| 8115 | .c_ushort => return .c_ushort_type, | |
| 8116 | .c_int => return .c_int_type, | |
| 8117 | .c_uint => return .c_uint_type, | |
| 8118 | .c_long => return .c_long_type, | |
| 8119 | .c_ulong => return .c_ulong_type, | |
| 8120 | .c_longlong => return .c_longlong_type, | |
| 8121 | .c_ulonglong => return .c_ulonglong_type, | |
| 8122 | .c_longdouble => return .c_longdouble_type, | |
| 8123 | .f16 => return .f16_type, | |
| 8124 | .f32 => return .f32_type, | |
| 8125 | .f64 => return .f64_type, | |
| 8126 | .f128 => return .f128_type, | |
| 8127 | .c_void => return .c_void_type, | |
| 8128 | .bool => return .bool_type, | |
| 8129 | .void => return .void_type, | |
| 8130 | .type => return .type_type, | |
| 8131 | .anyerror => return .anyerror_type, | |
| 8132 | .comptime_int => return .comptime_int_type, | |
| 8133 | .comptime_float => return .comptime_float_type, | |
| 8134 | .noreturn => return .noreturn_type, | |
| 8135 | .@"anyframe" => return .anyframe_type, | |
| 8136 | .@"null" => return .null_type, | |
| 8137 | .@"undefined" => return .undefined_type, | |
| 8138 | .enum_literal => return .enum_literal_type, | |
| 8139 | .atomic_ordering => return .atomic_ordering_type, | |
| 8140 | .atomic_rmw_op => return .atomic_rmw_op_type, | |
| 8141 | .calling_convention => return .calling_convention_type, | |
| 8142 | .float_mode => return .float_mode_type, | |
| 8143 | .reduce_op => return .reduce_op_type, | |
| 8144 | .call_options => return .call_options_type, | |
| 8145 | .export_options => return .export_options_type, | |
| 8146 | .extern_options => return .extern_options_type, | |
| 8147 | .manyptr_u8 => return .manyptr_u8_type, | |
| 8148 | .manyptr_const_u8 => return .manyptr_const_u8_type, | |
| 8149 | .fn_noreturn_no_args => return .fn_noreturn_no_args_type, | |
| 8150 | .fn_void_no_args => return .fn_void_no_args_type, | |
| 8151 | .fn_naked_noreturn_no_args => return .fn_naked_noreturn_no_args_type, | |
| 8152 | .fn_ccc_void_no_args => return .fn_ccc_void_no_args_type, | |
| 8153 | .single_const_pointer_to_comptime_int => return .single_const_pointer_to_comptime_int_type, | |
| 8154 | .const_slice_u8 => return .const_slice_u8_type, | |
| 8155 | else => {}, | |
| 8156 | } | |
| 8157 | try sema.air_instructions.append(sema.gpa, .{ | |
| 8158 | .tag = .const_ty, | |
| 8159 | .data = .{ .ty = ty }, | |
| 8160 | }); | |
| 8161 | return Air.indexToRef(@intCast(u32, sema.air_instructions.len - 1)); | |
| 8162 | } | |
| 8163 | ||
| 8164 | fn addIntUnsigned(sema: *Sema, ty: Type, int: u64) CompileError!Air.Inst.Ref { | |
| 8165 | return sema.addConstant(ty, try Value.Tag.int_u64.create(sema.arena, int)); | |
| 8166 | } | |
| 8167 | ||
| 8168 | fn addConstUndef(sema: *Sema, ty: Type) CompileError!Air.Inst.Ref { | |
| 8169 | return sema.addConstant(ty, Value.initTag(.undef)); | |
| 8170 | } | |
| 8171 | ||
| 8172 | fn addConstant(sema: *Sema, ty: Type, val: Value) CompileError!Air.Inst.Ref { | |
| 8173 | const gpa = sema.gpa; | |
| 8174 | const ty_inst = try sema.addType(ty); | |
| 8175 | try sema.air_values.append(gpa, val); | |
| 8176 | try sema.air_instructions.append(gpa, .{ | |
| 8177 | .tag = .constant, | |
| 8178 | .data = .{ .ty_pl = .{ | |
| 8179 | .ty = ty_inst, | |
| 8180 | .payload = @intCast(u32, sema.air_values.items.len - 1), | |
| 8181 | } }, | |
| 8182 | }); | |
| 8183 | return Air.indexToRef(@intCast(u32, sema.air_instructions.len - 1)); | |
| 8184 | } | |
| 8185 | ||
| 8186 | pub fn addExtra(sema: *Sema, extra: anytype) Allocator.Error!u32 { | |
| 8187 | const fields = std.meta.fields(@TypeOf(extra)); | |
| 8188 | try sema.air_extra.ensureUnusedCapacity(sema.gpa, fields.len); | |
| 8189 | return addExtraAssumeCapacity(sema, extra); | |
| 8190 | } | |
| 8191 | ||
| 8192 | pub fn addExtraAssumeCapacity(sema: *Sema, extra: anytype) u32 { | |
| 8193 | const fields = std.meta.fields(@TypeOf(extra)); | |
| 8194 | const result = @intCast(u32, sema.air_extra.items.len); | |
| 8195 | inline for (fields) |field| { | |
| 8196 | sema.air_extra.appendAssumeCapacity(switch (field.field_type) { | |
| 8197 | u32 => @field(extra, field.name), | |
| 8198 | Air.Inst.Ref => @enumToInt(@field(extra, field.name)), | |
| 8199 | i32 => @bitCast(u32, @field(extra, field.name)), | |
| 8200 | else => @compileError("bad field type"), | |
| 8201 | }); | |
| 8202 | } | |
| 8203 | return result; | |
| 8204 | } | |
| 8205 | ||
| 8206 | fn appendRefsAssumeCapacity(sema: *Sema, refs: []const Air.Inst.Ref) void { | |
| 8207 | const coerced = @bitCast([]const u32, refs); | |
| 8208 | sema.air_extra.appendSliceAssumeCapacity(coerced); | |
| 8209 | } | |
| 8210 | ||
| 8211 | fn getBreakBlock(sema: *Sema, inst_index: Air.Inst.Index) ?Air.Inst.Index { | |
| 8212 | const air_datas = sema.air_instructions.items(.data); | |
| 8213 | const air_tags = sema.air_instructions.items(.tag); | |
| 8214 | switch (air_tags[inst_index]) { | |
| 8215 | .br => return air_datas[inst_index].br.block_inst, | |
| 8216 | else => return null, | |
| 8217 | } | |
| 8218 | } | |
| 8219 | ||
| 8220 | fn isComptimeKnown( | |
| 8221 | sema: *Sema, | |
| 8222 | block: *Scope.Block, | |
| 8223 | src: LazySrcLoc, | |
| 8224 | inst: Air.Inst.Ref, | |
| 8225 | ) !bool { | |
| 8226 | return (try sema.resolvePossiblyUndefinedValue(block, src, inst)) != null; | |
| 8227 | } |
src/Zir.zig+28-38
| ... | ... | @@ -22,7 +22,6 @@ const Zir = @This(); |
| 22 | 22 | const Type = @import("type.zig").Type; |
| 23 | 23 | const Value = @import("value.zig").Value; |
| 24 | 24 | const TypedValue = @import("TypedValue.zig"); |
| 25 | const ir = @import("air.zig"); | |
| 26 | 25 | const Module = @import("Module.zig"); |
| 27 | 26 | const LazySrcLoc = Module.LazySrcLoc; |
| 28 | 27 | |
| ... | ... | @@ -138,11 +137,17 @@ pub fn renderAsTextToFile( |
| 138 | 137 | const imports_index = scope_file.zir.extra[@enumToInt(ExtraIndex.imports)]; |
| 139 | 138 | if (imports_index != 0) { |
| 140 | 139 | try fs_file.writeAll("Imports:\n"); |
| 141 | const imports_len = scope_file.zir.extra[imports_index]; | |
| 142 | for (scope_file.zir.extra[imports_index + 1 ..][0..imports_len]) |import_inst| { | |
| 143 | const inst_data = writer.code.instructions.items(.data)[import_inst].str_tok; | |
| 144 | const src = inst_data.src(); | |
| 145 | const import_path = inst_data.get(writer.code); | |
| 140 | ||
| 141 | const extra = scope_file.zir.extraData(Inst.Imports, imports_index); | |
| 142 | var import_i: u32 = 0; | |
| 143 | var extra_index = extra.end; | |
| 144 | ||
| 145 | while (import_i < extra.data.imports_len) : (import_i += 1) { | |
| 146 | const item = scope_file.zir.extraData(Inst.Imports.Item, extra_index); | |
| 147 | extra_index = item.end; | |
| 148 | ||
| 149 | const src: LazySrcLoc = .{ .token_abs = item.data.token }; | |
| 150 | const import_path = scope_file.zir.nullTerminatedString(item.data.name); | |
| 146 | 151 | try fs_file.writer().print(" @import(\"{}\") ", .{ |
| 147 | 152 | std.zig.fmtEscapes(import_path), |
| 148 | 153 | }); |
| ... | ... | @@ -208,7 +213,7 @@ pub const Inst = struct { |
| 208 | 213 | as_node, |
| 209 | 214 | /// Bitwise AND. `&` |
| 210 | 215 | bit_and, |
| 211 | /// Bitcast a value to a different type. | |
| 216 | /// Reinterpret the memory representation of a value as a different type. | |
| 212 | 217 | /// Uses the pl_node field with payload `Bin`. |
| 213 | 218 | bitcast, |
| 214 | 219 | /// A typed result location pointer is bitcasted to a new result location pointer. |
| ... | ... | @@ -231,15 +236,9 @@ pub const Inst = struct { |
| 231 | 236 | /// Implements `suspend {...}`. |
| 232 | 237 | /// Uses the `pl_node` union field. Payload is `Block`. |
| 233 | 238 | suspend_block, |
| 234 | /// Boolean AND. See also `bit_and`. | |
| 235 | /// Uses the `pl_node` union field. Payload is `Bin`. | |
| 236 | bool_and, | |
| 237 | 239 | /// Boolean NOT. See also `bit_not`. |
| 238 | 240 | /// Uses the `un_node` field. |
| 239 | 241 | bool_not, |
| 240 | /// Boolean OR. See also `bit_or`. | |
| 241 | /// Uses the `pl_node` union field. Payload is `Bin`. | |
| 242 | bool_or, | |
| 243 | 242 | /// Short-circuiting boolean `and`. `lhs` is a boolean `Ref` and the other operand |
| 244 | 243 | /// is a block, which is evaluated if `lhs` is `true`. |
| 245 | 244 | /// Uses the `bool_br` union field. |
| ... | ... | @@ -387,7 +386,7 @@ pub const Inst = struct { |
| 387 | 386 | int, |
| 388 | 387 | /// Arbitrary sized integer literal. Uses the `str` union field. |
| 389 | 388 | int_big, |
| 390 | /// A float literal that fits in a f32. Uses the float union value. | |
| 389 | /// A float literal that fits in a f64. Uses the float union value. | |
| 391 | 390 | float, |
| 392 | 391 | /// A float literal that fits in a f128. Uses the `pl_node` union value. |
| 393 | 392 | /// Payload is `Float128`. |
| ... | ... | @@ -993,8 +992,6 @@ pub const Inst = struct { |
| 993 | 992 | .bool_br_and, |
| 994 | 993 | .bool_br_or, |
| 995 | 994 | .bool_not, |
| 996 | .bool_and, | |
| 997 | .bool_or, | |
| 998 | 995 | .breakpoint, |
| 999 | 996 | .fence, |
| 1000 | 997 | .call, |
| ... | ... | @@ -1243,9 +1240,7 @@ pub const Inst = struct { |
| 1243 | 1240 | .block = .pl_node, |
| 1244 | 1241 | .block_inline = .pl_node, |
| 1245 | 1242 | .suspend_block = .pl_node, |
| 1246 | .bool_and = .pl_node, | |
| 1247 | 1243 | .bool_not = .un_node, |
| 1248 | .bool_or = .pl_node, | |
| 1249 | 1244 | .bool_br_and = .bool_br, |
| 1250 | 1245 | .bool_br_or = .bool_br, |
| 1251 | 1246 | .@"break" = .@"break", |
| ... | ... | @@ -2063,16 +2058,7 @@ pub const Inst = struct { |
| 2063 | 2058 | /// Offset from Decl AST node index. |
| 2064 | 2059 | node: i32, |
| 2065 | 2060 | int: u64, |
| 2066 | float: struct { | |
| 2067 | /// Offset from Decl AST node index. | |
| 2068 | /// `Tag` determines which kind of AST node this points to. | |
| 2069 | src_node: i32, | |
| 2070 | number: f32, | |
| 2071 | ||
| 2072 | pub fn src(self: @This()) LazySrcLoc { | |
| 2073 | return .{ .node_offset = self.src_node }; | |
| 2074 | } | |
| 2075 | }, | |
| 2061 | float: f64, | |
| 2076 | 2062 | array_type_sentinel: struct { |
| 2077 | 2063 | len: Ref, |
| 2078 | 2064 | /// index into extra, points to an `ArrayTypeSentinel` |
| ... | ... | @@ -2190,7 +2176,8 @@ pub const Inst = struct { |
| 2190 | 2176 | /// 2. clobber: u32 // index into string_bytes (null terminated) for every clobbers_len. |
| 2191 | 2177 | pub const Asm = struct { |
| 2192 | 2178 | src_node: i32, |
| 2193 | asm_source: Ref, | |
| 2179 | // null-terminated string index | |
| 2180 | asm_source: u32, | |
| 2194 | 2181 | /// 1 bit for each outputs_len: whether it uses `-> T` or not. |
| 2195 | 2182 | /// 0b0 - operand is a pointer to where to store the output. |
| 2196 | 2183 | /// 0b1 - operand is a type; asm expression has the output as the result. |
| ... | ... | @@ -2780,10 +2767,16 @@ pub const Inst = struct { |
| 2780 | 2767 | }; |
| 2781 | 2768 | }; |
| 2782 | 2769 | |
| 2783 | /// Trailing: for each `imports_len` there is an instruction index | |
| 2784 | /// to an import instruction. | |
| 2770 | /// Trailing: for each `imports_len` there is an Item | |
| 2785 | 2771 | pub const Imports = struct { |
| 2786 | 2772 | imports_len: Zir.Inst.Index, |
| 2773 | ||
| 2774 | pub const Item = struct { | |
| 2775 | /// null terminated string index | |
| 2776 | name: u32, | |
| 2777 | /// points to the import name | |
| 2778 | token: ast.TokenIndex, | |
| 2779 | }; | |
| 2787 | 2780 | }; |
| 2788 | 2781 | }; |
| 2789 | 2782 | |
| ... | ... | @@ -2970,8 +2963,6 @@ const Writer = struct { |
| 2970 | 2963 | .mulwrap, |
| 2971 | 2964 | .sub, |
| 2972 | 2965 | .subwrap, |
| 2973 | .bool_and, | |
| 2974 | .bool_or, | |
| 2975 | 2966 | .cmp_lt, |
| 2976 | 2967 | .cmp_lte, |
| 2977 | 2968 | .cmp_eq, |
| ... | ... | @@ -3257,10 +3248,8 @@ const Writer = struct { |
| 3257 | 3248 | } |
| 3258 | 3249 | |
| 3259 | 3250 | fn writeFloat(self: *Writer, stream: anytype, inst: Inst.Index) !void { |
| 3260 | const inst_data = self.code.instructions.items(.data)[inst].float; | |
| 3261 | const src = inst_data.src(); | |
| 3262 | try stream.print("{d}) ", .{inst_data.number}); | |
| 3263 | try self.writeSrc(stream, src); | |
| 3251 | const number = self.code.instructions.items(.data)[inst].float; | |
| 3252 | try stream.print("{d})", .{number}); | |
| 3264 | 3253 | } |
| 3265 | 3254 | |
| 3266 | 3255 | fn writeFloat128(self: *Writer, stream: anytype, inst: Inst.Index) !void { |
| ... | ... | @@ -3395,9 +3384,10 @@ const Writer = struct { |
| 3395 | 3384 | const inputs_len = @truncate(u5, extended.small >> 5); |
| 3396 | 3385 | const clobbers_len = @truncate(u5, extended.small >> 10); |
| 3397 | 3386 | const is_volatile = @truncate(u1, extended.small >> 15) != 0; |
| 3387 | const asm_source = self.code.nullTerminatedString(extra.data.asm_source); | |
| 3398 | 3388 | |
| 3399 | 3389 | try self.writeFlag(stream, "volatile, ", is_volatile); |
| 3400 | try self.writeInstRef(stream, extra.data.asm_source); | |
| 3390 | try stream.print("\"{}\", ", .{std.zig.fmtEscapes(asm_source)}); | |
| 3401 | 3391 | try stream.writeAll(", "); |
| 3402 | 3392 | |
| 3403 | 3393 | var extra_i: usize = extra.end; |
src/air.zig deleted-1185
| ... | ... | @@ -1,1185 +0,0 @@ |
| 1 | const std = @import("std"); | |
| 2 | const Value = @import("value.zig").Value; | |
| 3 | const Type = @import("type.zig").Type; | |
| 4 | const Module = @import("Module.zig"); | |
| 5 | const assert = std.debug.assert; | |
| 6 | const codegen = @import("codegen.zig"); | |
| 7 | const ast = std.zig.ast; | |
| 8 | ||
| 9 | /// These are in-memory, analyzed instructions. See `zir.Inst` for the representation | |
| 10 | /// of instructions that correspond to the ZIR text format. | |
| 11 | /// This struct owns the `Value` and `Type` memory. When the struct is deallocated, | |
| 12 | /// so are the `Value` and `Type`. The value of a constant must be copied into | |
| 13 | /// a memory location for the value to survive after a const instruction. | |
| 14 | pub const Inst = struct { | |
| 15 | tag: Tag, | |
| 16 | /// Each bit represents the index of an `Inst` parameter in the `args` field. | |
| 17 | /// If a bit is set, it marks the end of the lifetime of the corresponding | |
| 18 | /// instruction parameter. For example, 0b101 means that the first and | |
| 19 | /// third `Inst` parameters' lifetimes end after this instruction, and will | |
| 20 | /// not have any more following references. | |
| 21 | /// The most significant bit being set means that the instruction itself is | |
| 22 | /// never referenced, in other words its lifetime ends as soon as it finishes. | |
| 23 | /// If bit 15 (0b1xxx_xxxx_xxxx_xxxx) is set, it means this instruction itself is unreferenced. | |
| 24 | /// If bit 14 (0bx1xx_xxxx_xxxx_xxxx) is set, it means this is a special case and the | |
| 25 | /// lifetimes of operands are encoded elsewhere. | |
| 26 | deaths: DeathsInt = undefined, | |
| 27 | ty: Type, | |
| 28 | src: Module.LazySrcLoc, | |
| 29 | ||
| 30 | pub const DeathsInt = u16; | |
| 31 | pub const DeathsBitIndex = std.math.Log2Int(DeathsInt); | |
| 32 | pub const unreferenced_bit_index = @typeInfo(DeathsInt).Int.bits - 1; | |
| 33 | pub const deaths_bits = unreferenced_bit_index - 1; | |
| 34 | ||
| 35 | pub fn isUnused(self: Inst) bool { | |
| 36 | return (self.deaths & (1 << unreferenced_bit_index)) != 0; | |
| 37 | } | |
| 38 | ||
| 39 | pub fn operandDies(self: Inst, index: DeathsBitIndex) bool { | |
| 40 | assert(index < deaths_bits); | |
| 41 | return @truncate(u1, self.deaths >> index) != 0; | |
| 42 | } | |
| 43 | ||
| 44 | pub fn clearOperandDeath(self: *Inst, index: DeathsBitIndex) void { | |
| 45 | assert(index < deaths_bits); | |
| 46 | self.deaths &= ~(@as(DeathsInt, 1) << index); | |
| 47 | } | |
| 48 | ||
| 49 | pub fn specialOperandDeaths(self: Inst) bool { | |
| 50 | return (self.deaths & (1 << deaths_bits)) != 0; | |
| 51 | } | |
| 52 | ||
| 53 | pub const Tag = enum { | |
| 54 | add, | |
| 55 | addwrap, | |
| 56 | alloc, | |
| 57 | arg, | |
| 58 | assembly, | |
| 59 | bit_and, | |
| 60 | bitcast, | |
| 61 | bit_or, | |
| 62 | block, | |
| 63 | br, | |
| 64 | /// Same as `br` except the operand is a list of instructions to be treated as | |
| 65 | /// a flat block; that is there is only 1 break instruction from the block, and | |
| 66 | /// it is implied to be after the last instruction, and the last instruction is | |
| 67 | /// the break operand. | |
| 68 | /// This instruction exists for late-stage semantic analysis patch ups, to | |
| 69 | /// replace one br operand with multiple instructions, without moving anything else around. | |
| 70 | br_block_flat, | |
| 71 | breakpoint, | |
| 72 | br_void, | |
| 73 | call, | |
| 74 | cmp_lt, | |
| 75 | cmp_lte, | |
| 76 | cmp_eq, | |
| 77 | cmp_gte, | |
| 78 | cmp_gt, | |
| 79 | cmp_neq, | |
| 80 | condbr, | |
| 81 | constant, | |
| 82 | dbg_stmt, | |
| 83 | /// ?T => bool | |
| 84 | is_null, | |
| 85 | /// ?T => bool (inverted logic) | |
| 86 | is_non_null, | |
| 87 | /// *?T => bool | |
| 88 | is_null_ptr, | |
| 89 | /// *?T => bool (inverted logic) | |
| 90 | is_non_null_ptr, | |
| 91 | /// E!T => bool | |
| 92 | is_err, | |
| 93 | /// E!T => bool (inverted logic) | |
| 94 | is_non_err, | |
| 95 | /// *E!T => bool | |
| 96 | is_err_ptr, | |
| 97 | /// *E!T => bool (inverted logic) | |
| 98 | is_non_err_ptr, | |
| 99 | bool_and, | |
| 100 | bool_or, | |
| 101 | /// Read a value from a pointer. | |
| 102 | load, | |
| 103 | /// A labeled block of code that loops forever. At the end of the body it is implied | |
| 104 | /// to repeat; no explicit "repeat" instruction terminates loop bodies. | |
| 105 | loop, | |
| 106 | ptrtoint, | |
| 107 | ref, | |
| 108 | ret, | |
| 109 | retvoid, | |
| 110 | varptr, | |
| 111 | /// Write a value to a pointer. LHS is pointer, RHS is value. | |
| 112 | store, | |
| 113 | sub, | |
| 114 | subwrap, | |
| 115 | unreach, | |
| 116 | mul, | |
| 117 | mulwrap, | |
| 118 | div, | |
| 119 | not, | |
| 120 | floatcast, | |
| 121 | intcast, | |
| 122 | /// ?T => T | |
| 123 | optional_payload, | |
| 124 | /// *?T => *T | |
| 125 | optional_payload_ptr, | |
| 126 | wrap_optional, | |
| 127 | /// E!T -> T | |
| 128 | unwrap_errunion_payload, | |
| 129 | /// E!T -> E | |
| 130 | unwrap_errunion_err, | |
| 131 | /// *(E!T) -> *T | |
| 132 | unwrap_errunion_payload_ptr, | |
| 133 | /// *(E!T) -> E | |
| 134 | unwrap_errunion_err_ptr, | |
| 135 | /// wrap from T to E!T | |
| 136 | wrap_errunion_payload, | |
| 137 | /// wrap from E to E!T | |
| 138 | wrap_errunion_err, | |
| 139 | xor, | |
| 140 | switchbr, | |
| 141 | /// Given a pointer to a struct and a field index, returns a pointer to the field. | |
| 142 | struct_field_ptr, | |
| 143 | ||
| 144 | pub fn Type(tag: Tag) type { | |
| 145 | return switch (tag) { | |
| 146 | .alloc, | |
| 147 | .retvoid, | |
| 148 | .unreach, | |
| 149 | .breakpoint, | |
| 150 | => NoOp, | |
| 151 | ||
| 152 | .ref, | |
| 153 | .ret, | |
| 154 | .bitcast, | |
| 155 | .not, | |
| 156 | .is_non_null, | |
| 157 | .is_non_null_ptr, | |
| 158 | .is_null, | |
| 159 | .is_null_ptr, | |
| 160 | .is_err, | |
| 161 | .is_non_err, | |
| 162 | .is_err_ptr, | |
| 163 | .is_non_err_ptr, | |
| 164 | .ptrtoint, | |
| 165 | .floatcast, | |
| 166 | .intcast, | |
| 167 | .load, | |
| 168 | .optional_payload, | |
| 169 | .optional_payload_ptr, | |
| 170 | .wrap_optional, | |
| 171 | .unwrap_errunion_payload, | |
| 172 | .unwrap_errunion_err, | |
| 173 | .unwrap_errunion_payload_ptr, | |
| 174 | .unwrap_errunion_err_ptr, | |
| 175 | .wrap_errunion_payload, | |
| 176 | .wrap_errunion_err, | |
| 177 | => UnOp, | |
| 178 | ||
| 179 | .add, | |
| 180 | .addwrap, | |
| 181 | .sub, | |
| 182 | .subwrap, | |
| 183 | .mul, | |
| 184 | .mulwrap, | |
| 185 | .div, | |
| 186 | .cmp_lt, | |
| 187 | .cmp_lte, | |
| 188 | .cmp_eq, | |
| 189 | .cmp_gte, | |
| 190 | .cmp_gt, | |
| 191 | .cmp_neq, | |
| 192 | .store, | |
| 193 | .bool_and, | |
| 194 | .bool_or, | |
| 195 | .bit_and, | |
| 196 | .bit_or, | |
| 197 | .xor, | |
| 198 | => BinOp, | |
| 199 | ||
| 200 | .arg => Arg, | |
| 201 | .assembly => Assembly, | |
| 202 | .block => Block, | |
| 203 | .br => Br, | |
| 204 | .br_block_flat => BrBlockFlat, | |
| 205 | .br_void => BrVoid, | |
| 206 | .call => Call, | |
| 207 | .condbr => CondBr, | |
| 208 | .constant => Constant, | |
| 209 | .loop => Loop, | |
| 210 | .varptr => VarPtr, | |
| 211 | .struct_field_ptr => StructFieldPtr, | |
| 212 | .switchbr => SwitchBr, | |
| 213 | .dbg_stmt => DbgStmt, | |
| 214 | }; | |
| 215 | } | |
| 216 | ||
| 217 | pub fn fromCmpOp(op: std.math.CompareOperator) Tag { | |
| 218 | return switch (op) { | |
| 219 | .lt => .cmp_lt, | |
| 220 | .lte => .cmp_lte, | |
| 221 | .eq => .cmp_eq, | |
| 222 | .gte => .cmp_gte, | |
| 223 | .gt => .cmp_gt, | |
| 224 | .neq => .cmp_neq, | |
| 225 | }; | |
| 226 | } | |
| 227 | }; | |
| 228 | ||
| 229 | /// Prefer `castTag` to this. | |
| 230 | pub fn cast(base: *Inst, comptime T: type) ?*T { | |
| 231 | if (@hasField(T, "base_tag")) { | |
| 232 | return base.castTag(T.base_tag); | |
| 233 | } | |
| 234 | inline for (@typeInfo(Tag).Enum.fields) |field| { | |
| 235 | const tag = @intToEnum(Tag, field.value); | |
| 236 | if (base.tag == tag) { | |
| 237 | if (T == tag.Type()) { | |
| 238 | return @fieldParentPtr(T, "base", base); | |
| 239 | } | |
| 240 | return null; | |
| 241 | } | |
| 242 | } | |
| 243 | unreachable; | |
| 244 | } | |
| 245 | ||
| 246 | pub fn castTag(base: *Inst, comptime tag: Tag) ?*tag.Type() { | |
| 247 | if (base.tag == tag) { | |
| 248 | return @fieldParentPtr(tag.Type(), "base", base); | |
| 249 | } | |
| 250 | return null; | |
| 251 | } | |
| 252 | ||
| 253 | pub fn Args(comptime T: type) type { | |
| 254 | return std.meta.fieldInfo(T, .args).field_type; | |
| 255 | } | |
| 256 | ||
| 257 | /// Returns `null` if runtime-known. | |
| 258 | /// Should be called by codegen, not by Sema. Sema functions should call | |
| 259 | /// `resolvePossiblyUndefinedValue` or `resolveDefinedValue` instead. | |
| 260 | /// TODO audit Sema code for violations to the above guidance. | |
| 261 | pub fn value(base: *Inst) ?Value { | |
| 262 | if (base.ty.onePossibleValue()) |opv| return opv; | |
| 263 | ||
| 264 | const inst = base.castTag(.constant) orelse return null; | |
| 265 | return inst.val; | |
| 266 | } | |
| 267 | ||
| 268 | pub fn cmpOperator(base: *Inst) ?std.math.CompareOperator { | |
| 269 | return switch (base.tag) { | |
| 270 | .cmp_lt => .lt, | |
| 271 | .cmp_lte => .lte, | |
| 272 | .cmp_eq => .eq, | |
| 273 | .cmp_gte => .gte, | |
| 274 | .cmp_gt => .gt, | |
| 275 | .cmp_neq => .neq, | |
| 276 | else => null, | |
| 277 | }; | |
| 278 | } | |
| 279 | ||
| 280 | pub fn operandCount(base: *Inst) usize { | |
| 281 | inline for (@typeInfo(Tag).Enum.fields) |field| { | |
| 282 | const tag = @intToEnum(Tag, field.value); | |
| 283 | if (tag == base.tag) { | |
| 284 | return @fieldParentPtr(tag.Type(), "base", base).operandCount(); | |
| 285 | } | |
| 286 | } | |
| 287 | unreachable; | |
| 288 | } | |
| 289 | ||
| 290 | pub fn getOperand(base: *Inst, index: usize) ?*Inst { | |
| 291 | inline for (@typeInfo(Tag).Enum.fields) |field| { | |
| 292 | const tag = @intToEnum(Tag, field.value); | |
| 293 | if (tag == base.tag) { | |
| 294 | return @fieldParentPtr(tag.Type(), "base", base).getOperand(index); | |
| 295 | } | |
| 296 | } | |
| 297 | unreachable; | |
| 298 | } | |
| 299 | ||
| 300 | pub fn breakBlock(base: *Inst) ?*Block { | |
| 301 | return switch (base.tag) { | |
| 302 | .br => base.castTag(.br).?.block, | |
| 303 | .br_void => base.castTag(.br_void).?.block, | |
| 304 | .br_block_flat => base.castTag(.br_block_flat).?.block, | |
| 305 | else => null, | |
| 306 | }; | |
| 307 | } | |
| 308 | ||
| 309 | pub const NoOp = struct { | |
| 310 | base: Inst, | |
| 311 | ||
| 312 | pub fn operandCount(self: *const NoOp) usize { | |
| 313 | _ = self; | |
| 314 | return 0; | |
| 315 | } | |
| 316 | pub fn getOperand(self: *const NoOp, index: usize) ?*Inst { | |
| 317 | _ = self; | |
| 318 | _ = index; | |
| 319 | return null; | |
| 320 | } | |
| 321 | }; | |
| 322 | ||
| 323 | pub const UnOp = struct { | |
| 324 | base: Inst, | |
| 325 | operand: *Inst, | |
| 326 | ||
| 327 | pub fn operandCount(self: *const UnOp) usize { | |
| 328 | _ = self; | |
| 329 | return 1; | |
| 330 | } | |
| 331 | pub fn getOperand(self: *const UnOp, index: usize) ?*Inst { | |
| 332 | if (index == 0) | |
| 333 | return self.operand; | |
| 334 | return null; | |
| 335 | } | |
| 336 | }; | |
| 337 | ||
| 338 | pub const BinOp = struct { | |
| 339 | base: Inst, | |
| 340 | lhs: *Inst, | |
| 341 | rhs: *Inst, | |
| 342 | ||
| 343 | pub fn operandCount(self: *const BinOp) usize { | |
| 344 | _ = self; | |
| 345 | return 2; | |
| 346 | } | |
| 347 | pub fn getOperand(self: *const BinOp, index: usize) ?*Inst { | |
| 348 | var i = index; | |
| 349 | ||
| 350 | if (i < 1) | |
| 351 | return self.lhs; | |
| 352 | i -= 1; | |
| 353 | ||
| 354 | if (i < 1) | |
| 355 | return self.rhs; | |
| 356 | i -= 1; | |
| 357 | ||
| 358 | return null; | |
| 359 | } | |
| 360 | }; | |
| 361 | ||
| 362 | pub const Arg = struct { | |
| 363 | pub const base_tag = Tag.arg; | |
| 364 | ||
| 365 | base: Inst, | |
| 366 | /// This exists to be emitted into debug info. | |
| 367 | name: [*:0]const u8, | |
| 368 | ||
| 369 | pub fn operandCount(self: *const Arg) usize { | |
| 370 | _ = self; | |
| 371 | return 0; | |
| 372 | } | |
| 373 | pub fn getOperand(self: *const Arg, index: usize) ?*Inst { | |
| 374 | _ = self; | |
| 375 | _ = index; | |
| 376 | return null; | |
| 377 | } | |
| 378 | }; | |
| 379 | ||
| 380 | pub const Assembly = struct { | |
| 381 | pub const base_tag = Tag.assembly; | |
| 382 | ||
| 383 | base: Inst, | |
| 384 | asm_source: []const u8, | |
| 385 | is_volatile: bool, | |
| 386 | output_constraint: ?[]const u8, | |
| 387 | inputs: []const []const u8, | |
| 388 | clobbers: []const []const u8, | |
| 389 | args: []const *Inst, | |
| 390 | ||
| 391 | pub fn operandCount(self: *const Assembly) usize { | |
| 392 | return self.args.len; | |
| 393 | } | |
| 394 | pub fn getOperand(self: *const Assembly, index: usize) ?*Inst { | |
| 395 | if (index < self.args.len) | |
| 396 | return self.args[index]; | |
| 397 | return null; | |
| 398 | } | |
| 399 | }; | |
| 400 | ||
| 401 | pub const Block = struct { | |
| 402 | pub const base_tag = Tag.block; | |
| 403 | ||
| 404 | base: Inst, | |
| 405 | body: Body, | |
| 406 | ||
| 407 | pub fn operandCount(self: *const Block) usize { | |
| 408 | _ = self; | |
| 409 | return 0; | |
| 410 | } | |
| 411 | pub fn getOperand(self: *const Block, index: usize) ?*Inst { | |
| 412 | _ = self; | |
| 413 | _ = index; | |
| 414 | return null; | |
| 415 | } | |
| 416 | }; | |
| 417 | ||
| 418 | pub const convertable_br_size = std.math.max(@sizeOf(BrBlockFlat), @sizeOf(Br)); | |
| 419 | pub const convertable_br_align = std.math.max(@alignOf(BrBlockFlat), @alignOf(Br)); | |
| 420 | comptime { | |
| 421 | assert(@offsetOf(BrBlockFlat, "base") == @offsetOf(Br, "base")); | |
| 422 | } | |
| 423 | ||
| 424 | pub const BrBlockFlat = struct { | |
| 425 | pub const base_tag = Tag.br_block_flat; | |
| 426 | ||
| 427 | base: Inst, | |
| 428 | block: *Block, | |
| 429 | body: Body, | |
| 430 | ||
| 431 | pub fn operandCount(self: *const BrBlockFlat) usize { | |
| 432 | _ = self; | |
| 433 | return 0; | |
| 434 | } | |
| 435 | pub fn getOperand(self: *const BrBlockFlat, index: usize) ?*Inst { | |
| 436 | _ = self; | |
| 437 | _ = index; | |
| 438 | return null; | |
| 439 | } | |
| 440 | }; | |
| 441 | ||
| 442 | pub const Br = struct { | |
| 443 | pub const base_tag = Tag.br; | |
| 444 | ||
| 445 | base: Inst, | |
| 446 | block: *Block, | |
| 447 | operand: *Inst, | |
| 448 | ||
| 449 | pub fn operandCount(self: *const Br) usize { | |
| 450 | _ = self; | |
| 451 | return 1; | |
| 452 | } | |
| 453 | pub fn getOperand(self: *const Br, index: usize) ?*Inst { | |
| 454 | _ = self; | |
| 455 | if (index == 0) | |
| 456 | return self.operand; | |
| 457 | return null; | |
| 458 | } | |
| 459 | }; | |
| 460 | ||
| 461 | pub const BrVoid = struct { | |
| 462 | pub const base_tag = Tag.br_void; | |
| 463 | ||
| 464 | base: Inst, | |
| 465 | block: *Block, | |
| 466 | ||
| 467 | pub fn operandCount(self: *const BrVoid) usize { | |
| 468 | _ = self; | |
| 469 | return 0; | |
| 470 | } | |
| 471 | pub fn getOperand(self: *const BrVoid, index: usize) ?*Inst { | |
| 472 | _ = self; | |
| 473 | _ = index; | |
| 474 | return null; | |
| 475 | } | |
| 476 | }; | |
| 477 | ||
| 478 | pub const Call = struct { | |
| 479 | pub const base_tag = Tag.call; | |
| 480 | ||
| 481 | base: Inst, | |
| 482 | func: *Inst, | |
| 483 | args: []const *Inst, | |
| 484 | ||
| 485 | pub fn operandCount(self: *const Call) usize { | |
| 486 | return self.args.len + 1; | |
| 487 | } | |
| 488 | pub fn getOperand(self: *const Call, index: usize) ?*Inst { | |
| 489 | var i = index; | |
| 490 | ||
| 491 | if (i < 1) | |
| 492 | return self.func; | |
| 493 | i -= 1; | |
| 494 | ||
| 495 | if (i < self.args.len) | |
| 496 | return self.args[i]; | |
| 497 | i -= self.args.len; | |
| 498 | ||
| 499 | return null; | |
| 500 | } | |
| 501 | }; | |
| 502 | ||
| 503 | pub const CondBr = struct { | |
| 504 | pub const base_tag = Tag.condbr; | |
| 505 | ||
| 506 | base: Inst, | |
| 507 | condition: *Inst, | |
| 508 | then_body: Body, | |
| 509 | else_body: Body, | |
| 510 | /// Set of instructions whose lifetimes end at the start of one of the branches. | |
| 511 | /// The `then` branch is first: `deaths[0..then_death_count]`. | |
| 512 | /// The `else` branch is next: `(deaths + then_death_count)[0..else_death_count]`. | |
| 513 | deaths: [*]*Inst = undefined, | |
| 514 | then_death_count: u32 = 0, | |
| 515 | else_death_count: u32 = 0, | |
| 516 | ||
| 517 | pub fn operandCount(self: *const CondBr) usize { | |
| 518 | _ = self; | |
| 519 | return 1; | |
| 520 | } | |
| 521 | pub fn getOperand(self: *const CondBr, index: usize) ?*Inst { | |
| 522 | var i = index; | |
| 523 | ||
| 524 | if (i < 1) | |
| 525 | return self.condition; | |
| 526 | i -= 1; | |
| 527 | ||
| 528 | return null; | |
| 529 | } | |
| 530 | pub fn thenDeaths(self: *const CondBr) []*Inst { | |
| 531 | return self.deaths[0..self.then_death_count]; | |
| 532 | } | |
| 533 | pub fn elseDeaths(self: *const CondBr) []*Inst { | |
| 534 | return (self.deaths + self.then_death_count)[0..self.else_death_count]; | |
| 535 | } | |
| 536 | }; | |
| 537 | ||
| 538 | pub const Constant = struct { | |
| 539 | pub const base_tag = Tag.constant; | |
| 540 | ||
| 541 | base: Inst, | |
| 542 | val: Value, | |
| 543 | ||
| 544 | pub fn operandCount(self: *const Constant) usize { | |
| 545 | _ = self; | |
| 546 | return 0; | |
| 547 | } | |
| 548 | pub fn getOperand(self: *const Constant, index: usize) ?*Inst { | |
| 549 | _ = self; | |
| 550 | _ = index; | |
| 551 | return null; | |
| 552 | } | |
| 553 | }; | |
| 554 | ||
| 555 | pub const Loop = struct { | |
| 556 | pub const base_tag = Tag.loop; | |
| 557 | ||
| 558 | base: Inst, | |
| 559 | body: Body, | |
| 560 | ||
| 561 | pub fn operandCount(self: *const Loop) usize { | |
| 562 | _ = self; | |
| 563 | return 0; | |
| 564 | } | |
| 565 | pub fn getOperand(self: *const Loop, index: usize) ?*Inst { | |
| 566 | _ = self; | |
| 567 | _ = index; | |
| 568 | return null; | |
| 569 | } | |
| 570 | }; | |
| 571 | ||
| 572 | pub const VarPtr = struct { | |
| 573 | pub const base_tag = Tag.varptr; | |
| 574 | ||
| 575 | base: Inst, | |
| 576 | variable: *Module.Var, | |
| 577 | ||
| 578 | pub fn operandCount(self: *const VarPtr) usize { | |
| 579 | _ = self; | |
| 580 | return 0; | |
| 581 | } | |
| 582 | pub fn getOperand(self: *const VarPtr, index: usize) ?*Inst { | |
| 583 | _ = self; | |
| 584 | _ = index; | |
| 585 | return null; | |
| 586 | } | |
| 587 | }; | |
| 588 | ||
| 589 | pub const StructFieldPtr = struct { | |
| 590 | pub const base_tag = Tag.struct_field_ptr; | |
| 591 | ||
| 592 | base: Inst, | |
| 593 | struct_ptr: *Inst, | |
| 594 | field_index: usize, | |
| 595 | ||
| 596 | pub fn operandCount(self: *const StructFieldPtr) usize { | |
| 597 | _ = self; | |
| 598 | return 1; | |
| 599 | } | |
| 600 | pub fn getOperand(self: *const StructFieldPtr, index: usize) ?*Inst { | |
| 601 | _ = self; | |
| 602 | _ = index; | |
| 603 | var i = index; | |
| 604 | ||
| 605 | if (i < 1) | |
| 606 | return self.struct_ptr; | |
| 607 | i -= 1; | |
| 608 | ||
| 609 | return null; | |
| 610 | } | |
| 611 | }; | |
| 612 | ||
| 613 | pub const SwitchBr = struct { | |
| 614 | pub const base_tag = Tag.switchbr; | |
| 615 | ||
| 616 | base: Inst, | |
| 617 | target: *Inst, | |
| 618 | cases: []Case, | |
| 619 | /// Set of instructions whose lifetimes end at the start of one of the cases. | |
| 620 | /// In same order as cases, deaths[0..case_0_count, case_0_count .. case_1_count, ... ]. | |
| 621 | deaths: [*]*Inst = undefined, | |
| 622 | else_index: u32 = 0, | |
| 623 | else_deaths: u32 = 0, | |
| 624 | else_body: Body, | |
| 625 | ||
| 626 | pub const Case = struct { | |
| 627 | item: Value, | |
| 628 | body: Body, | |
| 629 | index: u32 = 0, | |
| 630 | deaths: u32 = 0, | |
| 631 | }; | |
| 632 | ||
| 633 | pub fn operandCount(self: *const SwitchBr) usize { | |
| 634 | _ = self; | |
| 635 | return 1; | |
| 636 | } | |
| 637 | pub fn getOperand(self: *const SwitchBr, index: usize) ?*Inst { | |
| 638 | var i = index; | |
| 639 | ||
| 640 | if (i < 1) | |
| 641 | return self.target; | |
| 642 | i -= 1; | |
| 643 | ||
| 644 | return null; | |
| 645 | } | |
| 646 | pub fn caseDeaths(self: *const SwitchBr, case_index: usize) []*Inst { | |
| 647 | const case = self.cases[case_index]; | |
| 648 | return (self.deaths + case.index)[0..case.deaths]; | |
| 649 | } | |
| 650 | pub fn elseDeaths(self: *const SwitchBr) []*Inst { | |
| 651 | return (self.deaths + self.else_index)[0..self.else_deaths]; | |
| 652 | } | |
| 653 | }; | |
| 654 | ||
| 655 | pub const DbgStmt = struct { | |
| 656 | pub const base_tag = Tag.dbg_stmt; | |
| 657 | ||
| 658 | base: Inst, | |
| 659 | line: u32, | |
| 660 | column: u32, | |
| 661 | ||
| 662 | pub fn operandCount(self: *const DbgStmt) usize { | |
| 663 | _ = self; | |
| 664 | return 0; | |
| 665 | } | |
| 666 | pub fn getOperand(self: *const DbgStmt, index: usize) ?*Inst { | |
| 667 | _ = self; | |
| 668 | _ = index; | |
| 669 | return null; | |
| 670 | } | |
| 671 | }; | |
| 672 | }; | |
| 673 | ||
| 674 | pub const Body = struct { | |
| 675 | instructions: []*Inst, | |
| 676 | }; | |
| 677 | ||
| 678 | /// For debugging purposes, prints a function representation to stderr. | |
| 679 | pub fn dumpFn(old_module: Module, module_fn: *Module.Fn) void { | |
| 680 | const allocator = old_module.gpa; | |
| 681 | var ctx: DumpAir = .{ | |
| 682 | .allocator = allocator, | |
| 683 | .arena = std.heap.ArenaAllocator.init(allocator), | |
| 684 | .old_module = &old_module, | |
| 685 | .module_fn = module_fn, | |
| 686 | .indent = 2, | |
| 687 | .inst_table = DumpAir.InstTable.init(allocator), | |
| 688 | .partial_inst_table = DumpAir.InstTable.init(allocator), | |
| 689 | .const_table = DumpAir.InstTable.init(allocator), | |
| 690 | }; | |
| 691 | defer ctx.inst_table.deinit(); | |
| 692 | defer ctx.partial_inst_table.deinit(); | |
| 693 | defer ctx.const_table.deinit(); | |
| 694 | defer ctx.arena.deinit(); | |
| 695 | ||
| 696 | switch (module_fn.state) { | |
| 697 | .queued => std.debug.print("(queued)", .{}), | |
| 698 | .inline_only => std.debug.print("(inline_only)", .{}), | |
| 699 | .in_progress => std.debug.print("(in_progress)", .{}), | |
| 700 | .sema_failure => std.debug.print("(sema_failure)", .{}), | |
| 701 | .dependency_failure => std.debug.print("(dependency_failure)", .{}), | |
| 702 | .success => { | |
| 703 | const writer = std.io.getStdErr().writer(); | |
| 704 | ctx.dump(module_fn.body, writer) catch @panic("failed to dump AIR"); | |
| 705 | }, | |
| 706 | } | |
| 707 | } | |
| 708 | ||
| 709 | const DumpAir = struct { | |
| 710 | allocator: *std.mem.Allocator, | |
| 711 | arena: std.heap.ArenaAllocator, | |
| 712 | old_module: *const Module, | |
| 713 | module_fn: *Module.Fn, | |
| 714 | indent: usize, | |
| 715 | inst_table: InstTable, | |
| 716 | partial_inst_table: InstTable, | |
| 717 | const_table: InstTable, | |
| 718 | next_index: usize = 0, | |
| 719 | next_partial_index: usize = 0, | |
| 720 | next_const_index: usize = 0, | |
| 721 | ||
| 722 | const InstTable = std.AutoArrayHashMap(*Inst, usize); | |
| 723 | ||
| 724 | /// TODO: Improve this code to include a stack of Body and store the instructions | |
| 725 | /// in there. Now we are putting all the instructions in a function local table, | |
| 726 | /// however instructions that are in a Body can be thown away when the Body ends. | |
| 727 | fn dump(dtz: *DumpAir, body: Body, writer: std.fs.File.Writer) !void { | |
| 728 | // First pass to pre-populate the table so that we can show even invalid references. | |
| 729 | // Must iterate the same order we iterate the second time. | |
| 730 | // We also look for constants and put them in the const_table. | |
| 731 | try dtz.fetchInstsAndResolveConsts(body); | |
| 732 | ||
| 733 | std.debug.print("Module.Function(name={s}):\n", .{dtz.module_fn.owner_decl.name}); | |
| 734 | ||
| 735 | var it = dtz.const_table.iterator(); | |
| 736 | while (it.next()) |entry| { | |
| 737 | const constant = entry.key_ptr.*.castTag(.constant).?; | |
| 738 | try writer.print(" @{d}: {} = {};\n", .{ | |
| 739 | entry.value_ptr.*, constant.base.ty, constant.val, | |
| 740 | }); | |
| 741 | } | |
| 742 | ||
| 743 | return dtz.dumpBody(body, writer); | |
| 744 | } | |
| 745 | ||
| 746 | fn fetchInstsAndResolveConsts(dtz: *DumpAir, body: Body) error{OutOfMemory}!void { | |
| 747 | for (body.instructions) |inst| { | |
| 748 | try dtz.inst_table.put(inst, dtz.next_index); | |
| 749 | dtz.next_index += 1; | |
| 750 | switch (inst.tag) { | |
| 751 | .alloc, | |
| 752 | .retvoid, | |
| 753 | .unreach, | |
| 754 | .breakpoint, | |
| 755 | .dbg_stmt, | |
| 756 | .arg, | |
| 757 | => {}, | |
| 758 | ||
| 759 | .ref, | |
| 760 | .ret, | |
| 761 | .bitcast, | |
| 762 | .not, | |
| 763 | .is_non_null, | |
| 764 | .is_non_null_ptr, | |
| 765 | .is_null, | |
| 766 | .is_null_ptr, | |
| 767 | .is_err, | |
| 768 | .is_non_err, | |
| 769 | .is_err_ptr, | |
| 770 | .is_non_err_ptr, | |
| 771 | .ptrtoint, | |
| 772 | .floatcast, | |
| 773 | .intcast, | |
| 774 | .load, | |
| 775 | .optional_payload, | |
| 776 | .optional_payload_ptr, | |
| 777 | .wrap_optional, | |
| 778 | .wrap_errunion_payload, | |
| 779 | .wrap_errunion_err, | |
| 780 | .unwrap_errunion_payload, | |
| 781 | .unwrap_errunion_err, | |
| 782 | .unwrap_errunion_payload_ptr, | |
| 783 | .unwrap_errunion_err_ptr, | |
| 784 | => { | |
| 785 | const un_op = inst.cast(Inst.UnOp).?; | |
| 786 | try dtz.findConst(un_op.operand); | |
| 787 | }, | |
| 788 | ||
| 789 | .add, | |
| 790 | .addwrap, | |
| 791 | .sub, | |
| 792 | .subwrap, | |
| 793 | .mul, | |
| 794 | .mulwrap, | |
| 795 | .div, | |
| 796 | .cmp_lt, | |
| 797 | .cmp_lte, | |
| 798 | .cmp_eq, | |
| 799 | .cmp_gte, | |
| 800 | .cmp_gt, | |
| 801 | .cmp_neq, | |
| 802 | .store, | |
| 803 | .bool_and, | |
| 804 | .bool_or, | |
| 805 | .bit_and, | |
| 806 | .bit_or, | |
| 807 | .xor, | |
| 808 | => { | |
| 809 | const bin_op = inst.cast(Inst.BinOp).?; | |
| 810 | try dtz.findConst(bin_op.lhs); | |
| 811 | try dtz.findConst(bin_op.rhs); | |
| 812 | }, | |
| 813 | ||
| 814 | .br => { | |
| 815 | const br = inst.castTag(.br).?; | |
| 816 | try dtz.findConst(&br.block.base); | |
| 817 | try dtz.findConst(br.operand); | |
| 818 | }, | |
| 819 | ||
| 820 | .br_block_flat => { | |
| 821 | const br_block_flat = inst.castTag(.br_block_flat).?; | |
| 822 | try dtz.findConst(&br_block_flat.block.base); | |
| 823 | try dtz.fetchInstsAndResolveConsts(br_block_flat.body); | |
| 824 | }, | |
| 825 | ||
| 826 | .br_void => { | |
| 827 | const br_void = inst.castTag(.br_void).?; | |
| 828 | try dtz.findConst(&br_void.block.base); | |
| 829 | }, | |
| 830 | ||
| 831 | .block => { | |
| 832 | const block = inst.castTag(.block).?; | |
| 833 | try dtz.fetchInstsAndResolveConsts(block.body); | |
| 834 | }, | |
| 835 | ||
| 836 | .condbr => { | |
| 837 | const condbr = inst.castTag(.condbr).?; | |
| 838 | try dtz.findConst(condbr.condition); | |
| 839 | try dtz.fetchInstsAndResolveConsts(condbr.then_body); | |
| 840 | try dtz.fetchInstsAndResolveConsts(condbr.else_body); | |
| 841 | }, | |
| 842 | .switchbr => { | |
| 843 | const switchbr = inst.castTag(.switchbr).?; | |
| 844 | try dtz.findConst(switchbr.target); | |
| 845 | try dtz.fetchInstsAndResolveConsts(switchbr.else_body); | |
| 846 | for (switchbr.cases) |case| { | |
| 847 | try dtz.fetchInstsAndResolveConsts(case.body); | |
| 848 | } | |
| 849 | }, | |
| 850 | ||
| 851 | .loop => { | |
| 852 | const loop = inst.castTag(.loop).?; | |
| 853 | try dtz.fetchInstsAndResolveConsts(loop.body); | |
| 854 | }, | |
| 855 | .call => { | |
| 856 | const call = inst.castTag(.call).?; | |
| 857 | try dtz.findConst(call.func); | |
| 858 | for (call.args) |arg| { | |
| 859 | try dtz.findConst(arg); | |
| 860 | } | |
| 861 | }, | |
| 862 | .struct_field_ptr => { | |
| 863 | const struct_field_ptr = inst.castTag(.struct_field_ptr).?; | |
| 864 | try dtz.findConst(struct_field_ptr.struct_ptr); | |
| 865 | }, | |
| 866 | ||
| 867 | // TODO fill out this debug printing | |
| 868 | .assembly, | |
| 869 | .constant, | |
| 870 | .varptr, | |
| 871 | => {}, | |
| 872 | } | |
| 873 | } | |
| 874 | } | |
| 875 | ||
| 876 | fn dumpBody(dtz: *DumpAir, body: Body, writer: std.fs.File.Writer) (std.fs.File.WriteError || error{OutOfMemory})!void { | |
| 877 | for (body.instructions) |inst| { | |
| 878 | const my_index = dtz.next_partial_index; | |
| 879 | try dtz.partial_inst_table.put(inst, my_index); | |
| 880 | dtz.next_partial_index += 1; | |
| 881 | ||
| 882 | try writer.writeByteNTimes(' ', dtz.indent); | |
| 883 | try writer.print("%{d}: {} = {s}(", .{ | |
| 884 | my_index, inst.ty, @tagName(inst.tag), | |
| 885 | }); | |
| 886 | switch (inst.tag) { | |
| 887 | .alloc, | |
| 888 | .retvoid, | |
| 889 | .unreach, | |
| 890 | .breakpoint, | |
| 891 | .dbg_stmt, | |
| 892 | => try writer.writeAll(")\n"), | |
| 893 | ||
| 894 | .ref, | |
| 895 | .ret, | |
| 896 | .bitcast, | |
| 897 | .not, | |
| 898 | .is_non_null, | |
| 899 | .is_non_null_ptr, | |
| 900 | .is_null, | |
| 901 | .is_null_ptr, | |
| 902 | .is_err, | |
| 903 | .is_err_ptr, | |
| 904 | .is_non_err, | |
| 905 | .is_non_err_ptr, | |
| 906 | .ptrtoint, | |
| 907 | .floatcast, | |
| 908 | .intcast, | |
| 909 | .load, | |
| 910 | .optional_payload, | |
| 911 | .optional_payload_ptr, | |
| 912 | .wrap_optional, | |
| 913 | .wrap_errunion_err, | |
| 914 | .wrap_errunion_payload, | |
| 915 | .unwrap_errunion_err, | |
| 916 | .unwrap_errunion_payload, | |
| 917 | .unwrap_errunion_payload_ptr, | |
| 918 | .unwrap_errunion_err_ptr, | |
| 919 | => { | |
| 920 | const un_op = inst.cast(Inst.UnOp).?; | |
| 921 | const kinky = try dtz.writeInst(writer, un_op.operand); | |
| 922 | if (kinky != null) { | |
| 923 | try writer.writeAll(") // Instruction does not dominate all uses!\n"); | |
| 924 | } else { | |
| 925 | try writer.writeAll(")\n"); | |
| 926 | } | |
| 927 | }, | |
| 928 | ||
| 929 | .add, | |
| 930 | .addwrap, | |
| 931 | .sub, | |
| 932 | .subwrap, | |
| 933 | .mul, | |
| 934 | .mulwrap, | |
| 935 | .div, | |
| 936 | .cmp_lt, | |
| 937 | .cmp_lte, | |
| 938 | .cmp_eq, | |
| 939 | .cmp_gte, | |
| 940 | .cmp_gt, | |
| 941 | .cmp_neq, | |
| 942 | .store, | |
| 943 | .bool_and, | |
| 944 | .bool_or, | |
| 945 | .bit_and, | |
| 946 | .bit_or, | |
| 947 | .xor, | |
| 948 | => { | |
| 949 | const bin_op = inst.cast(Inst.BinOp).?; | |
| 950 | ||
| 951 | const lhs_kinky = try dtz.writeInst(writer, bin_op.lhs); | |
| 952 | try writer.writeAll(", "); | |
| 953 | const rhs_kinky = try dtz.writeInst(writer, bin_op.rhs); | |
| 954 | ||
| 955 | if (lhs_kinky != null or rhs_kinky != null) { | |
| 956 | try writer.writeAll(") // Instruction does not dominate all uses!"); | |
| 957 | if (lhs_kinky) |lhs| { | |
| 958 | try writer.print(" %{d}", .{lhs}); | |
| 959 | } | |
| 960 | if (rhs_kinky) |rhs| { | |
| 961 | try writer.print(" %{d}", .{rhs}); | |
| 962 | } | |
| 963 | try writer.writeAll("\n"); | |
| 964 | } else { | |
| 965 | try writer.writeAll(")\n"); | |
| 966 | } | |
| 967 | }, | |
| 968 | ||
| 969 | .arg => { | |
| 970 | const arg = inst.castTag(.arg).?; | |
| 971 | try writer.print("{s})\n", .{arg.name}); | |
| 972 | }, | |
| 973 | ||
| 974 | .br => { | |
| 975 | const br = inst.castTag(.br).?; | |
| 976 | ||
| 977 | const lhs_kinky = try dtz.writeInst(writer, &br.block.base); | |
| 978 | try writer.writeAll(", "); | |
| 979 | const rhs_kinky = try dtz.writeInst(writer, br.operand); | |
| 980 | ||
| 981 | if (lhs_kinky != null or rhs_kinky != null) { | |
| 982 | try writer.writeAll(") // Instruction does not dominate all uses!"); | |
| 983 | if (lhs_kinky) |lhs| { | |
| 984 | try writer.print(" %{d}", .{lhs}); | |
| 985 | } | |
| 986 | if (rhs_kinky) |rhs| { | |
| 987 | try writer.print(" %{d}", .{rhs}); | |
| 988 | } | |
| 989 | try writer.writeAll("\n"); | |
| 990 | } else { | |
| 991 | try writer.writeAll(")\n"); | |
| 992 | } | |
| 993 | }, | |
| 994 | ||
| 995 | .br_block_flat => { | |
| 996 | const br_block_flat = inst.castTag(.br_block_flat).?; | |
| 997 | const block_kinky = try dtz.writeInst(writer, &br_block_flat.block.base); | |
| 998 | if (block_kinky != null) { | |
| 999 | try writer.writeAll(", { // Instruction does not dominate all uses!\n"); | |
| 1000 | } else { | |
| 1001 | try writer.writeAll(", {\n"); | |
| 1002 | } | |
| 1003 | ||
| 1004 | const old_indent = dtz.indent; | |
| 1005 | dtz.indent += 2; | |
| 1006 | try dtz.dumpBody(br_block_flat.body, writer); | |
| 1007 | dtz.indent = old_indent; | |
| 1008 | ||
| 1009 | try writer.writeByteNTimes(' ', dtz.indent); | |
| 1010 | try writer.writeAll("})\n"); | |
| 1011 | }, | |
| 1012 | ||
| 1013 | .br_void => { | |
| 1014 | const br_void = inst.castTag(.br_void).?; | |
| 1015 | const kinky = try dtz.writeInst(writer, &br_void.block.base); | |
| 1016 | if (kinky) |_| { | |
| 1017 | try writer.writeAll(") // Instruction does not dominate all uses!\n"); | |
| 1018 | } else { | |
| 1019 | try writer.writeAll(")\n"); | |
| 1020 | } | |
| 1021 | }, | |
| 1022 | ||
| 1023 | .block => { | |
| 1024 | const block = inst.castTag(.block).?; | |
| 1025 | ||
| 1026 | try writer.writeAll("{\n"); | |
| 1027 | ||
| 1028 | const old_indent = dtz.indent; | |
| 1029 | dtz.indent += 2; | |
| 1030 | try dtz.dumpBody(block.body, writer); | |
| 1031 | dtz.indent = old_indent; | |
| 1032 | ||
| 1033 | try writer.writeByteNTimes(' ', dtz.indent); | |
| 1034 | try writer.writeAll("})\n"); | |
| 1035 | }, | |
| 1036 | ||
| 1037 | .condbr => { | |
| 1038 | const condbr = inst.castTag(.condbr).?; | |
| 1039 | ||
| 1040 | const condition_kinky = try dtz.writeInst(writer, condbr.condition); | |
| 1041 | if (condition_kinky != null) { | |
| 1042 | try writer.writeAll(", { // Instruction does not dominate all uses!\n"); | |
| 1043 | } else { | |
| 1044 | try writer.writeAll(", {\n"); | |
| 1045 | } | |
| 1046 | ||
| 1047 | const old_indent = dtz.indent; | |
| 1048 | dtz.indent += 2; | |
| 1049 | try dtz.dumpBody(condbr.then_body, writer); | |
| 1050 | ||
| 1051 | try writer.writeByteNTimes(' ', old_indent); | |
| 1052 | try writer.writeAll("}, {\n"); | |
| 1053 | ||
| 1054 | try dtz.dumpBody(condbr.else_body, writer); | |
| 1055 | dtz.indent = old_indent; | |
| 1056 | ||
| 1057 | try writer.writeByteNTimes(' ', old_indent); | |
| 1058 | try writer.writeAll("})\n"); | |
| 1059 | }, | |
| 1060 | ||
| 1061 | .switchbr => { | |
| 1062 | const switchbr = inst.castTag(.switchbr).?; | |
| 1063 | ||
| 1064 | const condition_kinky = try dtz.writeInst(writer, switchbr.target); | |
| 1065 | if (condition_kinky != null) { | |
| 1066 | try writer.writeAll(", { // Instruction does not dominate all uses!\n"); | |
| 1067 | } else { | |
| 1068 | try writer.writeAll(", {\n"); | |
| 1069 | } | |
| 1070 | const old_indent = dtz.indent; | |
| 1071 | ||
| 1072 | if (switchbr.else_body.instructions.len != 0) { | |
| 1073 | dtz.indent += 2; | |
| 1074 | try dtz.dumpBody(switchbr.else_body, writer); | |
| 1075 | ||
| 1076 | try writer.writeByteNTimes(' ', old_indent); | |
| 1077 | try writer.writeAll("}, {\n"); | |
| 1078 | dtz.indent = old_indent; | |
| 1079 | } | |
| 1080 | for (switchbr.cases) |case| { | |
| 1081 | dtz.indent += 2; | |
| 1082 | try dtz.dumpBody(case.body, writer); | |
| 1083 | ||
| 1084 | try writer.writeByteNTimes(' ', old_indent); | |
| 1085 | try writer.writeAll("}, {\n"); | |
| 1086 | dtz.indent = old_indent; | |
| 1087 | } | |
| 1088 | ||
| 1089 | try writer.writeByteNTimes(' ', old_indent); | |
| 1090 | try writer.writeAll("})\n"); | |
| 1091 | }, | |
| 1092 | ||
| 1093 | .loop => { | |
| 1094 | const loop = inst.castTag(.loop).?; | |
| 1095 | ||
| 1096 | try writer.writeAll("{\n"); | |
| 1097 | ||
| 1098 | const old_indent = dtz.indent; | |
| 1099 | dtz.indent += 2; | |
| 1100 | try dtz.dumpBody(loop.body, writer); | |
| 1101 | dtz.indent = old_indent; | |
| 1102 | ||
| 1103 | try writer.writeByteNTimes(' ', dtz.indent); | |
| 1104 | try writer.writeAll("})\n"); | |
| 1105 | }, | |
| 1106 | ||
| 1107 | .call => { | |
| 1108 | const call = inst.castTag(.call).?; | |
| 1109 | ||
| 1110 | const args_kinky = try dtz.allocator.alloc(?usize, call.args.len); | |
| 1111 | defer dtz.allocator.free(args_kinky); | |
| 1112 | std.mem.set(?usize, args_kinky, null); | |
| 1113 | var any_kinky_args = false; | |
| 1114 | ||
| 1115 | const func_kinky = try dtz.writeInst(writer, call.func); | |
| 1116 | ||
| 1117 | for (call.args) |arg, i| { | |
| 1118 | try writer.writeAll(", "); | |
| 1119 | ||
| 1120 | args_kinky[i] = try dtz.writeInst(writer, arg); | |
| 1121 | any_kinky_args = any_kinky_args or args_kinky[i] != null; | |
| 1122 | } | |
| 1123 | ||
| 1124 | if (func_kinky != null or any_kinky_args) { | |
| 1125 | try writer.writeAll(") // Instruction does not dominate all uses!"); | |
| 1126 | if (func_kinky) |func_index| { | |
| 1127 | try writer.print(" %{d}", .{func_index}); | |
| 1128 | } | |
| 1129 | for (args_kinky) |arg_kinky| { | |
| 1130 | if (arg_kinky) |arg_index| { | |
| 1131 | try writer.print(" %{d}", .{arg_index}); | |
| 1132 | } | |
| 1133 | } | |
| 1134 | try writer.writeAll("\n"); | |
| 1135 | } else { | |
| 1136 | try writer.writeAll(")\n"); | |
| 1137 | } | |
| 1138 | }, | |
| 1139 | ||
| 1140 | .struct_field_ptr => { | |
| 1141 | const struct_field_ptr = inst.castTag(.struct_field_ptr).?; | |
| 1142 | const kinky = try dtz.writeInst(writer, struct_field_ptr.struct_ptr); | |
| 1143 | if (kinky != null) { | |
| 1144 | try writer.print("{d}) // Instruction does not dominate all uses!\n", .{ | |
| 1145 | struct_field_ptr.field_index, | |
| 1146 | }); | |
| 1147 | } else { | |
| 1148 | try writer.print("{d})\n", .{struct_field_ptr.field_index}); | |
| 1149 | } | |
| 1150 | }, | |
| 1151 | ||
| 1152 | // TODO fill out this debug printing | |
| 1153 | .assembly, | |
| 1154 | .constant, | |
| 1155 | .varptr, | |
| 1156 | => { | |
| 1157 | try writer.writeAll("!TODO!)\n"); | |
| 1158 | }, | |
| 1159 | } | |
| 1160 | } | |
| 1161 | } | |
| 1162 | ||
| 1163 | fn writeInst(dtz: *DumpAir, writer: std.fs.File.Writer, inst: *Inst) !?usize { | |
| 1164 | if (dtz.partial_inst_table.get(inst)) |operand_index| { | |
| 1165 | try writer.print("%{d}", .{operand_index}); | |
| 1166 | return null; | |
| 1167 | } else if (dtz.const_table.get(inst)) |operand_index| { | |
| 1168 | try writer.print("@{d}", .{operand_index}); | |
| 1169 | return null; | |
| 1170 | } else if (dtz.inst_table.get(inst)) |operand_index| { | |
| 1171 | try writer.print("%{d}", .{operand_index}); | |
| 1172 | return operand_index; | |
| 1173 | } else { | |
| 1174 | try writer.writeAll("!BADREF!"); | |
| 1175 | return null; | |
| 1176 | } | |
| 1177 | } | |
| 1178 | ||
| 1179 | fn findConst(dtz: *DumpAir, operand: *Inst) !void { | |
| 1180 | if (operand.tag == .constant) { | |
| 1181 | try dtz.const_table.put(operand, dtz.next_const_index); | |
| 1182 | dtz.next_const_index += 1; | |
| 1183 | } | |
| 1184 | } | |
| 1185 | }; |
src/codegen.zig+1302-1010
| ... | ... | @@ -2,7 +2,9 @@ const std = @import("std"); |
| 2 | 2 | const mem = std.mem; |
| 3 | 3 | const math = std.math; |
| 4 | 4 | const assert = std.debug.assert; |
| 5 | const ir = @import("air.zig"); | |
| 5 | const Air = @import("Air.zig"); | |
| 6 | const Zir = @import("Zir.zig"); | |
| 7 | const Liveness = @import("Liveness.zig"); | |
| 6 | 8 | const Type = @import("type.zig").Type; |
| 7 | 9 | const Value = @import("value.zig").Value; |
| 8 | 10 | const TypedValue = @import("TypedValue.zig"); |
| ... | ... | @@ -22,6 +24,11 @@ const RegisterManager = @import("register_manager.zig").RegisterManager; |
| 22 | 24 | |
| 23 | 25 | const X8664Encoder = @import("codegen/x86_64.zig").Encoder; |
| 24 | 26 | |
| 27 | pub const FnResult = union(enum) { | |
| 28 | /// The `code` parameter passed to `generateSymbol` has the value appended. | |
| 29 | appended: void, | |
| 30 | fail: *ErrorMsg, | |
| 31 | }; | |
| 25 | 32 | pub const Result = union(enum) { |
| 26 | 33 | /// The `code` parameter passed to `generateSymbol` has the value appended. |
| 27 | 34 | appended: void, |
| ... | ... | @@ -45,6 +52,71 @@ pub const DebugInfoOutput = union(enum) { |
| 45 | 52 | none, |
| 46 | 53 | }; |
| 47 | 54 | |
| 55 | pub fn generateFunction( | |
| 56 | bin_file: *link.File, | |
| 57 | src_loc: Module.SrcLoc, | |
| 58 | func: *Module.Fn, | |
| 59 | air: Air, | |
| 60 | liveness: Liveness, | |
| 61 | code: *std.ArrayList(u8), | |
| 62 | debug_output: DebugInfoOutput, | |
| 63 | ) GenerateSymbolError!FnResult { | |
| 64 | switch (bin_file.options.target.cpu.arch) { | |
| 65 | .wasm32 => unreachable, // has its own code path | |
| 66 | .wasm64 => unreachable, // has its own code path | |
| 67 | .arm => return Function(.arm).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 68 | .armeb => return Function(.armeb).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 69 | .aarch64 => return Function(.aarch64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 70 | .aarch64_be => return Function(.aarch64_be).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 71 | .aarch64_32 => return Function(.aarch64_32).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 72 | //.arc => return Function(.arc).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 73 | //.avr => return Function(.avr).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 74 | //.bpfel => return Function(.bpfel).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 75 | //.bpfeb => return Function(.bpfeb).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 76 | //.hexagon => return Function(.hexagon).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 77 | //.mips => return Function(.mips).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 78 | //.mipsel => return Function(.mipsel).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 79 | //.mips64 => return Function(.mips64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 80 | //.mips64el => return Function(.mips64el).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 81 | //.msp430 => return Function(.msp430).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 82 | //.powerpc => return Function(.powerpc).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 83 | //.powerpc64 => return Function(.powerpc64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 84 | //.powerpc64le => return Function(.powerpc64le).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 85 | //.r600 => return Function(.r600).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 86 | //.amdgcn => return Function(.amdgcn).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 87 | //.riscv32 => return Function(.riscv32).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 88 | .riscv64 => return Function(.riscv64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 89 | //.sparc => return Function(.sparc).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 90 | //.sparcv9 => return Function(.sparcv9).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 91 | //.sparcel => return Function(.sparcel).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 92 | //.s390x => return Function(.s390x).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 93 | //.tce => return Function(.tce).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 94 | //.tcele => return Function(.tcele).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 95 | //.thumb => return Function(.thumb).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 96 | //.thumbeb => return Function(.thumbeb).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 97 | //.i386 => return Function(.i386).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 98 | .x86_64 => return Function(.x86_64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 99 | //.xcore => return Function(.xcore).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 100 | //.nvptx => return Function(.nvptx).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 101 | //.nvptx64 => return Function(.nvptx64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 102 | //.le32 => return Function(.le32).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 103 | //.le64 => return Function(.le64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 104 | //.amdil => return Function(.amdil).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 105 | //.amdil64 => return Function(.amdil64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 106 | //.hsail => return Function(.hsail).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 107 | //.hsail64 => return Function(.hsail64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 108 | //.spir => return Function(.spir).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 109 | //.spir64 => return Function(.spir64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 110 | //.kalimba => return Function(.kalimba).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 111 | //.shave => return Function(.shave).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 112 | //.lanai => return Function(.lanai).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 113 | //.renderscript32 => return Function(.renderscript32).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 114 | //.renderscript64 => return Function(.renderscript64).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 115 | //.ve => return Function(.ve).generate(bin_file, src_loc, func, air, liveness, code, debug_output), | |
| 116 | else => @panic("Backend architectures that don't have good support yet are commented out, to improve compilation performance. If you are interested in one of these other backends feel free to uncomment them. Eventually these will be completed, but stage1 is slow and a memory hog."), | |
| 117 | } | |
| 118 | } | |
| 119 | ||
| 48 | 120 | pub fn generateSymbol( |
| 49 | 121 | bin_file: *link.File, |
| 50 | 122 | src_loc: Module.SrcLoc, |
| ... | ... | @@ -57,60 +129,14 @@ pub fn generateSymbol( |
| 57 | 129 | |
| 58 | 130 | switch (typed_value.ty.zigTypeTag()) { |
| 59 | 131 | .Fn => { |
| 60 | switch (bin_file.options.target.cpu.arch) { | |
| 61 | .wasm32 => unreachable, // has its own code path | |
| 62 | .wasm64 => unreachable, // has its own code path | |
| 63 | .arm => return Function(.arm).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 64 | .armeb => return Function(.armeb).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 65 | .aarch64 => return Function(.aarch64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 66 | .aarch64_be => return Function(.aarch64_be).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 67 | .aarch64_32 => return Function(.aarch64_32).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 68 | //.arc => return Function(.arc).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 69 | //.avr => return Function(.avr).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 70 | //.bpfel => return Function(.bpfel).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 71 | //.bpfeb => return Function(.bpfeb).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 72 | //.hexagon => return Function(.hexagon).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 73 | //.mips => return Function(.mips).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 74 | //.mipsel => return Function(.mipsel).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 75 | //.mips64 => return Function(.mips64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 76 | //.mips64el => return Function(.mips64el).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 77 | //.msp430 => return Function(.msp430).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 78 | //.powerpc => return Function(.powerpc).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 79 | //.powerpc64 => return Function(.powerpc64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 80 | //.powerpc64le => return Function(.powerpc64le).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 81 | //.r600 => return Function(.r600).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 82 | //.amdgcn => return Function(.amdgcn).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 83 | //.riscv32 => return Function(.riscv32).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 84 | .riscv64 => return Function(.riscv64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 85 | //.sparc => return Function(.sparc).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 86 | //.sparcv9 => return Function(.sparcv9).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 87 | //.sparcel => return Function(.sparcel).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 88 | //.s390x => return Function(.s390x).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 89 | //.tce => return Function(.tce).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 90 | //.tcele => return Function(.tcele).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 91 | //.thumb => return Function(.thumb).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 92 | //.thumbeb => return Function(.thumbeb).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 93 | //.i386 => return Function(.i386).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 94 | .x86_64 => return Function(.x86_64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 95 | //.xcore => return Function(.xcore).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 96 | //.nvptx => return Function(.nvptx).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 97 | //.nvptx64 => return Function(.nvptx64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 98 | //.le32 => return Function(.le32).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 99 | //.le64 => return Function(.le64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 100 | //.amdil => return Function(.amdil).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 101 | //.amdil64 => return Function(.amdil64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 102 | //.hsail => return Function(.hsail).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 103 | //.hsail64 => return Function(.hsail64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 104 | //.spir => return Function(.spir).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 105 | //.spir64 => return Function(.spir64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 106 | //.kalimba => return Function(.kalimba).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 107 | //.shave => return Function(.shave).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 108 | //.lanai => return Function(.lanai).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 109 | //.renderscript32 => return Function(.renderscript32).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 110 | //.renderscript64 => return Function(.renderscript64).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 111 | //.ve => return Function(.ve).generateSymbol(bin_file, src_loc, typed_value, code, debug_output), | |
| 112 | else => @panic("Backend architectures that don't have good support yet are commented out, to improve compilation performance. If you are interested in one of these other backends feel free to uncomment them. Eventually these will be completed, but stage1 is slow and a memory hog."), | |
| 113 | } | |
| 132 | return Result{ | |
| 133 | .fail = try ErrorMsg.create( | |
| 134 | bin_file.allocator, | |
| 135 | src_loc, | |
| 136 | "TODO implement generateSymbol function pointers", | |
| 137 | .{}, | |
| 138 | ), | |
| 139 | }; | |
| 114 | 140 | }, |
| 115 | 141 | .Array => { |
| 116 | 142 | // TODO populate .debug_info for the array |
| ... | ... | @@ -262,6 +288,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 262 | 288 | |
| 263 | 289 | return struct { |
| 264 | 290 | gpa: *Allocator, |
| 291 | air: Air, | |
| 292 | liveness: Liveness, | |
| 265 | 293 | bin_file: *link.File, |
| 266 | 294 | target: *const std.Target, |
| 267 | 295 | mod_fn: *const Module.Fn, |
| ... | ... | @@ -297,7 +325,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 297 | 325 | /// across each runtime branch upon joining. |
| 298 | 326 | branch_stack: *std.ArrayList(Branch), |
| 299 | 327 | |
| 300 | blocks: std.AutoHashMapUnmanaged(*ir.Inst.Block, BlockData) = .{}, | |
| 328 | // Key is the block instruction | |
| 329 | blocks: std.AutoHashMapUnmanaged(Air.Inst.Index, BlockData) = .{}, | |
| 301 | 330 | |
| 302 | 331 | register_manager: RegisterManager(Self, Register, &callee_preserved_regs) = .{}, |
| 303 | 332 | /// Maps offset to what is stored there. |
| ... | ... | @@ -309,6 +338,11 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 309 | 338 | /// to place a new stack allocation, it goes here, and then bumps `max_end_stack`. |
| 310 | 339 | next_stack_offset: u32 = 0, |
| 311 | 340 | |
| 341 | /// Debug field, used to find bugs in the compiler. | |
| 342 | air_bookkeeping: @TypeOf(air_bookkeeping_init) = air_bookkeeping_init, | |
| 343 | ||
| 344 | const air_bookkeeping_init = if (std.debug.runtime_safety) @as(usize, 0) else {}; | |
| 345 | ||
| 312 | 346 | const MCValue = union(enum) { |
| 313 | 347 | /// No runtime bits. `void` types, empty structs, u0, enums with 1 tag, etc. |
| 314 | 348 | /// TODO Look into deleting this tag and using `dead` instead, since every use |
| ... | ... | @@ -383,7 +417,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 383 | 417 | }; |
| 384 | 418 | |
| 385 | 419 | const Branch = struct { |
| 386 | inst_table: std.AutoArrayHashMapUnmanaged(*ir.Inst, MCValue) = .{}, | |
| 420 | inst_table: std.AutoArrayHashMapUnmanaged(Air.Inst.Index, MCValue) = .{}, | |
| 387 | 421 | |
| 388 | 422 | fn deinit(self: *Branch, gpa: *Allocator) void { |
| 389 | 423 | self.inst_table.deinit(gpa); |
| ... | ... | @@ -392,7 +426,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 392 | 426 | }; |
| 393 | 427 | |
| 394 | 428 | const StackAllocation = struct { |
| 395 | inst: *ir.Inst, | |
| 429 | inst: Air.Inst.Index, | |
| 396 | 430 | /// TODO do we need size? should be determined by inst.ty.abiSize() |
| 397 | 431 | size: u32, |
| 398 | 432 | }; |
| ... | ... | @@ -418,21 +452,58 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 418 | 452 | }, |
| 419 | 453 | }; |
| 420 | 454 | |
| 455 | const BigTomb = struct { | |
| 456 | function: *Self, | |
| 457 | inst: Air.Inst.Index, | |
| 458 | tomb_bits: Liveness.Bpi, | |
| 459 | big_tomb_bits: u32, | |
| 460 | bit_index: usize, | |
| 461 | ||
| 462 | fn feed(bt: *BigTomb, op_ref: Air.Inst.Ref) void { | |
| 463 | const this_bit_index = bt.bit_index; | |
| 464 | bt.bit_index += 1; | |
| 465 | ||
| 466 | const op_int = @enumToInt(op_ref); | |
| 467 | if (op_int < Air.Inst.Ref.typed_value_map.len) return; | |
| 468 | const op_index = @intCast(Air.Inst.Index, op_int - Air.Inst.Ref.typed_value_map.len); | |
| 469 | ||
| 470 | if (this_bit_index < Liveness.bpi - 1) { | |
| 471 | const dies = @truncate(u1, bt.tomb_bits >> @intCast(Liveness.OperandInt, this_bit_index)) != 0; | |
| 472 | if (!dies) return; | |
| 473 | } else { | |
| 474 | const big_bit_index = @intCast(u5, this_bit_index - (Liveness.bpi - 1)); | |
| 475 | const dies = @truncate(u1, bt.big_tomb_bits >> big_bit_index) != 0; | |
| 476 | if (!dies) return; | |
| 477 | } | |
| 478 | bt.function.processDeath(op_index); | |
| 479 | } | |
| 480 | ||
| 481 | fn finishAir(bt: *BigTomb, result: MCValue) void { | |
| 482 | const is_used = !bt.function.liveness.isUnused(bt.inst); | |
| 483 | if (is_used) { | |
| 484 | log.debug("%{d} => {}", .{ bt.inst, result }); | |
| 485 | const branch = &bt.function.branch_stack.items[bt.function.branch_stack.items.len - 1]; | |
| 486 | branch.inst_table.putAssumeCapacityNoClobber(bt.inst, result); | |
| 487 | } | |
| 488 | bt.function.finishAirBookkeeping(); | |
| 489 | } | |
| 490 | }; | |
| 491 | ||
| 421 | 492 | const Self = @This(); |
| 422 | 493 | |
| 423 | fn generateSymbol( | |
| 494 | fn generate( | |
| 424 | 495 | bin_file: *link.File, |
| 425 | 496 | src_loc: Module.SrcLoc, |
| 426 | typed_value: TypedValue, | |
| 497 | module_fn: *Module.Fn, | |
| 498 | air: Air, | |
| 499 | liveness: Liveness, | |
| 427 | 500 | code: *std.ArrayList(u8), |
| 428 | 501 | debug_output: DebugInfoOutput, |
| 429 | ) GenerateSymbolError!Result { | |
| 502 | ) GenerateSymbolError!FnResult { | |
| 430 | 503 | if (build_options.skip_non_native and std.Target.current.cpu.arch != arch) { |
| 431 | 504 | @panic("Attempted to compile for architecture that was disabled by build configuration"); |
| 432 | 505 | } |
| 433 | 506 | |
| 434 | const module_fn = typed_value.val.castTag(.function).?.data; | |
| 435 | ||
| 436 | 507 | assert(module_fn.owner_decl.has_tv); |
| 437 | 508 | const fn_type = module_fn.owner_decl.ty; |
| 438 | 509 | |
| ... | ... | @@ -446,6 +517,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 446 | 517 | |
| 447 | 518 | var function = Self{ |
| 448 | 519 | .gpa = bin_file.allocator, |
| 520 | .air = air, | |
| 521 | .liveness = liveness, | |
| 449 | 522 | .target = &bin_file.options.target, |
| 450 | 523 | .bin_file = bin_file, |
| 451 | 524 | .mod_fn = module_fn, |
| ... | ... | @@ -469,8 +542,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 469 | 542 | defer function.blocks.deinit(bin_file.allocator); |
| 470 | 543 | defer function.exitlude_jump_relocs.deinit(bin_file.allocator); |
| 471 | 544 | |
| 472 | var call_info = function.resolveCallingConventionValues(src_loc.lazy, fn_type) catch |err| switch (err) { | |
| 473 | error.CodegenFail => return Result{ .fail = function.err_msg.? }, | |
| 545 | var call_info = function.resolveCallingConventionValues(fn_type) catch |err| switch (err) { | |
| 546 | error.CodegenFail => return FnResult{ .fail = function.err_msg.? }, | |
| 474 | 547 | else => |e| return e, |
| 475 | 548 | }; |
| 476 | 549 | defer call_info.deinit(&function); |
| ... | ... | @@ -481,14 +554,14 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 481 | 554 | function.max_end_stack = call_info.stack_byte_count; |
| 482 | 555 | |
| 483 | 556 | function.gen() catch |err| switch (err) { |
| 484 | error.CodegenFail => return Result{ .fail = function.err_msg.? }, | |
| 557 | error.CodegenFail => return FnResult{ .fail = function.err_msg.? }, | |
| 485 | 558 | else => |e| return e, |
| 486 | 559 | }; |
| 487 | 560 | |
| 488 | 561 | if (function.err_msg) |em| { |
| 489 | return Result{ .fail = em }; | |
| 562 | return FnResult{ .fail = em }; | |
| 490 | 563 | } else { |
| 491 | return Result{ .appended = {} }; | |
| 564 | return FnResult{ .appended = {} }; | |
| 492 | 565 | } |
| 493 | 566 | } |
| 494 | 567 | |
| ... | ... | @@ -512,7 +585,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 512 | 585 | self.code.items.len += 4; |
| 513 | 586 | |
| 514 | 587 | try self.dbgSetPrologueEnd(); |
| 515 | try self.genBody(self.mod_fn.body); | |
| 588 | try self.genBody(self.air.getMainBody()); | |
| 516 | 589 | |
| 517 | 590 | const stack_end = self.max_end_stack; |
| 518 | 591 | if (stack_end > math.maxInt(i32)) |
| ... | ... | @@ -553,7 +626,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 553 | 626 | }); |
| 554 | 627 | } else { |
| 555 | 628 | try self.dbgSetPrologueEnd(); |
| 556 | try self.genBody(self.mod_fn.body); | |
| 629 | try self.genBody(self.air.getMainBody()); | |
| 557 | 630 | try self.dbgSetEpilogueBegin(); |
| 558 | 631 | } |
| 559 | 632 | }, |
| ... | ... | @@ -569,7 +642,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 569 | 642 | |
| 570 | 643 | try self.dbgSetPrologueEnd(); |
| 571 | 644 | |
| 572 | try self.genBody(self.mod_fn.body); | |
| 645 | try self.genBody(self.air.getMainBody()); | |
| 573 | 646 | |
| 574 | 647 | // Backpatch push callee saved regs |
| 575 | 648 | var saved_regs = Instruction.RegisterList{ |
| ... | ... | @@ -630,7 +703,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 630 | 703 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.ldm(.al, .sp, true, saved_regs).toU32()); |
| 631 | 704 | } else { |
| 632 | 705 | try self.dbgSetPrologueEnd(); |
| 633 | try self.genBody(self.mod_fn.body); | |
| 706 | try self.genBody(self.air.getMainBody()); | |
| 634 | 707 | try self.dbgSetEpilogueBegin(); |
| 635 | 708 | } |
| 636 | 709 | }, |
| ... | ... | @@ -654,7 +727,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 654 | 727 | |
| 655 | 728 | try self.dbgSetPrologueEnd(); |
| 656 | 729 | |
| 657 | try self.genBody(self.mod_fn.body); | |
| 730 | try self.genBody(self.air.getMainBody()); | |
| 658 | 731 | |
| 659 | 732 | // Backpatch stack offset |
| 660 | 733 | const stack_end = self.max_end_stack; |
| ... | ... | @@ -706,13 +779,13 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 706 | 779 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.ret(null).toU32()); |
| 707 | 780 | } else { |
| 708 | 781 | try self.dbgSetPrologueEnd(); |
| 709 | try self.genBody(self.mod_fn.body); | |
| 782 | try self.genBody(self.air.getMainBody()); | |
| 710 | 783 | try self.dbgSetEpilogueBegin(); |
| 711 | 784 | } |
| 712 | 785 | }, |
| 713 | 786 | else => { |
| 714 | 787 | try self.dbgSetPrologueEnd(); |
| 715 | try self.genBody(self.mod_fn.body); | |
| 788 | try self.genBody(self.air.getMainBody()); | |
| 716 | 789 | try self.dbgSetEpilogueBegin(); |
| 717 | 790 | }, |
| 718 | 791 | } |
| ... | ... | @@ -720,21 +793,87 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 720 | 793 | try self.dbgAdvancePCAndLine(self.end_di_line, self.end_di_column); |
| 721 | 794 | } |
| 722 | 795 | |
| 723 | fn genBody(self: *Self, body: ir.Body) InnerError!void { | |
| 724 | for (body.instructions) |inst| { | |
| 725 | try self.ensureProcessDeathCapacity(@popCount(@TypeOf(inst.deaths), inst.deaths)); | |
| 726 | ||
| 727 | const mcv = try self.genFuncInst(inst); | |
| 728 | if (!inst.isUnused()) { | |
| 729 | log.debug("{*} => {}", .{ inst, mcv }); | |
| 730 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; | |
| 731 | try branch.inst_table.putNoClobber(self.gpa, inst, mcv); | |
| 796 | fn genBody(self: *Self, body: []const Air.Inst.Index) InnerError!void { | |
| 797 | const air_tags = self.air.instructions.items(.tag); | |
| 798 | ||
| 799 | for (body) |inst| { | |
| 800 | const old_air_bookkeeping = self.air_bookkeeping; | |
| 801 | try self.ensureProcessDeathCapacity(Liveness.bpi); | |
| 802 | ||
| 803 | switch (air_tags[inst]) { | |
| 804 | // zig fmt: off | |
| 805 | .add => try self.airAdd(inst), | |
| 806 | .addwrap => try self.airAddWrap(inst), | |
| 807 | .sub => try self.airSub(inst), | |
| 808 | .subwrap => try self.airSubWrap(inst), | |
| 809 | .mul => try self.airMul(inst), | |
| 810 | .mulwrap => try self.airMulWrap(inst), | |
| 811 | .div => try self.airDiv(inst), | |
| 812 | ||
| 813 | .cmp_lt => try self.airCmp(inst, .lt), | |
| 814 | .cmp_lte => try self.airCmp(inst, .lte), | |
| 815 | .cmp_eq => try self.airCmp(inst, .eq), | |
| 816 | .cmp_gte => try self.airCmp(inst, .gte), | |
| 817 | .cmp_gt => try self.airCmp(inst, .gt), | |
| 818 | .cmp_neq => try self.airCmp(inst, .neq), | |
| 819 | ||
| 820 | .bool_and => try self.airBoolOp(inst), | |
| 821 | .bool_or => try self.airBoolOp(inst), | |
| 822 | .bit_and => try self.airBitAnd(inst), | |
| 823 | .bit_or => try self.airBitOr(inst), | |
| 824 | .xor => try self.airXor(inst), | |
| 825 | ||
| 826 | .alloc => try self.airAlloc(inst), | |
| 827 | .arg => try self.airArg(inst), | |
| 828 | .assembly => try self.airAsm(inst), | |
| 829 | .bitcast => try self.airBitCast(inst), | |
| 830 | .block => try self.airBlock(inst), | |
| 831 | .br => try self.airBr(inst), | |
| 832 | .breakpoint => try self.airBreakpoint(), | |
| 833 | .call => try self.airCall(inst), | |
| 834 | .cond_br => try self.airCondBr(inst), | |
| 835 | .dbg_stmt => try self.airDbgStmt(inst), | |
| 836 | .floatcast => try self.airFloatCast(inst), | |
| 837 | .intcast => try self.airIntCast(inst), | |
| 838 | .is_non_null => try self.airIsNonNull(inst), | |
| 839 | .is_non_null_ptr => try self.airIsNonNullPtr(inst), | |
| 840 | .is_null => try self.airIsNull(inst), | |
| 841 | .is_null_ptr => try self.airIsNullPtr(inst), | |
| 842 | .is_non_err => try self.airIsNonErr(inst), | |
| 843 | .is_non_err_ptr => try self.airIsNonErrPtr(inst), | |
| 844 | .is_err => try self.airIsErr(inst), | |
| 845 | .is_err_ptr => try self.airIsErrPtr(inst), | |
| 846 | .load => try self.airLoad(inst), | |
| 847 | .loop => try self.airLoop(inst), | |
| 848 | .not => try self.airNot(inst), | |
| 849 | .ptrtoint => try self.airPtrToInt(inst), | |
| 850 | .ref => try self.airRef(inst), | |
| 851 | .ret => try self.airRet(inst), | |
| 852 | .store => try self.airStore(inst), | |
| 853 | .struct_field_ptr=> try self.airStructFieldPtr(inst), | |
| 854 | .switch_br => try self.airSwitch(inst), | |
| 855 | .varptr => try self.airVarPtr(inst), | |
| 856 | ||
| 857 | .constant => unreachable, // excluded from function bodies | |
| 858 | .const_ty => unreachable, // excluded from function bodies | |
| 859 | .unreach => self.finishAirBookkeeping(), | |
| 860 | ||
| 861 | .optional_payload => try self.airOptionalPayload(inst), | |
| 862 | .optional_payload_ptr => try self.airOptionalPayloadPtr(inst), | |
| 863 | .unwrap_errunion_err => try self.airUnwrapErrErr(inst), | |
| 864 | .unwrap_errunion_payload => try self.airUnwrapErrPayload(inst), | |
| 865 | .unwrap_errunion_err_ptr => try self.airUnwrapErrErrPtr(inst), | |
| 866 | .unwrap_errunion_payload_ptr=> try self.airUnwrapErrPayloadPtr(inst), | |
| 867 | ||
| 868 | .wrap_optional => try self.airWrapOptional(inst), | |
| 869 | .wrap_errunion_payload => try self.airWrapErrUnionPayload(inst), | |
| 870 | .wrap_errunion_err => try self.airWrapErrUnionErr(inst), | |
| 871 | // zig fmt: on | |
| 732 | 872 | } |
| 733 | ||
| 734 | var i: ir.Inst.DeathsBitIndex = 0; | |
| 735 | while (inst.getOperand(i)) |operand| : (i += 1) { | |
| 736 | if (inst.operandDies(i)) | |
| 737 | self.processDeath(operand); | |
| 873 | if (std.debug.runtime_safety) { | |
| 874 | if (self.air_bookkeeping < old_air_bookkeeping + 1) { | |
| 875 | std.debug.panic("in codegen.zig, handling of AIR instruction %{d} ('{}') did not do proper bookkeeping. Look for a missing call to finishAir.", .{ inst, air_tags[inst] }); | |
| 876 | } | |
| 738 | 877 | } |
| 739 | 878 | } |
| 740 | 879 | } |
| ... | ... | @@ -784,8 +923,9 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 784 | 923 | } |
| 785 | 924 | |
| 786 | 925 | /// Asserts there is already capacity to insert into top branch inst_table. |
| 787 | fn processDeath(self: *Self, inst: *ir.Inst) void { | |
| 788 | if (inst.tag == .constant) return; // Constants are immortal. | |
| 926 | fn processDeath(self: *Self, inst: Air.Inst.Index) void { | |
| 927 | const air_tags = self.air.instructions.items(.tag); | |
| 928 | if (air_tags[inst] == .constant) return; // Constants are immortal. | |
| 789 | 929 | // When editing this function, note that the logic must synchronize with `reuseOperand`. |
| 790 | 930 | const prev_value = self.getResolvedInstValue(inst); |
| 791 | 931 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| ... | ... | @@ -799,9 +939,36 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 799 | 939 | } |
| 800 | 940 | } |
| 801 | 941 | |
| 942 | /// Called when there are no operands, and the instruction is always unreferenced. | |
| 943 | fn finishAirBookkeeping(self: *Self) void { | |
| 944 | if (std.debug.runtime_safety) { | |
| 945 | self.air_bookkeeping += 1; | |
| 946 | } | |
| 947 | } | |
| 948 | ||
| 949 | fn finishAir(self: *Self, inst: Air.Inst.Index, result: MCValue, operands: [Liveness.bpi - 1]Air.Inst.Ref) void { | |
| 950 | var tomb_bits = self.liveness.getTombBits(inst); | |
| 951 | for (operands) |op| { | |
| 952 | const dies = @truncate(u1, tomb_bits) != 0; | |
| 953 | tomb_bits >>= 1; | |
| 954 | if (!dies) continue; | |
| 955 | const op_int = @enumToInt(op); | |
| 956 | if (op_int < Air.Inst.Ref.typed_value_map.len) continue; | |
| 957 | const op_index = @intCast(Air.Inst.Index, op_int - Air.Inst.Ref.typed_value_map.len); | |
| 958 | self.processDeath(op_index); | |
| 959 | } | |
| 960 | const is_used = @truncate(u1, tomb_bits) == 0; | |
| 961 | if (is_used) { | |
| 962 | log.debug("%{d} => {}", .{ inst, result }); | |
| 963 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; | |
| 964 | branch.inst_table.putAssumeCapacityNoClobber(inst, result); | |
| 965 | } | |
| 966 | self.finishAirBookkeeping(); | |
| 967 | } | |
| 968 | ||
| 802 | 969 | fn ensureProcessDeathCapacity(self: *Self, additional_count: usize) !void { |
| 803 | 970 | const table = &self.branch_stack.items[self.branch_stack.items.len - 1].inst_table; |
| 804 | try table.ensureCapacity(self.gpa, table.count() + additional_count); | |
| 971 | try table.ensureUnusedCapacity(self.gpa, additional_count); | |
| 805 | 972 | } |
| 806 | 973 | |
| 807 | 974 | /// Adds a Type to the .debug_info at the current position. The bytes will be populated later, |
| ... | ... | @@ -826,74 +993,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 826 | 993 | } |
| 827 | 994 | } |
| 828 | 995 | |
| 829 | fn genFuncInst(self: *Self, inst: *ir.Inst) !MCValue { | |
| 830 | switch (inst.tag) { | |
| 831 | .add => return self.genAdd(inst.castTag(.add).?), | |
| 832 | .addwrap => return self.genAddWrap(inst.castTag(.addwrap).?), | |
| 833 | .alloc => return self.genAlloc(inst.castTag(.alloc).?), | |
| 834 | .arg => return self.genArg(inst.castTag(.arg).?), | |
| 835 | .assembly => return self.genAsm(inst.castTag(.assembly).?), | |
| 836 | .bitcast => return self.genBitCast(inst.castTag(.bitcast).?), | |
| 837 | .bit_and => return self.genBitAnd(inst.castTag(.bit_and).?), | |
| 838 | .bit_or => return self.genBitOr(inst.castTag(.bit_or).?), | |
| 839 | .block => return self.genBlock(inst.castTag(.block).?), | |
| 840 | .br => return self.genBr(inst.castTag(.br).?), | |
| 841 | .br_block_flat => return self.genBrBlockFlat(inst.castTag(.br_block_flat).?), | |
| 842 | .breakpoint => return self.genBreakpoint(inst.src), | |
| 843 | .br_void => return self.genBrVoid(inst.castTag(.br_void).?), | |
| 844 | .bool_and => return self.genBoolOp(inst.castTag(.bool_and).?), | |
| 845 | .bool_or => return self.genBoolOp(inst.castTag(.bool_or).?), | |
| 846 | .call => return self.genCall(inst.castTag(.call).?), | |
| 847 | .cmp_lt => return self.genCmp(inst.castTag(.cmp_lt).?, .lt), | |
| 848 | .cmp_lte => return self.genCmp(inst.castTag(.cmp_lte).?, .lte), | |
| 849 | .cmp_eq => return self.genCmp(inst.castTag(.cmp_eq).?, .eq), | |
| 850 | .cmp_gte => return self.genCmp(inst.castTag(.cmp_gte).?, .gte), | |
| 851 | .cmp_gt => return self.genCmp(inst.castTag(.cmp_gt).?, .gt), | |
| 852 | .cmp_neq => return self.genCmp(inst.castTag(.cmp_neq).?, .neq), | |
| 853 | .condbr => return self.genCondBr(inst.castTag(.condbr).?), | |
| 854 | .constant => unreachable, // excluded from function bodies | |
| 855 | .dbg_stmt => return self.genDbgStmt(inst.castTag(.dbg_stmt).?), | |
| 856 | .floatcast => return self.genFloatCast(inst.castTag(.floatcast).?), | |
| 857 | .intcast => return self.genIntCast(inst.castTag(.intcast).?), | |
| 858 | .is_non_null => return self.genIsNonNull(inst.castTag(.is_non_null).?), | |
| 859 | .is_non_null_ptr => return self.genIsNonNullPtr(inst.castTag(.is_non_null_ptr).?), | |
| 860 | .is_null => return self.genIsNull(inst.castTag(.is_null).?), | |
| 861 | .is_null_ptr => return self.genIsNullPtr(inst.castTag(.is_null_ptr).?), | |
| 862 | .is_non_err => return self.genIsNonErr(inst.castTag(.is_non_err).?), | |
| 863 | .is_non_err_ptr => return self.genIsNonErrPtr(inst.castTag(.is_non_err_ptr).?), | |
| 864 | .is_err => return self.genIsErr(inst.castTag(.is_err).?), | |
| 865 | .is_err_ptr => return self.genIsErrPtr(inst.castTag(.is_err_ptr).?), | |
| 866 | .load => return self.genLoad(inst.castTag(.load).?), | |
| 867 | .loop => return self.genLoop(inst.castTag(.loop).?), | |
| 868 | .not => return self.genNot(inst.castTag(.not).?), | |
| 869 | .mul => return self.genMul(inst.castTag(.mul).?), | |
| 870 | .mulwrap => return self.genMulWrap(inst.castTag(.mulwrap).?), | |
| 871 | .div => return self.genDiv(inst.castTag(.div).?), | |
| 872 | .ptrtoint => return self.genPtrToInt(inst.castTag(.ptrtoint).?), | |
| 873 | .ref => return self.genRef(inst.castTag(.ref).?), | |
| 874 | .ret => return self.genRet(inst.castTag(.ret).?), | |
| 875 | .retvoid => return self.genRetVoid(inst.castTag(.retvoid).?), | |
| 876 | .store => return self.genStore(inst.castTag(.store).?), | |
| 877 | .struct_field_ptr => return self.genStructFieldPtr(inst.castTag(.struct_field_ptr).?), | |
| 878 | .sub => return self.genSub(inst.castTag(.sub).?), | |
| 879 | .subwrap => return self.genSubWrap(inst.castTag(.subwrap).?), | |
| 880 | .switchbr => return self.genSwitch(inst.castTag(.switchbr).?), | |
| 881 | .unreach => return MCValue{ .unreach = {} }, | |
| 882 | .optional_payload => return self.genOptionalPayload(inst.castTag(.optional_payload).?), | |
| 883 | .optional_payload_ptr => return self.genOptionalPayloadPtr(inst.castTag(.optional_payload_ptr).?), | |
| 884 | .unwrap_errunion_err => return self.genUnwrapErrErr(inst.castTag(.unwrap_errunion_err).?), | |
| 885 | .unwrap_errunion_payload => return self.genUnwrapErrPayload(inst.castTag(.unwrap_errunion_payload).?), | |
| 886 | .unwrap_errunion_err_ptr => return self.genUnwrapErrErrPtr(inst.castTag(.unwrap_errunion_err_ptr).?), | |
| 887 | .unwrap_errunion_payload_ptr => return self.genUnwrapErrPayloadPtr(inst.castTag(.unwrap_errunion_payload_ptr).?), | |
| 888 | .wrap_optional => return self.genWrapOptional(inst.castTag(.wrap_optional).?), | |
| 889 | .wrap_errunion_payload => return self.genWrapErrUnionPayload(inst.castTag(.wrap_errunion_payload).?), | |
| 890 | .wrap_errunion_err => return self.genWrapErrUnionErr(inst.castTag(.wrap_errunion_err).?), | |
| 891 | .varptr => return self.genVarPtr(inst.castTag(.varptr).?), | |
| 892 | .xor => return self.genXor(inst.castTag(.xor).?), | |
| 893 | } | |
| 894 | } | |
| 895 | ||
| 896 | fn allocMem(self: *Self, inst: *ir.Inst, abi_size: u32, abi_align: u32) !u32 { | |
| 996 | fn allocMem(self: *Self, inst: Air.Inst.Index, abi_size: u32, abi_align: u32) !u32 { | |
| 897 | 997 | if (abi_align > self.stack_align) |
| 898 | 998 | self.stack_align = abi_align; |
| 899 | 999 | // TODO find a free slot instead of always appending |
| ... | ... | @@ -909,20 +1009,20 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 909 | 1009 | } |
| 910 | 1010 | |
| 911 | 1011 | /// Use a pointer instruction as the basis for allocating stack memory. |
| 912 | fn allocMemPtr(self: *Self, inst: *ir.Inst) !u32 { | |
| 913 | const elem_ty = inst.ty.elemType(); | |
| 1012 | fn allocMemPtr(self: *Self, inst: Air.Inst.Index) !u32 { | |
| 1013 | const elem_ty = self.air.typeOfIndex(inst).elemType(); | |
| 914 | 1014 | const abi_size = math.cast(u32, elem_ty.abiSize(self.target.*)) catch { |
| 915 | return self.fail(inst.src, "type '{}' too big to fit into stack frame", .{elem_ty}); | |
| 1015 | return self.fail("type '{}' too big to fit into stack frame", .{elem_ty}); | |
| 916 | 1016 | }; |
| 917 | 1017 | // TODO swap this for inst.ty.ptrAlign |
| 918 | 1018 | const abi_align = elem_ty.abiAlignment(self.target.*); |
| 919 | 1019 | return self.allocMem(inst, abi_size, abi_align); |
| 920 | 1020 | } |
| 921 | 1021 | |
| 922 | fn allocRegOrMem(self: *Self, inst: *ir.Inst, reg_ok: bool) !MCValue { | |
| 923 | const elem_ty = inst.ty; | |
| 1022 | fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { | |
| 1023 | const elem_ty = self.air.typeOfIndex(inst); | |
| 924 | 1024 | const abi_size = math.cast(u32, elem_ty.abiSize(self.target.*)) catch { |
| 925 | return self.fail(inst.src, "type '{}' too big to fit into stack frame", .{elem_ty}); | |
| 1025 | return self.fail("type '{}' too big to fit into stack frame", .{elem_ty}); | |
| 926 | 1026 | }; |
| 927 | 1027 | const abi_align = elem_ty.abiAlignment(self.target.*); |
| 928 | 1028 | if (abi_align > self.stack_align) |
| ... | ... | @@ -942,310 +1042,299 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 942 | 1042 | return MCValue{ .stack_offset = stack_offset }; |
| 943 | 1043 | } |
| 944 | 1044 | |
| 945 | pub fn spillInstruction(self: *Self, src: LazySrcLoc, reg: Register, inst: *ir.Inst) !void { | |
| 1045 | pub fn spillInstruction(self: *Self, reg: Register, inst: Air.Inst.Index) !void { | |
| 946 | 1046 | const stack_mcv = try self.allocRegOrMem(inst, false); |
| 947 | log.debug("spilling {*} to stack mcv {any}", .{ inst, stack_mcv }); | |
| 1047 | log.debug("spilling {d} to stack mcv {any}", .{ inst, stack_mcv }); | |
| 948 | 1048 | const reg_mcv = self.getResolvedInstValue(inst); |
| 949 | 1049 | assert(reg == toCanonicalReg(reg_mcv.register)); |
| 950 | 1050 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 951 | 1051 | try branch.inst_table.put(self.gpa, inst, stack_mcv); |
| 952 | try self.genSetStack(src, inst.ty, stack_mcv.stack_offset, reg_mcv); | |
| 1052 | try self.genSetStack(self.air.typeOfIndex(inst), stack_mcv.stack_offset, reg_mcv); | |
| 953 | 1053 | } |
| 954 | 1054 | |
| 955 | 1055 | /// Copies a value to a register without tracking the register. The register is not considered |
| 956 | 1056 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 957 | 1057 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 958 | fn copyToTmpRegister(self: *Self, src: LazySrcLoc, ty: Type, mcv: MCValue) !Register { | |
| 1058 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { | |
| 959 | 1059 | const reg = try self.register_manager.allocReg(null, &.{}); |
| 960 | try self.genSetReg(src, ty, reg, mcv); | |
| 1060 | try self.genSetReg(ty, reg, mcv); | |
| 961 | 1061 | return reg; |
| 962 | 1062 | } |
| 963 | 1063 | |
| 964 | 1064 | /// Allocates a new register and copies `mcv` into it. |
| 965 | 1065 | /// `reg_owner` is the instruction that gets associated with the register in the register table. |
| 966 | 1066 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 967 | fn copyToNewRegister(self: *Self, reg_owner: *ir.Inst, mcv: MCValue) !MCValue { | |
| 1067 | fn copyToNewRegister(self: *Self, reg_owner: Air.Inst.Index, mcv: MCValue) !MCValue { | |
| 968 | 1068 | const reg = try self.register_manager.allocReg(reg_owner, &.{}); |
| 969 | try self.genSetReg(reg_owner.src, reg_owner.ty, reg, mcv); | |
| 1069 | try self.genSetReg(self.air.typeOfIndex(reg_owner), reg, mcv); | |
| 970 | 1070 | return MCValue{ .register = reg }; |
| 971 | 1071 | } |
| 972 | 1072 | |
| 973 | fn genAlloc(self: *Self, inst: *ir.Inst.NoOp) !MCValue { | |
| 974 | const stack_offset = try self.allocMemPtr(&inst.base); | |
| 975 | return MCValue{ .ptr_stack_offset = stack_offset }; | |
| 1073 | fn airAlloc(self: *Self, inst: Air.Inst.Index) !void { | |
| 1074 | const stack_offset = try self.allocMemPtr(inst); | |
| 1075 | return self.finishAir(inst, .{ .ptr_stack_offset = stack_offset }, .{ .none, .none, .none }); | |
| 976 | 1076 | } |
| 977 | 1077 | |
| 978 | fn genFloatCast(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 979 | // No side effects, so if it's unreferenced, do nothing. | |
| 980 | if (inst.base.isUnused()) | |
| 981 | return MCValue.dead; | |
| 982 | switch (arch) { | |
| 983 | else => return self.fail(inst.base.src, "TODO implement floatCast for {}", .{self.target.cpu.arch}), | |
| 984 | } | |
| 1078 | fn airFloatCast(self: *Self, inst: Air.Inst.Index) !void { | |
| 1079 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1080 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1081 | else => return self.fail("TODO implement floatCast for {}", .{self.target.cpu.arch}), | |
| 1082 | }; | |
| 1083 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 985 | 1084 | } |
| 986 | 1085 | |
| 987 | fn genIntCast(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 988 | // No side effects, so if it's unreferenced, do nothing. | |
| 989 | if (inst.base.isUnused()) | |
| 990 | return MCValue.dead; | |
| 1086 | fn airIntCast(self: *Self, inst: Air.Inst.Index) !void { | |
| 1087 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1088 | if (self.liveness.isUnused(inst)) | |
| 1089 | return self.finishAir(inst, .dead, .{ ty_op.operand, .none, .none }); | |
| 991 | 1090 | |
| 992 | const operand = try self.resolveInst(inst.operand); | |
| 993 | const info_a = inst.operand.ty.intInfo(self.target.*); | |
| 994 | const info_b = inst.base.ty.intInfo(self.target.*); | |
| 1091 | const operand_ty = self.air.typeOf(ty_op.operand); | |
| 1092 | const operand = try self.resolveInst(ty_op.operand); | |
| 1093 | const info_a = operand_ty.intInfo(self.target.*); | |
| 1094 | const info_b = self.air.typeOfIndex(inst).intInfo(self.target.*); | |
| 995 | 1095 | if (info_a.signedness != info_b.signedness) |
| 996 | return self.fail(inst.base.src, "TODO gen intcast sign safety in semantic analysis", .{}); | |
| 1096 | return self.fail("TODO gen intcast sign safety in semantic analysis", .{}); | |
| 997 | 1097 | |
| 998 | 1098 | if (info_a.bits == info_b.bits) |
| 999 | return operand; | |
| 1099 | return self.finishAir(inst, operand, .{ ty_op.operand, .none, .none }); | |
| 1000 | 1100 | |
| 1001 | switch (arch) { | |
| 1002 | else => return self.fail(inst.base.src, "TODO implement intCast for {}", .{self.target.cpu.arch}), | |
| 1003 | } | |
| 1101 | const result: MCValue = switch (arch) { | |
| 1102 | else => return self.fail("TODO implement intCast for {}", .{self.target.cpu.arch}), | |
| 1103 | }; | |
| 1104 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1004 | 1105 | } |
| 1005 | 1106 | |
| 1006 | fn genNot(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1007 | // No side effects, so if it's unreferenced, do nothing. | |
| 1008 | if (inst.base.isUnused()) | |
| 1009 | return MCValue.dead; | |
| 1010 | const operand = try self.resolveInst(inst.operand); | |
| 1011 | switch (operand) { | |
| 1012 | .dead => unreachable, | |
| 1013 | .unreach => unreachable, | |
| 1014 | .compare_flags_unsigned => |op| return MCValue{ | |
| 1015 | .compare_flags_unsigned = switch (op) { | |
| 1016 | .gte => .lt, | |
| 1017 | .gt => .lte, | |
| 1018 | .neq => .eq, | |
| 1019 | .lt => .gte, | |
| 1020 | .lte => .gt, | |
| 1021 | .eq => .neq, | |
| 1107 | fn airNot(self: *Self, inst: Air.Inst.Index) !void { | |
| 1108 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1109 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 1110 | const operand = try self.resolveInst(ty_op.operand); | |
| 1111 | switch (operand) { | |
| 1112 | .dead => unreachable, | |
| 1113 | .unreach => unreachable, | |
| 1114 | .compare_flags_unsigned => |op| { | |
| 1115 | const r = MCValue{ | |
| 1116 | .compare_flags_unsigned = switch (op) { | |
| 1117 | .gte => .lt, | |
| 1118 | .gt => .lte, | |
| 1119 | .neq => .eq, | |
| 1120 | .lt => .gte, | |
| 1121 | .lte => .gt, | |
| 1122 | .eq => .neq, | |
| 1123 | }, | |
| 1124 | }; | |
| 1125 | break :result r; | |
| 1022 | 1126 | }, |
| 1023 | }, | |
| 1024 | .compare_flags_signed => |op| return MCValue{ | |
| 1025 | .compare_flags_signed = switch (op) { | |
| 1026 | .gte => .lt, | |
| 1027 | .gt => .lte, | |
| 1028 | .neq => .eq, | |
| 1029 | .lt => .gte, | |
| 1030 | .lte => .gt, | |
| 1031 | .eq => .neq, | |
| 1127 | .compare_flags_signed => |op| { | |
| 1128 | const r = MCValue{ | |
| 1129 | .compare_flags_signed = switch (op) { | |
| 1130 | .gte => .lt, | |
| 1131 | .gt => .lte, | |
| 1132 | .neq => .eq, | |
| 1133 | .lt => .gte, | |
| 1134 | .lte => .gt, | |
| 1135 | .eq => .neq, | |
| 1136 | }, | |
| 1137 | }; | |
| 1138 | break :result r; | |
| 1032 | 1139 | }, |
| 1033 | }, | |
| 1034 | else => {}, | |
| 1035 | } | |
| 1140 | else => {}, | |
| 1141 | } | |
| 1036 | 1142 | |
| 1037 | switch (arch) { | |
| 1038 | .x86_64 => { | |
| 1039 | var imm = ir.Inst.Constant{ | |
| 1040 | .base = .{ | |
| 1041 | .tag = .constant, | |
| 1042 | .deaths = 0, | |
| 1043 | .ty = inst.operand.ty, | |
| 1044 | .src = inst.operand.src, | |
| 1045 | }, | |
| 1046 | .val = Value.initTag(.bool_true), | |
| 1047 | }; | |
| 1048 | return try self.genX8664BinMath(&inst.base, inst.operand, &imm.base); | |
| 1049 | }, | |
| 1050 | .arm, .armeb => { | |
| 1051 | var imm = ir.Inst.Constant{ | |
| 1052 | .base = .{ | |
| 1053 | .tag = .constant, | |
| 1054 | .deaths = 0, | |
| 1055 | .ty = inst.operand.ty, | |
| 1056 | .src = inst.operand.src, | |
| 1057 | }, | |
| 1058 | .val = Value.initTag(.bool_true), | |
| 1059 | }; | |
| 1060 | return try self.genArmBinOp(&inst.base, inst.operand, &imm.base, .not); | |
| 1061 | }, | |
| 1062 | else => return self.fail(inst.base.src, "TODO implement NOT for {}", .{self.target.cpu.arch}), | |
| 1063 | } | |
| 1143 | switch (arch) { | |
| 1144 | .x86_64 => { | |
| 1145 | break :result try self.genX8664BinMath(inst, ty_op.operand, .bool_true); | |
| 1146 | }, | |
| 1147 | .arm, .armeb => { | |
| 1148 | break :result try self.genArmBinOp(inst, ty_op.operand, .bool_true, .not); | |
| 1149 | }, | |
| 1150 | else => return self.fail("TODO implement NOT for {}", .{self.target.cpu.arch}), | |
| 1151 | } | |
| 1152 | }; | |
| 1153 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1064 | 1154 | } |
| 1065 | 1155 | |
| 1066 | fn genAdd(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1067 | // No side effects, so if it's unreferenced, do nothing. | |
| 1068 | if (inst.base.isUnused()) | |
| 1069 | return MCValue.dead; | |
| 1070 | switch (arch) { | |
| 1071 | .x86_64 => { | |
| 1072 | return try self.genX8664BinMath(&inst.base, inst.lhs, inst.rhs); | |
| 1073 | }, | |
| 1074 | .arm, .armeb => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .add), | |
| 1075 | else => return self.fail(inst.base.src, "TODO implement add for {}", .{self.target.cpu.arch}), | |
| 1076 | } | |
| 1156 | fn airAdd(self: *Self, inst: Air.Inst.Index) !void { | |
| 1157 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1158 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1159 | .x86_64 => try self.genX8664BinMath(inst, bin_op.lhs, bin_op.rhs), | |
| 1160 | .arm, .armeb => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .add), | |
| 1161 | else => return self.fail("TODO implement add for {}", .{self.target.cpu.arch}), | |
| 1162 | }; | |
| 1163 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1077 | 1164 | } |
| 1078 | 1165 | |
| 1079 | fn genAddWrap(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1080 | // No side effects, so if it's unreferenced, do nothing. | |
| 1081 | if (inst.base.isUnused()) | |
| 1082 | return MCValue.dead; | |
| 1083 | switch (arch) { | |
| 1084 | else => return self.fail(inst.base.src, "TODO implement addwrap for {}", .{self.target.cpu.arch}), | |
| 1085 | } | |
| 1166 | fn airAddWrap(self: *Self, inst: Air.Inst.Index) !void { | |
| 1167 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1168 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1169 | else => return self.fail("TODO implement addwrap for {}", .{self.target.cpu.arch}), | |
| 1170 | }; | |
| 1171 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1086 | 1172 | } |
| 1087 | 1173 | |
| 1088 | fn genMul(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1089 | // No side effects, so if it's unreferenced, do nothing. | |
| 1090 | if (inst.base.isUnused()) | |
| 1091 | return MCValue.dead; | |
| 1092 | switch (arch) { | |
| 1093 | .x86_64 => return try self.genX8664BinMath(&inst.base, inst.lhs, inst.rhs), | |
| 1094 | .arm, .armeb => return try self.genArmMul(&inst.base, inst.lhs, inst.rhs), | |
| 1095 | else => return self.fail(inst.base.src, "TODO implement mul for {}", .{self.target.cpu.arch}), | |
| 1096 | } | |
| 1174 | fn airSub(self: *Self, inst: Air.Inst.Index) !void { | |
| 1175 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1176 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1177 | .x86_64 => try self.genX8664BinMath(inst, bin_op.lhs, bin_op.rhs), | |
| 1178 | .arm, .armeb => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .sub), | |
| 1179 | else => return self.fail("TODO implement sub for {}", .{self.target.cpu.arch}), | |
| 1180 | }; | |
| 1181 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1097 | 1182 | } |
| 1098 | 1183 | |
| 1099 | fn genMulWrap(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1100 | // No side effects, so if it's unreferenced, do nothing. | |
| 1101 | if (inst.base.isUnused()) | |
| 1102 | return MCValue.dead; | |
| 1103 | switch (arch) { | |
| 1104 | else => return self.fail(inst.base.src, "TODO implement mulwrap for {}", .{self.target.cpu.arch}), | |
| 1105 | } | |
| 1184 | fn airSubWrap(self: *Self, inst: Air.Inst.Index) !void { | |
| 1185 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1186 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1187 | else => return self.fail("TODO implement subwrap for {}", .{self.target.cpu.arch}), | |
| 1188 | }; | |
| 1189 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1106 | 1190 | } |
| 1107 | 1191 | |
| 1108 | fn genDiv(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1109 | // No side effects, so if it's unreferenced, do nothing. | |
| 1110 | if (inst.base.isUnused()) | |
| 1111 | return MCValue.dead; | |
| 1112 | switch (arch) { | |
| 1113 | else => return self.fail(inst.base.src, "TODO implement div for {}", .{self.target.cpu.arch}), | |
| 1114 | } | |
| 1192 | fn airMul(self: *Self, inst: Air.Inst.Index) !void { | |
| 1193 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1194 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1195 | .x86_64 => try self.genX8664BinMath(inst, bin_op.lhs, bin_op.rhs), | |
| 1196 | .arm, .armeb => try self.genArmMul(inst, bin_op.lhs, bin_op.rhs), | |
| 1197 | else => return self.fail("TODO implement mul for {}", .{self.target.cpu.arch}), | |
| 1198 | }; | |
| 1199 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1115 | 1200 | } |
| 1116 | 1201 | |
| 1117 | fn genBitAnd(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1118 | // No side effects, so if it's unreferenced, do nothing. | |
| 1119 | if (inst.base.isUnused()) | |
| 1120 | return MCValue.dead; | |
| 1121 | switch (arch) { | |
| 1122 | .arm, .armeb => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .bit_and), | |
| 1123 | else => return self.fail(inst.base.src, "TODO implement bitwise and for {}", .{self.target.cpu.arch}), | |
| 1124 | } | |
| 1202 | fn airMulWrap(self: *Self, inst: Air.Inst.Index) !void { | |
| 1203 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1204 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1205 | else => return self.fail("TODO implement mulwrap for {}", .{self.target.cpu.arch}), | |
| 1206 | }; | |
| 1207 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1125 | 1208 | } |
| 1126 | 1209 | |
| 1127 | fn genBitOr(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1128 | // No side effects, so if it's unreferenced, do nothing. | |
| 1129 | if (inst.base.isUnused()) | |
| 1130 | return MCValue.dead; | |
| 1131 | switch (arch) { | |
| 1132 | .arm, .armeb => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .bit_or), | |
| 1133 | else => return self.fail(inst.base.src, "TODO implement bitwise or for {}", .{self.target.cpu.arch}), | |
| 1134 | } | |
| 1210 | fn airDiv(self: *Self, inst: Air.Inst.Index) !void { | |
| 1211 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1212 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1213 | else => return self.fail("TODO implement div for {}", .{self.target.cpu.arch}), | |
| 1214 | }; | |
| 1215 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1135 | 1216 | } |
| 1136 | 1217 | |
| 1137 | fn genXor(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1138 | // No side effects, so if it's unreferenced, do nothing. | |
| 1139 | if (inst.base.isUnused()) | |
| 1140 | return MCValue.dead; | |
| 1141 | switch (arch) { | |
| 1142 | .arm, .armeb => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .xor), | |
| 1143 | else => return self.fail(inst.base.src, "TODO implement xor for {}", .{self.target.cpu.arch}), | |
| 1144 | } | |
| 1218 | fn airBitAnd(self: *Self, inst: Air.Inst.Index) !void { | |
| 1219 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1220 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1221 | .arm, .armeb => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .bit_and), | |
| 1222 | else => return self.fail("TODO implement bitwise and for {}", .{self.target.cpu.arch}), | |
| 1223 | }; | |
| 1224 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1145 | 1225 | } |
| 1146 | 1226 | |
| 1147 | fn genOptionalPayload(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1148 | // No side effects, so if it's unreferenced, do nothing. | |
| 1149 | if (inst.base.isUnused()) | |
| 1150 | return MCValue.dead; | |
| 1151 | switch (arch) { | |
| 1152 | else => return self.fail(inst.base.src, "TODO implement .optional_payload for {}", .{self.target.cpu.arch}), | |
| 1153 | } | |
| 1227 | fn airBitOr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1228 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1229 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1230 | .arm, .armeb => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .bit_or), | |
| 1231 | else => return self.fail("TODO implement bitwise or for {}", .{self.target.cpu.arch}), | |
| 1232 | }; | |
| 1233 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1154 | 1234 | } |
| 1155 | 1235 | |
| 1156 | fn genOptionalPayloadPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1157 | // No side effects, so if it's unreferenced, do nothing. | |
| 1158 | if (inst.base.isUnused()) | |
| 1159 | return MCValue.dead; | |
| 1160 | switch (arch) { | |
| 1161 | else => return self.fail(inst.base.src, "TODO implement .optional_payload_ptr for {}", .{self.target.cpu.arch}), | |
| 1162 | } | |
| 1236 | fn airXor(self: *Self, inst: Air.Inst.Index) !void { | |
| 1237 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1238 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1239 | .arm, .armeb => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .xor), | |
| 1240 | else => return self.fail("TODO implement xor for {}", .{self.target.cpu.arch}), | |
| 1241 | }; | |
| 1242 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1163 | 1243 | } |
| 1164 | 1244 | |
| 1165 | fn genUnwrapErrErr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1166 | // No side effects, so if it's unreferenced, do nothing. | |
| 1167 | if (inst.base.isUnused()) | |
| 1168 | return MCValue.dead; | |
| 1169 | switch (arch) { | |
| 1170 | else => return self.fail(inst.base.src, "TODO implement unwrap error union error for {}", .{self.target.cpu.arch}), | |
| 1171 | } | |
| 1245 | fn airOptionalPayload(self: *Self, inst: Air.Inst.Index) !void { | |
| 1246 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1247 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1248 | else => return self.fail("TODO implement .optional_payload for {}", .{self.target.cpu.arch}), | |
| 1249 | }; | |
| 1250 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1172 | 1251 | } |
| 1173 | 1252 | |
| 1174 | fn genUnwrapErrPayload(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1175 | // No side effects, so if it's unreferenced, do nothing. | |
| 1176 | if (inst.base.isUnused()) | |
| 1177 | return MCValue.dead; | |
| 1178 | switch (arch) { | |
| 1179 | else => return self.fail(inst.base.src, "TODO implement unwrap error union payload for {}", .{self.target.cpu.arch}), | |
| 1180 | } | |
| 1253 | fn airOptionalPayloadPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1254 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1255 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1256 | else => return self.fail("TODO implement .optional_payload_ptr for {}", .{self.target.cpu.arch}), | |
| 1257 | }; | |
| 1258 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1259 | } | |
| 1260 | ||
| 1261 | fn airUnwrapErrErr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1262 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1263 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1264 | else => return self.fail("TODO implement unwrap error union error for {}", .{self.target.cpu.arch}), | |
| 1265 | }; | |
| 1266 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1181 | 1267 | } |
| 1268 | ||
| 1269 | fn airUnwrapErrPayload(self: *Self, inst: Air.Inst.Index) !void { | |
| 1270 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1271 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1272 | else => return self.fail("TODO implement unwrap error union payload for {}", .{self.target.cpu.arch}), | |
| 1273 | }; | |
| 1274 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1275 | } | |
| 1276 | ||
| 1182 | 1277 | // *(E!T) -> E |
| 1183 | fn genUnwrapErrErrPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1184 | // No side effects, so if it's unreferenced, do nothing. | |
| 1185 | if (inst.base.isUnused()) | |
| 1186 | return MCValue.dead; | |
| 1187 | switch (arch) { | |
| 1188 | else => return self.fail(inst.base.src, "TODO implement unwrap error union error ptr for {}", .{self.target.cpu.arch}), | |
| 1189 | } | |
| 1278 | fn airUnwrapErrErrPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1279 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1280 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1281 | else => return self.fail("TODO implement unwrap error union error ptr for {}", .{self.target.cpu.arch}), | |
| 1282 | }; | |
| 1283 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1190 | 1284 | } |
| 1285 | ||
| 1191 | 1286 | // *(E!T) -> *T |
| 1192 | fn genUnwrapErrPayloadPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1193 | // No side effects, so if it's unreferenced, do nothing. | |
| 1194 | if (inst.base.isUnused()) | |
| 1195 | return MCValue.dead; | |
| 1196 | switch (arch) { | |
| 1197 | else => return self.fail(inst.base.src, "TODO implement unwrap error union payload ptr for {}", .{self.target.cpu.arch}), | |
| 1198 | } | |
| 1287 | fn airUnwrapErrPayloadPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1288 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1289 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1290 | else => return self.fail("TODO implement unwrap error union payload ptr for {}", .{self.target.cpu.arch}), | |
| 1291 | }; | |
| 1292 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1199 | 1293 | } |
| 1200 | fn genWrapOptional(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1201 | const optional_ty = inst.base.ty; | |
| 1202 | 1294 | |
| 1203 | // No side effects, so if it's unreferenced, do nothing. | |
| 1204 | if (inst.base.isUnused()) | |
| 1205 | return MCValue.dead; | |
| 1295 | fn airWrapOptional(self: *Self, inst: Air.Inst.Index) !void { | |
| 1296 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1297 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 1298 | const optional_ty = self.air.typeOfIndex(inst); | |
| 1206 | 1299 | |
| 1207 | // Optional type is just a boolean true | |
| 1208 | if (optional_ty.abiSize(self.target.*) == 1) | |
| 1209 | return MCValue{ .immediate = 1 }; | |
| 1300 | // Optional with a zero-bit payload type is just a boolean true | |
| 1301 | if (optional_ty.abiSize(self.target.*) == 1) | |
| 1302 | break :result MCValue{ .immediate = 1 }; | |
| 1210 | 1303 | |
| 1211 | switch (arch) { | |
| 1212 | else => return self.fail(inst.base.src, "TODO implement wrap optional for {}", .{self.target.cpu.arch}), | |
| 1213 | } | |
| 1304 | switch (arch) { | |
| 1305 | else => return self.fail("TODO implement wrap optional for {}", .{self.target.cpu.arch}), | |
| 1306 | } | |
| 1307 | }; | |
| 1308 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1214 | 1309 | } |
| 1215 | 1310 | |
| 1216 | 1311 | /// T to E!T |
| 1217 | fn genWrapErrUnionPayload(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1218 | // No side effects, so if it's unreferenced, do nothing. | |
| 1219 | if (inst.base.isUnused()) | |
| 1220 | return MCValue.dead; | |
| 1221 | ||
| 1222 | switch (arch) { | |
| 1223 | else => return self.fail(inst.base.src, "TODO implement wrap errunion payload for {}", .{self.target.cpu.arch}), | |
| 1224 | } | |
| 1312 | fn airWrapErrUnionPayload(self: *Self, inst: Air.Inst.Index) !void { | |
| 1313 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1314 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1315 | else => return self.fail("TODO implement wrap errunion payload for {}", .{self.target.cpu.arch}), | |
| 1316 | }; | |
| 1317 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1225 | 1318 | } |
| 1226 | 1319 | |
| 1227 | 1320 | /// E to E!T |
| 1228 | fn genWrapErrUnionErr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1229 | // No side effects, so if it's unreferenced, do nothing. | |
| 1230 | if (inst.base.isUnused()) | |
| 1231 | return MCValue.dead; | |
| 1232 | ||
| 1233 | switch (arch) { | |
| 1234 | else => return self.fail(inst.base.src, "TODO implement wrap errunion error for {}", .{self.target.cpu.arch}), | |
| 1235 | } | |
| 1321 | fn airWrapErrUnionErr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1322 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1323 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1324 | else => return self.fail("TODO implement wrap errunion error for {}", .{self.target.cpu.arch}), | |
| 1325 | }; | |
| 1326 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1236 | 1327 | } |
| 1237 | fn genVarPtr(self: *Self, inst: *ir.Inst.VarPtr) !MCValue { | |
| 1238 | // No side effects, so if it's unreferenced, do nothing. | |
| 1239 | if (inst.base.isUnused()) | |
| 1240 | return MCValue.dead; | |
| 1241 | 1328 | |
| 1242 | switch (arch) { | |
| 1243 | else => return self.fail(inst.base.src, "TODO implement varptr for {}", .{self.target.cpu.arch}), | |
| 1244 | } | |
| 1329 | fn airVarPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1330 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 1331 | else => return self.fail("TODO implement varptr for {}", .{self.target.cpu.arch}), | |
| 1332 | }; | |
| 1333 | return self.finishAir(inst, result, .{ .none, .none, .none }); | |
| 1245 | 1334 | } |
| 1246 | 1335 | |
| 1247 | fn reuseOperand(self: *Self, inst: *ir.Inst, op_index: ir.Inst.DeathsBitIndex, mcv: MCValue) bool { | |
| 1248 | if (!inst.operandDies(op_index)) | |
| 1336 | fn reuseOperand(self: *Self, inst: Air.Inst.Index, operand: Air.Inst.Ref, op_index: Liveness.OperandInt, mcv: MCValue) bool { | |
| 1337 | if (!self.liveness.operandDies(inst, op_index)) | |
| 1249 | 1338 | return false; |
| 1250 | 1339 | |
| 1251 | 1340 | switch (mcv) { |
| ... | ... | @@ -1257,40 +1346,26 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1257 | 1346 | self.register_manager.registers[index] = inst; |
| 1258 | 1347 | } |
| 1259 | 1348 | } |
| 1260 | log.debug("reusing {} => {*}", .{ reg, inst }); | |
| 1349 | log.debug("%{d} => {} (reused)", .{ inst, reg }); | |
| 1261 | 1350 | }, |
| 1262 | 1351 | .stack_offset => |off| { |
| 1263 | log.debug("reusing stack offset {} => {*}", .{ off, inst }); | |
| 1352 | log.debug("%{d} => stack offset {d} (reused)", .{ inst, off }); | |
| 1264 | 1353 | }, |
| 1265 | 1354 | else => return false, |
| 1266 | 1355 | } |
| 1267 | 1356 | |
| 1268 | 1357 | // Prevent the operand deaths processing code from deallocating it. |
| 1269 | inst.clearOperandDeath(op_index); | |
| 1358 | self.liveness.clearOperandDeath(inst, op_index); | |
| 1270 | 1359 | |
| 1271 | 1360 | // That makes us responsible for doing the rest of the stuff that processDeath would have done. |
| 1272 | 1361 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 1273 | branch.inst_table.putAssumeCapacity(inst.getOperand(op_index).?, .dead); | |
| 1362 | branch.inst_table.putAssumeCapacity(Air.refToIndex(operand).?, .dead); | |
| 1274 | 1363 | |
| 1275 | 1364 | return true; |
| 1276 | 1365 | } |
| 1277 | 1366 | |
| 1278 | fn genLoad(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 1279 | const elem_ty = inst.base.ty; | |
| 1280 | if (!elem_ty.hasCodeGenBits()) | |
| 1281 | return MCValue.none; | |
| 1282 | const ptr = try self.resolveInst(inst.operand); | |
| 1283 | const is_volatile = inst.operand.ty.isVolatilePtr(); | |
| 1284 | if (inst.base.isUnused() and !is_volatile) | |
| 1285 | return MCValue.dead; | |
| 1286 | const dst_mcv: MCValue = blk: { | |
| 1287 | if (self.reuseOperand(&inst.base, 0, ptr)) { | |
| 1288 | // The MCValue that holds the pointer can be re-used as the value. | |
| 1289 | break :blk ptr; | |
| 1290 | } else { | |
| 1291 | break :blk try self.allocRegOrMem(&inst.base, true); | |
| 1292 | } | |
| 1293 | }; | |
| 1367 | fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) !void { | |
| 1368 | const elem_ty = ptr_ty.elemType(); | |
| 1294 | 1369 | switch (ptr) { |
| 1295 | 1370 | .none => unreachable, |
| 1296 | 1371 | .undef => unreachable, |
| ... | ... | @@ -1298,31 +1373,57 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1298 | 1373 | .dead => unreachable, |
| 1299 | 1374 | .compare_flags_unsigned => unreachable, |
| 1300 | 1375 | .compare_flags_signed => unreachable, |
| 1301 | .immediate => |imm| try self.setRegOrMem(inst.base.src, elem_ty, dst_mcv, .{ .memory = imm }), | |
| 1302 | .ptr_stack_offset => |off| try self.setRegOrMem(inst.base.src, elem_ty, dst_mcv, .{ .stack_offset = off }), | |
| 1376 | .immediate => |imm| try self.setRegOrMem(elem_ty, dst_mcv, .{ .memory = imm }), | |
| 1377 | .ptr_stack_offset => |off| try self.setRegOrMem(elem_ty, dst_mcv, .{ .stack_offset = off }), | |
| 1303 | 1378 | .ptr_embedded_in_code => |off| { |
| 1304 | try self.setRegOrMem(inst.base.src, elem_ty, dst_mcv, .{ .embedded_in_code = off }); | |
| 1379 | try self.setRegOrMem(elem_ty, dst_mcv, .{ .embedded_in_code = off }); | |
| 1305 | 1380 | }, |
| 1306 | 1381 | .embedded_in_code => { |
| 1307 | return self.fail(inst.base.src, "TODO implement loading from MCValue.embedded_in_code", .{}); | |
| 1382 | return self.fail("TODO implement loading from MCValue.embedded_in_code", .{}); | |
| 1308 | 1383 | }, |
| 1309 | 1384 | .register => { |
| 1310 | return self.fail(inst.base.src, "TODO implement loading from MCValue.register", .{}); | |
| 1385 | return self.fail("TODO implement loading from MCValue.register", .{}); | |
| 1311 | 1386 | }, |
| 1312 | 1387 | .memory => { |
| 1313 | return self.fail(inst.base.src, "TODO implement loading from MCValue.memory", .{}); | |
| 1388 | return self.fail("TODO implement loading from MCValue.memory", .{}); | |
| 1314 | 1389 | }, |
| 1315 | 1390 | .stack_offset => { |
| 1316 | return self.fail(inst.base.src, "TODO implement loading from MCValue.stack_offset", .{}); | |
| 1391 | return self.fail("TODO implement loading from MCValue.stack_offset", .{}); | |
| 1317 | 1392 | }, |
| 1318 | 1393 | } |
| 1319 | return dst_mcv; | |
| 1320 | 1394 | } |
| 1321 | 1395 | |
| 1322 | fn genStore(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1323 | const ptr = try self.resolveInst(inst.lhs); | |
| 1324 | const value = try self.resolveInst(inst.rhs); | |
| 1325 | const elem_ty = inst.rhs.ty; | |
| 1396 | fn airLoad(self: *Self, inst: Air.Inst.Index) !void { | |
| 1397 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1398 | const elem_ty = self.air.typeOfIndex(inst); | |
| 1399 | const result: MCValue = result: { | |
| 1400 | if (!elem_ty.hasCodeGenBits()) | |
| 1401 | break :result MCValue.none; | |
| 1402 | ||
| 1403 | const ptr = try self.resolveInst(ty_op.operand); | |
| 1404 | const is_volatile = self.air.typeOf(ty_op.operand).isVolatilePtr(); | |
| 1405 | if (self.liveness.isUnused(inst) and !is_volatile) | |
| 1406 | break :result MCValue.dead; | |
| 1407 | ||
| 1408 | const dst_mcv: MCValue = blk: { | |
| 1409 | if (self.reuseOperand(inst, ty_op.operand, 0, ptr)) { | |
| 1410 | // The MCValue that holds the pointer can be re-used as the value. | |
| 1411 | break :blk ptr; | |
| 1412 | } else { | |
| 1413 | break :blk try self.allocRegOrMem(inst, true); | |
| 1414 | } | |
| 1415 | }; | |
| 1416 | try self.load(dst_mcv, ptr, self.air.typeOf(ty_op.operand)); | |
| 1417 | break :result dst_mcv; | |
| 1418 | }; | |
| 1419 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 1420 | } | |
| 1421 | ||
| 1422 | fn airStore(self: *Self, inst: Air.Inst.Index) !void { | |
| 1423 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1424 | const ptr = try self.resolveInst(bin_op.lhs); | |
| 1425 | const value = try self.resolveInst(bin_op.rhs); | |
| 1426 | const elem_ty = self.air.typeOf(bin_op.rhs); | |
| 1326 | 1427 | switch (ptr) { |
| 1327 | 1428 | .none => unreachable, |
| 1328 | 1429 | .undef => unreachable, |
| ... | ... | @@ -1331,57 +1432,39 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1331 | 1432 | .compare_flags_unsigned => unreachable, |
| 1332 | 1433 | .compare_flags_signed => unreachable, |
| 1333 | 1434 | .immediate => |imm| { |
| 1334 | try self.setRegOrMem(inst.base.src, elem_ty, .{ .memory = imm }, value); | |
| 1435 | try self.setRegOrMem(elem_ty, .{ .memory = imm }, value); | |
| 1335 | 1436 | }, |
| 1336 | 1437 | .ptr_stack_offset => |off| { |
| 1337 | try self.genSetStack(inst.base.src, elem_ty, off, value); | |
| 1438 | try self.genSetStack(elem_ty, off, value); | |
| 1338 | 1439 | }, |
| 1339 | 1440 | .ptr_embedded_in_code => |off| { |
| 1340 | try self.setRegOrMem(inst.base.src, elem_ty, .{ .embedded_in_code = off }, value); | |
| 1441 | try self.setRegOrMem(elem_ty, .{ .embedded_in_code = off }, value); | |
| 1341 | 1442 | }, |
| 1342 | 1443 | .embedded_in_code => { |
| 1343 | return self.fail(inst.base.src, "TODO implement storing to MCValue.embedded_in_code", .{}); | |
| 1444 | return self.fail("TODO implement storing to MCValue.embedded_in_code", .{}); | |
| 1344 | 1445 | }, |
| 1345 | 1446 | .register => { |
| 1346 | return self.fail(inst.base.src, "TODO implement storing to MCValue.register", .{}); | |
| 1447 | return self.fail("TODO implement storing to MCValue.register", .{}); | |
| 1347 | 1448 | }, |
| 1348 | 1449 | .memory => { |
| 1349 | return self.fail(inst.base.src, "TODO implement storing to MCValue.memory", .{}); | |
| 1450 | return self.fail("TODO implement storing to MCValue.memory", .{}); | |
| 1350 | 1451 | }, |
| 1351 | 1452 | .stack_offset => { |
| 1352 | return self.fail(inst.base.src, "TODO implement storing to MCValue.stack_offset", .{}); | |
| 1353 | }, | |
| 1354 | } | |
| 1355 | return .none; | |
| 1356 | } | |
| 1357 | ||
| 1358 | fn genStructFieldPtr(self: *Self, inst: *ir.Inst.StructFieldPtr) !MCValue { | |
| 1359 | return self.fail(inst.base.src, "TODO implement codegen struct_field_ptr", .{}); | |
| 1360 | } | |
| 1361 | ||
| 1362 | fn genSub(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1363 | // No side effects, so if it's unreferenced, do nothing. | |
| 1364 | if (inst.base.isUnused()) | |
| 1365 | return MCValue.dead; | |
| 1366 | switch (arch) { | |
| 1367 | .x86_64 => { | |
| 1368 | return try self.genX8664BinMath(&inst.base, inst.lhs, inst.rhs); | |
| 1453 | return self.fail("TODO implement storing to MCValue.stack_offset", .{}); | |
| 1369 | 1454 | }, |
| 1370 | .arm, .armeb => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .sub), | |
| 1371 | else => return self.fail(inst.base.src, "TODO implement sub for {}", .{self.target.cpu.arch}), | |
| 1372 | 1455 | } |
| 1456 | return self.finishAir(inst, .dead, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 1373 | 1457 | } |
| 1374 | 1458 | |
| 1375 | fn genSubWrap(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 1376 | // No side effects, so if it's unreferenced, do nothing. | |
| 1377 | if (inst.base.isUnused()) | |
| 1378 | return MCValue.dead; | |
| 1379 | switch (arch) { | |
| 1380 | else => return self.fail(inst.base.src, "TODO implement subwrap for {}", .{self.target.cpu.arch}), | |
| 1381 | } | |
| 1459 | fn airStructFieldPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 1460 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 1461 | const extra = self.air.extraData(Air.StructField, ty_pl.payload).data; | |
| 1462 | _ = extra; | |
| 1463 | return self.fail("TODO implement codegen struct_field_ptr", .{}); | |
| 1464 | //return self.finishAir(inst, result, .{ extra.struct_ptr, .none, .none }); | |
| 1382 | 1465 | } |
| 1383 | 1466 | |
| 1384 | fn armOperandShouldBeRegister(self: *Self, src: LazySrcLoc, mcv: MCValue) !bool { | |
| 1467 | fn armOperandShouldBeRegister(self: *Self, mcv: MCValue) !bool { | |
| 1385 | 1468 | return switch (mcv) { |
| 1386 | 1469 | .none => unreachable, |
| 1387 | 1470 | .undef => unreachable, |
| ... | ... | @@ -1391,7 +1474,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1391 | 1474 | .ptr_stack_offset => unreachable, |
| 1392 | 1475 | .ptr_embedded_in_code => unreachable, |
| 1393 | 1476 | .immediate => |imm| blk: { |
| 1394 | if (imm > std.math.maxInt(u32)) return self.fail(src, "TODO ARM binary arithmetic immediate larger than u32", .{}); | |
| 1477 | if (imm > std.math.maxInt(u32)) return self.fail("TODO ARM binary arithmetic immediate larger than u32", .{}); | |
| 1395 | 1478 | |
| 1396 | 1479 | // Load immediate into register if it doesn't fit |
| 1397 | 1480 | // in an operand |
| ... | ... | @@ -1405,16 +1488,16 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1405 | 1488 | }; |
| 1406 | 1489 | } |
| 1407 | 1490 | |
| 1408 | fn genArmBinOp(self: *Self, inst: *ir.Inst, op_lhs: *ir.Inst, op_rhs: *ir.Inst, op: ir.Inst.Tag) !MCValue { | |
| 1491 | fn genArmBinOp(self: *Self, inst: Air.Inst.Index, op_lhs: Air.Inst.Ref, op_rhs: Air.Inst.Ref, op: Air.Inst.Tag) !MCValue { | |
| 1409 | 1492 | const lhs = try self.resolveInst(op_lhs); |
| 1410 | 1493 | const rhs = try self.resolveInst(op_rhs); |
| 1411 | 1494 | |
| 1412 | 1495 | const lhs_is_register = lhs == .register; |
| 1413 | 1496 | const rhs_is_register = rhs == .register; |
| 1414 | const lhs_should_be_register = try self.armOperandShouldBeRegister(op_lhs.src, lhs); | |
| 1415 | const rhs_should_be_register = try self.armOperandShouldBeRegister(op_rhs.src, rhs); | |
| 1416 | const reuse_lhs = lhs_is_register and self.reuseOperand(inst, 0, lhs); | |
| 1417 | const reuse_rhs = !reuse_lhs and rhs_is_register and self.reuseOperand(inst, 1, rhs); | |
| 1497 | const lhs_should_be_register = try self.armOperandShouldBeRegister(lhs); | |
| 1498 | const rhs_should_be_register = try self.armOperandShouldBeRegister(rhs); | |
| 1499 | const reuse_lhs = lhs_is_register and self.reuseOperand(inst, op_lhs, 0, lhs); | |
| 1500 | const reuse_rhs = !reuse_lhs and rhs_is_register and self.reuseOperand(inst, op_rhs, 1, rhs); | |
| 1418 | 1501 | |
| 1419 | 1502 | // Destination must be a register |
| 1420 | 1503 | var dst_mcv: MCValue = undefined; |
| ... | ... | @@ -1427,15 +1510,15 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1427 | 1510 | if (reuse_lhs) { |
| 1428 | 1511 | // Allocate 0 or 1 registers |
| 1429 | 1512 | if (!rhs_is_register and rhs_should_be_register) { |
| 1430 | rhs_mcv = MCValue{ .register = try self.register_manager.allocReg(op_rhs, &.{lhs.register}) }; | |
| 1431 | branch.inst_table.putAssumeCapacity(op_rhs, rhs_mcv); | |
| 1513 | rhs_mcv = MCValue{ .register = try self.register_manager.allocReg(Air.refToIndex(op_rhs).?, &.{lhs.register}) }; | |
| 1514 | branch.inst_table.putAssumeCapacity(Air.refToIndex(op_rhs).?, rhs_mcv); | |
| 1432 | 1515 | } |
| 1433 | 1516 | dst_mcv = lhs; |
| 1434 | 1517 | } else if (reuse_rhs) { |
| 1435 | 1518 | // Allocate 0 or 1 registers |
| 1436 | 1519 | if (!lhs_is_register and lhs_should_be_register) { |
| 1437 | lhs_mcv = MCValue{ .register = try self.register_manager.allocReg(op_lhs, &.{rhs.register}) }; | |
| 1438 | branch.inst_table.putAssumeCapacity(op_lhs, lhs_mcv); | |
| 1520 | lhs_mcv = MCValue{ .register = try self.register_manager.allocReg(Air.refToIndex(op_lhs).?, &.{rhs.register}) }; | |
| 1521 | branch.inst_table.putAssumeCapacity(Air.refToIndex(op_lhs).?, lhs_mcv); | |
| 1439 | 1522 | } |
| 1440 | 1523 | dst_mcv = rhs; |
| 1441 | 1524 | |
| ... | ... | @@ -1455,12 +1538,12 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1455 | 1538 | lhs_mcv = dst_mcv; |
| 1456 | 1539 | } else { |
| 1457 | 1540 | // Move LHS and RHS to register |
| 1458 | const regs = try self.register_manager.allocRegs(2, .{ inst, op_rhs }, &.{}); | |
| 1541 | const regs = try self.register_manager.allocRegs(2, .{ inst, Air.refToIndex(op_rhs).? }, &.{}); | |
| 1459 | 1542 | lhs_mcv = MCValue{ .register = regs[0] }; |
| 1460 | 1543 | rhs_mcv = MCValue{ .register = regs[1] }; |
| 1461 | 1544 | dst_mcv = lhs_mcv; |
| 1462 | 1545 | |
| 1463 | branch.inst_table.putAssumeCapacity(op_rhs, rhs_mcv); | |
| 1546 | branch.inst_table.putAssumeCapacity(Air.refToIndex(op_rhs).?, rhs_mcv); | |
| 1464 | 1547 | } |
| 1465 | 1548 | } else if (lhs_should_be_register) { |
| 1466 | 1549 | // RHS is immediate |
| ... | ... | @@ -1485,14 +1568,13 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1485 | 1568 | |
| 1486 | 1569 | // Move the operands to the newly allocated registers |
| 1487 | 1570 | if (lhs_mcv == .register and !lhs_is_register) { |
| 1488 | try self.genSetReg(op_lhs.src, op_lhs.ty, lhs_mcv.register, lhs); | |
| 1571 | try self.genSetReg(self.air.typeOf(op_lhs), lhs_mcv.register, lhs); | |
| 1489 | 1572 | } |
| 1490 | 1573 | if (rhs_mcv == .register and !rhs_is_register) { |
| 1491 | try self.genSetReg(op_rhs.src, op_rhs.ty, rhs_mcv.register, rhs); | |
| 1574 | try self.genSetReg(self.air.typeOf(op_rhs), rhs_mcv.register, rhs); | |
| 1492 | 1575 | } |
| 1493 | 1576 | |
| 1494 | 1577 | try self.genArmBinOpCode( |
| 1495 | inst.src, | |
| 1496 | 1578 | dst_mcv.register, |
| 1497 | 1579 | lhs_mcv, |
| 1498 | 1580 | rhs_mcv, |
| ... | ... | @@ -1504,14 +1586,12 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1504 | 1586 | |
| 1505 | 1587 | fn genArmBinOpCode( |
| 1506 | 1588 | self: *Self, |
| 1507 | src: LazySrcLoc, | |
| 1508 | 1589 | dst_reg: Register, |
| 1509 | 1590 | lhs_mcv: MCValue, |
| 1510 | 1591 | rhs_mcv: MCValue, |
| 1511 | 1592 | swap_lhs_and_rhs: bool, |
| 1512 | op: ir.Inst.Tag, | |
| 1593 | op: Air.Inst.Tag, | |
| 1513 | 1594 | ) !void { |
| 1514 | _ = src; | |
| 1515 | 1595 | assert(lhs_mcv == .register or rhs_mcv == .register); |
| 1516 | 1596 | |
| 1517 | 1597 | const op1 = if (swap_lhs_and_rhs) rhs_mcv.register else lhs_mcv.register; |
| ... | ... | @@ -1560,14 +1640,14 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1560 | 1640 | } |
| 1561 | 1641 | } |
| 1562 | 1642 | |
| 1563 | fn genArmMul(self: *Self, inst: *ir.Inst, op_lhs: *ir.Inst, op_rhs: *ir.Inst) !MCValue { | |
| 1643 | fn genArmMul(self: *Self, inst: Air.Inst.Index, op_lhs: Air.Inst.Ref, op_rhs: Air.Inst.Ref) !MCValue { | |
| 1564 | 1644 | const lhs = try self.resolveInst(op_lhs); |
| 1565 | 1645 | const rhs = try self.resolveInst(op_rhs); |
| 1566 | 1646 | |
| 1567 | 1647 | const lhs_is_register = lhs == .register; |
| 1568 | 1648 | const rhs_is_register = rhs == .register; |
| 1569 | const reuse_lhs = lhs_is_register and self.reuseOperand(inst, 0, lhs); | |
| 1570 | const reuse_rhs = !reuse_lhs and rhs_is_register and self.reuseOperand(inst, 1, rhs); | |
| 1649 | const reuse_lhs = lhs_is_register and self.reuseOperand(inst, op_lhs, 0, lhs); | |
| 1650 | const reuse_rhs = !reuse_lhs and rhs_is_register and self.reuseOperand(inst, op_rhs, 1, rhs); | |
| 1571 | 1651 | |
| 1572 | 1652 | // Destination must be a register |
| 1573 | 1653 | // LHS must be a register |
| ... | ... | @@ -1581,15 +1661,15 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1581 | 1661 | if (reuse_lhs) { |
| 1582 | 1662 | // Allocate 0 or 1 registers |
| 1583 | 1663 | if (!rhs_is_register) { |
| 1584 | rhs_mcv = MCValue{ .register = try self.register_manager.allocReg(op_rhs, &.{lhs.register}) }; | |
| 1585 | branch.inst_table.putAssumeCapacity(op_rhs, rhs_mcv); | |
| 1664 | rhs_mcv = MCValue{ .register = try self.register_manager.allocReg(Air.refToIndex(op_rhs).?, &.{lhs.register}) }; | |
| 1665 | branch.inst_table.putAssumeCapacity(Air.refToIndex(op_rhs).?, rhs_mcv); | |
| 1586 | 1666 | } |
| 1587 | 1667 | dst_mcv = lhs; |
| 1588 | 1668 | } else if (reuse_rhs) { |
| 1589 | 1669 | // Allocate 0 or 1 registers |
| 1590 | 1670 | if (!lhs_is_register) { |
| 1591 | lhs_mcv = MCValue{ .register = try self.register_manager.allocReg(op_lhs, &.{rhs.register}) }; | |
| 1592 | branch.inst_table.putAssumeCapacity(op_lhs, lhs_mcv); | |
| 1671 | lhs_mcv = MCValue{ .register = try self.register_manager.allocReg(Air.refToIndex(op_lhs).?, &.{rhs.register}) }; | |
| 1672 | branch.inst_table.putAssumeCapacity(Air.refToIndex(op_lhs).?, lhs_mcv); | |
| 1593 | 1673 | } |
| 1594 | 1674 | dst_mcv = rhs; |
| 1595 | 1675 | } else { |
| ... | ... | @@ -1606,21 +1686,21 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1606 | 1686 | lhs_mcv = dst_mcv; |
| 1607 | 1687 | } else { |
| 1608 | 1688 | // Move LHS and RHS to register |
| 1609 | const regs = try self.register_manager.allocRegs(2, .{ inst, op_rhs }, &.{}); | |
| 1689 | const regs = try self.register_manager.allocRegs(2, .{ inst, Air.refToIndex(op_rhs).? }, &.{}); | |
| 1610 | 1690 | lhs_mcv = MCValue{ .register = regs[0] }; |
| 1611 | 1691 | rhs_mcv = MCValue{ .register = regs[1] }; |
| 1612 | 1692 | dst_mcv = lhs_mcv; |
| 1613 | 1693 | |
| 1614 | branch.inst_table.putAssumeCapacity(op_rhs, rhs_mcv); | |
| 1694 | branch.inst_table.putAssumeCapacity(Air.refToIndex(op_rhs).?, rhs_mcv); | |
| 1615 | 1695 | } |
| 1616 | 1696 | } |
| 1617 | 1697 | |
| 1618 | 1698 | // Move the operands to the newly allocated registers |
| 1619 | 1699 | if (!lhs_is_register) { |
| 1620 | try self.genSetReg(op_lhs.src, op_lhs.ty, lhs_mcv.register, lhs); | |
| 1700 | try self.genSetReg(self.air.typeOf(op_lhs), lhs_mcv.register, lhs); | |
| 1621 | 1701 | } |
| 1622 | 1702 | if (!rhs_is_register) { |
| 1623 | try self.genSetReg(op_rhs.src, op_rhs.ty, rhs_mcv.register, rhs); | |
| 1703 | try self.genSetReg(self.air.typeOf(op_rhs), rhs_mcv.register, rhs); | |
| 1624 | 1704 | } |
| 1625 | 1705 | |
| 1626 | 1706 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.mul(.al, dst_mcv.register, lhs_mcv.register, rhs_mcv.register).toU32()); |
| ... | ... | @@ -1630,7 +1710,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1630 | 1710 | /// Perform "binary" operators, excluding comparisons. |
| 1631 | 1711 | /// Currently, the following ops are supported: |
| 1632 | 1712 | /// ADD, SUB, XOR, OR, AND |
| 1633 | fn genX8664BinMath(self: *Self, inst: *ir.Inst, op_lhs: *ir.Inst, op_rhs: *ir.Inst) !MCValue { | |
| 1713 | fn genX8664BinMath(self: *Self, inst: Air.Inst.Index, op_lhs: Air.Inst.Ref, op_rhs: Air.Inst.Ref) !MCValue { | |
| 1634 | 1714 | // We'll handle these ops in two steps. |
| 1635 | 1715 | // 1) Prepare an output location (register or memory) |
| 1636 | 1716 | // This location will be the location of the operand that dies (if one exists) |
| ... | ... | @@ -1653,8 +1733,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1653 | 1733 | // as the result MCValue. |
| 1654 | 1734 | var dst_mcv: MCValue = undefined; |
| 1655 | 1735 | var src_mcv: MCValue = undefined; |
| 1656 | var src_inst: *ir.Inst = undefined; | |
| 1657 | if (self.reuseOperand(inst, 0, lhs)) { | |
| 1736 | var src_inst: Air.Inst.Ref = undefined; | |
| 1737 | if (self.reuseOperand(inst, op_lhs, 0, lhs)) { | |
| 1658 | 1738 | // LHS dies; use it as the destination. |
| 1659 | 1739 | // Both operands cannot be memory. |
| 1660 | 1740 | src_inst = op_rhs; |
| ... | ... | @@ -1665,7 +1745,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1665 | 1745 | dst_mcv = lhs; |
| 1666 | 1746 | src_mcv = rhs; |
| 1667 | 1747 | } |
| 1668 | } else if (self.reuseOperand(inst, 1, rhs)) { | |
| 1748 | } else if (self.reuseOperand(inst, op_rhs, 1, rhs)) { | |
| 1669 | 1749 | // RHS dies; use it as the destination. |
| 1670 | 1750 | // Both operands cannot be memory. |
| 1671 | 1751 | src_inst = op_lhs; |
| ... | ... | @@ -1695,22 +1775,24 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1695 | 1775 | switch (src_mcv) { |
| 1696 | 1776 | .immediate => |imm| { |
| 1697 | 1777 | if (imm > math.maxInt(u31)) { |
| 1698 | src_mcv = MCValue{ .register = try self.copyToTmpRegister(src_inst.src, Type.initTag(.u64), src_mcv) }; | |
| 1778 | src_mcv = MCValue{ .register = try self.copyToTmpRegister(Type.initTag(.u64), src_mcv) }; | |
| 1699 | 1779 | } |
| 1700 | 1780 | }, |
| 1701 | 1781 | else => {}, |
| 1702 | 1782 | } |
| 1703 | 1783 | |
| 1704 | 1784 | // Now for step 2, we perform the actual op |
| 1705 | switch (inst.tag) { | |
| 1785 | const inst_ty = self.air.typeOfIndex(inst); | |
| 1786 | const air_tags = self.air.instructions.items(.tag); | |
| 1787 | switch (air_tags[inst]) { | |
| 1706 | 1788 | // TODO: Generate wrapping and non-wrapping versions separately |
| 1707 | .add, .addwrap => try self.genX8664BinMathCode(inst.src, inst.ty, dst_mcv, src_mcv, 0, 0x00), | |
| 1708 | .bool_or, .bit_or => try self.genX8664BinMathCode(inst.src, inst.ty, dst_mcv, src_mcv, 1, 0x08), | |
| 1709 | .bool_and, .bit_and => try self.genX8664BinMathCode(inst.src, inst.ty, dst_mcv, src_mcv, 4, 0x20), | |
| 1710 | .sub, .subwrap => try self.genX8664BinMathCode(inst.src, inst.ty, dst_mcv, src_mcv, 5, 0x28), | |
| 1711 | .xor, .not => try self.genX8664BinMathCode(inst.src, inst.ty, dst_mcv, src_mcv, 6, 0x30), | |
| 1789 | .add, .addwrap => try self.genX8664BinMathCode(inst_ty, dst_mcv, src_mcv, 0, 0x00), | |
| 1790 | .bool_or, .bit_or => try self.genX8664BinMathCode(inst_ty, dst_mcv, src_mcv, 1, 0x08), | |
| 1791 | .bool_and, .bit_and => try self.genX8664BinMathCode(inst_ty, dst_mcv, src_mcv, 4, 0x20), | |
| 1792 | .sub, .subwrap => try self.genX8664BinMathCode(inst_ty, dst_mcv, src_mcv, 5, 0x28), | |
| 1793 | .xor, .not => try self.genX8664BinMathCode(inst_ty, dst_mcv, src_mcv, 6, 0x30), | |
| 1712 | 1794 | |
| 1713 | .mul, .mulwrap => try self.genX8664Imul(inst.src, inst.ty, dst_mcv, src_mcv), | |
| 1795 | .mul, .mulwrap => try self.genX8664Imul(inst_ty, dst_mcv, src_mcv), | |
| 1714 | 1796 | else => unreachable, |
| 1715 | 1797 | } |
| 1716 | 1798 | |
| ... | ... | @@ -1718,16 +1800,12 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1718 | 1800 | } |
| 1719 | 1801 | |
| 1720 | 1802 | /// Wrap over Instruction.encodeInto to translate errors |
| 1721 | fn encodeX8664Instruction( | |
| 1722 | self: *Self, | |
| 1723 | src: LazySrcLoc, | |
| 1724 | inst: Instruction, | |
| 1725 | ) !void { | |
| 1803 | fn encodeX8664Instruction(self: *Self, inst: Instruction) !void { | |
| 1726 | 1804 | inst.encodeInto(self.code) catch |err| { |
| 1727 | 1805 | if (err == error.OutOfMemory) |
| 1728 | 1806 | return error.OutOfMemory |
| 1729 | 1807 | else |
| 1730 | return self.fail(src, "Instruction.encodeInto failed because {s}", .{@errorName(err)}); | |
| 1808 | return self.fail("Instruction.encodeInto failed because {s}", .{@errorName(err)}); | |
| 1731 | 1809 | }; |
| 1732 | 1810 | } |
| 1733 | 1811 | |
| ... | ... | @@ -1799,7 +1877,6 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1799 | 1877 | /// d3 /opx | *r/m16/32/64*, CL (for context, CL is register 1) |
| 1800 | 1878 | fn genX8664BinMathCode( |
| 1801 | 1879 | self: *Self, |
| 1802 | src: LazySrcLoc, | |
| 1803 | 1880 | dst_ty: Type, |
| 1804 | 1881 | dst_mcv: MCValue, |
| 1805 | 1882 | src_mcv: MCValue, |
| ... | ... | @@ -1817,7 +1894,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1817 | 1894 | .register => |dst_reg| { |
| 1818 | 1895 | switch (src_mcv) { |
| 1819 | 1896 | .none => unreachable, |
| 1820 | .undef => try self.genSetReg(src, dst_ty, dst_reg, .undef), | |
| 1897 | .undef => try self.genSetReg(dst_ty, dst_reg, .undef), | |
| 1821 | 1898 | .dead, .unreach => unreachable, |
| 1822 | 1899 | .ptr_stack_offset => unreachable, |
| 1823 | 1900 | .ptr_embedded_in_code => unreachable, |
| ... | ... | @@ -1871,7 +1948,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1871 | 1948 | } |
| 1872 | 1949 | }, |
| 1873 | 1950 | .embedded_in_code, .memory => { |
| 1874 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source memory", .{}); | |
| 1951 | return self.fail("TODO implement x86 ADD/SUB/CMP source memory", .{}); | |
| 1875 | 1952 | }, |
| 1876 | 1953 | .stack_offset => |off| { |
| 1877 | 1954 | // register, indirect use mr + 3 |
| ... | ... | @@ -1879,7 +1956,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1879 | 1956 | const abi_size = dst_ty.abiSize(self.target.*); |
| 1880 | 1957 | const adj_off = off + abi_size; |
| 1881 | 1958 | if (off > math.maxInt(i32)) { |
| 1882 | return self.fail(src, "stack offset too large", .{}); | |
| 1959 | return self.fail("stack offset too large", .{}); | |
| 1883 | 1960 | } |
| 1884 | 1961 | const encoder = try X8664Encoder.init(self.code, 7); |
| 1885 | 1962 | encoder.rex(.{ |
| ... | ... | @@ -1902,40 +1979,40 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1902 | 1979 | } |
| 1903 | 1980 | }, |
| 1904 | 1981 | .compare_flags_unsigned => { |
| 1905 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source compare flag (unsigned)", .{}); | |
| 1982 | return self.fail("TODO implement x86 ADD/SUB/CMP source compare flag (unsigned)", .{}); | |
| 1906 | 1983 | }, |
| 1907 | 1984 | .compare_flags_signed => { |
| 1908 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source compare flag (signed)", .{}); | |
| 1985 | return self.fail("TODO implement x86 ADD/SUB/CMP source compare flag (signed)", .{}); | |
| 1909 | 1986 | }, |
| 1910 | 1987 | } |
| 1911 | 1988 | }, |
| 1912 | 1989 | .stack_offset => |off| { |
| 1913 | 1990 | switch (src_mcv) { |
| 1914 | 1991 | .none => unreachable, |
| 1915 | .undef => return self.genSetStack(src, dst_ty, off, .undef), | |
| 1992 | .undef => return self.genSetStack(dst_ty, off, .undef), | |
| 1916 | 1993 | .dead, .unreach => unreachable, |
| 1917 | 1994 | .ptr_stack_offset => unreachable, |
| 1918 | 1995 | .ptr_embedded_in_code => unreachable, |
| 1919 | 1996 | .register => |src_reg| { |
| 1920 | try self.genX8664ModRMRegToStack(src, dst_ty, off, src_reg, mr + 0x1); | |
| 1997 | try self.genX8664ModRMRegToStack(dst_ty, off, src_reg, mr + 0x1); | |
| 1921 | 1998 | }, |
| 1922 | 1999 | .immediate => |imm| { |
| 1923 | 2000 | _ = imm; |
| 1924 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source immediate", .{}); | |
| 2001 | return self.fail("TODO implement x86 ADD/SUB/CMP source immediate", .{}); | |
| 1925 | 2002 | }, |
| 1926 | 2003 | .embedded_in_code, .memory, .stack_offset => { |
| 1927 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source memory", .{}); | |
| 2004 | return self.fail("TODO implement x86 ADD/SUB/CMP source memory", .{}); | |
| 1928 | 2005 | }, |
| 1929 | 2006 | .compare_flags_unsigned => { |
| 1930 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source compare flag (unsigned)", .{}); | |
| 2007 | return self.fail("TODO implement x86 ADD/SUB/CMP source compare flag (unsigned)", .{}); | |
| 1931 | 2008 | }, |
| 1932 | 2009 | .compare_flags_signed => { |
| 1933 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP source compare flag (signed)", .{}); | |
| 2010 | return self.fail("TODO implement x86 ADD/SUB/CMP source compare flag (signed)", .{}); | |
| 1934 | 2011 | }, |
| 1935 | 2012 | } |
| 1936 | 2013 | }, |
| 1937 | 2014 | .embedded_in_code, .memory => { |
| 1938 | return self.fail(src, "TODO implement x86 ADD/SUB/CMP destination memory", .{}); | |
| 2015 | return self.fail("TODO implement x86 ADD/SUB/CMP destination memory", .{}); | |
| 1939 | 2016 | }, |
| 1940 | 2017 | } |
| 1941 | 2018 | } |
| ... | ... | @@ -1943,7 +2020,6 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1943 | 2020 | /// Performs integer multiplication between dst_mcv and src_mcv, storing the result in dst_mcv. |
| 1944 | 2021 | fn genX8664Imul( |
| 1945 | 2022 | self: *Self, |
| 1946 | src: LazySrcLoc, | |
| 1947 | 2023 | dst_ty: Type, |
| 1948 | 2024 | dst_mcv: MCValue, |
| 1949 | 2025 | src_mcv: MCValue, |
| ... | ... | @@ -1959,7 +2035,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 1959 | 2035 | .register => |dst_reg| { |
| 1960 | 2036 | switch (src_mcv) { |
| 1961 | 2037 | .none => unreachable, |
| 1962 | .undef => try self.genSetReg(src, dst_ty, dst_reg, .undef), | |
| 2038 | .undef => try self.genSetReg(dst_ty, dst_reg, .undef), | |
| 1963 | 2039 | .dead, .unreach => unreachable, |
| 1964 | 2040 | .ptr_stack_offset => unreachable, |
| 1965 | 2041 | .ptr_embedded_in_code => unreachable, |
| ... | ... | @@ -2025,31 +2101,31 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2025 | 2101 | ); |
| 2026 | 2102 | encoder.imm32(@intCast(i32, imm)); |
| 2027 | 2103 | } else { |
| 2028 | const src_reg = try self.copyToTmpRegister(src, dst_ty, src_mcv); | |
| 2029 | return self.genX8664Imul(src, dst_ty, dst_mcv, MCValue{ .register = src_reg }); | |
| 2104 | const src_reg = try self.copyToTmpRegister(dst_ty, src_mcv); | |
| 2105 | return self.genX8664Imul(dst_ty, dst_mcv, MCValue{ .register = src_reg }); | |
| 2030 | 2106 | } |
| 2031 | 2107 | }, |
| 2032 | 2108 | .embedded_in_code, .memory, .stack_offset => { |
| 2033 | return self.fail(src, "TODO implement x86 multiply source memory", .{}); | |
| 2109 | return self.fail("TODO implement x86 multiply source memory", .{}); | |
| 2034 | 2110 | }, |
| 2035 | 2111 | .compare_flags_unsigned => { |
| 2036 | return self.fail(src, "TODO implement x86 multiply source compare flag (unsigned)", .{}); | |
| 2112 | return self.fail("TODO implement x86 multiply source compare flag (unsigned)", .{}); | |
| 2037 | 2113 | }, |
| 2038 | 2114 | .compare_flags_signed => { |
| 2039 | return self.fail(src, "TODO implement x86 multiply source compare flag (signed)", .{}); | |
| 2115 | return self.fail("TODO implement x86 multiply source compare flag (signed)", .{}); | |
| 2040 | 2116 | }, |
| 2041 | 2117 | } |
| 2042 | 2118 | }, |
| 2043 | 2119 | .stack_offset => |off| { |
| 2044 | 2120 | switch (src_mcv) { |
| 2045 | 2121 | .none => unreachable, |
| 2046 | .undef => return self.genSetStack(src, dst_ty, off, .undef), | |
| 2122 | .undef => return self.genSetStack(dst_ty, off, .undef), | |
| 2047 | 2123 | .dead, .unreach => unreachable, |
| 2048 | 2124 | .ptr_stack_offset => unreachable, |
| 2049 | 2125 | .ptr_embedded_in_code => unreachable, |
| 2050 | 2126 | .register => |src_reg| { |
| 2051 | 2127 | // copy dst to a register |
| 2052 | const dst_reg = try self.copyToTmpRegister(src, dst_ty, dst_mcv); | |
| 2128 | const dst_reg = try self.copyToTmpRegister(dst_ty, dst_mcv); | |
| 2053 | 2129 | // multiply into dst_reg |
| 2054 | 2130 | // register, register |
| 2055 | 2131 | // Use the following imul opcode |
| ... | ... | @@ -2067,34 +2143,34 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2067 | 2143 | src_reg.low_id(), |
| 2068 | 2144 | ); |
| 2069 | 2145 | // copy dst_reg back out |
| 2070 | return self.genSetStack(src, dst_ty, off, MCValue{ .register = dst_reg }); | |
| 2146 | return self.genSetStack(dst_ty, off, MCValue{ .register = dst_reg }); | |
| 2071 | 2147 | }, |
| 2072 | 2148 | .immediate => |imm| { |
| 2073 | 2149 | _ = imm; |
| 2074 | return self.fail(src, "TODO implement x86 multiply source immediate", .{}); | |
| 2150 | return self.fail("TODO implement x86 multiply source immediate", .{}); | |
| 2075 | 2151 | }, |
| 2076 | 2152 | .embedded_in_code, .memory, .stack_offset => { |
| 2077 | return self.fail(src, "TODO implement x86 multiply source memory", .{}); | |
| 2153 | return self.fail("TODO implement x86 multiply source memory", .{}); | |
| 2078 | 2154 | }, |
| 2079 | 2155 | .compare_flags_unsigned => { |
| 2080 | return self.fail(src, "TODO implement x86 multiply source compare flag (unsigned)", .{}); | |
| 2156 | return self.fail("TODO implement x86 multiply source compare flag (unsigned)", .{}); | |
| 2081 | 2157 | }, |
| 2082 | 2158 | .compare_flags_signed => { |
| 2083 | return self.fail(src, "TODO implement x86 multiply source compare flag (signed)", .{}); | |
| 2159 | return self.fail("TODO implement x86 multiply source compare flag (signed)", .{}); | |
| 2084 | 2160 | }, |
| 2085 | 2161 | } |
| 2086 | 2162 | }, |
| 2087 | 2163 | .embedded_in_code, .memory => { |
| 2088 | return self.fail(src, "TODO implement x86 multiply destination memory", .{}); | |
| 2164 | return self.fail("TODO implement x86 multiply destination memory", .{}); | |
| 2089 | 2165 | }, |
| 2090 | 2166 | } |
| 2091 | 2167 | } |
| 2092 | 2168 | |
| 2093 | fn genX8664ModRMRegToStack(self: *Self, src: LazySrcLoc, ty: Type, off: u32, reg: Register, opcode: u8) !void { | |
| 2169 | fn genX8664ModRMRegToStack(self: *Self, ty: Type, off: u32, reg: Register, opcode: u8) !void { | |
| 2094 | 2170 | const abi_size = ty.abiSize(self.target.*); |
| 2095 | 2171 | const adj_off = off + abi_size; |
| 2096 | 2172 | if (off > math.maxInt(i32)) { |
| 2097 | return self.fail(src, "stack offset too large", .{}); | |
| 2173 | return self.fail("stack offset too large", .{}); | |
| 2098 | 2174 | } |
| 2099 | 2175 | |
| 2100 | 2176 | const i_adj_off = -@intCast(i32, adj_off); |
| ... | ... | @@ -2121,8 +2197,12 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2121 | 2197 | } |
| 2122 | 2198 | } |
| 2123 | 2199 | |
| 2124 | fn genArgDbgInfo(self: *Self, inst: *ir.Inst.Arg, mcv: MCValue) !void { | |
| 2125 | const name_with_null = inst.name[0 .. mem.lenZ(inst.name) + 1]; | |
| 2200 | fn genArgDbgInfo(self: *Self, inst: Air.Inst.Index, mcv: MCValue) !void { | |
| 2201 | const ty_str = self.air.instructions.items(.data)[inst].ty_str; | |
| 2202 | const zir = &self.mod_fn.owner_decl.namespace.file_scope.zir; | |
| 2203 | const name = zir.nullTerminatedString(ty_str.str); | |
| 2204 | const name_with_null = name.ptr[0 .. name.len + 1]; | |
| 2205 | const ty = self.air.getRefType(ty_str.ty); | |
| 2126 | 2206 | |
| 2127 | 2207 | switch (mcv) { |
| 2128 | 2208 | .register => |reg| { |
| ... | ... | @@ -2135,7 +2215,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2135 | 2215 | reg.dwarfLocOp(), |
| 2136 | 2216 | }); |
| 2137 | 2217 | try dbg_out.dbg_info.ensureCapacity(dbg_out.dbg_info.items.len + 5 + name_with_null.len); |
| 2138 | try self.addDbgInfoTypeReloc(inst.base.ty); // DW.AT_type, DW.FORM_ref4 | |
| 2218 | try self.addDbgInfoTypeReloc(ty); // DW.AT_type, DW.FORM_ref4 | |
| 2139 | 2219 | dbg_out.dbg_info.appendSliceAssumeCapacity(name_with_null); // DW.AT_name, DW.FORM_string |
| 2140 | 2220 | }, |
| 2141 | 2221 | .none => {}, |
| ... | ... | @@ -2146,12 +2226,11 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2146 | 2226 | .dwarf => |dbg_out| { |
| 2147 | 2227 | switch (arch) { |
| 2148 | 2228 | .arm, .armeb => { |
| 2149 | const ty = inst.base.ty; | |
| 2150 | 2229 | const abi_size = math.cast(u32, ty.abiSize(self.target.*)) catch { |
| 2151 | return self.fail(inst.base.src, "type '{}' too big to fit into stack frame", .{ty}); | |
| 2230 | return self.fail("type '{}' too big to fit into stack frame", .{ty}); | |
| 2152 | 2231 | }; |
| 2153 | 2232 | const adjusted_stack_offset = math.negateCast(offset + abi_size) catch { |
| 2154 | return self.fail(inst.base.src, "Stack offset too large for arguments", .{}); | |
| 2233 | return self.fail("Stack offset too large for arguments", .{}); | |
| 2155 | 2234 | }; |
| 2156 | 2235 | |
| 2157 | 2236 | try dbg_out.dbg_info.append(link.File.Elf.abbrev_parameter); |
| ... | ... | @@ -2167,7 +2246,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2167 | 2246 | try leb128.writeILEB128(dbg_out.dbg_info.writer(), adjusted_stack_offset); |
| 2168 | 2247 | |
| 2169 | 2248 | try dbg_out.dbg_info.ensureCapacity(dbg_out.dbg_info.items.len + 5 + name_with_null.len); |
| 2170 | try self.addDbgInfoTypeReloc(inst.base.ty); // DW.AT_type, DW.FORM_ref4 | |
| 2249 | try self.addDbgInfoTypeReloc(ty); // DW.AT_type, DW.FORM_ref4 | |
| 2171 | 2250 | dbg_out.dbg_info.appendSliceAssumeCapacity(name_with_null); // DW.AT_name, DW.FORM_string |
| 2172 | 2251 | }, |
| 2173 | 2252 | else => {}, |
| ... | ... | @@ -2180,23 +2259,24 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2180 | 2259 | } |
| 2181 | 2260 | } |
| 2182 | 2261 | |
| 2183 | fn genArg(self: *Self, inst: *ir.Inst.Arg) !MCValue { | |
| 2262 | fn airArg(self: *Self, inst: Air.Inst.Index) !void { | |
| 2184 | 2263 | const arg_index = self.arg_index; |
| 2185 | 2264 | self.arg_index += 1; |
| 2186 | 2265 | |
| 2266 | const ty = self.air.typeOfIndex(inst); | |
| 2267 | ||
| 2187 | 2268 | const result = self.args[arg_index]; |
| 2188 | 2269 | const mcv = switch (arch) { |
| 2189 | 2270 | // TODO support stack-only arguments on all target architectures |
| 2190 | 2271 | .arm, .armeb, .aarch64, .aarch64_32, .aarch64_be => switch (result) { |
| 2191 | 2272 | // Copy registers to the stack |
| 2192 | 2273 | .register => |reg| blk: { |
| 2193 | const ty = inst.base.ty; | |
| 2194 | 2274 | const abi_size = math.cast(u32, ty.abiSize(self.target.*)) catch { |
| 2195 | return self.fail(inst.base.src, "type '{}' too big to fit into stack frame", .{ty}); | |
| 2275 | return self.fail("type '{}' too big to fit into stack frame", .{ty}); | |
| 2196 | 2276 | }; |
| 2197 | 2277 | const abi_align = ty.abiAlignment(self.target.*); |
| 2198 | const stack_offset = try self.allocMem(&inst.base, abi_size, abi_align); | |
| 2199 | try self.genSetStack(inst.base.src, ty, stack_offset, MCValue{ .register = reg }); | |
| 2278 | const stack_offset = try self.allocMem(inst, abi_size, abi_align); | |
| 2279 | try self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 2200 | 2280 | |
| 2201 | 2281 | break :blk MCValue{ .stack_offset = stack_offset }; |
| 2202 | 2282 | }, |
| ... | ... | @@ -2206,20 +2286,20 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2206 | 2286 | }; |
| 2207 | 2287 | try self.genArgDbgInfo(inst, mcv); |
| 2208 | 2288 | |
| 2209 | if (inst.base.isUnused()) | |
| 2210 | return MCValue.dead; | |
| 2289 | if (self.liveness.isUnused(inst)) | |
| 2290 | return self.finishAirBookkeeping(); | |
| 2211 | 2291 | |
| 2212 | 2292 | switch (mcv) { |
| 2213 | 2293 | .register => |reg| { |
| 2214 | self.register_manager.getRegAssumeFree(toCanonicalReg(reg), &inst.base); | |
| 2294 | self.register_manager.getRegAssumeFree(toCanonicalReg(reg), inst); | |
| 2215 | 2295 | }, |
| 2216 | 2296 | else => {}, |
| 2217 | 2297 | } |
| 2218 | 2298 | |
| 2219 | return mcv; | |
| 2299 | return self.finishAir(inst, mcv, .{ .none, .none, .none }); | |
| 2220 | 2300 | } |
| 2221 | 2301 | |
| 2222 | fn genBreakpoint(self: *Self, src: LazySrcLoc) !MCValue { | |
| 2302 | fn airBreakpoint(self: *Self) !void { | |
| 2223 | 2303 | switch (arch) { |
| 2224 | 2304 | .i386, .x86_64 => { |
| 2225 | 2305 | try self.code.append(0xcc); // int3 |
| ... | ... | @@ -2233,13 +2313,19 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2233 | 2313 | .aarch64 => { |
| 2234 | 2314 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.brk(1).toU32()); |
| 2235 | 2315 | }, |
| 2236 | else => return self.fail(src, "TODO implement @breakpoint() for {}", .{self.target.cpu.arch}), | |
| 2316 | else => return self.fail("TODO implement @breakpoint() for {}", .{self.target.cpu.arch}), | |
| 2237 | 2317 | } |
| 2238 | return .none; | |
| 2318 | return self.finishAirBookkeeping(); | |
| 2239 | 2319 | } |
| 2240 | 2320 | |
| 2241 | fn genCall(self: *Self, inst: *ir.Inst.Call) !MCValue { | |
| 2242 | var info = try self.resolveCallingConventionValues(inst.base.src, inst.func.ty); | |
| 2321 | fn airCall(self: *Self, inst: Air.Inst.Index) !void { | |
| 2322 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 2323 | const fn_ty = self.air.typeOf(pl_op.operand); | |
| 2324 | const callee = pl_op.operand; | |
| 2325 | const extra = self.air.extraData(Air.Call, pl_op.payload); | |
| 2326 | const args = @bitCast([]const Air.Inst.Ref, self.air.extra[extra.end..][0..extra.data.args_len]); | |
| 2327 | ||
| 2328 | var info = try self.resolveCallingConventionValues(fn_ty); | |
| 2243 | 2329 | defer info.deinit(self); |
| 2244 | 2330 | |
| 2245 | 2331 | // Due to incremental compilation, how function calls are generated depends |
| ... | ... | @@ -2248,26 +2334,27 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2248 | 2334 | switch (arch) { |
| 2249 | 2335 | .x86_64 => { |
| 2250 | 2336 | for (info.args) |mc_arg, arg_i| { |
| 2251 | const arg = inst.args[arg_i]; | |
| 2252 | const arg_mcv = try self.resolveInst(inst.args[arg_i]); | |
| 2337 | const arg = args[arg_i]; | |
| 2338 | const arg_ty = self.air.typeOf(arg); | |
| 2339 | const arg_mcv = try self.resolveInst(args[arg_i]); | |
| 2253 | 2340 | // Here we do not use setRegOrMem even though the logic is similar, because |
| 2254 | 2341 | // the function call will move the stack pointer, so the offsets are different. |
| 2255 | 2342 | switch (mc_arg) { |
| 2256 | 2343 | .none => continue, |
| 2257 | 2344 | .register => |reg| { |
| 2258 | 2345 | try self.register_manager.getReg(reg, null); |
| 2259 | try self.genSetReg(arg.src, arg.ty, reg, arg_mcv); | |
| 2346 | try self.genSetReg(arg_ty, reg, arg_mcv); | |
| 2260 | 2347 | }, |
| 2261 | 2348 | .stack_offset => |off| { |
| 2262 | 2349 | // Here we need to emit instructions like this: |
| 2263 | 2350 | // mov qword ptr [rsp + stack_offset], x |
| 2264 | try self.genSetStack(arg.src, arg.ty, off, arg_mcv); | |
| 2351 | try self.genSetStack(arg_ty, off, arg_mcv); | |
| 2265 | 2352 | }, |
| 2266 | 2353 | .ptr_stack_offset => { |
| 2267 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2354 | return self.fail("TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2268 | 2355 | }, |
| 2269 | 2356 | .ptr_embedded_in_code => { |
| 2270 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2357 | return self.fail("TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2271 | 2358 | }, |
| 2272 | 2359 | .undef => unreachable, |
| 2273 | 2360 | .immediate => unreachable, |
| ... | ... | @@ -2280,7 +2367,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2280 | 2367 | } |
| 2281 | 2368 | } |
| 2282 | 2369 | |
| 2283 | if (inst.func.value()) |func_value| { | |
| 2370 | if (self.air.value(callee)) |func_value| { | |
| 2284 | 2371 | if (func_value.castTag(.function)) |func_payload| { |
| 2285 | 2372 | const func = func_payload.data; |
| 2286 | 2373 | |
| ... | ... | @@ -2299,18 +2386,18 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2299 | 2386 | self.code.appendSliceAssumeCapacity(&[3]u8{ 0xff, 0x14, 0x25 }); |
| 2300 | 2387 | mem.writeIntLittle(u32, self.code.addManyAsArrayAssumeCapacity(4), got_addr); |
| 2301 | 2388 | } else if (func_value.castTag(.extern_fn)) |_| { |
| 2302 | return self.fail(inst.base.src, "TODO implement calling extern functions", .{}); | |
| 2389 | return self.fail("TODO implement calling extern functions", .{}); | |
| 2303 | 2390 | } else { |
| 2304 | return self.fail(inst.base.src, "TODO implement calling bitcasted functions", .{}); | |
| 2391 | return self.fail("TODO implement calling bitcasted functions", .{}); | |
| 2305 | 2392 | } |
| 2306 | 2393 | } else { |
| 2307 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2394 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2308 | 2395 | } |
| 2309 | 2396 | }, |
| 2310 | 2397 | .riscv64 => { |
| 2311 | if (info.args.len > 0) return self.fail(inst.base.src, "TODO implement fn args for {}", .{self.target.cpu.arch}); | |
| 2398 | if (info.args.len > 0) return self.fail("TODO implement fn args for {}", .{self.target.cpu.arch}); | |
| 2312 | 2399 | |
| 2313 | if (inst.func.value()) |func_value| { | |
| 2400 | if (self.air.value(callee)) |func_value| { | |
| 2314 | 2401 | if (func_value.castTag(.function)) |func_payload| { |
| 2315 | 2402 | const func = func_payload.data; |
| 2316 | 2403 | |
| ... | ... | @@ -2324,21 +2411,22 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2324 | 2411 | else |
| 2325 | 2412 | unreachable; |
| 2326 | 2413 | |
| 2327 | try self.genSetReg(inst.base.src, Type.initTag(.usize), .ra, .{ .memory = got_addr }); | |
| 2414 | try self.genSetReg(Type.initTag(.usize), .ra, .{ .memory = got_addr }); | |
| 2328 | 2415 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.jalr(.ra, 0, .ra).toU32()); |
| 2329 | 2416 | } else if (func_value.castTag(.extern_fn)) |_| { |
| 2330 | return self.fail(inst.base.src, "TODO implement calling extern functions", .{}); | |
| 2417 | return self.fail("TODO implement calling extern functions", .{}); | |
| 2331 | 2418 | } else { |
| 2332 | return self.fail(inst.base.src, "TODO implement calling bitcasted functions", .{}); | |
| 2419 | return self.fail("TODO implement calling bitcasted functions", .{}); | |
| 2333 | 2420 | } |
| 2334 | 2421 | } else { |
| 2335 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2422 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2336 | 2423 | } |
| 2337 | 2424 | }, |
| 2338 | 2425 | .arm, .armeb => { |
| 2339 | 2426 | for (info.args) |mc_arg, arg_i| { |
| 2340 | const arg = inst.args[arg_i]; | |
| 2341 | const arg_mcv = try self.resolveInst(inst.args[arg_i]); | |
| 2427 | const arg = args[arg_i]; | |
| 2428 | const arg_ty = self.air.typeOf(arg); | |
| 2429 | const arg_mcv = try self.resolveInst(args[arg_i]); | |
| 2342 | 2430 | |
| 2343 | 2431 | switch (mc_arg) { |
| 2344 | 2432 | .none => continue, |
| ... | ... | @@ -2352,21 +2440,21 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2352 | 2440 | .compare_flags_unsigned => unreachable, |
| 2353 | 2441 | .register => |reg| { |
| 2354 | 2442 | try self.register_manager.getReg(reg, null); |
| 2355 | try self.genSetReg(arg.src, arg.ty, reg, arg_mcv); | |
| 2443 | try self.genSetReg(arg_ty, reg, arg_mcv); | |
| 2356 | 2444 | }, |
| 2357 | 2445 | .stack_offset => { |
| 2358 | return self.fail(inst.base.src, "TODO implement calling with parameters in memory", .{}); | |
| 2446 | return self.fail("TODO implement calling with parameters in memory", .{}); | |
| 2359 | 2447 | }, |
| 2360 | 2448 | .ptr_stack_offset => { |
| 2361 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2449 | return self.fail("TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2362 | 2450 | }, |
| 2363 | 2451 | .ptr_embedded_in_code => { |
| 2364 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2452 | return self.fail("TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2365 | 2453 | }, |
| 2366 | 2454 | } |
| 2367 | 2455 | } |
| 2368 | 2456 | |
| 2369 | if (inst.func.value()) |func_value| { | |
| 2457 | if (self.air.value(callee)) |func_value| { | |
| 2370 | 2458 | if (func_value.castTag(.function)) |func_payload| { |
| 2371 | 2459 | const func = func_payload.data; |
| 2372 | 2460 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| ... | ... | @@ -2379,7 +2467,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2379 | 2467 | else |
| 2380 | 2468 | unreachable; |
| 2381 | 2469 | |
| 2382 | try self.genSetReg(inst.base.src, Type.initTag(.usize), .lr, .{ .memory = got_addr }); | |
| 2470 | try self.genSetReg(Type.initTag(.usize), .lr, .{ .memory = got_addr }); | |
| 2383 | 2471 | |
| 2384 | 2472 | // TODO: add Instruction.supportedOn |
| 2385 | 2473 | // function for ARM |
| ... | ... | @@ -2390,18 +2478,19 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2390 | 2478 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.bx(.al, .lr).toU32()); |
| 2391 | 2479 | } |
| 2392 | 2480 | } else if (func_value.castTag(.extern_fn)) |_| { |
| 2393 | return self.fail(inst.base.src, "TODO implement calling extern functions", .{}); | |
| 2481 | return self.fail("TODO implement calling extern functions", .{}); | |
| 2394 | 2482 | } else { |
| 2395 | return self.fail(inst.base.src, "TODO implement calling bitcasted functions", .{}); | |
| 2483 | return self.fail("TODO implement calling bitcasted functions", .{}); | |
| 2396 | 2484 | } |
| 2397 | 2485 | } else { |
| 2398 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2486 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2399 | 2487 | } |
| 2400 | 2488 | }, |
| 2401 | 2489 | .aarch64 => { |
| 2402 | 2490 | for (info.args) |mc_arg, arg_i| { |
| 2403 | const arg = inst.args[arg_i]; | |
| 2404 | const arg_mcv = try self.resolveInst(inst.args[arg_i]); | |
| 2491 | const arg = args[arg_i]; | |
| 2492 | const arg_ty = self.air.typeOf(arg); | |
| 2493 | const arg_mcv = try self.resolveInst(args[arg_i]); | |
| 2405 | 2494 | |
| 2406 | 2495 | switch (mc_arg) { |
| 2407 | 2496 | .none => continue, |
| ... | ... | @@ -2415,21 +2504,21 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2415 | 2504 | .compare_flags_unsigned => unreachable, |
| 2416 | 2505 | .register => |reg| { |
| 2417 | 2506 | try self.register_manager.getReg(reg, null); |
| 2418 | try self.genSetReg(arg.src, arg.ty, reg, arg_mcv); | |
| 2507 | try self.genSetReg(arg_ty, reg, arg_mcv); | |
| 2419 | 2508 | }, |
| 2420 | 2509 | .stack_offset => { |
| 2421 | return self.fail(inst.base.src, "TODO implement calling with parameters in memory", .{}); | |
| 2510 | return self.fail("TODO implement calling with parameters in memory", .{}); | |
| 2422 | 2511 | }, |
| 2423 | 2512 | .ptr_stack_offset => { |
| 2424 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2513 | return self.fail("TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2425 | 2514 | }, |
| 2426 | 2515 | .ptr_embedded_in_code => { |
| 2427 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2516 | return self.fail("TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2428 | 2517 | }, |
| 2429 | 2518 | } |
| 2430 | 2519 | } |
| 2431 | 2520 | |
| 2432 | if (inst.func.value()) |func_value| { | |
| 2521 | if (self.air.value(callee)) |func_value| { | |
| 2433 | 2522 | if (func_value.castTag(.function)) |func_payload| { |
| 2434 | 2523 | const func = func_payload.data; |
| 2435 | 2524 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| ... | ... | @@ -2442,24 +2531,25 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2442 | 2531 | else |
| 2443 | 2532 | unreachable; |
| 2444 | 2533 | |
| 2445 | try self.genSetReg(inst.base.src, Type.initTag(.usize), .x30, .{ .memory = got_addr }); | |
| 2534 | try self.genSetReg(Type.initTag(.usize), .x30, .{ .memory = got_addr }); | |
| 2446 | 2535 | |
| 2447 | 2536 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.blr(.x30).toU32()); |
| 2448 | 2537 | } else if (func_value.castTag(.extern_fn)) |_| { |
| 2449 | return self.fail(inst.base.src, "TODO implement calling extern functions", .{}); | |
| 2538 | return self.fail("TODO implement calling extern functions", .{}); | |
| 2450 | 2539 | } else { |
| 2451 | return self.fail(inst.base.src, "TODO implement calling bitcasted functions", .{}); | |
| 2540 | return self.fail("TODO implement calling bitcasted functions", .{}); | |
| 2452 | 2541 | } |
| 2453 | 2542 | } else { |
| 2454 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2543 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2455 | 2544 | } |
| 2456 | 2545 | }, |
| 2457 | else => return self.fail(inst.base.src, "TODO implement call for {}", .{self.target.cpu.arch}), | |
| 2546 | else => return self.fail("TODO implement call for {}", .{self.target.cpu.arch}), | |
| 2458 | 2547 | } |
| 2459 | 2548 | } else if (self.bin_file.cast(link.File.MachO)) |macho_file| { |
| 2460 | 2549 | for (info.args) |mc_arg, arg_i| { |
| 2461 | const arg = inst.args[arg_i]; | |
| 2462 | const arg_mcv = try self.resolveInst(inst.args[arg_i]); | |
| 2550 | const arg = args[arg_i]; | |
| 2551 | const arg_ty = self.air.typeOf(arg); | |
| 2552 | const arg_mcv = try self.resolveInst(args[arg_i]); | |
| 2463 | 2553 | // Here we do not use setRegOrMem even though the logic is similar, because |
| 2464 | 2554 | // the function call will move the stack pointer, so the offsets are different. |
| 2465 | 2555 | switch (mc_arg) { |
| ... | ... | @@ -2470,18 +2560,18 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2470 | 2560 | .x86_64, .aarch64 => try self.register_manager.getReg(reg, null), |
| 2471 | 2561 | else => unreachable, |
| 2472 | 2562 | } |
| 2473 | try self.genSetReg(arg.src, arg.ty, reg, arg_mcv); | |
| 2563 | try self.genSetReg(arg_ty, reg, arg_mcv); | |
| 2474 | 2564 | }, |
| 2475 | 2565 | .stack_offset => { |
| 2476 | 2566 | // Here we need to emit instructions like this: |
| 2477 | 2567 | // mov qword ptr [rsp + stack_offset], x |
| 2478 | return self.fail(inst.base.src, "TODO implement calling with parameters in memory", .{}); | |
| 2568 | return self.fail("TODO implement calling with parameters in memory", .{}); | |
| 2479 | 2569 | }, |
| 2480 | 2570 | .ptr_stack_offset => { |
| 2481 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2571 | return self.fail("TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2482 | 2572 | }, |
| 2483 | 2573 | .ptr_embedded_in_code => { |
| 2484 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2574 | return self.fail("TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2485 | 2575 | }, |
| 2486 | 2576 | .undef => unreachable, |
| 2487 | 2577 | .immediate => unreachable, |
| ... | ... | @@ -2494,7 +2584,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2494 | 2584 | } |
| 2495 | 2585 | } |
| 2496 | 2586 | |
| 2497 | if (inst.func.value()) |func_value| { | |
| 2587 | if (self.air.value(callee)) |func_value| { | |
| 2498 | 2588 | if (func_value.castTag(.function)) |func_payload| { |
| 2499 | 2589 | const func = func_payload.data; |
| 2500 | 2590 | const got_addr = blk: { |
| ... | ... | @@ -2508,13 +2598,13 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2508 | 2598 | }; |
| 2509 | 2599 | switch (arch) { |
| 2510 | 2600 | .x86_64 => { |
| 2511 | try self.genSetReg(inst.base.src, Type.initTag(.u64), .rax, .{ .memory = got_addr }); | |
| 2601 | try self.genSetReg(Type.initTag(.u64), .rax, .{ .memory = got_addr }); | |
| 2512 | 2602 | // callq *%rax |
| 2513 | 2603 | try self.code.ensureCapacity(self.code.items.len + 2); |
| 2514 | 2604 | self.code.appendSliceAssumeCapacity(&[2]u8{ 0xff, 0xd0 }); |
| 2515 | 2605 | }, |
| 2516 | 2606 | .aarch64 => { |
| 2517 | try self.genSetReg(inst.base.src, Type.initTag(.u64), .x30, .{ .memory = got_addr }); | |
| 2607 | try self.genSetReg(Type.initTag(.u64), .x30, .{ .memory = got_addr }); | |
| 2518 | 2608 | // blr x30 |
| 2519 | 2609 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.blr(.x30).toU32()); |
| 2520 | 2610 | }, |
| ... | ... | @@ -2550,35 +2640,36 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2550 | 2640 | } }, |
| 2551 | 2641 | }); |
| 2552 | 2642 | } else { |
| 2553 | return self.fail(inst.base.src, "TODO implement calling bitcasted functions", .{}); | |
| 2643 | return self.fail("TODO implement calling bitcasted functions", .{}); | |
| 2554 | 2644 | } |
| 2555 | 2645 | } else { |
| 2556 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2646 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2557 | 2647 | } |
| 2558 | 2648 | } else if (self.bin_file.cast(link.File.Plan9)) |p9| { |
| 2559 | 2649 | switch (arch) { |
| 2560 | 2650 | .x86_64 => { |
| 2561 | 2651 | for (info.args) |mc_arg, arg_i| { |
| 2562 | const arg = inst.args[arg_i]; | |
| 2563 | const arg_mcv = try self.resolveInst(inst.args[arg_i]); | |
| 2652 | const arg = args[arg_i]; | |
| 2653 | const arg_ty = self.air.typeOf(arg); | |
| 2654 | const arg_mcv = try self.resolveInst(args[arg_i]); | |
| 2564 | 2655 | // Here we do not use setRegOrMem even though the logic is similar, because |
| 2565 | 2656 | // the function call will move the stack pointer, so the offsets are different. |
| 2566 | 2657 | switch (mc_arg) { |
| 2567 | 2658 | .none => continue, |
| 2568 | 2659 | .register => |reg| { |
| 2569 | 2660 | try self.register_manager.getReg(reg, null); |
| 2570 | try self.genSetReg(arg.src, arg.ty, reg, arg_mcv); | |
| 2661 | try self.genSetReg(arg_ty, reg, arg_mcv); | |
| 2571 | 2662 | }, |
| 2572 | 2663 | .stack_offset => { |
| 2573 | 2664 | // Here we need to emit instructions like this: |
| 2574 | 2665 | // mov qword ptr [rsp + stack_offset], x |
| 2575 | return self.fail(inst.base.src, "TODO implement calling with parameters in memory", .{}); | |
| 2666 | return self.fail("TODO implement calling with parameters in memory", .{}); | |
| 2576 | 2667 | }, |
| 2577 | 2668 | .ptr_stack_offset => { |
| 2578 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2669 | return self.fail("TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2579 | 2670 | }, |
| 2580 | 2671 | .ptr_embedded_in_code => { |
| 2581 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2672 | return self.fail("TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2582 | 2673 | }, |
| 2583 | 2674 | .undef => unreachable, |
| 2584 | 2675 | .immediate => unreachable, |
| ... | ... | @@ -2590,7 +2681,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2590 | 2681 | .compare_flags_unsigned => unreachable, |
| 2591 | 2682 | } |
| 2592 | 2683 | } |
| 2593 | if (inst.func.value()) |func_value| { | |
| 2684 | if (self.air.value(callee)) |func_value| { | |
| 2594 | 2685 | if (func_value.castTag(.function)) |func_payload| { |
| 2595 | 2686 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| 2596 | 2687 | const ptr_bytes: u64 = @divExact(ptr_bits, 8); |
| ... | ... | @@ -2601,15 +2692,16 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2601 | 2692 | self.code.appendSliceAssumeCapacity(&[3]u8{ 0xff, 0x14, 0x25 }); |
| 2602 | 2693 | const fn_got_addr = got_addr + got_index * ptr_bytes; |
| 2603 | 2694 | mem.writeIntLittle(u32, self.code.addManyAsArrayAssumeCapacity(4), @intCast(u32, fn_got_addr)); |
| 2604 | } else return self.fail(inst.base.src, "TODO implement calling extern fn on plan9", .{}); | |
| 2695 | } else return self.fail("TODO implement calling extern fn on plan9", .{}); | |
| 2605 | 2696 | } else { |
| 2606 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2697 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2607 | 2698 | } |
| 2608 | 2699 | }, |
| 2609 | 2700 | .aarch64 => { |
| 2610 | 2701 | for (info.args) |mc_arg, arg_i| { |
| 2611 | const arg = inst.args[arg_i]; | |
| 2612 | const arg_mcv = try self.resolveInst(inst.args[arg_i]); | |
| 2702 | const arg = args[arg_i]; | |
| 2703 | const arg_ty = self.air.typeOf(arg); | |
| 2704 | const arg_mcv = try self.resolveInst(args[arg_i]); | |
| 2613 | 2705 | |
| 2614 | 2706 | switch (mc_arg) { |
| 2615 | 2707 | .none => continue, |
| ... | ... | @@ -2623,20 +2715,20 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2623 | 2715 | .compare_flags_unsigned => unreachable, |
| 2624 | 2716 | .register => |reg| { |
| 2625 | 2717 | try self.register_manager.getReg(reg, null); |
| 2626 | try self.genSetReg(arg.src, arg.ty, reg, arg_mcv); | |
| 2718 | try self.genSetReg(arg_ty, reg, arg_mcv); | |
| 2627 | 2719 | }, |
| 2628 | 2720 | .stack_offset => { |
| 2629 | return self.fail(inst.base.src, "TODO implement calling with parameters in memory", .{}); | |
| 2721 | return self.fail("TODO implement calling with parameters in memory", .{}); | |
| 2630 | 2722 | }, |
| 2631 | 2723 | .ptr_stack_offset => { |
| 2632 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2724 | return self.fail("TODO implement calling with MCValue.ptr_stack_offset arg", .{}); | |
| 2633 | 2725 | }, |
| 2634 | 2726 | .ptr_embedded_in_code => { |
| 2635 | return self.fail(inst.base.src, "TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2727 | return self.fail("TODO implement calling with MCValue.ptr_embedded_in_code arg", .{}); | |
| 2636 | 2728 | }, |
| 2637 | 2729 | } |
| 2638 | 2730 | } |
| 2639 | if (inst.func.value()) |func_value| { | |
| 2731 | if (self.air.value(callee)) |func_value| { | |
| 2640 | 2732 | if (func_value.castTag(.function)) |func_payload| { |
| 2641 | 2733 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| 2642 | 2734 | const ptr_bytes: u64 = @divExact(ptr_bits, 8); |
| ... | ... | @@ -2644,65 +2736,84 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2644 | 2736 | const got_index = func_payload.data.owner_decl.link.plan9.got_index.?; |
| 2645 | 2737 | const fn_got_addr = got_addr + got_index * ptr_bytes; |
| 2646 | 2738 | |
| 2647 | try self.genSetReg(inst.base.src, Type.initTag(.usize), .x30, .{ .memory = fn_got_addr }); | |
| 2739 | try self.genSetReg(Type.initTag(.usize), .x30, .{ .memory = fn_got_addr }); | |
| 2648 | 2740 | |
| 2649 | 2741 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.blr(.x30).toU32()); |
| 2650 | 2742 | } else if (func_value.castTag(.extern_fn)) |_| { |
| 2651 | return self.fail(inst.base.src, "TODO implement calling extern functions", .{}); | |
| 2743 | return self.fail("TODO implement calling extern functions", .{}); | |
| 2652 | 2744 | } else { |
| 2653 | return self.fail(inst.base.src, "TODO implement calling bitcasted functions", .{}); | |
| 2745 | return self.fail("TODO implement calling bitcasted functions", .{}); | |
| 2654 | 2746 | } |
| 2655 | 2747 | } else { |
| 2656 | return self.fail(inst.base.src, "TODO implement calling runtime known function pointer", .{}); | |
| 2748 | return self.fail("TODO implement calling runtime known function pointer", .{}); | |
| 2657 | 2749 | } |
| 2658 | 2750 | }, |
| 2659 | else => return self.fail(inst.base.src, "TODO implement call on plan9 for {}", .{self.target.cpu.arch}), | |
| 2751 | else => return self.fail("TODO implement call on plan9 for {}", .{self.target.cpu.arch}), | |
| 2660 | 2752 | } |
| 2661 | 2753 | } else unreachable; |
| 2662 | 2754 | |
| 2663 | switch (info.return_value) { | |
| 2664 | .register => |reg| { | |
| 2665 | if (Register.allocIndex(reg) == null) { | |
| 2666 | // Save function return value in a callee saved register | |
| 2667 | return try self.copyToNewRegister(&inst.base, info.return_value); | |
| 2668 | } | |
| 2669 | }, | |
| 2670 | else => {}, | |
| 2671 | } | |
| 2755 | const result: MCValue = result: { | |
| 2756 | switch (info.return_value) { | |
| 2757 | .register => |reg| { | |
| 2758 | if (Register.allocIndex(reg) == null) { | |
| 2759 | // Save function return value in a callee saved register | |
| 2760 | break :result try self.copyToNewRegister(inst, info.return_value); | |
| 2761 | } | |
| 2762 | }, | |
| 2763 | else => {}, | |
| 2764 | } | |
| 2765 | break :result info.return_value; | |
| 2766 | }; | |
| 2672 | 2767 | |
| 2673 | return info.return_value; | |
| 2768 | if (args.len <= Liveness.bpi - 2) { | |
| 2769 | var buf = [1]Air.Inst.Ref{.none} ** (Liveness.bpi - 1); | |
| 2770 | buf[0] = callee; | |
| 2771 | std.mem.copy(Air.Inst.Ref, buf[1..], args); | |
| 2772 | return self.finishAir(inst, result, buf); | |
| 2773 | } | |
| 2774 | var bt = try self.iterateBigTomb(inst, 1 + args.len); | |
| 2775 | bt.feed(callee); | |
| 2776 | for (args) |arg| { | |
| 2777 | bt.feed(arg); | |
| 2778 | } | |
| 2779 | return bt.finishAir(result); | |
| 2674 | 2780 | } |
| 2675 | 2781 | |
| 2676 | fn genRef(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 2677 | const operand = try self.resolveInst(inst.operand); | |
| 2678 | switch (operand) { | |
| 2679 | .unreach => unreachable, | |
| 2680 | .dead => unreachable, | |
| 2681 | .none => return .none, | |
| 2682 | ||
| 2683 | .immediate, | |
| 2684 | .register, | |
| 2685 | .ptr_stack_offset, | |
| 2686 | .ptr_embedded_in_code, | |
| 2687 | .compare_flags_unsigned, | |
| 2688 | .compare_flags_signed, | |
| 2689 | => { | |
| 2690 | const stack_offset = try self.allocMemPtr(&inst.base); | |
| 2691 | try self.genSetStack(inst.base.src, inst.operand.ty, stack_offset, operand); | |
| 2692 | return MCValue{ .ptr_stack_offset = stack_offset }; | |
| 2693 | }, | |
| 2782 | fn airRef(self: *Self, inst: Air.Inst.Index) !void { | |
| 2783 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 2784 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 2785 | const operand_ty = self.air.typeOf(ty_op.operand); | |
| 2786 | const operand = try self.resolveInst(ty_op.operand); | |
| 2787 | switch (operand) { | |
| 2788 | .unreach => unreachable, | |
| 2789 | .dead => unreachable, | |
| 2790 | .none => break :result MCValue{ .none = {} }, | |
| 2791 | ||
| 2792 | .immediate, | |
| 2793 | .register, | |
| 2794 | .ptr_stack_offset, | |
| 2795 | .ptr_embedded_in_code, | |
| 2796 | .compare_flags_unsigned, | |
| 2797 | .compare_flags_signed, | |
| 2798 | => { | |
| 2799 | const stack_offset = try self.allocMemPtr(inst); | |
| 2800 | try self.genSetStack(operand_ty, stack_offset, operand); | |
| 2801 | break :result MCValue{ .ptr_stack_offset = stack_offset }; | |
| 2802 | }, | |
| 2694 | 2803 | |
| 2695 | .stack_offset => |offset| return MCValue{ .ptr_stack_offset = offset }, | |
| 2696 | .embedded_in_code => |offset| return MCValue{ .ptr_embedded_in_code = offset }, | |
| 2697 | .memory => |vaddr| return MCValue{ .immediate = vaddr }, | |
| 2804 | .stack_offset => |offset| break :result MCValue{ .ptr_stack_offset = offset }, | |
| 2805 | .embedded_in_code => |offset| break :result MCValue{ .ptr_embedded_in_code = offset }, | |
| 2806 | .memory => |vaddr| break :result MCValue{ .immediate = vaddr }, | |
| 2698 | 2807 | |
| 2699 | .undef => return self.fail(inst.base.src, "TODO implement ref on an undefined value", .{}), | |
| 2700 | } | |
| 2808 | .undef => return self.fail("TODO implement ref on an undefined value", .{}), | |
| 2809 | } | |
| 2810 | }; | |
| 2811 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 2701 | 2812 | } |
| 2702 | 2813 | |
| 2703 | fn ret(self: *Self, src: LazySrcLoc, mcv: MCValue) !MCValue { | |
| 2814 | fn ret(self: *Self, mcv: MCValue) !void { | |
| 2704 | 2815 | const ret_ty = self.fn_type.fnReturnType(); |
| 2705 | try self.setRegOrMem(src, ret_ty, self.ret_mcv, mcv); | |
| 2816 | try self.setRegOrMem(ret_ty, self.ret_mcv, mcv); | |
| 2706 | 2817 | switch (arch) { |
| 2707 | 2818 | .i386 => { |
| 2708 | 2819 | try self.code.append(0xc3); // ret |
| ... | ... | @@ -2728,58 +2839,54 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2728 | 2839 | try self.code.resize(self.code.items.len + 4); |
| 2729 | 2840 | try self.exitlude_jump_relocs.append(self.gpa, self.code.items.len - 4); |
| 2730 | 2841 | }, |
| 2731 | else => return self.fail(src, "TODO implement return for {}", .{self.target.cpu.arch}), | |
| 2842 | else => return self.fail("TODO implement return for {}", .{self.target.cpu.arch}), | |
| 2732 | 2843 | } |
| 2733 | return .unreach; | |
| 2734 | 2844 | } |
| 2735 | 2845 | |
| 2736 | fn genRet(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 2737 | const operand = try self.resolveInst(inst.operand); | |
| 2738 | return self.ret(inst.base.src, operand); | |
| 2846 | fn airRet(self: *Self, inst: Air.Inst.Index) !void { | |
| 2847 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 2848 | const operand = try self.resolveInst(un_op); | |
| 2849 | try self.ret(operand); | |
| 2850 | return self.finishAir(inst, .dead, .{ un_op, .none, .none }); | |
| 2739 | 2851 | } |
| 2740 | 2852 | |
| 2741 | fn genRetVoid(self: *Self, inst: *ir.Inst.NoOp) !MCValue { | |
| 2742 | return self.ret(inst.base.src, .none); | |
| 2743 | } | |
| 2744 | ||
| 2745 | fn genCmp(self: *Self, inst: *ir.Inst.BinOp, op: math.CompareOperator) !MCValue { | |
| 2746 | // No side effects, so if it's unreferenced, do nothing. | |
| 2747 | if (inst.base.isUnused()) | |
| 2748 | return MCValue{ .dead = {} }; | |
| 2749 | if (inst.lhs.ty.zigTypeTag() == .ErrorSet or inst.rhs.ty.zigTypeTag() == .ErrorSet) | |
| 2750 | return self.fail(inst.base.src, "TODO implement cmp for errors", .{}); | |
| 2751 | switch (arch) { | |
| 2752 | .x86_64 => { | |
| 2853 | fn airCmp(self: *Self, inst: Air.Inst.Index, op: math.CompareOperator) !void { | |
| 2854 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 2855 | if (self.liveness.isUnused(inst)) | |
| 2856 | return self.finishAir(inst, .dead, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 2857 | const ty = self.air.typeOf(bin_op.lhs); | |
| 2858 | assert(ty.eql(self.air.typeOf(bin_op.rhs))); | |
| 2859 | if (ty.zigTypeTag() == .ErrorSet) | |
| 2860 | return self.fail("TODO implement cmp for errors", .{}); | |
| 2861 | ||
| 2862 | const lhs = try self.resolveInst(bin_op.lhs); | |
| 2863 | const rhs = try self.resolveInst(bin_op.rhs); | |
| 2864 | const result: MCValue = switch (arch) { | |
| 2865 | .x86_64 => result: { | |
| 2753 | 2866 | try self.code.ensureCapacity(self.code.items.len + 8); |
| 2754 | 2867 | |
| 2755 | const lhs = try self.resolveInst(inst.lhs); | |
| 2756 | const rhs = try self.resolveInst(inst.rhs); | |
| 2757 | ||
| 2758 | 2868 | // There are 2 operands, destination and source. |
| 2759 | 2869 | // Either one, but not both, can be a memory operand. |
| 2760 | 2870 | // Source operand can be an immediate, 8 bits or 32 bits. |
| 2761 | 2871 | const dst_mcv = if (lhs.isImmediate() or (lhs.isMemory() and rhs.isMemory())) |
| 2762 | try self.copyToNewRegister(&inst.base, lhs) | |
| 2872 | try self.copyToNewRegister(inst, lhs) | |
| 2763 | 2873 | else |
| 2764 | 2874 | lhs; |
| 2765 | 2875 | // This instruction supports only signed 32-bit immediates at most. |
| 2766 | const src_mcv = try self.limitImmediateType(inst.rhs, i32); | |
| 2876 | const src_mcv = try self.limitImmediateType(bin_op.rhs, i32); | |
| 2767 | 2877 | |
| 2768 | try self.genX8664BinMathCode(inst.base.src, inst.base.ty, dst_mcv, src_mcv, 7, 0x38); | |
| 2769 | const info = inst.lhs.ty.intInfo(self.target.*); | |
| 2770 | return switch (info.signedness) { | |
| 2878 | try self.genX8664BinMathCode(Type.initTag(.bool), dst_mcv, src_mcv, 7, 0x38); | |
| 2879 | const info = ty.intInfo(self.target.*); | |
| 2880 | break :result switch (info.signedness) { | |
| 2771 | 2881 | .signed => MCValue{ .compare_flags_signed = op }, |
| 2772 | 2882 | .unsigned => MCValue{ .compare_flags_unsigned = op }, |
| 2773 | 2883 | }; |
| 2774 | 2884 | }, |
| 2775 | .arm, .armeb => { | |
| 2776 | const lhs = try self.resolveInst(inst.lhs); | |
| 2777 | const rhs = try self.resolveInst(inst.rhs); | |
| 2778 | ||
| 2885 | .arm, .armeb => result: { | |
| 2779 | 2886 | const lhs_is_register = lhs == .register; |
| 2780 | 2887 | const rhs_is_register = rhs == .register; |
| 2781 | 2888 | // lhs should always be a register |
| 2782 | const rhs_should_be_register = try self.armOperandShouldBeRegister(inst.rhs.src, rhs); | |
| 2889 | const rhs_should_be_register = try self.armOperandShouldBeRegister(rhs); | |
| 2783 | 2890 | |
| 2784 | 2891 | var lhs_mcv = lhs; |
| 2785 | 2892 | var rhs_mcv = rhs; |
| ... | ... | @@ -2787,53 +2894,57 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2787 | 2894 | // Allocate registers |
| 2788 | 2895 | if (rhs_should_be_register) { |
| 2789 | 2896 | if (!lhs_is_register and !rhs_is_register) { |
| 2790 | const regs = try self.register_manager.allocRegs(2, .{ inst.rhs, inst.lhs }, &.{}); | |
| 2897 | const regs = try self.register_manager.allocRegs(2, .{ | |
| 2898 | Air.refToIndex(bin_op.rhs).?, Air.refToIndex(bin_op.lhs).?, | |
| 2899 | }, &.{}); | |
| 2791 | 2900 | lhs_mcv = MCValue{ .register = regs[0] }; |
| 2792 | 2901 | rhs_mcv = MCValue{ .register = regs[1] }; |
| 2793 | 2902 | } else if (!rhs_is_register) { |
| 2794 | rhs_mcv = MCValue{ .register = try self.register_manager.allocReg(inst.rhs, &.{}) }; | |
| 2903 | rhs_mcv = MCValue{ .register = try self.register_manager.allocReg(Air.refToIndex(bin_op.rhs).?, &.{}) }; | |
| 2795 | 2904 | } |
| 2796 | 2905 | } |
| 2797 | 2906 | if (!lhs_is_register) { |
| 2798 | lhs_mcv = MCValue{ .register = try self.register_manager.allocReg(inst.lhs, &.{}) }; | |
| 2907 | lhs_mcv = MCValue{ .register = try self.register_manager.allocReg(Air.refToIndex(bin_op.lhs).?, &.{}) }; | |
| 2799 | 2908 | } |
| 2800 | 2909 | |
| 2801 | 2910 | // Move the operands to the newly allocated registers |
| 2802 | 2911 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 2803 | 2912 | if (lhs_mcv == .register and !lhs_is_register) { |
| 2804 | try self.genSetReg(inst.lhs.src, inst.lhs.ty, lhs_mcv.register, lhs); | |
| 2805 | branch.inst_table.putAssumeCapacity(inst.lhs, lhs); | |
| 2913 | try self.genSetReg(ty, lhs_mcv.register, lhs); | |
| 2914 | branch.inst_table.putAssumeCapacity(Air.refToIndex(bin_op.lhs).?, lhs); | |
| 2806 | 2915 | } |
| 2807 | 2916 | if (rhs_mcv == .register and !rhs_is_register) { |
| 2808 | try self.genSetReg(inst.rhs.src, inst.rhs.ty, rhs_mcv.register, rhs); | |
| 2809 | branch.inst_table.putAssumeCapacity(inst.rhs, rhs); | |
| 2917 | try self.genSetReg(ty, rhs_mcv.register, rhs); | |
| 2918 | branch.inst_table.putAssumeCapacity(Air.refToIndex(bin_op.rhs).?, rhs); | |
| 2810 | 2919 | } |
| 2811 | 2920 | |
| 2812 | 2921 | // The destination register is not present in the cmp instruction |
| 2813 | try self.genArmBinOpCode(inst.base.src, undefined, lhs_mcv, rhs_mcv, false, .cmp_eq); | |
| 2922 | try self.genArmBinOpCode(undefined, lhs_mcv, rhs_mcv, false, .cmp_eq); | |
| 2814 | 2923 | |
| 2815 | const info = inst.lhs.ty.intInfo(self.target.*); | |
| 2816 | return switch (info.signedness) { | |
| 2924 | const info = ty.intInfo(self.target.*); | |
| 2925 | break :result switch (info.signedness) { | |
| 2817 | 2926 | .signed => MCValue{ .compare_flags_signed = op }, |
| 2818 | 2927 | .unsigned => MCValue{ .compare_flags_unsigned = op }, |
| 2819 | 2928 | }; |
| 2820 | 2929 | }, |
| 2821 | else => return self.fail(inst.base.src, "TODO implement cmp for {}", .{self.target.cpu.arch}), | |
| 2822 | } | |
| 2930 | else => return self.fail("TODO implement cmp for {}", .{self.target.cpu.arch}), | |
| 2931 | }; | |
| 2932 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 2823 | 2933 | } |
| 2824 | 2934 | |
| 2825 | fn genDbgStmt(self: *Self, inst: *ir.Inst.DbgStmt) !MCValue { | |
| 2826 | // TODO when reworking AIR memory layout, rework source locations here as | |
| 2827 | // well to be more efficient, as well as support inlined function calls correctly. | |
| 2828 | // For now we convert LazySrcLoc to absolute byte offset, to match what the | |
| 2829 | // existing codegen code expects. | |
| 2830 | try self.dbgAdvancePCAndLine(inst.line, inst.column); | |
| 2831 | assert(inst.base.isUnused()); | |
| 2832 | return MCValue.dead; | |
| 2935 | fn airDbgStmt(self: *Self, inst: Air.Inst.Index) !void { | |
| 2936 | const dbg_stmt = self.air.instructions.items(.data)[inst].dbg_stmt; | |
| 2937 | try self.dbgAdvancePCAndLine(dbg_stmt.line, dbg_stmt.column); | |
| 2938 | return self.finishAirBookkeeping(); | |
| 2833 | 2939 | } |
| 2834 | 2940 | |
| 2835 | fn genCondBr(self: *Self, inst: *ir.Inst.CondBr) !MCValue { | |
| 2836 | const cond = try self.resolveInst(inst.condition); | |
| 2941 | fn airCondBr(self: *Self, inst: Air.Inst.Index) !void { | |
| 2942 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 2943 | const cond = try self.resolveInst(pl_op.operand); | |
| 2944 | const extra = self.air.extraData(Air.CondBr, pl_op.payload); | |
| 2945 | const then_body = self.air.extra[extra.end..][0..extra.data.then_body_len]; | |
| 2946 | const else_body = self.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; | |
| 2947 | const liveness_condbr = self.liveness.getCondBr(inst); | |
| 2837 | 2948 | |
| 2838 | 2949 | const reloc: Reloc = switch (arch) { |
| 2839 | 2950 | .i386, .x86_64 => reloc: { |
| ... | ... | @@ -2882,7 +2993,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2882 | 2993 | encoder.disp8(1); |
| 2883 | 2994 | break :blk 0x84; |
| 2884 | 2995 | }, |
| 2885 | else => return self.fail(inst.base.src, "TODO implement condbr {s} when condition is {s}", .{ self.target.cpu.arch, @tagName(cond) }), | |
| 2996 | else => return self.fail("TODO implement condbr {s} when condition is {s}", .{ self.target.cpu.arch, @tagName(cond) }), | |
| 2886 | 2997 | }; |
| 2887 | 2998 | self.code.appendSliceAssumeCapacity(&[_]u8{ 0x0f, opcode }); |
| 2888 | 2999 | const reloc = Reloc{ .rel32 = self.code.items.len }; |
| ... | ... | @@ -2908,7 +3019,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2908 | 3019 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.cmp(.al, reg, op).toU32()); |
| 2909 | 3020 | break :blk .ne; |
| 2910 | 3021 | }, |
| 2911 | else => return self.fail(inst.base.src, "TODO implement condbr {} when condition is {s}", .{ self.target.cpu.arch, @tagName(cond) }), | |
| 3022 | else => return self.fail("TODO implement condbr {} when condition is {s}", .{ self.target.cpu.arch, @tagName(cond) }), | |
| 2912 | 3023 | }; |
| 2913 | 3024 | |
| 2914 | 3025 | const reloc = Reloc{ |
| ... | ... | @@ -2920,7 +3031,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2920 | 3031 | try self.code.resize(self.code.items.len + 4); |
| 2921 | 3032 | break :reloc reloc; |
| 2922 | 3033 | }, |
| 2923 | else => return self.fail(inst.base.src, "TODO implement condbr {}", .{self.target.cpu.arch}), | |
| 3034 | else => return self.fail("TODO implement condbr {}", .{self.target.cpu.arch}), | |
| 2924 | 3035 | }; |
| 2925 | 3036 | |
| 2926 | 3037 | // Capture the state of register and stack allocation state so that we can revert to it. |
| ... | ... | @@ -2932,12 +3043,11 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2932 | 3043 | |
| 2933 | 3044 | try self.branch_stack.append(.{}); |
| 2934 | 3045 | |
| 2935 | const then_deaths = inst.thenDeaths(); | |
| 2936 | try self.ensureProcessDeathCapacity(then_deaths.len); | |
| 2937 | for (then_deaths) |operand| { | |
| 3046 | try self.ensureProcessDeathCapacity(liveness_condbr.then_deaths.len); | |
| 3047 | for (liveness_condbr.then_deaths) |operand| { | |
| 2938 | 3048 | self.processDeath(operand); |
| 2939 | 3049 | } |
| 2940 | try self.genBody(inst.then_body); | |
| 3050 | try self.genBody(then_body); | |
| 2941 | 3051 | |
| 2942 | 3052 | // Revert to the previous register and stack allocation state. |
| 2943 | 3053 | |
| ... | ... | @@ -2953,16 +3063,15 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2953 | 3063 | self.next_stack_offset = parent_next_stack_offset; |
| 2954 | 3064 | self.register_manager.free_registers = parent_free_registers; |
| 2955 | 3065 | |
| 2956 | try self.performReloc(inst.base.src, reloc); | |
| 3066 | try self.performReloc(reloc); | |
| 2957 | 3067 | const else_branch = self.branch_stack.addOneAssumeCapacity(); |
| 2958 | 3068 | else_branch.* = .{}; |
| 2959 | 3069 | |
| 2960 | const else_deaths = inst.elseDeaths(); | |
| 2961 | try self.ensureProcessDeathCapacity(else_deaths.len); | |
| 2962 | for (else_deaths) |operand| { | |
| 3070 | try self.ensureProcessDeathCapacity(liveness_condbr.else_deaths.len); | |
| 3071 | for (liveness_condbr.else_deaths) |operand| { | |
| 2963 | 3072 | self.processDeath(operand); |
| 2964 | 3073 | } |
| 2965 | try self.genBody(inst.else_body); | |
| 3074 | try self.genBody(else_body); | |
| 2966 | 3075 | |
| 2967 | 3076 | // At this point, each branch will possibly have conflicting values for where |
| 2968 | 3077 | // each instruction is stored. They agree, however, on which instructions are alive/dead. |
| ... | ... | @@ -2973,8 +3082,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 2973 | 3082 | // assert that parent_branch.free_registers equals the saved_then_branch.free_registers |
| 2974 | 3083 | // rather than assigning it. |
| 2975 | 3084 | const parent_branch = &self.branch_stack.items[self.branch_stack.items.len - 2]; |
| 2976 | try parent_branch.inst_table.ensureCapacity(self.gpa, parent_branch.inst_table.count() + | |
| 2977 | else_branch.inst_table.count()); | |
| 3085 | try parent_branch.inst_table.ensureUnusedCapacity(self.gpa, else_branch.inst_table.count()); | |
| 2978 | 3086 | |
| 2979 | 3087 | const else_slice = else_branch.inst_table.entries.slice(); |
| 2980 | 3088 | const else_keys = else_slice.items(.key); |
| ... | ... | @@ -3002,14 +3110,13 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3002 | 3110 | } |
| 3003 | 3111 | } |
| 3004 | 3112 | }; |
| 3005 | log.debug("consolidating else_entry {*} {}=>{}", .{ else_key, else_value, canon_mcv }); | |
| 3113 | log.debug("consolidating else_entry {d} {}=>{}", .{ else_key, else_value, canon_mcv }); | |
| 3006 | 3114 | // TODO make sure the destination stack offset / register does not already have something |
| 3007 | 3115 | // going on there. |
| 3008 | try self.setRegOrMem(inst.base.src, else_key.ty, canon_mcv, else_value); | |
| 3116 | try self.setRegOrMem(self.air.typeOfIndex(else_key), canon_mcv, else_value); | |
| 3009 | 3117 | // TODO track the new register / stack allocation |
| 3010 | 3118 | } |
| 3011 | try parent_branch.inst_table.ensureCapacity(self.gpa, parent_branch.inst_table.count() + | |
| 3012 | saved_then_branch.inst_table.count()); | |
| 3119 | try parent_branch.inst_table.ensureUnusedCapacity(self.gpa, saved_then_branch.inst_table.count()); | |
| 3013 | 3120 | const then_slice = saved_then_branch.inst_table.entries.slice(); |
| 3014 | 3121 | const then_keys = then_slice.items(.key); |
| 3015 | 3122 | const then_values = then_slice.items(.value); |
| ... | ... | @@ -3030,70 +3137,175 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3030 | 3137 | } |
| 3031 | 3138 | } |
| 3032 | 3139 | }; |
| 3033 | log.debug("consolidating then_entry {*} {}=>{}", .{ then_key, parent_mcv, then_value }); | |
| 3140 | log.debug("consolidating then_entry {d} {}=>{}", .{ then_key, parent_mcv, then_value }); | |
| 3034 | 3141 | // TODO make sure the destination stack offset / register does not already have something |
| 3035 | 3142 | // going on there. |
| 3036 | try self.setRegOrMem(inst.base.src, then_key.ty, parent_mcv, then_value); | |
| 3143 | try self.setRegOrMem(self.air.typeOfIndex(then_key), parent_mcv, then_value); | |
| 3037 | 3144 | // TODO track the new register / stack allocation |
| 3038 | 3145 | } |
| 3039 | 3146 | |
| 3040 | 3147 | self.branch_stack.pop().deinit(self.gpa); |
| 3041 | 3148 | |
| 3042 | return MCValue.unreach; | |
| 3149 | return self.finishAir(inst, .unreach, .{ pl_op.operand, .none, .none }); | |
| 3043 | 3150 | } |
| 3044 | 3151 | |
| 3045 | fn genIsNull(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3152 | fn isNull(self: *Self, operand: MCValue) !MCValue { | |
| 3153 | _ = operand; | |
| 3154 | // Here you can specialize this instruction if it makes sense to, otherwise the default | |
| 3155 | // will call isNonNull and invert the result. | |
| 3046 | 3156 | switch (arch) { |
| 3047 | else => return self.fail(inst.base.src, "TODO implement isnull for {}", .{self.target.cpu.arch}), | |
| 3157 | else => return self.fail("TODO call isNonNull and invert the result", .{}), | |
| 3048 | 3158 | } |
| 3049 | 3159 | } |
| 3050 | 3160 | |
| 3051 | fn genIsNullPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3052 | return self.fail(inst.base.src, "TODO load the operand and call genIsNull", .{}); | |
| 3053 | } | |
| 3054 | ||
| 3055 | fn genIsNonNull(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3161 | fn isNonNull(self: *Self, operand: MCValue) !MCValue { | |
| 3162 | _ = operand; | |
| 3056 | 3163 | // Here you can specialize this instruction if it makes sense to, otherwise the default |
| 3057 | // will call genIsNull and invert the result. | |
| 3164 | // will call isNull and invert the result. | |
| 3058 | 3165 | switch (arch) { |
| 3059 | else => return self.fail(inst.base.src, "TODO call genIsNull and invert the result ", .{}), | |
| 3166 | else => return self.fail("TODO call isNull and invert the result", .{}), | |
| 3060 | 3167 | } |
| 3061 | 3168 | } |
| 3062 | 3169 | |
| 3063 | fn genIsNonNullPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3064 | return self.fail(inst.base.src, "TODO load the operand and call genIsNonNull", .{}); | |
| 3170 | fn isErr(self: *Self, operand: MCValue) !MCValue { | |
| 3171 | _ = operand; | |
| 3172 | // Here you can specialize this instruction if it makes sense to, otherwise the default | |
| 3173 | // will call isNonNull and invert the result. | |
| 3174 | switch (arch) { | |
| 3175 | else => return self.fail("TODO call isNonErr and invert the result", .{}), | |
| 3176 | } | |
| 3065 | 3177 | } |
| 3066 | 3178 | |
| 3067 | fn genIsErr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3179 | fn isNonErr(self: *Self, operand: MCValue) !MCValue { | |
| 3180 | _ = operand; | |
| 3181 | // Here you can specialize this instruction if it makes sense to, otherwise the default | |
| 3182 | // will call isNull and invert the result. | |
| 3068 | 3183 | switch (arch) { |
| 3069 | else => return self.fail(inst.base.src, "TODO implement iserr for {}", .{self.target.cpu.arch}), | |
| 3184 | else => return self.fail("TODO call isErr and invert the result", .{}), | |
| 3070 | 3185 | } |
| 3071 | 3186 | } |
| 3072 | 3187 | |
| 3073 | fn genIsErrPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3074 | return self.fail(inst.base.src, "TODO load the operand and call genIsErr", .{}); | |
| 3188 | fn airIsNull(self: *Self, inst: Air.Inst.Index) !void { | |
| 3189 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3190 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3191 | const operand = try self.resolveInst(un_op); | |
| 3192 | break :result try self.isNull(operand); | |
| 3193 | }; | |
| 3194 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3075 | 3195 | } |
| 3076 | 3196 | |
| 3077 | fn genIsNonErr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3078 | switch (arch) { | |
| 3079 | else => return self.fail(inst.base.src, "TODO implement is_non_err for {}", .{self.target.cpu.arch}), | |
| 3080 | } | |
| 3197 | fn airIsNullPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3198 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3199 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3200 | const operand_ptr = try self.resolveInst(un_op); | |
| 3201 | const operand: MCValue = blk: { | |
| 3202 | if (self.reuseOperand(inst, un_op, 0, operand_ptr)) { | |
| 3203 | // The MCValue that holds the pointer can be re-used as the value. | |
| 3204 | break :blk operand_ptr; | |
| 3205 | } else { | |
| 3206 | break :blk try self.allocRegOrMem(inst, true); | |
| 3207 | } | |
| 3208 | }; | |
| 3209 | try self.load(operand, operand_ptr, self.air.typeOf(un_op)); | |
| 3210 | break :result try self.isNull(operand); | |
| 3211 | }; | |
| 3212 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3213 | } | |
| 3214 | ||
| 3215 | fn airIsNonNull(self: *Self, inst: Air.Inst.Index) !void { | |
| 3216 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3217 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3218 | const operand = try self.resolveInst(un_op); | |
| 3219 | break :result try self.isNonNull(operand); | |
| 3220 | }; | |
| 3221 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3222 | } | |
| 3223 | ||
| 3224 | fn airIsNonNullPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3225 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3226 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3227 | const operand_ptr = try self.resolveInst(un_op); | |
| 3228 | const operand: MCValue = blk: { | |
| 3229 | if (self.reuseOperand(inst, un_op, 0, operand_ptr)) { | |
| 3230 | // The MCValue that holds the pointer can be re-used as the value. | |
| 3231 | break :blk operand_ptr; | |
| 3232 | } else { | |
| 3233 | break :blk try self.allocRegOrMem(inst, true); | |
| 3234 | } | |
| 3235 | }; | |
| 3236 | try self.load(operand, operand_ptr, self.air.typeOf(un_op)); | |
| 3237 | break :result try self.isNonNull(operand); | |
| 3238 | }; | |
| 3239 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3240 | } | |
| 3241 | ||
| 3242 | fn airIsErr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3243 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3244 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3245 | const operand = try self.resolveInst(un_op); | |
| 3246 | break :result try self.isErr(operand); | |
| 3247 | }; | |
| 3248 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3249 | } | |
| 3250 | ||
| 3251 | fn airIsErrPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3252 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3253 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3254 | const operand_ptr = try self.resolveInst(un_op); | |
| 3255 | const operand: MCValue = blk: { | |
| 3256 | if (self.reuseOperand(inst, un_op, 0, operand_ptr)) { | |
| 3257 | // The MCValue that holds the pointer can be re-used as the value. | |
| 3258 | break :blk operand_ptr; | |
| 3259 | } else { | |
| 3260 | break :blk try self.allocRegOrMem(inst, true); | |
| 3261 | } | |
| 3262 | }; | |
| 3263 | try self.load(operand, operand_ptr, self.air.typeOf(un_op)); | |
| 3264 | break :result try self.isErr(operand); | |
| 3265 | }; | |
| 3266 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3081 | 3267 | } |
| 3082 | 3268 | |
| 3083 | fn genIsNonErrPtr(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 3084 | return self.fail(inst.base.src, "TODO load the operand and call genIsNonErr", .{}); | |
| 3269 | fn airIsNonErr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3270 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3271 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3272 | const operand = try self.resolveInst(un_op); | |
| 3273 | break :result try self.isNonErr(operand); | |
| 3274 | }; | |
| 3275 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3085 | 3276 | } |
| 3086 | 3277 | |
| 3087 | fn genLoop(self: *Self, inst: *ir.Inst.Loop) !MCValue { | |
| 3278 | fn airIsNonErrPtr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3279 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 3280 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { | |
| 3281 | const operand_ptr = try self.resolveInst(un_op); | |
| 3282 | const operand: MCValue = blk: { | |
| 3283 | if (self.reuseOperand(inst, un_op, 0, operand_ptr)) { | |
| 3284 | // The MCValue that holds the pointer can be re-used as the value. | |
| 3285 | break :blk operand_ptr; | |
| 3286 | } else { | |
| 3287 | break :blk try self.allocRegOrMem(inst, true); | |
| 3288 | } | |
| 3289 | }; | |
| 3290 | try self.load(operand, operand_ptr, self.air.typeOf(un_op)); | |
| 3291 | break :result try self.isNonErr(operand); | |
| 3292 | }; | |
| 3293 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 3294 | } | |
| 3295 | ||
| 3296 | fn airLoop(self: *Self, inst: Air.Inst.Index) !void { | |
| 3088 | 3297 | // A loop is a setup to be able to jump back to the beginning. |
| 3298 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 3299 | const loop = self.air.extraData(Air.Block, ty_pl.payload); | |
| 3300 | const body = self.air.extra[loop.end..][0..loop.data.body_len]; | |
| 3089 | 3301 | const start_index = self.code.items.len; |
| 3090 | try self.genBody(inst.body); | |
| 3091 | try self.jump(inst.base.src, start_index); | |
| 3092 | return MCValue.unreach; | |
| 3302 | try self.genBody(body); | |
| 3303 | try self.jump(start_index); | |
| 3304 | return self.finishAirBookkeeping(); | |
| 3093 | 3305 | } |
| 3094 | 3306 | |
| 3095 | 3307 | /// Send control flow to the `index` of `self.code`. |
| 3096 | fn jump(self: *Self, src: LazySrcLoc, index: usize) !void { | |
| 3308 | fn jump(self: *Self, index: usize) !void { | |
| 3097 | 3309 | switch (arch) { |
| 3098 | 3310 | .i386, .x86_64 => { |
| 3099 | 3311 | try self.code.ensureCapacity(self.code.items.len + 5); |
| ... | ... | @@ -3110,21 +3322,21 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3110 | 3322 | if (math.cast(i26, @intCast(i32, index) - @intCast(i32, self.code.items.len + 8))) |delta| { |
| 3111 | 3323 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.b(.al, delta).toU32()); |
| 3112 | 3324 | } else |_| { |
| 3113 | return self.fail(src, "TODO: enable larger branch offset", .{}); | |
| 3325 | return self.fail("TODO: enable larger branch offset", .{}); | |
| 3114 | 3326 | } |
| 3115 | 3327 | }, |
| 3116 | 3328 | .aarch64, .aarch64_be, .aarch64_32 => { |
| 3117 | 3329 | if (math.cast(i28, @intCast(i32, index) - @intCast(i32, self.code.items.len + 8))) |delta| { |
| 3118 | 3330 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.b(delta).toU32()); |
| 3119 | 3331 | } else |_| { |
| 3120 | return self.fail(src, "TODO: enable larger branch offset", .{}); | |
| 3332 | return self.fail("TODO: enable larger branch offset", .{}); | |
| 3121 | 3333 | } |
| 3122 | 3334 | }, |
| 3123 | else => return self.fail(src, "TODO implement jump for {}", .{self.target.cpu.arch}), | |
| 3335 | else => return self.fail("TODO implement jump for {}", .{self.target.cpu.arch}), | |
| 3124 | 3336 | } |
| 3125 | 3337 | } |
| 3126 | 3338 | |
| 3127 | fn genBlock(self: *Self, inst: *ir.Inst.Block) !MCValue { | |
| 3339 | fn airBlock(self: *Self, inst: Air.Inst.Index) !void { | |
| 3128 | 3340 | try self.blocks.putNoClobber(self.gpa, inst, .{ |
| 3129 | 3341 | // A block is a setup to be able to jump to the end. |
| 3130 | 3342 | .relocs = .{}, |
| ... | ... | @@ -3138,20 +3350,27 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3138 | 3350 | const block_data = self.blocks.getPtr(inst).?; |
| 3139 | 3351 | defer block_data.relocs.deinit(self.gpa); |
| 3140 | 3352 | |
| 3141 | try self.genBody(inst.body); | |
| 3353 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 3354 | const extra = self.air.extraData(Air.Block, ty_pl.payload); | |
| 3355 | const body = self.air.extra[extra.end..][0..extra.data.body_len]; | |
| 3356 | try self.genBody(body); | |
| 3142 | 3357 | |
| 3143 | for (block_data.relocs.items) |reloc| try self.performReloc(inst.base.src, reloc); | |
| 3358 | for (block_data.relocs.items) |reloc| try self.performReloc(reloc); | |
| 3144 | 3359 | |
| 3145 | return @bitCast(MCValue, block_data.mcv); | |
| 3360 | const result = @bitCast(MCValue, block_data.mcv); | |
| 3361 | return self.finishAir(inst, result, .{ .none, .none, .none }); | |
| 3146 | 3362 | } |
| 3147 | 3363 | |
| 3148 | fn genSwitch(self: *Self, inst: *ir.Inst.SwitchBr) !MCValue { | |
| 3364 | fn airSwitch(self: *Self, inst: Air.Inst.Index) !void { | |
| 3365 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 3366 | const condition = pl_op.operand; | |
| 3149 | 3367 | switch (arch) { |
| 3150 | else => return self.fail(inst.base.src, "TODO genSwitch for {}", .{self.target.cpu.arch}), | |
| 3368 | else => return self.fail("TODO airSwitch for {}", .{self.target.cpu.arch}), | |
| 3151 | 3369 | } |
| 3370 | return self.finishAir(inst, .dead, .{ condition, .none, .none }); | |
| 3152 | 3371 | } |
| 3153 | 3372 | |
| 3154 | fn performReloc(self: *Self, src: LazySrcLoc, reloc: Reloc) !void { | |
| 3373 | fn performReloc(self: *Self, reloc: Reloc) !void { | |
| 3155 | 3374 | switch (reloc) { |
| 3156 | 3375 | .rel32 => |pos| { |
| 3157 | 3376 | const amt = self.code.items.len - (pos + 4); |
| ... | ... | @@ -3162,7 +3381,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3162 | 3381 | // best place to elide jumps will be in semantic analysis, by inlining blocks that only |
| 3163 | 3382 | // only have 1 break instruction. |
| 3164 | 3383 | const s32_amt = math.cast(i32, amt) catch |
| 3165 | return self.fail(src, "unable to perform relocation: jump too far", .{}); | |
| 3384 | return self.fail("unable to perform relocation: jump too far", .{}); | |
| 3166 | 3385 | mem.writeIntLittle(i32, self.code.items[pos..][0..4], s32_amt); |
| 3167 | 3386 | }, |
| 3168 | 3387 | .arm_branch => |info| { |
| ... | ... | @@ -3172,7 +3391,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3172 | 3391 | if (math.cast(i26, amt)) |delta| { |
| 3173 | 3392 | writeInt(u32, self.code.items[info.pos..][0..4], Instruction.b(info.cond, delta).toU32()); |
| 3174 | 3393 | } else |_| { |
| 3175 | return self.fail(src, "TODO: enable larger branch offset", .{}); | |
| 3394 | return self.fail("TODO: enable larger branch offset", .{}); | |
| 3176 | 3395 | } |
| 3177 | 3396 | }, |
| 3178 | 3397 | else => unreachable, // attempting to perfrom an ARM relocation on a non-ARM target arch |
| ... | ... | @@ -3181,56 +3400,49 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3181 | 3400 | } |
| 3182 | 3401 | } |
| 3183 | 3402 | |
| 3184 | fn genBrBlockFlat(self: *Self, inst: *ir.Inst.BrBlockFlat) !MCValue { | |
| 3185 | try self.genBody(inst.body); | |
| 3186 | const last = inst.body.instructions[inst.body.instructions.len - 1]; | |
| 3187 | return self.br(inst.base.src, inst.block, last); | |
| 3188 | } | |
| 3189 | ||
| 3190 | fn genBr(self: *Self, inst: *ir.Inst.Br) !MCValue { | |
| 3191 | return self.br(inst.base.src, inst.block, inst.operand); | |
| 3403 | fn airBr(self: *Self, inst: Air.Inst.Index) !void { | |
| 3404 | const branch = self.air.instructions.items(.data)[inst].br; | |
| 3405 | try self.br(branch.block_inst, branch.operand); | |
| 3406 | return self.finishAir(inst, .dead, .{ branch.operand, .none, .none }); | |
| 3192 | 3407 | } |
| 3193 | 3408 | |
| 3194 | fn genBrVoid(self: *Self, inst: *ir.Inst.BrVoid) !MCValue { | |
| 3195 | return self.brVoid(inst.base.src, inst.block); | |
| 3196 | } | |
| 3197 | ||
| 3198 | fn genBoolOp(self: *Self, inst: *ir.Inst.BinOp) !MCValue { | |
| 3199 | if (inst.base.isUnused()) | |
| 3200 | return MCValue.dead; | |
| 3201 | switch (arch) { | |
| 3202 | .x86_64 => switch (inst.base.tag) { | |
| 3409 | fn airBoolOp(self: *Self, inst: Air.Inst.Index) !void { | |
| 3410 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 3411 | const air_tags = self.air.instructions.items(.tag); | |
| 3412 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else switch (arch) { | |
| 3413 | .x86_64 => switch (air_tags[inst]) { | |
| 3203 | 3414 | // lhs AND rhs |
| 3204 | .bool_and => return try self.genX8664BinMath(&inst.base, inst.lhs, inst.rhs), | |
| 3415 | .bool_and => try self.genX8664BinMath(inst, bin_op.lhs, bin_op.rhs), | |
| 3205 | 3416 | // lhs OR rhs |
| 3206 | .bool_or => return try self.genX8664BinMath(&inst.base, inst.lhs, inst.rhs), | |
| 3417 | .bool_or => try self.genX8664BinMath(inst, bin_op.lhs, bin_op.rhs), | |
| 3207 | 3418 | else => unreachable, // Not a boolean operation |
| 3208 | 3419 | }, |
| 3209 | .arm, .armeb => switch (inst.base.tag) { | |
| 3210 | .bool_and => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .bool_and), | |
| 3211 | .bool_or => return try self.genArmBinOp(&inst.base, inst.lhs, inst.rhs, .bool_or), | |
| 3420 | .arm, .armeb => switch (air_tags[inst]) { | |
| 3421 | .bool_and => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .bool_and), | |
| 3422 | .bool_or => try self.genArmBinOp(inst, bin_op.lhs, bin_op.rhs, .bool_or), | |
| 3212 | 3423 | else => unreachable, // Not a boolean operation |
| 3213 | 3424 | }, |
| 3214 | else => return self.fail(inst.base.src, "TODO implement boolean operations for {}", .{self.target.cpu.arch}), | |
| 3215 | } | |
| 3425 | else => return self.fail("TODO implement boolean operations for {}", .{self.target.cpu.arch}), | |
| 3426 | }; | |
| 3427 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); | |
| 3216 | 3428 | } |
| 3217 | 3429 | |
| 3218 | fn br(self: *Self, src: LazySrcLoc, block: *ir.Inst.Block, operand: *ir.Inst) !MCValue { | |
| 3430 | fn br(self: *Self, block: Air.Inst.Index, operand: Air.Inst.Ref) !void { | |
| 3219 | 3431 | const block_data = self.blocks.getPtr(block).?; |
| 3220 | 3432 | |
| 3221 | if (operand.ty.hasCodeGenBits()) { | |
| 3433 | if (self.air.typeOf(operand).hasCodeGenBits()) { | |
| 3222 | 3434 | const operand_mcv = try self.resolveInst(operand); |
| 3223 | 3435 | const block_mcv = block_data.mcv; |
| 3224 | 3436 | if (block_mcv == .none) { |
| 3225 | 3437 | block_data.mcv = operand_mcv; |
| 3226 | 3438 | } else { |
| 3227 | try self.setRegOrMem(src, block.base.ty, block_mcv, operand_mcv); | |
| 3439 | try self.setRegOrMem(self.air.typeOfIndex(block), block_mcv, operand_mcv); | |
| 3228 | 3440 | } |
| 3229 | 3441 | } |
| 3230 | return self.brVoid(src, block); | |
| 3442 | return self.brVoid(block); | |
| 3231 | 3443 | } |
| 3232 | 3444 | |
| 3233 | fn brVoid(self: *Self, src: LazySrcLoc, block: *ir.Inst.Block) !MCValue { | |
| 3445 | fn brVoid(self: *Self, block: Air.Inst.Index) !void { | |
| 3234 | 3446 | const block_data = self.blocks.getPtr(block).?; |
| 3235 | 3447 | |
| 3236 | 3448 | // Emit a jump with a relocation. It will be patched up after the block ends. |
| ... | ... | @@ -3254,201 +3466,265 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3254 | 3466 | }, |
| 3255 | 3467 | }); |
| 3256 | 3468 | }, |
| 3257 | else => return self.fail(src, "TODO implement brvoid for {}", .{self.target.cpu.arch}), | |
| 3469 | else => return self.fail("TODO implement brvoid for {}", .{self.target.cpu.arch}), | |
| 3258 | 3470 | } |
| 3259 | return .none; | |
| 3260 | 3471 | } |
| 3261 | 3472 | |
| 3262 | fn genAsm(self: *Self, inst: *ir.Inst.Assembly) !MCValue { | |
| 3263 | if (!inst.is_volatile and inst.base.isUnused()) | |
| 3264 | return MCValue.dead; | |
| 3265 | switch (arch) { | |
| 3266 | .arm, .armeb => { | |
| 3267 | for (inst.inputs) |input, i| { | |
| 3268 | if (input.len < 3 or input[0] != '{' or input[input.len - 1] != '}') { | |
| 3269 | return self.fail(inst.base.src, "unrecognized asm input constraint: '{s}'", .{input}); | |
| 3473 | fn airAsm(self: *Self, inst: Air.Inst.Index) !void { | |
| 3474 | const air_datas = self.air.instructions.items(.data); | |
| 3475 | const air_extra = self.air.extraData(Air.Asm, air_datas[inst].ty_pl.payload); | |
| 3476 | const zir = self.mod_fn.owner_decl.namespace.file_scope.zir; | |
| 3477 | const extended = zir.instructions.items(.data)[air_extra.data.zir_index].extended; | |
| 3478 | const zir_extra = zir.extraData(Zir.Inst.Asm, extended.operand); | |
| 3479 | const asm_source = zir.nullTerminatedString(zir_extra.data.asm_source); | |
| 3480 | const outputs_len = @truncate(u5, extended.small); | |
| 3481 | const args_len = @truncate(u5, extended.small >> 5); | |
| 3482 | const clobbers_len = @truncate(u5, extended.small >> 10); | |
| 3483 | _ = clobbers_len; // TODO honor these | |
| 3484 | const is_volatile = @truncate(u1, extended.small >> 15) != 0; | |
| 3485 | const outputs = @bitCast([]const Air.Inst.Ref, self.air.extra[air_extra.end..][0..outputs_len]); | |
| 3486 | const args = @bitCast([]const Air.Inst.Ref, self.air.extra[air_extra.end + outputs.len ..][0..args_len]); | |
| 3487 | ||
| 3488 | if (outputs_len > 1) { | |
| 3489 | return self.fail("TODO implement codegen for asm with more than 1 output", .{}); | |
| 3490 | } | |
| 3491 | var extra_i: usize = zir_extra.end; | |
| 3492 | const output_constraint: ?[]const u8 = out: { | |
| 3493 | var i: usize = 0; | |
| 3494 | while (i < outputs_len) : (i += 1) { | |
| 3495 | const output = zir.extraData(Zir.Inst.Asm.Output, extra_i); | |
| 3496 | extra_i = output.end; | |
| 3497 | break :out zir.nullTerminatedString(output.data.constraint); | |
| 3498 | } | |
| 3499 | break :out null; | |
| 3500 | }; | |
| 3501 | ||
| 3502 | const dead = !is_volatile and self.liveness.isUnused(inst); | |
| 3503 | const result: MCValue = if (dead) .dead else switch (arch) { | |
| 3504 | .arm, .armeb => result: { | |
| 3505 | for (args) |arg| { | |
| 3506 | const input = zir.extraData(Zir.Inst.Asm.Input, extra_i); | |
| 3507 | extra_i = input.end; | |
| 3508 | const constraint = zir.nullTerminatedString(input.data.constraint); | |
| 3509 | ||
| 3510 | if (constraint.len < 3 or constraint[0] != '{' or constraint[constraint.len - 1] != '}') { | |
| 3511 | return self.fail("unrecognized asm input constraint: '{s}'", .{constraint}); | |
| 3270 | 3512 | } |
| 3271 | const reg_name = input[1 .. input.len - 1]; | |
| 3513 | const reg_name = constraint[1 .. constraint.len - 1]; | |
| 3272 | 3514 | const reg = parseRegName(reg_name) orelse |
| 3273 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3515 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3274 | 3516 | |
| 3275 | const arg = inst.args[i]; | |
| 3276 | 3517 | const arg_mcv = try self.resolveInst(arg); |
| 3277 | 3518 | try self.register_manager.getReg(reg, null); |
| 3278 | try self.genSetReg(inst.base.src, arg.ty, reg, arg_mcv); | |
| 3519 | try self.genSetReg(self.air.typeOf(arg), reg, arg_mcv); | |
| 3279 | 3520 | } |
| 3280 | 3521 | |
| 3281 | if (mem.eql(u8, inst.asm_source, "svc #0")) { | |
| 3522 | if (mem.eql(u8, asm_source, "svc #0")) { | |
| 3282 | 3523 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.svc(.al, 0).toU32()); |
| 3283 | 3524 | } else { |
| 3284 | return self.fail(inst.base.src, "TODO implement support for more arm assembly instructions", .{}); | |
| 3525 | return self.fail("TODO implement support for more arm assembly instructions", .{}); | |
| 3285 | 3526 | } |
| 3286 | 3527 | |
| 3287 | if (inst.output_constraint) |output| { | |
| 3528 | if (output_constraint) |output| { | |
| 3288 | 3529 | if (output.len < 4 or output[0] != '=' or output[1] != '{' or output[output.len - 1] != '}') { |
| 3289 | return self.fail(inst.base.src, "unrecognized asm output constraint: '{s}'", .{output}); | |
| 3530 | return self.fail("unrecognized asm output constraint: '{s}'", .{output}); | |
| 3290 | 3531 | } |
| 3291 | 3532 | const reg_name = output[2 .. output.len - 1]; |
| 3292 | 3533 | const reg = parseRegName(reg_name) orelse |
| 3293 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3294 | return MCValue{ .register = reg }; | |
| 3534 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3535 | ||
| 3536 | break :result MCValue{ .register = reg }; | |
| 3295 | 3537 | } else { |
| 3296 | return MCValue.none; | |
| 3538 | break :result MCValue{ .none = {} }; | |
| 3297 | 3539 | } |
| 3298 | 3540 | }, |
| 3299 | .aarch64 => { | |
| 3300 | for (inst.inputs) |input, i| { | |
| 3301 | if (input.len < 3 or input[0] != '{' or input[input.len - 1] != '}') { | |
| 3302 | return self.fail(inst.base.src, "unrecognized asm input constraint: '{s}'", .{input}); | |
| 3541 | .aarch64 => result: { | |
| 3542 | for (args) |arg| { | |
| 3543 | const input = zir.extraData(Zir.Inst.Asm.Input, extra_i); | |
| 3544 | extra_i = input.end; | |
| 3545 | const constraint = zir.nullTerminatedString(input.data.constraint); | |
| 3546 | ||
| 3547 | if (constraint.len < 3 or constraint[0] != '{' or constraint[constraint.len - 1] != '}') { | |
| 3548 | return self.fail("unrecognized asm input constraint: '{s}'", .{constraint}); | |
| 3303 | 3549 | } |
| 3304 | const reg_name = input[1 .. input.len - 1]; | |
| 3550 | const reg_name = constraint[1 .. constraint.len - 1]; | |
| 3305 | 3551 | const reg = parseRegName(reg_name) orelse |
| 3306 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3552 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3307 | 3553 | |
| 3308 | const arg = inst.args[i]; | |
| 3309 | 3554 | const arg_mcv = try self.resolveInst(arg); |
| 3310 | 3555 | try self.register_manager.getReg(reg, null); |
| 3311 | try self.genSetReg(inst.base.src, arg.ty, reg, arg_mcv); | |
| 3556 | try self.genSetReg(self.air.typeOf(arg), reg, arg_mcv); | |
| 3312 | 3557 | } |
| 3313 | 3558 | |
| 3314 | if (mem.eql(u8, inst.asm_source, "svc #0")) { | |
| 3559 | if (mem.eql(u8, asm_source, "svc #0")) { | |
| 3315 | 3560 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.svc(0x0).toU32()); |
| 3316 | } else if (mem.eql(u8, inst.asm_source, "svc #0x80")) { | |
| 3561 | } else if (mem.eql(u8, asm_source, "svc #0x80")) { | |
| 3317 | 3562 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.svc(0x80).toU32()); |
| 3318 | 3563 | } else { |
| 3319 | return self.fail(inst.base.src, "TODO implement support for more aarch64 assembly instructions", .{}); | |
| 3564 | return self.fail("TODO implement support for more aarch64 assembly instructions", .{}); | |
| 3320 | 3565 | } |
| 3321 | 3566 | |
| 3322 | if (inst.output_constraint) |output| { | |
| 3567 | if (output_constraint) |output| { | |
| 3323 | 3568 | if (output.len < 4 or output[0] != '=' or output[1] != '{' or output[output.len - 1] != '}') { |
| 3324 | return self.fail(inst.base.src, "unrecognized asm output constraint: '{s}'", .{output}); | |
| 3569 | return self.fail("unrecognized asm output constraint: '{s}'", .{output}); | |
| 3325 | 3570 | } |
| 3326 | 3571 | const reg_name = output[2 .. output.len - 1]; |
| 3327 | 3572 | const reg = parseRegName(reg_name) orelse |
| 3328 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3329 | return MCValue{ .register = reg }; | |
| 3573 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3574 | break :result MCValue{ .register = reg }; | |
| 3330 | 3575 | } else { |
| 3331 | return MCValue.none; | |
| 3576 | break :result MCValue{ .none = {} }; | |
| 3332 | 3577 | } |
| 3333 | 3578 | }, |
| 3334 | .riscv64 => { | |
| 3335 | for (inst.inputs) |input, i| { | |
| 3336 | if (input.len < 3 or input[0] != '{' or input[input.len - 1] != '}') { | |
| 3337 | return self.fail(inst.base.src, "unrecognized asm input constraint: '{s}'", .{input}); | |
| 3579 | .riscv64 => result: { | |
| 3580 | for (args) |arg| { | |
| 3581 | const input = zir.extraData(Zir.Inst.Asm.Input, extra_i); | |
| 3582 | extra_i = input.end; | |
| 3583 | const constraint = zir.nullTerminatedString(input.data.constraint); | |
| 3584 | ||
| 3585 | if (constraint.len < 3 or constraint[0] != '{' or constraint[constraint.len - 1] != '}') { | |
| 3586 | return self.fail("unrecognized asm input constraint: '{s}'", .{constraint}); | |
| 3338 | 3587 | } |
| 3339 | const reg_name = input[1 .. input.len - 1]; | |
| 3588 | const reg_name = constraint[1 .. constraint.len - 1]; | |
| 3340 | 3589 | const reg = parseRegName(reg_name) orelse |
| 3341 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3590 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3342 | 3591 | |
| 3343 | const arg = inst.args[i]; | |
| 3344 | 3592 | const arg_mcv = try self.resolveInst(arg); |
| 3345 | 3593 | try self.register_manager.getReg(reg, null); |
| 3346 | try self.genSetReg(inst.base.src, arg.ty, reg, arg_mcv); | |
| 3594 | try self.genSetReg(self.air.typeOf(arg), reg, arg_mcv); | |
| 3347 | 3595 | } |
| 3348 | 3596 | |
| 3349 | if (mem.eql(u8, inst.asm_source, "ecall")) { | |
| 3597 | if (mem.eql(u8, asm_source, "ecall")) { | |
| 3350 | 3598 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.ecall.toU32()); |
| 3351 | 3599 | } else { |
| 3352 | return self.fail(inst.base.src, "TODO implement support for more riscv64 assembly instructions", .{}); | |
| 3600 | return self.fail("TODO implement support for more riscv64 assembly instructions", .{}); | |
| 3353 | 3601 | } |
| 3354 | 3602 | |
| 3355 | if (inst.output_constraint) |output| { | |
| 3603 | if (output_constraint) |output| { | |
| 3356 | 3604 | if (output.len < 4 or output[0] != '=' or output[1] != '{' or output[output.len - 1] != '}') { |
| 3357 | return self.fail(inst.base.src, "unrecognized asm output constraint: '{s}'", .{output}); | |
| 3605 | return self.fail("unrecognized asm output constraint: '{s}'", .{output}); | |
| 3358 | 3606 | } |
| 3359 | 3607 | const reg_name = output[2 .. output.len - 1]; |
| 3360 | 3608 | const reg = parseRegName(reg_name) orelse |
| 3361 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3362 | return MCValue{ .register = reg }; | |
| 3609 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3610 | break :result MCValue{ .register = reg }; | |
| 3363 | 3611 | } else { |
| 3364 | return MCValue.none; | |
| 3612 | break :result MCValue{ .none = {} }; | |
| 3365 | 3613 | } |
| 3366 | 3614 | }, |
| 3367 | .x86_64, .i386 => { | |
| 3368 | for (inst.inputs) |input, i| { | |
| 3369 | if (input.len < 3 or input[0] != '{' or input[input.len - 1] != '}') { | |
| 3370 | return self.fail(inst.base.src, "unrecognized asm input constraint: '{s}'", .{input}); | |
| 3615 | .x86_64, .i386 => result: { | |
| 3616 | for (args) |arg| { | |
| 3617 | const input = zir.extraData(Zir.Inst.Asm.Input, extra_i); | |
| 3618 | extra_i = input.end; | |
| 3619 | const constraint = zir.nullTerminatedString(input.data.constraint); | |
| 3620 | ||
| 3621 | if (constraint.len < 3 or constraint[0] != '{' or constraint[constraint.len - 1] != '}') { | |
| 3622 | return self.fail("unrecognized asm input constraint: '{s}'", .{constraint}); | |
| 3371 | 3623 | } |
| 3372 | const reg_name = input[1 .. input.len - 1]; | |
| 3624 | const reg_name = constraint[1 .. constraint.len - 1]; | |
| 3373 | 3625 | const reg = parseRegName(reg_name) orelse |
| 3374 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3626 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3375 | 3627 | |
| 3376 | const arg = inst.args[i]; | |
| 3377 | 3628 | const arg_mcv = try self.resolveInst(arg); |
| 3378 | 3629 | try self.register_manager.getReg(reg, null); |
| 3379 | try self.genSetReg(inst.base.src, arg.ty, reg, arg_mcv); | |
| 3630 | try self.genSetReg(self.air.typeOf(arg), reg, arg_mcv); | |
| 3380 | 3631 | } |
| 3381 | 3632 | |
| 3382 | 3633 | { |
| 3383 | var iter = std.mem.tokenize(inst.asm_source, "\n\r"); | |
| 3634 | var iter = std.mem.tokenize(asm_source, "\n\r"); | |
| 3384 | 3635 | while (iter.next()) |ins| { |
| 3385 | 3636 | if (mem.eql(u8, ins, "syscall")) { |
| 3386 | 3637 | try self.code.appendSlice(&[_]u8{ 0x0f, 0x05 }); |
| 3387 | 3638 | } else if (mem.indexOf(u8, ins, "push")) |_| { |
| 3388 | 3639 | const arg = ins[4..]; |
| 3389 | 3640 | if (mem.indexOf(u8, arg, "$")) |l| { |
| 3390 | const n = std.fmt.parseInt(u8, ins[4 + l + 1 ..], 10) catch return self.fail(inst.base.src, "TODO implement more inline asm int parsing", .{}); | |
| 3641 | const n = std.fmt.parseInt(u8, ins[4 + l + 1 ..], 10) catch return self.fail("TODO implement more inline asm int parsing", .{}); | |
| 3391 | 3642 | try self.code.appendSlice(&.{ 0x6a, n }); |
| 3392 | 3643 | } else if (mem.indexOf(u8, arg, "%%")) |l| { |
| 3393 | 3644 | const reg_name = ins[4 + l + 2 ..]; |
| 3394 | 3645 | const reg = parseRegName(reg_name) orelse |
| 3395 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3646 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3396 | 3647 | const low_id: u8 = reg.low_id(); |
| 3397 | 3648 | if (reg.isExtended()) { |
| 3398 | 3649 | try self.code.appendSlice(&.{ 0x41, 0b1010000 | low_id }); |
| 3399 | 3650 | } else { |
| 3400 | 3651 | try self.code.append(0b1010000 | low_id); |
| 3401 | 3652 | } |
| 3402 | } else return self.fail(inst.base.src, "TODO more push operands", .{}); | |
| 3653 | } else return self.fail("TODO more push operands", .{}); | |
| 3403 | 3654 | } else if (mem.indexOf(u8, ins, "pop")) |_| { |
| 3404 | 3655 | const arg = ins[3..]; |
| 3405 | 3656 | if (mem.indexOf(u8, arg, "%%")) |l| { |
| 3406 | 3657 | const reg_name = ins[3 + l + 2 ..]; |
| 3407 | 3658 | const reg = parseRegName(reg_name) orelse |
| 3408 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3659 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3409 | 3660 | const low_id: u8 = reg.low_id(); |
| 3410 | 3661 | if (reg.isExtended()) { |
| 3411 | 3662 | try self.code.appendSlice(&.{ 0x41, 0b1011000 | low_id }); |
| 3412 | 3663 | } else { |
| 3413 | 3664 | try self.code.append(0b1011000 | low_id); |
| 3414 | 3665 | } |
| 3415 | } else return self.fail(inst.base.src, "TODO more pop operands", .{}); | |
| 3666 | } else return self.fail("TODO more pop operands", .{}); | |
| 3416 | 3667 | } else { |
| 3417 | return self.fail(inst.base.src, "TODO implement support for more x86 assembly instructions", .{}); | |
| 3668 | return self.fail("TODO implement support for more x86 assembly instructions", .{}); | |
| 3418 | 3669 | } |
| 3419 | 3670 | } |
| 3420 | 3671 | } |
| 3421 | 3672 | |
| 3422 | if (inst.output_constraint) |output| { | |
| 3673 | if (output_constraint) |output| { | |
| 3423 | 3674 | if (output.len < 4 or output[0] != '=' or output[1] != '{' or output[output.len - 1] != '}') { |
| 3424 | return self.fail(inst.base.src, "unrecognized asm output constraint: '{s}'", .{output}); | |
| 3675 | return self.fail("unrecognized asm output constraint: '{s}'", .{output}); | |
| 3425 | 3676 | } |
| 3426 | 3677 | const reg_name = output[2 .. output.len - 1]; |
| 3427 | 3678 | const reg = parseRegName(reg_name) orelse |
| 3428 | return self.fail(inst.base.src, "unrecognized register: '{s}'", .{reg_name}); | |
| 3429 | return MCValue{ .register = reg }; | |
| 3679 | return self.fail("unrecognized register: '{s}'", .{reg_name}); | |
| 3680 | break :result MCValue{ .register = reg }; | |
| 3430 | 3681 | } else { |
| 3431 | return MCValue.none; | |
| 3682 | break :result MCValue{ .none = {} }; | |
| 3432 | 3683 | } |
| 3433 | 3684 | }, |
| 3434 | else => return self.fail(inst.base.src, "TODO implement inline asm support for more architectures", .{}), | |
| 3685 | else => return self.fail("TODO implement inline asm support for more architectures", .{}), | |
| 3686 | }; | |
| 3687 | if (outputs.len + args.len <= Liveness.bpi - 1) { | |
| 3688 | var buf = [1]Air.Inst.Ref{.none} ** (Liveness.bpi - 1); | |
| 3689 | std.mem.copy(Air.Inst.Ref, &buf, outputs); | |
| 3690 | std.mem.copy(Air.Inst.Ref, buf[outputs.len..], args); | |
| 3691 | return self.finishAir(inst, result, buf); | |
| 3692 | } | |
| 3693 | var bt = try self.iterateBigTomb(inst, outputs.len + args.len); | |
| 3694 | for (outputs) |output| { | |
| 3695 | bt.feed(output); | |
| 3696 | } | |
| 3697 | for (args) |arg| { | |
| 3698 | bt.feed(arg); | |
| 3435 | 3699 | } |
| 3700 | return bt.finishAir(result); | |
| 3701 | } | |
| 3702 | ||
| 3703 | fn iterateBigTomb(self: *Self, inst: Air.Inst.Index, operand_count: usize) !BigTomb { | |
| 3704 | try self.ensureProcessDeathCapacity(operand_count + 1); | |
| 3705 | return BigTomb{ | |
| 3706 | .function = self, | |
| 3707 | .inst = inst, | |
| 3708 | .tomb_bits = self.liveness.getTombBits(inst), | |
| 3709 | .big_tomb_bits = self.liveness.special.get(inst) orelse 0, | |
| 3710 | .bit_index = 0, | |
| 3711 | }; | |
| 3436 | 3712 | } |
| 3437 | 3713 | |
| 3438 | 3714 | /// Sets the value without any modifications to register allocation metadata or stack allocation metadata. |
| 3439 | fn setRegOrMem(self: *Self, src: LazySrcLoc, ty: Type, loc: MCValue, val: MCValue) !void { | |
| 3715 | fn setRegOrMem(self: *Self, ty: Type, loc: MCValue, val: MCValue) !void { | |
| 3440 | 3716 | switch (loc) { |
| 3441 | 3717 | .none => return, |
| 3442 | .register => |reg| return self.genSetReg(src, ty, reg, val), | |
| 3443 | .stack_offset => |off| return self.genSetStack(src, ty, off, val), | |
| 3718 | .register => |reg| return self.genSetReg(ty, reg, val), | |
| 3719 | .stack_offset => |off| return self.genSetStack(ty, off, val), | |
| 3444 | 3720 | .memory => { |
| 3445 | return self.fail(src, "TODO implement setRegOrMem for memory", .{}); | |
| 3721 | return self.fail("TODO implement setRegOrMem for memory", .{}); | |
| 3446 | 3722 | }, |
| 3447 | 3723 | else => unreachable, |
| 3448 | 3724 | } |
| 3449 | 3725 | } |
| 3450 | 3726 | |
| 3451 | fn genSetStack(self: *Self, src: LazySrcLoc, ty: Type, stack_offset: u32, mcv: MCValue) InnerError!void { | |
| 3727 | fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerError!void { | |
| 3452 | 3728 | switch (arch) { |
| 3453 | 3729 | .arm, .armeb => switch (mcv) { |
| 3454 | 3730 | .dead => unreachable, |
| ... | ... | @@ -3460,28 +3736,28 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3460 | 3736 | return; // The already existing value will do just fine. |
| 3461 | 3737 | // TODO Upgrade this to a memset call when we have that available. |
| 3462 | 3738 | switch (ty.abiSize(self.target.*)) { |
| 3463 | 1 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaa }), | |
| 3464 | 2 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaa }), | |
| 3465 | 4 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), | |
| 3466 | 8 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3467 | else => return self.fail(src, "TODO implement memset", .{}), | |
| 3739 | 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), | |
| 3740 | 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), | |
| 3741 | 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), | |
| 3742 | 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3743 | else => return self.fail("TODO implement memset", .{}), | |
| 3468 | 3744 | } |
| 3469 | 3745 | }, |
| 3470 | 3746 | .compare_flags_unsigned => |op| { |
| 3471 | 3747 | _ = op; |
| 3472 | return self.fail(src, "TODO implement set stack variable with compare flags value (unsigned)", .{}); | |
| 3748 | return self.fail("TODO implement set stack variable with compare flags value (unsigned)", .{}); | |
| 3473 | 3749 | }, |
| 3474 | 3750 | .compare_flags_signed => |op| { |
| 3475 | 3751 | _ = op; |
| 3476 | return self.fail(src, "TODO implement set stack variable with compare flags value (signed)", .{}); | |
| 3752 | return self.fail("TODO implement set stack variable with compare flags value (signed)", .{}); | |
| 3477 | 3753 | }, |
| 3478 | 3754 | .immediate => { |
| 3479 | const reg = try self.copyToTmpRegister(src, ty, mcv); | |
| 3480 | return self.genSetStack(src, ty, stack_offset, MCValue{ .register = reg }); | |
| 3755 | const reg = try self.copyToTmpRegister(ty, mcv); | |
| 3756 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 3481 | 3757 | }, |
| 3482 | 3758 | .embedded_in_code => |code_offset| { |
| 3483 | 3759 | _ = code_offset; |
| 3484 | return self.fail(src, "TODO implement set stack variable from embedded_in_code", .{}); | |
| 3760 | return self.fail("TODO implement set stack variable from embedded_in_code", .{}); | |
| 3485 | 3761 | }, |
| 3486 | 3762 | .register => |reg| { |
| 3487 | 3763 | const abi_size = ty.abiSize(self.target.*); |
| ... | ... | @@ -3491,7 +3767,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3491 | 3767 | 1, 4 => { |
| 3492 | 3768 | const offset = if (math.cast(u12, adj_off)) |imm| blk: { |
| 3493 | 3769 | break :blk Instruction.Offset.imm(imm); |
| 3494 | } else |_| Instruction.Offset.reg(try self.copyToTmpRegister(src, Type.initTag(.u32), MCValue{ .immediate = adj_off }), 0); | |
| 3770 | } else |_| Instruction.Offset.reg(try self.copyToTmpRegister(Type.initTag(.u32), MCValue{ .immediate = adj_off }), 0); | |
| 3495 | 3771 | const str = switch (abi_size) { |
| 3496 | 3772 | 1 => Instruction.strb, |
| 3497 | 3773 | 4 => Instruction.str, |
| ... | ... | @@ -3506,26 +3782,26 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3506 | 3782 | 2 => { |
| 3507 | 3783 | const offset = if (adj_off <= math.maxInt(u8)) blk: { |
| 3508 | 3784 | break :blk Instruction.ExtraLoadStoreOffset.imm(@intCast(u8, adj_off)); |
| 3509 | } else Instruction.ExtraLoadStoreOffset.reg(try self.copyToTmpRegister(src, Type.initTag(.u32), MCValue{ .immediate = adj_off })); | |
| 3785 | } else Instruction.ExtraLoadStoreOffset.reg(try self.copyToTmpRegister(Type.initTag(.u32), MCValue{ .immediate = adj_off })); | |
| 3510 | 3786 | |
| 3511 | 3787 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.strh(.al, reg, .fp, .{ |
| 3512 | 3788 | .offset = offset, |
| 3513 | 3789 | .positive = false, |
| 3514 | 3790 | }).toU32()); |
| 3515 | 3791 | }, |
| 3516 | else => return self.fail(src, "TODO implement storing other types abi_size={}", .{abi_size}), | |
| 3792 | else => return self.fail("TODO implement storing other types abi_size={}", .{abi_size}), | |
| 3517 | 3793 | } |
| 3518 | 3794 | }, |
| 3519 | 3795 | .memory => |vaddr| { |
| 3520 | 3796 | _ = vaddr; |
| 3521 | return self.fail(src, "TODO implement set stack variable from memory vaddr", .{}); | |
| 3797 | return self.fail("TODO implement set stack variable from memory vaddr", .{}); | |
| 3522 | 3798 | }, |
| 3523 | 3799 | .stack_offset => |off| { |
| 3524 | 3800 | if (stack_offset == off) |
| 3525 | 3801 | return; // Copy stack variable to itself; nothing to do. |
| 3526 | 3802 | |
| 3527 | const reg = try self.copyToTmpRegister(src, ty, mcv); | |
| 3528 | return self.genSetStack(src, ty, stack_offset, MCValue{ .register = reg }); | |
| 3803 | const reg = try self.copyToTmpRegister(ty, mcv); | |
| 3804 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 3529 | 3805 | }, |
| 3530 | 3806 | }, |
| 3531 | 3807 | .x86_64 => switch (mcv) { |
| ... | ... | @@ -3538,34 +3814,34 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3538 | 3814 | return; // The already existing value will do just fine. |
| 3539 | 3815 | // TODO Upgrade this to a memset call when we have that available. |
| 3540 | 3816 | switch (ty.abiSize(self.target.*)) { |
| 3541 | 1 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaa }), | |
| 3542 | 2 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaa }), | |
| 3543 | 4 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), | |
| 3544 | 8 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3545 | else => return self.fail(src, "TODO implement memset", .{}), | |
| 3817 | 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), | |
| 3818 | 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), | |
| 3819 | 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), | |
| 3820 | 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3821 | else => return self.fail("TODO implement memset", .{}), | |
| 3546 | 3822 | } |
| 3547 | 3823 | }, |
| 3548 | 3824 | .compare_flags_unsigned => |op| { |
| 3549 | 3825 | _ = op; |
| 3550 | return self.fail(src, "TODO implement set stack variable with compare flags value (unsigned)", .{}); | |
| 3826 | return self.fail("TODO implement set stack variable with compare flags value (unsigned)", .{}); | |
| 3551 | 3827 | }, |
| 3552 | 3828 | .compare_flags_signed => |op| { |
| 3553 | 3829 | _ = op; |
| 3554 | return self.fail(src, "TODO implement set stack variable with compare flags value (signed)", .{}); | |
| 3830 | return self.fail("TODO implement set stack variable with compare flags value (signed)", .{}); | |
| 3555 | 3831 | }, |
| 3556 | 3832 | .immediate => |x_big| { |
| 3557 | 3833 | const abi_size = ty.abiSize(self.target.*); |
| 3558 | 3834 | const adj_off = stack_offset + abi_size; |
| 3559 | 3835 | if (adj_off > 128) { |
| 3560 | return self.fail(src, "TODO implement set stack variable with large stack offset", .{}); | |
| 3836 | return self.fail("TODO implement set stack variable with large stack offset", .{}); | |
| 3561 | 3837 | } |
| 3562 | 3838 | try self.code.ensureCapacity(self.code.items.len + 8); |
| 3563 | 3839 | switch (abi_size) { |
| 3564 | 3840 | 1 => { |
| 3565 | return self.fail(src, "TODO implement set abi_size=1 stack variable with immediate", .{}); | |
| 3841 | return self.fail("TODO implement set abi_size=1 stack variable with immediate", .{}); | |
| 3566 | 3842 | }, |
| 3567 | 3843 | 2 => { |
| 3568 | return self.fail(src, "TODO implement set abi_size=2 stack variable with immediate", .{}); | |
| 3844 | return self.fail("TODO implement set abi_size=2 stack variable with immediate", .{}); | |
| 3569 | 3845 | }, |
| 3570 | 3846 | 4 => { |
| 3571 | 3847 | const x = @intCast(u32, x_big); |
| ... | ... | @@ -3598,22 +3874,22 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3598 | 3874 | self.code.appendSliceAssumeCapacity(buf[0..4]); |
| 3599 | 3875 | }, |
| 3600 | 3876 | else => { |
| 3601 | return self.fail(src, "TODO implement set abi_size=large stack variable with immediate", .{}); | |
| 3877 | return self.fail("TODO implement set abi_size=large stack variable with immediate", .{}); | |
| 3602 | 3878 | }, |
| 3603 | 3879 | } |
| 3604 | 3880 | }, |
| 3605 | 3881 | .embedded_in_code => { |
| 3606 | 3882 | // TODO this and `.stack_offset` below need to get improved to support types greater than |
| 3607 | 3883 | // register size, and do general memcpy |
| 3608 | const reg = try self.copyToTmpRegister(src, ty, mcv); | |
| 3609 | return self.genSetStack(src, ty, stack_offset, MCValue{ .register = reg }); | |
| 3884 | const reg = try self.copyToTmpRegister(ty, mcv); | |
| 3885 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 3610 | 3886 | }, |
| 3611 | 3887 | .register => |reg| { |
| 3612 | try self.genX8664ModRMRegToStack(src, ty, stack_offset, reg, 0x89); | |
| 3888 | try self.genX8664ModRMRegToStack(ty, stack_offset, reg, 0x89); | |
| 3613 | 3889 | }, |
| 3614 | 3890 | .memory => |vaddr| { |
| 3615 | 3891 | _ = vaddr; |
| 3616 | return self.fail(src, "TODO implement set stack variable from memory vaddr", .{}); | |
| 3892 | return self.fail("TODO implement set stack variable from memory vaddr", .{}); | |
| 3617 | 3893 | }, |
| 3618 | 3894 | .stack_offset => |off| { |
| 3619 | 3895 | // TODO this and `.embedded_in_code` above need to get improved to support types greater than |
| ... | ... | @@ -3622,8 +3898,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3622 | 3898 | if (stack_offset == off) |
| 3623 | 3899 | return; // Copy stack variable to itself; nothing to do. |
| 3624 | 3900 | |
| 3625 | const reg = try self.copyToTmpRegister(src, ty, mcv); | |
| 3626 | return self.genSetStack(src, ty, stack_offset, MCValue{ .register = reg }); | |
| 3901 | const reg = try self.copyToTmpRegister(ty, mcv); | |
| 3902 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 3627 | 3903 | }, |
| 3628 | 3904 | }, |
| 3629 | 3905 | .aarch64, .aarch64_be, .aarch64_32 => switch (mcv) { |
| ... | ... | @@ -3636,28 +3912,28 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3636 | 3912 | return; // The already existing value will do just fine. |
| 3637 | 3913 | // TODO Upgrade this to a memset call when we have that available. |
| 3638 | 3914 | switch (ty.abiSize(self.target.*)) { |
| 3639 | 1 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaa }), | |
| 3640 | 2 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaa }), | |
| 3641 | 4 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), | |
| 3642 | 8 => return self.genSetStack(src, ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3643 | else => return self.fail(src, "TODO implement memset", .{}), | |
| 3915 | 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), | |
| 3916 | 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), | |
| 3917 | 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), | |
| 3918 | 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3919 | else => return self.fail("TODO implement memset", .{}), | |
| 3644 | 3920 | } |
| 3645 | 3921 | }, |
| 3646 | 3922 | .compare_flags_unsigned => |op| { |
| 3647 | 3923 | _ = op; |
| 3648 | return self.fail(src, "TODO implement set stack variable with compare flags value (unsigned)", .{}); | |
| 3924 | return self.fail("TODO implement set stack variable with compare flags value (unsigned)", .{}); | |
| 3649 | 3925 | }, |
| 3650 | 3926 | .compare_flags_signed => |op| { |
| 3651 | 3927 | _ = op; |
| 3652 | return self.fail(src, "TODO implement set stack variable with compare flags value (signed)", .{}); | |
| 3928 | return self.fail("TODO implement set stack variable with compare flags value (signed)", .{}); | |
| 3653 | 3929 | }, |
| 3654 | 3930 | .immediate => { |
| 3655 | const reg = try self.copyToTmpRegister(src, ty, mcv); | |
| 3656 | return self.genSetStack(src, ty, stack_offset, MCValue{ .register = reg }); | |
| 3931 | const reg = try self.copyToTmpRegister(ty, mcv); | |
| 3932 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 3657 | 3933 | }, |
| 3658 | 3934 | .embedded_in_code => |code_offset| { |
| 3659 | 3935 | _ = code_offset; |
| 3660 | return self.fail(src, "TODO implement set stack variable from embedded_in_code", .{}); | |
| 3936 | return self.fail("TODO implement set stack variable from embedded_in_code", .{}); | |
| 3661 | 3937 | }, |
| 3662 | 3938 | .register => |reg| { |
| 3663 | 3939 | const abi_size = ty.abiSize(self.target.*); |
| ... | ... | @@ -3668,7 +3944,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3668 | 3944 | const offset = if (math.cast(i9, adj_off)) |imm| |
| 3669 | 3945 | Instruction.LoadStoreOffset.imm_post_index(-imm) |
| 3670 | 3946 | else |_| |
| 3671 | Instruction.LoadStoreOffset.reg(try self.copyToTmpRegister(src, Type.initTag(.u64), MCValue{ .immediate = adj_off })); | |
| 3947 | Instruction.LoadStoreOffset.reg(try self.copyToTmpRegister(Type.initTag(.u64), MCValue{ .immediate = adj_off })); | |
| 3672 | 3948 | const rn: Register = switch (arch) { |
| 3673 | 3949 | .aarch64, .aarch64_be => .x29, |
| 3674 | 3950 | .aarch64_32 => .w29, |
| ... | ... | @@ -3685,26 +3961,26 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3685 | 3961 | .offset = offset, |
| 3686 | 3962 | }).toU32()); |
| 3687 | 3963 | }, |
| 3688 | else => return self.fail(src, "TODO implement storing other types abi_size={}", .{abi_size}), | |
| 3964 | else => return self.fail("TODO implement storing other types abi_size={}", .{abi_size}), | |
| 3689 | 3965 | } |
| 3690 | 3966 | }, |
| 3691 | 3967 | .memory => |vaddr| { |
| 3692 | 3968 | _ = vaddr; |
| 3693 | return self.fail(src, "TODO implement set stack variable from memory vaddr", .{}); | |
| 3969 | return self.fail("TODO implement set stack variable from memory vaddr", .{}); | |
| 3694 | 3970 | }, |
| 3695 | 3971 | .stack_offset => |off| { |
| 3696 | 3972 | if (stack_offset == off) |
| 3697 | 3973 | return; // Copy stack variable to itself; nothing to do. |
| 3698 | 3974 | |
| 3699 | const reg = try self.copyToTmpRegister(src, ty, mcv); | |
| 3700 | return self.genSetStack(src, ty, stack_offset, MCValue{ .register = reg }); | |
| 3975 | const reg = try self.copyToTmpRegister(ty, mcv); | |
| 3976 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); | |
| 3701 | 3977 | }, |
| 3702 | 3978 | }, |
| 3703 | else => return self.fail(src, "TODO implement getSetStack for {}", .{self.target.cpu.arch}), | |
| 3979 | else => return self.fail("TODO implement getSetStack for {}", .{self.target.cpu.arch}), | |
| 3704 | 3980 | } |
| 3705 | 3981 | } |
| 3706 | 3982 | |
| 3707 | fn genSetReg(self: *Self, src: LazySrcLoc, ty: Type, reg: Register, mcv: MCValue) InnerError!void { | |
| 3983 | fn genSetReg(self: *Self, ty: Type, reg: Register, mcv: MCValue) InnerError!void { | |
| 3708 | 3984 | switch (arch) { |
| 3709 | 3985 | .arm, .armeb => switch (mcv) { |
| 3710 | 3986 | .dead => unreachable, |
| ... | ... | @@ -3715,7 +3991,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3715 | 3991 | if (!self.wantSafety()) |
| 3716 | 3992 | return; // The already existing value will do just fine. |
| 3717 | 3993 | // Write the debug undefined value. |
| 3718 | return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaaaaaa }); | |
| 3994 | return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaa }); | |
| 3719 | 3995 | }, |
| 3720 | 3996 | .compare_flags_unsigned, |
| 3721 | 3997 | .compare_flags_signed, |
| ... | ... | @@ -3734,7 +4010,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3734 | 4010 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.mov(condition, reg, one).toU32()); |
| 3735 | 4011 | }, |
| 3736 | 4012 | .immediate => |x| { |
| 3737 | if (x > math.maxInt(u32)) return self.fail(src, "ARM registers are 32-bit wide", .{}); | |
| 4013 | if (x > math.maxInt(u32)) return self.fail("ARM registers are 32-bit wide", .{}); | |
| 3738 | 4014 | |
| 3739 | 4015 | if (Instruction.Operand.fromU32(@intCast(u32, x))) |op| { |
| 3740 | 4016 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.mov(.al, reg, op).toU32()); |
| ... | ... | @@ -3780,7 +4056,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3780 | 4056 | .memory => |addr| { |
| 3781 | 4057 | // The value is in memory at a hard-coded address. |
| 3782 | 4058 | // If the type is a pointer, it means the pointer address is at this memory location. |
| 3783 | try self.genSetReg(src, ty, reg, .{ .immediate = addr }); | |
| 4059 | try self.genSetReg(ty, reg, .{ .immediate = addr }); | |
| 3784 | 4060 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.ldr(.al, reg, reg, .{ .offset = Instruction.Offset.none }).toU32()); |
| 3785 | 4061 | }, |
| 3786 | 4062 | .stack_offset => |unadjusted_off| { |
| ... | ... | @@ -3792,7 +4068,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3792 | 4068 | 1, 4 => { |
| 3793 | 4069 | const offset = if (adj_off <= math.maxInt(u12)) blk: { |
| 3794 | 4070 | break :blk Instruction.Offset.imm(@intCast(u12, adj_off)); |
| 3795 | } else Instruction.Offset.reg(try self.copyToTmpRegister(src, Type.initTag(.u32), MCValue{ .immediate = adj_off }), 0); | |
| 4071 | } else Instruction.Offset.reg(try self.copyToTmpRegister(Type.initTag(.u32), MCValue{ .immediate = adj_off }), 0); | |
| 3796 | 4072 | const ldr = switch (abi_size) { |
| 3797 | 4073 | 1 => Instruction.ldrb, |
| 3798 | 4074 | 4 => Instruction.ldr, |
| ... | ... | @@ -3807,17 +4083,17 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3807 | 4083 | 2 => { |
| 3808 | 4084 | const offset = if (adj_off <= math.maxInt(u8)) blk: { |
| 3809 | 4085 | break :blk Instruction.ExtraLoadStoreOffset.imm(@intCast(u8, adj_off)); |
| 3810 | } else Instruction.ExtraLoadStoreOffset.reg(try self.copyToTmpRegister(src, Type.initTag(.u32), MCValue{ .immediate = adj_off })); | |
| 4086 | } else Instruction.ExtraLoadStoreOffset.reg(try self.copyToTmpRegister(Type.initTag(.u32), MCValue{ .immediate = adj_off })); | |
| 3811 | 4087 | |
| 3812 | 4088 | writeInt(u32, try self.code.addManyAsArray(4), Instruction.ldrh(.al, reg, .fp, .{ |
| 3813 | 4089 | .offset = offset, |
| 3814 | 4090 | .positive = false, |
| 3815 | 4091 | }).toU32()); |
| 3816 | 4092 | }, |
| 3817 | else => return self.fail(src, "TODO a type of size {} is not allowed in a register", .{abi_size}), | |
| 4093 | else => return self.fail("TODO a type of size {} is not allowed in a register", .{abi_size}), | |
| 3818 | 4094 | } |
| 3819 | 4095 | }, |
| 3820 | else => return self.fail(src, "TODO implement getSetReg for arm {}", .{mcv}), | |
| 4096 | else => return self.fail("TODO implement getSetReg for arm {}", .{mcv}), | |
| 3821 | 4097 | }, |
| 3822 | 4098 | .aarch64 => switch (mcv) { |
| 3823 | 4099 | .dead => unreachable, |
| ... | ... | @@ -3829,8 +4105,8 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3829 | 4105 | return; // The already existing value will do just fine. |
| 3830 | 4106 | // Write the debug undefined value. |
| 3831 | 4107 | switch (reg.size()) { |
| 3832 | 32 => return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaaaaaa }), | |
| 3833 | 64 => return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 4108 | 32 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaa }), | |
| 4109 | 64 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 3834 | 4110 | else => unreachable, // unexpected register size |
| 3835 | 4111 | } |
| 3836 | 4112 | }, |
| ... | ... | @@ -3909,12 +4185,12 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3909 | 4185 | .payload = .{ .page_off = .{ .kind = .got } }, |
| 3910 | 4186 | }); |
| 3911 | 4187 | } else { |
| 3912 | return self.fail(src, "TODO implement genSetReg for PIE GOT indirection on this platform", .{}); | |
| 4188 | return self.fail("TODO implement genSetReg for PIE GOT indirection on this platform", .{}); | |
| 3913 | 4189 | } |
| 3914 | 4190 | } else { |
| 3915 | 4191 | // The value is in memory at a hard-coded address. |
| 3916 | 4192 | // If the type is a pointer, it means the pointer address is at this memory location. |
| 3917 | try self.genSetReg(src, Type.initTag(.usize), reg, .{ .immediate = addr }); | |
| 4193 | try self.genSetReg(Type.initTag(.usize), reg, .{ .immediate = addr }); | |
| 3918 | 4194 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.ldr(reg, .{ .register = .{ .rn = reg } }).toU32()); |
| 3919 | 4195 | } |
| 3920 | 4196 | }, |
| ... | ... | @@ -3932,7 +4208,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3932 | 4208 | const offset = if (math.cast(i9, adj_off)) |imm| |
| 3933 | 4209 | Instruction.LoadStoreOffset.imm_post_index(-imm) |
| 3934 | 4210 | else |_| |
| 3935 | Instruction.LoadStoreOffset.reg(try self.copyToTmpRegister(src, Type.initTag(.u64), MCValue{ .immediate = adj_off })); | |
| 4211 | Instruction.LoadStoreOffset.reg(try self.copyToTmpRegister(Type.initTag(.u64), MCValue{ .immediate = adj_off })); | |
| 3936 | 4212 | |
| 3937 | 4213 | switch (abi_size) { |
| 3938 | 4214 | 1, 2 => { |
| ... | ... | @@ -3952,10 +4228,10 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3952 | 4228 | .offset = offset, |
| 3953 | 4229 | } }).toU32()); |
| 3954 | 4230 | }, |
| 3955 | else => return self.fail(src, "TODO implement genSetReg other types abi_size={}", .{abi_size}), | |
| 4231 | else => return self.fail("TODO implement genSetReg other types abi_size={}", .{abi_size}), | |
| 3956 | 4232 | } |
| 3957 | 4233 | }, |
| 3958 | else => return self.fail(src, "TODO implement genSetReg for aarch64 {}", .{mcv}), | |
| 4234 | else => return self.fail("TODO implement genSetReg for aarch64 {}", .{mcv}), | |
| 3959 | 4235 | }, |
| 3960 | 4236 | .riscv64 => switch (mcv) { |
| 3961 | 4237 | .dead => unreachable, |
| ... | ... | @@ -3966,7 +4242,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3966 | 4242 | if (!self.wantSafety()) |
| 3967 | 4243 | return; // The already existing value will do just fine. |
| 3968 | 4244 | // Write the debug undefined value. |
| 3969 | return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }); | |
| 4245 | return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }); | |
| 3970 | 4246 | }, |
| 3971 | 4247 | .immediate => |unsigned_x| { |
| 3972 | 4248 | const x = @bitCast(i64, unsigned_x); |
| ... | ... | @@ -3986,19 +4262,19 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 3986 | 4262 | } |
| 3987 | 4263 | // li rd, immediate |
| 3988 | 4264 | // "Myriad sequences" |
| 3989 | return self.fail(src, "TODO genSetReg 33-64 bit immediates for riscv64", .{}); // glhf | |
| 4265 | return self.fail("TODO genSetReg 33-64 bit immediates for riscv64", .{}); // glhf | |
| 3990 | 4266 | }, |
| 3991 | 4267 | .memory => |addr| { |
| 3992 | 4268 | // The value is in memory at a hard-coded address. |
| 3993 | 4269 | // If the type is a pointer, it means the pointer address is at this memory location. |
| 3994 | try self.genSetReg(src, ty, reg, .{ .immediate = addr }); | |
| 4270 | try self.genSetReg(ty, reg, .{ .immediate = addr }); | |
| 3995 | 4271 | |
| 3996 | 4272 | mem.writeIntLittle(u32, try self.code.addManyAsArray(4), Instruction.ld(reg, 0, reg).toU32()); |
| 3997 | 4273 | // LOAD imm=[i12 offset = 0], rs1 = |
| 3998 | 4274 | |
| 3999 | 4275 | // return self.fail("TODO implement genSetReg memory for riscv64"); |
| 4000 | 4276 | }, |
| 4001 | else => return self.fail(src, "TODO implement getSetReg for riscv64 {}", .{mcv}), | |
| 4277 | else => return self.fail("TODO implement getSetReg for riscv64 {}", .{mcv}), | |
| 4002 | 4278 | }, |
| 4003 | 4279 | .x86_64 => switch (mcv) { |
| 4004 | 4280 | .dead => unreachable, |
| ... | ... | @@ -4010,10 +4286,10 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4010 | 4286 | return; // The already existing value will do just fine. |
| 4011 | 4287 | // Write the debug undefined value. |
| 4012 | 4288 | switch (reg.size()) { |
| 4013 | 8 => return self.genSetReg(src, ty, reg, .{ .immediate = 0xaa }), | |
| 4014 | 16 => return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaa }), | |
| 4015 | 32 => return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaaaaaa }), | |
| 4016 | 64 => return self.genSetReg(src, ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 4289 | 8 => return self.genSetReg(ty, reg, .{ .immediate = 0xaa }), | |
| 4290 | 16 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaa }), | |
| 4291 | 32 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaa }), | |
| 4292 | 64 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), | |
| 4017 | 4293 | else => unreachable, |
| 4018 | 4294 | } |
| 4019 | 4295 | }, |
| ... | ... | @@ -4040,7 +4316,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4040 | 4316 | }, |
| 4041 | 4317 | .compare_flags_signed => |op| { |
| 4042 | 4318 | _ = op; |
| 4043 | return self.fail(src, "TODO set register with compare flags value (signed)", .{}); | |
| 4319 | return self.fail("TODO set register with compare flags value (signed)", .{}); | |
| 4044 | 4320 | }, |
| 4045 | 4321 | .immediate => |x| { |
| 4046 | 4322 | // 32-bit moves zero-extend to 64-bit, so xoring the 32-bit |
| ... | ... | @@ -4185,7 +4461,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4185 | 4461 | .payload = .{ .load = .{ .kind = .got } }, |
| 4186 | 4462 | }); |
| 4187 | 4463 | } else { |
| 4188 | return self.fail(src, "TODO implement genSetReg for PIE GOT indirection on this platform", .{}); | |
| 4464 | return self.fail("TODO implement genSetReg for PIE GOT indirection on this platform", .{}); | |
| 4189 | 4465 | } |
| 4190 | 4466 | |
| 4191 | 4467 | // MOV reg, [reg] |
| ... | ... | @@ -4241,7 +4517,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4241 | 4517 | assert(id3 != 4 and id3 != 5); |
| 4242 | 4518 | |
| 4243 | 4519 | // Rather than duplicate the logic used for the move, we just use a self-call with a new MCValue. |
| 4244 | try self.genSetReg(src, ty, reg, MCValue{ .immediate = x }); | |
| 4520 | try self.genSetReg(ty, reg, MCValue{ .immediate = x }); | |
| 4245 | 4521 | |
| 4246 | 4522 | // Now, the register contains the address of the value to load into it |
| 4247 | 4523 | // Currently, we're only allowing 64-bit registers, so we need the `REX.W 8B /r` variant. |
| ... | ... | @@ -4264,7 +4540,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4264 | 4540 | const abi_size = ty.abiSize(self.target.*); |
| 4265 | 4541 | const off = unadjusted_off + abi_size; |
| 4266 | 4542 | if (off < std.math.minInt(i32) or off > std.math.maxInt(i32)) { |
| 4267 | return self.fail(src, "stack offset too large", .{}); | |
| 4543 | return self.fail("stack offset too large", .{}); | |
| 4268 | 4544 | } |
| 4269 | 4545 | const ioff = -@intCast(i32, off); |
| 4270 | 4546 | const encoder = try X8664Encoder.init(self.code, 3); |
| ... | ... | @@ -4284,39 +4560,59 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4284 | 4560 | } |
| 4285 | 4561 | }, |
| 4286 | 4562 | }, |
| 4287 | else => return self.fail(src, "TODO implement getSetReg for {}", .{self.target.cpu.arch}), | |
| 4563 | else => return self.fail("TODO implement getSetReg for {}", .{self.target.cpu.arch}), | |
| 4288 | 4564 | } |
| 4289 | 4565 | } |
| 4290 | 4566 | |
| 4291 | fn genPtrToInt(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 4292 | // no-op | |
| 4293 | return self.resolveInst(inst.operand); | |
| 4567 | fn airPtrToInt(self: *Self, inst: Air.Inst.Index) !void { | |
| 4568 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 4569 | const result = try self.resolveInst(un_op); | |
| 4570 | return self.finishAir(inst, result, .{ un_op, .none, .none }); | |
| 4294 | 4571 | } |
| 4295 | 4572 | |
| 4296 | fn genBitCast(self: *Self, inst: *ir.Inst.UnOp) !MCValue { | |
| 4297 | const operand = try self.resolveInst(inst.operand); | |
| 4298 | return operand; | |
| 4573 | fn airBitCast(self: *Self, inst: Air.Inst.Index) !void { | |
| 4574 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 4575 | const result = try self.resolveInst(ty_op.operand); | |
| 4576 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); | |
| 4299 | 4577 | } |
| 4300 | 4578 | |
| 4301 | fn resolveInst(self: *Self, inst: *ir.Inst) !MCValue { | |
| 4302 | // If the type has no codegen bits, no need to store it. | |
| 4303 | if (!inst.ty.hasCodeGenBits()) | |
| 4304 | return MCValue.none; | |
| 4305 | ||
| 4306 | // Constants have static lifetimes, so they are always memoized in the outer most table. | |
| 4307 | if (inst.castTag(.constant)) |const_inst| { | |
| 4308 | const branch = &self.branch_stack.items[0]; | |
| 4309 | const gop = try branch.inst_table.getOrPut(self.gpa, inst); | |
| 4310 | if (!gop.found_existing) { | |
| 4311 | gop.value_ptr.* = try self.genTypedValue(inst.src, .{ .ty = inst.ty, .val = const_inst.val }); | |
| 4579 | fn resolveInst(self: *Self, inst: Air.Inst.Ref) InnerError!MCValue { | |
| 4580 | // First section of indexes correspond to a set number of constant values. | |
| 4581 | const ref_int = @enumToInt(inst); | |
| 4582 | if (ref_int < Air.Inst.Ref.typed_value_map.len) { | |
| 4583 | const tv = Air.Inst.Ref.typed_value_map[ref_int]; | |
| 4584 | if (!tv.ty.hasCodeGenBits()) { | |
| 4585 | return MCValue{ .none = {} }; | |
| 4312 | 4586 | } |
| 4313 | return gop.value_ptr.*; | |
| 4587 | return self.genTypedValue(tv); | |
| 4314 | 4588 | } |
| 4315 | 4589 | |
| 4316 | return self.getResolvedInstValue(inst); | |
| 4590 | // If the type has no codegen bits, no need to store it. | |
| 4591 | const inst_ty = self.air.typeOf(inst); | |
| 4592 | if (!inst_ty.hasCodeGenBits()) | |
| 4593 | return MCValue{ .none = {} }; | |
| 4594 | ||
| 4595 | const inst_index = @intCast(Air.Inst.Index, ref_int - Air.Inst.Ref.typed_value_map.len); | |
| 4596 | switch (self.air.instructions.items(.tag)[inst_index]) { | |
| 4597 | .constant => { | |
| 4598 | // Constants have static lifetimes, so they are always memoized in the outer most table. | |
| 4599 | const branch = &self.branch_stack.items[0]; | |
| 4600 | const gop = try branch.inst_table.getOrPut(self.gpa, inst_index); | |
| 4601 | if (!gop.found_existing) { | |
| 4602 | const ty_pl = self.air.instructions.items(.data)[inst_index].ty_pl; | |
| 4603 | gop.value_ptr.* = try self.genTypedValue(.{ | |
| 4604 | .ty = inst_ty, | |
| 4605 | .val = self.air.values[ty_pl.payload], | |
| 4606 | }); | |
| 4607 | } | |
| 4608 | return gop.value_ptr.*; | |
| 4609 | }, | |
| 4610 | .const_ty => unreachable, | |
| 4611 | else => return self.getResolvedInstValue(inst_index), | |
| 4612 | } | |
| 4317 | 4613 | } |
| 4318 | 4614 | |
| 4319 | fn getResolvedInstValue(self: *Self, inst: *ir.Inst) MCValue { | |
| 4615 | fn getResolvedInstValue(self: *Self, inst: Air.Inst.Index) MCValue { | |
| 4320 | 4616 | // Treat each stack item as a "layer" on top of the previous one. |
| 4321 | 4617 | var i: usize = self.branch_stack.items.len; |
| 4322 | 4618 | while (true) { |
| ... | ... | @@ -4333,15 +4629,15 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4333 | 4629 | /// A potential opportunity for future optimization here would be keeping track |
| 4334 | 4630 | /// of the fact that the instruction is available both as an immediate |
| 4335 | 4631 | /// and as a register. |
| 4336 | fn limitImmediateType(self: *Self, inst: *ir.Inst, comptime T: type) !MCValue { | |
| 4337 | const mcv = try self.resolveInst(inst); | |
| 4632 | fn limitImmediateType(self: *Self, operand: Air.Inst.Ref, comptime T: type) !MCValue { | |
| 4633 | const mcv = try self.resolveInst(operand); | |
| 4338 | 4634 | const ti = @typeInfo(T).Int; |
| 4339 | 4635 | switch (mcv) { |
| 4340 | 4636 | .immediate => |imm| { |
| 4341 | 4637 | // This immediate is unsigned. |
| 4342 | 4638 | const U = std.meta.Int(.unsigned, ti.bits - @boolToInt(ti.signedness == .signed)); |
| 4343 | 4639 | if (imm >= math.maxInt(U)) { |
| 4344 | return MCValue{ .register = try self.copyToTmpRegister(inst.src, Type.initTag(.usize), mcv) }; | |
| 4640 | return MCValue{ .register = try self.copyToTmpRegister(Type.initTag(.usize), mcv) }; | |
| 4345 | 4641 | } |
| 4346 | 4642 | }, |
| 4347 | 4643 | else => {}, |
| ... | ... | @@ -4349,7 +4645,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4349 | 4645 | return mcv; |
| 4350 | 4646 | } |
| 4351 | 4647 | |
| 4352 | fn genTypedValue(self: *Self, src: LazySrcLoc, typed_value: TypedValue) InnerError!MCValue { | |
| 4648 | fn genTypedValue(self: *Self, typed_value: TypedValue) InnerError!MCValue { | |
| 4353 | 4649 | if (typed_value.val.isUndef()) |
| 4354 | 4650 | return MCValue{ .undef = {} }; |
| 4355 | 4651 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| ... | ... | @@ -4359,7 +4655,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4359 | 4655 | .Slice => { |
| 4360 | 4656 | var buf: Type.Payload.ElemType = undefined; |
| 4361 | 4657 | const ptr_type = typed_value.ty.slicePtrFieldType(&buf); |
| 4362 | const ptr_mcv = try self.genTypedValue(src, .{ .ty = ptr_type, .val = typed_value.val }); | |
| 4658 | const ptr_mcv = try self.genTypedValue(.{ .ty = ptr_type, .val = typed_value.val }); | |
| 4363 | 4659 | const slice_len = typed_value.val.sliceLen(); |
| 4364 | 4660 | // Codegen can't handle some kinds of indirection. If the wrong union field is accessed here it may mean |
| 4365 | 4661 | // the Sema code needs to use anonymous Decls or alloca instructions to store data. |
| ... | ... | @@ -4367,7 +4663,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4367 | 4663 | _ = slice_len; |
| 4368 | 4664 | _ = ptr_imm; |
| 4369 | 4665 | // We need more general support for const data being stored in memory to make this work. |
| 4370 | return self.fail(src, "TODO codegen for const slices", .{}); | |
| 4666 | return self.fail("TODO codegen for const slices", .{}); | |
| 4371 | 4667 | }, |
| 4372 | 4668 | else => { |
| 4373 | 4669 | if (typed_value.val.castTag(.decl_ref)) |payload| { |
| ... | ... | @@ -4397,19 +4693,19 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4397 | 4693 | const got_addr = p9.bases.data + decl.link.plan9.got_index.? * ptr_bytes; |
| 4398 | 4694 | return MCValue{ .memory = got_addr }; |
| 4399 | 4695 | } else { |
| 4400 | return self.fail(src, "TODO codegen non-ELF const Decl pointer", .{}); | |
| 4696 | return self.fail("TODO codegen non-ELF const Decl pointer", .{}); | |
| 4401 | 4697 | } |
| 4402 | 4698 | } |
| 4403 | 4699 | if (typed_value.val.tag() == .int_u64) { |
| 4404 | 4700 | return MCValue{ .immediate = typed_value.val.toUnsignedInt() }; |
| 4405 | 4701 | } |
| 4406 | return self.fail(src, "TODO codegen more kinds of const pointers", .{}); | |
| 4702 | return self.fail("TODO codegen more kinds of const pointers", .{}); | |
| 4407 | 4703 | }, |
| 4408 | 4704 | }, |
| 4409 | 4705 | .Int => { |
| 4410 | 4706 | const info = typed_value.ty.intInfo(self.target.*); |
| 4411 | 4707 | if (info.bits > ptr_bits or info.signedness == .signed) { |
| 4412 | return self.fail(src, "TODO const int bigger than ptr and signed int", .{}); | |
| 4708 | return self.fail("TODO const int bigger than ptr and signed int", .{}); | |
| 4413 | 4709 | } |
| 4414 | 4710 | return MCValue{ .immediate = typed_value.val.toUnsignedInt() }; |
| 4415 | 4711 | }, |
| ... | ... | @@ -4424,16 +4720,16 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4424 | 4720 | return MCValue{ .immediate = 0 }; |
| 4425 | 4721 | |
| 4426 | 4722 | var buf: Type.Payload.ElemType = undefined; |
| 4427 | return self.genTypedValue(src, .{ | |
| 4723 | return self.genTypedValue(.{ | |
| 4428 | 4724 | .ty = typed_value.ty.optionalChild(&buf), |
| 4429 | 4725 | .val = typed_value.val, |
| 4430 | 4726 | }); |
| 4431 | 4727 | } else if (typed_value.ty.abiSize(self.target.*) == 1) { |
| 4432 | 4728 | return MCValue{ .immediate = @boolToInt(typed_value.val.isNull()) }; |
| 4433 | 4729 | } |
| 4434 | return self.fail(src, "TODO non pointer optionals", .{}); | |
| 4730 | return self.fail("TODO non pointer optionals", .{}); | |
| 4435 | 4731 | }, |
| 4436 | else => return self.fail(src, "TODO implement const of type '{}'", .{typed_value.ty}), | |
| 4732 | else => return self.fail("TODO implement const of type '{}'", .{typed_value.ty}), | |
| 4437 | 4733 | } |
| 4438 | 4734 | } |
| 4439 | 4735 | |
| ... | ... | @@ -4450,7 +4746,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4450 | 4746 | }; |
| 4451 | 4747 | |
| 4452 | 4748 | /// Caller must call `CallMCValues.deinit`. |
| 4453 | fn resolveCallingConventionValues(self: *Self, src: LazySrcLoc, fn_ty: Type) !CallMCValues { | |
| 4749 | fn resolveCallingConventionValues(self: *Self, fn_ty: Type) !CallMCValues { | |
| 4454 | 4750 | const cc = fn_ty.fnCallingConvention(); |
| 4455 | 4751 | const param_types = try self.gpa.alloc(Type, fn_ty.fnParamLen()); |
| 4456 | 4752 | defer self.gpa.free(param_types); |
| ... | ... | @@ -4519,7 +4815,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4519 | 4815 | result.stack_byte_count = next_stack_offset; |
| 4520 | 4816 | result.stack_align = 16; |
| 4521 | 4817 | }, |
| 4522 | else => return self.fail(src, "TODO implement function parameters for {} on x86_64", .{cc}), | |
| 4818 | else => return self.fail("TODO implement function parameters for {} on x86_64", .{cc}), | |
| 4523 | 4819 | } |
| 4524 | 4820 | }, |
| 4525 | 4821 | .arm, .armeb => { |
| ... | ... | @@ -4546,10 +4842,10 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4546 | 4842 | result.args[i] = .{ .register = c_abi_int_param_regs[ncrn] }; |
| 4547 | 4843 | ncrn += 1; |
| 4548 | 4844 | } else { |
| 4549 | return self.fail(src, "TODO MCValues with multiple registers", .{}); | |
| 4845 | return self.fail("TODO MCValues with multiple registers", .{}); | |
| 4550 | 4846 | } |
| 4551 | 4847 | } else if (ncrn < 4 and nsaa == 0) { |
| 4552 | return self.fail(src, "TODO MCValues split between registers and stack", .{}); | |
| 4848 | return self.fail("TODO MCValues split between registers and stack", .{}); | |
| 4553 | 4849 | } else { |
| 4554 | 4850 | ncrn = 4; |
| 4555 | 4851 | if (ty.abiAlignment(self.target.*) == 8) |
| ... | ... | @@ -4563,7 +4859,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4563 | 4859 | result.stack_byte_count = nsaa; |
| 4564 | 4860 | result.stack_align = 4; |
| 4565 | 4861 | }, |
| 4566 | else => return self.fail(src, "TODO implement function parameters for {} on arm", .{cc}), | |
| 4862 | else => return self.fail("TODO implement function parameters for {} on arm", .{cc}), | |
| 4567 | 4863 | } |
| 4568 | 4864 | }, |
| 4569 | 4865 | .aarch64 => { |
| ... | ... | @@ -4594,10 +4890,10 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4594 | 4890 | result.args[i] = .{ .register = c_abi_int_param_regs[ncrn] }; |
| 4595 | 4891 | ncrn += 1; |
| 4596 | 4892 | } else { |
| 4597 | return self.fail(src, "TODO MCValues with multiple registers", .{}); | |
| 4893 | return self.fail("TODO MCValues with multiple registers", .{}); | |
| 4598 | 4894 | } |
| 4599 | 4895 | } else if (ncrn < 8 and nsaa == 0) { |
| 4600 | return self.fail(src, "TODO MCValues split between registers and stack", .{}); | |
| 4896 | return self.fail("TODO MCValues split between registers and stack", .{}); | |
| 4601 | 4897 | } else { |
| 4602 | 4898 | ncrn = 8; |
| 4603 | 4899 | // TODO Apple allows the arguments on the stack to be non-8-byte aligned provided |
| ... | ... | @@ -4616,11 +4912,11 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4616 | 4912 | result.stack_byte_count = nsaa; |
| 4617 | 4913 | result.stack_align = 16; |
| 4618 | 4914 | }, |
| 4619 | else => return self.fail(src, "TODO implement function parameters for {} on aarch64", .{cc}), | |
| 4915 | else => return self.fail("TODO implement function parameters for {} on aarch64", .{cc}), | |
| 4620 | 4916 | } |
| 4621 | 4917 | }, |
| 4622 | 4918 | else => if (param_types.len != 0) |
| 4623 | return self.fail(src, "TODO implement codegen parameters for {}", .{self.target.cpu.arch}), | |
| 4919 | return self.fail("TODO implement codegen parameters for {}", .{self.target.cpu.arch}), | |
| 4624 | 4920 | } |
| 4625 | 4921 | |
| 4626 | 4922 | if (ret_ty.zigTypeTag() == .NoReturn) { |
| ... | ... | @@ -4635,7 +4931,7 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4635 | 4931 | const aliased_reg = registerAlias(c_abi_int_return_regs[0], ret_ty_size); |
| 4636 | 4932 | result.return_value = .{ .register = aliased_reg }; |
| 4637 | 4933 | }, |
| 4638 | else => return self.fail(src, "TODO implement function return values for {}", .{cc}), | |
| 4934 | else => return self.fail("TODO implement function return values for {}", .{cc}), | |
| 4639 | 4935 | }, |
| 4640 | 4936 | .arm, .armeb => switch (cc) { |
| 4641 | 4937 | .Naked => unreachable, |
| ... | ... | @@ -4644,10 +4940,10 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4644 | 4940 | if (ret_ty_size <= 4) { |
| 4645 | 4941 | result.return_value = .{ .register = c_abi_int_return_regs[0] }; |
| 4646 | 4942 | } else { |
| 4647 | return self.fail(src, "TODO support more return types for ARM backend", .{}); | |
| 4943 | return self.fail("TODO support more return types for ARM backend", .{}); | |
| 4648 | 4944 | } |
| 4649 | 4945 | }, |
| 4650 | else => return self.fail(src, "TODO implement function return values for {}", .{cc}), | |
| 4946 | else => return self.fail("TODO implement function return values for {}", .{cc}), | |
| 4651 | 4947 | }, |
| 4652 | 4948 | .aarch64 => switch (cc) { |
| 4653 | 4949 | .Naked => unreachable, |
| ... | ... | @@ -4656,12 +4952,12 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4656 | 4952 | if (ret_ty_size <= 8) { |
| 4657 | 4953 | result.return_value = .{ .register = c_abi_int_return_regs[0] }; |
| 4658 | 4954 | } else { |
| 4659 | return self.fail(src, "TODO support more return types for ARM backend", .{}); | |
| 4955 | return self.fail("TODO support more return types for ARM backend", .{}); | |
| 4660 | 4956 | } |
| 4661 | 4957 | }, |
| 4662 | else => return self.fail(src, "TODO implement function return values for {}", .{cc}), | |
| 4958 | else => return self.fail("TODO implement function return values for {}", .{cc}), | |
| 4663 | 4959 | }, |
| 4664 | else => return self.fail(src, "TODO implement codegen return values for {}", .{self.target.cpu.arch}), | |
| 4960 | else => return self.fail("TODO implement codegen return values for {}", .{self.target.cpu.arch}), | |
| 4665 | 4961 | } |
| 4666 | 4962 | return result; |
| 4667 | 4963 | } |
| ... | ... | @@ -4676,14 +4972,10 @@ fn Function(comptime arch: std.Target.Cpu.Arch) type { |
| 4676 | 4972 | }; |
| 4677 | 4973 | } |
| 4678 | 4974 | |
| 4679 | fn fail(self: *Self, src: LazySrcLoc, comptime format: []const u8, args: anytype) InnerError { | |
| 4975 | fn fail(self: *Self, comptime format: []const u8, args: anytype) InnerError { | |
| 4680 | 4976 | @setCold(true); |
| 4681 | 4977 | assert(self.err_msg == null); |
| 4682 | const src_loc = if (src != .unneeded) | |
| 4683 | src.toSrcLocWithDecl(self.mod_fn.owner_decl) | |
| 4684 | else | |
| 4685 | self.src_loc; | |
| 4686 | self.err_msg = try ErrorMsg.create(self.bin_file.allocator, src_loc, format, args); | |
| 4978 | self.err_msg = try ErrorMsg.create(self.bin_file.allocator, self.src_loc, format, args); | |
| 4687 | 4979 | return error.CodegenFail; |
| 4688 | 4980 | } |
| 4689 | 4981 |
src/codegen/c.zig+436-276
| ... | ... | @@ -6,8 +6,6 @@ const log = std.log.scoped(.c); |
| 6 | 6 | const link = @import("../link.zig"); |
| 7 | 7 | const Module = @import("../Module.zig"); |
| 8 | 8 | const Compilation = @import("../Compilation.zig"); |
| 9 | const ir = @import("../air.zig"); | |
| 10 | const Inst = ir.Inst; | |
| 11 | 9 | const Value = @import("../value.zig").Value; |
| 12 | 10 | const Type = @import("../type.zig").Type; |
| 13 | 11 | const TypedValue = @import("../TypedValue.zig"); |
| ... | ... | @@ -15,6 +13,9 @@ const C = link.File.C; |
| 15 | 13 | const Decl = Module.Decl; |
| 16 | 14 | const trace = @import("../tracy.zig").trace; |
| 17 | 15 | const LazySrcLoc = Module.LazySrcLoc; |
| 16 | const Air = @import("../Air.zig"); | |
| 17 | const Zir = @import("../Zir.zig"); | |
| 18 | const Liveness = @import("../Liveness.zig"); | |
| 18 | 19 | |
| 19 | 20 | const Mutability = enum { Const, Mut }; |
| 20 | 21 | |
| ... | ... | @@ -25,7 +26,7 @@ pub const CValue = union(enum) { |
| 25 | 26 | /// Index into local_names, but take the address. |
| 26 | 27 | local_ref: usize, |
| 27 | 28 | /// A constant instruction, to be rendered inline. |
| 28 | constant: *Inst, | |
| 29 | constant: Air.Inst.Ref, | |
| 29 | 30 | /// Index into the parameters |
| 30 | 31 | arg: usize, |
| 31 | 32 | /// By-value |
| ... | ... | @@ -38,7 +39,7 @@ const BlockData = struct { |
| 38 | 39 | result: CValue, |
| 39 | 40 | }; |
| 40 | 41 | |
| 41 | pub const CValueMap = std.AutoHashMap(*Inst, CValue); | |
| 42 | pub const CValueMap = std.AutoHashMap(Air.Inst.Index, CValue); | |
| 42 | 43 | pub const TypedefMap = std.ArrayHashMap( |
| 43 | 44 | Type, |
| 44 | 45 | struct { name: []const u8, rendered: []u8 }, |
| ... | ... | @@ -94,20 +95,23 @@ pub fn fmtIdent(ident: []const u8) std.fmt.Formatter(formatIdent) { |
| 94 | 95 | /// It is not available when generating .h file. |
| 95 | 96 | pub const Object = struct { |
| 96 | 97 | dg: DeclGen, |
| 98 | air: Air, | |
| 99 | liveness: Liveness, | |
| 97 | 100 | gpa: *mem.Allocator, |
| 98 | 101 | code: std.ArrayList(u8), |
| 99 | 102 | value_map: CValueMap, |
| 100 | blocks: std.AutoHashMapUnmanaged(*ir.Inst.Block, BlockData) = .{}, | |
| 103 | blocks: std.AutoHashMapUnmanaged(Air.Inst.Index, BlockData) = .{}, | |
| 101 | 104 | next_arg_index: usize = 0, |
| 102 | 105 | next_local_index: usize = 0, |
| 103 | 106 | next_block_index: usize = 0, |
| 104 | 107 | indent_writer: IndentWriter(std.ArrayList(u8).Writer), |
| 105 | 108 | |
| 106 | fn resolveInst(o: *Object, inst: *Inst) !CValue { | |
| 107 | if (inst.value()) |_| { | |
| 109 | fn resolveInst(o: *Object, inst: Air.Inst.Ref) !CValue { | |
| 110 | if (o.air.value(inst)) |_| { | |
| 108 | 111 | return CValue{ .constant = inst }; |
| 109 | 112 | } |
| 110 | return o.value_map.get(inst).?; // Instruction does not dominate all uses! | |
| 113 | const index = Air.refToIndex(inst).?; | |
| 114 | return o.value_map.get(index).?; // Assertion means instruction does not dominate usage. | |
| 111 | 115 | } |
| 112 | 116 | |
| 113 | 117 | fn allocLocalValue(o: *Object) CValue { |
| ... | ... | @@ -131,7 +135,11 @@ pub const Object = struct { |
| 131 | 135 | .none => unreachable, |
| 132 | 136 | .local => |i| return w.print("t{d}", .{i}), |
| 133 | 137 | .local_ref => |i| return w.print("&t{d}", .{i}), |
| 134 | .constant => |inst| return o.dg.renderValue(w, inst.ty, inst.value().?), | |
| 138 | .constant => |inst| { | |
| 139 | const ty = o.air.typeOf(inst); | |
| 140 | const val = o.air.value(inst).?; | |
| 141 | return o.dg.renderValue(w, ty, val); | |
| 142 | }, | |
| 135 | 143 | .arg => |i| return w.print("a{d}", .{i}), |
| 136 | 144 | .decl => |decl| return w.writeAll(mem.span(decl.name)), |
| 137 | 145 | .decl_ref => |decl| return w.print("&{s}", .{decl.name}), |
| ... | ... | @@ -211,8 +219,9 @@ pub const DeclGen = struct { |
| 211 | 219 | error_msg: ?*Module.ErrorMsg, |
| 212 | 220 | typedefs: TypedefMap, |
| 213 | 221 | |
| 214 | fn fail(dg: *DeclGen, src: LazySrcLoc, comptime format: []const u8, args: anytype) error{ AnalysisFail, OutOfMemory } { | |
| 222 | fn fail(dg: *DeclGen, comptime format: []const u8, args: anytype) error{ AnalysisFail, OutOfMemory } { | |
| 215 | 223 | @setCold(true); |
| 224 | const src: LazySrcLoc = .{ .node_offset = 0 }; | |
| 216 | 225 | const src_loc = src.toSrcLocWithDecl(dg.decl); |
| 217 | 226 | dg.error_msg = try Module.ErrorMsg.create(dg.module.gpa, src_loc, format, args); |
| 218 | 227 | return error.AnalysisFail; |
| ... | ... | @@ -228,7 +237,7 @@ pub const DeclGen = struct { |
| 228 | 237 | // This should lower to 0xaa bytes in safe modes, and for unsafe modes should |
| 229 | 238 | // lower to leaving variables uninitialized (that might need to be implemented |
| 230 | 239 | // outside of this function). |
| 231 | return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement renderValue undef", .{}); | |
| 240 | return dg.fail("TODO: C backend: implement renderValue undef", .{}); | |
| 232 | 241 | } |
| 233 | 242 | switch (t.zigTypeTag()) { |
| 234 | 243 | .Int => { |
| ... | ... | @@ -438,7 +447,7 @@ pub const DeclGen = struct { |
| 438 | 447 | }, |
| 439 | 448 | else => unreachable, |
| 440 | 449 | }, |
| 441 | else => |e| return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement value {s}", .{ | |
| 450 | else => |e| return dg.fail("TODO: C backend: implement value {s}", .{ | |
| 442 | 451 | @tagName(e), |
| 443 | 452 | }), |
| 444 | 453 | } |
| ... | ... | @@ -517,14 +526,14 @@ pub const DeclGen = struct { |
| 517 | 526 | break; |
| 518 | 527 | } |
| 519 | 528 | } else { |
| 520 | return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement integer types larger than 128 bits", .{}); | |
| 529 | return dg.fail("TODO: C backend: implement integer types larger than 128 bits", .{}); | |
| 521 | 530 | } |
| 522 | 531 | }, |
| 523 | 532 | else => unreachable, |
| 524 | 533 | } |
| 525 | 534 | }, |
| 526 | 535 | |
| 527 | .Float => return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement type Float", .{}), | |
| 536 | .Float => return dg.fail("TODO: C backend: implement type Float", .{}), | |
| 528 | 537 | |
| 529 | 538 | .Pointer => { |
| 530 | 539 | if (t.isSlice()) { |
| ... | ... | @@ -679,7 +688,7 @@ pub const DeclGen = struct { |
| 679 | 688 | |
| 680 | 689 | try dg.renderType(w, int_tag_ty); |
| 681 | 690 | }, |
| 682 | .Union => return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement type Union", .{}), | |
| 691 | .Union => return dg.fail("TODO: C backend: implement type Union", .{}), | |
| 683 | 692 | .Fn => { |
| 684 | 693 | try dg.renderType(w, t.fnReturnType()); |
| 685 | 694 | try w.writeAll(" (*)("); |
| ... | ... | @@ -702,10 +711,10 @@ pub const DeclGen = struct { |
| 702 | 711 | } |
| 703 | 712 | try w.writeByte(')'); |
| 704 | 713 | }, |
| 705 | .Opaque => return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement type Opaque", .{}), | |
| 706 | .Frame => return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement type Frame", .{}), | |
| 707 | .AnyFrame => return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement type AnyFrame", .{}), | |
| 708 | .Vector => return dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement type Vector", .{}), | |
| 714 | .Opaque => return dg.fail("TODO: C backend: implement type Opaque", .{}), | |
| 715 | .Frame => return dg.fail("TODO: C backend: implement type Frame", .{}), | |
| 716 | .AnyFrame => return dg.fail("TODO: C backend: implement type AnyFrame", .{}), | |
| 717 | .Vector => return dg.fail("TODO: C backend: implement type Vector", .{}), | |
| 709 | 718 | |
| 710 | 719 | .Null, |
| 711 | 720 | .Undefined, |
| ... | ... | @@ -758,7 +767,8 @@ pub fn genDecl(o: *Object) !void { |
| 758 | 767 | try o.dg.renderFunctionSignature(o.writer(), is_global); |
| 759 | 768 | |
| 760 | 769 | try o.writer().writeByte(' '); |
| 761 | try genBody(o, func.body); | |
| 770 | const main_body = o.air.getMainBody(); | |
| 771 | try genBody(o, main_body); | |
| 762 | 772 | |
| 763 | 773 | try o.indent_writer.insertNewline(); |
| 764 | 774 | return; |
| ... | ... | @@ -831,9 +841,9 @@ pub fn genHeader(dg: *DeclGen) error{ AnalysisFail, OutOfMemory }!void { |
| 831 | 841 | } |
| 832 | 842 | } |
| 833 | 843 | |
| 834 | pub fn genBody(o: *Object, body: ir.Body) error{ AnalysisFail, OutOfMemory }!void { | |
| 844 | fn genBody(o: *Object, body: []const Air.Inst.Index) error{ AnalysisFail, OutOfMemory }!void { | |
| 835 | 845 | const writer = o.writer(); |
| 836 | if (body.instructions.len == 0) { | |
| 846 | if (body.len == 0) { | |
| 837 | 847 | try writer.writeAll("{}"); |
| 838 | 848 | return; |
| 839 | 849 | } |
| ... | ... | @@ -841,82 +851,92 @@ pub fn genBody(o: *Object, body: ir.Body) error{ AnalysisFail, OutOfMemory }!voi |
| 841 | 851 | try writer.writeAll("{\n"); |
| 842 | 852 | o.indent_writer.pushIndent(); |
| 843 | 853 | |
| 844 | for (body.instructions) |inst| { | |
| 845 | const result_value = switch (inst.tag) { | |
| 854 | const air_tags = o.air.instructions.items(.tag); | |
| 855 | ||
| 856 | for (body) |inst| { | |
| 857 | const result_value = switch (air_tags[inst]) { | |
| 858 | // zig fmt: off | |
| 859 | .constant => unreachable, // excluded from function bodies | |
| 860 | .const_ty => unreachable, // excluded from function bodies | |
| 861 | .arg => airArg(o), | |
| 862 | ||
| 863 | .breakpoint => try airBreakpoint(o), | |
| 864 | .unreach => try airUnreach(o), | |
| 865 | ||
| 846 | 866 | // TODO use a different strategy for add that communicates to the optimizer |
| 847 | 867 | // that wrapping is UB. |
| 848 | .add => try genBinOp(o, inst.castTag(.add).?, " + "), | |
| 849 | .addwrap => try genWrapOp(o, inst.castTag(.addwrap).?, " + ", "addw_"), | |
| 868 | .add => try airBinOp( o, inst, " + "), | |
| 869 | .addwrap => try airWrapOp(o, inst, " + ", "addw_"), | |
| 850 | 870 | // TODO use a different strategy for sub that communicates to the optimizer |
| 851 | 871 | // that wrapping is UB. |
| 852 | .sub => try genBinOp(o, inst.castTag(.sub).?, " - "), | |
| 853 | .subwrap => try genWrapOp(o, inst.castTag(.subwrap).?, " - ", "subw_"), | |
| 872 | .sub => try airBinOp( o, inst, " - "), | |
| 873 | .subwrap => try airWrapOp(o, inst, " - ", "subw_"), | |
| 854 | 874 | // TODO use a different strategy for mul that communicates to the optimizer |
| 855 | 875 | // that wrapping is UB. |
| 856 | .mul => try genBinOp(o, inst.castTag(.sub).?, " * "), | |
| 857 | .mulwrap => try genWrapOp(o, inst.castTag(.mulwrap).?, " * ", "mulw_"), | |
| 876 | .mul => try airBinOp( o, inst, " * "), | |
| 877 | .mulwrap => try airWrapOp(o, inst, " * ", "mulw_"), | |
| 858 | 878 | // TODO use a different strategy for div that communicates to the optimizer |
| 859 | 879 | // that wrapping is UB. |
| 860 | .div => try genBinOp(o, inst.castTag(.div).?, " / "), | |
| 880 | .div => try airBinOp( o, inst, " / "), | |
| 881 | ||
| 882 | .cmp_eq => try airBinOp(o, inst, " == "), | |
| 883 | .cmp_gt => try airBinOp(o, inst, " > "), | |
| 884 | .cmp_gte => try airBinOp(o, inst, " >= "), | |
| 885 | .cmp_lt => try airBinOp(o, inst, " < "), | |
| 886 | .cmp_lte => try airBinOp(o, inst, " <= "), | |
| 887 | .cmp_neq => try airBinOp(o, inst, " != "), | |
| 861 | 888 | |
| 862 | .constant => unreachable, // excluded from function bodies | |
| 863 | .alloc => try genAlloc(o, inst.castTag(.alloc).?), | |
| 864 | .arg => genArg(o), | |
| 865 | .assembly => try genAsm(o, inst.castTag(.assembly).?), | |
| 866 | .block => try genBlock(o, inst.castTag(.block).?), | |
| 867 | .bitcast => try genBitcast(o, inst.castTag(.bitcast).?), | |
| 868 | .breakpoint => try genBreakpoint(o, inst.castTag(.breakpoint).?), | |
| 869 | .call => try genCall(o, inst.castTag(.call).?), | |
| 870 | .cmp_eq => try genBinOp(o, inst.castTag(.cmp_eq).?, " == "), | |
| 871 | .cmp_gt => try genBinOp(o, inst.castTag(.cmp_gt).?, " > "), | |
| 872 | .cmp_gte => try genBinOp(o, inst.castTag(.cmp_gte).?, " >= "), | |
| 873 | .cmp_lt => try genBinOp(o, inst.castTag(.cmp_lt).?, " < "), | |
| 874 | .cmp_lte => try genBinOp(o, inst.castTag(.cmp_lte).?, " <= "), | |
| 875 | .cmp_neq => try genBinOp(o, inst.castTag(.cmp_neq).?, " != "), | |
| 876 | .dbg_stmt => try genDbgStmt(o, inst.castTag(.dbg_stmt).?), | |
| 877 | .intcast => try genIntCast(o, inst.castTag(.intcast).?), | |
| 878 | .load => try genLoad(o, inst.castTag(.load).?), | |
| 879 | .ret => try genRet(o, inst.castTag(.ret).?), | |
| 880 | .retvoid => try genRetVoid(o), | |
| 881 | .store => try genStore(o, inst.castTag(.store).?), | |
| 882 | .unreach => try genUnreach(o, inst.castTag(.unreach).?), | |
| 883 | .loop => try genLoop(o, inst.castTag(.loop).?), | |
| 884 | .condbr => try genCondBr(o, inst.castTag(.condbr).?), | |
| 885 | .br => try genBr(o, inst.castTag(.br).?), | |
| 886 | .br_void => try genBrVoid(o, inst.castTag(.br_void).?.block), | |
| 887 | .switchbr => try genSwitchBr(o, inst.castTag(.switchbr).?), | |
| 888 | 889 | // bool_and and bool_or are non-short-circuit operations |
| 889 | .bool_and => try genBinOp(o, inst.castTag(.bool_and).?, " & "), | |
| 890 | .bool_or => try genBinOp(o, inst.castTag(.bool_or).?, " | "), | |
| 891 | .bit_and => try genBinOp(o, inst.castTag(.bit_and).?, " & "), | |
| 892 | .bit_or => try genBinOp(o, inst.castTag(.bit_or).?, " | "), | |
| 893 | .xor => try genBinOp(o, inst.castTag(.xor).?, " ^ "), | |
| 894 | .not => try genUnOp(o, inst.castTag(.not).?, "!"), | |
| 895 | .is_null => try genIsNull(o, inst.castTag(.is_null).?), | |
| 896 | .is_non_null => try genIsNull(o, inst.castTag(.is_non_null).?), | |
| 897 | .is_null_ptr => try genIsNull(o, inst.castTag(.is_null_ptr).?), | |
| 898 | .is_non_null_ptr => try genIsNull(o, inst.castTag(.is_non_null_ptr).?), | |
| 899 | .wrap_optional => try genWrapOptional(o, inst.castTag(.wrap_optional).?), | |
| 900 | .optional_payload => try genOptionalPayload(o, inst.castTag(.optional_payload).?), | |
| 901 | .optional_payload_ptr => try genOptionalPayload(o, inst.castTag(.optional_payload_ptr).?), | |
| 902 | .ref => try genRef(o, inst.castTag(.ref).?), | |
| 903 | .struct_field_ptr => try genStructFieldPtr(o, inst.castTag(.struct_field_ptr).?), | |
| 904 | ||
| 905 | .is_err => try genIsErr(o, inst.castTag(.is_err).?, "", ".", "!="), | |
| 906 | .is_non_err => try genIsErr(o, inst.castTag(.is_non_err).?, "", ".", "=="), | |
| 907 | .is_err_ptr => try genIsErr(o, inst.castTag(.is_err_ptr).?, "*", "->", "!="), | |
| 908 | .is_non_err_ptr => try genIsErr(o, inst.castTag(.is_non_err_ptr).?, "*", "->", "=="), | |
| 909 | ||
| 910 | .unwrap_errunion_payload => try genUnwrapErrUnionPay(o, inst.castTag(.unwrap_errunion_payload).?), | |
| 911 | .unwrap_errunion_err => try genUnwrapErrUnionErr(o, inst.castTag(.unwrap_errunion_err).?), | |
| 912 | .unwrap_errunion_payload_ptr => try genUnwrapErrUnionPay(o, inst.castTag(.unwrap_errunion_payload_ptr).?), | |
| 913 | .unwrap_errunion_err_ptr => try genUnwrapErrUnionErr(o, inst.castTag(.unwrap_errunion_err_ptr).?), | |
| 914 | .wrap_errunion_payload => try genWrapErrUnionPay(o, inst.castTag(.wrap_errunion_payload).?), | |
| 915 | .wrap_errunion_err => try genWrapErrUnionErr(o, inst.castTag(.wrap_errunion_err).?), | |
| 916 | .br_block_flat => return o.dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement codegen for br_block_flat", .{}), | |
| 917 | .ptrtoint => return o.dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement codegen for ptrtoint", .{}), | |
| 918 | .varptr => try genVarPtr(o, inst.castTag(.varptr).?), | |
| 919 | .floatcast => return o.dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement codegen for floatcast", .{}), | |
| 890 | .bool_and => try airBinOp(o, inst, " & "), | |
| 891 | .bool_or => try airBinOp(o, inst, " | "), | |
| 892 | .bit_and => try airBinOp(o, inst, " & "), | |
| 893 | .bit_or => try airBinOp(o, inst, " | "), | |
| 894 | .xor => try airBinOp(o, inst, " ^ "), | |
| 895 | ||
| 896 | .not => try airNot( o, inst), | |
| 897 | ||
| 898 | .optional_payload => try airOptionalPayload(o, inst), | |
| 899 | .optional_payload_ptr => try airOptionalPayload(o, inst), | |
| 900 | ||
| 901 | .is_err => try airIsErr(o, inst, "", ".", "!="), | |
| 902 | .is_non_err => try airIsErr(o, inst, "", ".", "=="), | |
| 903 | .is_err_ptr => try airIsErr(o, inst, "*", "->", "!="), | |
| 904 | .is_non_err_ptr => try airIsErr(o, inst, "*", "->", "=="), | |
| 905 | ||
| 906 | .is_null => try airIsNull(o, inst, "==", ""), | |
| 907 | .is_non_null => try airIsNull(o, inst, "!=", ""), | |
| 908 | .is_null_ptr => try airIsNull(o, inst, "==", "[0]"), | |
| 909 | .is_non_null_ptr => try airIsNull(o, inst, "!=", "[0]"), | |
| 910 | ||
| 911 | .alloc => try airAlloc(o, inst), | |
| 912 | .assembly => try airAsm(o, inst), | |
| 913 | .block => try airBlock(o, inst), | |
| 914 | .bitcast => try airBitcast(o, inst), | |
| 915 | .call => try airCall(o, inst), | |
| 916 | .dbg_stmt => try airDbgStmt(o, inst), | |
| 917 | .intcast => try airIntCast(o, inst), | |
| 918 | .load => try airLoad(o, inst), | |
| 919 | .ret => try airRet(o, inst), | |
| 920 | .store => try airStore(o, inst), | |
| 921 | .loop => try airLoop(o, inst), | |
| 922 | .cond_br => try airCondBr(o, inst), | |
| 923 | .br => try airBr(o, inst), | |
| 924 | .switch_br => try airSwitchBr(o, inst), | |
| 925 | .wrap_optional => try airWrapOptional(o, inst), | |
| 926 | .ref => try airRef(o, inst), | |
| 927 | .struct_field_ptr => try airStructFieldPtr(o, inst), | |
| 928 | .varptr => try airVarPtr(o, inst), | |
| 929 | ||
| 930 | .unwrap_errunion_payload => try airUnwrapErrUnionPay(o, inst), | |
| 931 | .unwrap_errunion_err => try airUnwrapErrUnionErr(o, inst), | |
| 932 | .unwrap_errunion_payload_ptr => try airUnwrapErrUnionPay(o, inst), | |
| 933 | .unwrap_errunion_err_ptr => try airUnwrapErrUnionErr(o, inst), | |
| 934 | .wrap_errunion_payload => try airWrapErrUnionPay(o, inst), | |
| 935 | .wrap_errunion_err => try airWrapErrUnionErr(o, inst), | |
| 936 | ||
| 937 | .ptrtoint => return o.dg.fail("TODO: C backend: implement codegen for ptrtoint", .{}), | |
| 938 | .floatcast => return o.dg.fail("TODO: C backend: implement codegen for floatcast", .{}), | |
| 939 | // zig fmt: on | |
| 920 | 940 | }; |
| 921 | 941 | switch (result_value) { |
| 922 | 942 | .none => {}, |
| ... | ... | @@ -928,38 +948,40 @@ pub fn genBody(o: *Object, body: ir.Body) error{ AnalysisFail, OutOfMemory }!voi |
| 928 | 948 | try writer.writeAll("}"); |
| 929 | 949 | } |
| 930 | 950 | |
| 931 | fn genVarPtr(o: *Object, inst: *Inst.VarPtr) !CValue { | |
| 932 | _ = o; | |
| 933 | return CValue{ .decl_ref = inst.variable.owner_decl }; | |
| 951 | fn airVarPtr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 952 | const ty_pl = o.air.instructions.items(.data)[inst].ty_pl; | |
| 953 | const variable = o.air.variables[ty_pl.payload]; | |
| 954 | return CValue{ .decl_ref = variable.owner_decl }; | |
| 934 | 955 | } |
| 935 | 956 | |
| 936 | fn genAlloc(o: *Object, alloc: *Inst.NoOp) !CValue { | |
| 957 | fn airAlloc(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 937 | 958 | const writer = o.writer(); |
| 959 | const inst_ty = o.air.typeOfIndex(inst); | |
| 938 | 960 | |
| 939 | 961 | // First line: the variable used as data storage. |
| 940 | const elem_type = alloc.base.ty.elemType(); | |
| 941 | const mutability: Mutability = if (alloc.base.ty.isConstPtr()) .Const else .Mut; | |
| 962 | const elem_type = inst_ty.elemType(); | |
| 963 | const mutability: Mutability = if (inst_ty.isConstPtr()) .Const else .Mut; | |
| 942 | 964 | const local = try o.allocLocal(elem_type, mutability); |
| 943 | 965 | try writer.writeAll(";\n"); |
| 944 | 966 | |
| 945 | 967 | return CValue{ .local_ref = local.local }; |
| 946 | 968 | } |
| 947 | 969 | |
| 948 | fn genArg(o: *Object) CValue { | |
| 970 | fn airArg(o: *Object) CValue { | |
| 949 | 971 | const i = o.next_arg_index; |
| 950 | 972 | o.next_arg_index += 1; |
| 951 | 973 | return .{ .arg = i }; |
| 952 | 974 | } |
| 953 | 975 | |
| 954 | fn genRetVoid(o: *Object) !CValue { | |
| 955 | try o.writer().print("return;\n", .{}); | |
| 956 | return CValue.none; | |
| 957 | } | |
| 958 | ||
| 959 | fn genLoad(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 960 | const operand = try o.resolveInst(inst.operand); | |
| 976 | fn airLoad(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 977 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 978 | const is_volatile = o.air.typeOf(ty_op.operand).isVolatilePtr(); | |
| 979 | if (!is_volatile and o.liveness.isUnused(inst)) | |
| 980 | return CValue.none; | |
| 981 | const inst_ty = o.air.typeOfIndex(inst); | |
| 982 | const operand = try o.resolveInst(ty_op.operand); | |
| 961 | 983 | const writer = o.writer(); |
| 962 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 984 | const local = try o.allocLocal(inst_ty, .Const); | |
| 963 | 985 | switch (operand) { |
| 964 | 986 | .local_ref => |i| { |
| 965 | 987 | const wrapped: CValue = .{ .local = i }; |
| ... | ... | @@ -982,35 +1004,43 @@ fn genLoad(o: *Object, inst: *Inst.UnOp) !CValue { |
| 982 | 1004 | return local; |
| 983 | 1005 | } |
| 984 | 1006 | |
| 985 | fn genRet(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 986 | const operand = try o.resolveInst(inst.operand); | |
| 1007 | fn airRet(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1008 | const un_op = o.air.instructions.items(.data)[inst].un_op; | |
| 987 | 1009 | const writer = o.writer(); |
| 988 | try writer.writeAll("return "); | |
| 989 | try o.writeCValue(writer, operand); | |
| 990 | try writer.writeAll(";\n"); | |
| 1010 | if (o.air.typeOf(un_op).hasCodeGenBits()) { | |
| 1011 | const operand = try o.resolveInst(un_op); | |
| 1012 | try writer.writeAll("return "); | |
| 1013 | try o.writeCValue(writer, operand); | |
| 1014 | try writer.writeAll(";\n"); | |
| 1015 | } else { | |
| 1016 | try writer.writeAll("return;\n"); | |
| 1017 | } | |
| 991 | 1018 | return CValue.none; |
| 992 | 1019 | } |
| 993 | 1020 | |
| 994 | fn genIntCast(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 995 | if (inst.base.isUnused()) | |
| 1021 | fn airIntCast(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1022 | if (o.liveness.isUnused(inst)) | |
| 996 | 1023 | return CValue.none; |
| 997 | 1024 | |
| 998 | const from = try o.resolveInst(inst.operand); | |
| 1025 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1026 | const from = try o.resolveInst(ty_op.operand); | |
| 999 | 1027 | |
| 1000 | 1028 | const writer = o.writer(); |
| 1001 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1029 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1030 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1002 | 1031 | try writer.writeAll(" = ("); |
| 1003 | try o.dg.renderType(writer, inst.base.ty); | |
| 1032 | try o.dg.renderType(writer, inst_ty); | |
| 1004 | 1033 | try writer.writeAll(")"); |
| 1005 | 1034 | try o.writeCValue(writer, from); |
| 1006 | 1035 | try writer.writeAll(";\n"); |
| 1007 | 1036 | return local; |
| 1008 | 1037 | } |
| 1009 | 1038 | |
| 1010 | fn genStore(o: *Object, inst: *Inst.BinOp) !CValue { | |
| 1039 | fn airStore(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1011 | 1040 | // *a = b; |
| 1012 | const dest_ptr = try o.resolveInst(inst.lhs); | |
| 1013 | const src_val = try o.resolveInst(inst.rhs); | |
| 1041 | const bin_op = o.air.instructions.items(.data)[inst].bin_op; | |
| 1042 | const dest_ptr = try o.resolveInst(bin_op.lhs); | |
| 1043 | const src_val = try o.resolveInst(bin_op.rhs); | |
| 1014 | 1044 | |
| 1015 | 1045 | const writer = o.writer(); |
| 1016 | 1046 | switch (dest_ptr) { |
| ... | ... | @@ -1039,11 +1069,18 @@ fn genStore(o: *Object, inst: *Inst.BinOp) !CValue { |
| 1039 | 1069 | return CValue.none; |
| 1040 | 1070 | } |
| 1041 | 1071 | |
| 1042 | fn genWrapOp(o: *Object, inst: *Inst.BinOp, str_op: [*:0]const u8, fn_op: [*:0]const u8) !CValue { | |
| 1043 | if (inst.base.isUnused()) | |
| 1072 | fn airWrapOp( | |
| 1073 | o: *Object, | |
| 1074 | inst: Air.Inst.Index, | |
| 1075 | str_op: [*:0]const u8, | |
| 1076 | fn_op: [*:0]const u8, | |
| 1077 | ) !CValue { | |
| 1078 | if (o.liveness.isUnused(inst)) | |
| 1044 | 1079 | return CValue.none; |
| 1045 | 1080 | |
| 1046 | const int_info = inst.base.ty.intInfo(o.dg.module.getTarget()); | |
| 1081 | const bin_op = o.air.instructions.items(.data)[inst].bin_op; | |
| 1082 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1083 | const int_info = inst_ty.intInfo(o.dg.module.getTarget()); | |
| 1047 | 1084 | const bits = int_info.bits; |
| 1048 | 1085 | |
| 1049 | 1086 | // if it's an unsigned int with non-arbitrary bit size then we can just add |
| ... | ... | @@ -1052,19 +1089,19 @@ fn genWrapOp(o: *Object, inst: *Inst.BinOp, str_op: [*:0]const u8, fn_op: [*:0]c |
| 1052 | 1089 | 8, 16, 32, 64, 128 => true, |
| 1053 | 1090 | else => false, |
| 1054 | 1091 | }; |
| 1055 | if (ok_bits or inst.base.ty.tag() != .int_unsigned) { | |
| 1056 | return try genBinOp(o, inst, str_op); | |
| 1092 | if (ok_bits or inst_ty.tag() != .int_unsigned) { | |
| 1093 | return try airBinOp(o, inst, str_op); | |
| 1057 | 1094 | } |
| 1058 | 1095 | } |
| 1059 | 1096 | |
| 1060 | 1097 | if (bits > 64) { |
| 1061 | return o.dg.fail(.{ .node_offset = 0 }, "TODO: C backend: genWrapOp for large integers", .{}); | |
| 1098 | return o.dg.fail("TODO: C backend: airWrapOp for large integers", .{}); | |
| 1062 | 1099 | } |
| 1063 | 1100 | |
| 1064 | 1101 | var min_buf: [80]u8 = undefined; |
| 1065 | 1102 | const min = switch (int_info.signedness) { |
| 1066 | 1103 | .unsigned => "0", |
| 1067 | else => switch (inst.base.ty.tag()) { | |
| 1104 | else => switch (inst_ty.tag()) { | |
| 1068 | 1105 | .c_short => "SHRT_MIN", |
| 1069 | 1106 | .c_int => "INT_MIN", |
| 1070 | 1107 | .c_long => "LONG_MIN", |
| ... | ... | @@ -1081,7 +1118,7 @@ fn genWrapOp(o: *Object, inst: *Inst.BinOp, str_op: [*:0]const u8, fn_op: [*:0]c |
| 1081 | 1118 | }; |
| 1082 | 1119 | |
| 1083 | 1120 | var max_buf: [80]u8 = undefined; |
| 1084 | const max = switch (inst.base.ty.tag()) { | |
| 1121 | const max = switch (inst_ty.tag()) { | |
| 1085 | 1122 | .c_short => "SHRT_MAX", |
| 1086 | 1123 | .c_ushort => "USHRT_MAX", |
| 1087 | 1124 | .c_int => "INT_MAX", |
| ... | ... | @@ -1105,14 +1142,14 @@ fn genWrapOp(o: *Object, inst: *Inst.BinOp, str_op: [*:0]const u8, fn_op: [*:0]c |
| 1105 | 1142 | }, |
| 1106 | 1143 | }; |
| 1107 | 1144 | |
| 1108 | const lhs = try o.resolveInst(inst.lhs); | |
| 1109 | const rhs = try o.resolveInst(inst.rhs); | |
| 1145 | const lhs = try o.resolveInst(bin_op.lhs); | |
| 1146 | const rhs = try o.resolveInst(bin_op.rhs); | |
| 1110 | 1147 | const w = o.writer(); |
| 1111 | 1148 | |
| 1112 | const ret = try o.allocLocal(inst.base.ty, .Mut); | |
| 1149 | const ret = try o.allocLocal(inst_ty, .Mut); | |
| 1113 | 1150 | try w.print(" = zig_{s}", .{fn_op}); |
| 1114 | 1151 | |
| 1115 | switch (inst.base.ty.tag()) { | |
| 1152 | switch (inst_ty.tag()) { | |
| 1116 | 1153 | .isize => try w.writeAll("isize"), |
| 1117 | 1154 | .c_short => try w.writeAll("short"), |
| 1118 | 1155 | .c_int => try w.writeAll("int"), |
| ... | ... | @@ -1149,53 +1186,65 @@ fn genWrapOp(o: *Object, inst: *Inst.BinOp, str_op: [*:0]const u8, fn_op: [*:0]c |
| 1149 | 1186 | return ret; |
| 1150 | 1187 | } |
| 1151 | 1188 | |
| 1152 | fn genBinOp(o: *Object, inst: *Inst.BinOp, operator: [*:0]const u8) !CValue { | |
| 1153 | if (inst.base.isUnused()) | |
| 1189 | fn airNot(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1190 | if (o.liveness.isUnused(inst)) | |
| 1154 | 1191 | return CValue.none; |
| 1155 | 1192 | |
| 1156 | const lhs = try o.resolveInst(inst.lhs); | |
| 1157 | const rhs = try o.resolveInst(inst.rhs); | |
| 1193 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1194 | const op = try o.resolveInst(ty_op.operand); | |
| 1158 | 1195 | |
| 1159 | 1196 | const writer = o.writer(); |
| 1160 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1197 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1198 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1161 | 1199 | |
| 1162 | 1200 | try writer.writeAll(" = "); |
| 1163 | try o.writeCValue(writer, lhs); | |
| 1164 | try writer.print("{s}", .{operator}); | |
| 1165 | try o.writeCValue(writer, rhs); | |
| 1201 | if (inst_ty.zigTypeTag() == .Bool) | |
| 1202 | try writer.writeAll("!") | |
| 1203 | else | |
| 1204 | try writer.writeAll("~"); | |
| 1205 | try o.writeCValue(writer, op); | |
| 1166 | 1206 | try writer.writeAll(";\n"); |
| 1167 | 1207 | |
| 1168 | 1208 | return local; |
| 1169 | 1209 | } |
| 1170 | 1210 | |
| 1171 | fn genUnOp(o: *Object, inst: *Inst.UnOp, operator: []const u8) !CValue { | |
| 1172 | if (inst.base.isUnused()) | |
| 1211 | fn airBinOp(o: *Object, inst: Air.Inst.Index, operator: [*:0]const u8) !CValue { | |
| 1212 | if (o.liveness.isUnused(inst)) | |
| 1173 | 1213 | return CValue.none; |
| 1174 | 1214 | |
| 1175 | const operand = try o.resolveInst(inst.operand); | |
| 1215 | const bin_op = o.air.instructions.items(.data)[inst].bin_op; | |
| 1216 | const lhs = try o.resolveInst(bin_op.lhs); | |
| 1217 | const rhs = try o.resolveInst(bin_op.rhs); | |
| 1176 | 1218 | |
| 1177 | 1219 | const writer = o.writer(); |
| 1178 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1220 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1221 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1179 | 1222 | |
| 1180 | try writer.print(" = {s}", .{operator}); | |
| 1181 | try o.writeCValue(writer, operand); | |
| 1223 | try writer.writeAll(" = "); | |
| 1224 | try o.writeCValue(writer, lhs); | |
| 1225 | try writer.print("{s}", .{operator}); | |
| 1226 | try o.writeCValue(writer, rhs); | |
| 1182 | 1227 | try writer.writeAll(";\n"); |
| 1183 | 1228 | |
| 1184 | 1229 | return local; |
| 1185 | 1230 | } |
| 1186 | 1231 | |
| 1187 | fn genCall(o: *Object, inst: *Inst.Call) !CValue { | |
| 1188 | if (inst.func.castTag(.constant)) |func_inst| { | |
| 1189 | const fn_decl = if (func_inst.val.castTag(.extern_fn)) |extern_fn| | |
| 1232 | fn airCall(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1233 | const pl_op = o.air.instructions.items(.data)[inst].pl_op; | |
| 1234 | const extra = o.air.extraData(Air.Call, pl_op.payload); | |
| 1235 | const args = @bitCast([]const Air.Inst.Ref, o.air.extra[extra.end..][0..extra.data.args_len]); | |
| 1236 | ||
| 1237 | if (o.air.value(pl_op.operand)) |func_val| { | |
| 1238 | const fn_decl = if (func_val.castTag(.extern_fn)) |extern_fn| | |
| 1190 | 1239 | extern_fn.data |
| 1191 | else if (func_inst.val.castTag(.function)) |func_payload| | |
| 1240 | else if (func_val.castTag(.function)) |func_payload| | |
| 1192 | 1241 | func_payload.data.owner_decl |
| 1193 | 1242 | else |
| 1194 | 1243 | unreachable; |
| 1195 | 1244 | |
| 1196 | 1245 | const fn_ty = fn_decl.ty; |
| 1197 | 1246 | const ret_ty = fn_ty.fnReturnType(); |
| 1198 | const unused_result = inst.base.isUnused(); | |
| 1247 | const unused_result = o.liveness.isUnused(inst); | |
| 1199 | 1248 | var result_local: CValue = .none; |
| 1200 | 1249 | |
| 1201 | 1250 | const writer = o.writer(); |
| ... | ... | @@ -1209,41 +1258,44 @@ fn genCall(o: *Object, inst: *Inst.Call) !CValue { |
| 1209 | 1258 | } |
| 1210 | 1259 | const fn_name = mem.spanZ(fn_decl.name); |
| 1211 | 1260 | try writer.print("{s}(", .{fn_name}); |
| 1212 | if (inst.args.len != 0) { | |
| 1213 | for (inst.args) |arg, i| { | |
| 1214 | if (i > 0) { | |
| 1215 | try writer.writeAll(", "); | |
| 1216 | } | |
| 1217 | if (arg.value()) |val| { | |
| 1218 | try o.dg.renderValue(writer, arg.ty, val); | |
| 1219 | } else { | |
| 1220 | const val = try o.resolveInst(arg); | |
| 1221 | try o.writeCValue(writer, val); | |
| 1222 | } | |
| 1261 | for (args) |arg, i| { | |
| 1262 | if (i != 0) { | |
| 1263 | try writer.writeAll(", "); | |
| 1264 | } | |
| 1265 | if (o.air.value(arg)) |val| { | |
| 1266 | try o.dg.renderValue(writer, o.air.typeOf(arg), val); | |
| 1267 | } else { | |
| 1268 | const val = try o.resolveInst(arg); | |
| 1269 | try o.writeCValue(writer, val); | |
| 1223 | 1270 | } |
| 1224 | 1271 | } |
| 1225 | 1272 | try writer.writeAll(");\n"); |
| 1226 | 1273 | return result_local; |
| 1227 | 1274 | } else { |
| 1228 | return o.dg.fail(.{ .node_offset = 0 }, "TODO: C backend: implement function pointers", .{}); | |
| 1275 | return o.dg.fail("TODO: C backend: implement function pointers", .{}); | |
| 1229 | 1276 | } |
| 1230 | 1277 | } |
| 1231 | 1278 | |
| 1232 | fn genDbgStmt(o: *Object, inst: *Inst.DbgStmt) !CValue { | |
| 1233 | _ = o; | |
| 1234 | _ = inst; | |
| 1235 | // TODO emit #line directive here with line number and filename | |
| 1279 | fn airDbgStmt(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1280 | const dbg_stmt = o.air.instructions.items(.data)[inst].dbg_stmt; | |
| 1281 | const writer = o.writer(); | |
| 1282 | try writer.print("#line {d}\n", .{dbg_stmt.line + 1}); | |
| 1236 | 1283 | return CValue.none; |
| 1237 | 1284 | } |
| 1238 | 1285 | |
| 1239 | fn genBlock(o: *Object, inst: *Inst.Block) !CValue { | |
| 1286 | fn airBlock(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1287 | const ty_pl = o.air.instructions.items(.data)[inst].ty_pl; | |
| 1288 | const extra = o.air.extraData(Air.Block, ty_pl.payload); | |
| 1289 | const body = o.air.extra[extra.end..][0..extra.data.body_len]; | |
| 1290 | ||
| 1240 | 1291 | const block_id: usize = o.next_block_index; |
| 1241 | 1292 | o.next_block_index += 1; |
| 1242 | 1293 | const writer = o.writer(); |
| 1243 | 1294 | |
| 1244 | const result = if (inst.base.ty.tag() != .void and !inst.base.isUnused()) blk: { | |
| 1295 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1296 | const result = if (inst_ty.tag() != .void and !o.liveness.isUnused(inst)) blk: { | |
| 1245 | 1297 | // allocate a location for the result |
| 1246 | const local = try o.allocLocal(inst.base.ty, .Mut); | |
| 1298 | const local = try o.allocLocal(inst_ty, .Mut); | |
| 1247 | 1299 | try writer.writeAll(";\n"); |
| 1248 | 1300 | break :blk local; |
| 1249 | 1301 | } else CValue{ .none = {} }; |
| ... | ... | @@ -1253,42 +1305,44 @@ fn genBlock(o: *Object, inst: *Inst.Block) !CValue { |
| 1253 | 1305 | .result = result, |
| 1254 | 1306 | }); |
| 1255 | 1307 | |
| 1256 | try genBody(o, inst.body); | |
| 1308 | try genBody(o, body); | |
| 1257 | 1309 | try o.indent_writer.insertNewline(); |
| 1258 | 1310 | // label must be followed by an expression, add an empty one. |
| 1259 | 1311 | try writer.print("zig_block_{d}:;\n", .{block_id}); |
| 1260 | 1312 | return result; |
| 1261 | 1313 | } |
| 1262 | 1314 | |
| 1263 | fn genBr(o: *Object, inst: *Inst.Br) !CValue { | |
| 1264 | const result = o.blocks.get(inst.block).?.result; | |
| 1315 | fn airBr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1316 | const branch = o.air.instructions.items(.data)[inst].br; | |
| 1317 | const block = o.blocks.get(branch.block_inst).?; | |
| 1318 | const result = block.result; | |
| 1265 | 1319 | const writer = o.writer(); |
| 1266 | 1320 | |
| 1267 | 1321 | // If result is .none then the value of the block is unused. |
| 1268 | if (inst.operand.ty.tag() != .void and result != .none) { | |
| 1269 | const operand = try o.resolveInst(inst.operand); | |
| 1322 | if (result != .none) { | |
| 1323 | const operand = try o.resolveInst(branch.operand); | |
| 1270 | 1324 | try o.writeCValue(writer, result); |
| 1271 | 1325 | try writer.writeAll(" = "); |
| 1272 | 1326 | try o.writeCValue(writer, operand); |
| 1273 | 1327 | try writer.writeAll(";\n"); |
| 1274 | 1328 | } |
| 1275 | 1329 | |
| 1276 | return genBrVoid(o, inst.block); | |
| 1277 | } | |
| 1278 | ||
| 1279 | fn genBrVoid(o: *Object, block: *Inst.Block) !CValue { | |
| 1280 | try o.writer().print("goto zig_block_{d};\n", .{o.blocks.get(block).?.block_id}); | |
| 1330 | try o.writer().print("goto zig_block_{d};\n", .{block.block_id}); | |
| 1281 | 1331 | return CValue.none; |
| 1282 | 1332 | } |
| 1283 | 1333 | |
| 1284 | fn genBitcast(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1285 | const operand = try o.resolveInst(inst.operand); | |
| 1334 | fn airBitcast(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1335 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1336 | const operand = try o.resolveInst(ty_op.operand); | |
| 1286 | 1337 | |
| 1287 | 1338 | const writer = o.writer(); |
| 1288 | if (inst.base.ty.zigTypeTag() == .Pointer and inst.operand.ty.zigTypeTag() == .Pointer) { | |
| 1289 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1339 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1340 | if (inst_ty.zigTypeTag() == .Pointer and | |
| 1341 | o.air.typeOf(ty_op.operand).zigTypeTag() == .Pointer) | |
| 1342 | { | |
| 1343 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1290 | 1344 | try writer.writeAll(" = ("); |
| 1291 | try o.dg.renderType(writer, inst.base.ty); | |
| 1345 | try o.dg.renderType(writer, inst_ty); | |
| 1292 | 1346 | |
| 1293 | 1347 | try writer.writeAll(")"); |
| 1294 | 1348 | try o.writeCValue(writer, operand); |
| ... | ... | @@ -1296,7 +1350,7 @@ fn genBitcast(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1296 | 1350 | return local; |
| 1297 | 1351 | } |
| 1298 | 1352 | |
| 1299 | const local = try o.allocLocal(inst.base.ty, .Mut); | |
| 1353 | const local = try o.allocLocal(inst_ty, .Mut); | |
| 1300 | 1354 | try writer.writeAll(";\n"); |
| 1301 | 1355 | |
| 1302 | 1356 | try writer.writeAll("memcpy(&"); |
| ... | ... | @@ -1310,60 +1364,79 @@ fn genBitcast(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1310 | 1364 | return local; |
| 1311 | 1365 | } |
| 1312 | 1366 | |
| 1313 | fn genBreakpoint(o: *Object, inst: *Inst.NoOp) !CValue { | |
| 1314 | _ = inst; | |
| 1367 | fn airBreakpoint(o: *Object) !CValue { | |
| 1315 | 1368 | try o.writer().writeAll("zig_breakpoint();\n"); |
| 1316 | 1369 | return CValue.none; |
| 1317 | 1370 | } |
| 1318 | 1371 | |
| 1319 | fn genUnreach(o: *Object, inst: *Inst.NoOp) !CValue { | |
| 1320 | _ = inst; | |
| 1372 | fn airUnreach(o: *Object) !CValue { | |
| 1321 | 1373 | try o.writer().writeAll("zig_unreachable();\n"); |
| 1322 | 1374 | return CValue.none; |
| 1323 | 1375 | } |
| 1324 | 1376 | |
| 1325 | fn genLoop(o: *Object, inst: *Inst.Loop) !CValue { | |
| 1377 | fn airLoop(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1378 | const ty_pl = o.air.instructions.items(.data)[inst].ty_pl; | |
| 1379 | const loop = o.air.extraData(Air.Block, ty_pl.payload); | |
| 1380 | const body = o.air.extra[loop.end..][0..loop.data.body_len]; | |
| 1326 | 1381 | try o.writer().writeAll("while (true) "); |
| 1327 | try genBody(o, inst.body); | |
| 1382 | try genBody(o, body); | |
| 1328 | 1383 | try o.indent_writer.insertNewline(); |
| 1329 | 1384 | return CValue.none; |
| 1330 | 1385 | } |
| 1331 | 1386 | |
| 1332 | fn genCondBr(o: *Object, inst: *Inst.CondBr) !CValue { | |
| 1333 | const cond = try o.resolveInst(inst.condition); | |
| 1387 | fn airCondBr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1388 | const pl_op = o.air.instructions.items(.data)[inst].pl_op; | |
| 1389 | const cond = try o.resolveInst(pl_op.operand); | |
| 1390 | const extra = o.air.extraData(Air.CondBr, pl_op.payload); | |
| 1391 | const then_body = o.air.extra[extra.end..][0..extra.data.then_body_len]; | |
| 1392 | const else_body = o.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; | |
| 1334 | 1393 | const writer = o.writer(); |
| 1335 | 1394 | |
| 1336 | 1395 | try writer.writeAll("if ("); |
| 1337 | 1396 | try o.writeCValue(writer, cond); |
| 1338 | 1397 | try writer.writeAll(") "); |
| 1339 | try genBody(o, inst.then_body); | |
| 1398 | try genBody(o, then_body); | |
| 1340 | 1399 | try writer.writeAll(" else "); |
| 1341 | try genBody(o, inst.else_body); | |
| 1400 | try genBody(o, else_body); | |
| 1342 | 1401 | try o.indent_writer.insertNewline(); |
| 1343 | 1402 | |
| 1344 | 1403 | return CValue.none; |
| 1345 | 1404 | } |
| 1346 | 1405 | |
| 1347 | fn genSwitchBr(o: *Object, inst: *Inst.SwitchBr) !CValue { | |
| 1348 | const target = try o.resolveInst(inst.target); | |
| 1406 | fn airSwitchBr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1407 | const pl_op = o.air.instructions.items(.data)[inst].pl_op; | |
| 1408 | const condition = try o.resolveInst(pl_op.operand); | |
| 1409 | const condition_ty = o.air.typeOf(pl_op.operand); | |
| 1410 | const switch_br = o.air.extraData(Air.SwitchBr, pl_op.payload); | |
| 1349 | 1411 | const writer = o.writer(); |
| 1350 | 1412 | |
| 1351 | 1413 | try writer.writeAll("switch ("); |
| 1352 | try o.writeCValue(writer, target); | |
| 1353 | try writer.writeAll(") {\n"); | |
| 1414 | try o.writeCValue(writer, condition); | |
| 1415 | try writer.writeAll(") {"); | |
| 1354 | 1416 | o.indent_writer.pushIndent(); |
| 1355 | 1417 | |
| 1356 | for (inst.cases) |case| { | |
| 1357 | try writer.writeAll("case "); | |
| 1358 | try o.dg.renderValue(writer, inst.target.ty, case.item); | |
| 1359 | try writer.writeAll(": "); | |
| 1360 | // the case body must be noreturn so we don't need to insert a break | |
| 1361 | try genBody(o, case.body); | |
| 1362 | try o.indent_writer.insertNewline(); | |
| 1418 | var extra_index: usize = switch_br.end; | |
| 1419 | var case_i: u32 = 0; | |
| 1420 | while (case_i < switch_br.data.cases_len) : (case_i += 1) { | |
| 1421 | const case = o.air.extraData(Air.SwitchBr.Case, extra_index); | |
| 1422 | const items = @bitCast([]const Air.Inst.Ref, o.air.extra[case.end..][0..case.data.items_len]); | |
| 1423 | const case_body = o.air.extra[case.end + items.len ..][0..case.data.body_len]; | |
| 1424 | extra_index = case.end + case.data.items_len + case_body.len; | |
| 1425 | ||
| 1426 | for (items) |item| { | |
| 1427 | try o.indent_writer.insertNewline(); | |
| 1428 | try writer.writeAll("case "); | |
| 1429 | try o.dg.renderValue(writer, condition_ty, o.air.value(item).?); | |
| 1430 | try writer.writeAll(": "); | |
| 1431 | } | |
| 1432 | // The case body must be noreturn so we don't need to insert a break. | |
| 1433 | try genBody(o, case_body); | |
| 1363 | 1434 | } |
| 1364 | 1435 | |
| 1436 | const else_body = o.air.extra[extra_index..][0..switch_br.data.else_body_len]; | |
| 1437 | try o.indent_writer.insertNewline(); | |
| 1365 | 1438 | try writer.writeAll("default: "); |
| 1366 | try genBody(o, inst.else_body); | |
| 1439 | try genBody(o, else_body); | |
| 1367 | 1440 | try o.indent_writer.insertNewline(); |
| 1368 | 1441 | |
| 1369 | 1442 | o.indent_writer.popIndent(); |
| ... | ... | @@ -1371,39 +1444,75 @@ fn genSwitchBr(o: *Object, inst: *Inst.SwitchBr) !CValue { |
| 1371 | 1444 | return CValue.none; |
| 1372 | 1445 | } |
| 1373 | 1446 | |
| 1374 | fn genAsm(o: *Object, as: *Inst.Assembly) !CValue { | |
| 1375 | if (as.base.isUnused() and !as.is_volatile) | |
| 1447 | fn airAsm(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1448 | const air_datas = o.air.instructions.items(.data); | |
| 1449 | const air_extra = o.air.extraData(Air.Asm, air_datas[inst].ty_pl.payload); | |
| 1450 | const zir = o.dg.decl.namespace.file_scope.zir; | |
| 1451 | const extended = zir.instructions.items(.data)[air_extra.data.zir_index].extended; | |
| 1452 | const zir_extra = zir.extraData(Zir.Inst.Asm, extended.operand); | |
| 1453 | const asm_source = zir.nullTerminatedString(zir_extra.data.asm_source); | |
| 1454 | const outputs_len = @truncate(u5, extended.small); | |
| 1455 | const args_len = @truncate(u5, extended.small >> 5); | |
| 1456 | const clobbers_len = @truncate(u5, extended.small >> 10); | |
| 1457 | _ = clobbers_len; // TODO honor these | |
| 1458 | const is_volatile = @truncate(u1, extended.small >> 15) != 0; | |
| 1459 | const outputs = @bitCast([]const Air.Inst.Ref, o.air.extra[air_extra.end..][0..outputs_len]); | |
| 1460 | const args = @bitCast([]const Air.Inst.Ref, o.air.extra[air_extra.end + outputs.len ..][0..args_len]); | |
| 1461 | ||
| 1462 | if (outputs_len > 1) { | |
| 1463 | return o.dg.fail("TODO implement codegen for asm with more than 1 output", .{}); | |
| 1464 | } | |
| 1465 | ||
| 1466 | if (o.liveness.isUnused(inst) and !is_volatile) | |
| 1376 | 1467 | return CValue.none; |
| 1377 | 1468 | |
| 1469 | var extra_i: usize = zir_extra.end; | |
| 1470 | const output_constraint: ?[]const u8 = out: { | |
| 1471 | var i: usize = 0; | |
| 1472 | while (i < outputs_len) : (i += 1) { | |
| 1473 | const output = zir.extraData(Zir.Inst.Asm.Output, extra_i); | |
| 1474 | extra_i = output.end; | |
| 1475 | break :out zir.nullTerminatedString(output.data.constraint); | |
| 1476 | } | |
| 1477 | break :out null; | |
| 1478 | }; | |
| 1479 | const args_extra_begin = extra_i; | |
| 1480 | ||
| 1378 | 1481 | const writer = o.writer(); |
| 1379 | for (as.inputs) |i, index| { | |
| 1380 | if (i[0] == '{' and i[i.len - 1] == '}') { | |
| 1381 | const reg = i[1 .. i.len - 1]; | |
| 1382 | const arg = as.args[index]; | |
| 1482 | for (args) |arg| { | |
| 1483 | const input = zir.extraData(Zir.Inst.Asm.Input, extra_i); | |
| 1484 | extra_i = input.end; | |
| 1485 | const constraint = zir.nullTerminatedString(input.data.constraint); | |
| 1486 | if (constraint[0] == '{' and constraint[constraint.len - 1] == '}') { | |
| 1487 | const reg = constraint[1 .. constraint.len - 1]; | |
| 1383 | 1488 | const arg_c_value = try o.resolveInst(arg); |
| 1384 | 1489 | try writer.writeAll("register "); |
| 1385 | try o.dg.renderType(writer, arg.ty); | |
| 1490 | try o.dg.renderType(writer, o.air.typeOf(arg)); | |
| 1386 | 1491 | |
| 1387 | 1492 | try writer.print(" {s}_constant __asm__(\"{s}\") = ", .{ reg, reg }); |
| 1388 | 1493 | try o.writeCValue(writer, arg_c_value); |
| 1389 | 1494 | try writer.writeAll(";\n"); |
| 1390 | 1495 | } else { |
| 1391 | return o.dg.fail(.{ .node_offset = 0 }, "TODO non-explicit inline asm regs", .{}); | |
| 1496 | return o.dg.fail("TODO non-explicit inline asm regs", .{}); | |
| 1392 | 1497 | } |
| 1393 | 1498 | } |
| 1394 | const volatile_string: []const u8 = if (as.is_volatile) "volatile " else ""; | |
| 1395 | try writer.print("__asm {s}(\"{s}\"", .{ volatile_string, as.asm_source }); | |
| 1396 | if (as.output_constraint) |_| { | |
| 1397 | return o.dg.fail(.{ .node_offset = 0 }, "TODO: CBE inline asm output", .{}); | |
| 1499 | const volatile_string: []const u8 = if (is_volatile) "volatile " else ""; | |
| 1500 | try writer.print("__asm {s}(\"{s}\"", .{ volatile_string, asm_source }); | |
| 1501 | if (output_constraint) |_| { | |
| 1502 | return o.dg.fail("TODO: CBE inline asm output", .{}); | |
| 1398 | 1503 | } |
| 1399 | if (as.inputs.len > 0) { | |
| 1400 | if (as.output_constraint == null) { | |
| 1504 | if (args.len > 0) { | |
| 1505 | if (output_constraint == null) { | |
| 1401 | 1506 | try writer.writeAll(" :"); |
| 1402 | 1507 | } |
| 1403 | 1508 | try writer.writeAll(": "); |
| 1404 | for (as.inputs) |i, index| { | |
| 1405 | if (i[0] == '{' and i[i.len - 1] == '}') { | |
| 1406 | const reg = i[1 .. i.len - 1]; | |
| 1509 | extra_i = args_extra_begin; | |
| 1510 | for (args) |_, index| { | |
| 1511 | const input = zir.extraData(Zir.Inst.Asm.Input, extra_i); | |
| 1512 | extra_i = input.end; | |
| 1513 | const constraint = zir.nullTerminatedString(input.data.constraint); | |
| 1514 | if (constraint[0] == '{' and constraint[constraint.len - 1] == '}') { | |
| 1515 | const reg = constraint[1 .. constraint.len - 1]; | |
| 1407 | 1516 | if (index > 0) { |
| 1408 | 1517 | try writer.writeAll(", "); |
| 1409 | 1518 | } |
| ... | ... | @@ -1416,40 +1525,51 @@ fn genAsm(o: *Object, as: *Inst.Assembly) !CValue { |
| 1416 | 1525 | } |
| 1417 | 1526 | try writer.writeAll(");\n"); |
| 1418 | 1527 | |
| 1419 | if (as.base.isUnused()) | |
| 1528 | if (o.liveness.isUnused(inst)) | |
| 1420 | 1529 | return CValue.none; |
| 1421 | 1530 | |
| 1422 | return o.dg.fail(.{ .node_offset = 0 }, "TODO: C backend: inline asm expression result used", .{}); | |
| 1531 | return o.dg.fail("TODO: C backend: inline asm expression result used", .{}); | |
| 1423 | 1532 | } |
| 1424 | 1533 | |
| 1425 | fn genIsNull(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1534 | fn airIsNull( | |
| 1535 | o: *Object, | |
| 1536 | inst: Air.Inst.Index, | |
| 1537 | operator: [*:0]const u8, | |
| 1538 | deref_suffix: [*:0]const u8, | |
| 1539 | ) !CValue { | |
| 1540 | if (o.liveness.isUnused(inst)) | |
| 1541 | return CValue.none; | |
| 1542 | ||
| 1543 | const un_op = o.air.instructions.items(.data)[inst].un_op; | |
| 1426 | 1544 | const writer = o.writer(); |
| 1427 | const invert_logic = inst.base.tag == .is_non_null or inst.base.tag == .is_non_null_ptr; | |
| 1428 | const operator = if (invert_logic) "!=" else "=="; | |
| 1429 | const maybe_deref = if (inst.base.tag == .is_null_ptr or inst.base.tag == .is_non_null_ptr) "[0]" else ""; | |
| 1430 | const operand = try o.resolveInst(inst.operand); | |
| 1545 | const operand = try o.resolveInst(un_op); | |
| 1431 | 1546 | |
| 1432 | 1547 | const local = try o.allocLocal(Type.initTag(.bool), .Const); |
| 1433 | 1548 | try writer.writeAll(" = ("); |
| 1434 | 1549 | try o.writeCValue(writer, operand); |
| 1435 | 1550 | |
| 1436 | if (inst.operand.ty.isPtrLikeOptional()) { | |
| 1551 | if (o.air.typeOf(un_op).isPtrLikeOptional()) { | |
| 1437 | 1552 | // operand is a regular pointer, test `operand !=/== NULL` |
| 1438 | try writer.print("){s} {s} NULL;\n", .{ maybe_deref, operator }); | |
| 1553 | try writer.print("){s} {s} NULL;\n", .{ deref_suffix, operator }); | |
| 1439 | 1554 | } else { |
| 1440 | try writer.print("){s}.is_null {s} true;\n", .{ maybe_deref, operator }); | |
| 1555 | try writer.print("){s}.is_null {s} true;\n", .{ deref_suffix, operator }); | |
| 1441 | 1556 | } |
| 1442 | 1557 | return local; |
| 1443 | 1558 | } |
| 1444 | 1559 | |
| 1445 | fn genOptionalPayload(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1560 | fn airOptionalPayload(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1561 | if (o.liveness.isUnused(inst)) | |
| 1562 | return CValue.none; | |
| 1563 | ||
| 1564 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1446 | 1565 | const writer = o.writer(); |
| 1447 | const operand = try o.resolveInst(inst.operand); | |
| 1566 | const operand = try o.resolveInst(ty_op.operand); | |
| 1567 | const operand_ty = o.air.typeOf(ty_op.operand); | |
| 1448 | 1568 | |
| 1449 | const opt_ty = if (inst.operand.ty.zigTypeTag() == .Pointer) | |
| 1450 | inst.operand.ty.elemType() | |
| 1569 | const opt_ty = if (operand_ty.zigTypeTag() == .Pointer) | |
| 1570 | operand_ty.elemType() | |
| 1451 | 1571 | else |
| 1452 | inst.operand.ty; | |
| 1572 | operand_ty; | |
| 1453 | 1573 | |
| 1454 | 1574 | if (opt_ty.isPtrLikeOptional()) { |
| 1455 | 1575 | // the operand is just a regular pointer, no need to do anything special. |
| ... | ... | @@ -1457,10 +1577,11 @@ fn genOptionalPayload(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1457 | 1577 | return operand; |
| 1458 | 1578 | } |
| 1459 | 1579 | |
| 1460 | const maybe_deref = if (inst.operand.ty.zigTypeTag() == .Pointer) "->" else "."; | |
| 1461 | const maybe_addrof = if (inst.base.ty.zigTypeTag() == .Pointer) "&" else ""; | |
| 1580 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1581 | const maybe_deref = if (operand_ty.zigTypeTag() == .Pointer) "->" else "."; | |
| 1582 | const maybe_addrof = if (inst_ty.zigTypeTag() == .Pointer) "&" else ""; | |
| 1462 | 1583 | |
| 1463 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1584 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1464 | 1585 | try writer.print(" = {s}(", .{maybe_addrof}); |
| 1465 | 1586 | try o.writeCValue(writer, operand); |
| 1466 | 1587 | |
| ... | ... | @@ -1468,24 +1589,36 @@ fn genOptionalPayload(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1468 | 1589 | return local; |
| 1469 | 1590 | } |
| 1470 | 1591 | |
| 1471 | fn genRef(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1592 | fn airRef(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1593 | if (o.liveness.isUnused(inst)) | |
| 1594 | return CValue.none; | |
| 1595 | ||
| 1596 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1472 | 1597 | const writer = o.writer(); |
| 1473 | const operand = try o.resolveInst(inst.operand); | |
| 1598 | const operand = try o.resolveInst(ty_op.operand); | |
| 1474 | 1599 | |
| 1475 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1600 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1601 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1476 | 1602 | try writer.writeAll(" = "); |
| 1477 | 1603 | try o.writeCValue(writer, operand); |
| 1478 | 1604 | try writer.writeAll(";\n"); |
| 1479 | 1605 | return local; |
| 1480 | 1606 | } |
| 1481 | 1607 | |
| 1482 | fn genStructFieldPtr(o: *Object, inst: *Inst.StructFieldPtr) !CValue { | |
| 1608 | fn airStructFieldPtr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1609 | if (o.liveness.isUnused(inst)) | |
| 1610 | return CValue.none; | |
| 1611 | ||
| 1612 | const ty_pl = o.air.instructions.items(.data)[inst].ty_pl; | |
| 1613 | const extra = o.air.extraData(Air.StructField, ty_pl.payload).data; | |
| 1483 | 1614 | const writer = o.writer(); |
| 1484 | const struct_ptr = try o.resolveInst(inst.struct_ptr); | |
| 1485 | const struct_obj = inst.struct_ptr.ty.elemType().castTag(.@"struct").?.data; | |
| 1486 | const field_name = struct_obj.fields.keys()[inst.field_index]; | |
| 1615 | const struct_ptr = try o.resolveInst(extra.struct_ptr); | |
| 1616 | const struct_ptr_ty = o.air.typeOf(extra.struct_ptr); | |
| 1617 | const struct_obj = struct_ptr_ty.elemType().castTag(.@"struct").?.data; | |
| 1618 | const field_name = struct_obj.fields.keys()[extra.field_index]; | |
| 1487 | 1619 | |
| 1488 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1620 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1621 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1489 | 1622 | switch (struct_ptr) { |
| 1490 | 1623 | .local_ref => |i| { |
| 1491 | 1624 | try writer.print(" = &t{d}.{};\n", .{ i, fmtIdent(field_name) }); |
| ... | ... | @@ -1500,17 +1633,20 @@ fn genStructFieldPtr(o: *Object, inst: *Inst.StructFieldPtr) !CValue { |
| 1500 | 1633 | } |
| 1501 | 1634 | |
| 1502 | 1635 | // *(E!T) -> E NOT *E |
| 1503 | fn genUnwrapErrUnionErr(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1504 | if (inst.base.isUnused()) | |
| 1636 | fn airUnwrapErrUnionErr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1637 | if (o.liveness.isUnused(inst)) | |
| 1505 | 1638 | return CValue.none; |
| 1506 | 1639 | |
| 1640 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1641 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1507 | 1642 | const writer = o.writer(); |
| 1508 | const operand = try o.resolveInst(inst.operand); | |
| 1643 | const operand = try o.resolveInst(ty_op.operand); | |
| 1644 | const operand_ty = o.air.typeOf(ty_op.operand); | |
| 1509 | 1645 | |
| 1510 | const payload_ty = inst.operand.ty.errorUnionChild(); | |
| 1646 | const payload_ty = operand_ty.errorUnionChild(); | |
| 1511 | 1647 | if (!payload_ty.hasCodeGenBits()) { |
| 1512 | if (inst.operand.ty.zigTypeTag() == .Pointer) { | |
| 1513 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1648 | if (operand_ty.zigTypeTag() == .Pointer) { | |
| 1649 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1514 | 1650 | try writer.writeAll(" = *"); |
| 1515 | 1651 | try o.writeCValue(writer, operand); |
| 1516 | 1652 | try writer.writeAll(";\n"); |
| ... | ... | @@ -1520,9 +1656,9 @@ fn genUnwrapErrUnionErr(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1520 | 1656 | } |
| 1521 | 1657 | } |
| 1522 | 1658 | |
| 1523 | const maybe_deref = if (inst.operand.ty.zigTypeTag() == .Pointer) "->" else "."; | |
| 1659 | const maybe_deref = if (operand_ty.zigTypeTag() == .Pointer) "->" else "."; | |
| 1524 | 1660 | |
| 1525 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1661 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1526 | 1662 | try writer.writeAll(" = ("); |
| 1527 | 1663 | try o.writeCValue(writer, operand); |
| 1528 | 1664 | |
| ... | ... | @@ -1530,22 +1666,25 @@ fn genUnwrapErrUnionErr(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1530 | 1666 | return local; |
| 1531 | 1667 | } |
| 1532 | 1668 | |
| 1533 | fn genUnwrapErrUnionPay(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1534 | if (inst.base.isUnused()) | |
| 1669 | fn airUnwrapErrUnionPay(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1670 | if (o.liveness.isUnused(inst)) | |
| 1535 | 1671 | return CValue.none; |
| 1536 | 1672 | |
| 1673 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1537 | 1674 | const writer = o.writer(); |
| 1538 | const operand = try o.resolveInst(inst.operand); | |
| 1675 | const operand = try o.resolveInst(ty_op.operand); | |
| 1676 | const operand_ty = o.air.typeOf(ty_op.operand); | |
| 1539 | 1677 | |
| 1540 | const payload_ty = inst.operand.ty.errorUnionChild(); | |
| 1678 | const payload_ty = operand_ty.errorUnionChild(); | |
| 1541 | 1679 | if (!payload_ty.hasCodeGenBits()) { |
| 1542 | 1680 | return CValue.none; |
| 1543 | 1681 | } |
| 1544 | 1682 | |
| 1545 | const maybe_deref = if (inst.operand.ty.zigTypeTag() == .Pointer) "->" else "."; | |
| 1546 | const maybe_addrof = if (inst.base.ty.zigTypeTag() == .Pointer) "&" else ""; | |
| 1683 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1684 | const maybe_deref = if (operand_ty.zigTypeTag() == .Pointer) "->" else "."; | |
| 1685 | const maybe_addrof = if (inst_ty.zigTypeTag() == .Pointer) "&" else ""; | |
| 1547 | 1686 | |
| 1548 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1687 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1549 | 1688 | try writer.print(" = {s}(", .{maybe_addrof}); |
| 1550 | 1689 | try o.writeCValue(writer, operand); |
| 1551 | 1690 | |
| ... | ... | @@ -1553,54 +1692,75 @@ fn genUnwrapErrUnionPay(o: *Object, inst: *Inst.UnOp) !CValue { |
| 1553 | 1692 | return local; |
| 1554 | 1693 | } |
| 1555 | 1694 | |
| 1556 | fn genWrapOptional(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1695 | fn airWrapOptional(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1696 | if (o.liveness.isUnused(inst)) | |
| 1697 | return CValue.none; | |
| 1698 | ||
| 1699 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1557 | 1700 | const writer = o.writer(); |
| 1558 | const operand = try o.resolveInst(inst.operand); | |
| 1701 | const operand = try o.resolveInst(ty_op.operand); | |
| 1559 | 1702 | |
| 1560 | if (inst.base.ty.isPtrLikeOptional()) { | |
| 1703 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1704 | if (inst_ty.isPtrLikeOptional()) { | |
| 1561 | 1705 | // the operand is just a regular pointer, no need to do anything special. |
| 1562 | 1706 | return operand; |
| 1563 | 1707 | } |
| 1564 | 1708 | |
| 1565 | 1709 | // .wrap_optional is used to convert non-optionals into optionals so it can never be null. |
| 1566 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1710 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1567 | 1711 | try writer.writeAll(" = { .is_null = false, .payload ="); |
| 1568 | 1712 | try o.writeCValue(writer, operand); |
| 1569 | 1713 | try writer.writeAll("};\n"); |
| 1570 | 1714 | return local; |
| 1571 | 1715 | } |
| 1572 | fn genWrapErrUnionErr(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1716 | fn airWrapErrUnionErr(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1717 | if (o.liveness.isUnused(inst)) | |
| 1718 | return CValue.none; | |
| 1719 | ||
| 1573 | 1720 | const writer = o.writer(); |
| 1574 | const operand = try o.resolveInst(inst.operand); | |
| 1721 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1722 | const operand = try o.resolveInst(ty_op.operand); | |
| 1575 | 1723 | |
| 1576 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1724 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1725 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1577 | 1726 | try writer.writeAll(" = { .error = "); |
| 1578 | 1727 | try o.writeCValue(writer, operand); |
| 1579 | 1728 | try writer.writeAll(" };\n"); |
| 1580 | 1729 | return local; |
| 1581 | 1730 | } |
| 1582 | fn genWrapErrUnionPay(o: *Object, inst: *Inst.UnOp) !CValue { | |
| 1731 | ||
| 1732 | fn airWrapErrUnionPay(o: *Object, inst: Air.Inst.Index) !CValue { | |
| 1733 | if (o.liveness.isUnused(inst)) | |
| 1734 | return CValue.none; | |
| 1735 | ||
| 1736 | const ty_op = o.air.instructions.items(.data)[inst].ty_op; | |
| 1583 | 1737 | const writer = o.writer(); |
| 1584 | const operand = try o.resolveInst(inst.operand); | |
| 1738 | const operand = try o.resolveInst(ty_op.operand); | |
| 1585 | 1739 | |
| 1586 | const local = try o.allocLocal(inst.base.ty, .Const); | |
| 1740 | const inst_ty = o.air.typeOfIndex(inst); | |
| 1741 | const local = try o.allocLocal(inst_ty, .Const); | |
| 1587 | 1742 | try writer.writeAll(" = { .error = 0, .payload = "); |
| 1588 | 1743 | try o.writeCValue(writer, operand); |
| 1589 | 1744 | try writer.writeAll(" };\n"); |
| 1590 | 1745 | return local; |
| 1591 | 1746 | } |
| 1592 | 1747 | |
| 1593 | fn genIsErr( | |
| 1748 | fn airIsErr( | |
| 1594 | 1749 | o: *Object, |
| 1595 | inst: *Inst.UnOp, | |
| 1750 | inst: Air.Inst.Index, | |
| 1596 | 1751 | deref_prefix: [*:0]const u8, |
| 1597 | 1752 | deref_suffix: [*:0]const u8, |
| 1598 | 1753 | op_str: [*:0]const u8, |
| 1599 | 1754 | ) !CValue { |
| 1755 | if (o.liveness.isUnused(inst)) | |
| 1756 | return CValue.none; | |
| 1757 | ||
| 1758 | const un_op = o.air.instructions.items(.data)[inst].un_op; | |
| 1600 | 1759 | const writer = o.writer(); |
| 1601 | const operand = try o.resolveInst(inst.operand); | |
| 1760 | const operand = try o.resolveInst(un_op); | |
| 1761 | const operand_ty = o.air.typeOf(un_op); | |
| 1602 | 1762 | const local = try o.allocLocal(Type.initTag(.bool), .Const); |
| 1603 | const payload_ty = inst.operand.ty.errorUnionChild(); | |
| 1763 | const payload_ty = operand_ty.errorUnionChild(); | |
| 1604 | 1764 | if (!payload_ty.hasCodeGenBits()) { |
| 1605 | 1765 | try writer.print(" = {s}", .{deref_prefix}); |
| 1606 | 1766 | try o.writeCValue(writer, operand); |
src/codegen/llvm.zig+278-195
| ... | ... | @@ -9,8 +9,8 @@ const math = std.math; |
| 9 | 9 | |
| 10 | 10 | const Module = @import("../Module.zig"); |
| 11 | 11 | const TypedValue = @import("../TypedValue.zig"); |
| 12 | const ir = @import("../air.zig"); | |
| 13 | const Inst = ir.Inst; | |
| 12 | const Air = @import("../Air.zig"); | |
| 13 | const Liveness = @import("../Liveness.zig"); | |
| 14 | 14 | |
| 15 | 15 | const Value = @import("../value.zig").Value; |
| 16 | 16 | const Type = @import("../type.zig").Type; |
| ... | ... | @@ -276,6 +276,70 @@ pub const Object = struct { |
| 276 | 276 | } |
| 277 | 277 | } |
| 278 | 278 | |
| 279 | pub fn updateFunc( | |
| 280 | self: *Object, | |
| 281 | module: *Module, | |
| 282 | func: *Module.Fn, | |
| 283 | air: Air, | |
| 284 | liveness: Liveness, | |
| 285 | ) !void { | |
| 286 | var dg: DeclGen = .{ | |
| 287 | .object = self, | |
| 288 | .module = module, | |
| 289 | .decl = func.owner_decl, | |
| 290 | .err_msg = null, | |
| 291 | .gpa = module.gpa, | |
| 292 | }; | |
| 293 | ||
| 294 | const llvm_func = try dg.resolveLLVMFunction(func.owner_decl); | |
| 295 | ||
| 296 | // This gets the LLVM values from the function and stores them in `dg.args`. | |
| 297 | const fn_param_len = func.owner_decl.ty.fnParamLen(); | |
| 298 | var args = try dg.gpa.alloc(*const llvm.Value, fn_param_len); | |
| 299 | ||
| 300 | for (args) |*arg, i| { | |
| 301 | arg.* = llvm.getParam(llvm_func, @intCast(c_uint, i)); | |
| 302 | } | |
| 303 | ||
| 304 | // We remove all the basic blocks of a function to support incremental | |
| 305 | // compilation! | |
| 306 | // TODO: remove all basic blocks if functions can have more than one | |
| 307 | if (llvm_func.getFirstBasicBlock()) |bb| { | |
| 308 | bb.deleteBasicBlock(); | |
| 309 | } | |
| 310 | ||
| 311 | const builder = dg.context().createBuilder(); | |
| 312 | ||
| 313 | const entry_block = dg.context().appendBasicBlock(llvm_func, "Entry"); | |
| 314 | builder.positionBuilderAtEnd(entry_block); | |
| 315 | ||
| 316 | var fg: FuncGen = .{ | |
| 317 | .gpa = dg.gpa, | |
| 318 | .air = air, | |
| 319 | .liveness = liveness, | |
| 320 | .dg = &dg, | |
| 321 | .builder = builder, | |
| 322 | .args = args, | |
| 323 | .arg_index = 0, | |
| 324 | .func_inst_table = .{}, | |
| 325 | .entry_block = entry_block, | |
| 326 | .latest_alloca_inst = null, | |
| 327 | .llvm_func = llvm_func, | |
| 328 | .blocks = .{}, | |
| 329 | }; | |
| 330 | defer fg.deinit(); | |
| 331 | ||
| 332 | fg.genBody(air.getMainBody()) catch |err| switch (err) { | |
| 333 | error.CodegenFail => { | |
| 334 | func.owner_decl.analysis = .codegen_failure; | |
| 335 | try module.failed_decls.put(module.gpa, func.owner_decl, dg.err_msg.?); | |
| 336 | dg.err_msg = null; | |
| 337 | return; | |
| 338 | }, | |
| 339 | else => |e| return e, | |
| 340 | }; | |
| 341 | } | |
| 342 | ||
| 279 | 343 | pub fn updateDecl(self: *Object, module: *Module, decl: *Module.Decl) !void { |
| 280 | 344 | var dg: DeclGen = .{ |
| 281 | 345 | .object = self, |
| ... | ... | @@ -327,44 +391,8 @@ pub const DeclGen = struct { |
| 327 | 391 | log.debug("gen: {s} type: {}, value: {}", .{ decl.name, decl.ty, decl.val }); |
| 328 | 392 | |
| 329 | 393 | if (decl.val.castTag(.function)) |func_payload| { |
| 330 | const func = func_payload.data; | |
| 331 | ||
| 332 | const llvm_func = try self.resolveLLVMFunction(func.owner_decl); | |
| 333 | ||
| 334 | // This gets the LLVM values from the function and stores them in `self.args`. | |
| 335 | const fn_param_len = func.owner_decl.ty.fnParamLen(); | |
| 336 | var args = try self.gpa.alloc(*const llvm.Value, fn_param_len); | |
| 337 | ||
| 338 | for (args) |*arg, i| { | |
| 339 | arg.* = llvm.getParam(llvm_func, @intCast(c_uint, i)); | |
| 340 | } | |
| 341 | ||
| 342 | // We remove all the basic blocks of a function to support incremental | |
| 343 | // compilation! | |
| 344 | // TODO: remove all basic blocks if functions can have more than one | |
| 345 | if (llvm_func.getFirstBasicBlock()) |bb| { | |
| 346 | bb.deleteBasicBlock(); | |
| 347 | } | |
| 348 | ||
| 349 | const builder = self.context().createBuilder(); | |
| 350 | ||
| 351 | const entry_block = self.context().appendBasicBlock(llvm_func, "Entry"); | |
| 352 | builder.positionBuilderAtEnd(entry_block); | |
| 353 | ||
| 354 | var fg: FuncGen = .{ | |
| 355 | .dg = self, | |
| 356 | .builder = builder, | |
| 357 | .args = args, | |
| 358 | .arg_index = 0, | |
| 359 | .func_inst_table = .{}, | |
| 360 | .entry_block = entry_block, | |
| 361 | .latest_alloca_inst = null, | |
| 362 | .llvm_func = llvm_func, | |
| 363 | .blocks = .{}, | |
| 364 | }; | |
| 365 | defer fg.deinit(); | |
| 366 | ||
| 367 | try fg.genBody(func.body); | |
| 394 | _ = func_payload; | |
| 395 | @panic("TODO llvm backend genDecl function pointer"); | |
| 368 | 396 | } else if (decl.val.castTag(.extern_fn)) |extern_fn| { |
| 369 | 397 | _ = try self.resolveLLVMFunction(extern_fn.data); |
| 370 | 398 | } else { |
| ... | ... | @@ -590,29 +618,31 @@ pub const DeclGen = struct { |
| 590 | 618 | }; |
| 591 | 619 | |
| 592 | 620 | pub const FuncGen = struct { |
| 621 | gpa: *Allocator, | |
| 593 | 622 | dg: *DeclGen, |
| 623 | air: Air, | |
| 624 | liveness: Liveness, | |
| 594 | 625 | |
| 595 | 626 | builder: *const llvm.Builder, |
| 596 | 627 | |
| 597 | /// This stores the LLVM values used in a function, such that they can be | |
| 598 | /// referred to in other instructions. This table is cleared before every function is generated. | |
| 599 | /// TODO: Change this to a stack of Branch. Currently we store all the values from all the blocks | |
| 600 | /// in here, however if a block ends, the instructions can be thrown away. | |
| 601 | func_inst_table: std.AutoHashMapUnmanaged(*Inst, *const llvm.Value), | |
| 628 | /// This stores the LLVM values used in a function, such that they can be referred to | |
| 629 | /// in other instructions. This table is cleared before every function is generated. | |
| 630 | func_inst_table: std.AutoHashMapUnmanaged(Air.Inst.Index, *const llvm.Value), | |
| 602 | 631 | |
| 603 | /// These fields are used to refer to the LLVM value of the function paramaters in an Arg instruction. | |
| 632 | /// These fields are used to refer to the LLVM value of the function paramaters | |
| 633 | /// in an Arg instruction. | |
| 604 | 634 | args: []*const llvm.Value, |
| 605 | 635 | arg_index: usize, |
| 606 | 636 | |
| 607 | 637 | entry_block: *const llvm.BasicBlock, |
| 608 | /// This fields stores the last alloca instruction, such that we can append more alloca instructions | |
| 609 | /// to the top of the function. | |
| 638 | /// This fields stores the last alloca instruction, such that we can append | |
| 639 | /// more alloca instructions to the top of the function. | |
| 610 | 640 | latest_alloca_inst: ?*const llvm.Value, |
| 611 | 641 | |
| 612 | 642 | llvm_func: *const llvm.Value, |
| 613 | 643 | |
| 614 | 644 | /// This data structure is used to implement breaking to blocks. |
| 615 | blocks: std.AutoHashMapUnmanaged(*Inst.Block, struct { | |
| 645 | blocks: std.AutoHashMapUnmanaged(Air.Inst.Index, struct { | |
| 616 | 646 | parent_bb: *const llvm.BasicBlock, |
| 617 | 647 | break_bbs: *BreakBasicBlocks, |
| 618 | 648 | break_vals: *BreakValues, |
| ... | ... | @@ -623,9 +653,9 @@ pub const FuncGen = struct { |
| 623 | 653 | |
| 624 | 654 | fn deinit(self: *FuncGen) void { |
| 625 | 655 | self.builder.dispose(); |
| 626 | self.func_inst_table.deinit(self.gpa()); | |
| 627 | self.gpa().free(self.args); | |
| 628 | self.blocks.deinit(self.gpa()); | |
| 656 | self.func_inst_table.deinit(self.gpa); | |
| 657 | self.gpa.free(self.args); | |
| 658 | self.blocks.deinit(self.gpa); | |
| 629 | 659 | } |
| 630 | 660 | |
| 631 | 661 | fn todo(self: *FuncGen, comptime format: []const u8, args: anytype) error{ OutOfMemory, CodegenFail } { |
| ... | ... | @@ -641,65 +671,68 @@ pub const FuncGen = struct { |
| 641 | 671 | return self.dg.object.context; |
| 642 | 672 | } |
| 643 | 673 | |
| 644 | fn gpa(self: *FuncGen) *Allocator { | |
| 645 | return self.dg.gpa; | |
| 646 | } | |
| 647 | ||
| 648 | fn resolveInst(self: *FuncGen, inst: *ir.Inst) !*const llvm.Value { | |
| 649 | if (inst.value()) |val| { | |
| 650 | return self.dg.genTypedValue(.{ .ty = inst.ty, .val = val }, self); | |
| 674 | fn resolveInst(self: *FuncGen, inst: Air.Inst.Ref) !*const llvm.Value { | |
| 675 | if (self.air.value(inst)) |val| { | |
| 676 | return self.dg.genTypedValue(.{ .ty = self.air.typeOf(inst), .val = val }, self); | |
| 651 | 677 | } |
| 652 | if (self.func_inst_table.get(inst)) |value| return value; | |
| 678 | const inst_index = Air.refToIndex(inst).?; | |
| 679 | if (self.func_inst_table.get(inst_index)) |value| return value; | |
| 653 | 680 | |
| 654 | 681 | return self.todo("implement global llvm values (or the value is not in the func_inst_table table)", .{}); |
| 655 | 682 | } |
| 656 | 683 | |
| 657 | fn genBody(self: *FuncGen, body: ir.Body) error{ OutOfMemory, CodegenFail }!void { | |
| 658 | for (body.instructions) |inst| { | |
| 659 | const opt_value = switch (inst.tag) { | |
| 660 | .add => try self.genAdd(inst.castTag(.add).?), | |
| 661 | .alloc => try self.genAlloc(inst.castTag(.alloc).?), | |
| 662 | .arg => try self.genArg(inst.castTag(.arg).?), | |
| 663 | .bitcast => try self.genBitCast(inst.castTag(.bitcast).?), | |
| 664 | .block => try self.genBlock(inst.castTag(.block).?), | |
| 665 | .br => try self.genBr(inst.castTag(.br).?), | |
| 666 | .breakpoint => try self.genBreakpoint(inst.castTag(.breakpoint).?), | |
| 667 | .br_void => try self.genBrVoid(inst.castTag(.br_void).?), | |
| 668 | .call => try self.genCall(inst.castTag(.call).?), | |
| 669 | .cmp_eq => try self.genCmp(inst.castTag(.cmp_eq).?, .eq), | |
| 670 | .cmp_gt => try self.genCmp(inst.castTag(.cmp_gt).?, .gt), | |
| 671 | .cmp_gte => try self.genCmp(inst.castTag(.cmp_gte).?, .gte), | |
| 672 | .cmp_lt => try self.genCmp(inst.castTag(.cmp_lt).?, .lt), | |
| 673 | .cmp_lte => try self.genCmp(inst.castTag(.cmp_lte).?, .lte), | |
| 674 | .cmp_neq => try self.genCmp(inst.castTag(.cmp_neq).?, .neq), | |
| 675 | .condbr => try self.genCondBr(inst.castTag(.condbr).?), | |
| 676 | .intcast => try self.genIntCast(inst.castTag(.intcast).?), | |
| 677 | .is_non_null => try self.genIsNonNull(inst.castTag(.is_non_null).?, false), | |
| 678 | .is_non_null_ptr => try self.genIsNonNull(inst.castTag(.is_non_null_ptr).?, true), | |
| 679 | .is_null => try self.genIsNull(inst.castTag(.is_null).?, false), | |
| 680 | .is_null_ptr => try self.genIsNull(inst.castTag(.is_null_ptr).?, true), | |
| 681 | .load => try self.genLoad(inst.castTag(.load).?), | |
| 682 | .loop => try self.genLoop(inst.castTag(.loop).?), | |
| 683 | .not => try self.genNot(inst.castTag(.not).?), | |
| 684 | .ret => try self.genRet(inst.castTag(.ret).?), | |
| 685 | .retvoid => self.genRetVoid(inst.castTag(.retvoid).?), | |
| 686 | .store => try self.genStore(inst.castTag(.store).?), | |
| 687 | .sub => try self.genSub(inst.castTag(.sub).?), | |
| 688 | .unreach => self.genUnreach(inst.castTag(.unreach).?), | |
| 689 | .optional_payload => try self.genOptionalPayload(inst.castTag(.optional_payload).?, false), | |
| 690 | .optional_payload_ptr => try self.genOptionalPayload(inst.castTag(.optional_payload_ptr).?, true), | |
| 684 | fn genBody(self: *FuncGen, body: []const Air.Inst.Index) error{ OutOfMemory, CodegenFail }!void { | |
| 685 | const air_tags = self.air.instructions.items(.tag); | |
| 686 | for (body) |inst| { | |
| 687 | const opt_value = switch (air_tags[inst]) { | |
| 688 | .add => try self.airAdd(inst), | |
| 689 | .sub => try self.airSub(inst), | |
| 690 | ||
| 691 | .cmp_eq => try self.airCmp(inst, .eq), | |
| 692 | .cmp_gt => try self.airCmp(inst, .gt), | |
| 693 | .cmp_gte => try self.airCmp(inst, .gte), | |
| 694 | .cmp_lt => try self.airCmp(inst, .lt), | |
| 695 | .cmp_lte => try self.airCmp(inst, .lte), | |
| 696 | .cmp_neq => try self.airCmp(inst, .neq), | |
| 697 | ||
| 698 | .is_non_null => try self.airIsNonNull(inst, false), | |
| 699 | .is_non_null_ptr => try self.airIsNonNull(inst, true), | |
| 700 | .is_null => try self.airIsNull(inst, false), | |
| 701 | .is_null_ptr => try self.airIsNull(inst, true), | |
| 702 | ||
| 703 | .alloc => try self.airAlloc(inst), | |
| 704 | .arg => try self.airArg(inst), | |
| 705 | .bitcast => try self.airBitCast(inst), | |
| 706 | .block => try self.airBlock(inst), | |
| 707 | .br => try self.airBr(inst), | |
| 708 | .breakpoint => try self.airBreakpoint(inst), | |
| 709 | .call => try self.airCall(inst), | |
| 710 | .cond_br => try self.airCondBr(inst), | |
| 711 | .intcast => try self.airIntCast(inst), | |
| 712 | .load => try self.airLoad(inst), | |
| 713 | .loop => try self.airLoop(inst), | |
| 714 | .not => try self.airNot(inst), | |
| 715 | .ret => try self.airRet(inst), | |
| 716 | .store => try self.airStore(inst), | |
| 717 | .unreach => self.airUnreach(inst), | |
| 718 | .optional_payload => try self.airOptionalPayload(inst, false), | |
| 719 | .optional_payload_ptr => try self.airOptionalPayload(inst, true), | |
| 691 | 720 | .dbg_stmt => blk: { |
| 692 | 721 | // TODO: implement debug info |
| 693 | 722 | break :blk null; |
| 694 | 723 | }, |
| 695 | else => |tag| return self.todo("implement TZIR instruction: {}", .{tag}), | |
| 724 | else => |tag| return self.todo("implement AIR instruction: {}", .{tag}), | |
| 696 | 725 | }; |
| 697 | if (opt_value) |val| try self.func_inst_table.putNoClobber(self.gpa(), inst, val); | |
| 726 | if (opt_value) |val| try self.func_inst_table.putNoClobber(self.gpa, inst, val); | |
| 698 | 727 | } |
| 699 | 728 | } |
| 700 | 729 | |
| 701 | fn genCall(self: *FuncGen, inst: *Inst.Call) !?*const llvm.Value { | |
| 702 | if (inst.func.value()) |func_value| { | |
| 730 | fn airCall(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 731 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 732 | const extra = self.air.extraData(Air.Call, pl_op.payload); | |
| 733 | const args = @bitCast([]const Air.Inst.Ref, self.air.extra[extra.end..][0..extra.data.args_len]); | |
| 734 | ||
| 735 | if (self.air.value(pl_op.operand)) |func_value| { | |
| 703 | 736 | const fn_decl = if (func_value.castTag(.extern_fn)) |extern_fn| |
| 704 | 737 | extern_fn.data |
| 705 | 738 | else if (func_value.castTag(.function)) |func_payload| |
| ... | ... | @@ -711,12 +744,10 @@ pub const FuncGen = struct { |
| 711 | 744 | const zig_fn_type = fn_decl.ty; |
| 712 | 745 | const llvm_fn = try self.dg.resolveLLVMFunction(fn_decl); |
| 713 | 746 | |
| 714 | const num_args = inst.args.len; | |
| 747 | const llvm_param_vals = try self.gpa.alloc(*const llvm.Value, args.len); | |
| 748 | defer self.gpa.free(llvm_param_vals); | |
| 715 | 749 | |
| 716 | const llvm_param_vals = try self.gpa().alloc(*const llvm.Value, num_args); | |
| 717 | defer self.gpa().free(llvm_param_vals); | |
| 718 | ||
| 719 | for (inst.args) |arg, i| { | |
| 750 | for (args) |arg, i| { | |
| 720 | 751 | llvm_param_vals[i] = try self.resolveInst(arg); |
| 721 | 752 | } |
| 722 | 753 | |
| ... | ... | @@ -724,8 +755,8 @@ pub const FuncGen = struct { |
| 724 | 755 | // Do we need that? |
| 725 | 756 | const call = self.builder.buildCall( |
| 726 | 757 | llvm_fn, |
| 727 | if (num_args == 0) null else llvm_param_vals.ptr, | |
| 728 | @intCast(c_uint, num_args), | |
| 758 | if (args.len == 0) null else llvm_param_vals.ptr, | |
| 759 | @intCast(c_uint, args.len), | |
| 729 | 760 | "", |
| 730 | 761 | ); |
| 731 | 762 | |
| ... | ... | @@ -743,31 +774,31 @@ pub const FuncGen = struct { |
| 743 | 774 | } |
| 744 | 775 | } |
| 745 | 776 | |
| 746 | fn genRetVoid(self: *FuncGen, inst: *Inst.NoOp) ?*const llvm.Value { | |
| 747 | _ = inst; | |
| 748 | _ = self.builder.buildRetVoid(); | |
| 749 | return null; | |
| 750 | } | |
| 751 | ||
| 752 | fn genRet(self: *FuncGen, inst: *Inst.UnOp) !?*const llvm.Value { | |
| 753 | if (!inst.operand.ty.hasCodeGenBits()) { | |
| 754 | // TODO: in astgen these instructions should turn into `retvoid` instructions. | |
| 777 | fn airRet(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 778 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 779 | if (!self.air.typeOf(un_op).hasCodeGenBits()) { | |
| 755 | 780 | _ = self.builder.buildRetVoid(); |
| 756 | 781 | return null; |
| 757 | 782 | } |
| 758 | _ = self.builder.buildRet(try self.resolveInst(inst.operand)); | |
| 783 | const operand = try self.resolveInst(un_op); | |
| 784 | _ = self.builder.buildRet(operand); | |
| 759 | 785 | return null; |
| 760 | 786 | } |
| 761 | 787 | |
| 762 | fn genCmp(self: *FuncGen, inst: *Inst.BinOp, op: math.CompareOperator) !?*const llvm.Value { | |
| 763 | const lhs = try self.resolveInst(inst.lhs); | |
| 764 | const rhs = try self.resolveInst(inst.rhs); | |
| 788 | fn airCmp(self: *FuncGen, inst: Air.Inst.Index, op: math.CompareOperator) !?*const llvm.Value { | |
| 789 | if (self.liveness.isUnused(inst)) | |
| 790 | return null; | |
| 765 | 791 | |
| 766 | if (!inst.base.ty.isInt()) | |
| 767 | if (inst.base.ty.tag() != .bool) | |
| 768 | return self.todo("implement 'genCmp' for type {}", .{inst.base.ty}); | |
| 792 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 793 | const lhs = try self.resolveInst(bin_op.lhs); | |
| 794 | const rhs = try self.resolveInst(bin_op.rhs); | |
| 795 | const inst_ty = self.air.typeOfIndex(inst); | |
| 769 | 796 | |
| 770 | const is_signed = inst.base.ty.isSignedInt(); | |
| 797 | if (!inst_ty.isInt()) | |
| 798 | if (inst_ty.tag() != .bool) | |
| 799 | return self.todo("implement 'airCmp' for type {}", .{inst_ty}); | |
| 800 | ||
| 801 | const is_signed = inst_ty.isSignedInt(); | |
| 771 | 802 | const operation = switch (op) { |
| 772 | 803 | .eq => .EQ, |
| 773 | 804 | .neq => .NE, |
| ... | ... | @@ -780,32 +811,36 @@ pub const FuncGen = struct { |
| 780 | 811 | return self.builder.buildICmp(operation, lhs, rhs, ""); |
| 781 | 812 | } |
| 782 | 813 | |
| 783 | fn genBlock(self: *FuncGen, inst: *Inst.Block) !?*const llvm.Value { | |
| 814 | fn airBlock(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 815 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 816 | const extra = self.air.extraData(Air.Block, ty_pl.payload); | |
| 817 | const body = self.air.extra[extra.end..][0..extra.data.body_len]; | |
| 784 | 818 | const parent_bb = self.context().createBasicBlock("Block"); |
| 785 | 819 | |
| 786 | 820 | // 5 breaks to a block seems like a reasonable default. |
| 787 | var break_bbs = try BreakBasicBlocks.initCapacity(self.gpa(), 5); | |
| 788 | var break_vals = try BreakValues.initCapacity(self.gpa(), 5); | |
| 789 | try self.blocks.putNoClobber(self.gpa(), inst, .{ | |
| 821 | var break_bbs = try BreakBasicBlocks.initCapacity(self.gpa, 5); | |
| 822 | var break_vals = try BreakValues.initCapacity(self.gpa, 5); | |
| 823 | try self.blocks.putNoClobber(self.gpa, inst, .{ | |
| 790 | 824 | .parent_bb = parent_bb, |
| 791 | 825 | .break_bbs = &break_bbs, |
| 792 | 826 | .break_vals = &break_vals, |
| 793 | 827 | }); |
| 794 | 828 | defer { |
| 795 | 829 | assert(self.blocks.remove(inst)); |
| 796 | break_bbs.deinit(self.gpa()); | |
| 797 | break_vals.deinit(self.gpa()); | |
| 830 | break_bbs.deinit(self.gpa); | |
| 831 | break_vals.deinit(self.gpa); | |
| 798 | 832 | } |
| 799 | 833 | |
| 800 | try self.genBody(inst.body); | |
| 834 | try self.genBody(body); | |
| 801 | 835 | |
| 802 | 836 | self.llvm_func.appendExistingBasicBlock(parent_bb); |
| 803 | 837 | self.builder.positionBuilderAtEnd(parent_bb); |
| 804 | 838 | |
| 805 | 839 | // If the block does not return a value, we dont have to create a phi node. |
| 806 | if (!inst.base.ty.hasCodeGenBits()) return null; | |
| 840 | const inst_ty = self.air.typeOfIndex(inst); | |
| 841 | if (!inst_ty.hasCodeGenBits()) return null; | |
| 807 | 842 | |
| 808 | const phi_node = self.builder.buildPhi(try self.dg.getLLVMType(inst.base.ty), ""); | |
| 843 | const phi_node = self.builder.buildPhi(try self.dg.getLLVMType(inst_ty), ""); | |
| 809 | 844 | phi_node.addIncoming( |
| 810 | 845 | break_vals.items.ptr, |
| 811 | 846 | break_bbs.items.ptr, |
| ... | ... | @@ -814,35 +849,30 @@ pub const FuncGen = struct { |
| 814 | 849 | return phi_node; |
| 815 | 850 | } |
| 816 | 851 | |
| 817 | fn genBr(self: *FuncGen, inst: *Inst.Br) !?*const llvm.Value { | |
| 818 | var block = self.blocks.get(inst.block).?; | |
| 852 | fn airBr(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 853 | const branch = self.air.instructions.items(.data)[inst].br; | |
| 854 | const block = self.blocks.get(branch.block_inst).?; | |
| 819 | 855 | |
| 820 | 856 | // If the break doesn't break a value, then we don't have to add |
| 821 | 857 | // the values to the lists. |
| 822 | if (!inst.operand.ty.hasCodeGenBits()) { | |
| 823 | // TODO: in astgen these instructions should turn into `br_void` instructions. | |
| 824 | _ = self.builder.buildBr(block.parent_bb); | |
| 825 | } else { | |
| 826 | const val = try self.resolveInst(inst.operand); | |
| 858 | if (self.air.typeOf(branch.operand).hasCodeGenBits()) { | |
| 859 | const val = try self.resolveInst(branch.operand); | |
| 827 | 860 | |
| 828 | 861 | // For the phi node, we need the basic blocks and the values of the |
| 829 | 862 | // break instructions. |
| 830 | try block.break_bbs.append(self.gpa(), self.builder.getInsertBlock()); | |
| 831 | try block.break_vals.append(self.gpa(), val); | |
| 832 | ||
| 833 | _ = self.builder.buildBr(block.parent_bb); | |
| 863 | try block.break_bbs.append(self.gpa, self.builder.getInsertBlock()); | |
| 864 | try block.break_vals.append(self.gpa, val); | |
| 834 | 865 | } |
| 835 | return null; | |
| 836 | } | |
| 837 | ||
| 838 | fn genBrVoid(self: *FuncGen, inst: *Inst.BrVoid) !?*const llvm.Value { | |
| 839 | var block = self.blocks.get(inst.block).?; | |
| 840 | 866 | _ = self.builder.buildBr(block.parent_bb); |
| 841 | 867 | return null; |
| 842 | 868 | } |
| 843 | 869 | |
| 844 | fn genCondBr(self: *FuncGen, inst: *Inst.CondBr) !?*const llvm.Value { | |
| 845 | const condition_value = try self.resolveInst(inst.condition); | |
| 870 | fn airCondBr(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 871 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 872 | const cond = try self.resolveInst(pl_op.operand); | |
| 873 | const extra = self.air.extraData(Air.CondBr, pl_op.payload); | |
| 874 | const then_body = self.air.extra[extra.end..][0..extra.data.then_body_len]; | |
| 875 | const else_body = self.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; | |
| 846 | 876 | |
| 847 | 877 | const then_block = self.context().appendBasicBlock(self.llvm_func, "Then"); |
| 848 | 878 | const else_block = self.context().appendBasicBlock(self.llvm_func, "Else"); |
| ... | ... | @@ -851,38 +881,51 @@ pub const FuncGen = struct { |
| 851 | 881 | defer self.builder.positionBuilderAtEnd(prev_block); |
| 852 | 882 | |
| 853 | 883 | self.builder.positionBuilderAtEnd(then_block); |
| 854 | try self.genBody(inst.then_body); | |
| 884 | try self.genBody(then_body); | |
| 855 | 885 | |
| 856 | 886 | self.builder.positionBuilderAtEnd(else_block); |
| 857 | try self.genBody(inst.else_body); | |
| 887 | try self.genBody(else_body); | |
| 858 | 888 | } |
| 859 | _ = self.builder.buildCondBr(condition_value, then_block, else_block); | |
| 889 | _ = self.builder.buildCondBr(cond, then_block, else_block); | |
| 860 | 890 | return null; |
| 861 | 891 | } |
| 862 | 892 | |
| 863 | fn genLoop(self: *FuncGen, inst: *Inst.Loop) !?*const llvm.Value { | |
| 893 | fn airLoop(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 894 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 895 | const loop = self.air.extraData(Air.Block, ty_pl.payload); | |
| 896 | const body = self.air.extra[loop.end..][0..loop.data.body_len]; | |
| 864 | 897 | const loop_block = self.context().appendBasicBlock(self.llvm_func, "Loop"); |
| 865 | 898 | _ = self.builder.buildBr(loop_block); |
| 866 | 899 | |
| 867 | 900 | self.builder.positionBuilderAtEnd(loop_block); |
| 868 | try self.genBody(inst.body); | |
| 901 | try self.genBody(body); | |
| 869 | 902 | |
| 870 | 903 | _ = self.builder.buildBr(loop_block); |
| 871 | 904 | return null; |
| 872 | 905 | } |
| 873 | 906 | |
| 874 | fn genNot(self: *FuncGen, inst: *Inst.UnOp) !?*const llvm.Value { | |
| 875 | return self.builder.buildNot(try self.resolveInst(inst.operand), ""); | |
| 907 | fn airNot(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 908 | if (self.liveness.isUnused(inst)) | |
| 909 | return null; | |
| 910 | ||
| 911 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 912 | const operand = try self.resolveInst(ty_op.operand); | |
| 913 | ||
| 914 | return self.builder.buildNot(operand, ""); | |
| 876 | 915 | } |
| 877 | 916 | |
| 878 | fn genUnreach(self: *FuncGen, inst: *Inst.NoOp) ?*const llvm.Value { | |
| 917 | fn airUnreach(self: *FuncGen, inst: Air.Inst.Index) ?*const llvm.Value { | |
| 879 | 918 | _ = inst; |
| 880 | 919 | _ = self.builder.buildUnreachable(); |
| 881 | 920 | return null; |
| 882 | 921 | } |
| 883 | 922 | |
| 884 | fn genIsNonNull(self: *FuncGen, inst: *Inst.UnOp, operand_is_ptr: bool) !?*const llvm.Value { | |
| 885 | const operand = try self.resolveInst(inst.operand); | |
| 923 | fn airIsNonNull(self: *FuncGen, inst: Air.Inst.Index, operand_is_ptr: bool) !?*const llvm.Value { | |
| 924 | if (self.liveness.isUnused(inst)) | |
| 925 | return null; | |
| 926 | ||
| 927 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 928 | const operand = try self.resolveInst(un_op); | |
| 886 | 929 | |
| 887 | 930 | if (operand_is_ptr) { |
| 888 | 931 | const index_type = self.context().intType(32); |
| ... | ... | @@ -898,12 +941,23 @@ pub const FuncGen = struct { |
| 898 | 941 | } |
| 899 | 942 | } |
| 900 | 943 | |
| 901 | fn genIsNull(self: *FuncGen, inst: *Inst.UnOp, operand_is_ptr: bool) !?*const llvm.Value { | |
| 902 | return self.builder.buildNot((try self.genIsNonNull(inst, operand_is_ptr)).?, ""); | |
| 944 | fn airIsNull(self: *FuncGen, inst: Air.Inst.Index, operand_is_ptr: bool) !?*const llvm.Value { | |
| 945 | if (self.liveness.isUnused(inst)) | |
| 946 | return null; | |
| 947 | ||
| 948 | return self.builder.buildNot((try self.airIsNonNull(inst, operand_is_ptr)).?, ""); | |
| 903 | 949 | } |
| 904 | 950 | |
| 905 | fn genOptionalPayload(self: *FuncGen, inst: *Inst.UnOp, operand_is_ptr: bool) !?*const llvm.Value { | |
| 906 | const operand = try self.resolveInst(inst.operand); | |
| 951 | fn airOptionalPayload( | |
| 952 | self: *FuncGen, | |
| 953 | inst: Air.Inst.Index, | |
| 954 | operand_is_ptr: bool, | |
| 955 | ) !?*const llvm.Value { | |
| 956 | if (self.liveness.isUnused(inst)) | |
| 957 | return null; | |
| 958 | ||
| 959 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 960 | const operand = try self.resolveInst(ty_op.operand); | |
| 907 | 961 | |
| 908 | 962 | if (operand_is_ptr) { |
| 909 | 963 | const index_type = self.context().intType(32); |
| ... | ... | @@ -919,61 +973,83 @@ pub const FuncGen = struct { |
| 919 | 973 | } |
| 920 | 974 | } |
| 921 | 975 | |
| 922 | fn genAdd(self: *FuncGen, inst: *Inst.BinOp) !?*const llvm.Value { | |
| 923 | const lhs = try self.resolveInst(inst.lhs); | |
| 924 | const rhs = try self.resolveInst(inst.rhs); | |
| 976 | fn airAdd(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 977 | if (self.liveness.isUnused(inst)) | |
| 978 | return null; | |
| 979 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 980 | const lhs = try self.resolveInst(bin_op.lhs); | |
| 981 | const rhs = try self.resolveInst(bin_op.rhs); | |
| 982 | const inst_ty = self.air.typeOfIndex(inst); | |
| 925 | 983 | |
| 926 | if (!inst.base.ty.isInt()) | |
| 927 | return self.todo("implement 'genAdd' for type {}", .{inst.base.ty}); | |
| 984 | if (!inst_ty.isInt()) | |
| 985 | return self.todo("implement 'airAdd' for type {}", .{inst_ty}); | |
| 928 | 986 | |
| 929 | return if (inst.base.ty.isSignedInt()) | |
| 987 | return if (inst_ty.isSignedInt()) | |
| 930 | 988 | self.builder.buildNSWAdd(lhs, rhs, "") |
| 931 | 989 | else |
| 932 | 990 | self.builder.buildNUWAdd(lhs, rhs, ""); |
| 933 | 991 | } |
| 934 | 992 | |
| 935 | fn genSub(self: *FuncGen, inst: *Inst.BinOp) !?*const llvm.Value { | |
| 936 | const lhs = try self.resolveInst(inst.lhs); | |
| 937 | const rhs = try self.resolveInst(inst.rhs); | |
| 993 | fn airSub(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 994 | if (self.liveness.isUnused(inst)) | |
| 995 | return null; | |
| 996 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 997 | const lhs = try self.resolveInst(bin_op.lhs); | |
| 998 | const rhs = try self.resolveInst(bin_op.rhs); | |
| 999 | const inst_ty = self.air.typeOfIndex(inst); | |
| 938 | 1000 | |
| 939 | if (!inst.base.ty.isInt()) | |
| 940 | return self.todo("implement 'genSub' for type {}", .{inst.base.ty}); | |
| 1001 | if (!inst_ty.isInt()) | |
| 1002 | return self.todo("implement 'airSub' for type {}", .{inst_ty}); | |
| 941 | 1003 | |
| 942 | return if (inst.base.ty.isSignedInt()) | |
| 1004 | return if (inst_ty.isSignedInt()) | |
| 943 | 1005 | self.builder.buildNSWSub(lhs, rhs, "") |
| 944 | 1006 | else |
| 945 | 1007 | self.builder.buildNUWSub(lhs, rhs, ""); |
| 946 | 1008 | } |
| 947 | 1009 | |
| 948 | fn genIntCast(self: *FuncGen, inst: *Inst.UnOp) !?*const llvm.Value { | |
| 949 | const val = try self.resolveInst(inst.operand); | |
| 1010 | fn airIntCast(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 1011 | if (self.liveness.isUnused(inst)) | |
| 1012 | return null; | |
| 1013 | ||
| 1014 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1015 | const operand = try self.resolveInst(ty_op.operand); | |
| 1016 | const inst_ty = self.air.typeOfIndex(inst); | |
| 950 | 1017 | |
| 951 | const signed = inst.base.ty.isSignedInt(); | |
| 1018 | const signed = inst_ty.isSignedInt(); | |
| 952 | 1019 | // TODO: Should we use intcast here or just a simple bitcast? |
| 953 | 1020 | // LLVM does truncation vs bitcast (+signed extension) in the intcast depending on the sizes |
| 954 | return self.builder.buildIntCast2(val, try self.dg.getLLVMType(inst.base.ty), llvm.Bool.fromBool(signed), ""); | |
| 1021 | return self.builder.buildIntCast2(operand, try self.dg.getLLVMType(inst_ty), llvm.Bool.fromBool(signed), ""); | |
| 955 | 1022 | } |
| 956 | 1023 | |
| 957 | fn genBitCast(self: *FuncGen, inst: *Inst.UnOp) !?*const llvm.Value { | |
| 958 | const val = try self.resolveInst(inst.operand); | |
| 959 | const dest_type = try self.dg.getLLVMType(inst.base.ty); | |
| 1024 | fn airBitCast(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 1025 | if (self.liveness.isUnused(inst)) | |
| 1026 | return null; | |
| 1027 | ||
| 1028 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1029 | const operand = try self.resolveInst(ty_op.operand); | |
| 1030 | const inst_ty = self.air.typeOfIndex(inst); | |
| 1031 | const dest_type = try self.dg.getLLVMType(inst_ty); | |
| 960 | 1032 | |
| 961 | return self.builder.buildBitCast(val, dest_type, ""); | |
| 1033 | return self.builder.buildBitCast(operand, dest_type, ""); | |
| 962 | 1034 | } |
| 963 | 1035 | |
| 964 | fn genArg(self: *FuncGen, inst: *Inst.Arg) !?*const llvm.Value { | |
| 1036 | fn airArg(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 965 | 1037 | const arg_val = self.args[self.arg_index]; |
| 966 | 1038 | self.arg_index += 1; |
| 967 | 1039 | |
| 968 | const ptr_val = self.buildAlloca(try self.dg.getLLVMType(inst.base.ty)); | |
| 1040 | const inst_ty = self.air.typeOfIndex(inst); | |
| 1041 | const ptr_val = self.buildAlloca(try self.dg.getLLVMType(inst_ty)); | |
| 969 | 1042 | _ = self.builder.buildStore(arg_val, ptr_val); |
| 970 | 1043 | return self.builder.buildLoad(ptr_val, ""); |
| 971 | 1044 | } |
| 972 | 1045 | |
| 973 | fn genAlloc(self: *FuncGen, inst: *Inst.NoOp) !?*const llvm.Value { | |
| 1046 | fn airAlloc(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 1047 | if (self.liveness.isUnused(inst)) | |
| 1048 | return null; | |
| 974 | 1049 | // buildAlloca expects the pointee type, not the pointer type, so assert that |
| 975 | 1050 | // a Payload.PointerSimple is passed to the alloc instruction. |
| 976 | const pointee_type = inst.base.ty.castPointer().?.data; | |
| 1051 | const inst_ty = self.air.typeOfIndex(inst); | |
| 1052 | const pointee_type = inst_ty.castPointer().?.data; | |
| 977 | 1053 | |
| 978 | 1054 | // TODO: figure out a way to get the name of the var decl. |
| 979 | 1055 | // TODO: set alignment and volatile |
| ... | ... | @@ -1004,19 +1080,26 @@ pub const FuncGen = struct { |
| 1004 | 1080 | return val; |
| 1005 | 1081 | } |
| 1006 | 1082 | |
| 1007 | fn genStore(self: *FuncGen, inst: *Inst.BinOp) !?*const llvm.Value { | |
| 1008 | const val = try self.resolveInst(inst.rhs); | |
| 1009 | const ptr = try self.resolveInst(inst.lhs); | |
| 1010 | _ = self.builder.buildStore(val, ptr); | |
| 1083 | fn airStore(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 1084 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 1085 | const dest_ptr = try self.resolveInst(bin_op.lhs); | |
| 1086 | const src_operand = try self.resolveInst(bin_op.rhs); | |
| 1087 | // TODO set volatile on this store properly | |
| 1088 | _ = self.builder.buildStore(src_operand, dest_ptr); | |
| 1011 | 1089 | return null; |
| 1012 | 1090 | } |
| 1013 | 1091 | |
| 1014 | fn genLoad(self: *FuncGen, inst: *Inst.UnOp) !?*const llvm.Value { | |
| 1015 | const ptr_val = try self.resolveInst(inst.operand); | |
| 1016 | return self.builder.buildLoad(ptr_val, ""); | |
| 1092 | fn airLoad(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 1093 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1094 | const is_volatile = self.air.typeOf(ty_op.operand).isVolatilePtr(); | |
| 1095 | if (!is_volatile and self.liveness.isUnused(inst)) | |
| 1096 | return null; | |
| 1097 | const ptr = try self.resolveInst(ty_op.operand); | |
| 1098 | // TODO set volatile on this load properly | |
| 1099 | return self.builder.buildLoad(ptr, ""); | |
| 1017 | 1100 | } |
| 1018 | 1101 | |
| 1019 | fn genBreakpoint(self: *FuncGen, inst: *Inst.NoOp) !?*const llvm.Value { | |
| 1102 | fn airBreakpoint(self: *FuncGen, inst: Air.Inst.Index) !?*const llvm.Value { | |
| 1020 | 1103 | _ = inst; |
| 1021 | 1104 | const llvn_fn = self.getIntrinsic("llvm.debugtrap"); |
| 1022 | 1105 | _ = self.builder.buildCall(llvn_fn, null, 0, ""); |
src/codegen/spirv.zig+247-245
| ... | ... | @@ -12,21 +12,21 @@ const Decl = Module.Decl; |
| 12 | 12 | const Type = @import("../type.zig").Type; |
| 13 | 13 | const Value = @import("../value.zig").Value; |
| 14 | 14 | const LazySrcLoc = Module.LazySrcLoc; |
| 15 | const ir = @import("../air.zig"); | |
| 16 | const Inst = ir.Inst; | |
| 15 | const Air = @import("../Air.zig"); | |
| 16 | const Liveness = @import("../Liveness.zig"); | |
| 17 | 17 | |
| 18 | 18 | pub const Word = u32; |
| 19 | 19 | pub const ResultId = u32; |
| 20 | 20 | |
| 21 | 21 | pub const TypeMap = std.HashMap(Type, u32, Type.HashContext64, std.hash_map.default_max_load_percentage); |
| 22 | pub const InstMap = std.AutoHashMap(*Inst, ResultId); | |
| 22 | pub const InstMap = std.AutoHashMap(Air.Inst.Index, ResultId); | |
| 23 | 23 | |
| 24 | 24 | const IncomingBlock = struct { |
| 25 | 25 | src_label_id: ResultId, |
| 26 | 26 | break_value_id: ResultId, |
| 27 | 27 | }; |
| 28 | 28 | |
| 29 | pub const BlockMap = std.AutoHashMap(*Inst.Block, struct { | |
| 29 | pub const BlockMap = std.AutoHashMap(Air.Inst.Index, struct { | |
| 30 | 30 | label_id: ResultId, |
| 31 | 31 | incoming_blocks: *std.ArrayListUnmanaged(IncomingBlock), |
| 32 | 32 | }); |
| ... | ... | @@ -160,7 +160,11 @@ pub const DeclGen = struct { |
| 160 | 160 | /// The SPIR-V module code should be put in. |
| 161 | 161 | spv: *SPIRVModule, |
| 162 | 162 | |
| 163 | /// An array of function argument result-ids. Each index corresponds with the function argument of the same index. | |
| 163 | air: Air, | |
| 164 | liveness: Liveness, | |
| 165 | ||
| 166 | /// An array of function argument result-ids. Each index corresponds with the | |
| 167 | /// function argument of the same index. | |
| 164 | 168 | args: std.ArrayList(ResultId), |
| 165 | 169 | |
| 166 | 170 | /// A counter to keep track of how many `arg` instructions we've seen yet. |
| ... | ... | @@ -169,33 +173,35 @@ pub const DeclGen = struct { |
| 169 | 173 | /// A map keeping track of which instruction generated which result-id. |
| 170 | 174 | inst_results: InstMap, |
| 171 | 175 | |
| 172 | /// We need to keep track of result ids for block labels, as well as the 'incoming' blocks for a block. | |
| 176 | /// We need to keep track of result ids for block labels, as well as the 'incoming' | |
| 177 | /// blocks for a block. | |
| 173 | 178 | blocks: BlockMap, |
| 174 | 179 | |
| 175 | 180 | /// The label of the SPIR-V block we are currently generating. |
| 176 | 181 | current_block_label_id: ResultId, |
| 177 | 182 | |
| 178 | /// The actual instructions for this function. We need to declare all locals in the first block, and because we don't | |
| 179 | /// know which locals there are going to be, we're just going to generate everything after the locals-section in this array. | |
| 180 | /// Note: It will not contain OpFunction, OpFunctionParameter, OpVariable and the initial OpLabel. These will be generated | |
| 181 | /// into spv.binary.fn_decls directly. | |
| 183 | /// The actual instructions for this function. We need to declare all locals in | |
| 184 | /// the first block, and because we don't know which locals there are going to be, | |
| 185 | /// we're just going to generate everything after the locals-section in this array. | |
| 186 | /// Note: It will not contain OpFunction, OpFunctionParameter, OpVariable and the | |
| 187 | /// initial OpLabel. These will be generated into spv.binary.fn_decls directly. | |
| 182 | 188 | code: std.ArrayList(Word), |
| 183 | 189 | |
| 184 | 190 | /// The decl we are currently generating code for. |
| 185 | 191 | decl: *Decl, |
| 186 | 192 | |
| 187 | /// If `gen` returned `Error.AnalysisFail`, this contains an explanatory message. Memory is owned by | |
| 188 | /// `module.gpa`. | |
| 193 | /// If `gen` returned `Error.AnalysisFail`, this contains an explanatory message. | |
| 194 | /// Memory is owned by `module.gpa`. | |
| 189 | 195 | error_msg: ?*Module.ErrorMsg, |
| 190 | 196 | |
| 191 | 197 | /// Possible errors the `gen` function may return. |
| 192 | 198 | const Error = error{ AnalysisFail, OutOfMemory }; |
| 193 | 199 | |
| 194 | /// This structure is used to return information about a type typically used for arithmetic operations. | |
| 195 | /// These types may either be integers, floats, or a vector of these. Most scalar operations also work on vectors, | |
| 196 | /// so we can easily represent those as arithmetic types. | |
| 197 | /// If the type is a scalar, 'inner type' refers to the scalar type. Otherwise, if its a vector, it refers | |
| 198 | /// to the vector's element type. | |
| 200 | /// This structure is used to return information about a type typically used for | |
| 201 | /// arithmetic operations. These types may either be integers, floats, or a vector | |
| 202 | /// of these. Most scalar operations also work on vectors, so we can easily represent | |
| 203 | /// those as arithmetic types. If the type is a scalar, 'inner type' refers to the | |
| 204 | /// scalar type. Otherwise, if its a vector, it refers to the vector's element type. | |
| 199 | 205 | const ArithmeticTypeInfo = struct { |
| 200 | 206 | /// A classification of the inner type. |
| 201 | 207 | const Class = enum { |
| ... | ... | @@ -207,13 +213,14 @@ pub const DeclGen = struct { |
| 207 | 213 | /// the relevant capability is enabled). |
| 208 | 214 | integer, |
| 209 | 215 | |
| 210 | /// A regular float. These are all required to be natively supported. Floating points for | |
| 211 | /// which the relevant capability is not enabled are not emulated. | |
| 216 | /// A regular float. These are all required to be natively supported. Floating points | |
| 217 | /// for which the relevant capability is not enabled are not emulated. | |
| 212 | 218 | float, |
| 213 | 219 | |
| 214 | /// An integer of a 'strange' size (which' bit size is not the same as its backing type. **Note**: this | |
| 215 | /// may **also** include power-of-2 integers for which the relevant capability is not enabled), but still | |
| 216 | /// within the limits of the largest natively supported integer type. | |
| 220 | /// An integer of a 'strange' size (which' bit size is not the same as its backing | |
| 221 | /// type. **Note**: this may **also** include power-of-2 integers for which the | |
| 222 | /// relevant capability is not enabled), but still within the limits of the largest | |
| 223 | /// natively supported integer type. | |
| 217 | 224 | strange_integer, |
| 218 | 225 | |
| 219 | 226 | /// An integer with more bits than the largest natively supported integer type. |
| ... | ... | @@ -221,7 +228,7 @@ pub const DeclGen = struct { |
| 221 | 228 | }; |
| 222 | 229 | |
| 223 | 230 | /// The number of bits in the inner type. |
| 224 | /// Note: this is the actual number of bits of the type, not the size of the backing integer. | |
| 231 | /// This is the actual number of bits of the type, not the size of the backing integer. | |
| 225 | 232 | bits: u16, |
| 226 | 233 | |
| 227 | 234 | /// Whether the type is a vector. |
| ... | ... | @@ -235,10 +242,13 @@ pub const DeclGen = struct { |
| 235 | 242 | class: Class, |
| 236 | 243 | }; |
| 237 | 244 | |
| 238 | /// Initialize the common resources of a DeclGen. Some fields are left uninitialized, only set when `gen` is called. | |
| 245 | /// Initialize the common resources of a DeclGen. Some fields are left uninitialized, | |
| 246 | /// only set when `gen` is called. | |
| 239 | 247 | pub fn init(spv: *SPIRVModule) DeclGen { |
| 240 | 248 | return .{ |
| 241 | 249 | .spv = spv, |
| 250 | .air = undefined, | |
| 251 | .liveness = undefined, | |
| 242 | 252 | .args = std.ArrayList(ResultId).init(spv.gpa), |
| 243 | 253 | .next_arg_index = undefined, |
| 244 | 254 | .inst_results = InstMap.init(spv.gpa), |
| ... | ... | @@ -251,10 +261,12 @@ pub const DeclGen = struct { |
| 251 | 261 | } |
| 252 | 262 | |
| 253 | 263 | /// Generate the code for `decl`. If a reportable error occured during code generation, |
| 254 | /// a message is returned by this function. Callee owns the memory. If this function returns such | |
| 255 | /// a reportable error, it is valid to be called again for a different decl. | |
| 256 | pub fn gen(self: *DeclGen, decl: *Decl) !?*Module.ErrorMsg { | |
| 264 | /// a message is returned by this function. Callee owns the memory. If this function | |
| 265 | /// returns such a reportable error, it is valid to be called again for a different decl. | |
| 266 | pub fn gen(self: *DeclGen, decl: *Decl, air: Air, liveness: Liveness) !?*Module.ErrorMsg { | |
| 257 | 267 | // Reset internal resources, we don't want to re-allocate these. |
| 268 | self.air = air; | |
| 269 | self.liveness = liveness; | |
| 258 | 270 | self.args.items.len = 0; |
| 259 | 271 | self.next_arg_index = 0; |
| 260 | 272 | self.inst_results.clearRetainingCapacity(); |
| ... | ... | @@ -280,19 +292,20 @@ pub const DeclGen = struct { |
| 280 | 292 | return self.spv.module.getTarget(); |
| 281 | 293 | } |
| 282 | 294 | |
| 283 | fn fail(self: *DeclGen, src: LazySrcLoc, comptime format: []const u8, args: anytype) Error { | |
| 295 | fn fail(self: *DeclGen, comptime format: []const u8, args: anytype) Error { | |
| 284 | 296 | @setCold(true); |
| 297 | const src: LazySrcLoc = .{ .node_offset = 0 }; | |
| 285 | 298 | const src_loc = src.toSrcLocWithDecl(self.decl); |
| 286 | 299 | self.error_msg = try Module.ErrorMsg.create(self.spv.module.gpa, src_loc, format, args); |
| 287 | 300 | return error.AnalysisFail; |
| 288 | 301 | } |
| 289 | 302 | |
| 290 | fn resolve(self: *DeclGen, inst: *Inst) !ResultId { | |
| 291 | if (inst.value()) |val| { | |
| 292 | return self.genConstant(inst.src, inst.ty, val); | |
| 303 | fn resolve(self: *DeclGen, inst: Air.Inst.Ref) !ResultId { | |
| 304 | if (self.air.value(inst)) |val| { | |
| 305 | return self.genConstant(self.air.typeOf(inst), val); | |
| 293 | 306 | } |
| 294 | ||
| 295 | return self.inst_results.get(inst).?; // Instruction does not dominate all uses! | |
| 307 | const index = Air.refToIndex(inst).?; | |
| 308 | return self.inst_results.get(index).?; // Assertion means instruction does not dominate usage. | |
| 296 | 309 | } |
| 297 | 310 | |
| 298 | 311 | fn beginSPIRVBlock(self: *DeclGen, label_id: ResultId) !void { |
| ... | ... | @@ -314,7 +327,7 @@ pub const DeclGen = struct { |
| 314 | 327 | const target = self.getTarget(); |
| 315 | 328 | |
| 316 | 329 | // The backend will never be asked to compiler a 0-bit integer, so we won't have to handle those in this function. |
| 317 | std.debug.assert(bits != 0); | |
| 330 | assert(bits != 0); | |
| 318 | 331 | |
| 319 | 332 | // 8, 16 and 64-bit integers require the Int8, Int16 and Inr64 capabilities respectively. |
| 320 | 333 | // 32-bit integers are always supported (see spec, 2.16.1, Data rules). |
| ... | ... | @@ -388,19 +401,19 @@ pub const DeclGen = struct { |
| 388 | 401 | .composite_integer }; |
| 389 | 402 | }, |
| 390 | 403 | // As of yet, there is no vector support in the self-hosted compiler. |
| 391 | .Vector => self.fail(.{ .node_offset = 0 }, "TODO: SPIR-V backend: implement arithmeticTypeInfo for Vector", .{}), | |
| 404 | .Vector => self.fail("TODO: SPIR-V backend: implement arithmeticTypeInfo for Vector", .{}), | |
| 392 | 405 | // TODO: For which types is this the case? |
| 393 | else => self.fail(.{ .node_offset = 0 }, "TODO: SPIR-V backend: implement arithmeticTypeInfo for {}", .{ty}), | |
| 406 | else => self.fail("TODO: SPIR-V backend: implement arithmeticTypeInfo for {}", .{ty}), | |
| 394 | 407 | }; |
| 395 | 408 | } |
| 396 | 409 | |
| 397 | 410 | /// Generate a constant representing `val`. |
| 398 | 411 | /// TODO: Deduplication? |
| 399 | fn genConstant(self: *DeclGen, src: LazySrcLoc, ty: Type, val: Value) Error!ResultId { | |
| 412 | fn genConstant(self: *DeclGen, ty: Type, val: Value) Error!ResultId { | |
| 400 | 413 | const target = self.getTarget(); |
| 401 | 414 | const code = &self.spv.binary.types_globals_constants; |
| 402 | 415 | const result_id = self.spv.allocResultId(); |
| 403 | const result_type_id = try self.genType(src, ty); | |
| 416 | const result_type_id = try self.genType(ty); | |
| 404 | 417 | |
| 405 | 418 | if (val.isUndef()) { |
| 406 | 419 | try writeInstruction(code, .OpUndef, &[_]Word{ result_type_id, result_id }); |
| ... | ... | @@ -412,13 +425,13 @@ pub const DeclGen = struct { |
| 412 | 425 | const int_info = ty.intInfo(target); |
| 413 | 426 | const backing_bits = self.backingIntBits(int_info.bits) orelse { |
| 414 | 427 | // Integers too big for any native type are represented as "composite integers": An array of largestSupportedIntBits. |
| 415 | return self.fail(src, "TODO: SPIR-V backend: implement composite int constants for {}", .{ty}); | |
| 428 | return self.fail("TODO: SPIR-V backend: implement composite int constants for {}", .{ty}); | |
| 416 | 429 | }; |
| 417 | 430 | |
| 418 | 431 | // We can just use toSignedInt/toUnsignedInt here as it returns u64 - a type large enough to hold any |
| 419 | 432 | // SPIR-V native type (up to i/u64 with Int64). If SPIR-V ever supports native ints of a larger size, this |
| 420 | 433 | // might need to be updated. |
| 421 | std.debug.assert(self.largestSupportedIntBits() <= std.meta.bitCount(u64)); | |
| 434 | assert(self.largestSupportedIntBits() <= std.meta.bitCount(u64)); | |
| 422 | 435 | var int_bits = if (ty.isSignedInt()) @bitCast(u64, val.toSignedInt()) else val.toUnsignedInt(); |
| 423 | 436 | |
| 424 | 437 | // Mask the low bits which make up the actual integer. This is to make sure that negative values |
| ... | ... | @@ -470,13 +483,13 @@ pub const DeclGen = struct { |
| 470 | 483 | } |
| 471 | 484 | }, |
| 472 | 485 | .Void => unreachable, |
| 473 | else => return self.fail(src, "TODO: SPIR-V backend: constant generation of type {}", .{ty}), | |
| 486 | else => return self.fail("TODO: SPIR-V backend: constant generation of type {}", .{ty}), | |
| 474 | 487 | } |
| 475 | 488 | |
| 476 | 489 | return result_id; |
| 477 | 490 | } |
| 478 | 491 | |
| 479 | fn genType(self: *DeclGen, src: LazySrcLoc, ty: Type) Error!ResultId { | |
| 492 | fn genType(self: *DeclGen, ty: Type) Error!ResultId { | |
| 480 | 493 | // We can't use getOrPut here so we can recursively generate types. |
| 481 | 494 | if (self.spv.types.get(ty)) |already_generated| { |
| 482 | 495 | return already_generated; |
| ... | ... | @@ -493,7 +506,7 @@ pub const DeclGen = struct { |
| 493 | 506 | const int_info = ty.intInfo(target); |
| 494 | 507 | const backing_bits = self.backingIntBits(int_info.bits) orelse { |
| 495 | 508 | // Integers too big for any native type are represented as "composite integers": An array of largestSupportedIntBits. |
| 496 | return self.fail(src, "TODO: SPIR-V backend: implement composite int {}", .{ty}); | |
| 509 | return self.fail("TODO: SPIR-V backend: implement composite int {}", .{ty}); | |
| 497 | 510 | }; |
| 498 | 511 | |
| 499 | 512 | // TODO: If backing_bits != int_info.bits, a duplicate type might be generated here. |
| ... | ... | @@ -519,7 +532,7 @@ pub const DeclGen = struct { |
| 519 | 532 | }; |
| 520 | 533 | |
| 521 | 534 | if (!supported) { |
| 522 | return self.fail(src, "Floating point width of {} bits is not supported for the current SPIR-V feature set", .{bits}); | |
| 535 | return self.fail("Floating point width of {} bits is not supported for the current SPIR-V feature set", .{bits}); | |
| 523 | 536 | } |
| 524 | 537 | |
| 525 | 538 | try writeInstruction(code, .OpTypeFloat, &[_]Word{ result_id, bits }); |
| ... | ... | @@ -527,19 +540,19 @@ pub const DeclGen = struct { |
| 527 | 540 | .Fn => { |
| 528 | 541 | // We only support zig-calling-convention functions, no varargs. |
| 529 | 542 | if (ty.fnCallingConvention() != .Unspecified) |
| 530 | return self.fail(src, "Unsupported calling convention for SPIR-V", .{}); | |
| 543 | return self.fail("Unsupported calling convention for SPIR-V", .{}); | |
| 531 | 544 | if (ty.fnIsVarArgs()) |
| 532 | return self.fail(src, "VarArgs unsupported for SPIR-V", .{}); | |
| 545 | return self.fail("VarArgs unsupported for SPIR-V", .{}); | |
| 533 | 546 | |
| 534 | 547 | // In order to avoid a temporary here, first generate all the required types and then simply look them up |
| 535 | 548 | // when generating the function type. |
| 536 | 549 | const params = ty.fnParamLen(); |
| 537 | 550 | var i: usize = 0; |
| 538 | 551 | while (i < params) : (i += 1) { |
| 539 | _ = try self.genType(src, ty.fnParamType(i)); | |
| 552 | _ = try self.genType(ty.fnParamType(i)); | |
| 540 | 553 | } |
| 541 | 554 | |
| 542 | const return_type_id = try self.genType(src, ty.fnReturnType()); | |
| 555 | const return_type_id = try self.genType(ty.fnReturnType()); | |
| 543 | 556 | |
| 544 | 557 | // result id + result type id + parameter type ids. |
| 545 | 558 | try writeOpcode(code, .OpTypeFunction, 2 + @intCast(u16, ty.fnParamLen())); |
| ... | ... | @@ -552,7 +565,7 @@ pub const DeclGen = struct { |
| 552 | 565 | } |
| 553 | 566 | }, |
| 554 | 567 | // When recursively generating a type, we cannot infer the pointer's storage class. See genPointerType. |
| 555 | .Pointer => return self.fail(src, "Cannot create pointer with unkown storage class", .{}), | |
| 568 | .Pointer => return self.fail("Cannot create pointer with unkown storage class", .{}), | |
| 556 | 569 | .Vector => { |
| 557 | 570 | // Although not 100% the same, Zig vectors map quite neatly to SPIR-V vectors (including many integer and float operations |
| 558 | 571 | // which work on them), so simply use those. |
| ... | ... | @@ -562,7 +575,7 @@ pub const DeclGen = struct { |
| 562 | 575 | // is adequate at all for this. |
| 563 | 576 | |
| 564 | 577 | // TODO: Vectors are not yet supported by the self-hosted compiler itself it seems. |
| 565 | return self.fail(src, "TODO: SPIR-V backend: implement type Vector", .{}); | |
| 578 | return self.fail("TODO: SPIR-V backend: implement type Vector", .{}); | |
| 566 | 579 | }, |
| 567 | 580 | .Null, |
| 568 | 581 | .Undefined, |
| ... | ... | @@ -574,7 +587,7 @@ pub const DeclGen = struct { |
| 574 | 587 | |
| 575 | 588 | .BoundFn => unreachable, // this type will be deleted from the language. |
| 576 | 589 | |
| 577 | else => |tag| return self.fail(src, "TODO: SPIR-V backend: implement type {}s", .{tag}), | |
| 590 | else => |tag| return self.fail("TODO: SPIR-V backend: implement type {}s", .{tag}), | |
| 578 | 591 | } |
| 579 | 592 | |
| 580 | 593 | try self.spv.types.putNoClobber(ty, result_id); |
| ... | ... | @@ -583,8 +596,8 @@ pub const DeclGen = struct { |
| 583 | 596 | |
| 584 | 597 | /// SPIR-V requires pointers to have a storage class (address space), and so we have a special function for that. |
| 585 | 598 | /// TODO: The result of this needs to be cached. |
| 586 | fn genPointerType(self: *DeclGen, src: LazySrcLoc, ty: Type, storage_class: spec.StorageClass) !ResultId { | |
| 587 | std.debug.assert(ty.zigTypeTag() == .Pointer); | |
| 599 | fn genPointerType(self: *DeclGen, ty: Type, storage_class: spec.StorageClass) !ResultId { | |
| 600 | assert(ty.zigTypeTag() == .Pointer); | |
| 588 | 601 | |
| 589 | 602 | const code = &self.spv.binary.types_globals_constants; |
| 590 | 603 | const result_id = self.spv.allocResultId(); |
| ... | ... | @@ -592,7 +605,7 @@ pub const DeclGen = struct { |
| 592 | 605 | // TODO: There are many constraints which are ignored for now: We may only create pointers to certain types, and to other types |
| 593 | 606 | // if more capabilities are enabled. For example, we may only create pointers to f16 if Float16Buffer is enabled. |
| 594 | 607 | // These also relates to the pointer's address space. |
| 595 | const child_id = try self.genType(src, ty.elemType()); | |
| 608 | const child_id = try self.genType(ty.elemType()); | |
| 596 | 609 | |
| 597 | 610 | try writeInstruction(code, .OpTypePointer, &[_]Word{ result_id, @enumToInt(storage_class), child_id }); |
| 598 | 611 | |
| ... | ... | @@ -603,9 +616,9 @@ pub const DeclGen = struct { |
| 603 | 616 | const decl = self.decl; |
| 604 | 617 | const result_id = decl.fn_link.spirv.id; |
| 605 | 618 | |
| 606 | if (decl.val.castTag(.function)) |func_payload| { | |
| 607 | std.debug.assert(decl.ty.zigTypeTag() == .Fn); | |
| 608 | const prototype_id = try self.genType(.{ .node_offset = 0 }, decl.ty); | |
| 619 | if (decl.val.castTag(.function)) |_| { | |
| 620 | assert(decl.ty.zigTypeTag() == .Fn); | |
| 621 | const prototype_id = try self.genType(decl.ty); | |
| 609 | 622 | try writeInstruction(&self.spv.binary.fn_decls, .OpFunction, &[_]Word{ |
| 610 | 623 | self.spv.types.get(decl.ty.fnReturnType()).?, // This type should be generated along with the prototype. |
| 611 | 624 | result_id, |
| ... | ... | @@ -632,189 +645,171 @@ pub const DeclGen = struct { |
| 632 | 645 | try writeInstruction(&self.spv.binary.fn_decls, .OpLabel, &[_]Word{root_block_id}); |
| 633 | 646 | self.current_block_label_id = root_block_id; |
| 634 | 647 | |
| 635 | try self.genBody(func_payload.data.body); | |
| 648 | const main_body = self.air.getMainBody(); | |
| 649 | try self.genBody(main_body); | |
| 636 | 650 | |
| 637 | 651 | // Append the actual code into the fn_decls section. |
| 638 | 652 | try self.spv.binary.fn_decls.appendSlice(self.code.items); |
| 639 | 653 | try writeInstruction(&self.spv.binary.fn_decls, .OpFunctionEnd, &[_]Word{}); |
| 640 | 654 | } else { |
| 641 | return self.fail(.{ .node_offset = 0 }, "TODO: SPIR-V backend: generate decl type {}", .{decl.ty.zigTypeTag()}); | |
| 655 | return self.fail("TODO: SPIR-V backend: generate decl type {}", .{decl.ty.zigTypeTag()}); | |
| 642 | 656 | } |
| 643 | 657 | } |
| 644 | 658 | |
| 645 | fn genBody(self: *DeclGen, body: ir.Body) Error!void { | |
| 646 | for (body.instructions) |inst| { | |
| 659 | fn genBody(self: *DeclGen, body: []const Air.Inst.Index) Error!void { | |
| 660 | for (body) |inst| { | |
| 647 | 661 | try self.genInst(inst); |
| 648 | 662 | } |
| 649 | 663 | } |
| 650 | 664 | |
| 651 | fn genInst(self: *DeclGen, inst: *Inst) !void { | |
| 652 | const result_id = switch (inst.tag) { | |
| 653 | .add, .addwrap => try self.genBinOp(inst.castTag(.add).?), | |
| 654 | .sub, .subwrap => try self.genBinOp(inst.castTag(.sub).?), | |
| 655 | .mul, .mulwrap => try self.genBinOp(inst.castTag(.mul).?), | |
| 656 | .div => try self.genBinOp(inst.castTag(.div).?), | |
| 657 | .bit_and => try self.genBinOp(inst.castTag(.bit_and).?), | |
| 658 | .bit_or => try self.genBinOp(inst.castTag(.bit_or).?), | |
| 659 | .xor => try self.genBinOp(inst.castTag(.xor).?), | |
| 660 | .cmp_eq => try self.genCmp(inst.castTag(.cmp_eq).?), | |
| 661 | .cmp_neq => try self.genCmp(inst.castTag(.cmp_neq).?), | |
| 662 | .cmp_gt => try self.genCmp(inst.castTag(.cmp_gt).?), | |
| 663 | .cmp_gte => try self.genCmp(inst.castTag(.cmp_gte).?), | |
| 664 | .cmp_lt => try self.genCmp(inst.castTag(.cmp_lt).?), | |
| 665 | .cmp_lte => try self.genCmp(inst.castTag(.cmp_lte).?), | |
| 666 | .bool_and => try self.genBinOp(inst.castTag(.bool_and).?), | |
| 667 | .bool_or => try self.genBinOp(inst.castTag(.bool_or).?), | |
| 668 | .not => try self.genUnOp(inst.castTag(.not).?), | |
| 669 | .alloc => try self.genAlloc(inst.castTag(.alloc).?), | |
| 670 | .arg => self.genArg(), | |
| 671 | .block => (try self.genBlock(inst.castTag(.block).?)) orelse return, | |
| 672 | .br => return try self.genBr(inst.castTag(.br).?), | |
| 673 | .br_void => return try self.genBrVoid(inst.castTag(.br_void).?), | |
| 674 | // TODO: Breakpoints won't be supported in SPIR-V, but the compiler seems to insert them | |
| 675 | // throughout the IR. | |
| 665 | fn genInst(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 666 | const air_tags = self.air.instructions.items(.tag); | |
| 667 | const result_id = switch (air_tags[inst]) { | |
| 668 | // zig fmt: off | |
| 669 | .add, .addwrap => try self.airArithOp(inst, .{.OpFAdd, .OpIAdd, .OpIAdd}), | |
| 670 | .sub, .subwrap => try self.airArithOp(inst, .{.OpFSub, .OpISub, .OpISub}), | |
| 671 | .mul, .mulwrap => try self.airArithOp(inst, .{.OpFMul, .OpIMul, .OpIMul}), | |
| 672 | .div => try self.airArithOp(inst, .{.OpFDiv, .OpSDiv, .OpUDiv}), | |
| 673 | ||
| 674 | .bit_and => try self.airBinOpSimple(inst, .OpBitwiseAnd), | |
| 675 | .bit_or => try self.airBinOpSimple(inst, .OpBitwiseOr), | |
| 676 | .xor => try self.airBinOpSimple(inst, .OpBitwiseXor), | |
| 677 | .bool_and => try self.airBinOpSimple(inst, .OpLogicalAnd), | |
| 678 | .bool_or => try self.airBinOpSimple(inst, .OpLogicalOr), | |
| 679 | ||
| 680 | .not => try self.airNot(inst), | |
| 681 | ||
| 682 | .cmp_eq => try self.airCmp(inst, .{.OpFOrdEqual, .OpLogicalEqual, .OpIEqual}), | |
| 683 | .cmp_neq => try self.airCmp(inst, .{.OpFOrdNotEqual, .OpLogicalNotEqual, .OpINotEqual}), | |
| 684 | .cmp_gt => try self.airCmp(inst, .{.OpFOrdGreaterThan, .OpSGreaterThan, .OpUGreaterThan}), | |
| 685 | .cmp_gte => try self.airCmp(inst, .{.OpFOrdGreaterThanEqual, .OpSGreaterThanEqual, .OpUGreaterThanEqual}), | |
| 686 | .cmp_lt => try self.airCmp(inst, .{.OpFOrdLessThan, .OpSLessThan, .OpULessThan}), | |
| 687 | .cmp_lte => try self.airCmp(inst, .{.OpFOrdLessThanEqual, .OpSLessThanEqual, .OpULessThanEqual}), | |
| 688 | ||
| 689 | .arg => self.airArg(), | |
| 690 | .alloc => try self.airAlloc(inst), | |
| 691 | .block => (try self.airBlock(inst)) orelse return, | |
| 692 | .load => try self.airLoad(inst), | |
| 693 | ||
| 694 | .br => return self.airBr(inst), | |
| 676 | 695 | .breakpoint => return, |
| 677 | .condbr => return try self.genCondBr(inst.castTag(.condbr).?), | |
| 678 | .constant => unreachable, | |
| 679 | .dbg_stmt => return try self.genDbgStmt(inst.castTag(.dbg_stmt).?), | |
| 680 | .load => try self.genLoad(inst.castTag(.load).?), | |
| 681 | .loop => return try self.genLoop(inst.castTag(.loop).?), | |
| 682 | .ret => return try self.genRet(inst.castTag(.ret).?), | |
| 683 | .retvoid => return try self.genRetVoid(), | |
| 684 | .store => return try self.genStore(inst.castTag(.store).?), | |
| 685 | .unreach => return try self.genUnreach(), | |
| 686 | else => return self.fail(inst.src, "TODO: SPIR-V backend: implement inst {s}", .{@tagName(inst.tag)}), | |
| 696 | .cond_br => return self.airCondBr(inst), | |
| 697 | .constant => unreachable, | |
| 698 | .dbg_stmt => return self.airDbgStmt(inst), | |
| 699 | .loop => return self.airLoop(inst), | |
| 700 | .ret => return self.airRet(inst), | |
| 701 | .store => return self.airStore(inst), | |
| 702 | .unreach => return self.airUnreach(), | |
| 703 | // zig fmt: on | |
| 704 | ||
| 705 | else => |tag| return self.fail("TODO: SPIR-V backend: implement AIR tag {s}", .{ | |
| 706 | @tagName(tag), | |
| 707 | }), | |
| 687 | 708 | }; |
| 688 | 709 | |
| 689 | 710 | try self.inst_results.putNoClobber(inst, result_id); |
| 690 | 711 | } |
| 691 | 712 | |
| 692 | fn genBinOp(self: *DeclGen, inst: *Inst.BinOp) !ResultId { | |
| 693 | // TODO: Will lhs and rhs have the same type? | |
| 694 | const lhs_id = try self.resolve(inst.lhs); | |
| 695 | const rhs_id = try self.resolve(inst.rhs); | |
| 713 | fn airBinOpSimple(self: *DeclGen, inst: Air.Inst.Index, opcode: Opcode) !ResultId { | |
| 714 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 715 | const lhs_id = try self.resolve(bin_op.lhs); | |
| 716 | const rhs_id = try self.resolve(bin_op.rhs); | |
| 717 | const result_id = self.spv.allocResultId(); | |
| 718 | const result_type_id = try self.genType(self.air.typeOfIndex(inst)); | |
| 719 | try writeInstruction(&self.code, opcode, &[_]Word{ | |
| 720 | result_type_id, result_id, lhs_id, rhs_id, | |
| 721 | }); | |
| 722 | return result_id; | |
| 723 | } | |
| 724 | ||
| 725 | fn airArithOp(self: *DeclGen, inst: Air.Inst.Index, ops: [3]Opcode) !ResultId { | |
| 726 | // LHS and RHS are guaranteed to have the same type, and AIR guarantees | |
| 727 | // the result to be the same as the LHS and RHS, which matches SPIR-V. | |
| 728 | const ty = self.air.typeOfIndex(inst); | |
| 729 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 730 | const lhs_id = try self.resolve(bin_op.lhs); | |
| 731 | const rhs_id = try self.resolve(bin_op.rhs); | |
| 696 | 732 | |
| 697 | 733 | const result_id = self.spv.allocResultId(); |
| 698 | const result_type_id = try self.genType(inst.base.src, inst.base.ty); | |
| 699 | ||
| 700 | // TODO: Is the result the same as the argument types? | |
| 701 | // This is supposed to be the case for SPIR-V. | |
| 702 | std.debug.assert(inst.rhs.ty.eql(inst.lhs.ty)); | |
| 703 | std.debug.assert(inst.base.ty.tag() == .bool or inst.base.ty.eql(inst.lhs.ty)); | |
| 704 | ||
| 705 | // Binary operations are generally applicable to both scalar and vector operations in SPIR-V, but int and float | |
| 706 | // versions of operations require different opcodes. | |
| 707 | // For operations which produce bools, the information of inst.base.ty is not useful, so just pick either operand | |
| 708 | // instead. | |
| 709 | const info = try self.arithmeticTypeInfo(inst.lhs.ty); | |
| 710 | ||
| 711 | if (info.class == .composite_integer) { | |
| 712 | return self.fail(inst.base.src, "TODO: SPIR-V backend: binary operations for composite integers", .{}); | |
| 713 | } else if (info.class == .strange_integer) { | |
| 714 | return self.fail(inst.base.src, "TODO: SPIR-V backend: binary operations for strange integers", .{}); | |
| 715 | } | |
| 734 | const result_type_id = try self.genType(ty); | |
| 735 | ||
| 736 | assert(self.air.typeOf(bin_op.lhs).eql(ty)); | |
| 737 | assert(self.air.typeOf(bin_op.rhs).eql(ty)); | |
| 738 | ||
| 739 | // Binary operations are generally applicable to both scalar and vector operations | |
| 740 | // in SPIR-V, but int and float versions of operations require different opcodes. | |
| 741 | const info = try self.arithmeticTypeInfo(ty); | |
| 716 | 742 | |
| 717 | const is_float = info.class == .float; | |
| 718 | const is_signed = info.signedness == .signed; | |
| 719 | // **Note**: All these operations must be valid for vectors as well! | |
| 720 | const opcode = switch (inst.base.tag) { | |
| 721 | // The regular integer operations are all defined for wrapping. Since theyre only relevant for integers, | |
| 722 | // we can just switch on both cases here. | |
| 723 | .add, .addwrap => if (is_float) Opcode.OpFAdd else Opcode.OpIAdd, | |
| 724 | .sub, .subwrap => if (is_float) Opcode.OpFSub else Opcode.OpISub, | |
| 725 | .mul, .mulwrap => if (is_float) Opcode.OpFMul else Opcode.OpIMul, | |
| 726 | // TODO: Trap if divisor is 0? | |
| 727 | // TODO: Figure out of OpSDiv for unsigned/OpUDiv for signed does anything useful. | |
| 728 | // => Those are probably for divTrunc and divFloor, though the compiler does not yet generate those. | |
| 729 | // => TODO: Figure out how those work on the SPIR-V side. | |
| 730 | // => TODO: Test these. | |
| 731 | .div => if (is_float) Opcode.OpFDiv else if (is_signed) Opcode.OpSDiv else Opcode.OpUDiv, | |
| 732 | // Only integer versions for these. | |
| 733 | .bit_and => Opcode.OpBitwiseAnd, | |
| 734 | .bit_or => Opcode.OpBitwiseOr, | |
| 735 | .xor => Opcode.OpBitwiseXor, | |
| 736 | // Bool -> bool operations. | |
| 737 | .bool_and => Opcode.OpLogicalAnd, | |
| 738 | .bool_or => Opcode.OpLogicalOr, | |
| 743 | const opcode_index: usize = switch (info.class) { | |
| 744 | .composite_integer => { | |
| 745 | return self.fail("TODO: SPIR-V backend: binary operations for composite integers", .{}); | |
| 746 | }, | |
| 747 | .strange_integer => { | |
| 748 | return self.fail("TODO: SPIR-V backend: binary operations for strange integers", .{}); | |
| 749 | }, | |
| 750 | .integer => switch (info.signedness) { | |
| 751 | .signed => @as(usize, 1), | |
| 752 | .unsigned => @as(usize, 2), | |
| 753 | }, | |
| 754 | .float => 0, | |
| 739 | 755 | else => unreachable, |
| 740 | 756 | }; |
| 741 | ||
| 757 | const opcode = ops[opcode_index]; | |
| 742 | 758 | try writeInstruction(&self.code, opcode, &[_]Word{ result_type_id, result_id, lhs_id, rhs_id }); |
| 743 | 759 | |
| 744 | 760 | // TODO: Trap on overflow? Probably going to be annoying. |
| 745 | 761 | // TODO: Look into SPV_KHR_no_integer_wrap_decoration which provides NoSignedWrap/NoUnsignedWrap. |
| 746 | 762 | |
| 747 | if (info.class != .strange_integer) | |
| 748 | return result_id; | |
| 749 | ||
| 750 | return self.fail(inst.base.src, "TODO: SPIR-V backend: strange integer operation mask", .{}); | |
| 763 | return result_id; | |
| 751 | 764 | } |
| 752 | 765 | |
| 753 | fn genCmp(self: *DeclGen, inst: *Inst.BinOp) !ResultId { | |
| 754 | const lhs_id = try self.resolve(inst.lhs); | |
| 755 | const rhs_id = try self.resolve(inst.rhs); | |
| 756 | ||
| 766 | fn airCmp(self: *DeclGen, inst: Air.Inst.Index, ops: [3]Opcode) !ResultId { | |
| 767 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 768 | const lhs_id = try self.resolve(bin_op.lhs); | |
| 769 | const rhs_id = try self.resolve(bin_op.rhs); | |
| 757 | 770 | const result_id = self.spv.allocResultId(); |
| 758 | const result_type_id = try self.genType(inst.base.src, inst.base.ty); | |
| 759 | ||
| 760 | // All of these operations should be 2 equal types -> bool | |
| 761 | std.debug.assert(inst.rhs.ty.eql(inst.lhs.ty)); | |
| 762 | std.debug.assert(inst.base.ty.tag() == .bool); | |
| 763 | ||
| 764 | // Comparisons are generally applicable to both scalar and vector operations in SPIR-V, but int and float | |
| 765 | // versions of operations require different opcodes. | |
| 766 | // Since inst.base.ty is always bool and so not very useful, and because both arguments must be the same, just get the info | |
| 767 | // from either of the operands. | |
| 768 | const info = try self.arithmeticTypeInfo(inst.lhs.ty); | |
| 769 | ||
| 770 | if (info.class == .composite_integer) { | |
| 771 | return self.fail(inst.base.src, "TODO: SPIR-V backend: binary operations for composite integers", .{}); | |
| 772 | } else if (info.class == .strange_integer) { | |
| 773 | return self.fail(inst.base.src, "TODO: SPIR-V backend: comparison for strange integers", .{}); | |
| 774 | } | |
| 771 | const result_type_id = try self.genType(Type.initTag(.bool)); | |
| 772 | const op_ty = self.air.typeOf(bin_op.lhs); | |
| 773 | assert(op_ty.eql(self.air.typeOf(bin_op.rhs))); | |
| 775 | 774 | |
| 776 | const is_bool = info.class == .bool; | |
| 777 | const is_float = info.class == .float; | |
| 778 | const is_signed = info.signedness == .signed; | |
| 779 | ||
| 780 | // **Note**: All these operations must be valid for vectors as well! | |
| 781 | // For floating points, we generally want ordered operations (which return false if either operand is nan). | |
| 782 | const opcode = switch (inst.base.tag) { | |
| 783 | .cmp_eq => if (is_float) Opcode.OpFOrdEqual else if (is_bool) Opcode.OpLogicalEqual else Opcode.OpIEqual, | |
| 784 | .cmp_neq => if (is_float) Opcode.OpFOrdNotEqual else if (is_bool) Opcode.OpLogicalNotEqual else Opcode.OpINotEqual, | |
| 785 | // TODO: Verify that these OpFOrd type operations produce the right value. | |
| 786 | // TODO: Is there a more fundamental difference between OpU and OpS operations here than just the type? | |
| 787 | .cmp_gt => if (is_float) Opcode.OpFOrdGreaterThan else if (is_signed) Opcode.OpSGreaterThan else Opcode.OpUGreaterThan, | |
| 788 | .cmp_gte => if (is_float) Opcode.OpFOrdGreaterThanEqual else if (is_signed) Opcode.OpSGreaterThanEqual else Opcode.OpUGreaterThanEqual, | |
| 789 | .cmp_lt => if (is_float) Opcode.OpFOrdLessThan else if (is_signed) Opcode.OpSLessThan else Opcode.OpULessThan, | |
| 790 | .cmp_lte => if (is_float) Opcode.OpFOrdLessThanEqual else if (is_signed) Opcode.OpSLessThanEqual else Opcode.OpULessThanEqual, | |
| 791 | else => unreachable, | |
| 775 | // Comparisons are generally applicable to both scalar and vector operations in SPIR-V, | |
| 776 | // but int and float versions of operations require different opcodes. | |
| 777 | const info = try self.arithmeticTypeInfo(op_ty); | |
| 778 | ||
| 779 | const opcode_index: usize = switch (info.class) { | |
| 780 | .composite_integer => { | |
| 781 | return self.fail("TODO: SPIR-V backend: binary operations for composite integers", .{}); | |
| 782 | }, | |
| 783 | .strange_integer => { | |
| 784 | return self.fail("TODO: SPIR-V backend: comparison for strange integers", .{}); | |
| 785 | }, | |
| 786 | .float => 0, | |
| 787 | .bool => 1, | |
| 788 | .integer => switch (info.signedness) { | |
| 789 | .signed => @as(usize, 1), | |
| 790 | .unsigned => @as(usize, 2), | |
| 791 | }, | |
| 792 | 792 | }; |
| 793 | const opcode = ops[opcode_index]; | |
| 793 | 794 | |
| 794 | 795 | try writeInstruction(&self.code, opcode, &[_]Word{ result_type_id, result_id, lhs_id, rhs_id }); |
| 795 | 796 | return result_id; |
| 796 | 797 | } |
| 797 | 798 | |
| 798 | fn genUnOp(self: *DeclGen, inst: *Inst.UnOp) !ResultId { | |
| 799 | const operand_id = try self.resolve(inst.operand); | |
| 800 | ||
| 799 | fn airNot(self: *DeclGen, inst: Air.Inst.Index) !ResultId { | |
| 800 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 801 | const operand_id = try self.resolve(ty_op.operand); | |
| 801 | 802 | const result_id = self.spv.allocResultId(); |
| 802 | const result_type_id = try self.genType(inst.base.src, inst.base.ty); | |
| 803 | ||
| 804 | const opcode = switch (inst.base.tag) { | |
| 805 | // Bool -> bool | |
| 806 | .not => Opcode.OpLogicalNot, | |
| 807 | else => unreachable, | |
| 808 | }; | |
| 809 | ||
| 803 | const result_type_id = try self.genType(Type.initTag(.bool)); | |
| 804 | const opcode: Opcode = .OpLogicalNot; | |
| 810 | 805 | try writeInstruction(&self.code, opcode, &[_]Word{ result_type_id, result_id, operand_id }); |
| 811 | ||
| 812 | 806 | return result_id; |
| 813 | 807 | } |
| 814 | 808 | |
| 815 | fn genAlloc(self: *DeclGen, inst: *Inst.NoOp) !ResultId { | |
| 809 | fn airAlloc(self: *DeclGen, inst: Air.Inst.Index) !ResultId { | |
| 810 | const ty = self.air.typeOfIndex(inst); | |
| 816 | 811 | const storage_class = spec.StorageClass.Function; |
| 817 | const result_type_id = try self.genPointerType(inst.base.src, inst.base.ty, storage_class); | |
| 812 | const result_type_id = try self.genPointerType(ty, storage_class); | |
| 818 | 813 | const result_id = self.spv.allocResultId(); |
| 819 | 814 | |
| 820 | 815 | // Rather than generating into code here, we're just going to generate directly into the fn_decls section so that |
| ... | ... | @@ -824,12 +819,12 @@ pub const DeclGen = struct { |
| 824 | 819 | return result_id; |
| 825 | 820 | } |
| 826 | 821 | |
| 827 | fn genArg(self: *DeclGen) ResultId { | |
| 822 | fn airArg(self: *DeclGen) ResultId { | |
| 828 | 823 | defer self.next_arg_index += 1; |
| 829 | 824 | return self.args.items[self.next_arg_index]; |
| 830 | 825 | } |
| 831 | 826 | |
| 832 | fn genBlock(self: *DeclGen, inst: *Inst.Block) !?ResultId { | |
| 827 | fn airBlock(self: *DeclGen, inst: Air.Inst.Index) !?ResultId { | |
| 833 | 828 | // In IR, a block doesn't really define an entry point like a block, but more like a scope that breaks can jump out of and |
| 834 | 829 | // "return" a value from. This cannot be directly modelled in SPIR-V, so in a block instruction, we're going to split up |
| 835 | 830 | // the current block by first generating the code of the block, then a label, and then generate the rest of the current |
| ... | ... | @@ -849,11 +844,16 @@ pub const DeclGen = struct { |
| 849 | 844 | incoming_blocks.deinit(self.spv.gpa); |
| 850 | 845 | } |
| 851 | 846 | |
| 852 | try self.genBody(inst.body); | |
| 847 | const ty = self.air.typeOfIndex(inst); | |
| 848 | const inst_datas = self.air.instructions.items(.data); | |
| 849 | const extra = self.air.extraData(Air.Block, inst_datas[inst].ty_pl.payload); | |
| 850 | const body = self.air.extra[extra.end..][0..extra.data.body_len]; | |
| 851 | ||
| 852 | try self.genBody(body); | |
| 853 | 853 | try self.beginSPIRVBlock(label_id); |
| 854 | 854 | |
| 855 | 855 | // If this block didn't produce a value, simply return here. |
| 856 | if (!inst.base.ty.hasCodeGenBits()) | |
| 856 | if (!ty.hasCodeGenBits()) | |
| 857 | 857 | return null; |
| 858 | 858 | |
| 859 | 859 | // Combine the result from the blocks using the Phi instruction. |
| ... | ... | @@ -863,7 +863,7 @@ pub const DeclGen = struct { |
| 863 | 863 | // TODO: OpPhi is limited in the types that it may produce, such as pointers. Figure out which other types |
| 864 | 864 | // are not allowed to be created from a phi node, and throw an error for those. For now, genType already throws |
| 865 | 865 | // an error for pointers. |
| 866 | const result_type_id = try self.genType(inst.base.src, inst.base.ty); | |
| 866 | const result_type_id = try self.genType(ty); | |
| 867 | 867 | _ = result_type_id; |
| 868 | 868 | |
| 869 | 869 | try writeOpcode(&self.code, .OpPhi, 2 + @intCast(u16, incoming_blocks.items.len * 2)); // result type + result + variable/parent... |
| ... | ... | @@ -875,30 +875,26 @@ pub const DeclGen = struct { |
| 875 | 875 | return result_id; |
| 876 | 876 | } |
| 877 | 877 | |
| 878 | fn genBr(self: *DeclGen, inst: *Inst.Br) !void { | |
| 879 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 880 | const target = self.blocks.get(inst.block).?; | |
| 878 | fn airBr(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 879 | const br = self.air.instructions.items(.data)[inst].br; | |
| 880 | const block = self.blocks.get(br.block_inst).?; | |
| 881 | const operand_ty = self.air.typeOf(br.operand); | |
| 881 | 882 | |
| 882 | // TODO: For some reason, br is emitted with void parameters. | |
| 883 | if (inst.operand.ty.hasCodeGenBits()) { | |
| 884 | const operand_id = try self.resolve(inst.operand); | |
| 883 | if (operand_ty.hasCodeGenBits()) { | |
| 884 | const operand_id = try self.resolve(br.operand); | |
| 885 | 885 | // current_block_label_id should not be undefined here, lest there is a br or br_void in the function's body. |
| 886 | try target.incoming_blocks.append(self.spv.gpa, .{ .src_label_id = self.current_block_label_id, .break_value_id = operand_id }); | |
| 886 | try block.incoming_blocks.append(self.spv.gpa, .{ .src_label_id = self.current_block_label_id, .break_value_id = operand_id }); | |
| 887 | 887 | } |
| 888 | 888 | |
| 889 | try writeInstruction(&self.code, .OpBranch, &[_]Word{target.label_id}); | |
| 890 | } | |
| 891 | ||
| 892 | fn genBrVoid(self: *DeclGen, inst: *Inst.BrVoid) !void { | |
| 893 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 894 | const target = self.blocks.get(inst.block).?; | |
| 895 | // Don't need to add this to the incoming block list, as there is no value to insert in the phi node anyway. | |
| 896 | try writeInstruction(&self.code, .OpBranch, &[_]Word{target.label_id}); | |
| 889 | try writeInstruction(&self.code, .OpBranch, &[_]Word{block.label_id}); | |
| 897 | 890 | } |
| 898 | 891 | |
| 899 | fn genCondBr(self: *DeclGen, inst: *Inst.CondBr) !void { | |
| 900 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 901 | const condition_id = try self.resolve(inst.condition); | |
| 892 | fn airCondBr(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 893 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 894 | const cond_br = self.air.extraData(Air.CondBr, pl_op.payload); | |
| 895 | const then_body = self.air.extra[cond_br.end..][0..cond_br.data.then_body_len]; | |
| 896 | const else_body = self.air.extra[cond_br.end + then_body.len ..][0..cond_br.data.else_body_len]; | |
| 897 | const condition_id = try self.resolve(pl_op.operand); | |
| 902 | 898 | |
| 903 | 899 | // These will always generate a new SPIR-V block, since they are ir.Body and not ir.Block. |
| 904 | 900 | const then_label_id = self.spv.allocResultId(); |
| ... | ... | @@ -914,23 +910,26 @@ pub const DeclGen = struct { |
| 914 | 910 | }); |
| 915 | 911 | |
| 916 | 912 | try self.beginSPIRVBlock(then_label_id); |
| 917 | try self.genBody(inst.then_body); | |
| 913 | try self.genBody(then_body); | |
| 918 | 914 | try self.beginSPIRVBlock(else_label_id); |
| 919 | try self.genBody(inst.else_body); | |
| 915 | try self.genBody(else_body); | |
| 920 | 916 | } |
| 921 | 917 | |
| 922 | fn genDbgStmt(self: *DeclGen, inst: *Inst.DbgStmt) !void { | |
| 918 | fn airDbgStmt(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 919 | const dbg_stmt = self.air.instructions.items(.data)[inst].dbg_stmt; | |
| 923 | 920 | const src_fname_id = try self.spv.resolveSourceFileName(self.decl); |
| 924 | try writeInstruction(&self.code, .OpLine, &[_]Word{ src_fname_id, inst.line, inst.column }); | |
| 921 | try writeInstruction(&self.code, .OpLine, &[_]Word{ src_fname_id, dbg_stmt.line, dbg_stmt.column }); | |
| 925 | 922 | } |
| 926 | 923 | |
| 927 | fn genLoad(self: *DeclGen, inst: *Inst.UnOp) !ResultId { | |
| 928 | const operand_id = try self.resolve(inst.operand); | |
| 924 | fn airLoad(self: *DeclGen, inst: Air.Inst.Index) !ResultId { | |
| 925 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 926 | const operand_id = try self.resolve(ty_op.operand); | |
| 927 | const ty = self.air.typeOfIndex(inst); | |
| 929 | 928 | |
| 930 | const result_type_id = try self.genType(inst.base.src, inst.base.ty); | |
| 929 | const result_type_id = try self.genType(ty); | |
| 931 | 930 | const result_id = self.spv.allocResultId(); |
| 932 | 931 | |
| 933 | const operands = if (inst.base.ty.isVolatilePtr()) | |
| 932 | const operands = if (ty.isVolatilePtr()) | |
| 934 | 933 | &[_]Word{ result_type_id, result_id, operand_id, @bitCast(u32, spec.MemoryAccess{ .Volatile = true }) } |
| 935 | 934 | else |
| 936 | 935 | &[_]Word{ result_type_id, result_id, operand_id }; |
| ... | ... | @@ -940,8 +939,10 @@ pub const DeclGen = struct { |
| 940 | 939 | return result_id; |
| 941 | 940 | } |
| 942 | 941 | |
| 943 | fn genLoop(self: *DeclGen, inst: *Inst.Loop) !void { | |
| 944 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 942 | fn airLoop(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 943 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 944 | const loop = self.air.extraData(Air.Block, ty_pl.payload); | |
| 945 | const body = self.air.extra[loop.end..][0..loop.data.body_len]; | |
| 945 | 946 | const loop_label_id = self.spv.allocResultId(); |
| 946 | 947 | |
| 947 | 948 | // Jump to the loop entry point |
| ... | ... | @@ -950,27 +951,29 @@ pub const DeclGen = struct { |
| 950 | 951 | // TODO: Look into OpLoopMerge. |
| 951 | 952 | |
| 952 | 953 | try self.beginSPIRVBlock(loop_label_id); |
| 953 | try self.genBody(inst.body); | |
| 954 | try self.genBody(body); | |
| 954 | 955 | |
| 955 | 956 | try writeInstruction(&self.code, .OpBranch, &[_]Word{loop_label_id}); |
| 956 | 957 | } |
| 957 | 958 | |
| 958 | fn genRet(self: *DeclGen, inst: *Inst.UnOp) !void { | |
| 959 | const operand_id = try self.resolve(inst.operand); | |
| 960 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 961 | try writeInstruction(&self.code, .OpReturnValue, &[_]Word{operand_id}); | |
| 962 | } | |
| 963 | ||
| 964 | fn genRetVoid(self: *DeclGen) !void { | |
| 965 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 966 | try writeInstruction(&self.code, .OpReturn, &[_]Word{}); | |
| 959 | fn airRet(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 960 | const operand = self.air.instructions.items(.data)[inst].un_op; | |
| 961 | const operand_ty = self.air.typeOf(operand); | |
| 962 | if (operand_ty.hasCodeGenBits()) { | |
| 963 | const operand_id = try self.resolve(operand); | |
| 964 | try writeInstruction(&self.code, .OpReturnValue, &[_]Word{operand_id}); | |
| 965 | } else { | |
| 966 | try writeInstruction(&self.code, .OpReturn, &[_]Word{}); | |
| 967 | } | |
| 967 | 968 | } |
| 968 | 969 | |
| 969 | fn genStore(self: *DeclGen, inst: *Inst.BinOp) !void { | |
| 970 | const dst_ptr_id = try self.resolve(inst.lhs); | |
| 971 | const src_val_id = try self.resolve(inst.rhs); | |
| 970 | fn airStore(self: *DeclGen, inst: Air.Inst.Index) !void { | |
| 971 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 972 | const dst_ptr_id = try self.resolve(bin_op.lhs); | |
| 973 | const src_val_id = try self.resolve(bin_op.rhs); | |
| 974 | const lhs_ty = self.air.typeOf(bin_op.lhs); | |
| 972 | 975 | |
| 973 | const operands = if (inst.lhs.ty.isVolatilePtr()) | |
| 976 | const operands = if (lhs_ty.isVolatilePtr()) | |
| 974 | 977 | &[_]Word{ dst_ptr_id, src_val_id, @bitCast(u32, spec.MemoryAccess{ .Volatile = true }) } |
| 975 | 978 | else |
| 976 | 979 | &[_]Word{ dst_ptr_id, src_val_id }; |
| ... | ... | @@ -978,8 +981,7 @@ pub const DeclGen = struct { |
| 978 | 981 | try writeInstruction(&self.code, .OpStore, operands); |
| 979 | 982 | } |
| 980 | 983 | |
| 981 | fn genUnreach(self: *DeclGen) !void { | |
| 982 | // TODO: This instruction needs to be the last in a block. Is that guaranteed? | |
| 984 | fn airUnreach(self: *DeclGen) !void { | |
| 983 | 985 | try writeInstruction(&self.code, .OpUnreachable, &[_]Word{}); |
| 984 | 986 | } |
| 985 | 987 | }; |
src/codegen/wasm.zig+293-242
| ... | ... | @@ -9,14 +9,14 @@ const wasm = std.wasm; |
| 9 | 9 | |
| 10 | 10 | const Module = @import("../Module.zig"); |
| 11 | 11 | const Decl = Module.Decl; |
| 12 | const ir = @import("../air.zig"); | |
| 13 | const Inst = ir.Inst; | |
| 14 | 12 | const Type = @import("../type.zig").Type; |
| 15 | 13 | const Value = @import("../value.zig").Value; |
| 16 | 14 | const Compilation = @import("../Compilation.zig"); |
| 17 | 15 | const LazySrcLoc = Module.LazySrcLoc; |
| 18 | 16 | const link = @import("../link.zig"); |
| 19 | 17 | const TypedValue = @import("../TypedValue.zig"); |
| 18 | const Air = @import("../Air.zig"); | |
| 19 | const Liveness = @import("../Liveness.zig"); | |
| 20 | 20 | |
| 21 | 21 | /// Wasm Value, created when generating an instruction |
| 22 | 22 | const WValue = union(enum) { |
| ... | ... | @@ -24,8 +24,8 @@ const WValue = union(enum) { |
| 24 | 24 | none: void, |
| 25 | 25 | /// Index of the local variable |
| 26 | 26 | local: u32, |
| 27 | /// Instruction holding a constant `Value` | |
| 28 | constant: *Inst, | |
| 27 | /// Holds a memoized typed value | |
| 28 | constant: TypedValue, | |
| 29 | 29 | /// Offset position in the list of bytecode instructions |
| 30 | 30 | code_offset: usize, |
| 31 | 31 | /// Used for variables that create multiple locals on the stack when allocated |
| ... | ... | @@ -483,8 +483,8 @@ pub const Result = union(enum) { |
| 483 | 483 | externally_managed: []const u8, |
| 484 | 484 | }; |
| 485 | 485 | |
| 486 | /// Hashmap to store generated `WValue` for each `Inst` | |
| 487 | pub const ValueTable = std.AutoHashMapUnmanaged(*Inst, WValue); | |
| 486 | /// Hashmap to store generated `WValue` for each `Air.Inst.Ref` | |
| 487 | pub const ValueTable = std.AutoHashMapUnmanaged(Air.Inst.Index, WValue); | |
| 488 | 488 | |
| 489 | 489 | /// Code represents the `Code` section of wasm that |
| 490 | 490 | /// belongs to a function |
| ... | ... | @@ -492,11 +492,13 @@ pub const Context = struct { |
| 492 | 492 | /// Reference to the function declaration the code |
| 493 | 493 | /// section belongs to |
| 494 | 494 | decl: *Decl, |
| 495 | air: Air, | |
| 496 | liveness: Liveness, | |
| 495 | 497 | gpa: *mem.Allocator, |
| 496 | /// Table to save `WValue`'s generated by an `Inst` | |
| 498 | /// Table to save `WValue`'s generated by an `Air.Inst` | |
| 497 | 499 | values: ValueTable, |
| 498 | /// Mapping from *Inst.Block to block ids | |
| 499 | blocks: std.AutoArrayHashMapUnmanaged(*Inst.Block, u32) = .{}, | |
| 500 | /// Mapping from Air.Inst.Index to block ids | |
| 501 | blocks: std.AutoArrayHashMapUnmanaged(Air.Inst.Index, u32) = .{}, | |
| 500 | 502 | /// `bytes` contains the wasm bytecode belonging to the 'code' section. |
| 501 | 503 | code: ArrayList(u8), |
| 502 | 504 | /// Contains the generated function type bytecode for the current function |
| ... | ... | @@ -536,7 +538,8 @@ pub const Context = struct { |
| 536 | 538 | } |
| 537 | 539 | |
| 538 | 540 | /// Sets `err_msg` on `Context` and returns `error.CodegemFail` which is caught in link/Wasm.zig |
| 539 | fn fail(self: *Context, src: LazySrcLoc, comptime fmt: []const u8, args: anytype) InnerError { | |
| 541 | fn fail(self: *Context, comptime fmt: []const u8, args: anytype) InnerError { | |
| 542 | const src: LazySrcLoc = .{ .node_offset = 0 }; | |
| 540 | 543 | const src_loc = src.toSrcLocWithDecl(self.decl); |
| 541 | 544 | self.err_msg = try Module.ErrorMsg.create(self.gpa, src_loc, fmt, args); |
| 542 | 545 | return error.CodegenFail; |
| ... | ... | @@ -544,59 +547,66 @@ pub const Context = struct { |
| 544 | 547 | |
| 545 | 548 | /// Resolves the `WValue` for the given instruction `inst` |
| 546 | 549 | /// When the given instruction has a `Value`, it returns a constant instead |
| 547 | fn resolveInst(self: Context, inst: *Inst) WValue { | |
| 548 | if (!inst.ty.hasCodeGenBits()) return .none; | |
| 550 | fn resolveInst(self: Context, ref: Air.Inst.Ref) WValue { | |
| 551 | const inst_index = Air.refToIndex(ref) orelse { | |
| 552 | const tv = Air.Inst.Ref.typed_value_map[@enumToInt(ref)]; | |
| 553 | if (!tv.ty.hasCodeGenBits()) { | |
| 554 | return WValue.none; | |
| 555 | } | |
| 556 | return WValue{ .constant = tv }; | |
| 557 | }; | |
| 558 | ||
| 559 | const inst_type = self.air.typeOfIndex(inst_index); | |
| 560 | if (!inst_type.hasCodeGenBits()) return .none; | |
| 549 | 561 | |
| 550 | if (inst.value()) |_| { | |
| 551 | return WValue{ .constant = inst }; | |
| 562 | if (self.air.instructions.items(.tag)[inst_index] == .constant) { | |
| 563 | const ty_pl = self.air.instructions.items(.data)[inst_index].ty_pl; | |
| 564 | return WValue{ .constant = .{ .ty = inst_type, .val = self.air.values[ty_pl.payload] } }; | |
| 552 | 565 | } |
| 553 | 566 | |
| 554 | return self.values.get(inst).?; // Instruction does not dominate all uses! | |
| 567 | return self.values.get(inst_index).?; // Instruction does not dominate all uses! | |
| 555 | 568 | } |
| 556 | 569 | |
| 557 | 570 | /// Using a given `Type`, returns the corresponding wasm Valtype |
| 558 | fn typeToValtype(self: *Context, src: LazySrcLoc, ty: Type) InnerError!wasm.Valtype { | |
| 571 | fn typeToValtype(self: *Context, ty: Type) InnerError!wasm.Valtype { | |
| 559 | 572 | return switch (ty.zigTypeTag()) { |
| 560 | 573 | .Float => blk: { |
| 561 | 574 | const bits = ty.floatBits(self.target); |
| 562 | 575 | if (bits == 16 or bits == 32) break :blk wasm.Valtype.f32; |
| 563 | 576 | if (bits == 64) break :blk wasm.Valtype.f64; |
| 564 | return self.fail(src, "Float bit size not supported by wasm: '{d}'", .{bits}); | |
| 577 | return self.fail("Float bit size not supported by wasm: '{d}'", .{bits}); | |
| 565 | 578 | }, |
| 566 | 579 | .Int => blk: { |
| 567 | 580 | const info = ty.intInfo(self.target); |
| 568 | 581 | if (info.bits <= 32) break :blk wasm.Valtype.i32; |
| 569 | 582 | if (info.bits > 32 and info.bits <= 64) break :blk wasm.Valtype.i64; |
| 570 | return self.fail(src, "Integer bit size not supported by wasm: '{d}'", .{info.bits}); | |
| 583 | return self.fail("Integer bit size not supported by wasm: '{d}'", .{info.bits}); | |
| 571 | 584 | }, |
| 572 | 585 | .Enum => switch (ty.tag()) { |
| 573 | 586 | .enum_simple => wasm.Valtype.i32, |
| 574 | else => self.typeToValtype( | |
| 575 | src, | |
| 576 | ty.cast(Type.Payload.EnumFull).?.data.tag_ty, | |
| 577 | ), | |
| 587 | else => self.typeToValtype(ty.cast(Type.Payload.EnumFull).?.data.tag_ty), | |
| 578 | 588 | }, |
| 579 | 589 | .Bool, |
| 580 | 590 | .Pointer, |
| 581 | 591 | .ErrorSet, |
| 582 | 592 | => wasm.Valtype.i32, |
| 583 | 593 | .Struct, .ErrorUnion => unreachable, // Multi typed, must be handled individually. |
| 584 | else => self.fail(src, "TODO - Wasm valtype for type '{s}'", .{ty.zigTypeTag()}), | |
| 594 | else => self.fail("TODO - Wasm valtype for type '{s}'", .{ty.zigTypeTag()}), | |
| 585 | 595 | }; |
| 586 | 596 | } |
| 587 | 597 | |
| 588 | 598 | /// Using a given `Type`, returns the byte representation of its wasm value type |
| 589 | fn genValtype(self: *Context, src: LazySrcLoc, ty: Type) InnerError!u8 { | |
| 590 | return wasm.valtype(try self.typeToValtype(src, ty)); | |
| 599 | fn genValtype(self: *Context, ty: Type) InnerError!u8 { | |
| 600 | return wasm.valtype(try self.typeToValtype(ty)); | |
| 591 | 601 | } |
| 592 | 602 | |
| 593 | 603 | /// Using a given `Type`, returns the corresponding wasm value type |
| 594 | 604 | /// Differently from `genValtype` this also allows `void` to create a block |
| 595 | 605 | /// with no return type |
| 596 | fn genBlockType(self: *Context, src: LazySrcLoc, ty: Type) InnerError!u8 { | |
| 606 | fn genBlockType(self: *Context, ty: Type) InnerError!u8 { | |
| 597 | 607 | return switch (ty.tag()) { |
| 598 | 608 | .void, .noreturn => wasm.block_empty, |
| 599 | else => self.genValtype(src, ty), | |
| 609 | else => self.genValtype(ty), | |
| 600 | 610 | }; |
| 601 | 611 | } |
| 602 | 612 | |
| ... | ... | @@ -610,7 +620,7 @@ pub const Context = struct { |
| 610 | 620 | try writer.writeByte(wasm.opcode(.local_get)); |
| 611 | 621 | try leb.writeULEB128(writer, idx); |
| 612 | 622 | }, |
| 613 | .constant => |inst| try self.emitConstant(inst.src, inst.value().?, inst.ty), // creates a new constant onto the stack | |
| 623 | .constant => |tv| try self.emitConstant(tv.val, tv.ty), // Creates a new constant on the stack | |
| 614 | 624 | } |
| 615 | 625 | } |
| 616 | 626 | |
| ... | ... | @@ -626,10 +636,7 @@ pub const Context = struct { |
| 626 | 636 | const fields_len = @intCast(u32, struct_data.fields.count()); |
| 627 | 637 | try self.locals.ensureCapacity(self.gpa, self.locals.items.len + fields_len); |
| 628 | 638 | for (struct_data.fields.values()) |*value| { |
| 629 | const val_type = try self.genValtype( | |
| 630 | .{ .node_offset = struct_data.node_offset }, | |
| 631 | value.ty, | |
| 632 | ); | |
| 639 | const val_type = try self.genValtype(value.ty); | |
| 633 | 640 | self.locals.appendAssumeCapacity(val_type); |
| 634 | 641 | self.local_index += 1; |
| 635 | 642 | } |
| ... | ... | @@ -640,7 +647,7 @@ pub const Context = struct { |
| 640 | 647 | }, |
| 641 | 648 | .ErrorUnion => { |
| 642 | 649 | const payload_type = ty.errorUnionChild(); |
| 643 | const val_type = try self.genValtype(.{ .node_offset = 0 }, payload_type); | |
| 650 | const val_type = try self.genValtype(payload_type); | |
| 644 | 651 | |
| 645 | 652 | // we emit the error value as the first local, and the payload as the following. |
| 646 | 653 | // The first local is also used to find the index of the error and payload. |
| ... | ... | @@ -657,7 +664,7 @@ pub const Context = struct { |
| 657 | 664 | } }; |
| 658 | 665 | }, |
| 659 | 666 | else => { |
| 660 | const valtype = try self.genValtype(.{ .node_offset = 0 }, ty); | |
| 667 | const valtype = try self.genValtype(ty); | |
| 661 | 668 | try self.locals.append(self.gpa, valtype); |
| 662 | 669 | self.local_index += 1; |
| 663 | 670 | return WValue{ .local = initial_index }; |
| ... | ... | @@ -680,7 +687,7 @@ pub const Context = struct { |
| 680 | 687 | ty.fnParamTypes(params); |
| 681 | 688 | for (params) |param_type| { |
| 682 | 689 | // Can we maybe get the source index of each param? |
| 683 | const val_type = try self.genValtype(.{ .node_offset = 0 }, param_type); | |
| 690 | const val_type = try self.genValtype(param_type); | |
| 684 | 691 | try writer.writeByte(val_type); |
| 685 | 692 | } |
| 686 | 693 | } |
| ... | ... | @@ -689,13 +696,10 @@ pub const Context = struct { |
| 689 | 696 | const return_type = ty.fnReturnType(); |
| 690 | 697 | switch (return_type.zigTypeTag()) { |
| 691 | 698 | .Void, .NoReturn => try leb.writeULEB128(writer, @as(u32, 0)), |
| 692 | .Struct => return self.fail(.{ .node_offset = 0 }, "TODO: Implement struct as return type for wasm", .{}), | |
| 693 | .Optional => return self.fail(.{ .node_offset = 0 }, "TODO: Implement optionals as return type for wasm", .{}), | |
| 699 | .Struct => return self.fail("TODO: Implement struct as return type for wasm", .{}), | |
| 700 | .Optional => return self.fail("TODO: Implement optionals as return type for wasm", .{}), | |
| 694 | 701 | .ErrorUnion => { |
| 695 | const val_type = try self.genValtype( | |
| 696 | .{ .node_offset = 0 }, | |
| 697 | return_type.errorUnionChild(), | |
| 698 | ); | |
| 702 | const val_type = try self.genValtype(return_type.errorUnionChild()); | |
| 699 | 703 | |
| 700 | 704 | // write down the amount of return values |
| 701 | 705 | try leb.writeULEB128(writer, @as(u32, 2)); |
| ... | ... | @@ -705,58 +709,57 @@ pub const Context = struct { |
| 705 | 709 | else => { |
| 706 | 710 | try leb.writeULEB128(writer, @as(u32, 1)); |
| 707 | 711 | // Can we maybe get the source index of the return type? |
| 708 | const val_type = try self.genValtype(.{ .node_offset = 0 }, return_type); | |
| 712 | const val_type = try self.genValtype(return_type); | |
| 709 | 713 | try writer.writeByte(val_type); |
| 710 | 714 | }, |
| 711 | 715 | } |
| 712 | 716 | } |
| 713 | 717 | |
| 714 | /// Generates the wasm bytecode for the function declaration belonging to `Context` | |
| 715 | pub fn gen(self: *Context, typed_value: TypedValue) InnerError!Result { | |
| 716 | switch (typed_value.ty.zigTypeTag()) { | |
| 717 | .Fn => { | |
| 718 | try self.genFunctype(); | |
| 718 | pub fn genFunc(self: *Context) InnerError!Result { | |
| 719 | try self.genFunctype(); | |
| 720 | // TODO: check for and handle death of instructions | |
| 719 | 721 | |
| 720 | // Write instructions | |
| 721 | // TODO: check for and handle death of instructions | |
| 722 | const mod_fn = blk: { | |
| 723 | if (typed_value.val.castTag(.function)) |func| break :blk func.data; | |
| 724 | if (typed_value.val.castTag(.extern_fn)) |_| return Result.appended; // don't need code body for extern functions | |
| 725 | unreachable; | |
| 726 | }; | |
| 727 | ||
| 728 | // Reserve space to write the size after generating the code as well as space for locals count | |
| 729 | try self.code.resize(10); | |
| 730 | ||
| 731 | try self.genBody(mod_fn.body); | |
| 732 | ||
| 733 | // finally, write our local types at the 'offset' position | |
| 734 | { | |
| 735 | leb.writeUnsignedFixed(5, self.code.items[5..10], @intCast(u32, self.locals.items.len)); | |
| 736 | ||
| 737 | // offset into 'code' section where we will put our locals types | |
| 738 | var local_offset: usize = 10; | |
| 739 | ||
| 740 | // emit the actual locals amount | |
| 741 | for (self.locals.items) |local| { | |
| 742 | var buf: [6]u8 = undefined; | |
| 743 | leb.writeUnsignedFixed(5, buf[0..5], @as(u32, 1)); | |
| 744 | buf[5] = local; | |
| 745 | try self.code.insertSlice(local_offset, &buf); | |
| 746 | local_offset += 6; | |
| 747 | } | |
| 748 | } | |
| 722 | // Reserve space to write the size after generating the code as well as space for locals count | |
| 723 | try self.code.resize(10); | |
| 724 | ||
| 725 | try self.genBody(self.air.getMainBody()); | |
| 749 | 726 | |
| 750 | const writer = self.code.writer(); | |
| 751 | try writer.writeByte(wasm.opcode(.end)); | |
| 727 | // finally, write our local types at the 'offset' position | |
| 728 | { | |
| 729 | leb.writeUnsignedFixed(5, self.code.items[5..10], @intCast(u32, self.locals.items.len)); | |
| 752 | 730 | |
| 753 | // Fill in the size of the generated code to the reserved space at the | |
| 754 | // beginning of the buffer. | |
| 755 | const size = self.code.items.len - 5 + self.decl.fn_link.wasm.idx_refs.items.len * 5; | |
| 756 | leb.writeUnsignedFixed(5, self.code.items[0..5], @intCast(u32, size)); | |
| 731 | // offset into 'code' section where we will put our locals types | |
| 732 | var local_offset: usize = 10; | |
| 757 | 733 | |
| 758 | // codegen data has been appended to `code` | |
| 759 | return Result.appended; | |
| 734 | // emit the actual locals amount | |
| 735 | for (self.locals.items) |local| { | |
| 736 | var buf: [6]u8 = undefined; | |
| 737 | leb.writeUnsignedFixed(5, buf[0..5], @as(u32, 1)); | |
| 738 | buf[5] = local; | |
| 739 | try self.code.insertSlice(local_offset, &buf); | |
| 740 | local_offset += 6; | |
| 741 | } | |
| 742 | } | |
| 743 | ||
| 744 | const writer = self.code.writer(); | |
| 745 | try writer.writeByte(wasm.opcode(.end)); | |
| 746 | ||
| 747 | // Fill in the size of the generated code to the reserved space at the | |
| 748 | // beginning of the buffer. | |
| 749 | const size = self.code.items.len - 5 + self.decl.fn_link.wasm.idx_refs.items.len * 5; | |
| 750 | leb.writeUnsignedFixed(5, self.code.items[0..5], @intCast(u32, size)); | |
| 751 | ||
| 752 | // codegen data has been appended to `code` | |
| 753 | return Result.appended; | |
| 754 | } | |
| 755 | ||
| 756 | /// Generates the wasm bytecode for the declaration belonging to `Context` | |
| 757 | pub fn gen(self: *Context, typed_value: TypedValue) InnerError!Result { | |
| 758 | switch (typed_value.ty.zigTypeTag()) { | |
| 759 | .Fn => { | |
| 760 | try self.genFunctype(); | |
| 761 | if (typed_value.val.castTag(.extern_fn)) |_| return Result.appended; // don't need code body for extern functions | |
| 762 | return self.fail("TODO implement wasm codegen for function pointers", .{}); | |
| 760 | 763 | }, |
| 761 | 764 | .Array => { |
| 762 | 765 | if (typed_value.val.castTag(.bytes)) |payload| { |
| ... | ... | @@ -775,7 +778,7 @@ pub const Context = struct { |
| 775 | 778 | } |
| 776 | 779 | } |
| 777 | 780 | return Result{ .externally_managed = payload.data }; |
| 778 | } else return self.fail(.{ .node_offset = 0 }, "TODO implement gen for more kinds of arrays", .{}); | |
| 781 | } else return self.fail("TODO implement gen for more kinds of arrays", .{}); | |
| 779 | 782 | }, |
| 780 | 783 | .Int => { |
| 781 | 784 | const info = typed_value.ty.intInfo(self.target); |
| ... | ... | @@ -784,85 +787,91 @@ pub const Context = struct { |
| 784 | 787 | try self.code.append(@intCast(u8, int_byte)); |
| 785 | 788 | return Result.appended; |
| 786 | 789 | } |
| 787 | return self.fail(.{ .node_offset = 0 }, "TODO: Implement codegen for int type: '{}'", .{typed_value.ty}); | |
| 790 | return self.fail("TODO: Implement codegen for int type: '{}'", .{typed_value.ty}); | |
| 788 | 791 | }, |
| 789 | else => |tag| return self.fail(.{ .node_offset = 0 }, "TODO: Implement zig type codegen for type: '{s}'", .{tag}), | |
| 792 | else => |tag| return self.fail("TODO: Implement zig type codegen for type: '{s}'", .{tag}), | |
| 790 | 793 | } |
| 791 | 794 | } |
| 792 | 795 | |
| 793 | fn genInst(self: *Context, inst: *Inst) InnerError!WValue { | |
| 794 | return switch (inst.tag) { | |
| 795 | .add => self.genBinOp(inst.castTag(.add).?, .add), | |
| 796 | .alloc => self.genAlloc(inst.castTag(.alloc).?), | |
| 797 | .arg => self.genArg(inst.castTag(.arg).?), | |
| 798 | .bit_and => self.genBinOp(inst.castTag(.bit_and).?, .@"and"), | |
| 799 | .bitcast => self.genBitcast(inst.castTag(.bitcast).?), | |
| 800 | .bit_or => self.genBinOp(inst.castTag(.bit_or).?, .@"or"), | |
| 801 | .block => self.genBlock(inst.castTag(.block).?), | |
| 802 | .bool_and => self.genBinOp(inst.castTag(.bool_and).?, .@"and"), | |
| 803 | .bool_or => self.genBinOp(inst.castTag(.bool_or).?, .@"or"), | |
| 804 | .breakpoint => self.genBreakpoint(inst.castTag(.breakpoint).?), | |
| 805 | .br => self.genBr(inst.castTag(.br).?), | |
| 806 | .call => self.genCall(inst.castTag(.call).?), | |
| 807 | .cmp_eq => self.genCmp(inst.castTag(.cmp_eq).?, .eq), | |
| 808 | .cmp_gte => self.genCmp(inst.castTag(.cmp_gte).?, .gte), | |
| 809 | .cmp_gt => self.genCmp(inst.castTag(.cmp_gt).?, .gt), | |
| 810 | .cmp_lte => self.genCmp(inst.castTag(.cmp_lte).?, .lte), | |
| 811 | .cmp_lt => self.genCmp(inst.castTag(.cmp_lt).?, .lt), | |
| 812 | .cmp_neq => self.genCmp(inst.castTag(.cmp_neq).?, .neq), | |
| 813 | .condbr => self.genCondBr(inst.castTag(.condbr).?), | |
| 796 | fn genInst(self: *Context, inst: Air.Inst.Index) !WValue { | |
| 797 | const air_tags = self.air.instructions.items(.tag); | |
| 798 | return switch (air_tags[inst]) { | |
| 799 | .add => self.airBinOp(inst, .add), | |
| 800 | .sub => self.airBinOp(inst, .sub), | |
| 801 | .mul => self.airBinOp(inst, .mul), | |
| 802 | .div => self.airBinOp(inst, .div), | |
| 803 | .bit_and => self.airBinOp(inst, .@"and"), | |
| 804 | .bit_or => self.airBinOp(inst, .@"or"), | |
| 805 | .bool_and => self.airBinOp(inst, .@"and"), | |
| 806 | .bool_or => self.airBinOp(inst, .@"or"), | |
| 807 | .xor => self.airBinOp(inst, .xor), | |
| 808 | ||
| 809 | .cmp_eq => self.airCmp(inst, .eq), | |
| 810 | .cmp_gte => self.airCmp(inst, .gte), | |
| 811 | .cmp_gt => self.airCmp(inst, .gt), | |
| 812 | .cmp_lte => self.airCmp(inst, .lte), | |
| 813 | .cmp_lt => self.airCmp(inst, .lt), | |
| 814 | .cmp_neq => self.airCmp(inst, .neq), | |
| 815 | ||
| 816 | .alloc => self.airAlloc(inst), | |
| 817 | .arg => self.airArg(inst), | |
| 818 | .bitcast => self.airBitcast(inst), | |
| 819 | .block => self.airBlock(inst), | |
| 820 | .breakpoint => self.airBreakpoint(inst), | |
| 821 | .br => self.airBr(inst), | |
| 822 | .call => self.airCall(inst), | |
| 823 | .cond_br => self.airCondBr(inst), | |
| 814 | 824 | .constant => unreachable, |
| 815 | 825 | .dbg_stmt => WValue.none, |
| 816 | .div => self.genBinOp(inst.castTag(.div).?, .div), | |
| 817 | .is_err => self.genIsErr(inst.castTag(.is_err).?, .i32_ne), | |
| 818 | .is_non_err => self.genIsErr(inst.castTag(.is_non_err).?, .i32_eq), | |
| 819 | .load => self.genLoad(inst.castTag(.load).?), | |
| 820 | .loop => self.genLoop(inst.castTag(.loop).?), | |
| 821 | .mul => self.genBinOp(inst.castTag(.mul).?, .mul), | |
| 822 | .not => self.genNot(inst.castTag(.not).?), | |
| 823 | .ret => self.genRet(inst.castTag(.ret).?), | |
| 824 | .retvoid => WValue.none, | |
| 825 | .store => self.genStore(inst.castTag(.store).?), | |
| 826 | .struct_field_ptr => self.genStructFieldPtr(inst.castTag(.struct_field_ptr).?), | |
| 827 | .sub => self.genBinOp(inst.castTag(.sub).?, .sub), | |
| 828 | .switchbr => self.genSwitchBr(inst.castTag(.switchbr).?), | |
| 829 | .unreach => self.genUnreachable(inst.castTag(.unreach).?), | |
| 830 | .unwrap_errunion_payload => self.genUnwrapErrUnionPayload(inst.castTag(.unwrap_errunion_payload).?), | |
| 831 | .wrap_errunion_payload => self.genWrapErrUnionPayload(inst.castTag(.wrap_errunion_payload).?), | |
| 832 | .xor => self.genBinOp(inst.castTag(.xor).?, .xor), | |
| 833 | else => self.fail(.{ .node_offset = 0 }, "TODO: Implement wasm inst: {s}", .{inst.tag}), | |
| 826 | .is_err => self.airIsErr(inst, .i32_ne), | |
| 827 | .is_non_err => self.airIsErr(inst, .i32_eq), | |
| 828 | .load => self.airLoad(inst), | |
| 829 | .loop => self.airLoop(inst), | |
| 830 | .not => self.airNot(inst), | |
| 831 | .ret => self.airRet(inst), | |
| 832 | .store => self.airStore(inst), | |
| 833 | .struct_field_ptr => self.airStructFieldPtr(inst), | |
| 834 | .switch_br => self.airSwitchBr(inst), | |
| 835 | .unreach => self.airUnreachable(inst), | |
| 836 | .unwrap_errunion_payload => self.airUnwrapErrUnionPayload(inst), | |
| 837 | .wrap_errunion_payload => self.airWrapErrUnionPayload(inst), | |
| 838 | else => |tag| self.fail("TODO: Implement wasm inst: {s}", .{@tagName(tag)}), | |
| 834 | 839 | }; |
| 835 | 840 | } |
| 836 | 841 | |
| 837 | fn genBody(self: *Context, body: ir.Body) InnerError!void { | |
| 838 | for (body.instructions) |inst| { | |
| 842 | fn genBody(self: *Context, body: []const Air.Inst.Index) InnerError!void { | |
| 843 | for (body) |inst| { | |
| 839 | 844 | const result = try self.genInst(inst); |
| 840 | 845 | try self.values.putNoClobber(self.gpa, inst, result); |
| 841 | 846 | } |
| 842 | 847 | } |
| 843 | 848 | |
| 844 | fn genRet(self: *Context, inst: *Inst.UnOp) InnerError!WValue { | |
| 845 | // TODO: Implement tail calls | |
| 846 | const operand = self.resolveInst(inst.operand); | |
| 849 | fn airRet(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 850 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 851 | const operand = self.resolveInst(un_op); | |
| 847 | 852 | try self.emitWValue(operand); |
| 848 | 853 | try self.code.append(wasm.opcode(.@"return")); |
| 849 | 854 | return .none; |
| 850 | 855 | } |
| 851 | 856 | |
| 852 | fn genCall(self: *Context, inst: *Inst.Call) InnerError!WValue { | |
| 853 | const func_val = inst.func.value().?; | |
| 857 | fn airCall(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 858 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 859 | const extra = self.air.extraData(Air.Call, pl_op.payload); | |
| 860 | const args = self.air.extra[extra.end..][0..extra.data.args_len]; | |
| 854 | 861 | |
| 855 | 862 | const target: *Decl = blk: { |
| 863 | const func_val = self.air.value(pl_op.operand).?; | |
| 864 | ||
| 856 | 865 | if (func_val.castTag(.function)) |func| { |
| 857 | 866 | break :blk func.data.owner_decl; |
| 858 | 867 | } else if (func_val.castTag(.extern_fn)) |ext_fn| { |
| 859 | 868 | break :blk ext_fn.data; |
| 860 | 869 | } |
| 861 | return self.fail(inst.base.src, "Expected a function, but instead found type '{s}'", .{func_val.tag()}); | |
| 870 | return self.fail("Expected a function, but instead found type '{s}'", .{func_val.tag()}); | |
| 862 | 871 | }; |
| 863 | 872 | |
| 864 | for (inst.args) |arg| { | |
| 865 | const arg_val = self.resolveInst(arg); | |
| 873 | for (args) |arg| { | |
| 874 | const arg_val = self.resolveInst(@intToEnum(Air.Inst.Ref, arg)); | |
| 866 | 875 | try self.emitWValue(arg_val); |
| 867 | 876 | } |
| 868 | 877 | |
| ... | ... | @@ -878,16 +887,17 @@ pub const Context = struct { |
| 878 | 887 | return .none; |
| 879 | 888 | } |
| 880 | 889 | |
| 881 | fn genAlloc(self: *Context, inst: *Inst.NoOp) InnerError!WValue { | |
| 882 | const elem_type = inst.base.ty.elemType(); | |
| 890 | fn airAlloc(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 891 | const elem_type = self.air.typeOfIndex(inst).elemType(); | |
| 883 | 892 | return self.allocLocal(elem_type); |
| 884 | 893 | } |
| 885 | 894 | |
| 886 | fn genStore(self: *Context, inst: *Inst.BinOp) InnerError!WValue { | |
| 895 | fn airStore(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 896 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 887 | 897 | const writer = self.code.writer(); |
| 888 | 898 | |
| 889 | const lhs = self.resolveInst(inst.lhs); | |
| 890 | const rhs = self.resolveInst(inst.rhs); | |
| 899 | const lhs = self.resolveInst(bin_op.lhs); | |
| 900 | const rhs = self.resolveInst(bin_op.rhs); | |
| 891 | 901 | |
| 892 | 902 | switch (lhs) { |
| 893 | 903 | .multi_value => |multi_value| switch (rhs) { |
| ... | ... | @@ -895,7 +905,7 @@ pub const Context = struct { |
| 895 | 905 | // we simply assign the local_index to the rhs one. |
| 896 | 906 | // This allows us to update struct fields without having to individually |
| 897 | 907 | // set each local as each field's index will be calculated off the struct's base index |
| 898 | .multi_value => self.values.put(self.gpa, inst.lhs, rhs) catch unreachable, // Instruction does not dominate all uses! | |
| 908 | .multi_value => self.values.put(self.gpa, Air.refToIndex(bin_op.lhs).?, rhs) catch unreachable, // Instruction does not dominate all uses! | |
| 899 | 909 | .constant, .none => { |
| 900 | 910 | // emit all values onto the stack if constant |
| 901 | 911 | try self.emitWValue(rhs); |
| ... | ... | @@ -921,20 +931,22 @@ pub const Context = struct { |
| 921 | 931 | return .none; |
| 922 | 932 | } |
| 923 | 933 | |
| 924 | fn genLoad(self: *Context, inst: *Inst.UnOp) InnerError!WValue { | |
| 925 | return self.resolveInst(inst.operand); | |
| 934 | fn airLoad(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 935 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 936 | return self.resolveInst(ty_op.operand); | |
| 926 | 937 | } |
| 927 | 938 | |
| 928 | fn genArg(self: *Context, inst: *Inst.Arg) InnerError!WValue { | |
| 939 | fn airArg(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 929 | 940 | _ = inst; |
| 930 | 941 | // arguments share the index with locals |
| 931 | 942 | defer self.local_index += 1; |
| 932 | 943 | return WValue{ .local = self.local_index }; |
| 933 | 944 | } |
| 934 | 945 | |
| 935 | fn genBinOp(self: *Context, inst: *Inst.BinOp, op: Op) InnerError!WValue { | |
| 936 | const lhs = self.resolveInst(inst.lhs); | |
| 937 | const rhs = self.resolveInst(inst.rhs); | |
| 946 | fn airBinOp(self: *Context, inst: Air.Inst.Index, op: Op) InnerError!WValue { | |
| 947 | const bin_op = self.air.instructions.items(.data)[inst].bin_op; | |
| 948 | const lhs = self.resolveInst(bin_op.lhs); | |
| 949 | const rhs = self.resolveInst(bin_op.rhs); | |
| 938 | 950 | |
| 939 | 951 | // it's possible for both lhs and/or rhs to return an offset as well, |
| 940 | 952 | // in which case we return the first offset occurance we find. |
| ... | ... | @@ -947,23 +959,24 @@ pub const Context = struct { |
| 947 | 959 | try self.emitWValue(lhs); |
| 948 | 960 | try self.emitWValue(rhs); |
| 949 | 961 | |
| 962 | const bin_ty = self.air.typeOf(bin_op.lhs); | |
| 950 | 963 | const opcode: wasm.Opcode = buildOpcode(.{ |
| 951 | 964 | .op = op, |
| 952 | .valtype1 = try self.typeToValtype(inst.base.src, inst.base.ty), | |
| 953 | .signedness = if (inst.base.ty.isSignedInt()) .signed else .unsigned, | |
| 965 | .valtype1 = try self.typeToValtype(bin_ty), | |
| 966 | .signedness = if (bin_ty.isSignedInt()) .signed else .unsigned, | |
| 954 | 967 | }); |
| 955 | 968 | try self.code.append(wasm.opcode(opcode)); |
| 956 | 969 | return WValue{ .code_offset = offset }; |
| 957 | 970 | } |
| 958 | 971 | |
| 959 | fn emitConstant(self: *Context, src: LazySrcLoc, value: Value, ty: Type) InnerError!void { | |
| 972 | fn emitConstant(self: *Context, value: Value, ty: Type) InnerError!void { | |
| 960 | 973 | const writer = self.code.writer(); |
| 961 | 974 | switch (ty.zigTypeTag()) { |
| 962 | 975 | .Int => { |
| 963 | 976 | // write opcode |
| 964 | 977 | const opcode: wasm.Opcode = buildOpcode(.{ |
| 965 | 978 | .op = .@"const", |
| 966 | .valtype1 = try self.typeToValtype(src, ty), | |
| 979 | .valtype1 = try self.typeToValtype(ty), | |
| 967 | 980 | }); |
| 968 | 981 | try writer.writeByte(wasm.opcode(opcode)); |
| 969 | 982 | // write constant |
| ... | ... | @@ -982,14 +995,14 @@ pub const Context = struct { |
| 982 | 995 | // write opcode |
| 983 | 996 | const opcode: wasm.Opcode = buildOpcode(.{ |
| 984 | 997 | .op = .@"const", |
| 985 | .valtype1 = try self.typeToValtype(src, ty), | |
| 998 | .valtype1 = try self.typeToValtype(ty), | |
| 986 | 999 | }); |
| 987 | 1000 | try writer.writeByte(wasm.opcode(opcode)); |
| 988 | 1001 | // write constant |
| 989 | 1002 | switch (ty.floatBits(self.target)) { |
| 990 | 1003 | 0...32 => try writer.writeIntLittle(u32, @bitCast(u32, value.toFloat(f32))), |
| 991 | 1004 | 64 => try writer.writeIntLittle(u64, @bitCast(u64, value.toFloat(f64))), |
| 992 | else => |bits| return self.fail(src, "Wasm TODO: emitConstant for float with {d} bits", .{bits}), | |
| 1005 | else => |bits| return self.fail("Wasm TODO: emitConstant for float with {d} bits", .{bits}), | |
| 993 | 1006 | } |
| 994 | 1007 | }, |
| 995 | 1008 | .Pointer => { |
| ... | ... | @@ -1006,7 +1019,7 @@ pub const Context = struct { |
| 1006 | 1019 | try writer.writeByte(wasm.opcode(.i32_load)); |
| 1007 | 1020 | try leb.writeULEB128(writer, @as(u32, 0)); |
| 1008 | 1021 | try leb.writeULEB128(writer, @as(u32, 0)); |
| 1009 | } else return self.fail(src, "Wasm TODO: emitConstant for other const pointer tag {s}", .{value.tag()}); | |
| 1022 | } else return self.fail("Wasm TODO: emitConstant for other const pointer tag {s}", .{value.tag()}); | |
| 1010 | 1023 | }, |
| 1011 | 1024 | .Void => {}, |
| 1012 | 1025 | .Enum => { |
| ... | ... | @@ -1020,7 +1033,7 @@ pub const Context = struct { |
| 1020 | 1033 | const enum_full = ty.cast(Type.Payload.EnumFull).?.data; |
| 1021 | 1034 | if (enum_full.values.count() != 0) { |
| 1022 | 1035 | const tag_val = enum_full.values.keys()[field_index.data]; |
| 1023 | try self.emitConstant(src, tag_val, enum_full.tag_ty); | |
| 1036 | try self.emitConstant(tag_val, enum_full.tag_ty); | |
| 1024 | 1037 | } else { |
| 1025 | 1038 | try writer.writeByte(wasm.opcode(.i32_const)); |
| 1026 | 1039 | try leb.writeULEB128(writer, field_index.data); |
| ... | ... | @@ -1031,7 +1044,7 @@ pub const Context = struct { |
| 1031 | 1044 | } else { |
| 1032 | 1045 | var int_tag_buffer: Type.Payload.Bits = undefined; |
| 1033 | 1046 | const int_tag_ty = ty.intTagType(&int_tag_buffer); |
| 1034 | try self.emitConstant(src, value, int_tag_ty); | |
| 1047 | try self.emitConstant(value, int_tag_ty); | |
| 1035 | 1048 | } |
| 1036 | 1049 | }, |
| 1037 | 1050 | .ErrorSet => { |
| ... | ... | @@ -1045,12 +1058,12 @@ pub const Context = struct { |
| 1045 | 1058 | const payload_type = ty.errorUnionChild(); |
| 1046 | 1059 | if (value.getError()) |_| { |
| 1047 | 1060 | // write the error value |
| 1048 | try self.emitConstant(src, data, error_type); | |
| 1061 | try self.emitConstant(data, error_type); | |
| 1049 | 1062 | |
| 1050 | 1063 | // no payload, so write a '0' const |
| 1051 | 1064 | const opcode: wasm.Opcode = buildOpcode(.{ |
| 1052 | 1065 | .op = .@"const", |
| 1053 | .valtype1 = try self.typeToValtype(src, payload_type), | |
| 1066 | .valtype1 = try self.typeToValtype(payload_type), | |
| 1054 | 1067 | }); |
| 1055 | 1068 | try writer.writeByte(wasm.opcode(opcode)); |
| 1056 | 1069 | try leb.writeULEB128(writer, @as(u32, 0)); |
| ... | ... | @@ -1059,21 +1072,24 @@ pub const Context = struct { |
| 1059 | 1072 | try writer.writeByte(wasm.opcode(.i32_const)); |
| 1060 | 1073 | try leb.writeULEB128(writer, @as(u32, 0)); |
| 1061 | 1074 | // after the error code, we emit the payload |
| 1062 | try self.emitConstant(src, data, payload_type); | |
| 1075 | try self.emitConstant(data, payload_type); | |
| 1063 | 1076 | } |
| 1064 | 1077 | }, |
| 1065 | else => |zig_type| return self.fail(src, "Wasm TODO: emitConstant for zigTypeTag {s}", .{zig_type}), | |
| 1078 | else => |zig_type| return self.fail("Wasm TODO: emitConstant for zigTypeTag {s}", .{zig_type}), | |
| 1066 | 1079 | } |
| 1067 | 1080 | } |
| 1068 | 1081 | |
| 1069 | fn genBlock(self: *Context, block: *Inst.Block) InnerError!WValue { | |
| 1070 | const block_ty = try self.genBlockType(block.base.src, block.base.ty); | |
| 1082 | fn airBlock(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1083 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 1084 | const block_ty = try self.genBlockType(self.air.getRefType(ty_pl.ty)); | |
| 1085 | const extra = self.air.extraData(Air.Block, ty_pl.payload); | |
| 1086 | const body = self.air.extra[extra.end..][0..extra.data.body_len]; | |
| 1071 | 1087 | |
| 1072 | 1088 | try self.startBlock(.block, block_ty, null); |
| 1073 | 1089 | // Here we set the current block idx, so breaks know the depth to jump |
| 1074 | 1090 | // to when breaking out. |
| 1075 | try self.blocks.putNoClobber(self.gpa, block, self.block_depth); | |
| 1076 | try self.genBody(block.body); | |
| 1091 | try self.blocks.putNoClobber(self.gpa, inst, self.block_depth); | |
| 1092 | try self.genBody(body); | |
| 1077 | 1093 | try self.endBlock(); |
| 1078 | 1094 | |
| 1079 | 1095 | return .none; |
| ... | ... | @@ -1097,11 +1113,15 @@ pub const Context = struct { |
| 1097 | 1113 | self.block_depth -= 1; |
| 1098 | 1114 | } |
| 1099 | 1115 | |
| 1100 | fn genLoop(self: *Context, loop: *Inst.Loop) InnerError!WValue { | |
| 1101 | const loop_ty = try self.genBlockType(loop.base.src, loop.base.ty); | |
| 1116 | fn airLoop(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1117 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 1118 | const loop = self.air.extraData(Air.Block, ty_pl.payload); | |
| 1119 | const body = self.air.extra[loop.end..][0..loop.data.body_len]; | |
| 1102 | 1120 | |
| 1103 | try self.startBlock(.loop, loop_ty, null); | |
| 1104 | try self.genBody(loop.body); | |
| 1121 | // result type of loop is always 'noreturn', meaning we can always | |
| 1122 | // emit the wasm type 'block_empty'. | |
| 1123 | try self.startBlock(.loop, wasm.block_empty, null); | |
| 1124 | try self.genBody(body); | |
| 1105 | 1125 | |
| 1106 | 1126 | // breaking to the index of a loop block will continue the loop instead |
| 1107 | 1127 | try self.code.append(wasm.opcode(.br)); |
| ... | ... | @@ -1112,8 +1132,12 @@ pub const Context = struct { |
| 1112 | 1132 | return .none; |
| 1113 | 1133 | } |
| 1114 | 1134 | |
| 1115 | fn genCondBr(self: *Context, condbr: *Inst.CondBr) InnerError!WValue { | |
| 1116 | const condition = self.resolveInst(condbr.condition); | |
| 1135 | fn airCondBr(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1136 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 1137 | const condition = self.resolveInst(pl_op.operand); | |
| 1138 | const extra = self.air.extraData(Air.CondBr, pl_op.payload); | |
| 1139 | const then_body = self.air.extra[extra.end..][0..extra.data.then_body_len]; | |
| 1140 | const else_body = self.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; | |
| 1117 | 1141 | const writer = self.code.writer(); |
| 1118 | 1142 | |
| 1119 | 1143 | // TODO: Handle death instructions for then and else body |
| ... | ... | @@ -1128,8 +1152,9 @@ pub const Context = struct { |
| 1128 | 1152 | break :blk offset; |
| 1129 | 1153 | }, |
| 1130 | 1154 | }; |
| 1131 | const block_ty = try self.genBlockType(condbr.base.src, condbr.base.ty); | |
| 1132 | try self.startBlock(.block, block_ty, offset); | |
| 1155 | ||
| 1156 | // result type is always noreturn, so use `block_empty` as type. | |
| 1157 | try self.startBlock(.block, wasm.block_empty, offset); | |
| 1133 | 1158 | |
| 1134 | 1159 | // we inserted the block in front of the condition |
| 1135 | 1160 | // so now check if condition matches. If not, break outside this block |
| ... | ... | @@ -1137,35 +1162,37 @@ pub const Context = struct { |
| 1137 | 1162 | try writer.writeByte(wasm.opcode(.br_if)); |
| 1138 | 1163 | try leb.writeULEB128(writer, @as(u32, 0)); |
| 1139 | 1164 | |
| 1140 | try self.genBody(condbr.else_body); | |
| 1165 | try self.genBody(else_body); | |
| 1141 | 1166 | try self.endBlock(); |
| 1142 | 1167 | |
| 1143 | 1168 | // Outer block that matches the condition |
| 1144 | try self.genBody(condbr.then_body); | |
| 1169 | try self.genBody(then_body); | |
| 1145 | 1170 | |
| 1146 | 1171 | return .none; |
| 1147 | 1172 | } |
| 1148 | 1173 | |
| 1149 | fn genCmp(self: *Context, inst: *Inst.BinOp, op: std.math.CompareOperator) InnerError!WValue { | |
| 1174 | fn airCmp(self: *Context, inst: Air.Inst.Index, op: std.math.CompareOperator) InnerError!WValue { | |
| 1150 | 1175 | // save offset, so potential conditions can insert blocks in front of |
| 1151 | 1176 | // the comparison that we can later jump back to |
| 1152 | 1177 | const offset = self.code.items.len; |
| 1153 | 1178 | |
| 1154 | const lhs = self.resolveInst(inst.lhs); | |
| 1155 | const rhs = self.resolveInst(inst.rhs); | |
| 1179 | const data: Air.Inst.Data = self.air.instructions.items(.data)[inst]; | |
| 1180 | const lhs = self.resolveInst(data.bin_op.lhs); | |
| 1181 | const rhs = self.resolveInst(data.bin_op.rhs); | |
| 1182 | const lhs_ty = self.air.typeOf(data.bin_op.lhs); | |
| 1156 | 1183 | |
| 1157 | 1184 | try self.emitWValue(lhs); |
| 1158 | 1185 | try self.emitWValue(rhs); |
| 1159 | 1186 | |
| 1160 | 1187 | const signedness: std.builtin.Signedness = blk: { |
| 1161 | 1188 | // by default we tell the operand type is unsigned (i.e. bools and enum values) |
| 1162 | if (inst.lhs.ty.zigTypeTag() != .Int) break :blk .unsigned; | |
| 1189 | if (lhs_ty.zigTypeTag() != .Int) break :blk .unsigned; | |
| 1163 | 1190 | |
| 1164 | 1191 | // incase of an actual integer, we emit the correct signedness |
| 1165 | break :blk inst.lhs.ty.intInfo(self.target).signedness; | |
| 1192 | break :blk lhs_ty.intInfo(self.target).signedness; | |
| 1166 | 1193 | }; |
| 1167 | 1194 | const opcode: wasm.Opcode = buildOpcode(.{ |
| 1168 | .valtype1 = try self.typeToValtype(inst.base.src, inst.lhs.ty), | |
| 1195 | .valtype1 = try self.typeToValtype(lhs_ty), | |
| 1169 | 1196 | .op = switch (op) { |
| 1170 | 1197 | .lt => .lt, |
| 1171 | 1198 | .lte => .le, |
| ... | ... | @@ -1180,16 +1207,17 @@ pub const Context = struct { |
| 1180 | 1207 | return WValue{ .code_offset = offset }; |
| 1181 | 1208 | } |
| 1182 | 1209 | |
| 1183 | fn genBr(self: *Context, br: *Inst.Br) InnerError!WValue { | |
| 1210 | fn airBr(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1211 | const br = self.air.instructions.items(.data)[inst].br; | |
| 1212 | ||
| 1184 | 1213 | // if operand has codegen bits we should break with a value |
| 1185 | if (br.operand.ty.hasCodeGenBits()) { | |
| 1186 | const operand = self.resolveInst(br.operand); | |
| 1187 | try self.emitWValue(operand); | |
| 1214 | if (self.air.typeOf(br.operand).hasCodeGenBits()) { | |
| 1215 | try self.emitWValue(self.resolveInst(br.operand)); | |
| 1188 | 1216 | } |
| 1189 | 1217 | |
| 1190 | 1218 | // We map every block to its block index. |
| 1191 | 1219 | // We then determine how far we have to jump to it by substracting it from current block depth |
| 1192 | const idx: u32 = self.block_depth - self.blocks.get(br.block).?; | |
| 1220 | const idx: u32 = self.block_depth - self.blocks.get(br.block_inst).?; | |
| 1193 | 1221 | const writer = self.code.writer(); |
| 1194 | 1222 | try writer.writeByte(wasm.opcode(.br)); |
| 1195 | 1223 | try leb.writeULEB128(writer, idx); |
| ... | ... | @@ -1197,10 +1225,11 @@ pub const Context = struct { |
| 1197 | 1225 | return .none; |
| 1198 | 1226 | } |
| 1199 | 1227 | |
| 1200 | fn genNot(self: *Context, not: *Inst.UnOp) InnerError!WValue { | |
| 1228 | fn airNot(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1229 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1201 | 1230 | const offset = self.code.items.len; |
| 1202 | 1231 | |
| 1203 | const operand = self.resolveInst(not.operand); | |
| 1232 | const operand = self.resolveInst(ty_op.operand); | |
| 1204 | 1233 | try self.emitWValue(operand); |
| 1205 | 1234 | |
| 1206 | 1235 | // wasm does not have booleans nor the `not` instruction, therefore compare with 0 |
| ... | ... | @@ -1214,73 +1243,93 @@ pub const Context = struct { |
| 1214 | 1243 | return WValue{ .code_offset = offset }; |
| 1215 | 1244 | } |
| 1216 | 1245 | |
| 1217 | fn genBreakpoint(self: *Context, breakpoint: *Inst.NoOp) InnerError!WValue { | |
| 1246 | fn airBreakpoint(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1218 | 1247 | _ = self; |
| 1219 | _ = breakpoint; | |
| 1248 | _ = inst; | |
| 1220 | 1249 | // unsupported by wasm itself. Can be implemented once we support DWARF |
| 1221 | 1250 | // for wasm |
| 1222 | 1251 | return .none; |
| 1223 | 1252 | } |
| 1224 | 1253 | |
| 1225 | fn genUnreachable(self: *Context, unreach: *Inst.NoOp) InnerError!WValue { | |
| 1226 | _ = unreach; | |
| 1254 | fn airUnreachable(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1255 | _ = inst; | |
| 1227 | 1256 | try self.code.append(wasm.opcode(.@"unreachable")); |
| 1228 | 1257 | return .none; |
| 1229 | 1258 | } |
| 1230 | 1259 | |
| 1231 | fn genBitcast(self: *Context, bitcast: *Inst.UnOp) InnerError!WValue { | |
| 1232 | return self.resolveInst(bitcast.operand); | |
| 1260 | fn airBitcast(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1261 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1262 | return self.resolveInst(ty_op.operand); | |
| 1233 | 1263 | } |
| 1234 | 1264 | |
| 1235 | fn genStructFieldPtr(self: *Context, inst: *Inst.StructFieldPtr) InnerError!WValue { | |
| 1236 | const struct_ptr = self.resolveInst(inst.struct_ptr); | |
| 1265 | fn airStructFieldPtr(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1266 | const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; | |
| 1267 | const extra = self.air.extraData(Air.StructField, ty_pl.payload); | |
| 1268 | const struct_ptr = self.resolveInst(extra.data.struct_ptr); | |
| 1237 | 1269 | |
| 1238 | return WValue{ .local = struct_ptr.multi_value.index + @intCast(u32, inst.field_index) }; | |
| 1270 | return WValue{ .local = struct_ptr.multi_value.index + @intCast(u32, extra.data.field_index) }; | |
| 1239 | 1271 | } |
| 1240 | 1272 | |
| 1241 | fn genSwitchBr(self: *Context, inst: *Inst.SwitchBr) InnerError!WValue { | |
| 1242 | const target = self.resolveInst(inst.target); | |
| 1243 | const target_ty = inst.target.ty; | |
| 1244 | const valtype = try self.typeToValtype(.{ .node_offset = 0 }, target_ty); | |
| 1245 | const blocktype = try self.genBlockType(inst.base.src, inst.base.ty); | |
| 1246 | ||
| 1247 | const signedness: std.builtin.Signedness = blk: { | |
| 1248 | // by default we tell the operand type is unsigned (i.e. bools and enum values) | |
| 1249 | if (target_ty.zigTypeTag() != .Int) break :blk .unsigned; | |
| 1250 | ||
| 1251 | // incase of an actual integer, we emit the correct signedness | |
| 1252 | break :blk target_ty.intInfo(self.target).signedness; | |
| 1253 | }; | |
| 1254 | for (inst.cases) |case| { | |
| 1255 | // create a block for each case, when the condition does not match we break out of it | |
| 1256 | try self.startBlock(.block, blocktype, null); | |
| 1257 | try self.emitWValue(target); | |
| 1258 | try self.emitConstant(.{ .node_offset = 0 }, case.item, target_ty); | |
| 1259 | const opcode = buildOpcode(.{ | |
| 1260 | .valtype1 = valtype, | |
| 1261 | .op = .ne, // not equal because we jump out the block if it does not match the condition | |
| 1262 | .signedness = signedness, | |
| 1263 | }); | |
| 1264 | try self.code.append(wasm.opcode(opcode)); | |
| 1265 | try self.code.append(wasm.opcode(.br_if)); | |
| 1266 | try leb.writeULEB128(self.code.writer(), @as(u32, 0)); | |
| 1267 | ||
| 1268 | // emit our block code | |
| 1269 | try self.genBody(case.body); | |
| 1270 | ||
| 1271 | // end the block we created earlier | |
| 1272 | try self.endBlock(); | |
| 1273 | } | |
| 1274 | ||
| 1275 | // finally, emit the else case if it exists. Here we will not have to | |
| 1276 | // check for a condition, so also no need to emit a block. | |
| 1277 | try self.genBody(inst.else_body); | |
| 1278 | ||
| 1279 | return .none; | |
| 1273 | fn airSwitchBr(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1274 | const pl_op = self.air.instructions.items(.data)[inst].pl_op; | |
| 1275 | const extra = self.air.extraData(Air.SwitchBr, pl_op.payload); | |
| 1276 | const cases = self.air.extra[extra.end..][0..extra.data.cases_len]; | |
| 1277 | const else_body = self.air.extra[extra.end + cases.len ..][0..extra.data.else_body_len]; | |
| 1278 | ||
| 1279 | const target = self.resolveInst(pl_op.operand); | |
| 1280 | const target_ty = self.air.typeOf(pl_op.operand); | |
| 1281 | const valtype = try self.typeToValtype(target_ty); | |
| 1282 | // result type is always 'noreturn' | |
| 1283 | const blocktype = wasm.block_empty; | |
| 1284 | ||
| 1285 | _ = valtype; | |
| 1286 | _ = blocktype; | |
| 1287 | _ = target; | |
| 1288 | _ = else_body; | |
| 1289 | return self.fail("TODO implement wasm codegen for switch", .{}); | |
| 1290 | //const signedness: std.builtin.Signedness = blk: { | |
| 1291 | // // by default we tell the operand type is unsigned (i.e. bools and enum values) | |
| 1292 | // if (target_ty.zigTypeTag() != .Int) break :blk .unsigned; | |
| 1293 | ||
| 1294 | // // incase of an actual integer, we emit the correct signedness | |
| 1295 | // break :blk target_ty.intInfo(self.target).signedness; | |
| 1296 | //}; | |
| 1297 | //for (cases) |case_idx| { | |
| 1298 | // const case = self.air.extraData(Air.SwitchBr.Case, case_idx); | |
| 1299 | // const case_body = self.air.extra[case.end..][0..case.data.body_len]; | |
| 1300 | ||
| 1301 | // // create a block for each case, when the condition does not match we break out of it | |
| 1302 | // try self.startBlock(.block, blocktype, null); | |
| 1303 | // try self.emitWValue(target); | |
| 1304 | ||
| 1305 | // const val = self.air.value(case.data.item).?; | |
| 1306 | // try self.emitConstant(val, target_ty); | |
| 1307 | // const opcode = buildOpcode(.{ | |
| 1308 | // .valtype1 = valtype, | |
| 1309 | // .op = .ne, // not equal because we jump out the block if it does not match the condition | |
| 1310 | // .signedness = signedness, | |
| 1311 | // }); | |
| 1312 | // try self.code.append(wasm.opcode(opcode)); | |
| 1313 | // try self.code.append(wasm.opcode(.br_if)); | |
| 1314 | // try leb.writeULEB128(self.code.writer(), @as(u32, 0)); | |
| 1315 | ||
| 1316 | // // emit our block code | |
| 1317 | // try self.genBody(case_body); | |
| 1318 | ||
| 1319 | // // end the block we created earlier | |
| 1320 | // try self.endBlock(); | |
| 1321 | //} | |
| 1322 | ||
| 1323 | //// finally, emit the else case if it exists. Here we will not have to | |
| 1324 | //// check for a condition, so also no need to emit a block. | |
| 1325 | //try self.genBody(else_body); | |
| 1326 | ||
| 1327 | //return .none; | |
| 1280 | 1328 | } |
| 1281 | 1329 | |
| 1282 | fn genIsErr(self: *Context, inst: *Inst.UnOp, opcode: wasm.Opcode) InnerError!WValue { | |
| 1283 | const operand = self.resolveInst(inst.operand); | |
| 1330 | fn airIsErr(self: *Context, inst: Air.Inst.Index, opcode: wasm.Opcode) InnerError!WValue { | |
| 1331 | const un_op = self.air.instructions.items(.data)[inst].un_op; | |
| 1332 | const operand = self.resolveInst(un_op); | |
| 1284 | 1333 | const offset = self.code.items.len; |
| 1285 | 1334 | const writer = self.code.writer(); |
| 1286 | 1335 | |
| ... | ... | @@ -1295,8 +1344,9 @@ pub const Context = struct { |
| 1295 | 1344 | return WValue{ .code_offset = offset }; |
| 1296 | 1345 | } |
| 1297 | 1346 | |
| 1298 | fn genUnwrapErrUnionPayload(self: *Context, inst: *Inst.UnOp) InnerError!WValue { | |
| 1299 | const operand = self.resolveInst(inst.operand); | |
| 1347 | fn airUnwrapErrUnionPayload(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1348 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1349 | const operand = self.resolveInst(ty_op.operand); | |
| 1300 | 1350 | // The index of multi_value contains the error code. To get the initial index of the payload we get |
| 1301 | 1351 | // the following index. Next, convert it to a `WValue.local` |
| 1302 | 1352 | // |
| ... | ... | @@ -1304,7 +1354,8 @@ pub const Context = struct { |
| 1304 | 1354 | return WValue{ .local = operand.multi_value.index + 1 }; |
| 1305 | 1355 | } |
| 1306 | 1356 | |
| 1307 | fn genWrapErrUnionPayload(self: *Context, inst: *Inst.UnOp) InnerError!WValue { | |
| 1308 | return self.resolveInst(inst.operand); | |
| 1357 | fn airWrapErrUnionPayload(self: *Context, inst: Air.Inst.Index) InnerError!WValue { | |
| 1358 | const ty_op = self.air.instructions.items(.data)[inst].ty_op; | |
| 1359 | return self.resolveInst(ty_op.operand); | |
| 1309 | 1360 | } |
| 1310 | 1361 | }; |
src/link.zig+29-5
| ... | ... | @@ -1,4 +1,5 @@ |
| 1 | 1 | const std = @import("std"); |
| 2 | const builtin = @import("builtin"); | |
| 2 | 3 | const mem = std.mem; |
| 3 | 4 | const Allocator = std.mem.Allocator; |
| 4 | 5 | const fs = std.fs; |
| ... | ... | @@ -14,8 +15,10 @@ const Cache = @import("Cache.zig"); |
| 14 | 15 | const build_options = @import("build_options"); |
| 15 | 16 | const LibCInstallation = @import("libc_installation.zig").LibCInstallation; |
| 16 | 17 | const wasi_libc = @import("wasi_libc.zig"); |
| 18 | const Air = @import("Air.zig"); | |
| 19 | const Liveness = @import("Liveness.zig"); | |
| 17 | 20 | |
| 18 | pub const producer_string = if (std.builtin.is_test) "zig test" else "zig " ++ build_options.version; | |
| 21 | pub const producer_string = if (builtin.is_test) "zig test" else "zig " ++ build_options.version; | |
| 19 | 22 | |
| 20 | 23 | pub const Emit = struct { |
| 21 | 24 | /// Where the output will go. |
| ... | ... | @@ -313,13 +316,34 @@ pub const File = struct { |
| 313 | 316 | log.debug("updateDecl {*} ({s}), type={}", .{ decl, decl.name, decl.ty }); |
| 314 | 317 | assert(decl.has_tv); |
| 315 | 318 | switch (base.tag) { |
| 316 | .coff => return @fieldParentPtr(Coff, "base", base).updateDecl(module, decl), | |
| 317 | .elf => return @fieldParentPtr(Elf, "base", base).updateDecl(module, decl), | |
| 319 | // zig fmt: off | |
| 320 | .coff => return @fieldParentPtr(Coff, "base", base).updateDecl(module, decl), | |
| 321 | .elf => return @fieldParentPtr(Elf, "base", base).updateDecl(module, decl), | |
| 318 | 322 | .macho => return @fieldParentPtr(MachO, "base", base).updateDecl(module, decl), |
| 319 | .c => return @fieldParentPtr(C, "base", base).updateDecl(module, decl), | |
| 320 | .wasm => return @fieldParentPtr(Wasm, "base", base).updateDecl(module, decl), | |
| 323 | .c => return @fieldParentPtr(C, "base", base).updateDecl(module, decl), | |
| 324 | .wasm => return @fieldParentPtr(Wasm, "base", base).updateDecl(module, decl), | |
| 321 | 325 | .spirv => return @fieldParentPtr(SpirV, "base", base).updateDecl(module, decl), |
| 322 | 326 | .plan9 => return @fieldParentPtr(Plan9, "base", base).updateDecl(module, decl), |
| 327 | // zig fmt: on | |
| 328 | } | |
| 329 | } | |
| 330 | ||
| 331 | /// May be called before or after updateDeclExports but must be called | |
| 332 | /// after allocateDeclIndexes for any given Decl. | |
| 333 | pub fn updateFunc(base: *File, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 334 | log.debug("updateFunc {*} ({s}), type={}", .{ | |
| 335 | func.owner_decl, func.owner_decl.name, func.owner_decl.ty, | |
| 336 | }); | |
| 337 | switch (base.tag) { | |
| 338 | // zig fmt: off | |
| 339 | .coff => return @fieldParentPtr(Coff, "base", base).updateFunc(module, func, air, liveness), | |
| 340 | .elf => return @fieldParentPtr(Elf, "base", base).updateFunc(module, func, air, liveness), | |
| 341 | .macho => return @fieldParentPtr(MachO, "base", base).updateFunc(module, func, air, liveness), | |
| 342 | .c => return @fieldParentPtr(C, "base", base).updateFunc(module, func, air, liveness), | |
| 343 | .wasm => return @fieldParentPtr(Wasm, "base", base).updateFunc(module, func, air, liveness), | |
| 344 | .spirv => return @fieldParentPtr(SpirV, "base", base).updateFunc(module, func, air, liveness), | |
| 345 | .plan9 => return @fieldParentPtr(Plan9, "base", base).updateFunc(module, func, air, liveness), | |
| 346 | // zig fmt: on | |
| 323 | 347 | } |
| 324 | 348 | } |
| 325 | 349 |
src/link/C.zig+22-6
| ... | ... | @@ -2,14 +2,17 @@ const std = @import("std"); |
| 2 | 2 | const mem = std.mem; |
| 3 | 3 | const assert = std.debug.assert; |
| 4 | 4 | const Allocator = std.mem.Allocator; |
| 5 | const fs = std.fs; | |
| 6 | ||
| 7 | const C = @This(); | |
| 5 | 8 | const Module = @import("../Module.zig"); |
| 6 | 9 | const Compilation = @import("../Compilation.zig"); |
| 7 | const fs = std.fs; | |
| 8 | 10 | const codegen = @import("../codegen/c.zig"); |
| 9 | 11 | const link = @import("../link.zig"); |
| 10 | 12 | const trace = @import("../tracy.zig").trace; |
| 11 | const C = @This(); | |
| 12 | 13 | const Type = @import("../type.zig").Type; |
| 14 | const Air = @import("../Air.zig"); | |
| 15 | const Liveness = @import("../Liveness.zig"); | |
| 13 | 16 | |
| 14 | 17 | pub const base_tag: link.File.Tag = .c; |
| 15 | 18 | pub const zig_h = @embedFile("C/zig.h"); |
| ... | ... | @@ -95,10 +98,7 @@ fn deinitDecl(gpa: *Allocator, decl: *Module.Decl) void { |
| 95 | 98 | decl.fn_link.c.typedefs.deinit(gpa); |
| 96 | 99 | } |
| 97 | 100 | |
| 98 | pub fn updateDecl(self: *C, module: *Module, decl: *Module.Decl) !void { | |
| 99 | const tracy = trace(@src()); | |
| 100 | defer tracy.end(); | |
| 101 | ||
| 101 | pub fn finishUpdateDecl(self: *C, module: *Module, decl: *Module.Decl, air: Air, liveness: Liveness) !void { | |
| 102 | 102 | // Keep track of all decls so we can iterate over them on flush(). |
| 103 | 103 | _ = try self.decl_table.getOrPut(self.base.allocator, decl); |
| 104 | 104 | |
| ... | ... | @@ -126,6 +126,8 @@ pub fn updateDecl(self: *C, module: *Module, decl: *Module.Decl) !void { |
| 126 | 126 | .code = code.toManaged(module.gpa), |
| 127 | 127 | .value_map = codegen.CValueMap.init(module.gpa), |
| 128 | 128 | .indent_writer = undefined, // set later so we can get a pointer to object.code |
| 129 | .air = air, | |
| 130 | .liveness = liveness, | |
| 129 | 131 | }; |
| 130 | 132 | object.indent_writer = .{ .underlying_writer = object.code.writer() }; |
| 131 | 133 | defer { |
| ... | ... | @@ -157,6 +159,20 @@ pub fn updateDecl(self: *C, module: *Module, decl: *Module.Decl) !void { |
| 157 | 159 | code.shrinkAndFree(module.gpa, code.items.len); |
| 158 | 160 | } |
| 159 | 161 | |
| 162 | pub fn updateFunc(self: *C, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 163 | const tracy = trace(@src()); | |
| 164 | defer tracy.end(); | |
| 165 | ||
| 166 | return self.finishUpdateDecl(module, func.owner_decl, air, liveness); | |
| 167 | } | |
| 168 | ||
| 169 | pub fn updateDecl(self: *C, module: *Module, decl: *Module.Decl) !void { | |
| 170 | const tracy = trace(@src()); | |
| 171 | defer tracy.end(); | |
| 172 | ||
| 173 | return self.finishUpdateDecl(module, decl, undefined, undefined); | |
| 174 | } | |
| 175 | ||
| 160 | 176 | pub fn updateDeclLineNumber(self: *C, module: *Module, decl: *Module.Decl) !void { |
| 161 | 177 | // The C backend does not have the ability to fix line numbers without re-generating |
| 162 | 178 | // the entire Decl. |
src/link/Coff.zig+56-5
| ... | ... | @@ -1,6 +1,7 @@ |
| 1 | 1 | const Coff = @This(); |
| 2 | 2 | |
| 3 | 3 | const std = @import("std"); |
| 4 | const builtin = @import("builtin"); | |
| 4 | 5 | const log = std.log.scoped(.link); |
| 5 | 6 | const Allocator = std.mem.Allocator; |
| 6 | 7 | const assert = std.debug.assert; |
| ... | ... | @@ -17,6 +18,8 @@ const build_options = @import("build_options"); |
| 17 | 18 | const Cache = @import("../Cache.zig"); |
| 18 | 19 | const mingw = @import("../mingw.zig"); |
| 19 | 20 | const llvm_backend = @import("../codegen/llvm.zig"); |
| 21 | const Air = @import("../Air.zig"); | |
| 22 | const Liveness = @import("../Liveness.zig"); | |
| 20 | 23 | |
| 21 | 24 | const allocation_padding = 4 / 3; |
| 22 | 25 | const minimum_text_block_size = 64 * allocation_padding; |
| ... | ... | @@ -653,19 +656,63 @@ fn writeOffsetTableEntry(self: *Coff, index: usize) !void { |
| 653 | 656 | } |
| 654 | 657 | } |
| 655 | 658 | |
| 656 | pub fn updateDecl(self: *Coff, module: *Module, decl: *Module.Decl) !void { | |
| 657 | // TODO COFF/PE debug information | |
| 658 | // TODO Implement exports | |
| 659 | pub fn updateFunc(self: *Coff, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 660 | if (build_options.skip_non_native and | |
| 661 | builtin.object_format != .coff and | |
| 662 | builtin.object_format != .pe) | |
| 663 | { | |
| 664 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 665 | } | |
| 666 | if (build_options.have_llvm) { | |
| 667 | if (self.llvm_object) |llvm_object| { | |
| 668 | return llvm_object.updateFunc(module, func, air, liveness); | |
| 669 | } | |
| 670 | } | |
| 659 | 671 | const tracy = trace(@src()); |
| 660 | 672 | defer tracy.end(); |
| 661 | 673 | |
| 662 | if (build_options.have_llvm) | |
| 663 | if (self.llvm_object) |llvm_object| return try llvm_object.updateDecl(module, decl); | |
| 674 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 675 | defer code_buffer.deinit(); | |
| 676 | ||
| 677 | const decl = func.owner_decl; | |
| 678 | const res = try codegen.generateFunction( | |
| 679 | &self.base, | |
| 680 | decl.srcLoc(), | |
| 681 | func, | |
| 682 | air, | |
| 683 | liveness, | |
| 684 | &code_buffer, | |
| 685 | .none, | |
| 686 | ); | |
| 687 | const code = switch (res) { | |
| 688 | .appended => code_buffer.items, | |
| 689 | .fail => |em| { | |
| 690 | decl.analysis = .codegen_failure; | |
| 691 | try module.failed_decls.put(module.gpa, decl, em); | |
| 692 | return; | |
| 693 | }, | |
| 694 | }; | |
| 695 | ||
| 696 | return self.finishUpdateDecl(module, func.owner_decl, code); | |
| 697 | } | |
| 698 | ||
| 699 | pub fn updateDecl(self: *Coff, module: *Module, decl: *Module.Decl) !void { | |
| 700 | if (build_options.skip_non_native and builtin.object_format != .coff and builtin.object_format != .pe) { | |
| 701 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 702 | } | |
| 703 | if (build_options.have_llvm) { | |
| 704 | if (self.llvm_object) |llvm_object| return llvm_object.updateDecl(module, decl); | |
| 705 | } | |
| 706 | const tracy = trace(@src()); | |
| 707 | defer tracy.end(); | |
| 664 | 708 | |
| 665 | 709 | if (decl.val.tag() == .extern_fn) { |
| 666 | 710 | return; // TODO Should we do more when front-end analyzed extern decl? |
| 667 | 711 | } |
| 668 | 712 | |
| 713 | // TODO COFF/PE debug information | |
| 714 | // TODO Implement exports | |
| 715 | ||
| 669 | 716 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); |
| 670 | 717 | defer code_buffer.deinit(); |
| 671 | 718 | |
| ... | ... | @@ -683,6 +730,10 @@ pub fn updateDecl(self: *Coff, module: *Module, decl: *Module.Decl) !void { |
| 683 | 730 | }, |
| 684 | 731 | }; |
| 685 | 732 | |
| 733 | return self.finishUpdateDecl(module, decl, code); | |
| 734 | } | |
| 735 | ||
| 736 | fn finishUpdateDecl(self: *Coff, module: *Module, decl: *Module.Decl, code: []const u8) !void { | |
| 686 | 737 | const required_alignment = decl.ty.abiAlignment(self.base.options.target); |
| 687 | 738 | const curr_size = decl.link.coff.size; |
| 688 | 739 | if (curr_size != 0) { |
src/link/Elf.zig+310-252
| ... | ... | @@ -1,6 +1,7 @@ |
| 1 | 1 | const Elf = @This(); |
| 2 | 2 | |
| 3 | 3 | const std = @import("std"); |
| 4 | const builtin = @import("builtin"); | |
| 4 | 5 | const mem = std.mem; |
| 5 | 6 | const assert = std.debug.assert; |
| 6 | 7 | const Allocator = std.mem.Allocator; |
| ... | ... | @@ -10,7 +11,6 @@ const log = std.log.scoped(.link); |
| 10 | 11 | const DW = std.dwarf; |
| 11 | 12 | const leb128 = std.leb; |
| 12 | 13 | |
| 13 | const ir = @import("../air.zig"); | |
| 14 | 14 | const Module = @import("../Module.zig"); |
| 15 | 15 | const Compilation = @import("../Compilation.zig"); |
| 16 | 16 | const codegen = @import("../codegen.zig"); |
| ... | ... | @@ -26,6 +26,8 @@ const glibc = @import("../glibc.zig"); |
| 26 | 26 | const musl = @import("../musl.zig"); |
| 27 | 27 | const Cache = @import("../Cache.zig"); |
| 28 | 28 | const llvm_backend = @import("../codegen/llvm.zig"); |
| 29 | const Air = @import("../Air.zig"); | |
| 30 | const Liveness = @import("../Liveness.zig"); | |
| 29 | 31 | |
| 30 | 32 | const default_entry_addr = 0x8000000; |
| 31 | 33 | |
| ... | ... | @@ -2155,138 +2157,17 @@ pub fn freeDecl(self: *Elf, decl: *Module.Decl) void { |
| 2155 | 2157 | } |
| 2156 | 2158 | } |
| 2157 | 2159 | |
| 2158 | pub fn updateDecl(self: *Elf, module: *Module, decl: *Module.Decl) !void { | |
| 2159 | const tracy = trace(@src()); | |
| 2160 | defer tracy.end(); | |
| 2161 | ||
| 2162 | if (build_options.have_llvm) | |
| 2163 | if (self.llvm_object) |llvm_object| return try llvm_object.updateDecl(module, decl); | |
| 2164 | ||
| 2165 | if (decl.val.tag() == .extern_fn) { | |
| 2166 | return; // TODO Should we do more when front-end analyzed extern decl? | |
| 2167 | } | |
| 2168 | if (decl.val.castTag(.variable)) |payload| { | |
| 2169 | const variable = payload.data; | |
| 2170 | if (variable.is_extern) { | |
| 2171 | return; // TODO Should we do more when front-end analyzed extern decl? | |
| 2172 | } | |
| 2173 | } | |
| 2174 | ||
| 2175 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2176 | defer code_buffer.deinit(); | |
| 2177 | ||
| 2178 | var dbg_line_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2179 | defer dbg_line_buffer.deinit(); | |
| 2180 | ||
| 2181 | var dbg_info_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2182 | defer dbg_info_buffer.deinit(); | |
| 2183 | ||
| 2184 | var dbg_info_type_relocs: File.DbgInfoTypeRelocsTable = .{}; | |
| 2185 | defer { | |
| 2186 | var it = dbg_info_type_relocs.valueIterator(); | |
| 2187 | while (it.next()) |value| { | |
| 2188 | value.relocs.deinit(self.base.allocator); | |
| 2189 | } | |
| 2190 | dbg_info_type_relocs.deinit(self.base.allocator); | |
| 2191 | } | |
| 2192 | ||
| 2193 | const is_fn: bool = switch (decl.ty.zigTypeTag()) { | |
| 2194 | .Fn => true, | |
| 2195 | else => false, | |
| 2196 | }; | |
| 2197 | if (is_fn) { | |
| 2198 | // For functions we need to add a prologue to the debug line program. | |
| 2199 | try dbg_line_buffer.ensureCapacity(26); | |
| 2200 | ||
| 2201 | const func = decl.val.castTag(.function).?.data; | |
| 2202 | const line_off = @intCast(u28, decl.src_line + func.lbrace_line); | |
| 2203 | ||
| 2204 | const ptr_width_bytes = self.ptrWidthBytes(); | |
| 2205 | dbg_line_buffer.appendSliceAssumeCapacity(&[_]u8{ | |
| 2206 | DW.LNS_extended_op, | |
| 2207 | ptr_width_bytes + 1, | |
| 2208 | DW.LNE_set_address, | |
| 2209 | }); | |
| 2210 | // This is the "relocatable" vaddr, corresponding to `code_buffer` index `0`. | |
| 2211 | assert(dbg_line_vaddr_reloc_index == dbg_line_buffer.items.len); | |
| 2212 | dbg_line_buffer.items.len += ptr_width_bytes; | |
| 2213 | ||
| 2214 | dbg_line_buffer.appendAssumeCapacity(DW.LNS_advance_line); | |
| 2215 | // This is the "relocatable" relative line offset from the previous function's end curly | |
| 2216 | // to this function's begin curly. | |
| 2217 | assert(self.getRelocDbgLineOff() == dbg_line_buffer.items.len); | |
| 2218 | // Here we use a ULEB128-fixed-4 to make sure this field can be overwritten later. | |
| 2219 | leb128.writeUnsignedFixed(4, dbg_line_buffer.addManyAsArrayAssumeCapacity(4), line_off); | |
| 2220 | ||
| 2221 | dbg_line_buffer.appendAssumeCapacity(DW.LNS_set_file); | |
| 2222 | assert(self.getRelocDbgFileIndex() == dbg_line_buffer.items.len); | |
| 2223 | // Once we support more than one source file, this will have the ability to be more | |
| 2224 | // than one possible value. | |
| 2225 | const file_index = 1; | |
| 2226 | leb128.writeUnsignedFixed(4, dbg_line_buffer.addManyAsArrayAssumeCapacity(4), file_index); | |
| 2227 | ||
| 2228 | // Emit a line for the begin curly with prologue_end=false. The codegen will | |
| 2229 | // do the work of setting prologue_end=true and epilogue_begin=true. | |
| 2230 | dbg_line_buffer.appendAssumeCapacity(DW.LNS_copy); | |
| 2231 | ||
| 2232 | // .debug_info subprogram | |
| 2233 | const decl_name_with_null = decl.name[0 .. mem.lenZ(decl.name) + 1]; | |
| 2234 | try dbg_info_buffer.ensureCapacity(dbg_info_buffer.items.len + 25 + decl_name_with_null.len); | |
| 2235 | ||
| 2236 | const fn_ret_type = decl.ty.fnReturnType(); | |
| 2237 | const fn_ret_has_bits = fn_ret_type.hasCodeGenBits(); | |
| 2238 | if (fn_ret_has_bits) { | |
| 2239 | dbg_info_buffer.appendAssumeCapacity(abbrev_subprogram); | |
| 2240 | } else { | |
| 2241 | dbg_info_buffer.appendAssumeCapacity(abbrev_subprogram_retvoid); | |
| 2242 | } | |
| 2243 | // These get overwritten after generating the machine code. These values are | |
| 2244 | // "relocations" and have to be in this fixed place so that functions can be | |
| 2245 | // moved in virtual address space. | |
| 2246 | assert(dbg_info_low_pc_reloc_index == dbg_info_buffer.items.len); | |
| 2247 | dbg_info_buffer.items.len += ptr_width_bytes; // DW.AT_low_pc, DW.FORM_addr | |
| 2248 | assert(self.getRelocDbgInfoSubprogramHighPC() == dbg_info_buffer.items.len); | |
| 2249 | dbg_info_buffer.items.len += 4; // DW.AT_high_pc, DW.FORM_data4 | |
| 2250 | if (fn_ret_has_bits) { | |
| 2251 | const gop = try dbg_info_type_relocs.getOrPut(self.base.allocator, fn_ret_type); | |
| 2252 | if (!gop.found_existing) { | |
| 2253 | gop.value_ptr.* = .{ | |
| 2254 | .off = undefined, | |
| 2255 | .relocs = .{}, | |
| 2256 | }; | |
| 2257 | } | |
| 2258 | try gop.value_ptr.relocs.append(self.base.allocator, @intCast(u32, dbg_info_buffer.items.len)); | |
| 2259 | dbg_info_buffer.items.len += 4; // DW.AT_type, DW.FORM_ref4 | |
| 2260 | } | |
| 2261 | dbg_info_buffer.appendSliceAssumeCapacity(decl_name_with_null); // DW.AT_name, DW.FORM_string | |
| 2262 | } else { | |
| 2263 | // TODO implement .debug_info for global variables | |
| 2160 | fn deinitRelocs(gpa: *Allocator, table: *File.DbgInfoTypeRelocsTable) void { | |
| 2161 | var it = table.valueIterator(); | |
| 2162 | while (it.next()) |value| { | |
| 2163 | value.relocs.deinit(gpa); | |
| 2264 | 2164 | } |
| 2265 | const decl_val = if (decl.val.castTag(.variable)) |payload| payload.data.init else decl.val; | |
| 2266 | const res = try codegen.generateSymbol(&self.base, decl.srcLoc(), .{ | |
| 2267 | .ty = decl.ty, | |
| 2268 | .val = decl_val, | |
| 2269 | }, &code_buffer, .{ | |
| 2270 | .dwarf = .{ | |
| 2271 | .dbg_line = &dbg_line_buffer, | |
| 2272 | .dbg_info = &dbg_info_buffer, | |
| 2273 | .dbg_info_type_relocs = &dbg_info_type_relocs, | |
| 2274 | }, | |
| 2275 | }); | |
| 2276 | const code = switch (res) { | |
| 2277 | .externally_managed => |x| x, | |
| 2278 | .appended => code_buffer.items, | |
| 2279 | .fail => |em| { | |
| 2280 | decl.analysis = .codegen_failure; | |
| 2281 | try module.failed_decls.put(module.gpa, decl, em); | |
| 2282 | return; | |
| 2283 | }, | |
| 2284 | }; | |
| 2165 | table.deinit(gpa); | |
| 2166 | } | |
| 2285 | 2167 | |
| 2168 | fn updateDeclCode(self: *Elf, decl: *Module.Decl, code: []const u8, stt_bits: u8) !*elf.Elf64_Sym { | |
| 2286 | 2169 | const required_alignment = decl.ty.abiAlignment(self.base.options.target); |
| 2287 | 2170 | |
| 2288 | const stt_bits: u8 = if (is_fn) elf.STT_FUNC else elf.STT_OBJECT; | |
| 2289 | ||
| 2290 | 2171 | assert(decl.link.elf.local_sym_index != 0); // Caller forgot to allocateDeclIndexes() |
| 2291 | 2172 | const local_sym = &self.local_symbols.items[decl.link.elf.local_sym_index]; |
| 2292 | 2173 | if (local_sym.st_size != 0) { |
| ... | ... | @@ -2338,128 +2219,16 @@ pub fn updateDecl(self: *Elf, module: *Module, decl: *Module.Decl) !void { |
| 2338 | 2219 | const file_offset = self.sections.items[self.text_section_index.?].sh_offset + section_offset; |
| 2339 | 2220 | try self.base.file.?.pwriteAll(code, file_offset); |
| 2340 | 2221 | |
| 2341 | const target_endian = self.base.options.target.cpu.arch.endian(); | |
| 2342 | ||
| 2343 | const text_block = &decl.link.elf; | |
| 2344 | ||
| 2345 | // If the Decl is a function, we need to update the .debug_line program. | |
| 2346 | if (is_fn) { | |
| 2347 | // Perform the relocations based on vaddr. | |
| 2348 | switch (self.ptr_width) { | |
| 2349 | .p32 => { | |
| 2350 | { | |
| 2351 | const ptr = dbg_line_buffer.items[dbg_line_vaddr_reloc_index..][0..4]; | |
| 2352 | mem.writeInt(u32, ptr, @intCast(u32, local_sym.st_value), target_endian); | |
| 2353 | } | |
| 2354 | { | |
| 2355 | const ptr = dbg_info_buffer.items[dbg_info_low_pc_reloc_index..][0..4]; | |
| 2356 | mem.writeInt(u32, ptr, @intCast(u32, local_sym.st_value), target_endian); | |
| 2357 | } | |
| 2358 | }, | |
| 2359 | .p64 => { | |
| 2360 | { | |
| 2361 | const ptr = dbg_line_buffer.items[dbg_line_vaddr_reloc_index..][0..8]; | |
| 2362 | mem.writeInt(u64, ptr, local_sym.st_value, target_endian); | |
| 2363 | } | |
| 2364 | { | |
| 2365 | const ptr = dbg_info_buffer.items[dbg_info_low_pc_reloc_index..][0..8]; | |
| 2366 | mem.writeInt(u64, ptr, local_sym.st_value, target_endian); | |
| 2367 | } | |
| 2368 | }, | |
| 2369 | } | |
| 2370 | { | |
| 2371 | const ptr = dbg_info_buffer.items[self.getRelocDbgInfoSubprogramHighPC()..][0..4]; | |
| 2372 | mem.writeInt(u32, ptr, @intCast(u32, local_sym.st_size), target_endian); | |
| 2373 | } | |
| 2374 | ||
| 2375 | try dbg_line_buffer.appendSlice(&[_]u8{ DW.LNS_extended_op, 1, DW.LNE_end_sequence }); | |
| 2376 | ||
| 2377 | // Now we have the full contents and may allocate a region to store it. | |
| 2378 | ||
| 2379 | // This logic is nearly identical to the logic below in `updateDeclDebugInfoAllocation` for | |
| 2380 | // `TextBlock` and the .debug_info. If you are editing this logic, you | |
| 2381 | // probably need to edit that logic too. | |
| 2382 | ||
| 2383 | const debug_line_sect = &self.sections.items[self.debug_line_section_index.?]; | |
| 2384 | const src_fn = &decl.fn_link.elf; | |
| 2385 | src_fn.len = @intCast(u32, dbg_line_buffer.items.len); | |
| 2386 | if (self.dbg_line_fn_last) |last| not_first: { | |
| 2387 | if (src_fn.next) |next| { | |
| 2388 | // Update existing function - non-last item. | |
| 2389 | if (src_fn.off + src_fn.len + min_nop_size > next.off) { | |
| 2390 | // It grew too big, so we move it to a new location. | |
| 2391 | if (src_fn.prev) |prev| { | |
| 2392 | self.dbg_line_fn_free_list.put(self.base.allocator, prev, {}) catch {}; | |
| 2393 | prev.next = src_fn.next; | |
| 2394 | } | |
| 2395 | assert(src_fn.prev != next); | |
| 2396 | next.prev = src_fn.prev; | |
| 2397 | src_fn.next = null; | |
| 2398 | // Populate where it used to be with NOPs. | |
| 2399 | const file_pos = debug_line_sect.sh_offset + src_fn.off; | |
| 2400 | try self.pwriteDbgLineNops(0, &[0]u8{}, src_fn.len, file_pos); | |
| 2401 | // TODO Look at the free list before appending at the end. | |
| 2402 | src_fn.prev = last; | |
| 2403 | last.next = src_fn; | |
| 2404 | self.dbg_line_fn_last = src_fn; | |
| 2405 | ||
| 2406 | src_fn.off = last.off + padToIdeal(last.len); | |
| 2407 | } | |
| 2408 | } else if (src_fn.prev == null) { | |
| 2409 | if (src_fn == last) { | |
| 2410 | // Special case: there is only 1 function and it is being updated. | |
| 2411 | // In this case there is nothing to do. The function's length has | |
| 2412 | // already been updated, and the logic below takes care of | |
| 2413 | // resizing the .debug_line section. | |
| 2414 | break :not_first; | |
| 2415 | } | |
| 2416 | // Append new function. | |
| 2417 | // TODO Look at the free list before appending at the end. | |
| 2418 | src_fn.prev = last; | |
| 2419 | last.next = src_fn; | |
| 2420 | self.dbg_line_fn_last = src_fn; | |
| 2421 | ||
| 2422 | src_fn.off = last.off + padToIdeal(last.len); | |
| 2423 | } | |
| 2424 | } else { | |
| 2425 | // This is the first function of the Line Number Program. | |
| 2426 | self.dbg_line_fn_first = src_fn; | |
| 2427 | self.dbg_line_fn_last = src_fn; | |
| 2428 | ||
| 2429 | src_fn.off = padToIdeal(self.dbgLineNeededHeaderBytes()); | |
| 2430 | } | |
| 2431 | ||
| 2432 | const last_src_fn = self.dbg_line_fn_last.?; | |
| 2433 | const needed_size = last_src_fn.off + last_src_fn.len; | |
| 2434 | if (needed_size != debug_line_sect.sh_size) { | |
| 2435 | if (needed_size > self.allocatedSize(debug_line_sect.sh_offset)) { | |
| 2436 | const new_offset = self.findFreeSpace(needed_size, 1); | |
| 2437 | const existing_size = last_src_fn.off; | |
| 2438 | log.debug("moving .debug_line section: {d} bytes from 0x{x} to 0x{x}", .{ | |
| 2439 | existing_size, | |
| 2440 | debug_line_sect.sh_offset, | |
| 2441 | new_offset, | |
| 2442 | }); | |
| 2443 | const amt = try self.base.file.?.copyRangeAll(debug_line_sect.sh_offset, self.base.file.?, new_offset, existing_size); | |
| 2444 | if (amt != existing_size) return error.InputOutput; | |
| 2445 | debug_line_sect.sh_offset = new_offset; | |
| 2446 | } | |
| 2447 | debug_line_sect.sh_size = needed_size; | |
| 2448 | self.shdr_table_dirty = true; // TODO look into making only the one section dirty | |
| 2449 | self.debug_line_header_dirty = true; | |
| 2450 | } | |
| 2451 | const prev_padding_size: u32 = if (src_fn.prev) |prev| src_fn.off - (prev.off + prev.len) else 0; | |
| 2452 | const next_padding_size: u32 = if (src_fn.next) |next| next.off - (src_fn.off + src_fn.len) else 0; | |
| 2453 | ||
| 2454 | // We only have support for one compilation unit so far, so the offsets are directly | |
| 2455 | // from the .debug_line section. | |
| 2456 | const file_pos = debug_line_sect.sh_offset + src_fn.off; | |
| 2457 | try self.pwriteDbgLineNops(prev_padding_size, dbg_line_buffer.items, next_padding_size, file_pos); | |
| 2458 | ||
| 2459 | // .debug_info - End the TAG_subprogram children. | |
| 2460 | try dbg_info_buffer.append(0); | |
| 2461 | } | |
| 2222 | return local_sym; | |
| 2223 | } | |
| 2462 | 2224 | |
| 2225 | fn finishUpdateDecl( | |
| 2226 | self: *Elf, | |
| 2227 | module: *Module, | |
| 2228 | decl: *Module.Decl, | |
| 2229 | dbg_info_type_relocs: *File.DbgInfoTypeRelocsTable, | |
| 2230 | dbg_info_buffer: *std.ArrayList(u8), | |
| 2231 | ) !void { | |
| 2463 | 2232 | // Now we emit the .debug_info types of the Decl. These will count towards the size of |
| 2464 | 2233 | // the buffer, so we have to do it before computing the offset, and we can't perform the actual |
| 2465 | 2234 | // relocations yet. |
| ... | ... | @@ -2467,12 +2236,15 @@ pub fn updateDecl(self: *Elf, module: *Module, decl: *Module.Decl) !void { |
| 2467 | 2236 | var it = dbg_info_type_relocs.iterator(); |
| 2468 | 2237 | while (it.next()) |entry| { |
| 2469 | 2238 | entry.value_ptr.off = @intCast(u32, dbg_info_buffer.items.len); |
| 2470 | try self.addDbgInfoType(entry.key_ptr.*, &dbg_info_buffer); | |
| 2239 | try self.addDbgInfoType(entry.key_ptr.*, dbg_info_buffer); | |
| 2471 | 2240 | } |
| 2472 | 2241 | } |
| 2473 | 2242 | |
| 2243 | const text_block = &decl.link.elf; | |
| 2474 | 2244 | try self.updateDeclDebugInfoAllocation(text_block, @intCast(u32, dbg_info_buffer.items.len)); |
| 2475 | 2245 | |
| 2246 | const target_endian = self.base.options.target.cpu.arch.endian(); | |
| 2247 | ||
| 2476 | 2248 | { |
| 2477 | 2249 | // Now that we have the offset assigned we can finally perform type relocations. |
| 2478 | 2250 | var it = dbg_info_type_relocs.valueIterator(); |
| ... | ... | @@ -2495,6 +2267,292 @@ pub fn updateDecl(self: *Elf, module: *Module, decl: *Module.Decl) !void { |
| 2495 | 2267 | return self.updateDeclExports(module, decl, decl_exports); |
| 2496 | 2268 | } |
| 2497 | 2269 | |
| 2270 | pub fn updateFunc(self: *Elf, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 2271 | if (build_options.skip_non_native and builtin.object_format != .elf) { | |
| 2272 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 2273 | } | |
| 2274 | if (build_options.have_llvm) { | |
| 2275 | if (self.llvm_object) |llvm_object| return llvm_object.updateFunc(module, func, air, liveness); | |
| 2276 | } | |
| 2277 | ||
| 2278 | const tracy = trace(@src()); | |
| 2279 | defer tracy.end(); | |
| 2280 | ||
| 2281 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2282 | defer code_buffer.deinit(); | |
| 2283 | ||
| 2284 | var dbg_line_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2285 | defer dbg_line_buffer.deinit(); | |
| 2286 | ||
| 2287 | var dbg_info_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2288 | defer dbg_info_buffer.deinit(); | |
| 2289 | ||
| 2290 | var dbg_info_type_relocs: File.DbgInfoTypeRelocsTable = .{}; | |
| 2291 | defer deinitRelocs(self.base.allocator, &dbg_info_type_relocs); | |
| 2292 | ||
| 2293 | // For functions we need to add a prologue to the debug line program. | |
| 2294 | try dbg_line_buffer.ensureCapacity(26); | |
| 2295 | ||
| 2296 | const decl = func.owner_decl; | |
| 2297 | const line_off = @intCast(u28, decl.src_line + func.lbrace_line); | |
| 2298 | ||
| 2299 | const ptr_width_bytes = self.ptrWidthBytes(); | |
| 2300 | dbg_line_buffer.appendSliceAssumeCapacity(&[_]u8{ | |
| 2301 | DW.LNS_extended_op, | |
| 2302 | ptr_width_bytes + 1, | |
| 2303 | DW.LNE_set_address, | |
| 2304 | }); | |
| 2305 | // This is the "relocatable" vaddr, corresponding to `code_buffer` index `0`. | |
| 2306 | assert(dbg_line_vaddr_reloc_index == dbg_line_buffer.items.len); | |
| 2307 | dbg_line_buffer.items.len += ptr_width_bytes; | |
| 2308 | ||
| 2309 | dbg_line_buffer.appendAssumeCapacity(DW.LNS_advance_line); | |
| 2310 | // This is the "relocatable" relative line offset from the previous function's end curly | |
| 2311 | // to this function's begin curly. | |
| 2312 | assert(self.getRelocDbgLineOff() == dbg_line_buffer.items.len); | |
| 2313 | // Here we use a ULEB128-fixed-4 to make sure this field can be overwritten later. | |
| 2314 | leb128.writeUnsignedFixed(4, dbg_line_buffer.addManyAsArrayAssumeCapacity(4), line_off); | |
| 2315 | ||
| 2316 | dbg_line_buffer.appendAssumeCapacity(DW.LNS_set_file); | |
| 2317 | assert(self.getRelocDbgFileIndex() == dbg_line_buffer.items.len); | |
| 2318 | // Once we support more than one source file, this will have the ability to be more | |
| 2319 | // than one possible value. | |
| 2320 | const file_index = 1; | |
| 2321 | leb128.writeUnsignedFixed(4, dbg_line_buffer.addManyAsArrayAssumeCapacity(4), file_index); | |
| 2322 | ||
| 2323 | // Emit a line for the begin curly with prologue_end=false. The codegen will | |
| 2324 | // do the work of setting prologue_end=true and epilogue_begin=true. | |
| 2325 | dbg_line_buffer.appendAssumeCapacity(DW.LNS_copy); | |
| 2326 | ||
| 2327 | // .debug_info subprogram | |
| 2328 | const decl_name_with_null = decl.name[0 .. mem.lenZ(decl.name) + 1]; | |
| 2329 | try dbg_info_buffer.ensureCapacity(dbg_info_buffer.items.len + 25 + decl_name_with_null.len); | |
| 2330 | ||
| 2331 | const fn_ret_type = decl.ty.fnReturnType(); | |
| 2332 | const fn_ret_has_bits = fn_ret_type.hasCodeGenBits(); | |
| 2333 | if (fn_ret_has_bits) { | |
| 2334 | dbg_info_buffer.appendAssumeCapacity(abbrev_subprogram); | |
| 2335 | } else { | |
| 2336 | dbg_info_buffer.appendAssumeCapacity(abbrev_subprogram_retvoid); | |
| 2337 | } | |
| 2338 | // These get overwritten after generating the machine code. These values are | |
| 2339 | // "relocations" and have to be in this fixed place so that functions can be | |
| 2340 | // moved in virtual address space. | |
| 2341 | assert(dbg_info_low_pc_reloc_index == dbg_info_buffer.items.len); | |
| 2342 | dbg_info_buffer.items.len += ptr_width_bytes; // DW.AT_low_pc, DW.FORM_addr | |
| 2343 | assert(self.getRelocDbgInfoSubprogramHighPC() == dbg_info_buffer.items.len); | |
| 2344 | dbg_info_buffer.items.len += 4; // DW.AT_high_pc, DW.FORM_data4 | |
| 2345 | if (fn_ret_has_bits) { | |
| 2346 | const gop = try dbg_info_type_relocs.getOrPut(self.base.allocator, fn_ret_type); | |
| 2347 | if (!gop.found_existing) { | |
| 2348 | gop.value_ptr.* = .{ | |
| 2349 | .off = undefined, | |
| 2350 | .relocs = .{}, | |
| 2351 | }; | |
| 2352 | } | |
| 2353 | try gop.value_ptr.relocs.append(self.base.allocator, @intCast(u32, dbg_info_buffer.items.len)); | |
| 2354 | dbg_info_buffer.items.len += 4; // DW.AT_type, DW.FORM_ref4 | |
| 2355 | } | |
| 2356 | dbg_info_buffer.appendSliceAssumeCapacity(decl_name_with_null); // DW.AT_name, DW.FORM_string | |
| 2357 | ||
| 2358 | const res = try codegen.generateFunction(&self.base, decl.srcLoc(), func, air, liveness, &code_buffer, .{ | |
| 2359 | .dwarf = .{ | |
| 2360 | .dbg_line = &dbg_line_buffer, | |
| 2361 | .dbg_info = &dbg_info_buffer, | |
| 2362 | .dbg_info_type_relocs = &dbg_info_type_relocs, | |
| 2363 | }, | |
| 2364 | }); | |
| 2365 | const code = switch (res) { | |
| 2366 | .appended => code_buffer.items, | |
| 2367 | .fail => |em| { | |
| 2368 | decl.analysis = .codegen_failure; | |
| 2369 | try module.failed_decls.put(module.gpa, decl, em); | |
| 2370 | return; | |
| 2371 | }, | |
| 2372 | }; | |
| 2373 | ||
| 2374 | const local_sym = try self.updateDeclCode(decl, code, elf.STT_FUNC); | |
| 2375 | ||
| 2376 | const target_endian = self.base.options.target.cpu.arch.endian(); | |
| 2377 | ||
| 2378 | // Since the Decl is a function, we need to update the .debug_line program. | |
| 2379 | // Perform the relocations based on vaddr. | |
| 2380 | switch (self.ptr_width) { | |
| 2381 | .p32 => { | |
| 2382 | { | |
| 2383 | const ptr = dbg_line_buffer.items[dbg_line_vaddr_reloc_index..][0..4]; | |
| 2384 | mem.writeInt(u32, ptr, @intCast(u32, local_sym.st_value), target_endian); | |
| 2385 | } | |
| 2386 | { | |
| 2387 | const ptr = dbg_info_buffer.items[dbg_info_low_pc_reloc_index..][0..4]; | |
| 2388 | mem.writeInt(u32, ptr, @intCast(u32, local_sym.st_value), target_endian); | |
| 2389 | } | |
| 2390 | }, | |
| 2391 | .p64 => { | |
| 2392 | { | |
| 2393 | const ptr = dbg_line_buffer.items[dbg_line_vaddr_reloc_index..][0..8]; | |
| 2394 | mem.writeInt(u64, ptr, local_sym.st_value, target_endian); | |
| 2395 | } | |
| 2396 | { | |
| 2397 | const ptr = dbg_info_buffer.items[dbg_info_low_pc_reloc_index..][0..8]; | |
| 2398 | mem.writeInt(u64, ptr, local_sym.st_value, target_endian); | |
| 2399 | } | |
| 2400 | }, | |
| 2401 | } | |
| 2402 | { | |
| 2403 | const ptr = dbg_info_buffer.items[self.getRelocDbgInfoSubprogramHighPC()..][0..4]; | |
| 2404 | mem.writeInt(u32, ptr, @intCast(u32, local_sym.st_size), target_endian); | |
| 2405 | } | |
| 2406 | ||
| 2407 | try dbg_line_buffer.appendSlice(&[_]u8{ DW.LNS_extended_op, 1, DW.LNE_end_sequence }); | |
| 2408 | ||
| 2409 | // Now we have the full contents and may allocate a region to store it. | |
| 2410 | ||
| 2411 | // This logic is nearly identical to the logic below in `updateDeclDebugInfoAllocation` for | |
| 2412 | // `TextBlock` and the .debug_info. If you are editing this logic, you | |
| 2413 | // probably need to edit that logic too. | |
| 2414 | ||
| 2415 | const debug_line_sect = &self.sections.items[self.debug_line_section_index.?]; | |
| 2416 | const src_fn = &decl.fn_link.elf; | |
| 2417 | src_fn.len = @intCast(u32, dbg_line_buffer.items.len); | |
| 2418 | if (self.dbg_line_fn_last) |last| not_first: { | |
| 2419 | if (src_fn.next) |next| { | |
| 2420 | // Update existing function - non-last item. | |
| 2421 | if (src_fn.off + src_fn.len + min_nop_size > next.off) { | |
| 2422 | // It grew too big, so we move it to a new location. | |
| 2423 | if (src_fn.prev) |prev| { | |
| 2424 | self.dbg_line_fn_free_list.put(self.base.allocator, prev, {}) catch {}; | |
| 2425 | prev.next = src_fn.next; | |
| 2426 | } | |
| 2427 | assert(src_fn.prev != next); | |
| 2428 | next.prev = src_fn.prev; | |
| 2429 | src_fn.next = null; | |
| 2430 | // Populate where it used to be with NOPs. | |
| 2431 | const file_pos = debug_line_sect.sh_offset + src_fn.off; | |
| 2432 | try self.pwriteDbgLineNops(0, &[0]u8{}, src_fn.len, file_pos); | |
| 2433 | // TODO Look at the free list before appending at the end. | |
| 2434 | src_fn.prev = last; | |
| 2435 | last.next = src_fn; | |
| 2436 | self.dbg_line_fn_last = src_fn; | |
| 2437 | ||
| 2438 | src_fn.off = last.off + padToIdeal(last.len); | |
| 2439 | } | |
| 2440 | } else if (src_fn.prev == null) { | |
| 2441 | if (src_fn == last) { | |
| 2442 | // Special case: there is only 1 function and it is being updated. | |
| 2443 | // In this case there is nothing to do. The function's length has | |
| 2444 | // already been updated, and the logic below takes care of | |
| 2445 | // resizing the .debug_line section. | |
| 2446 | break :not_first; | |
| 2447 | } | |
| 2448 | // Append new function. | |
| 2449 | // TODO Look at the free list before appending at the end. | |
| 2450 | src_fn.prev = last; | |
| 2451 | last.next = src_fn; | |
| 2452 | self.dbg_line_fn_last = src_fn; | |
| 2453 | ||
| 2454 | src_fn.off = last.off + padToIdeal(last.len); | |
| 2455 | } | |
| 2456 | } else { | |
| 2457 | // This is the first function of the Line Number Program. | |
| 2458 | self.dbg_line_fn_first = src_fn; | |
| 2459 | self.dbg_line_fn_last = src_fn; | |
| 2460 | ||
| 2461 | src_fn.off = padToIdeal(self.dbgLineNeededHeaderBytes()); | |
| 2462 | } | |
| 2463 | ||
| 2464 | const last_src_fn = self.dbg_line_fn_last.?; | |
| 2465 | const needed_size = last_src_fn.off + last_src_fn.len; | |
| 2466 | if (needed_size != debug_line_sect.sh_size) { | |
| 2467 | if (needed_size > self.allocatedSize(debug_line_sect.sh_offset)) { | |
| 2468 | const new_offset = self.findFreeSpace(needed_size, 1); | |
| 2469 | const existing_size = last_src_fn.off; | |
| 2470 | log.debug("moving .debug_line section: {d} bytes from 0x{x} to 0x{x}", .{ | |
| 2471 | existing_size, | |
| 2472 | debug_line_sect.sh_offset, | |
| 2473 | new_offset, | |
| 2474 | }); | |
| 2475 | const amt = try self.base.file.?.copyRangeAll(debug_line_sect.sh_offset, self.base.file.?, new_offset, existing_size); | |
| 2476 | if (amt != existing_size) return error.InputOutput; | |
| 2477 | debug_line_sect.sh_offset = new_offset; | |
| 2478 | } | |
| 2479 | debug_line_sect.sh_size = needed_size; | |
| 2480 | self.shdr_table_dirty = true; // TODO look into making only the one section dirty | |
| 2481 | self.debug_line_header_dirty = true; | |
| 2482 | } | |
| 2483 | const prev_padding_size: u32 = if (src_fn.prev) |prev| src_fn.off - (prev.off + prev.len) else 0; | |
| 2484 | const next_padding_size: u32 = if (src_fn.next) |next| next.off - (src_fn.off + src_fn.len) else 0; | |
| 2485 | ||
| 2486 | // We only have support for one compilation unit so far, so the offsets are directly | |
| 2487 | // from the .debug_line section. | |
| 2488 | const file_pos = debug_line_sect.sh_offset + src_fn.off; | |
| 2489 | try self.pwriteDbgLineNops(prev_padding_size, dbg_line_buffer.items, next_padding_size, file_pos); | |
| 2490 | ||
| 2491 | // .debug_info - End the TAG_subprogram children. | |
| 2492 | try dbg_info_buffer.append(0); | |
| 2493 | ||
| 2494 | return self.finishUpdateDecl(module, decl, &dbg_info_type_relocs, &dbg_info_buffer); | |
| 2495 | } | |
| 2496 | ||
| 2497 | pub fn updateDecl(self: *Elf, module: *Module, decl: *Module.Decl) !void { | |
| 2498 | if (build_options.skip_non_native and builtin.object_format != .elf) { | |
| 2499 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 2500 | } | |
| 2501 | if (build_options.have_llvm) { | |
| 2502 | if (self.llvm_object) |llvm_object| return llvm_object.updateDecl(module, decl); | |
| 2503 | } | |
| 2504 | ||
| 2505 | const tracy = trace(@src()); | |
| 2506 | defer tracy.end(); | |
| 2507 | ||
| 2508 | if (decl.val.tag() == .extern_fn) { | |
| 2509 | return; // TODO Should we do more when front-end analyzed extern decl? | |
| 2510 | } | |
| 2511 | if (decl.val.castTag(.variable)) |payload| { | |
| 2512 | const variable = payload.data; | |
| 2513 | if (variable.is_extern) { | |
| 2514 | return; // TODO Should we do more when front-end analyzed extern decl? | |
| 2515 | } | |
| 2516 | } | |
| 2517 | ||
| 2518 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2519 | defer code_buffer.deinit(); | |
| 2520 | ||
| 2521 | var dbg_line_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2522 | defer dbg_line_buffer.deinit(); | |
| 2523 | ||
| 2524 | var dbg_info_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 2525 | defer dbg_info_buffer.deinit(); | |
| 2526 | ||
| 2527 | var dbg_info_type_relocs: File.DbgInfoTypeRelocsTable = .{}; | |
| 2528 | defer deinitRelocs(self.base.allocator, &dbg_info_type_relocs); | |
| 2529 | ||
| 2530 | // TODO implement .debug_info for global variables | |
| 2531 | const decl_val = if (decl.val.castTag(.variable)) |payload| payload.data.init else decl.val; | |
| 2532 | const res = try codegen.generateSymbol(&self.base, decl.srcLoc(), .{ | |
| 2533 | .ty = decl.ty, | |
| 2534 | .val = decl_val, | |
| 2535 | }, &code_buffer, .{ | |
| 2536 | .dwarf = .{ | |
| 2537 | .dbg_line = &dbg_line_buffer, | |
| 2538 | .dbg_info = &dbg_info_buffer, | |
| 2539 | .dbg_info_type_relocs = &dbg_info_type_relocs, | |
| 2540 | }, | |
| 2541 | }); | |
| 2542 | const code = switch (res) { | |
| 2543 | .externally_managed => |x| x, | |
| 2544 | .appended => code_buffer.items, | |
| 2545 | .fail => |em| { | |
| 2546 | decl.analysis = .codegen_failure; | |
| 2547 | try module.failed_decls.put(module.gpa, decl, em); | |
| 2548 | return; | |
| 2549 | }, | |
| 2550 | }; | |
| 2551 | ||
| 2552 | _ = try self.updateDeclCode(decl, code, elf.STT_OBJECT); | |
| 2553 | return self.finishUpdateDecl(module, decl, &dbg_info_type_relocs, &dbg_info_buffer); | |
| 2554 | } | |
| 2555 | ||
| 2498 | 2556 | /// Asserts the type has codegen bits. |
| 2499 | 2557 | fn addDbgInfoType(self: *Elf, ty: Type, dbg_info_buffer: *std.ArrayList(u8)) !void { |
| 2500 | 2558 | switch (ty.zigTypeTag()) { |
| ... | ... | @@ -3022,7 +3080,7 @@ fn pwriteDbgLineNops( |
| 3022 | 3080 | |
| 3023 | 3081 | const page_of_nops = [1]u8{DW.LNS_negate_stmt} ** 4096; |
| 3024 | 3082 | const three_byte_nop = [3]u8{ DW.LNS_advance_pc, 0b1000_0000, 0 }; |
| 3025 | var vecs: [256]std.os.iovec_const = undefined; | |
| 3083 | var vecs: [512]std.os.iovec_const = undefined; | |
| 3026 | 3084 | var vec_index: usize = 0; |
| 3027 | 3085 | { |
| 3028 | 3086 | var padding_left = prev_padding_size; |
src/link/MachO.zig+128-31
| ... | ... | @@ -2,6 +2,7 @@ const MachO = @This(); |
| 2 | 2 | |
| 3 | 3 | const std = @import("std"); |
| 4 | 4 | const build_options = @import("build_options"); |
| 5 | const builtin = @import("builtin"); | |
| 5 | 6 | const assert = std.debug.assert; |
| 6 | 7 | const fmt = std.fmt; |
| 7 | 8 | const fs = std.fs; |
| ... | ... | @@ -16,9 +17,11 @@ const bind = @import("MachO/bind.zig"); |
| 16 | 17 | const codegen = @import("../codegen.zig"); |
| 17 | 18 | const commands = @import("MachO/commands.zig"); |
| 18 | 19 | const link = @import("../link.zig"); |
| 20 | const llvm_backend = @import("../codegen/llvm.zig"); | |
| 19 | 21 | const target_util = @import("../target.zig"); |
| 20 | 22 | const trace = @import("../tracy.zig").trace; |
| 21 | 23 | |
| 24 | const Air = @import("../Air.zig"); | |
| 22 | 25 | const Allocator = mem.Allocator; |
| 23 | 26 | const Archive = @import("MachO/Archive.zig"); |
| 24 | 27 | const Cache = @import("../Cache.zig"); |
| ... | ... | @@ -27,6 +30,7 @@ const Compilation = @import("../Compilation.zig"); |
| 27 | 30 | const DebugSymbols = @import("MachO/DebugSymbols.zig"); |
| 28 | 31 | const Dylib = @import("MachO/Dylib.zig"); |
| 29 | 32 | const Object = @import("MachO/Object.zig"); |
| 33 | const Liveness = @import("../Liveness.zig"); | |
| 30 | 34 | const LoadCommand = commands.LoadCommand; |
| 31 | 35 | const Module = @import("../Module.zig"); |
| 32 | 36 | const File = link.File; |
| ... | ... | @@ -38,6 +42,9 @@ pub const base_tag: File.Tag = File.Tag.macho; |
| 38 | 42 | |
| 39 | 43 | base: File, |
| 40 | 44 | |
| 45 | /// If this is not null, an object file is created by LLVM and linked with LLD afterwards. | |
| 46 | llvm_object: ?*llvm_backend.Object = null, | |
| 47 | ||
| 41 | 48 | /// Debug symbols bundle (or dSym). |
| 42 | 49 | d_sym: ?DebugSymbols = null, |
| 43 | 50 | |
| ... | ... | @@ -319,7 +326,13 @@ pub const SrcFn = struct { |
| 319 | 326 | pub fn openPath(allocator: *Allocator, sub_path: []const u8, options: link.Options) !*MachO { |
| 320 | 327 | assert(options.object_format == .macho); |
| 321 | 328 | |
| 322 | if (options.use_llvm) return error.LLVM_BackendIsTODO_ForMachO; // TODO | |
| 329 | if (build_options.have_llvm and options.use_llvm) { | |
| 330 | const self = try createEmpty(allocator, options); | |
| 331 | errdefer self.base.destroy(); | |
| 332 | ||
| 333 | self.llvm_object = try llvm_backend.Object.create(allocator, sub_path, options); | |
| 334 | return self; | |
| 335 | } | |
| 323 | 336 | |
| 324 | 337 | const file = try options.emit.?.directory.handle.createFile(sub_path, .{ |
| 325 | 338 | .truncate = false, |
| ... | ... | @@ -3468,7 +3481,88 @@ pub fn allocateDeclIndexes(self: *MachO, decl: *Module.Decl) !void { |
| 3468 | 3481 | try self.got_entries_map.putNoClobber(self.base.allocator, got_entry, got_index); |
| 3469 | 3482 | } |
| 3470 | 3483 | |
| 3484 | pub fn updateFunc(self: *MachO, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 3485 | if (build_options.skip_non_native and builtin.object_format != .macho) { | |
| 3486 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 3487 | } | |
| 3488 | if (build_options.have_llvm) { | |
| 3489 | if (self.llvm_object) |llvm_object| return llvm_object.updateFunc(module, func, air, liveness); | |
| 3490 | } | |
| 3491 | const tracy = trace(@src()); | |
| 3492 | defer tracy.end(); | |
| 3493 | ||
| 3494 | const decl = func.owner_decl; | |
| 3495 | ||
| 3496 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 3497 | defer code_buffer.deinit(); | |
| 3498 | ||
| 3499 | var debug_buffers_buf: DebugSymbols.DeclDebugBuffers = undefined; | |
| 3500 | const debug_buffers = if (self.d_sym) |*ds| blk: { | |
| 3501 | debug_buffers_buf = try ds.initDeclDebugBuffers(self.base.allocator, module, decl); | |
| 3502 | break :blk &debug_buffers_buf; | |
| 3503 | } else null; | |
| 3504 | defer { | |
| 3505 | if (debug_buffers) |dbg| { | |
| 3506 | dbg.dbg_line_buffer.deinit(); | |
| 3507 | dbg.dbg_info_buffer.deinit(); | |
| 3508 | var it = dbg.dbg_info_type_relocs.valueIterator(); | |
| 3509 | while (it.next()) |value| { | |
| 3510 | value.relocs.deinit(self.base.allocator); | |
| 3511 | } | |
| 3512 | dbg.dbg_info_type_relocs.deinit(self.base.allocator); | |
| 3513 | } | |
| 3514 | } | |
| 3515 | ||
| 3516 | self.active_decl = decl; | |
| 3517 | ||
| 3518 | const res = if (debug_buffers) |dbg| | |
| 3519 | try codegen.generateFunction(&self.base, decl.srcLoc(), func, air, liveness, &code_buffer, .{ | |
| 3520 | .dwarf = .{ | |
| 3521 | .dbg_line = &dbg.dbg_line_buffer, | |
| 3522 | .dbg_info = &dbg.dbg_info_buffer, | |
| 3523 | .dbg_info_type_relocs = &dbg.dbg_info_type_relocs, | |
| 3524 | }, | |
| 3525 | }) | |
| 3526 | else | |
| 3527 | try codegen.generateFunction(&self.base, decl.srcLoc(), func, air, liveness, &code_buffer, .none); | |
| 3528 | switch (res) { | |
| 3529 | .appended => { | |
| 3530 | decl.link.macho.code = code_buffer.toOwnedSlice(); | |
| 3531 | }, | |
| 3532 | .fail => |em| { | |
| 3533 | decl.analysis = .codegen_failure; | |
| 3534 | try module.failed_decls.put(module.gpa, decl, em); | |
| 3535 | return; | |
| 3536 | }, | |
| 3537 | } | |
| 3538 | ||
| 3539 | const symbol = try self.placeDecl(decl, decl.link.macho.code.len); | |
| 3540 | ||
| 3541 | try self.writeCode(symbol, decl.link.macho.code); | |
| 3542 | ||
| 3543 | if (debug_buffers) |db| { | |
| 3544 | try self.d_sym.?.commitDeclDebugInfo( | |
| 3545 | self.base.allocator, | |
| 3546 | module, | |
| 3547 | decl, | |
| 3548 | db, | |
| 3549 | self.base.options.target, | |
| 3550 | ); | |
| 3551 | } | |
| 3552 | ||
| 3553 | // Since we updated the vaddr and the size, each corresponding export symbol also | |
| 3554 | // needs to be updated. | |
| 3555 | const decl_exports = module.decl_exports.get(decl) orelse &[0]*Module.Export{}; | |
| 3556 | try self.updateDeclExports(module, decl, decl_exports); | |
| 3557 | } | |
| 3558 | ||
| 3471 | 3559 | pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3560 | if (build_options.skip_non_native and builtin.object_format != .macho) { | |
| 3561 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 3562 | } | |
| 3563 | if (build_options.have_llvm) { | |
| 3564 | if (self.llvm_object) |llvm_object| return llvm_object.updateDecl(module, decl); | |
| 3565 | } | |
| 3472 | 3566 | const tracy = trace(@src()); |
| 3473 | 3567 | defer tracy.end(); |
| 3474 | 3568 | |
| ... | ... | @@ -3479,9 +3573,13 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3479 | 3573 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); |
| 3480 | 3574 | defer code_buffer.deinit(); |
| 3481 | 3575 | |
| 3482 | var debug_buffers = if (self.d_sym) |*ds| try ds.initDeclDebugBuffers(self.base.allocator, module, decl) else null; | |
| 3576 | var debug_buffers_buf: DebugSymbols.DeclDebugBuffers = undefined; | |
| 3577 | const debug_buffers = if (self.d_sym) |*ds| blk: { | |
| 3578 | debug_buffers_buf = try ds.initDeclDebugBuffers(self.base.allocator, module, decl); | |
| 3579 | break :blk &debug_buffers_buf; | |
| 3580 | } else null; | |
| 3483 | 3581 | defer { |
| 3484 | if (debug_buffers) |*dbg| { | |
| 3582 | if (debug_buffers) |dbg| { | |
| 3485 | 3583 | dbg.dbg_line_buffer.deinit(); |
| 3486 | 3584 | dbg.dbg_info_buffer.deinit(); |
| 3487 | 3585 | var it = dbg.dbg_info_type_relocs.valueIterator(); |
| ... | ... | @@ -3494,7 +3592,7 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3494 | 3592 | |
| 3495 | 3593 | self.active_decl = decl; |
| 3496 | 3594 | |
| 3497 | const res = if (debug_buffers) |*dbg| | |
| 3595 | const res = if (debug_buffers) |dbg| | |
| 3498 | 3596 | try codegen.generateSymbol(&self.base, decl.srcLoc(), .{ |
| 3499 | 3597 | .ty = decl.ty, |
| 3500 | 3598 | .val = decl.val, |
| ... | ... | @@ -3525,16 +3623,26 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3525 | 3623 | }, |
| 3526 | 3624 | } |
| 3527 | 3625 | }; |
| 3626 | const symbol = try self.placeDecl(decl, code.len); | |
| 3627 | ||
| 3628 | try self.writeCode(symbol, code); | |
| 3528 | 3629 | |
| 3630 | // Since we updated the vaddr and the size, each corresponding export symbol also | |
| 3631 | // needs to be updated. | |
| 3632 | const decl_exports = module.decl_exports.get(decl) orelse &[0]*Module.Export{}; | |
| 3633 | try self.updateDeclExports(module, decl, decl_exports); | |
| 3634 | } | |
| 3635 | ||
| 3636 | fn placeDecl(self: *MachO, decl: *Module.Decl, code_len: usize) !*macho.nlist_64 { | |
| 3529 | 3637 | const required_alignment = decl.ty.abiAlignment(self.base.options.target); |
| 3530 | 3638 | assert(decl.link.macho.local_sym_index != 0); // Caller forgot to call allocateDeclIndexes() |
| 3531 | 3639 | const symbol = &self.locals.items[decl.link.macho.local_sym_index]; |
| 3532 | 3640 | |
| 3533 | 3641 | if (decl.link.macho.size != 0) { |
| 3534 | 3642 | const capacity = decl.link.macho.capacity(self.*); |
| 3535 | const need_realloc = code.len > capacity or !mem.isAlignedGeneric(u64, symbol.n_value, required_alignment); | |
| 3643 | const need_realloc = code_len > capacity or !mem.isAlignedGeneric(u64, symbol.n_value, required_alignment); | |
| 3536 | 3644 | if (need_realloc) { |
| 3537 | const vaddr = try self.growTextBlock(&decl.link.macho, code.len, required_alignment); | |
| 3645 | const vaddr = try self.growTextBlock(&decl.link.macho, code_len, required_alignment); | |
| 3538 | 3646 | |
| 3539 | 3647 | log.debug("growing {s} and moving from 0x{x} to 0x{x}", .{ decl.name, symbol.n_value, vaddr }); |
| 3540 | 3648 | |
| ... | ... | @@ -3548,10 +3656,10 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3548 | 3656 | } |
| 3549 | 3657 | |
| 3550 | 3658 | symbol.n_value = vaddr; |
| 3551 | } else if (code.len < decl.link.macho.size) { | |
| 3552 | self.shrinkTextBlock(&decl.link.macho, code.len); | |
| 3659 | } else if (code_len < decl.link.macho.size) { | |
| 3660 | self.shrinkTextBlock(&decl.link.macho, code_len); | |
| 3553 | 3661 | } |
| 3554 | decl.link.macho.size = code.len; | |
| 3662 | decl.link.macho.size = code_len; | |
| 3555 | 3663 | |
| 3556 | 3664 | const new_name = try std.fmt.allocPrint(self.base.allocator, "_{s}", .{mem.spanZ(decl.name)}); |
| 3557 | 3665 | defer self.base.allocator.free(new_name); |
| ... | ... | @@ -3569,7 +3677,7 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3569 | 3677 | defer self.base.allocator.free(decl_name); |
| 3570 | 3678 | |
| 3571 | 3679 | const name_str_index = try self.makeString(decl_name); |
| 3572 | const addr = try self.allocateTextBlock(&decl.link.macho, code.len, required_alignment); | |
| 3680 | const addr = try self.allocateTextBlock(&decl.link.macho, code_len, required_alignment); | |
| 3573 | 3681 | |
| 3574 | 3682 | log.debug("allocated text block for {s} at 0x{x}", .{ decl_name, addr }); |
| 3575 | 3683 | |
| ... | ... | @@ -3582,17 +3690,15 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3582 | 3690 | .n_desc = 0, |
| 3583 | 3691 | .n_value = addr, |
| 3584 | 3692 | }; |
| 3585 | ||
| 3586 | try self.writeLocalSymbol(decl.link.macho.local_sym_index); | |
| 3587 | ||
| 3588 | if (self.d_sym) |*ds| | |
| 3589 | try ds.writeLocalSymbol(decl.link.macho.local_sym_index); | |
| 3590 | ||
| 3591 | 3693 | const got_index = self.got_entries_map.get(.{ |
| 3592 | 3694 | .where = .local, |
| 3593 | 3695 | .where_index = decl.link.macho.local_sym_index, |
| 3594 | 3696 | }) orelse unreachable; |
| 3595 | 3697 | try self.writeGotEntry(got_index); |
| 3698 | ||
| 3699 | try self.writeLocalSymbol(decl.link.macho.local_sym_index); | |
| 3700 | if (self.d_sym) |*ds| | |
| 3701 | try ds.writeLocalSymbol(decl.link.macho.local_sym_index); | |
| 3596 | 3702 | } |
| 3597 | 3703 | |
| 3598 | 3704 | // Resolve relocations |
| ... | ... | @@ -3615,25 +3721,16 @@ pub fn updateDecl(self: *MachO, module: *Module, decl: *Module.Decl) !void { |
| 3615 | 3721 | } |
| 3616 | 3722 | } |
| 3617 | 3723 | |
| 3618 | const text_segment = self.load_commands.items[self.text_segment_cmd_index.?].Segment; | |
| 3724 | return symbol; | |
| 3725 | } | |
| 3726 | ||
| 3727 | fn writeCode(self: *MachO, symbol: *macho.nlist_64, code: []const u8) !void { | |
| 3728 | const text_segment = &self.load_commands.items[self.text_segment_cmd_index.?].Segment; | |
| 3619 | 3729 | const text_section = text_segment.sections.items[self.text_section_index.?]; |
| 3620 | 3730 | const section_offset = symbol.n_value - text_section.addr; |
| 3621 | 3731 | const file_offset = text_section.offset + section_offset; |
| 3732 | log.debug("writing code for symbol {s} at file offset 0x{x}", .{ self.getString(symbol.n_strx), file_offset }); | |
| 3622 | 3733 | try self.base.file.?.pwriteAll(code, file_offset); |
| 3623 | ||
| 3624 | if (debug_buffers) |*db| { | |
| 3625 | try self.d_sym.?.commitDeclDebugInfo( | |
| 3626 | self.base.allocator, | |
| 3627 | module, | |
| 3628 | decl, | |
| 3629 | db, | |
| 3630 | self.base.options.target, | |
| 3631 | ); | |
| 3632 | } | |
| 3633 | ||
| 3634 | // Since we updated the vaddr and the size, each corresponding export symbol also needs to be updated. | |
| 3635 | const decl_exports = module.decl_exports.get(decl) orelse &[0]*Module.Export{}; | |
| 3636 | try self.updateDeclExports(module, decl, decl_exports); | |
| 3637 | 3734 | } |
| 3638 | 3735 | |
| 3639 | 3736 | pub fn updateDeclLineNumber(self: *MachO, module: *Module, decl: *const Module.Decl) !void { |
src/link/Plan9.zig+230-155
| ... | ... | @@ -2,18 +2,21 @@ |
| 2 | 2 | //! would be to add incremental linking in a similar way as ELF does. |
| 3 | 3 | |
| 4 | 4 | const Plan9 = @This(); |
| 5 | ||
| 6 | const std = @import("std"); | |
| 7 | 5 | const link = @import("../link.zig"); |
| 8 | 6 | const Module = @import("../Module.zig"); |
| 9 | 7 | const Compilation = @import("../Compilation.zig"); |
| 10 | 8 | const aout = @import("Plan9/aout.zig"); |
| 11 | 9 | const codegen = @import("../codegen.zig"); |
| 12 | 10 | const trace = @import("../tracy.zig").trace; |
| 13 | const mem = std.mem; | |
| 14 | 11 | const File = link.File; |
| 15 | const Allocator = std.mem.Allocator; | |
| 12 | const build_options = @import("build_options"); | |
| 13 | const Air = @import("../Air.zig"); | |
| 14 | const Liveness = @import("../Liveness.zig"); | |
| 16 | 15 | |
| 16 | const std = @import("std"); | |
| 17 | const builtin = @import("builtin"); | |
| 18 | const mem = std.mem; | |
| 19 | const Allocator = std.mem.Allocator; | |
| 17 | 20 | const log = std.log.scoped(.link); |
| 18 | 21 | const assert = std.debug.assert; |
| 19 | 22 | |
| ... | ... | @@ -22,20 +25,22 @@ sixtyfour_bit: bool, |
| 22 | 25 | error_flags: File.ErrorFlags = File.ErrorFlags{}, |
| 23 | 26 | bases: Bases, |
| 24 | 27 | |
| 25 | decl_table: std.AutoArrayHashMapUnmanaged(*Module.Decl, void) = .{}, | |
| 26 | /// is just casted down when 32 bit | |
| 28 | /// A symbol's value is just casted down when compiling | |
| 29 | /// for a 32 bit target. | |
| 27 | 30 | syms: std.ArrayListUnmanaged(aout.Sym) = .{}, |
| 28 | text_buf: std.ArrayListUnmanaged(u8) = .{}, | |
| 29 | data_buf: std.ArrayListUnmanaged(u8) = .{}, | |
| 31 | ||
| 32 | fn_decl_table: std.AutoArrayHashMapUnmanaged(*Module.Decl, []const u8) = .{}, | |
| 33 | data_decl_table: std.AutoArrayHashMapUnmanaged(*Module.Decl, []const u8) = .{}, | |
| 30 | 34 | |
| 31 | 35 | hdr: aout.ExecHdr = undefined, |
| 32 | 36 | |
| 33 | entry_decl: ?*Module.Decl = null, | |
| 37 | entry_val: ?u64 = null, | |
| 38 | ||
| 39 | got_len: u64 = 0, | |
| 34 | 40 | |
| 35 | got: std.ArrayListUnmanaged(u64) = .{}, | |
| 36 | 41 | const Bases = struct { |
| 37 | 42 | text: u64, |
| 38 | /// the addr of the got | |
| 43 | /// the Global Offset Table starts at the beginning of the data section | |
| 39 | 44 | data: u64, |
| 40 | 45 | }; |
| 41 | 46 | |
| ... | ... | @@ -46,14 +51,6 @@ fn getAddr(self: Plan9, addr: u64, t: aout.Sym.Type) u64 { |
| 46 | 51 | else => unreachable, |
| 47 | 52 | }; |
| 48 | 53 | } |
| 49 | /// opposite of getAddr | |
| 50 | fn takeAddr(self: Plan9, addr: u64, t: aout.Sym.Type) u64 { | |
| 51 | return addr - switch (t) { | |
| 52 | .T, .t, .l, .L => self.bases.text, | |
| 53 | .D, .d, .B, .b => self.bases.data, | |
| 54 | else => unreachable, | |
| 55 | }; | |
| 56 | } | |
| 57 | 54 | |
| 58 | 55 | fn getSymAddr(self: Plan9, s: aout.Sym) u64 { |
| 59 | 56 | return self.getAddr(s.value, s.type); |
| ... | ... | @@ -120,9 +117,84 @@ pub fn createEmpty(gpa: *Allocator, options: link.Options) !*Plan9 { |
| 120 | 117 | return self; |
| 121 | 118 | } |
| 122 | 119 | |
| 120 | pub fn updateFunc(self: *Plan9, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 121 | if (build_options.skip_non_native and builtin.object_format != .plan9) { | |
| 122 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 123 | } | |
| 124 | ||
| 125 | const decl = func.owner_decl; | |
| 126 | log.debug("codegen decl {*} ({s})", .{ decl, decl.name }); | |
| 127 | ||
| 128 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 129 | defer code_buffer.deinit(); | |
| 130 | const res = try codegen.generateFunction(&self.base, decl.srcLoc(), func, air, liveness, &code_buffer, .{ .none = .{} }); | |
| 131 | const code = switch (res) { | |
| 132 | .appended => code_buffer.toOwnedSlice(), | |
| 133 | .fail => |em| { | |
| 134 | decl.analysis = .codegen_failure; | |
| 135 | try module.failed_decls.put(module.gpa, decl, em); | |
| 136 | return; | |
| 137 | }, | |
| 138 | }; | |
| 139 | try self.fn_decl_table.put(self.base.allocator, decl, code); | |
| 140 | return self.updateFinish(decl); | |
| 141 | } | |
| 142 | ||
| 123 | 143 | pub fn updateDecl(self: *Plan9, module: *Module, decl: *Module.Decl) !void { |
| 124 | _ = module; | |
| 125 | _ = try self.decl_table.getOrPut(self.base.allocator, decl); | |
| 144 | if (decl.val.tag() == .extern_fn) { | |
| 145 | return; // TODO Should we do more when front-end analyzed extern decl? | |
| 146 | } | |
| 147 | if (decl.val.castTag(.variable)) |payload| { | |
| 148 | const variable = payload.data; | |
| 149 | if (variable.is_extern) { | |
| 150 | return; // TODO Should we do more when front-end analyzed extern decl? | |
| 151 | } | |
| 152 | } | |
| 153 | ||
| 154 | log.debug("codegen decl {*} ({s})", .{ decl, decl.name }); | |
| 155 | ||
| 156 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 157 | defer code_buffer.deinit(); | |
| 158 | const decl_val = if (decl.val.castTag(.variable)) |payload| payload.data.init else decl.val; | |
| 159 | const res = try codegen.generateSymbol(&self.base, decl.srcLoc(), .{ | |
| 160 | .ty = decl.ty, | |
| 161 | .val = decl_val, | |
| 162 | }, &code_buffer, .{ .none = .{} }); | |
| 163 | const code = switch (res) { | |
| 164 | .externally_managed => |x| x, | |
| 165 | .appended => code_buffer.items, | |
| 166 | .fail => |em| { | |
| 167 | decl.analysis = .codegen_failure; | |
| 168 | try module.failed_decls.put(module.gpa, decl, em); | |
| 169 | return; | |
| 170 | }, | |
| 171 | }; | |
| 172 | var duped_code = try std.mem.dupe(self.base.allocator, u8, code); | |
| 173 | errdefer self.base.allocator.free(duped_code); | |
| 174 | try self.data_decl_table.put(self.base.allocator, decl, duped_code); | |
| 175 | return self.updateFinish(decl); | |
| 176 | } | |
| 177 | /// called at the end of update{Decl,Func} | |
| 178 | fn updateFinish(self: *Plan9, decl: *Module.Decl) !void { | |
| 179 | const is_fn = (decl.ty.zigTypeTag() == .Fn); | |
| 180 | log.debug("update the symbol table and got for decl {*} ({s})", .{ decl, decl.name }); | |
| 181 | const sym_t: aout.Sym.Type = if (is_fn) .t else .d; | |
| 182 | // write the internal linker metadata | |
| 183 | decl.link.plan9.type = sym_t; | |
| 184 | // write the symbol | |
| 185 | // we already have the got index because that got allocated in allocateDeclIndexes | |
| 186 | const sym: aout.Sym = .{ | |
| 187 | .value = undefined, // the value of stuff gets filled in in flushModule | |
| 188 | .type = decl.link.plan9.type, | |
| 189 | .name = mem.span(decl.name), | |
| 190 | }; | |
| 191 | ||
| 192 | if (decl.link.plan9.sym_index) |s| { | |
| 193 | self.syms.items[s] = sym; | |
| 194 | } else { | |
| 195 | try self.syms.append(self.base.allocator, sym); | |
| 196 | decl.link.plan9.sym_index = self.syms.items.len - 1; | |
| 197 | } | |
| 126 | 198 | } |
| 127 | 199 | |
| 128 | 200 | pub fn flush(self: *Plan9, comp: *Compilation) !void { |
| ... | ... | @@ -138,6 +210,10 @@ pub fn flush(self: *Plan9, comp: *Compilation) !void { |
| 138 | 210 | } |
| 139 | 211 | |
| 140 | 212 | pub fn flushModule(self: *Plan9, comp: *Compilation) !void { |
| 213 | if (build_options.skip_non_native and builtin.object_format != .plan9) { | |
| 214 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 215 | } | |
| 216 | ||
| 141 | 217 | _ = comp; |
| 142 | 218 | const tracy = trace(@src()); |
| 143 | 219 | defer tracy.end(); |
| ... | ... | @@ -146,160 +222,147 @@ pub fn flushModule(self: *Plan9, comp: *Compilation) !void { |
| 146 | 222 | |
| 147 | 223 | defer assert(self.hdr.entry != 0x0); |
| 148 | 224 | |
| 149 | const module = self.base.options.module orelse return error.LinkingWithoutZigSourceUnimplemented; | |
| 225 | const mod = self.base.options.module orelse return error.LinkingWithoutZigSourceUnimplemented; | |
| 150 | 226 | |
| 151 | self.text_buf.items.len = 0; | |
| 152 | self.data_buf.items.len = 0; | |
| 153 | // ensure space to write the got later | |
| 154 | assert(self.got.items.len == self.decl_table.count()); | |
| 155 | try self.data_buf.appendNTimes(self.base.allocator, 0x69, self.got.items.len * if (!self.sixtyfour_bit) @as(u32, 4) else 8); | |
| 156 | // temporary buffer | |
| 157 | var code_buffer = std.ArrayList(u8).init(self.base.allocator); | |
| 158 | defer code_buffer.deinit(); | |
| 159 | { | |
| 160 | for (self.decl_table.keys()) |decl| { | |
| 161 | if (!decl.has_tv) continue; | |
| 162 | const is_fn = (decl.ty.zigTypeTag() == .Fn); | |
| 163 | ||
| 164 | log.debug("update the symbol table and got for decl {*} ({s})", .{ decl, decl.name }); | |
| 165 | decl.link.plan9 = if (is_fn) .{ | |
| 166 | .offset = self.getAddr(self.text_buf.items.len, .t), | |
| 167 | .type = .t, | |
| 168 | .sym_index = decl.link.plan9.sym_index, | |
| 169 | .got_index = decl.link.plan9.got_index, | |
| 170 | } else .{ | |
| 171 | .offset = self.getAddr(self.data_buf.items.len, .d), | |
| 172 | .type = .d, | |
| 173 | .sym_index = decl.link.plan9.sym_index, | |
| 174 | .got_index = decl.link.plan9.got_index, | |
| 175 | }; | |
| 176 | self.got.items[decl.link.plan9.got_index.?] = decl.link.plan9.offset.?; | |
| 177 | if (decl.link.plan9.sym_index) |s| { | |
| 178 | self.syms.items[s] = .{ | |
| 179 | .value = decl.link.plan9.offset.?, | |
| 180 | .type = decl.link.plan9.type, | |
| 181 | .name = mem.span(decl.name), | |
| 182 | }; | |
| 183 | } else { | |
| 184 | try self.syms.append(self.base.allocator, .{ | |
| 185 | .value = decl.link.plan9.offset.?, | |
| 186 | .type = decl.link.plan9.type, | |
| 187 | .name = mem.span(decl.name), | |
| 188 | }); | |
| 189 | decl.link.plan9.sym_index = self.syms.items.len - 1; | |
| 190 | } | |
| 227 | assert(self.got_len == self.fn_decl_table.count() + self.data_decl_table.count()); | |
| 228 | const got_size = self.got_len * if (!self.sixtyfour_bit) @as(u32, 4) else 8; | |
| 229 | var got_table = try self.base.allocator.alloc(u8, got_size); | |
| 230 | defer self.base.allocator.free(got_table); | |
| 191 | 231 | |
| 192 | if (module.decl_exports.get(decl)) |exports| { | |
| 193 | for (exports) |exp| { | |
| 194 | // plan9 does not support custom sections | |
| 195 | if (exp.options.section) |section_name| { | |
| 196 | if (!mem.eql(u8, section_name, ".text") or !mem.eql(u8, section_name, ".data")) { | |
| 197 | try module.failed_exports.put(module.gpa, exp, try Module.ErrorMsg.create(self.base.allocator, decl.srcLoc(), "plan9 does not support extra sections", .{})); | |
| 198 | break; | |
| 199 | } | |
| 200 | } | |
| 201 | if (std.mem.eql(u8, exp.options.name, "_start")) { | |
| 202 | std.debug.assert(decl.link.plan9.type == .t); // we tried to link a non-function as the entry | |
| 203 | self.entry_decl = decl; | |
| 204 | } | |
| 205 | if (exp.link.plan9) |i| { | |
| 206 | self.syms.items[i] = .{ | |
| 207 | .value = decl.link.plan9.offset.?, | |
| 208 | .type = decl.link.plan9.type.toGlobal(), | |
| 209 | .name = exp.options.name, | |
| 210 | }; | |
| 211 | } else { | |
| 212 | try self.syms.append(self.base.allocator, .{ | |
| 213 | .value = decl.link.plan9.offset.?, | |
| 214 | .type = decl.link.plan9.type.toGlobal(), | |
| 215 | .name = exp.options.name, | |
| 216 | }); | |
| 217 | exp.link.plan9 = self.syms.items.len - 1; | |
| 218 | } | |
| 219 | } | |
| 220 | } | |
| 232 | // + 2 for header, got, symbols | |
| 233 | var iovecs = try self.base.allocator.alloc(std.os.iovec_const, self.fn_decl_table.count() + self.data_decl_table.count() + 3); | |
| 234 | defer self.base.allocator.free(iovecs); | |
| 221 | 235 | |
| 222 | log.debug("codegen decl {*} ({s})", .{ decl, decl.name }); | |
| 223 | const res = try codegen.generateSymbol(&self.base, decl.srcLoc(), .{ | |
| 224 | .ty = decl.ty, | |
| 225 | .val = decl.val, | |
| 226 | }, &code_buffer, .{ .none = {} }); | |
| 227 | const code = switch (res) { | |
| 228 | .externally_managed => |x| x, | |
| 229 | .appended => code_buffer.items, | |
| 230 | .fail => |em| { | |
| 231 | decl.analysis = .codegen_failure; | |
| 232 | try module.failed_decls.put(module.gpa, decl, em); | |
| 233 | // TODO try to do more decls | |
| 234 | return; | |
| 235 | }, | |
| 236 | }; | |
| 237 | if (is_fn) { | |
| 238 | try self.text_buf.appendSlice(self.base.allocator, code); | |
| 239 | code_buffer.items.len = 0; | |
| 236 | const file = self.base.file.?; | |
| 237 | ||
| 238 | var hdr_buf: [40]u8 = undefined; | |
| 239 | // account for the fat header | |
| 240 | const hdr_size = if (self.sixtyfour_bit) @as(usize, 40) else 32; | |
| 241 | const hdr_slice: []u8 = hdr_buf[0..hdr_size]; | |
| 242 | var foff = hdr_size; | |
| 243 | iovecs[0] = .{ .iov_base = hdr_slice.ptr, .iov_len = hdr_slice.len }; | |
| 244 | var iovecs_i: u64 = 1; | |
| 245 | var text_i: u64 = 0; | |
| 246 | // text | |
| 247 | { | |
| 248 | var it = self.fn_decl_table.iterator(); | |
| 249 | while (it.next()) |entry| { | |
| 250 | const decl = entry.key_ptr.*; | |
| 251 | const code = entry.value_ptr.*; | |
| 252 | log.debug("write text decl {*} ({s})", .{ decl, decl.name }); | |
| 253 | foff += code.len; | |
| 254 | iovecs[iovecs_i] = .{ .iov_base = code.ptr, .iov_len = code.len }; | |
| 255 | iovecs_i += 1; | |
| 256 | const off = self.getAddr(text_i, .t); | |
| 257 | text_i += code.len; | |
| 258 | decl.link.plan9.offset = off; | |
| 259 | if (!self.sixtyfour_bit) { | |
| 260 | mem.writeIntNative(u32, got_table[decl.link.plan9.got_index.? * 4 ..][0..4], @intCast(u32, off)); | |
| 261 | mem.writeInt(u32, got_table[decl.link.plan9.got_index.? * 4 ..][0..4], @intCast(u32, off), self.base.options.target.cpu.arch.endian()); | |
| 240 | 262 | } else { |
| 241 | try self.data_buf.appendSlice(self.base.allocator, code); | |
| 242 | code_buffer.items.len = 0; | |
| 263 | mem.writeInt(u64, got_table[decl.link.plan9.got_index.? * 8 ..][0..8], off, self.base.options.target.cpu.arch.endian()); | |
| 264 | } | |
| 265 | self.syms.items[decl.link.plan9.sym_index.?].value = off; | |
| 266 | if (mod.decl_exports.get(decl)) |exports| { | |
| 267 | try self.addDeclExports(mod, decl, exports); | |
| 243 | 268 | } |
| 244 | 269 | } |
| 270 | // etext symbol | |
| 271 | self.syms.items[2].value = self.getAddr(text_i, .t); | |
| 245 | 272 | } |
| 246 | ||
| 247 | // write the got | |
| 248 | if (!self.sixtyfour_bit) { | |
| 249 | for (self.got.items) |p, i| { | |
| 250 | mem.writeInt(u32, self.data_buf.items[i * 4 ..][0..4], @intCast(u32, p), self.base.options.target.cpu.arch.endian()); | |
| 251 | } | |
| 252 | } else { | |
| 253 | for (self.got.items) |p, i| { | |
| 254 | mem.writeInt(u64, self.data_buf.items[i * 8 ..][0..8], p, self.base.options.target.cpu.arch.endian()); | |
| 273 | // global offset table is in data | |
| 274 | iovecs[iovecs_i] = .{ .iov_base = got_table.ptr, .iov_len = got_table.len }; | |
| 275 | iovecs_i += 1; | |
| 276 | // data | |
| 277 | var data_i: u64 = got_size; | |
| 278 | { | |
| 279 | var it = self.data_decl_table.iterator(); | |
| 280 | while (it.next()) |entry| { | |
| 281 | const decl = entry.key_ptr.*; | |
| 282 | const code = entry.value_ptr.*; | |
| 283 | log.debug("write data decl {*} ({s})", .{ decl, decl.name }); | |
| 284 | ||
| 285 | foff += code.len; | |
| 286 | iovecs[iovecs_i] = .{ .iov_base = code.ptr, .iov_len = code.len }; | |
| 287 | iovecs_i += 1; | |
| 288 | const off = self.getAddr(data_i, .d); | |
| 289 | data_i += code.len; | |
| 290 | decl.link.plan9.offset = off; | |
| 291 | if (!self.sixtyfour_bit) { | |
| 292 | mem.writeInt(u32, got_table[decl.link.plan9.got_index.? * 4 ..][0..4], @intCast(u32, off), self.base.options.target.cpu.arch.endian()); | |
| 293 | } else { | |
| 294 | mem.writeInt(u64, got_table[decl.link.plan9.got_index.? * 8 ..][0..8], off, self.base.options.target.cpu.arch.endian()); | |
| 295 | } | |
| 296 | self.syms.items[decl.link.plan9.sym_index.?].value = off; | |
| 297 | if (mod.decl_exports.get(decl)) |exports| { | |
| 298 | try self.addDeclExports(mod, decl, exports); | |
| 299 | } | |
| 255 | 300 | } |
| 301 | // edata symbol | |
| 302 | self.syms.items[0].value = self.getAddr(data_i, .b); | |
| 256 | 303 | } |
| 257 | ||
| 258 | self.hdr.entry = @truncate(u32, self.entry_decl.?.link.plan9.offset.?); | |
| 259 | ||
| 260 | // edata, end, etext | |
| 261 | self.syms.items[0].value = self.getAddr(0x0, .b); | |
| 304 | // edata | |
| 262 | 305 | self.syms.items[1].value = self.getAddr(0x0, .b); |
| 263 | self.syms.items[2].value = self.getAddr(self.text_buf.items.len, .t); | |
| 264 | ||
| 265 | 306 | var sym_buf = std.ArrayList(u8).init(self.base.allocator); |
| 266 | 307 | defer sym_buf.deinit(); |
| 267 | 308 | try self.writeSyms(&sym_buf); |
| 268 | ||
| 309 | assert(2 + self.fn_decl_table.count() + self.data_decl_table.count() == iovecs_i); // we didn't write all the decls | |
| 310 | iovecs[iovecs_i] = .{ .iov_base = sym_buf.items.ptr, .iov_len = sym_buf.items.len }; | |
| 311 | iovecs_i += 1; | |
| 269 | 312 | // generate the header |
| 270 | 313 | self.hdr = .{ |
| 271 | 314 | .magic = try aout.magicFromArch(self.base.options.target.cpu.arch), |
| 272 | .text = @intCast(u32, self.text_buf.items.len), | |
| 273 | .data = @intCast(u32, self.data_buf.items.len), | |
| 315 | .text = @intCast(u32, text_i), | |
| 316 | .data = @intCast(u32, data_i), | |
| 274 | 317 | .syms = @intCast(u32, sym_buf.items.len), |
| 275 | 318 | .bss = 0, |
| 276 | 319 | .pcsz = 0, |
| 277 | 320 | .spsz = 0, |
| 278 | .entry = self.hdr.entry, | |
| 321 | .entry = @intCast(u32, self.entry_val.?), | |
| 279 | 322 | }; |
| 280 | ||
| 281 | const file = self.base.file.?; | |
| 282 | ||
| 283 | var hdr_buf = self.hdr.toU8s(); | |
| 284 | const hdr_slice: []const u8 = &hdr_buf; | |
| 285 | // account for the fat header | |
| 286 | const hdr_size: u8 = if (!self.sixtyfour_bit) 32 else 40; | |
| 323 | std.mem.copy(u8, hdr_slice, self.hdr.toU8s()[0..hdr_size]); | |
| 287 | 324 | // write the fat header for 64 bit entry points |
| 288 | 325 | if (self.sixtyfour_bit) { |
| 289 | mem.writeIntSliceBig(u64, hdr_buf[32..40], self.hdr.entry); | |
| 326 | mem.writeIntSliceBig(u64, hdr_buf[32..40], self.entry_val.?); | |
| 290 | 327 | } |
| 291 | 328 | // write it all! |
| 292 | var vectors: [4]std.os.iovec_const = .{ | |
| 293 | .{ .iov_base = hdr_slice.ptr, .iov_len = hdr_size }, | |
| 294 | .{ .iov_base = self.text_buf.items.ptr, .iov_len = self.text_buf.items.len }, | |
| 295 | .{ .iov_base = self.data_buf.items.ptr, .iov_len = self.data_buf.items.len }, | |
| 296 | .{ .iov_base = sym_buf.items.ptr, .iov_len = sym_buf.items.len }, | |
| 297 | // TODO spsz, pcsz | |
| 298 | }; | |
| 299 | try file.pwritevAll(&vectors, 0); | |
| 329 | try file.pwritevAll(iovecs, 0); | |
| 330 | } | |
| 331 | fn addDeclExports( | |
| 332 | self: *Plan9, | |
| 333 | module: *Module, | |
| 334 | decl: *Module.Decl, | |
| 335 | exports: []const *Module.Export, | |
| 336 | ) !void { | |
| 337 | for (exports) |exp| { | |
| 338 | // plan9 does not support custom sections | |
| 339 | if (exp.options.section) |section_name| { | |
| 340 | if (!mem.eql(u8, section_name, ".text") or !mem.eql(u8, section_name, ".data")) { | |
| 341 | try module.failed_exports.put(module.gpa, exp, try Module.ErrorMsg.create(self.base.allocator, decl.srcLoc(), "plan9 does not support extra sections", .{})); | |
| 342 | break; | |
| 343 | } | |
| 344 | } | |
| 345 | const sym = .{ | |
| 346 | .value = decl.link.plan9.offset.?, | |
| 347 | .type = decl.link.plan9.type.toGlobal(), | |
| 348 | .name = exp.options.name, | |
| 349 | }; | |
| 350 | ||
| 351 | if (exp.link.plan9) |i| { | |
| 352 | self.syms.items[i] = sym; | |
| 353 | } else { | |
| 354 | try self.syms.append(self.base.allocator, sym); | |
| 355 | exp.link.plan9 = self.syms.items.len - 1; | |
| 356 | } | |
| 357 | } | |
| 300 | 358 | } |
| 359 | ||
| 301 | 360 | pub fn freeDecl(self: *Plan9, decl: *Module.Decl) void { |
| 302 | assert(self.decl_table.swapRemove(decl)); | |
| 361 | const is_fn = (decl.ty.zigTypeTag() == .Fn); | |
| 362 | if (is_fn) | |
| 363 | assert(self.fn_decl_table.swapRemove(decl)) | |
| 364 | else | |
| 365 | assert(self.data_decl_table.swapRemove(decl)); | |
| 303 | 366 | } |
| 304 | 367 | |
| 305 | 368 | pub fn updateDeclExports( |
| ... | ... | @@ -315,11 +378,17 @@ pub fn updateDeclExports( |
| 315 | 378 | _ = exports; |
| 316 | 379 | } |
| 317 | 380 | pub fn deinit(self: *Plan9) void { |
| 318 | self.decl_table.deinit(self.base.allocator); | |
| 381 | var itf = self.fn_decl_table.iterator(); | |
| 382 | while (itf.next()) |entry| { | |
| 383 | self.base.allocator.free(entry.value_ptr.*); | |
| 384 | } | |
| 385 | self.fn_decl_table.deinit(self.base.allocator); | |
| 386 | var itd = self.data_decl_table.iterator(); | |
| 387 | while (itd.next()) |entry| { | |
| 388 | self.base.allocator.free(entry.value_ptr.*); | |
| 389 | } | |
| 390 | self.data_decl_table.deinit(self.base.allocator); | |
| 319 | 391 | self.syms.deinit(self.base.allocator); |
| 320 | self.text_buf.deinit(self.base.allocator); | |
| 321 | self.data_buf.deinit(self.base.allocator); | |
| 322 | self.got.deinit(self.base.allocator); | |
| 323 | 392 | } |
| 324 | 393 | |
| 325 | 394 | pub const Export = ?usize; |
| ... | ... | @@ -366,18 +435,24 @@ pub fn openPath(allocator: *Allocator, sub_path: []const u8, options: link.Optio |
| 366 | 435 | pub fn writeSyms(self: *Plan9, buf: *std.ArrayList(u8)) !void { |
| 367 | 436 | const writer = buf.writer(); |
| 368 | 437 | for (self.syms.items) |sym| { |
| 438 | log.debug("sym.name: {s}", .{sym.name}); | |
| 439 | log.debug("sym.value: {x}", .{sym.value}); | |
| 440 | if (mem.eql(u8, sym.name, "_start")) | |
| 441 | self.entry_val = sym.value; | |
| 369 | 442 | if (!self.sixtyfour_bit) { |
| 370 | 443 | try writer.writeIntBig(u32, @intCast(u32, sym.value)); |
| 371 | 444 | } else { |
| 372 | 445 | try writer.writeIntBig(u64, sym.value); |
| 373 | 446 | } |
| 374 | 447 | try writer.writeByte(@enumToInt(sym.type)); |
| 375 | try writer.writeAll(std.mem.span(sym.name)); | |
| 448 | try writer.writeAll(sym.name); | |
| 376 | 449 | try writer.writeByte(0); |
| 377 | 450 | } |
| 378 | 451 | } |
| 379 | 452 | |
| 380 | 453 | pub fn allocateDeclIndexes(self: *Plan9, decl: *Module.Decl) !void { |
| 381 | try self.got.append(self.base.allocator, 0xdeadbeef); | |
| 382 | decl.link.plan9.got_index = self.got.items.len - 1; | |
| 454 | if (decl.link.plan9.got_index == null) { | |
| 455 | self.got_len += 1; | |
| 456 | decl.link.plan9.got_index = self.got_len - 1; | |
| 457 | } | |
| 383 | 458 | } |
src/link/SpirV.zig+35-3
| ... | ... | @@ -36,6 +36,8 @@ const ResultId = codegen.ResultId; |
| 36 | 36 | const trace = @import("../tracy.zig").trace; |
| 37 | 37 | const build_options = @import("build_options"); |
| 38 | 38 | const spec = @import("../codegen/spirv/spec.zig"); |
| 39 | const Air = @import("../Air.zig"); | |
| 40 | const Liveness = @import("../Liveness.zig"); | |
| 39 | 41 | |
| 40 | 42 | // TODO: Should this struct be used at all rather than just a hashmap of aux data for every decl? |
| 41 | 43 | pub const FnData = struct { |
| ... | ... | @@ -49,7 +51,12 @@ base: link.File, |
| 49 | 51 | /// This linker backend does not try to incrementally link output SPIR-V code. |
| 50 | 52 | /// Instead, it tracks all declarations in this table, and iterates over it |
| 51 | 53 | /// in the flush function. |
| 52 | decl_table: std.AutoArrayHashMapUnmanaged(*Module.Decl, void) = .{}, | |
| 54 | decl_table: std.AutoArrayHashMapUnmanaged(*Module.Decl, DeclGenContext) = .{}, | |
| 55 | ||
| 56 | const DeclGenContext = struct { | |
| 57 | air: Air, | |
| 58 | liveness: Liveness, | |
| 59 | }; | |
| 53 | 60 | |
| 54 | 61 | pub fn createEmpty(gpa: *Allocator, options: link.Options) !*SpirV { |
| 55 | 62 | const spirv = try gpa.create(SpirV); |
| ... | ... | @@ -101,7 +108,23 @@ pub fn deinit(self: *SpirV) void { |
| 101 | 108 | self.decl_table.deinit(self.base.allocator); |
| 102 | 109 | } |
| 103 | 110 | |
| 111 | pub fn updateFunc(self: *SpirV, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 112 | if (build_options.skip_non_native) { | |
| 113 | @panic("Attempted to compile for architecture that was disabled by build configuration"); | |
| 114 | } | |
| 115 | _ = module; | |
| 116 | // Keep track of all decls so we can iterate over them on flush(). | |
| 117 | _ = try self.decl_table.getOrPut(self.base.allocator, func.owner_decl); | |
| 118 | ||
| 119 | _ = air; | |
| 120 | _ = liveness; | |
| 121 | @panic("TODO SPIR-V needs to keep track of Air and Liveness so it can use them later"); | |
| 122 | } | |
| 123 | ||
| 104 | 124 | pub fn updateDecl(self: *SpirV, module: *Module, decl: *Module.Decl) !void { |
| 125 | if (build_options.skip_non_native) { | |
| 126 | @panic("Attempted to compile for architecture that was disabled by build configuration"); | |
| 127 | } | |
| 105 | 128 | _ = module; |
| 106 | 129 | // Keep track of all decls so we can iterate over them on flush(). |
| 107 | 130 | _ = try self.decl_table.getOrPut(self.base.allocator, decl); |
| ... | ... | @@ -132,6 +155,10 @@ pub fn flush(self: *SpirV, comp: *Compilation) !void { |
| 132 | 155 | } |
| 133 | 156 | |
| 134 | 157 | pub fn flushModule(self: *SpirV, comp: *Compilation) !void { |
| 158 | if (build_options.skip_non_native) { | |
| 159 | @panic("Attempted to compile for architecture that was disabled by build configuration"); | |
| 160 | } | |
| 161 | ||
| 135 | 162 | const tracy = trace(@src()); |
| 136 | 163 | defer tracy.end(); |
| 137 | 164 | |
| ... | ... | @@ -159,10 +186,15 @@ pub fn flushModule(self: *SpirV, comp: *Compilation) !void { |
| 159 | 186 | var decl_gen = codegen.DeclGen.init(&spv); |
| 160 | 187 | defer decl_gen.deinit(); |
| 161 | 188 | |
| 162 | for (self.decl_table.keys()) |decl| { | |
| 189 | var it = self.decl_table.iterator(); | |
| 190 | while (it.next()) |entry| { | |
| 191 | const decl = entry.key_ptr.*; | |
| 163 | 192 | if (!decl.has_tv) continue; |
| 164 | 193 | |
| 165 | if (try decl_gen.gen(decl)) |msg| { | |
| 194 | const air = entry.value_ptr.air; | |
| 195 | const liveness = entry.value_ptr.liveness; | |
| 196 | ||
| 197 | if (try decl_gen.gen(decl, air, liveness)) |msg| { | |
| 166 | 198 | try module.failed_decls.put(module.gpa, decl, msg); |
| 167 | 199 | return; // TODO: Attempt to generate more decls? |
| 168 | 200 | } |
src/link/Wasm.zig+76-8
| ... | ... | @@ -1,6 +1,7 @@ |
| 1 | 1 | const Wasm = @This(); |
| 2 | 2 | |
| 3 | 3 | const std = @import("std"); |
| 4 | const builtin = @import("builtin"); | |
| 4 | 5 | const mem = std.mem; |
| 5 | 6 | const Allocator = std.mem.Allocator; |
| 6 | 7 | const assert = std.debug.assert; |
| ... | ... | @@ -18,10 +19,15 @@ const build_options = @import("build_options"); |
| 18 | 19 | const wasi_libc = @import("../wasi_libc.zig"); |
| 19 | 20 | const Cache = @import("../Cache.zig"); |
| 20 | 21 | const TypedValue = @import("../TypedValue.zig"); |
| 22 | const llvm_backend = @import("../codegen/llvm.zig"); | |
| 23 | const Air = @import("../Air.zig"); | |
| 24 | const Liveness = @import("../Liveness.zig"); | |
| 21 | 25 | |
| 22 | 26 | pub const base_tag = link.File.Tag.wasm; |
| 23 | 27 | |
| 24 | 28 | base: link.File, |
| 29 | /// If this is not null, an object file is created by LLVM and linked with LLD afterwards. | |
| 30 | llvm_object: ?*llvm_backend.Object = null, | |
| 25 | 31 | /// List of all function Decls to be written to the output file. The index of |
| 26 | 32 | /// each Decl in this list at the time of writing the binary is used as the |
| 27 | 33 | /// function index. In the event where ext_funcs' size is not 0, the index of |
| ... | ... | @@ -111,8 +117,13 @@ pub const DeclBlock = struct { |
| 111 | 117 | pub fn openPath(allocator: *Allocator, sub_path: []const u8, options: link.Options) !*Wasm { |
| 112 | 118 | assert(options.object_format == .wasm); |
| 113 | 119 | |
| 114 | if (options.use_llvm) return error.LLVM_BackendIsTODO_ForWasm; // TODO | |
| 115 | if (options.use_lld) return error.LLD_LinkingIsTODO_ForWasm; // TODO | |
| 120 | if (build_options.have_llvm and options.use_llvm) { | |
| 121 | const self = try createEmpty(allocator, options); | |
| 122 | errdefer self.base.destroy(); | |
| 123 | ||
| 124 | self.llvm_object = try llvm_backend.Object.create(allocator, sub_path, options); | |
| 125 | return self; | |
| 126 | } | |
| 116 | 127 | |
| 117 | 128 | // TODO: read the file and keep valid parts instead of truncating |
| 118 | 129 | const file = try options.emit.?.directory.handle.createFile(sub_path, .{ .truncate = true, .read = true }); |
| ... | ... | @@ -186,11 +197,60 @@ pub fn allocateDeclIndexes(self: *Wasm, decl: *Module.Decl) !void { |
| 186 | 197 | } |
| 187 | 198 | } |
| 188 | 199 | |
| 200 | pub fn updateFunc(self: *Wasm, module: *Module, func: *Module.Fn, air: Air, liveness: Liveness) !void { | |
| 201 | if (build_options.skip_non_native and builtin.object_format != .wasm) { | |
| 202 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 203 | } | |
| 204 | if (build_options.have_llvm) { | |
| 205 | if (self.llvm_object) |llvm_object| return llvm_object.updateFunc(module, func, air, liveness); | |
| 206 | } | |
| 207 | const decl = func.owner_decl; | |
| 208 | assert(decl.link.wasm.init); // Must call allocateDeclIndexes() | |
| 209 | ||
| 210 | const fn_data = &decl.fn_link.wasm; | |
| 211 | fn_data.functype.items.len = 0; | |
| 212 | fn_data.code.items.len = 0; | |
| 213 | fn_data.idx_refs.items.len = 0; | |
| 214 | ||
| 215 | var context = codegen.Context{ | |
| 216 | .gpa = self.base.allocator, | |
| 217 | .air = air, | |
| 218 | .liveness = liveness, | |
| 219 | .values = .{}, | |
| 220 | .code = fn_data.code.toManaged(self.base.allocator), | |
| 221 | .func_type_data = fn_data.functype.toManaged(self.base.allocator), | |
| 222 | .decl = decl, | |
| 223 | .err_msg = undefined, | |
| 224 | .locals = .{}, | |
| 225 | .target = self.base.options.target, | |
| 226 | .global_error_set = self.base.options.module.?.global_error_set, | |
| 227 | }; | |
| 228 | defer context.deinit(); | |
| 229 | ||
| 230 | // generate the 'code' section for the function declaration | |
| 231 | const result = context.genFunc() catch |err| switch (err) { | |
| 232 | error.CodegenFail => { | |
| 233 | decl.analysis = .codegen_failure; | |
| 234 | try module.failed_decls.put(module.gpa, decl, context.err_msg); | |
| 235 | return; | |
| 236 | }, | |
| 237 | else => |e| return e, | |
| 238 | }; | |
| 239 | return self.finishUpdateDecl(decl, result, &context); | |
| 240 | } | |
| 241 | ||
| 189 | 242 | // Generate code for the Decl, storing it in memory to be later written to |
| 190 | 243 | // the file on flush(). |
| 191 | 244 | pub fn updateDecl(self: *Wasm, module: *Module, decl: *Module.Decl) !void { |
| 192 | std.debug.assert(decl.link.wasm.init); // Must call allocateDeclIndexes() | |
| 245 | if (build_options.skip_non_native and builtin.object_format != .wasm) { | |
| 246 | @panic("Attempted to compile for object format that was disabled by build configuration"); | |
| 247 | } | |
| 248 | if (build_options.have_llvm) { | |
| 249 | if (self.llvm_object) |llvm_object| return llvm_object.updateDecl(module, decl); | |
| 250 | } | |
| 251 | assert(decl.link.wasm.init); // Must call allocateDeclIndexes() | |
| 193 | 252 | |
| 253 | // TODO don't use this for non-functions | |
| 194 | 254 | const fn_data = &decl.fn_link.wasm; |
| 195 | 255 | fn_data.functype.items.len = 0; |
| 196 | 256 | fn_data.code.items.len = 0; |
| ... | ... | @@ -198,6 +258,8 @@ pub fn updateDecl(self: *Wasm, module: *Module, decl: *Module.Decl) !void { |
| 198 | 258 | |
| 199 | 259 | var context = codegen.Context{ |
| 200 | 260 | .gpa = self.base.allocator, |
| 261 | .air = undefined, | |
| 262 | .liveness = undefined, | |
| 201 | 263 | .values = .{}, |
| 202 | 264 | .code = fn_data.code.toManaged(self.base.allocator), |
| 203 | 265 | .func_type_data = fn_data.functype.toManaged(self.base.allocator), |
| ... | ... | @@ -219,14 +281,20 @@ pub fn updateDecl(self: *Wasm, module: *Module, decl: *Module.Decl) !void { |
| 219 | 281 | else => |e| return e, |
| 220 | 282 | }; |
| 221 | 283 | |
| 222 | const code: []const u8 = switch (result) { | |
| 223 | .appended => @as([]const u8, context.code.items), | |
| 224 | .externally_managed => |payload| payload, | |
| 225 | }; | |
| 284 | return self.finishUpdateDecl(decl, result, &context); | |
| 285 | } | |
| 286 | ||
| 287 | fn finishUpdateDecl(self: *Wasm, decl: *Module.Decl, result: codegen.Result, context: *codegen.Context) !void { | |
| 288 | const fn_data: *FnData = &decl.fn_link.wasm; | |
| 226 | 289 | |
| 227 | 290 | fn_data.code = context.code.toUnmanaged(); |
| 228 | 291 | fn_data.functype = context.func_type_data.toUnmanaged(); |
| 229 | 292 | |
| 293 | const code: []const u8 = switch (result) { | |
| 294 | .appended => @as([]const u8, fn_data.code.items), | |
| 295 | .externally_managed => |payload| payload, | |
| 296 | }; | |
| 297 | ||
| 230 | 298 | const block = &decl.link.wasm; |
| 231 | 299 | if (decl.ty.zigTypeTag() == .Fn) { |
| 232 | 300 | // as locals are patched afterwards, the offsets of funcidx's are off, |
| ... | ... | @@ -521,7 +589,7 @@ pub fn flushModule(self: *Wasm, comp: *Compilation) !void { |
| 521 | 589 | var data_offset = offset_table_size; |
| 522 | 590 | while (cur) |cur_block| : (cur = cur_block.next) { |
| 523 | 591 | if (cur_block.size == 0) continue; |
| 524 | std.debug.assert(cur_block.init); | |
| 592 | assert(cur_block.init); | |
| 525 | 593 | |
| 526 | 594 | const offset = (cur_block.offset_index) * ptr_width; |
| 527 | 595 | var buf: [4]u8 = undefined; |
src/liveness.zig deleted-254
| ... | ... | @@ -1,254 +0,0 @@ |
| 1 | const std = @import("std"); | |
| 2 | const ir = @import("air.zig"); | |
| 3 | const trace = @import("tracy.zig").trace; | |
| 4 | const log = std.log.scoped(.liveness); | |
| 5 | const assert = std.debug.assert; | |
| 6 | ||
| 7 | /// Perform Liveness Analysis over the `Body`. Each `Inst` will have its `deaths` field populated. | |
| 8 | pub fn analyze( | |
| 9 | /// Used for temporary storage during the analysis. | |
| 10 | gpa: *std.mem.Allocator, | |
| 11 | /// Used to tack on extra allocations in the same lifetime as the existing instructions. | |
| 12 | arena: *std.mem.Allocator, | |
| 13 | body: ir.Body, | |
| 14 | ) error{OutOfMemory}!void { | |
| 15 | const tracy = trace(@src()); | |
| 16 | defer tracy.end(); | |
| 17 | ||
| 18 | var table = std.AutoHashMap(*ir.Inst, void).init(gpa); | |
| 19 | defer table.deinit(); | |
| 20 | try table.ensureCapacity(@intCast(u32, body.instructions.len)); | |
| 21 | try analyzeWithTable(arena, &table, null, body); | |
| 22 | } | |
| 23 | ||
| 24 | fn analyzeWithTable( | |
| 25 | arena: *std.mem.Allocator, | |
| 26 | table: *std.AutoHashMap(*ir.Inst, void), | |
| 27 | new_set: ?*std.AutoHashMap(*ir.Inst, void), | |
| 28 | body: ir.Body, | |
| 29 | ) error{OutOfMemory}!void { | |
| 30 | var i: usize = body.instructions.len; | |
| 31 | ||
| 32 | if (new_set) |ns| { | |
| 33 | // We are only interested in doing this for instructions which are born | |
| 34 | // before a conditional branch, so after obtaining the new set for | |
| 35 | // each branch we prune the instructions which were born within. | |
| 36 | while (i != 0) { | |
| 37 | i -= 1; | |
| 38 | const base = body.instructions[i]; | |
| 39 | _ = ns.remove(base); | |
| 40 | try analyzeInst(arena, table, new_set, base); | |
| 41 | } | |
| 42 | } else { | |
| 43 | while (i != 0) { | |
| 44 | i -= 1; | |
| 45 | const base = body.instructions[i]; | |
| 46 | try analyzeInst(arena, table, new_set, base); | |
| 47 | } | |
| 48 | } | |
| 49 | } | |
| 50 | ||
| 51 | fn analyzeInst( | |
| 52 | arena: *std.mem.Allocator, | |
| 53 | table: *std.AutoHashMap(*ir.Inst, void), | |
| 54 | new_set: ?*std.AutoHashMap(*ir.Inst, void), | |
| 55 | base: *ir.Inst, | |
| 56 | ) error{OutOfMemory}!void { | |
| 57 | if (table.contains(base)) { | |
| 58 | base.deaths = 0; | |
| 59 | } else { | |
| 60 | // No tombstone for this instruction means it is never referenced, | |
| 61 | // and its birth marks its own death. Very metal 🤘 | |
| 62 | base.deaths = 1 << ir.Inst.unreferenced_bit_index; | |
| 63 | } | |
| 64 | ||
| 65 | switch (base.tag) { | |
| 66 | .constant => return, | |
| 67 | .block => { | |
| 68 | const inst = base.castTag(.block).?; | |
| 69 | try analyzeWithTable(arena, table, new_set, inst.body); | |
| 70 | // We let this continue so that it can possibly mark the block as | |
| 71 | // unreferenced below. | |
| 72 | }, | |
| 73 | .loop => { | |
| 74 | const inst = base.castTag(.loop).?; | |
| 75 | try analyzeWithTable(arena, table, new_set, inst.body); | |
| 76 | return; // Loop has no operands and it is always unreferenced. | |
| 77 | }, | |
| 78 | .condbr => { | |
| 79 | const inst = base.castTag(.condbr).?; | |
| 80 | ||
| 81 | // Each death that occurs inside one branch, but not the other, needs | |
| 82 | // to be added as a death immediately upon entering the other branch. | |
| 83 | ||
| 84 | var then_table = std.AutoHashMap(*ir.Inst, void).init(table.allocator); | |
| 85 | defer then_table.deinit(); | |
| 86 | try analyzeWithTable(arena, table, &then_table, inst.then_body); | |
| 87 | ||
| 88 | // Reset the table back to its state from before the branch. | |
| 89 | { | |
| 90 | var it = then_table.keyIterator(); | |
| 91 | while (it.next()) |key| { | |
| 92 | assert(table.remove(key.*)); | |
| 93 | } | |
| 94 | } | |
| 95 | ||
| 96 | var else_table = std.AutoHashMap(*ir.Inst, void).init(table.allocator); | |
| 97 | defer else_table.deinit(); | |
| 98 | try analyzeWithTable(arena, table, &else_table, inst.else_body); | |
| 99 | ||
| 100 | var then_entry_deaths = std.ArrayList(*ir.Inst).init(table.allocator); | |
| 101 | defer then_entry_deaths.deinit(); | |
| 102 | var else_entry_deaths = std.ArrayList(*ir.Inst).init(table.allocator); | |
| 103 | defer else_entry_deaths.deinit(); | |
| 104 | ||
| 105 | { | |
| 106 | var it = else_table.keyIterator(); | |
| 107 | while (it.next()) |key| { | |
| 108 | const else_death = key.*; | |
| 109 | if (!then_table.contains(else_death)) { | |
| 110 | try then_entry_deaths.append(else_death); | |
| 111 | } | |
| 112 | } | |
| 113 | } | |
| 114 | // This loop is the same, except it's for the then branch, and it additionally | |
| 115 | // has to put its items back into the table to undo the reset. | |
| 116 | { | |
| 117 | var it = then_table.keyIterator(); | |
| 118 | while (it.next()) |key| { | |
| 119 | const then_death = key.*; | |
| 120 | if (!else_table.contains(then_death)) { | |
| 121 | try else_entry_deaths.append(then_death); | |
| 122 | } | |
| 123 | try table.put(then_death, {}); | |
| 124 | } | |
| 125 | } | |
| 126 | // Now we have to correctly populate new_set. | |
| 127 | if (new_set) |ns| { | |
| 128 | try ns.ensureCapacity(@intCast(u32, ns.count() + then_table.count() + else_table.count())); | |
| 129 | var it = then_table.keyIterator(); | |
| 130 | while (it.next()) |key| { | |
| 131 | _ = ns.putAssumeCapacity(key.*, {}); | |
| 132 | } | |
| 133 | it = else_table.keyIterator(); | |
| 134 | while (it.next()) |key| { | |
| 135 | _ = ns.putAssumeCapacity(key.*, {}); | |
| 136 | } | |
| 137 | } | |
| 138 | inst.then_death_count = std.math.cast(@TypeOf(inst.then_death_count), then_entry_deaths.items.len) catch return error.OutOfMemory; | |
| 139 | inst.else_death_count = std.math.cast(@TypeOf(inst.else_death_count), else_entry_deaths.items.len) catch return error.OutOfMemory; | |
| 140 | const allocated_slice = try arena.alloc(*ir.Inst, then_entry_deaths.items.len + else_entry_deaths.items.len); | |
| 141 | inst.deaths = allocated_slice.ptr; | |
| 142 | std.mem.copy(*ir.Inst, inst.thenDeaths(), then_entry_deaths.items); | |
| 143 | std.mem.copy(*ir.Inst, inst.elseDeaths(), else_entry_deaths.items); | |
| 144 | ||
| 145 | // Continue on with the instruction analysis. The following code will find the condition | |
| 146 | // instruction, and the deaths flag for the CondBr instruction will indicate whether the | |
| 147 | // condition's lifetime ends immediately before entering any branch. | |
| 148 | }, | |
| 149 | .switchbr => { | |
| 150 | const inst = base.castTag(.switchbr).?; | |
| 151 | ||
| 152 | const Table = std.AutoHashMap(*ir.Inst, void); | |
| 153 | const case_tables = try table.allocator.alloc(Table, inst.cases.len + 1); // +1 for else | |
| 154 | defer table.allocator.free(case_tables); | |
| 155 | ||
| 156 | std.mem.set(Table, case_tables, Table.init(table.allocator)); | |
| 157 | defer for (case_tables) |*ct| ct.deinit(); | |
| 158 | ||
| 159 | for (inst.cases) |case, i| { | |
| 160 | try analyzeWithTable(arena, table, &case_tables[i], case.body); | |
| 161 | ||
| 162 | // Reset the table back to its state from before the case. | |
| 163 | var it = case_tables[i].keyIterator(); | |
| 164 | while (it.next()) |key| { | |
| 165 | assert(table.remove(key.*)); | |
| 166 | } | |
| 167 | } | |
| 168 | { // else | |
| 169 | try analyzeWithTable(arena, table, &case_tables[case_tables.len - 1], inst.else_body); | |
| 170 | ||
| 171 | // Reset the table back to its state from before the case. | |
| 172 | var it = case_tables[case_tables.len - 1].keyIterator(); | |
| 173 | while (it.next()) |key| { | |
| 174 | assert(table.remove(key.*)); | |
| 175 | } | |
| 176 | } | |
| 177 | ||
| 178 | const List = std.ArrayList(*ir.Inst); | |
| 179 | const case_deaths = try table.allocator.alloc(List, case_tables.len); // +1 for else | |
| 180 | defer table.allocator.free(case_deaths); | |
| 181 | ||
| 182 | std.mem.set(List, case_deaths, List.init(table.allocator)); | |
| 183 | defer for (case_deaths) |*cd| cd.deinit(); | |
| 184 | ||
| 185 | var total_deaths: u32 = 0; | |
| 186 | for (case_tables) |*ct, i| { | |
| 187 | total_deaths += ct.count(); | |
| 188 | var it = ct.keyIterator(); | |
| 189 | while (it.next()) |key| { | |
| 190 | const case_death = key.*; | |
| 191 | for (case_tables) |*ct_inner, j| { | |
| 192 | if (i == j) continue; | |
| 193 | if (!ct_inner.contains(case_death)) { | |
| 194 | // instruction is not referenced in this case | |
| 195 | try case_deaths[j].append(case_death); | |
| 196 | } | |
| 197 | } | |
| 198 | // undo resetting the table | |
| 199 | try table.put(case_death, {}); | |
| 200 | } | |
| 201 | } | |
| 202 | ||
| 203 | // Now we have to correctly populate new_set. | |
| 204 | if (new_set) |ns| { | |
| 205 | try ns.ensureCapacity(@intCast(u32, ns.count() + total_deaths)); | |
| 206 | for (case_tables) |*ct| { | |
| 207 | var it = ct.keyIterator(); | |
| 208 | while (it.next()) |key| { | |
| 209 | _ = ns.putAssumeCapacity(key.*, {}); | |
| 210 | } | |
| 211 | } | |
| 212 | } | |
| 213 | ||
| 214 | total_deaths = 0; | |
| 215 | for (case_deaths[0 .. case_deaths.len - 1]) |*ct, i| { | |
| 216 | inst.cases[i].index = total_deaths; | |
| 217 | const len = std.math.cast(@TypeOf(inst.else_deaths), ct.items.len) catch return error.OutOfMemory; | |
| 218 | inst.cases[i].deaths = len; | |
| 219 | total_deaths += len; | |
| 220 | } | |
| 221 | { // else | |
| 222 | const else_deaths = std.math.cast(@TypeOf(inst.else_deaths), case_deaths[case_deaths.len - 1].items.len) catch return error.OutOfMemory; | |
| 223 | inst.else_index = total_deaths; | |
| 224 | inst.else_deaths = else_deaths; | |
| 225 | total_deaths += else_deaths; | |
| 226 | } | |
| 227 | ||
| 228 | const allocated_slice = try arena.alloc(*ir.Inst, total_deaths); | |
| 229 | inst.deaths = allocated_slice.ptr; | |
| 230 | for (case_deaths[0 .. case_deaths.len - 1]) |*cd, i| { | |
| 231 | std.mem.copy(*ir.Inst, inst.caseDeaths(i), cd.items); | |
| 232 | } | |
| 233 | std.mem.copy(*ir.Inst, inst.elseDeaths(), case_deaths[case_deaths.len - 1].items); | |
| 234 | }, | |
| 235 | else => {}, | |
| 236 | } | |
| 237 | ||
| 238 | const needed_bits = base.operandCount(); | |
| 239 | if (needed_bits <= ir.Inst.deaths_bits) { | |
| 240 | var bit_i: ir.Inst.DeathsBitIndex = 0; | |
| 241 | while (base.getOperand(bit_i)) |operand| : (bit_i += 1) { | |
| 242 | const prev = try table.fetchPut(operand, {}); | |
| 243 | if (prev == null) { | |
| 244 | // Death. | |
| 245 | base.deaths |= @as(ir.Inst.DeathsInt, 1) << bit_i; | |
| 246 | if (new_set) |ns| try ns.putNoClobber(operand, {}); | |
| 247 | } | |
| 248 | } | |
| 249 | } else { | |
| 250 | @panic("Handle liveness analysis for instructions with many parameters"); | |
| 251 | } | |
| 252 | ||
| 253 | log.debug("analyze {}: 0b{b}\n", .{ base.tag, base.deaths }); | |
| 254 | } |
src/main.zig+1
| ... | ... | @@ -365,6 +365,7 @@ const usage_build_generic = |
| 365 | 365 | \\ coff Common Object File Format (Windows) |
| 366 | 366 | \\ macho macOS relocatables |
| 367 | 367 | \\ spirv Standard, Portable Intermediate Representation V (SPIR-V) |
| 368 | \\ plan9 Plan 9 from Bell Labs object format | |
| 368 | 369 | \\ hex (planned) Intel IHEX |
| 369 | 370 | \\ raw (planned) Dump machine code directly |
| 370 | 371 | \\ -dirafter [dir] Add directory to AFTER include search path |
src/print_air.zig created+413
| ... | ... | @@ -0,0 +1,413 @@ |
| 1 | const std = @import("std"); | |
| 2 | const Allocator = std.mem.Allocator; | |
| 3 | const fmtIntSizeBin = std.fmt.fmtIntSizeBin; | |
| 4 | ||
| 5 | const Module = @import("Module.zig"); | |
| 6 | const Value = @import("value.zig").Value; | |
| 7 | const Zir = @import("Zir.zig"); | |
| 8 | const Air = @import("Air.zig"); | |
| 9 | const Liveness = @import("Liveness.zig"); | |
| 10 | ||
| 11 | pub fn dump(gpa: *Allocator, air: Air, zir: Zir, liveness: Liveness) void { | |
| 12 | const instruction_bytes = air.instructions.len * | |
| 13 | // Here we don't use @sizeOf(Air.Inst.Data) because it would include | |
| 14 | // the debug safety tag but we want to measure release size. | |
| 15 | (@sizeOf(Air.Inst.Tag) + 8); | |
| 16 | const extra_bytes = air.extra.len * @sizeOf(u32); | |
| 17 | const values_bytes = air.values.len * @sizeOf(Value); | |
| 18 | const variables_bytes = air.variables.len * @sizeOf(*Module.Var); | |
| 19 | const tomb_bytes = liveness.tomb_bits.len * @sizeOf(usize); | |
| 20 | const liveness_extra_bytes = liveness.extra.len * @sizeOf(u32); | |
| 21 | const liveness_special_bytes = liveness.special.count() * 8; | |
| 22 | const total_bytes = @sizeOf(Air) + instruction_bytes + extra_bytes + | |
| 23 | values_bytes * variables_bytes + @sizeOf(Liveness) + liveness_extra_bytes + | |
| 24 | liveness_special_bytes + tomb_bytes; | |
| 25 | ||
| 26 | // zig fmt: off | |
| 27 | std.debug.print( | |
| 28 | \\# Total AIR+Liveness bytes: {} | |
| 29 | \\# AIR Instructions: {d} ({}) | |
| 30 | \\# AIR Extra Data: {d} ({}) | |
| 31 | \\# AIR Values Bytes: {d} ({}) | |
| 32 | \\# AIR Variables Bytes: {d} ({}) | |
| 33 | \\# Liveness tomb_bits: {} | |
| 34 | \\# Liveness Extra Data: {d} ({}) | |
| 35 | \\# Liveness special table: {d} ({}) | |
| 36 | \\ | |
| 37 | , .{ | |
| 38 | fmtIntSizeBin(total_bytes), | |
| 39 | air.instructions.len, fmtIntSizeBin(instruction_bytes), | |
| 40 | air.extra.len, fmtIntSizeBin(extra_bytes), | |
| 41 | air.values.len, fmtIntSizeBin(values_bytes), | |
| 42 | air.variables.len, fmtIntSizeBin(variables_bytes), | |
| 43 | fmtIntSizeBin(tomb_bytes), | |
| 44 | liveness.extra.len, fmtIntSizeBin(liveness_extra_bytes), | |
| 45 | liveness.special.count(), fmtIntSizeBin(liveness_special_bytes), | |
| 46 | }); | |
| 47 | // zig fmt: on | |
| 48 | var arena = std.heap.ArenaAllocator.init(gpa); | |
| 49 | defer arena.deinit(); | |
| 50 | ||
| 51 | var writer: Writer = .{ | |
| 52 | .gpa = gpa, | |
| 53 | .arena = &arena.allocator, | |
| 54 | .air = air, | |
| 55 | .zir = zir, | |
| 56 | .liveness = liveness, | |
| 57 | .indent = 2, | |
| 58 | }; | |
| 59 | const stream = std.io.getStdErr().writer(); | |
| 60 | writer.writeAllConstants(stream) catch return; | |
| 61 | stream.writeByte('\n') catch return; | |
| 62 | writer.writeBody(stream, air.getMainBody()) catch return; | |
| 63 | } | |
| 64 | ||
| 65 | const Writer = struct { | |
| 66 | gpa: *Allocator, | |
| 67 | arena: *Allocator, | |
| 68 | air: Air, | |
| 69 | zir: Zir, | |
| 70 | liveness: Liveness, | |
| 71 | indent: usize, | |
| 72 | ||
| 73 | fn writeAllConstants(w: *Writer, s: anytype) @TypeOf(s).Error!void { | |
| 74 | for (w.air.instructions.items(.tag)) |tag, i| { | |
| 75 | const inst = @intCast(u32, i); | |
| 76 | switch (tag) { | |
| 77 | .constant, .const_ty => { | |
| 78 | try s.writeByteNTimes(' ', w.indent); | |
| 79 | try s.print("%{d} ", .{inst}); | |
| 80 | try w.writeInst(s, inst); | |
| 81 | try s.writeAll(")\n"); | |
| 82 | }, | |
| 83 | else => continue, | |
| 84 | } | |
| 85 | } | |
| 86 | } | |
| 87 | ||
| 88 | fn writeBody(w: *Writer, s: anytype, body: []const Air.Inst.Index) @TypeOf(s).Error!void { | |
| 89 | for (body) |inst| { | |
| 90 | try s.writeByteNTimes(' ', w.indent); | |
| 91 | if (w.liveness.isUnused(inst)) { | |
| 92 | try s.print("%{d}!", .{inst}); | |
| 93 | } else { | |
| 94 | try s.print("%{d} ", .{inst}); | |
| 95 | } | |
| 96 | try w.writeInst(s, inst); | |
| 97 | try s.writeAll(")\n"); | |
| 98 | } | |
| 99 | } | |
| 100 | ||
| 101 | fn writeInst(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 102 | const tags = w.air.instructions.items(.tag); | |
| 103 | const tag = tags[inst]; | |
| 104 | try s.print("= {s}(", .{@tagName(tags[inst])}); | |
| 105 | switch (tag) { | |
| 106 | .arg => try w.writeTyStr(s, inst), | |
| 107 | ||
| 108 | .add, | |
| 109 | .addwrap, | |
| 110 | .sub, | |
| 111 | .subwrap, | |
| 112 | .mul, | |
| 113 | .mulwrap, | |
| 114 | .div, | |
| 115 | .bit_and, | |
| 116 | .bit_or, | |
| 117 | .xor, | |
| 118 | .cmp_lt, | |
| 119 | .cmp_lte, | |
| 120 | .cmp_eq, | |
| 121 | .cmp_gte, | |
| 122 | .cmp_gt, | |
| 123 | .cmp_neq, | |
| 124 | .bool_and, | |
| 125 | .bool_or, | |
| 126 | .store, | |
| 127 | => try w.writeBinOp(s, inst), | |
| 128 | ||
| 129 | .is_null, | |
| 130 | .is_non_null, | |
| 131 | .is_null_ptr, | |
| 132 | .is_non_null_ptr, | |
| 133 | .is_err, | |
| 134 | .is_non_err, | |
| 135 | .is_err_ptr, | |
| 136 | .is_non_err_ptr, | |
| 137 | .ptrtoint, | |
| 138 | .ret, | |
| 139 | => try w.writeUnOp(s, inst), | |
| 140 | ||
| 141 | .breakpoint, | |
| 142 | .unreach, | |
| 143 | => try w.writeNoOp(s, inst), | |
| 144 | ||
| 145 | .const_ty, | |
| 146 | .alloc, | |
| 147 | => try w.writeTy(s, inst), | |
| 148 | ||
| 149 | .not, | |
| 150 | .bitcast, | |
| 151 | .load, | |
| 152 | .ref, | |
| 153 | .floatcast, | |
| 154 | .intcast, | |
| 155 | .optional_payload, | |
| 156 | .optional_payload_ptr, | |
| 157 | .wrap_optional, | |
| 158 | .unwrap_errunion_payload, | |
| 159 | .unwrap_errunion_err, | |
| 160 | .unwrap_errunion_payload_ptr, | |
| 161 | .unwrap_errunion_err_ptr, | |
| 162 | .wrap_errunion_payload, | |
| 163 | .wrap_errunion_err, | |
| 164 | => try w.writeTyOp(s, inst), | |
| 165 | ||
| 166 | .block, | |
| 167 | .loop, | |
| 168 | => try w.writeBlock(s, inst), | |
| 169 | ||
| 170 | .struct_field_ptr => try w.writeStructFieldPtr(s, inst), | |
| 171 | .varptr => try w.writeVarPtr(s, inst), | |
| 172 | .constant => try w.writeConstant(s, inst), | |
| 173 | .assembly => try w.writeAssembly(s, inst), | |
| 174 | .dbg_stmt => try w.writeDbgStmt(s, inst), | |
| 175 | .call => try w.writeCall(s, inst), | |
| 176 | .br => try w.writeBr(s, inst), | |
| 177 | .cond_br => try w.writeCondBr(s, inst), | |
| 178 | .switch_br => try w.writeSwitchBr(s, inst), | |
| 179 | } | |
| 180 | } | |
| 181 | ||
| 182 | fn writeTyStr(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 183 | const ty_str = w.air.instructions.items(.data)[inst].ty_str; | |
| 184 | const name = w.zir.nullTerminatedString(ty_str.str); | |
| 185 | try s.print("\"{}\", {}", .{ std.zig.fmtEscapes(name), ty_str.ty }); | |
| 186 | } | |
| 187 | ||
| 188 | fn writeBinOp(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 189 | const bin_op = w.air.instructions.items(.data)[inst].bin_op; | |
| 190 | try w.writeOperand(s, inst, 0, bin_op.lhs); | |
| 191 | try s.writeAll(", "); | |
| 192 | try w.writeOperand(s, inst, 1, bin_op.rhs); | |
| 193 | } | |
| 194 | ||
| 195 | fn writeUnOp(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 196 | const un_op = w.air.instructions.items(.data)[inst].un_op; | |
| 197 | try w.writeOperand(s, inst, 0, un_op); | |
| 198 | } | |
| 199 | ||
| 200 | fn writeNoOp(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 201 | _ = w; | |
| 202 | _ = inst; | |
| 203 | _ = s; | |
| 204 | // no-op, no argument to write | |
| 205 | } | |
| 206 | ||
| 207 | fn writeTy(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 208 | const ty = w.air.instructions.items(.data)[inst].ty; | |
| 209 | try s.print("{}", .{ty}); | |
| 210 | } | |
| 211 | ||
| 212 | fn writeTyOp(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 213 | const ty_op = w.air.instructions.items(.data)[inst].ty_op; | |
| 214 | try s.print("{}, ", .{w.air.getRefType(ty_op.ty)}); | |
| 215 | try w.writeOperand(s, inst, 0, ty_op.operand); | |
| 216 | } | |
| 217 | ||
| 218 | fn writeBlock(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 219 | const ty_pl = w.air.instructions.items(.data)[inst].ty_pl; | |
| 220 | const extra = w.air.extraData(Air.Block, ty_pl.payload); | |
| 221 | const body = w.air.extra[extra.end..][0..extra.data.body_len]; | |
| 222 | ||
| 223 | try s.writeAll("{\n"); | |
| 224 | const old_indent = w.indent; | |
| 225 | w.indent += 2; | |
| 226 | try w.writeBody(s, body); | |
| 227 | w.indent = old_indent; | |
| 228 | try s.writeByteNTimes(' ', w.indent); | |
| 229 | try s.writeAll("}"); | |
| 230 | } | |
| 231 | ||
| 232 | fn writeStructFieldPtr(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 233 | const ty_pl = w.air.instructions.items(.data)[inst].ty_pl; | |
| 234 | const extra = w.air.extraData(Air.StructField, ty_pl.payload); | |
| 235 | ||
| 236 | try w.writeOperand(s, inst, 0, extra.data.struct_ptr); | |
| 237 | try s.print(", {d}", .{extra.data.field_index}); | |
| 238 | } | |
| 239 | ||
| 240 | fn writeVarPtr(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 241 | _ = w; | |
| 242 | _ = inst; | |
| 243 | try s.writeAll("TODO"); | |
| 244 | } | |
| 245 | ||
| 246 | fn writeConstant(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 247 | const ty_pl = w.air.instructions.items(.data)[inst].ty_pl; | |
| 248 | const val = w.air.values[ty_pl.payload]; | |
| 249 | try s.print("{}, {}", .{ w.air.getRefType(ty_pl.ty), val }); | |
| 250 | } | |
| 251 | ||
| 252 | fn writeAssembly(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 253 | _ = w; | |
| 254 | _ = inst; | |
| 255 | try s.writeAll("TODO"); | |
| 256 | } | |
| 257 | ||
| 258 | fn writeDbgStmt(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 259 | const dbg_stmt = w.air.instructions.items(.data)[inst].dbg_stmt; | |
| 260 | try s.print("{d}:{d}", .{ dbg_stmt.line + 1, dbg_stmt.column + 1 }); | |
| 261 | } | |
| 262 | ||
| 263 | fn writeCall(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 264 | const pl_op = w.air.instructions.items(.data)[inst].pl_op; | |
| 265 | const extra = w.air.extraData(Air.Call, pl_op.payload); | |
| 266 | const args = @bitCast([]const Air.Inst.Ref, w.air.extra[extra.end..][0..extra.data.args_len]); | |
| 267 | try w.writeOperand(s, inst, 0, pl_op.operand); | |
| 268 | try s.writeAll(", ["); | |
| 269 | for (args) |arg, i| { | |
| 270 | if (i != 0) try s.writeAll(", "); | |
| 271 | try w.writeOperand(s, inst, 1 + i, arg); | |
| 272 | } | |
| 273 | try s.writeAll("]"); | |
| 274 | } | |
| 275 | ||
| 276 | fn writeBr(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 277 | const br = w.air.instructions.items(.data)[inst].br; | |
| 278 | try w.writeInstIndex(s, br.block_inst, false); | |
| 279 | try s.writeAll(", "); | |
| 280 | try w.writeOperand(s, inst, 0, br.operand); | |
| 281 | } | |
| 282 | ||
| 283 | fn writeCondBr(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 284 | const pl_op = w.air.instructions.items(.data)[inst].pl_op; | |
| 285 | const extra = w.air.extraData(Air.CondBr, pl_op.payload); | |
| 286 | const then_body = w.air.extra[extra.end..][0..extra.data.then_body_len]; | |
| 287 | const else_body = w.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; | |
| 288 | const liveness_condbr = w.liveness.getCondBr(inst); | |
| 289 | ||
| 290 | try w.writeOperand(s, inst, 0, pl_op.operand); | |
| 291 | try s.writeAll(", {\n"); | |
| 292 | const old_indent = w.indent; | |
| 293 | w.indent += 2; | |
| 294 | ||
| 295 | if (liveness_condbr.then_deaths.len != 0) { | |
| 296 | try s.writeByteNTimes(' ', w.indent); | |
| 297 | for (liveness_condbr.then_deaths) |operand, i| { | |
| 298 | if (i != 0) try s.writeAll(" "); | |
| 299 | try s.print("%{d}!", .{operand}); | |
| 300 | } | |
| 301 | try s.writeAll("\n"); | |
| 302 | } | |
| 303 | ||
| 304 | try w.writeBody(s, then_body); | |
| 305 | try s.writeByteNTimes(' ', old_indent); | |
| 306 | try s.writeAll("}, {\n"); | |
| 307 | ||
| 308 | if (liveness_condbr.else_deaths.len != 0) { | |
| 309 | try s.writeByteNTimes(' ', w.indent); | |
| 310 | for (liveness_condbr.else_deaths) |operand, i| { | |
| 311 | if (i != 0) try s.writeAll(" "); | |
| 312 | try s.print("%{d}!", .{operand}); | |
| 313 | } | |
| 314 | try s.writeAll("\n"); | |
| 315 | } | |
| 316 | ||
| 317 | try w.writeBody(s, else_body); | |
| 318 | w.indent = old_indent; | |
| 319 | ||
| 320 | try s.writeByteNTimes(' ', old_indent); | |
| 321 | try s.writeAll("}"); | |
| 322 | } | |
| 323 | ||
| 324 | fn writeSwitchBr(w: *Writer, s: anytype, inst: Air.Inst.Index) @TypeOf(s).Error!void { | |
| 325 | const pl_op = w.air.instructions.items(.data)[inst].pl_op; | |
| 326 | const switch_br = w.air.extraData(Air.SwitchBr, pl_op.payload); | |
| 327 | var extra_index: usize = switch_br.end; | |
| 328 | var case_i: u32 = 0; | |
| 329 | ||
| 330 | try w.writeOperand(s, inst, 0, pl_op.operand); | |
| 331 | const old_indent = w.indent; | |
| 332 | w.indent += 2; | |
| 333 | ||
| 334 | while (case_i < switch_br.data.cases_len) : (case_i += 1) { | |
| 335 | const case = w.air.extraData(Air.SwitchBr.Case, extra_index); | |
| 336 | const items = @bitCast([]const Air.Inst.Ref, w.air.extra[case.end..][0..case.data.items_len]); | |
| 337 | const case_body = w.air.extra[case.end + items.len ..][0..case.data.body_len]; | |
| 338 | extra_index = case.end + case.data.items_len + case_body.len; | |
| 339 | ||
| 340 | try s.writeAll(", ["); | |
| 341 | for (items) |item, item_i| { | |
| 342 | if (item_i != 0) try s.writeAll(", "); | |
| 343 | try w.writeInstRef(s, item, false); | |
| 344 | } | |
| 345 | try s.writeAll("] => {\n"); | |
| 346 | w.indent += 2; | |
| 347 | try w.writeBody(s, case_body); | |
| 348 | w.indent -= 2; | |
| 349 | try s.writeByteNTimes(' ', w.indent); | |
| 350 | try s.writeAll("}"); | |
| 351 | } | |
| 352 | ||
| 353 | const else_body = w.air.extra[extra_index..][0..switch_br.data.else_body_len]; | |
| 354 | if (else_body.len != 0) { | |
| 355 | try s.writeAll(", else => {\n"); | |
| 356 | w.indent += 2; | |
| 357 | try w.writeBody(s, else_body); | |
| 358 | w.indent -= 2; | |
| 359 | try s.writeByteNTimes(' ', w.indent); | |
| 360 | try s.writeAll("}"); | |
| 361 | } | |
| 362 | ||
| 363 | try s.writeAll("\n"); | |
| 364 | try s.writeByteNTimes(' ', old_indent); | |
| 365 | try s.writeAll("}"); | |
| 366 | } | |
| 367 | ||
| 368 | fn writeOperand( | |
| 369 | w: *Writer, | |
| 370 | s: anytype, | |
| 371 | inst: Air.Inst.Index, | |
| 372 | op_index: usize, | |
| 373 | operand: Air.Inst.Ref, | |
| 374 | ) @TypeOf(s).Error!void { | |
| 375 | const dies = if (op_index < Liveness.bpi - 1) | |
| 376 | w.liveness.operandDies(inst, @intCast(Liveness.OperandInt, op_index)) | |
| 377 | else blk: { | |
| 378 | // TODO | |
| 379 | break :blk false; | |
| 380 | }; | |
| 381 | return w.writeInstRef(s, operand, dies); | |
| 382 | } | |
| 383 | ||
| 384 | fn writeInstRef( | |
| 385 | w: *Writer, | |
| 386 | s: anytype, | |
| 387 | operand: Air.Inst.Ref, | |
| 388 | dies: bool, | |
| 389 | ) @TypeOf(s).Error!void { | |
| 390 | var i: usize = @enumToInt(operand); | |
| 391 | ||
| 392 | if (i < Air.Inst.Ref.typed_value_map.len) { | |
| 393 | return s.print("@{}", .{operand}); | |
| 394 | } | |
| 395 | i -= Air.Inst.Ref.typed_value_map.len; | |
| 396 | ||
| 397 | return w.writeInstIndex(s, @intCast(Air.Inst.Index, i), dies); | |
| 398 | } | |
| 399 | ||
| 400 | fn writeInstIndex( | |
| 401 | w: *Writer, | |
| 402 | s: anytype, | |
| 403 | inst: Air.Inst.Index, | |
| 404 | dies: bool, | |
| 405 | ) @TypeOf(s).Error!void { | |
| 406 | _ = w; | |
| 407 | if (dies) { | |
| 408 | try s.print("%{d}!", .{inst}); | |
| 409 | } else { | |
| 410 | try s.print("%{d}", .{inst}); | |
| 411 | } | |
| 412 | } | |
| 413 | }; |
src/register_manager.zig+30-47
| ... | ... | @@ -3,7 +3,7 @@ const math = std.math; |
| 3 | 3 | const mem = std.mem; |
| 4 | 4 | const assert = std.debug.assert; |
| 5 | 5 | const Allocator = std.mem.Allocator; |
| 6 | const ir = @import("air.zig"); | |
| 6 | const Air = @import("Air.zig"); | |
| 7 | 7 | const Type = @import("type.zig").Type; |
| 8 | 8 | const Module = @import("Module.zig"); |
| 9 | 9 | const LazySrcLoc = Module.LazySrcLoc; |
| ... | ... | @@ -20,7 +20,7 @@ pub fn RegisterManager( |
| 20 | 20 | ) type { |
| 21 | 21 | return struct { |
| 22 | 22 | /// The key must be canonical register. |
| 23 | registers: [callee_preserved_regs.len]?*ir.Inst = [_]?*ir.Inst{null} ** callee_preserved_regs.len, | |
| 23 | registers: [callee_preserved_regs.len]?Air.Inst.Index = [_]?Air.Inst.Index{null} ** callee_preserved_regs.len, | |
| 24 | 24 | free_registers: FreeRegInt = math.maxInt(FreeRegInt), |
| 25 | 25 | /// Tracks all registers allocated in the course of this function |
| 26 | 26 | allocated_registers: FreeRegInt = 0, |
| ... | ... | @@ -75,7 +75,7 @@ pub fn RegisterManager( |
| 75 | 75 | pub fn tryAllocRegs( |
| 76 | 76 | self: *Self, |
| 77 | 77 | comptime count: comptime_int, |
| 78 | insts: [count]?*ir.Inst, | |
| 78 | insts: [count]?Air.Inst.Index, | |
| 79 | 79 | exceptions: []const Register, |
| 80 | 80 | ) ?[count]Register { |
| 81 | 81 | comptime if (callee_preserved_regs.len == 0) return null; |
| ... | ... | @@ -113,7 +113,7 @@ pub fn RegisterManager( |
| 113 | 113 | /// Allocates a register and optionally tracks it with a |
| 114 | 114 | /// corresponding instruction. Returns `null` if all registers |
| 115 | 115 | /// are allocated. |
| 116 | pub fn tryAllocReg(self: *Self, inst: ?*ir.Inst, exceptions: []const Register) ?Register { | |
| 116 | pub fn tryAllocReg(self: *Self, inst: ?Air.Inst.Index, exceptions: []const Register) ?Register { | |
| 117 | 117 | return if (tryAllocRegs(self, 1, .{inst}, exceptions)) |regs| regs[0] else null; |
| 118 | 118 | } |
| 119 | 119 | |
| ... | ... | @@ -123,7 +123,7 @@ pub fn RegisterManager( |
| 123 | 123 | pub fn allocRegs( |
| 124 | 124 | self: *Self, |
| 125 | 125 | comptime count: comptime_int, |
| 126 | insts: [count]?*ir.Inst, | |
| 126 | insts: [count]?Air.Inst.Index, | |
| 127 | 127 | exceptions: []const Register, |
| 128 | 128 | ) ![count]Register { |
| 129 | 129 | comptime assert(count > 0 and count <= callee_preserved_regs.len); |
| ... | ... | @@ -147,14 +147,14 @@ pub fn RegisterManager( |
| 147 | 147 | self.markRegUsed(reg); |
| 148 | 148 | } else { |
| 149 | 149 | const spilled_inst = self.registers[index].?; |
| 150 | try self.getFunction().spillInstruction(spilled_inst.src, reg, spilled_inst); | |
| 150 | try self.getFunction().spillInstruction(reg, spilled_inst); | |
| 151 | 151 | } |
| 152 | 152 | self.registers[index] = inst; |
| 153 | 153 | } else { |
| 154 | 154 | // Don't track the register |
| 155 | 155 | if (!self.isRegFree(reg)) { |
| 156 | 156 | const spilled_inst = self.registers[index].?; |
| 157 | try self.getFunction().spillInstruction(spilled_inst.src, reg, spilled_inst); | |
| 157 | try self.getFunction().spillInstruction(reg, spilled_inst); | |
| 158 | 158 | self.freeReg(reg); |
| 159 | 159 | } |
| 160 | 160 | } |
| ... | ... | @@ -168,14 +168,14 @@ pub fn RegisterManager( |
| 168 | 168 | |
| 169 | 169 | /// Allocates a register and optionally tracks it with a |
| 170 | 170 | /// corresponding instruction. |
| 171 | pub fn allocReg(self: *Self, inst: ?*ir.Inst, exceptions: []const Register) !Register { | |
| 171 | pub fn allocReg(self: *Self, inst: ?Air.Inst.Index, exceptions: []const Register) !Register { | |
| 172 | 172 | return (try self.allocRegs(1, .{inst}, exceptions))[0]; |
| 173 | 173 | } |
| 174 | 174 | |
| 175 | 175 | /// Spills the register if it is currently allocated. If a |
| 176 | 176 | /// corresponding instruction is passed, will also track this |
| 177 | 177 | /// register. |
| 178 | pub fn getReg(self: *Self, reg: Register, inst: ?*ir.Inst) !void { | |
| 178 | pub fn getReg(self: *Self, reg: Register, inst: ?Air.Inst.Index) !void { | |
| 179 | 179 | const index = reg.allocIndex() orelse return; |
| 180 | 180 | |
| 181 | 181 | if (inst) |tracked_inst| |
| ... | ... | @@ -184,7 +184,7 @@ pub fn RegisterManager( |
| 184 | 184 | // stack allocation. |
| 185 | 185 | const spilled_inst = self.registers[index].?; |
| 186 | 186 | self.registers[index] = tracked_inst; |
| 187 | try self.getFunction().spillInstruction(spilled_inst.src, reg, spilled_inst); | |
| 187 | try self.getFunction().spillInstruction(reg, spilled_inst); | |
| 188 | 188 | } else { |
| 189 | 189 | self.getRegAssumeFree(reg, tracked_inst); |
| 190 | 190 | } |
| ... | ... | @@ -193,7 +193,7 @@ pub fn RegisterManager( |
| 193 | 193 | // Move the instruction that was previously there to a |
| 194 | 194 | // stack allocation. |
| 195 | 195 | const spilled_inst = self.registers[index].?; |
| 196 | try self.getFunction().spillInstruction(spilled_inst.src, reg, spilled_inst); | |
| 196 | try self.getFunction().spillInstruction(reg, spilled_inst); | |
| 197 | 197 | self.freeReg(reg); |
| 198 | 198 | } |
| 199 | 199 | } |
| ... | ... | @@ -202,7 +202,7 @@ pub fn RegisterManager( |
| 202 | 202 | /// Allocates the specified register with the specified |
| 203 | 203 | /// instruction. Asserts that the register is free and no |
| 204 | 204 | /// spilling is necessary. |
| 205 | pub fn getRegAssumeFree(self: *Self, reg: Register, inst: *ir.Inst) void { | |
| 205 | pub fn getRegAssumeFree(self: *Self, reg: Register, inst: Air.Inst.Index) void { | |
| 206 | 206 | const index = reg.allocIndex() orelse return; |
| 207 | 207 | |
| 208 | 208 | assert(self.registers[index] == null); |
| ... | ... | @@ -264,8 +264,7 @@ fn MockFunction(comptime Register: type) type { |
| 264 | 264 | self.spilled.deinit(self.allocator); |
| 265 | 265 | } |
| 266 | 266 | |
| 267 | pub fn spillInstruction(self: *Self, src: LazySrcLoc, reg: Register, inst: *ir.Inst) !void { | |
| 268 | _ = src; | |
| 267 | pub fn spillInstruction(self: *Self, reg: Register, inst: Air.Inst.Index) !void { | |
| 269 | 268 | _ = inst; |
| 270 | 269 | try self.spilled.append(self.allocator, reg); |
| 271 | 270 | } |
| ... | ... | @@ -297,15 +296,11 @@ test "tryAllocReg: no spilling" { |
| 297 | 296 | }; |
| 298 | 297 | defer function.deinit(); |
| 299 | 298 | |
| 300 | var mock_instruction = ir.Inst{ | |
| 301 | .tag = .breakpoint, | |
| 302 | .ty = Type.initTag(.void), | |
| 303 | .src = .unneeded, | |
| 304 | }; | |
| 299 | const mock_instruction: Air.Inst.Index = 1; | |
| 305 | 300 | |
| 306 | try expectEqual(@as(?MockRegister1, .r2), function.register_manager.tryAllocReg(&mock_instruction, &.{})); | |
| 307 | try expectEqual(@as(?MockRegister1, .r3), function.register_manager.tryAllocReg(&mock_instruction, &.{})); | |
| 308 | try expectEqual(@as(?MockRegister1, null), function.register_manager.tryAllocReg(&mock_instruction, &.{})); | |
| 301 | try expectEqual(@as(?MockRegister1, .r2), function.register_manager.tryAllocReg(mock_instruction, &.{})); | |
| 302 | try expectEqual(@as(?MockRegister1, .r3), function.register_manager.tryAllocReg(mock_instruction, &.{})); | |
| 303 | try expectEqual(@as(?MockRegister1, null), function.register_manager.tryAllocReg(mock_instruction, &.{})); | |
| 309 | 304 | |
| 310 | 305 | try expect(function.register_manager.isRegAllocated(.r2)); |
| 311 | 306 | try expect(function.register_manager.isRegAllocated(.r3)); |
| ... | ... | @@ -329,28 +324,24 @@ test "allocReg: spilling" { |
| 329 | 324 | }; |
| 330 | 325 | defer function.deinit(); |
| 331 | 326 | |
| 332 | var mock_instruction = ir.Inst{ | |
| 333 | .tag = .breakpoint, | |
| 334 | .ty = Type.initTag(.void), | |
| 335 | .src = .unneeded, | |
| 336 | }; | |
| 327 | const mock_instruction: Air.Inst.Index = 1; | |
| 337 | 328 | |
| 338 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg(&mock_instruction, &.{})); | |
| 339 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(&mock_instruction, &.{})); | |
| 329 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg(mock_instruction, &.{})); | |
| 330 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(mock_instruction, &.{})); | |
| 340 | 331 | |
| 341 | 332 | // Spill a register |
| 342 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg(&mock_instruction, &.{})); | |
| 333 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg(mock_instruction, &.{})); | |
| 343 | 334 | try expectEqualSlices(MockRegister1, &[_]MockRegister1{.r2}, function.spilled.items); |
| 344 | 335 | |
| 345 | 336 | // No spilling necessary |
| 346 | 337 | function.register_manager.freeReg(.r3); |
| 347 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(&mock_instruction, &.{})); | |
| 338 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(mock_instruction, &.{})); | |
| 348 | 339 | try expectEqualSlices(MockRegister1, &[_]MockRegister1{.r2}, function.spilled.items); |
| 349 | 340 | |
| 350 | 341 | // Exceptions |
| 351 | 342 | function.register_manager.freeReg(.r2); |
| 352 | 343 | function.register_manager.freeReg(.r3); |
| 353 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(&mock_instruction, &.{.r2})); | |
| 344 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(mock_instruction, &.{.r2})); | |
| 354 | 345 | } |
| 355 | 346 | |
| 356 | 347 | test "tryAllocRegs" { |
| ... | ... | @@ -378,16 +369,12 @@ test "allocRegs" { |
| 378 | 369 | }; |
| 379 | 370 | defer function.deinit(); |
| 380 | 371 | |
| 381 | var mock_instruction = ir.Inst{ | |
| 382 | .tag = .breakpoint, | |
| 383 | .ty = Type.initTag(.void), | |
| 384 | .src = .unneeded, | |
| 385 | }; | |
| 372 | const mock_instruction: Air.Inst.Index = 1; | |
| 386 | 373 | |
| 387 | 374 | try expectEqual([_]MockRegister2{ .r0, .r1, .r2 }, try function.register_manager.allocRegs(3, .{ |
| 388 | &mock_instruction, | |
| 389 | &mock_instruction, | |
| 390 | &mock_instruction, | |
| 375 | mock_instruction, | |
| 376 | mock_instruction, | |
| 377 | mock_instruction, | |
| 391 | 378 | }, &.{})); |
| 392 | 379 | |
| 393 | 380 | // Exceptions |
| ... | ... | @@ -403,13 +390,9 @@ test "getReg" { |
| 403 | 390 | }; |
| 404 | 391 | defer function.deinit(); |
| 405 | 392 | |
| 406 | var mock_instruction = ir.Inst{ | |
| 407 | .tag = .breakpoint, | |
| 408 | .ty = Type.initTag(.void), | |
| 409 | .src = .unneeded, | |
| 410 | }; | |
| 393 | const mock_instruction: Air.Inst.Index = 1; | |
| 411 | 394 | |
| 412 | try function.register_manager.getReg(.r3, &mock_instruction); | |
| 395 | try function.register_manager.getReg(.r3, mock_instruction); | |
| 413 | 396 | |
| 414 | 397 | try expect(!function.register_manager.isRegAllocated(.r2)); |
| 415 | 398 | try expect(function.register_manager.isRegAllocated(.r3)); |
| ... | ... | @@ -417,7 +400,7 @@ test "getReg" { |
| 417 | 400 | try expect(!function.register_manager.isRegFree(.r3)); |
| 418 | 401 | |
| 419 | 402 | // Spill r3 |
| 420 | try function.register_manager.getReg(.r3, &mock_instruction); | |
| 403 | try function.register_manager.getReg(.r3, mock_instruction); | |
| 421 | 404 | |
| 422 | 405 | try expect(!function.register_manager.isRegAllocated(.r2)); |
| 423 | 406 | try expect(function.register_manager.isRegAllocated(.r3)); |
src/stage1/astgen.cpp-3
| ... | ... | @@ -3821,9 +3821,6 @@ static Stage1ZirInst *astgen_identifier(Stage1AstGen *ag, Scope *scope, AstNode |
| 3821 | 3821 | const_instruction->value->special = ConstValSpecialStatic; |
| 3822 | 3822 | const_instruction->value->data.x_ptr.special = ConstPtrSpecialDiscard; |
| 3823 | 3823 | return &const_instruction->base; |
| 3824 | } else { | |
| 3825 | add_node_error(ag->codegen, node, buf_sprintf("`_` may only be used to assign things to")); | |
| 3826 | return ag->codegen->invalid_inst_src; | |
| 3827 | 3824 | } |
| 3828 | 3825 | } |
| 3829 | 3826 |
src/stage1/ir.cpp+6-14
| ... | ... | @@ -24261,12 +24261,6 @@ static Stage1AirInst *ir_analyze_instruction_src(IrAnalyze *ira, Stage1ZirInstSr |
| 24261 | 24261 | return ira->codegen->invalid_inst_gen; |
| 24262 | 24262 | } |
| 24263 | 24263 | |
| 24264 | ZigType *u8_ptr = get_pointer_to_type_extra2( | |
| 24265 | ira->codegen, ira->codegen->builtin_types.entry_u8, | |
| 24266 | true, false, PtrLenUnknown, | |
| 24267 | 0, 0, 0, false, VECTOR_INDEX_NONE, nullptr, ira->codegen->intern.for_zero_byte()); | |
| 24268 | ZigType *u8_slice = get_slice_type(ira->codegen, u8_ptr); | |
| 24269 | ||
| 24270 | 24264 | ZigType *source_location_type = get_builtin_type(ira->codegen, "SourceLocation"); |
| 24271 | 24265 | if (type_resolve(ira->codegen, source_location_type, ResolveStatusSizeKnown)) { |
| 24272 | 24266 | zig_unreachable(); |
| ... | ... | @@ -24286,18 +24280,16 @@ static Stage1AirInst *ir_analyze_instruction_src(IrAnalyze *ira, Stage1ZirInstSr |
| 24286 | 24280 | ZigType *import = instruction->base.source_node->owner; |
| 24287 | 24281 | RootStruct *root_struct = import->data.structure.root_struct; |
| 24288 | 24282 | Buf *path = root_struct->path; |
| 24289 | ZigValue *file_name = create_const_str_lit(ira->codegen, path)->data.x_ptr.data.ref.pointee; | |
| 24290 | init_const_slice(ira->codegen, fields[0], file_name, 0, buf_len(path), true, nullptr); | |
| 24291 | fields[0]->type = u8_slice; | |
| 24283 | fields[0] = create_sentineled_str_lit( | |
| 24284 | ira->codegen, path, | |
| 24285 | ira->codegen->intern.for_zero_byte()); | |
| 24292 | 24286 | |
| 24293 | 24287 | // fn_name: [:0]const u8 |
| 24294 | 24288 | ensure_field_index(source_location_type, "fn_name", 1); |
| 24295 | 24289 | fields[1]->special = ConstValSpecialStatic; |
| 24296 | ||
| 24297 | ZigValue *fn_name = create_const_str_lit(ira->codegen, &fn_entry->symbol_name)->data.x_ptr.data.ref.pointee; | |
| 24298 | init_const_slice(ira->codegen, fields[1], fn_name, 0, buf_len(&fn_entry->symbol_name), true, nullptr); | |
| 24299 | fields[1]->type = u8_slice; | |
| 24300 | ||
| 24290 | fields[1] = create_sentineled_str_lit( | |
| 24291 | ira->codegen, &fn_entry->symbol_name, | |
| 24292 | ira->codegen->intern.for_zero_byte()); | |
| 24301 | 24293 | |
| 24302 | 24294 | TokenLoc tok_loc = root_struct->token_locs[instruction->base.source_node->main_token]; |
| 24303 | 24295 |
src/stage1/stage1.h+1
| ... | ... | @@ -97,6 +97,7 @@ enum Os { |
| 97 | 97 | OsOpenCL, |
| 98 | 98 | OsGLSL450, |
| 99 | 99 | OsVulkan, |
| 100 | OsPlan9, | |
| 100 | 101 | OsOther, |
| 101 | 102 | }; |
| 102 | 103 |
src/stage1/target.cpp+6
| ... | ... | @@ -125,6 +125,7 @@ static const Os os_list[] = { |
| 125 | 125 | OsOpenCL, |
| 126 | 126 | OsGLSL450, |
| 127 | 127 | OsVulkan, |
| 128 | OsPlan9, | |
| 128 | 129 | OsOther, |
| 129 | 130 | }; |
| 130 | 131 | |
| ... | ... | @@ -219,6 +220,7 @@ ZigLLVM_OSType get_llvm_os_type(Os os_type) { |
| 219 | 220 | case OsOpenCL: |
| 220 | 221 | case OsGLSL450: |
| 221 | 222 | case OsVulkan: |
| 223 | case OsPlan9: | |
| 222 | 224 | case OsOther: |
| 223 | 225 | return ZigLLVM_UnknownOS; |
| 224 | 226 | case OsAnanas: |
| ... | ... | @@ -298,6 +300,8 @@ const char *target_os_name(Os os_type) { |
| 298 | 300 | switch (os_type) { |
| 299 | 301 | case OsFreestanding: |
| 300 | 302 | return "freestanding"; |
| 303 | case OsPlan9: | |
| 304 | return "plan9"; | |
| 301 | 305 | case OsUefi: |
| 302 | 306 | return "uefi"; |
| 303 | 307 | case OsOther: |
| ... | ... | @@ -667,6 +671,7 @@ uint32_t target_c_type_size_in_bits(const ZigTarget *target, CIntType id) { |
| 667 | 671 | case OsWASI: |
| 668 | 672 | case OsHaiku: |
| 669 | 673 | case OsEmscripten: |
| 674 | case OsPlan9: | |
| 670 | 675 | switch (id) { |
| 671 | 676 | case CIntTypeShort: |
| 672 | 677 | case CIntTypeUShort: |
| ... | ... | @@ -975,6 +980,7 @@ ZigLLVM_EnvironmentType target_default_abi(ZigLLVM_ArchType arch, Os os) { |
| 975 | 980 | case OsOpenCL: |
| 976 | 981 | case OsGLSL450: |
| 977 | 982 | case OsVulkan: |
| 983 | case OsPlan9: | |
| 978 | 984 | return ZigLLVM_UnknownEnvironment; |
| 979 | 985 | } |
| 980 | 986 | zig_unreachable(); |
src/test.zig+8-3
| ... | ... | @@ -1,4 +1,5 @@ |
| 1 | 1 | const std = @import("std"); |
| 2 | const builtin = @import("builtin"); | |
| 2 | 3 | const link = @import("link.zig"); |
| 3 | 4 | const Compilation = @import("Compilation.zig"); |
| 4 | 5 | const Allocator = std.mem.Allocator; |
| ... | ... | @@ -610,7 +611,7 @@ pub const TestContext = struct { |
| 610 | 611 | |
| 611 | 612 | fn run(self: *TestContext) !void { |
| 612 | 613 | var progress = std.Progress{}; |
| 613 | const root_node = try progress.start("tests", self.cases.items.len); | |
| 614 | const root_node = try progress.start("compiler", self.cases.items.len); | |
| 614 | 615 | defer root_node.end(); |
| 615 | 616 | |
| 616 | 617 | var zig_lib_directory = try introspect.findZigLibDir(std.testing.allocator); |
| ... | ... | @@ -640,8 +641,12 @@ pub const TestContext = struct { |
| 640 | 641 | var fail_count: usize = 0; |
| 641 | 642 | |
| 642 | 643 | for (self.cases.items) |case| { |
| 643 | if (build_options.skip_non_native and case.target.getCpuArch() != std.Target.current.cpu.arch) | |
| 644 | continue; | |
| 644 | if (build_options.skip_non_native) { | |
| 645 | if (case.target.getCpuArch() != builtin.cpu.arch) | |
| 646 | continue; | |
| 647 | if (case.target.getObjectFormat() != builtin.object_format) | |
| 648 | continue; | |
| 649 | } | |
| 645 | 650 | |
| 646 | 651 | // Skip tests that require LLVM backend when it is not available |
| 647 | 652 | if (!build_options.have_llvm and case.backend == .llvm) |
src/translate_c.zig-4
| ... | ... | @@ -4951,10 +4951,6 @@ fn transMacroDefine(c: *Context, m: *MacroCtx) ParseError!void { |
| 4951 | 4951 | const scope = &c.global_scope.base; |
| 4952 | 4952 | |
| 4953 | 4953 | const init_node = try parseCExpr(c, m, scope); |
| 4954 | if (init_node.castTag(.identifier)) |ident_node| { | |
| 4955 | if (mem.eql(u8, "_", ident_node.data)) | |
| 4956 | return m.fail(c, "unable to translate C expr: illegal identifier _", .{}); | |
| 4957 | } | |
| 4958 | 4954 | const last = m.next().?; |
| 4959 | 4955 | if (last != .Eof and last != .Nl) |
| 4960 | 4956 | return m.fail(c, "unable to translate C expr: unexpected token .{s}", .{@tagName(last)}); |
src/value.zig+3-3
| ... | ... | @@ -7,7 +7,7 @@ const BigIntMutable = std.math.big.int.Mutable; |
| 7 | 7 | const Target = std.Target; |
| 8 | 8 | const Allocator = std.mem.Allocator; |
| 9 | 9 | const Module = @import("Module.zig"); |
| 10 | const ir = @import("air.zig"); | |
| 10 | const Air = @import("Air.zig"); | |
| 11 | 11 | |
| 12 | 12 | /// This is the raw data, with no bookkeeping, no memory awareness, |
| 13 | 13 | /// no de-duplication, and no type system awareness. |
| ... | ... | @@ -573,7 +573,7 @@ pub const Value = extern union { |
| 573 | 573 | .int_i64 => return std.fmt.formatIntValue(val.castTag(.int_i64).?.data, "", options, out_stream), |
| 574 | 574 | .int_big_positive => return out_stream.print("{}", .{val.castTag(.int_big_positive).?.asBigInt()}), |
| 575 | 575 | .int_big_negative => return out_stream.print("{}", .{val.castTag(.int_big_negative).?.asBigInt()}), |
| 576 | .function => return out_stream.writeAll("(function)"), | |
| 576 | .function => return out_stream.print("(function '{s}')", .{val.castTag(.function).?.data.owner_decl.name}), | |
| 577 | 577 | .extern_fn => return out_stream.writeAll("(extern function)"), |
| 578 | 578 | .variable => return out_stream.writeAll("(variable)"), |
| 579 | 579 | .ref_val => { |
| ... | ... | @@ -1700,7 +1700,7 @@ pub const Value = extern union { |
| 1700 | 1700 | /// peer type resolution. This is stored in a separate list so that |
| 1701 | 1701 | /// the items are contiguous in memory and thus can be passed to |
| 1702 | 1702 | /// `Module.resolvePeerTypes`. |
| 1703 | stored_inst_list: std.ArrayListUnmanaged(*ir.Inst) = .{}, | |
| 1703 | stored_inst_list: std.ArrayListUnmanaged(Air.Inst.Ref) = .{}, | |
| 1704 | 1704 | }, |
| 1705 | 1705 | }; |
| 1706 | 1706 |
test/behavior/bugs/3779.zig+18
| ... | ... | @@ -40,3 +40,21 @@ test "@embedFile() returns a string literal" { |
| 40 | 40 | try std.testing.expectEqualStrings(expected_contents, actual_contents); |
| 41 | 41 | try std.testing.expectEqualStrings(expected_contents, ptr_actual_contents[0..actual_contents.len]); |
| 42 | 42 | } |
| 43 | ||
| 44 | fn testFnForSrc() std.builtin.SourceLocation { | |
| 45 | return @src(); | |
| 46 | } | |
| 47 | ||
| 48 | test "@src() returns a struct containing 0-terminated string slices" { | |
| 49 | const src = testFnForSrc(); | |
| 50 | try std.testing.expectEqual([:0]const u8, @TypeOf(src.file)); | |
| 51 | try std.testing.expect(std.mem.endsWith(u8, src.file, "3779.zig")); | |
| 52 | try std.testing.expectEqual([:0]const u8, @TypeOf(src.fn_name)); | |
| 53 | try std.testing.expect(std.mem.endsWith(u8, src.fn_name, "testFnForSrc")); | |
| 54 | ||
| 55 | const ptr_src_file: [*:0]const u8 = src.file; | |
| 56 | _ = ptr_src_file; // unused | |
| 57 | ||
| 58 | const ptr_src_fn_name: [*:0]const u8 = src.fn_name; | |
| 59 | _ = ptr_src_fn_name; // unused | |
| 60 | } |
test/run_translated_c.zig+12
| ... | ... | @@ -1647,4 +1647,16 @@ pub fn addCases(cases: *tests.RunTranslatedCContext) void { |
| 1647 | 1647 | \\ if (a != 1) abort(); |
| 1648 | 1648 | \\} |
| 1649 | 1649 | , ""); |
| 1650 | ||
| 1651 | cases.add("Underscore identifiers", | |
| 1652 | \\#include <stdlib.h> | |
| 1653 | \\int _ = 10; | |
| 1654 | \\typedef struct { int _; } S; | |
| 1655 | \\int main(void) { | |
| 1656 | \\ if (_ != 10) abort(); | |
| 1657 | \\ S foo = { ._ = _ }; | |
| 1658 | \\ if (foo._ != _) abort(); | |
| 1659 | \\ return 0; | |
| 1660 | \\} | |
| 1661 | , ""); | |
| 1650 | 1662 | } |
test/stage2/wasm.zig+62-60
| ... | ... | @@ -479,66 +479,68 @@ pub fn addCases(ctx: *TestContext) !void { |
| 479 | 479 | , "30\n"); |
| 480 | 480 | } |
| 481 | 481 | |
| 482 | { | |
| 483 | var case = ctx.exe("wasm switch", wasi); | |
| 484 | ||
| 485 | case.addCompareOutput( | |
| 486 | \\pub export fn _start() u32 { | |
| 487 | \\ var val: u32 = 1; | |
| 488 | \\ var a: u32 = switch (val) { | |
| 489 | \\ 0, 1 => 2, | |
| 490 | \\ 2 => 3, | |
| 491 | \\ 3 => 4, | |
| 492 | \\ else => 5, | |
| 493 | \\ }; | |
| 494 | \\ | |
| 495 | \\ return a; | |
| 496 | \\} | |
| 497 | , "2\n"); | |
| 498 | ||
| 499 | case.addCompareOutput( | |
| 500 | \\pub export fn _start() u32 { | |
| 501 | \\ var val: u32 = 2; | |
| 502 | \\ var a: u32 = switch (val) { | |
| 503 | \\ 0, 1 => 2, | |
| 504 | \\ 2 => 3, | |
| 505 | \\ 3 => 4, | |
| 506 | \\ else => 5, | |
| 507 | \\ }; | |
| 508 | \\ | |
| 509 | \\ return a; | |
| 510 | \\} | |
| 511 | , "3\n"); | |
| 512 | ||
| 513 | case.addCompareOutput( | |
| 514 | \\pub export fn _start() u32 { | |
| 515 | \\ var val: u32 = 10; | |
| 516 | \\ var a: u32 = switch (val) { | |
| 517 | \\ 0, 1 => 2, | |
| 518 | \\ 2 => 3, | |
| 519 | \\ 3 => 4, | |
| 520 | \\ else => 5, | |
| 521 | \\ }; | |
| 522 | \\ | |
| 523 | \\ return a; | |
| 524 | \\} | |
| 525 | , "5\n"); | |
| 526 | ||
| 527 | case.addCompareOutput( | |
| 528 | \\const MyEnum = enum { One, Two, Three }; | |
| 529 | \\ | |
| 530 | \\pub export fn _start() u32 { | |
| 531 | \\ var val: MyEnum = .Two; | |
| 532 | \\ var a: u32 = switch (val) { | |
| 533 | \\ .One => 1, | |
| 534 | \\ .Two => 2, | |
| 535 | \\ .Three => 3, | |
| 536 | \\ }; | |
| 537 | \\ | |
| 538 | \\ return a; | |
| 539 | \\} | |
| 540 | , "2\n"); | |
| 541 | } | |
| 482 | // This test case is disabled until the codegen for switch is reworked | |
| 483 | // to take advantage of br_table rather than a series of br_if opcodes. | |
| 484 | //{ | |
| 485 | // var case = ctx.exe("wasm switch", wasi); | |
| 486 | ||
| 487 | // case.addCompareOutput( | |
| 488 | // \\pub export fn _start() u32 { | |
| 489 | // \\ var val: u32 = 1; | |
| 490 | // \\ var a: u32 = switch (val) { | |
| 491 | // \\ 0, 1 => 2, | |
| 492 | // \\ 2 => 3, | |
| 493 | // \\ 3 => 4, | |
| 494 | // \\ else => 5, | |
| 495 | // \\ }; | |
| 496 | // \\ | |
| 497 | // \\ return a; | |
| 498 | // \\} | |
| 499 | // , "2\n"); | |
| 500 | ||
| 501 | // case.addCompareOutput( | |
| 502 | // \\pub export fn _start() u32 { | |
| 503 | // \\ var val: u32 = 2; | |
| 504 | // \\ var a: u32 = switch (val) { | |
| 505 | // \\ 0, 1 => 2, | |
| 506 | // \\ 2 => 3, | |
| 507 | // \\ 3 => 4, | |
| 508 | // \\ else => 5, | |
| 509 | // \\ }; | |
| 510 | // \\ | |
| 511 | // \\ return a; | |
| 512 | // \\} | |
| 513 | // , "3\n"); | |
| 514 | ||
| 515 | // case.addCompareOutput( | |
| 516 | // \\pub export fn _start() u32 { | |
| 517 | // \\ var val: u32 = 10; | |
| 518 | // \\ var a: u32 = switch (val) { | |
| 519 | // \\ 0, 1 => 2, | |
| 520 | // \\ 2 => 3, | |
| 521 | // \\ 3 => 4, | |
| 522 | // \\ else => 5, | |
| 523 | // \\ }; | |
| 524 | // \\ | |
| 525 | // \\ return a; | |
| 526 | // \\} | |
| 527 | // , "5\n"); | |
| 528 | ||
| 529 | // case.addCompareOutput( | |
| 530 | // \\const MyEnum = enum { One, Two, Three }; | |
| 531 | // \\ | |
| 532 | // \\pub export fn _start() u32 { | |
| 533 | // \\ var val: MyEnum = .Two; | |
| 534 | // \\ var a: u32 = switch (val) { | |
| 535 | // \\ .One => 1, | |
| 536 | // \\ .Two => 2, | |
| 537 | // \\ .Three => 3, | |
| 538 | // \\ }; | |
| 539 | // \\ | |
| 540 | // \\ return a; | |
| 541 | // \\} | |
| 542 | // , "2\n"); | |
| 543 | //} | |
| 542 | 544 | |
| 543 | 545 | { |
| 544 | 546 | var case = ctx.exe("wasm error unions", wasi); |
test/translate_c.zig+5-2
| ... | ... | @@ -3616,9 +3616,12 @@ pub fn addCases(cases: *tests.TranslateCContext) void { |
| 3616 | 3616 | \\} |
| 3617 | 3617 | }); |
| 3618 | 3618 | |
| 3619 | cases.add("Don't allow underscore identifier in macros", | |
| 3619 | cases.add("Use @ syntax for bare underscore identifier in macro or public symbol", | |
| 3620 | 3620 | \\#define FOO _ |
| 3621 | \\int _ = 42; | |
| 3621 | 3622 | , &[_][]const u8{ |
| 3622 | \\pub const FOO = @compileError("unable to translate C expr: illegal identifier _"); | |
| 3623 | \\pub const FOO = @"_"; | |
| 3624 | , | |
| 3625 | \\pub export var @"_": c_int = 42; | |
| 3623 | 3626 | }); |
| 3624 | 3627 | } |