1
0
mirror of https://github.com/mre/mos6502.git synced 2024-11-25 02:33:26 +00:00
mre-mos6502/README.md

71 lines
2.5 KiB
Markdown
Raw Normal View History

2018-10-25 13:02:27 +00:00
# mos6502
2022-06-07 18:31:53 +00:00
![MOS6502](assets/6502.jpg)
2019-10-22 00:17:15 +00:00
![](https://github.com/mre/mos6502/workflows/test/badge.svg)
2021-01-28 22:14:52 +00:00
[![docs.rs](https://docs.rs/mos6502/badge.svg)](https://docs.rs/mos6502)
2017-10-08 15:31:20 +00:00
2018-11-04 20:39:15 +00:00
An emulator for the [MOS 6502 CPU](https://en.wikipedia.org/wiki/MOS_Technology_6502) written in Rust.
2021-04-07 11:59:51 +00:00
It builds on stable Rust and supports `#[no_std]` targets.
2018-11-04 19:26:51 +00:00
2021-04-07 12:05:38 +00:00
## What is the MOS 6502?
> The MOS Technology 6502 (typically pronounced "sixty-five-oh-two" or "six-five-oh-two") is an 8-bit microprocessor that was designed by a small team led by Chuck Peddle for MOS Technology. [...]
>
> When it was introduced in 1975, the 6502 was the **least expensive microprocessor on the market** by a considerable margin. It initially sold for less than one-sixth the cost of competing designs from larger companies, such as the 6800 or Intel 8080. Its introduction caused rapid decreases in pricing across the entire processor market. **Along with the Zilog Z80, it sparked a series of projects that resulted in the home computer revolution of the early 1980s.**
Source: [Wikipedia](https://en.wikipedia.org/wiki/MOS_Technology_6502)
## How to use this library
2018-11-04 19:26:51 +00:00
```rust
use mos6502::memory::Bus;
2023-04-03 06:31:49 +00:00
use mos6502::memory::Memory;
2019-10-22 12:15:26 +00:00
use mos6502::cpu;
2018-11-04 19:26:51 +00:00
fn main() {
2021-04-07 12:01:45 +00:00
// Calculate the greatest common divisor of 56 and 49
// using Euclid's algorithm.
2019-10-22 15:53:13 +00:00
let zero_page_data = [56, 49];
2018-11-04 19:26:51 +00:00
let program = [
2021-04-07 11:55:41 +00:00
// (F)irst | (S)econd
// .algo
2019-10-22 12:15:26 +00:00
0xa5, 0x00, // Load from F to A
2021-04-07 11:55:41 +00:00
// .algo_
2019-10-22 12:15:26 +00:00
0x38, // Set carry flag
0xe5, 0x01, // Substract S from number in A (from F)
0xf0, 0x07, // Jump to .end if diff is zero
0x30, 0x08, // Jump to .swap if diff is negative
0x85, 0x00, // Load A to F
0x4c, 0x12, 0x00, // Jump to .algo_
2021-04-07 11:55:41 +00:00
// .end
2019-10-22 12:15:26 +00:00
0xa5, 0x00, // Load from S to A
2021-04-07 11:55:41 +00:00
0xff,
// .swap
2019-10-22 12:15:26 +00:00
0xa6, 0x00, // load F to X
0xa4, 0x01, // load S to Y
0x86, 0x01, // Store X to F
0x84, 0x00, // Store Y to S
0x4c, 0x10, 0x00, // Jump to .algo
2018-11-04 19:26:51 +00:00
];
2023-04-03 06:31:49 +00:00
let mut cpu = cpu::CPU::new(Memory::new());
2018-11-04 19:26:51 +00:00
cpu.memory.set_bytes(0x00, &zero_page_data);
cpu.memory.set_bytes(0x10, &program);
cpu.registers.program_counter = 0x10;
2018-11-04 19:26:51 +00:00
cpu.run();
2019-10-22 12:15:26 +00:00
2021-04-07 12:01:45 +00:00
// The expected GCD is 7
2019-10-22 15:53:13 +00:00
assert_eq!(7, cpu.registers.accumulator);
2018-11-04 19:26:51 +00:00
}
```
2021-04-07 11:59:51 +00:00
## Credits
This started off as a fork of [amw-zero/6502-rs](https://github.com/amw-zero/6502-rs),
which seems to be [unmaintained](https://github.com/amw-zero/6502-rs/pull/36) at this point.