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

Side by Side Diff: runtime/vm/flow_graph_builder.h

Issue 774763002: Cleanups. (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/
Patch Set: Created 6 years 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
« no previous file with comments | « runtime/vm/flow_graph_allocator.cc ('k') | runtime/vm/flow_graph_builder.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
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 #ifndef VM_FLOW_GRAPH_BUILDER_H_ 5 #ifndef VM_FLOW_GRAPH_BUILDER_H_
6 #define VM_FLOW_GRAPH_BUILDER_H_ 6 #define VM_FLOW_GRAPH_BUILDER_H_
7 7
8 #include "platform/assert.h" 8 #include "platform/assert.h"
9 #include "platform/globals.h" 9 #include "platform/globals.h"
10 #include "vm/allocation.h" 10 #include "vm/allocation.h"
(...skipping 183 matching lines...) Expand 10 before | Expand all | Expand 10 after
194 return num_non_copied_params_; 194 return num_non_copied_params_;
195 } 195 }
196 intptr_t num_stack_locals() const { 196 intptr_t num_stack_locals() const {
197 return num_stack_locals_; 197 return num_stack_locals_;
198 } 198 }
199 199
200 bool IsInlining() const { return (exit_collector_ != NULL); } 200 bool IsInlining() const { return (exit_collector_ != NULL); }
201 InlineExitCollector* exit_collector() const { return exit_collector_; } 201 InlineExitCollector* exit_collector() const { return exit_collector_; }
202 202
203 ZoneGrowableArray<const Field*>* guarded_fields() const { 203 ZoneGrowableArray<const Field*>* guarded_fields() const {
204 return guarded_fields_; 204 return parsed_function_->guarded_fields();
205 } 205 }
206 206
207 ZoneGrowableArray<const LibraryPrefix*>* deferred_prefixes() const { 207 ZoneGrowableArray<const LibraryPrefix*>* deferred_prefixes() const {
208 return parsed_function_->deferred_prefixes(); 208 return parsed_function_->deferred_prefixes();
209 } 209 }
210 210
211 intptr_t temp_count() const { return temp_count_; } 211 intptr_t temp_count() const { return temp_count_; }
212 intptr_t AllocateTemp() { return temp_count_++; } 212 intptr_t AllocateTemp() { return temp_count_++; }
213 void DeallocateTemps(intptr_t count) { 213 void DeallocateTemps(intptr_t count) {
214 ASSERT(temp_count_ >= count); 214 ASSERT(temp_count_ >= count);
(...skipping 25 matching lines...) Expand all
240 return parameter_count() + num_stack_locals_; 240 return parameter_count() + num_stack_locals_;
241 } 241 }
242 242
243 ParsedFunction* parsed_function_; 243 ParsedFunction* parsed_function_;
244 const ZoneGrowableArray<const ICData*>& ic_data_array_; 244 const ZoneGrowableArray<const ICData*>& ic_data_array_;
245 245
246 const intptr_t num_copied_params_; 246 const intptr_t num_copied_params_;
247 const intptr_t num_non_copied_params_; 247 const intptr_t num_non_copied_params_;
248 const intptr_t num_stack_locals_; // Does not include any parameters. 248 const intptr_t num_stack_locals_; // Does not include any parameters.
249 InlineExitCollector* const exit_collector_; 249 InlineExitCollector* const exit_collector_;
250 ZoneGrowableArray<const Field*>* guarded_fields_;
251 250
252 intptr_t last_used_block_id_; 251 intptr_t last_used_block_id_;
253 intptr_t try_index_; 252 intptr_t try_index_;
254 intptr_t catch_try_index_; 253 intptr_t catch_try_index_;
255 intptr_t loop_depth_; 254 intptr_t loop_depth_;
256 GraphEntryInstr* graph_entry_; 255 GraphEntryInstr* graph_entry_;
257 256
258 // The expression stack height. 257 // The expression stack height.
259 intptr_t temp_count_; 258 intptr_t temp_count_;
260 259
(...skipping 342 matching lines...) Expand 10 before | Expand all | Expand 10 after
603 // Output parameters. 602 // Output parameters.
604 GrowableArray<TargetEntryInstr**> true_successor_addresses_; 603 GrowableArray<TargetEntryInstr**> true_successor_addresses_;
605 GrowableArray<TargetEntryInstr**> false_successor_addresses_; 604 GrowableArray<TargetEntryInstr**> false_successor_addresses_;
606 605
607 intptr_t condition_token_pos_; 606 intptr_t condition_token_pos_;
608 }; 607 };
609 608
610 } // namespace dart 609 } // namespace dart
611 610
612 #endif // VM_FLOW_GRAPH_BUILDER_H_ 611 #endif // VM_FLOW_GRAPH_BUILDER_H_
OLDNEW
« no previous file with comments | « runtime/vm/flow_graph_allocator.cc ('k') | runtime/vm/flow_graph_builder.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698