OLD | NEW |
1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 library tree_ir.optimization.logical_rewriter; | 5 library tree_ir.optimization.logical_rewriter; |
6 | 6 |
7 import '../tree_ir_nodes.dart'; | 7 import '../tree_ir_nodes.dart'; |
8 import 'optimization.dart' show Pass; | 8 import 'optimization.dart' show Pass; |
9 import '../../constants/values.dart' as values; | 9 import '../../constants/values.dart' as values; |
10 | 10 |
(...skipping 317 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
328 } | 328 } |
329 | 329 |
330 /// True if the given expression is known to evaluate to a boolean. | 330 /// True if the given expression is known to evaluate to a boolean. |
331 /// This will not recursively traverse [Conditional] expressions, but if | 331 /// This will not recursively traverse [Conditional] expressions, but if |
332 /// applied to the result of [visitExpression] conditionals will have been | 332 /// applied to the result of [visitExpression] conditionals will have been |
333 /// rewritten anyway. | 333 /// rewritten anyway. |
334 bool isBooleanValued(Expression e) { | 334 bool isBooleanValued(Expression e) { |
335 return isTrue(e) || | 335 return isTrue(e) || |
336 isFalse(e) || | 336 isFalse(e) || |
337 e is Not || | 337 e is Not || |
338 e is LogicalOperator && isBooleanValuedLogicalOperator(e) || | 338 e is LogicalOperator || |
339 e is ApplyBuiltinOperator && operatorReturnsBool(e.operator) || | 339 e is ApplyBuiltinOperator && operatorReturnsBool(e.operator); |
340 e is TypeOperator && isBooleanValuedTypeOperator(e); | |
341 } | |
342 | |
343 bool isBooleanValuedLogicalOperator(LogicalOperator e) { | |
344 return isBooleanValued(e.left) && isBooleanValued(e.right); | |
345 } | 340 } |
346 | 341 |
347 /// True if the given operator always returns `true` or `false`. | 342 /// True if the given operator always returns `true` or `false`. |
348 bool operatorReturnsBool(BuiltinOperator operator) { | 343 bool operatorReturnsBool(BuiltinOperator operator) { |
349 switch (operator) { | 344 switch (operator) { |
350 case BuiltinOperator.StrictEq: | 345 case BuiltinOperator.StrictEq: |
351 case BuiltinOperator.StrictNeq: | 346 case BuiltinOperator.StrictNeq: |
352 case BuiltinOperator.LooseEq: | 347 case BuiltinOperator.LooseEq: |
353 case BuiltinOperator.LooseNeq: | 348 case BuiltinOperator.LooseNeq: |
354 case BuiltinOperator.NumLt: | 349 case BuiltinOperator.NumLt: |
355 case BuiltinOperator.NumLe: | 350 case BuiltinOperator.NumLe: |
356 case BuiltinOperator.NumGt: | 351 case BuiltinOperator.NumGt: |
357 case BuiltinOperator.NumGe: | 352 case BuiltinOperator.NumGe: |
358 case BuiltinOperator.IsNumber: | 353 case BuiltinOperator.IsNumber: |
359 case BuiltinOperator.IsNotNumber: | 354 case BuiltinOperator.IsNotNumber: |
360 case BuiltinOperator.IsFloor: | 355 case BuiltinOperator.IsFloor: |
361 case BuiltinOperator.IsNumberAndFloor: | 356 case BuiltinOperator.IsNumberAndFloor: |
362 case BuiltinOperator.Identical: | 357 case BuiltinOperator.Identical: |
363 return true; | 358 return true; |
364 default: | 359 default: |
365 return false; | 360 return false; |
366 } | 361 } |
367 } | 362 } |
368 | 363 |
369 bool isBooleanValuedTypeOperator(TypeOperator e) { | |
370 return e.isTypeTest; | |
371 } | |
372 | |
373 BuiltinOperator negateBuiltin(BuiltinOperator operator) { | 364 BuiltinOperator negateBuiltin(BuiltinOperator operator) { |
374 switch (operator) { | 365 switch (operator) { |
375 case BuiltinOperator.StrictEq: return BuiltinOperator.StrictNeq; | 366 case BuiltinOperator.StrictEq: return BuiltinOperator.StrictNeq; |
376 case BuiltinOperator.StrictNeq: return BuiltinOperator.StrictEq; | 367 case BuiltinOperator.StrictNeq: return BuiltinOperator.StrictEq; |
377 case BuiltinOperator.LooseEq: return BuiltinOperator.LooseNeq; | 368 case BuiltinOperator.LooseEq: return BuiltinOperator.LooseNeq; |
378 case BuiltinOperator.LooseNeq: return BuiltinOperator.LooseEq; | 369 case BuiltinOperator.LooseNeq: return BuiltinOperator.LooseEq; |
379 case BuiltinOperator.IsNumber: return BuiltinOperator.IsNotNumber; | 370 case BuiltinOperator.IsNumber: return BuiltinOperator.IsNotNumber; |
380 case BuiltinOperator.IsNotNumber: return BuiltinOperator.IsNumber; | 371 case BuiltinOperator.IsNotNumber: return BuiltinOperator.IsNumber; |
381 | 372 |
382 // Because of NaN, these do not have a negated form. | 373 // Because of NaN, these do not have a negated form. |
(...skipping 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
554 } else if (e1 is Assign) { | 545 } else if (e1 is Assign) { |
555 return e2 is VariableUse && e1.variable == e2.variable; | 546 return e2 is VariableUse && e1.variable == e2.variable; |
556 } | 547 } |
557 return false; | 548 return false; |
558 } | 549 } |
559 | 550 |
560 void destroyVariableUse(VariableUse node) { | 551 void destroyVariableUse(VariableUse node) { |
561 --node.variable.readCount; | 552 --node.variable.readCount; |
562 } | 553 } |
563 } | 554 } |
| 555 |
OLD | NEW |