miloignis/kraken
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

After reflecting on the difficulties of lowering the increment operators, decided just to implement them in bytecode

Browse Source
This commit is contained in:
Nathan Braswell
2018-03-14 23:43:52 -04:00
parent c6a43728a5
commit 8de92e1c3b
1 changed files with 16 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
stdlib/bytecode_generator.krak
View File

@@ -535,6 +535,22 @@ obj bytecode_generator (Object) {
// generate with lvalue=true to make return a pointer // generate with lvalue=true to make return a pointer
if (name == "&" && parameter_nodes.size == 1) if (name == "&" && parameter_nodes.size == 1)
return generate(parameter_nodes[0], true) return generate(parameter_nodes[0], true)
if (name == "++" || name == "++p" || name == "--" || name == "--p") {
var op_size = size_to_operand_size(type_size(get_ast_type(parameter_nodes[0])))
var addr_reg = generate(parameter_nodes[0], true)
var value_reg = emit_ldr(addr_reg, 0, op_size)
var mod_reg = -1
if (name[0] == '+')
mod_reg = emit_addi(value_reg, 1)
else
mod_reg = emit_addi(value_reg, -1)
emit_str(addr_reg, 0, mod_reg, op_size)
// if preincrement, return modified value, else unmodified
if (name.length() == 2)
return mod_reg
else
return value_reg
}
var params = parameter_nodes.map(fun(n: *ast_node): int return generate(n);) var params = parameter_nodes.map(fun(n: *ast_node): int return generate(n);)
if (name == "+") { if (name == "+") {