oreodave/obf
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix errors due to no loops

Browse Source
This commit is contained in:
Aryadev Chavali
2024-12-03 04:13:40 +00:00
parent 0f0862245f
commit 6ad3e61a2b
2 changed files with 27 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
assembler.c
View File

@@ -120,12 +120,15 @@ void asm_translate_nodes(buffer_t **asm_buffer, struct PResult nodes,
const char *src_name)
{
// First pass: Setup the ASM label array
struct Label labels[nodes.labels * 2];
u64 label_ptr = 0;
for (size_t i = 0; i < nodes.size; ++i)
if (nodes.nodes[i].type == LIN || nodes.nodes[i].type == LOUT)
labels[label_ptr++] =
(struct Label){.cur = i, .next = nodes.nodes[i].loop_ref};
struct Label labels[nodes.labels ? nodes.labels * 2 : 1];
if (nodes.labels)
{
u64 label_ptr = 0;
for (size_t i = 0; i < nodes.size; ++i)
if (nodes.nodes[i].type == LIN || nodes.nodes[i].type == LOUT)
labels[label_ptr++] =
(struct Label){.cur = i, .next = nodes.nodes[i].loop_ref};
}
// Second pass: Translating to assembly
for (size_t i = 0; i < nodes.size; ++i)

33
parser.c
View File

@@ -121,26 +121,29 @@ struct PResult parse_buffer(buffer_t *buffer)
}
// Third pass: setup loop references
node_t *stack[loops];
memset(stack, 0, loops);
size_t stackptr = 0;
for (size_t i = 0; i < usable; ++i)
if (loops)
{
node_t *node = nodes + i;
if (node->type == LIN)
stack[stackptr++] = node;
else if (node->type == LOUT)
node_t *stack[loops];
memset(stack, 0, loops);
for (size_t i = 0; i < usable; ++i)
{
if (stackptr == 0)
node_t *node = nodes + i;
if (node->type == LIN)
stack[stackptr++] = node;
else if (node->type == LOUT)
{
print_error(buffer->name, node->row, node->col,
"ERROR: Unbalanced square brackets!");
goto error;
if (stackptr == 0)
{
print_error(buffer->name, node->row, node->col,
"ERROR: Unbalanced square brackets!");
goto error;
}
// Access last IN loop
--stackptr;
node->loop_ref = stack[stackptr] - nodes;
stack[stackptr]->loop_ref = i;
}
// Access last IN loop
--stackptr;
node->loop_ref = stack[stackptr] - nodes;
stack[stackptr]->loop_ref = i;
}
}