Make the universe parts into small libraries.

pkg/compiler/lib/src/ssa/invoke_dynamic_specializers.dart

 // Copyright (c) 2013, 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;
 
 /**
  * [InvokeDynamicSpecializer] and its subclasses are helpers to
  * optimize intercepted dynamic calls. It knows what input types
  * would be beneficial for performance, and how to change a invoke
  * dynamic to a builtin instruction (e.g. HIndex, HBitNot).
  */
 class InvokeDynamicSpecializer {
   const InvokeDynamicSpecializer();
 
   TypeMask computeTypeFromInputTypes(HInvokeDynamic instruction,
                                      Compiler compiler) {
     return TypeMaskFactory.inferredTypeForSelector(
         instruction.selector, instruction.mask, compiler);
   }
 
   HInstruction tryConvertToBuiltin(HInvokeDynamic instruction,
                                    Compiler compiler) {
     return null;
   }
 
   Operation operation(ConstantSystem constantSystem) => null;
 
   static InvokeDynamicSpecializer lookupSpecializer(Selector selector) {
-    if (selector.kind == SelectorKind.INDEX) {
-      return selector.name == '[]'
-          ? const IndexSpecializer()
-          : const IndexAssignSpecializer();
-    } else if (selector.kind == SelectorKind.OPERATOR) {
+    if (selector.isIndex) {
+      return const IndexSpecializer();
+    } else if (selector.isIndexSet) {
+      return const IndexAssignSpecializer();
+    } else if (selector.isOperator) {
       if (selector.name == 'unary-') {
         return const UnaryNegateSpecializer();
       } else if (selector.name == '~') {
         return const BitNotSpecializer();
       } else if (selector.name == '+') {
         return const AddSpecializer();
       } else if (selector.name == '-') {
         return const SubtractSpecializer();
       } else if (selector.name == '*') {
         return const MultiplySpecializer();
@@ skipping 17 matching lines @@
         return const EqualsSpecializer();
       } else if (selector.name == '<') {
         return const LessSpecializer();
       } else if (selector.name == '<=') {
         return const LessEqualSpecializer();
       } else if (selector.name == '>') {
         return const GreaterSpecializer();
       } else if (selector.name == '>=') {
         return const GreaterEqualSpecializer();
       }
-    } else if (selector.kind == SelectorKind.CALL) {
+    } else if (selector.isCall) {
       if (selector.argumentCount == 1 && selector.namedArguments.length == 0) {
         if (selector.name == 'codeUnitAt') {
           return const CodeUnitAtSpecializer();
         }
       }
     }
     return const InvokeDynamicSpecializer();
   }
 }
 
@@ skipping 148 matching lines @@
     return left.isUInt31(compiler) && right.isUInt31(compiler);
   }
 
   HInstruction newBuiltinVariant(HInvokeDynamic instruction, Compiler compiler);
 
   Selector renameToOptimizedSelector(String name,
                                      Selector selector,
                                      Compiler compiler) {
     if (selector.name == name) return selector;
     JavaScriptBackend backend = compiler.backend;
-    return new Selector(
-        SelectorKind.CALL, new Name(name, backend.interceptorsLibrary),
+    return new Selector.call(new Name(name, backend.interceptorsLibrary),
         new CallStructure(selector.argumentCount));
   }
 }
 
 class AddSpecializer extends BinaryArithmeticSpecializer {
   const AddSpecializer();
 
   TypeMask computeTypeFromInputTypes(HInvokeDynamic instruction,
                                      Compiler compiler) {
     if (inputsAreUInt31(instruction, compiler)) {
@@ skipping 508 matching lines @@
     return constantSystem.codeUnitAt;
   }
 
   HInstruction tryConvertToBuiltin(HInvokeDynamic instruction,
                                    Compiler compiler) {
     // TODO(sra): Implement a builtin HCodeUnitAt instruction and the same index
     // bounds checking optimizations as for HIndex.
     return null;
   }
 }