src/hotspot/share/ci/ciObjectFactory.cpp
changeset 58177 4932dce35882
parent 58015 dd84de796f2c
child 58273 08a5148e7c4e
equal deleted inserted replaced
58176:470af058bd5f 58177:4932dce35882
   248 
   248 
   249   // The ciObject does not yet exist.  Create it and insert it
   249   // The ciObject does not yet exist.  Create it and insert it
   250   // into the cache.
   250   // into the cache.
   251   Handle keyHandle(Thread::current(), key);
   251   Handle keyHandle(Thread::current(), key);
   252   ciObject* new_object = create_new_object(keyHandle());
   252   ciObject* new_object = create_new_object(keyHandle());
   253   assert(oopDesc::equals(keyHandle(), new_object->get_oop()), "must be properly recorded");
   253   assert(keyHandle() == new_object->get_oop(), "must be properly recorded");
   254   init_ident_of(new_object);
   254   init_ident_of(new_object);
   255   assert(Universe::heap()->is_in(new_object->get_oop()), "must be");
   255   assert(Universe::heap()->is_in(new_object->get_oop()), "must be");
   256 
   256 
   257   // Not a perm-space object.
   257   // Not a perm-space object.
   258   insert_non_perm(bucket, keyHandle(), new_object);
   258   insert_non_perm(bucket, keyHandle(), new_object);
   467     domain = accessing_klass->protection_domain();
   467     domain = accessing_klass->protection_domain();
   468   }
   468   }
   469   for (int i=0; i<_unloaded_klasses->length(); i++) {
   469   for (int i=0; i<_unloaded_klasses->length(); i++) {
   470     ciKlass* entry = _unloaded_klasses->at(i);
   470     ciKlass* entry = _unloaded_klasses->at(i);
   471     if (entry->name()->equals(name) &&
   471     if (entry->name()->equals(name) &&
   472         oopDesc::equals(entry->loader(), loader) &&
   472         entry->loader() == loader &&
   473         oopDesc::equals(entry->protection_domain(), domain)) {
   473         entry->protection_domain() == domain) {
   474       // We've found a match.
   474       // We've found a match.
   475       return entry;
   475       return entry;
   476     }
   476     }
   477   }
   477   }
   478 
   478