Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(23)

Unified Diff: runtime/vm/intermediate_language_mips.cc

Issue 64483002: Streamline code generator for branches and comparisons. (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/
Patch Set: added other platformd, comments addressed Created 7 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: runtime/vm/intermediate_language_mips.cc
===================================================================
--- runtime/vm/intermediate_language_mips.cc (revision 30153)
+++ runtime/vm/intermediate_language_mips.cc (working copy)
@@ -439,8 +439,8 @@
// Branches on condition c assuming comparison results in CMPRES1 and CMPRES2.
static void EmitBranchAfterCompare(
- FlowGraphCompiler* compiler, Condition c, Label* is_true) {
- switch (c) {
+ FlowGraphCompiler* compiler, Condition condition, Label* is_true) {
+ switch (condition) {
case EQ: __ beq(CMPRES1, CMPRES2, is_true); break;
case NE: __ bne(CMPRES1, CMPRES2, is_true); break;
case GT: __ bne(CMPRES2, ZR, is_true); break;
@@ -469,24 +469,21 @@
}
-// The comparison result is in CMPRES1.
+// The comparison result is in CMPRES1/CMPRES2.
static void EmitBranchOnCondition(FlowGraphCompiler* compiler,
- TargetEntryInstr* true_successor,
- TargetEntryInstr* false_successor,
- Condition true_condition) {
+ Condition true_condition,
+ BranchLabels labels) {
__ TraceSimMsg("ControlInstruction::EmitBranchOnCondition");
- if (compiler->CanFallThroughTo(false_successor)) {
+ if (labels.fall_through == labels.false_label) {
// If the next block is the false successor, fall through to it.
- Label* label = compiler->GetJumpLabel(true_successor);
- EmitBranchAfterCompare(compiler, true_condition, label);
+ EmitBranchAfterCompare(compiler, true_condition, labels.true_label);
} else {
// If the next block is not the false successor, branch to it.
Condition false_condition = NegateCondition(true_condition);
- Label* label = compiler->GetJumpLabel(false_successor);
- EmitBranchAfterCompare(compiler, false_condition, label);
+ EmitBranchAfterCompare(compiler, false_condition, labels.false_label);
// Fall through or jump to the true successor.
- if (!compiler->CanFallThroughTo(true_successor)) {
- __ b(compiler->GetJumpLabel(true_successor));
+ if (labels.fall_through != labels.true_label) {
+ __ b(labels.true_label);
}
}
}
@@ -495,7 +492,7 @@
static void EmitSmiComparisonOp(FlowGraphCompiler* compiler,
const LocationSummary& locs,
Token::Kind kind,
- BranchInstr* branch) {
+ BranchLabels labels) {
__ TraceSimMsg("EmitSmiComparisonOp");
__ Comment("EmitSmiComparisonOp");
Location left = locs.in(0);
@@ -513,41 +510,10 @@
__ slt(CMPRES1, left.reg(), right.reg());
__ slt(CMPRES2, right.reg(), left.reg());
}
-
- if (branch != NULL) {
- EmitBranchOnCondition(compiler,
- branch->true_successor(),
- branch->false_successor(),
- true_condition);
- } else {
- Register result = locs.out().reg();
- Label done, is_true;
- EmitBranchAfterCompare(compiler, true_condition, &is_true);
- __ LoadObject(result, Bool::False());
- __ b(&done);
- __ Bind(&is_true);
- __ LoadObject(result, Bool::True());
- __ Bind(&done);
- }
+ EmitBranchOnCondition(compiler, true_condition, labels);
}
-static void EmitUnboxedMintEqualityOp(FlowGraphCompiler* compiler,
- const LocationSummary& locs,
- Token::Kind kind,
- BranchInstr* branch) {
- UNIMPLEMENTED();
-}
-
-
-static void EmitUnboxedMintComparisonOp(FlowGraphCompiler* compiler,
- const LocationSummary& locs,
- Token::Kind kind,
- BranchInstr* branch) {
- UNIMPLEMENTED();
-}
-
-
static Condition TokenKindToDoubleCondition(Token::Kind kind) {
switch (kind) {
case Token::kEQ: return EQ;
@@ -563,17 +529,20 @@
}
-static void EmitDoubleCompareBranch(FlowGraphCompiler* compiler,
- Condition true_condition,
- FpuRegister left,
- FpuRegister right,
- BranchInstr* branch) {
- ASSERT(branch != NULL);
- __ Comment("DoubleCompareBranch");
+static void EmitDoubleComparisonOp(FlowGraphCompiler* compiler,
+ const LocationSummary& locs,
+ Token::Kind kind,
+ BranchLabels labels) {
+ DRegister left = locs.in(0).fpu_reg();
+ DRegister right = locs.in(1).fpu_reg();
+
+ __ Comment("DoubleComparisonOp(left=%d, right=%d)", left, right);
+
+ Condition true_condition = TokenKindToDoubleCondition(kind);
__ cund(left, right);
- BlockEntryInstr* nan_result = (true_condition == NE) ?
- branch->true_successor() : branch->false_successor();
- __ bc1t(compiler->GetJumpLabel(nan_result));
+ Label* nan_label = (true_condition == NE)
+ ? labels.true_label : labels.false_label;
+ __ bc1t(nan_label);
switch (true_condition) {
case EQ: __ ceqd(left, right); break;
@@ -600,107 +569,48 @@
__ mov(CMPRES2, ZR);
// EmitBranchOnCondition expects ordering to be described by CMPRES1, CMPRES2.
- EmitBranchOnCondition(compiler,
- branch->true_successor(),
- branch->false_successor(),
- EQ);
+ EmitBranchOnCondition(compiler, EQ, labels);
}
-static void EmitDoubleCompareBool(FlowGraphCompiler* compiler,
- Condition true_condition,
- FpuRegister left,
- FpuRegister right,
- Register result) {
- Label done, is_true;
- Label* nan_label = (true_condition == NE) ? &is_true : &done;
- __ Comment("DoubleCompareBool");
- __ LoadObject(result, Bool::False());
- __ cund(left, right);
- __ bc1t(nan_label);
+void EqualityCompareInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
+ ASSERT((kind() == Token::kNE) || (kind() == Token::kEQ));
+ __ Comment("EqualityCompareInstr");
- switch (true_condition) {
- case EQ: __ ceqd(left, right); break;
- case NE: __ ceqd(left, right); break;
- case LT: __ coltd(left, right); break;
- case LE: __ coled(left, right); break;
- case GT: __ coltd(right, left); break;
- case GE: __ coled(right, left); break;
- default: {
- // Should only passing the above conditions to this function.
- UNREACHABLE();
- break;
- }
- }
+ Label is_true, is_false;
+ BranchLabels labels = { &is_true, &is_false, &is_false };
- if (true_condition == NE) {
- __ bc1t(&done); // False is already in result.
+ if (operation_cid() == kSmiCid) {
+ EmitSmiComparisonOp(compiler, *locs(), kind(), labels);
} else {
- __ bc1f(&done);
+ ASSERT(operation_cid() == kDoubleCid);
+ EmitDoubleComparisonOp(compiler, *locs(), kind(), labels);
}
+ Register result = locs()->out().reg();
+ Label done;
+ __ Bind(&is_false);
+ __ LoadObject(result, Bool::False());
+ __ b(&done);
__ Bind(&is_true);
__ LoadObject(result, Bool::True());
__ Bind(&done);
}
-static void EmitDoubleComparisonOp(FlowGraphCompiler* compiler,
- const LocationSummary& locs,
- Token::Kind kind,
- BranchInstr* branch) {
- DRegister left = locs.in(0).fpu_reg();
- DRegister right = locs.in(1).fpu_reg();
-
- __ Comment("DoubleComparisonOp(left=%d, right=%d)", left, right);
-
- Condition true_condition = TokenKindToDoubleCondition(kind);
- if (branch != NULL) {
- EmitDoubleCompareBranch(compiler, true_condition, left, right, branch);
- } else {
- EmitDoubleCompareBool(compiler, true_condition,
- left, right, locs.out().reg());
- }
-}
-
-
-void EqualityCompareInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
- ASSERT((kind() == Token::kNE) || (kind() == Token::kEQ));
- BranchInstr* kNoBranch = NULL;
- __ Comment("EqualityCompareInstr");
- if (operation_cid() == kSmiCid) {
- EmitSmiComparisonOp(compiler, *locs(), kind(), kNoBranch);
- return;
- }
- if (operation_cid() == kMintCid) {
- EmitUnboxedMintEqualityOp(compiler, *locs(), kind(), kNoBranch);
- return;
- }
- if (operation_cid() == kDoubleCid) {
- EmitDoubleComparisonOp(compiler, *locs(), kind(), kNoBranch);
- return;
- }
- UNREACHABLE();
-}
-
-
void EqualityCompareInstr::EmitBranchCode(FlowGraphCompiler* compiler,
BranchInstr* branch) {
__ TraceSimMsg("EqualityCompareInstr");
__ Comment("EqualityCompareInstr:BranchCode");
ASSERT((kind() == Token::kNE) || (kind() == Token::kEQ));
+
+ BranchLabels labels = compiler->CreateBranchLabels(branch);
+
if (operation_cid() == kSmiCid) {
- EmitSmiComparisonOp(compiler, *locs(), kind(), branch);
- return;
+ EmitSmiComparisonOp(compiler, *locs(), kind(), labels);
+ } else {
+ ASSERT(operation_cid() == kDoubleCid);
+ EmitDoubleComparisonOp(compiler, *locs(), kind(), labels);
}
- if (operation_cid() == kMintCid) {
- EmitUnboxedMintEqualityOp(compiler, *locs(), kind(), branch);
- return;
- }
- if (operation_cid() == kDoubleCid) {
- EmitDoubleComparisonOp(compiler, *locs(), kind(), branch);
- return;
- }
- UNREACHABLE();
}
@@ -725,7 +635,9 @@
void TestSmiInstr::EmitBranchCode(FlowGraphCompiler* compiler,
BranchInstr* branch) {
- Condition branch_condition = (kind() == Token::kNE) ? NE : EQ;
+ BranchLabels labels = compiler->CreateBranchLabels(branch);
+
+ Condition true_condition = (kind() == Token::kNE) ? NE : EQ;
Register left = locs()->in(0).reg();
Location right = locs()->in(1);
if (right.IsConstant()) {
@@ -737,10 +649,7 @@
__ and_(CMPRES1, left, right.reg());
}
__ mov(CMPRES2, ZR);
- EmitBranchOnCondition(compiler,
- branch->true_successor(),
- branch->false_successor(),
- branch_condition);
+ EmitBranchOnCondition(compiler, true_condition, labels);
}
@@ -782,33 +691,39 @@
void RelationalOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
__ TraceSimMsg("RelationalOpInstr");
+
+ Label is_true, is_false;
+ BranchLabels labels = { &is_true, &is_false, &is_false };
+
if (operation_cid() == kSmiCid) {
- EmitSmiComparisonOp(compiler, *locs(), kind(), NULL);
- return;
+ EmitSmiComparisonOp(compiler, *locs(), kind(), labels);
+ } else {
+ ASSERT(operation_cid() == kDoubleCid);
+ EmitDoubleComparisonOp(compiler, *locs(), kind(), labels);
}
- if (operation_cid() == kMintCid) {
- EmitUnboxedMintComparisonOp(compiler, *locs(), kind(), NULL);
- return;
- }
- ASSERT(operation_cid() == kDoubleCid);
- EmitDoubleComparisonOp(compiler, *locs(), kind(), NULL);
- return;
+ Register result = locs()->out().reg();
+ Label done;
+ __ Bind(&is_false);
+ __ LoadObject(result, Bool::False());
+ __ b(&done);
+ __ Bind(&is_true);
+ __ LoadObject(result, Bool::True());
+ __ Bind(&done);
}
void RelationalOpInstr::EmitBranchCode(FlowGraphCompiler* compiler,
BranchInstr* branch) {
__ TraceSimMsg("RelationalOpInstr");
+
+ BranchLabels labels = compiler->CreateBranchLabels(branch);
+
if (operation_cid() == kSmiCid) {
- EmitSmiComparisonOp(compiler, *locs(), kind(), branch);
- return;
+ EmitSmiComparisonOp(compiler, *locs(), kind(), labels);
+ } else {
+ ASSERT(operation_cid() == kDoubleCid);
+ EmitDoubleComparisonOp(compiler, *locs(), kind(), labels);
}
- if (operation_cid() == kMintCid) {
- EmitUnboxedMintComparisonOp(compiler, *locs(), kind(), branch);
- return;
- }
- ASSERT(operation_cid() == kDoubleCid);
- EmitDoubleComparisonOp(compiler, *locs(), kind(), branch);
}
@@ -3847,42 +3762,53 @@
}
-// Special code for numbers (compare values instead of references.)
-void StrictCompareInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
- __ TraceSimMsg("StrictCompareInstr");
- __ Comment("StrictCompareInstr");
- ASSERT(kind() == Token::kEQ_STRICT || kind() == Token::kNE_STRICT);
- Location left = locs()->in(0);
- Location right = locs()->in(1);
+static void EmitStrictComparison(FlowGraphCompiler* compiler,
+ StrictCompareInstr* compare,
+ BranchLabels labels) {
+ LocationSummary* locs = compare->locs();
+ bool needs_number_check = compare->needs_number_check();
+ intptr_t token_pos = compare->token_pos();
+ Token::Kind kind = compare->kind();
+ Location left = locs->in(0);
+ Location right = locs->in(1);
ASSERT(!left.IsConstant() || !right.IsConstant());
if (left.IsConstant()) {
compiler->EmitEqualityRegConstCompare(right.reg(),
left.constant(),
- needs_number_check(),
- token_pos());
+ needs_number_check,
+ token_pos);
} else if (right.IsConstant()) {
compiler->EmitEqualityRegConstCompare(left.reg(),
right.constant(),
- needs_number_check(),
- token_pos());
+ needs_number_check,
+ token_pos);
} else {
compiler->EmitEqualityRegRegCompare(left.reg(),
right.reg(),
- needs_number_check(),
- token_pos());
+ needs_number_check,
+ token_pos);
}
+ Condition true_condition = (kind == Token::kEQ_STRICT) ? EQ : NE;
+ EmitBranchOnCondition(compiler, true_condition, labels);
+}
+// Special code for numbers (compare values instead of references.)
+void StrictCompareInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
+ __ TraceSimMsg("StrictCompareInstr");
+ __ Comment("StrictCompareInstr");
+ ASSERT(kind() == Token::kEQ_STRICT || kind() == Token::kNE_STRICT);
+
+ Label is_true, is_false;
+ BranchLabels labels = { &is_true, &is_false, &is_false };
+
+ EmitStrictComparison(compiler, this, labels);
+
Register result = locs()->out().reg();
- Label load_true, done;
- if (kind() == Token::kEQ_STRICT) {
- __ beq(CMPRES1, CMPRES2, &load_true);
- } else {
- ASSERT(kind() == Token::kNE_STRICT);
- __ bne(CMPRES1, CMPRES2, &load_true);
- }
+ Label done;
+ __ Bind(&is_false);
__ LoadObject(result, Bool::False());
__ b(&done);
- __ Bind(&load_true);
+ __ Bind(&is_true);
__ LoadObject(result, Bool::True());
__ Bind(&done);
}
@@ -3892,31 +3818,10 @@
BranchInstr* branch) {
__ TraceSimMsg("StrictCompareInstr::EmitBranchCode");
ASSERT(kind() == Token::kEQ_STRICT || kind() == Token::kNE_STRICT);
- Location left = locs()->in(0);
- Location right = locs()->in(1);
- ASSERT(!left.IsConstant() || !right.IsConstant());
- if (left.IsConstant()) {
- compiler->EmitEqualityRegConstCompare(right.reg(),
- left.constant(),
- needs_number_check(),
- token_pos());
- } else if (right.IsConstant()) {
- compiler->EmitEqualityRegConstCompare(left.reg(),
- right.constant(),
- needs_number_check(),
- token_pos());
- } else {
- compiler->EmitEqualityRegRegCompare(left.reg(),
- right.reg(),
- needs_number_check(),
- token_pos());
- }
- Condition true_condition = (kind() == Token::kEQ_STRICT) ? EQ : NE;
- EmitBranchOnCondition(compiler,
- branch->true_successor(),
- branch->false_successor(),
- true_condition);
+ BranchLabels labels = compiler->CreateBranchLabels(branch);
+
+ EmitStrictComparison(compiler, this, labels);
}

Powered by Google App Engine
This is Rietveld 408576698