src/share/vm/oops/symbol.cpp

Wed, 22 Jan 2014 17:42:23 -0800

author
kvn
date
Wed, 22 Jan 2014 17:42:23 -0800
changeset 6503
a9becfeecd1b
parent 5614
9758d9f36299
child 6351
f9e35a9dc8c7
permissions
-rw-r--r--

Merge

     1 /*
     2  * Copyright (c) 1997, 2013, 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  */
    26 #include "precompiled.hpp"
    27 #include "classfile/altHashing.hpp"
    28 #include "classfile/classLoaderData.hpp"
    29 #include "oops/symbol.hpp"
    30 #include "runtime/atomic.inline.hpp"
    31 #include "runtime/os.hpp"
    32 #include "memory/allocation.inline.hpp"
    33 #include "memory/resourceArea.hpp"
    35 Symbol::Symbol(const u1* name, int length, int refcount) {
    36   _refcount = refcount;
    37   _length = length;
    38   _identity_hash = os::random();
    39   for (int i = 0; i < _length; i++) {
    40     byte_at_put(i, name[i]);
    41   }
    42 }
    44 void* Symbol::operator new(size_t sz, int len, TRAPS) throw() {
    45   int alloc_size = size(len)*HeapWordSize;
    46   address res = (address) AllocateHeap(alloc_size, mtSymbol);
    47   return res;
    48 }
    50 void* Symbol::operator new(size_t sz, int len, Arena* arena, TRAPS) throw() {
    51   int alloc_size = size(len)*HeapWordSize;
    52   address res = (address)arena->Amalloc(alloc_size);
    53   return res;
    54 }
    56 void* Symbol::operator new(size_t sz, int len, ClassLoaderData* loader_data, TRAPS) throw() {
    57   address res;
    58   int alloc_size = size(len)*HeapWordSize;
    59   res = (address) Metaspace::allocate(loader_data, size(len), true,
    60                                       MetaspaceObj::SymbolType, CHECK_NULL);
    61   return res;
    62 }
    64 void Symbol::operator delete(void *p) {
    65   assert(((Symbol*)p)->refcount() == 0, "should not call this");
    66   FreeHeap(p);
    67 }
    69 // ------------------------------------------------------------------
    70 // Symbol::equals
    71 //
    72 // Compares the symbol with a string of the given length.
    73 bool Symbol::equals(const char* str, int len) const {
    74   int l = utf8_length();
    75   if (l != len) return false;
    76   while (l-- > 0) {
    77     if (str[l] != (char) byte_at(l))
    78       return false;
    79   }
    80   assert(l == -1, "we should be at the beginning");
    81   return true;
    82 }
    85 // ------------------------------------------------------------------
    86 // Symbol::starts_with
    87 //
    88 // Tests if the symbol starts with the specified prefix of the given
    89 // length.
    90 bool Symbol::starts_with(const char* prefix, int len) const {
    91   if (len > utf8_length()) return false;
    92   while (len-- > 0) {
    93     if (prefix[len] != (char) byte_at(len))
    94       return false;
    95   }
    96   assert(len == -1, "we should be at the beginning");
    97   return true;
    98 }
   101 // ------------------------------------------------------------------
   102 // Symbol::index_of
   103 //
   104 // Finds if the given string is a substring of this symbol's utf8 bytes.
   105 // Return -1 on failure.  Otherwise return the first index where str occurs.
   106 int Symbol::index_of_at(int i, const char* str, int len) const {
   107   assert(i >= 0 && i <= utf8_length(), "oob");
   108   if (len <= 0)  return 0;
   109   char first_char = str[0];
   110   address bytes = (address) ((Symbol*)this)->base();
   111   address limit = bytes + utf8_length() - len;  // inclusive limit
   112   address scan = bytes + i;
   113   if (scan > limit)
   114     return -1;
   115   for (; scan <= limit; scan++) {
   116     scan = (address) memchr(scan, first_char, (limit + 1 - scan));
   117     if (scan == NULL)
   118       return -1;  // not found
   119     assert(scan >= bytes+i && scan <= limit, "scan oob");
   120     if (memcmp(scan, str, len) == 0)
   121       return (int)(scan - bytes);
   122   }
   123   return -1;
   124 }
   127 char* Symbol::as_C_string(char* buf, int size) const {
   128   if (size > 0) {
   129     int len = MIN2(size - 1, utf8_length());
   130     for (int i = 0; i < len; i++) {
   131       buf[i] = byte_at(i);
   132     }
   133     buf[len] = '\0';
   134   }
   135   return buf;
   136 }
   138 char* Symbol::as_C_string() const {
   139   int len = utf8_length();
   140   char* str = NEW_RESOURCE_ARRAY(char, len + 1);
   141   return as_C_string(str, len + 1);
   142 }
   144 char* Symbol::as_C_string_flexible_buffer(Thread* t,
   145                                                  char* buf, int size) const {
   146   char* str;
   147   int len = utf8_length();
   148   int buf_len = len + 1;
   149   if (size < buf_len) {
   150     str = NEW_RESOURCE_ARRAY(char, buf_len);
   151   } else {
   152     str = buf;
   153   }
   154   return as_C_string(str, buf_len);
   155 }
   157 void Symbol::print_symbol_on(outputStream* st) const {
   158   ResourceMark rm;
   159   st = st ? st : tty;
   160   st->print("%s", as_quoted_ascii());
   161 }
   163 char* Symbol::as_quoted_ascii() const {
   164   const char *ptr = (const char *)&_body[0];
   165   int quoted_length = UTF8::quoted_ascii_length(ptr, utf8_length());
   166   char* result = NEW_RESOURCE_ARRAY(char, quoted_length + 1);
   167   UTF8::as_quoted_ascii(ptr, utf8_length(), result, quoted_length + 1);
   168   return result;
   169 }
   171 jchar* Symbol::as_unicode(int& length) const {
   172   Symbol* this_ptr = (Symbol*)this;
   173   length = UTF8::unicode_length((char*)this_ptr->bytes(), utf8_length());
   174   jchar* result = NEW_RESOURCE_ARRAY(jchar, length);
   175   if (length > 0) {
   176     UTF8::convert_to_unicode((char*)this_ptr->bytes(), result, length);
   177   }
   178   return result;
   179 }
   181 const char* Symbol::as_klass_external_name(char* buf, int size) const {
   182   if (size > 0) {
   183     char* str    = as_C_string(buf, size);
   184     int   length = (int)strlen(str);
   185     // Turn all '/'s into '.'s (also for array klasses)
   186     for (int index = 0; index < length; index++) {
   187       if (str[index] == '/') {
   188         str[index] = '.';
   189       }
   190     }
   191     return str;
   192   } else {
   193     return buf;
   194   }
   195 }
   197 const char* Symbol::as_klass_external_name() const {
   198   char* str    = as_C_string();
   199   int   length = (int)strlen(str);
   200   // Turn all '/'s into '.'s (also for array klasses)
   201   for (int index = 0; index < length; index++) {
   202     if (str[index] == '/') {
   203       str[index] = '.';
   204     }
   205   }
   206   return str;
   207 }
   209 // Alternate hashing for unbalanced symbol tables.
   210 unsigned int Symbol::new_hash(jint seed) {
   211   ResourceMark rm;
   212   // Use alternate hashing algorithm on this symbol.
   213   return AltHashing::murmur3_32(seed, (const jbyte*)as_C_string(), utf8_length());
   214 }
   216 void Symbol::increment_refcount() {
   217   // Only increment the refcount if positive.  If negative either
   218   // overflow has occurred or it is a permanent symbol in a read only
   219   // shared archive.
   220   if (_refcount >= 0) {
   221     Atomic::inc(&_refcount);
   222     NOT_PRODUCT(Atomic::inc(&_total_count);)
   223   }
   224 }
   226 void Symbol::decrement_refcount() {
   227   if (_refcount >= 0) {
   228     Atomic::dec(&_refcount);
   229 #ifdef ASSERT
   230     if (_refcount < 0) {
   231       print();
   232       assert(false, "reference count underflow for symbol");
   233     }
   234 #endif
   235   }
   236 }
   238 void Symbol::print_on(outputStream* st) const {
   239   if (this == NULL) {
   240     st->print_cr("NULL");
   241   } else {
   242     st->print("Symbol: '");
   243     print_symbol_on(st);
   244     st->print("'");
   245     st->print(" count %d", refcount());
   246   }
   247 }
   249 // The print_value functions are present in all builds, to support the
   250 // disassembler and error reporting.
   251 void Symbol::print_value_on(outputStream* st) const {
   252   if (this == NULL) {
   253     st->print("NULL");
   254   } else {
   255     st->print("'");
   256     for (int i = 0; i < utf8_length(); i++) {
   257       st->print("%c", byte_at(i));
   258     }
   259     st->print("'");
   260   }
   261 }
   263 // SymbolTable prints this in its statistics
   264 NOT_PRODUCT(int Symbol::_total_count = 0;)

mercurial