< prev index next >

src/hotspot/share/gc/shenandoah/c2/shenandoahSupport.hpp

Print this page

 46     ShenandoahValue,
 47     ShenandoahOopStore,
 48     ShenandoahNone
 49   };
 50 
 51   static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
 52   static void report_verify_failure(const char* msg, Node* n1 = nullptr, Node* n2 = nullptr);
 53 #endif
 54   static Node* dom_mem(Node* mem, Node* ctrl, int alias, Node*& mem_ctrl, PhaseIdealLoop* phase);
 55   static Node* no_branches(Node* c, Node* dom, bool allow_one_proj, PhaseIdealLoop* phase);
 56   static bool is_gc_state_test(Node* iff, int mask);
 57   static bool has_safepoint_between(Node* start, Node* stop, PhaseIdealLoop *phase);
 58   static Node* find_bottom_mem(Node* ctrl, PhaseIdealLoop* phase);
 59   static void follow_barrier_uses(Node* n, Node* ctrl, Unique_Node_List& uses, PhaseIdealLoop* phase);
 60   static void test_null(Node*& ctrl, Node* val, Node*& null_ctrl, PhaseIdealLoop* phase);
 61   static void test_gc_state(Node*& ctrl, Node* raw_mem, Node*& heap_stable_ctrl,
 62                             PhaseIdealLoop* phase, int flags);
 63   static void call_lrb_stub(Node*& ctrl, Node*& val, Node* load_addr,
 64                             DecoratorSet decorators, PhaseIdealLoop* phase);
 65   static void test_in_cset(Node*& ctrl, Node*& not_cset_ctrl, Node* val, Node* raw_mem, PhaseIdealLoop* phase);
 66   static void move_gc_state_test_out_of_loop(IfNode* iff, PhaseIdealLoop* phase);
 67   static void merge_back_to_back_tests(Node* n, PhaseIdealLoop* phase);
 68   static bool merge_point_safe(Node* region);
 69   static bool identical_backtoback_ifs(Node *n, PhaseIdealLoop* phase);
 70   static void fix_ctrl(Node* barrier, Node* region, const MemoryGraphFixer& fixer, Unique_Node_List& uses, Unique_Node_List& uses_to_ignore, uint last, PhaseIdealLoop* phase);
 71   static IfNode* find_unswitching_candidate(const IdealLoopTree *loop, PhaseIdealLoop* phase);
 72 
 73   static Node* get_load_addr(PhaseIdealLoop* phase, VectorSet& visited, Node* lrb);
 74 public:
 75   static bool is_dominator(Node* d_c, Node* n_c, Node* d, Node* n, PhaseIdealLoop* phase);
 76   static bool is_dominator_same_ctrl(Node* c, Node* d, Node* n, PhaseIdealLoop* phase);
 77 
 78   static bool is_gc_state_load(Node* n);
 79   static bool is_heap_stable_test(Node* iff);
 80 
 81   static bool expand(Compile* C, PhaseIterGVN& igvn);
 82   static void pin_and_expand(PhaseIdealLoop* phase);
 83   static void optimize_after_expansion(VectorSet& visited, Node_Stack& nstack, Node_List& old_new, PhaseIdealLoop* phase);
 84 
 85 #ifdef ASSERT
 86   static void verify(RootNode* root);
 87 #endif
 88 };
 89 
 90 class ShenandoahIUBarrierNode : public Node {
 91 public:
 92   ShenandoahIUBarrierNode(Node* val);
 93 
 94   const Type *bottom_type() const;
 95   const Type* Value(PhaseGVN* phase) const;
 96   Node* Identity(PhaseGVN* phase);
 97 
 98   int Opcode() const;
 99 
100 private:
101   enum { Needed, NotNeeded, MaybeNeeded };
102 
103   static int needed(Node* n);
104   static Node* next(Node* n);
105 };
106 
107 class MemoryGraphFixer : public ResourceObj {
108 private:
109   Node_List _memory_nodes;
110   int _alias;
111   PhaseIdealLoop* _phase;
112   bool _include_lsm;
113 
114   void collect_memory_nodes();
115   Node* get_ctrl(Node* n) const;
116   Node* ctrl_or_self(Node* n) const;
117   bool mem_is_valid(Node* m, Node* c) const;
118   MergeMemNode* allocate_merge_mem(Node* mem, Node* rep_proj, Node* rep_ctrl) const;
119   MergeMemNode* clone_merge_mem(Node* u, Node* mem, Node* rep_proj, Node* rep_ctrl, DUIterator& i) const;
120   void fix_memory_uses(Node* mem, Node* replacement, Node* rep_proj, Node* rep_ctrl) const;
121   bool should_process_phi(Node* phi) const;
122   bool has_mem_phi(Node* region) const;
123 
124 public:
125   MemoryGraphFixer(int alias, bool include_lsm, PhaseIdealLoop* phase) :
126     _alias(alias), _phase(phase), _include_lsm(include_lsm) {

 46     ShenandoahValue,
 47     ShenandoahOopStore,
 48     ShenandoahNone
 49   };
 50 
 51   static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
 52   static void report_verify_failure(const char* msg, Node* n1 = nullptr, Node* n2 = nullptr);
 53 #endif
 54   static Node* dom_mem(Node* mem, Node* ctrl, int alias, Node*& mem_ctrl, PhaseIdealLoop* phase);
 55   static Node* no_branches(Node* c, Node* dom, bool allow_one_proj, PhaseIdealLoop* phase);
 56   static bool is_gc_state_test(Node* iff, int mask);
 57   static bool has_safepoint_between(Node* start, Node* stop, PhaseIdealLoop *phase);
 58   static Node* find_bottom_mem(Node* ctrl, PhaseIdealLoop* phase);
 59   static void follow_barrier_uses(Node* n, Node* ctrl, Unique_Node_List& uses, PhaseIdealLoop* phase);
 60   static void test_null(Node*& ctrl, Node* val, Node*& null_ctrl, PhaseIdealLoop* phase);
 61   static void test_gc_state(Node*& ctrl, Node* raw_mem, Node*& heap_stable_ctrl,
 62                             PhaseIdealLoop* phase, int flags);
 63   static void call_lrb_stub(Node*& ctrl, Node*& val, Node* load_addr,
 64                             DecoratorSet decorators, PhaseIdealLoop* phase);
 65   static void test_in_cset(Node*& ctrl, Node*& not_cset_ctrl, Node* val, Node* raw_mem, PhaseIdealLoop* phase);




 66   static void fix_ctrl(Node* barrier, Node* region, const MemoryGraphFixer& fixer, Unique_Node_List& uses, Unique_Node_List& uses_to_ignore, uint last, PhaseIdealLoop* phase);

 67 
 68   static Node* get_load_addr(PhaseIdealLoop* phase, VectorSet& visited, Node* lrb);
 69 public:
 70   static bool is_dominator(Node* d_c, Node* n_c, Node* d, Node* n, PhaseIdealLoop* phase);
 71   static bool is_dominator_same_ctrl(Node* c, Node* d, Node* n, PhaseIdealLoop* phase);
 72 
 73   static bool is_gc_state_load(Node* n);
 74   static bool is_heap_stable_test(Node* iff);
 75 
 76   static bool expand(Compile* C, PhaseIterGVN& igvn);
 77   static void pin_and_expand(PhaseIdealLoop* phase);

 78 
 79 #ifdef ASSERT
 80   static void verify(RootNode* root);
 81 #endif
 82 };
 83 

















 84 class MemoryGraphFixer : public ResourceObj {
 85 private:
 86   Node_List _memory_nodes;
 87   int _alias;
 88   PhaseIdealLoop* _phase;
 89   bool _include_lsm;
 90 
 91   void collect_memory_nodes();
 92   Node* get_ctrl(Node* n) const;
 93   Node* ctrl_or_self(Node* n) const;
 94   bool mem_is_valid(Node* m, Node* c) const;
 95   MergeMemNode* allocate_merge_mem(Node* mem, Node* rep_proj, Node* rep_ctrl) const;
 96   MergeMemNode* clone_merge_mem(Node* u, Node* mem, Node* rep_proj, Node* rep_ctrl, DUIterator& i) const;
 97   void fix_memory_uses(Node* mem, Node* replacement, Node* rep_proj, Node* rep_ctrl) const;
 98   bool should_process_phi(Node* phi) const;
 99   bool has_mem_phi(Node* region) const;
100 
101 public:
102   MemoryGraphFixer(int alias, bool include_lsm, PhaseIdealLoop* phase) :
103     _alias(alias), _phase(phase), _include_lsm(include_lsm) {
< prev index next >