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