/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/util/ |
H A D | SymbolTable.java | 60 /** Maximum hash collisions per bucket for a table with load factor == 1. */ 88 * the number of keys in the bucket exceeds this threshold. 169 int bucket = hash(symbol) % fTableSize; 170 for (Entry entry = fBuckets[bucket]; entry != null; entry = entry.next) { 176 return addSymbol0(symbol, bucket, collisionCount); 180 private String addSymbol0(String symbol, int bucket, int collisionCount) { argument 185 bucket = hash(symbol) % fTableSize; 191 bucket = hash(symbol) % fTableSize; 195 Entry entry = new Entry(symbol, fBuckets[bucket]); 196 fBuckets[bucket] 233 addSymbol0(char[] buffer, int offset, int length, int bucket, int collisionCount) argument [all...] |
H A D | XMLAttributesImpl.java | 56 /** Maximum hash collisions per bucket. */ 229 int bucket = getTableViewBucket(name.rawname); 233 if (fAttributeTableViewChainState[bucket] != fLargeCount) { 245 fAttributeTableViewChainState[bucket] = fLargeCount; 247 fAttributeTableView[bucket] = fAttributes[index]; 254 Attribute found = fAttributeTableView[bucket]; 284 fAttributes[index].next = fAttributeTableView[bucket]; 285 fAttributeTableView[bucket] = fAttributes[index]; 821 int bucket; 831 bucket [all...] |
H A D | SymbolHash.java | 42 /** Maximum hash collisions per bucket. */ 103 int bucket = hash % fTableSize; 104 for (Entry entry = fBuckets[bucket]; entry != null; entry = entry.next) { 117 bucket = hash % fTableSize; 123 bucket = hash(key) % fTableSize; 127 Entry entry = new Entry(key, value, fBuckets[bucket]); 128 fBuckets[bucket] = entry; 139 int bucket = hash(key) % fTableSize; 140 Entry entry = search(key, bucket); 215 protected Entry search(Object key, int bucket) { argument [all...] |
/openjdk10/hotspot/src/share/vm/adlc/ |
H A D | dict2.cpp | 39 //------------------------------bucket--------------------------------------- 40 class bucket { class 42 int _cnt, _max; // Size of bucket 48 // of two, for nice modulo operations. Each bucket in the hash table points 77 _bin = (bucket*)_arena->Amalloc_4(sizeof(bucket) * _size); 78 memset(_bin, 0, sizeof(bucket) * _size); 105 _bin = (bucket*)_arena->Arealloc( _bin, sizeof(bucket)*oldsize, sizeof(bucket)*_siz [all...] |
/openjdk10/hotspot/src/share/vm/libadt/ |
H A D | dict.cpp | 41 //------------------------------bucket--------------------------------------- 42 class bucket : public ResourceObj { class in inherits:ResourceObj 44 uint _cnt, _max; // Size of bucket 50 // of two, for nice modulo operations. Each bucket in the hash table points 72 _bin = (bucket*)_arena->Amalloc_4(sizeof(bucket)*_size); 73 memset((void*)_bin,0,sizeof(bucket)*_size); 93 _bin = (bucket*)_arena->Amalloc_4(sizeof(bucket)*_size); 94 memset((void*)_bin,0,sizeof(bucket)*_siz [all...] |
/openjdk10/jdk/src/jdk.jlink/share/classes/jdk/tools/jlink/internal/ |
H A D | PerfectHashBuilder.java | 61 * - Combine keys that map to the same hash code (collisions) into bucket 64 * - Sort bucket chains by length of chains, longest first (most collisions.) 174 assert !list.isEmpty() : "bucket should never be empty"; 239 // Place all the entries in bucket chains based on hash. Sort by 245 for (Bucket<E> bucket : sorted) { 246 if (bucket.getSize() != 1) { 248 if (!collidedEntries(bucket, count)) { 254 // A no collision entry (bucket.getSize() == 1). Find a free 265 order[free] = bucket.getFirst(); 267 redirect[(bucket 308 collidedEntries(Bucket<E> bucket, int count) argument [all...] |
/openjdk10/hotspot/src/share/vm/utilities/ |
H A D | resourceHash.hpp | 97 Node* const* bucket = _table; local 98 while (bucket < &_table[SIZE]) { 99 Node* node = *bucket; 105 ++bucket; 161 Node* const* bucket = _table; local 162 while (bucket < &_table[SIZE]) { 163 Node* node = *bucket; 169 ++bucket;
|
H A D | hashtable.inline.hpp | 71 template <MEMFLAGS F> inline BasicHashtableEntry<F>* BasicHashtable<F>::bucket(int i) const { function in class:BasicHashtable 100 entry->set_next(bucket(index));
|
/openjdk10/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/utilities/ |
H A D | BasicHashtable.java | 60 protected BasicHashtableEntry bucket(int i) { method in class:BasicHashtable 62 Assert.that(i >= 0 && i < tableSize(), "Invalid bucket id"); 66 HashtableBucket bucket = (HashtableBucket) VMObjectFactory.newObject( 68 return bucket.getEntry(getHashtableEntryClass());
|
H A D | CompactHashTable.java | 90 Address bucket = bucketsField.getValue(addr); 92 int bucketInfo = (int)bucket.getCIntegerAt(index * uintSize, uintSize, true); 94 int nextBucketInfo = (int)bucket.getCIntegerAt((index+1) * uintSize, uintSize, true);
|
/openjdk10/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/memory/ |
H A D | Dictionary.java | 53 // this is overriden here so that Hashtable.bucket will return 63 for (DictionaryEntry probe = (DictionaryEntry) bucket(index); probe != null; 74 for (DictionaryEntry entry = (DictionaryEntry) bucket(index); entry != null; 87 for (DictionaryEntry entry = (DictionaryEntry) bucket(index); entry != null;
|
/openjdk10/hotspot/src/share/vm/classfile/ |
H A D | protectionDomainCache.cpp | 53 ProtectionDomainCacheEntry* entry = bucket(i); 75 for (ProtectionDomainCacheEntry* probe = bucket(index); 87 for (ProtectionDomainCacheEntry* probe = bucket(index); 115 for (ProtectionDomainCacheEntry* e = bucket(index); e != NULL; e = e->next()) {
|
H A D | resolutionErrors.hpp | 45 ResolutionErrorEntry* bucket(int i) { function in class:ResolutionErrorTable 46 return (ResolutionErrorEntry*)Hashtable<ConstantPool*, mtClass>::bucket(i);
|
H A D | protectionDomainCache.hpp | 69 ProtectionDomainCacheEntry* bucket(int i) const { function in class:ProtectionDomainCacheTable 70 return (ProtectionDomainCacheEntry*) Hashtable<oop, mtClass>::bucket(i);
|
H A D | dictionary.cpp | 208 for (DictionaryEntry* probe = bucket(index); 223 for (DictionaryEntry* probe = bucket(index); 237 for (DictionaryEntry* probe = bucket(index); 250 for (DictionaryEntry* probe = bucket(index); 289 for (DictionaryEntry* entry = bucket(index); 367 DictionaryEntry* p = bucket(i); 399 p->set_next(bucket(index)); 420 for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) { 442 for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) { 452 for (SymbolPropertyEntry* p = bucket(inde [all...] |
H A D | stringTable.cpp | 136 for (HashtableEntry<oop, mtSymbol>* l = bucket(index); l != NULL; l = l->next()) { 144 // If the bucket size is too deep check if this hash code is insufficient. 363 HashtableEntry<oop, mtSymbol>* entry = the_table()->bucket(i); 387 HashtableEntry<oop, mtSymbol>* entry = the_table()->bucket(i); 430 HashtableEntry<oop, mtSymbol>* p = the_table()->bucket(i); 449 HashtableEntry<oop, mtSymbol>* p = the_table()->bucket(i); 492 "in entry @ bucket[%d][%d] and entry @ bucket[%d][%d]", 499 "bucket[%d][%d] and entry @ bucket[ 709 HashtableEntry<oop, mtSymbol>* bucket = the_table()->bucket(i); local [all...] |
H A D | packageEntry.cpp | 177 // Walk through all buckets and all entries in each bucket, 180 for (PackageEntry* p = bucket(i); p != NULL;) { 256 for (PackageEntry* p = bucket(index); p != NULL; p = p->next()) { 269 for (PackageEntry* entry = bucket(i); 308 for (PackageEntry* entry = bucket(i); 326 for (PackageEntry* probe = bucket(i);
|
H A D | compactHashtable.cpp | 61 GrowableArray<Entry>* bucket = _buckets[index]; local 62 delete bucket; 78 GrowableArray<Entry>* bucket = _buckets[index]; local 79 int bucket_size = bucket->length(); 105 GrowableArray<Entry>* bucket = _buckets[index]; local 106 int bucket_size = bucket->length(); 108 // bucket with one entry is compacted and only has the symbol offset 111 Entry ent = bucket->at(0); 115 // regular bucket, each entry is a symbol (hash, offset) pair 119 Entry ent = bucket [all...] |
H A D | packageEntry.hpp | 240 PackageEntry* bucket(int i) { function in class:PackageEntryTable 241 return (PackageEntry*)Hashtable<Symbol*, mtModule>::bucket(i);
|
/openjdk10/hotspot/src/share/vm/prims/ |
H A D | resolvedMethodTable.hpp | 60 ResolvedMethodEntry* bucket(int i) { function in class:ResolvedMethodTable 61 return (ResolvedMethodEntry*) Hashtable<oop, mtClass>::bucket(i);
|
H A D | resolvedMethodTable.cpp | 45 for (ResolvedMethodEntry* p = bucket(index); p != NULL; p = p->next()) { 147 ResolvedMethodEntry* entry = _the_table->bucket(i); 174 ResolvedMethodEntry* entry = _the_table->bucket(i); 185 ResolvedMethodEntry* entry = bucket(i); 204 ResolvedMethodEntry* entry = _the_table->bucket(i);
|
/openjdk10/jdk/src/java.desktop/share/classes/sun/java2d/marlin/stats/ |
H A D | Histogram.java | 48 static int bucket(int val) { method in class:Histogram 78 stats[bucket(val)].add(val);
|
/openjdk10/hotspot/src/share/vm/gc/g1/ |
H A D | g1StringDedupTable.cpp | 211 const uintx G1StringDedupTable::_rehash_multiple = 60; // Hash bucket has 60 times more collisions than expected 262 G1StringDedupEntry** list = dest->bucket(index); 294 G1StringDedupEntry** list = bucket(index); 499 for (size_t bucket = partition_begin; bucket < partition_end; bucket++) { 500 G1StringDedupEntry** entry = _table->bucket(bucket); 555 for (size_t bucket = 0; bucket < _tabl [all...] |
H A D | g1CodeCacheRemSet.cpp | 57 assert((e == bucket(index)) == (previous == NULL), "if e is the first entry then previous should be null"); 69 for (Entry* e = bucket(index); e != NULL; ) { 96 for (Entry* e = bucket(index); e != NULL; e = e->next()) { 107 for (Entry* e = bucket(index); e != NULL; previous = e, e = e->next()) { 118 for (Entry* e = bucket(index); e != NULL; e = e->next()) { 127 for (Entry* e = bucket(index); e != NULL; e = e->next()) { 138 Entry* e = bucket(index);
|
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/jaxp/validation/ |
H A D | SoftReferenceGrammarPool.java | 98 * @return The set of grammars the validator may put in its "bucket" 359 fGrammars[entry.bucket] = entry.next; 390 public int bucket; field in class:SoftReferenceGrammarPool.Entry 396 protected Entry(int hash, int bucket, XMLGrammarDescription desc, Grammar grammar, Entry next, ReferenceQueue queue) { argument 398 this.bucket = bucket;
|