Tue, 05 Apr 2011 14:12:31 -0700
7010070: Update all 2010 Oracle-changed OpenJDK files to have the proper copyright dates - second pass
Summary: Update the copyright to be 2010 on all changed files in OpenJDK
Reviewed-by: ohair
duke@435 | 1 | /* |
trims@2708 | 2 | * Copyright (c) 2005, 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 "ci/ciArrayKlass.hpp" |
stefank@2314 | 27 | #include "ci/ciEnv.hpp" |
stefank@2314 | 28 | #include "ci/ciKlass.hpp" |
stefank@2314 | 29 | #include "ci/ciMethod.hpp" |
stefank@2314 | 30 | #include "code/dependencies.hpp" |
stefank@2314 | 31 | #include "compiler/compileLog.hpp" |
stefank@2314 | 32 | #include "oops/oop.inline.hpp" |
stefank@2314 | 33 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 34 | #include "utilities/copy.hpp" |
duke@435 | 35 | |
duke@435 | 36 | |
duke@435 | 37 | #ifdef ASSERT |
duke@435 | 38 | static bool must_be_in_vm() { |
duke@435 | 39 | Thread* thread = Thread::current(); |
duke@435 | 40 | if (thread->is_Java_thread()) |
duke@435 | 41 | return ((JavaThread*)thread)->thread_state() == _thread_in_vm; |
duke@435 | 42 | else |
duke@435 | 43 | return true; //something like this: thread->is_VM_thread(); |
duke@435 | 44 | } |
duke@435 | 45 | #endif //ASSERT |
duke@435 | 46 | |
duke@435 | 47 | void Dependencies::initialize(ciEnv* env) { |
duke@435 | 48 | Arena* arena = env->arena(); |
duke@435 | 49 | _oop_recorder = env->oop_recorder(); |
duke@435 | 50 | _log = env->log(); |
duke@435 | 51 | _dep_seen = new(arena) GrowableArray<int>(arena, 500, 0, 0); |
duke@435 | 52 | DEBUG_ONLY(_deps[end_marker] = NULL); |
duke@435 | 53 | for (int i = (int)FIRST_TYPE; i < (int)TYPE_LIMIT; i++) { |
duke@435 | 54 | _deps[i] = new(arena) GrowableArray<ciObject*>(arena, 10, 0, 0); |
duke@435 | 55 | } |
duke@435 | 56 | _content_bytes = NULL; |
duke@435 | 57 | _size_in_bytes = (size_t)-1; |
duke@435 | 58 | |
duke@435 | 59 | assert(TYPE_LIMIT <= (1<<LG2_TYPE_LIMIT), "sanity"); |
duke@435 | 60 | } |
duke@435 | 61 | |
duke@435 | 62 | void Dependencies::assert_evol_method(ciMethod* m) { |
duke@435 | 63 | assert_common_1(evol_method, m); |
duke@435 | 64 | } |
duke@435 | 65 | |
duke@435 | 66 | void Dependencies::assert_leaf_type(ciKlass* ctxk) { |
duke@435 | 67 | if (ctxk->is_array_klass()) { |
duke@435 | 68 | // As a special case, support this assertion on an array type, |
duke@435 | 69 | // which reduces to an assertion on its element type. |
duke@435 | 70 | // Note that this cannot be done with assertions that |
duke@435 | 71 | // relate to concreteness or abstractness. |
duke@435 | 72 | ciType* elemt = ctxk->as_array_klass()->base_element_type(); |
duke@435 | 73 | if (!elemt->is_instance_klass()) return; // Ex: int[][] |
duke@435 | 74 | ctxk = elemt->as_instance_klass(); |
duke@435 | 75 | //if (ctxk->is_final()) return; // Ex: String[][] |
duke@435 | 76 | } |
duke@435 | 77 | check_ctxk(ctxk); |
duke@435 | 78 | assert_common_1(leaf_type, ctxk); |
duke@435 | 79 | } |
duke@435 | 80 | |
duke@435 | 81 | void Dependencies::assert_abstract_with_unique_concrete_subtype(ciKlass* ctxk, ciKlass* conck) { |
duke@435 | 82 | check_ctxk_abstract(ctxk); |
duke@435 | 83 | assert_common_2(abstract_with_unique_concrete_subtype, ctxk, conck); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | void Dependencies::assert_abstract_with_no_concrete_subtype(ciKlass* ctxk) { |
duke@435 | 87 | check_ctxk_abstract(ctxk); |
duke@435 | 88 | assert_common_1(abstract_with_no_concrete_subtype, ctxk); |
duke@435 | 89 | } |
duke@435 | 90 | |
duke@435 | 91 | void Dependencies::assert_concrete_with_no_concrete_subtype(ciKlass* ctxk) { |
duke@435 | 92 | check_ctxk_concrete(ctxk); |
duke@435 | 93 | assert_common_1(concrete_with_no_concrete_subtype, ctxk); |
duke@435 | 94 | } |
duke@435 | 95 | |
duke@435 | 96 | void Dependencies::assert_unique_concrete_method(ciKlass* ctxk, ciMethod* uniqm) { |
duke@435 | 97 | check_ctxk(ctxk); |
duke@435 | 98 | assert_common_2(unique_concrete_method, ctxk, uniqm); |
duke@435 | 99 | } |
duke@435 | 100 | |
duke@435 | 101 | void Dependencies::assert_abstract_with_exclusive_concrete_subtypes(ciKlass* ctxk, ciKlass* k1, ciKlass* k2) { |
duke@435 | 102 | check_ctxk(ctxk); |
duke@435 | 103 | assert_common_3(abstract_with_exclusive_concrete_subtypes_2, ctxk, k1, k2); |
duke@435 | 104 | } |
duke@435 | 105 | |
duke@435 | 106 | void Dependencies::assert_exclusive_concrete_methods(ciKlass* ctxk, ciMethod* m1, ciMethod* m2) { |
duke@435 | 107 | check_ctxk(ctxk); |
duke@435 | 108 | assert_common_3(exclusive_concrete_methods_2, ctxk, m1, m2); |
duke@435 | 109 | } |
duke@435 | 110 | |
duke@435 | 111 | void Dependencies::assert_has_no_finalizable_subclasses(ciKlass* ctxk) { |
duke@435 | 112 | check_ctxk(ctxk); |
duke@435 | 113 | assert_common_1(no_finalizable_subclasses, ctxk); |
duke@435 | 114 | } |
duke@435 | 115 | |
duke@435 | 116 | // Helper function. If we are adding a new dep. under ctxk2, |
duke@435 | 117 | // try to find an old dep. under a broader* ctxk1. If there is |
duke@435 | 118 | // |
duke@435 | 119 | bool Dependencies::maybe_merge_ctxk(GrowableArray<ciObject*>* deps, |
duke@435 | 120 | int ctxk_i, ciKlass* ctxk2) { |
duke@435 | 121 | ciKlass* ctxk1 = deps->at(ctxk_i)->as_klass(); |
duke@435 | 122 | if (ctxk2->is_subtype_of(ctxk1)) { |
duke@435 | 123 | return true; // success, and no need to change |
duke@435 | 124 | } else if (ctxk1->is_subtype_of(ctxk2)) { |
duke@435 | 125 | // new context class fully subsumes previous one |
duke@435 | 126 | deps->at_put(ctxk_i, ctxk2); |
duke@435 | 127 | return true; |
duke@435 | 128 | } else { |
duke@435 | 129 | return false; |
duke@435 | 130 | } |
duke@435 | 131 | } |
duke@435 | 132 | |
duke@435 | 133 | void Dependencies::assert_common_1(Dependencies::DepType dept, ciObject* x) { |
duke@435 | 134 | assert(dep_args(dept) == 1, "sanity"); |
duke@435 | 135 | log_dependency(dept, x); |
duke@435 | 136 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 137 | |
duke@435 | 138 | // see if the same (or a similar) dep is already recorded |
duke@435 | 139 | if (note_dep_seen(dept, x)) { |
duke@435 | 140 | assert(deps->find(x) >= 0, "sanity"); |
duke@435 | 141 | } else { |
duke@435 | 142 | deps->append(x); |
duke@435 | 143 | } |
duke@435 | 144 | } |
duke@435 | 145 | |
duke@435 | 146 | void Dependencies::assert_common_2(Dependencies::DepType dept, |
duke@435 | 147 | ciKlass* ctxk, ciObject* x) { |
duke@435 | 148 | assert(dep_context_arg(dept) == 0, "sanity"); |
duke@435 | 149 | assert(dep_args(dept) == 2, "sanity"); |
duke@435 | 150 | log_dependency(dept, ctxk, x); |
duke@435 | 151 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 152 | |
duke@435 | 153 | // see if the same (or a similar) dep is already recorded |
duke@435 | 154 | if (note_dep_seen(dept, x)) { |
duke@435 | 155 | // look in this bucket for redundant assertions |
duke@435 | 156 | const int stride = 2; |
duke@435 | 157 | for (int i = deps->length(); (i -= stride) >= 0; ) { |
duke@435 | 158 | ciObject* x1 = deps->at(i+1); |
duke@435 | 159 | if (x == x1) { // same subject; check the context |
duke@435 | 160 | if (maybe_merge_ctxk(deps, i+0, ctxk)) { |
duke@435 | 161 | return; |
duke@435 | 162 | } |
duke@435 | 163 | } |
duke@435 | 164 | } |
duke@435 | 165 | } |
duke@435 | 166 | |
duke@435 | 167 | // append the assertion in the correct bucket: |
duke@435 | 168 | deps->append(ctxk); |
duke@435 | 169 | deps->append(x); |
duke@435 | 170 | } |
duke@435 | 171 | |
duke@435 | 172 | void Dependencies::assert_common_3(Dependencies::DepType dept, |
duke@435 | 173 | ciKlass* ctxk, ciObject* x, ciObject* x2) { |
duke@435 | 174 | assert(dep_context_arg(dept) == 0, "sanity"); |
duke@435 | 175 | assert(dep_args(dept) == 3, "sanity"); |
duke@435 | 176 | log_dependency(dept, ctxk, x, x2); |
duke@435 | 177 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 178 | |
duke@435 | 179 | // try to normalize an unordered pair: |
duke@435 | 180 | bool swap = false; |
duke@435 | 181 | switch (dept) { |
duke@435 | 182 | case abstract_with_exclusive_concrete_subtypes_2: |
duke@435 | 183 | swap = (x->ident() > x2->ident() && x != ctxk); |
duke@435 | 184 | break; |
duke@435 | 185 | case exclusive_concrete_methods_2: |
duke@435 | 186 | swap = (x->ident() > x2->ident() && x->as_method()->holder() != ctxk); |
duke@435 | 187 | break; |
duke@435 | 188 | } |
duke@435 | 189 | if (swap) { ciObject* t = x; x = x2; x2 = t; } |
duke@435 | 190 | |
duke@435 | 191 | // see if the same (or a similar) dep is already recorded |
duke@435 | 192 | if (note_dep_seen(dept, x) && note_dep_seen(dept, x2)) { |
duke@435 | 193 | // look in this bucket for redundant assertions |
duke@435 | 194 | const int stride = 3; |
duke@435 | 195 | for (int i = deps->length(); (i -= stride) >= 0; ) { |
duke@435 | 196 | ciObject* y = deps->at(i+1); |
duke@435 | 197 | ciObject* y2 = deps->at(i+2); |
duke@435 | 198 | if (x == y && x2 == y2) { // same subjects; check the context |
duke@435 | 199 | if (maybe_merge_ctxk(deps, i+0, ctxk)) { |
duke@435 | 200 | return; |
duke@435 | 201 | } |
duke@435 | 202 | } |
duke@435 | 203 | } |
duke@435 | 204 | } |
duke@435 | 205 | // append the assertion in the correct bucket: |
duke@435 | 206 | deps->append(ctxk); |
duke@435 | 207 | deps->append(x); |
duke@435 | 208 | deps->append(x2); |
duke@435 | 209 | } |
duke@435 | 210 | |
duke@435 | 211 | /// Support for encoding dependencies into an nmethod: |
duke@435 | 212 | |
duke@435 | 213 | void Dependencies::copy_to(nmethod* nm) { |
duke@435 | 214 | address beg = nm->dependencies_begin(); |
duke@435 | 215 | address end = nm->dependencies_end(); |
duke@435 | 216 | guarantee(end - beg >= (ptrdiff_t) size_in_bytes(), "bad sizing"); |
duke@435 | 217 | Copy::disjoint_words((HeapWord*) content_bytes(), |
duke@435 | 218 | (HeapWord*) beg, |
duke@435 | 219 | size_in_bytes() / sizeof(HeapWord)); |
duke@435 | 220 | assert(size_in_bytes() % sizeof(HeapWord) == 0, "copy by words"); |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | static int sort_dep(ciObject** p1, ciObject** p2, int narg) { |
duke@435 | 224 | for (int i = 0; i < narg; i++) { |
duke@435 | 225 | int diff = p1[i]->ident() - p2[i]->ident(); |
duke@435 | 226 | if (diff != 0) return diff; |
duke@435 | 227 | } |
duke@435 | 228 | return 0; |
duke@435 | 229 | } |
duke@435 | 230 | static int sort_dep_arg_1(ciObject** p1, ciObject** p2) |
duke@435 | 231 | { return sort_dep(p1, p2, 1); } |
duke@435 | 232 | static int sort_dep_arg_2(ciObject** p1, ciObject** p2) |
duke@435 | 233 | { return sort_dep(p1, p2, 2); } |
duke@435 | 234 | static int sort_dep_arg_3(ciObject** p1, ciObject** p2) |
duke@435 | 235 | { return sort_dep(p1, p2, 3); } |
duke@435 | 236 | |
duke@435 | 237 | void Dependencies::sort_all_deps() { |
duke@435 | 238 | for (int deptv = (int)FIRST_TYPE; deptv < (int)TYPE_LIMIT; deptv++) { |
duke@435 | 239 | DepType dept = (DepType)deptv; |
duke@435 | 240 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 241 | if (deps->length() <= 1) continue; |
duke@435 | 242 | switch (dep_args(dept)) { |
duke@435 | 243 | case 1: deps->sort(sort_dep_arg_1, 1); break; |
duke@435 | 244 | case 2: deps->sort(sort_dep_arg_2, 2); break; |
duke@435 | 245 | case 3: deps->sort(sort_dep_arg_3, 3); break; |
duke@435 | 246 | default: ShouldNotReachHere(); |
duke@435 | 247 | } |
duke@435 | 248 | } |
duke@435 | 249 | } |
duke@435 | 250 | |
duke@435 | 251 | size_t Dependencies::estimate_size_in_bytes() { |
duke@435 | 252 | size_t est_size = 100; |
duke@435 | 253 | for (int deptv = (int)FIRST_TYPE; deptv < (int)TYPE_LIMIT; deptv++) { |
duke@435 | 254 | DepType dept = (DepType)deptv; |
duke@435 | 255 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 256 | est_size += deps->length()*2; // tags and argument(s) |
duke@435 | 257 | } |
duke@435 | 258 | return est_size; |
duke@435 | 259 | } |
duke@435 | 260 | |
duke@435 | 261 | ciKlass* Dependencies::ctxk_encoded_as_null(DepType dept, ciObject* x) { |
duke@435 | 262 | switch (dept) { |
duke@435 | 263 | case abstract_with_exclusive_concrete_subtypes_2: |
duke@435 | 264 | return x->as_klass(); |
duke@435 | 265 | case unique_concrete_method: |
duke@435 | 266 | case exclusive_concrete_methods_2: |
duke@435 | 267 | return x->as_method()->holder(); |
duke@435 | 268 | } |
duke@435 | 269 | return NULL; // let NULL be NULL |
duke@435 | 270 | } |
duke@435 | 271 | |
duke@435 | 272 | klassOop Dependencies::ctxk_encoded_as_null(DepType dept, oop x) { |
duke@435 | 273 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 274 | switch (dept) { |
duke@435 | 275 | case abstract_with_exclusive_concrete_subtypes_2: |
duke@435 | 276 | assert(x->is_klass(), "sanity"); |
duke@435 | 277 | return (klassOop) x; |
duke@435 | 278 | case unique_concrete_method: |
duke@435 | 279 | case exclusive_concrete_methods_2: |
duke@435 | 280 | assert(x->is_method(), "sanity"); |
duke@435 | 281 | return ((methodOop)x)->method_holder(); |
duke@435 | 282 | } |
duke@435 | 283 | return NULL; // let NULL be NULL |
duke@435 | 284 | } |
duke@435 | 285 | |
duke@435 | 286 | void Dependencies::encode_content_bytes() { |
duke@435 | 287 | sort_all_deps(); |
duke@435 | 288 | |
duke@435 | 289 | // cast is safe, no deps can overflow INT_MAX |
duke@435 | 290 | CompressedWriteStream bytes((int)estimate_size_in_bytes()); |
duke@435 | 291 | |
duke@435 | 292 | for (int deptv = (int)FIRST_TYPE; deptv < (int)TYPE_LIMIT; deptv++) { |
duke@435 | 293 | DepType dept = (DepType)deptv; |
duke@435 | 294 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 295 | if (deps->length() == 0) continue; |
duke@435 | 296 | int stride = dep_args(dept); |
duke@435 | 297 | int ctxkj = dep_context_arg(dept); // -1 if no context arg |
duke@435 | 298 | assert(stride > 0, "sanity"); |
duke@435 | 299 | for (int i = 0; i < deps->length(); i += stride) { |
duke@435 | 300 | jbyte code_byte = (jbyte)dept; |
duke@435 | 301 | int skipj = -1; |
duke@435 | 302 | if (ctxkj >= 0 && ctxkj+1 < stride) { |
duke@435 | 303 | ciKlass* ctxk = deps->at(i+ctxkj+0)->as_klass(); |
duke@435 | 304 | ciObject* x = deps->at(i+ctxkj+1); // following argument |
duke@435 | 305 | if (ctxk == ctxk_encoded_as_null(dept, x)) { |
duke@435 | 306 | skipj = ctxkj; // we win: maybe one less oop to keep track of |
duke@435 | 307 | code_byte |= default_context_type_bit; |
duke@435 | 308 | } |
duke@435 | 309 | } |
duke@435 | 310 | bytes.write_byte(code_byte); |
duke@435 | 311 | for (int j = 0; j < stride; j++) { |
duke@435 | 312 | if (j == skipj) continue; |
jrose@1424 | 313 | bytes.write_int(_oop_recorder->find_index(deps->at(i+j)->constant_encoding())); |
duke@435 | 314 | } |
duke@435 | 315 | } |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | // write a sentinel byte to mark the end |
duke@435 | 319 | bytes.write_byte(end_marker); |
duke@435 | 320 | |
duke@435 | 321 | // round it out to a word boundary |
duke@435 | 322 | while (bytes.position() % sizeof(HeapWord) != 0) { |
duke@435 | 323 | bytes.write_byte(end_marker); |
duke@435 | 324 | } |
duke@435 | 325 | |
duke@435 | 326 | // check whether the dept byte encoding really works |
duke@435 | 327 | assert((jbyte)default_context_type_bit != 0, "byte overflow"); |
duke@435 | 328 | |
duke@435 | 329 | _content_bytes = bytes.buffer(); |
duke@435 | 330 | _size_in_bytes = bytes.position(); |
duke@435 | 331 | } |
duke@435 | 332 | |
duke@435 | 333 | |
duke@435 | 334 | const char* Dependencies::_dep_name[TYPE_LIMIT] = { |
duke@435 | 335 | "end_marker", |
duke@435 | 336 | "evol_method", |
duke@435 | 337 | "leaf_type", |
duke@435 | 338 | "abstract_with_unique_concrete_subtype", |
duke@435 | 339 | "abstract_with_no_concrete_subtype", |
duke@435 | 340 | "concrete_with_no_concrete_subtype", |
duke@435 | 341 | "unique_concrete_method", |
duke@435 | 342 | "abstract_with_exclusive_concrete_subtypes_2", |
duke@435 | 343 | "exclusive_concrete_methods_2", |
duke@435 | 344 | "no_finalizable_subclasses" |
duke@435 | 345 | }; |
duke@435 | 346 | |
duke@435 | 347 | int Dependencies::_dep_args[TYPE_LIMIT] = { |
duke@435 | 348 | -1,// end_marker |
duke@435 | 349 | 1, // evol_method m |
duke@435 | 350 | 1, // leaf_type ctxk |
duke@435 | 351 | 2, // abstract_with_unique_concrete_subtype ctxk, k |
duke@435 | 352 | 1, // abstract_with_no_concrete_subtype ctxk |
duke@435 | 353 | 1, // concrete_with_no_concrete_subtype ctxk |
duke@435 | 354 | 2, // unique_concrete_method ctxk, m |
duke@435 | 355 | 3, // unique_concrete_subtypes_2 ctxk, k1, k2 |
duke@435 | 356 | 3, // unique_concrete_methods_2 ctxk, m1, m2 |
duke@435 | 357 | 1 // no_finalizable_subclasses ctxk |
duke@435 | 358 | }; |
duke@435 | 359 | |
duke@435 | 360 | const char* Dependencies::dep_name(Dependencies::DepType dept) { |
duke@435 | 361 | if (!dept_in_mask(dept, all_types)) return "?bad-dep?"; |
duke@435 | 362 | return _dep_name[dept]; |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | int Dependencies::dep_args(Dependencies::DepType dept) { |
duke@435 | 366 | if (!dept_in_mask(dept, all_types)) return -1; |
duke@435 | 367 | return _dep_args[dept]; |
duke@435 | 368 | } |
duke@435 | 369 | |
duke@435 | 370 | // for the sake of the compiler log, print out current dependencies: |
duke@435 | 371 | void Dependencies::log_all_dependencies() { |
duke@435 | 372 | if (log() == NULL) return; |
duke@435 | 373 | ciObject* args[max_arg_count]; |
duke@435 | 374 | for (int deptv = (int)FIRST_TYPE; deptv < (int)TYPE_LIMIT; deptv++) { |
duke@435 | 375 | DepType dept = (DepType)deptv; |
duke@435 | 376 | GrowableArray<ciObject*>* deps = _deps[dept]; |
duke@435 | 377 | if (deps->length() == 0) continue; |
duke@435 | 378 | int stride = dep_args(dept); |
duke@435 | 379 | for (int i = 0; i < deps->length(); i += stride) { |
duke@435 | 380 | for (int j = 0; j < stride; j++) { |
duke@435 | 381 | // flush out the identities before printing |
duke@435 | 382 | args[j] = deps->at(i+j); |
duke@435 | 383 | } |
duke@435 | 384 | write_dependency_to(log(), dept, stride, args); |
duke@435 | 385 | } |
duke@435 | 386 | } |
duke@435 | 387 | } |
duke@435 | 388 | |
duke@435 | 389 | void Dependencies::write_dependency_to(CompileLog* log, |
duke@435 | 390 | DepType dept, |
duke@435 | 391 | int nargs, oop args[], |
duke@435 | 392 | klassOop witness) { |
duke@435 | 393 | if (log == NULL) { |
duke@435 | 394 | return; |
duke@435 | 395 | } |
duke@435 | 396 | ciEnv* env = ciEnv::current(); |
duke@435 | 397 | ciObject* ciargs[max_arg_count]; |
duke@435 | 398 | assert(nargs <= max_arg_count, "oob"); |
duke@435 | 399 | for (int j = 0; j < nargs; j++) { |
duke@435 | 400 | ciargs[j] = env->get_object(args[j]); |
duke@435 | 401 | } |
duke@435 | 402 | Dependencies::write_dependency_to(log, dept, nargs, ciargs, witness); |
duke@435 | 403 | } |
duke@435 | 404 | |
duke@435 | 405 | void Dependencies::write_dependency_to(CompileLog* log, |
duke@435 | 406 | DepType dept, |
duke@435 | 407 | int nargs, ciObject* args[], |
duke@435 | 408 | klassOop witness) { |
duke@435 | 409 | if (log == NULL) return; |
duke@435 | 410 | assert(nargs <= max_arg_count, "oob"); |
duke@435 | 411 | int argids[max_arg_count]; |
duke@435 | 412 | int ctxkj = dep_context_arg(dept); // -1 if no context arg |
duke@435 | 413 | int j; |
duke@435 | 414 | for (j = 0; j < nargs; j++) { |
duke@435 | 415 | argids[j] = log->identify(args[j]); |
duke@435 | 416 | } |
duke@435 | 417 | if (witness != NULL) { |
duke@435 | 418 | log->begin_elem("dependency_failed"); |
duke@435 | 419 | } else { |
duke@435 | 420 | log->begin_elem("dependency"); |
duke@435 | 421 | } |
duke@435 | 422 | log->print(" type='%s'", dep_name(dept)); |
duke@435 | 423 | if (ctxkj >= 0) { |
duke@435 | 424 | log->print(" ctxk='%d'", argids[ctxkj]); |
duke@435 | 425 | } |
duke@435 | 426 | // write remaining arguments, if any. |
duke@435 | 427 | for (j = 0; j < nargs; j++) { |
duke@435 | 428 | if (j == ctxkj) continue; // already logged |
duke@435 | 429 | if (j == 1) { |
duke@435 | 430 | log->print( " x='%d'", argids[j]); |
duke@435 | 431 | } else { |
duke@435 | 432 | log->print(" x%d='%d'", j, argids[j]); |
duke@435 | 433 | } |
duke@435 | 434 | } |
duke@435 | 435 | if (witness != NULL) { |
duke@435 | 436 | log->object("witness", witness); |
duke@435 | 437 | log->stamp(); |
duke@435 | 438 | } |
duke@435 | 439 | log->end_elem(); |
duke@435 | 440 | } |
duke@435 | 441 | |
duke@435 | 442 | void Dependencies::write_dependency_to(xmlStream* xtty, |
duke@435 | 443 | DepType dept, |
duke@435 | 444 | int nargs, oop args[], |
duke@435 | 445 | klassOop witness) { |
duke@435 | 446 | if (xtty == NULL) return; |
duke@435 | 447 | ttyLocker ttyl; |
duke@435 | 448 | int ctxkj = dep_context_arg(dept); // -1 if no context arg |
duke@435 | 449 | if (witness != NULL) { |
duke@435 | 450 | xtty->begin_elem("dependency_failed"); |
duke@435 | 451 | } else { |
duke@435 | 452 | xtty->begin_elem("dependency"); |
duke@435 | 453 | } |
duke@435 | 454 | xtty->print(" type='%s'", dep_name(dept)); |
duke@435 | 455 | if (ctxkj >= 0) { |
duke@435 | 456 | xtty->object("ctxk", args[ctxkj]); |
duke@435 | 457 | } |
duke@435 | 458 | // write remaining arguments, if any. |
duke@435 | 459 | for (int j = 0; j < nargs; j++) { |
duke@435 | 460 | if (j == ctxkj) continue; // already logged |
duke@435 | 461 | if (j == 1) { |
duke@435 | 462 | xtty->object("x", args[j]); |
duke@435 | 463 | } else { |
duke@435 | 464 | char xn[10]; sprintf(xn, "x%d", j); |
duke@435 | 465 | xtty->object(xn, args[j]); |
duke@435 | 466 | } |
duke@435 | 467 | } |
duke@435 | 468 | if (witness != NULL) { |
duke@435 | 469 | xtty->object("witness", witness); |
duke@435 | 470 | xtty->stamp(); |
duke@435 | 471 | } |
duke@435 | 472 | xtty->end_elem(); |
duke@435 | 473 | } |
duke@435 | 474 | |
duke@435 | 475 | void Dependencies::print_dependency(DepType dept, int nargs, oop args[], |
duke@435 | 476 | klassOop witness) { |
duke@435 | 477 | ResourceMark rm; |
duke@435 | 478 | ttyLocker ttyl; // keep the following output all in one block |
duke@435 | 479 | tty->print_cr("%s of type %s", |
duke@435 | 480 | (witness == NULL)? "Dependency": "Failed dependency", |
duke@435 | 481 | dep_name(dept)); |
duke@435 | 482 | // print arguments |
duke@435 | 483 | int ctxkj = dep_context_arg(dept); // -1 if no context arg |
duke@435 | 484 | for (int j = 0; j < nargs; j++) { |
duke@435 | 485 | oop arg = args[j]; |
duke@435 | 486 | bool put_star = false; |
duke@435 | 487 | if (arg == NULL) continue; |
duke@435 | 488 | const char* what; |
duke@435 | 489 | if (j == ctxkj) { |
duke@435 | 490 | what = "context"; |
duke@435 | 491 | put_star = !Dependencies::is_concrete_klass((klassOop)arg); |
duke@435 | 492 | } else if (arg->is_method()) { |
duke@435 | 493 | what = "method "; |
duke@435 | 494 | put_star = !Dependencies::is_concrete_method((methodOop)arg); |
duke@435 | 495 | } else if (arg->is_klass()) { |
duke@435 | 496 | what = "class "; |
duke@435 | 497 | } else { |
duke@435 | 498 | what = "object "; |
duke@435 | 499 | } |
duke@435 | 500 | tty->print(" %s = %s", what, (put_star? "*": "")); |
duke@435 | 501 | if (arg->is_klass()) |
duke@435 | 502 | tty->print("%s", Klass::cast((klassOop)arg)->external_name()); |
duke@435 | 503 | else |
duke@435 | 504 | arg->print_value(); |
duke@435 | 505 | tty->cr(); |
duke@435 | 506 | } |
duke@435 | 507 | if (witness != NULL) { |
duke@435 | 508 | bool put_star = !Dependencies::is_concrete_klass(witness); |
duke@435 | 509 | tty->print_cr(" witness = %s%s", |
duke@435 | 510 | (put_star? "*": ""), |
duke@435 | 511 | Klass::cast(witness)->external_name()); |
duke@435 | 512 | } |
duke@435 | 513 | } |
duke@435 | 514 | |
duke@435 | 515 | void Dependencies::DepStream::log_dependency(klassOop witness) { |
duke@435 | 516 | if (_deps == NULL && xtty == NULL) return; // fast cutout for runtime |
duke@435 | 517 | int nargs = argument_count(); |
duke@435 | 518 | oop args[max_arg_count]; |
duke@435 | 519 | for (int j = 0; j < nargs; j++) { |
duke@435 | 520 | args[j] = argument(j); |
duke@435 | 521 | } |
duke@435 | 522 | if (_deps != NULL && _deps->log() != NULL) { |
duke@435 | 523 | Dependencies::write_dependency_to(_deps->log(), |
duke@435 | 524 | type(), nargs, args, witness); |
duke@435 | 525 | } else { |
duke@435 | 526 | Dependencies::write_dependency_to(xtty, |
duke@435 | 527 | type(), nargs, args, witness); |
duke@435 | 528 | } |
duke@435 | 529 | } |
duke@435 | 530 | |
duke@435 | 531 | void Dependencies::DepStream::print_dependency(klassOop witness, bool verbose) { |
duke@435 | 532 | int nargs = argument_count(); |
duke@435 | 533 | oop args[max_arg_count]; |
duke@435 | 534 | for (int j = 0; j < nargs; j++) { |
duke@435 | 535 | args[j] = argument(j); |
duke@435 | 536 | } |
duke@435 | 537 | Dependencies::print_dependency(type(), nargs, args, witness); |
duke@435 | 538 | if (verbose) { |
duke@435 | 539 | if (_code != NULL) { |
duke@435 | 540 | tty->print(" code: "); |
duke@435 | 541 | _code->print_value_on(tty); |
duke@435 | 542 | tty->cr(); |
duke@435 | 543 | } |
duke@435 | 544 | } |
duke@435 | 545 | } |
duke@435 | 546 | |
duke@435 | 547 | |
duke@435 | 548 | /// Dependency stream support (decodes dependencies from an nmethod): |
duke@435 | 549 | |
duke@435 | 550 | #ifdef ASSERT |
duke@435 | 551 | void Dependencies::DepStream::initial_asserts(size_t byte_limit) { |
duke@435 | 552 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 553 | _byte_limit = byte_limit; |
duke@435 | 554 | _type = (DepType)(end_marker-1); // defeat "already at end" assert |
duke@435 | 555 | assert((_code!=NULL) + (_deps!=NULL) == 1, "one or t'other"); |
duke@435 | 556 | } |
duke@435 | 557 | #endif //ASSERT |
duke@435 | 558 | |
duke@435 | 559 | bool Dependencies::DepStream::next() { |
duke@435 | 560 | assert(_type != end_marker, "already at end"); |
duke@435 | 561 | if (_bytes.position() == 0 && _code != NULL |
duke@435 | 562 | && _code->dependencies_size() == 0) { |
duke@435 | 563 | // Method has no dependencies at all. |
duke@435 | 564 | return false; |
duke@435 | 565 | } |
duke@435 | 566 | int code_byte = (_bytes.read_byte() & 0xFF); |
duke@435 | 567 | if (code_byte == end_marker) { |
duke@435 | 568 | DEBUG_ONLY(_type = end_marker); |
duke@435 | 569 | return false; |
duke@435 | 570 | } else { |
duke@435 | 571 | int ctxk_bit = (code_byte & Dependencies::default_context_type_bit); |
duke@435 | 572 | code_byte -= ctxk_bit; |
duke@435 | 573 | DepType dept = (DepType)code_byte; |
duke@435 | 574 | _type = dept; |
duke@435 | 575 | guarantee((dept - FIRST_TYPE) < (TYPE_LIMIT - FIRST_TYPE), |
duke@435 | 576 | "bad dependency type tag"); |
duke@435 | 577 | int stride = _dep_args[dept]; |
duke@435 | 578 | assert(stride == dep_args(dept), "sanity"); |
duke@435 | 579 | int skipj = -1; |
duke@435 | 580 | if (ctxk_bit != 0) { |
duke@435 | 581 | skipj = 0; // currently the only context argument is at zero |
duke@435 | 582 | assert(skipj == dep_context_arg(dept), "zero arg always ctxk"); |
duke@435 | 583 | } |
duke@435 | 584 | for (int j = 0; j < stride; j++) { |
duke@435 | 585 | _xi[j] = (j == skipj)? 0: _bytes.read_int(); |
duke@435 | 586 | } |
duke@435 | 587 | DEBUG_ONLY(_xi[stride] = -1); // help detect overruns |
duke@435 | 588 | return true; |
duke@435 | 589 | } |
duke@435 | 590 | } |
duke@435 | 591 | |
duke@435 | 592 | inline oop Dependencies::DepStream::recorded_oop_at(int i) { |
duke@435 | 593 | return (_code != NULL) |
duke@435 | 594 | ? _code->oop_at(i) |
duke@435 | 595 | : JNIHandles::resolve(_deps->oop_recorder()->handle_at(i)); |
duke@435 | 596 | } |
duke@435 | 597 | |
duke@435 | 598 | oop Dependencies::DepStream::argument(int i) { |
duke@435 | 599 | return recorded_oop_at(argument_index(i)); |
duke@435 | 600 | } |
duke@435 | 601 | |
duke@435 | 602 | klassOop Dependencies::DepStream::context_type() { |
duke@435 | 603 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 604 | int ctxkj = dep_context_arg(_type); // -1 if no context arg |
duke@435 | 605 | if (ctxkj < 0) { |
duke@435 | 606 | return NULL; // for example, evol_method |
duke@435 | 607 | } else { |
duke@435 | 608 | oop k = recorded_oop_at(_xi[ctxkj]); |
duke@435 | 609 | if (k != NULL) { // context type was not compressed away |
duke@435 | 610 | assert(k->is_klass(), "type check"); |
duke@435 | 611 | return (klassOop) k; |
duke@435 | 612 | } else { // recompute "default" context type |
duke@435 | 613 | return ctxk_encoded_as_null(_type, recorded_oop_at(_xi[ctxkj+1])); |
duke@435 | 614 | } |
duke@435 | 615 | } |
duke@435 | 616 | } |
duke@435 | 617 | |
duke@435 | 618 | /// Checking dependencies: |
duke@435 | 619 | |
duke@435 | 620 | // This hierarchy walker inspects subtypes of a given type, |
duke@435 | 621 | // trying to find a "bad" class which breaks a dependency. |
duke@435 | 622 | // Such a class is called a "witness" to the broken dependency. |
duke@435 | 623 | // While searching around, we ignore "participants", which |
duke@435 | 624 | // are already known to the dependency. |
duke@435 | 625 | class ClassHierarchyWalker { |
duke@435 | 626 | public: |
duke@435 | 627 | enum { PARTICIPANT_LIMIT = 3 }; |
duke@435 | 628 | |
duke@435 | 629 | private: |
duke@435 | 630 | // optional method descriptor to check for: |
coleenp@2497 | 631 | Symbol* _name; |
coleenp@2497 | 632 | Symbol* _signature; |
duke@435 | 633 | |
duke@435 | 634 | // special classes which are not allowed to be witnesses: |
duke@435 | 635 | klassOop _participants[PARTICIPANT_LIMIT+1]; |
duke@435 | 636 | int _num_participants; |
duke@435 | 637 | |
duke@435 | 638 | // cache of method lookups |
duke@435 | 639 | methodOop _found_methods[PARTICIPANT_LIMIT+1]; |
duke@435 | 640 | |
duke@435 | 641 | // if non-zero, tells how many witnesses to convert to participants |
duke@435 | 642 | int _record_witnesses; |
duke@435 | 643 | |
duke@435 | 644 | void initialize(klassOop participant) { |
duke@435 | 645 | _record_witnesses = 0; |
duke@435 | 646 | _participants[0] = participant; |
duke@435 | 647 | _found_methods[0] = NULL; |
duke@435 | 648 | _num_participants = 0; |
duke@435 | 649 | if (participant != NULL) { |
duke@435 | 650 | // Terminating NULL. |
duke@435 | 651 | _participants[1] = NULL; |
duke@435 | 652 | _found_methods[1] = NULL; |
duke@435 | 653 | _num_participants = 1; |
duke@435 | 654 | } |
duke@435 | 655 | } |
duke@435 | 656 | |
duke@435 | 657 | void initialize_from_method(methodOop m) { |
duke@435 | 658 | assert(m != NULL && m->is_method(), "sanity"); |
duke@435 | 659 | _name = m->name(); |
duke@435 | 660 | _signature = m->signature(); |
duke@435 | 661 | } |
duke@435 | 662 | |
duke@435 | 663 | public: |
duke@435 | 664 | // The walker is initialized to recognize certain methods and/or types |
duke@435 | 665 | // as friendly participants. |
duke@435 | 666 | ClassHierarchyWalker(klassOop participant, methodOop m) { |
duke@435 | 667 | initialize_from_method(m); |
duke@435 | 668 | initialize(participant); |
duke@435 | 669 | } |
duke@435 | 670 | ClassHierarchyWalker(methodOop m) { |
duke@435 | 671 | initialize_from_method(m); |
duke@435 | 672 | initialize(NULL); |
duke@435 | 673 | } |
duke@435 | 674 | ClassHierarchyWalker(klassOop participant = NULL) { |
duke@435 | 675 | _name = NULL; |
duke@435 | 676 | _signature = NULL; |
duke@435 | 677 | initialize(participant); |
duke@435 | 678 | } |
duke@435 | 679 | |
duke@435 | 680 | // This is common code for two searches: One for concrete subtypes, |
duke@435 | 681 | // the other for concrete method implementations and overrides. |
duke@435 | 682 | bool doing_subtype_search() { |
duke@435 | 683 | return _name == NULL; |
duke@435 | 684 | } |
duke@435 | 685 | |
duke@435 | 686 | int num_participants() { return _num_participants; } |
duke@435 | 687 | klassOop participant(int n) { |
duke@435 | 688 | assert((uint)n <= (uint)_num_participants, "oob"); |
duke@435 | 689 | return _participants[n]; |
duke@435 | 690 | } |
duke@435 | 691 | |
duke@435 | 692 | // Note: If n==num_participants, returns NULL. |
duke@435 | 693 | methodOop found_method(int n) { |
duke@435 | 694 | assert((uint)n <= (uint)_num_participants, "oob"); |
duke@435 | 695 | methodOop fm = _found_methods[n]; |
duke@435 | 696 | assert(n == _num_participants || fm != NULL, "proper usage"); |
duke@435 | 697 | assert(fm == NULL || fm->method_holder() == _participants[n], "sanity"); |
duke@435 | 698 | return fm; |
duke@435 | 699 | } |
duke@435 | 700 | |
duke@435 | 701 | #ifdef ASSERT |
duke@435 | 702 | // Assert that m is inherited into ctxk, without intervening overrides. |
duke@435 | 703 | // (May return true even if this is not true, in corner cases where we punt.) |
duke@435 | 704 | bool check_method_context(klassOop ctxk, methodOop m) { |
duke@435 | 705 | if (m->method_holder() == ctxk) |
duke@435 | 706 | return true; // Quick win. |
duke@435 | 707 | if (m->is_private()) |
duke@435 | 708 | return false; // Quick lose. Should not happen. |
duke@435 | 709 | if (!(m->is_public() || m->is_protected())) |
duke@435 | 710 | // The override story is complex when packages get involved. |
duke@435 | 711 | return true; // Must punt the assertion to true. |
duke@435 | 712 | Klass* k = Klass::cast(ctxk); |
duke@435 | 713 | methodOop lm = k->lookup_method(m->name(), m->signature()); |
duke@435 | 714 | if (lm == NULL && k->oop_is_instance()) { |
duke@435 | 715 | // It might be an abstract interface method, devoid of mirandas. |
duke@435 | 716 | lm = ((instanceKlass*)k)->lookup_method_in_all_interfaces(m->name(), |
duke@435 | 717 | m->signature()); |
duke@435 | 718 | } |
duke@435 | 719 | if (lm == m) |
duke@435 | 720 | // Method m is inherited into ctxk. |
duke@435 | 721 | return true; |
duke@435 | 722 | if (lm != NULL) { |
duke@435 | 723 | if (!(lm->is_public() || lm->is_protected())) |
duke@435 | 724 | // Method is [package-]private, so the override story is complex. |
duke@435 | 725 | return true; // Must punt the assertion to true. |
duke@435 | 726 | if ( !Dependencies::is_concrete_method(lm) |
duke@435 | 727 | && !Dependencies::is_concrete_method(m) |
duke@435 | 728 | && Klass::cast(lm->method_holder())->is_subtype_of(m->method_holder())) |
duke@435 | 729 | // Method m is overridden by lm, but both are non-concrete. |
duke@435 | 730 | return true; |
duke@435 | 731 | } |
duke@435 | 732 | ResourceMark rm; |
duke@435 | 733 | tty->print_cr("Dependency method not found in the associated context:"); |
duke@435 | 734 | tty->print_cr(" context = %s", Klass::cast(ctxk)->external_name()); |
duke@435 | 735 | tty->print( " method = "); m->print_short_name(tty); tty->cr(); |
duke@435 | 736 | if (lm != NULL) { |
duke@435 | 737 | tty->print( " found = "); lm->print_short_name(tty); tty->cr(); |
duke@435 | 738 | } |
duke@435 | 739 | return false; |
duke@435 | 740 | } |
duke@435 | 741 | #endif |
duke@435 | 742 | |
duke@435 | 743 | void add_participant(klassOop participant) { |
duke@435 | 744 | assert(_num_participants + _record_witnesses < PARTICIPANT_LIMIT, "oob"); |
duke@435 | 745 | int np = _num_participants++; |
duke@435 | 746 | _participants[np] = participant; |
duke@435 | 747 | _participants[np+1] = NULL; |
duke@435 | 748 | _found_methods[np+1] = NULL; |
duke@435 | 749 | } |
duke@435 | 750 | |
duke@435 | 751 | void record_witnesses(int add) { |
duke@435 | 752 | if (add > PARTICIPANT_LIMIT) add = PARTICIPANT_LIMIT; |
duke@435 | 753 | assert(_num_participants + add < PARTICIPANT_LIMIT, "oob"); |
duke@435 | 754 | _record_witnesses = add; |
duke@435 | 755 | } |
duke@435 | 756 | |
duke@435 | 757 | bool is_witness(klassOop k) { |
duke@435 | 758 | if (doing_subtype_search()) { |
duke@435 | 759 | return Dependencies::is_concrete_klass(k); |
duke@435 | 760 | } else { |
duke@435 | 761 | methodOop m = instanceKlass::cast(k)->find_method(_name, _signature); |
duke@435 | 762 | if (m == NULL || !Dependencies::is_concrete_method(m)) return false; |
duke@435 | 763 | _found_methods[_num_participants] = m; |
duke@435 | 764 | // Note: If add_participant(k) is called, |
duke@435 | 765 | // the method m will already be memoized for it. |
duke@435 | 766 | return true; |
duke@435 | 767 | } |
duke@435 | 768 | } |
duke@435 | 769 | |
duke@435 | 770 | bool is_participant(klassOop k) { |
duke@435 | 771 | if (k == _participants[0]) { |
duke@435 | 772 | return true; |
duke@435 | 773 | } else if (_num_participants <= 1) { |
duke@435 | 774 | return false; |
duke@435 | 775 | } else { |
duke@435 | 776 | return in_list(k, &_participants[1]); |
duke@435 | 777 | } |
duke@435 | 778 | } |
duke@435 | 779 | bool ignore_witness(klassOop witness) { |
duke@435 | 780 | if (_record_witnesses == 0) { |
duke@435 | 781 | return false; |
duke@435 | 782 | } else { |
duke@435 | 783 | --_record_witnesses; |
duke@435 | 784 | add_participant(witness); |
duke@435 | 785 | return true; |
duke@435 | 786 | } |
duke@435 | 787 | } |
duke@435 | 788 | static bool in_list(klassOop x, klassOop* list) { |
duke@435 | 789 | for (int i = 0; ; i++) { |
duke@435 | 790 | klassOop y = list[i]; |
duke@435 | 791 | if (y == NULL) break; |
duke@435 | 792 | if (y == x) return true; |
duke@435 | 793 | } |
duke@435 | 794 | return false; // not in list |
duke@435 | 795 | } |
duke@435 | 796 | |
duke@435 | 797 | private: |
duke@435 | 798 | // the actual search method: |
duke@435 | 799 | klassOop find_witness_anywhere(klassOop context_type, |
duke@435 | 800 | bool participants_hide_witnesses, |
duke@435 | 801 | bool top_level_call = true); |
duke@435 | 802 | // the spot-checking version: |
duke@435 | 803 | klassOop find_witness_in(DepChange& changes, |
duke@435 | 804 | klassOop context_type, |
duke@435 | 805 | bool participants_hide_witnesses); |
duke@435 | 806 | public: |
duke@435 | 807 | klassOop find_witness_subtype(klassOop context_type, DepChange* changes = NULL) { |
duke@435 | 808 | assert(doing_subtype_search(), "must set up a subtype search"); |
duke@435 | 809 | // When looking for unexpected concrete types, |
duke@435 | 810 | // do not look beneath expected ones. |
duke@435 | 811 | const bool participants_hide_witnesses = true; |
duke@435 | 812 | // CX > CC > C' is OK, even if C' is new. |
duke@435 | 813 | // CX > { CC, C' } is not OK if C' is new, and C' is the witness. |
duke@435 | 814 | if (changes != NULL) { |
duke@435 | 815 | return find_witness_in(*changes, context_type, participants_hide_witnesses); |
duke@435 | 816 | } else { |
duke@435 | 817 | return find_witness_anywhere(context_type, participants_hide_witnesses); |
duke@435 | 818 | } |
duke@435 | 819 | } |
duke@435 | 820 | klassOop find_witness_definer(klassOop context_type, DepChange* changes = NULL) { |
duke@435 | 821 | assert(!doing_subtype_search(), "must set up a method definer search"); |
duke@435 | 822 | // When looking for unexpected concrete methods, |
duke@435 | 823 | // look beneath expected ones, to see if there are overrides. |
duke@435 | 824 | const bool participants_hide_witnesses = true; |
duke@435 | 825 | // CX.m > CC.m > C'.m is not OK, if C'.m is new, and C' is the witness. |
duke@435 | 826 | if (changes != NULL) { |
duke@435 | 827 | return find_witness_in(*changes, context_type, !participants_hide_witnesses); |
duke@435 | 828 | } else { |
duke@435 | 829 | return find_witness_anywhere(context_type, !participants_hide_witnesses); |
duke@435 | 830 | } |
duke@435 | 831 | } |
duke@435 | 832 | }; |
duke@435 | 833 | |
duke@435 | 834 | #ifndef PRODUCT |
duke@435 | 835 | static int deps_find_witness_calls = 0; |
duke@435 | 836 | static int deps_find_witness_steps = 0; |
duke@435 | 837 | static int deps_find_witness_recursions = 0; |
duke@435 | 838 | static int deps_find_witness_singles = 0; |
duke@435 | 839 | static int deps_find_witness_print = 0; // set to -1 to force a final print |
duke@435 | 840 | static bool count_find_witness_calls() { |
duke@435 | 841 | if (TraceDependencies || LogCompilation) { |
duke@435 | 842 | int pcount = deps_find_witness_print + 1; |
duke@435 | 843 | bool final_stats = (pcount == 0); |
duke@435 | 844 | bool initial_call = (pcount == 1); |
duke@435 | 845 | bool occasional_print = ((pcount & ((1<<10) - 1)) == 0); |
duke@435 | 846 | if (pcount < 0) pcount = 1; // crude overflow protection |
duke@435 | 847 | deps_find_witness_print = pcount; |
duke@435 | 848 | if (VerifyDependencies && initial_call) { |
duke@435 | 849 | tty->print_cr("Warning: TraceDependencies results may be inflated by VerifyDependencies"); |
duke@435 | 850 | } |
duke@435 | 851 | if (occasional_print || final_stats) { |
duke@435 | 852 | // Every now and then dump a little info about dependency searching. |
duke@435 | 853 | if (xtty != NULL) { |
kvn@1641 | 854 | ttyLocker ttyl; |
kvn@1641 | 855 | xtty->elem("deps_find_witness calls='%d' steps='%d' recursions='%d' singles='%d'", |
duke@435 | 856 | deps_find_witness_calls, |
duke@435 | 857 | deps_find_witness_steps, |
duke@435 | 858 | deps_find_witness_recursions, |
duke@435 | 859 | deps_find_witness_singles); |
duke@435 | 860 | } |
duke@435 | 861 | if (final_stats || (TraceDependencies && WizardMode)) { |
kvn@1641 | 862 | ttyLocker ttyl; |
duke@435 | 863 | tty->print_cr("Dependency check (find_witness) " |
duke@435 | 864 | "calls=%d, steps=%d (avg=%.1f), recursions=%d, singles=%d", |
duke@435 | 865 | deps_find_witness_calls, |
duke@435 | 866 | deps_find_witness_steps, |
duke@435 | 867 | (double)deps_find_witness_steps / deps_find_witness_calls, |
duke@435 | 868 | deps_find_witness_recursions, |
duke@435 | 869 | deps_find_witness_singles); |
duke@435 | 870 | } |
duke@435 | 871 | } |
duke@435 | 872 | return true; |
duke@435 | 873 | } |
duke@435 | 874 | return false; |
duke@435 | 875 | } |
duke@435 | 876 | #else |
duke@435 | 877 | #define count_find_witness_calls() (0) |
duke@435 | 878 | #endif //PRODUCT |
duke@435 | 879 | |
duke@435 | 880 | |
duke@435 | 881 | klassOop ClassHierarchyWalker::find_witness_in(DepChange& changes, |
duke@435 | 882 | klassOop context_type, |
duke@435 | 883 | bool participants_hide_witnesses) { |
duke@435 | 884 | assert(changes.involves_context(context_type), "irrelevant dependency"); |
duke@435 | 885 | klassOop new_type = changes.new_type(); |
duke@435 | 886 | |
duke@435 | 887 | count_find_witness_calls(); |
duke@435 | 888 | NOT_PRODUCT(deps_find_witness_singles++); |
duke@435 | 889 | |
duke@435 | 890 | // Current thread must be in VM (not native mode, as in CI): |
duke@435 | 891 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 892 | // Must not move the class hierarchy during this check: |
duke@435 | 893 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 894 | |
jrose@465 | 895 | int nof_impls = instanceKlass::cast(context_type)->nof_implementors(); |
jrose@465 | 896 | if (nof_impls > 1) { |
jrose@465 | 897 | // Avoid this case: *I.m > { A.m, C }; B.m > C |
jrose@465 | 898 | // %%% Until this is fixed more systematically, bail out. |
jrose@465 | 899 | // See corresponding comment in find_witness_anywhere. |
jrose@465 | 900 | return context_type; |
jrose@465 | 901 | } |
jrose@465 | 902 | |
duke@435 | 903 | assert(!is_participant(new_type), "only old classes are participants"); |
duke@435 | 904 | if (participants_hide_witnesses) { |
duke@435 | 905 | // If the new type is a subtype of a participant, we are done. |
duke@435 | 906 | for (int i = 0; i < num_participants(); i++) { |
duke@435 | 907 | klassOop part = participant(i); |
duke@435 | 908 | if (part == NULL) continue; |
duke@435 | 909 | assert(changes.involves_context(part) == Klass::cast(new_type)->is_subtype_of(part), |
duke@435 | 910 | "correct marking of participants, b/c new_type is unique"); |
duke@435 | 911 | if (changes.involves_context(part)) { |
duke@435 | 912 | // new guy is protected from this check by previous participant |
duke@435 | 913 | return NULL; |
duke@435 | 914 | } |
duke@435 | 915 | } |
duke@435 | 916 | } |
duke@435 | 917 | |
duke@435 | 918 | if (is_witness(new_type) && |
duke@435 | 919 | !ignore_witness(new_type)) { |
duke@435 | 920 | return new_type; |
duke@435 | 921 | } |
duke@435 | 922 | |
duke@435 | 923 | return NULL; |
duke@435 | 924 | } |
duke@435 | 925 | |
duke@435 | 926 | |
duke@435 | 927 | // Walk hierarchy under a context type, looking for unexpected types. |
duke@435 | 928 | // Do not report participant types, and recursively walk beneath |
duke@435 | 929 | // them only if participants_hide_witnesses is false. |
duke@435 | 930 | // If top_level_call is false, skip testing the context type, |
duke@435 | 931 | // because the caller has already considered it. |
duke@435 | 932 | klassOop ClassHierarchyWalker::find_witness_anywhere(klassOop context_type, |
duke@435 | 933 | bool participants_hide_witnesses, |
duke@435 | 934 | bool top_level_call) { |
duke@435 | 935 | // Current thread must be in VM (not native mode, as in CI): |
duke@435 | 936 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 937 | // Must not move the class hierarchy during this check: |
duke@435 | 938 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 939 | |
duke@435 | 940 | bool do_counts = count_find_witness_calls(); |
duke@435 | 941 | |
duke@435 | 942 | // Check the root of the sub-hierarchy first. |
duke@435 | 943 | if (top_level_call) { |
duke@435 | 944 | if (do_counts) { |
duke@435 | 945 | NOT_PRODUCT(deps_find_witness_calls++); |
duke@435 | 946 | NOT_PRODUCT(deps_find_witness_steps++); |
duke@435 | 947 | } |
duke@435 | 948 | if (is_participant(context_type)) { |
duke@435 | 949 | if (participants_hide_witnesses) return NULL; |
duke@435 | 950 | // else fall through to search loop... |
duke@435 | 951 | } else if (is_witness(context_type) && !ignore_witness(context_type)) { |
duke@435 | 952 | // The context is an abstract class or interface, to start with. |
duke@435 | 953 | return context_type; |
duke@435 | 954 | } |
duke@435 | 955 | } |
duke@435 | 956 | |
duke@435 | 957 | // Now we must check each implementor and each subclass. |
duke@435 | 958 | // Use a short worklist to avoid blowing the stack. |
duke@435 | 959 | // Each worklist entry is a *chain* of subklass siblings to process. |
duke@435 | 960 | const int CHAINMAX = 100; // >= 1 + instanceKlass::implementors_limit |
duke@435 | 961 | Klass* chains[CHAINMAX]; |
duke@435 | 962 | int chaini = 0; // index into worklist |
duke@435 | 963 | Klass* chain; // scratch variable |
duke@435 | 964 | #define ADD_SUBCLASS_CHAIN(k) { \ |
duke@435 | 965 | assert(chaini < CHAINMAX, "oob"); \ |
duke@435 | 966 | chain = instanceKlass::cast(k)->subklass(); \ |
duke@435 | 967 | if (chain != NULL) chains[chaini++] = chain; } |
duke@435 | 968 | |
duke@435 | 969 | // Look for non-abstract subclasses. |
duke@435 | 970 | // (Note: Interfaces do not have subclasses.) |
duke@435 | 971 | ADD_SUBCLASS_CHAIN(context_type); |
duke@435 | 972 | |
duke@435 | 973 | // If it is an interface, search its direct implementors. |
duke@435 | 974 | // (Their subclasses are additional indirect implementors. |
duke@435 | 975 | // See instanceKlass::add_implementor.) |
duke@435 | 976 | // (Note: nof_implementors is always zero for non-interfaces.) |
duke@435 | 977 | int nof_impls = instanceKlass::cast(context_type)->nof_implementors(); |
duke@435 | 978 | if (nof_impls > 1) { |
duke@435 | 979 | // Avoid this case: *I.m > { A.m, C }; B.m > C |
duke@435 | 980 | // Here, I.m has 2 concrete implementations, but m appears unique |
duke@435 | 981 | // as A.m, because the search misses B.m when checking C. |
duke@435 | 982 | // The inherited method B.m was getting missed by the walker |
duke@435 | 983 | // when interface 'I' was the starting point. |
duke@435 | 984 | // %%% Until this is fixed more systematically, bail out. |
duke@435 | 985 | // (Old CHA had the same limitation.) |
duke@435 | 986 | return context_type; |
duke@435 | 987 | } |
duke@435 | 988 | for (int i = 0; i < nof_impls; i++) { |
duke@435 | 989 | klassOop impl = instanceKlass::cast(context_type)->implementor(i); |
duke@435 | 990 | if (impl == NULL) { |
duke@435 | 991 | // implementors array overflowed => no exact info. |
duke@435 | 992 | return context_type; // report an inexact witness to this sad affair |
duke@435 | 993 | } |
duke@435 | 994 | if (do_counts) |
duke@435 | 995 | { NOT_PRODUCT(deps_find_witness_steps++); } |
duke@435 | 996 | if (is_participant(impl)) { |
duke@435 | 997 | if (participants_hide_witnesses) continue; |
duke@435 | 998 | // else fall through to process this guy's subclasses |
duke@435 | 999 | } else if (is_witness(impl) && !ignore_witness(impl)) { |
duke@435 | 1000 | return impl; |
duke@435 | 1001 | } |
duke@435 | 1002 | ADD_SUBCLASS_CHAIN(impl); |
duke@435 | 1003 | } |
duke@435 | 1004 | |
duke@435 | 1005 | // Recursively process each non-trivial sibling chain. |
duke@435 | 1006 | while (chaini > 0) { |
duke@435 | 1007 | Klass* chain = chains[--chaini]; |
duke@435 | 1008 | for (Klass* subk = chain; subk != NULL; subk = subk->next_sibling()) { |
duke@435 | 1009 | klassOop sub = subk->as_klassOop(); |
duke@435 | 1010 | if (do_counts) { NOT_PRODUCT(deps_find_witness_steps++); } |
duke@435 | 1011 | if (is_participant(sub)) { |
duke@435 | 1012 | if (participants_hide_witnesses) continue; |
duke@435 | 1013 | // else fall through to process this guy's subclasses |
duke@435 | 1014 | } else if (is_witness(sub) && !ignore_witness(sub)) { |
duke@435 | 1015 | return sub; |
duke@435 | 1016 | } |
duke@435 | 1017 | if (chaini < (VerifyDependencies? 2: CHAINMAX)) { |
duke@435 | 1018 | // Fast path. (Partially disabled if VerifyDependencies.) |
duke@435 | 1019 | ADD_SUBCLASS_CHAIN(sub); |
duke@435 | 1020 | } else { |
duke@435 | 1021 | // Worklist overflow. Do a recursive call. Should be rare. |
duke@435 | 1022 | // The recursive call will have its own worklist, of course. |
duke@435 | 1023 | // (Note that sub has already been tested, so that there is |
duke@435 | 1024 | // no need for the recursive call to re-test. That's handy, |
duke@435 | 1025 | // since the recursive call sees sub as the context_type.) |
duke@435 | 1026 | if (do_counts) { NOT_PRODUCT(deps_find_witness_recursions++); } |
duke@435 | 1027 | klassOop witness = find_witness_anywhere(sub, |
duke@435 | 1028 | participants_hide_witnesses, |
duke@435 | 1029 | /*top_level_call=*/ false); |
duke@435 | 1030 | if (witness != NULL) return witness; |
duke@435 | 1031 | } |
duke@435 | 1032 | } |
duke@435 | 1033 | } |
duke@435 | 1034 | |
duke@435 | 1035 | // No witness found. The dependency remains unbroken. |
duke@435 | 1036 | return NULL; |
duke@435 | 1037 | #undef ADD_SUBCLASS_CHAIN |
duke@435 | 1038 | } |
duke@435 | 1039 | |
duke@435 | 1040 | |
duke@435 | 1041 | bool Dependencies::is_concrete_klass(klassOop k) { |
duke@435 | 1042 | if (Klass::cast(k)->is_abstract()) return false; |
duke@435 | 1043 | // %%% We could treat classes which are concrete but |
duke@435 | 1044 | // have not yet been instantiated as virtually abstract. |
duke@435 | 1045 | // This would require a deoptimization barrier on first instantiation. |
duke@435 | 1046 | //if (k->is_not_instantiated()) return false; |
duke@435 | 1047 | return true; |
duke@435 | 1048 | } |
duke@435 | 1049 | |
duke@435 | 1050 | bool Dependencies::is_concrete_method(methodOop m) { |
duke@435 | 1051 | if (m->is_abstract()) return false; |
duke@435 | 1052 | // %%% We could treat unexecuted methods as virtually abstract also. |
duke@435 | 1053 | // This would require a deoptimization barrier on first execution. |
duke@435 | 1054 | return !m->is_abstract(); |
duke@435 | 1055 | } |
duke@435 | 1056 | |
duke@435 | 1057 | |
duke@435 | 1058 | Klass* Dependencies::find_finalizable_subclass(Klass* k) { |
duke@435 | 1059 | if (k->is_interface()) return NULL; |
duke@435 | 1060 | if (k->has_finalizer()) return k; |
duke@435 | 1061 | k = k->subklass(); |
duke@435 | 1062 | while (k != NULL) { |
duke@435 | 1063 | Klass* result = find_finalizable_subclass(k); |
duke@435 | 1064 | if (result != NULL) return result; |
duke@435 | 1065 | k = k->next_sibling(); |
duke@435 | 1066 | } |
duke@435 | 1067 | return NULL; |
duke@435 | 1068 | } |
duke@435 | 1069 | |
duke@435 | 1070 | |
duke@435 | 1071 | bool Dependencies::is_concrete_klass(ciInstanceKlass* k) { |
duke@435 | 1072 | if (k->is_abstract()) return false; |
duke@435 | 1073 | // We could return also false if k does not yet appear to be |
duke@435 | 1074 | // instantiated, if the VM version supports this distinction also. |
duke@435 | 1075 | //if (k->is_not_instantiated()) return false; |
duke@435 | 1076 | return true; |
duke@435 | 1077 | } |
duke@435 | 1078 | |
duke@435 | 1079 | bool Dependencies::is_concrete_method(ciMethod* m) { |
duke@435 | 1080 | // Statics are irrelevant to virtual call sites. |
duke@435 | 1081 | if (m->is_static()) return false; |
duke@435 | 1082 | |
duke@435 | 1083 | // We could return also false if m does not yet appear to be |
duke@435 | 1084 | // executed, if the VM version supports this distinction also. |
duke@435 | 1085 | return !m->is_abstract(); |
duke@435 | 1086 | } |
duke@435 | 1087 | |
duke@435 | 1088 | |
duke@435 | 1089 | bool Dependencies::has_finalizable_subclass(ciInstanceKlass* k) { |
duke@435 | 1090 | return k->has_finalizable_subclass(); |
duke@435 | 1091 | } |
duke@435 | 1092 | |
duke@435 | 1093 | |
duke@435 | 1094 | // Any use of the contents (bytecodes) of a method must be |
duke@435 | 1095 | // marked by an "evol_method" dependency, if those contents |
duke@435 | 1096 | // can change. (Note: A method is always dependent on itself.) |
duke@435 | 1097 | klassOop Dependencies::check_evol_method(methodOop m) { |
duke@435 | 1098 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 1099 | // Did somebody do a JVMTI RedefineClasses while our backs were turned? |
duke@435 | 1100 | // Or is there a now a breakpoint? |
duke@435 | 1101 | // (Assumes compiled code cannot handle bkpts; change if UseFastBreakpoints.) |
duke@435 | 1102 | if (m->is_old() |
duke@435 | 1103 | || m->number_of_breakpoints() > 0) { |
duke@435 | 1104 | return m->method_holder(); |
duke@435 | 1105 | } else { |
duke@435 | 1106 | return NULL; |
duke@435 | 1107 | } |
duke@435 | 1108 | } |
duke@435 | 1109 | |
duke@435 | 1110 | // This is a strong assertion: It is that the given type |
duke@435 | 1111 | // has no subtypes whatever. It is most useful for |
duke@435 | 1112 | // optimizing checks on reflected types or on array types. |
duke@435 | 1113 | // (Checks on types which are derived from real instances |
duke@435 | 1114 | // can be optimized more strongly than this, because we |
duke@435 | 1115 | // know that the checked type comes from a concrete type, |
duke@435 | 1116 | // and therefore we can disregard abstract types.) |
duke@435 | 1117 | klassOop Dependencies::check_leaf_type(klassOop ctxk) { |
duke@435 | 1118 | assert(must_be_in_vm(), "raw oops here"); |
duke@435 | 1119 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 1120 | instanceKlass* ctx = instanceKlass::cast(ctxk); |
duke@435 | 1121 | Klass* sub = ctx->subklass(); |
duke@435 | 1122 | if (sub != NULL) { |
duke@435 | 1123 | return sub->as_klassOop(); |
duke@435 | 1124 | } else if (ctx->nof_implementors() != 0) { |
duke@435 | 1125 | // if it is an interface, it must be unimplemented |
duke@435 | 1126 | // (if it is not an interface, nof_implementors is always zero) |
duke@435 | 1127 | klassOop impl = ctx->implementor(0); |
duke@435 | 1128 | return (impl != NULL)? impl: ctxk; |
duke@435 | 1129 | } else { |
duke@435 | 1130 | return NULL; |
duke@435 | 1131 | } |
duke@435 | 1132 | } |
duke@435 | 1133 | |
duke@435 | 1134 | // Test the assertion that conck is the only concrete subtype* of ctxk. |
duke@435 | 1135 | // The type conck itself is allowed to have have further concrete subtypes. |
duke@435 | 1136 | // This allows the compiler to narrow occurrences of ctxk by conck, |
duke@435 | 1137 | // when dealing with the types of actual instances. |
duke@435 | 1138 | klassOop Dependencies::check_abstract_with_unique_concrete_subtype(klassOop ctxk, |
duke@435 | 1139 | klassOop conck, |
duke@435 | 1140 | DepChange* changes) { |
duke@435 | 1141 | ClassHierarchyWalker wf(conck); |
duke@435 | 1142 | return wf.find_witness_subtype(ctxk, changes); |
duke@435 | 1143 | } |
duke@435 | 1144 | |
duke@435 | 1145 | // If a non-concrete class has no concrete subtypes, it is not (yet) |
duke@435 | 1146 | // instantiatable. This can allow the compiler to make some paths go |
duke@435 | 1147 | // dead, if they are gated by a test of the type. |
duke@435 | 1148 | klassOop Dependencies::check_abstract_with_no_concrete_subtype(klassOop ctxk, |
duke@435 | 1149 | DepChange* changes) { |
duke@435 | 1150 | // Find any concrete subtype, with no participants: |
duke@435 | 1151 | ClassHierarchyWalker wf; |
duke@435 | 1152 | return wf.find_witness_subtype(ctxk, changes); |
duke@435 | 1153 | } |
duke@435 | 1154 | |
duke@435 | 1155 | |
duke@435 | 1156 | // If a concrete class has no concrete subtypes, it can always be |
duke@435 | 1157 | // exactly typed. This allows the use of a cheaper type test. |
duke@435 | 1158 | klassOop Dependencies::check_concrete_with_no_concrete_subtype(klassOop ctxk, |
duke@435 | 1159 | DepChange* changes) { |
duke@435 | 1160 | // Find any concrete subtype, with only the ctxk as participant: |
duke@435 | 1161 | ClassHierarchyWalker wf(ctxk); |
duke@435 | 1162 | return wf.find_witness_subtype(ctxk, changes); |
duke@435 | 1163 | } |
duke@435 | 1164 | |
duke@435 | 1165 | |
duke@435 | 1166 | // Find the unique concrete proper subtype of ctxk, or NULL if there |
duke@435 | 1167 | // is more than one concrete proper subtype. If there are no concrete |
duke@435 | 1168 | // proper subtypes, return ctxk itself, whether it is concrete or not. |
duke@435 | 1169 | // The returned subtype is allowed to have have further concrete subtypes. |
duke@435 | 1170 | // That is, return CC1 for CX > CC1 > CC2, but NULL for CX > { CC1, CC2 }. |
duke@435 | 1171 | klassOop Dependencies::find_unique_concrete_subtype(klassOop ctxk) { |
duke@435 | 1172 | ClassHierarchyWalker wf(ctxk); // Ignore ctxk when walking. |
duke@435 | 1173 | wf.record_witnesses(1); // Record one other witness when walking. |
duke@435 | 1174 | klassOop wit = wf.find_witness_subtype(ctxk); |
duke@435 | 1175 | if (wit != NULL) return NULL; // Too many witnesses. |
duke@435 | 1176 | klassOop conck = wf.participant(0); |
duke@435 | 1177 | if (conck == NULL) { |
duke@435 | 1178 | #ifndef PRODUCT |
duke@435 | 1179 | // Make sure the dependency mechanism will pass this discovery: |
duke@435 | 1180 | if (VerifyDependencies) { |
duke@435 | 1181 | // Turn off dependency tracing while actually testing deps. |
duke@435 | 1182 | FlagSetting fs(TraceDependencies, false); |
duke@435 | 1183 | if (!Dependencies::is_concrete_klass(ctxk)) { |
duke@435 | 1184 | guarantee(NULL == |
duke@435 | 1185 | (void *)check_abstract_with_no_concrete_subtype(ctxk), |
duke@435 | 1186 | "verify dep."); |
duke@435 | 1187 | } else { |
duke@435 | 1188 | guarantee(NULL == |
duke@435 | 1189 | (void *)check_concrete_with_no_concrete_subtype(ctxk), |
duke@435 | 1190 | "verify dep."); |
duke@435 | 1191 | } |
duke@435 | 1192 | } |
duke@435 | 1193 | #endif //PRODUCT |
duke@435 | 1194 | return ctxk; // Return ctxk as a flag for "no subtypes". |
duke@435 | 1195 | } else { |
duke@435 | 1196 | #ifndef PRODUCT |
duke@435 | 1197 | // Make sure the dependency mechanism will pass this discovery: |
duke@435 | 1198 | if (VerifyDependencies) { |
duke@435 | 1199 | // Turn off dependency tracing while actually testing deps. |
duke@435 | 1200 | FlagSetting fs(TraceDependencies, false); |
duke@435 | 1201 | if (!Dependencies::is_concrete_klass(ctxk)) { |
duke@435 | 1202 | guarantee(NULL == (void *) |
duke@435 | 1203 | check_abstract_with_unique_concrete_subtype(ctxk, conck), |
duke@435 | 1204 | "verify dep."); |
duke@435 | 1205 | } |
duke@435 | 1206 | } |
duke@435 | 1207 | #endif //PRODUCT |
duke@435 | 1208 | return conck; |
duke@435 | 1209 | } |
duke@435 | 1210 | } |
duke@435 | 1211 | |
duke@435 | 1212 | // Test the assertion that the k[12] are the only concrete subtypes of ctxk, |
duke@435 | 1213 | // except possibly for further subtypes of k[12] themselves. |
duke@435 | 1214 | // The context type must be abstract. The types k1 and k2 are themselves |
duke@435 | 1215 | // allowed to have further concrete subtypes. |
duke@435 | 1216 | klassOop Dependencies::check_abstract_with_exclusive_concrete_subtypes( |
duke@435 | 1217 | klassOop ctxk, |
duke@435 | 1218 | klassOop k1, |
duke@435 | 1219 | klassOop k2, |
duke@435 | 1220 | DepChange* changes) { |
duke@435 | 1221 | ClassHierarchyWalker wf; |
duke@435 | 1222 | wf.add_participant(k1); |
duke@435 | 1223 | wf.add_participant(k2); |
duke@435 | 1224 | return wf.find_witness_subtype(ctxk, changes); |
duke@435 | 1225 | } |
duke@435 | 1226 | |
duke@435 | 1227 | // Search ctxk for concrete implementations. If there are klen or fewer, |
duke@435 | 1228 | // pack them into the given array and return the number. |
duke@435 | 1229 | // Otherwise, return -1, meaning the given array would overflow. |
duke@435 | 1230 | // (Note that a return of 0 means there are exactly no concrete subtypes.) |
duke@435 | 1231 | // In this search, if ctxk is concrete, it will be reported alone. |
duke@435 | 1232 | // For any type CC reported, no proper subtypes of CC will be reported. |
duke@435 | 1233 | int Dependencies::find_exclusive_concrete_subtypes(klassOop ctxk, |
duke@435 | 1234 | int klen, |
duke@435 | 1235 | klassOop karray[]) { |
duke@435 | 1236 | ClassHierarchyWalker wf; |
duke@435 | 1237 | wf.record_witnesses(klen); |
duke@435 | 1238 | klassOop wit = wf.find_witness_subtype(ctxk); |
duke@435 | 1239 | if (wit != NULL) return -1; // Too many witnesses. |
duke@435 | 1240 | int num = wf.num_participants(); |
duke@435 | 1241 | assert(num <= klen, "oob"); |
duke@435 | 1242 | // Pack the result array with the good news. |
duke@435 | 1243 | for (int i = 0; i < num; i++) |
duke@435 | 1244 | karray[i] = wf.participant(i); |
duke@435 | 1245 | #ifndef PRODUCT |
duke@435 | 1246 | // Make sure the dependency mechanism will pass this discovery: |
duke@435 | 1247 | if (VerifyDependencies) { |
duke@435 | 1248 | // Turn off dependency tracing while actually testing deps. |
duke@435 | 1249 | FlagSetting fs(TraceDependencies, false); |
duke@435 | 1250 | switch (Dependencies::is_concrete_klass(ctxk)? -1: num) { |
duke@435 | 1251 | case -1: // ctxk was itself concrete |
duke@435 | 1252 | guarantee(num == 1 && karray[0] == ctxk, "verify dep."); |
duke@435 | 1253 | break; |
duke@435 | 1254 | case 0: |
duke@435 | 1255 | guarantee(NULL == (void *)check_abstract_with_no_concrete_subtype(ctxk), |
duke@435 | 1256 | "verify dep."); |
duke@435 | 1257 | break; |
duke@435 | 1258 | case 1: |
duke@435 | 1259 | guarantee(NULL == (void *) |
duke@435 | 1260 | check_abstract_with_unique_concrete_subtype(ctxk, karray[0]), |
duke@435 | 1261 | "verify dep."); |
duke@435 | 1262 | break; |
duke@435 | 1263 | case 2: |
duke@435 | 1264 | guarantee(NULL == (void *) |
duke@435 | 1265 | check_abstract_with_exclusive_concrete_subtypes(ctxk, |
duke@435 | 1266 | karray[0], |
duke@435 | 1267 | karray[1]), |
duke@435 | 1268 | "verify dep."); |
duke@435 | 1269 | break; |
duke@435 | 1270 | default: |
duke@435 | 1271 | ShouldNotReachHere(); // klen > 2 yet supported |
duke@435 | 1272 | } |
duke@435 | 1273 | } |
duke@435 | 1274 | #endif //PRODUCT |
duke@435 | 1275 | return num; |
duke@435 | 1276 | } |
duke@435 | 1277 | |
duke@435 | 1278 | // If a class (or interface) has a unique concrete method uniqm, return NULL. |
duke@435 | 1279 | // Otherwise, return a class that contains an interfering method. |
duke@435 | 1280 | klassOop Dependencies::check_unique_concrete_method(klassOop ctxk, methodOop uniqm, |
duke@435 | 1281 | DepChange* changes) { |
duke@435 | 1282 | // Here is a missing optimization: If uniqm->is_final(), |
duke@435 | 1283 | // we don't really need to search beneath it for overrides. |
duke@435 | 1284 | // This is probably not important, since we don't use dependencies |
duke@435 | 1285 | // to track final methods. (They can't be "definalized".) |
duke@435 | 1286 | ClassHierarchyWalker wf(uniqm->method_holder(), uniqm); |
duke@435 | 1287 | return wf.find_witness_definer(ctxk, changes); |
duke@435 | 1288 | } |
duke@435 | 1289 | |
duke@435 | 1290 | // Find the set of all non-abstract methods under ctxk that match m. |
duke@435 | 1291 | // (The method m must be defined or inherited in ctxk.) |
duke@435 | 1292 | // Include m itself in the set, unless it is abstract. |
duke@435 | 1293 | // If this set has exactly one element, return that element. |
duke@435 | 1294 | methodOop Dependencies::find_unique_concrete_method(klassOop ctxk, methodOop m) { |
duke@435 | 1295 | ClassHierarchyWalker wf(m); |
duke@435 | 1296 | assert(wf.check_method_context(ctxk, m), "proper context"); |
duke@435 | 1297 | wf.record_witnesses(1); |
duke@435 | 1298 | klassOop wit = wf.find_witness_definer(ctxk); |
duke@435 | 1299 | if (wit != NULL) return NULL; // Too many witnesses. |
duke@435 | 1300 | methodOop fm = wf.found_method(0); // Will be NULL if num_parts == 0. |
duke@435 | 1301 | if (Dependencies::is_concrete_method(m)) { |
duke@435 | 1302 | if (fm == NULL) { |
duke@435 | 1303 | // It turns out that m was always the only implementation. |
duke@435 | 1304 | fm = m; |
duke@435 | 1305 | } else if (fm != m) { |
duke@435 | 1306 | // Two conflicting implementations after all. |
duke@435 | 1307 | // (This can happen if m is inherited into ctxk and fm overrides it.) |
duke@435 | 1308 | return NULL; |
duke@435 | 1309 | } |
duke@435 | 1310 | } |
duke@435 | 1311 | #ifndef PRODUCT |
duke@435 | 1312 | // Make sure the dependency mechanism will pass this discovery: |
duke@435 | 1313 | if (VerifyDependencies && fm != NULL) { |
duke@435 | 1314 | guarantee(NULL == (void *)check_unique_concrete_method(ctxk, fm), |
duke@435 | 1315 | "verify dep."); |
duke@435 | 1316 | } |
duke@435 | 1317 | #endif //PRODUCT |
duke@435 | 1318 | return fm; |
duke@435 | 1319 | } |
duke@435 | 1320 | |
duke@435 | 1321 | klassOop Dependencies::check_exclusive_concrete_methods(klassOop ctxk, |
duke@435 | 1322 | methodOop m1, |
duke@435 | 1323 | methodOop m2, |
duke@435 | 1324 | DepChange* changes) { |
duke@435 | 1325 | ClassHierarchyWalker wf(m1); |
duke@435 | 1326 | wf.add_participant(m1->method_holder()); |
duke@435 | 1327 | wf.add_participant(m2->method_holder()); |
duke@435 | 1328 | return wf.find_witness_definer(ctxk, changes); |
duke@435 | 1329 | } |
duke@435 | 1330 | |
duke@435 | 1331 | // Find the set of all non-abstract methods under ctxk that match m[0]. |
duke@435 | 1332 | // (The method m[0] must be defined or inherited in ctxk.) |
duke@435 | 1333 | // Include m itself in the set, unless it is abstract. |
duke@435 | 1334 | // Fill the given array m[0..(mlen-1)] with this set, and return the length. |
duke@435 | 1335 | // (The length may be zero if no concrete methods are found anywhere.) |
duke@435 | 1336 | // If there are too many concrete methods to fit in marray, return -1. |
duke@435 | 1337 | int Dependencies::find_exclusive_concrete_methods(klassOop ctxk, |
duke@435 | 1338 | int mlen, |
duke@435 | 1339 | methodOop marray[]) { |
duke@435 | 1340 | methodOop m0 = marray[0]; |
duke@435 | 1341 | ClassHierarchyWalker wf(m0); |
duke@435 | 1342 | assert(wf.check_method_context(ctxk, m0), "proper context"); |
duke@435 | 1343 | wf.record_witnesses(mlen); |
duke@435 | 1344 | bool participants_hide_witnesses = true; |
duke@435 | 1345 | klassOop wit = wf.find_witness_definer(ctxk); |
duke@435 | 1346 | if (wit != NULL) return -1; // Too many witnesses. |
duke@435 | 1347 | int num = wf.num_participants(); |
duke@435 | 1348 | assert(num <= mlen, "oob"); |
duke@435 | 1349 | // Keep track of whether m is also part of the result set. |
duke@435 | 1350 | int mfill = 0; |
duke@435 | 1351 | assert(marray[mfill] == m0, "sanity"); |
duke@435 | 1352 | if (Dependencies::is_concrete_method(m0)) |
duke@435 | 1353 | mfill++; // keep m0 as marray[0], the first result |
duke@435 | 1354 | for (int i = 0; i < num; i++) { |
duke@435 | 1355 | methodOop fm = wf.found_method(i); |
duke@435 | 1356 | if (fm == m0) continue; // Already put this guy in the list. |
duke@435 | 1357 | if (mfill == mlen) { |
duke@435 | 1358 | return -1; // Oops. Too many methods after all! |
duke@435 | 1359 | } |
duke@435 | 1360 | marray[mfill++] = fm; |
duke@435 | 1361 | } |
duke@435 | 1362 | #ifndef PRODUCT |
duke@435 | 1363 | // Make sure the dependency mechanism will pass this discovery: |
duke@435 | 1364 | if (VerifyDependencies) { |
duke@435 | 1365 | // Turn off dependency tracing while actually testing deps. |
duke@435 | 1366 | FlagSetting fs(TraceDependencies, false); |
duke@435 | 1367 | switch (mfill) { |
duke@435 | 1368 | case 1: |
duke@435 | 1369 | guarantee(NULL == (void *)check_unique_concrete_method(ctxk, marray[0]), |
duke@435 | 1370 | "verify dep."); |
duke@435 | 1371 | break; |
duke@435 | 1372 | case 2: |
duke@435 | 1373 | guarantee(NULL == (void *) |
duke@435 | 1374 | check_exclusive_concrete_methods(ctxk, marray[0], marray[1]), |
duke@435 | 1375 | "verify dep."); |
duke@435 | 1376 | break; |
duke@435 | 1377 | default: |
duke@435 | 1378 | ShouldNotReachHere(); // mlen > 2 yet supported |
duke@435 | 1379 | } |
duke@435 | 1380 | } |
duke@435 | 1381 | #endif //PRODUCT |
duke@435 | 1382 | return mfill; |
duke@435 | 1383 | } |
duke@435 | 1384 | |
duke@435 | 1385 | |
duke@435 | 1386 | klassOop Dependencies::check_has_no_finalizable_subclasses(klassOop ctxk, DepChange* changes) { |
duke@435 | 1387 | Klass* search_at = ctxk->klass_part(); |
duke@435 | 1388 | if (changes != NULL) |
duke@435 | 1389 | search_at = changes->new_type()->klass_part(); // just look at the new bit |
duke@435 | 1390 | Klass* result = find_finalizable_subclass(search_at); |
duke@435 | 1391 | if (result == NULL) { |
duke@435 | 1392 | return NULL; |
duke@435 | 1393 | } |
duke@435 | 1394 | return result->as_klassOop(); |
duke@435 | 1395 | } |
duke@435 | 1396 | |
duke@435 | 1397 | |
duke@435 | 1398 | klassOop Dependencies::DepStream::check_dependency_impl(DepChange* changes) { |
duke@435 | 1399 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 1400 | |
duke@435 | 1401 | klassOop witness = NULL; |
duke@435 | 1402 | switch (type()) { |
duke@435 | 1403 | case evol_method: |
duke@435 | 1404 | witness = check_evol_method(method_argument(0)); |
duke@435 | 1405 | break; |
duke@435 | 1406 | case leaf_type: |
duke@435 | 1407 | witness = check_leaf_type(context_type()); |
duke@435 | 1408 | break; |
duke@435 | 1409 | case abstract_with_unique_concrete_subtype: |
duke@435 | 1410 | witness = check_abstract_with_unique_concrete_subtype(context_type(), |
duke@435 | 1411 | type_argument(1), |
duke@435 | 1412 | changes); |
duke@435 | 1413 | break; |
duke@435 | 1414 | case abstract_with_no_concrete_subtype: |
duke@435 | 1415 | witness = check_abstract_with_no_concrete_subtype(context_type(), |
duke@435 | 1416 | changes); |
duke@435 | 1417 | break; |
duke@435 | 1418 | case concrete_with_no_concrete_subtype: |
duke@435 | 1419 | witness = check_concrete_with_no_concrete_subtype(context_type(), |
duke@435 | 1420 | changes); |
duke@435 | 1421 | break; |
duke@435 | 1422 | case unique_concrete_method: |
duke@435 | 1423 | witness = check_unique_concrete_method(context_type(), |
duke@435 | 1424 | method_argument(1), |
duke@435 | 1425 | changes); |
duke@435 | 1426 | break; |
duke@435 | 1427 | case abstract_with_exclusive_concrete_subtypes_2: |
duke@435 | 1428 | witness = check_abstract_with_exclusive_concrete_subtypes(context_type(), |
duke@435 | 1429 | type_argument(1), |
duke@435 | 1430 | type_argument(2), |
duke@435 | 1431 | changes); |
duke@435 | 1432 | break; |
duke@435 | 1433 | case exclusive_concrete_methods_2: |
duke@435 | 1434 | witness = check_exclusive_concrete_methods(context_type(), |
duke@435 | 1435 | method_argument(1), |
duke@435 | 1436 | method_argument(2), |
duke@435 | 1437 | changes); |
duke@435 | 1438 | break; |
duke@435 | 1439 | case no_finalizable_subclasses: |
duke@435 | 1440 | witness = check_has_no_finalizable_subclasses(context_type(), |
duke@435 | 1441 | changes); |
duke@435 | 1442 | break; |
duke@435 | 1443 | default: |
duke@435 | 1444 | witness = NULL; |
duke@435 | 1445 | ShouldNotReachHere(); |
duke@435 | 1446 | break; |
duke@435 | 1447 | } |
duke@435 | 1448 | if (witness != NULL) { |
duke@435 | 1449 | if (TraceDependencies) { |
duke@435 | 1450 | print_dependency(witness, /*verbose=*/ true); |
duke@435 | 1451 | } |
duke@435 | 1452 | // The following is a no-op unless logging is enabled: |
duke@435 | 1453 | log_dependency(witness); |
duke@435 | 1454 | } |
duke@435 | 1455 | return witness; |
duke@435 | 1456 | } |
duke@435 | 1457 | |
duke@435 | 1458 | |
duke@435 | 1459 | klassOop Dependencies::DepStream::spot_check_dependency_at(DepChange& changes) { |
duke@435 | 1460 | if (!changes.involves_context(context_type())) |
duke@435 | 1461 | // irrelevant dependency; skip it |
duke@435 | 1462 | return NULL; |
duke@435 | 1463 | |
duke@435 | 1464 | return check_dependency_impl(&changes); |
duke@435 | 1465 | } |
duke@435 | 1466 | |
duke@435 | 1467 | |
duke@435 | 1468 | void DepChange::initialize() { |
duke@435 | 1469 | // entire transaction must be under this lock: |
duke@435 | 1470 | assert_lock_strong(Compile_lock); |
duke@435 | 1471 | |
duke@435 | 1472 | // Mark all dependee and all its superclasses |
duke@435 | 1473 | // Mark transitive interfaces |
duke@435 | 1474 | for (ContextStream str(*this); str.next(); ) { |
duke@435 | 1475 | klassOop d = str.klass(); |
duke@435 | 1476 | assert(!instanceKlass::cast(d)->is_marked_dependent(), "checking"); |
acorn@1410 | 1477 | instanceKlass::cast(d)->set_is_marked_dependent(true); |
duke@435 | 1478 | } |
duke@435 | 1479 | } |
duke@435 | 1480 | |
duke@435 | 1481 | DepChange::~DepChange() { |
duke@435 | 1482 | // Unmark all dependee and all its superclasses |
duke@435 | 1483 | // Unmark transitive interfaces |
duke@435 | 1484 | for (ContextStream str(*this); str.next(); ) { |
duke@435 | 1485 | klassOop d = str.klass(); |
acorn@1410 | 1486 | instanceKlass::cast(d)->set_is_marked_dependent(false); |
duke@435 | 1487 | } |
duke@435 | 1488 | } |
duke@435 | 1489 | |
duke@435 | 1490 | bool DepChange::involves_context(klassOop k) { |
duke@435 | 1491 | if (k == NULL || !Klass::cast(k)->oop_is_instance()) { |
duke@435 | 1492 | return false; |
duke@435 | 1493 | } |
duke@435 | 1494 | instanceKlass* ik = instanceKlass::cast(k); |
duke@435 | 1495 | bool is_contained = ik->is_marked_dependent(); |
duke@435 | 1496 | assert(is_contained == Klass::cast(new_type())->is_subtype_of(k), |
duke@435 | 1497 | "correct marking of potential context types"); |
duke@435 | 1498 | return is_contained; |
duke@435 | 1499 | } |
duke@435 | 1500 | |
duke@435 | 1501 | bool DepChange::ContextStream::next() { |
duke@435 | 1502 | switch (_change_type) { |
duke@435 | 1503 | case Start_Klass: // initial state; _klass is the new type |
duke@435 | 1504 | _ti_base = instanceKlass::cast(_klass)->transitive_interfaces(); |
duke@435 | 1505 | _ti_index = 0; |
duke@435 | 1506 | _change_type = Change_new_type; |
duke@435 | 1507 | return true; |
duke@435 | 1508 | case Change_new_type: |
duke@435 | 1509 | // fall through: |
duke@435 | 1510 | _change_type = Change_new_sub; |
duke@435 | 1511 | case Change_new_sub: |
sbohne@489 | 1512 | // 6598190: brackets workaround Sun Studio C++ compiler bug 6629277 |
sbohne@489 | 1513 | { |
sbohne@489 | 1514 | _klass = instanceKlass::cast(_klass)->super(); |
sbohne@489 | 1515 | if (_klass != NULL) { |
sbohne@489 | 1516 | return true; |
sbohne@489 | 1517 | } |
duke@435 | 1518 | } |
duke@435 | 1519 | // else set up _ti_limit and fall through: |
duke@435 | 1520 | _ti_limit = (_ti_base == NULL) ? 0 : _ti_base->length(); |
duke@435 | 1521 | _change_type = Change_new_impl; |
duke@435 | 1522 | case Change_new_impl: |
duke@435 | 1523 | if (_ti_index < _ti_limit) { |
duke@435 | 1524 | _klass = klassOop( _ti_base->obj_at(_ti_index++) ); |
duke@435 | 1525 | return true; |
duke@435 | 1526 | } |
duke@435 | 1527 | // fall through: |
duke@435 | 1528 | _change_type = NO_CHANGE; // iterator is exhausted |
duke@435 | 1529 | case NO_CHANGE: |
duke@435 | 1530 | break; |
duke@435 | 1531 | default: |
duke@435 | 1532 | ShouldNotReachHere(); |
duke@435 | 1533 | } |
duke@435 | 1534 | return false; |
duke@435 | 1535 | } |
duke@435 | 1536 | |
duke@435 | 1537 | void DepChange::print() { |
duke@435 | 1538 | int nsup = 0, nint = 0; |
duke@435 | 1539 | for (ContextStream str(*this); str.next(); ) { |
duke@435 | 1540 | klassOop k = str.klass(); |
phh@1558 | 1541 | switch (str.change_type()) { |
duke@435 | 1542 | case Change_new_type: |
duke@435 | 1543 | tty->print_cr(" dependee = %s", instanceKlass::cast(k)->external_name()); |
duke@435 | 1544 | break; |
duke@435 | 1545 | case Change_new_sub: |
phh@1558 | 1546 | if (!WizardMode) { |
phh@1558 | 1547 | ++nsup; |
phh@1558 | 1548 | } else { |
phh@1558 | 1549 | tty->print_cr(" context super = %s", instanceKlass::cast(k)->external_name()); |
phh@1558 | 1550 | } |
duke@435 | 1551 | break; |
duke@435 | 1552 | case Change_new_impl: |
phh@1558 | 1553 | if (!WizardMode) { |
phh@1558 | 1554 | ++nint; |
phh@1558 | 1555 | } else { |
phh@1558 | 1556 | tty->print_cr(" context interface = %s", instanceKlass::cast(k)->external_name()); |
phh@1558 | 1557 | } |
duke@435 | 1558 | break; |
duke@435 | 1559 | } |
duke@435 | 1560 | } |
duke@435 | 1561 | if (nsup + nint != 0) { |
duke@435 | 1562 | tty->print_cr(" context supers = %d, interfaces = %d", nsup, nint); |
duke@435 | 1563 | } |
duke@435 | 1564 | } |
duke@435 | 1565 | |
duke@435 | 1566 | #ifndef PRODUCT |
duke@435 | 1567 | void Dependencies::print_statistics() { |
duke@435 | 1568 | if (deps_find_witness_print != 0) { |
duke@435 | 1569 | // Call one final time, to flush out the data. |
duke@435 | 1570 | deps_find_witness_print = -1; |
duke@435 | 1571 | count_find_witness_calls(); |
duke@435 | 1572 | } |
duke@435 | 1573 | } |
duke@435 | 1574 | #endif |