aboutsummaryrefslogtreecommitdiff
path: root/compiler.d
diff options
context:
space:
mode:
Diffstat (limited to 'compiler.d')
-rw-r--r--compiler.d83
1 files changed, 83 insertions, 0 deletions
diff --git a/compiler.d b/compiler.d
index 4a3df27..d55b7f5 100644
--- a/compiler.d
+++ b/compiler.d
@@ -437,6 +437,16 @@ class Compiler {
this.func.chunk.code[offset + 1] = jmp & 0xff;
}
+ void jumpBackTo(OpCode type, int dest) {
+
+ this.func.chunk.writeOp(to!ubyte(type), this.current.line);
+
+ int lower = (dest >> 8) & 0xff;
+ int higher = dest & 0xff;
+ this.func.chunk.writeOp(to!ubyte(lower), this.current.line);
+ this.func.chunk.writeOp(to!ubyte(higher), this.current.line);
+ }
+
void compileIf(Form form) {
If if_ = cast(If)form;
@@ -611,6 +621,74 @@ class Compiler {
this.func.chunk.writeOp(OpCode.OP_MEMBER, args[0].line);
}
+ void compileMap(Form[] args) {
+ // TODO how do we identify/propagate errors?
+ if (args.length != 2) {
+ this.error(format("'map': expected [2] arguments, received %d", args.length), -1);
+ this.advance();
+ return;
+ }
+ ValueType vt = this.resolve(args[0], ValueType.ANY); // resolves the function
+ vt = this.resolve(args[1], ValueType.ANY); // resolves the list
+
+ // we want to keep track of the length of the generated list (starts at zero)
+ // TODO this could probably be cleaner, as we should know the length of the resulting list already
+ this.func.chunk.writeOp(OpCode.OP_ZERO, args[0].line); // | [ fn ] [ list ] [ 0 ]
+ this.func.chunk.writeOp(OpCode.OP_ROTATE_N, args[0].line);
+ this.func.chunk.writeOp(to!ubyte(3), args[0].line); // | [ 0 ] [ fn ] [ list ]
+
+ // we're going to jump back to this point, so let's keep track of our location
+ int jumpBack = to!int(this.func.chunk.code.length);
+
+ // with our list on top of the stack, let's check for nil to see if we're done
+ this.func.chunk.writeOp(OpCode.OP_DUPLICATE, args[0].line); // | [ 0 ] [ fn ] [ list ] [ list ]
+ this.func.chunk.writeOp(OpCode.OP_IS_NIL, args[0].line); // | [ 0 ] [ fn ] [ list ] [ bool ]
+
+ // we'll jump from here to the end if we have nil
+ int nilJump = this.jump(OpCode.OP_JUMP_IF_TRUE); // TODO if we're using "falsey", we could cut an instruction here
+
+ // get rid of the boolean on top
+ this.func.chunk.writeOp(OpCode.OP_POP, args[0].line); // | [ 0 ] [ fn ] [ list ]
+
+ // duplicate the function and list, and rotate it below the length (we'll need it later)
+ this.func.chunk.writeOp(OpCode.OP_DUPLICATE_2, args[0].line); // | [ 0 ] [ fn ] [ list ] [ fn ] [ list ]
+ this.func.chunk.writeOp(OpCode.OP_ROTATE_N, args[0].line);
+ this.func.chunk.writeOp(to!ubyte(5), args[0].line); // | [ list ] [ 0 ] [ fn ] [ list ] [ fn ]
+ this.func.chunk.writeOp(OpCode.OP_ROTATE_N, args[0].line);
+ this.func.chunk.writeOp(to!ubyte(5), args[0].line); // | [ fn ] [ list ] [ 0 ] [ fn ] [ list ]
+
+ // get the first item from the top list, then run the function on it (we know there's always 1 argument)
+ this.func.chunk.writeOp(OpCode.OP_FIRST, args[0].line); // | [ fn ] [ list ] [ 0 ] [ fn ] [ item ]
+ this.func.chunk.writeOp(OpCode.OP_CALL, args[0].line);
+ this.func.chunk.writeOp(to!ubyte(1), args[0].line); // | [ fn ] [ list ] [ 0 ] [ fn(item) ]
+
+ // preserve the value we just generated
+ this.func.chunk.writeOp(OpCode.OP_ROTATE_N, args[0].line);
+ this.func.chunk.writeOp(to!ubyte(4), args[0].line); // | [ fn(item) ] [ fn ] [ list ] [ 0 ]
+
+ // increment the counter, and save it *after* the value
+ this.func.chunk.writeOp(OpCode.OP_INCREMENT, args[0].line); // | [ fn(item) ] [ fn ] [ list ] [ 1 ]
+ this.func.chunk.writeOp(OpCode.OP_ROTATE_N, args[0].line);
+ this.func.chunk.writeOp(to!ubyte(3), args[0].line); // | [ fn(item) ] [ 1 ] [ fn ] [ list ]
+
+ // get the rest of the list
+ this.func.chunk.writeOp(OpCode.OP_REST, args[0].line); // | [ fn(item) ] [ 1 ] [ fn ] [ rest(list) ]
+
+ // jump back to the top of the loop
+ this.jumpBackTo(OpCode.OP_JUMP_TO, jumpBack);
+
+ // jump here when we have a nil
+ this.patchJump(nilJump); // | [ fn(first) ] ... [ fn(last) ] [ length ] [ fn ] [ nil ] [ true ]
+
+ // pop the unneeded state at the top
+ this.func.chunk.writeOp(OpCode.OP_POP, args[0].line);
+ this.func.chunk.writeOp(OpCode.OP_POP, args[0].line);
+ this.func.chunk.writeOp(OpCode.OP_POP, args[0].line); // | [ fn(first) ] ... [ fn(last) ] [ length ]
+
+ // create a list from the stack, with the length as the top item
+ this.func.chunk.writeOp(OpCode.OP_LIST_N, args[0].line);
+ }
+
void compileFirst(Form[] args) {
// TODO how do we identify/propagate errors?
if (args.length != 1) {
@@ -776,6 +854,11 @@ class Compiler {
case "eq?":
return this.compileEq(cons.tail);
+ // HOF
+ case "map":
+ this.compileMap(cons.tail);
+ break;
+
// STRINGS
case "concat":
return this.compileConcat(cons.tail);