|
|
|
@ -259,83 +259,6 @@ MunitResult test_symbol_add_export(const MunitParameter params[], void *data) {
|
|
|
|
|
return MUNIT_OK;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
MunitResult test_symbol_table_growth(const MunitParameter params[], void *data) {
|
|
|
|
|
(void)params;
|
|
|
|
|
(void)data;
|
|
|
|
|
ast_node_t *root;
|
|
|
|
|
tokenlist_t *list;
|
|
|
|
|
symbol_table_t *table = nullptr;
|
|
|
|
|
|
|
|
|
|
// Set up with our manysymbols.asm file
|
|
|
|
|
symbols_setup_test(&root, &list, "tests/input/manysymbols.asm");
|
|
|
|
|
symbol_table_alloc(&table);
|
|
|
|
|
|
|
|
|
|
// Initial capacity should be the default (64)
|
|
|
|
|
munit_assert_size(table->cap, ==, 64);
|
|
|
|
|
munit_assert_size(table->len, ==, 0);
|
|
|
|
|
|
|
|
|
|
// Add the first 64 labels (indices 0-63)
|
|
|
|
|
size_t initial_cap = table->cap;
|
|
|
|
|
for (size_t i = 0; i < 64; i++) {
|
|
|
|
|
ast_node_t *label = root->children[i];
|
|
|
|
|
munit_assert_int(label->id, ==, NODE_LABEL);
|
|
|
|
|
|
|
|
|
|
error_t *err = symbol_table_update(table, label);
|
|
|
|
|
munit_assert_null(err);
|
|
|
|
|
munit_assert_size(table->len, ==, i + 1);
|
|
|
|
|
|
|
|
|
|
// Capacity should remain the same for the first 64 labels
|
|
|
|
|
munit_assert_size(table->cap, ==, initial_cap);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Now add the 65th label (index 64), which should trigger growth
|
|
|
|
|
ast_node_t *final_label = root->children[64];
|
|
|
|
|
munit_assert_int(final_label->id, ==, NODE_LABEL);
|
|
|
|
|
|
|
|
|
|
error_t *err = symbol_table_update(table, final_label);
|
|
|
|
|
munit_assert_null(err);
|
|
|
|
|
munit_assert_size(table->len, ==, 65);
|
|
|
|
|
|
|
|
|
|
// Capacity should have doubled
|
|
|
|
|
munit_assert_size(table->cap, ==, initial_cap * 2);
|
|
|
|
|
|
|
|
|
|
// Validate we can look up all the symbols
|
|
|
|
|
for (size_t i = 0; i <= 64; i++) {
|
|
|
|
|
char name[10];
|
|
|
|
|
sprintf(name, "lbl_%zu", i);
|
|
|
|
|
|
|
|
|
|
symbol_t *symbol = symbol_table_lookup(table, name);
|
|
|
|
|
munit_assert_not_null(symbol);
|
|
|
|
|
munit_assert_int(SYMBOL_LOCAL, ==, symbol->kind);
|
|
|
|
|
munit_assert_string_equal(symbol->name, name);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
symbol_table_free(table);
|
|
|
|
|
ast_node_free(root);
|
|
|
|
|
tokenlist_free(list);
|
|
|
|
|
return MUNIT_OK;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
MunitResult test_symbol_invalid_node(const MunitParameter params[], void *data) {
|
|
|
|
|
(void)params;
|
|
|
|
|
(void)data;
|
|
|
|
|
ast_node_t *root;
|
|
|
|
|
tokenlist_t *list;
|
|
|
|
|
symbol_table_t *table = nullptr;
|
|
|
|
|
symbols_setup_test(&root, &list, "tests/input/symbols.asm");
|
|
|
|
|
symbol_table_alloc(&table);
|
|
|
|
|
|
|
|
|
|
munit_assert_size(table->len, ==, 0);
|
|
|
|
|
error_t *err = symbol_table_update(table, root);
|
|
|
|
|
munit_assert_ptr_equal(err, err_symbol_table_invalid_node);
|
|
|
|
|
munit_assert_size(table->len, ==, 0);
|
|
|
|
|
|
|
|
|
|
symbol_table_free(table);
|
|
|
|
|
ast_node_free(root);
|
|
|
|
|
tokenlist_free(list);
|
|
|
|
|
return MUNIT_OK;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
MunitTest symbols_tests[] = {
|
|
|
|
|
{"/table_alloc", test_symbol_table_alloc, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
|
{"/table_lookup_empty", test_symbol_table_lookup_empty, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
@ -345,7 +268,5 @@ MunitTest symbols_tests[] = {
|
|
|
|
|
{"/add_export", test_symbol_add_export, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
|
{"/upgrade_valid", test_symbol_upgrade_valid, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
|
{"/upgrade_invalid", test_symbol_upgrade_invalid, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
|
{"/table_growth", test_symbol_table_growth, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
|
{"/invalid_node", test_symbol_invalid_node, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr},
|
|
|
|
|
{nullptr, nullptr, nullptr, nullptr, MUNIT_TEST_OPTION_NONE, nullptr}
|
|
|
|
|
};
|
|
|
|
|