systemless 0.67.0

High-Level Emulation for classic Macintosh applications
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
use super::*;
use crate::execution_native::NativeEngineRole;
use crate::loader::ppc::PpcSoundState;
use crate::process_context::PendingFileCompletion;
use crate::trap::dispatch::TrapTableProfile;

#[test]
fn file_completion_callback_uses_documented_registers_and_restores_foreground() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let interrupted_pc = 0x0001_0000;
    let interrupted_sp = 0x007F_FFC0;
    let parameter_block = runner.bus.alloc(64);
    let callback_addr = runner.bus.alloc(2);

    runner.bus.write_word(callback_addr, 0x4E75); // RTS
    for offset in (0..20).step_by(2) {
        runner.bus.write_word(interrupted_pc + offset, 0x4E71); // NOP
    }
    runner.m68k.cpu.write_reg(Register::PC, interrupted_pc);
    runner.m68k.cpu.write_reg(Register::A7, interrupted_sp);
    runner.m68k.cpu.write_reg(Register::A0, 0x1111_1111);
    runner.m68k.cpu.write_reg(Register::D0, 0x2222_2222);
    runner
        .dispatcher
        .pending_file_completions
        .push_back(PendingFileCompletion {
            parameter_block,
            completion_addr: callback_addr,
            result: -39,
        });

    assert!(runner.fire_file_completion_callback());
    assert_eq!(runner.bus.read_word(parameter_block + 16) as i16, -39);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A0), parameter_block);
    assert_eq!(runner.m68k.cpu.read_reg(Register::D0) as i32, -39);
    assert!(matches!(
        runner.active_interrupt_callback.map(|active| active.source),
        Some(ActiveInterruptCallbackSource::FileCompletion)
    ));
    assert!(
        runner
            .bus
            .get_alloc_size(runner.file_completion_trampoline)
            .is_none(),
        "Systemless-owned completion trampoline must stay outside the guest heap"
    );

    let (_, running) = runner.run_steps(6, None);

    assert!(running);
    assert!(runner.active_interrupt_callback.is_none());
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), interrupted_sp);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A0), 0x1111_1111);
    assert_eq!(runner.m68k.cpu.read_reg(Register::D0), 0x2222_2222);
    assert!(!runner.is_halted());
}

#[test]
fn idle_hle_traps_do_not_apply_extra_tick_cost() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;

    runner.bus.write_word(base, 0xA975); // _TickCount
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, 0x0010_0000);
    runner.bus.write_long(0x016A, 42);
    runner.set_guest_tick_for_test(42);
    runner.set_instructions_per_tick(5);

    let (steps, running) = runner.run_steps(1, None);

    assert!(running);
    assert_eq!(steps, 1);
    assert_eq!(
        runner.guest_tick(),
        42,
        "polling traps should not add synthetic HLE manager cost"
    );
    assert_eq!(runner.tick_budget, 4);
}

#[test]
fn hle_trap_cost_stops_gui_slice_at_tick_cap() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;
    let sp = 0x0010_0000u32;
    let rect = 0x0020_0000u32;

    runner.bus.write_word(base, 0xA8A8); // _OffsetRect
    runner.bus.write_word(base + 2, 0x4E71); // NOP that must wait for the next GUI slice
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, sp);
    runner.bus.write_word(sp, 1);
    runner.bus.write_word(sp + 2, 2);
    runner.bus.write_long(sp + 4, rect);
    runner.bus.write_word(rect, 10);
    runner.bus.write_word(rect + 2, 20);
    runner.bus.write_word(rect + 4, 30);
    runner.bus.write_word(rect + 6, 40);
    runner.bus.write_long(0x016A, 0);
    runner.set_guest_tick_for_test(0);
    runner.set_instructions_per_tick(5);

    let (steps, running) = runner.run_gui_slice_with_audio(8, 1, 0);

    assert!(running);
    assert_eq!(steps, 1);
    assert_eq!(runner.guest_tick(), 1);
    assert_eq!(
        runner.m68k.cpu.read_reg(Register::PC),
        base + 2,
        "the next guest instruction should be deferred once HLE cost reaches the GUI tick cap"
    );
}

/// Regression gate for the guest-owned TickCount invariant.
/// `advance_guest_tick` and the unfreeze path update low-memory `$016A`;
/// all semantic readers import those bytes before using host pacing state.
/// Any future path that bypasses that import can desynchronize double-
/// click detection, the TickCount handler, and diagnostic tick printouts.
#[test]
fn dispatcher_tick_count_stays_in_sync_with_bus() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let program_start = 0x0001_0000;
    let program_words = 20;

    // NOPs keep the CPU stepping without producing traps that
    // could interfere with tick accounting.
    for offset in (0..program_words).step_by(2) {
        runner.bus.write_word(program_start + offset, 0x4E71);
    }

    runner.m68k.cpu.write_reg(Register::PC, program_start);
    runner.m68k.cpu.write_reg(Register::A7, 0x007F_FFC0);
    runner.bus.write_long(0x016A, 0);
    // Set both sides of the invariant to the same initial value.
    runner.set_guest_tick_for_test(0);
    runner.set_instructions_per_tick(3);

    // Step a few times; ticks should advance roughly every 3
    // instructions. After each run_steps, bus and dispatcher
    // must agree.
    for _ in 0..3 {
        let (_, running) = runner.run_steps(3, None);
        assert!(running);
        assert_eq!(
            runner.bus.read_long(0x016A),
            runner.guest_tick(),
            "guest low-memory Ticks ({}) diverged from semantic reader ({})",
            runner.bus.read_long(0x016A),
            runner.guest_tick(),
        );
    }
}

#[test]
fn tickcount_runner_uses_canonical_dispatch_and_accounting() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;
    // Plain TickCount call: SUBQ.W #4, A7 ; _TickCount ; NOP
    runner.bus.write_word(base, 0x594F); // SUBQ.W #4, A7 (reserve LONGINT slot)
    runner.bus.write_word(base + 2, 0xA975); // _TickCount
    runner.bus.write_word(base + 4, 0x4E71); // NOP (sentinel)
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, 0x0010_0000);
    runner.set_guest_tick_for_test(0x1234_5678);
    runner.bus.write_long(0x016A, 0x1234_5678);
    runner.set_instructions_per_tick(1_000_000);

    let before_traps = runner.dispatcher.trap_count;
    // Two steps: the SUBQ first, then canonical trap dispatch.
    let (steps, running) = runner.run_steps(2, None);
    assert!(
        running,
        "runner should not halt on a canonical TickCount trap"
    );
    assert_eq!(steps, 2);
    assert_eq!(runner.bus.read_long(0x000F_FFFC), 0x1234_5678);
    assert_eq!(runner.dispatcher.trap_count - before_traps, 1);
}

#[test]
fn halted_by_exit_to_shell_classifies_clean_application_quit() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;
    runner.bus.write_word(base, 0xA9F4); // _ExitToShell
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, 0x0010_0000);

    let (_steps, running) = runner.run_steps(1, None);

    assert!(!running, "ExitToShell should stop the runner");
    assert!(runner.is_halted());
    assert_eq!(runner.halted_trap(), Some(0xA9F4));
    assert!(
        runner.halted_by_exit_to_shell(),
        "ExitToShell halt must be classified as a clean application exit"
    );
}

#[test]
fn unimplemented_trap_halts_at_the_faulting_instruction() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;
    let sp = 0x0010_0000u32;
    runner.bus.write_word(base, 0xAFFE);
    runner.bus.write_word(base + 2, 0x4E71);
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, sp);

    let (steps, running) = runner.run_steps(1, None);

    assert_eq!(steps, 1);
    assert!(
        !running,
        "an unclassified HLE row must fail closed (pc=${:08X})",
        runner.m68k.cpu.read_reg(Register::PC)
    );
    assert!(runner.is_halted());
    assert_eq!(runner.halted_pc(), Some(base));
    assert_eq!(runner.halted_trap(), Some(0xAFFE));
    assert_eq!(runner.halted_sp(), Some(sp));
}

#[test]
fn exit_to_shell_activates_launch_target_queued_until_event_yield() {
    let helper_code0 = minimal_code0(0, 0x2000, 0, 0);
    let helper_fork_bytes = make_resource_fork_bytes(&[(*b"CODE", 0, &helper_code0)]);
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;

    runner
        .dispatcher
        .vfs
        .insert("Apps/Register Helper".to_string(), Vec::new());
    runner
        .dispatcher
        .vfs_rsrc
        .insert("Apps/Register Helper".to_string(), helper_fork_bytes);
    runner.dispatcher.ensure_vfs_catalog();
    runner
        .dispatcher
        .queue_pending_launch_application("Apps/Register Helper", true);
    runner.bus.write_word(base, 0xA9F4); // _ExitToShell
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, 0x0010_0000);

    let (_steps, running) = runner.run_steps(1, None);

    assert!(
        running,
        "ExitToShell should activate a valid queued launch target"
    );
    assert!(!runner.is_halted());
    assert_eq!(
        runner.dispatcher.launched_app_path(),
        Some("Apps/Register Helper")
    );
}

#[test]
fn exit_to_shell_launches_best_application_created_by_installer() {
    let app_code0 = minimal_code0(0, 0x2000, 0, 0);
    let app_fork = make_resource_fork_bytes(&[(*b"CODE", 0, &app_code0)]);
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;

    runner
        .dispatcher
        .vfs
        .insert("Existing/Previous Game".to_string(), Vec::new());
    runner
        .dispatcher
        .vfs_rsrc
        .insert("Existing/Previous Game".to_string(), app_fork.clone());
    runner.dispatcher.set_vfs_entry_finfo(
        "Existing/Previous Game",
        u32::from_be_bytes(*b"APPL"),
        u32::from_be_bytes(*b"GAME"),
        0,
    );
    runner.arm_installer_handoff();
    for path in ["Installed/Register", "Installed/Main Game"] {
        runner.dispatcher.vfs.insert(path.to_string(), Vec::new());
        runner
            .dispatcher
            .vfs_rsrc
            .insert(path.to_string(), app_fork.clone());
        runner.dispatcher.set_vfs_entry_finfo(
            path,
            u32::from_be_bytes(*b"APPL"),
            u32::from_be_bytes(*b"GAME"),
            0,
        );
    }
    runner.bus.write_word(base, 0xA9F4); // _ExitToShell
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, 0x0010_0000);

    let (_steps, running) = runner.run_steps(1, None);

    assert!(running, "installer exit should activate the installed game");
    assert!(!runner.is_halted());
    assert_eq!(
        runner.dispatcher.launched_app_path(),
        Some("Installed/Main Game")
    );
}

#[test]
fn halted_by_exit_to_shell_rejects_invalid_pc_halts() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    runner
        .m68k
        .cpu
        .write_reg(Register::PC, runner.bus.ram_size());
    runner.m68k.cpu.write_reg(Register::A7, 0x0010_0000);

    let (_steps, running) = runner.run_steps(1, None);

    assert!(!running, "invalid PC should stop the runner");
    assert!(runner.is_halted());
    assert_eq!(runner.halted_trap(), None);
    assert!(
        !runner.halted_by_exit_to_shell(),
        "invalid-PC halts must not be reported as clean application exits"
    );
}

#[test]
fn ptinrect_runner_dispatch_matches_pascal_stack_contract() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let base = 0x0001_0000u32;
    let sp = 0x0010_0000u32;
    let rect = 0x0020_0000u32;

    runner.bus.write_word(base, 0xA8AD); // _PtInRect
    runner.m68k.cpu.write_reg(Register::PC, base);
    runner.m68k.cpu.write_reg(Register::A7, sp);
    runner.set_instructions_per_tick(1_000_000);

    runner.bus.write_long(sp, rect);
    runner.bus.write_word(sp + 4, 20); // pt.v
    runner.bus.write_word(sp + 6, 30); // pt.h
    runner.bus.write_word(rect, 10); // top
    runner.bus.write_word(rect + 2, 25); // left
    runner.bus.write_word(rect + 4, 40); // bottom
    runner.bus.write_word(rect + 6, 50); // right

    let before_traps = runner.dispatcher.trap_count;
    let before_game = runner.dispatcher.game_trap_count;

    let (steps, running) = runner.run_steps(1, None);

    assert!(
        running,
        "runner should not halt on canonical PtInRect dispatch"
    );
    assert_eq!(steps, 1);
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), base + 2);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), sp + 8);
    assert_eq!(runner.bus.read_word(sp + 8), 0x0100);
    assert_eq!(runner.dispatcher.trap_count - before_traps, 1);
    assert_eq!(runner.dispatcher.game_trap_count - before_game, 1);
}

#[test]
fn constructed_trap_tables_survive_companion_installation_and_observe_native_stores() {
    use crate::trap::dispatch::{OS_TRAP_TABLE_BASE, TOOLBOX_TRAP_TABLE_BASE};

    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let mut cells = Vec::new();
    for (base, count) in [(OS_TRAP_TABLE_BASE, 256), (TOOLBOX_TRAP_TABLE_BASE, 1024)] {
        for slot in 0..count {
            let cell = base + slot * 4;
            let handler = runner.bus.read_long(cell);
            assert_ne!(handler, 0);
            let instruction = runner.bus.read_word(handler);
            assert!(!runner.bus.try_write_word(handler, instruction ^ 0xFFFF));
            assert_eq!(runner.bus.read_word(handler), instruction);
            cells.push((cell, handler));
        }
    }
    let vectors = runner.dispatcher.trap_exception_vector_defaults.unwrap();
    let entry = TOOLBOX_TRAP_TABLE_BASE + 0x175 * 4; // TickCount
    let default = runner.bus.read_long(entry);
    let patch = 0x0010_1000;
    let program = 0x0010_0000;
    runner.bus.write_word(patch, 0x4E75); // RTS
    runner.bus.write_word(program, 0xA975); // TickCount
    runner.bus.write_word(program + 2, 0x4E71); // NOP

    // The companion joins an existing process; it must not replace its
    // guest-written table cells or exception vectors with launch defaults.
    runner.bus.write_long(entry, patch);
    runner.bus.write_long(0x2C, patch);
    let mut app = halted_ppc_app_with_sound(PpcSoundState::default());
    runner.init_ppc_companion(app.ppc.take().unwrap());
    assert_eq!(
        runner.dispatcher.trap_table_profile,
        Some(TrapTableProfile::M68k68040)
    );
    {
        let companion = runner
            .native
            .adapter_mut(NativeEngineRole::Companion)
            .unwrap();
        for (cell, handler) in cells {
            assert_eq!(
                companion.memory.read_u32_be(cell),
                Some(if cell == entry { patch } else { handler })
            );
        }
        assert_eq!(companion.memory.read_u32_be(0x28), Some(vectors[0]));
        assert_eq!(companion.memory.read_u32_be(0x2C), Some(patch));
        companion.memory.write_u32_be(entry, default).unwrap();
    }
    assert_eq!(
        runner.dispatcher.trap_table_address(&runner.bus, 0xA975),
        Some(default)
    );
    runner
        .native
        .adapter_mut(NativeEngineRole::Companion)
        .unwrap()
        .memory
        .write_u32_be(entry, patch)
        .unwrap();
    runner.m68k.cpu.write_reg(Register::D0, 0xA975);
    runner
        .dispatcher
        .dispatch(0xA746, &mut runner.m68k.cpu, &mut runner.bus)
        .unwrap();
    assert_eq!(runner.m68k.cpu.read_reg(Register::A0), patch);
    runner.m68k.cpu.write_reg(Register::PC, program);
    runner.m68k.cpu.write_reg(Register::A7, 0x007F_FFC0);
    assert_eq!(runner.run_steps(1, None), (1, true));
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), patch);
    assert_eq!(runner.run_steps(1, None), (1, true));
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), program + 2);
}

/// A-line execution reaches the Trap Dispatcher through vector 10 at
/// `$28`; line-F reaches the Line 1111 emulator through vector 11 at
/// `$2C`. Both cells are writable system globals, so replacing either one
/// must expose the processor's format-0 frame to guest code rather than
/// silently entering HLE. Inside Macintosh Volume I (1985), p. I-89;
/// Inside Macintosh Volume III (1985), p. III-17.
#[test]
fn guest_line_vectors_receive_architectural_frames_and_restore_defaults() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let defaults = runner.dispatcher.trap_exception_vector_defaults.unwrap();
    let original_sp = 0x007F_FFC0;

    // MOVE.L #marker,D6; ADDQ.L #2,2(SP); RTE. The handler advances the
    // faulting PC in the format-0 frame before returning.
    let aline_handler = 0x0010_1000;
    runner.bus.write_word(aline_handler, 0x2C3C);
    runner.bus.write_long(aline_handler + 2, 0xA10E_0010);
    runner.bus.write_word(aline_handler + 6, 0x54AF);
    runner.bus.write_word(aline_handler + 8, 0x0002);
    runner.bus.write_word(aline_handler + 10, 0x4E73);
    runner.bus.write_long(0x28, aline_handler);

    let aline_program = 0x0010_0000;
    runner.bus.write_word(aline_program, 0xA975); // TickCount
    runner.bus.write_word(aline_program + 2, 0x4E71); // NOP
    runner.m68k.cpu.write_reg(Register::PC, aline_program);
    runner.m68k.cpu.write_reg(Register::A7, original_sp);

    assert_eq!(runner.run_steps(1, None), (1, true));
    let aline_frame = original_sp - 8;
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), aline_handler);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), aline_frame);
    assert_eq!(runner.bus.read_long(aline_frame + 2), aline_program);
    assert_eq!(runner.bus.read_word(aline_frame + 6), 0x0028);
    assert_eq!(runner.run_steps(3, None), (3, true));
    assert_eq!(runner.m68k.cpu.read_reg(Register::D6), 0xA10E_0010);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), original_sp);
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), aline_program + 2);

    // Restoring the generated vector re-enables the ordinary HLE path.
    runner.bus.write_long(0x28, defaults[0]);
    runner.m68k.cpu.write_reg(Register::PC, aline_program);
    let trap_count = runner.dispatcher.trap_count;
    assert_eq!(runner.run_steps(1, None), (1, true));
    assert_eq!(runner.dispatcher.trap_count, trap_count + 1);
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), aline_program + 2);

    // Repeat the same architectural proof for an unsupported F-line word.
    let fline_handler = 0x0010_1100;
    runner.bus.write_word(fline_handler, 0x2A3C); // MOVE.L #marker,D5
    runner.bus.write_long(fline_handler + 2, 0xF11E_0011);
    runner.bus.write_word(fline_handler + 6, 0x54AF);
    runner.bus.write_word(fline_handler + 8, 0x0002);
    runner.bus.write_word(fline_handler + 10, 0x4E73);
    runner.bus.write_long(0x2C, fline_handler);

    let fline_program = 0x0010_0200;
    runner.bus.write_word(fline_program, 0xF000);
    runner.bus.write_word(fline_program + 2, 0x4E71);
    runner.m68k.cpu.write_reg(Register::PC, fline_program);
    runner.m68k.cpu.write_reg(Register::A7, original_sp);

    assert_eq!(runner.run_steps(1, None), (1, true));
    let fline_frame = original_sp - 8;
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), fline_handler);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), fline_frame);
    assert_eq!(runner.bus.read_long(fline_frame + 2), fline_program);
    assert_eq!(runner.bus.read_word(fline_frame + 6), 0x002C);
    assert_eq!(runner.run_steps(3, None), (3, true));
    assert_eq!(runner.m68k.cpu.read_reg(Register::D5), 0xF11E_0011);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), original_sp);
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), fline_program + 2);
    runner.bus.write_long(0x2C, defaults[1]);
}

/// FNOP is a valid 68040 coprocessor instruction, not a Line 1111
/// exception. Keeping a replacement vector 11 installed while it executes
/// proves opcode classification happens before exception delegation.
#[test]
fn valid_68040_fpu_opcode_does_not_enter_guest_vector_11() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let fline_handler = 0x0010_1100;
    runner.bus.write_word(fline_handler, 0x2E3C); // MOVE.L #sentinel,D7
    runner.bus.write_long(fline_handler + 2, 0xBADF_11E0);
    runner.bus.write_word(fline_handler + 6, 0x4E73);
    runner.bus.write_long(0x2C, fline_handler);

    let program = 0x0010_0000;
    runner.bus.write_word(program, 0xF280); // FNOP
    runner.bus.write_word(program + 2, 0x0000);
    runner.bus.write_word(program + 4, 0x4E71); // NOP
    runner.m68k.cpu.write_reg(Register::PC, program);
    runner.m68k.cpu.write_reg(Register::A7, 0x007F_FFC0);
    runner.m68k.cpu.write_reg(Register::D7, 0x1357_2468);

    assert_eq!(runner.run_steps(1, None), (1, true));
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), program + 4);
    assert_eq!(runner.m68k.cpu.read_reg(Register::A7), 0x007F_FFC0);
    assert_eq!(runner.m68k.cpu.read_reg(Register::D7), 0x1357_2468);
}

/// Running a `DIVU.W D0,D1` with `D0 = 0` must not halt the
/// runner. The `load_app_generic` loader installs an RTE stub at
/// `$00FE` and points vector 5 (`$14`) at it; the m68k crate's
/// zero-divide trap stacks the *next* PC and jumps to that vector,
/// so RTE-ing returns past the DIVU and execution continues.
/// Inside Macintosh Volume I, I-103 (Exception Vector Table);
/// M68000PRM ("If the source operand is zero, the result of the
/// operation is unpredictable").
#[test]
fn zero_divide_rte_handler_resumes_after_divu_by_zero() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());

    // Mirror what load_app_generic installs: RTE stub + vector.
    runner.bus.write_word(0x00FE, 0x4E73); // RTE
    runner.bus.write_long(0x0014, 0x0000_00FE);

    let prog = 0x0010_0000u32;
    runner.bus.write_word(prog, 0x82C0); // DIVU.W D0, D1
    runner.bus.write_word(prog + 2, 0x4E71); // NOP
    runner.bus.write_word(prog + 4, 0x4E71); // NOP

    runner.m68k.cpu.write_reg(Register::PC, prog);
    runner.m68k.cpu.write_reg(Register::A7, 0x007F_FFC0);
    runner.m68k.cpu.write_reg(Register::D0, 0);
    runner.m68k.cpu.write_reg(Register::D1, 100);

    // 1 step: DIVU.W traps, vectors to $00FE.
    // 2nd step: RTE at $00FE pops SR/PC, returns past DIVU.
    // 3rd step: NOP at prog+2.
    let (steps, running) = runner.run_steps(3, None);

    assert!(running, "runner must not halt on zero-divide");
    assert_eq!(steps, 3);
    assert_eq!(
        runner.m68k.cpu.read_reg(Register::PC),
        prog + 4,
        "PC must advance past the DIVU+NOP without re-entering the trap"
    );
    assert_eq!(
        runner.m68k.cpu.read_reg(Register::D1),
        100,
        "DIVU by zero must leave the destination register unchanged"
    );
}

/// CHK exception (vector 6) shares the same `$00FE` RTE stub as
/// the zero-divide handler. A `CHK.W #5, D0` with `D0 = 100`
/// exceeds the bound and triggers the trap; on a real Mac the
/// handler calls SysError, on Systemless we silently RTE so D0 is
/// preserved and the next instruction runs.
/// Inside Macintosh Volume I, I-103.
#[test]
fn chk_rte_handler_resumes_after_bounds_violation() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());

    runner.bus.write_word(0x00FE, 0x4E73); // RTE
    runner.bus.write_long(0x0018, 0x0000_00FE); // CHK vector

    let prog = 0x0010_0000u32;
    runner.bus.write_word(prog, 0x41BC); // CHK.W #imm, D0
    runner.bus.write_word(prog + 2, 0x0005); // imm = 5
    runner.bus.write_word(prog + 4, 0x4E71); // NOP

    runner.m68k.cpu.write_reg(Register::PC, prog);
    runner.m68k.cpu.write_reg(Register::A7, 0x007F_FFC0);
    runner.m68k.cpu.write_reg(Register::D0, 100);

    // 1 step: CHK fires (100 > 5), vectors to $00FE.
    // 2nd step: RTE pops SR/PC, returns past CHK.
    // 3rd step: NOP executes.
    let (steps, running) = runner.run_steps(3, None);

    assert!(running, "runner must not halt on CHK bounds violation");
    assert_eq!(steps, 3);
    assert_eq!(
        runner.m68k.cpu.read_reg(Register::PC),
        prog + 6,
        "PC must advance past CHK (4 bytes) + NOP (2 bytes)"
    );
    assert_eq!(runner.m68k.cpu.read_reg(Register::D0), 100);
}

/// TRAPV (vector 7) shares the `$00FE` RTE stub. Pre-set the V
/// flag in CCR via the m68k API and execute TRAPV; the trap fires
/// because V is set, vectors to the RTE stub, and resumes at the
/// next instruction. Inside Macintosh Volume I, I-103.
#[test]
fn trapv_rte_handler_resumes_when_v_flag_is_set() {
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());

    runner.bus.write_word(0x00FE, 0x4E73); // RTE
    runner.bus.write_long(0x001C, 0x0000_00FE); // TRAPV vector

    let prog = 0x0010_0000u32;
    runner.bus.write_word(prog, 0x4E76); // TRAPV
    runner.bus.write_word(prog + 2, 0x4E71); // NOP

    runner.m68k.cpu.write_reg(Register::PC, prog);
    runner.m68k.cpu.write_reg(Register::A7, 0x007F_FFC0);
    runner.m68k.cpu.core.set_ccr(0x02); // V flag set

    // 1: TRAPV traps; 2: RTE; 3: NOP.
    let (steps, running) = runner.run_steps(3, None);

    assert!(running, "runner must not halt on TRAPV");
    assert_eq!(steps, 3);
    assert_eq!(runner.m68k.cpu.read_reg(Register::PC), prog + 4);
}

#[test]
fn disassemble_at_decodes_known_opcodes_with_correct_advance() {
    // Pins the FixtureRunner::disassemble_at public-API helper.
    // This is the library-level entry point for pixel-divergence
    // and trap-misroute investigations: pair with
    // SYSTEMLESS_TRACE_FB_WRITE_RANGE to see what code lives at a
    // suspect PC.
    //
    // Seed three known instructions in guest RAM, disassemble,
    // and verify:
    //   1. each entry's PC advances by the previous size
    //   2. the mnemonic for $4E71 is "NOP" (well-known fixed
    //      instruction; no operand words to consume)
    //   3. an A-line trap word ($A8EC = CopyBits) comes back as
    //      "DC.W $A8EC" — the m68k crate's convention for opcodes
    //      it doesn't have a regular decoder for
    //   4. the size returned is at least 2 and at most 10 (the
    //      clamp guard that prevents a malformed opcode from
    //      consuming wrap-around amounts)
    let mut runner = FixtureRunner::new(8 * 1024 * 1024, FixtureRunnerConfig::default());
    let pc = 0x10000u32;
    // $4E71 NOP
    runner.bus.write_word(pc, 0x4E71);
    // $A8EC (CopyBits trap-line word)
    runner.bus.write_word(pc + 2, 0xA8EC);
    // $4E71 NOP again
    runner.bus.write_word(pc + 4, 0x4E71);
    let out = runner.disassemble_at(pc, 3);
    assert_eq!(
        out.len(),
        3,
        "disassemble_at must return exactly count entries"
    );
    assert_eq!(
        out[0].0, pc,
        "first entry's PC must equal the requested start"
    );
    assert!(
        out[0].1.contains("NOP"),
        "$4E71 must disassemble to NOP, got: {}",
        out[0].1
    );
    assert!(
        out[0].2 >= 2 && out[0].2 <= 10,
        "instruction size must be in clamp range [2, 10], got {}",
        out[0].2
    );
    assert_eq!(
        out[1].0,
        pc + out[0].2,
        "second entry's PC must equal first PC + first size"
    );
    assert!(
        out[1].1.contains("$A8EC"),
        "A-line trap $A8EC must surface in mnemonic (DC.W form), got: {}",
        out[1].1
    );
    assert!(
        out[2].1.contains("NOP"),
        "third entry must be the second NOP we seeded"
    );
}

#[test]
fn disassemble_at_uses_the_configured_ram_boundary() {
    let mut runner = FixtureRunner::new(16 * 1024 * 1024, FixtureRunnerConfig::default());
    let pc = 12 * 1024 * 1024;
    runner.bus.write_word(pc, 0x4E71);

    let out = runner.disassemble_at(pc, 1);
    assert_eq!(out.len(), 1);
    assert!(
        out[0].1.contains("NOP"),
        "mapped RAM above 8 MiB must not be reported as unmapped"
    );
}