192 virtual void* create_barrier_state(Arena* comp_arena) const;
193 virtual bool has_load_barriers() const { return true; }
194 virtual bool is_gc_barrier_node(Node* node) const;
195 virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const { }
196 virtual void eliminate_useless_gc_barriers(Unique_Node_List &useful, Compile* C) const;
197 virtual void add_users_to_worklist(Unique_Node_List* worklist) const;
198 virtual void enqueue_useful_gc_barrier(PhaseIterGVN* igvn, Node* node) const;
199 virtual void register_potential_barrier_node(Node* node) const;
200 virtual void unregister_potential_barrier_node(Node* node) const;
201 virtual bool array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone, ArrayCopyPhase phase) const;
202 virtual Node* step_over_gc_barrier(Node* c) const;
203 // If the BarrierSetC2 state has kept macro nodes in its compilation unit state to be
204 // expanded later, then now is the time to do so.
205 virtual bool expand_macro_nodes(PhaseMacroExpand* macro) const;
206
207 static void find_dominating_barriers(PhaseIterGVN& igvn);
208 static void loop_optimize_gc_barrier(PhaseIdealLoop* phase, Node* node, bool last_round);
209
210 virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const;
211
212 #ifdef ASSERT
213 virtual void verify_gc_barriers(Compile* compile, CompilePhase phase) const;
214 #endif
215 };
216
217 #endif // SHARE_GC_Z_C2_ZBARRIERSETC2_HPP
|
192 virtual void* create_barrier_state(Arena* comp_arena) const;
193 virtual bool has_load_barriers() const { return true; }
194 virtual bool is_gc_barrier_node(Node* node) const;
195 virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const { }
196 virtual void eliminate_useless_gc_barriers(Unique_Node_List &useful, Compile* C) const;
197 virtual void add_users_to_worklist(Unique_Node_List* worklist) const;
198 virtual void enqueue_useful_gc_barrier(PhaseIterGVN* igvn, Node* node) const;
199 virtual void register_potential_barrier_node(Node* node) const;
200 virtual void unregister_potential_barrier_node(Node* node) const;
201 virtual bool array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone, ArrayCopyPhase phase) const;
202 virtual Node* step_over_gc_barrier(Node* c) const;
203 // If the BarrierSetC2 state has kept macro nodes in its compilation unit state to be
204 // expanded later, then now is the time to do so.
205 virtual bool expand_macro_nodes(PhaseMacroExpand* macro) const;
206
207 static void find_dominating_barriers(PhaseIterGVN& igvn);
208 static void loop_optimize_gc_barrier(PhaseIdealLoop* phase, Node* node, bool last_round);
209
210 virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const;
211
212 virtual bool matcher_find_shared_visit(Matcher* matcher, Matcher::MStack& mstack, Node* n, uint opcode, bool& mem_op, int& mem_addr_idx) const;
213
214 #ifdef ASSERT
215 virtual void verify_gc_barriers(Compile* compile, CompilePhase phase) const;
216 #endif
217 };
218
219 #endif // SHARE_GC_Z_C2_ZBARRIERSETC2_HPP
|