1
0
mirror of https://github.com/pevans/erc-c.git synced 2024-11-28 11:51:06 +00:00
erc-c/src/mos6502.c

404 lines
12 KiB
C
Raw Normal View History

2017-12-02 19:05:53 +00:00
/*
2017-12-09 04:12:31 +00:00
* mos6502.c
2017-12-02 19:05:53 +00:00
*
2017-12-09 04:12:31 +00:00
* These functions are kind of the "top-level", if you will, for the MOS
* 6502 processor. You can create the processor struct, operate on the
* stack, etc.
2017-12-02 19:05:53 +00:00
*/
2017-12-02 19:27:30 +00:00
#include <stdio.h>
2017-12-02 19:05:53 +00:00
#include <stdlib.h>
#include "log.h"
#include "mos6502.h"
// All of our address modes, instructions, etc. are defined here.
#include "mos6502.enums.h"
2017-12-07 03:25:47 +00:00
/*
* This is a table which defines what instruction each opcode is mapped
* to. All possible (256) values are defined here. You will note many
* cases where we use NOP where opcodes are not _technically_ defined;
* this may or may not be the best behavior. It's quite possible we should
* instead crash the program when we stumble upon such malformed opcodes
*/
2017-12-02 19:05:53 +00:00
static int instructions[] = {
// 00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F
BRK, ORA, NOP, NOP, NOP, ORA, ASL, NOP, PHP, ORA, ASL, NOP, NOP, ORA, ASL, NOP, // 0x
BPL, ORA, NOP, NOP, NOP, ORA, ASL, NOP, CLC, ORA, NOP, NOP, NOP, ORA, ASL, NOP, // 1x
JSR, AND, NOP, NOP, BIT, AND, ROL, NOP, PLP, AND, ROL, NOP, BIT, AND, ROL, NOP, // 2x
BMI, AND, NOP, NOP, NOP, AND, ROL, NOP, SEC, AND, NOP, NOP, NOP, AND, ROL, NOP, // 3x
RTI, EOR, NOP, NOP, NOP, EOR, LSR, NOP, PHA, ADC, LSR, NOP, JMP, EOR, LSR, NOP, // 4x
BVC, EOR, NOP, NOP, NOP, EOR, LSR, NOP, CLI, EOR, NOP, NOP, NOP, EOR, LSR, NOP, // 5x
RTS, ADC, NOP, NOP, NOP, ADC, ROR, NOP, PLA, ADC, ROR, NOP, JMP, ADC, ROR, NOP, // 6x
BVS, ADC, NOP, NOP, NOP, ADC, ROR, NOP, SEI, ADC, NOP, NOP, NOP, ADC, ROR, NOP, // 7x
NOP, STA, NOP, NOP, STY, STA, STX, NOP, DEY, NOP, TXA, NOP, STY, STA, STX, NOP, // 8x
BCC, STA, NOP, NOP, STY, STA, STX, NOP, TYA, STA, TXS, NOP, NOP, STA, NOP, NOP, // 9x
LDY, LDA, LDX, NOP, LDY, LDA, LDX, NOP, TAY, LDA, TAX, NOP, LDY, LDA, LDX, NOP, // Ax
BCS, LDA, NOP, NOP, LDY, LDA, LDX, NOP, CLV, LDA, TSX, NOP, LDY, LDA, LDX, NOP, // Bx
CPY, CMP, NOP, NOP, CPY, CMP, DEC, NOP, INY, CMP, DEX, NOP, CPY, CMP, DEC, NOP, // Cx
BNE, CMP, NOP, NOP, NOP, CMP, DEC, NOP, CLD, CMP, NOP, NOP, NOP, CMP, DEC, NOP, // Dx
CPX, SBC, NOP, NOP, CPX, SBC, INC, NOP, INX, SBC, NOP, NOP, CPX, SBC, INC, NOP, // Ex
BEQ, SBC, NOP, NOP, NOP, SBC, INC, NOP, SED, SBC, NOP, NOP, NOP, SBC, INC, NOP, // Fx
};
2017-12-07 03:25:47 +00:00
/*
* A small convenience for defining instruction handlers below.
*/
#define INST_HANDLER(x) \
mos6502_handle_##x
2017-12-07 03:25:47 +00:00
/*
* Here's another table, this time mapping instruction codes to
* instruction handler functions. They are listed in the order defined
* in the instruction enum (in mos6502.enums.h).
*/
static mos6502_instruction_handler instruction_handlers[] = {
INST_HANDLER(adc),
INST_HANDLER(and),
INST_HANDLER(asl),
INST_HANDLER(bcc),
INST_HANDLER(bcs),
INST_HANDLER(beq),
INST_HANDLER(bit),
INST_HANDLER(bmi),
INST_HANDLER(bne),
INST_HANDLER(bpl),
INST_HANDLER(brk),
INST_HANDLER(bvc),
INST_HANDLER(bvs),
INST_HANDLER(clc),
INST_HANDLER(cld),
INST_HANDLER(cli),
INST_HANDLER(clv),
INST_HANDLER(cmp),
INST_HANDLER(cpx),
INST_HANDLER(cpy),
INST_HANDLER(dec),
INST_HANDLER(dex),
INST_HANDLER(dey),
INST_HANDLER(eor),
INST_HANDLER(inc),
INST_HANDLER(inx),
INST_HANDLER(iny),
INST_HANDLER(jmp),
INST_HANDLER(jsr),
INST_HANDLER(lda),
INST_HANDLER(ldx),
INST_HANDLER(ldy),
INST_HANDLER(lsr),
INST_HANDLER(nop),
INST_HANDLER(ora),
INST_HANDLER(pha),
INST_HANDLER(php),
INST_HANDLER(pla),
INST_HANDLER(plp),
INST_HANDLER(rol),
INST_HANDLER(ror),
INST_HANDLER(rti),
INST_HANDLER(rts),
INST_HANDLER(sbc),
INST_HANDLER(sec),
INST_HANDLER(sed),
INST_HANDLER(sei),
INST_HANDLER(sta),
INST_HANDLER(stx),
INST_HANDLER(sty),
INST_HANDLER(tax),
INST_HANDLER(tay),
INST_HANDLER(tsx),
INST_HANDLER(txa),
INST_HANDLER(txs),
INST_HANDLER(tya),
};
2017-12-07 03:25:47 +00:00
/*
* Here we have a table that maps opcodes to the number of cycles each
* should cost. In cases where no opcode is defined, we set the number
* of cycles to zero.
*/
static int cycles[] = {
// 00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F
7, 6, 0, 0, 0, 3, 5, 0, 3, 2, 2, 0, 0, 4, 6, 0, // 0x
2, 5, 0, 0, 0, 4, 6, 0, 2, 4, 0, 0, 0, 4, 7, 0, // 1x
6, 6, 0, 0, 3, 3, 5, 0, 4, 2, 2, 0, 4, 4, 6, 0, // 2x
2, 5, 0, 0, 0, 4, 6, 0, 2, 4, 0, 0, 0, 4, 7, 0, // 3x
6, 6, 0, 0, 0, 3, 5, 0, 3, 2, 2, 0, 3, 4, 6, 0, // 4x
2, 5, 0, 0, 0, 4, 6, 0, 2, 4, 0, 0, 0, 4, 7, 0, // 5x
6, 6, 0, 0, 0, 3, 5, 0, 4, 2, 2, 0, 5, 4, 6, 0, // 6x
2, 5, 0, 0, 0, 4, 6, 0, 2, 4, 0, 0, 0, 4, 7, 0, // 7x
0, 6, 0, 0, 3, 3, 3, 0, 2, 0, 2, 0, 4, 4, 4, 0, // 8x
2, 6, 0, 0, 4, 4, 4, 0, 2, 5, 2, 0, 0, 5, 0, 0, // 9x
2, 6, 2, 0, 3, 3, 3, 0, 2, 2, 2, 0, 4, 4, 4, 0, // Ax
2, 5, 0, 0, 4, 4, 4, 0, 2, 4, 2, 0, 4, 4, 4, 0, // Bx
2, 6, 0, 0, 3, 3, 5, 0, 2, 2, 2, 0, 4, 4, 3, 0, // Cx
2, 5, 0, 0, 0, 4, 6, 0, 2, 4, 0, 0, 0, 4, 7, 0, // Dx
2, 6, 0, 0, 3, 3, 5, 0, 2, 2, 2, 0, 4, 4, 6, 0, // Ex
2, 5, 0, 0, 0, 4, 6, 0, 2, 4, 0, 0, 0, 4, 7, 0, // Fx
};
2017-12-02 19:05:53 +00:00
/*
* Build a new mos6502 struct object, and also build the memory contents
* used therein. All registers should be zeroed out.
*/
mos6502 *
mos6502_create()
{
mos6502 *cpu;
cpu = malloc(sizeof(mos6502));
if (cpu == NULL) {
log_critical("Not enough memory to allocate mos6502");
exit(1);
}
cpu->memory = vm_segment_create(MOS6502_MEMSIZE);
cpu->last_addr = 0;
2017-12-02 19:05:53 +00:00
cpu->PC = 0;
cpu->A = 0;
cpu->X = 0;
cpu->Y = 0;
cpu->P = 0;
cpu->S = 0;
return cpu;
}
/*
* Free the memory consumed by the mos6502 struct.
*/
void
mos6502_free(mos6502 *cpu)
{
vm_segment_free(cpu->memory);
free(cpu);
}
/*
* Return the next byte from the PC register position, and increment the
* PC register.
*/
vm_8bit
mos6502_next_byte(mos6502 *cpu)
{
vm_8bit byte;
byte = vm_segment_get(cpu->memory, cpu->PC);
cpu->PC++;
return byte;
}
2017-12-07 03:25:47 +00:00
/*
* Push a _16-bit_ number to the stack. Generally speaking, only
* addresses are pushed to the stack, such that would be contained in
* the PC register (which is 16-bit).
*
* The stack is contained within a single page of memory, so you would
* be right in observing that the stack can contain at most 128, not
* 256, addresses.
*/
2017-12-02 19:05:53 +00:00
void
mos6502_push_stack(mos6502 *cpu, vm_16bit addr)
{
// First we need to set the hi byte, by shifting the address right 8
// positions and using the base offset of the S register.
vm_segment_set(cpu->memory, 0x0100 + cpu->S, addr >> 8);
// Next we must record the lo byte, this time by using a bitmask to
// capture just the low end of addr, but recording it in S + 1.
vm_segment_set(cpu->memory, 0x0100 + cpu->S + 1, addr & 0xFF);
// And finally we need to increment S by 2 (since we've used two
// bytes in the stack).
cpu->S += 2;
}
2017-12-07 03:25:47 +00:00
/*
* Pop an address from the stack and return that.
*/
2017-12-02 19:05:53 +00:00
vm_16bit
mos6502_pop_stack(mos6502 *cpu)
{
// The first thing we want to do here is to decrement S by 2, since
// the value we want to return is two positions back.
cpu->S -= 2;
// We need to use a bitwise-or operation to combine the hi and lo
// bytes we retrieve from the stack into the actual position we
// would use for the PC register.
return
(vm_segment_get(cpu->memory, 0x0100 + cpu->S) << 8) |
vm_segment_get(cpu->memory, 0x0100 + cpu->S + 1);
}
2017-12-07 03:25:47 +00:00
/*
* Here we set the status register to a given status value, regardless
* of its past contents.
*/
2017-12-02 19:05:53 +00:00
void
2017-12-04 02:19:17 +00:00
mos6502_set_status(mos6502 *cpu, vm_8bit status)
2017-12-02 19:05:53 +00:00
{
2017-12-04 02:19:17 +00:00
cpu->P = status;
}
2017-12-07 03:25:47 +00:00
/*
* In contrast, the modify_status function will conditionally set the
* contents of certain bits, based upon the value of the operand. Those
* bits are the negative, overflow, carry, and zero flags.
*/
2017-12-04 02:19:17 +00:00
void
mos6502_modify_status(mos6502 *cpu, vm_8bit status, vm_8bit oper)
{
if (status & NEGATIVE) {
2017-12-02 19:05:53 +00:00
cpu->P &= ~NEGATIVE;
if (oper & 0x80) {
cpu->P |= NEGATIVE;
}
}
2017-12-04 02:19:17 +00:00
if (status & OVERFLOW) {
2017-12-02 19:27:30 +00:00
cpu->P &= ~OVERFLOW;
if (oper & OVERFLOW) {
cpu->P |= OVERFLOW;
2017-12-02 19:05:53 +00:00
}
}
2017-12-04 02:19:17 +00:00
if (status & CARRY) {
2017-12-02 19:05:53 +00:00
cpu->P &= ~CARRY;
if (oper > 0) {
cpu->P |= CARRY;
}
}
2017-12-02 19:27:30 +00:00
2017-12-04 02:19:17 +00:00
if (status & ZERO) {
2017-12-02 19:27:30 +00:00
cpu->P &= ~ZERO;
if (oper == 0) {
cpu->P |= ZERO;
}
}
2017-12-02 19:05:53 +00:00
}
2017-12-07 03:25:47 +00:00
/*
* Return the instruction that is mapped to a given opcode.
*/
int
mos6502_instruction(vm_8bit opcode)
{
return instructions[opcode];
}
2017-12-07 03:25:47 +00:00
/*
* Return the number of cycles an opcode may consume. The cpu is a
* required parameter, because the number of opcodes is conditional upon
* the effective address of the instruction we're executing.
*/
int
mos6502_cycles(mos6502 *cpu, vm_8bit opcode)
{
// In some contexts, we may need to return an additional cycle.
int modif = 0;
int addr_mode;
int lo_addr;
addr_mode = mos6502_addr_mode(opcode);
// Mainly we care about the lo byte of the last effective address
lo_addr = cpu->last_addr & 0xFF;
// Ok, here's the deal: if you are using an address mode that uses
// any of the index registers, you need to return an additional
// cycle if the lo byte of the address plus that index would cross a
// memory page boundary
switch (addr_mode) {
case ABX:
if (lo_addr + cpu->X > 255) {
modif = 1;
}
break;
case ABY:
case INY:
if (lo_addr + cpu->Y > 255) {
modif = 1;
}
break;
default:
break;
}
return cycles[opcode] + modif;
}
/*
* Here we intend to return the proper resolver function for any given
* instruction.
*/
mos6502_instruction_handler
mos6502_get_instruction_handler(vm_8bit opcode)
{
return instruction_handlers[mos6502_instruction(opcode)];
}
/*
* This code does the execution step that the 6502 processor would take,
* from soup to nuts.
*/
void
mos6502_execute(mos6502 *cpu, vm_8bit opcode)
{
vm_8bit operand;
int cycles;
mos6502_address_resolver resolver;
mos6502_instruction_handler handler;
// First, we need to know how to resolve our effective address and
// how to execute anything.
resolver = mos6502_get_address_resolver(opcode);
handler = mos6502_get_instruction_handler(opcode);
// The operand is the effective operand, the value that the
// instruction handler cares about (if it cares about any such
// value). For example, the operand could be the literal value that
// you pass into an instruction via immediate mode. As a
// side-effect, resolver will set the last_addr field in cpu to the
// effective address where the operand can be found in memory, or
// zero if that does not apply (such as in immediate mode).
operand = resolver(cpu);
// Here's where the magic happens. Whatever the instruction does, it
// happens in the handler function.
handler(cpu, operand);
// This will be the number of cycles we should spend on the
// instruction. Of course, we can execute instructions pretty
// quickly in a modern architecture, but a lot of code was written
// with the idea that certain instructions -- in certain address
// modes -- were more expensive than others, and you want those
// programs to feel faster or slower in relation to that.
cycles = mos6502_cycles(cpu, opcode);
// FIXME: actually emulate the cycles
// Ok -- we're done! This wasn't so hard, was it?
return;
}
/*
* Return the next byte in memory according to the program counter
* register, and then increment the register.
*/
vm_8bit
mos6502_read_byte(mos6502 *cpu)
{
vm_8bit byte;
byte = vm_segment_get(cpu->memory, cpu->PC);
cpu->PC++;
return byte;
}