6502/x65
1
0
Fork 0
mirror of https://github.com/ksherlock/x65.git synced 2024-12-29 10:30:32 +00:00
Code Issues Projects Releases Wiki Activity

Starting assembler functions

Browse Source
This commit is contained in:
Carl-Henrik Skårstedt 2020-01-09 23:10:55 -08:00
parent 600567a42e
commit 758b4349eb
1 changed files with 22 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
x65.cpp
View File

@ -314,6 +314,14 @@ enum AssemblerDirective {
AD_ERROR, AD_ERROR,
}; };
// evaluation functions
enum EvalFuncs {
EF_DEFINED, // DEFINED(label) 1 if label is defined
EF_BLANK, // BLANK() 1 if the contents within the parenthesis is empty
EF_CONST, // CONST(label) 1 if label is a const label
EF_SIN, // SIN(index, period, amplitude)
};
// Operators are either instructions or directives // Operators are either instructions or directives
enum OperationType { enum OperationType {
OT_NONE, OT_NONE,
@ -1058,8 +1066,21 @@ DirectiveName aDirectiveNamesMerlin[] {
{ "CYC", AD_CYC }, // MERLIN: Start and stop cycle counter { "CYC", AD_CYC }, // MERLIN: Start and stop cycle counter
}; };
struct EvalFuncNames {
const char* name;
EvalFuncs function;
};
EvalFuncNames aEvalFunctions[] = {
{ "DEFINED", EF_DEFINED }, // DEFINED(label) 1 if label is defined
{ "BLANK", EF_BLANK }, // BLANK() 1 if the contents within the parenthesis is empty
{ "CONST", EF_CONST }, // CONST(label) 1 if label is a const label
{ "SIN", EF_SIN }, // SIN(index, period, amplitude)
};
static const int nDirectiveNames = sizeof(aDirectiveNames) / sizeof(aDirectiveNames[0]); static const int nDirectiveNames = sizeof(aDirectiveNames) / sizeof(aDirectiveNames[0]);
static const int nDirectiveNamesMerlin = sizeof(aDirectiveNamesMerlin) / sizeof(aDirectiveNamesMerlin[0]); static const int nDirectiveNamesMerlin = sizeof(aDirectiveNamesMerlin) / sizeof(aDirectiveNamesMerlin[0]);
static const int nEvalFuncs = sizeof(aEvalFunctions) / sizeof(aEvalFunctions[0]);
// Binary search over an array of unsigned integers, may contain multiple instances of same key // Binary search over an array of unsigned integers, may contain multiple instances of same key
uint32_t FindLabelIndex(uint32_t hash, uint32_t *table, uint32_t count) uint32_t FindLabelIndex(uint32_t hash, uint32_t *table, uint32_t count)
@ -1974,7 +1995,7 @@ StatusCode SymbolStackTable::PullSymbol(StringSymbol* string)
} else { } else {
if (string->string_value.empty() || string->string_value.cap() < (strlen(str) + 1)) { if (string->string_value.empty() || string->string_value.cap() < (strlen(str) + 1)) {
if (string->string_value.charstr()) { free(string->string_value.charstr()); } if (string->string_value.charstr()) { free(string->string_value.charstr()); }
string->string_value.set_overlay((char*)malloc(strlen(str) + 1), strlen(str) + 1); string->string_value.set_overlay((char*)malloc(strlen(str) + 1), (strl_t)strlen(str) + 1);
} }
string->string_value.copy(str); string->string_value.copy(str);
free(str); free(str);