58 static Node* find_bottom_mem(Node* ctrl, 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); |
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); |
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, |
61 static void test_heap_stable(Node*& ctrl, Node* raw_mem, Node*& heap_stable_ctrl, |
62 PhaseIdealLoop* phase); |
62 PhaseIdealLoop* phase); |
63 static void call_lrb_stub(Node*& ctrl, Node*& val, Node*& result_mem, Node* raw_mem, bool is_native, 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); |
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, |
65 static void fix_null_check(Node* unc, Node* unc_ctrl, Node* new_unc_ctrl, Unique_Node_List& uses, |
66 PhaseIdealLoop* phase); |
66 PhaseIdealLoop* phase); |
67 static void in_cset_fast_test(Node*& ctrl, Node*& not_cset_ctrl, Node* val, Node* raw_mem, 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); |
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); |
69 static void merge_back_to_back_tests(Node* n, PhaseIdealLoop* phase); |
70 static bool identical_backtoback_ifs(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); |
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); |
72 static IfNode* find_unswitching_candidate(const IdealLoopTree *loop, PhaseIdealLoop* phase); |
73 |
73 |
|
74 static Node* get_load_addr(PhaseIdealLoop* phase, VectorSet& visited, Node* lrb); |
74 public: |
75 public: |
75 static bool is_dominator(Node* d_c, Node* n_c, Node* d, Node* n, PhaseIdealLoop* phase); |
76 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 static bool is_dominator_same_ctrl(Node* c, Node* d, Node* n, PhaseIdealLoop* phase); |
77 |
78 |
78 static bool is_gc_state_load(Node* n); |
79 static bool is_gc_state_load(Node* n); |