vm/opto/compile.cpp

77 // -------------------- Compile::mach_constant_base_node -----------------------
79 MachConstantBaseNode* Compile::mach_constant_base_node() {
112 int Compile::intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found) {
127 void Compile::register_intrinsic(CallGenerator* cg) {
139 CallGenerator* Compile::find_intrinsic(ciMethod* m, bool is_virtual) {
163 // Compile:: register_library_intrinsics and make_vm_intrinsic are defined
170 juint  Compile::_intrinsic_hist_count[vmIntrinsics::ID_LIMIT] = {0};
171 jubyte Compile::_intrinsic_hist_flags[vmIntrinsics::ID_LIMIT] = {0};
173 bool Compile::gather_intrinsic_statistics(vmIntrinsics::ID id, bool is_virtual, int flags) {
212   if ((flags & Compile::_intrinsic_worked) != 0)    strcat(buf, ",worked");
213   if ((flags & Compile::_intrinsic_failed) != 0)    strcat(buf, ",failed");
214   if ((flags & Compile::_intrinsic_disabled) != 0)  strcat(buf, ",disabled");
215   if ((flags & Compile::_intrinsic_virtual) != 0)   strcat(buf, ",virtual");
216   if ((flags & Compile::_intrinsic_both) != 0)      strcat(buf, ",nonvirtual");
222 void Compile::print_intrinsic_statistics() {
243 void Compile::print_statistics() {
262 Bundle* Compile::node_bundling(const Node *n) {
267 bool Compile::valid_bundle_info(const Node *n) {
272 void Compile::gvn_replace_by(Node* n, Node* nn) {
306 void Compile::identify_useful_nodes(Unique_Node_List &useful) {
330 void Compile::update_dead_node_list(Unique_Node_List &useful) {
343 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) {
359 void Compile::remove_useless_nodes(Unique_Node_List &useful) {
374                "If top is cached in Compile object it is in useful list");
415 int Compile::frame_size_in_words() const {
427 int Compile::bang_size_in_bytes() const {
434   Compile *const _compile;
436   CompileWrapper(Compile* compile);
441 CompileWrapper::CompileWrapper(Compile* compile) : _compile(compile) {
442   // the Compile* pointer is stored in the current ciEnv:
447   assert(compile == Compile::current(), "sanity");
472 void Compile::print_compile_messages() {
514 void Compile::init_scratch_buffer_blob(int const_size) {
529     blob = BufferBlob::create("Compile::scratch_buffer", size);
548 uint Compile::scratch_emit_size(const Node* n) {
610 //------------------------------Compile standard-------------------------------
611 debug_only( int Compile::_debug_idx = 100000; )
613 // Compile a method.  entry_bci is -1 for normal compilations and indicates
617 Compile::Compile( ciEnv* ci_env, C2Compiler* compiler, ciMethod* target, int osr_bci,
637                   _code_buffer("Compile::Fill_buffer"),
935 //------------------------------Compile----------------------------------------
936 // Compile a runtime stub
937 Compile::Compile( ciEnv* ci_env,
966     _code_buffer("Compile::Fill_buffer"),
1056 void Compile::Init(int aliaslevel) {
1112       NOT_PRODUCT(if (do_vector_loop() && Verbose) {tty->print("Compile::Init: do vectorized loops (SIMD like) for method %s\n",  method()->name()->as_quoted_ascii());})
1119   NOT_PRODUCT(if (use_cmove() && Verbose && has_method()) {tty->print("Compile::Init: use CMove without profitability tests for method %s\n",  method()->name()->as_quoted_ascii());})
1184 void Compile::init_start(StartNode* s) {
1195 StartNode* Compile::start() const {
1209 Node* Compile::immutable_memory() {
1227 void Compile::set_cached_top_node(Node* tn) {
1239 uint Compile::count_live_nodes_by_graph_walk() {
1246 void Compile::print_missing_nodes() {
1302 void Compile::record_modified_node(Node* n) {
1309 void Compile::remove_modified_node(Node* n) {
1317 void Compile::verify_top(Node* tn) const {
1329 void Compile::grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by) {
1344 bool Compile::copy_node_notes_to(Node* dest, Node* source) {
1383 bool Compile::allow_range_check_smearing() const {
1393 const TypePtr *Compile::flatten_alias_type( const TypePtr *tj ) const {
1615 void Compile::AliasType::Init(int i, const TypePtr* at) {
1624     _general_index = Compile::current()->get_alias_index(gt);
1630 BasicType Compile::AliasType::basic_type() const {
1643 void Compile::AliasType::print_on(outputStream* st) {
1666   Compile* C = Compile::current();
1668   for (int idx = Compile::AliasIdxBot; idx < C->num_alias_types(); idx++) {
1677 Compile::AliasCacheEntry* Compile::probe_alias_cache(const TypePtr* adr_type) {
1685 void Compile::grow_alias_types() {
1698 Compile::AliasType* Compile::find_alias_type(const TypePtr* adr_type, bool no_create, ciField* original_field) {
1819 Compile::AliasType* Compile::alias_type(ciField* field) {
1832 bool Compile::have_alias_type(const TypePtr* adr_type) {
1847 bool Compile::must_alias(const TypePtr* adr_type, int alias_idx) {
1865 bool Compile::can_alias(const TypePtr* adr_type, int alias_idx) {
1880 WarmCallInfo* Compile::pop_warm_call() {
1887 int Compile::Inline_Warm() {
1916 void Compile::Finish_Warm() {
1931 void Compile::cleanup_loop_predicates(PhaseIterGVN &igvn) {
1941 void Compile::add_range_check_cast(Node* n) {
1948 void Compile::remove_range_check_casts(PhaseIterGVN &igvn) {
1958 void Compile::inline_string_calls(bool parse_time) {
1986 void Compile::inline_boxing_calls(PhaseIterGVN& igvn) {
2019 void Compile::inline_incrementally_one(PhaseIterGVN& igvn) {
2056 void Compile::inline_incrementally(PhaseIterGVN& igvn) {
2126 void Compile::Optimize() {
2191     Compile::TracePhase tp("", &timers[_t_renumberLive]);
2351 void Compile::Code_Gen() {
2457 void Compile::dump_asm(int *pcs, uint pc_limit) {
2617 void Compile::eliminate_redundant_card_marks(Node* n) {
2663 void Compile::final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc) {
2694     assert( n->in(0) != NULL || alias_idx != Compile::AliasIdxRaw ||
3345 void Compile::final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc ) {
3450 bool Compile::final_graph_reshaping() {
3547 bool Compile::too_many_traps(ciMethod* method,
3573 bool Compile::too_many_traps(Deoptimization::DeoptReason reason,
3596 bool Compile::too_many_recompiles(ciMethod* method,
3643 void Compile::set_allowed_deopt_reasons() {
3646     for (int rs = (int)Deoptimization::Reason_none+1; rs < Compile::trapHistLength; rs++) {
3659 void Compile::verify_graph_edges(bool no_dead_code) {
3695 void Compile::verify_barriers() {
3759 // The Compile object keeps track of failure reasons separately from the ciEnv.
3761 // ciEnv and its compilation task and the Compile object.  Note that one
3762 // ciEnv might use two Compile objects, if C2Compiler::compile_method decides
3764 // behavior, the Compile's failure reason is quietly copied up to the ciEnv
3766 void Compile::record_failure(const char* reason) {
3781 Compile::TracePhase::TracePhase(const char* name, elapsedTimer* accumulator)
3786     C = Compile::current();
3799 Compile::TracePhase::~TracePhase() {
3801   C = Compile::current();
3815     Compile::current()->print_missing_nodes();
3826 bool Compile::Constant::operator==(const Constant& other) {
3862 int Compile::ConstantTable::qsort_comparator(Constant* a, Constant* b) {
3869 void Compile::ConstantTable::calculate_offsets_and_size() {
3909 void Compile::ConstantTable::emit(CodeBuffer& cb) {
3959 int Compile::ConstantTable::find_offset(Constant& con) const {
3967 void Compile::ConstantTable::add(Constant& con) {
3978 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, BasicType type, jvalue value) {
3979   Block* b = Compile::current()->cfg()->get_block_for_node(n);
3985 Compile::Constant Compile::ConstantTable::add(Metadata* metadata) {
3991 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, MachOper* oper) {
4006 Compile::Constant Compile::ConstantTable::add_jump_table(MachConstantNode* n) {
4009   // as this method is called from Compile::Fill_buffer right before
4018 void Compile::ConstantTable::fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const {
4019   // If called from Compile::scratch_emit_size do nothing.
4020   if (Compile::current()->in_scratch_emit_size())  return;
4047 int Compile::static_subtype_check(ciKlass* superk, ciKlass* subk) {
4091 Node* Compile::conv_I2X_index(PhaseGVN* phase, Node* idx, const TypeInt* sizetype, Node* ctrl) {
4112 Node* Compile::constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl) {
4137 void Compile::print_inlining_init() {
4144 void Compile::print_inlining_reinit() {
4151 void Compile::print_inlining_reset() {
4155 void Compile::print_inlining_commit() {
4163 void Compile::print_inlining_push() {
4169 Compile::PrintInliningBuffer& Compile::print_inlining_current() {
4173 void Compile::print_inlining_update(CallGenerator* cg) {
4192 void Compile::print_inlining_move_to(CallGenerator* cg) {
4206 void Compile::print_inlining_update_delayed(CallGenerator* cg) {
4217 void Compile::print_inlining_assert_ready() {
4221 void Compile::process_print_inlining() {
4250 void Compile::dump_print_inlining() {
4256 void Compile::log_late_inline(CallGenerator* cg) {
4269 void Compile::log_late_inline_failure(CallGenerator* cg, const char* msg) {
4276 void Compile::log_inline_id(CallGenerator* cg) {
4291 void Compile::log_inline_failure(const char* msg) {
4300 void Compile::dump_inline_data(outputStream* out) {
4308 int Compile::cmp_expensive_nodes(Node* n1, Node* n2) {
4321 int Compile::cmp_expensive_nodes(Node** n1p, Node** n2p) {
4328 void Compile::sort_expensive_nodes() {
4334 bool Compile::expensive_nodes_sorted() const {
4343 bool Compile::should_optimize_expensive_nodes(PhaseIterGVN &igvn) {
4376 void Compile::cleanup_expensive_nodes(PhaseIterGVN &igvn) {
4422 void Compile::add_expensive_node(Node * n) {
4438 void Compile::remove_speculative_types(PhaseIterGVN &igvn) {
4527 bool Compile::randomized_select(int count) {
4532 CloneMap&     Compile::clone_map()                 { return _clone_map; }
4533 void          Compile::set_clone_map(Dict* d)      { _clone_map._dict = d; }