personal/mumble
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

format

Browse Source
This commit is contained in:
NunoSempere 2023-05-07 21:56:38 -04:00
parent 1cf5599acc
commit 752ee41822
1 changed files with 59 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

63
src/mumble.c
View File

@ -81,6 +81,8 @@ lispval* evaluate_lispval(lispval* l, lispenv* env);
// Constructors // Constructors
lispval* lispval_num(double x) lispval* lispval_num(double x)
{ {
if (VERBOSE)
printfln("Allocating num");
lispval* v = malloc(sizeof(lispval)); lispval* v = malloc(sizeof(lispval));
v->type = LISPVAL_NUM; v->type = LISPVAL_NUM;
v->count = 0; v->count = 0;
@ -95,24 +97,32 @@ lispval* lispval_num(double x)
lispval* lispval_err(char* message) lispval* lispval_err(char* message)
{ {
if (VERBOSE) if (VERBOSE)
printfln("Allocated err"); printfln("Allocating err");
lispval* v = malloc(sizeof(lispval)); lispval* v = malloc(sizeof(lispval));
v->type = LISPVAL_ERR; v->type = LISPVAL_ERR;
v->count = 0; v->count = 0;
v->err = malloc(strlen(message) + 1); v->err = malloc(strlen(message) + 1);
strcpy(v->err, message); strcpy(v->err, message);
if (VERBOSE)
printfln("Allocated err");
if (VERBOSE > 1)
print_lispval_tree(v, 2);
return v; return v;
} }
lispval* lispval_sym(char* symbol) lispval* lispval_sym(char* symbol)
{ {
if (VERBOSE) if (VERBOSE)
printfln("Allocated sym"); printfln("Allocating sym");
lispval* v = malloc(sizeof(lispval)); lispval* v = malloc(sizeof(lispval));
v->type = LISPVAL_SYM; v->type = LISPVAL_SYM;
v->count = 0; v->count = 0;
v->sym = malloc(strlen(symbol) + 1); v->sym = malloc(strlen(symbol) + 1);
strcpy(v->sym, symbol); strcpy(v->sym, symbol);
if (VERBOSE)
printfln("Allocated sym");
if (VERBOSE > 1)
print_lispval_tree(v, 2);
return v; return v;
} }
@ -128,12 +138,14 @@ lispval* lispval_builtin_func(lispbuiltin func, char* builtin_func_name)
v->builtin_func = func; v->builtin_func = func;
if (VERBOSE) if (VERBOSE)
printfln("Allocated func"); printfln("Allocated func");
if (VERBOSE > 1)
print_lispval_tree(v, 2);
return v; return v;
} }
lispval* lispval_lambda_func(lispval* variables, lispval* manipulation, lispenv* env) lispval* lispval_lambda_func(lispval* variables, lispval* manipulation, lispenv* env)
{ {
if(VERBOSE){ if (VERBOSE) {
printfln("Allocating user-defined function"); printfln("Allocating user-defined function");
} }
lispval* v = malloc(sizeof(lispval)); lispval* v = malloc(sizeof(lispval));
@ -142,29 +154,42 @@ lispval* lispval_lambda_func(lispval* variables, lispval* manipulation, lispenv*
v->env = (env == NULL ? new_lispenv() : env); v->env = (env == NULL ? new_lispenv() : env);
v->variables = variables; v->variables = variables;
v->manipulation = manipulation; v->manipulation = manipulation;
// unclear how to garbage-collect this. Maybe add to a list and collect at the end? // Previously: unclear how to garbage-collect this. Maybe add to a list and collect at the end?
// Now: Hah! Lambda functions are just added to the environment, so they will just
// be destroyed when it is destroyed.
if (VERBOSE) {
printfln("Allocated user-defined function");
}
if (VERBOSE > 1)
print_lispval_tree(v, 2);
return v; return v;
} }
lispval* lispval_sexpr(void) lispval* lispval_sexpr(void)
{ {
if (VERBOSE) if (VERBOSE)
printfln("Allocated sexpr"); printfln("Allocating sexpr");
lispval* v = malloc(sizeof(lispval)); lispval* v = malloc(sizeof(lispval));
v->type = LISPVAL_SEXPR; v->type = LISPVAL_SEXPR;
v->count = 0; v->count = 0;
v->cell = NULL; v->cell = NULL;
if (VERBOSE)
printfln("Allocated sexpr");
if (VERBOSE > 1)
print_lispval_tree(v, 2);
return v; return v;
} }
lispval* lispval_qexpr(void) lispval* lispval_qexpr(void)
{ {
if (VERBOSE) if (VERBOSE)
printfln("Allocated qexpr"); printfln("Allocating qexpr");
lispval* v = malloc(sizeof(lispval)); lispval* v = malloc(sizeof(lispval));
v->type = LISPVAL_QEXPR; v->type = LISPVAL_QEXPR;
v->count = 0; v->count = 0;
v->cell = NULL; v->cell = NULL;
if (VERBOSE > 1)
print_lispval_tree(v, 2);
return v; return v;
} }
@ -224,6 +249,7 @@ void delete_lispval(lispval* v)
// free(v->func); // free(v->func);
break; break;
case LISPVAL_USER_FUNC: case LISPVAL_USER_FUNC:
printfln("This shouldn't fire until the end");
// for now, do nothing // for now, do nothing
/* /*
if (VERBOSE) if (VERBOSE)
@ -255,8 +281,6 @@ void delete_lispval(lispval* v)
case LISPVAL_QEXPR: case LISPVAL_QEXPR:
if (VERBOSE) if (VERBOSE)
printfln("Freeing sexpr|qexpr"); printfln("Freeing sexpr|qexpr");
// if (v == NULL || v->count != 0)
// return;
if (VERBOSE) if (VERBOSE)
printfln("Freed sexpr|qexpr cells"); printfln("Freed sexpr|qexpr cells");
for (int i = 0; i < v->count; i++) { for (int i = 0; i < v->count; i++) {
@ -283,7 +307,7 @@ void delete_lispval(lispval* v)
break; break;
default: default:
if (VERBOSE) if (VERBOSE)
printfln("Error: Unknown expression type for pointer %p of type %i", v, v->type); printfln("Error: Unknown expression type for pointer %p of type %i. This is probably indicative that you are trying to delete a previously deleted object", v, v->type);
} }
// v = NULL; this is only our local pointer, sadly. // v = NULL; this is only our local pointer, sadly.
} }
@ -311,6 +335,7 @@ void destroy_lispenv(lispenv* env)
for (int i = 0; i < env->count; i++) { for (int i = 0; i < env->count; i++) {
free(env->syms[i]); free(env->syms[i]);
free(env->vals[i]); free(env->vals[i]);
// to do: delete_lispval(vals[i])?
env->syms[i] = NULL; env->syms[i] = NULL;
env->vals[i] = NULL; env->vals[i] = NULL;
} }
@ -330,6 +355,7 @@ lispval* get_from_lispenv(char* sym, lispenv* env)
if (strcmp(env->syms[i], sym) == 0) { if (strcmp(env->syms[i], sym) == 0) {
return clone_lispval(env->vals[i]); return clone_lispval(env->vals[i]);
// return env->vals[i]; // return env->vals[i];
// to do: make sure that the clone is deleted.
} }
} }
@ -495,8 +521,8 @@ void print_lispval_tree(lispval* v, int indent_level)
break; break;
case LISPVAL_USER_FUNC: case LISPVAL_USER_FUNC:
printfln("%sUser-defined function: %p", indent, v->env); // Identify it with its environment? printfln("%sUser-defined function: %p", indent, v->env); // Identify it with its environment?
print_lispval_tree(v->variables, indent_level+2); print_lispval_tree(v->variables, indent_level + 2);
print_lispval_tree(v->manipulation, indent_level+2); print_lispval_tree(v->manipulation, indent_level + 2);
break; break;
case LISPVAL_SEXPR: case LISPVAL_SEXPR:
printfln("%sSExpr, with %d children:", indent, v->count); printfln("%sSExpr, with %d children:", indent, v->count);
@ -511,7 +537,8 @@ void print_lispval_tree(lispval* v, int indent_level)
} }
break; break;
default: default:
if(VERBOSE) printfln("Error: unknown lispval type\n"); if (VERBOSE)
printfln("Error: unknown lispval type\n");
// printfln("%s", v->sym); // printfln("%s", v->sym);
} }
if (VERBOSE > 1) if (VERBOSE > 1)
@ -556,7 +583,8 @@ void print_lispval_parenthesis(lispval* v)
printf("} "); printf("} ");
break; break;
default: default:
if(VERBOSE) printfln("Error: unknown lispval type\n"); if (VERBOSE)
printfln("Error: unknown lispval type\n");
// printfln("%s", v->sym); // printfln("%s", v->sym);
} }
} }
@ -600,7 +628,9 @@ lispval* clone_lispval(lispval* old)
new = lispval_builtin_func(old->builtin_func, old->builtin_func_name); new = lispval_builtin_func(old->builtin_func, old->builtin_func_name);
break; break;
case LISPVAL_USER_FUNC: case LISPVAL_USER_FUNC:
printfln("Cloning function. This shouldn't be happening, given that I've decided to just add functions to the environment and just clean them when the environment is cleaned");
new = lispval_lambda_func(old->variables, old->manipulation, old->env); new = lispval_lambda_func(old->variables, old->manipulation, old->env);
// Also, fun to notice how these choices around implementation would determine tricky behaviour details around variable shadowing.
break; break;
case LISPVAL_SEXPR: case LISPVAL_SEXPR:
new = lispval_sexpr(); new = lispval_sexpr();
@ -612,7 +642,7 @@ lispval* clone_lispval(lispval* old)
return lispval_err("Error: Cloning element of unknown type."); return lispval_err("Error: Cloning element of unknown type.");
} }
if ((old->type == LISPVAL_QEXPR || old->type == LISPVAL_SEXPR) && (old->count > 0) ) { if ((old->type == LISPVAL_QEXPR || old->type == LISPVAL_SEXPR) && (old->count > 0)) {
for (int i = 0; i < old->count; i++) { for (int i = 0; i < old->count; i++) {
lispval* temp_child = old->cell[i]; lispval* temp_child = old->cell[i];
lispval* child = clone_lispval(temp_child); lispval* child = clone_lispval(temp_child);
@ -988,10 +1018,11 @@ lispval* evaluate_lispval(lispval* l, lispenv* env)
if (l->count >= 2 && ((l->cell[0])->type == LISPVAL_USER_FUNC)) { if (l->count >= 2 && ((l->cell[0])->type == LISPVAL_USER_FUNC)) {
lispval* f = l->cell[0]; // clone_lispval(l->cell[0]); lispval* f = l->cell[0]; // clone_lispval(l->cell[0]);
if (VERBOSE){ if (VERBOSE) {
printfln("Evaluating user-defined function"); printfln("Evaluating user-defined function");
print_lispval_tree(f, 2); print_lispval_tree(f, 2);
if(VERBOSE) printfln("Expected %d variables, found %d variables.", f->variables->count, l->count -1); if (VERBOSE)
printfln("Expected %d variables, found %d variables.", f->variables->count, l->count - 1);
} }
f->env->parent = env; f->env->parent = env;
LISPVAL_ASSERT(f->variables->count == (l->count - 1), "Error: Incorrect number of variables given to user-defined function"); LISPVAL_ASSERT(f->variables->count == (l->count - 1), "Error: Incorrect number of variables given to user-defined function");