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