archive/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2025-08-27 14:54:52 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

8203279: Faster rounding up to nearest power of two

Browse source 
Reviewed-by: martin, redestad
This commit is contained in:
Ivan Gerasimov 2018-05-21 12:49:03 -07:00
parent 088dbd5ce8
commit ee601ac627
3 changed files with 3 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

7
src/java.base/share/classes/java/util/ComparableTimSort.java
View file

@ -883,12 +883,7 @@ class ComparableTimSort {
private Object[] ensureCapacity(int minCapacity) {
if (tmpLen < minCapacity) {
// Compute smallest power of 2 > minCapacity
int newSize = minCapacity;
newSize |= newSize >> 1;
newSize |= newSize >> 2;
newSize |= newSize >> 4;
newSize |= newSize >> 8;
newSize |= newSize >> 16;
int newSize = -1 >>> Integer.numberOfLeadingZeros(minCapacity);
newSize++;
if (newSize < 0) // Not bloody likely!

7
src/java.base/share/classes/java/util/HashMap.java
View file

@ -376,12 +376,7 @@ public class HashMap<K,V> extends AbstractMap<K,V>
* Returns a power of two size for the given target capacity.
*/
static final int tableSizeFor(int cap) {
int n = cap - 1;
n |= n >>> 1;
n |= n >>> 2;
n |= n >>> 4;
n |= n >>> 8;
n |= n >>> 16;
int n = -1 >>> Integer.numberOfLeadingZeros(cap - 1);
return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
}

7
src/java.base/share/classes/java/util/TimSort.java
View file

@ -916,12 +916,7 @@ class TimSort<T> {
private T[] ensureCapacity(int minCapacity) {
if (tmpLen < minCapacity) {
// Compute smallest power of 2 > minCapacity
int newSize = minCapacity;
newSize |= newSize >> 1;
newSize |= newSize >> 2;
newSize |= newSize >> 4;
newSize |= newSize >> 8;
newSize |= newSize >> 16;
int newSize = -1 >>> Integer.numberOfLeadingZeros(minCapacity);
newSize++;
if (newSize < 0) // Not bloody likely!