306 virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const { return false; } |
306 virtual bool final_graph_reshaping(Compile* compile, Node* n, uint opcode) const { return false; } |
307 |
307 |
308 virtual bool escape_add_to_con_graph(ConnectionGraph* conn_graph, PhaseGVN* gvn, Unique_Node_List* delayed_worklist, Node* n, uint opcode) const { return false; } |
308 virtual bool escape_add_to_con_graph(ConnectionGraph* conn_graph, PhaseGVN* gvn, Unique_Node_List* delayed_worklist, Node* n, uint opcode) const { return false; } |
309 virtual bool escape_add_final_edges(ConnectionGraph* conn_graph, PhaseGVN* gvn, Node* n, uint opcode) const { return false; } |
309 virtual bool escape_add_final_edges(ConnectionGraph* conn_graph, PhaseGVN* gvn, Node* n, uint opcode) const { return false; } |
310 virtual bool escape_has_out_with_unsafe_object(Node* n) const { return false; } |
310 virtual bool escape_has_out_with_unsafe_object(Node* n) const { return false; } |
311 virtual bool escape_is_barrier_node(Node* n) const { return false; } |
|
312 |
311 |
313 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; }; |
312 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; }; |
314 virtual bool matcher_find_shared_post_visit(Matcher* matcher, Node* n, uint opcode) const { return false; }; |
313 virtual bool matcher_find_shared_post_visit(Matcher* matcher, Node* n, uint opcode) const { return false; }; |
315 virtual bool matcher_is_store_load_barrier(Node* x, uint xop) const { return false; } |
314 virtual bool matcher_is_store_load_barrier(Node* x, uint xop) const { return false; } |
316 |
315 |