1 /*
   2  * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "classfile/altHashing.hpp"
  27 #include "classfile/javaClasses.inline.hpp"
  28 #include "memory/resourceArea.hpp"
  29 #include "oops/access.inline.hpp"
  30 #include "oops/oop.inline.hpp"
  31 #include "oops/verifyOopClosure.hpp"
  32 #include "runtime/handles.inline.hpp"
  33 #include "runtime/thread.inline.hpp"
  34 #include "utilities/copy.hpp"
  35 
  36 bool always_do_update_barrier = false;
  37 
  38 void oopDesc::print_on(outputStream* st) const {
  39   if (this == NULL) {
  40     st->print_cr("NULL");
  41   } else if (*((juint*)this) == badHeapWordVal) {
  42     st->print("BAD WORD");
  43   } else if (*((juint*)this) == badMetaWordVal) {
  44     st->print("BAD META WORD");
  45   } else {
  46     klass()->oop_print_on(oop(this), st);
  47   }
  48 }
  49 
  50 void oopDesc::print_address_on(outputStream* st) const {
  51   st->print("{" INTPTR_FORMAT "}", p2i(this));
  52 
  53 }
  54 
  55 void oopDesc::print()         { print_on(tty);         }
  56 
  57 void oopDesc::print_address() { print_address_on(tty); }
  58 
  59 char* oopDesc::print_string() {
  60   stringStream st;
  61   print_on(&st);
  62   return st.as_string();
  63 }
  64 
  65 void oopDesc::print_value() {
  66   print_value_on(tty);
  67 }
  68 
  69 char* oopDesc::print_value_string() {
  70   char buf[100];
  71   stringStream st(buf, sizeof(buf));
  72   print_value_on(&st);
  73   return st.as_string();
  74 }
  75 
  76 void oopDesc::print_value_on(outputStream* st) const {
  77   oop obj = oop(this);
  78   if (this == NULL) {
  79     st->print("NULL");
  80   } else if (java_lang_String::is_instance(obj)) {
  81     java_lang_String::print(obj, st);
  82     print_address_on(st);
  83   } else {
  84     klass()->oop_print_value_on(obj, st);
  85   }
  86 }
  87 
  88 
  89 void oopDesc::verify_on(outputStream* st) {
  90   if (this != NULL) {
  91     klass()->oop_verify_on(this, st);
  92   }
  93 }
  94 
  95 
  96 void oopDesc::verify() {
  97   verify_on(tty);
  98 }
  99 
 100 intptr_t oopDesc::slow_identity_hash() {
 101   // slow case; we have to acquire the micro lock in order to locate the header
 102   Thread* THREAD = Thread::current();
 103   ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
 104   HandleMark hm(THREAD);
 105   Handle object(THREAD, this);
 106   return ObjectSynchronizer::identity_hash_value_for(object);
 107 }
 108 
 109 // When String table needs to rehash
 110 unsigned int oopDesc::new_hash(juint seed) {
 111   EXCEPTION_MARK;
 112   ResourceMark rm;
 113   int length;
 114   jchar* chars = java_lang_String::as_unicode_string(this, length, THREAD);
 115   if (chars != NULL) {
 116     // Use alternate hashing algorithm on the string
 117     return AltHashing::murmur3_32(seed, chars, length);
 118   } else {
 119     vm_exit_out_of_memory(length, OOM_MALLOC_ERROR, "unable to create Unicode strings for String table rehash");
 120     return 0;
 121   }
 122 }
 123 
 124 // used only for asserts and guarantees
 125 bool oopDesc::is_oop(oop obj, bool ignore_mark_word) {
 126   if (!Universe::heap()->is_oop(obj)) {
 127     return false;
 128   }
 129 
 130   // Header verification: the mark is typically non-NULL. If we're
 131   // at a safepoint, it must not be null.
 132   // Outside of a safepoint, the header could be changing (for example,
 133   // another thread could be inflating a lock on this object).
 134   if (ignore_mark_word) {
 135     return true;
 136   }
 137   if (obj->mark_raw() != NULL) {
 138     return true;
 139   }
 140   return !SafepointSynchronize::is_at_safepoint();
 141 }
 142 
 143 // used only for asserts and guarantees
 144 bool oopDesc::is_oop_or_null(oop obj, bool ignore_mark_word) {
 145   return obj == NULL ? true : is_oop(obj, ignore_mark_word);
 146 }
 147 
 148 #ifndef PRODUCT
 149 // used only for asserts
 150 bool oopDesc::is_unlocked_oop() const {
 151   if (!Universe::heap()->is_in_reserved(this)) return false;
 152   return mark()->is_unlocked();
 153 }
 154 #endif // PRODUCT
 155 
 156 VerifyOopClosure VerifyOopClosure::verify_oop;
 157 
 158 template <class T> void VerifyOopClosure::do_oop_work(T* p) {
 159   oop obj = RawAccess<>::oop_load(p);
 160   guarantee(oopDesc::is_oop_or_null(obj), "invalid oop: " INTPTR_FORMAT, p2i((oopDesc*) obj));
 161 }
 162 
 163 void VerifyOopClosure::do_oop(oop* p)       { VerifyOopClosure::do_oop_work(p); }
 164 void VerifyOopClosure::do_oop(narrowOop* p) { VerifyOopClosure::do_oop_work(p); }
 165 
 166 // type test operations that doesn't require inclusion of oop.inline.hpp.
 167 bool oopDesc::is_instance_noinline()          const { return is_instance();            }
 168 bool oopDesc::is_array_noinline()             const { return is_array();               }
 169 bool oopDesc::is_objArray_noinline()          const { return is_objArray();            }
 170 bool oopDesc::is_typeArray_noinline()         const { return is_typeArray();           }
 171 
 172 bool oopDesc::has_klass_gap() {
 173   // Only has a klass gap when compressed class pointers are used.
 174   return UseCompressedClassPointers;
 175 }
 176 
 177 oop oopDesc::obj_field_acquire(int offset) const                      { return HeapAccess<MO_ACQUIRE>::oop_load_at(as_oop(), offset); }
 178 
 179 void oopDesc::obj_field_put_raw(int offset, oop value)                { RawAccess<>::oop_store_at(as_oop(), offset, value); }
 180 void oopDesc::release_obj_field_put(int offset, oop value)            { HeapAccess<MO_RELEASE>::oop_store_at(as_oop(), offset, value); }
 181 void oopDesc::obj_field_put_volatile(int offset, oop value)           { HeapAccess<MO_SEQ_CST>::oop_store_at(as_oop(), offset, value); }
 182 
 183 address oopDesc::address_field(int offset) const                      { return HeapAccess<>::load_at(as_oop(), offset); }
 184 address oopDesc::address_field_acquire(int offset) const              { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 185 
 186 void oopDesc::address_field_put(int offset, address value)            { HeapAccess<>::store_at(as_oop(), offset, value); }
 187 void oopDesc::release_address_field_put(int offset, address value)    { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 188 
 189 Metadata* oopDesc::metadata_field(int offset) const                   { return HeapAccess<>::load_at(as_oop(), offset); }
 190 void oopDesc::metadata_field_put(int offset, Metadata* value)         { HeapAccess<>::store_at(as_oop(), offset, value); }
 191 
 192 Metadata* oopDesc::metadata_field_acquire(int offset) const           { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 193 void oopDesc::release_metadata_field_put(int offset, Metadata* value) { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 194 
 195 jbyte oopDesc::byte_field_acquire(int offset) const                   { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 196 void oopDesc::release_byte_field_put(int offset, jbyte value)         { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 197 
 198 jchar oopDesc::char_field_acquire(int offset) const                   { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 199 void oopDesc::release_char_field_put(int offset, jchar value)         { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 200 
 201 jboolean oopDesc::bool_field_acquire(int offset) const                { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 202 void oopDesc::release_bool_field_put(int offset, jboolean value)      { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, jboolean(value & 1)); }
 203 
 204 jint oopDesc::int_field_acquire(int offset) const                     { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 205 void oopDesc::release_int_field_put(int offset, jint value)           { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 206 
 207 jshort oopDesc::short_field_acquire(int offset) const                 { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 208 void oopDesc::release_short_field_put(int offset, jshort value)       { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 209 
 210 jlong oopDesc::long_field_acquire(int offset) const                   { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 211 void oopDesc::release_long_field_put(int offset, jlong value)         { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 212 
 213 jfloat oopDesc::float_field_acquire(int offset) const                 { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 214 void oopDesc::release_float_field_put(int offset, jfloat value)       { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }
 215 
 216 jdouble oopDesc::double_field_acquire(int offset) const               { return HeapAccess<MO_ACQUIRE>::load_at(as_oop(), offset); }
 217 void oopDesc::release_double_field_put(int offset, jdouble value)     { HeapAccess<MO_RELEASE>::store_at(as_oop(), offset, value); }