OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_CRANKSHAFT_HYDROGEN_H_ | 5 #ifndef V8_CRANKSHAFT_HYDROGEN_H_ |
6 #define V8_CRANKSHAFT_HYDROGEN_H_ | 6 #define V8_CRANKSHAFT_HYDROGEN_H_ |
7 | 7 |
8 #include "src/accessors.h" | 8 #include "src/accessors.h" |
9 #include "src/allocation.h" | 9 #include "src/allocation.h" |
10 #include "src/ast/ast.h" | 10 #include "src/ast/ast.h" |
(...skipping 382 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
393 int maximum_environment_size() { return maximum_environment_size_; } | 393 int maximum_environment_size() { return maximum_environment_size_; } |
394 | 394 |
395 bool use_optimistic_licm() { | 395 bool use_optimistic_licm() { |
396 return use_optimistic_licm_; | 396 return use_optimistic_licm_; |
397 } | 397 } |
398 | 398 |
399 void set_use_optimistic_licm(bool value) { | 399 void set_use_optimistic_licm(bool value) { |
400 use_optimistic_licm_ = value; | 400 use_optimistic_licm_ = value; |
401 } | 401 } |
402 | 402 |
403 void MarkRecursive() { is_recursive_ = true; } | |
404 bool is_recursive() const { return is_recursive_; } | |
405 | |
406 void MarkDependsOnEmptyArrayProtoElements() { | 403 void MarkDependsOnEmptyArrayProtoElements() { |
407 // Add map dependency if not already added. | 404 // Add map dependency if not already added. |
408 if (depends_on_empty_array_proto_elements_) return; | 405 if (depends_on_empty_array_proto_elements_) return; |
409 info()->dependencies()->AssumePropertyCell( | 406 info()->dependencies()->AssumePropertyCell( |
410 isolate()->factory()->array_protector()); | 407 isolate()->factory()->array_protector()); |
411 depends_on_empty_array_proto_elements_ = true; | 408 depends_on_empty_array_proto_elements_ = true; |
412 } | 409 } |
413 | 410 |
414 bool depends_on_empty_array_proto_elements() { | 411 bool depends_on_empty_array_proto_elements() { |
415 return depends_on_empty_array_proto_elements_; | 412 return depends_on_empty_array_proto_elements_; |
(...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
475 SetOncePointer<HConstant> constant_the_hole_; | 472 SetOncePointer<HConstant> constant_the_hole_; |
476 SetOncePointer<HConstant> constant_null_; | 473 SetOncePointer<HConstant> constant_null_; |
477 SetOncePointer<HConstant> constant_invalid_context_; | 474 SetOncePointer<HConstant> constant_invalid_context_; |
478 | 475 |
479 HOsrBuilder* osr_; | 476 HOsrBuilder* osr_; |
480 | 477 |
481 CompilationInfo* info_; | 478 CompilationInfo* info_; |
482 CallInterfaceDescriptor descriptor_; | 479 CallInterfaceDescriptor descriptor_; |
483 Zone* zone_; | 480 Zone* zone_; |
484 | 481 |
485 bool is_recursive_; | |
486 bool use_optimistic_licm_; | 482 bool use_optimistic_licm_; |
487 bool depends_on_empty_array_proto_elements_; | 483 bool depends_on_empty_array_proto_elements_; |
488 int type_change_checksum_; | 484 int type_change_checksum_; |
489 int maximum_environment_size_; | 485 int maximum_environment_size_; |
490 int no_side_effects_scope_count_; | 486 int no_side_effects_scope_count_; |
491 bool disallow_adding_new_values_; | 487 bool disallow_adding_new_values_; |
492 | 488 |
493 DISALLOW_COPY_AND_ASSIGN(HGraph); | 489 DISALLOW_COPY_AND_ASSIGN(HGraph); |
494 }; | 490 }; |
495 | 491 |
(...skipping 2535 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3031 | 3027 |
3032 private: | 3028 private: |
3033 HGraphBuilder* builder_; | 3029 HGraphBuilder* builder_; |
3034 }; | 3030 }; |
3035 | 3031 |
3036 | 3032 |
3037 } // namespace internal | 3033 } // namespace internal |
3038 } // namespace v8 | 3034 } // namespace v8 |
3039 | 3035 |
3040 #endif // V8_CRANKSHAFT_HYDROGEN_H_ | 3036 #endif // V8_CRANKSHAFT_HYDROGEN_H_ |
OLD | NEW |