1 /*
   2  * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   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
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "classfile/vmSymbols.hpp"
  27 #include "memory/oopFactory.hpp"
  28 #include "oops/oop.inline.hpp"
  29 #include "runtime/handles.inline.hpp"
  30 #include "utilities/xmlstream.hpp"
  31 
  32 
  33 Symbol* vmSymbols::_symbols[vmSymbols::SID_LIMIT];
  34 
  35 Symbol* vmSymbols::_type_signatures[T_VOID+1] = { NULL /*, NULL...*/ };
  36 
  37 inline int compare_symbol(Symbol* a, Symbol* b) {
  38   if (a == b)  return 0;
  39   // follow the natural address order:
  40   return (address)a > (address)b ? +1 : -1;
  41 }
  42 
  43 static vmSymbols::SID vm_symbol_index[vmSymbols::SID_LIMIT];
  44 extern "C" {
  45   static int compare_vmsymbol_sid(const void* void_a, const void* void_b) {
  46     Symbol* a = vmSymbols::symbol_at(*((vmSymbols::SID*) void_a));
  47     Symbol* b = vmSymbols::symbol_at(*((vmSymbols::SID*) void_b));
  48     return compare_symbol(a, b);
  49   }
  50 }
  51 
  52 #ifdef ASSERT
  53 #define VM_SYMBOL_ENUM_NAME_BODY(name, string) #name "\0"
  54 static const char* vm_symbol_enum_names =
  55   VM_SYMBOLS_DO(VM_SYMBOL_ENUM_NAME_BODY, VM_ALIAS_IGNORE)
  56   "\0";
  57 static const char* vm_symbol_enum_name(vmSymbols::SID sid) {
  58   const char* string = &vm_symbol_enum_names[0];
  59   int skip = (int)sid - (int)vmSymbols::FIRST_SID;
  60   for (; skip != 0; skip--) {
  61     size_t skiplen = strlen(string);
  62     if (skiplen == 0)  return "<unknown>";  // overflow
  63     string += skiplen+1;
  64   }
  65   return string;
  66 }
  67 #endif //ASSERT
  68 
  69 // Put all the VM symbol strings in one place.
  70 // Makes for a more compact libjvm.
  71 #define VM_SYMBOL_BODY(name, string) string "\0"
  72 static const char* vm_symbol_bodies = VM_SYMBOLS_DO(VM_SYMBOL_BODY, VM_ALIAS_IGNORE);
  73 
  74 void vmSymbols::initialize(TRAPS) {
  75   assert((int)SID_LIMIT <= (1<<log2_SID_LIMIT), "must fit in this bitfield");
  76   assert((int)SID_LIMIT*5 > (1<<log2_SID_LIMIT), "make the bitfield smaller, please");
  77   assert(vmIntrinsics::FLAG_LIMIT <= (1 << vmIntrinsics::log2_FLAG_LIMIT), "must fit in this bitfield");
  78 
  79   if (!UseSharedSpaces) {
  80     const char* string = &vm_symbol_bodies[0];
  81     for (int index = (int)FIRST_SID; index < (int)SID_LIMIT; index++) {
  82       Symbol* sym = SymbolTable::new_permanent_symbol(string, CHECK);
  83       _symbols[index] = sym;
  84       string += strlen(string); // skip string body
  85       string += 1;              // skip trailing null
  86     }
  87 
  88     _type_signatures[T_BYTE]    = byte_signature();
  89     _type_signatures[T_CHAR]    = char_signature();
  90     _type_signatures[T_DOUBLE]  = double_signature();
  91     _type_signatures[T_FLOAT]   = float_signature();
  92     _type_signatures[T_INT]     = int_signature();
  93     _type_signatures[T_LONG]    = long_signature();
  94     _type_signatures[T_SHORT]   = short_signature();
  95     _type_signatures[T_BOOLEAN] = bool_signature();
  96     _type_signatures[T_VOID]    = void_signature();
  97     // no single signatures for T_OBJECT or T_ARRAY
  98   }
  99 
 100 #ifdef ASSERT
 101   // Check for duplicates:
 102   for (int i1 = (int)FIRST_SID; i1 < (int)SID_LIMIT; i1++) {
 103     Symbol* sym = symbol_at((SID)i1);
 104     for (int i2 = (int)FIRST_SID; i2 < i1; i2++) {
 105       if (symbol_at((SID)i2) == sym) {
 106         tty->print("*** Duplicate VM symbol SIDs %s(%d) and %s(%d): \"",
 107                    vm_symbol_enum_name((SID)i2), i2,
 108                    vm_symbol_enum_name((SID)i1), i1);
 109         sym->print_symbol_on(tty);
 110         tty->print_cr("\"");
 111       }
 112     }
 113   }
 114 #endif //ASSERT
 115 
 116   // Create an index for find_id:
 117   {
 118     for (int index = (int)FIRST_SID; index < (int)SID_LIMIT; index++) {
 119       vm_symbol_index[index] = (SID)index;
 120     }
 121     int num_sids = SID_LIMIT-FIRST_SID;
 122     qsort(&vm_symbol_index[FIRST_SID], num_sids, sizeof(vm_symbol_index[0]),
 123           compare_vmsymbol_sid);
 124   }
 125 
 126 #ifdef ASSERT
 127   {
 128     // Spot-check correspondence between strings, symbols, and enums:
 129     assert(_symbols[NO_SID] == NULL, "must be");
 130     const char* str = "java/lang/Object";
 131     TempNewSymbol jlo = SymbolTable::new_permanent_symbol(str, CHECK);
 132     assert(strncmp(str, (char*)jlo->base(), jlo->utf8_length()) == 0, "");
 133     assert(jlo == java_lang_Object(), "");
 134     SID sid = VM_SYMBOL_ENUM_NAME(java_lang_Object);
 135     assert(find_sid(jlo) == sid, "");
 136     assert(symbol_at(sid) == jlo, "");
 137 
 138     // Make sure find_sid produces the right answer in each case.
 139     for (int index = (int)FIRST_SID; index < (int)SID_LIMIT; index++) {
 140       Symbol* sym = symbol_at((SID)index);
 141       sid = find_sid(sym);
 142       assert(sid == (SID)index, "symbol index works");
 143       // Note:  If there are duplicates, this assert will fail.
 144       // A "Duplicate VM symbol" message will have already been printed.
 145     }
 146 
 147     // The string "format" happens (at the moment) not to be a vmSymbol,
 148     // though it is a method name in java.lang.String.
 149     str = "format";
 150     TempNewSymbol fmt = SymbolTable::new_permanent_symbol(str, CHECK);
 151     sid = find_sid(fmt);
 152     assert(sid == NO_SID, "symbol index works (negative test)");
 153   }
 154 #endif
 155 }
 156 
 157 
 158 #ifndef PRODUCT
 159 const char* vmSymbols::name_for(vmSymbols::SID sid) {
 160   if (sid == NO_SID)
 161     return "NO_SID";
 162   const char* string = &vm_symbol_bodies[0];
 163   for (int index = (int)FIRST_SID; index < (int)SID_LIMIT; index++) {
 164     if (index == (int)sid)
 165       return string;
 166     string += strlen(string); // skip string body
 167     string += 1;              // skip trailing null
 168   }
 169   return "BAD_SID";
 170 }
 171 #endif
 172 
 173 
 174 
 175 void vmSymbols::symbols_do(SymbolClosure* f) {
 176   for (int index = (int)FIRST_SID; index < (int)SID_LIMIT; index++) {
 177     f->do_symbol(&_symbols[index]);
 178   }
 179   for (int i = 0; i < T_VOID+1; i++) {
 180     f->do_symbol(&_type_signatures[i]);
 181   }
 182 }
 183 
 184 void vmSymbols::serialize(SerializeClosure* soc) {
 185   soc->do_region((u_char*)&_symbols[FIRST_SID],
 186                  (SID_LIMIT - FIRST_SID) * sizeof(_symbols[0]));
 187   soc->do_region((u_char*)_type_signatures, sizeof(_type_signatures));
 188 }
 189 
 190 
 191 BasicType vmSymbols::signature_type(Symbol* s) {
 192   assert(s != NULL, "checking");
 193   for (int i = T_BOOLEAN; i < T_VOID+1; i++) {
 194     if (s == _type_signatures[i]) {
 195       return (BasicType)i;
 196     }
 197   }
 198   return T_OBJECT;
 199 }
 200 
 201 
 202 static int mid_hint = (int)vmSymbols::FIRST_SID+1;
 203 
 204 #ifndef PRODUCT
 205 static int find_sid_calls, find_sid_probes;
 206 // (Typical counts are calls=7000 and probes=17000.)
 207 #endif
 208 
 209 vmSymbols::SID vmSymbols::find_sid(Symbol* symbol) {
 210   // Handle the majority of misses by a bounds check.
 211   // Then, use a binary search over the index.
 212   // Expected trip count is less than log2_SID_LIMIT, about eight.
 213   // This is slow but acceptable, given that calls are not
 214   // dynamically common.  (Method*::intrinsic_id has a cache.)
 215   NOT_PRODUCT(find_sid_calls++);
 216   int min = (int)FIRST_SID, max = (int)SID_LIMIT - 1;
 217   SID sid = NO_SID, sid1;
 218   int cmp1;
 219   sid1 = vm_symbol_index[min];
 220   cmp1 = compare_symbol(symbol, symbol_at(sid1));
 221   if (cmp1 <= 0) {              // before the first
 222     if (cmp1 == 0)  sid = sid1;
 223   } else {
 224     sid1 = vm_symbol_index[max];
 225     cmp1 = compare_symbol(symbol, symbol_at(sid1));
 226     if (cmp1 >= 0) {            // after the last
 227       if (cmp1 == 0)  sid = sid1;
 228     } else {
 229       // After checking the extremes, do a binary search.
 230       ++min; --max;             // endpoints are done
 231       int mid = mid_hint;       // start at previous success
 232       while (max >= min) {
 233         assert(mid >= min && mid <= max, "");
 234         NOT_PRODUCT(find_sid_probes++);
 235         sid1 = vm_symbol_index[mid];
 236         cmp1 = compare_symbol(symbol, symbol_at(sid1));
 237         if (cmp1 == 0) {
 238           mid_hint = mid;
 239           sid = sid1;
 240           break;
 241         }
 242         if (cmp1 < 0)
 243           max = mid - 1;        // symbol < symbol_at(sid)
 244         else
 245           min = mid + 1;
 246 
 247         // Pick a new probe point:
 248         mid = (max + min) / 2;
 249       }
 250     }
 251   }
 252 
 253 #ifdef ASSERT
 254   // Perform the exhaustive self-check the first 1000 calls,
 255   // and every 100 calls thereafter.
 256   static int find_sid_check_count = -2000;
 257   if ((uint)++find_sid_check_count > (uint)100) {
 258     if (find_sid_check_count > 0)  find_sid_check_count = 0;
 259 
 260     // Make sure this is the right answer, using linear search.
 261     // (We have already proven that there are no duplicates in the list.)
 262     SID sid2 = NO_SID;
 263     for (int index = (int)FIRST_SID; index < (int)SID_LIMIT; index++) {
 264       Symbol* sym2 = symbol_at((SID)index);
 265       if (sym2 == symbol) {
 266         sid2 = (SID)index;
 267         break;
 268       }
 269     }
 270     // Unless it's a duplicate, assert that the sids are the same.
 271     if (_symbols[sid] != _symbols[sid2]) {
 272       assert(sid == sid2, "binary same as linear search");
 273     }
 274   }
 275 #endif //ASSERT
 276 
 277   return sid;
 278 }
 279 
 280 vmSymbols::SID vmSymbols::find_sid(const char* symbol_name) {
 281   Symbol* symbol = SymbolTable::probe(symbol_name, (int) strlen(symbol_name));
 282   if (symbol == NULL)  return NO_SID;
 283   return find_sid(symbol);
 284 }
 285 
 286 static vmIntrinsics::ID wrapper_intrinsic(BasicType type, bool unboxing) {
 287 #define TYPE2(type, unboxing) ((int)(type)*2 + ((unboxing) ? 1 : 0))
 288   switch (TYPE2(type, unboxing)) {
 289 #define BASIC_TYPE_CASE(type, box, unbox) \
 290     case TYPE2(type, false):  return vmIntrinsics::box; \
 291     case TYPE2(type, true):   return vmIntrinsics::unbox
 292     BASIC_TYPE_CASE(T_BOOLEAN, _Boolean_valueOf,   _booleanValue);
 293     BASIC_TYPE_CASE(T_BYTE,    _Byte_valueOf,      _byteValue);
 294     BASIC_TYPE_CASE(T_CHAR,    _Character_valueOf, _charValue);
 295     BASIC_TYPE_CASE(T_SHORT,   _Short_valueOf,     _shortValue);
 296     BASIC_TYPE_CASE(T_INT,     _Integer_valueOf,   _intValue);
 297     BASIC_TYPE_CASE(T_LONG,    _Long_valueOf,      _longValue);
 298     BASIC_TYPE_CASE(T_FLOAT,   _Float_valueOf,     _floatValue);
 299     BASIC_TYPE_CASE(T_DOUBLE,  _Double_valueOf,    _doubleValue);
 300 #undef BASIC_TYPE_CASE
 301   }
 302 #undef TYPE2
 303   return vmIntrinsics::_none;
 304 }
 305 
 306 vmIntrinsics::ID vmIntrinsics::for_boxing(BasicType type) {
 307   return wrapper_intrinsic(type, false);
 308 }
 309 vmIntrinsics::ID vmIntrinsics::for_unboxing(BasicType type) {
 310   return wrapper_intrinsic(type, true);
 311 }
 312 
 313 vmIntrinsics::ID vmIntrinsics::for_raw_conversion(BasicType src, BasicType dest) {
 314 #define SRC_DEST(s,d) (((int)(s) << 4) + (int)(d))
 315   switch (SRC_DEST(src, dest)) {
 316   case SRC_DEST(T_INT, T_FLOAT):   return vmIntrinsics::_intBitsToFloat;
 317   case SRC_DEST(T_FLOAT, T_INT):   return vmIntrinsics::_floatToRawIntBits;
 318 
 319   case SRC_DEST(T_LONG, T_DOUBLE): return vmIntrinsics::_longBitsToDouble;
 320   case SRC_DEST(T_DOUBLE, T_LONG): return vmIntrinsics::_doubleToRawLongBits;
 321   }
 322 #undef SRC_DEST
 323 
 324   return vmIntrinsics::_none;
 325 }
 326 
 327 // Some intrinsics produce different results if they are not pinned
 328 bool vmIntrinsics::should_be_pinned(vmIntrinsics::ID id) {
 329   assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
 330   switch(id) {
 331 #ifdef TRACE_HAVE_INTRINSICS
 332   case vmIntrinsics::_counterTime:
 333 #endif
 334   case vmIntrinsics::_currentTimeMillis:
 335   case vmIntrinsics::_nanoTime:
 336     return true;
 337   default:
 338     return false;
 339   }
 340 }
 341 
 342 #define VM_INTRINSIC_INITIALIZE(id, klass, name, sig, flags) #id "\0"
 343 static const char* vm_intrinsic_name_bodies =
 344   VM_INTRINSICS_DO(VM_INTRINSIC_INITIALIZE,
 345                    VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_ALIAS_IGNORE);
 346 
 347 static const char* vm_intrinsic_name_table[vmIntrinsics::ID_LIMIT];
 348 
 349 const char* vmIntrinsics::name_at(vmIntrinsics::ID id) {
 350   const char** nt = &vm_intrinsic_name_table[0];
 351   if (nt[_none] == NULL) {
 352     char* string = (char*) &vm_intrinsic_name_bodies[0];
 353     for (int index = FIRST_ID; index < ID_LIMIT; index++) {
 354       nt[index] = string;
 355       string += strlen(string); // skip string body
 356       string += 1;              // skip trailing null
 357     }
 358     assert(!strcmp(nt[_hashCode], "_hashCode"), "lined up");
 359     nt[_none] = "_none";
 360   }
 361   if ((uint)id < (uint)ID_LIMIT)
 362     return vm_intrinsic_name_table[(uint)id];
 363   else
 364     return "(unknown intrinsic)";
 365 }
 366 
 367 // These are flag-matching functions:
 368 inline bool match_F_R(jshort flags) {
 369   const int req = 0;
 370   const int neg = JVM_ACC_STATIC | JVM_ACC_SYNCHRONIZED;
 371   return (flags & (req | neg)) == req;
 372 }
 373 inline bool match_F_Y(jshort flags) {
 374   const int req = JVM_ACC_SYNCHRONIZED;
 375   const int neg = JVM_ACC_STATIC;
 376   return (flags & (req | neg)) == req;
 377 }
 378 inline bool match_F_RN(jshort flags) {
 379   const int req = JVM_ACC_NATIVE;
 380   const int neg = JVM_ACC_STATIC | JVM_ACC_SYNCHRONIZED;
 381   return (flags & (req | neg)) == req;
 382 }
 383 inline bool match_F_S(jshort flags) {
 384   const int req = JVM_ACC_STATIC;
 385   const int neg = JVM_ACC_SYNCHRONIZED;
 386   return (flags & (req | neg)) == req;
 387 }
 388 inline bool match_F_SN(jshort flags) {
 389   const int req = JVM_ACC_STATIC | JVM_ACC_NATIVE;
 390   const int neg = JVM_ACC_SYNCHRONIZED;
 391   return (flags & (req | neg)) == req;
 392 }
 393 inline bool match_F_RNY(jshort flags) {
 394   const int req = JVM_ACC_NATIVE | JVM_ACC_SYNCHRONIZED;
 395   const int neg = JVM_ACC_STATIC;
 396   return (flags & (req | neg)) == req;
 397 }
 398 
 399 // These are for forming case labels:
 400 #define ID3(x, y, z) (( jlong)(z) +                                  \
 401                       ((jlong)(y) <<    vmSymbols::log2_SID_LIMIT) + \
 402                       ((jlong)(x) << (2*vmSymbols::log2_SID_LIMIT))  )
 403 #define SID_ENUM(n) vmSymbols::VM_SYMBOL_ENUM_NAME(n)
 404 
 405 vmIntrinsics::ID vmIntrinsics::find_id_impl(vmSymbols::SID holder,
 406                                             vmSymbols::SID name,
 407                                             vmSymbols::SID sig,
 408                                             jshort flags) {
 409   assert((int)vmSymbols::SID_LIMIT <= (1<<vmSymbols::log2_SID_LIMIT), "must fit");
 410 
 411   // Let the C compiler build the decision tree.
 412 
 413 #define VM_INTRINSIC_CASE(id, klass, name, sig, fcode) \
 414   case ID3(SID_ENUM(klass), SID_ENUM(name), SID_ENUM(sig)): \
 415     if (!match_##fcode(flags))  break; \
 416     return id;
 417 
 418   switch (ID3(holder, name, sig)) {
 419     VM_INTRINSICS_DO(VM_INTRINSIC_CASE,
 420                      VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_ALIAS_IGNORE);
 421   }
 422   return vmIntrinsics::_none;
 423 
 424 #undef VM_INTRINSIC_CASE
 425 }
 426 
 427 
 428 const char* vmIntrinsics::short_name_as_C_string(vmIntrinsics::ID id, char* buf, int buflen) {
 429   const char* str = name_at(id);
 430 #ifndef PRODUCT
 431   const char* kname = vmSymbols::name_for(class_for(id));
 432   const char* mname = vmSymbols::name_for(name_for(id));
 433   const char* sname = vmSymbols::name_for(signature_for(id));
 434   const char* fname = "";
 435   switch (flags_for(id)) {
 436   case F_Y:  fname = "synchronized ";  break;
 437   case F_RN: fname = "native ";        break;
 438   case F_SN: fname = "native static "; break;
 439   case F_S:  fname = "static ";        break;
 440   case F_RNY:fname = "native synchronized "; break;
 441   }
 442   const char* kptr = strrchr(kname, '/');
 443   if (kptr != NULL)  kname = kptr + 1;
 444   int len = jio_snprintf(buf, buflen, "%s: %s%s.%s%s",
 445                          str, fname, kname, mname, sname);
 446   if (len < buflen)
 447     str = buf;
 448 #endif //PRODUCT
 449   return str;
 450 }
 451 
 452 
 453 // These are to get information about intrinsics.
 454 
 455 #define ID4(x, y, z, f) ((ID3(x, y, z) << vmIntrinsics::log2_FLAG_LIMIT) | (jlong) (f))
 456 
 457 static const jlong intrinsic_info_array[vmIntrinsics::ID_LIMIT+1] = {
 458 #define VM_INTRINSIC_INFO(ignore_id, klass, name, sig, fcode) \
 459   ID4(SID_ENUM(klass), SID_ENUM(name), SID_ENUM(sig), vmIntrinsics::fcode),
 460 
 461   0, VM_INTRINSICS_DO(VM_INTRINSIC_INFO,
 462                      VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_ALIAS_IGNORE)
 463     0
 464 #undef VM_INTRINSIC_INFO
 465 };
 466 
 467 inline jlong intrinsic_info(vmIntrinsics::ID id) {
 468   return intrinsic_info_array[vmIntrinsics::ID_from((int)id)];
 469 }
 470 
 471 vmSymbols::SID vmIntrinsics::class_for(vmIntrinsics::ID id) {
 472   jlong info = intrinsic_info(id);
 473   int shift = 2*vmSymbols::log2_SID_LIMIT + log2_FLAG_LIMIT, mask = right_n_bits(vmSymbols::log2_SID_LIMIT);
 474   assert(((ID4(1021,1022,1023,15) >> shift) & mask) == 1021, "");
 475   return vmSymbols::SID( (info >> shift) & mask );
 476 }
 477 
 478 vmSymbols::SID vmIntrinsics::name_for(vmIntrinsics::ID id) {
 479   jlong info = intrinsic_info(id);
 480   int shift = vmSymbols::log2_SID_LIMIT + log2_FLAG_LIMIT, mask = right_n_bits(vmSymbols::log2_SID_LIMIT);
 481   assert(((ID4(1021,1022,1023,15) >> shift) & mask) == 1022, "");
 482   return vmSymbols::SID( (info >> shift) & mask );
 483 }
 484 
 485 vmSymbols::SID vmIntrinsics::signature_for(vmIntrinsics::ID id) {
 486   jlong info = intrinsic_info(id);
 487   int shift = log2_FLAG_LIMIT, mask = right_n_bits(vmSymbols::log2_SID_LIMIT);
 488   assert(((ID4(1021,1022,1023,15) >> shift) & mask) == 1023, "");
 489   return vmSymbols::SID( (info >> shift) & mask );
 490 }
 491 
 492 vmIntrinsics::Flags vmIntrinsics::flags_for(vmIntrinsics::ID id) {
 493   jlong info = intrinsic_info(id);
 494   int shift = 0, mask = right_n_bits(log2_FLAG_LIMIT);
 495   assert(((ID4(1021,1022,1023,15) >> shift) & mask) == 15, "");
 496   return Flags( (info >> shift) & mask );
 497 }
 498 
 499 
 500 #ifndef PRODUCT
 501 // verify_method performs an extra check on a matched intrinsic method
 502 
 503 static bool match_method(Method* m, Symbol* n, Symbol* s) {
 504   return (m->name() == n &&
 505           m->signature() == s);
 506 }
 507 
 508 static vmIntrinsics::ID match_method_with_klass(Method* m, Symbol* mk) {
 509 #define VM_INTRINSIC_MATCH(id, klassname, namepart, sigpart, flags) \
 510   { Symbol* k = vmSymbols::klassname(); \
 511     if (mk == k) { \
 512       Symbol* n = vmSymbols::namepart(); \
 513       Symbol* s = vmSymbols::sigpart(); \
 514       if (match_method(m, n, s)) \
 515         return vmIntrinsics::id; \
 516     } }
 517   VM_INTRINSICS_DO(VM_INTRINSIC_MATCH,
 518                    VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_SYMBOL_IGNORE, VM_ALIAS_IGNORE);
 519   return vmIntrinsics::_none;
 520 #undef VM_INTRINSIC_MATCH
 521 }
 522 
 523 void vmIntrinsics::verify_method(ID actual_id, Method* m) {
 524   Symbol* mk = m->method_holder()->name();
 525   ID declared_id = match_method_with_klass(m, mk);
 526 
 527   if (declared_id == actual_id)  return; // success
 528 
 529   if (declared_id == _none && actual_id != _none && mk == vmSymbols::java_lang_StrictMath()) {
 530     // Here are a few special cases in StrictMath not declared in vmSymbols.hpp.
 531     switch (actual_id) {
 532     case _min:
 533     case _max:
 534     case _dsqrt:
 535       declared_id = match_method_with_klass(m, vmSymbols::java_lang_Math());
 536       if (declared_id == actual_id)  return; // acceptable alias
 537       break;
 538     }
 539   }
 540 
 541   const char* declared_name = name_at(declared_id);
 542   const char* actual_name   = name_at(actual_id);
 543   methodHandle mh = m;
 544   m = NULL;
 545   ttyLocker ttyl;
 546   if (xtty != NULL) {
 547     xtty->begin_elem("intrinsic_misdeclared actual='%s' declared='%s'",
 548                      actual_name, declared_name);
 549     xtty->method(mh);
 550     xtty->end_elem("%s", "");
 551   }
 552   if (PrintMiscellaneous && (WizardMode || Verbose)) {
 553     tty->print_cr("*** misidentified method; %s(%d) should be %s(%d):",
 554                   declared_name, declared_id, actual_name, actual_id);
 555     mh()->print_short_name(tty);
 556     tty->cr();
 557   }
 558 }
 559 #endif //PRODUCT