comparison src/share/vm/opto/compile.hpp @ 17812:a7d4d4655766

Merge
author kvn
date Wed, 26 Mar 2014 18:21:05 -0700
parents 62c54fcc0a35
children 3636afd5ec1a
comparison
equal deleted inserted replaced
17789:6b207d038106 17812:a7d4d4655766
601 } 601 }
602 #ifndef PRODUCT 602 #ifndef PRODUCT
603 bool trace_opto_output() const { return _trace_opto_output; } 603 bool trace_opto_output() const { return _trace_opto_output; }
604 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; } 604 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
605 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; } 605 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
606 int _in_dump_cnt; // Required for dumping ir nodes.
606 #endif 607 #endif
607 608
608 // JSR 292 609 // JSR 292
609 bool has_method_handle_invokes() const { return _has_method_handle_invokes; } 610 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
610 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; } 611 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; }
766 // Constant table 767 // Constant table
767 ConstantTable& constant_table() { return _constant_table; } 768 ConstantTable& constant_table() { return _constant_table; }
768 769
769 MachConstantBaseNode* mach_constant_base_node(); 770 MachConstantBaseNode* mach_constant_base_node();
770 bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; } 771 bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
772 // Generated by adlc, true if CallNode requires MachConstantBase.
773 bool needs_clone_jvms();
771 774
772 // Handy undefined Node 775 // Handy undefined Node
773 Node* top() const { return _top; } 776 Node* top() const { return _top; }
774 777
775 // these are used by guys who need to know about creation and transformation of top: 778 // these are used by guys who need to know about creation and transformation of top:
862 bool too_many_traps(Deoptimization::DeoptReason reason, 865 bool too_many_traps(Deoptimization::DeoptReason reason,
863 // Privately used parameter for logging: 866 // Privately used parameter for logging:
864 ciMethodData* logmd = NULL); 867 ciMethodData* logmd = NULL);
865 // Report if there were too many recompiles at a method and bci. 868 // Report if there were too many recompiles at a method and bci.
866 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason); 869 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
870 // Return a bitset with the reasons where deoptimization is allowed,
871 // i.e., where there were not too many uncommon traps.
872 int _allowed_reasons;
873 int allowed_deopt_reasons() { return _allowed_reasons; }
874 void set_allowed_deopt_reasons();
867 875
868 // Parsing, optimization 876 // Parsing, optimization
869 PhaseGVN* initial_gvn() { return _initial_gvn; } 877 PhaseGVN* initial_gvn() { return _initial_gvn; }
870 Unique_Node_List* for_igvn() { return _for_igvn; } 878 Unique_Node_List* for_igvn() { return _for_igvn; }
871 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List. 879 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.