comparison src/share/vm/opto/phaseX.hpp @ 14909:4ca6dc0799b6

Backout jdk9 merge
author Gilles Duboscq <duboscq@ssw.jku.at>
date Tue, 01 Apr 2014 13:57:07 +0200
parents 5ec7dace41a6
children 89152779163c
comparison
equal deleted inserted replaced
14908:8db6e76cb658 14909:4ca6dc0799b6
1 /* 1 /*
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 * 4 *
5 * This code is free software; you can redistribute it and/or modify it 5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as 6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. 7 * published by the Free Software Foundation.
90 assert(table_index < _max, "Must be within table"); 90 assert(table_index < _max, "Must be within table");
91 return _table[table_index]; 91 return _table[table_index];
92 } 92 }
93 93
94 void remove_useless_nodes(VectorSet &useful); // replace with sentinel 94 void remove_useless_nodes(VectorSet &useful); // replace with sentinel
95 void replace_with(NodeHash* nh); 95 void replace_with(NodeHash* nh);
96 void check_no_speculative_types(); // Check no speculative part for type nodes in table
97 96
98 Node *sentinel() { return _sentinel; } 97 Node *sentinel() { return _sentinel; }
99 98
100 #ifndef PRODUCT 99 #ifndef PRODUCT
101 Node *find_index(uint idx); // For debugging 100 Node *find_index(uint idx); // For debugging
500 // Create a new if below new_entry for the predicate to be cloned 499 // Create a new if below new_entry for the predicate to be cloned
501 ProjNode* create_new_if_for_predicate(ProjNode* cont_proj, Node* new_entry, 500 ProjNode* create_new_if_for_predicate(ProjNode* cont_proj, Node* new_entry,
502 Deoptimization::DeoptReason reason); 501 Deoptimization::DeoptReason reason);
503 502
504 void remove_speculative_types(); 503 void remove_speculative_types();
505 void check_no_speculative_types() {
506 _table.check_no_speculative_types();
507 }
508 504
509 #ifndef PRODUCT 505 #ifndef PRODUCT
510 protected: 506 protected:
511 // Sub-quadratic implementation of VerifyIterativeGVN. 507 // Sub-quadratic implementation of VerifyIterativeGVN.
512 julong _verify_counter; 508 julong _verify_counter;