#include <assert.h>
+#include <stdio.h>
#include <stdlib.h>
+#include <string.h>
+#include "builtins.h"
#include "expr.h"
#include "gc.h"
+#include "system/error.h"
+#include "system/lt.h"
+
+#define GC_INITIAL_CAPACITY 256
+
+struct Gc
+{
+ Lt *lt;
+ struct Expr *exprs;
+ int *visited;
+ size_t size;
+ size_t capacity;
+};
+
+static long int value_of_expr(struct Expr expr)
+{
+ if (expr.type == EXPR_CONS) {
+ return (long int) expr.cons;
+ } else if (expr.type == EXPR_ATOM) {
+ return (long int) expr.atom;
+ } else {
+ return 0;
+ }
+}
+
+static int compare_exprs(const void *a, const void *b)
+{
+ assert(a);
+ assert(b);
+
+ const long int ptr_a = value_of_expr(*(const struct Expr *)a);
+ const long int ptr_b = value_of_expr(*(const struct Expr *)b);
+ const long int d = ptr_b - ptr_a;
+
+ if (d < 0) {
+ return -1;
+ } else if (d > 0) {
+ return 1;
+ } else {
+ return 0;
+ }
+}
Gc *create_gc(void)
{
- return NULL;
+ Lt *lt = create_lt();
+ if (lt == NULL) {
+ return NULL;
+ }
+
+ Gc *gc = PUSH_LT(lt, malloc(sizeof(Gc)), free);
+ if (gc == NULL) {
+ throw_error(ERROR_TYPE_LIBC);
+ RETURN_LT(lt, NULL);
+ }
+ gc->lt = lt;
+
+ gc->exprs = PUSH_LT(lt, malloc(sizeof(struct Expr) * GC_INITIAL_CAPACITY), free);
+ if (gc->exprs == NULL) {
+ throw_error(ERROR_TYPE_LIBC);
+ RETURN_LT(lt, NULL);
+ }
+
+ gc->visited = PUSH_LT(lt, malloc(sizeof(int) * GC_INITIAL_CAPACITY), free);
+ if (gc->visited == NULL) {
+ throw_error(ERROR_TYPE_LIBC);
+ RETURN_LT(lt, NULL);
+ }
+
+ gc->size = 0;
+ gc->capacity = GC_INITIAL_CAPACITY;
+
+ return gc;
}
void destroy_gc(Gc *gc)
{
assert(gc);
+
+ for (size_t i = 0; i < gc->size; ++i) {
+ destroy_expr(gc->exprs[i]);
+ }
+
+ RETURN_LT0(gc->lt);
}
-void gc_add_atom(Gc *gc, const struct Atom *atom)
+int gc_add_expr(Gc *gc, struct Expr expr)
{
assert(gc);
- assert(atom);
+
+ if (gc->size >= gc->capacity) {
+ const size_t new_capacity = gc->capacity * 2;
+ struct Expr *const new_exprs = realloc(
+ gc->exprs,
+ sizeof(struct Expr) * new_capacity);
+
+ if (new_exprs == NULL) {
+ return -1;
+ }
+
+ gc->capacity = new_capacity;
+ gc->exprs = REPLACE_LT(gc->lt, gc->exprs, new_exprs);
+ }
+
+ gc->exprs[gc->size++] = expr;
+
+ return 0;
+}
+
+static long int gc_find_expr(Gc *gc, struct Expr expr)
+{
+ assert(gc);
+ (void) expr;
+
+ struct Expr *result =
+ (struct Expr *) bsearch(&expr, gc->exprs, gc->size,
+ sizeof(struct Expr), compare_exprs);
+
+ if (result == NULL) {
+ return -1;
+ }
+
+ return (long int) (result - gc->exprs);
}
-void gc_add_cons(Gc *gc, const struct Cons *cons)
+static void gc_traverse_expr(Gc *gc, struct Expr root)
{
assert(gc);
- assert(cons);
+ const long int root_index = gc_find_expr(gc, root);
+ assert(root_index >= 0);
+
+ if (gc->visited[root_index]) {
+ return;
+ }
+
+ if (cons_p(root)) {
+ gc_traverse_expr(gc, root.cons->car);
+ gc_traverse_expr(gc, root.cons->cdr);
+ }
+
+ gc->visited[root_index] = 1;
}
void gc_collect(Gc *gc, struct Expr root)
{
assert(gc);
(void) root;
+
+ /* Sort gc->exprs O(nlogn) */
+ qsort(gc->exprs, gc->size, sizeof(struct Expr), compare_exprs);
+
+ /* Defragment O(n) */
+ while(gc->size > 0 && gc->exprs[gc->size - 1].type == EXPR_VOID) {
+ gc->size--;
+ }
+
+ /* Initialize visited array O(n) */
+ memset(gc->visited, 0, sizeof(int) * gc->size);
+
+ /* Traverse root O(nlogn) */
+ gc_traverse_expr(gc, root);
+
+ /* Dealloc unvisted O(n) */
+ for (size_t i = 0; i < gc->size; ++i) {
+ if (!gc->visited[i]) {
+ destroy_expr(gc->exprs[i]);
+ gc->exprs[i] = void_expr();
+ }
+ }
+}
+
+void gc_inspect(const Gc *gc)
+{
+ for (size_t i = 0; i < gc->size; ++i) {
+ if (gc->exprs[i].type == EXPR_VOID) {
+ printf(".");
+ } else {
+ printf("+");
+ }
+ }
+ printf("\n");
}