duke@435: /*
coleenp@4466:  * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #ifndef SHARE_VM_OOPS_CONSTANTPOOLOOP_HPP
stefank@2314: #define SHARE_VM_OOPS_CONSTANTPOOLOOP_HPP
stefank@2314: 
stefank@2314: #include "oops/arrayOop.hpp"
coleenp@4037: #include "oops/cpCache.hpp"
coleenp@4037: #include "oops/objArrayOop.hpp"
coleenp@2497: #include "oops/symbol.hpp"
stefank@2314: #include "oops/typeArrayOop.hpp"
coleenp@4037: #include "runtime/handles.hpp"
stefank@2314: #include "utilities/constantTag.hpp"
stefank@2314: #ifdef TARGET_ARCH_x86
stefank@2314: # include "bytes_x86.hpp"
stefank@2314: #endif
stefank@2314: #ifdef TARGET_ARCH_sparc
stefank@2314: # include "bytes_sparc.hpp"
stefank@2314: #endif
stefank@2314: #ifdef TARGET_ARCH_zero
stefank@2314: # include "bytes_zero.hpp"
stefank@2314: #endif
bobv@2508: #ifdef TARGET_ARCH_arm
bobv@2508: # include "bytes_arm.hpp"
bobv@2508: #endif
bobv@2508: #ifdef TARGET_ARCH_ppc
bobv@2508: # include "bytes_ppc.hpp"
bobv@2508: #endif
stefank@2314: 
duke@435: // A constantPool is an array containing class constants as described in the
duke@435: // class file.
duke@435: //
duke@435: // Most of the constant pool entries are written during class parsing, which
coleenp@4037: // is safe.  For klass types, the constant pool entry is
coleenp@4037: // modified when the entry is resolved.  If a klass constant pool
duke@435: // entry is read without a lock, only the resolved state guarantees that
coleenp@4037: // the entry in the constant pool is a klass object and not a Symbol*.
duke@435: 
duke@435: class SymbolHashMap;
duke@435: 
coleenp@2497: class CPSlot VALUE_OBJ_CLASS_SPEC {
coleenp@2497:   intptr_t _ptr;
coleenp@2497:  public:
coleenp@2497:   CPSlot(intptr_t ptr): _ptr(ptr) {}
coleenp@4037:   CPSlot(Klass* ptr): _ptr((intptr_t)ptr) {}
coleenp@2497:   CPSlot(Symbol* ptr): _ptr((intptr_t)ptr | 1) {}
coleenp@2497: 
coleenp@2497:   intptr_t value()   { return _ptr; }
coleenp@4037:   bool is_resolved()   { return (_ptr & 1) == 0; }
coleenp@4037:   bool is_unresolved() { return (_ptr & 1) == 1; }
coleenp@2497: 
coleenp@4037:   Symbol* get_symbol() {
coleenp@4037:     assert(is_unresolved(), "bad call");
coleenp@4037:     return (Symbol*)(_ptr & ~1);
coleenp@2497:   }
coleenp@4037:   Klass* get_klass() {
coleenp@4037:     assert(is_resolved(), "bad call");
coleenp@4037:     return (Klass*)_ptr;
coleenp@2497:   }
coleenp@2497: };
coleenp@2497: 
acorn@4497: class KlassSizeStats;
coleenp@4037: class ConstantPool : public Metadata {
duke@435:   friend class VMStructs;
duke@435:   friend class BytecodeInterpreter;  // Directly extracts an oop in the pool for fast instanceof/checkcast
coleenp@4037:   friend class Universe;             // For null constructor
duke@435:  private:
coleenp@4037:   Array<u1>*           _tags;        // the tag array describing the constant pool's contents
coleenp@4251:   ConstantPoolCache*   _cache;       // the cache holding interpreter runtime information
coleenp@4251:   InstanceKlass*       _pool_holder; // the corresponding class
coleenp@4037:   Array<u2>*           _operands;    // for variable-sized (InvokeDynamic) nodes, usually empty
coleenp@4037: 
coleenp@4037:   // Array of resolved objects from the constant pool and map from resolved
coleenp@4037:   // object index to original constant pool index
coleenp@4037:   jobject              _resolved_references;
coleenp@4037:   Array<u2>*           _reference_map;
coleenp@4037: 
coleenp@4490:   enum {
coleenp@4643:     _has_preresolution = 1,           // Flags
coleenp@4643:     _on_stack          = 2
coleenp@4490:   };
coleenp@4490: 
coleenp@4490:   int                  _flags;  // old fashioned bit twiddling
coleenp@548:   int                  _length; // number of elements in the array
coleenp@4037: 
coleenp@4037:   union {
coleenp@4037:     // set for CDS to restore resolved references
coleenp@4037:     int                _resolved_reference_length;
coleenp@4466:     // keeps version number for redefined classes (used in backtrace)
coleenp@4466:     int                _version;
coleenp@4037:   } _saved;
duke@435: 
coleenp@4037:   Monitor*             _lock;
duke@435: 
coleenp@4037:   void set_tags(Array<u1>* tags)               { _tags = tags; }
coleenp@4037:   void tag_at_put(int which, jbyte t)          { tags()->at_put(which, t); }
coleenp@4037:   void release_tag_at_put(int which, jbyte t)  { tags()->release_at_put(which, t); }
coleenp@4037: 
coleenp@4037:   void set_operands(Array<u2>* operands)       { _operands = operands; }
jrose@2268: 
coleenp@4490:   int flags() const                            { return _flags; }
coleenp@4490:   void set_flags(int f)                        { _flags = f; }
jrose@866: 
duke@435:  private:
coleenp@4037:   intptr_t* base() const { return (intptr_t*) (((char*) this) + sizeof(ConstantPool)); }
duke@435: 
coleenp@2497:   CPSlot slot_at(int which) {
coleenp@2497:     assert(is_within_bounds(which), "index out of bounds");
coleenp@4037:     // Uses volatile because the klass slot changes without a lock.
coleenp@2497:     volatile intptr_t adr = (intptr_t)OrderAccess::load_ptr_acquire(obj_at_addr_raw(which));
coleenp@4037:     assert(adr != 0 || which == 0, "cp entry for klass should not be zero");
coleenp@2497:     return CPSlot(adr);
coleenp@2497:   }
coleenp@2497: 
coleenp@2497:   void slot_at_put(int which, CPSlot s) const {
coleenp@2497:     assert(is_within_bounds(which), "index out of bounds");
coleenp@4037:     assert(s.value() != 0, "Caught something");
coleenp@2497:     *(intptr_t*)&base()[which] = s.value();
coleenp@2497:   }
coleenp@4037:   intptr_t* obj_at_addr_raw(int which) const {
duke@435:     assert(is_within_bounds(which), "index out of bounds");
coleenp@4037:     return (intptr_t*) &base()[which];
coleenp@2497:   }
coleenp@2497: 
duke@435:   jint* int_at_addr(int which) const {
duke@435:     assert(is_within_bounds(which), "index out of bounds");
duke@435:     return (jint*) &base()[which];
duke@435:   }
duke@435: 
duke@435:   jlong* long_at_addr(int which) const {
duke@435:     assert(is_within_bounds(which), "index out of bounds");
duke@435:     return (jlong*) &base()[which];
duke@435:   }
duke@435: 
duke@435:   jfloat* float_at_addr(int which) const {
duke@435:     assert(is_within_bounds(which), "index out of bounds");
duke@435:     return (jfloat*) &base()[which];
duke@435:   }
duke@435: 
duke@435:   jdouble* double_at_addr(int which) const {
duke@435:     assert(is_within_bounds(which), "index out of bounds");
duke@435:     return (jdouble*) &base()[which];
duke@435:   }
duke@435: 
coleenp@4037:   ConstantPool(Array<u1>* tags);
coleenp@4037:   ConstantPool() { assert(DumpSharedSpaces || UseSharedSpaces, "only for CDS"); }
duke@435:  public:
coleenp@4037:   static ConstantPool* allocate(ClassLoaderData* loader_data, int length, TRAPS);
coleenp@4037: 
coleenp@4037:   bool is_constantPool() const volatile     { return true; }
coleenp@4037: 
coleenp@4037:   Array<u1>* tags() const                   { return _tags; }
coleenp@4037:   Array<u2>* operands() const               { return _operands; }
duke@435: 
coleenp@4490:   bool has_preresolution() const            { return (_flags & _has_preresolution) != 0; }
coleenp@4490:   void set_has_preresolution()              { _flags |= _has_preresolution; }
jrose@866: 
coleenp@4037:   // Redefine classes support.  If a method refering to this constant pool
coleenp@4037:   // is on the executing stack, or as a handle in vm code, this constant pool
coleenp@4037:   // can't be removed from the set of previous versions saved in the instance
coleenp@4037:   // class.
coleenp@4490:   bool on_stack() const                      { return (_flags &_on_stack) != 0; }
coleenp@4037:   void set_on_stack(const bool value);
coleenp@4037: 
duke@435:   // Klass holding pool
coleenp@4251:   InstanceKlass* pool_holder() const      { return _pool_holder; }
coleenp@4251:   void set_pool_holder(InstanceKlass* k)  { _pool_holder = k; }
coleenp@4251:   InstanceKlass** pool_holder_addr()      { return &_pool_holder; }
duke@435: 
duke@435:   // Interpreter runtime support
coleenp@4037:   ConstantPoolCache* cache() const        { return _cache; }
coleenp@4037:   void set_cache(ConstantPoolCache* cache){ _cache = cache; }
coleenp@4037: 
coleenp@4037:   // Create object cache in the constant pool
coleenp@4037:   void initialize_resolved_references(ClassLoaderData* loader_data,
coleenp@4037:                                       intStack reference_map,
coleenp@4037:                                       int constant_pool_map_length,
coleenp@4037:                                       TRAPS);
coleenp@4037: 
coleenp@4037:   // resolved strings, methodHandles and callsite objects from the constant pool
coleenp@4037:   objArrayOop resolved_references()  const;
coleenp@4037:   // mapping resolved object array indexes to cp indexes and back.
coleenp@4037:   int object_to_cp_index(int index)         { return _reference_map->at(index); }
coleenp@4037:   int cp_to_object_index(int index);
coleenp@4037: 
coleenp@4037:   // Invokedynamic indexes.
coleenp@4037:   // They must look completely different from normal indexes.
coleenp@4037:   // The main reason is that byte swapping is sometimes done on normal indexes.
coleenp@4037:   // Finally, it is helpful for debugging to tell the two apart.
coleenp@4037:   static bool is_invokedynamic_index(int i) { return (i < 0); }
coleenp@4037:   static int  decode_invokedynamic_index(int i) { assert(is_invokedynamic_index(i),  ""); return ~i; }
coleenp@4037:   static int  encode_invokedynamic_index(int i) { assert(!is_invokedynamic_index(i), ""); return ~i; }
coleenp@4037: 
coleenp@4037: 
coleenp@4037:   // The invokedynamic points at a CP cache entry.  This entry points back
coleenp@4037:   // at the original CP entry (CONSTANT_InvokeDynamic) and also (via f2) at an entry
coleenp@4037:   // in the resolved_references array (which provides the appendix argument).
coleenp@4037:   int invokedynamic_cp_cache_index(int index) const {
coleenp@4037:     assert (is_invokedynamic_index(index), "should be a invokedynamic index");
coleenp@4037:     int cache_index = decode_invokedynamic_index(index);
coleenp@4037:     return cache_index;
coleenp@4037:   }
coleenp@4037:   ConstantPoolCacheEntry* invokedynamic_cp_cache_entry_at(int index) const {
coleenp@4037:     // decode index that invokedynamic points to.
coleenp@4037:     int cp_cache_index = invokedynamic_cp_cache_index(index);
coleenp@4037:     return cache()->entry_at(cp_cache_index);
coleenp@4037:   }
duke@435: 
duke@435:   // Assembly code support
coleenp@4037:   static int tags_offset_in_bytes()         { return offset_of(ConstantPool, _tags); }
coleenp@4037:   static int cache_offset_in_bytes()        { return offset_of(ConstantPool, _cache); }
coleenp@4037:   static int pool_holder_offset_in_bytes()  { return offset_of(ConstantPool, _pool_holder); }
coleenp@4037:   static int resolved_references_offset_in_bytes() { return offset_of(ConstantPool, _resolved_references); }
coleenp@4037:   static int reference_map_offset_in_bytes() { return offset_of(ConstantPool, _reference_map); }
duke@435: 
duke@435:   // Storing constants
duke@435: 
coleenp@4037:   void klass_at_put(int which, Klass* k) {
coleenp@2497:     assert(k != NULL, "resolved class shouldn't be null");
coleenp@4037:     assert(is_within_bounds(which), "index out of bounds");
coleenp@4037:     OrderAccess::release_store_ptr((Klass* volatile *)obj_at_addr_raw(which), k);
duke@435:     // The interpreter assumes when the tag is stored, the klass is resolved
coleenp@4037:     // and the Klass* is a klass rather than a Symbol*, so we need
duke@435:     // hardware store ordering here.
duke@435:     release_tag_at_put(which, JVM_CONSTANT_Class);
duke@435:   }
duke@435: 
duke@435:   // For temporary use while constructing constant pool
duke@435:   void klass_index_at_put(int which, int name_index) {
duke@435:     tag_at_put(which, JVM_CONSTANT_ClassIndex);
duke@435:     *int_at_addr(which) = name_index;
duke@435:   }
duke@435: 
duke@435:   // Temporary until actual use
coleenp@2497:   void unresolved_klass_at_put(int which, Symbol* s) {
duke@435:     release_tag_at_put(which, JVM_CONSTANT_UnresolvedClass);
coleenp@2497:     slot_at_put(which, s);
duke@435:   }
duke@435: 
jrose@1957:   void method_handle_index_at_put(int which, int ref_kind, int ref_index) {
jrose@1957:     tag_at_put(which, JVM_CONSTANT_MethodHandle);
jrose@1957:     *int_at_addr(which) = ((jint) ref_index<<16) | ref_kind;
jrose@1957:   }
jrose@1957: 
jrose@1957:   void method_type_index_at_put(int which, int ref_index) {
jrose@1957:     tag_at_put(which, JVM_CONSTANT_MethodType);
jrose@1957:     *int_at_addr(which) = ref_index;
jrose@1957:   }
jrose@1957: 
jrose@2353:   void invoke_dynamic_at_put(int which, int bootstrap_specifier_index, int name_and_type_index) {
jrose@2015:     tag_at_put(which, JVM_CONSTANT_InvokeDynamic);
jrose@2353:     *int_at_addr(which) = ((jint) name_and_type_index<<16) | bootstrap_specifier_index;
jrose@2015:   }
jrose@2353: 
coleenp@2497:   void unresolved_string_at_put(int which, Symbol* s) {
coleenp@4037:     release_tag_at_put(which, JVM_CONSTANT_String);
coleenp@4037:     *symbol_at_addr(which) = s;
duke@435:   }
duke@435: 
duke@435:   void int_at_put(int which, jint i) {
duke@435:     tag_at_put(which, JVM_CONSTANT_Integer);
duke@435:     *int_at_addr(which) = i;
duke@435:   }
duke@435: 
duke@435:   void long_at_put(int which, jlong l) {
duke@435:     tag_at_put(which, JVM_CONSTANT_Long);
duke@435:     // *long_at_addr(which) = l;
duke@435:     Bytes::put_native_u8((address)long_at_addr(which), *((u8*) &l));
duke@435:   }
duke@435: 
duke@435:   void float_at_put(int which, jfloat f) {
duke@435:     tag_at_put(which, JVM_CONSTANT_Float);
duke@435:     *float_at_addr(which) = f;
duke@435:   }
duke@435: 
duke@435:   void double_at_put(int which, jdouble d) {
duke@435:     tag_at_put(which, JVM_CONSTANT_Double);
duke@435:     // *double_at_addr(which) = d;
duke@435:     // u8 temp = *(u8*) &d;
duke@435:     Bytes::put_native_u8((address) double_at_addr(which), *((u8*) &d));
duke@435:   }
duke@435: 
coleenp@2497:   Symbol** symbol_at_addr(int which) const {
coleenp@2497:     assert(is_within_bounds(which), "index out of bounds");
coleenp@2497:     return (Symbol**) &base()[which];
coleenp@2497:   }
coleenp@2497: 
coleenp@2497:   void symbol_at_put(int which, Symbol* s) {
coleenp@2497:     assert(s->refcount() != 0, "should have nonzero refcount");
duke@435:     tag_at_put(which, JVM_CONSTANT_Utf8);
coleenp@4037:     *symbol_at_addr(which) = s;
duke@435:   }
duke@435: 
coleenp@4037:   void string_at_put(int which, int obj_index, oop str) {
coleenp@4037:     resolved_references()->obj_at_put(obj_index, str);
duke@435:   }
duke@435: 
duke@435:   // For temporary use while constructing constant pool
duke@435:   void string_index_at_put(int which, int string_index) {
duke@435:     tag_at_put(which, JVM_CONSTANT_StringIndex);
duke@435:     *int_at_addr(which) = string_index;
duke@435:   }
duke@435: 
duke@435:   void field_at_put(int which, int class_index, int name_and_type_index) {
duke@435:     tag_at_put(which, JVM_CONSTANT_Fieldref);
duke@435:     *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index;
duke@435:   }
duke@435: 
duke@435:   void method_at_put(int which, int class_index, int name_and_type_index) {
duke@435:     tag_at_put(which, JVM_CONSTANT_Methodref);
duke@435:     *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index;
duke@435:   }
duke@435: 
duke@435:   void interface_method_at_put(int which, int class_index, int name_and_type_index) {
duke@435:     tag_at_put(which, JVM_CONSTANT_InterfaceMethodref);
duke@435:     *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index;  // Not so nice
duke@435:   }
duke@435: 
duke@435:   void name_and_type_at_put(int which, int name_index, int signature_index) {
duke@435:     tag_at_put(which, JVM_CONSTANT_NameAndType);
duke@435:     *int_at_addr(which) = ((jint) signature_index<<16) | name_index;  // Not so nice
duke@435:   }
duke@435: 
duke@435:   // Tag query
duke@435: 
coleenp@4037:   constantTag tag_at(int which) const { return (constantTag)tags()->at_acquire(which); }
coleenp@2497: 
duke@435:   // Fetching constants
duke@435: 
coleenp@4037:   Klass* klass_at(int which, TRAPS) {
duke@435:     constantPoolHandle h_this(THREAD, this);
duke@435:     return klass_at_impl(h_this, which, CHECK_NULL);
duke@435:   }
duke@435: 
coleenp@2497:   Symbol* klass_name_at(int which);  // Returns the name, w/o resolving.
duke@435: 
coleenp@4037:   Klass* resolved_klass_at(int which) {  // Used by Compiler
duke@435:     guarantee(tag_at(which).is_klass(), "Corrupted constant pool");
duke@435:     // Must do an acquire here in case another thread resolved the klass
duke@435:     // behind our back, lest we later load stale values thru the oop.
coleenp@4037:     return CPSlot((Klass*)OrderAccess::load_ptr_acquire(obj_at_addr_raw(which))).get_klass();
duke@435:   }
duke@435: 
duke@435:   // This method should only be used with a cpool lock or during parsing or gc
coleenp@2497:   Symbol* unresolved_klass_at(int which) {     // Temporary until actual use
coleenp@4037:     Symbol* s = CPSlot((Symbol*)OrderAccess::load_ptr_acquire(obj_at_addr_raw(which))).get_symbol();
duke@435:     // check that the klass is still unresolved.
duke@435:     assert(tag_at(which).is_unresolved_klass(), "Corrupted constant pool");
duke@435:     return s;
duke@435:   }
duke@435: 
duke@435:   // RedefineClasses() API support:
coleenp@2497:   Symbol* klass_at_noresolve(int which) { return klass_name_at(which); }
duke@435: 
duke@435:   jint int_at(int which) {
duke@435:     assert(tag_at(which).is_int(), "Corrupted constant pool");
duke@435:     return *int_at_addr(which);
duke@435:   }
duke@435: 
duke@435:   jlong long_at(int which) {
duke@435:     assert(tag_at(which).is_long(), "Corrupted constant pool");
duke@435:     // return *long_at_addr(which);
duke@435:     u8 tmp = Bytes::get_native_u8((address)&base()[which]);
duke@435:     return *((jlong*)&tmp);
duke@435:   }
duke@435: 
duke@435:   jfloat float_at(int which) {
duke@435:     assert(tag_at(which).is_float(), "Corrupted constant pool");
duke@435:     return *float_at_addr(which);
duke@435:   }
duke@435: 
duke@435:   jdouble double_at(int which) {
duke@435:     assert(tag_at(which).is_double(), "Corrupted constant pool");
duke@435:     u8 tmp = Bytes::get_native_u8((address)&base()[which]);
duke@435:     return *((jdouble*)&tmp);
duke@435:   }
duke@435: 
coleenp@2497:   Symbol* symbol_at(int which) {
duke@435:     assert(tag_at(which).is_utf8(), "Corrupted constant pool");
coleenp@4037:     return *symbol_at_addr(which);
duke@435:   }
duke@435: 
coleenp@4037:   oop string_at(int which, int obj_index, TRAPS) {
coleenp@4037:     constantPoolHandle h_this(THREAD, this);
coleenp@4037:     return string_at_impl(h_this, which, obj_index, THREAD);
coleenp@4037:   }
duke@435:   oop string_at(int which, TRAPS) {
coleenp@4037:     int obj_index = cp_to_object_index(which);
coleenp@4037:     return string_at(which, obj_index, THREAD);
duke@435:   }
duke@435: 
coleenp@4037:   // Version that can be used before string oop array is created.
coleenp@4037:   oop uncached_string_at(int which, TRAPS);
coleenp@4037: 
jrose@866:   // A "pseudo-string" is an non-string oop that has found is way into
jrose@866:   // a String entry.
twisti@2698:   // Under EnableInvokeDynamic this can happen if the user patches a live
jrose@866:   // object into a CONSTANT_String entry of an anonymous class.
jrose@866:   // Method oops internally created for method handles may also
jrose@866:   // use pseudo-strings to link themselves to related metaobjects.
jrose@866: 
coleenp@4037:   bool is_pseudo_string_at(int which) {
coleenp@4037:     // A pseudo string is a string that doesn't have a symbol in the cpSlot
coleenp@4037:     return unresolved_string_at(which) == NULL;
jrose@866:   }
jrose@866: 
coleenp@4037:   oop pseudo_string_at(int which, int obj_index) {
coleenp@4037:     assert(tag_at(which).is_string(), "Corrupted constant pool");
coleenp@4037:     assert(unresolved_string_at(which) == NULL, "shouldn't have symbol");
coleenp@4037:     oop s = resolved_references()->obj_at(obj_index);
coleenp@4037:     return s;
coleenp@4037:   }
coleenp@4037: 
coleenp@4643:   oop pseudo_string_at(int which) {
coleenp@4643:     assert(tag_at(which).is_string(), "Corrupted constant pool");
coleenp@4643:     assert(unresolved_string_at(which) == NULL, "shouldn't have symbol");
coleenp@4643:     int obj_index = cp_to_object_index(which);
coleenp@4643:     oop s = resolved_references()->obj_at(obj_index);
coleenp@4643:     return s;
coleenp@4643:   }
coleenp@4643: 
coleenp@4037:   void pseudo_string_at_put(int which, int obj_index, oop x) {
twisti@2698:     assert(EnableInvokeDynamic, "");
coleenp@4037:     assert(tag_at(which).is_string(), "Corrupted constant pool");
coleenp@4643:     unresolved_string_at_put(which, NULL); // indicates patched string
coleenp@4037:     string_at_put(which, obj_index, x);    // this works just fine
jrose@866:   }
jrose@866: 
duke@435:   // only called when we are sure a string entry is already resolved (via an
duke@435:   // earlier string_at call.
duke@435:   oop resolved_string_at(int which) {
duke@435:     assert(tag_at(which).is_string(), "Corrupted constant pool");
duke@435:     // Must do an acquire here in case another thread resolved the klass
duke@435:     // behind our back, lest we later load stale values thru the oop.
coleenp@4142:     // we might want a volatile_obj_at in ObjArrayKlass.
coleenp@4037:     int obj_index = cp_to_object_index(which);
coleenp@4037:     return resolved_references()->obj_at(obj_index);
duke@435:   }
duke@435: 
coleenp@4037:   Symbol* unresolved_string_at(int which) {
coleenp@4037:     assert(tag_at(which).is_string(), "Corrupted constant pool");
coleenp@4037:     Symbol* s = *symbol_at_addr(which);
duke@435:     return s;
duke@435:   }
duke@435: 
duke@435:   // Returns an UTF8 for a CONSTANT_String entry at a given index.
duke@435:   // UTF8 char* representation was chosen to avoid conversion of
coleenp@2497:   // java_lang_Strings at resolved entries into Symbol*s
duke@435:   // or vice versa.
jrose@866:   // Caller is responsible for checking for pseudo-strings.
duke@435:   char* string_at_noresolve(int which);
duke@435: 
duke@435:   jint name_and_type_at(int which) {
duke@435:     assert(tag_at(which).is_name_and_type(), "Corrupted constant pool");
duke@435:     return *int_at_addr(which);
duke@435:   }
duke@435: 
jrose@1957:   int method_handle_ref_kind_at(int which) {
jrose@1957:     assert(tag_at(which).is_method_handle(), "Corrupted constant pool");
jrose@1957:     return extract_low_short_from_int(*int_at_addr(which));  // mask out unwanted ref_index bits
jrose@1957:   }
jrose@1957:   int method_handle_index_at(int which) {
jrose@1957:     assert(tag_at(which).is_method_handle(), "Corrupted constant pool");
jrose@1957:     return extract_high_short_from_int(*int_at_addr(which));  // shift out unwanted ref_kind bits
jrose@1957:   }
jrose@1957:   int method_type_index_at(int which) {
jrose@1957:     assert(tag_at(which).is_method_type(), "Corrupted constant pool");
jrose@1957:     return *int_at_addr(which);
jrose@1957:   }
jrose@1957:   // Derived queries:
coleenp@2497:   Symbol* method_handle_name_ref_at(int which) {
jrose@1957:     int member = method_handle_index_at(which);
jrose@1957:     return impl_name_ref_at(member, true);
jrose@1957:   }
coleenp@2497:   Symbol* method_handle_signature_ref_at(int which) {
jrose@1957:     int member = method_handle_index_at(which);
jrose@1957:     return impl_signature_ref_at(member, true);
jrose@1957:   }
jrose@1957:   int method_handle_klass_index_at(int which) {
jrose@1957:     int member = method_handle_index_at(which);
jrose@1957:     return impl_klass_ref_index_at(member, true);
jrose@1957:   }
coleenp@2497:   Symbol* method_type_signature_at(int which) {
jrose@1957:     int sym = method_type_index_at(which);
jrose@1957:     return symbol_at(sym);
jrose@1957:   }
jrose@2268: 
jrose@2353:   int invoke_dynamic_name_and_type_ref_index_at(int which) {
jrose@2353:     assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool");
jrose@2353:     return extract_high_short_from_int(*int_at_addr(which));
jrose@2268:   }
jrose@2353:   int invoke_dynamic_bootstrap_specifier_index(int which) {
jrose@2353:     assert(tag_at(which).value() == JVM_CONSTANT_InvokeDynamic, "Corrupted constant pool");
jrose@2353:     return extract_low_short_from_int(*int_at_addr(which));
jrose@2268:   }
jrose@2353:   int invoke_dynamic_operand_base(int which) {
jrose@2353:     int bootstrap_specifier_index = invoke_dynamic_bootstrap_specifier_index(which);
jrose@2353:     return operand_offset_at(operands(), bootstrap_specifier_index);
jrose@2268:   }
jrose@2353:   // The first part of the operands array consists of an index into the second part.
jrose@2353:   // Extract a 32-bit index value from the first part.
coleenp@4037:   static int operand_offset_at(Array<u2>* operands, int bootstrap_specifier_index) {
jrose@2353:     int n = (bootstrap_specifier_index * 2);
jrose@2353:     assert(n >= 0 && n+2 <= operands->length(), "oob");
jrose@2353:     // The first 32-bit index points to the beginning of the second part
jrose@2353:     // of the operands array.  Make sure this index is in the first part.
coleenp@4037:     DEBUG_ONLY(int second_part = build_int_from_shorts(operands->at(0),
coleenp@4037:                                                        operands->at(1)));
jrose@2353:     assert(second_part == 0 || n+2 <= second_part, "oob (2)");
coleenp@4037:     int offset = build_int_from_shorts(operands->at(n+0),
coleenp@4037:                                        operands->at(n+1));
jrose@2353:     // The offset itself must point into the second part of the array.
jrose@2353:     assert(offset == 0 || offset >= second_part && offset <= operands->length(), "oob (3)");
jrose@2353:     return offset;
jrose@2268:   }
coleenp@4037:   static void operand_offset_at_put(Array<u2>* operands, int bootstrap_specifier_index, int offset) {
jrose@2353:     int n = bootstrap_specifier_index * 2;
jrose@2353:     assert(n >= 0 && n+2 <= operands->length(), "oob");
coleenp@4037:     operands->at_put(n+0, extract_low_short_from_int(offset));
coleenp@4037:     operands->at_put(n+1, extract_high_short_from_int(offset));
jrose@2268:   }
coleenp@4037:   static int operand_array_length(Array<u2>* operands) {
jrose@2353:     if (operands == NULL || operands->length() == 0)  return 0;
jrose@2353:     int second_part = operand_offset_at(operands, 0);
jrose@2353:     return (second_part / 2);
jrose@2268:   }
jrose@2268: 
jrose@2353: #ifdef ASSERT
jrose@2353:   // operand tuples fit together exactly, end to end
coleenp@4037:   static int operand_limit_at(Array<u2>* operands, int bootstrap_specifier_index) {
jrose@2353:     int nextidx = bootstrap_specifier_index + 1;
jrose@2353:     if (nextidx == operand_array_length(operands))
jrose@2353:       return operands->length();
jrose@2353:     else
jrose@2353:       return operand_offset_at(operands, nextidx);
jrose@2353:   }
jrose@2353:   int invoke_dynamic_operand_limit(int which) {
jrose@2353:     int bootstrap_specifier_index = invoke_dynamic_bootstrap_specifier_index(which);
jrose@2353:     return operand_limit_at(operands(), bootstrap_specifier_index);
jrose@2353:   }
jrose@2353: #endif //ASSERT
jrose@2353: 
jrose@2353:   // layout of InvokeDynamic bootstrap method specifier (in second part of operands array):
jrose@2268:   enum {
jrose@2268:          _indy_bsm_offset  = 0,  // CONSTANT_MethodHandle bsm
jrose@2353:          _indy_argc_offset = 1,  // u2 argc
jrose@2353:          _indy_argv_offset = 2   // u2 argv[argc]
jrose@2268:   };
jrose@2015:   int invoke_dynamic_bootstrap_method_ref_index_at(int which) {
jrose@2015:     assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool");
jrose@2353:     int op_base = invoke_dynamic_operand_base(which);
coleenp@4037:     return operands()->at(op_base + _indy_bsm_offset);
jrose@2268:   }
jrose@2268:   int invoke_dynamic_argument_count_at(int which) {
jrose@2268:     assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool");
jrose@2353:     int op_base = invoke_dynamic_operand_base(which);
coleenp@4037:     int argc = operands()->at(op_base + _indy_argc_offset);
jrose@2353:     DEBUG_ONLY(int end_offset = op_base + _indy_argv_offset + argc;
jrose@2353:                int next_offset = invoke_dynamic_operand_limit(which));
jrose@2353:     assert(end_offset == next_offset, "matched ending");
jrose@2268:     return argc;
jrose@2268:   }
jrose@2268:   int invoke_dynamic_argument_index_at(int which, int j) {
jrose@2353:     int op_base = invoke_dynamic_operand_base(which);
coleenp@4037:     DEBUG_ONLY(int argc = operands()->at(op_base + _indy_argc_offset));
jrose@2353:     assert((uint)j < (uint)argc, "oob");
coleenp@4037:     return operands()->at(op_base + _indy_argv_offset + j);
jrose@2015:   }
jrose@1957: 
jrose@1161:   // The following methods (name/signature/klass_ref_at, klass_ref_at_noresolve,
jrose@1494:   // name_and_type_ref_index_at) all expect to be passed indices obtained
jrose@2265:   // directly from the bytecode.
jrose@1494:   // If the indices are meant to refer to fields or methods, they are
jrose@2265:   // actually rewritten constant pool cache indices.
jrose@1494:   // The routine remap_instruction_operand_from_cache manages the adjustment
jrose@1494:   // of these values back to constant pool indices.
jrose@1161: 
jrose@1494:   // There are also "uncached" versions which do not adjust the operand index; see below.
duke@435: 
jrose@2265:   // FIXME: Consider renaming these with a prefix "cached_" to make the distinction clear.
jrose@2265:   // In a few cases (the verifier) there are uses before a cpcache has been built,
jrose@2265:   // which are handled by a dynamic check in remap_instruction_operand_from_cache.
jrose@2265:   // FIXME: Remove the dynamic check, and adjust all callers to specify the correct mode.
jrose@2265: 
duke@435:   // Lookup for entries consisting of (klass_index, name_and_type index)
coleenp@4037:   Klass* klass_ref_at(int which, TRAPS);
coleenp@2497:   Symbol* klass_ref_at_noresolve(int which);
coleenp@2497:   Symbol* name_ref_at(int which)                { return impl_name_ref_at(which, false); }
coleenp@2497:   Symbol* signature_ref_at(int which)           { return impl_signature_ref_at(which, false); }
duke@435: 
jrose@1161:   int klass_ref_index_at(int which)               { return impl_klass_ref_index_at(which, false); }
jrose@1161:   int name_and_type_ref_index_at(int which)       { return impl_name_and_type_ref_index_at(which, false); }
duke@435: 
duke@435:   // Lookup for entries consisting of (name_index, signature_index)
jrose@1161:   int name_ref_index_at(int which_nt);            // ==  low-order jshort of name_and_type_at(which_nt)
jrose@1161:   int signature_ref_index_at(int which_nt);       // == high-order jshort of name_and_type_at(which_nt)
duke@435: 
duke@435:   BasicType basic_type_for_signature_at(int which);
duke@435: 
duke@435:   // Resolve string constants (to prevent allocation during compilation)
duke@435:   void resolve_string_constants(TRAPS) {
duke@435:     constantPoolHandle h_this(THREAD, this);
duke@435:     resolve_string_constants_impl(h_this, CHECK);
duke@435:   }
duke@435: 
coleenp@4037:   // CDS support
coleenp@4037:   void remove_unshareable_info();
coleenp@4037:   void restore_unshareable_info(TRAPS);
coleenp@4037:   bool resolve_class_constants(TRAPS);
coleenp@4045:   // The ConstantPool vtable is restored by this call when the ConstantPool is
coleenp@4045:   // in the shared archive.  See patch_klass_vtables() in metaspaceShared.cpp for
coleenp@4045:   // all the gory details.  SA, dtrace and pstack helpers distinguish metadata
coleenp@4045:   // by their vtable.
coleenp@4045:   void restore_vtable() { guarantee(is_constantPool(), "vtable restored by this call"); }
coleenp@4037: 
jrose@2268:  private:
jrose@2268:   enum { _no_index_sentinel = -1, _possible_index_sentinel = -2 };
jrose@2268:  public:
jrose@2268: 
jrose@1957:   // Resolve late bound constants.
jrose@1957:   oop resolve_constant_at(int index, TRAPS) {
jrose@1957:     constantPoolHandle h_this(THREAD, this);
jrose@2268:     return resolve_constant_at_impl(h_this, index, _no_index_sentinel, THREAD);
jrose@1957:   }
jrose@1957: 
jrose@1957:   oop resolve_cached_constant_at(int cache_index, TRAPS) {
jrose@1957:     constantPoolHandle h_this(THREAD, this);
jrose@2268:     return resolve_constant_at_impl(h_this, _no_index_sentinel, cache_index, THREAD);
jrose@2268:   }
jrose@2268: 
jrose@2268:   oop resolve_possibly_cached_constant_at(int pool_index, TRAPS) {
jrose@2268:     constantPoolHandle h_this(THREAD, this);
jrose@2268:     return resolve_constant_at_impl(h_this, pool_index, _possible_index_sentinel, THREAD);
jrose@1957:   }
jrose@1957: 
twisti@3969:   oop resolve_bootstrap_specifier_at(int index, TRAPS) {
twisti@3969:     constantPoolHandle h_this(THREAD, this);
twisti@3969:     return resolve_bootstrap_specifier_at_impl(h_this, index, THREAD);
twisti@3969:   }
twisti@3969: 
duke@435:   // Klass name matches name at offset
duke@435:   bool klass_name_at_matches(instanceKlassHandle k, int which);
duke@435: 
duke@435:   // Sizing
coleenp@548:   int length() const                   { return _length; }
coleenp@548:   void set_length(int length)          { _length = length; }
coleenp@548: 
coleenp@548:   // Tells whether index is within bounds.
coleenp@548:   bool is_within_bounds(int index) const {
coleenp@548:     return 0 <= index && index < length();
coleenp@548:   }
coleenp@548: 
acorn@4497:   // Sizing (in words)
coleenp@4037:   static int header_size()             { return sizeof(ConstantPool)/HeapWordSize; }
coleenp@4037:   static int size(int length)          { return align_object_size(header_size() + length); }
coleenp@4037:   int size() const                     { return size(length()); }
acorn@4497: #if INCLUDE_SERVICES
acorn@4497:   void collect_statistics(KlassSizeStats *sz) const;
acorn@4497: #endif
duke@435: 
duke@435:   friend class ClassFileParser;
duke@435:   friend class SystemDictionary;
duke@435: 
duke@435:   // Used by compiler to prevent classloading.
twisti@4133:   static Method*          method_at_if_loaded      (constantPoolHandle this_oop, int which);
twisti@4133:   static bool       has_appendix_at_if_loaded      (constantPoolHandle this_oop, int which);
twisti@4133:   static oop            appendix_at_if_loaded      (constantPoolHandle this_oop, int which);
twisti@4133:   static bool    has_method_type_at_if_loaded      (constantPoolHandle this_oop, int which);
twisti@4133:   static oop         method_type_at_if_loaded      (constantPoolHandle this_oop, int which);
twisti@4133:   static Klass*            klass_at_if_loaded      (constantPoolHandle this_oop, int which);
twisti@4133:   static Klass*        klass_ref_at_if_loaded      (constantPoolHandle this_oop, int which);
duke@435:   // Same as above - but does LinkResolving.
twisti@4133:   static Klass*        klass_ref_at_if_loaded_check(constantPoolHandle this_oop, int which, TRAPS);
duke@435: 
duke@435:   // Routines currently used for annotations (only called by jvm.cpp) but which might be used in the
jrose@2265:   // future by other Java code. These take constant pool indices rather than
duke@435:   // constant pool cache indices as do the peer methods above.
coleenp@2497:   Symbol* uncached_klass_ref_at_noresolve(int which);
coleenp@2497:   Symbol* uncached_name_ref_at(int which)                 { return impl_name_ref_at(which, true); }
coleenp@2497:   Symbol* uncached_signature_ref_at(int which)            { return impl_signature_ref_at(which, true); }
jrose@1161:   int       uncached_klass_ref_index_at(int which)          { return impl_klass_ref_index_at(which, true); }
jrose@1161:   int       uncached_name_and_type_ref_index_at(int which)  { return impl_name_and_type_ref_index_at(which, true); }
duke@435: 
duke@435:   // Sharing
duke@435:   int pre_resolve_shared_klasses(TRAPS);
duke@435: 
duke@435:   // Debugging
duke@435:   const char* printable_name_at(int which) PRODUCT_RETURN0;
duke@435: 
jrose@1920: #ifdef ASSERT
jrose@1920:   enum { CPCACHE_INDEX_TAG = 0x10000 };  // helps keep CP cache indices distinct from CP indices
jrose@1957: #else
jrose@1957:   enum { CPCACHE_INDEX_TAG = 0 };        // in product mode, this zero value is a no-op
jrose@1920: #endif //ASSERT
jrose@1920: 
coleenp@4037:   static int decode_cpcache_index(int raw_index, bool invokedynamic_ok = false) {
coleenp@4037:     if (invokedynamic_ok && is_invokedynamic_index(raw_index))
coleenp@4037:       return decode_invokedynamic_index(raw_index);
coleenp@4037:     else
coleenp@4037:       return raw_index - CPCACHE_INDEX_TAG;
coleenp@4037:   }
twisti@3969: 
duke@435:  private:
duke@435: 
coleenp@4037:   void set_resolved_references(jobject s) { _resolved_references = s; }
coleenp@4037:   Array<u2>* reference_map() const        { return _reference_map; }
coleenp@4037:   void set_reference_map(Array<u2>* o)    { _reference_map = o; }
coleenp@4037: 
coleenp@4037:   // patch JSR 292 resolved references after the class is linked.
coleenp@4037:   void patch_resolved_references(GrowableArray<Handle>* cp_patches);
coleenp@4037: 
coleenp@2497:   Symbol* impl_name_ref_at(int which, bool uncached);
coleenp@2497:   Symbol* impl_signature_ref_at(int which, bool uncached);
jrose@1161:   int       impl_klass_ref_index_at(int which, bool uncached);
jrose@1161:   int       impl_name_and_type_ref_index_at(int which, bool uncached);
jrose@1161: 
jrose@1920:   int remap_instruction_operand_from_cache(int operand);  // operand must be biased by CPCACHE_INDEX_TAG
duke@435: 
duke@435:   // Used while constructing constant pool (only by ClassFileParser)
duke@435:   jint klass_index_at(int which) {
duke@435:     assert(tag_at(which).is_klass_index(), "Corrupted constant pool");
duke@435:     return *int_at_addr(which);
duke@435:   }
duke@435: 
duke@435:   jint string_index_at(int which) {
duke@435:     assert(tag_at(which).is_string_index(), "Corrupted constant pool");
duke@435:     return *int_at_addr(which);
duke@435:   }
duke@435: 
duke@435:   // Performs the LinkResolver checks
duke@435:   static void verify_constant_pool_resolve(constantPoolHandle this_oop, KlassHandle klass, TRAPS);
duke@435: 
duke@435:   // Implementation of methods that needs an exposed 'this' pointer, in order to
duke@435:   // handle GC while executing the method
coleenp@4037:   static Klass* klass_at_impl(constantPoolHandle this_oop, int which, TRAPS);
coleenp@4037:   static oop string_at_impl(constantPoolHandle this_oop, int which, int obj_index, TRAPS);
duke@435: 
duke@435:   // Resolve string constants (to prevent allocation during compilation)
duke@435:   static void resolve_string_constants_impl(constantPoolHandle this_oop, TRAPS);
duke@435: 
jrose@1957:   static oop resolve_constant_at_impl(constantPoolHandle this_oop, int index, int cache_index, TRAPS);
coleenp@4037:   static void save_and_throw_exception(constantPoolHandle this_oop, int which, int tag_value, TRAPS);
twisti@3969:   static oop resolve_bootstrap_specifier_at_impl(constantPoolHandle this_oop, int index, TRAPS);
jrose@1957: 
duke@435:  public:
coleenp@4037:   // Merging ConstantPool* support:
duke@435:   bool compare_entry_to(int index1, constantPoolHandle cp2, int index2, TRAPS);
jrose@2353:   void copy_cp_to(int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS) {
jrose@2353:     constantPoolHandle h_this(THREAD, this);
jrose@2353:     copy_cp_to_impl(h_this, start_i, end_i, to_cp, to_i, THREAD);
jrose@2353:   }
jrose@2353:   static void copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS);
jrose@2353:   static void copy_entry_to(constantPoolHandle from_cp, int from_i, constantPoolHandle to_cp, int to_i, TRAPS);
sspitsyn@4493:   static void copy_operands(constantPoolHandle from_cp, constantPoolHandle to_cp, TRAPS);
duke@435:   int  find_matching_entry(int pattern_i, constantPoolHandle search_cp, TRAPS);
coleenp@4466:   int  version() const                    { return _saved._version; }
coleenp@4466:   void set_version(int version)           { _saved._version = version; }
coleenp@4466:   void increment_and_save_version(int version) {
coleenp@4467:     _saved._version = version >= 0 ? (version + 1) : version;  // keep overflow
coleenp@4466:   }
coleenp@4037: 
coleenp@4037:   void set_resolved_reference_length(int length) { _saved._resolved_reference_length = length; }
coleenp@4037:   int  resolved_reference_length() const  { return _saved._resolved_reference_length; }
coleenp@4037:   void set_lock(Monitor* lock)            { _lock = lock; }
coleenp@4037:   Monitor* lock()                         { return _lock; }
duke@435: 
coleenp@2497:   // Decrease ref counts of symbols that are in the constant pool
coleenp@2497:   // when the holder class is unloaded
coleenp@2497:   void unreference_symbols();
duke@435: 
coleenp@4037:   // Deallocate constant pool for RedefineClasses
coleenp@4037:   void deallocate_contents(ClassLoaderData* loader_data);
coleenp@4037:   void release_C_heap_structures();
coleenp@4037: 
duke@435:   // JVMTI accesss - GetConstantPool, RetransformClasses, ...
duke@435:   friend class JvmtiConstantPoolReconstituter;
duke@435: 
duke@435:  private:
duke@435:   jint cpool_entry_size(jint idx);
duke@435:   jint hash_entries_to(SymbolHashMap *symmap, SymbolHashMap *classmap);
duke@435: 
duke@435:   // Copy cpool bytes into byte array.
duke@435:   // Returns:
duke@435:   //  int > 0, count of the raw cpool bytes that have been copied
duke@435:   //        0, OutOfMemory error
duke@435:   //       -1, Internal error
duke@435:   int  copy_cpool_bytes(int cpool_size,
duke@435:                         SymbolHashMap* tbl,
duke@435:                         unsigned char *bytes);
coleenp@4037: 
coleenp@4037:  public:
coleenp@4037:   // Verify
coleenp@4037:   void verify_on(outputStream* st);
coleenp@4037: 
coleenp@4037:   // Printing
coleenp@4037:   void print_on(outputStream* st) const;
coleenp@4037:   void print_value_on(outputStream* st) const;
coleenp@4037:   void print_entry_on(int index, outputStream* st);
coleenp@4037: 
coleenp@4037:   const char* internal_name() const { return "{constant pool}"; }
coleenp@4037: 
coleenp@4037: #ifndef PRODUCT
coleenp@4037:   // Compile the world support
coleenp@4037:   static void preload_and_initialize_all_classes(ConstantPool* constant_pool, TRAPS);
coleenp@4037: #endif
duke@435: };
duke@435: 
zgu@3900: class SymbolHashMapEntry : public CHeapObj<mtSymbol> {
duke@435:  private:
duke@435:   unsigned int        _hash;   // 32-bit hash for item
duke@435:   SymbolHashMapEntry* _next;   // Next element in the linked list for this bucket
coleenp@2497:   Symbol*             _symbol; // 1-st part of the mapping: symbol => value
duke@435:   u2                  _value;  // 2-nd part of the mapping: symbol => value
duke@435: 
duke@435:  public:
duke@435:   unsigned   int hash() const             { return _hash;   }
duke@435:   void       set_hash(unsigned int hash)  { _hash = hash;   }
duke@435: 
duke@435:   SymbolHashMapEntry* next() const        { return _next;   }
duke@435:   void set_next(SymbolHashMapEntry* next) { _next = next;   }
duke@435: 
coleenp@2497:   Symbol*    symbol() const               { return _symbol; }
coleenp@2497:   void       set_symbol(Symbol* sym)      { _symbol = sym;  }
duke@435: 
duke@435:   u2         value() const                {  return _value; }
duke@435:   void       set_value(u2 value)          { _value = value; }
duke@435: 
coleenp@2497:   SymbolHashMapEntry(unsigned int hash, Symbol* symbol, u2 value)
duke@435:     : _hash(hash), _symbol(symbol), _value(value), _next(NULL) {}
duke@435: 
duke@435: }; // End SymbolHashMapEntry class
duke@435: 
duke@435: 
zgu@3900: class SymbolHashMapBucket : public CHeapObj<mtSymbol> {
duke@435: 
duke@435: private:
duke@435:   SymbolHashMapEntry*    _entry;
duke@435: 
duke@435: public:
duke@435:   SymbolHashMapEntry* entry() const         {  return _entry; }
duke@435:   void set_entry(SymbolHashMapEntry* entry) { _entry = entry; }
duke@435:   void clear()                              { _entry = NULL;  }
duke@435: 
duke@435: }; // End SymbolHashMapBucket class
duke@435: 
duke@435: 
zgu@3900: class SymbolHashMap: public CHeapObj<mtSymbol> {
duke@435: 
duke@435:  private:
duke@435:   // Default number of entries in the table
duke@435:   enum SymbolHashMap_Constants {
duke@435:     _Def_HashMap_Size = 256
duke@435:   };
duke@435: 
duke@435:   int                   _table_size;
duke@435:   SymbolHashMapBucket*  _buckets;
duke@435: 
duke@435:   void initialize_table(int table_size) {
duke@435:     _table_size = table_size;
zgu@3900:     _buckets = NEW_C_HEAP_ARRAY(SymbolHashMapBucket, table_size, mtSymbol);
duke@435:     for (int index = 0; index < table_size; index++) {
duke@435:       _buckets[index].clear();
duke@435:     }
duke@435:   }
duke@435: 
duke@435:  public:
duke@435: 
duke@435:   int table_size() const        { return _table_size; }
duke@435: 
duke@435:   SymbolHashMap()               { initialize_table(_Def_HashMap_Size); }
duke@435:   SymbolHashMap(int table_size) { initialize_table(table_size); }
duke@435: 
duke@435:   // hash P(31) from Kernighan & Ritchie
duke@435:   static unsigned int compute_hash(const char* str, int len) {
duke@435:     unsigned int hash = 0;
duke@435:     while (len-- > 0) {
duke@435:       hash = 31*hash + (unsigned) *str;
duke@435:       str++;
duke@435:     }
duke@435:     return hash;
duke@435:   }
duke@435: 
duke@435:   SymbolHashMapEntry* bucket(int i) {
duke@435:     return _buckets[i].entry();
duke@435:   }
duke@435: 
coleenp@2497:   void add_entry(Symbol* sym, u2 value);
coleenp@2497:   SymbolHashMapEntry* find_entry(Symbol* sym);
duke@435: 
coleenp@2497:   u2 symbol_to_value(Symbol* sym) {
duke@435:     SymbolHashMapEntry *entry = find_entry(sym);
duke@435:     return (entry == NULL) ? 0 : entry->value();
duke@435:   }
duke@435: 
duke@435:   ~SymbolHashMap() {
duke@435:     SymbolHashMapEntry* next;
duke@435:     for (int i = 0; i < _table_size; i++) {
duke@435:       for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) {
duke@435:         next = cur->next();
duke@435:         delete(cur);
duke@435:       }
duke@435:     }
duke@435:     delete _buckets;
duke@435:   }
duke@435: }; // End SymbolHashMap class
stefank@2314: 
stefank@2314: #endif // SHARE_VM_OOPS_CONSTANTPOOLOOP_HPP