natas_hw
/
cbc
mirror of https://github.com/aamine/cbc
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

r4629@macbookpro: aamine | 2009-04-30 22:53:58 +0900 

* net/loveruby/cflat/compiler/CodeGenerator.java: remove unused method #doesSpillDX.
 * net/loveruby/cflat/compiler/CodeGenerator.java: add "left" argument to #compileBinaryOp.
 


git-svn-id: file:///Users/aamine/c/gitwork/public/cbc/trunk@4168 1b9489fe-b721-0410-924e-b54b9192deb8
This commit is contained in:
Minero Aoki 2009-05-03 14:46:05 +00:00
parent 1c13cc4aa1
commit b8ed3ab439
2 changed files with 24 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
ChangeLog
View File

@ -1,3 +1,11 @@
Thu Apr 30 22:53:10 2009 Minero Aoki <aamine@loveruby.net>
* net/loveruby/cflat/compiler/CodeGenerator.java: remove unused
method #doesSpillDX.
* net/loveruby/cflat/compiler/CodeGenerator.java: add "left"
argument to #compileBinaryOp.
Thu Apr 30 22:19:12 2009 Minero Aoki <aamine@loveruby.net>
* net/loveruby/cflat/ast/ConstantTable.java: move under entity/.

44
net/loveruby/cflat/compiler/CodeGenerator.java
View File

@ -827,7 +827,7 @@ public class CodeGenerator implements IRVisitor<Void,Void>, ELFConstants {
// #@@range/compile_Bin{
public Void visit(Bin node) {
AsmOperand right = null;
if (!doesRequireRegister(node.op()) && node.right().isConstant()){
if (!doesSpillRegister(node.op()) && node.right().isConstant()){
compile(node.left());
right = node.right().asmValue();
}
@ -843,13 +843,13 @@ public class CodeGenerator implements IRVisitor<Void,Void>, ELFConstants {
virtualPop(reg("cx"));
right = reg("cx", node.type());
}
compileBinaryOp(node.op(), node.type(), right);
compileBinaryOp(node.type(), node.op(), reg("ax", node.type()), right);
return null;
}
// #@@}
// #@@range/doesRequireRegister{
protected boolean doesRequireRegister(Op op) {
// #@@range/doesSpillRegister{
protected boolean doesSpillRegister(Op op) {
switch (op) {
case DIV:
case MOD:
@ -862,32 +862,20 @@ public class CodeGenerator implements IRVisitor<Void,Void>, ELFConstants {
}
// #@@}
// #@@range/doesSpillDX{
protected boolean doesSpillDX(Op op) {
switch (op) {
case DIV:
case MOD:
return true;
default:
return false;
}
}
// #@@}
// spills: dx
// #@@range/compileBinaryOp_begin{
protected void compileBinaryOp(Op op, Type t, AsmOperand right) {
protected void compileBinaryOp(Type t, Op op,
Register left, AsmOperand right) {
// #@@range/compileBinaryOp_arithops{
switch (op) {
case ADD:
as.add(t, right, reg("ax", t));
as.add(t, right, left);
break;
case SUB:
as.sub(t, right, reg("ax", t));
as.sub(t, right, left);
break;
// #@@range/compileBinaryOp_begin}
case MUL:
as.imul(t, right, reg("ax", t));
as.imul(t, right, left);
break;
case DIV:
case MOD:
@ -900,30 +888,30 @@ public class CodeGenerator implements IRVisitor<Void,Void>, ELFConstants {
as.div(t, reg("cx", t));
}
if (op == Op.MOD) {
as.mov(reg("dx"), reg("ax"));
as.mov(reg("dx"), left);
}
break;
// #@@}
// #@@range/compileBinaryOp_bitops{
case BIT_AND:
as.and(t, right, reg("ax", t));
as.and(t, right, left);
break;
case BIT_OR:
as.or(t, right, reg("ax", t));
as.or(t, right, left);
break;
case BIT_XOR:
as.xor(t, right, reg("ax", t));
as.xor(t, right, left);
break;
case RSHIFT:
if (t.isSigned()) {
as.sar(t, cl(), reg("ax", t));
as.sar(t, cl(), left);
}
else {
as.shr(t, cl(), reg("ax", t));
as.shr(t, cl(), left);
}
break;
case LSHIFT:
as.sal(t, cl(), reg("ax", t));
as.sal(t, cl(), left);
break;
// #@@}
// #@@range/compileBinaryOp_cmpops{