< prev index next >

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

Print this page




  43     ShenandoahStore,
  44     ShenandoahValue,
  45     ShenandoahOopStore,
  46     ShenandoahNone
  47   };
  48 
  49   static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
  50   static void report_verify_failure(const char* msg, Node* n1 = NULL, Node* n2 = NULL);
  51   static void verify_raw_mem(RootNode* root);
  52 #endif
  53   static Node* dom_mem(Node* mem, Node* ctrl, int alias, Node*& mem_ctrl, PhaseIdealLoop* phase);
  54   static Node* no_branches(Node* c, Node* dom, bool allow_one_proj, PhaseIdealLoop* phase);
  55   static bool is_heap_state_test(Node* iff, int mask);
  56   static bool try_common_gc_state_load(Node *n, PhaseIdealLoop *phase);
  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_heap_stable(Node*& ctrl, Node* raw_mem, Node*& heap_stable_ctrl,
  62                                PhaseIdealLoop* phase);
  63   static void call_lrb_stub(Node*& ctrl, Node*& val, Node*& result_mem, Node* raw_mem, bool is_native, PhaseIdealLoop* phase);
  64   static Node* clone_null_check(Node*& c, Node* val, Node* unc_ctrl, PhaseIdealLoop* phase);
  65   static void fix_null_check(Node* unc, Node* unc_ctrl, Node* new_unc_ctrl, Unique_Node_List& uses,
  66                              PhaseIdealLoop* phase);
  67   static void in_cset_fast_test(Node*& ctrl, Node*& not_cset_ctrl, Node* val, Node* raw_mem, PhaseIdealLoop* phase);
  68   static void move_heap_stable_test_out_of_loop(IfNode* iff, PhaseIdealLoop* phase);
  69   static void merge_back_to_back_tests(Node* n, PhaseIdealLoop* phase);
  70   static bool identical_backtoback_ifs(Node *n, PhaseIdealLoop* phase);
  71   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);
  72   static IfNode* find_unswitching_candidate(const IdealLoopTree *loop, PhaseIdealLoop* phase);
  73 

  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 ShenandoahEnqueueBarrierNode : public Node {
  91 public:
  92   ShenandoahEnqueueBarrierNode(Node* val);
  93 




  43     ShenandoahStore,
  44     ShenandoahValue,
  45     ShenandoahOopStore,
  46     ShenandoahNone
  47   };
  48 
  49   static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
  50   static void report_verify_failure(const char* msg, Node* n1 = NULL, Node* n2 = NULL);
  51   static void verify_raw_mem(RootNode* root);
  52 #endif
  53   static Node* dom_mem(Node* mem, Node* ctrl, int alias, Node*& mem_ctrl, PhaseIdealLoop* phase);
  54   static Node* no_branches(Node* c, Node* dom, bool allow_one_proj, PhaseIdealLoop* phase);
  55   static bool is_heap_state_test(Node* iff, int mask);
  56   static bool try_common_gc_state_load(Node *n, PhaseIdealLoop *phase);
  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_heap_stable(Node*& ctrl, Node* raw_mem, Node*& heap_stable_ctrl,
  62                                PhaseIdealLoop* phase);
  63   static void call_lrb_stub(Node*& ctrl, Node*& val, Node* load_addr, Node*& result_mem, Node* raw_mem, bool is_native, PhaseIdealLoop* phase);
  64   static Node* clone_null_check(Node*& c, Node* val, Node* unc_ctrl, PhaseIdealLoop* phase);
  65   static void fix_null_check(Node* unc, Node* unc_ctrl, Node* new_unc_ctrl, Unique_Node_List& uses,
  66                              PhaseIdealLoop* phase);
  67   static void in_cset_fast_test(Node*& ctrl, Node*& not_cset_ctrl, Node* val, Node* raw_mem, PhaseIdealLoop* phase);
  68   static void move_heap_stable_test_out_of_loop(IfNode* iff, PhaseIdealLoop* phase);
  69   static void merge_back_to_back_tests(Node* n, PhaseIdealLoop* phase);
  70   static bool identical_backtoback_ifs(Node *n, PhaseIdealLoop* phase);
  71   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);
  72   static IfNode* find_unswitching_candidate(const IdealLoopTree *loop, PhaseIdealLoop* phase);
  73 
  74   static Node* get_load_addr(PhaseIdealLoop* phase, VectorSet& visited, Node* lrb);
  75 public:
  76   static bool is_dominator(Node* d_c, Node* n_c, Node* d, Node* n, PhaseIdealLoop* phase);
  77   static bool is_dominator_same_ctrl(Node* c, Node* d, Node* n, PhaseIdealLoop* phase);
  78 
  79   static bool is_gc_state_load(Node* n);
  80   static bool is_heap_stable_test(Node* iff);
  81 
  82   static bool expand(Compile* C, PhaseIterGVN& igvn);
  83   static void pin_and_expand(PhaseIdealLoop* phase);
  84   static void optimize_after_expansion(VectorSet& visited, Node_Stack& nstack, Node_List& old_new, PhaseIdealLoop* phase);
  85 
  86 #ifdef ASSERT
  87   static void verify(RootNode* root);
  88 #endif
  89 };
  90 
  91 class ShenandoahEnqueueBarrierNode : public Node {
  92 public:
  93   ShenandoahEnqueueBarrierNode(Node* val);
  94 


< prev index next >