DHBW
/
gemstone
mirror of https://github.com/Servostar/gemstone.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

added: garbage collector

This commit is contained in:
Sven Vogel 2024-06-05 20:00:14 +02:00
parent 1e2f3c263a
commit 03d64fce2e
25 changed files with 658 additions and 244 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

134
src/ast/ast.c
View File

@ -1,29 +1,15 @@
#include <ast/ast.h> #include <ast/ast.h>
#include <stdio.h> #include <stdio.h>
#include <stdlib.h>
#include <sys/log.h> #include <sys/log.h>
#include <assert.h> #include <assert.h>
#include <mem/cache.h>
struct AST_Node_t { struct AST_Node_t *AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind, const char* value) {
// parent node that owns this node
struct AST_Node_t *parent;
// type of AST node: if, declaration, ...
enum AST_SyntaxElement_t kind;
// optional value: integer literal, string literal, ...
const char *value;
TokenLocation location;
GArray *children;
};
AST_NODE_PTR AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind, const char *value) {
DEBUG("creating new AST node: %d \"%s\"", kind, value); DEBUG("creating new AST node: %d \"%s\"", kind, value);
assert(kind < AST_ELEMENT_COUNT); assert(kind < AST_ELEMENT_COUNT);
AST_NODE_PTR node = malloc(sizeof(struct AST_Node_t)); struct AST_Node_t *node = mem_alloc(MemoryNamespaceAst, sizeof(struct AST_Node_t));
if (node == NULL) { if (node == NULL) {
PANIC("failed to allocate AST node"); PANIC("failed to allocate AST node");
@ -34,6 +20,7 @@ AST_NODE_PTR AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind,
// init to discrete state // init to discrete state
node->parent = NULL; node->parent = NULL;
node->children = NULL; node->children = NULL;
node->child_count = 0;
node->kind = kind; node->kind = kind;
node->value = value; node->value = value;
node->location = location; node->location = location;
@ -41,21 +28,7 @@ AST_NODE_PTR AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind,
return node; return node;
} }
size_t AST_child_count(AST_NODE_PTR node) { static const char* lookup_table[AST_ELEMENT_COUNT] = { "__UNINIT__" };
assert(node != NULL);
assert(node->children != NULL);
return node->children->len;
}
AST_NODE_PTR AST_get_last_node(AST_NODE_PTR node) {
assert(node != NULL);
assert(node->children != NULL);
return AST_get_node(node, AST_child_count(node) - 1);
}
static const char *lookup_table[AST_ELEMENT_COUNT] = {"__UNINIT__"};
void AST_init() { void AST_init() {
DEBUG("initializing global syntax tree..."); DEBUG("initializing global syntax tree...");
@ -116,13 +89,13 @@ void AST_init() {
lookup_table[AST_Reference] = "ref"; lookup_table[AST_Reference] = "ref";
} }
const char *AST_node_to_string(AST_NODE_PTR node) { const char* AST_node_to_string(const struct AST_Node_t* node) {
DEBUG("converting AST node to string: %p", node); DEBUG("converting AST node to string: %p", node);
assert(node != NULL); assert(node != NULL);
const char *string; const char* string;
switch (node->kind) { switch(node->kind) {
case AST_Int: case AST_Int:
case AST_Float: case AST_Float:
case AST_String: case AST_String:
@ -153,15 +126,20 @@ static inline unsigned long int max(unsigned long int a, unsigned long int b) {
return a > b ? a : b; return a > b ? a : b;
} }
void AST_push_node(AST_NODE_PTR owner, AST_NODE_PTR child) { void AST_push_node(struct AST_Node_t *owner, struct AST_Node_t *child) {
DEBUG("Adding new node %p to %p", child, owner); DEBUG("Adding new node %p to %p", child, owner);
assert(owner != NULL); assert(owner != NULL);
assert(child != NULL); assert(child != NULL);
// if there are no children for now // if there are no children for now
if (owner->children == NULL) { if (owner->child_count == 0) {
DEBUG("Allocating new children array"); DEBUG("Allocating new children array");
owner->children = g_array_new(FALSE, FALSE, sizeof(AST_NODE_PTR)); owner->children = mem_alloc(MemoryNamespaceAst, sizeof(struct AST_Node_t *));
} else {
DEBUG("Rellocating old children array");
const size_t size = sizeof(struct AST_Node_t *) * (owner->child_count + 1);
owner->children = mem_realloc(MemoryNamespaceAst, owner->children, size);
} }
if (owner->children == NULL) { if (owner->children == NULL) {
@ -176,20 +154,20 @@ void AST_push_node(AST_NODE_PTR owner, AST_NODE_PTR child) {
assert(owner->children != NULL); assert(owner->children != NULL);
g_array_append_val(owner->children, child); owner->children[owner->child_count++] = child;
} }
AST_NODE_PTR AST_get_node(AST_NODE_PTR owner, const size_t idx) { struct AST_Node_t *AST_get_node(struct AST_Node_t *owner, const size_t idx) {
DEBUG("retrvieng node %d from %p", idx, owner); DEBUG("retrvieng node %d from %p", idx, owner);
assert(owner != NULL); assert(owner != NULL);
assert(owner->children != NULL); assert(owner->children != NULL);
assert(idx < owner->children->len); assert(idx < owner->child_count);
if (owner->children == NULL) { if (owner->children == NULL) {
PANIC("AST owner node has no children"); PANIC("AST owner node has no children");
} }
AST_NODE_PTR child = ((AST_NODE_PTR *) owner->children->data)[idx]; struct AST_Node_t *child = owner->children[idx];
if (child == NULL) { if (child == NULL) {
PANIC("child node is NULL"); PANIC("child node is NULL");
@ -198,58 +176,63 @@ AST_NODE_PTR AST_get_node(AST_NODE_PTR owner, const size_t idx) {
return child; return child;
} }
AST_NODE_PTR AST_remove_child(AST_NODE_PTR owner, const size_t idx) { struct AST_Node_t* AST_remove_child(struct AST_Node_t* owner, const size_t idx) {
assert(owner != NULL); assert(owner != NULL);
assert(owner->children != NULL); assert(owner->children != NULL);
assert(idx < owner->children->len); assert(idx < owner->child_count);
AST_NODE_PTR child = AST_get_node(owner, idx); struct AST_Node_t* child = owner->children[idx];
child->parent = NULL; child->parent = NULL;
g_array_remove_index(owner->children, idx); owner->child_count--;
// shift back every following element by one
for (size_t i = idx; i < owner->child_count; i++) {
owner->children[i] = owner->children[i + 1];
}
return child; return child;
} }
AST_NODE_PTR AST_detach_child(AST_NODE_PTR child) { struct AST_Node_t* AST_detach_child(struct AST_Node_t* owner, const struct AST_Node_t* child) {
assert(owner != NULL);
assert(child != NULL); assert(child != NULL);
assert(owner->children != NULL);
for (size_t i = 0; i < AST_child_count(child->parent); i++) { for (size_t i = 0; i < owner->child_count; i++) {
if (AST_get_node(child->parent, i) == child) { if (owner->children[i] == child) {
return AST_remove_child(child->parent, i); return AST_remove_child(owner, i);
} }
} }
PANIC("Child to detach not a child of parent"); PANIC("Child to detach not a child of parent");
} }
void AST_delete_node(AST_NODE_PTR node) { void AST_delete_node(struct AST_Node_t *node) {
assert(node != NULL); assert(node != NULL);
DEBUG("Deleting AST node: %p", node); DEBUG("Deleting AST node: %p", node);
if (node->parent != NULL) { if (node->parent != NULL) {
AST_NODE_PTR child = AST_detach_child(node); const struct AST_Node_t* child = AST_detach_child(node->parent, node);
assert(child == node); assert(child == node);
} }
if (node->children != NULL) { if (node->children != NULL) {
for (size_t i = 0; i < AST_child_count(node); i++) { for (size_t i = 0; i < node->child_count; i++) {
AST_NODE_PTR child = AST_get_node(node, i);
// prevent detach of children node // prevent detach of children node
child->parent = NULL; node->children[i]->parent = NULL;
AST_delete_node(child); AST_delete_node(node->children[i]);
}
mem_free(node->children);
} }
g_array_free(node->children, TRUE); mem_free(node);
}
free(node);
} }
static void AST_visit_nodes_recurse2(AST_NODE_PTR root, static void AST_visit_nodes_recurse2(struct AST_Node_t *root,
void (*for_each)(AST_NODE_PTR node, void (*for_each)(struct AST_Node_t *node,
size_t depth), size_t depth),
const size_t depth) { const size_t depth) {
DEBUG("Recursive visit of %p at %d with %p", root, depth, for_each); DEBUG("Recursive visit of %p at %d with %p", root, depth, for_each);
@ -258,13 +241,13 @@ static void AST_visit_nodes_recurse2(AST_NODE_PTR root,
(for_each)(root, depth); (for_each)(root, depth);
for (size_t i = 0; i < root->children->len; i++) { for (size_t i = 0; i < root->child_count; i++) {
AST_visit_nodes_recurse2(AST_get_node(root, i), for_each, depth + 1); AST_visit_nodes_recurse2(root->children[i], for_each, depth + 1);
} }
} }
void AST_visit_nodes_recurse(AST_NODE_PTR root, void AST_visit_nodes_recurse(struct AST_Node_t *root,
void (*for_each)(AST_NODE_PTR node, void (*for_each)(struct AST_Node_t *node,
size_t depth)) { size_t depth)) {
DEBUG("Starting recursive visit of %p with %p", root, for_each); DEBUG("Starting recursive visit of %p with %p", root, for_each);
@ -274,24 +257,24 @@ void AST_visit_nodes_recurse(AST_NODE_PTR root,
AST_visit_nodes_recurse2(root, for_each, 0); AST_visit_nodes_recurse2(root, for_each, 0);
} }
static void AST_fprint_graphviz_node_definition(FILE *stream, AST_NODE_PTR node) { static void AST_fprint_graphviz_node_definition(FILE* stream, const struct AST_Node_t* node) {
DEBUG("Printing graphviz definition of %p", node); DEBUG("Printing graphviz definition of %p", node);
assert(stream != NULL); assert(stream != NULL);
assert(node != NULL); assert(node != NULL);
fprintf(stream, "\tnode%p [label=\"%s\"]\n", (void *) node, AST_node_to_string(node)); fprintf(stream, "\tnode%p [label=\"%s\"]\n", (void*) node, AST_node_to_string(node));
if (node->children == NULL) { if (node->children == NULL) {
return; return;
} }
for (size_t i = 0; i < node->children->len; i++) { for (size_t i = 0; i < node->child_count; i++) {
AST_fprint_graphviz_node_definition(stream, AST_get_node(node, i)); AST_fprint_graphviz_node_definition(stream, node->children[i]);
} }
} }
static void AST_fprint_graphviz_node_connection(FILE *stream, AST_NODE_PTR node) { static void AST_fprint_graphviz_node_connection(FILE* stream, const struct AST_Node_t* node) {
DEBUG("Printing graphviz connection of %p", node); DEBUG("Printing graphviz connection of %p", node);
assert(stream != NULL); assert(stream != NULL);
@ -301,14 +284,13 @@ static void AST_fprint_graphviz_node_connection(FILE *stream, AST_NODE_PTR node)
return; return;
} }
for (size_t i = 0; i < node->children->len; i++) { for (size_t i = 0; i < node->child_count; i++) {
AST_NODE_PTR child = AST_get_node(node, i); fprintf(stream, "\tnode%p -- node%p\n", (void*) node, (void*) node->children[i]);
fprintf(stream, "\tnode%p -- node%p\n", (void *) node, (void *) child); AST_fprint_graphviz_node_connection(stream, node->children[i]);
AST_fprint_graphviz_node_connection(stream, child);
} }
} }
void AST_fprint_graphviz(FILE *stream, AST_NODE_PTR root) { void AST_fprint_graphviz(FILE* stream, const struct AST_Node_t* root) {
DEBUG("Starting print of graphviz graph of %p", root); DEBUG("Starting print of graphviz graph of %p", root);
assert(stream != NULL); assert(stream != NULL);

59
src/ast/ast.h
View File

@ -1,6 +1,6 @@
#ifndef AST_H_ #ifndef _AST_H_
#define AST_H_ #define _AST_H_
#include <stdio.h> #include <stdio.h>
#include <io/files.h> #include <io/files.h>
@ -89,7 +89,23 @@ enum AST_SyntaxElement_t {
* - kind: The type of the node. Such as AST_Expr, AST_Add, ... * - kind: The type of the node. Such as AST_Expr, AST_Add, ...
* - value: A string representing an optional value. Can be a integer literal for kind AST_int * - value: A string representing an optional value. Can be a integer literal for kind AST_int
*/ */
struct AST_Node_t; struct AST_Node_t {
// parent node that owns this node
struct AST_Node_t *parent;
// type of AST node: if, declaration, ...
enum AST_SyntaxElement_t kind;
// optional value: integer literal, string literal, ...
const char* value;
TokenLocation location;
// number of child nodes ownd by this node
// length of children array
size_t child_count;
// variable amount of child nodes
struct AST_Node_t **children;
};
/** /**
* Shorthand type for a single AST node * Shorthand type for a single AST node
@ -110,21 +126,7 @@ void AST_init(void);
*/ */
[[maybe_unused]] [[maybe_unused]]
[[gnu::nonnull(1)]] [[gnu::nonnull(1)]]
const char* AST_node_to_string(AST_NODE_PTR node); const char* AST_node_to_string(const struct AST_Node_t* node);
/**
* @brief Return the amount of children
* @param node
* @return
*/
size_t AST_child_count(AST_NODE_PTR node);
/**
* @brief Return the last node of the children
* @param node
* @return
*/
AST_NODE_PTR AST_get_last_node(AST_NODE_PTR node);
/** /**
* @brief Create a new node struct on the system heap. Initializes the struct with the given values. * @brief Create a new node struct on the system heap. Initializes the struct with the given values.
@ -137,7 +139,7 @@ AST_NODE_PTR AST_get_last_node(AST_NODE_PTR node);
[[maybe_unused]] [[maybe_unused]]
[[nodiscard("pointer must be freed")]] [[nodiscard("pointer must be freed")]]
[[gnu::returns_nonnull]] [[gnu::returns_nonnull]]
AST_NODE_PTR AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind, const char* value); struct AST_Node_t *AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind, const char* value);
/** /**
* @brief Deallocate this node and all of its children. * @brief Deallocate this node and all of its children.
@ -147,7 +149,7 @@ AST_NODE_PTR AST_new_node(TokenLocation location, enum AST_SyntaxElement_t kind,
*/ */
[[maybe_unused]] [[maybe_unused]]
[[gnu::nonnull(1)]] [[gnu::nonnull(1)]]
void AST_delete_node(AST_NODE_PTR node); void AST_delete_node(struct AST_Node_t * node);
/** /**
* @brief Add a new child node to a parent node * @brief Add a new child node to a parent node
@ -157,7 +159,7 @@ void AST_delete_node(AST_NODE_PTR node);
*/ */
[[maybe_unused]] [[maybe_unused]]
[[gnu::nonnull(1), gnu::nonnull(2)]] [[gnu::nonnull(1), gnu::nonnull(2)]]
void AST_push_node(AST_NODE_PTR owner, AST_NODE_PTR child); void AST_push_node(struct AST_Node_t *owner, struct AST_Node_t *child);
/** /**
* @brief Remove the specified child from the owner. * @brief Remove the specified child from the owner.
@ -170,18 +172,19 @@ void AST_push_node(AST_NODE_PTR owner, AST_NODE_PTR child);
[[maybe_unused]] [[maybe_unused]]
[[nodiscard("pointer must be freed")]] [[nodiscard("pointer must be freed")]]
[[gnu::nonnull(1)]] [[gnu::nonnull(1)]]
AST_NODE_PTR AST_remove_child(AST_NODE_PTR owner, size_t idx); struct AST_Node_t* AST_remove_child(struct AST_Node_t* owner, size_t idx);
/** /**
* @brief Detach a child from its parent. This involves removing the child from its parent * @brief Detach a child from its parent. This involves removing the child from its parent
* and marking the parent of the child as NULL. * and marking the parent of the child as NULL.
* @attention The returned pointer is still valid. It must be freed at some pointer later. * @attention The returned pointer is still valid. It must be freed at some pointer later.
* @param owner the owner to remove the child from
* @param child the child to detach * @param child the child to detach
* @return a pointer to child detached * @return a pointer to child detached
*/ */
[[nodiscard("pointer must be freed")]] [[nodiscard("pointer must be freed")]]
[[gnu::nonnull(1), gnu::nonnull(1)]] [[gnu::nonnull(1), gnu::nonnull(1)]]
AST_NODE_PTR AST_detach_child(AST_NODE_PTR child); struct AST_Node_t* AST_detach_child(struct AST_Node_t* owner, const struct AST_Node_t* child);
/** /**
* @brief Return a pointer to the n-th child of a node * @brief Return a pointer to the n-th child of a node
@ -194,7 +197,7 @@ AST_NODE_PTR AST_detach_child(AST_NODE_PTR child);
*/ */
[[maybe_unused]] [[maybe_unused]]
[[gnu::nonnull(1)]] [[gnu::nonnull(1)]]
AST_NODE_PTR AST_get_node(AST_NODE_PTR owner, size_t idx); struct AST_Node_t *AST_get_node(struct AST_Node_t *owner, size_t idx);
/** /**
* @brief Execute a function for every child, grandchild, ... and the supplied node as topmost ancestor * @brief Execute a function for every child, grandchild, ... and the supplied node as topmost ancestor
@ -203,8 +206,8 @@ AST_NODE_PTR AST_get_node(AST_NODE_PTR owner, size_t idx);
*/ */
[[maybe_unused]] [[maybe_unused]]
[[gnu::nonnull(1), gnu::nonnull(2)]] [[gnu::nonnull(1), gnu::nonnull(2)]]
void AST_visit_nodes_recurse(AST_NODE_PTR root, void AST_visit_nodes_recurse(struct AST_Node_t *root,
void (*for_each)(AST_NODE_PTR node, void (*for_each)(struct AST_Node_t *node,
size_t depth)); size_t depth));
/** /**
@ -214,6 +217,6 @@ void AST_visit_nodes_recurse(AST_NODE_PTR root,
*/ */
[[maybe_unused]] [[maybe_unused]]
[[gnu::nonnull(1), gnu::nonnull(2)]] [[gnu::nonnull(1), gnu::nonnull(2)]]
void AST_fprint_graphviz(FILE* stream, AST_NODE_PTR node); void AST_fprint_graphviz(FILE* stream, const struct AST_Node_t* node);
#endif // AST_H_ #endif

42
src/cfg/opt.c
View File

@ -8,6 +8,7 @@
#include <io/files.h> #include <io/files.h>
#include <assert.h> #include <assert.h>
#include <toml.h> #include <toml.h>
#include <mem/cache.h>
static GHashTable* args = NULL; static GHashTable* args = NULL;
@ -17,8 +18,8 @@ static void clean(void) {
g_hash_table_iter_init(&iter, args); g_hash_table_iter_init(&iter, args);
while (g_hash_table_iter_next(&iter, &key, &value)) { while (g_hash_table_iter_next(&iter, &key, &value)) {
free(value); mem_free(value);
free(key); mem_free(key);
} }
g_hash_table_destroy(args); g_hash_table_destroy(args);
@ -30,9 +31,9 @@ void parse_options(int argc, char* argv[]) {
atexit(clean); atexit(clean);
for (int i = 0; i < argc; i++) { for (int i = 0; i < argc; i++) {
Option* option = malloc(sizeof(Option)); Option* option = mem_alloc(MemoryNamespaceOpt, sizeof(Option));
option->is_opt = g_str_has_prefix(argv[i], "--"); option->is_opt = g_str_has_prefix(argv[i], "--");
option->string = strdup(argv[i] + (option->is_opt ? 2 : 0)); option->string = mem_strdup(MemoryNamespaceOpt, argv[i] + (option->is_opt ? 2 : 0));
option->index = i; option->index = i;
option->value = NULL; option->value = NULL;
@ -91,15 +92,15 @@ GArray* get_non_options_after(const char* command) {
TargetConfig* default_target_config() { TargetConfig* default_target_config() {
DEBUG("generating default target config..."); DEBUG("generating default target config...");
TargetConfig* config = malloc(sizeof(TargetConfig)); TargetConfig* config = mem_alloc(MemoryNamespaceOpt, sizeof(TargetConfig));
config->name = strdup("out"); config->name = mem_strdup(MemoryNamespaceOpt, "out");
config->print_ast = false; config->print_ast = false;
config->print_asm = false; config->print_asm = false;
config->print_ir = false; config->print_ir = false;
config->mode = Application; config->mode = Application;
config->archive_directory = strdup("archive"); config->archive_directory = mem_strdup(MemoryNamespaceOpt, "archive");
config->output_directory = strdup("bin"); config->output_directory = mem_strdup(MemoryNamespaceOpt, "bin");
config->optimization_level = 1; config->optimization_level = 1;
config->root_module = NULL; config->root_module = NULL;
@ -141,7 +142,7 @@ TargetConfig* default_target_config_from_args() {
const Option* opt = get_option("output"); const Option* opt = get_option("output");
if (opt->value != NULL) { if (opt->value != NULL) {
config->name = strdup(opt->value); config->name = mem_strdup(MemoryNamespaceOpt, (char*) opt->value);
} }
} }
@ -155,7 +156,7 @@ TargetConfig* default_target_config_from_args() {
print_message(Warning, "Got more than one file to compile, using first, ignoring others."); print_message(Warning, "Got more than one file to compile, using first, ignoring others.");
} }
config->root_module = strdup( ((char**) files->data) [0]); config->root_module = mem_strdup(MemoryNamespaceOpt, ((char**) files->data) [0]);
g_array_free(files, TRUE); g_array_free(files, TRUE);
} }
@ -182,6 +183,7 @@ void print_help(void) {
" --debug print debug logs (if not disabled at compile time)", " --debug print debug logs (if not disabled at compile time)",
" --version print the version", " --version print the version",
" --help print this hel dialog", " --help print this hel dialog",
" --print-memory-stats print statistics of the garbage collector"
}; };
for (unsigned int i = 0; i < sizeof(lines) / sizeof(const char *); i++) { for (unsigned int i = 0; i < sizeof(lines) / sizeof(const char *); i++) {
@ -361,32 +363,32 @@ int load_project_config(ProjectConfig *config) {
void delete_target_config(TargetConfig* config) { void delete_target_config(TargetConfig* config) {
if (config->root_module != NULL) { if (config->root_module != NULL) {
free(config->root_module); mem_free(config->root_module);
} }
if (config->archive_directory != NULL) { if (config->archive_directory != NULL) {
free(config->archive_directory); mem_free(config->archive_directory);
} }
if (config->name != NULL) { if (config->name != NULL) {
free(config->name); mem_free(config->name);
} }
if (config->output_directory != NULL) { if (config->output_directory != NULL) {
free(config->output_directory); mem_free(config->output_directory);
} }
free(config); mem_free(config);
} }
void delete_project_config(ProjectConfig* config) { void delete_project_config(ProjectConfig* config) {
if (config->name != NULL) { if (config->name != NULL) {
free(config->name); mem_free(config->name);
} }
if (config->authors != NULL) { if (config->authors != NULL) {
g_array_free(config->authors, TRUE); g_array_free(config->authors, TRUE);
} }
if (config->desc != NULL) { if (config->desc != NULL) {
free(config->desc); mem_free(config->desc);
} }
if (config->license != NULL) { if (config->license != NULL) {
free(config->license); mem_free(config->license);
} }
if (config->targets != NULL) { if (config->targets != NULL) {
GHashTableIter iter; GHashTableIter iter;
@ -402,11 +404,11 @@ void delete_project_config(ProjectConfig* config) {
g_hash_table_destroy(config->targets); g_hash_table_destroy(config->targets);
} }
free(config); mem_free_from(MemoryNamespaceOpt, config);
} }
ProjectConfig* default_project_config() { ProjectConfig* default_project_config() {
ProjectConfig* config = malloc(sizeof(ProjectConfig)); ProjectConfig* config = mem_alloc(MemoryNamespaceOpt, sizeof(ProjectConfig));
config->authors = NULL; config->authors = NULL;
config->name = NULL; config->name = NULL;

4
src/compiler.c
View File

@ -11,6 +11,7 @@
#include <io/files.h> #include <io/files.h>
#include <assert.h> #include <assert.h>
#include <cfg/opt.h> #include <cfg/opt.h>
#include <mem/cache.h>
extern void yyrestart(FILE *); extern void yyrestart(FILE *);
@ -148,7 +149,8 @@ static void build_target(ModuleFileStack *unit, const TargetConfig *target) {
AST_delete_node(ast); AST_delete_node(ast);
lex_purge_str_cache(); mem_purge_namespace(MemoryNamespaceLex);
mem_purge_namespace(MemoryNamespaceAst);
print_file_statistics(file); print_file_statistics(file);
} }

7
src/io/files.c
View File

@ -6,6 +6,7 @@
#include <sys/log.h> #include <sys/log.h>
#include <assert.h> #include <assert.h>
#include <sys/col.h> #include <sys/col.h>
#include <mem/cache.h>
#ifdef __unix__ #ifdef __unix__
@ -120,7 +121,7 @@ void print_diagnostic(ModuleFile *file, TokenLocation *location, Message kind, c
printf("%s%s:%ld:%s %s%s:%s %s\n", BOLD, absolute_path, location->line_start, RESET, accent_color, kind_text, RESET, printf("%s%s:%ld:%s %s%s:%s %s\n", BOLD, absolute_path, location->line_start, RESET, accent_color, kind_text, RESET,
message); message);
free((void *) absolute_path); mem_free((void *) absolute_path);
const size_t lines = location->line_end - location->line_start + 1; const size_t lines = location->line_end - location->line_start + 1;
@ -305,7 +306,7 @@ int create_directory(const char *path) {
} }
const char *get_last_error() { const char *get_last_error() {
return strdup(strerror(errno)); return mem_strdup(MemoryNamespaceIo, strerror(errno));
} }
const char *get_absolute_path(const char *path) { const char *get_absolute_path(const char *path) {
@ -323,7 +324,7 @@ const char *get_absolute_path(const char *path) {
_fullpath(path, absolute_path, _MAX_PATH); _fullpath(path, absolute_path, _MAX_PATH);
#endif #endif
return strdup(absolute_path); return mem_strdup(MemoryNamespaceIo, absolute_path);
} }
const char* make_file_path(const char* name, const char* ext, int count, ...) { const char* make_file_path(const char* name, const char* ext, int count, ...) {

11
src/lex/lexer.l
View File

@ -3,6 +3,7 @@
#include <yacc/parser.tab.h> #include <yacc/parser.tab.h>
#include <sys/log.h> #include <sys/log.h>
#include <lex/util.h> #include <lex/util.h>
#include <mem/cache.h>
int yyLineNumber = 1; int yyLineNumber = 1;
@ -89,20 +90,20 @@
"lineno" {DEBUG("\"%s\" tokenized with \'FunLineno\'", yytext); return(FunLineno);}; "lineno" {DEBUG("\"%s\" tokenized with \'FunLineno\'", yytext); return(FunLineno);};
"extsupport" {DEBUG("\"%s\" tokenized with \'FunExtsupport\'", yytext); return(FunExtsupport);}; "extsupport" {DEBUG("\"%s\" tokenized with \'FunExtsupport\'", yytext); return(FunExtsupport);};
[0-9]+ {DEBUG("\"%s\" tokenized with \'ValInt\'", yytext); yylval.string = lex_cached_strdup(yytext); return(ValInt); }; [0-9]+ {DEBUG("\"%s\" tokenized with \'ValInt\'", yytext); yylval.string = mem_strdup(MemoryNamespaceLex, yytext); return(ValInt); };
[0-9]*\.[0-9]+ {DEBUG("\"%s\" tokenized with \'ValFloat\'", yytext); yylval.string = lex_cached_strdup(yytext); return(ValFloat);}; [0-9]*\.[0-9]+ {DEBUG("\"%s\" tokenized with \'ValFloat\'", yytext); yylval.string = mem_strdup(MemoryNamespaceLex, yytext); return(ValFloat);};
[a-zA-Z_0-9]+ {DEBUG("\"%s\" tokenized with \'Ident\'", yytext); yylval.string = lex_cached_strdup(yytext); return(Ident); }; [a-zA-Z_0-9]+ {DEBUG("\"%s\" tokenized with \'Ident\'", yytext); yylval.string = mem_strdup(MemoryNamespaceLex, yytext); return(Ident); };
\"([^\"\n])*\" { \"([^\"\n])*\" {
yytext = yytext +1; yytext = yytext +1;
yytext[yyleng - 2] = 0; yytext[yyleng - 2] = 0;
DEBUG("\"%s\" tokenized with \'ValStr\'", yytext); yylval.string = lex_cached_strdup(yytext); return(ValStr);}; DEBUG("\"%s\" tokenized with \'ValStr\'", yytext); yylval.string = mem_strdup(MemoryNamespaceLex, yytext); return(ValStr);};
\"\"\"[^\"]*\"\"\" { \"\"\"[^\"]*\"\"\" {
yytext = yytext +3; yytext = yytext +3;
yytext[yyleng - 4] = 0; yytext[yyleng - 4] = 0;
DEBUG("\"%s\" tokenized with \'ValMultistr\'", yytext); yylval.string = lex_cached_strdup(yytext); return(ValMultistr);}; DEBUG("\"%s\" tokenized with \'ValMultistr\'", yytext); yylval.string = mem_strdup(MemoryNamespaceLex, yytext); return(ValMultistr);};
[ \r\t] { /* ignore whitespace */ }; [ \r\t] { /* ignore whitespace */ };
. { return yytext[0]; /* passthrough unknown token, let parser handle the error */ }; . { return yytext[0]; /* passthrough unknown token, let parser handle the error */ };
%% %%

33
src/lex/util.c
View File

@ -3,6 +3,7 @@
#include <string.h> #include <string.h>
#include <stdlib.h> #include <stdlib.h>
#include <glib.h> #include <glib.h>
#include <mem/cache.h>
// implementation based on: // implementation based on:
// https://github.com/sunxfancy/flex-bison-examples/blob/master/error-handling/ccalc.c // https://github.com/sunxfancy/flex-bison-examples/blob/master/error-handling/ccalc.c
@ -17,38 +18,8 @@ static int nTokenStart = 0;
static int nTokenLength = 0; static int nTokenLength = 0;
static int nTokenNextStart = 0; static int nTokenNextStart = 0;
static GArray* stringCache = NULL;
char* lex_cached_strdup(char* string) {
char* dup = strdup(string);
g_array_append_val(stringCache, dup);
return dup;
}
void lex_purge_str_cache() {
DEBUG("purging string cache...");
const guint count = stringCache->len;
for (guint i = 0; i < count; i++) {
free(((char**) stringCache->data)[i]);
}
g_array_remove_range(stringCache, 0, count);
}
static void lex_deinit(void) {
lex_purge_str_cache();
g_array_free(stringCache, TRUE);
free(buffer);
}
void lex_init(void) { void lex_init(void) {
buffer = malloc(MAX_READ_BUFFER_SIZE); buffer = mem_alloc(MemoryNamespaceStatic, MAX_READ_BUFFER_SIZE);
stringCache = g_array_new(FALSE, FALSE, sizeof(char*));
atexit(lex_deinit);
} }
void lex_reset(void) { void lex_reset(void) {

4
src/lex/util.h
View File

@ -18,10 +18,6 @@ void lex_init(void);
void lex_reset(void); void lex_reset(void);
char* lex_cached_strdup(char* string);
void lex_purge_str_cache();
/** /**
* @brief Begin counting a new token. This will fill the global struct yylloc. * @brief Begin counting a new token. This will fill the global struct yylloc.
* @param t the text of the token. Must be null terminated * @param t the text of the token. Must be null terminated

7
src/main.c
View File

@ -5,6 +5,7 @@
#include <lex/util.h> #include <lex/util.h>
#include <cfg/opt.h> #include <cfg/opt.h>
#include <compiler.h> #include <compiler.h>
#include <mem/cache.h>
/** /**
* @brief Log a debug message to inform about beginning exit procedures * @brief Log a debug message to inform about beginning exit procedures
@ -17,6 +18,8 @@ void notify_exit(void) { DEBUG("Exiting gemstone..."); }
* *
*/ */
void setup(int argc, char *argv[]) { void setup(int argc, char *argv[]) {
mem_init();
// setup preample // setup preample
parse_options(argc, argv); parse_options(argc, argv);
@ -57,5 +60,9 @@ int main(int argc, char *argv[]) {
run_compiler(); run_compiler();
if (is_option_set("print-memory-stats")) {
print_memory_statistics();
}
return 0; return 0;
} }

271
src/mem/cache.c Normal file
View File

@ -0,0 +1,271 @@
//
// Created by servostar on 6/5/24.
//
#include <mem/cache.h>
#include <sys/log.h>
#include <glib.h>
#include <string.h>
#include <assert.h>
static GHashTable* namespaces = NULL;
typedef struct MemoryNamespaceStatistic_t {
size_t bytes_allocated;
size_t allocation_count;
size_t reallocation_count;
size_t manual_free_count;
size_t faulty_reallocations;
size_t faulty_allocations;
size_t purged_free_count;
} MemoryNamespaceStatistic;
typedef struct MemoryNamespace_t {
MemoryNamespaceStatistic statistic;
GArray* blocks;
} MemoryNamespace;
typedef MemoryNamespace* MemoryNamespaceRef;
static void namespace_statistics_print(MemoryNamespaceStatistic* memoryNamespaceStatistic, char* name) {
printf("Memory namespace statistics: `%s`\n", name);
printf("------------------------------\n");
printf(" allocated bytes: %ld\n", memoryNamespaceStatistic->bytes_allocated);
printf(" allocations: %ld\n", memoryNamespaceStatistic->allocation_count);
printf(" reallocations: %ld\n", memoryNamespaceStatistic->reallocation_count);
printf(" frees: %ld\n", memoryNamespaceStatistic->manual_free_count);
printf(" faulty allocations: %ld\n", memoryNamespaceStatistic->faulty_allocations);
printf(" faulty reallocations: %ld\n", memoryNamespaceStatistic->faulty_reallocations);
printf(" purged allocations: %ld\n", memoryNamespaceStatistic->purged_free_count);
printf("\n");
}
static void* namespace_malloc(MemoryNamespaceRef memoryNamespace, size_t size) {
assert(memoryNamespace != NULL);
assert(size != 0);
void* block = malloc(size);
if (block == NULL) {
memoryNamespace->statistic.faulty_allocations ++;
} else {
g_array_append_val(memoryNamespace->blocks, block);
memoryNamespace->statistic.allocation_count ++;
memoryNamespace->statistic.bytes_allocated += size;
}
return block;
}
static gboolean namespace_free(MemoryNamespaceRef memoryNamespace, void* block) {
for (guint i = 0; i < memoryNamespace->blocks->len; i++) {
void* current_block = g_array_index(memoryNamespace->blocks, void*, i);
if (current_block == block) {
assert(block != NULL);
free(block);
g_array_remove_index(memoryNamespace->blocks, i);
memoryNamespace->statistic.manual_free_count++;
return TRUE;
}
}
return FALSE;
}
static void* namespace_realloc(MemoryNamespaceRef memoryNamespace, void* block, size_t size) {
void* reallocated_block = NULL;
for (guint i = 0; i < memoryNamespace->blocks->len; i++) {
void* current_block = g_array_index(memoryNamespace->blocks, void*, i);
if (current_block == block) {
reallocated_block = realloc(block, size);
if (reallocated_block != NULL) {
g_array_index(memoryNamespace->blocks, void*, i) = reallocated_block;
memoryNamespace->statistic.bytes_allocated += size;
memoryNamespace->statistic.reallocation_count ++;
} else {
memoryNamespace->statistic.faulty_reallocations++;
}
break;
}
}
return reallocated_block;
}
static void namespace_delete(MemoryNamespaceRef memoryNamespace) {
g_array_free(memoryNamespace->blocks, TRUE);
free(memoryNamespace);
}
static void namespace_purge(MemoryNamespaceRef memoryNamespace) {
for (guint i = 0; i < memoryNamespace->blocks->len; i++) {
void* current_block = g_array_index(memoryNamespace->blocks, void*, i);
free(current_block);
memoryNamespace->statistic.purged_free_count ++;
}
g_array_remove_range(memoryNamespace->blocks, 0, memoryNamespace->blocks->len);
}
static MemoryNamespaceRef namespace_new() {
MemoryNamespaceRef memoryNamespace = malloc(sizeof(MemoryNamespace));
memoryNamespace->blocks = g_array_new(FALSE, FALSE, sizeof(void*));
memoryNamespace->statistic.bytes_allocated = 0;
memoryNamespace->statistic.allocation_count = 0;
memoryNamespace->statistic.manual_free_count = 0;
memoryNamespace->statistic.faulty_reallocations = 0;
memoryNamespace->statistic.faulty_allocations = 0;
memoryNamespace->statistic.purged_free_count = 0;
memoryNamespace->statistic.reallocation_count = 0;
return memoryNamespace;
}
static void cleanup() {
if (namespaces == NULL) {
printf("==> Memory cache was unused <==\n");
return;
}
GHashTableIter iter;
char* name = NULL;
MemoryNamespaceRef memoryNamespace = NULL;
g_hash_table_iter_init(&iter, namespaces);
while (g_hash_table_iter_next(&iter, (gpointer) &name, (gpointer) &memoryNamespace)) {
assert(name != NULL);
assert(memoryNamespace != NULL);
namespace_purge(memoryNamespace);
namespace_delete(memoryNamespace);
}
}
void mem_init() {
atexit(cleanup);
}
static MemoryNamespaceRef check_namespace(MemoryNamespaceName name) {
if (namespaces == NULL) {
namespaces = g_hash_table_new(g_str_hash, g_str_equal);
}
if (g_hash_table_contains(namespaces, name)) {
return g_hash_table_lookup(namespaces, name);
} else {
MemoryNamespaceRef namespace = namespace_new();
g_hash_table_insert(namespaces, name, namespace);
return namespace;
}
}
void *mem_alloc(MemoryNamespaceName name, size_t size) {
MemoryNamespaceRef cache = check_namespace(name);
if (cache == NULL) {
PANIC("memory namespace not created");
}
return namespace_malloc(cache, size);
}
void *mem_realloc(MemoryNamespaceName name, void *ptr, size_t size) {
MemoryNamespaceRef cache = check_namespace(name);
if (cache == NULL) {
PANIC("memory namespace not created");
}
return namespace_realloc(cache, ptr, size);
}
void mem_free_from(MemoryNamespaceName name, void *memory) {
MemoryNamespaceRef cache = check_namespace(name);
namespace_free(cache, memory);
}
void mem_free(void* memory) {
GHashTableIter iter;
char* name;
MemoryNamespaceRef memoryNamespace;
g_hash_table_iter_init(&iter, namespaces);
while (g_hash_table_iter_next(&iter, (gpointer) &name, (gpointer) &memoryNamespace)) {
if (namespace_free(memoryNamespace, memory)) {
break;
}
}
}
void mem_purge_namespace(MemoryNamespaceName name) {
if (g_hash_table_contains(namespaces, name)) {
MemoryNamespaceRef cache = g_hash_table_lookup(namespaces, name);
namespace_purge(cache);
} else {
PANIC("purging invalid namespace: %s", name);
}
}
char* mem_strdup(MemoryNamespaceName name, char* string) {
return mem_clone(name, string, strlen(string) + 1);
}
void* mem_clone(MemoryNamespaceName name, void* data, size_t size) {
void *clone = mem_alloc(name, size);
memcpy(clone, data, size);
return clone;
}
void print_memory_statistics() {
GHashTableIter iter;
char* name;
MemoryNamespaceRef memoryNamespace;
MemoryNamespaceStatistic total;
total.bytes_allocated = 0;
total.faulty_reallocations = 0;
total.faulty_allocations = 0;
total.manual_free_count = 0;
total.allocation_count = 0;
total.purged_free_count = 0;
total.reallocation_count = 0;
g_hash_table_iter_init(&iter, namespaces);
while (g_hash_table_iter_next(&iter, (gpointer) &name, (gpointer) &memoryNamespace)) {
namespace_statistics_print(&memoryNamespace->statistic, name);
total.bytes_allocated += memoryNamespace->statistic.bytes_allocated;
total.faulty_reallocations += memoryNamespace->statistic.faulty_reallocations;
total.faulty_allocations += memoryNamespace->statistic.faulty_allocations;
total.manual_free_count += memoryNamespace->statistic.manual_free_count;
total.allocation_count += memoryNamespace->statistic.allocation_count;
total.purged_free_count += memoryNamespace->statistic.purged_free_count;
total.reallocation_count += memoryNamespace->statistic.reallocation_count;
}
namespace_statistics_print(&total, "summary");
printf("Note: untracked are memory allocations from external libraries.\n");
}

89
src/mem/cache.h Normal file
View File

@ -0,0 +1,89 @@
//
// Created by servostar on 6/5/24.
//
#ifndef GEMSTONE_CACHE_H
#define GEMSTONE_CACHE_H
#include <mem/cache.h>
#include <stddef.h>
typedef char* MemoryNamespaceName;
#define MemoryNamespaceAst "AST"
#define MemoryNamespaceLex "Lexer"
#define MemoryNamespaceLog "Logging"
#define MemoryNamespaceOpt "Options"
#define MemoryNamespaceSet "SET"
#define MemoryNamespaceLlvm "LLVM"
#define MemoryNamespaceIo "I/O"
#define MemoryNamespaceStatic "Static"
/**
* @brief Initialize the garbage collector.
* Must be done to ensure cleanup of memory.
*/
void mem_init();
/**
* @brief Allocate a block of memory in the specified namespace.
* @attention Must only be freed with mem_free() or mem_free_from()
* @param name
* @param size
* @return pointer to the block
*/
void* mem_alloc(MemoryNamespaceName name, size_t size);
/**
* @brief Reallocate a block of memory in the specified namespace.
* @attention Must only be freed with mem_free() or mem_free_from()
* @param name
* @param size
* @return pointer to the block
*/
void* mem_realloc(MemoryNamespaceName name, void *ptr, size_t size);
/**
* @brief Free a block of memory from a specified namespace.
* Invoking multiple times on the same pointer will do nothing.
* @param name
* @param memory
*/
void mem_free_from(MemoryNamespaceName name, void* memory);
/**
* @brief Free a block of memory.
* Invoking multiple times on the same pointer will do nothing.
* @attention In case the namespace of the block is known, consider using mem_free_from()
* to avoid unnecessary overhead.
* @param name
* @param memory
*/
void mem_free(void* memory);
/**
* @brief Delete all memory from the given namespace.
* @param name
*/
void mem_purge_namespace(MemoryNamespaceName name);
/**
* @brief Duplicate the given string with memory in the given namespace.
* @param name
* @param string
* @return
*/
char* mem_strdup(MemoryNamespaceName name, char* string);
/**
* @brief Duplicate the given block of data with memory in the given namespace.
* @param name
* @param data
* @param size
* @return
*/
void* mem_clone(MemoryNamespaceName name, void* data, size_t size);
void print_memory_statistics();
#endif //GEMSTONE_CACHE_H

5
src/sys/log.c
View File

@ -6,6 +6,7 @@
#include <assert.h> #include <assert.h>
#include <string.h> #include <string.h>
#include <cfg/opt.h> #include <cfg/opt.h>
#include <mem/cache.h>
static struct Logger_t { static struct Logger_t {
FILE** streams; FILE** streams;
@ -39,7 +40,7 @@ void log_register_stream(FILE* restrict stream)
if (GlobalLogger.stream_count == 0) if (GlobalLogger.stream_count == 0)
{ {
GlobalLogger.streams = (FILE**) malloc(sizeof(FILE*)); GlobalLogger.streams = (FILE**) mem_alloc(MemoryNamespaceLog, sizeof(FILE*));
GlobalLogger.stream_count = 1; GlobalLogger.stream_count = 1;
if (GlobalLogger.streams == NULL) if (GlobalLogger.streams == NULL)
@ -51,7 +52,7 @@ void log_register_stream(FILE* restrict stream)
{ {
GlobalLogger.stream_count++; GlobalLogger.stream_count++;
size_t bytes = GlobalLogger.stream_count * sizeof(FILE*); size_t bytes = GlobalLogger.stream_count * sizeof(FILE*);
GlobalLogger.streams = (FILE**) realloc(GlobalLogger.streams, bytes); GlobalLogger.streams = (FILE**) mem_realloc(MemoryNamespaceLog, GlobalLogger.streams, bytes);
if (GlobalLogger.streams == NULL) if (GlobalLogger.streams == NULL)
{ {

1
tests/CMakeLists.txt
View File

@ -11,3 +11,4 @@ add_subdirectory(input_file)
add_subdirectory(ast) add_subdirectory(ast)
add_subdirectory(glib) add_subdirectory(glib)
add_subdirectory(project) add_subdirectory(project)
add_subdirectory(cache)

3
tests/ast/CMakeLists.txt
View File

@ -26,6 +26,7 @@ add_executable(ast_build_tree
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
${PROJECT_SOURCE_DIR}/dep/tomlc99/toml.c ${PROJECT_SOURCE_DIR}/dep/tomlc99/toml.c
build_tree.c) build_tree.c)
set_target_properties(ast_build_tree set_target_properties(ast_build_tree
@ -47,6 +48,7 @@ add_executable(ast_print_node
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
${PROJECT_SOURCE_DIR}/dep/tomlc99/toml.c ${PROJECT_SOURCE_DIR}/dep/tomlc99/toml.c
print_node.c) print_node.c)
set_target_properties(ast_print_node set_target_properties(ast_print_node
@ -68,6 +70,7 @@ add_executable(ast_graphviz
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
${PROJECT_SOURCE_DIR}/dep/tomlc99/toml.c ${PROJECT_SOURCE_DIR}/dep/tomlc99/toml.c
print_graphviz.c) print_graphviz.c)
set_target_properties(ast_graphviz set_target_properties(ast_graphviz

2
tests/ast/build_tree.c
View File

@ -4,6 +4,7 @@
#include <ast/ast.h> #include <ast/ast.h>
#include <sys/log.h> #include <sys/log.h>
#include <mem/cache.h>
void generate_statement(const AST_NODE_PTR stmt) { void generate_statement(const AST_NODE_PTR stmt) {
const AST_NODE_PTR add = AST_new_node(empty_location(), AST_Add, NULL); const AST_NODE_PTR add = AST_new_node(empty_location(), AST_Add, NULL);
@ -29,6 +30,7 @@ void generate_branch(const AST_NODE_PTR stmt) {
} }
int main(void) { int main(void) {
mem_init();
const AST_NODE_PTR root = AST_new_node(empty_location(), AST_Stmt, NULL); const AST_NODE_PTR root = AST_new_node(empty_location(), AST_Stmt, NULL);

2
tests/ast/gen_graph.c
View File

@ -4,8 +4,10 @@
#include <ast/ast.h> #include <ast/ast.h>
#include <sys/log.h> #include <sys/log.h>
#include <mem/cache.h>
int main(void) { int main(void) {
mem_init();
struct AST_Node_t* node = AST_new_node(empty_location(), AST_If, NULL); struct AST_Node_t* node = AST_new_node(empty_location(), AST_If, NULL);

3
tests/ast/print_graphviz.c
View File

@ -4,6 +4,7 @@
#include <ast/ast.h> #include <ast/ast.h>
#include <sys/log.h> #include <sys/log.h>
#include <mem/cache.h>
void generate_statement(const AST_NODE_PTR stmt) { void generate_statement(const AST_NODE_PTR stmt) {
const AST_NODE_PTR add = AST_new_node(empty_location(), AST_Add, NULL); const AST_NODE_PTR add = AST_new_node(empty_location(), AST_Add, NULL);
@ -29,7 +30,7 @@ void generate_branch(const AST_NODE_PTR stmt) {
} }
int main(void) { int main(void) {
mem_init();
AST_init(); AST_init();
const AST_NODE_PTR root = AST_new_node(empty_location(), AST_Stmt, NULL); const AST_NODE_PTR root = AST_new_node(empty_location(), AST_Stmt, NULL);

3
tests/ast/print_node.c
View File

@ -3,9 +3,10 @@
// //
#include <ast/ast.h> #include <ast/ast.h>
#include <mem/cache.h>
int main(void) { int main(void) {
mem_init();
AST_init(); AST_init();
const AST_NODE_PTR node = AST_new_node(empty_location(), 0, "value"); const AST_NODE_PTR node = AST_new_node(empty_location(), 0, "value");

38
tests/cache/CMakeLists.txt vendored Normal file
View File

@ -0,0 +1,38 @@
include(CTest)
include_directories(${PROJECT_SOURCE_DIR}/src)
# ------------------------------------------------ #
# Setup Glib 2.0 #
# ------------------------------------------------ #
find_package(PkgConfig REQUIRED)
pkg_search_module(GLIB REQUIRED IMPORTED_TARGET glib-2.0)
include_directories(PRIVATE ${GLIB_INCLUDE_DIRS})
# ------------------------------------------------ #
# Setup TOML-C99 #
# ------------------------------------------------ #
include_directories(${PROJECT_SOURCE_DIR}/dep/tomlc99)
# ------------------------------------------------------- #
# CTEST 1
# test the memory cache
add_executable(cache
${PROJECT_SOURCE_DIR}/src/sys/log.c
${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
cache_test.c)
set_target_properties(cache
PROPERTIES
OUTPUT_NAME "cache"
RUNTIME_OUTPUT_DIRECTORY ${GEMSTONE_BINARY_DIR}/tests/cache)
target_link_libraries(cache PkgConfig::GLIB)
target_link_libraries(cache tomlc99)
add_test(NAME cache
WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}
COMMAND ${GEMSTONE_BINARY_DIR}/tests/cache/cache)

28
tests/cache/cache_test.c vendored Normal file
View File

@ -0,0 +1,28 @@
//
// Created by servostar on 6/5/24.
//
#include <sys/log.h>
#include <sys/col.h>
#include <cfg/opt.h>
#include <mem/cache.h>
int main(int argc, char* argv[]) {
mem_init();
parse_options(argc, argv);
log_init();
set_log_level(LOG_LEVEL_DEBUG);
col_init();
for (int i = 0; i < 3; i++) {
void* data = mem_alloc(MemoryNamespaceAst, 457);
mem_realloc(MemoryNamespaceAst, data, 200);
mem_free(data);
}
mem_purge_namespace(MemoryNamespaceOpt);
print_memory_statistics();
return 0;
}

4
tests/logging/CMakeLists.txt
View File

@ -25,6 +25,7 @@ add_executable(logging_output
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
output.c) output.c)
set_target_properties(logging_output set_target_properties(logging_output
PROPERTIES PROPERTIES
@ -45,6 +46,7 @@ add_executable(logging_panic
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
panic.c) panic.c)
set_target_properties(logging_panic set_target_properties(logging_panic
PROPERTIES PROPERTIES
@ -65,6 +67,7 @@ add_executable(logging_streams
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
streams.c) streams.c)
set_target_properties(logging_streams set_target_properties(logging_streams
PROPERTIES PROPERTIES
@ -85,6 +88,7 @@ add_executable(logging_level
${PROJECT_SOURCE_DIR}/src/sys/col.c ${PROJECT_SOURCE_DIR}/src/sys/col.c
${PROJECT_SOURCE_DIR}/src/cfg/opt.c ${PROJECT_SOURCE_DIR}/src/cfg/opt.c
${PROJECT_SOURCE_DIR}/src/io/files.c ${PROJECT_SOURCE_DIR}/src/io/files.c
${PROJECT_SOURCE_DIR}/src/mem/cache.c
level.c) level.c)
set_target_properties(logging_level set_target_properties(logging_level
PROPERTIES PROPERTIES

2
tests/logging/level.c
View File

@ -5,10 +5,12 @@
#include "sys/log.h" #include "sys/log.h"
#include <sys/col.h> #include <sys/col.h>
#include <cfg/opt.h> #include <cfg/opt.h>
#include <mem/cache.h>
#define LOG_LEVEL LOG_LEVEL_WARNING #define LOG_LEVEL LOG_LEVEL_WARNING
int main(int argc, char* argv[]) { int main(int argc, char* argv[]) {
mem_init();
parse_options(argc, argv); parse_options(argc, argv);
log_init(); log_init();
set_log_level(LOG_LEVEL_DEBUG); set_log_level(LOG_LEVEL_DEBUG);

2
tests/logging/output.c
View File

@ -5,8 +5,10 @@
#include "sys/log.h" #include "sys/log.h"
#include <sys/col.h> #include <sys/col.h>
#include <cfg/opt.h> #include <cfg/opt.h>
#include <mem/cache.h>
int main(int argc, char* argv[]) { int main(int argc, char* argv[]) {
mem_init();
parse_options(argc, argv); parse_options(argc, argv);
log_init(); log_init();
set_log_level(LOG_LEVEL_DEBUG); set_log_level(LOG_LEVEL_DEBUG);

2
tests/logging/panic.c
View File

@ -4,8 +4,10 @@
#include "sys/log.h" #include "sys/log.h"
#include <cfg/opt.h> #include <cfg/opt.h>
#include <mem/cache.h>
int main(int argc, char* argv[]) { int main(int argc, char* argv[]) {
mem_init();
parse_options(argc, argv); parse_options(argc, argv);
log_init(); log_init();
set_log_level(LOG_LEVEL_DEBUG); set_log_level(LOG_LEVEL_DEBUG);

2
tests/logging/streams.c
View File

@ -5,6 +5,7 @@
#include "sys/log.h" #include "sys/log.h"
#include <stdlib.h> #include <stdlib.h>
#include <cfg/opt.h> #include <cfg/opt.h>
#include <mem/cache.h>
static FILE* file; static FILE* file;
@ -15,6 +16,7 @@ void close_file(void) {
} }
int main(int argc, char* argv[]) { int main(int argc, char* argv[]) {
mem_init();
parse_options(argc, argv); parse_options(argc, argv);
log_init(); log_init();
set_log_level(LOG_LEVEL_DEBUG); set_log_level(LOG_LEVEL_DEBUG);