Sat, 18 May 2013 20:41:01 -0700
8014262: PrintStringTableStatistics should include more footprint info
Summary: Added info for the string/symbol objects and the hash entries
Reviewed-by: coleenp, rbackman
duke@435 | 1 | /* |
coleenp@3865 | 2 | * Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
coleenp@3904 | 26 | #include "classfile/altHashing.hpp" |
coleenp@3904 | 27 | #include "classfile/javaClasses.hpp" |
stefank@2314 | 28 | #include "memory/allocation.inline.hpp" |
coleenp@3875 | 29 | #include "memory/filemap.hpp" |
stefank@2314 | 30 | #include "memory/resourceArea.hpp" |
stefank@2314 | 31 | #include "oops/oop.inline.hpp" |
stefank@2314 | 32 | #include "runtime/safepoint.hpp" |
stefank@2314 | 33 | #include "utilities/dtrace.hpp" |
stefank@2314 | 34 | #include "utilities/hashtable.hpp" |
stefank@2314 | 35 | #include "utilities/hashtable.inline.hpp" |
iklam@5144 | 36 | #include "utilities/numberSeq.hpp" |
duke@435 | 37 | |
coleenp@2497 | 38 | |
duke@435 | 39 | // This is a generic hashtable, designed to be used for the symbol |
duke@435 | 40 | // and string tables. |
duke@435 | 41 | // |
duke@435 | 42 | // It is implemented as an open hash table with a fixed number of buckets. |
duke@435 | 43 | // |
duke@435 | 44 | // %note: |
duke@435 | 45 | // - HashtableEntrys are allocated in blocks to reduce the space overhead. |
duke@435 | 46 | |
zgu@3900 | 47 | template <MEMFLAGS F> BasicHashtableEntry<F>* BasicHashtable<F>::new_entry(unsigned int hashValue) { |
zgu@3900 | 48 | BasicHashtableEntry<F>* entry; |
duke@435 | 49 | |
duke@435 | 50 | if (_free_list) { |
duke@435 | 51 | entry = _free_list; |
duke@435 | 52 | _free_list = _free_list->next(); |
duke@435 | 53 | } else { |
jrose@867 | 54 | if (_first_free_entry + _entry_size >= _end_block) { |
jrose@867 | 55 | int block_size = MIN2(512, MAX2((int)_table_size / 2, (int)_number_of_entries)); |
duke@435 | 56 | int len = _entry_size * block_size; |
jrose@867 | 57 | len = 1 << log2_intptr(len); // round down to power of 2 |
jrose@867 | 58 | assert(len >= _entry_size, ""); |
zgu@3900 | 59 | _first_free_entry = NEW_C_HEAP_ARRAY2(char, len, F, CURRENT_PC); |
duke@435 | 60 | _end_block = _first_free_entry + len; |
duke@435 | 61 | } |
zgu@3900 | 62 | entry = (BasicHashtableEntry<F>*)_first_free_entry; |
duke@435 | 63 | _first_free_entry += _entry_size; |
duke@435 | 64 | } |
duke@435 | 65 | |
jrose@867 | 66 | assert(_entry_size % HeapWordSize == 0, ""); |
duke@435 | 67 | entry->set_hash(hashValue); |
duke@435 | 68 | return entry; |
duke@435 | 69 | } |
duke@435 | 70 | |
duke@435 | 71 | |
zgu@3900 | 72 | template <class T, MEMFLAGS F> HashtableEntry<T, F>* Hashtable<T, F>::new_entry(unsigned int hashValue, T obj) { |
zgu@3900 | 73 | HashtableEntry<T, F>* entry; |
duke@435 | 74 | |
zgu@3900 | 75 | entry = (HashtableEntry<T, F>*)BasicHashtable<F>::new_entry(hashValue); |
coleenp@2497 | 76 | entry->set_literal(obj); |
duke@435 | 77 | return entry; |
duke@435 | 78 | } |
duke@435 | 79 | |
coleenp@3865 | 80 | // Check to see if the hashtable is unbalanced. The caller set a flag to |
coleenp@3865 | 81 | // rehash at the next safepoint. If this bucket is 60 times greater than the |
coleenp@3865 | 82 | // expected average bucket length, it's an unbalanced hashtable. |
coleenp@3865 | 83 | // This is somewhat an arbitrary heuristic but if one bucket gets to |
coleenp@3865 | 84 | // rehash_count which is currently 100, there's probably something wrong. |
coleenp@3865 | 85 | |
zgu@3900 | 86 | template <MEMFLAGS F> bool BasicHashtable<F>::check_rehash_table(int count) { |
coleenp@3865 | 87 | assert(table_size() != 0, "underflow"); |
coleenp@3865 | 88 | if (count > (((double)number_of_entries()/(double)table_size())*rehash_multiple)) { |
coleenp@3865 | 89 | // Set a flag for the next safepoint, which should be at some guaranteed |
coleenp@3865 | 90 | // safepoint interval. |
coleenp@3865 | 91 | return true; |
coleenp@3865 | 92 | } |
coleenp@3865 | 93 | return false; |
coleenp@3865 | 94 | } |
coleenp@3865 | 95 | |
coleenp@3904 | 96 | template <class T, MEMFLAGS F> jint Hashtable<T, F>::_seed = 0; |
coleenp@3904 | 97 | |
coleenp@3865 | 98 | // Create a new table and using alternate hash code, populate the new table |
coleenp@3865 | 99 | // with the existing elements. This can be used to change the hash code |
coleenp@3865 | 100 | // and could in the future change the size of the table. |
coleenp@3865 | 101 | |
zgu@3900 | 102 | template <class T, MEMFLAGS F> void Hashtable<T, F>::move_to(Hashtable<T, F>* new_table) { |
coleenp@3904 | 103 | |
coleenp@3904 | 104 | // Initialize the global seed for hashing. |
coleenp@3904 | 105 | _seed = AltHashing::compute_seed(); |
coleenp@3904 | 106 | assert(seed() != 0, "shouldn't be zero"); |
coleenp@3904 | 107 | |
coleenp@3904 | 108 | int saved_entry_count = this->number_of_entries(); |
coleenp@3865 | 109 | |
coleenp@3865 | 110 | // Iterate through the table and create a new entry for the new table |
coleenp@3865 | 111 | for (int i = 0; i < new_table->table_size(); ++i) { |
zgu@3900 | 112 | for (HashtableEntry<T, F>* p = bucket(i); p != NULL; ) { |
zgu@3900 | 113 | HashtableEntry<T, F>* next = p->next(); |
coleenp@3865 | 114 | T string = p->literal(); |
coleenp@3865 | 115 | // Use alternate hashing algorithm on the symbol in the first table |
coleenp@4037 | 116 | unsigned int hashValue = string->new_hash(seed()); |
coleenp@3865 | 117 | // Get a new index relative to the new table (can also change size) |
coleenp@3865 | 118 | int index = new_table->hash_to_index(hashValue); |
coleenp@3865 | 119 | p->set_hash(hashValue); |
coleenp@3875 | 120 | // Keep the shared bit in the Hashtable entry to indicate that this entry |
coleenp@3875 | 121 | // can't be deleted. The shared bit is the LSB in the _next field so |
coleenp@3875 | 122 | // walking the hashtable past these entries requires |
coleenp@3875 | 123 | // BasicHashtableEntry::make_ptr() call. |
coleenp@3875 | 124 | bool keep_shared = p->is_shared(); |
andrew@3963 | 125 | this->unlink_entry(p); |
coleenp@3865 | 126 | new_table->add_entry(index, p); |
coleenp@3875 | 127 | if (keep_shared) { |
coleenp@3875 | 128 | p->set_shared(); |
coleenp@3875 | 129 | } |
coleenp@3865 | 130 | p = next; |
coleenp@3865 | 131 | } |
coleenp@3865 | 132 | } |
coleenp@3865 | 133 | // give the new table the free list as well |
coleenp@3865 | 134 | new_table->copy_freelist(this); |
coleenp@3865 | 135 | assert(new_table->number_of_entries() == saved_entry_count, "lost entry on dictionary copy?"); |
coleenp@3865 | 136 | |
coleenp@3865 | 137 | // Destroy memory used by the buckets in the hashtable. The memory |
coleenp@3865 | 138 | // for the elements has been used in a new table and is not |
coleenp@3865 | 139 | // destroyed. The memory reuse will benefit resizing the SystemDictionary |
coleenp@3865 | 140 | // to avoid a memory allocation spike at safepoint. |
zgu@3900 | 141 | BasicHashtable<F>::free_buckets(); |
coleenp@3865 | 142 | } |
coleenp@3865 | 143 | |
zgu@3900 | 144 | template <MEMFLAGS F> void BasicHashtable<F>::free_buckets() { |
coleenp@3875 | 145 | if (NULL != _buckets) { |
coleenp@3875 | 146 | // Don't delete the buckets in the shared space. They aren't |
coleenp@3875 | 147 | // allocated by os::malloc |
coleenp@3875 | 148 | if (!UseSharedSpaces || |
coleenp@3875 | 149 | !FileMapInfo::current_info()->is_in_shared_space(_buckets)) { |
zgu@3900 | 150 | FREE_C_HEAP_ARRAY(HashtableBucket, _buckets, F); |
coleenp@3875 | 151 | } |
coleenp@3875 | 152 | _buckets = NULL; |
coleenp@3875 | 153 | } |
coleenp@3875 | 154 | } |
coleenp@3875 | 155 | |
coleenp@3875 | 156 | |
duke@435 | 157 | // Reverse the order of elements in the hash buckets. |
duke@435 | 158 | |
zgu@3900 | 159 | template <MEMFLAGS F> void BasicHashtable<F>::reverse() { |
duke@435 | 160 | |
duke@435 | 161 | for (int i = 0; i < _table_size; ++i) { |
zgu@3900 | 162 | BasicHashtableEntry<F>* new_list = NULL; |
zgu@3900 | 163 | BasicHashtableEntry<F>* p = bucket(i); |
duke@435 | 164 | while (p != NULL) { |
zgu@3900 | 165 | BasicHashtableEntry<F>* next = p->next(); |
duke@435 | 166 | p->set_next(new_list); |
duke@435 | 167 | new_list = p; |
duke@435 | 168 | p = next; |
duke@435 | 169 | } |
duke@435 | 170 | *bucket_addr(i) = new_list; |
duke@435 | 171 | } |
duke@435 | 172 | } |
duke@435 | 173 | |
duke@435 | 174 | |
duke@435 | 175 | // Copy the table to the shared space. |
duke@435 | 176 | |
zgu@3900 | 177 | template <MEMFLAGS F> void BasicHashtable<F>::copy_table(char** top, char* end) { |
duke@435 | 178 | |
duke@435 | 179 | // Dump the hash table entries. |
duke@435 | 180 | |
duke@435 | 181 | intptr_t *plen = (intptr_t*)(*top); |
duke@435 | 182 | *top += sizeof(*plen); |
duke@435 | 183 | |
duke@435 | 184 | int i; |
duke@435 | 185 | for (i = 0; i < _table_size; ++i) { |
zgu@3900 | 186 | for (BasicHashtableEntry<F>** p = _buckets[i].entry_addr(); |
duke@435 | 187 | *p != NULL; |
duke@435 | 188 | p = (*p)->next_addr()) { |
duke@435 | 189 | if (*top + entry_size() > end) { |
coleenp@2497 | 190 | report_out_of_shared_space(SharedMiscData); |
duke@435 | 191 | } |
zgu@3900 | 192 | *p = (BasicHashtableEntry<F>*)memcpy(*top, *p, entry_size()); |
duke@435 | 193 | *top += entry_size(); |
duke@435 | 194 | } |
duke@435 | 195 | } |
duke@435 | 196 | *plen = (char*)(*top) - (char*)plen - sizeof(*plen); |
duke@435 | 197 | |
duke@435 | 198 | // Set the shared bit. |
duke@435 | 199 | |
duke@435 | 200 | for (i = 0; i < _table_size; ++i) { |
zgu@3900 | 201 | for (BasicHashtableEntry<F>* p = bucket(i); p != NULL; p = p->next()) { |
duke@435 | 202 | p->set_shared(); |
duke@435 | 203 | } |
duke@435 | 204 | } |
duke@435 | 205 | } |
duke@435 | 206 | |
duke@435 | 207 | |
duke@435 | 208 | |
duke@435 | 209 | // Reverse the order of elements in the hash buckets. |
duke@435 | 210 | |
zgu@3900 | 211 | template <class T, MEMFLAGS F> void Hashtable<T, F>::reverse(void* boundary) { |
duke@435 | 212 | |
zgu@3900 | 213 | for (int i = 0; i < this->table_size(); ++i) { |
zgu@3900 | 214 | HashtableEntry<T, F>* high_list = NULL; |
zgu@3900 | 215 | HashtableEntry<T, F>* low_list = NULL; |
zgu@3900 | 216 | HashtableEntry<T, F>* last_low_entry = NULL; |
zgu@3900 | 217 | HashtableEntry<T, F>* p = bucket(i); |
duke@435 | 218 | while (p != NULL) { |
zgu@3900 | 219 | HashtableEntry<T, F>* next = p->next(); |
duke@435 | 220 | if ((void*)p->literal() >= boundary) { |
duke@435 | 221 | p->set_next(high_list); |
duke@435 | 222 | high_list = p; |
duke@435 | 223 | } else { |
duke@435 | 224 | p->set_next(low_list); |
duke@435 | 225 | low_list = p; |
duke@435 | 226 | if (last_low_entry == NULL) { |
duke@435 | 227 | last_low_entry = p; |
duke@435 | 228 | } |
duke@435 | 229 | } |
duke@435 | 230 | p = next; |
duke@435 | 231 | } |
duke@435 | 232 | if (low_list != NULL) { |
duke@435 | 233 | *bucket_addr(i) = low_list; |
duke@435 | 234 | last_low_entry->set_next(high_list); |
duke@435 | 235 | } else { |
duke@435 | 236 | *bucket_addr(i) = high_list; |
duke@435 | 237 | } |
duke@435 | 238 | } |
duke@435 | 239 | } |
duke@435 | 240 | |
iklam@5144 | 241 | template <class T, MEMFLAGS F> int Hashtable<T, F>::literal_size(Symbol *symbol) { |
iklam@5144 | 242 | return symbol->size() * HeapWordSize; |
iklam@5144 | 243 | } |
iklam@5144 | 244 | |
iklam@5144 | 245 | template <class T, MEMFLAGS F> int Hashtable<T, F>::literal_size(oop oop) { |
iklam@5144 | 246 | // NOTE: this would over-count if (pre-JDK8) java_lang_Class::has_offset_field() is true, |
iklam@5144 | 247 | // and the String.value array is shared by several Strings. However, starting from JDK8, |
iklam@5144 | 248 | // the String.value array is not shared anymore. |
iklam@5144 | 249 | assert(oop != NULL && oop->klass() == SystemDictionary::String_klass(), "only strings are supported"); |
iklam@5144 | 250 | return (oop->size() + java_lang_String::value(oop)->size()) * HeapWordSize; |
iklam@5144 | 251 | } |
iklam@5144 | 252 | |
iklam@5144 | 253 | // Dump footprint and bucket length statistics |
iklam@5144 | 254 | // |
iklam@5144 | 255 | // Note: if you create a new subclass of Hashtable<MyNewType, F>, you will need to |
iklam@5144 | 256 | // add a new function Hashtable<T, F>::literal_size(MyNewType lit) |
iklam@5144 | 257 | |
iklam@5144 | 258 | template <class T, MEMFLAGS F> void Hashtable<T, F>::dump_table(outputStream* st, const char *table_name) { |
iklam@5144 | 259 | NumberSeq summary; |
iklam@5144 | 260 | int literal_bytes = 0; |
iklam@5144 | 261 | for (int i = 0; i < this->table_size(); ++i) { |
iklam@5144 | 262 | int count = 0; |
iklam@5144 | 263 | for (HashtableEntry<T, F>* e = bucket(i); |
iklam@5144 | 264 | e != NULL; e = e->next()) { |
iklam@5144 | 265 | count++; |
iklam@5144 | 266 | literal_bytes += literal_size(e->literal()); |
iklam@5144 | 267 | } |
iklam@5144 | 268 | summary.add((double)count); |
iklam@5144 | 269 | } |
iklam@5144 | 270 | double num_buckets = summary.num(); |
iklam@5144 | 271 | double num_entries = summary.sum(); |
iklam@5144 | 272 | |
iklam@5144 | 273 | int bucket_bytes = (int)num_buckets * sizeof(bucket(0)); |
iklam@5144 | 274 | int entry_bytes = (int)num_entries * sizeof(HashtableEntry<T, F>); |
iklam@5144 | 275 | int total_bytes = literal_bytes + bucket_bytes + entry_bytes; |
iklam@5144 | 276 | |
iklam@5144 | 277 | double bucket_avg = (num_buckets <= 0) ? 0 : (bucket_bytes / num_buckets); |
iklam@5144 | 278 | double entry_avg = (num_entries <= 0) ? 0 : (entry_bytes / num_entries); |
iklam@5144 | 279 | double literal_avg = (num_entries <= 0) ? 0 : (literal_bytes / num_entries); |
iklam@5144 | 280 | |
iklam@5144 | 281 | st->print_cr("%s statistics:", table_name); |
iklam@5144 | 282 | st->print_cr("Number of buckets : %9d = %9d bytes, avg %7.3f", (int)num_buckets, bucket_bytes, bucket_avg); |
iklam@5144 | 283 | st->print_cr("Number of entries : %9d = %9d bytes, avg %7.3f", (int)num_entries, entry_bytes, entry_avg); |
iklam@5144 | 284 | st->print_cr("Number of literals : %9d = %9d bytes, avg %7.3f", (int)num_entries, literal_bytes, literal_avg); |
iklam@5144 | 285 | st->print_cr("Total footprint : %9s = %9d bytes", "", total_bytes); |
iklam@5144 | 286 | st->print_cr("Average bucket size : %9.3f", summary.avg()); |
iklam@5144 | 287 | st->print_cr("Variance of bucket size : %9.3f", summary.variance()); |
iklam@5144 | 288 | st->print_cr("Std. dev. of bucket size: %9.3f", summary.sd()); |
iklam@5144 | 289 | st->print_cr("Maximum bucket size : %9d", (int)summary.maximum()); |
iklam@5144 | 290 | } |
iklam@5144 | 291 | |
duke@435 | 292 | |
duke@435 | 293 | // Dump the hash table buckets. |
duke@435 | 294 | |
zgu@3900 | 295 | template <MEMFLAGS F> void BasicHashtable<F>::copy_buckets(char** top, char* end) { |
zgu@3900 | 296 | intptr_t len = _table_size * sizeof(HashtableBucket<F>); |
duke@435 | 297 | *(intptr_t*)(*top) = len; |
duke@435 | 298 | *top += sizeof(intptr_t); |
duke@435 | 299 | |
duke@435 | 300 | *(intptr_t*)(*top) = _number_of_entries; |
duke@435 | 301 | *top += sizeof(intptr_t); |
duke@435 | 302 | |
duke@435 | 303 | if (*top + len > end) { |
coleenp@2497 | 304 | report_out_of_shared_space(SharedMiscData); |
duke@435 | 305 | } |
zgu@3900 | 306 | _buckets = (HashtableBucket<F>*)memcpy(*top, _buckets, len); |
duke@435 | 307 | *top += len; |
duke@435 | 308 | } |
duke@435 | 309 | |
duke@435 | 310 | |
duke@435 | 311 | #ifndef PRODUCT |
duke@435 | 312 | |
zgu@3900 | 313 | template <class T, MEMFLAGS F> void Hashtable<T, F>::print() { |
duke@435 | 314 | ResourceMark rm; |
duke@435 | 315 | |
zgu@3900 | 316 | for (int i = 0; i < BasicHashtable<F>::table_size(); i++) { |
zgu@3900 | 317 | HashtableEntry<T, F>* entry = bucket(i); |
duke@435 | 318 | while(entry != NULL) { |
duke@435 | 319 | tty->print("%d : ", i); |
duke@435 | 320 | entry->literal()->print(); |
duke@435 | 321 | tty->cr(); |
duke@435 | 322 | entry = entry->next(); |
duke@435 | 323 | } |
duke@435 | 324 | } |
duke@435 | 325 | } |
duke@435 | 326 | |
duke@435 | 327 | |
zgu@3900 | 328 | template <MEMFLAGS F> void BasicHashtable<F>::verify() { |
duke@435 | 329 | int count = 0; |
duke@435 | 330 | for (int i = 0; i < table_size(); i++) { |
zgu@3900 | 331 | for (BasicHashtableEntry<F>* p = bucket(i); p != NULL; p = p->next()) { |
duke@435 | 332 | ++count; |
duke@435 | 333 | } |
duke@435 | 334 | } |
duke@435 | 335 | assert(count == number_of_entries(), "number of hashtable entries incorrect"); |
duke@435 | 336 | } |
duke@435 | 337 | |
duke@435 | 338 | |
duke@435 | 339 | #endif // PRODUCT |
duke@435 | 340 | |
duke@435 | 341 | |
duke@435 | 342 | #ifdef ASSERT |
duke@435 | 343 | |
zgu@3900 | 344 | template <MEMFLAGS F> void BasicHashtable<F>::verify_lookup_length(double load) { |
duke@435 | 345 | if ((double)_lookup_length / (double)_lookup_count > load * 2.0) { |
duke@435 | 346 | warning("Performance bug: SystemDictionary lookup_count=%d " |
duke@435 | 347 | "lookup_length=%d average=%lf load=%f", |
duke@435 | 348 | _lookup_count, _lookup_length, |
duke@435 | 349 | (double) _lookup_length / _lookup_count, load); |
duke@435 | 350 | } |
duke@435 | 351 | } |
duke@435 | 352 | |
duke@435 | 353 | #endif |
coleenp@2497 | 354 | // Explicitly instantiate these types |
coleenp@4037 | 355 | template class Hashtable<ConstantPool*, mtClass>; |
zgu@3900 | 356 | template class Hashtable<Symbol*, mtSymbol>; |
coleenp@4037 | 357 | template class Hashtable<Klass*, mtClass>; |
zgu@3900 | 358 | template class Hashtable<oop, mtClass>; |
zgu@3900 | 359 | #ifdef SOLARIS |
zgu@3900 | 360 | template class Hashtable<oop, mtSymbol>; |
zgu@3900 | 361 | #endif |
zgu@3900 | 362 | template class Hashtable<oopDesc*, mtSymbol>; |
zgu@3900 | 363 | template class Hashtable<Symbol*, mtClass>; |
zgu@3900 | 364 | template class HashtableEntry<Symbol*, mtSymbol>; |
zgu@3900 | 365 | template class HashtableEntry<Symbol*, mtClass>; |
zgu@3900 | 366 | template class HashtableEntry<oop, mtSymbol>; |
zgu@3900 | 367 | template class BasicHashtableEntry<mtSymbol>; |
zgu@3900 | 368 | template class BasicHashtableEntry<mtCode>; |
zgu@3900 | 369 | template class BasicHashtable<mtClass>; |
zgu@3900 | 370 | template class BasicHashtable<mtSymbol>; |
zgu@3900 | 371 | template class BasicHashtable<mtCode>; |
zgu@3900 | 372 | template class BasicHashtable<mtInternal>; |