297 virtual bool flatten_gc_alias_type(const TypePtr*& adr_type) const { return false; } 298 #ifdef ASSERT 299 virtual bool verify_gc_alias_type(const TypePtr* adr_type, int offset) const { return false; } 300 #endif 301 302 virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const { return false; } 303 304 virtual bool escape_add_to_con_graph(ConnectionGraph* conn_graph, PhaseGVN* gvn, Unique_Node_List* delayed_worklist, Node* n, uint opcode) const { return false; } 305 virtual bool escape_add_final_edges(ConnectionGraph* conn_graph, PhaseGVN* gvn, Node* n, uint opcode) const { return false; } 306 virtual bool escape_has_out_with_unsafe_object(Node* n) const { return false; } 307 virtual bool escape_is_barrier_node(Node* n) const { return false; } 308 309 virtual bool matcher_find_shared_visit(Matcher* matcher, Matcher::MStack& mstack, Node* n, uint opcode, bool& mem_op, int& mem_addr_idx) const { return false; }; 310 virtual bool matcher_find_shared_post_visit(Matcher* matcher, Node* n, uint opcode) const { return false; }; 311 virtual bool matcher_is_store_load_barrier(Node* x, uint xop) const { return false; } 312 313 virtual void igvn_add_users_to_worklist(PhaseIterGVN* igvn, Node* use) const {} 314 virtual void ccp_analyze(PhaseCCP* ccp, Unique_Node_List& worklist, Node* use) const {} 315 316 virtual Node* split_if_pre(PhaseIdealLoop* phase, Node* n) const { return NULL; } 317 }; 318 319 #endif // SHARE_GC_SHARED_C2_BARRIERSETC2_HPP | 297 virtual bool flatten_gc_alias_type(const TypePtr*& adr_type) const { return false; } 298 #ifdef ASSERT 299 virtual bool verify_gc_alias_type(const TypePtr* adr_type, int offset) const { return false; } 300 #endif 301 302 virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const { return false; } 303 304 virtual bool escape_add_to_con_graph(ConnectionGraph* conn_graph, PhaseGVN* gvn, Unique_Node_List* delayed_worklist, Node* n, uint opcode) const { return false; } 305 virtual bool escape_add_final_edges(ConnectionGraph* conn_graph, PhaseGVN* gvn, Node* n, uint opcode) const { return false; } 306 virtual bool escape_has_out_with_unsafe_object(Node* n) const { return false; } 307 virtual bool escape_is_barrier_node(Node* n) const { return false; } 308 309 virtual bool matcher_find_shared_visit(Matcher* matcher, Matcher::MStack& mstack, Node* n, uint opcode, bool& mem_op, int& mem_addr_idx) const { return false; }; 310 virtual bool matcher_find_shared_post_visit(Matcher* matcher, Node* n, uint opcode) const { return false; }; 311 virtual bool matcher_is_store_load_barrier(Node* x, uint xop) const { return false; } 312 313 virtual void igvn_add_users_to_worklist(PhaseIterGVN* igvn, Node* use) const {} 314 virtual void ccp_analyze(PhaseCCP* ccp, Unique_Node_List& worklist, Node* use) const {} 315 316 virtual Node* split_if_pre(PhaseIdealLoop* phase, Node* n) const { return NULL; } 317 virtual bool build_loop_late_post(PhaseIdealLoop* phase, Node* n) const { return false; } 318 virtual bool sink_node(PhaseIdealLoop* phase, Node* n, Node* x, Node* x_ctrl, Node* n_ctrl) const { return false; } 319 }; 320 321 #endif // SHARE_GC_SHARED_C2_BARRIERSETC2_HPP |