Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/prims/methodComparator.cpp@8033953d67ff (annotated)

src/share/vm/prims/methodComparator.cpp

Fri, 11 Mar 2011 22:34:57 -0800

author
jrose
date
Fri, 11 Mar 2011 22:34:57 -0800
changeset 2639
8033953d67ff
parent 2497
3582bf76420e
child 4037
da91efe96a93
permissions
-rw-r--r--

7012648: move JSR 292 to package java.lang.invoke and adjust names
Summary: package and class renaming only; delete unused methods and classes
Reviewed-by: twisti

duke@435 1 /*
never@2462 2 * Copyright (c) 2000, 2011, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "oops/oop.inline.hpp"
coleenp@2497 27 #include "oops/symbol.hpp"
stefank@2314 28 #include "prims/jvmtiRedefineClassesTrace.hpp"
stefank@2314 29 #include "prims/methodComparator.hpp"
stefank@2314 30 #include "runtime/handles.inline.hpp"
stefank@2314 31 #include "utilities/globalDefinitions.hpp"
duke@435 32
duke@435 33 BytecodeStream *MethodComparator::_s_old;
duke@435 34 BytecodeStream *MethodComparator::_s_new;
duke@435 35 constantPoolOop MethodComparator::_old_cp;
duke@435 36 constantPoolOop MethodComparator::_new_cp;
duke@435 37 BciMap *MethodComparator::_bci_map;
duke@435 38 bool MethodComparator::_switchable_test;
duke@435 39 GrowableArray<int> *MethodComparator::_fwd_jmps;
duke@435 40
duke@435 41 bool MethodComparator::methods_EMCP(methodOop old_method, methodOop new_method) {
duke@435 42 if (old_method->code_size() != new_method->code_size())
duke@435 43 return false;
duke@435 44 if (check_stack_and_locals_size(old_method, new_method) != 0) {
duke@435 45 // RC_TRACE macro has an embedded ResourceMark
duke@435 46 RC_TRACE(0x00800000, ("Methods %s non-comparable with diagnosis %d",
duke@435 47 old_method->name()->as_C_string(),
duke@435 48 check_stack_and_locals_size(old_method, new_method)));
duke@435 49 return false;
duke@435 50 }
duke@435 51
duke@435 52 _old_cp = old_method->constants();
duke@435 53 _new_cp = new_method->constants();
duke@435 54 BytecodeStream s_old(old_method);
duke@435 55 BytecodeStream s_new(new_method);
duke@435 56 _s_old = &s_old;
duke@435 57 _s_new = &s_new;
duke@435 58 _switchable_test = false;
duke@435 59 Bytecodes::Code c_old, c_new;
duke@435 60
duke@435 61 while ((c_old = s_old.next()) >= 0) {
duke@435 62 if ((c_new = s_new.next()) < 0 || c_old != c_new)
duke@435 63 return false;
duke@435 64
duke@435 65 if (! args_same(c_old, c_new))
duke@435 66 return false;
duke@435 67 }
duke@435 68 return true;
duke@435 69 }
duke@435 70
duke@435 71
duke@435 72 bool MethodComparator::methods_switchable(methodOop old_method, methodOop new_method,
duke@435 73 BciMap &bci_map) {
duke@435 74 if (old_method->code_size() > new_method->code_size())
duke@435 75 // Something has definitely been deleted in the new method, compared to the old one.
duke@435 76 return false;
duke@435 77
duke@435 78 if (! check_stack_and_locals_size(old_method, new_method))
duke@435 79 return false;
duke@435 80
duke@435 81 _old_cp = old_method->constants();
duke@435 82 _new_cp = new_method->constants();
duke@435 83 BytecodeStream s_old(old_method);
duke@435 84 BytecodeStream s_new(new_method);
duke@435 85 _s_old = &s_old;
duke@435 86 _s_new = &s_new;
duke@435 87 _bci_map = &bci_map;
duke@435 88 _switchable_test = true;
duke@435 89 GrowableArray<int> fwd_jmps(16);
duke@435 90 _fwd_jmps = &fwd_jmps;
duke@435 91 Bytecodes::Code c_old, c_new;
duke@435 92
duke@435 93 while ((c_old = s_old.next()) >= 0) {
duke@435 94 if ((c_new = s_new.next()) < 0)
duke@435 95 return false;
duke@435 96 if (! (c_old == c_new && args_same(c_old, c_new))) {
duke@435 97 int old_bci = s_old.bci();
duke@435 98 int new_st_bci = s_new.bci();
duke@435 99 bool found_match = false;
duke@435 100 do {
duke@435 101 c_new = s_new.next();
duke@435 102 if (c_new == c_old && args_same(c_old, c_new)) {
duke@435 103 found_match = true;
duke@435 104 break;
duke@435 105 }
duke@435 106 } while (c_new >= 0);
duke@435 107 if (! found_match)
duke@435 108 return false;
duke@435 109 int new_end_bci = s_new.bci();
duke@435 110 bci_map.store_fragment_location(old_bci, new_st_bci, new_end_bci);
duke@435 111 }
duke@435 112 }
duke@435 113
duke@435 114 // Now we can test all forward jumps
duke@435 115 for (int i = 0; i < fwd_jmps.length() / 2; i++) {
duke@435 116 if (! bci_map.old_and_new_locations_same(fwd_jmps.at(i*2), fwd_jmps.at(i*2+1))) {
duke@435 117 RC_TRACE(0x00800000,
duke@435 118 ("Fwd jump miss: old dest = %d, calc new dest = %d, act new dest = %d",
duke@435 119 fwd_jmps.at(i*2), bci_map.new_bci_for_old(fwd_jmps.at(i*2)),
duke@435 120 fwd_jmps.at(i*2+1)));
duke@435 121 return false;
duke@435 122 }
duke@435 123 }
duke@435 124
duke@435 125 return true;
duke@435 126 }
duke@435 127
duke@435 128
duke@435 129 bool MethodComparator::args_same(Bytecodes::Code c_old, Bytecodes::Code c_new) {
duke@435 130 // BytecodeStream returns the correct standard Java bytecodes for various "fast"
duke@435 131 // bytecode versions, so we don't have to bother about them here..
duke@435 132 switch (c_old) {
duke@435 133 case Bytecodes::_new : // fall through
duke@435 134 case Bytecodes::_anewarray : // fall through
duke@435 135 case Bytecodes::_multianewarray : // fall through
duke@435 136 case Bytecodes::_checkcast : // fall through
duke@435 137 case Bytecodes::_instanceof : {
jrose@1920 138 u2 cpi_old = _s_old->get_index_u2();
jrose@1920 139 u2 cpi_new = _s_new->get_index_u2();
duke@435 140 if ((_old_cp->klass_at_noresolve(cpi_old) != _new_cp->klass_at_noresolve(cpi_new)))
duke@435 141 return false;
duke@435 142 if (c_old == Bytecodes::_multianewarray &&
duke@435 143 *(jbyte*)(_s_old->bcp() + 3) != *(jbyte*)(_s_new->bcp() + 3))
duke@435 144 return false;
duke@435 145 break;
duke@435 146 }
duke@435 147
duke@435 148 case Bytecodes::_getstatic : // fall through
duke@435 149 case Bytecodes::_putstatic : // fall through
duke@435 150 case Bytecodes::_getfield : // fall through
duke@435 151 case Bytecodes::_putfield : // fall through
duke@435 152 case Bytecodes::_invokevirtual : // fall through
duke@435 153 case Bytecodes::_invokespecial : // fall through
duke@435 154 case Bytecodes::_invokestatic : // fall through
duke@435 155 case Bytecodes::_invokeinterface : {
jrose@2268 156 int cpci_old = _s_old->get_index_u2_cpcache();
jrose@2268 157 int cpci_new = _s_new->get_index_u2_cpcache();
duke@435 158 // Check if the names of classes, field/method names and signatures at these indexes
duke@435 159 // are the same. Indices which are really into constantpool cache (rather than constant
duke@435 160 // pool itself) are accepted by the constantpool query routines below.
duke@435 161 if ((_old_cp->klass_ref_at_noresolve(cpci_old) != _new_cp->klass_ref_at_noresolve(cpci_new)) ||
duke@435 162 (_old_cp->name_ref_at(cpci_old) != _new_cp->name_ref_at(cpci_new)) ||
duke@435 163 (_old_cp->signature_ref_at(cpci_old) != _new_cp->signature_ref_at(cpci_new)))
duke@435 164 return false;
duke@435 165 break;
duke@435 166 }
jrose@2268 167 case Bytecodes::_invokedynamic: {
jrose@2268 168 int cpci_old = _s_old->get_index_u4();
jrose@2268 169 int cpci_new = _s_new->get_index_u4();
jrose@2268 170 // Check if the names of classes, field/method names and signatures at these indexes
jrose@2268 171 // are the same. Indices which are really into constantpool cache (rather than constant
jrose@2268 172 // pool itself) are accepted by the constantpool query routines below.
jrose@2268 173 if ((_old_cp->name_ref_at(cpci_old) != _new_cp->name_ref_at(cpci_new)) ||
jrose@2268 174 (_old_cp->signature_ref_at(cpci_old) != _new_cp->signature_ref_at(cpci_new)))
jrose@2268 175 return false;
jrose@2268 176 int cpi_old = _old_cp->cache()->main_entry_at(cpci_old)->constant_pool_index();
jrose@2268 177 int cpi_new = _new_cp->cache()->main_entry_at(cpci_new)->constant_pool_index();
jrose@2268 178 int bsm_old = _old_cp->invoke_dynamic_bootstrap_method_ref_index_at(cpi_old);
jrose@2268 179 int bsm_new = _new_cp->invoke_dynamic_bootstrap_method_ref_index_at(cpi_new);
jrose@2268 180 if (!pool_constants_same(bsm_old, bsm_new))
jrose@2268 181 return false;
jrose@2268 182 int cnt_old = _old_cp->invoke_dynamic_argument_count_at(cpi_old);
jrose@2268 183 int cnt_new = _new_cp->invoke_dynamic_argument_count_at(cpi_new);
jrose@2268 184 if (cnt_old != cnt_new)
jrose@2268 185 return false;
jrose@2268 186 for (int arg_i = 0; arg_i < cnt_old; arg_i++) {
jrose@2268 187 int idx_old = _old_cp->invoke_dynamic_argument_index_at(cpi_old, arg_i);
jrose@2268 188 int idx_new = _new_cp->invoke_dynamic_argument_index_at(cpi_new, arg_i);
jrose@2268 189 if (!pool_constants_same(idx_old, idx_new))
jrose@2268 190 return false;
jrose@2268 191 }
jrose@2268 192 break;
jrose@2268 193 }
duke@435 194
duke@435 195 case Bytecodes::_ldc : // fall through
duke@435 196 case Bytecodes::_ldc_w : {
never@2462 197 Bytecode_loadconstant ldc_old(_s_old->method(), _s_old->bci());
never@2462 198 Bytecode_loadconstant ldc_new(_s_new->method(), _s_new->bci());
never@2462 199 int cpi_old = ldc_old.pool_index();
never@2462 200 int cpi_new = ldc_new.pool_index();
jrose@2268 201 if (!pool_constants_same(cpi_old, cpi_new))
jrose@2268 202 return false;
duke@435 203 break;
duke@435 204 }
duke@435 205
duke@435 206 case Bytecodes::_ldc2_w : {
jrose@1920 207 u2 cpi_old = _s_old->get_index_u2();
jrose@1920 208 u2 cpi_new = _s_new->get_index_u2();
duke@435 209 constantTag tag_old = _old_cp->tag_at(cpi_old);
duke@435 210 constantTag tag_new = _new_cp->tag_at(cpi_new);
duke@435 211 if (tag_old.value() != tag_new.value())
duke@435 212 return false;
duke@435 213 if (tag_old.is_long()) {
duke@435 214 if (_old_cp->long_at(cpi_old) != _new_cp->long_at(cpi_new))
duke@435 215 return false;
duke@435 216 } else {
jrose@1929 217 // Use jlong_cast to compare the bits rather than numerical values.
jrose@1929 218 // This makes a difference for NaN constants.
jrose@1929 219 if (jlong_cast(_old_cp->double_at(cpi_old)) != jlong_cast(_new_cp->double_at(cpi_new)))
duke@435 220 return false;
duke@435 221 }
duke@435 222 break;
duke@435 223 }
duke@435 224
duke@435 225 case Bytecodes::_bipush :
duke@435 226 if (_s_old->bcp()[1] != _s_new->bcp()[1])
duke@435 227 return false;
duke@435 228 break;
duke@435 229
duke@435 230 case Bytecodes::_sipush :
jrose@1920 231 if (_s_old->get_index_u2() != _s_new->get_index_u2())
duke@435 232 return false;
duke@435 233 break;
duke@435 234
duke@435 235 case Bytecodes::_aload : // fall through
duke@435 236 case Bytecodes::_astore : // fall through
duke@435 237 case Bytecodes::_dload : // fall through
duke@435 238 case Bytecodes::_dstore : // fall through
duke@435 239 case Bytecodes::_fload : // fall through
duke@435 240 case Bytecodes::_fstore : // fall through
duke@435 241 case Bytecodes::_iload : // fall through
duke@435 242 case Bytecodes::_istore : // fall through
duke@435 243 case Bytecodes::_lload : // fall through
duke@435 244 case Bytecodes::_lstore : // fall through
duke@435 245 case Bytecodes::_ret :
duke@435 246 if (_s_old->is_wide() != _s_new->is_wide())
duke@435 247 return false;
duke@435 248 if (_s_old->get_index() != _s_new->get_index())
duke@435 249 return false;
duke@435 250 break;
duke@435 251
duke@435 252 case Bytecodes::_goto : // fall through
duke@435 253 case Bytecodes::_if_acmpeq : // fall through
duke@435 254 case Bytecodes::_if_acmpne : // fall through
duke@435 255 case Bytecodes::_if_icmpeq : // fall through
duke@435 256 case Bytecodes::_if_icmpne : // fall through
duke@435 257 case Bytecodes::_if_icmplt : // fall through
duke@435 258 case Bytecodes::_if_icmpge : // fall through
duke@435 259 case Bytecodes::_if_icmpgt : // fall through
duke@435 260 case Bytecodes::_if_icmple : // fall through
duke@435 261 case Bytecodes::_ifeq : // fall through
duke@435 262 case Bytecodes::_ifne : // fall through
duke@435 263 case Bytecodes::_iflt : // fall through
duke@435 264 case Bytecodes::_ifge : // fall through
duke@435 265 case Bytecodes::_ifgt : // fall through
duke@435 266 case Bytecodes::_ifle : // fall through
duke@435 267 case Bytecodes::_ifnonnull : // fall through
duke@435 268 case Bytecodes::_ifnull : // fall through
duke@435 269 case Bytecodes::_jsr : {
never@2462 270 int old_ofs = _s_old->bytecode().get_offset_s2(c_old);
never@2462 271 int new_ofs = _s_new->bytecode().get_offset_s2(c_new);
duke@435 272 if (_switchable_test) {
duke@435 273 int old_dest = _s_old->bci() + old_ofs;
duke@435 274 int new_dest = _s_new->bci() + new_ofs;
duke@435 275 if (old_ofs < 0 && new_ofs < 0) {
duke@435 276 if (! _bci_map->old_and_new_locations_same(old_dest, new_dest))
duke@435 277 return false;
duke@435 278 } else if (old_ofs > 0 && new_ofs > 0) {
duke@435 279 _fwd_jmps->append(old_dest);
duke@435 280 _fwd_jmps->append(new_dest);
duke@435 281 } else {
duke@435 282 return false;
duke@435 283 }
duke@435 284 } else {
duke@435 285 if (old_ofs != new_ofs)
duke@435 286 return false;
duke@435 287 }
duke@435 288 break;
duke@435 289 }
duke@435 290
duke@435 291 case Bytecodes::_iinc :
duke@435 292 if (_s_old->is_wide() != _s_new->is_wide())
duke@435 293 return false;
duke@435 294 if (! _s_old->is_wide()) {
jrose@1920 295 // We could use get_index_u1 and get_constant_u1, but it's simpler to grab both bytes at once:
jrose@1920 296 if (Bytes::get_Java_u2(_s_old->bcp() + 1) != Bytes::get_Java_u2(_s_new->bcp() + 1))
duke@435 297 return false;
duke@435 298 } else {
jrose@1920 299 // We could use get_index_u2 and get_constant_u2, but it's simpler to grab all four bytes at once:
duke@435 300 if (Bytes::get_Java_u4(_s_old->bcp() + 1) != Bytes::get_Java_u4(_s_new->bcp() + 1))
duke@435 301 return false;
duke@435 302 }
duke@435 303 break;
duke@435 304
duke@435 305 case Bytecodes::_goto_w : // fall through
duke@435 306 case Bytecodes::_jsr_w : {
never@2462 307 int old_ofs = _s_old->bytecode().get_offset_s4(c_old);
never@2462 308 int new_ofs = _s_new->bytecode().get_offset_s4(c_new);
duke@435 309 if (_switchable_test) {
duke@435 310 int old_dest = _s_old->bci() + old_ofs;
duke@435 311 int new_dest = _s_new->bci() + new_ofs;
duke@435 312 if (old_ofs < 0 && new_ofs < 0) {
duke@435 313 if (! _bci_map->old_and_new_locations_same(old_dest, new_dest))
duke@435 314 return false;
duke@435 315 } else if (old_ofs > 0 && new_ofs > 0) {
duke@435 316 _fwd_jmps->append(old_dest);
duke@435 317 _fwd_jmps->append(new_dest);
duke@435 318 } else {
duke@435 319 return false;
duke@435 320 }
duke@435 321 } else {
duke@435 322 if (old_ofs != new_ofs)
duke@435 323 return false;
duke@435 324 }
duke@435 325 break;
duke@435 326 }
duke@435 327
duke@435 328 case Bytecodes::_lookupswitch : // fall through
duke@435 329 case Bytecodes::_tableswitch : {
duke@435 330 if (_switchable_test) {
duke@435 331 address aligned_bcp_old = (address) round_to((intptr_t)_s_old->bcp() + 1, jintSize);
duke@435 332 address aligned_bcp_new = (address) round_to((intptr_t)_s_new->bcp() + 1, jintSize);
duke@435 333 int default_old = (int) Bytes::get_Java_u4(aligned_bcp_old);
duke@435 334 int default_new = (int) Bytes::get_Java_u4(aligned_bcp_new);
duke@435 335 _fwd_jmps->append(_s_old->bci() + default_old);
duke@435 336 _fwd_jmps->append(_s_new->bci() + default_new);
duke@435 337 if (c_old == Bytecodes::_lookupswitch) {
duke@435 338 int npairs_old = (int) Bytes::get_Java_u4(aligned_bcp_old + jintSize);
duke@435 339 int npairs_new = (int) Bytes::get_Java_u4(aligned_bcp_new + jintSize);
duke@435 340 if (npairs_old != npairs_new)
duke@435 341 return false;
duke@435 342 for (int i = 0; i < npairs_old; i++) {
duke@435 343 int match_old = (int) Bytes::get_Java_u4(aligned_bcp_old + (2+2*i)*jintSize);
duke@435 344 int match_new = (int) Bytes::get_Java_u4(aligned_bcp_new + (2+2*i)*jintSize);
duke@435 345 if (match_old != match_new)
duke@435 346 return false;
duke@435 347 int ofs_old = (int) Bytes::get_Java_u4(aligned_bcp_old + (2+2*i+1)*jintSize);
duke@435 348 int ofs_new = (int) Bytes::get_Java_u4(aligned_bcp_new + (2+2*i+1)*jintSize);
duke@435 349 _fwd_jmps->append(_s_old->bci() + ofs_old);
duke@435 350 _fwd_jmps->append(_s_new->bci() + ofs_new);
duke@435 351 }
duke@435 352 } else if (c_old == Bytecodes::_tableswitch) {
duke@435 353 int lo_old = (int) Bytes::get_Java_u4(aligned_bcp_old + jintSize);
duke@435 354 int lo_new = (int) Bytes::get_Java_u4(aligned_bcp_new + jintSize);
duke@435 355 if (lo_old != lo_new)
duke@435 356 return false;
duke@435 357 int hi_old = (int) Bytes::get_Java_u4(aligned_bcp_old + 2*jintSize);
duke@435 358 int hi_new = (int) Bytes::get_Java_u4(aligned_bcp_new + 2*jintSize);
duke@435 359 if (hi_old != hi_new)
duke@435 360 return false;
duke@435 361 for (int i = 0; i < hi_old - lo_old + 1; i++) {
duke@435 362 int ofs_old = (int) Bytes::get_Java_u4(aligned_bcp_old + (3+i)*jintSize);
duke@435 363 int ofs_new = (int) Bytes::get_Java_u4(aligned_bcp_new + (3+i)*jintSize);
duke@435 364 _fwd_jmps->append(_s_old->bci() + ofs_old);
duke@435 365 _fwd_jmps->append(_s_new->bci() + ofs_new);
duke@435 366 }
duke@435 367 }
duke@435 368 } else { // !_switchable_test, can use fast rough compare
jrose@1920 369 int len_old = _s_old->instruction_size();
jrose@1920 370 int len_new = _s_new->instruction_size();
duke@435 371 if (len_old != len_new)
duke@435 372 return false;
duke@435 373 if (memcmp(_s_old->bcp(), _s_new->bcp(), len_old) != 0)
duke@435 374 return false;
duke@435 375 }
duke@435 376 break;
duke@435 377 }
duke@435 378 }
duke@435 379
duke@435 380 return true;
duke@435 381 }
duke@435 382
jrose@2268 383 bool MethodComparator::pool_constants_same(int cpi_old, int cpi_new) {
jrose@2268 384 constantTag tag_old = _old_cp->tag_at(cpi_old);
jrose@2268 385 constantTag tag_new = _new_cp->tag_at(cpi_new);
jrose@2268 386 if (tag_old.is_int() || tag_old.is_float()) {
jrose@2268 387 if (tag_old.value() != tag_new.value())
jrose@2268 388 return false;
jrose@2268 389 if (tag_old.is_int()) {
jrose@2268 390 if (_old_cp->int_at(cpi_old) != _new_cp->int_at(cpi_new))
jrose@2268 391 return false;
jrose@2268 392 } else {
jrose@2268 393 // Use jint_cast to compare the bits rather than numerical values.
jrose@2268 394 // This makes a difference for NaN constants.
jrose@2268 395 if (jint_cast(_old_cp->float_at(cpi_old)) != jint_cast(_new_cp->float_at(cpi_new)))
jrose@2268 396 return false;
jrose@2268 397 }
jrose@2268 398 } else if (tag_old.is_string() || tag_old.is_unresolved_string()) {
jrose@2268 399 if (! (tag_new.is_unresolved_string() || tag_new.is_string()))
jrose@2268 400 return false;
jrose@2268 401 if (strcmp(_old_cp->string_at_noresolve(cpi_old),
jrose@2268 402 _new_cp->string_at_noresolve(cpi_new)) != 0)
jrose@2268 403 return false;
jrose@2268 404 } else if (tag_old.is_klass() || tag_old.is_unresolved_klass()) {
jrose@2268 405 // tag_old should be klass - 4881222
jrose@2268 406 if (! (tag_new.is_unresolved_klass() || tag_new.is_klass()))
jrose@2268 407 return false;
jrose@2268 408 if (_old_cp->klass_at_noresolve(cpi_old) !=
jrose@2268 409 _new_cp->klass_at_noresolve(cpi_new))
jrose@2268 410 return false;
jrose@2268 411 } else if (tag_old.is_method_type() && tag_new.is_method_type()) {
jrose@2268 412 int mti_old = _old_cp->method_type_index_at(cpi_old);
jrose@2268 413 int mti_new = _new_cp->method_type_index_at(cpi_new);
jrose@2268 414 if ((_old_cp->symbol_at(mti_old) != _new_cp->symbol_at(mti_new)))
jrose@2268 415 return false;
jrose@2268 416 } else if (tag_old.is_method_handle() && tag_new.is_method_handle()) {
jrose@2268 417 if (_old_cp->method_handle_ref_kind_at(cpi_old) !=
jrose@2268 418 _new_cp->method_handle_ref_kind_at(cpi_new))
jrose@2268 419 return false;
jrose@2268 420 int mhi_old = _old_cp->method_handle_index_at(cpi_old);
jrose@2268 421 int mhi_new = _new_cp->method_handle_index_at(cpi_new);
jrose@2268 422 if ((_old_cp->uncached_klass_ref_at_noresolve(mhi_old) != _new_cp->uncached_klass_ref_at_noresolve(mhi_new)) ||
jrose@2268 423 (_old_cp->uncached_name_ref_at(mhi_old) != _new_cp->uncached_name_ref_at(mhi_new)) ||
jrose@2268 424 (_old_cp->uncached_signature_ref_at(mhi_old) != _new_cp->uncached_signature_ref_at(mhi_new)))
jrose@2268 425 return false;
jrose@2268 426 } else {
jrose@2268 427 return false; // unknown tag
jrose@2268 428 }
jrose@2268 429 return true;
jrose@2268 430 }
jrose@2268 431
duke@435 432
duke@435 433 int MethodComparator::check_stack_and_locals_size(methodOop old_method, methodOop new_method) {
duke@435 434 if (old_method->max_stack() != new_method->max_stack()) {
duke@435 435 return 1;
duke@435 436 } else if (old_method->max_locals() != new_method->max_locals()) {
duke@435 437 return 2;
duke@435 438 } else if (old_method->size_of_parameters() != new_method->size_of_parameters()) {
duke@435 439 return 3;
duke@435 440 } else return 0;
duke@435 441 }

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial