/openjdk7/jdk/src/share/back/ |
H A D | classTrack.c | 78 transferClass(JNIEnv *env, jclass klass, KlassNode **newTable) { argument 81 KlassNode **newHead = &newTable[slot]; 163 KlassNode **newTable; local 167 newTable = jvmtiAllocate(CT_HASH_SLOT_COUNT * sizeof(KlassNode *)); 168 if (newTable == NULL) { 172 (void)memset(newTable, 0, CT_HASH_SLOT_COUNT * sizeof(KlassNode *)); 183 jvmtiDeallocate(newTable); 190 transferClass(env, klass, newTable); 196 table = newTable;
|
/openjdk7/jdk/src/share/classes/java/beans/ |
H A D | WeakIdentityMap.java | 47 private Entry<T>[] table = newTable(1<<3); // table's length MUST be a power of two 87 Entry<T>[] table = newTable(this.table.length * 2); 133 private void transfer(Entry<T>[] oldTable, Entry<T>[] newTable) { argument 146 int index = getIndex(newTable, entry.hash); 147 entry.next = newTable[index]; 148 newTable[index] = entry; 157 private Entry<T>[] newTable(int length) { method in class:WeakIdentityMap
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/ |
H A D | CharArrayIntMap.java | 205 Entry[] newTable = new Entry[_capacity]; 206 transfer(newTable); 207 _table = newTable; 211 private final void transfer(Entry[] newTable) { argument 213 int newCapacity = newTable.length; 221 e._next = newTable[i]; 222 newTable[i] = e;
|
H A D | LocalNameQualifiedNamesMap.java | 201 Entry[] newTable = new Entry[_capacity]; 202 transfer(newTable); 203 _table = newTable; 207 private final void transfer(Entry[] newTable) { argument 209 int newCapacity = newTable.length; 217 e._next = newTable[i]; 218 newTable[i] = e;
|
H A D | StringIntMap.java | 189 Entry[] newTable = new Entry[_capacity]; 190 transfer(newTable); 191 _table = newTable; 195 private final void transfer(Entry[] newTable) { argument 197 int newCapacity = newTable.length; 205 e._next = newTable[i]; 206 newTable[i] = e;
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/jdi/ |
H A D | SDE.java | 280 LineTableRecord[] newTable = new LineTableRecord[newLen]; 282 newTable[i] = lineTable[i]; 285 newTable[i] = new LineTableRecord(); 287 lineTable = newTable; 296 FileTableRecord[] newTable = new FileTableRecord[newLen]; 298 newTable[i] = fileTable[i]; 301 newTable[i] = new FileTableRecord(); 303 fileTable = newTable; 312 StratumTableRecord[] newTable = new StratumTableRecord[newLen]; 314 newTable[ [all...] |
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/ |
H A D | SDE.java | 281 LineTableRecord[] newTable = new LineTableRecord[newLen]; 283 newTable[i] = lineTable[i]; 286 newTable[i] = new LineTableRecord(); 288 lineTable = newTable; 297 FileTableRecord[] newTable = new FileTableRecord[newLen]; 299 newTable[i] = fileTable[i]; 302 newTable[i] = new FileTableRecord(); 304 fileTable = newTable; 313 StratumTableRecord[] newTable = new StratumTableRecord[newLen]; 315 newTable[ [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/util/ |
H A D | SymbolHash.java | 159 SymbolHash newTable = new SymbolHash(fTableSize); 160 newTable.fNum = fNum; 163 newTable.fBuckets[i] = fBuckets[i].makeClone(); 165 return newTable;
|
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/runtime/ |
H A D | Hashtable.java | 191 HashtableEntry newTable[] = new HashtableEntry[newCapacity]; 194 table = newTable; 201 e.next = newTable[index]; 202 newTable[index] = e;
|
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/util/ |
H A D | IdentityHashtable.java | 249 IdentityHashtableEntry newTable[] = new IdentityHashtableEntry[newCapacity]; 252 table = newTable; 262 e.next = newTable[index]; 263 newTable[index] = e;
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/ |
H A D | LongHashMap.java | 431 Entry newTable[] = new Entry[newCapacity]; 435 table = newTable; 443 e.next = newTable[index]; 444 newTable[index] = e;
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | LinkedHashMap.java | 251 void transfer(HashMap.Entry[] newTable, boolean rehash) { argument 252 int newCapacity = newTable.length; 257 e.next = newTable[index]; 258 newTable[index] = e;
|
H A D | IdentityHashMap.java | 469 Object[] newTable = new Object[newLength]; 479 while (newTable[i] != null) 481 newTable[i] = key; 482 newTable[i + 1] = value; 485 table = newTable; 803 Object[] newTable = new Object[remaining]; 805 newTable, 0, remaining); 806 traversalTable = newTable;
|
H A D | WeakHashMap.java | 249 private Entry<K,V>[] newTable(int n) { method in class:WeakHashMap 275 table = newTable(capacity); 560 Entry<K,V>[] newTable = newTable(newCapacity); 565 transfer(oldTable, newTable, rehash); 566 table = newTable; 577 transfer(newTable, oldTable, false);
|
H A D | HashMap.java | 584 Entry[] newTable = new Entry[newCapacity]; 585 transfer(newTable, initHashSeedAsNeeded(newCapacity)); 586 table = newTable; 591 * Transfers all entries from current table to newTable. 593 void transfer(Entry[] newTable, boolean rehash) { argument 594 int newCapacity = newTable.length; 602 e.next = newTable[i]; 603 newTable[i] = e;
|
H A D | Hashtable.java | 988 Entry<K,V>[] newTable = new Entry[length]; 998 reconstitutionPut(newTable, key, value); 1000 this.table = newTable;
|
/openjdk7/jdk/src/windows/native/sun/windows/ |
H A D | Hashtable.cpp | 103 HashtableEntry** newTable = (HashtableEntry**)safe_Calloc( local 107 table = newTable; 115 e->next = newTable[index]; 116 newTable[index] = e;
|
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | Cache.java | 209 CacheEntry newTable[] = new CacheEntry[newCapacity]; 212 table = newTable; 223 e.next = newTable[index]; 224 newTable[index] = e;
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/util/ |
H A D | QNameMap.java | 244 Entry[] newTable = new Entry[newCapacity]; 245 transfer(newTable); 246 table = newTable; 251 * Transfer all entries from current table to newTable. 253 private void transfer(Entry<V>[] newTable) { argument 255 int newCapacity = newTable.length; 263 e.next = newTable[i]; 264 newTable[i] = e;
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/util/ |
H A D | QNameMap.java | 245 Entry[] newTable = new Entry[newCapacity]; 246 transfer(newTable); 247 table = newTable; 252 * Transfer all entries from current table to newTable. 254 private void transfer(Entry<V>[] newTable) { argument 256 int newCapacity = newTable.length; 264 e.next = newTable[i]; 265 newTable[i] = e;
|
/openjdk7/jdk/src/share/classes/java/lang/invoke/ |
H A D | MethodType.java | 1053 private Entry[] newTable(int n) { method in class:MethodType.WeakInternSet 1064 table = newTable(DEFAULT_INITIAL_CAPACITY); 1216 Entry[] newTable = newTable(newCapacity); 1217 transfer(oldTable, newTable); 1218 table = newTable; 1229 transfer(newTable, oldTable);
|
/openjdk7/hotspot/test/compiler/6865031/ |
H A D | Test.java | 379 Entry<V>[] newTable = new Entry[newCapacity]; 380 transfer(oldTable, newTable); 381 table = newTable; 395 transfer(newTable, oldTable);
|
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/ |
H A D | SummaryTab.java | 47 private static final String newTable = "<tr><td colspan=4 align=left><table cellpadding=1>"; field in class:SummaryTab 220 append(newTable); 282 append(newTable);
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 501 HashEntry<K,V>[] newTable = 510 newTable[idx] = e; 523 newTable[lastIdx] = lastRun; 529 HashEntry<K,V> n = newTable[k]; 530 newTable[k] = new HashEntry<K,V>(h, p.key, v, n); 536 node.setNext(newTable[nodeIndex]); 537 newTable[nodeIndex] = node; 538 table = newTable;
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/ |
H A D | ClassWriter.java | 1247 Item[] newTable = new Item[2 * typeTable.length]; 1248 System.arraycopy(typeTable, 0, newTable, 0, typeTable.length); 1249 typeTable = newTable;
|