Start work on a non-complete type inferrer. Currently only analyzes return types.

sdk/lib/_internal/compiler/implementation/ssa/builder.dart

 // Copyright (c) 2012, 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.
 
 part of ssa;
 
 /**
  * A special element for the extra parameter taken by intercepted
  * methods. We need to override [Element.computeType] because our
  * optimizers may look at its declared type.
@@ skipping 3347 matching lines @@
         generateWrongArgumentCountError(node, element, node.arguments);
         return;
       }
 
       if (isIdenticalFunction) {
         pushWithPosition(new HIdentity(inputs[1], inputs[2]), node);
         return;
       }
 
       HInvokeStatic instruction = new HInvokeStatic(inputs, HType.UNKNOWN);
       // TODO(ngeoffray): Only do this if knowing the return type is

[kasperl, 2013/02/12 10:33:44]

Move TODO to recompilation branch.

[ngeoffray, 2013/02/12 11:58:22]

Done.

       // useful.
-      HType returnType =
-          builder.backend.optimisticReturnTypesWithRecompilationOnTypeChange(
-              currentElement, element);
+      HType returnType = mapInferredType(

[kasperl, 2013/02/12 10:33:44]

Maybe add a helper for getting the guaranteed HType for an element? Useful in at
least two places.

[ngeoffray, 2013/02/12 11:58:22]

Done.

+          compiler.typesTask.getGuaranteedTypeOfElement(element));
+      if (returnType.isUnknown()) {
+        returnType =
+            builder.backend.optimisticReturnTypesWithRecompilationOnTypeChange(
+                currentElement, element);
+      }
       if (returnType != null) instruction.guaranteedType = returnType;
       pushWithPosition(instruction, node);
     } else {
       generateGetter(node, element);
       List<HInstruction> inputs = <HInstruction>[pop()];
       addDynamicSendArgumentsToList(node, inputs);
       Selector closureSelector = new Selector.callClosureFrom(selector);
       pushWithPosition(new HInvokeClosure(closureSelector, inputs), node);
     }
   }
@@ skipping 171 matching lines @@
                                           List<HInstruction> arguments) {
     Set<ClassElement> interceptedClasses = getInterceptedClassesOn(selector);
     List<HInstruction> inputs = <HInstruction>[];
     bool isIntercepted = interceptedClasses != null;
     if (isIntercepted) {
       assert(!interceptedClasses.isEmpty);
       inputs.add(invokeInterceptor(interceptedClasses, receiver, node));
     }
     inputs.add(receiver);
     inputs.addAll(arguments);
-    return new HInvokeDynamicMethod(selector, inputs, isIntercepted);
+    HInstruction invoke = new HInvokeDynamicMethod(
+        selector, inputs, isIntercepted);
+    HType returnType = mapInferredType(
+        compiler.typesTask.getGuaranteedTypeOfNode(work.element, node));
+    if (returnType != null) {
+      invoke.guaranteedType = returnType;
+    }
+    return invoke;
   }
 
   visitSendSet(SendSet node) {
     Element element = elements[node];
     if (!Elements.isUnresolved(element) && element.impliesType()) {
       Identifier selector = node.selector;
       generateThrowNoSuchMethod(node, selector.source.slowToString(),
                                 argumentNodes: node.arguments);
       return;
     }
@@ skipping 1476 matching lines @@
           new HSubGraphBlockInformation(elseBranch.graph));
 
     HBasicBlock conditionStartBlock = conditionBranch.block;
     conditionStartBlock.setBlockFlow(info, joinBlock);
     SubGraph conditionGraph = conditionBranch.graph;
     HIf branch = conditionGraph.end.last;
     assert(branch is HIf);
     branch.blockInformation = conditionStartBlock.blockFlow;
   }
 }