src/share/vm/opto/macro.hpp
Index Unified diffs Context diffs Sdiffs Wdiffs Patch New Old Previous File Next File 8031320_8u Sdiff src/share/vm/opto

src/share/vm/opto/macro.hpp

Print this page
rev 5968 : 8031320: Use Intel RTM instructions for locks
Summary: Use RTM for inflated locks and stack locks.
Reviewed-by: iveresov, twisti, roland, dcubed


  59     // equivalent to _gvn.transform in GraphKit, Ideal, etc.
  60     _igvn.register_new_node_with_optimizer(n);
  61     return n;
  62   }
  63   void set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr);
  64   Node* make_load( Node* ctl, Node* mem, Node* base, int offset,
  65                    const Type* value_type, BasicType bt);
  66   Node* make_store(Node* ctl, Node* mem, Node* base, int offset,
  67                    Node* value, BasicType bt);
  68 
  69   // projections extracted from a call node
  70   ProjNode *_fallthroughproj;
  71   ProjNode *_fallthroughcatchproj;
  72   ProjNode *_ioproj_fallthrough;
  73   ProjNode *_ioproj_catchall;
  74   ProjNode *_catchallcatchproj;
  75   ProjNode *_memproj_fallthrough;
  76   ProjNode *_memproj_catchall;
  77   ProjNode *_resproj;
  78 


  79 
  80   void expand_allocate(AllocateNode *alloc);
  81   void expand_allocate_array(AllocateArrayNode *alloc);
  82   void expand_allocate_common(AllocateNode* alloc,
  83                               Node* length,
  84                               const TypeFunc* slow_call_type,
  85                               address slow_call_address);
  86   Node *value_from_mem(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc);
  87   Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level);
  88 
  89   bool eliminate_boxing_node(CallStaticJavaNode *boxing);
  90   bool eliminate_allocate_node(AllocateNode *alloc);
  91   bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
  92   bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done);
  93   void process_users_of_allocation(CallNode *alloc);
  94 
  95   void eliminate_card_mark(Node *cm);
  96   void mark_eliminated_box(Node* box, Node* obj);
  97   void mark_eliminated_locking_nodes(AbstractLockNode *alock);
  98   bool eliminate_locking_node(AbstractLockNode *alock);


 101 
 102   int replace_input(Node *use, Node *oldref, Node *newref);
 103   void copy_call_debug_info(CallNode *oldcall, CallNode * newcall);
 104   Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
 105   void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
 106   CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call,
 107                        const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1);
 108   void extract_call_projections(CallNode *call);
 109 
 110   Node* initialize_object(AllocateNode* alloc,
 111                           Node* control, Node* rawmem, Node* object,
 112                           Node* klass_node, Node* length,
 113                           Node* size_in_bytes);
 114 
 115   Node* prefetch_allocation(Node* i_o,
 116                             Node*& needgc_false, Node*& contended_phi_rawmem,
 117                             Node* old_eden_top, Node* new_eden_top,
 118                             Node* length);
 119 
 120 public:
 121   PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn) {
 122     _igvn.set_delay_transform(true);
 123   }
 124   void eliminate_macro_nodes();
 125   bool expand_macro_nodes();
 126 
 127 };
 128 
 129 #endif // SHARE_VM_OPTO_MACRO_HPP


  59     // equivalent to _gvn.transform in GraphKit, Ideal, etc.
  60     _igvn.register_new_node_with_optimizer(n);
  61     return n;
  62   }
  63   void set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr);
  64   Node* make_load( Node* ctl, Node* mem, Node* base, int offset,
  65                    const Type* value_type, BasicType bt);
  66   Node* make_store(Node* ctl, Node* mem, Node* base, int offset,
  67                    Node* value, BasicType bt);
  68 
  69   // projections extracted from a call node
  70   ProjNode *_fallthroughproj;
  71   ProjNode *_fallthroughcatchproj;
  72   ProjNode *_ioproj_fallthrough;
  73   ProjNode *_ioproj_catchall;
  74   ProjNode *_catchallcatchproj;
  75   ProjNode *_memproj_fallthrough;
  76   ProjNode *_memproj_catchall;
  77   ProjNode *_resproj;
  78 
  79   // Additional data collected during macro expansion
  80   bool _has_locks;
  81 
  82   void expand_allocate(AllocateNode *alloc);
  83   void expand_allocate_array(AllocateArrayNode *alloc);
  84   void expand_allocate_common(AllocateNode* alloc,
  85                               Node* length,
  86                               const TypeFunc* slow_call_type,
  87                               address slow_call_address);
  88   Node *value_from_mem(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc);
  89   Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level);
  90 
  91   bool eliminate_boxing_node(CallStaticJavaNode *boxing);
  92   bool eliminate_allocate_node(AllocateNode *alloc);
  93   bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
  94   bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done);
  95   void process_users_of_allocation(CallNode *alloc);
  96 
  97   void eliminate_card_mark(Node *cm);
  98   void mark_eliminated_box(Node* box, Node* obj);
  99   void mark_eliminated_locking_nodes(AbstractLockNode *alock);
 100   bool eliminate_locking_node(AbstractLockNode *alock);


 103 
 104   int replace_input(Node *use, Node *oldref, Node *newref);
 105   void copy_call_debug_info(CallNode *oldcall, CallNode * newcall);
 106   Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
 107   void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
 108   CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call,
 109                        const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1);
 110   void extract_call_projections(CallNode *call);
 111 
 112   Node* initialize_object(AllocateNode* alloc,
 113                           Node* control, Node* rawmem, Node* object,
 114                           Node* klass_node, Node* length,
 115                           Node* size_in_bytes);
 116 
 117   Node* prefetch_allocation(Node* i_o,
 118                             Node*& needgc_false, Node*& contended_phi_rawmem,
 119                             Node* old_eden_top, Node* new_eden_top,
 120                             Node* length);
 121 
 122 public:
 123   PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn), _has_locks(false) {
 124     _igvn.set_delay_transform(true);
 125   }
 126   void eliminate_macro_nodes();
 127   bool expand_macro_nodes();
 128 
 129 };
 130 
 131 #endif // SHARE_VM_OPTO_MACRO_HPP
src/share/vm/opto/macro.hpp
Index Unified diffs Context diffs Sdiffs Wdiffs Patch New Old Previous File Next File