Lines Matching defs:Compile
86 // -------------------- Compile::mach_constant_base_node -----------------------
88 MachConstantBaseNode* Compile::mach_constant_base_node() {
101 int Compile::intrinsic_insertion_index(ciMethod* m, bool is_virtual) {
136 void Compile::register_intrinsic(CallGenerator* cg) {
162 CallGenerator* Compile::find_intrinsic(ciMethod* m, bool is_virtual) {
187 // Compile:: register_library_intrinsics and make_vm_intrinsic are defined
194 juint Compile::_intrinsic_hist_count[vmIntrinsics::ID_LIMIT] = {0};
195 jubyte Compile::_intrinsic_hist_flags[vmIntrinsics::ID_LIMIT] = {0};
197 bool Compile::gather_intrinsic_statistics(vmIntrinsics::ID id, bool is_virtual, int flags) {
236 if ((flags & Compile::_intrinsic_worked) != 0) strcat(buf, ",worked");
237 if ((flags & Compile::_intrinsic_failed) != 0) strcat(buf, ",failed");
238 if ((flags & Compile::_intrinsic_disabled) != 0) strcat(buf, ",disabled");
239 if ((flags & Compile::_intrinsic_virtual) != 0) strcat(buf, ",virtual");
240 if ((flags & Compile::_intrinsic_both) != 0) strcat(buf, ",nonvirtual");
246 void Compile::print_intrinsic_statistics() {
267 void Compile::print_statistics() {
286 Bundle* Compile::node_bundling(const Node *n) {
291 bool Compile::valid_bundle_info(const Node *n) {
296 void Compile::gvn_replace_by(Node* n, Node* nn) {
330 void Compile::identify_useful_nodes(Unique_Node_List &useful) {
354 void Compile::update_dead_node_list(Unique_Node_List &useful) {
367 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) {
383 void Compile::remove_useless_nodes(Unique_Node_List &useful) {
393 "If top is cached in Compile object it is in useful list");
426 int Compile::frame_size_in_words() const {
437 Compile *const _compile;
439 CompileWrapper(Compile* compile);
444 CompileWrapper::CompileWrapper(Compile* compile) : _compile(compile) {
445 // the Compile* pointer is stored in the current ciEnv:
450 assert(compile == Compile::current(), "sanity");
472 void Compile::print_compile_messages() {
508 void Compile::init_scratch_buffer_blob(int const_size) {
523 blob = BufferBlob::create("Compile::scratch_buffer", size);
542 uint Compile::scratch_emit_size(const Node* n) {
596 //------------------------------Compile standard-------------------------------
597 debug_only( int Compile::_debug_idx = 100000; )
599 // Compile a method. entry_bci is -1 for normal compilations and indicates
603 Compile::Compile( ciEnv* ci_env, C2Compiler* compiler, ciMethod* target, int osr_bci, bool subsume_loads, bool do_escape_analysis )
620 _code_buffer("Compile::Fill_buffer"),
881 //------------------------------Compile----------------------------------------
882 // Compile a runtime stub
883 Compile::Compile( ciEnv* ci_env,
909 _code_buffer("Compile::Fill_buffer"),
991 void Compile::print_codes() {
996 void Compile::Init(int aliaslevel) {
1087 void Compile::init_start(StartNode* s) {
1093 StartNode* Compile::start() const {
1106 Node* Compile::immutable_memory() {
1124 void Compile::set_cached_top_node(Node* tn) {
1136 uint Compile::count_live_nodes_by_graph_walk() {
1143 void Compile::print_missing_nodes() {
1202 void Compile::verify_top(Node* tn) const {
1214 void Compile::grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by) {
1229 bool Compile::copy_node_notes_to(Node* dest, Node* source) {
1268 bool Compile::allow_range_check_smearing() const {
1278 const TypePtr *Compile::flatten_alias_type( const TypePtr *tj ) const {
1493 void Compile::AliasType::Init(int i, const TypePtr* at) {
1501 _general_index = Compile::current()->get_alias_index(gt);
1509 void Compile::AliasType::print_on(outputStream* st) {
1532 Compile* C = Compile::current();
1534 for (int idx = Compile::AliasIdxBot; idx < C->num_alias_types(); idx++) {
1543 Compile::AliasCacheEntry* Compile::probe_alias_cache(const TypePtr* adr_type) {
1551 void Compile::grow_alias_types() {
1564 Compile::AliasType* Compile::find_alias_type(const TypePtr* adr_type, bool no_create, ciField* original_field) {
1670 Compile::AliasType* Compile::alias_type(ciField* field) {
1683 bool Compile::have_alias_type(const TypePtr* adr_type) {
1698 bool Compile::must_alias(const TypePtr* adr_type, int alias_idx) {
1716 bool Compile::can_alias(const TypePtr* adr_type, int alias_idx) {
1731 WarmCallInfo* Compile::pop_warm_call() {
1738 int Compile::Inline_Warm() {
1767 void Compile::Finish_Warm() {
1782 void Compile::cleanup_loop_predicates(PhaseIterGVN &igvn) {
1793 void Compile::inline_string_calls(bool parse_time) {
1820 void Compile::inline_incrementally_one(PhaseIterGVN& igvn) {
1851 void Compile::inline_incrementally(PhaseIterGVN& igvn) {
1912 void Compile::Optimize() {
2090 void Compile::Code_Gen() {
2202 void Compile::dump_asm(int *pcs, uint pc_limit) {
2348 void Compile::eliminate_redundant_card_marks(Node* n) {
2394 void Compile::final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc) {
2425 assert( n->in(0) != NULL || alias_idx != Compile::AliasIdxRaw ||
2916 void Compile::final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc ) {
3016 bool Compile::final_graph_reshaping() {
3113 bool Compile::too_many_traps(ciMethod* method,
3138 bool Compile::too_many_traps(Deoptimization::DeoptReason reason,
3161 bool Compile::too_many_recompiles(ciMethod* method,
3210 void Compile::verify_graph_edges(bool no_dead_code) {
3242 // The Compile object keeps track of failure reasons separately from the ciEnv.
3244 // ciEnv and its compilation task and the Compile object. Note that one
3245 // ciEnv might use two Compile objects, if C2Compiler::compile_method decides
3247 // behavior, the Compile's failure reason is quietly copied up to the ciEnv
3249 void Compile::record_failure(const char* reason) {
3260 event.set_compileID(Compile::compile_id());
3271 Compile::TracePhase::TracePhase(const char* name, elapsedTimer* accumulator, bool dolog)
3276 C = Compile::current();
3289 Compile::TracePhase::~TracePhase() {
3291 C = Compile::current();
3305 Compile::current()->print_missing_nodes();
3316 bool Compile::Constant::operator==(const Constant& other) {
3348 int Compile::ConstantTable::qsort_comparator(Constant* a, Constant* b) {
3355 void Compile::ConstantTable::calculate_offsets_and_size() {
3395 void Compile::ConstantTable::emit(CodeBuffer& cb) {
3437 int Compile::ConstantTable::find_offset(Constant& con) const {
3445 void Compile::ConstantTable::add(Constant& con) {
3456 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, BasicType type, jvalue value) {
3457 Block* b = Compile::current()->cfg()->_bbs[n->_idx];
3463 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, MachOper* oper) {
3477 Compile::Constant Compile::ConstantTable::add_jump_table(MachConstantNode* n) {
3480 // as this method is called from Compile::Fill_buffer right before
3489 void Compile::ConstantTable::fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const {
3490 // If called from Compile::scratch_emit_size do nothing.
3491 if (Compile::current()->in_scratch_emit_size()) return;
3512 void Compile::dump_inlining() {
3542 int Compile::cmp_expensive_nodes(Node* n1, Node* n2) {
3555 int Compile::cmp_expensive_nodes(Node** n1p, Node** n2p) {
3562 void Compile::sort_expensive_nodes() {
3568 bool Compile::expensive_nodes_sorted() const {
3577 bool Compile::should_optimize_expensive_nodes(PhaseIterGVN &igvn) {
3610 void Compile::cleanup_expensive_nodes(PhaseIterGVN &igvn) {
3652 void Compile::add_expensive_node(Node * n) {