Merge functionality of HExactType into HBoundedType and fix computation of unions and intersections.

lib/compiler/implementation/ssa/optimize.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 interface OptimizationPhase {
   String get name();
   void visitGraph(HGraph graph);
 }
 
 class SsaOptimizerTask extends CompilerTask {
@@ skipping 185 matching lines @@
     if (!input.canBePrimitive() && !node.getter && !node.setter) {
       return fromInterceptorToDynamicInvocation(node, node.name);
     }
 
     return node;
   }
 
   HInstruction visitInvokeDynamic(HInvokeDynamic node) {
     HType receiverType = node.receiver.propagatedType;
     if (receiverType.isExact()) {
-      HExactType type = receiverType;
+      HBoundedType type = receiverType;
       Element element = type.lookupMember(node.name);
       // TODO(ngeoffray): Also fold if it's a getter or variable.
       if (element != null && element.isFunction()) {
         if (node.selector.applies(element, compiler)) {
           FunctionElement method = element;
           FunctionSignature parameters = method.computeSignature(compiler);
           if (parameters.optionalParameterCount == 0) {
             node.element = element;
           }
           // TODO(ngeoffray): If the method has optional parameters,
           // we should pass the default values here.
         }
       }
     }
     return node;
   }
 
   HInstruction fromInterceptorToDynamicInvocation(
       HInvokeStatic node, SourceString methodName) {
     HBoundedType type = node.inputs[1].propagatedType;
     HInvokeDynamicMethod result = new HInvokeDynamicMethod(
         node.selector,
         methodName,
         node.inputs.getRange(1, node.inputs.length - 1));
     if (type.isExact()) {
-      HExactType concrete = type;
+      HBoundedType concrete = type;
       result.element = concrete.lookupMember(methodName);
     }
     return result;
   }
 
   HInstruction visitBoundsCheck(HBoundsCheck node) {
     int tryGetIntConstantValue(HInstruction instruction, String errorMessage) {
       // Tests whether an [HInstruction] is a constant.
       // If it is a constant, and not an int constant, it fails.
       // If it's an int constant it returns the value.
@@ skipping 179 matching lines @@
 
     if (node.builtin) {
       return foldBuiltinEqualsCheck(node);
     }
 
     if (left.isConstant() && right.isConstant()) {
       return super.visitEquals(node);
     }
 
     if (left.propagatedType.isExact()) {
-      HExactType type = left.propagatedType;
+      HBoundedType type = left.propagatedType;
       Element element = type.lookupMember(Namer.OPERATOR_EQUALS);
       if (element !== null) {
         // If the left-hand side is guaranteed to be a non-primitive
         // type and and it defines operator==, we emit a call to that
         // operator.
         return super.visitEquals(node);
       } else if (right.isConstantNull()) {
         return graph.addConstantBool(false);
       } else {
         // We can just emit an identity check because the type does
@@ skipping 674 matching lines @@
         // the if block terminates. So any use of the instruction
         // after the join block should be changed to the new
         // instruction.
         changeUsesDominatedBy(ifUser.joinBlock, input, convertedType);
       }
       // TODO(ngeoffray): Also change uses for the then block on a HType
       // that knows it is not of a specific Type.
     }
   }
 }