merlin-utils/link.cpp

606 lines
12 KiB
C++
Raw Normal View History

2019-12-08 18:55:33 +00:00
/* c++17 */
#include <algorithm>
2019-12-08 18:55:33 +00:00
#include <string>
2019-12-09 18:02:15 +00:00
#include <string_view>
#include <system_error>
#include <unordered_map>
#include <utility>
#include <vector>
2019-12-09 18:02:15 +00:00
2019-12-11 03:11:29 +00:00
2019-12-09 18:02:15 +00:00
#include <cassert>
2019-12-11 03:46:04 +00:00
#include <cerrno>
#include <cstdint>
2019-12-09 18:02:15 +00:00
#include <cstdio>
2019-12-13 04:50:43 +00:00
#include <ctime>
2019-12-09 18:02:15 +00:00
#include <err.h>
2019-12-10 00:45:45 +00:00
#include <sysexits.h>
2019-12-09 18:02:15 +00:00
#include <afp/finder_info.h>
2019-12-08 18:55:33 +00:00
2019-12-10 00:45:45 +00:00
#include "mapped_file.h"
2019-12-08 18:55:33 +00:00
#include "omf.h"
2019-12-09 18:02:15 +00:00
#include "rel.h"
2019-12-13 04:50:43 +00:00
#include "link.h"
2019-12-08 18:55:33 +00:00
void save_omf(const std::string &path, std::vector<omf::segment> &segments, bool compress, bool expressload);
2019-12-10 00:45:45 +00:00
int set_file_type(const std::string &path, uint16_t file_type, uint32_t aux_type, std::error_code &ec);
void set_file_type(const std::string &path, uint16_t file_type, uint32_t aux_type);
2019-12-08 18:55:33 +00:00
2019-12-09 18:02:15 +00:00
/* since span isn't standard yet */
typedef std::basic_string_view<uint8_t> byte_view;
2019-12-08 18:55:33 +00:00
2019-12-13 04:50:43 +00:00
struct pending_reloc : public omf::reloc {
unsigned id = 0;
2019-12-08 18:55:33 +00:00
};
2019-12-10 00:45:45 +00:00
2019-12-13 04:50:43 +00:00
struct cookie {
std::string file;
std::vector<unsigned> remap;
uint32_t begin = 0;
uint32_t end = 0;
2019-12-08 18:55:33 +00:00
};
2019-12-13 04:50:43 +00:00
namespace {
std::unordered_map<std::string, unsigned> symbol_map;
std::vector<symbol> symbol_table;
std::vector<pending_reloc> relocations;
std::vector<omf::segment> segments;
}
2019-12-09 18:02:15 +00:00
/* nb - pointer may be invalidated by next call */
2019-12-13 04:50:43 +00:00
symbol *find_symbol(const std::string &name, bool insert) {
2019-12-08 18:55:33 +00:00
auto iter = symbol_map.find(name);
if (iter != symbol_map.end()) return &symbol_table[iter->second];
2019-12-13 04:50:43 +00:00
if (!insert) return nullptr;
2019-12-08 18:55:33 +00:00
unsigned id = symbol_table.size();
2019-12-08 18:55:33 +00:00
symbol_map.emplace(name, id);
auto &rv = symbol_table.emplace_back();
rv.name = name;
rv.id = id;
2019-12-09 18:02:15 +00:00
return &rv;
2019-12-08 18:55:33 +00:00
}
2019-12-13 04:50:43 +00:00
static void process_labels(byte_view &data, cookie &cookie) {
2019-12-08 18:55:33 +00:00
for(;;) {
2019-12-09 18:02:15 +00:00
assert(data.size());
2019-12-08 18:55:33 +00:00
unsigned flag = data[0];
if (flag == 0x00) return;
unsigned length = flag & 0x1f;
assert(length != 0);
assert(data.size() >= length + 4);
std::string name(data.data() + 1, data.data() + 1 + length);
data.remove_prefix(1 + length);
uint32_t value = data[0] | (data[1] << 8) | (data[2] << 16);
data.remove_prefix(3);
2019-12-09 18:02:15 +00:00
symbol *e = find_symbol(name);
2019-12-08 18:55:33 +00:00
switch (flag & ~0x1f) {
case SYMBOL_EXTERNAL:
/* map the unit symbol # to a global symbol # */
value &= 0x7fff;
2019-12-09 18:02:15 +00:00
if (cookie.remap.size() < value + 1)
cookie.remap.resize(value + 1);
cookie.remap[value] = e->id;
2019-12-08 18:55:33 +00:00
break;
case SYMBOL_ENTRY+SYMBOL_ABSOLUTE:
if (e->defined && e->absolute && e->value == value)
break; /* allow redef */
case SYMBOL_ENTRY:
if (e->defined) {
2019-12-09 18:02:15 +00:00
warnx("%s previously defined (%s)", e->name.c_str(), e->file.c_str());
2019-12-08 18:55:33 +00:00
break;
}
e->defined = true;
2019-12-09 18:02:15 +00:00
e->file = cookie.file;
2019-12-08 18:55:33 +00:00
if (flag & SYMBOL_ABSOLUTE) {
e->absolute = true;
e->value = value;
} else {
e->absolute = false;
2019-12-10 03:15:55 +00:00
e->value = value - 0x8000 + cookie.begin;
2019-12-08 18:55:33 +00:00
}
break;
default:
2019-12-09 18:02:15 +00:00
errx(1, "%s: Unsupported flag: %02x\n", cookie.file.c_str(), flag);
break;
2019-12-08 18:55:33 +00:00
}
}
}
2019-12-13 04:50:43 +00:00
static void process_reloc(byte_view &data, cookie &cookie) {
2019-12-09 18:02:15 +00:00
2019-12-10 00:45:45 +00:00
auto &seg = segments.back();
2019-12-08 18:55:33 +00:00
for(;;) {
assert(data.size());
unsigned flag = data[0];
if (flag == 0x00) return;
assert(data.size() >= 4);
uint32_t offset = data[1] | (data[2] << 8);
unsigned x = data[3];
data.remove_prefix(4);
2019-12-10 03:15:55 +00:00
offset += cookie.begin;
2019-12-08 18:55:33 +00:00
bool external = false;
unsigned shift = 0;
uint32_t value = 0;
unsigned size = 0;
if (flag == 0xff) {
/* shift */
assert(data.size() >= 4);
unsigned flag = data[0];
value = data[1] | (data[2] << 8) | (data[3] << 16);
value -= 0x8000;
external = flag & 0x04;
switch(flag & ~0x04) {
case 0xd0:
2019-12-10 02:58:01 +00:00
shift = -16;
2019-12-08 18:55:33 +00:00
size = 1;
break;
case 0xd1:
2019-12-10 02:58:01 +00:00
shift = -8;
2019-12-08 18:55:33 +00:00
size = 2;
break;
case 0xd3:
2019-12-10 02:58:01 +00:00
shift = -8;
2019-12-08 18:55:33 +00:00
size = 1;
break;
default: /* bad */
2019-12-09 18:02:15 +00:00
errx(1, "%s: Unsupported flag: %02x\n", cookie.file.c_str(), flag);
break;
2019-12-08 18:55:33 +00:00
}
2019-12-10 02:58:01 +00:00
data.remove_prefix(4);
2019-12-08 18:55:33 +00:00
} else {
2019-12-09 18:02:15 +00:00
assert((flag & ~(0x0f|0x10|0x20|0x80)) == 0);
2019-12-08 18:55:33 +00:00
2019-12-10 03:15:55 +00:00
// offset already adjusted by start so below comparisons are wrong.
2019-12-08 18:55:33 +00:00
switch(flag & (0x80 + 0x20)) {
2019-12-09 18:02:15 +00:00
case 0:
size = 1;
2019-12-10 03:15:55 +00:00
assert(offset + 0 < cookie.end);
2019-12-09 18:02:15 +00:00
break;
case 0x20:
size = 3;
2019-12-10 03:15:55 +00:00
assert(offset + 2 < cookie.end);
2019-12-09 18:02:15 +00:00
break;
case 0x80:
size = 2;
2019-12-10 03:15:55 +00:00
assert(offset + 1 < cookie.end);
2019-12-09 18:02:15 +00:00
break;
2019-12-08 18:55:33 +00:00
default: /* bad size */
2019-12-09 18:02:15 +00:00
errx(1, "%s: Unsupported flag: %02x\n", cookie.file.c_str(), flag);
break;
2019-12-08 18:55:33 +00:00
}
external = flag & 0x10;
switch(size) {
2019-12-10 00:45:45 +00:00
case 3: value |= seg.data[offset+2] << 16;
case 2: value |= seg.data[offset+1] << 8;
case 1: value |= seg.data[offset+0];
2019-12-08 18:55:33 +00:00
}
if (size > 1) value -= 0x8000;
}
/* external resolutions are deferred for later */
if (external) {
/* x = local symbol # */
2019-12-09 18:02:15 +00:00
pending_reloc r;
assert(x < cookie.remap.size());
r.id = cookie.remap[x];
2019-12-08 18:55:33 +00:00
r.size = size;
r.offset = offset;
r.value = value;
r.shift = shift;
2019-12-10 00:45:45 +00:00
symbol_table[r.id].count += 1;
2019-12-08 18:55:33 +00:00
relocations.emplace_back(r);
} else {
omf::reloc r;
r.size = size;
2019-12-10 03:15:55 +00:00
r.offset = offset;
r.value = value + cookie.begin;
2019-12-08 18:55:33 +00:00
r.shift = shift;
seg.relocs.emplace_back(r);
}
2019-12-10 02:58:01 +00:00
/* clear out the inline relocation data */
for(unsigned i = 0; i < size; ++i) {
seg.data[offset + i] = 0;
}
//cookie.zero.emplace_back(std::make_pair(offset, size));
2019-12-08 18:55:33 +00:00
}
}
2019-12-13 04:50:43 +00:00
static void process_unit(const std::string &path) {
2019-12-08 18:55:33 +00:00
2019-12-09 18:02:15 +00:00
cookie cookie;
2019-12-08 18:55:33 +00:00
/* skip over relocs, do symbols first */
2019-12-09 18:02:15 +00:00
std::error_code ec;
mapped_file mf(path, mapped_file::readonly, ec);
if (ec) {
2019-12-10 00:45:45 +00:00
errx(1, "Unable to open %s: %s", path.c_str(), ec.message().c_str());
2019-12-09 18:02:15 +00:00
}
afp::finder_info fi;
fi.read(path, ec);
if (ec) {
errx(1, "Error reading filetype %s: %s", path.c_str(), ec.message().c_str());
}
if (fi.prodos_file_type() != 0xf8) {
errx(1, "Wrong file type: %s", path.c_str());
}
uint32_t offset = fi.prodos_aux_type();
if (offset+2 > mf.size()) {
errx(1, "Invalid aux type %s", path.c_str());
}
omf::segment &seg = segments.back();
2019-12-10 03:15:55 +00:00
cookie.begin = seg.data.size();
cookie.end = cookie.begin + offset;
2019-12-09 18:02:15 +00:00
cookie.file = path;
2019-12-10 02:58:01 +00:00
seg.data.insert(seg.data.end(), mf.data(), mf.data() + offset);
byte_view data(mf.data() + offset, mf.size() - offset);
2019-12-09 18:02:15 +00:00
byte_view rr = data;
/* skip over the relocation records so we can process the labels first. */
/* this is so external references can use the global symbol id */
2019-12-10 02:58:01 +00:00
assert(data.size() >= 2);
2019-12-08 18:55:33 +00:00
for(;;) {
if (data[0] == 0) break;
2019-12-10 02:58:01 +00:00
assert(data.size() >= 6);
2019-12-08 18:55:33 +00:00
data.remove_prefix(4);
}
data.remove_prefix(1);
2019-12-09 18:02:15 +00:00
process_labels(data, cookie);
assert(data.size() == 1);
2019-12-08 18:55:33 +00:00
/* now relocations */
2019-12-09 18:02:15 +00:00
process_reloc(rr, cookie);
2019-12-08 18:55:33 +00:00
}
2019-12-13 04:50:43 +00:00
static void resolve(void) {
2019-12-08 18:55:33 +00:00
2019-12-10 00:45:45 +00:00
/* this needs to be updated if supporting multiple segments */
auto &seg = segments.back();
2019-12-08 18:55:33 +00:00
2019-12-10 00:45:45 +00:00
for (auto &r : relocations) {
assert(r.id < symbol_map.size());
const auto &e = symbol_table[r.id];
/* if this is an absolute value, do the math */
if (!e.defined) {
warnx("%s is not defined", e.name.c_str());
continue;
}
if (e.absolute) {
uint32_t value = e.value + r.value;
2019-12-11 04:00:59 +00:00
/* shift is a uint8_t so negating doesn't work right */
value >>= -(int8_t)r.shift;
unsigned offset = r.offset;
unsigned size = r.size;
while (size--) {
seg.data[offset++] = value & 0xff;
value >>= 8;
}
continue;
}
r.value += e.value;
2019-12-08 18:55:33 +00:00
seg.relocs.emplace_back(r);
}
relocations.clear();
/* sort them */
std::sort(seg.relocs.begin(), seg.relocs.end(), [](const omf::reloc &a, const omf::reloc &b){
return a.offset < b.offset;
});
2019-12-08 18:55:33 +00:00
}
static void print_symbols2(void) {
for (const auto &e : symbol_table) {
char q = ' ';
if (!e.count) q = '?';
if (!e.defined) q = '!';
fprintf(stdout, "%c %-20s=$%06x\n", q, e.name.c_str(), e.value);
}
}
2019-12-13 04:50:43 +00:00
static void print_symbols(void) {
2019-12-08 18:55:33 +00:00
if (symbol_table.empty()) return;
/* alpha */
fputs("\nSymbol table, alphabetical order:\n", stdout);
2019-12-08 18:55:33 +00:00
std::sort(symbol_table.begin(), symbol_table.end(),
[](const symbol &a, const symbol &b){
return a.name < b.name;
});
print_symbols2();
fputs("\nSymbol table, numerical order:\n", stdout);
2019-12-08 18:55:33 +00:00
/* numeric */
std::sort(symbol_table.begin(), symbol_table.end(),
[](const symbol &a, const symbol &b){
return a.value < b.value;
});
print_symbols2();
2019-12-10 00:45:45 +00:00
}
2019-12-13 04:50:43 +00:00
void finish(void) {
2019-12-10 00:45:45 +00:00
2019-12-13 04:50:43 +00:00
resolve();
print_symbols();
2019-12-13 04:50:43 +00:00
try {
save_omf(save_file, segments, compress, express);
set_file_type(save_file, 0xb3, 0x0000);
} catch (std::exception &ex) {
errx(EX_OSERR, "%s: %s", save_file.c_str(), ex.what());
}
2019-12-10 00:45:45 +00:00
}
2019-12-13 04:50:43 +00:00
void process_files(int argc, char **argv) {
segments.emplace_back();
for (int i = 0; i < argc; ++i) {
char *path = argv[i];
try {
process_unit(path);
} catch (std::exception &ex) {
errx(EX_DATAERR, "%s: %s", path, ex.what());
}
}
2019-12-13 04:50:43 +00:00
}
namespace {
unsigned lkv = 1;
unsigned ver = 2;
unsigned ftype = 0xb3;
unsigned atype = 0x0000;
unsigned kind = 0x0000;
unsigned do_level = 0;
bool end = false;
uint32_t active_bits = 1;
bool active = true;
std::unordered_map<std::string, uint32_t> symbol_table;
}
2019-12-13 04:50:43 +00:00
void evaluate(label_t label, opcode_t opcode, operand_t operand) {
switch(opcode) {
case OP_DO:
if (active_bits & 0x80000000) throw std::runtime_error("too much do do");
active_bits <<= 1;
active_bits |= std::get<uint32_t>(operand) ? 1 : 0;
active = (active_bits & (active_bits + 1)) == 0;
return;
break;
case OP_ELS:
if (active_bits < 2)
throw std::runtime_error("els without do");
active_bits ^= 0x01;
active = (active_bits & (active_bits + 1)) == 0;
return;
break;
case OP_FIN:
active_bits >>= 1;
if (!active_bits) {
active = 1;
throw std::runtime_error("fin without do");
}
active = (active_bits & (active_bits + 1)) == 0;
return;
break;
}
if (!active) return;
2019-12-13 04:50:43 +00:00
switch(opcode) {
2019-12-13 04:50:43 +00:00
case OP_END:
if (!end && lkv == 2) {
/* finish up */
segments.pop_back();
finish();
}
end = true;
break;
2019-12-13 04:50:43 +00:00
case OP_DAT: {
/* 29-DEC-88 4:18:37 PM */
time_t t = time(nullptr);
struct tm tm = localtime(&t);
char buffer[32];
2019-12-13 04:50:43 +00:00
strftime(buffer, sizeof(buffer), "%d-%b-%y %H:%M:%S %p", tm);
for(char &c : buffer) c = std::toupper(c);
2019-12-13 04:50:43 +00:00
printf(stdout, "%s\n", buffer);
break;
}
2019-12-13 04:50:43 +00:00
case OP_TYP:
ftype = std::get<uint32_t>(operand);
break;
case OP_ADR:
atype = std::get<uint32_t>(operand);
break;
2019-12-13 04:50:43 +00:00
case OP_KND:
kind = std::get<uint32_t>(operand);
break;
2019-12-13 04:50:43 +00:00
case OP_LKV:
/* specify linker version */
/* 0 = binary, 1 = Linker.GS, 2 = Linker.XL, 3 = convert to OMF object file */
2019-12-13 04:50:43 +00:00
switch (std::get<uint32_t>(operand)) {
case 0: throw std::runtime_error("binary linker not supported");
case 3: throw std::runtime_error("object file linker not supported");
case 1:
case 2:
lkv = std::get<uint32_t>(operand);
break;
default:
throw std::runtime_error("bad linker version");
}
break;
case OP_VER:
/* OMF version, 1 or 2 */
if (std::get<uint32_t>(operand) != 2)
throw std::runtime_error("bad OMF version");
break;
case OP_LNK:
if (end) throw std::runtime_error("link after end");
//link_unit(std::get<std::string>(operand));
break;
case OP_SAV:
if (end) throw std::runtime_error("save after end");
if (save_file.empty()) save_file = std::get<std::string>(operand);
/* if linker version 1, save to disk */
/* if linker version 2, finish the current segment */
if (lkv == 1) {
auto &seg = segments.back();
seg.segname = std::get<std::string>(operand);
seg.kind = kind;
finish();
end = true;
}
if (lkv == 2) {
auto &seg = segments.back();
seg.segname = std::get<std::string>(operand);
seg.kind = kind;
/* if this is the first segment, also save the
/* add a new segment */
segments.emplace_back();
}
2019-12-10 00:45:45 +00:00
2019-12-13 04:50:43 +00:00
break;
2019-12-10 03:15:55 +00:00
2019-12-10 00:45:45 +00:00
2019-12-13 04:50:43 +00:00
case OP_ASM:
default:
throw std::runtime_error("opcode not yet supported");
2019-12-10 00:45:45 +00:00
}
2019-12-13 04:50:43 +00:00
}
2019-12-10 00:45:45 +00:00
2019-12-13 04:50:43 +00:00
void process_script(const char *path) {
2019-12-10 00:45:45 +00:00
2019-12-13 04:50:43 +00:00
extern void parse_line(const char *);
FILE *fp;
fp = fopen(path, "r");
if (!fp) {
warn("Unable to open %s", path);
return -1;
2019-12-10 00:45:45 +00:00
}
2019-12-13 04:50:43 +00:00
int no = 1;
int errors = 0;
char *line = NULL;
size_t cap = 0;
for(;; ++no) {
ssize_t len = getline(&line, &cap, fp);
if (len == 0) break;
if (len < 0) {
warn("read error");
++errors;
break;
}
/* strip trailing ws */
while (len && isspace(line[len-1])) --len;
line[len] = 0;
if (len == 0) continue;
2019-12-10 03:15:55 +00:00
2019-12-13 04:50:43 +00:00
try {
parse_line(line);
} catch (std::exception &ex) {
if (~active & 0x01) continue;
fprintf(stderr, "%s in line: %d\n", ex.what(), no);
fprintf(stderr, "%s\n", line);
if (++errors >= 10) {
fputs("Too many errors, aborting\n", stderr);
break;
}
}
2019-12-10 00:45:45 +00:00
}
2019-12-13 04:50:43 +00:00
fclose(fp);
free(line);
exit(errors ? EX_DATAERR : 0);
2019-12-10 18:24:56 +00:00
}
2019-12-13 04:50:43 +00:00