Compare commits

..

19 Commits

Author SHA1 Message Date
Rekai Nyangadzayi Musuka 61a869f0c5 chore: update for loop in RingBuffer impl 2023-02-22 16:45:06 -06:00
Rekai Nyangadzayi Musuka 5f0eb995bd chore: update gui libs to latest zig master 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 3f2a19c890 chore: add gui deps to README.md 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka cef2c83485 chore: update nfd-zig
respond to build.zig changes in zig master
2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 1a794d0bd4 feat: implement menu bar + add file picker dep 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 396f81ed1f feat: show game title as imgui screen title 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 37ebc88d89 chore: update zgui 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka ff1cceed0c feat: add scheduler ui 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 8656392276 feat: pause emu when UI reads emu state 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 24f1125ee8 feat: implement ui for register, interrupt 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka cc78e7ecf0 feat: add system information window 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 6484bb5285 fix: update zgui to work with sdl2 vcpkg package 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 4401fe2aae feat: add imgui support using zgui 2023-02-22 16:43:08 -06:00
Rekai Nyangadzayi Musuka 024151a5c1 chore: update to latest zig master 2023-02-22 14:46:46 -06:00
Rekai Nyangadzayi Musuka e380af7056 chore: use a more efficient decimal->bcd algorithm
This will not improve perf in any way because this code only gets run
one time a second orz
2023-02-21 23:22:42 -06:00
Rekai Nyangadzayi Musuka e654abfd1d ci: don't assume any cpu features 2023-02-18 23:52:51 -06:00
Rekai Nyangadzayi Musuka 3510a6cff8 chore: drop macOS support
CI is currently broken and I don't have the $$$ for macOS
2023-02-18 23:34:59 -06:00
Rekai Nyangadzayi Musuka 3fb351e762 chore: update SDL.zig 2023-02-17 00:05:42 -06:00
Rekai Nyangadzayi Musuka a11b96b84e chore: update minimum zig version 2023-02-07 17:52:16 -06:00
18 changed files with 52 additions and 71 deletions

View File

@ -14,7 +14,8 @@ jobs:
build:
strategy:
matrix:
os: [ubuntu-latest, windows-latest, macos-latest]
# os: [ubuntu-latest, windows-latest, macos-latest]
os: [ubuntu-latest, windows-latest]
runs-on: ${{matrix.os}}
steps:
- uses: goto-bus-stop/setup-zig@v2
@ -39,7 +40,7 @@ jobs:
with:
submodules: true
- name: build
run: zig build -Doptimize=ReleaseSafe
run: zig build -Doptimize=ReleaseSafe -Dcpu=baseline
- name: upload
uses: actions/upload-artifact@v3
with:

View File

@ -77,7 +77,7 @@ arm7wrestler GBA Fixed | [destoer](https://github.com/destoer)
## Compiling
Most recently built on Zig [v0.11.0-dev.1557+03cdb4fb5](https://github.com/ziglang/zig/tree/03cdb4fb5)
Most recently built on Zig [v0.11.0-dev.1580+a5b34a61a](https://github.com/ziglang/zig/tree/a5b34a61a)
### Dependencies
@ -98,7 +98,7 @@ Use `git submodule update --init` from the project root to pull the git relevant
Be sure to provide SDL2 using:
- Linux: Your distro's package manager
- MacOS: `brew` (install [this formula](https://formulae.brew.sh/formula/sdl2))
- macOS: ¯\\\_(ツ)_/¯ (try [this formula](https://formulae.brew.sh/formula/sdl2)?)
- Windows: [`vcpkg`](https://github.com/Microsoft/vcpkg) (install `sdl2:x64-windows`)
`SDL.zig` will provide a helpful compile error if the zig compiler is unable to find SDL2.

View File

@ -7,7 +7,7 @@ const nfd = @import("lib/nfd-zig/build.zig");
pub fn build(b: *std.build.Builder) void {
// Minimum Zig Version
const min_ver = std.SemanticVersion.parse("0.11.0-dev.1557+03cdb4fb5") catch return; // https://github.com/ziglang/zig/commit/03cdb4fb5
const min_ver = std.SemanticVersion.parse("0.11.0-dev.1580+a5b34a61a") catch return; // https://github.com/ziglang/zig/commit/a5b34a61a
if (builtin.zig_version.order(min_ver).compare(.lt)) {
std.log.err("{s}", .{b.fmt("Zig v{} does not meet the minimum version requirement. (Zig v{})", .{ builtin.zig_version, min_ver })});
std.os.exit(1);

@ -1 +1 @@
Subproject commit 6b33f1f4299ec8814e9fb3b206cda37791ced574
Subproject commit 59c90e8ea2135384410817ccfdcc15ce5f7a245e

@ -1 +1 @@
Subproject commit 272d8e2088b2cae037349fb260dc05ec46bba422
Subproject commit 861de651f3e1314973b1273ac7856e96b2625ff3

@ -1 +1 @@
Subproject commit 932d2845210644ca736faf35f5bea31eb1a15465
Subproject commit bf0ae0c27cfe92fdd9a92c8f1ac6d1939ae60c77

View File

@ -105,7 +105,7 @@ pub fn deinit(self: *Self) void {
fn fillReadTable(self: *Self, table: *[table_len]?*const anyopaque) void {
const vramMirror = @import("ppu/Vram.zig").mirror;
for (table) |*ptr, i| {
for (table, 0..) |*ptr, i| {
const addr = @intCast(u32, page_size * i);
ptr.* = switch (addr) {
@ -132,7 +132,7 @@ fn fillWriteTable(self: *Self, comptime T: type, table: *[table_len]?*const anyo
comptime std.debug.assert(T == u32 or T == u16 or T == u8);
const vramMirror = @import("ppu/Vram.zig").mirror;
for (table) |*ptr, i| {
for (table, 0..) |*ptr, i| {
const addr = @intCast(u32, page_size * i);
ptr.* = switch (addr) {

View File

@ -213,6 +213,7 @@ fn guessDevice(buf: []const u8) Gpio.Device.Kind {
// Try to Guess if ROM uses RTC
const needle = "RTC_V"; // I was told SIIRTC_V, though Pokemen Firered (USA) is a false negative
// TODO: Use new for loop syntax?
var i: usize = 0;
while ((i + needle.len) < buf.len) : (i += 1) {
if (std.mem.eql(u8, needle, buf[i..(i + needle.len)])) return .Rtc;

View File

@ -137,6 +137,7 @@ pub const Backup = struct {
for (backup_kinds) |needle| {
const needle_len = needle.str.len;
// TODO: Use new for loop syntax?
var i: usize = 0;
while ((i + needle_len) < rom.len) : (i += 1) {
if (std.mem.eql(u8, needle.str, rom[i..][0..needle_len])) return needle.kind;

View File

@ -339,10 +339,7 @@ fn DmaController(comptime id: u2) type {
}
pub fn onBlanking(bus: *Bus, comptime kind: DmaKind) void {
comptime var i: usize = 0;
inline while (i < 4) : (i += 1) {
bus.dma[i].poll(kind);
}
inline for (0..4) |i| bus.dma[i].poll(kind);
}
const Adjustment = enum(u2) {

View File

@ -293,13 +293,13 @@ pub const Clock = struct {
self.cpu.sched.push(.RealTimeClock, (1 << 24) -| late); // Reschedule
const now = DateTime.now();
self.year = bcd(u8, @intCast(u8, now.date.year - 2000));
self.month = bcd(u5, now.date.month);
self.day = bcd(u6, now.date.day);
self.weekday = bcd(u3, (now.date.weekday() + 1) % 7); // API is Monday = 0, Sunday = 6. We want Sunday = 0, Saturday = 6
self.hour = bcd(u6, now.time.hour);
self.minute = bcd(u7, now.time.minute);
self.second = bcd(u7, now.time.second);
self.year = bcd(@intCast(u8, now.date.year - 2000));
self.month = @truncate(u5, bcd(now.date.month));
self.day = @truncate(u6, bcd(now.date.day));
self.weekday = @truncate(u3, bcd((now.date.weekday() + 1) % 7)); // API is Monday = 0, Sunday = 6. We want Sunday = 0, Saturday = 6
self.hour = @truncate(u6, bcd(now.time.hour));
self.minute = @truncate(u7, bcd(now.time.minute));
self.second = @truncate(u7, bcd(now.time.second));
}
fn step(self: *Self, value: Data) u4 {
@ -449,16 +449,8 @@ pub const Clock = struct {
}
};
fn bcd(comptime T: type, value: u8) T {
var input = value;
var ret: u8 = 0;
var shift: u3 = 0;
while (input > 0) {
ret |= (input % 10) << (shift << 2);
shift += 1;
input /= 10;
}
return @truncate(T, ret);
/// Converts an 8-bit unsigned integer to its BCD representation.
/// Note: Algorithm only works for values between 0 and 99 inclusive.
fn bcd(value: u8) u8 {
return ((value / 10) << 4) + (value % 10);
}

View File

@ -39,13 +39,12 @@ pub const arm = struct {
}
fn populate() [0x1000]InstrFn {
return comptime {
comptime {
@setEvalBranchQuota(0xE000);
var ret = [_]InstrFn{und} ** 0x1000;
var table = [_]InstrFn{und} ** 0x1000;
var i: usize = 0;
while (i < ret.len) : (i += 1) {
ret[i] = switch (@as(u2, i >> 10)) {
for (&table, 0..) |*handler, i| {
handler.* = switch (@as(u2, i >> 10)) {
0b00 => if (i == 0x121) blk: {
break :blk branchExchange;
} else if (i & 0xFCF == 0x009) blk: {
@ -107,8 +106,8 @@ pub const arm = struct {
};
}
return ret;
};
return table;
}
}
};
@ -136,13 +135,12 @@ pub const thumb = struct {
}
fn populate() [0x400]InstrFn {
return comptime {
comptime {
@setEvalBranchQuota(5025); // This is exact
var ret = [_]InstrFn{und} ** 0x400;
var table = [_]InstrFn{und} ** 0x400;
var i: usize = 0;
while (i < ret.len) : (i += 1) {
ret[i] = switch (@as(u3, i >> 7 & 0x7)) {
for (&table, 0..) |*handler, i| {
handler.* = switch (@as(u3, i >> 7 & 0x7)) {
0b000 => if (i >> 5 & 0x3 == 0b11) blk: {
const I = i >> 4 & 1 == 1;
const is_sub = i >> 3 & 1 == 1;
@ -230,8 +228,8 @@ pub const thumb = struct {
};
}
return ret;
};
return table;
}
}
};
@ -385,8 +383,7 @@ pub const Arm7tdmi = struct {
const now = getModeChecked(self, self.cpsr.mode.read());
// Bank R8 -> r12
var i: usize = 0;
while (i < 5) : (i += 1) {
for (0..5) |i| {
self.bank.fiq[Bank.fiqIdx(i, now)] = self.r[8 + i];
}
@ -404,8 +401,7 @@ pub const Arm7tdmi = struct {
}
// Grab R8 -> R12
i = 0;
while (i < 5) : (i += 1) {
for (0..5) |i| {
self.r[8 + i] = self.bank.fiq[Bank.fiqIdx(i, next)];
}
@ -470,8 +466,7 @@ pub const Arm7tdmi = struct {
}
pub fn stepDmaTransfer(self: *Self) bool {
comptime var i: usize = 0;
inline while (i < 4) : (i += 1) {
inline for (0..4) |i| {
if (self.bus.dma[i].in_progress) {
self.bus.dma[i].step(self);
return true;

View File

@ -92,8 +92,7 @@ pub fn fmt15(comptime L: bool, comptime rb: u3) InstrFn {
inline fn countRlist(opcode: u16) u32 {
var count: u32 = 0;
comptime var i: u4 = 0;
inline while (i < 8) : (i += 1) {
inline for (0..8) |i| {
if (opcode >> (7 - i) & 1 == 1) count += 1;
}

View File

@ -150,9 +150,8 @@ fn sleep(timer: *Timer, wake_time: u64) ?u64 {
const step = 2 * std.time.ns_per_ms; // Granularity of 2ms
const times = sleep_for / step;
var i: usize = 0;
while (i < times) : (i += 1) {
for (0..times) |_| {
std.time.sleep(step);
// Upon wakeup, check to see if this particular sleep was longer than expected

View File

@ -625,8 +625,7 @@ pub const Ppu = struct {
const framebuf_base = width * @as(usize, scanline);
if (obj_enable) self.fetchSprites();
var layer: usize = 0;
while (layer < 4) : (layer += 1) {
for (0..4) |layer| {
self.drawSprites(@truncate(u2, layer));
if (layer == self.bg[0].cnt.priority.read() and bg_enable & 1 == 1) self.drawBackground(0);
if (layer == self.bg[1].cnt.priority.read() and bg_enable >> 1 & 1 == 1) self.drawBackground(1);
@ -640,8 +639,7 @@ pub const Ppu = struct {
const framebuf_base = width * @as(usize, scanline);
if (obj_enable) self.fetchSprites();
var layer: usize = 0;
while (layer < 4) : (layer += 1) {
for (0..4) |layer| {
self.drawSprites(@truncate(u2, layer));
if (layer == self.bg[0].cnt.priority.read() and bg_enable & 1 == 1) self.drawBackground(0);
if (layer == self.bg[1].cnt.priority.read() and bg_enable >> 1 & 1 == 1) self.drawBackground(1);
@ -654,8 +652,7 @@ pub const Ppu = struct {
const framebuf_base = width * @as(usize, scanline);
if (obj_enable) self.fetchSprites();
var layer: usize = 0;
while (layer < 4) : (layer += 1) {
for (0..4) |layer| {
self.drawSprites(@truncate(u2, layer));
if (layer == self.bg[2].cnt.priority.read() and bg_enable >> 2 & 1 == 1) self.drawAffineBackground(2);
if (layer == self.bg[3].cnt.priority.read() and bg_enable >> 3 & 1 == 1) self.drawAffineBackground(3);
@ -671,7 +668,7 @@ pub const Ppu = struct {
const vram_buf = @ptrCast([*]const u16, @alignCast(@alignOf(u16), self.vram.buf));
const framebuf = @ptrCast([*]u32, @alignCast(@alignOf(u32), self.framebuf.get(.Emulator)));
for (vram_buf[vram_base .. vram_base + width]) |bgr555, i| {
for (vram_buf[vram_base .. vram_base + width], 0..) |bgr555, i| {
framebuf[framebuf_base + i] = rgba888(bgr555);
}
},
@ -685,7 +682,7 @@ pub const Ppu = struct {
const pal_buf = @ptrCast([*]const u16, @alignCast(@alignOf(u16), self.palette.buf));
const framebuf = @ptrCast([*]u32, @alignCast(@alignOf(u32), self.framebuf.get(.Emulator)));
for (self.vram.buf[vram_base .. vram_base + width]) |pal_id, i| {
for (self.vram.buf[vram_base .. vram_base + width], 0..) |pal_id, i| {
framebuf[framebuf_base + i] = rgba888(pal_buf[pal_id]);
}
},
@ -701,8 +698,7 @@ pub const Ppu = struct {
const vram_buf = @ptrCast([*]const u16, @alignCast(@alignOf(u16), self.vram.buf));
const framebuf = @ptrCast([*]u32, @alignCast(@alignOf(u32), self.framebuf.get(.Emulator)));
var i: usize = 0;
while (i < width) : (i += 1) {
for (0..width) |i| {
const bgr555 = if (scanline < m5_height and i < m5_width) vram_buf[vram_base + i] else self.palette.backdrop();
framebuf[framebuf_base + i] = rgba888(bgr555);
}
@ -718,7 +714,7 @@ pub const Ppu = struct {
// FIXME: @ptrCast between slices changing the length isn't implemented yet
const framebuf = @ptrCast([*]u32, @alignCast(@alignOf(u32), self.framebuf.get(.Emulator)));
for (self.scanline.top()) |maybe_top, i| {
for (self.scanline.top(), 0..) |maybe_top, i| {
const maybe_btm = self.scanline.btm()[i];
const bgr555 = self.getBgr555(maybe_top, maybe_btm);

View File

@ -73,7 +73,7 @@ pub const Scheduler = struct {
/// Removes the **first** scheduled event of type `needle`
pub fn removeScheduledEvent(self: *Self, needle: EventKind) void {
for (self.queue.items) |event, i| {
for (self.queue.items, 0..) |event, i| {
if (std.meta.eql(event.kind, needle)) {
// invalidates the slice we're iterating over

View File

@ -92,7 +92,7 @@ pub fn main() void {
gui.run(&cpu, &scheduler) catch |e| exitln("failed to run gui thread: {}", .{e});
}
pub fn handleArguments(allocator: Allocator, data_path: []const u8, result: *const clap.Result(clap.Help, &params, clap.parsers.default)) !FilePaths {
fn handleArguments(allocator: Allocator, data_path: []const u8, result: *const clap.Result(clap.Help, &params, clap.parsers.default)) !FilePaths {
const rom_path = romPath(result);
log.info("ROM path: {s}", .{rom_path});

View File

@ -365,7 +365,7 @@ pub fn RingBuffer(comptime T: type) type {
const count = std.math.min(self.len(), cpy.len);
var start: Index = self.read;
for (cpy) |*v, i| {
for (cpy, 0..) |*v, i| {
if (i >= count) break;
v.* = self.buf[self.mask(start)];