41 #ifdef ASSERT
42 enum verify_type {
43 ShenandoahLoad,
44 ShenandoahStore,
45 ShenandoahValue,
46 ShenandoahOopStore,
47 ShenandoahNone
48 };
49
50 static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
51 static void report_verify_failure(const char* msg, Node* n1 = NULL, Node* n2 = NULL);
52 static void verify_raw_mem(RootNode* root);
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_heap_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_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
95 const Type *bottom_type() const;
96 const Type* Value(PhaseGVN* phase) const;
97 Node* Identity(PhaseGVN* phase);
98
99 int Opcode() const;
100
101 private:
102 enum { Needed, NotNeeded, MaybeNeeded };
103
104 static int needed(Node* n);
105 static Node* next(Node* n);
106 };
107
108 class MemoryGraphFixer : public ResourceObj {
109 private:
110 Node_List _memory_nodes;
111 int _alias;
112 PhaseIdealLoop* _phase;
113 bool _include_lsm;
114
115 void collect_memory_nodes();
116 Node* get_ctrl(Node* n) const;
117 Node* ctrl_or_self(Node* n) const;
118 bool mem_is_valid(Node* m, Node* c) const;
119 MergeMemNode* allocate_merge_mem(Node* mem, Node* rep_proj, Node* rep_ctrl) const;
|
41 #ifdef ASSERT
42 enum verify_type {
43 ShenandoahLoad,
44 ShenandoahStore,
45 ShenandoahValue,
46 ShenandoahOopStore,
47 ShenandoahNone
48 };
49
50 static bool verify_helper(Node* in, Node_Stack& phis, VectorSet& visited, verify_type t, bool trace, Unique_Node_List& barriers_used);
51 static void report_verify_failure(const char* msg, Node* n1 = NULL, Node* n2 = NULL);
52 static void verify_raw_mem(RootNode* root);
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_heap_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_heap_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, 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
95 const Type *bottom_type() const;
96 const Type* Value(PhaseGVN* phase) const;
97 Node* Identity(PhaseGVN* phase);
98
99 int Opcode() const;
100 bool can_eliminate(PhaseIdealLoop* phase);
101 bool is_redundant();
102
103 private:
104 enum { Needed, NotNeeded, MaybeNeeded };
105
106 static int needed(Node* n);
107 static Node* next(Node* n);
108 };
109
110 class MemoryGraphFixer : public ResourceObj {
111 private:
112 Node_List _memory_nodes;
113 int _alias;
114 PhaseIdealLoop* _phase;
115 bool _include_lsm;
116
117 void collect_memory_nodes();
118 Node* get_ctrl(Node* n) const;
119 Node* ctrl_or_self(Node* n) const;
120 bool mem_is_valid(Node* m, Node* c) const;
121 MergeMemNode* allocate_merge_mem(Node* mem, Node* rep_proj, Node* rep_ctrl) const;
|