| /openjdk7/hotspot/agent/src/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());
|
| /openjdk7/hotspot/src/share/vm/classfile/ |
| H A D | resolutionErrors.hpp | 44 ResolutionErrorEntry* bucket(int i) { function in class:ResolutionErrorTable 45 return (ResolutionErrorEntry*)Hashtable<constantPoolOop, mtClass>::bucket(i);
|
| H A D | loaderConstraints.hpp | 55 LoaderConstraintEntry* bucket(int i) { function in class:LoaderConstraintTable 56 return (LoaderConstraintEntry*)Hashtable<klassOop, mtClass>::bucket(i);
|
| H A D | dictionary.hpp | 50 DictionaryEntry* bucket(int i) { function in class:Dictionary 51 return (DictionaryEntry*)Hashtable<klassOop, mtClass>::bucket(i); 284 SymbolPropertyEntry* bucket(int i) { function in class:SymbolPropertyTable 285 return (SymbolPropertyEntry*) Hashtable<Symbol*, mtSymbol>::bucket(i);
|
| H A D | placeholders.hpp | 46 PlaceholderEntry* bucket(int i) { function in class:PlaceholderTable 47 return (PlaceholderEntry*)Hashtable<Symbol*, mtClass>::bucket(i);
|
| H A D | classLoader.cpp | 687 PackageInfo* bucket(int index) { function in class:PackageHashtable 688 return (PackageInfo*)BasicHashtable<mtClass>::bucket(index); 693 for (PackageInfo* pp = bucket(index); pp != NULL; pp = pp->next()) { 731 for (PackageInfo* pp = bucket(i); pp != NULL; pp = pp->next()) { 751 for (PackageInfo* pp = table->bucket(i); 767 for (PackageInfo* pp = table->bucket(i);
|
| /openjdk7/hotspot/src/share/vm/utilities/ |
| H A D | hashtable.inline.hpp | 74 template <MEMFLAGS F> inline BasicHashtableEntry<F>* BasicHashtable<F>::bucket(int i) { function in class:BasicHashtable 103 entry->set_next(bucket(index));
|
| H A D | hashtable.hpp | 48 // Link to next element in the linked list for this bucket. EXCEPT 191 BasicHashtableEntry<F>* bucket(int i); 270 HashtableEntry<T, F>* bucket(int i) { function in class:Hashtable 271 return (HashtableEntry<T, F>*)BasicHashtable<F>::bucket(i);
|
| /openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/util/ |
| H A D | SymbolHash.java | 84 int bucket = (key.hashCode() & 0x7FFFFFFF) % fTableSize; 85 Entry entry = search(key, bucket); 93 entry = new Entry(key, value, fBuckets[bucket]); 94 fBuckets[bucket] = entry; 106 int bucket = (key.hashCode() & 0x7FFFFFFF) % fTableSize; 107 Entry entry = search(key, bucket); 179 protected Entry search(Object key, int bucket) { argument 181 for (Entry entry = fBuckets[bucket]; entry != null; entry = entry.next) {
|
| /openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/jaxp/validation/ |
| H A D | SoftReferenceGrammarPool.java | 97 * @return The set of grammars the validator may put in its "bucket" 358 fGrammars[entry.bucket] = entry.next; 389 public int bucket; field in class:SoftReferenceGrammarPool.Entry 395 protected Entry(int hash, int bucket, XMLGrammarDescription desc, Grammar grammar, Entry next, ReferenceQueue queue) { argument 397 this.bucket = bucket;
|
| /openjdk7/hotspot/src/share/vm/libadt/ |
| H A D | dict.cpp | 53 //------------------------------bucket--------------------------------------- 54 class bucket : public ResourceObj { class in inherits:ResourceObj 56 uint _cnt, _max; // Size of bucket 62 // of two, for nice modulo operations. Each bucket in the hash table points 84 _bin = (bucket*)_arena->Amalloc_4(sizeof(bucket)*_size); 85 memset(_bin,0,sizeof(bucket)*_size); 105 _bin = (bucket*)_arena->Amalloc_4(sizeof(bucket)*_size); 106 memset(_bin,0,sizeof(bucket)*_siz [all...] |
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
| H A D | ServerCompilerScheduler.java | 341 List<Integer> bucket; field in class:ServerCompilerScheduler.BlockIntermediate 394 bi.bucket = new ArrayList<Integer>(); 436 semiBlock.bucket.add(block_index); 441 for (int j = 0; j < parentBlock.bucket.size(); j++) { 442 for (int curIndex : parentBlock.bucket) { 456 parentBlock.bucket.clear();
|
| /openjdk7/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...] |
| /openjdk7/hotspot/src/share/vm/ci/ |
| H A D | ciObjectFactory.cpp | 278 NonPermObject* &bucket = find_non_perm(key); local 279 if (bucket != NULL) { 280 return bucket->object(); 291 insert_non_perm(bucket, keyHandle(), new_object); 676 // the null tail of the bucket into which the oop should be inserted. 709 inline ciObjectFactory::NonPermObject::NonPermObject(ciObjectFactory::NonPermObject* &bucket, oop key, ciObject* object) { argument 712 _next = bucket; 713 bucket = this; 723 assert(&where != &emptyBucket, "must not try to fill empty bucket");
|
| /openjdk7/jdk/src/share/classes/sun/java2d/pisces/ |
| H A D | Renderer.java | 65 int bucket = cury - boundsMinY; 68 int bucketcount = edgeBucketCounts[bucket]; 80 for (int ecur = edgeBuckets[bucket]; ecur != NULL; ecur = (int)edges[ecur+NEXT]) { 159 // each bucket is a linked list. this method adds eptr to the 160 // start of the "bucket"th linked list. 161 private void addEdgeToBucket(final int eptr, final int bucket) { argument 162 edges[eptr+NEXT] = edgeBuckets[bucket]; 163 edgeBuckets[bucket] = eptr; 164 edgeBucketCounts[bucket] += 2;
|
| /openjdk7/jdk/src/share/demo/jvmti/hprof/ |
| H A D | hprof_table.c | 57 * reference to the first TableIndex in the hash bucket, the next 59 * bucket. Lookups will drift the looked up item to the head of the 106 TableIndex next; /* The next TableElement in the hash bucket chain. */ 115 TableIndex *hash_buckets; /* Pointer to hash bucket chains. */ 128 unsigned bucket_walks; /* Count of bucket walks. */ 224 TableIndex bucket; local 228 bucket = (element->hcode % ltable->hash_bucket_count); 229 i = ltable->hash_buckets[bucket]; 238 ltable->hash_buckets[bucket] = element->next; 393 TableIndex bucket; local 420 int bucket; local 551 TableIndex bucket; local [all...] |
| /openjdk7/hotspot/src/share/vm/oops/ |
| H A D | constantPoolOop.hpp | 787 SymbolHashMapEntry* _next; // Next element in the linked list for this bucket 859 SymbolHashMapEntry* bucket(int i) { function in class:SymbolHashMap 874 for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) {
|
| /openjdk7/hotspot/src/share/vm/runtime/ |
| H A D | sharedRuntime.cpp | 2197 AdapterHandlerEntry* bucket(int i) { function in class:AdapterHandlerTable 2198 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i); 2229 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) { 2254 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) { 2289 AdapterHandlerEntry* a = _table->bucket(_index);
|
| /openjdk7/jdk/src/share/native/common/ |
| H A D | check_code.c | 456 /* 4296677: bucket index starts from 1. */ 458 hash_bucket_type *bucket = GET_BUCKET(class_hash, i); local 459 assert(bucket != NULL); 460 free(bucket->name); 461 if (bucket->class) { 462 (*env)->DeleteGlobalRef(env, bucket->class); 552 hash_bucket_type *bucket; local 560 bucket = GET_BUCKET(class_hash, *pID); 561 if (bucket->hash == hash && strcmp(name, bucket 613 hash_bucket_type *bucket; local 660 hash_bucket_type *bucket = GET_BUCKET(class_hash, ID); local 668 hash_bucket_type *bucket = GET_BUCKET(class_hash, ID); local [all...] |