| 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 class EnqueueTask extends CompilerTask { | 5 class EnqueueTask extends CompilerTask { |
| 6 final Enqueuer codegen; | 6 final Enqueuer codegen; |
| 7 final Enqueuer resolution; | 7 final Enqueuer resolution; |
| 8 | 8 |
| 9 String get name() => 'Enqueue'; | 9 String get name() => 'Enqueue'; |
| 10 | 10 |
| (...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 81 if (!isResolutionQueue && | 81 if (!isResolutionQueue && |
| 82 element.kind === ElementKind.GENERATIVE_CONSTRUCTOR) { | 82 element.kind === ElementKind.GENERATIVE_CONSTRUCTOR) { |
| 83 registerInstantiatedClass(element.getEnclosingClass()); | 83 registerInstantiatedClass(element.getEnclosingClass()); |
| 84 } | 84 } |
| 85 if (elements === null) { | 85 if (elements === null) { |
| 86 elements = getCachedElements(element); | 86 elements = getCachedElements(element); |
| 87 } | 87 } |
| 88 queue.add(new WorkItem(element, elements)); | 88 queue.add(new WorkItem(element, elements)); |
| 89 } | 89 } |
| 90 | 90 |
| 91 void eagerRecompile(Element element) { | |
| 92 universe.generatedCode.remove(element); | |
| 93 universe.generatedBailoutCode.remove(element); | |
| 94 addToWorkList(element); | |
| 95 } | |
| 96 | |
| 97 bool canBeRecompiled(Element element) { | 91 bool canBeRecompiled(Element element) { |
| 98 // Only member functions can be recompiled. An exception to this is members | 92 // Only member functions can be recompiled. An exception to this is members |
| 99 // of closures. They are processed as part of the enclosing function and not | 93 // of closures. They are processed as part of the enclosing function and not |
| 100 // present as a separate element (the call to the closure will be a member | 94 // present as a separate element (the call to the closure will be a member |
| 101 // function). | 95 // function). |
| 102 return element.isMember() && !element.getEnclosingClass().isClosure(); | 96 return element.isMember() && !element.getEnclosingClass().isClosure(); |
| 103 } | 97 } |
| 104 | 98 |
| 105 void registerRecompilationCandidate(Element element, | 99 void registerRecompilationCandidate(Element element, |
| 106 [TreeElements elements]) { | 100 [TreeElements elements]) { |
| (...skipping 215 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 322 void forEach(f(WorkItem work)) { | 316 void forEach(f(WorkItem work)) { |
| 323 while (!queue.isEmpty()) { | 317 while (!queue.isEmpty()) { |
| 324 do { | 318 do { |
| 325 f(queue.removeLast()); | 319 f(queue.removeLast()); |
| 326 } while (!queue.isEmpty()); | 320 } while (!queue.isEmpty()); |
| 327 // TODO(ahe): we shouldn't register the field closure invocations here. | 321 // TODO(ahe): we shouldn't register the field closure invocations here. |
| 328 registerFieldClosureInvocations(); | 322 registerFieldClosureInvocations(); |
| 329 } | 323 } |
| 330 } | 324 } |
| 331 } | 325 } |
| OLD | NEW |