2019-05-10 11:34:20 +03:00
|
|
|
abstract class Mal.BuiltinFunctionDyadicArithmetic : Mal.BuiltinFunction {
|
|
|
|
public abstract int64 result(int64 a, int64 b);
|
|
|
|
public override Mal.Val call(Mal.List args) throws Mal.Error {
|
|
|
|
if (args.vs.length() != 2)
|
|
|
|
throw new Mal.Error.BAD_PARAMS("%s: expected two numbers", name());
|
|
|
|
unowned Mal.Num a = args.vs.nth_data(0) as Mal.Num;
|
|
|
|
unowned Mal.Num b = args.vs.nth_data(1) as Mal.Num;
|
|
|
|
if (a == null || b == null)
|
|
|
|
throw new Mal.Error.BAD_PARAMS("%s: expected two numbers", name());
|
|
|
|
return new Mal.Num(result(a.v, b.v));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
class Mal.BuiltinFunctionAdd : Mal.BuiltinFunctionDyadicArithmetic {
|
|
|
|
public override Mal.ValWithMetadata copy() {
|
|
|
|
return new Mal.BuiltinFunctionAdd();
|
|
|
|
}
|
|
|
|
public override string name() { return "+"; }
|
|
|
|
public override int64 result(int64 a, int64 b) { return a+b; }
|
|
|
|
}
|
|
|
|
|
|
|
|
class Mal.BuiltinFunctionSub : Mal.BuiltinFunctionDyadicArithmetic {
|
|
|
|
public override Mal.ValWithMetadata copy() {
|
|
|
|
return new Mal.BuiltinFunctionSub();
|
|
|
|
}
|
|
|
|
public override string name() { return "-"; }
|
|
|
|
public override int64 result(int64 a, int64 b) { return a-b; }
|
|
|
|
}
|
|
|
|
|
|
|
|
class Mal.BuiltinFunctionMul : Mal.BuiltinFunctionDyadicArithmetic {
|
|
|
|
public override Mal.ValWithMetadata copy() {
|
|
|
|
return new Mal.BuiltinFunctionMul();
|
|
|
|
}
|
|
|
|
public override string name() { return "*"; }
|
|
|
|
public override int64 result(int64 a, int64 b) { return a*b; }
|
|
|
|
}
|
|
|
|
|
|
|
|
class Mal.BuiltinFunctionDiv : Mal.BuiltinFunctionDyadicArithmetic {
|
|
|
|
public override Mal.ValWithMetadata copy() {
|
|
|
|
return new Mal.BuiltinFunctionDiv();
|
|
|
|
}
|
|
|
|
public override string name() { return "/"; }
|
|
|
|
public override int64 result(int64 a, int64 b) { return a/b; }
|
|
|
|
}
|
|
|
|
|
|
|
|
class Mal.Env : GLib.Object {
|
|
|
|
public GLib.HashTable<Mal.Sym, Mal.Val> data;
|
|
|
|
construct {
|
|
|
|
data = new GLib.HashTable<Mal.Sym, Mal.Val>(
|
|
|
|
Mal.Hashable.hash, Mal.Hashable.equal);
|
|
|
|
}
|
|
|
|
// Use the 'new' keyword to silence warnings about 'set' and 'get'
|
|
|
|
// already having meanings that we're overwriting
|
|
|
|
public new void set(Mal.Sym key, Mal.Val f) {
|
|
|
|
data[key] = f;
|
|
|
|
}
|
|
|
|
public new Mal.Val get(Mal.Sym key) throws Mal.Error {
|
|
|
|
var toret = data[key];
|
|
|
|
if (toret == null)
|
|
|
|
throw new Error.ENV_LOOKUP_FAILED("no such variable '%s'", key.v);
|
|
|
|
return toret;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
class Mal.Main : GLib.Object {
|
|
|
|
static bool eof;
|
|
|
|
|
|
|
|
static construct {
|
|
|
|
eof = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
public static Mal.Val? READ() {
|
|
|
|
string? line = Readline.readline("user> ");
|
|
|
|
if (line != null) {
|
|
|
|
if (line.length > 0)
|
|
|
|
Readline.History.add(line);
|
|
|
|
|
|
|
|
try {
|
|
|
|
return Reader.read_str(line);
|
|
|
|
} catch (Mal.Error err) {
|
|
|
|
GLib.stderr.printf("%s\n", err.message);
|
|
|
|
return null;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
stdout.printf("\n");
|
|
|
|
eof = true;
|
|
|
|
return null;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public static Mal.Val eval_ast(Mal.Val ast, Mal.Env env)
|
|
|
|
throws Mal.Error {
|
vala: implement a garbage collector.
This fixes a lot of memory leakage due to me having relied on the Vala
reference-counting system to do my memory management.
The most obvious bad result of that design decision was the memory
leak from Mal.Nil pointing to itself as metadata. But fixing that
didn't solve the whole problem, because other kinds of reference cycle
are common.
In particular, the idiom `(def! FUNC (fn* (ARGS) BODY))`, for defining
a function in the most obvious way, would create a cycle of two
objects: from the outer environment in which FUNC is defined, to the
function object for FUNC itself, back to that same environment because
it was captured by FUNC.
And _either_ of those objects could end up being the only element of
the cycle referred to from the rest of the system: it could be the
environment, if nothing ever uses that function definition, or it
could be the function, if that function object is looked up and
returned from an outer function that was the last user of the
environment. So you can't break the cycle in the way that reference
counting systems would like you to, by making a well-chosen one of the
links weak: there's no universally right choice for which one it needs
to be.
So I've fixed it properly by writing a simple garbage collector. In
Vala's ref-counted environment, that works by being the only thing
allowed to hold an _owning_ reference to any derivative of GC.Object.
All the normal kinds of link between objects are now weak references;
each object provides a gc_traverse method which lists all the things
it links to; and when the garbage collector runs, it unlinks any
unwanted objects from its big linked list of all of them, causing the
one owned reference to each one to disappear.
Now the perf3 test can run without its memory usage gradually
increasing.
2019-05-12 12:05:34 +03:00
|
|
|
var roota = new GC.Root(ast); (void)roota;
|
2019-05-10 11:34:20 +03:00
|
|
|
if (ast is Mal.Sym)
|
|
|
|
return env.get(ast as Mal.Sym);
|
|
|
|
if (ast is Mal.List) {
|
vala: implement a garbage collector.
This fixes a lot of memory leakage due to me having relied on the Vala
reference-counting system to do my memory management.
The most obvious bad result of that design decision was the memory
leak from Mal.Nil pointing to itself as metadata. But fixing that
didn't solve the whole problem, because other kinds of reference cycle
are common.
In particular, the idiom `(def! FUNC (fn* (ARGS) BODY))`, for defining
a function in the most obvious way, would create a cycle of two
objects: from the outer environment in which FUNC is defined, to the
function object for FUNC itself, back to that same environment because
it was captured by FUNC.
And _either_ of those objects could end up being the only element of
the cycle referred to from the rest of the system: it could be the
environment, if nothing ever uses that function definition, or it
could be the function, if that function object is looked up and
returned from an outer function that was the last user of the
environment. So you can't break the cycle in the way that reference
counting systems would like you to, by making a well-chosen one of the
links weak: there's no universally right choice for which one it needs
to be.
So I've fixed it properly by writing a simple garbage collector. In
Vala's ref-counted environment, that works by being the only thing
allowed to hold an _owning_ reference to any derivative of GC.Object.
All the normal kinds of link between objects are now weak references;
each object provides a gc_traverse method which lists all the things
it links to; and when the garbage collector runs, it unlinks any
unwanted objects from its big linked list of all of them, causing the
one owned reference to each one to disappear.
Now the perf3 test can run without its memory usage gradually
increasing.
2019-05-12 12:05:34 +03:00
|
|
|
var result = new Mal.List.empty();
|
|
|
|
var root = new GC.Root(result); (void)root;
|
2019-05-10 11:34:20 +03:00
|
|
|
foreach (var elt in (ast as Mal.List).vs)
|
vala: implement a garbage collector.
This fixes a lot of memory leakage due to me having relied on the Vala
reference-counting system to do my memory management.
The most obvious bad result of that design decision was the memory
leak from Mal.Nil pointing to itself as metadata. But fixing that
didn't solve the whole problem, because other kinds of reference cycle
are common.
In particular, the idiom `(def! FUNC (fn* (ARGS) BODY))`, for defining
a function in the most obvious way, would create a cycle of two
objects: from the outer environment in which FUNC is defined, to the
function object for FUNC itself, back to that same environment because
it was captured by FUNC.
And _either_ of those objects could end up being the only element of
the cycle referred to from the rest of the system: it could be the
environment, if nothing ever uses that function definition, or it
could be the function, if that function object is looked up and
returned from an outer function that was the last user of the
environment. So you can't break the cycle in the way that reference
counting systems would like you to, by making a well-chosen one of the
links weak: there's no universally right choice for which one it needs
to be.
So I've fixed it properly by writing a simple garbage collector. In
Vala's ref-counted environment, that works by being the only thing
allowed to hold an _owning_ reference to any derivative of GC.Object.
All the normal kinds of link between objects are now weak references;
each object provides a gc_traverse method which lists all the things
it links to; and when the garbage collector runs, it unlinks any
unwanted objects from its big linked list of all of them, causing the
one owned reference to each one to disappear.
Now the perf3 test can run without its memory usage gradually
increasing.
2019-05-12 12:05:34 +03:00
|
|
|
result.vs.append(EVAL(elt, env));
|
|
|
|
return result;
|
2019-05-10 11:34:20 +03:00
|
|
|
}
|
|
|
|
if (ast is Mal.Vector) {
|
2019-07-16 23:10:02 +03:00
|
|
|
var vec = ast as Mal.Vector;
|
|
|
|
var result = new Mal.Vector.with_size(vec.length);
|
|
|
|
var root = new GC.Root(result); (void)root;
|
|
|
|
for (var i = 0; i < vec.length; i++)
|
|
|
|
result[i] = EVAL(vec[i], env);
|
|
|
|
return result;
|
2019-05-10 11:34:20 +03:00
|
|
|
}
|
|
|
|
if (ast is Mal.Hashmap) {
|
|
|
|
var result = new Mal.Hashmap();
|
vala: implement a garbage collector.
This fixes a lot of memory leakage due to me having relied on the Vala
reference-counting system to do my memory management.
The most obvious bad result of that design decision was the memory
leak from Mal.Nil pointing to itself as metadata. But fixing that
didn't solve the whole problem, because other kinds of reference cycle
are common.
In particular, the idiom `(def! FUNC (fn* (ARGS) BODY))`, for defining
a function in the most obvious way, would create a cycle of two
objects: from the outer environment in which FUNC is defined, to the
function object for FUNC itself, back to that same environment because
it was captured by FUNC.
And _either_ of those objects could end up being the only element of
the cycle referred to from the rest of the system: it could be the
environment, if nothing ever uses that function definition, or it
could be the function, if that function object is looked up and
returned from an outer function that was the last user of the
environment. So you can't break the cycle in the way that reference
counting systems would like you to, by making a well-chosen one of the
links weak: there's no universally right choice for which one it needs
to be.
So I've fixed it properly by writing a simple garbage collector. In
Vala's ref-counted environment, that works by being the only thing
allowed to hold an _owning_ reference to any derivative of GC.Object.
All the normal kinds of link between objects are now weak references;
each object provides a gc_traverse method which lists all the things
it links to; and when the garbage collector runs, it unlinks any
unwanted objects from its big linked list of all of them, causing the
one owned reference to each one to disappear.
Now the perf3 test can run without its memory usage gradually
increasing.
2019-05-12 12:05:34 +03:00
|
|
|
var root = new GC.Root(result); (void)root;
|
2019-05-10 11:34:20 +03:00
|
|
|
var map = (ast as Mal.Hashmap).vs;
|
|
|
|
foreach (var key in map.get_keys())
|
|
|
|
result.insert(key, EVAL(map[key], env));
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
return ast;
|
|
|
|
}
|
|
|
|
|
|
|
|
public static Mal.Val EVAL(Mal.Val ast, Mal.Env env)
|
|
|
|
throws Mal.Error {
|
vala: implement a garbage collector.
This fixes a lot of memory leakage due to me having relied on the Vala
reference-counting system to do my memory management.
The most obvious bad result of that design decision was the memory
leak from Mal.Nil pointing to itself as metadata. But fixing that
didn't solve the whole problem, because other kinds of reference cycle
are common.
In particular, the idiom `(def! FUNC (fn* (ARGS) BODY))`, for defining
a function in the most obvious way, would create a cycle of two
objects: from the outer environment in which FUNC is defined, to the
function object for FUNC itself, back to that same environment because
it was captured by FUNC.
And _either_ of those objects could end up being the only element of
the cycle referred to from the rest of the system: it could be the
environment, if nothing ever uses that function definition, or it
could be the function, if that function object is looked up and
returned from an outer function that was the last user of the
environment. So you can't break the cycle in the way that reference
counting systems would like you to, by making a well-chosen one of the
links weak: there's no universally right choice for which one it needs
to be.
So I've fixed it properly by writing a simple garbage collector. In
Vala's ref-counted environment, that works by being the only thing
allowed to hold an _owning_ reference to any derivative of GC.Object.
All the normal kinds of link between objects are now weak references;
each object provides a gc_traverse method which lists all the things
it links to; and when the garbage collector runs, it unlinks any
unwanted objects from its big linked list of all of them, causing the
one owned reference to each one to disappear.
Now the perf3 test can run without its memory usage gradually
increasing.
2019-05-12 12:05:34 +03:00
|
|
|
var ast_root = new GC.Root(ast); (void)ast_root;
|
|
|
|
GC.Core.maybe_collect();
|
|
|
|
|
2019-05-10 11:34:20 +03:00
|
|
|
if (ast is Mal.List) {
|
|
|
|
unowned GLib.List<Mal.Val> list = (ast as Mal.List).vs;
|
|
|
|
if (list.first() == null)
|
|
|
|
return ast;
|
|
|
|
var newlist = eval_ast(ast, env) as Mal.List;
|
|
|
|
unowned GLib.List<Mal.Val> firstlink = newlist.vs.first();
|
|
|
|
var fn = firstlink.data as Mal.BuiltinFunction;
|
|
|
|
newlist.vs.remove_link(firstlink);
|
|
|
|
return fn.call(newlist);
|
|
|
|
} else {
|
|
|
|
return eval_ast(ast, env);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public static void PRINT(Mal.Val value) {
|
|
|
|
stdout.printf("%s\n", pr_str(value));
|
|
|
|
}
|
|
|
|
|
|
|
|
public static void rep(Mal.Env env) throws Mal.Error {
|
|
|
|
Mal.Val? val = READ();
|
|
|
|
if (val != null) {
|
|
|
|
val = EVAL(val, env);
|
|
|
|
PRINT(val);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public static int main(string[] args) {
|
|
|
|
var env = new Mal.Env();
|
|
|
|
|
|
|
|
env.set(new Mal.Sym("+"), new BuiltinFunctionAdd());
|
|
|
|
env.set(new Mal.Sym("-"), new BuiltinFunctionSub());
|
|
|
|
env.set(new Mal.Sym("*"), new BuiltinFunctionMul());
|
|
|
|
env.set(new Mal.Sym("/"), new BuiltinFunctionDiv());
|
|
|
|
|
|
|
|
while (!eof) {
|
|
|
|
try {
|
|
|
|
rep(env);
|
|
|
|
} catch (Mal.Error err) {
|
|
|
|
GLib.stderr.printf("%s\n", err.message);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|