2007-12-01 00:00:00 +00:00
|
|
|
/*
|
2011-04-05 14:12:31 -07:00
|
|
|
* Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
|
2007-12-01 00:00:00 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
|
*
|
|
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
|
* accompanied this code).
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License version
|
|
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*
|
2010-05-27 19:08:38 -07:00
|
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
|
|
* questions.
|
2007-12-01 00:00:00 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
|
2010-11-23 13:22:55 -08:00
|
|
|
#include "precompiled.hpp"
|
|
|
|
#include "oops/oop.inline.hpp"
|
2011-01-27 16:11:27 -08:00
|
|
|
#include "oops/symbol.hpp"
|
|
|
|
#include "runtime/os.hpp"
|
|
|
|
#include "memory/allocation.inline.hpp"
|
|
|
|
|
|
|
|
Symbol::Symbol(const u1* name, int length) : _refcount(0), _length(length) {
|
|
|
|
_identity_hash = os::random();
|
|
|
|
for (int i = 0; i < _length; i++) {
|
|
|
|
byte_at_put(i, name[i]);
|
|
|
|
}
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
void* Symbol::operator new(size_t size, int len) {
|
|
|
|
return (void *) AllocateHeap(object_size(len) * HeapWordSize, "symbol");
|
|
|
|
}
|
2010-01-05 15:21:25 +01:00
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
2011-01-27 16:11:27 -08:00
|
|
|
// Symbol::equals
|
2010-01-05 15:21:25 +01:00
|
|
|
//
|
|
|
|
// Compares the symbol with a string of the given length.
|
2011-01-27 16:11:27 -08:00
|
|
|
bool Symbol::equals(const char* str, int len) const {
|
2007-12-01 00:00:00 +00:00
|
|
|
int l = utf8_length();
|
|
|
|
if (l != len) return false;
|
|
|
|
while (l-- > 0) {
|
|
|
|
if (str[l] != (char) byte_at(l))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
assert(l == -1, "we should be at the beginning");
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-01-05 15:21:25 +01:00
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
2011-01-27 16:11:27 -08:00
|
|
|
// Symbol::starts_with
|
2010-01-05 15:21:25 +01:00
|
|
|
//
|
|
|
|
// Tests if the symbol starts with the specified prefix of the given
|
|
|
|
// length.
|
2011-01-27 16:11:27 -08:00
|
|
|
bool Symbol::starts_with(const char* prefix, int len) const {
|
2010-01-05 15:21:25 +01:00
|
|
|
if (len > utf8_length()) return false;
|
|
|
|
while (len-- > 0) {
|
|
|
|
if (prefix[len] != (char) byte_at(len))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
assert(len == -1, "we should be at the beginning");
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
2011-01-27 16:11:27 -08:00
|
|
|
// Symbol::index_of
|
2010-01-05 15:21:25 +01:00
|
|
|
//
|
|
|
|
// Finds if the given string is a substring of this symbol's utf8 bytes.
|
|
|
|
// Return -1 on failure. Otherwise return the first index where str occurs.
|
2011-01-27 16:11:27 -08:00
|
|
|
int Symbol::index_of_at(int i, const char* str, int len) const {
|
2010-01-05 15:21:25 +01:00
|
|
|
assert(i >= 0 && i <= utf8_length(), "oob");
|
|
|
|
if (len <= 0) return 0;
|
|
|
|
char first_char = str[0];
|
2011-01-27 16:11:27 -08:00
|
|
|
address bytes = (address) ((Symbol*)this)->base();
|
2010-01-05 15:21:25 +01:00
|
|
|
address limit = bytes + utf8_length() - len; // inclusive limit
|
|
|
|
address scan = bytes + i;
|
|
|
|
if (scan > limit)
|
|
|
|
return -1;
|
|
|
|
for (;;) {
|
|
|
|
scan = (address) memchr(scan, first_char, (limit + 1 - scan));
|
|
|
|
if (scan == NULL)
|
|
|
|
return -1; // not found
|
|
|
|
assert(scan >= bytes+i && scan <= limit, "scan oob");
|
|
|
|
if (memcmp(scan, str, len) == 0)
|
|
|
|
return (int)(scan - bytes);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
char* Symbol::as_C_string(char* buf, int size) const {
|
2007-12-01 00:00:00 +00:00
|
|
|
if (size > 0) {
|
|
|
|
int len = MIN2(size - 1, utf8_length());
|
|
|
|
for (int i = 0; i < len; i++) {
|
|
|
|
buf[i] = byte_at(i);
|
|
|
|
}
|
|
|
|
buf[len] = '\0';
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
char* Symbol::as_C_string() const {
|
2007-12-01 00:00:00 +00:00
|
|
|
int len = utf8_length();
|
|
|
|
char* str = NEW_RESOURCE_ARRAY(char, len + 1);
|
|
|
|
return as_C_string(str, len + 1);
|
|
|
|
}
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
char* Symbol::as_C_string_flexible_buffer(Thread* t,
|
2007-12-01 00:00:00 +00:00
|
|
|
char* buf, int size) const {
|
|
|
|
char* str;
|
|
|
|
int len = utf8_length();
|
|
|
|
int buf_len = len + 1;
|
|
|
|
if (size < buf_len) {
|
|
|
|
str = NEW_RESOURCE_ARRAY(char, buf_len);
|
|
|
|
} else {
|
|
|
|
str = buf;
|
|
|
|
}
|
|
|
|
return as_C_string(str, buf_len);
|
|
|
|
}
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
void Symbol::print_symbol_on(outputStream* st) const {
|
2007-12-01 00:00:00 +00:00
|
|
|
st = st ? st : tty;
|
2008-06-24 16:00:14 -07:00
|
|
|
int length = UTF8::unicode_length((const char*)bytes(), utf8_length());
|
|
|
|
const char *ptr = (const char *)bytes();
|
|
|
|
jchar value;
|
|
|
|
for (int index = 0; index < length; index++) {
|
|
|
|
ptr = UTF8::next(ptr, &value);
|
|
|
|
if (value >= 32 && value < 127 || value == '\'' || value == '\\') {
|
|
|
|
st->put(value);
|
|
|
|
} else {
|
|
|
|
st->print("\\u%04x", value);
|
|
|
|
}
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
jchar* Symbol::as_unicode(int& length) const {
|
|
|
|
Symbol* this_ptr = (Symbol*)this;
|
2007-12-01 00:00:00 +00:00
|
|
|
length = UTF8::unicode_length((char*)this_ptr->bytes(), utf8_length());
|
|
|
|
jchar* result = NEW_RESOURCE_ARRAY(jchar, length);
|
|
|
|
if (length > 0) {
|
|
|
|
UTF8::convert_to_unicode((char*)this_ptr->bytes(), result, length);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
const char* Symbol::as_klass_external_name(char* buf, int size) const {
|
2007-12-01 00:00:00 +00:00
|
|
|
if (size > 0) {
|
|
|
|
char* str = as_C_string(buf, size);
|
|
|
|
int length = (int)strlen(str);
|
|
|
|
// Turn all '/'s into '.'s (also for array klasses)
|
|
|
|
for (int index = 0; index < length; index++) {
|
|
|
|
if (str[index] == '/') {
|
|
|
|
str[index] = '.';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return str;
|
|
|
|
} else {
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-01-27 16:11:27 -08:00
|
|
|
const char* Symbol::as_klass_external_name() const {
|
2007-12-01 00:00:00 +00:00
|
|
|
char* str = as_C_string();
|
|
|
|
int length = (int)strlen(str);
|
|
|
|
// Turn all '/'s into '.'s (also for array klasses)
|
|
|
|
for (int index = 0; index < length; index++) {
|
|
|
|
if (str[index] == '/') {
|
|
|
|
str[index] = '.';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return str;
|
|
|
|
}
|
2011-01-27 16:11:27 -08:00
|
|
|
|
|
|
|
|
|
|
|
void Symbol::print_on(outputStream* st) const {
|
|
|
|
if (this == NULL) {
|
|
|
|
st->print_cr("NULL");
|
|
|
|
} else {
|
|
|
|
st->print("Symbol: '");
|
|
|
|
print_symbol_on(st);
|
|
|
|
st->print("'");
|
|
|
|
st->print(" count %d", refcount());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// The print_value functions are present in all builds, to support the
|
|
|
|
// disassembler and error reporting.
|
|
|
|
void Symbol::print_value_on(outputStream* st) const {
|
|
|
|
if (this == NULL) {
|
|
|
|
st->print("NULL");
|
|
|
|
} else {
|
|
|
|
st->print("'");
|
|
|
|
for (int i = 0; i < utf8_length(); i++) {
|
|
|
|
st->print("%c", byte_at(i));
|
|
|
|
}
|
|
|
|
st->print("'");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Symbol::increment_refcount() {
|
|
|
|
// Only increment the refcount if positive. If negative either
|
|
|
|
// overflow has occurred or it is a permanent symbol in a read only
|
|
|
|
// shared archive.
|
|
|
|
if (_refcount >= 0) {
|
|
|
|
Atomic::inc(&_refcount);
|
|
|
|
NOT_PRODUCT(Atomic::inc(&_total_count);)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Symbol::decrement_refcount() {
|
|
|
|
if (_refcount >= 0) {
|
|
|
|
Atomic::dec(&_refcount);
|
|
|
|
#ifdef ASSERT
|
|
|
|
if (_refcount < 0) {
|
|
|
|
print();
|
|
|
|
assert(false, "reference count underflow for symbol");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
NOT_PRODUCT(int Symbol::_total_count = 0;)
|