Searched refs:buckets (Results 1 - 10 of 10) sorted by relevance
/openjdk7/corba/src/share/classes/sun/rmi/rmic/iiop/ |
H A D | StaticStringsHash.java | 55 * The <code>buckets</code> array will contain a set of arrays, one for 56 * each key in the <code>keys</code>, where <code>buckets[x][y]</code> 68 /** Buckets for each key, where buckets[x][y] is an index 70 public int[][] buckets = null; field in class:StaticStringsHash 212 // Allocate our buckets array. Fill the string 217 buckets = new int[bucketCount][]; 219 buckets[i] = new int[bucketSizes[i]]; 221 buckets[i][j] = unused; 232 while (buckets[j][k] != unused) { 235 buckets[ [all...] |
H A D | StubGenerator.java | 1709 for (int i = 0; i < hash.buckets.length; i++) { 1711 for (int j = 0; j < hash.buckets[i].length; j++) { 1712 CompoundType.Method current = remoteMethods[hash.buckets[i][j]];
|
/openjdk7/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_table.h | 52 int incr, int buckets, int esize);
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | hashtable.inline.hpp | 49 HashtableBucket<F>* buckets, 53 _buckets = buckets; 48 BasicHashtable(int table_size, int entry_size, HashtableBucket<F>* buckets, int number_of_entries) argument
|
H A D | hashtable.hpp | 36 // It is implemented as an open hash table with a fixed number of buckets. 146 HashtableBucket<F>* buckets, int number_of_entries); 159 // Reverse the order of elements in each of the buckets. 219 // Free the buckets in this hashtable 244 HashtableBucket<F>* buckets, int number_of_entries) 245 : BasicHashtable<F>(table_size, entry_size, buckets, number_of_entries) { } 250 // Reverse the order of elements in each of the buckets. Hashtable 243 Hashtable(int table_size, int entry_size, HashtableBucket<F>* buckets, int number_of_entries) argument
|
/openjdk7/jdk/src/share/classes/sun/security/util/ |
H A D | Cache.java | 61 * In its current implementation, the number of buckets (NOT entries) in 63 * maximum cache size to value that uses those buckets fully. For example, 65 * maximum size of 750 would be a good choice: try 1024 buckets, with a 67 * buckets / 4 * 3. As mentioned above, with a SoftReference cache, it is 264 int buckets = (int)(maxSize / LOAD_FACTOR) + 1; 265 cacheMap = new LinkedHashMap<Object, CacheEntry>(buckets,
|
/openjdk7/hotspot/src/share/vm/code/ |
H A D | codeCache.cpp | 875 int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit, mtCode); local 876 memset(buckets,0,sizeof(int) * bucketLimit); 882 buckets[nm->insts_size() / bucketSize]++; 904 if(buckets[i] != 0) { 907 tty->print_cr("%d",buckets[i]); 911 FREE_C_HEAP_ARRAY(int, buckets, mtCode);
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/posix/elf/ |
H A D | ELFFileParser.java | 760 private int buckets[]; field in class:ELFFileParser.ELFFileImpl.ELFHashTableImpl 768 buckets = new int[num_buckets]; 772 buckets[i] = readInt();
|
/openjdk7/jdk/src/share/native/common/ |
H A D | check_code.c | 170 /* The buckets are managed as a 256 by 256 matrix. We allocate an entire 171 * row (256 buckets) at a time to minimize fragmentation. Rows are 188 hash_bucket_type **buckets; member in struct:__anon644 194 (class_hash->buckets[ID / HASH_ROW_SIZE] + ID % HASH_ROW_SIZE) 441 class_hash->buckets = (hash_bucket_type **) 445 if (class_hash->buckets == 0 || 468 if (class_hash->buckets) { 470 if (class_hash->buckets[i] == 0) 472 free(class_hash->buckets[i]); 475 free(class_hash->buckets); [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | chaitin.cpp | 176 Block **buckets[NUMBUCKS]; // Array of buckets local 180 buckets[i] = NEW_RESOURCE_ARRAY( Block *, _cfg._num_blocks ); 186 buckets[i][j] = NULL; 189 // Sort blocks into buckets 194 buckets[j][buckcnt[j]++] = _cfg._blocks[i]; 199 // Dump buckets into final block array 203 _blks[blkcnt++] = buckets[i][j];
|
Completed in 65 milliseconds