anon/eaxhla
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
eaxhla/source/assembler.c

620 lines
19 KiB
C
Raw Blame History

#include "assembler.h"
#include <stdlib.h>
#define DOUBLE_BEGIN (ADD)
#define DOUBLE_END (CMP)
#define SINGLE_BEGIN (INC)
#define SINGLE_END (IDIV)
#define STATIC_1_BEGIN (NOP)
#define STATIC_1_END (PUSHF)
#define STATIC_2_BEGIN (SYSCALL)
#define STATIC_2_END (FCOS)
#define JUMP_IF_BEGIN (JO)
#define JUMP_IF_END (JG)
#define MOVE_IF_BEGIN (CMOVO)
#define MOVE_IF_END (CMOVG)
#define SET_IF_BEGIN (SETO)
#define SET_IF_END (SETG)
#define FLOAT_BEGIN (FADD)
#define FLOAT_END (FDIVR)
#define SHIFT_BEGIN (ROL)
#define SHIFT_END (SAR)
static uint32_t empty_count = 1;
static uint32_t empty_holes = 1;
static uint32_t * empty_array = NULL;
static uint32_t * empty_imbue = NULL;
static uint32_t * empty_store = NULL;
static void replace(uint8_t * destination,
uint8_t * source,
uint64_t size) {
for (--size; size != ~0ul; --size) {
destination[size] = source[size];
}
}
static void inset(int32_t when,
uint32_t data) {
text_sector_byte[text_sector_size] = (uint8_t)data;
text_sector_size += (uint32_t)when;
}
static void inset_immediate(int32_t when,
uint32_t size,
uint32_t data) {
inset((when), (data >> 0) & 0xff);
inset((when) && (size >= D16), (data >> 8) & 0xff);
inset((when) && (size >= D32), (data >> 16) & 0xff);
inset((when) && (size >= D32), (data >> 24) & 0xff);
}
static void inset_memory(int32_t when,
uint32_t size,
uint32_t data,
uint32_t base) {
empty_array[empty_holes] = text_sector_size;
empty_imbue[empty_holes] = data;
empty_holes += (uint32_t)when;
inset_immediate(when, size, base);
}
static uint32_t store_relative(uint32_t * array) {
uint32_t relative = array[1];
empty_array[empty_holes] = text_sector_size;
empty_imbue[empty_holes] = relative;
++empty_holes;
return 1;
}
static uint32_t store_memory(uint32_t * array) {
uint32_t memory = array[1];
empty_store[memory] = text_sector_size;
++empty_count;
return 1;
}
static uint32_t store_immediate(uint32_t * array) {
uint32_t size = array[1],
amount = array[2];
for (uint32_t index = 0; index < amount; ++index) {
inset_immediate(1, size, array[3 + index]);
}
return amount + 2;
}
static int32_t front(uint32_t data) {
return (data >= GR4) && (data <= GR7);
}
static int32_t lower(uint32_t data) {
return data <= GR7;
}
static int32_t upper(uint32_t data) {
return (data >= GR8) && (data <= GR15);
}
// We don't use these yet, hardcoded.
static int32_t far(uint32_t label) {
return label && 1;
}
// We don't use these yet, hardcoded.
static int32_t near(uint32_t label) {
return label && 0;
}
static void short_prefix(uint32_t size) {
inset(size == D16, 0x66);
}
static void long_prefix(uint32_t size,
uint32_t to,
uint32_t destination,
uint32_t from,
uint32_t source) {
uint32_t to_upper = (to == REG) && (upper(destination));
uint32_t from_upper = (from == REG) && (upper(source));
// Refactor.
inset ((size == D64) || (to_upper) || (from_upper), 0x40 +
0x01 * to_upper + 0x04 * from_upper + 0x08 * (size == D64));
}
static void modify_registers(uint32_t to,
uint32_t destination,
uint32_t from,
uint32_t source) {
// Refactor.
inset ((to == REG) && (from == REG), 0xc0 + 0x01 * (destination & 0x07) + 0x08 * (source & 0x07));
}
static void modify_memory(uint32_t operation,
uint32_t to,
uint32_t from) {
// Refactor.
inset (((to == MEM) && (from == REG)) || ((to == REG) && (from == MEM)), 0x05 +
0x08 * operation * ((to == MEM) && (from == IMM)));
}
// REFACTORING IN PROGRESS
static uint32_t build_double(uint32_t * array) {
uint32_t operation = array[0],
size = array[1],
to = array[2],
destination = array[3],
from = array[4],
source = array[5];
short_prefix(size);
long_prefix(size, to, destination, from, source);
// What the fuck...?
inset((size == D8) && (to == REG) && ((from == REG) || (from == IMM)) &&
(((front(destination) && lower(source)) || (lower(destination) && front(source))) ||
((to == REG) && (from == IMM) && front(destination))), 0x40);
inset((from == IMM) && (to == REG), 0x81 - 0x01 * (size == D8));
inset((from == IMM) && (to == REG) && (destination == 0), 0x05 + 0x08 * (operation & 0x07) - 0x01 * (size == D8));
// Seriously, what the fuck...?
inset(! ((from == IMM) && (to == REG) && (destination == 0)),
(destination & 0x07) * ((to == REG) && (from == IMM)) +
0x08 * (operation - DOUBLE_BEGIN) +
0x01 * ((to == MEM) && (from == IMM) && (size == D8)) -
0x01 * ((to == REG) && (from == IMM) && (size != D8)) +
0x01 * (size != D8) + 0x02 * ((to == REG) && (from == MEM)) +
0x04 * ((to == MEM) && (from == IMM)) +
0xc0 * ((to == REG) && (from == IMM)));
modify_registers(to, destination, from, source);
modify_memory(destination, to, from);
modify_memory(source, to, from);
inset_memory((to == REG) && (from == MEM), D32, source, 0x1000 - text_sector_size - 4);
inset_immediate((to == REG) && (from == IMM), size, source);
inset_memory((to == MEM) && (from == REG), D32, destination, 0x1000 - text_sector_size - 4);
inset_memory((to == MEM) && (from == IMM), D32, destination, 0x1000 - text_sector_size - 4);
inset_immediate((to == MEM) && (from == IMM), size, source);
inset_memory((to == REG) && (from == REL), D32, source, 0x4010b0 - text_sector_size - 4);
return 5;
}
static uint32_t build_single(uint32_t * array) {
uint32_t operation = array[0],
size = array[1],
to = array[2],
destination = array[3];
short_prefix(size);
long_prefix(size, to, destination, 0, 0);
inset((size == D8) && (to == REG) && front(destination), 0x40);
inset(1, 0xf7 + 0x08 * ((operation == INC) || (operation == DEC)) - 0x01 * (size == D8));
// THIS CAN BE REFACTORED TO C0F8 AND 053D
// This old comment should be respected out...
// And there's probably a way to shorten these.
inset(to == REG, 0xc0 + 0x08 * (operation - SINGLE_BEGIN) + 0x01 * (destination & 0x07));
inset(to == MEM, 0x05 + 0x08 * (operation - SINGLE_BEGIN));
inset_memory(to == MEM, D32, destination, 0x1000 - text_sector_size - 4);
return 3;
}
static uint32_t build_static_1(uint32_t * array) {
uint32_t operation = array[0];
const uint8_t data[] = {
0x90, 0xc3, 0xcb, 0xc9, 0x9d, 0x9c
};
inset(1, data[operation - STATIC_1_BEGIN]);
return 0;
}
static uint32_t build_static_2(uint32_t * array) {
uint32_t operation = array[0];
const uint16_t data[] = {
0x050f, 0xa20f, 0xd0d9, 0xe0d9, 0xe1d9, 0xe4d9, 0xe5d9, 0xe8d9,
0xe9d9, 0xead9, 0xebd9, 0xecd9, 0xedd9, 0xeed9, 0xf0d9, 0xf1d9,
0xf2d9, 0xf3d9, 0xf4d9, 0xf5d9, 0xf6d9, 0xf7d9, 0xf8d9, 0xf9d9,
0xfad9, 0xfbd9, 0xfcd9, 0xfdd9, 0xfed9, 0xffd9
};
inset_immediate(1, D16, data[operation - STATIC_2_BEGIN]);
return 0;
}
static uint32_t build_jump_if(uint32_t * array) {
uint32_t operation = array[0],
size = array[1],
location = array[3];
inset(far(location) && (size == D32), 0x0f);
inset(far(location), 0x80 + operation - JUMP_IF_BEGIN);
inset(near(location), 0x70 + operation - JUMP_IF_BEGIN);
inset_memory(1, D32, location, -text_sector_size - 4);
return 3;
}
static uint32_t build_move_if(uint32_t * array) {
uint32_t operation = array[0],
size = array[1],
to = array[2],
destination = array[3],
from = array[4],
source = array[5];
short_prefix(size);
long_prefix(size, to, destination, from, source);
inset(1, 0x0f);
inset(1, 0x40 + operation - MOVE_IF_BEGIN);
modify_registers(to, destination, from, source);
modify_memory(destination, to, from);
return 5;
}
static uint32_t build_set_if(uint32_t * array) {
uint32_t operation = array[0],
to = array[2],
destination = array[3];
inset((to == REG) && (front(destination)), 0x40);
inset((to == REG) && (upper(destination)), 0x41);
inset(1, 0x0f);
inset(1, 0x90 + operation - SET_IF_BEGIN);
inset(to == REG, 0xc0 + 0x01 * (destination & 0x07));
inset(to == MEM, 0x05);
inset_memory(to == MEM, D32, destination, 0x1000 - text_sector_size - 4);
return 3;
}
static uint32_t build_jump(uint32_t * array) {
uint32_t size = array[1],
to = array[2],
destination = array[3];
inset((to == REG) && upper(destination), 0X41);
inset(to == REL, 0xe9 + 0x02 * (size == D8));
inset(to == REG, 0xff);
inset(to == REG, 0xe0 + 0x01 * (destination & 0x07));
inset(to == MEM, 0xff);
inset(to == MEM, 0x25);
inset_memory(to == REL, D32, destination, -text_sector_size - 4);
inset_memory(to == MEM, D32, destination, 0x4010b0);
return 3;
}
// Please refactor this entire crap...
static uint32_t build_move(uint32_t * array) {
uint32_t size = array[1],
to = array[2],
destination = array[3],
from = array[4],
source = array[5],
extension = array[6];
short_prefix(size);
long_prefix(size, to, destination, from, source);
inset((to == REG) && (from == REG), 0x88 + 0x01 * (size != D8));
inset((to == REG) && (from == MEM), 0x8a + 0x01 * (size != D8));
inset((to == MEM) && (from == REG), 0x88 + 0x01 * (size != D8));
modify_memory(destination, to, from);
modify_memory(source, to, from);
modify_registers(to, destination, from, source);
inset((to == REG) && ((from == IMM) || (from == REL)), 0xb0 + 0x08 * (size != D8) + 0x01 * (destination & 0x07));
inset((to == MEM) && (from == IMM), 0xc6 + 0x01 * (size != D8));
inset((to == MEM) && (from == IMM), 0x05);
inset_memory((to == REG) && (from == MEM), D32, source, 0x1000 - text_sector_size - 4);
inset_memory((to == MEM) && (from == REG), D32, destination, 0x1000 - text_sector_size - 4);
inset_memory((to == MEM) && (from == IMM), D32, destination, 0x1000 - text_sector_size - 4);
inset_memory((to == REG) && (from == REL), D32, source, 0x4010b0);
inset_immediate((to == REG) && (from == IMM) && (size != D64), size, source);
inset_immediate((to == MEM) && (from == IMM) && (size != D64), size, source);
inset_immediate((to == REG) && (from == IMM) && (size == D64), D32, source);
inset_immediate((to == REG) && (from == IMM) && (size == D64), D32, extension);
inset_immediate((to == REG) && (from == IMM) && (size == D64), D32, 0);
return 5 + (size == D64);
}
static uint32_t build_call(uint32_t * array) {
uint32_t from = array[1],
source = array[2];
inset((from == REG) && (upper(source)), 0x41);
inset(from == REL, 0xe8);
inset(from == REG, 0xff);
inset_memory(from == REL, D32, source, -text_sector_size - 4);
inset(from == REG, (0xd0 + 0x01 * (source & 0x07)));
return 2;
}
static uint32_t build_enter(uint32_t * array) {
uint32_t dynamic_storage = array[1],
nesting_level = array[2];
inset(1, 0xc8);
inset_immediate(1, D16, dynamic_storage);
inset_immediate(1, D8, nesting_level & 0x1f);
return 2;
}
static uint32_t build_float(uint32_t * array) {
uint32_t operation = array[0],
size = array[1],
from = array[2],
source = array[3];
inset(from == MEM, 0xd8 + 0x04 * (size == D64));
modify_memory(operation, 0, from);
inset_memory(from == MEM, size, source, 0);
return 3;
}
static uint32_t build_shift(uint32_t * array) {
uint32_t operation = array[0],
size = array[1],
to = array[2],
destination = array[3],
offset = array[5];
short_prefix(size);
long_prefix(size, to, destination, 0, 0);
inset(1, 0xc0 + 0x01 * (size != D8));
inset(to == REG, 0x05 + 0x08 * (operation & 7));
inset(to == MEM, 0xc0 + 0x08 * (operation & 7));
inset_memory(to == MEM, D32, destination, 0x1000 - text_sector_size - 4);
inset_immediate(1, D8, offset);
return 5;
}
static uint32_t build_in_out(uint32_t * array) {
uint32_t move = array[0],
size = array[1],
type = array[2],
port = array[3];
short_prefix(size);
// Shorten and extend, I think we're not covering all cases.
inset(1, 0xe4 + 0x01 * (size != D8) + 0x02 * (move == IN) + 0x08 * (type == REG));
inset_immediate(type == IMM, D8, port);
return 3;
}
static uint32_t build_pop(uint32_t * array) {
uint32_t size = array[1],
to = array[2],
destination = array[3];
short_prefix(size);
inset((to == REG) && (upper(destination)), 0x41);
inset(to == REG, 0x58 + 0x01 * (destination & 0x07));
inset(to == MEM, 0x8f);
inset(to == MEM, 0x05);
inset_memory(to == MEM, D32, destination, 0);
return 3;
}
static uint32_t build_push(uint32_t * array) {
uint32_t size = array[1],
from = array[2],
source = array[3];
short_prefix(size);
inset((from == REG) && (upper(source)), 0x41);
inset(from == REG, 0x50 + 0x01 * (source & 0x07));
inset(from == MEM, 0xff);
inset(from == MEM, 0x35);
inset(from == IMM, 0x68 + 0x02 * (size == D8));
inset_memory(from == MEM, D32, source, 0);
inset_immediate(from == IMM, size, source);
return 3;
}
static uint32_t build_swap(uint32_t * array) {
uint32_t size = array[1],
destination = array[3];
long_prefix(size, REG, destination, 0, 0);
inset(1, 0x0f);
inset(1, 0xc8 + 0x01 * (destination & 0x07));
return 3;
}
static uint32_t build_bit_scan(uint32_t * array) {
uint32_t size = array[1],
destination = array[3],
from = array[4],
source = array[5];
short_prefix(size);
long_prefix(size, REG, destination, from, source);
inset_immediate(1, D16, 0xbc0f);
modify_registers(REG, destination, from, source);
inset(from == MEM, 0x05 + 0x08 * destination);
inset_memory(from == MEM, D32, source, 0x1000 - text_sector_size - 4);
return 5;
}
static uint32_t build_loop(uint32_t * array) {
uint32_t location = array[3];
inset(array[0] == LOOPNE, 0xe0);
inset(array[0] == LOOPE, 0xe1);
inset(array[0] == LOOP, 0xe2);
inset_memory(1, D8, location, -text_sector_size - 1);
return 3;
}
static uint32_t (*build_instruction[])(uint32_t * array) = {
store_memory, // ASMDIRMEM : LABEL
store_relative, // ASMDIRREL : "IMPLEMENTED"
store_immediate,// ASMDIRIMM : LITERAL
NULL, // ASMDIRREP : UNIMPLEMENTED
build_double, build_double, build_double, build_double,
build_double, build_double, build_double, build_double,
build_single, build_single, build_single, build_single,
build_single, build_single, build_single, build_single,
build_float, build_float, build_float, build_float,
build_float, build_float, build_float, build_float,
build_shift, build_shift, build_shift, build_shift,
build_shift, build_shift, build_shift, build_shift,
build_static_1, build_static_1, build_static_1, build_static_1,
build_static_1, build_static_1,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2, build_static_2, build_static_2,
build_static_2, build_static_2,
build_enter, build_call, build_in_out, build_in_out,
build_jump, build_move, build_pop, build_push,
build_jump_if, build_jump_if, build_jump_if, build_jump_if,
build_jump_if, build_jump_if, build_jump_if, build_jump_if,
build_jump_if, build_jump_if, build_jump_if, build_jump_if,
build_jump_if, build_jump_if, build_jump_if, build_jump_if,
build_move_if, build_move_if, build_move_if, build_move_if,
build_move_if, build_move_if, build_move_if, build_move_if,
build_move_if, build_move_if, build_move_if, build_move_if,
build_move_if, build_move_if, build_move_if, build_move_if,
build_set_if, build_set_if, build_set_if, build_set_if,
build_set_if, build_set_if, build_set_if, build_set_if,
build_set_if, build_set_if, build_set_if, build_set_if,
build_set_if, build_set_if, build_set_if, build_set_if,
build_swap, build_bit_scan, build_bit_scan, build_loop,
build_loop, build_loop
};
uint32_t main_entry_point = 0;
uint32_t text_sector_size = 0;
uint8_t * text_sector_byte = NULL;
uint32_t data_sector_size = 0; // This is unused, and it should be used...
uint8_t * data_sector_byte = NULL; // This is unused, and it should be used...
int32_t was_instruction_array_empty = 0;
int32_t assemble (uint32_t count, uint32_t * array) {
if ((!count) || (!array)) {
was_instruction_array_empty = 1;
return EXIT_FAILURE;
}
empty_array = calloc(1024ul, sizeof(*empty_array));
empty_imbue = calloc(1024ul, sizeof(*empty_imbue));
empty_store = calloc(1024ul, sizeof(*empty_store));
for (uint32_t index = 0; index < count; ++index) {
index += build_instruction[array[index]](&array[index]);
}
main_entry_point = empty_store[0];
for (uint32_t index = 1; index < empty_holes; ++index) {
uint32_t set = 0;
uint32_t get = empty_array[index];
replace((uint8_t*)&set, &text_sector_byte[get], sizeof(set));
set += empty_store[empty_imbue[index]];
replace(&text_sector_byte[get], (uint8_t*)&set, sizeof(get));
}
free(empty_array);
free(empty_imbue);
free(empty_store);
return EXIT_SUCCESS;
}
Reference in New Issue View Git Blame Copy Permalink