/openjdk9/hotspot/src/share/vm/gc/shared/ |
H A D | ageTable.hpp | 44 enum { table_size = markOopDesc::max_age + 1 }; enumerator in enum:VALUE_OBJ_CLASS_SPEC::__anon432 47 size_t sizes[table_size]; 60 assert(age > 0 && age < table_size, "invalid age of object"); 74 PerfVariable* _perf_sizes[table_size];
|
H A D | ageTable.cpp | 50 for(int age = 0; age < table_size; age ++) { 61 table_size, CHECK); 66 for (size_t* p = sizes; p < sizes + table_size; ++p) { 72 for (int i = 0; i < table_size; i++) { 88 while (age < table_size) { 112 while (age < table_size) {
|
/openjdk9/hotspot/src/share/vm/utilities/ |
H A D | hashtable.inline.hpp | 39 template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size) { argument 41 initialize(table_size, entry_size, 0); 42 _buckets = NEW_C_HEAP_ARRAY2(HashtableBucket<F>, table_size, F, CURRENT_PC); 49 template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size, argument 53 initialize(table_size, entry_size, number_of_entries); 58 template <MEMFLAGS F> inline void BasicHashtable<F>::initialize(int table_size, int entry_size, argument 61 _table_size = table_size;
|
H A D | hashtable.hpp | 154 BasicHashtable(int table_size, int entry_size); 155 BasicHashtable(int table_size, int entry_size, 191 void initialize(int table_size, int entry_size, int number_of_entries); 247 int table_size() { return _table_size; } function in class:BasicHashtable 273 Hashtable(int table_size, int entry_size) argument 274 : BasicHashtable<F>(table_size, entry_size) { } 276 Hashtable(int table_size, int entry_size, argument 278 : BasicHashtable<F>(table_size, entry_size, buckets, number_of_entries) { } 326 RehashableHashtable(int table_size, int entry_size) argument 327 : Hashtable<T, F>(table_size, entry_siz 329 RehashableHashtable(int table_size, int entry_size, HashtableBucket<F>* buckets, int number_of_entries) argument 361 TwoOopHashtable(int table_size, int entry_size) argument 364 TwoOopHashtable(int table_size, int entry_size, HashtableBucket<F>* t, int number_of_entries) argument [all...] |
H A D | hashtable.cpp | 89 assert(this->table_size() != 0, "underflow"); 90 if (count > (((double)this->number_of_entries()/(double)this->table_size())*rehash_multiple)) { 113 for (int i = 0; i < new_table->table_size(); ++i) { 244 for (int i = 0; i < this->table_size(); ++i) { 292 for (int i = 0; i < this->table_size(); ++i) { 347 for (int i = 0; i < BasicHashtable<F>::table_size(); i++) { 361 for (int i = 0; i < table_size(); i++) {
|
/openjdk9/hotspot/src/share/vm/classfile/ |
H A D | dictionary.cpp | 48 Dictionary::Dictionary(int table_size) argument 49 : TwoOopHashtable<Klass*, mtClass>(table_size, (int)entry_size()) { 56 Dictionary::Dictionary(int table_size, HashtableBucket<mtClass>* t, argument 58 : TwoOopHashtable<Klass*, mtClass>(table_size, (int)entry_size(), t, number_of_entries) { 152 for (int index = 0; index < table_size(); index++) { 211 for (int index = 0; index < table_size(); index++) { 228 for (int index = 0; index < table_size(); index++) { 253 for (int index = 0; index < table_size(); index++) { 272 for (int index = 0; index < table_size(); index++) { 288 for (int index = 0; index < table_size(); inde 516 ProtectionDomainCacheTable(int table_size) argument 673 SymbolPropertyTable(int table_size) argument 677 SymbolPropertyTable(int table_size, HashtableBucket<mtSymbol>* t, int number_of_entries) argument [all...] |
H A D | resolutionErrors.cpp | 96 ResolutionErrorTable::ResolutionErrorTable(int table_size) argument 97 : Hashtable<ConstantPool*, mtClass>(table_size, sizeof(ResolutionErrorEntry)) { 104 for (int i = 0; i < table_size(); i++) { 122 for (int i = 0; i < table_size(); i++) {
|
H A D | packageEntry.cpp | 167 PackageEntryTable::PackageEntryTable(int table_size) argument 168 : Hashtable<Symbol*, mtModule>(table_size, sizeof(PackageEntry)) 177 for (int i = 0; i < table_size(); ++i) { 275 for (int i = 0; i < table_size(); i++) { 314 for (int i = 0; i < table_size(); i++) { 330 st->print_cr("Package Entry Table (table_size=%d, entries=%d)", 331 table_size(), number_of_entries()); 332 for (int i = 0; i < table_size(); i++) { 356 for (int index = 0; index < table_size(); index++) { 366 DEBUG_ONLY(verify_lookup_length((double)number_of_entries() / table_size(), "Packag [all...] |
H A D | placeholders.cpp | 174 PlaceholderTable::PlaceholderTable(int table_size) argument 175 : TwoOopHashtable<Symbol*, mtClass>(table_size, sizeof(PlaceholderEntry)) { 180 for (int index = 0; index < table_size(); index++) { 199 for (int index = 0; index < table_size(); index++) { 253 for (int pindex = 0; pindex < table_size(); pindex++) { 268 for (int pindex = 0; pindex < table_size(); pindex++) {
|
H A D | moduleEntry.cpp | 222 ModuleEntryTable::ModuleEntryTable(int table_size) argument 223 : Hashtable<Symbol*, mtModule>(table_size, sizeof(ModuleEntry)), _unnamed_module(NULL) 232 for (int i = 0; i < table_size(); ++i) { 374 for (int i = 0; i < table_size(); i++) { 443 st->print_cr("Module Entry Table (table_size=%d, entries=%d)", 444 table_size(), number_of_entries()); 445 for (int i = 0; i < table_size(); i++) { 468 for (int i = 0; i < table_size(); i++) { 478 DEBUG_ONLY(verify_lookup_length((double)number_of_entries() / table_size(), "Module Entry Table"));
|
H A D | resolutionErrors.hpp | 39 ResolutionErrorTable(int table_size);
|
H A D | stringTable.cpp | 318 buckets_unlink_or_oops_do(is_alive, f, 0, the_table()->table_size(), &context); 328 const int limit = the_table()->table_size(); 348 const int limit = the_table()->table_size(); 371 const int limit = the_table()->table_size(); 403 buckets_oops_do(f, 0, the_table()->table_size()); 407 const int limit = the_table()->table_size(); 425 for (int i = 0; i < the_table()->table_size(); ++i) { 444 for (int i = 0; i < the_table()->table_size(); ++i) { 570 for (int bkt = 0; bkt < the_table()->table_size(); bkt++) { 590 for (int bkt1 = 0; bkt1 < the_table()->table_size(); bkt [all...] |
H A D | dictionary.hpp | 73 Dictionary(int table_size); 74 Dictionary(int table_size, HashtableBucket<mtClass>* t, int number_of_entries); 211 ProtectionDomainCacheTable(int table_size); 422 SymbolPropertyTable(int table_size); 423 SymbolPropertyTable(int table_size, HashtableBucket<mtSymbol>* t, int number_of_entries);
|
H A D | packageEntry.hpp | 231 PackageEntryTable(int table_size);
|
H A D | symbolTable.cpp | 87 const int n = the_table()->table_size(); 135 buckets_unlink(0, the_table()->table_size(), &context); 145 const int limit = the_table()->table_size(); 538 for (int i = 0; i < the_table()->table_size(); ++i) { 556 for (int i = 0; i < the_table()->table_size(); ++i) { 578 for (int i = 0; i < the_table()->table_size(); ++i) { 632 for (i = 0; i < the_table()->table_size(); i++) { 678 for (int i = 0; i < the_table()->table_size(); ++i) {
|
H A D | moduleEntry.hpp | 210 ModuleEntryTable(int table_size);
|
/openjdk9/hotspot/src/share/vm/memory/ |
H A D | padded.inline.hpp | 57 size_t table_size = align_size_up_(rows * sizeof(T*), alignment); local 61 size_t total_size = table_size + rows * row_size + alignment; 69 void* data_start = (void*)((uintptr_t)result + table_size);
|
/openjdk9/hotspot/src/share/vm/services/ |
H A D | mallocSiteTable.cpp | 58 MallocSiteHashtableEntry* MallocSiteTable::_table[MallocSiteTable::table_size]; 79 assert((size_t)table_size <= MAX_MALLOCSITE_TABLE_SIZE, "Hashtable overflow"); 113 for (int index = 0; index < table_size; index ++) { 183 assert(bucket_idx < table_size, "Invalid bucket index"); 201 for (int index = 0; index < table_size; index ++) {
|
H A D | mallocSiteTable.hpp | 121 table_size = (table_base_size * NMT_TrackingStackDepth - 1) enumerator in enum:MallocSiteTable::__anon720 175 static inline int hash_buckets() { return (int)table_size; } 242 return (hash % table_size); 255 static MallocSiteHashtableEntry* _table[table_size];
|
/openjdk9/hotspot/src/share/vm/gc/g1/ |
H A D | g1CodeCacheRemSet.cpp | 40 return sizeof(G1CodeRootSetTable) + (entry_size() * number_of_entries()) + (sizeof(HashtableBucket<mtGC>) * table_size()); 68 for (int index = 0; index < table_size(); ++index) { 117 for (int index = 0; index < table_size(); ++index) { 126 for (int index = 0; index < table_size(); ++index) { 136 for (int index = 0; index < table_size(); ++index) {
|
/openjdk9/hotspot/src/share/vm/opto/ |
H A D | indexSet.hpp | 404 table_size = (1 << window_size) }; enumerator in enum:VALUE_OBJ_CLASS_SPEC::__anon547 407 static const uint8_t _first_bit[table_size]; 410 static const uint8_t _second_bit[table_size];
|
/openjdk9/jdk/src/jdk.jdwp.agent/windows/native/libdt_socket/ |
H A D | socket_md.c | 383 int table_size = sizeof(winsock_errors) / local 392 while (i < table_size) { 399 if (i < table_size) {
|
/openjdk9/jdk/src/jdk.attach/solaris/native/libattach/ |
H A D | VirtualMachineImpl.c | 231 int table_size = sizeof(error_messages) / sizeof(error_messages[0]); local 234 for (i=0; i<table_size; i++) {
|
/openjdk9/hotspot/src/share/vm/oops/ |
H A D | constantPool.hpp | 916 void initialize_table(int table_size) { argument 917 _table_size = table_size; 918 _buckets = NEW_C_HEAP_ARRAY(SymbolHashMapBucket, table_size, mtSymbol); 919 for (int index = 0; index < table_size; index++) { 926 int table_size() const { return _table_size; } function in class:SymbolHashMap 929 SymbolHashMap(int table_size) { initialize_table(table_size); } argument
|
/openjdk9/hotspot/src/share/vm/runtime/ |
H A D | fprofiler.hpp | 140 static int table_size; member in class:ThreadProfiler
|