< prev index next >

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

Print this page

 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 identical_backtoback_ifs(Node *n, PhaseIdealLoop* phase);
 69   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);
 70   static IfNode* find_unswitching_candidate(const IdealLoopTree *loop, PhaseIdealLoop* phase);
 71 
 72   static Node* get_load_addr(PhaseIdealLoop* phase, VectorSet& visited, Node* lrb);
 73 public:
 74   static bool is_dominator(Node* d_c, Node* n_c, Node* d, Node* n, PhaseIdealLoop* phase);
 75   static bool is_dominator_same_ctrl(Node* c, Node* d, Node* n, PhaseIdealLoop* phase);
 76 
 77   static bool is_gc_state_load(Node* n);
 78   static bool is_heap_stable_test(Node* iff);
 79 
 80   static bool expand(Compile* C, PhaseIterGVN& igvn);
 81   static void pin_and_expand(PhaseIdealLoop* phase);
 82   static void optimize_after_expansion(VectorSet& visited, Node_Stack& nstack, Node_List& old_new, PhaseIdealLoop* phase);
 83 
 84 #ifdef ASSERT
 85   static void verify(RootNode* root);
 86 #endif
 87 };

 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 };
< prev index next >