| OLD | NEW |
| 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 part of dart_backend; | 5 part of dart_backend; |
| 6 | 6 |
| 7 // TODO(ahe): This class is simply wrong. This backend should use | 7 // TODO(ahe): This class is simply wrong. This backend should use |
| 8 // elements when it can, not AST nodes. Perhaps a [Map<Element, | 8 // elements when it can, not AST nodes. Perhaps a [Map<Element, |
| 9 // TreeElements>] is what is needed. | 9 // TreeElements>] is what is needed. |
| 10 class ElementAst { | 10 class ElementAst { |
| (...skipping 206 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 217 new Selector.call("toString", null, 0)); | 217 new Selector.call("toString", null, 0)); |
| 218 world.registerInvokedGetter( | 218 world.registerInvokedGetter( |
| 219 new Selector.getter("hashCode", null)); | 219 new Selector.getter("hashCode", null)); |
| 220 world.registerInvocation( | 220 world.registerInvocation( |
| 221 new Selector.binaryOperator("==")); | 221 new Selector.binaryOperator("==")); |
| 222 world.registerInvocation( | 222 world.registerInvocation( |
| 223 new Selector.call("compareTo", null, 1)); | 223 new Selector.call("compareTo", null, 1)); |
| 224 } | 224 } |
| 225 | 225 |
| 226 void codegen(CodegenWorkItem work) { } | 226 void codegen(CodegenWorkItem work) { } |
| 227 void processNativeClasses(Enqueuer world, | |
| 228 Iterable<LibraryElement> libraries) { } | |
| 229 | 227 |
| 230 bool isUserLibrary(LibraryElement lib) { | 228 bool isUserLibrary(LibraryElement lib) { |
| 231 final INTERNAL_HELPERS = [ | 229 final INTERNAL_HELPERS = [ |
| 232 compiler.jsHelperLibrary, | 230 compiler.jsHelperLibrary, |
| 233 compiler.interceptorsLibrary, | 231 compiler.interceptorsLibrary, |
| 234 ]; | 232 ]; |
| 235 return INTERNAL_HELPERS.indexOf(lib) == -1 && !lib.isPlatformLibrary; | 233 return INTERNAL_HELPERS.indexOf(lib) == -1 && !lib.isPlatformLibrary; |
| 236 } | 234 } |
| 237 | 235 |
| 238 void assembleProgram() { | 236 void assembleProgram() { |
| (...skipping 393 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 632 } | 630 } |
| 633 | 631 |
| 634 compareElements(e0, e1) { | 632 compareElements(e0, e1) { |
| 635 int result = compareBy((e) => e.getLibrary().canonicalUri.toString())(e0, e1); | 633 int result = compareBy((e) => e.getLibrary().canonicalUri.toString())(e0, e1); |
| 636 if (result != 0) return result; | 634 if (result != 0) return result; |
| 637 return compareBy((e) => e.position().charOffset)(e0, e1); | 635 return compareBy((e) => e.position().charOffset)(e0, e1); |
| 638 } | 636 } |
| 639 | 637 |
| 640 List<Element> sortElements(Iterable<Element> elements) => | 638 List<Element> sortElements(Iterable<Element> elements) => |
| 641 sorted(elements, compareElements); | 639 sorted(elements, compareElements); |
| OLD | NEW |