Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(37)

Side by Side Diff: lib/compiler/implementation/enqueue.dart

Issue 10827180: Move types out of the HInstructions. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Simplifications. Created 8 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
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
11 EnqueueTask(Compiler compiler) 11 EnqueueTask(Compiler compiler)
12 : codegen = new Enqueuer(compiler), 12 : codegen = new Enqueuer(compiler,
13 resolution = new Enqueuer(compiler), 13 compiler.backend.createItemCompilationContext),
14 resolution = new Enqueuer(compiler,
15 compiler.backend.createItemCompilationContext),
14 super(compiler) { 16 super(compiler) {
15 codegen.task = this; 17 codegen.task = this;
16 resolution.task = this; 18 resolution.task = this;
17 } 19 }
18 } 20 }
19 21
20 class RecompilationQueue { 22 class RecompilationQueue {
23 final Function itemCompilationContextCreator;
21 final Queue<WorkItem> queue; 24 final Queue<WorkItem> queue;
22 final Set<Element> queueElements; 25 final Set<Element> queueElements;
23 int processed = 0; 26 int processed = 0;
24 27
25 RecompilationQueue() 28 RecompilationQueue(ItemCompilationContext itemCompilationContextCreator())
26 : queue = new Queue<WorkItem>(), 29 : this.itemCompilationContextCreator = itemCompilationContextCreator,
30 queue = new Queue<WorkItem>(),
27 queueElements = new Set<Element>(); 31 queueElements = new Set<Element>();
28 32
29 void add(Element element, TreeElements elements) { 33 void add(Element element, TreeElements elements) {
30 if (queueElements.contains(element)) return; 34 if (queueElements.contains(element)) return;
31 queueElements.add(element); 35 queueElements.add(element);
32 queue.add(new WorkItem(element, elements)); 36 queue.add(new WorkItem(element, elements, itemCompilationContextCreator()));
33 } 37 }
34 38
35 int get length() => queue.length; 39 int get length() => queue.length;
36 40
37 bool isEmpty() => queue.isEmpty(); 41 bool isEmpty() => queue.isEmpty();
38 42
39 WorkItem next() { 43 WorkItem next() {
40 WorkItem item = queue.removeLast(); 44 WorkItem item = queue.removeLast();
41 queueElements.remove(item.element); 45 queueElements.remove(item.element);
42 processed++; 46 processed++;
43 return item; 47 return item;
44 } 48 }
45 } 49 }
46 50
47 class Enqueuer { 51 class Enqueuer {
48 final Compiler compiler; // TODO(ahe): Remove this dependency. 52 final Compiler compiler; // TODO(ahe): Remove this dependency.
53 final Function itemCompilationContextCreator;
49 final Map<String, Link<Element>> instanceMembersByName; 54 final Map<String, Link<Element>> instanceMembersByName;
50 final Set<ClassElement> seenClasses; 55 final Set<ClassElement> seenClasses;
51 final Universe universe; 56 final Universe universe;
52 final Queue<WorkItem> queue; 57 final Queue<WorkItem> queue;
53 final Map<Element, TreeElements> resolvedElements; 58 final Map<Element, TreeElements> resolvedElements;
54 final RecompilationQueue recompilationCandidates; 59 final RecompilationQueue recompilationCandidates;
55 60
56 bool queueIsClosed = false; 61 bool queueIsClosed = false;
57 EnqueueTask task; 62 EnqueueTask task;
58 63
59 Enqueuer(this.compiler) 64 Enqueuer(this.compiler,
60 : instanceMembersByName = new Map<String, Link<Element>>(), 65 ItemCompilationContext itemCompilationContextCreator())
66 : this.itemCompilationContextCreator = itemCompilationContextCreator,
67 instanceMembersByName = new Map<String, Link<Element>>(),
61 seenClasses = new Set<ClassElement>(), 68 seenClasses = new Set<ClassElement>(),
62 universe = new Universe(), 69 universe = new Universe(),
63 queue = new Queue<WorkItem>(), 70 queue = new Queue<WorkItem>(),
64 resolvedElements = new Map<Element, TreeElements>(), 71 resolvedElements = new Map<Element, TreeElements>(),
65 recompilationCandidates = new RecompilationQueue(); 72 recompilationCandidates =
73 new RecompilationQueue(itemCompilationContextCreator);
66 74
67 bool get isResolutionQueue() => compiler.enqueuer.resolution === this; 75 bool get isResolutionQueue() => compiler.enqueuer.resolution === this;
68 76
69 TreeElements getCachedElements(Element element) { 77 TreeElements getCachedElements(Element element) {
70 Element owner = element.getOutermostEnclosingMemberOrTopLevel(); 78 Element owner = element.getOutermostEnclosingMemberOrTopLevel();
71 return compiler.enqueuer.resolution.resolvedElements[owner]; 79 return compiler.enqueuer.resolution.resolvedElements[owner];
72 } 80 }
73 81
74 void addToWorkList(Element element, [TreeElements elements]) { 82 void addToWorkList(Element element, [TreeElements elements]) {
75 if (element.isForeign()) return; 83 if (element.isForeign()) return;
76 if (compiler.phase == Compiler.PHASE_RECOMPILING) return; 84 if (compiler.phase == Compiler.PHASE_RECOMPILING) return;
77 if (queueIsClosed) { 85 if (queueIsClosed) {
78 if (isResolutionQueue && getCachedElements(element) !== null) return; 86 if (isResolutionQueue && getCachedElements(element) !== null) return;
79 compiler.internalErrorOnElement(element, "Work list is closed."); 87 compiler.internalErrorOnElement(element, "Work list is closed.");
80 } 88 }
81 if (!isResolutionQueue && 89 if (!isResolutionQueue &&
82 element.kind === ElementKind.GENERATIVE_CONSTRUCTOR) { 90 element.kind === ElementKind.GENERATIVE_CONSTRUCTOR) {
83 registerInstantiatedClass(element.enclosingElement); 91 registerInstantiatedClass(element.enclosingElement);
84 } 92 }
85 if (elements === null) { 93 if (elements === null) {
86 elements = getCachedElements(element); 94 elements = getCachedElements(element);
87 } 95 }
88 queue.add(new WorkItem(element, elements)); 96 queue.add(new WorkItem(element, elements, itemCompilationContextCreator()));
89 } 97 }
90 98
91 bool canBeRecompiled(Element element) { 99 bool canBeRecompiled(Element element) {
92 // Only member functions can be recompiled. An exception to this is members 100 // Only member functions can be recompiled. An exception to this is members
93 // of closures. They are processed as part of the enclosing function and not 101 // of closures. They are processed as part of the enclosing function and not
94 // present as a separate element (the call to the closure will be a member 102 // present as a separate element (the call to the closure will be a member
95 // function). 103 // function).
96 return element.isMember() && !element.getEnclosingClass().isClosure(); 104 return element.isMember() && !element.getEnclosingClass().isClosure();
97 } 105 }
98 106
(...skipping 215 matching lines...) Expand 10 before | Expand all | Expand 10 after
314 void registerIsCheck(Element element) { 322 void registerIsCheck(Element element) {
315 universe.isChecks.add(element); 323 universe.isChecks.add(element);
316 } 324 }
317 325
318 void forEach(f(WorkItem work)) { 326 void forEach(f(WorkItem work)) {
319 while (!queue.isEmpty()) { 327 while (!queue.isEmpty()) {
320 f(queue.removeLast()); 328 f(queue.removeLast());
321 } 329 }
322 } 330 }
323 } 331 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698