| 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_HYDROGEN_H_ | 5 #ifndef V8_HYDROGEN_H_ |
| 6 #define V8_HYDROGEN_H_ | 6 #define V8_HYDROGEN_H_ |
| 7 | 7 |
| 8 #include "src/v8.h" | 8 #include "src/v8.h" |
| 9 | 9 |
| 10 #include "src/accessors.h" | 10 #include "src/accessors.h" |
| (...skipping 392 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 403 return use_optimistic_licm_; | 403 return use_optimistic_licm_; |
| 404 } | 404 } |
| 405 | 405 |
| 406 void set_use_optimistic_licm(bool value) { | 406 void set_use_optimistic_licm(bool value) { |
| 407 use_optimistic_licm_ = value; | 407 use_optimistic_licm_ = value; |
| 408 } | 408 } |
| 409 | 409 |
| 410 void MarkRecursive() { is_recursive_ = true; } | 410 void MarkRecursive() { is_recursive_ = true; } |
| 411 bool is_recursive() const { return is_recursive_; } | 411 bool is_recursive() const { return is_recursive_; } |
| 412 | 412 |
| 413 void MarkThisHasUses() { this_has_uses_ = true; } | |
| 414 bool this_has_uses() const { return this_has_uses_; } | |
| 415 | |
| 416 void MarkDependsOnEmptyArrayProtoElements() { | 413 void MarkDependsOnEmptyArrayProtoElements() { |
| 417 // Add map dependency if not already added. | 414 // Add map dependency if not already added. |
| 418 if (depends_on_empty_array_proto_elements_) return; | 415 if (depends_on_empty_array_proto_elements_) return; |
| 419 info()->dependencies()->AssumePropertyCell( | 416 info()->dependencies()->AssumePropertyCell( |
| 420 isolate()->factory()->array_protector()); | 417 isolate()->factory()->array_protector()); |
| 421 depends_on_empty_array_proto_elements_ = true; | 418 depends_on_empty_array_proto_elements_ = true; |
| 422 } | 419 } |
| 423 | 420 |
| 424 bool depends_on_empty_array_proto_elements() { | 421 bool depends_on_empty_array_proto_elements() { |
| 425 return depends_on_empty_array_proto_elements_; | 422 return depends_on_empty_array_proto_elements_; |
| (...skipping 60 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 486 SetOncePointer<HConstant> constant_null_; | 483 SetOncePointer<HConstant> constant_null_; |
| 487 SetOncePointer<HConstant> constant_invalid_context_; | 484 SetOncePointer<HConstant> constant_invalid_context_; |
| 488 SetOncePointer<HArgumentsObject> arguments_object_; | 485 SetOncePointer<HArgumentsObject> arguments_object_; |
| 489 | 486 |
| 490 HOsrBuilder* osr_; | 487 HOsrBuilder* osr_; |
| 491 | 488 |
| 492 CompilationInfo* info_; | 489 CompilationInfo* info_; |
| 493 Zone* zone_; | 490 Zone* zone_; |
| 494 | 491 |
| 495 bool is_recursive_; | 492 bool is_recursive_; |
| 496 bool this_has_uses_; | |
| 497 bool use_optimistic_licm_; | 493 bool use_optimistic_licm_; |
| 498 bool depends_on_empty_array_proto_elements_; | 494 bool depends_on_empty_array_proto_elements_; |
| 499 int type_change_checksum_; | 495 int type_change_checksum_; |
| 500 int maximum_environment_size_; | 496 int maximum_environment_size_; |
| 501 int no_side_effects_scope_count_; | 497 int no_side_effects_scope_count_; |
| 502 bool disallow_adding_new_values_; | 498 bool disallow_adding_new_values_; |
| 503 | 499 |
| 504 DISALLOW_COPY_AND_ASSIGN(HGraph); | 500 DISALLOW_COPY_AND_ASSIGN(HGraph); |
| 505 }; | 501 }; |
| 506 | 502 |
| (...skipping 2546 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3053 } | 3049 } |
| 3054 | 3050 |
| 3055 private: | 3051 private: |
| 3056 HGraphBuilder* builder_; | 3052 HGraphBuilder* builder_; |
| 3057 }; | 3053 }; |
| 3058 | 3054 |
| 3059 | 3055 |
| 3060 } } // namespace v8::internal | 3056 } } // namespace v8::internal |
| 3061 | 3057 |
| 3062 #endif // V8_HYDROGEN_H_ | 3058 #endif // V8_HYDROGEN_H_ |
| OLD | NEW |