Index: lib/compiler/implementation/ssa/builder.dart |
=================================================================== |
--- lib/compiler/implementation/ssa/builder.dart (revision 13496) |
+++ lib/compiler/implementation/ssa/builder.dart (working copy) |
@@ -3313,7 +3313,7 @@ |
visitConditional(Conditional node) { |
SsaBranchBuilder brancher = |
- new SsaBranchBuilder(this, diagnosticNode: node); |
+ new SsaBranchBuilder(this, node); |
floitsch
2012/10/11 16:52:15
does this fit on one line?
regis
2012/10/11 21:24:19
Done.
|
brancher.handleConditional(() => visit(node.condition), |
() => visit(node.thenExpression), |
() => visit(node.elseExpression)); |
@@ -4280,7 +4280,7 @@ |
* return value implies that [mayReuseFromLocals] was set to [:true:]. |
*/ |
bool mergeLocals(SsaBranch fromBranch, SsaBranch toBranch, |
- [bool mayReuseFromLocals]) { |
+ {bool mayReuseFromLocals}) { |
LocalsHandler fromLocals = fromBranch.exitLocals; |
if (toBranch.startLocals == null) { |
if (mayReuseFromLocals) { |
@@ -4339,7 +4339,7 @@ |
_handleDiamondBranch(visitCondition, visitThen, visitElse, true); |
} |
- void handleLogicalAndOr(void left(), void right(), [bool isAnd]) { |
+ void handleLogicalAndOr(void left(), void right(), {bool isAnd}) { |
// x && y is transformed into: |
// t0 = boolify(x); |
// if (t0) { |
@@ -4381,7 +4381,7 @@ |
void handleLogicalAndOrWithLeftNode(Node left, |
void visitRight(), |
- [bool isAnd]) { |
+ {bool isAnd}) { |
// This method is similar to [handleLogicalAndOr] but optimizes the case |
// where left is a logical "and" or logical "or". |
// |
@@ -4405,10 +4405,11 @@ |
Node middle = link.head; |
handleLogicalAndOrWithLeftNode( |
newLeft, |
- () => handleLogicalAndOrWithLeftNode(middle, visitRight, isAnd), |
+ () => handleLogicalAndOrWithLeftNode(middle, visitRight, |
+ isAnd: isAnd), |
isAnd: isAnd); |
} else { |
- handleLogicalAndOr(() => builder.visit(left), visitRight, isAnd); |
+ handleLogicalAndOr(() => builder.visit(left), visitRight, isAnd: isAnd); |
} |
} |