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

Side by Side Diff: runtime/vm/parser.cc

Issue 1417733007: VM: Fix bug with ??= expressions using await. (Closed) Base URL: git@github.com:dart-lang/sdk.git@master
Patch Set: Created 5 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 unified diff | Download patch
« no previous file with comments | « runtime/vm/flow_graph_builder.cc ('k') | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 #include "vm/parser.h" 5 #include "vm/parser.h"
6 6
7 #include "lib/invocation_mirror.h" 7 #include "lib/invocation_mirror.h"
8 #include "platform/utils.h" 8 #include "platform/utils.h"
9 #include "vm/ast_transformer.h" 9 #include "vm/ast_transformer.h"
10 #include "vm/bootstrap.h" 10 #include "vm/bootstrap.h"
(...skipping 10548 matching lines...) Expand 10 before | Expand all | Expand 10 after
10559 (lhs->AsBinaryOpNode()->kind() == Token::kSHL)) { 10559 (lhs->AsBinaryOpNode()->kind() == Token::kSHL)) {
10560 // Merge SHL and BIT_AND into one "SHL with mask" node. 10560 // Merge SHL and BIT_AND into one "SHL with mask" node.
10561 BinaryOpNode* old = lhs->AsBinaryOpNode(); 10561 BinaryOpNode* old = lhs->AsBinaryOpNode();
10562 BinaryOpWithMask32Node* binop = new(Z) BinaryOpWithMask32Node( 10562 BinaryOpWithMask32Node* binop = new(Z) BinaryOpWithMask32Node(
10563 old->token_pos(), old->kind(), old->left(), old->right(), val); 10563 old->token_pos(), old->kind(), old->left(), old->right(), val);
10564 return binop; 10564 return binop;
10565 } 10565 }
10566 } 10566 }
10567 } 10567 }
10568 } 10568 }
10569 if (binary_op == Token::kIFNULL) {
10570 // Handle a ?? b.
10571 const intptr_t no_pos = Scanner::kNoSourcePos;
10572 LetNode* result = new(Z) LetNode(no_pos);
10573 LocalVariable* left_temp = result->AddInitializer(lhs);
10574 LiteralNode* null_operand =
10575 new LiteralNode(no_pos, Instance::ZoneHandle(Z));
10576 LoadLocalNode* load_left_temp = new(Z) LoadLocalNode(no_pos, left_temp);
10577 ComparisonNode* null_compare =
10578 new ComparisonNode(no_pos,
10579 Token::kNE_STRICT,
10580 load_left_temp,
10581 null_operand);
10582 result->AddNode(new(Z) ConditionalExprNode(op_pos,
10583 null_compare,
10584 load_left_temp,
10585 rhs));
10586 return result;
10587 }
10569 return new(Z) BinaryOpNode(op_pos, binary_op, lhs, rhs); 10588 return new(Z) BinaryOpNode(op_pos, binary_op, lhs, rhs);
10570 } 10589 }
10571 10590
10572 10591
10573 AstNode* Parser::ExpandAssignableOp(intptr_t op_pos, 10592 AstNode* Parser::ExpandAssignableOp(intptr_t op_pos,
10574 Token::Kind assignment_op, 10593 Token::Kind assignment_op,
10575 AstNode* lhs, 10594 AstNode* lhs,
10576 AstNode* rhs) { 10595 AstNode* rhs) {
10577 TRACE_PARSER("ExpandAssignableOp"); 10596 TRACE_PARSER("ExpandAssignableOp");
10578 switch (assignment_op) { 10597 switch (assignment_op) {
(...skipping 151 matching lines...) Expand 10 before | Expand all | Expand 10 after
10730 // Therefore, we need to transform a = (a ?? b) into a ?? (a = b) 10749 // Therefore, we need to transform a = (a ?? b) into a ?? (a = b)
10731 if (is_compound && 10750 if (is_compound &&
10732 rhs->IsBinaryOpNode() && 10751 rhs->IsBinaryOpNode() &&
10733 (rhs->AsBinaryOpNode()->kind() == Token::kIFNULL)) { 10752 (rhs->AsBinaryOpNode()->kind() == Token::kIFNULL)) {
10734 BinaryOpNode* ifnull = rhs->AsBinaryOpNode(); 10753 BinaryOpNode* ifnull = rhs->AsBinaryOpNode();
10735 AstNode* modified_assign = 10754 AstNode* modified_assign =
10736 CreateAssignmentNode(original, 10755 CreateAssignmentNode(original,
10737 ifnull->right(), 10756 ifnull->right(),
10738 left_ident, 10757 left_ident,
10739 left_pos); 10758 left_pos);
10740 result = new(Z) BinaryOpNode(rhs->token_pos(), 10759 const intptr_t no_pos = Scanner::kNoSourcePos;
10741 Token::kIFNULL, 10760 LetNode* let_node = new(Z) LetNode(no_pos);
hausner 2015/11/03 19:03:08 Should be possible to call OptimizeBinaryOpNode()
Florian Schneider 2015/11/03 19:10:59 Yes, good point.
10742 ifnull->left(), 10761 LocalVariable* left_temp = let_node->AddInitializer(ifnull->left());
10743 modified_assign); 10762 LiteralNode* null_operand =
10763 new LiteralNode(no_pos, Instance::ZoneHandle(Z));
10764 LoadLocalNode* load_left_temp = new(Z) LoadLocalNode(no_pos, left_temp);
10765 ComparisonNode* null_compare =
10766 new ComparisonNode(no_pos,
10767 Token::kNE_STRICT,
10768 load_left_temp,
10769 null_operand);
10770 let_node->AddNode(new(Z) ConditionalExprNode(rhs->token_pos(),
10771 null_compare,
10772 load_left_temp,
10773 modified_assign));
10774 result = let_node;
10744 } 10775 }
10745 return result; 10776 return result;
10746 } 10777 }
10747 10778
10748 10779
10749 AstNode* Parser::ParseCascades(AstNode* expr) { 10780 AstNode* Parser::ParseCascades(AstNode* expr) {
10750 intptr_t cascade_pos = TokenPos(); 10781 intptr_t cascade_pos = TokenPos();
10751 LetNode* cascade = new(Z) LetNode(cascade_pos); 10782 LetNode* cascade = new(Z) LetNode(cascade_pos);
10752 LocalVariable* cascade_receiver_var = cascade->AddInitializer(expr); 10783 LocalVariable* cascade_receiver_var = cascade->AddInitializer(expr);
10753 while (CurrentToken() == Token::kCASCADE) { 10784 while (CurrentToken() == Token::kCASCADE) {
(...skipping 3577 matching lines...) Expand 10 before | Expand all | Expand 10 after
14331 void Parser::SkipQualIdent() { 14362 void Parser::SkipQualIdent() {
14332 ASSERT(IsIdentifier()); 14363 ASSERT(IsIdentifier());
14333 ConsumeToken(); 14364 ConsumeToken();
14334 if (CurrentToken() == Token::kPERIOD) { 14365 if (CurrentToken() == Token::kPERIOD) {
14335 ConsumeToken(); // Consume the kPERIOD token. 14366 ConsumeToken(); // Consume the kPERIOD token.
14336 ExpectIdentifier("identifier expected after '.'"); 14367 ExpectIdentifier("identifier expected after '.'");
14337 } 14368 }
14338 } 14369 }
14339 14370
14340 } // namespace dart 14371 } // namespace dart
OLDNEW
« no previous file with comments | « runtime/vm/flow_graph_builder.cc ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698