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 #include "vm/intermediate_language.h" | 5 #include "vm/intermediate_language.h" |
6 | 6 |
7 #include "vm/object.h" | 7 #include "vm/object.h" |
8 #include "vm/os.h" | 8 #include "vm/os.h" |
9 #include "vm/scopes.h" | 9 #include "vm/scopes.h" |
10 | 10 |
(...skipping 15 matching lines...) Expand all Loading... |
26 return successor_; | 26 return successor_; |
27 } | 27 } |
28 | 28 |
29 | 29 |
30 Instruction* TargetEntryInstr::Accept(FlowGraphVisitor* visitor) { | 30 Instruction* TargetEntryInstr::Accept(FlowGraphVisitor* visitor) { |
31 visitor->VisitTargetEntry(this); | 31 visitor->VisitTargetEntry(this); |
32 return successor_; | 32 return successor_; |
33 } | 33 } |
34 | 34 |
35 | 35 |
36 Instruction* PickTempInstr::Accept(FlowGraphVisitor* visitor) { | |
37 visitor->VisitPickTemp(this); | |
38 return successor_; | |
39 } | |
40 | |
41 | |
42 Instruction* TuckTempInstr::Accept(FlowGraphVisitor* visitor) { | |
43 visitor->VisitTuckTemp(this); | |
44 return successor_; | |
45 } | |
46 | |
47 | |
48 Instruction* DoInstr::Accept(FlowGraphVisitor* visitor) { | 36 Instruction* DoInstr::Accept(FlowGraphVisitor* visitor) { |
49 visitor->VisitDo(this); | 37 visitor->VisitDo(this); |
50 return successor_; | 38 return successor_; |
51 } | 39 } |
52 | 40 |
53 | 41 |
54 Instruction* BindInstr::Accept(FlowGraphVisitor* visitor) { | 42 Instruction* BindInstr::Accept(FlowGraphVisitor* visitor) { |
55 visitor->VisitBind(this); | 43 visitor->VisitBind(this); |
56 return successor_; | 44 return successor_; |
57 } | 45 } |
(...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
165 intptr_t BindInstr::InputCount() const { | 153 intptr_t BindInstr::InputCount() const { |
166 return computation()->InputCount(); | 154 return computation()->InputCount(); |
167 } | 155 } |
168 | 156 |
169 | 157 |
170 intptr_t DoInstr::InputCount() const { | 158 intptr_t DoInstr::InputCount() const { |
171 return computation()->InputCount(); | 159 return computation()->InputCount(); |
172 } | 160 } |
173 | 161 |
174 | 162 |
175 intptr_t TuckTempInstr::InputCount() const { | |
176 return 0; | |
177 } | |
178 | |
179 | |
180 intptr_t PickTempInstr::InputCount() const { | |
181 return 0; | |
182 } | |
183 | |
184 | |
185 intptr_t TargetEntryInstr::InputCount() const { | 163 intptr_t TargetEntryInstr::InputCount() const { |
186 return 0; | 164 return 0; |
187 } | 165 } |
188 | 166 |
189 | 167 |
190 intptr_t JoinEntryInstr::InputCount() const { | 168 intptr_t JoinEntryInstr::InputCount() const { |
191 return 0; | 169 return 0; |
192 } | 170 } |
193 | 171 |
194 | 172 |
(...skipping 95 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
290 // true/false order in reverse postorder used as the block ordering in the | 268 // true/false order in reverse postorder used as the block ordering in the |
291 // nonoptimizing compiler. | 269 // nonoptimizing compiler. |
292 ASSERT(true_successor_ != NULL); | 270 ASSERT(true_successor_ != NULL); |
293 ASSERT(false_successor_ != NULL); | 271 ASSERT(false_successor_ != NULL); |
294 false_successor_->DiscoverBlocks(current_block, preorder, postorder, parent); | 272 false_successor_->DiscoverBlocks(current_block, preorder, postorder, parent); |
295 true_successor_->DiscoverBlocks(current_block, preorder, postorder, parent); | 273 true_successor_->DiscoverBlocks(current_block, preorder, postorder, parent); |
296 } | 274 } |
297 | 275 |
298 | 276 |
299 } // namespace dart | 277 } // namespace dart |
OLD | NEW |