March 2012 - core-libs-dev

Replacement of Quicksort in java.util.Arrays with new Dual-Pivot Quicksort
by Vladimir Yaroslavskiy 27 Feb '16

27 Feb '16

Hello All, I'd like to share with you new Dual-Pivot Quicksort which is faster than the known implementations (theoretically and experimental). I'd like to propose to replace the JDK's Quicksort implementation by new one. Description ----------- The classical Quicksort algorithm uses the following scheme: 1. Pick an element P, called a pivot, from the array. 2. Reorder the array so that all elements, which are less than the pivot, come before the pivot and all elements greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot element is in its final position. 3. Recursively sort the sub-array of lesser elements and the sub-array of greater elements. The invariant of classical Quicksort is: [ <= p | >= p ] There are several modifications of the schema: [ < p | = p | > p ] or [ = p | < p | > p | = p ] But all of them use *one* pivot. The new Dual-Pivot Quicksort uses *two* pivots elements in this manner: 1. Pick an elements P1, P2, called pivots from the array. 2. Assume that P1 <= P2, otherwise swap it. 3. Reorder the array into three parts: those less than the smaller pivot, those larger than the larger pivot, and in between are those elements between (or equal to) the two pivots. 4. Recursively sort the sub-arrays. The invariant of the Dual-Pivot Quicksort is: [ < P1 | P1 <= & <= P2 } > P2 ] The new Quicksort is faster than current implementation of Quicksort in JDK (L. Bentley and M. Douglas McIlroy) and classical Quicksort. The full description of the Dual-Pivot Quicksort you can find on my page: http://iaroslavski.narod.ru/quicksort Performance tests ----------------- Here is result of running on different types of input data: Client VM all 85% organ 0..1 0..4 random ascend descend equal equal pipes random 010101 random Dual-Pivot: 16.83 5.31 5.47 0.35 0.68 10.59 1.06 1.02 2.18 Bentley's: 19.77 9.08 10.13 0.63 1.12 13.22 1.63 1.08 2.49 Server VM all 85% organ 0..1 0..4 random ascend descend equal equal pipes random 010101 random Dual-Pivot: 23.94 6.68 6.63 0.43 0.62 17.14 1.42 1.96 3.41 Bentley's: 25.20 10.18 10.32 2.07 1.33 16.72 2.95 1.82 3.39 The a lot of other tests have been run under client and server mode. The most interesting is BentleyBasher test framework. It runs battery of tests for all cases: { 100, 1000, 10000, 1000000 } x { sawtooth, rand, stagger, plateau, shuffle } x { ident, reverse, reverse_front, reverse_back, sort, dither} where 100, ... , 1000000 - array length sawtooth: x[i] =i%m rand: x[i] = rand() % m stagger: x[i] = (i*m + i) % n plateau: x[i] = min(i, m) shuffle: x[i] = rand()%m? (j+=2): (k+=2) ident(x) - a copy of x reverse(x, 0, n) - reversed copy reverse_front(x, 0, n/2) - front half reversed reverse_back(x, n/2, n) - back half reversed sort(x) - an ordered copy dither(x) - add i%5 to x[i] Here is the result of execution: Server VM: http://spreadsheets.google.com/pub?key=t_EAWUkQ4mD3BIbOv8Fa-AQ&output=html Client VM: http://spreadsheets.google.com/pub?key=tdiMo8xleTxd23nKUObcz0Q&single=true&… Mathematical investigations --------------------------- It is proved that for the Dual-Pivot Quicksort the average number of comparisons is 2*n*ln(n), the average number of swaps is 0.8*n*ln(n), whereas classical Quicksort algorithm has 2*n*ln(n) and 1*n*ln(n) respectively. Full mathematical proof see in attached proof.txt and proof_add.txt files. Theoretical results are also confirmed by experimental counting of the operations. Diff between current and new implementation of Quicksort -------------------------------------------------------- Here is the link to the diff for java.util.Arrays class: http://cr.openjdk.java.net/~alanb/6880672/webrev.00 If you like to look and play with new algorithm, please, take attached class DualPivotQuicksort.java Feedback -------- Also I'd like to share a feedback from Joshua Bloch and Jon Bentley who spent a lot of time investigating this algorithm, who gave me many advices and tips how to make new Quicksort better. -------- Original Message -------- Subject: Re: Integration of new Dual-Pivot Quicksort into JDK 7 Date: Thu, 10 Sep 2009 07:20:11 -0700 From: Joshua Bloch <jjb(a)google.com> Jon also says that Vladimir should make every reasonable improvement to the basic method before checking in the code. In his words, "It would be horrible to put the new code into the library, and then have someone else come along and speed it up by another 20% by using standard techniques." I believe it's not unlikely that this code may end up getting ported to many languages and widely deployed in much the manner of Bentley and McIlroy's fine sort (which is nearing 20 successful years in the field). Jon will help Vladimir do this. -------- Original Message -------- Subject: Dual-Pivot Quicksort: Next Steps Date: Wed, 09 Sep 2009 15:02:25 -0400 From: Jon Bentley <jbentley(a)avaya.com> Vladimir, Josh, I *finally* feel like I understand what is going on. Now that I (think that) I see it, it seems straightforward and obvious. Tony Hoare developed Quicksort in the early 1960s. I was very proud to make minor contributions to a particularly clean (binary) quicksort in the mid 1980s, to a relatively straightforward, industrial strength Quicksort with McIlroy in the early 1990s, and then to algorithms and data structures for strings with Sedgewick in the mid 1990s. I think that Vladimir's contributions to Quicksort go way beyond anything that I've ever done, and rank up there with Hoare's original design and Sedgewick's analysis. I feel so privileged to play a very, very minor role in helping Vladimir with the most excellent work! ----------------------------------------------- Let me know, if you have any questions/comments. Thank you, Vladimir Here is the details between steps (1) and (2) in the case of Dual-Pivot Quicksort: ----------------------------------------------------------------------------- >From the algorithm above, the average number of comparisons C_n as a function of the number of elements may be represented by the equation: (1) C_n = 1 + 2/(n*(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {C_i + 1*i + C_{j-i-1} + 2*(j-i- 1) + C_{n-j-1} + 2*(n-j-1)} Equation (1) means that total number is the sum of the comparison numbers of all cases of partitions into 3 parts plus number of comparisons for elements from left part (one comparison), center and right parts (2 comparisons). !!! It can be rewritten in other way: !!! (2) C_n = 1 + R*(n-2) + 2/(n(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {C_i + C_{j-i-1} + C_{n-j-1}} where R is the average number of comparisons during one iteration. This constant R can be found as average value (1 + 2 + 2) / 3 = 5/3 ~ 1.6666. ----------------------------------------------------------------------------- How it can be rewritten: We should show that 2/(n*(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {i + 2*(j-i- 1) + 2*(n-j-1)} equals to 5/3 * (n-2). Let's consider the double sum: sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {i + 2*(j-i- 1) + 2*(n-j-1)} = = sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {2*n - 4} - sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {i} = = 2*(n-2)*sum_{i=0}^{n-2} {n-1-i} - sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {i} = = 2*(n-2)*((n-1)^2 - (n-1)*(n-2)/2) - (n-1)*sum_{i=0}^{n-2} {i} + sum_{i=0}^{n-2} {i*i} = ------------------------------------------------------------------ here we use the property: sum_{k=1}{n} {k^2} = n^3/3 + n^2/2 + n/6 ------------------------------------------------------------------ = 2*(n-2)*((n-1)^2 - (n-1)*(n-2)/2) - (n-1)*(n-1)*(n-2)/2 + (n-2)^3/3 + (n-2)^2/2 + (n-2)/6 = = 1/6 * (12*(n-1)^2*(n-2) - 6*(n-1)*(n-2)^2 - 3*(n-1)^2*(n-2) + 2*(n-2)^3 + 3*(n-2)^2 + (n-2)) = = 1/6 * (3*(n-1)*(n-2)*(3*(n-1) - 2*(n-2)) + (n-2)*(2*(n-2)^2 + 3*(n-2) + 1))) = = 1/6 * (3*(n-1)*(n-2)*(n+1) + (n-2)*(2*n^2 - 5*n + 3)) = = 1/6 * (n-2)*(5*n^2 - 5*n) = 5/6 * n*(n-1)*(n-2) Substitute the result into equation (1): (1.1) C_n = 1 + 2/(n*(n-1)) * 5/6 * n*(n-1)*(n-2) + 2/(n*(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {C_i + C_{j-i-1} + C_{n-j-1}} or (1.2) C_n = 1 + 5/3*(n-2) + 2/(n*(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {C_i + C_{j-i-1} + C_{n-j-1}} We see that (1.2) is same as (2). /** * @author Vladimir Yaroslavskiy * @version 2009.09.10 m765 */ public class DualPivotQuicksort { public static void sort(int[] a) { sort(a, 0, a.length); } public static void sort(int[] a, int fromIndex, int toIndex) { rangeCheck(a.length, fromIndex, toIndex); dualPivotQuicksort(a, fromIndex, toIndex - 1, 3); } private static void rangeCheck(int length, int fromIndex, int toIndex) { if (fromIndex > toIndex) { throw new IllegalArgumentException("fromIndex(" + fromIndex + ") > toIndex(" + toIndex + ")"); } if (fromIndex < 0) { throw new ArrayIndexOutOfBoundsException(fromIndex); } if (toIndex > length) { throw new ArrayIndexOutOfBoundsException(toIndex); } } private static void swap(int[] a, int i, int j) { int temp = a[i]; a[i] = a[j]; a[j] = temp; } private static void dualPivotQuicksort(int[] a, int left, int right, int div) { int len = right - left; if (len < 27) { // insertion sort for tiny array for (int i = left + 1; i <= right; i++) { for (int j = i; j > left && a[j] < a[j - 1]; j--) { swap(a, j, j - 1); } } return; } int third = len / div; // "medians" int m1 = left + third; int m2 = right - third; if (m1 <= left) { m1 = left + 1; } if (m2 >= right) { m2 = right - 1; } if (a[m1] < a[m2]) { swap(a, m1, left); swap(a, m2, right); } else { swap(a, m1, right); swap(a, m2, left); } // pivots int pivot1 = a[left]; int pivot2 = a[right]; // pointers int less = left + 1; int great = right - 1; // sorting for (int k = less; k <= great; k++) { if (a[k] < pivot1) { swap(a, k, less++); } else if (a[k] > pivot2) { while (k < great && a[great] > pivot2) { great--; } swap(a, k, great--); if (a[k] < pivot1) { swap(a, k, less++); } } } // swaps int dist = great - less; if (dist < 13) { div++; } swap(a, less - 1, left); swap(a, great + 1, right); // subarrays dualPivotQuicksort(a, left, less - 2, div); dualPivotQuicksort(a, great + 2, right, div); // equal elements if (dist > len - 13 && pivot1 != pivot2) { for (int k = less; k <= great; k++) { if (a[k] == pivot1) { swap(a, k, less++); } else if (a[k] == pivot2) { swap(a, k, great--); if (a[k] == pivot1) { swap(a, k, less++); } } } } // subarray if (pivot1 < pivot2) { dualPivotQuicksort(a, less, great, div); } } } At first consider the classic Quicksort scheme and find the average number of comparisons and swaps for it. We assume that input data is random permutation of n numbers from the range [1..n]. Classic Quicksort ================= 1. Choose a pivot element (take random), 2. Compare each (n-1) elements with the pivot 3. and swap it, if necessary, to have the partitions: [ <= pivot | >= pivot ] 4. Sort recursively left and right parts. >From the algorithm above, the average number of comparisons C_n as a function of the number of elements may be represented by the equation: (1) C_n = (n-1) + 1/n * sum_{k=0}^{n-1} {C_k + C_{n-k-1}} and last sum can be rewritten: (2) C_n = (n-1) + 2/n * sum_{k=0}^{n-1} C_k Write formula (2) for n+1: (3) C_{n+1} = n + 2/(n+1) * sum_{k=0}^{n} C_k Multiply (2) by n and (3) by (n+1) and subtract one from other, we have: (4) (n+1)*C_{n+1} - n*C_n = 2*n + 2*C_n Sorting an array of n elements may be considered as selecting one permutation of the n elements among all possible permutations. The number of possible permutations of n elements is n!, so the task for any sorting algorithm is to determine the one permutation out of n! possibilities. The minimum number of operations (swap and comparisons) for sorting n elements is const*ln(n!). >From the Stirling's formula the approximation of the number of operations is A*n*ln(n) + B*n + C, where A, B and C are constant coefficients. The coefficients B and C are not important for large n. Therefore, the function C_n may be approximated by the equation: (5) C_n = A*n*ln(n) The function C_n is substituted from equation (5) into equation (4), which yields the following equation: (6) (n+1)*A*(n+1)*ln(n+1) - n*A*n*ln(n) = 2*n + 2*A*n*ln(n) Using the properties of logarithms, equation (6) can then be reduced to: (7) n*ln(1+1/n) + 2*ln(1+1/n) + (1/n) * ln(n+1) = 2/A Using a property of logarithm: ln(1 + x) -> x, if x -> 0, and other property: ln(n) / n -> 0, when n -> +oo, equation (7) will be approximated by: (8) 1 + 0 + 0 = 2/A So, the coefficient A is equal to 2 and the average number of comparisons in sorting of n size arrays is (9) C_n = 2*n*ln(n). To find the approximation of the average number of swaps, we use the similar approach as in the case of comparisons. The average number of swaps S_n as a function of the number of elements may be represented by the equation: (10) S_n = 1/2*(n-1) + 2/n * sum_{k=0}^{n-1} S_k We assume that average number of swaps during one iteration is 1/2*(n-1). It means that in average one half of elements is swapped only. Using the same approach, we find that the coefficient A equals to 1. Therefore, the function S_n may be approximated by the equation: (11) S_n = n*ln(n) ------------------------------------------------------------------------------- Now consider the Dual-Pivot Quicksort scheme and find the average number of comparisons and swaps for it. We assume that input data is random permutation of n numbers from the range [1..n]. Dual-Pivot Quicksort ==================== 1. Choose 2 pivot elements pivot1 and pivot2 (take random), 2. pivot1 must be less or equal than pivot2, otherwise they are swapped 3. Compare each (n-2) elements with the pivots 4. and swap it, if necessary, to have the partitions: [ <= p1 | p1 <= & <= p2 | >= p2 ] 5. Sort recursively left, center and right parts. >From the algorithm above, the average number of comparisons C_n as a function of the number of elements may be represented by the equation: (1) C_n = 1 + 2/(n*(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {C_i + 1*i + C_{j-i-1} + 2*(j-i-1) + C_{n-j-1} + 2*(n-j-1)} Equation (1) means that total number is the sum of the comparison numbers of all cases of partitions into 3 parts plus number of comparisons for elements from left part (one comparison), center and right parts (2 comparisons). It can be rewritten in other way: (2) C_n = 1 + R*(n-2) + 2/(n(n-1)) * sum_{i=0}^{n-2} sum_{j=i+1}^{n-1} {C_i + C_{j-i-1} + C_{n-j-1}} where R is the average number of comparisons during one iteration. This constant R can be found as average value (1 + 2 + 2) / 3 = 5/3, which means that elements from left part are required only one comparison, and elements form center and right parts - two comparisons. The double sum in equation (2) can be reduced: (3) C_n = 1 + 5/3*(n-2) + 2/(n*(n-1)) * sum_{k=0}^{n-2} {3 * (n-k-1) * C_k} Denote 1 + 5/3*(n-2) by f_n and multiply to n*(n-1): (4) n*(n-1)*C_n = n*(n-1)*f_n + 6 * sum_{k=0}^{n-2} {(n-k-1) * C_k} Write formula (4) for n+1: (5) n*(n+1)*C_{n+1} = n*(n+1)*f_n + 6 * sum_{k=0}^{n-1} {(n-k) * C_k} Subtract (4) from (5), we have: (6) n*(n+1)*C_{n+1} - n*(n-1)*C_n = n*(n+1)*f_n - n*(n-1)*f_n + 6 * sum_{k=0}^{n-2} C_k + 6*C_{n-1} Denote n*(n+1)*C_{n+1} - n*(n-1)*C_n by X_n and n*(n+1)*f_n - n*(n-1)*f_n by F_n: (7) X_n = F_n + 6 * sum_{k=0}^{n-2} C_k + 6*C_{n-1} Write formula (7) for n+1: (8) X_{n+1} = F_{n+1} + 6 * sum_{k=0}^{n-1} C_k + 6*C_n Subtract (7) from (8), we have: (9) X_{n+1} - X_n = F_{n+1} - F_n + 6*C_n Resolving of F_{n+1} - F_n gives: (10) X_{n+1} - X_n = 2 + 10*n + 6*C_n The function X_n is substituted into equation (10), which yields the following equation: (11) (n+1)*(n+2)C_{n+2} -2*n(n+1)*C_{n+1} + (n*(n-1) - 6)*C_n = 2 + 10*n We will find the function C_n approximated by the equation: (12) C_n = A*n*ln(n) The function C_n is substituted from equation (12) into equation (11), which yields the following equation: (13) (n^3+5*n^2+8*n+4)*ln(n+2) - (2*n^3+4*n^2+2*n)*ln(n+1) + (n^3-n^2-6*n)*ln(n) = (10*n+2) / A Using the properties of logarithms, equation (13) can then be reduced to: (14) n^3*(ln(n+2)-2*ln(n+1)+ln(n)) + n^2*(5*ln(n+2)-4*ln(n+1)-ln(n)) + n*(8*ln(n+2)-2*ln(n+1)-6*ln(n)) + 4*ln(n+2) = (10*n+2) / A Using a property of logarithm: ln(1 + x) -> x, if x -> 0, and other property: ln(n) / n -> 0, when n -> +oo, equation (15) will be approximated by: (15) -1 + 4 + 2 + 0 + 0 = 10 / A So, the coefficient A is equal to 2 and the average number of comparisons in sorting of n size arrays is (9) C_n = 2*n*ln(n). To find the approximation of the average number of swaps, we use the similar approach as in the case of comparisons. The average number of swaps S_n as a function of the number of elements may be represented by the equation: (10) S_n = 4 + 2/3*(n-2) + 2/(n*(n-1)) * sum_{k=0}^{n-2} {(n-k-1)*S_k} We assume that average number of swaps during one iteration is 2/3*(n-2). It means that in average one third of elements is swapped only. Using the same approach, we find that the coefficient A equals to 0.8. Therefore, the function S_n may be approximated by the equation: (11) S_n = 0.8*n*ln(n) ------------------------------------------------------------------------- And as summary: The value of the coefficient A: dual-pivot classic comparison: 2.0 2.0 swap: 0.8 1.0

14 20

Code review request: 6282196 There should be Math.mod(number, modulo) methods
by Roger Riggs 18 Apr '12

18 Apr '12

Hi, 6282196 There should be Math.mod(number, modulo) methods <http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=6282196> Requests that floor and modulus methods be provided for primitive types. Floor division is pretty straight-forward, rounding toward minus infinity. For modulus of int and long, the sign and range follow the exiting floor method in java.util.Math and satisfy the relation that mod(x, y) = (x - floorDiv(x, y) * y). Please review and comment, http://cr.openjdk.java.net/~rriggs/6282196.1/ Thanks, Roger

5 9

Code Review Request: 7157893: Warnings Cleanup in java.util.*
by Kurchi Hazra 16 Apr '12

16 Apr '12

Hi, These changes cleanup warnings in java.util.* and were contributed by Remi Forax (forax(a)univ-mlv.fr) Specifically the files that I merged/had conflicts are: src/share/classes/java/util/Currency.java src/share/classes/java/util/EnumMap.java src/share/classes/java/util/PropertyPermission.java src/share/classes/java/util/ResourceBundle.java src/share/classes/java/util/TimeZone.java Bug : http://monaco.us.oracle.com/detail.jsf?cr=7157893 Webrev: http://cr.openjdk.java.net/~khazra/7157893/webrev.00/ Some related discussion that I could find in the core-libs-dev archives: http://mail.openjdk.java.net/pipermail/core-libs-dev/2011-December/008601.h… http://mail.openjdk.java.net/pipermail/core-libs-dev/2011-December/008602.h… Also, I am going to commit the reviewed patch using the following comment. Please let me know if someone else should be listed in Contributed-by or Reviewed-by: Contributed-by: forax Reviewed-by: mduigou, naoto, smarks Thanks, Kurchi

4 18

Request for review : 7121314 : Behavior mismatch between AbstractCollection.toArray(T[] ) and its spec
by Sean Chou 11 Apr '12

11 Apr '12

Hi all, AbstractCollection.toArray(T[] ) might return a new array even if the given array has enough room for the returned elements when it is concurrently modified. This behavior violates the spec documented in java.util.Collection . This patch checks the size of returned array and copies the elements to return to the given array if it is large enough. The webrev is at : http://cr.openjdk.java.net/~zhouyx/7121314/webrev.00/ The discussion about this bug happened several months ago, the link to the start of that discussion is: http://mail.openjdk.java.net/pipermail/core-libs-dev/2011-December/008686.h… And people in that discussion are also in cc list. David mentioned it might be simple and better to change the implementation note in last mail of that discussion, however the code change is simple too. There is a test case in the previous discussion. It is not included in the webrev, because the testcase is heavily implementation dependent. I will add it if it is requested. Also paste the testcase here: //////////////////////////////////////////////////////////// import java.util.Map; import java.util.concurrent.ConcurrentHashMap; public class CollectionToArrayTest { static volatile Map<String, String> map = new TConcurrentHashMap<String, String>(); static volatile boolean gosleep = true; static class TConcurrentHashMap<K, V> extends ConcurrentHashMap<K, V> { public int size() { int oldresult = super.size(); System.out.println("map size before concurrent remove is " + oldresult); while (gosleep) { try { // Make sure the map is modified during toArray is called, // between getsize and being iterated. Thread.sleep(1000); // System.out.println("size called, size is " + oldresult + // " take a sleep to make sure the element is deleted before size is returned."); } catch (Exception e) { } } return oldresult; } } static class ToArrayThread implements Runnable { public void run() { for (int i = 0; i < 5; i++) { String str = Integer.toString(i); map.put(str, str); } String[] buffer = new String[4]; String[] strings = map.values().toArray(buffer); // System.out.println("length is " + strings.length); if (strings.length <= buffer.length) { System.out.println("given array size is " + buffer.length + " \nreturned array size is " + strings.length + ", \nbuffer should be used according to spec. Is buffer used : " + (strings == buffer)); } } } static class RemoveThread implements Runnable { public void run() { String str = Integer.toString(0); map.remove(str); gosleep = false; } } public static void main(String args[]) { CollectionToArrayTest app = new CollectionToArrayTest(); app.test_concurrentRemove(); } public void test_concurrentRemove() { System.out.println("//////////////////////////////////////////////\n" + "The spec says if the given array is large\n " + "enough to hold all elements, the given array\n" + "should be returned by toArray. This \n" + "testcase checks this case. \n" + "//////////////////////////////////////////////"); Thread[] threads = new Thread[2]; threads[0] = new Thread(new ToArrayThread()); threads[1] = new Thread(new RemoveThread()); threads[0].start(); try { // Take a sleep to make sure toArray is already called. Thread.sleep(1200); } catch (Exception e) { } threads[1].start(); } } //////////////////////////////////////////////// -- Best Regards, Sean Chou

9 55

RFR 6963841: java/util/concurrent/Phaser/Basic.java fails intermittently
by Chris Hegarty 03 Apr '12

03 Apr '12

David, Doug, This test has been failing intermittently on jdk7u-dev and jdk8 for a while now. It only appears to fail when run in our internal build/test system (JPRT). I believe the cause of the failure to be simply that the machines the test is run on are too slow, or very busy, and the defensive timeout in the test are not large enough to handle this. The solution is to increase these timeout (similar to other tests in the concurrency area that we increased the timeouts for too). Webrev: http://cr.openjdk.java.net/~chegar/6963841/webrev.00/webrev/ Thanks, -Chris.

5 12

RFR: 7134701 [macosx] Support legacy native library names
by Michael McMahon 01 Apr '12

01 Apr '12

JDK 8 fix for this issue. For readers not familiar with Mac OS, this is to fix an issue which Apple's JDK 6 supports, but we broke in the jdk 7 initial port. The preferred native library file suffix is .dylib on Mac, but some legacy libraries use the suffix .jnilib. Currently openjdk on mac does not recognise the .jnilib suffix. This change is to restore that behavior http://cr.openjdk.java.net/~michaelm/7134701/webrev.1/ If this change is accepted, we will look for approval to make the same change in 7u4. Thanks, Michael.

5 17

hg: jdk8/tl/jdk: 35 new changesets
by lana.steuck＠oracle.com 31 Mar '12

31 Mar '12

Changeset: fb3a2cafc230 Author: andrew Date: 2012-03-08 14:04 +0000 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/fb3a2cafc230 7150392: Linux build breaks with GCC 4.7 due to unrecognized option Summary: Remove -mimpure-text option. Reviewed-by: ohair, dholmes, phh, andrew Contributed-by: Deepak Bhole <dbhole(a)redhat.com> ! make/common/shared/Compiler-gcc.gmk ! src/share/demo/jvmti/compiledMethodLoad/sample.makefile.txt ! src/share/demo/jvmti/gctest/sample.makefile.txt ! src/share/demo/jvmti/heapTracker/sample.makefile.txt ! src/share/demo/jvmti/heapViewer/sample.makefile.txt ! src/share/demo/jvmti/hprof/sample.makefile.txt ! src/share/demo/jvmti/index.html ! src/share/demo/jvmti/java_crw_demo/sample.makefile.txt ! src/share/demo/jvmti/minst/sample.makefile.txt ! src/share/demo/jvmti/mtrace/sample.makefile.txt ! src/share/demo/jvmti/versionCheck/sample.makefile.txt ! src/share/demo/jvmti/waiters/sample.makefile.txt Changeset: d8e197124943 Author: ohair Date: 2012-03-12 16:41 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/d8e197124943 Merge Changeset: cdbb33303ea3 Author: katleman Date: 2012-03-14 13:50 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/cdbb33303ea3 Merge Changeset: c373b5baa1e9 Author: katleman Date: 2012-03-15 15:17 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/c373b5baa1e9 Added tag jdk8-b30 for changeset cdbb33303ea3 ! .hgtags Changeset: 9288904e0027 Author: mfang Date: 2012-02-08 10:18 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/9288904e0027 Merge - test/tools/launcher/ChangeDataModel.sh - test/tools/launcher/CreatePlatformFile.java - test/tools/launcher/SomeException.java - test/tools/launcher/UnicodeCleanup.java - test/tools/launcher/UnicodeTest.sh - test/tools/launcher/deleteI18n.sh - test/tools/launcher/i18nTest.sh - test/tools/launcher/unresolvedExceptions.sh Changeset: f57d54ebae28 Author: mfang Date: 2012-02-09 10:16 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/f57d54ebae28 Merge Changeset: 7e2d6cb84cbd Author: mfang Date: 2012-02-09 16:12 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/7e2d6cb84cbd Merge Changeset: 76b1f7e945fc Author: mfang Date: 2012-02-17 10:18 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/76b1f7e945fc Merge Changeset: e4f3f5ceb082 Author: mfang Date: 2012-02-22 10:17 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/e4f3f5ceb082 Merge - src/linux/doc/man/apt.1 - src/linux/doc/man/ja/apt.1 - src/share/classes/com/sun/management/DiagnosticCommandArgumentInfo.java - src/share/classes/com/sun/management/DiagnosticCommandInfo.java - src/share/classes/sun/nio/ch/SctpMessageInfoImpl.java - src/share/classes/sun/nio/ch/SctpStdSocketOption.java - src/solaris/classes/sun/nio/ch/SctpAssocChange.java - src/solaris/classes/sun/nio/ch/SctpAssociationImpl.java - src/solaris/classes/sun/nio/ch/SctpChannelImpl.java - src/solaris/classes/sun/nio/ch/SctpMultiChannelImpl.java - src/solaris/classes/sun/nio/ch/SctpNet.java - src/solaris/classes/sun/nio/ch/SctpNotification.java - src/solaris/classes/sun/nio/ch/SctpPeerAddrChange.java - src/solaris/classes/sun/nio/ch/SctpResultContainer.java - src/solaris/classes/sun/nio/ch/SctpSendFailed.java - src/solaris/classes/sun/nio/ch/SctpServerChannelImpl.java - src/solaris/classes/sun/nio/ch/SctpShutdown.java - src/solaris/doc/sun/man/man1/apt.1 - src/solaris/doc/sun/man/man1/ja/apt.1 - src/solaris/native/sun/nio/ch/Sctp.h - src/solaris/native/sun/nio/ch/SctpChannelImpl.c - src/solaris/native/sun/nio/ch/SctpNet.c - src/solaris/native/sun/nio/ch/SctpServerChannelImpl.c - src/windows/classes/sun/nio/ch/SctpChannelImpl.java - src/windows/classes/sun/nio/ch/SctpMultiChannelImpl.java - src/windows/classes/sun/nio/ch/SctpServerChannelImpl.java - test/com/sun/management/HotSpotDiagnosticMXBean/ExecuteDiagnosticCommand.java - test/com/sun/management/HotSpotDiagnosticMXBean/GetDiagnosticCommandInfo.java - test/com/sun/management/HotSpotDiagnosticMXBean/GetDiagnosticCommands.java Changeset: 87d43598a05c Author: mfang Date: 2012-02-25 10:19 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/87d43598a05c Merge Changeset: 71b0a726d54f Author: mfang Date: 2012-02-29 10:18 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/71b0a726d54f Merge Changeset: 091141531881 Author: mfang Date: 2012-03-02 10:19 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/091141531881 Merge Changeset: 8532efc112ea Author: mfang Date: 2012-03-07 10:18 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/8532efc112ea Merge Changeset: 9ade23505c96 Author: mfang Date: 2012-03-09 10:23 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/9ade23505c96 Merge Changeset: 1f2f7e37f0a9 Author: mfang Date: 2012-03-14 10:25 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/1f2f7e37f0a9 Merge - test/java/io/File/isDirectory/Applet.java Changeset: 2e7ecc3e053e Author: yhuang Date: 2012-03-14 23:07 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/2e7ecc3e053e 7085757: Currency Data: ISO 4217 Amendment 152 Reviewed-by: naoto ! src/share/classes/java/util/CurrencyData.properties ! src/share/classes/java/util/LocaleISOData.java ! src/share/classes/sun/util/resources/CurrencyNames.properties ! src/share/classes/sun/util/resources/LocaleNames.properties ! test/java/util/Currency/tablea1.txt ! test/java/util/Locale/LocaleTest.java ! test/sun/text/resources/LocaleData ! test/sun/text/resources/LocaleDataTest.java Changeset: f7963e954f24 Author: yhuang Date: 2012-03-14 23:19 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/f7963e954f24 Merge - test/java/io/File/isDirectory/Applet.java Changeset: f7dedbbb52eb Author: mfang Date: 2012-03-15 16:04 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/f7dedbbb52eb Merge Changeset: 27f0c08c427c Author: katleman Date: 2012-03-21 12:18 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/27f0c08c427c Merge Changeset: 97cf70c92ee6 Author: katleman Date: 2012-03-22 12:41 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/97cf70c92ee6 Added tag jdk8-b31 for changeset 27f0c08c427c ! .hgtags Changeset: b1af41b86f9f Author: littlee Date: 2012-03-12 13:30 +0800 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/b1af41b86f9f 7151427: Fix the potential memory leak in error handling code in X11SurfaceData.c Summary: Free the memory in the error handling code. Reviewed-by: prr, jgodinez, bae Contributed-by: Sean Chou <zhouyx(a)linux.vnet.ibm.com> ! src/solaris/native/sun/java2d/x11/X11SurfaceData.c Changeset: ba0afaab6ae8 Author: lana Date: 2012-03-14 08:56 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/ba0afaab6ae8 Merge ! src/solaris/native/sun/java2d/x11/X11SurfaceData.c - test/java/io/File/isDirectory/Applet.java Changeset: 8fcaac9ef213 Author: lana Date: 2012-03-21 13:36 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/8fcaac9ef213 Merge Changeset: 84ba9688893f Author: rupashka Date: 2012-03-13 13:18 +0200 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/84ba9688893f 7027139: getFirstIndex() does not return the first index that has changed Reviewed-by: alexp ! src/share/classes/javax/swing/DefaultListSelectionModel.java + test/javax/swing/JTable/7027139/bug7027139.java Changeset: b63c8c853eaa Author: lana Date: 2012-03-13 19:58 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/b63c8c853eaa Merge - test/java/io/File/isDirectory/Applet.java Changeset: 255dd9eddc10 Author: bagiras Date: 2012-03-19 21:22 +0400 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/255dd9eddc10 7128738: dragged dialog freezes system on dispose Reviewed-by: anthony ! src/windows/native/sun/windows/awt_Component.cpp + test/java/awt/Frame/WindowDragTest/WindowDragTest.java Changeset: fc85aeb56fa4 Author: dcherepanov Date: 2012-03-21 14:31 +0400 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/fc85aeb56fa4 7150345: [macosx] Can't type into applets Reviewed-by: ant ! src/macosx/classes/sun/lwawt/LWToolkit.java ! src/macosx/classes/sun/lwawt/LWWindowPeer.java ! src/macosx/classes/sun/lwawt/PlatformWindow.java ! src/macosx/classes/sun/lwawt/macosx/CEmbeddedFrame.java ! src/macosx/classes/sun/lwawt/macosx/CPlatformEmbeddedFrame.java ! src/macosx/classes/sun/lwawt/macosx/CPlatformWindow.java ! src/macosx/classes/sun/lwawt/macosx/LWCToolkit.java Changeset: 2dbcbe945cc3 Author: dcherepanov Date: 2012-03-21 15:25 +0400 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/2dbcbe945cc3 7150349: [macosx] Applets attempting to show popup menus activate the applet process Reviewed-by: ant ! src/macosx/classes/sun/lwawt/macosx/CPlatformWindow.java ! src/macosx/classes/sun/lwawt/macosx/CWrapper.java ! src/macosx/native/sun/awt/AWTWindow.m ! src/macosx/native/sun/awt/CWrapper.m ! src/macosx/native/sun/awt/LWCToolkit.m Changeset: 9189ec1bb33a Author: kizune Date: 2012-03-21 17:12 +0400 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/9189ec1bb33a 7144063: [macosx] Swing JMenu mnemonic doesn't work; hint misleading; cross symbol typed Reviewed-by: leonidr, skovatch, swingler ! src/macosx/native/sun/awt/AWTView.m ! src/macosx/native/sun/awt/OSVersion.m Changeset: e7cc6c5a858c Author: lana Date: 2012-03-21 13:37 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/e7cc6c5a858c Merge Changeset: 1238b2679374 Author: lana Date: 2012-03-21 13:38 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/1238b2679374 Merge - test/java/io/File/isDirectory/Applet.html - test/sun/nio/cs/OLD/TestX11CS.java Changeset: ddfe5562f61f Author: lana Date: 2012-03-26 17:31 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/ddfe5562f61f Merge - test/java/io/File/isDirectory/Applet.html - test/sun/nio/cs/OLD/TestX11CS.java Changeset: 78cea258caab Author: cl Date: 2012-03-29 13:02 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/78cea258caab Added tag jdk8-b32 for changeset ddfe5562f61f ! .hgtags Changeset: d433116b7812 Author: lana Date: 2012-03-30 16:57 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/d433116b7812 Merge Changeset: f69b6363ca65 Author: lana Date: 2012-03-31 08:43 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jdk/rev/f69b6363ca65 Merge

1 0

hg: jdk8/tl/hotspot: 45 new changesets
by lana.steuck＠oracle.com 31 Mar '12

31 Mar '12

Changeset: 02ba95965d78 Author: katleman Date: 2012-03-15 15:15 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/02ba95965d78 Added tag jdk8-b30 for changeset d61761bf3050 ! .hgtags Changeset: 257d67351eae Author: amurillo Date: 2012-03-02 16:56 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/257d67351eae 7150327: new hotspot build - hs24-b03 Reviewed-by: jcoomes ! make/hotspot_version Changeset: 2d503de963b3 Author: mgerdin Date: 2012-02-23 14:58 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/2d503de963b3 7148152: Add whitebox testing API to HotSpot Summary: Add an internal testing API to HotSpot to enable more targeted testing of vm functionality Reviewed-by: phh, dholmes ! make/Makefile ! make/bsd/makefiles/defs.make ! make/bsd/makefiles/vm.make + make/bsd/makefiles/wb.make ! make/jprt.properties ! make/linux/makefiles/defs.make ! make/linux/makefiles/vm.make + make/linux/makefiles/wb.make ! make/solaris/makefiles/defs.make ! make/solaris/makefiles/vm.make + make/solaris/makefiles/wb.make ! make/windows/makefiles/debug.make ! make/windows/makefiles/defs.make ! make/windows/makefiles/fastdebug.make ! make/windows/makefiles/product.make + make/windows/makefiles/wb.make + src/share/tools/whitebox/sun/hotspot/WhiteBox.java ! src/share/vm/prims/nativeLookup.cpp + src/share/vm/prims/whitebox.cpp + src/share/vm/prims/whitebox.hpp ! src/share/vm/runtime/arguments.cpp ! src/share/vm/runtime/globals.hpp ! src/share/vm/utilities/vmError.cpp ! test/Makefile + test/sanity/WBApi.java Changeset: b5290bf0a9e4 Author: johnc Date: 2012-03-02 10:36 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/b5290bf0a9e4 7147806: G1: Crash in vm bootstrap when running with -XX:+UseG1GC -XX:-UsePerfData Summary: Update generation and collector counters only if UsePerfData is enabled. Reviewed-by: iveresov, tonyp ! src/share/vm/gc_implementation/g1/g1MonitoringSupport.cpp Changeset: e4624321d36a Author: jcoomes Date: 2012-03-03 12:36 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/e4624321d36a 7150454: add release jdk7u4 to jprt.properties Reviewed-by: ohair, never ! make/jprt.properties Changeset: b12a322de178 Author: jcoomes Date: 2012-03-03 12:45 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/b12a322de178 7150899: remove unused build.targets lines from jprt.properties Reviewed-by: ohair ! make/jprt.properties Changeset: 22d276ade3e1 Author: brutisso Date: 2012-03-05 22:34 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/22d276ade3e1 Merge ! make/windows/makefiles/defs.make Changeset: 4e0a9aaec0e9 Author: dcubed Date: 2012-03-07 14:58 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/4e0a9aaec0e9 7152031: Hotspot needs updated xawt path [macosx] Summary: Update to use the right path on MacOS X. Reviewed-by: michaelm, jcoomes, amurillo ! src/os/bsd/vm/os_bsd.cpp Changeset: fdf4deca44ec Author: dcubed Date: 2012-03-08 06:33 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/fdf4deca44ec 7152206: anti-delta the fix for 7152031 Summary: Backout the fix for 7152031; the real bug to be fixed in jdk repo. Reviewed-by: michaelm ! src/os/bsd/vm/os_bsd.cpp Changeset: ff29ce866f23 Author: dsamersoff Date: 2012-03-01 12:41 +0400 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/ff29ce866f23 7118280: The gbyc00102 JCK7 test causes an assert in JVM 7.0 fastdebug mode Summary: Assert doesn't respect invokedynamic opcode Reviewed-by: dcubed, phh ! src/share/vm/prims/jvmtiClassFileReconstituter.cpp Changeset: 8a48c2906f91 Author: coleenp Date: 2012-03-05 14:19 -0500 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/8a48c2906f91 7150046: SIGILL on sparcv9 fastdebug Summary: Breakpoint needs to do 64-bit compare for pointers on sparcv9 Reviewed-by: coleenp, never Contributed-by: dean.long(a)oracle.com ! src/cpu/sparc/vm/assembler_sparc.hpp ! src/cpu/sparc/vm/cppInterpreter_sparc.cpp ! src/cpu/sparc/vm/sharedRuntime_sparc.cpp ! src/cpu/sparc/vm/templateInterpreter_sparc.cpp Changeset: d59a6302465a Author: acorn Date: 2012-03-09 00:28 -0500 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/d59a6302465a Merge Changeset: 4fabc16dc5bf Author: roland Date: 2012-03-02 16:04 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/4fabc16dc5bf 6910464: Lookupswitch and Tableswitch default branches not recognized as safepoints Summary: C1 does not recognize the default branch of a lookupswitch or tableswitch bytecode to be a safepoint if backward. Reviewed-by: kvn, never ! src/share/vm/c1/c1_GraphBuilder.cpp Changeset: e5f73be4c7f1 Author: never Date: 2012-03-02 13:13 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/e5f73be4c7f1 Merge ! src/share/vm/c1/c1_GraphBuilder.cpp Changeset: b40ac3579043 Author: never Date: 2012-03-05 18:10 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/b40ac3579043 6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline. Summary: Allow fallback to non-intrinsic inline case Reviewed-by: kvn, jrose, never Contributed-by: nils.eliasson(a)oracle.com ! src/share/vm/opto/compile.hpp ! src/share/vm/opto/doCall.cpp ! src/share/vm/opto/library_call.cpp Changeset: 541c4a5e7b88 Author: never Date: 2012-03-06 16:32 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/541c4a5e7b88 7150390: JFR test crashed on assert(_jni_lock_count == count) failed: must be equal Reviewed-by: dholmes, minqi, kvn, coleenp ! src/share/vm/runtime/safepoint.cpp ! src/share/vm/runtime/thread.cpp ! src/share/vm/runtime/thread.hpp Changeset: d8b13355c500 Author: never Date: 2012-03-09 08:34 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/d8b13355c500 Merge Changeset: dfae0140457c Author: amurillo Date: 2012-03-09 13:08 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/dfae0140457c Merge Changeset: 2e3ff1aa30f5 Author: amurillo Date: 2012-03-09 13:08 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/2e3ff1aa30f5 Added tag hs24-b03 for changeset dfae0140457c ! .hgtags Changeset: fde683df4c27 Author: amurillo Date: 2012-03-09 13:34 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/fde683df4c27 7152700: new hotspot build - hs24-b04 Reviewed-by: jcoomes ! make/hotspot_version Changeset: 61b82be3b1ff Author: never Date: 2012-03-12 15:28 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/61b82be3b1ff 7152957: VM crashes with assert(false) failed: bad AD file Reviewed-by: kvn, never Contributed-by: nils.eliasson(a)oracle.com ! src/cpu/sparc/vm/sparc.ad ! src/cpu/x86/vm/x86_32.ad ! src/cpu/x86/vm/x86_64.ad ! src/share/vm/opto/library_call.cpp Changeset: a735aec54ea4 Author: sspitsyn Date: 2012-03-14 20:06 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/a735aec54ea4 7123170: JCK vm/jvmti/ResourceExhausted/resexh001/resexh00101/ tests fails since 7u4 b02 Summary: The JVMTI ResourceExhausted events must be generated in all places where OOME is thrown Reviewed-by: acorn, coleenp, dcubed, dholmes, dsamersoff, jwilhelm, tonyp Contributed-by: serguei.spitsyn(a)oracle.com ! src/share/vm/oops/arrayKlass.cpp ! src/share/vm/oops/instanceKlass.cpp ! src/share/vm/oops/objArrayKlass.cpp ! src/share/vm/oops/typeArrayKlass.cpp ! src/share/vm/prims/jvmtiExport.hpp Changeset: 970cbbba54b0 Author: jmelvin Date: 2012-03-16 15:13 -0400 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/970cbbba54b0 7130404: [macosx] "os.arch" value should be "x86_64" for compatibility with Apple JDK6 Summary: On Mac OS X, align system property "os.arch" with Apple legacy JDKs. Also, improve os.name string matching by using contains() method instead of .startsWith(). Reviewed-by: dcubed, phh, ohair, katleman Contributed-by: james.melvin(a)oracle.com ! agent/src/share/classes/sun/jvm/hotspot/jdi/ConnectorImpl.java ! agent/src/share/classes/sun/jvm/hotspot/utilities/PlatformInfo.java Changeset: cf956638b844 Author: iveresov Date: 2012-03-12 13:12 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/cf956638b844 7151089: PS NUMA: NUMA allocator should not attempt to free pages when using SHM large pages Summary: Don't attempt to uncommit SHM-based large pages Reviewed-by: kvn ! src/os/linux/vm/os_linux.cpp Changeset: 2c0751569716 Author: brutisso Date: 2012-03-13 21:12 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/2c0751569716 7152954: G1: Native memory leak during full GCs Summary: Add destructor to TruncatedSeq and call delete when necessary Reviewed-by: johnc, tonyp ! src/share/vm/gc_implementation/g1/survRateGroup.cpp ! src/share/vm/utilities/numberSeq.cpp ! src/share/vm/utilities/numberSeq.hpp Changeset: c7a555a9449a Author: brutisso Date: 2012-03-14 12:49 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/c7a555a9449a 7068625: Testing 8 bytes of card table entries at a time speeds up card-scanning Summary: Check clean words instead of clean bytes Reviewed-by: jcoomes, jmasa, jwilhelm, ysr Contributed-by: alexey.ragozin(a)gmail.com ! src/share/vm/memory/cardTableModRefBS.hpp ! src/share/vm/memory/cardTableRS.cpp ! src/share/vm/memory/cardTableRS.hpp Changeset: f96bddf3d3f3 Author: jcoomes Date: 2012-03-16 23:45 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/f96bddf3d3f3 Merge Changeset: f4767e53d6e0 Author: amurillo Date: 2012-03-17 00:10 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/f4767e53d6e0 Merge ! .hgtags Changeset: 0cd147eaa673 Author: amurillo Date: 2012-03-17 00:10 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/0cd147eaa673 Added tag hs24-b04 for changeset f4767e53d6e0 ! .hgtags Changeset: bbdc75c217e7 Author: katleman Date: 2012-03-22 12:41 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/bbdc75c217e7 Added tag jdk8-b31 for changeset 0cd147eaa673 ! .hgtags Changeset: a142c661f6b1 Author: amurillo Date: 2012-03-17 00:27 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/a142c661f6b1 7154706: new hotspot build - hs23-b05 Reviewed-by: jcoomes ! make/hotspot_version Changeset: 77591ef8983a Author: sla Date: 2012-03-19 20:13 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/77591ef8983a 7152800: All tests using the attach API fail with "well-known file is not secure" on Mac OS X Summary: Create well-known file with effective group of the current process Reviewed-by: kamg, dcubed ! src/os/bsd/vm/attachListener_bsd.cpp Changeset: 3d7ea1dbe0de Author: erikj Date: 2012-03-19 10:09 +0100 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/3d7ea1dbe0de 7141246: build-infra merge: Introduce new JVM_VARIANT* to control which kind of jvm gets built Reviewed-by: dholmes, ohair ! make/Makefile ! make/bsd/Makefile ! make/bsd/makefiles/buildtree.make ! make/bsd/makefiles/defs.make ! make/bsd/makefiles/gcc.make ! make/bsd/makefiles/vm.make ! make/defs.make ! make/linux/Makefile ! make/linux/makefiles/buildtree.make ! make/linux/makefiles/defs.make ! make/linux/makefiles/gcc.make ! make/linux/makefiles/vm.make ! make/solaris/makefiles/defs.make ! make/windows/makefiles/defs.make Changeset: 80fe40862b02 Author: jmelvin Date: 2012-03-20 16:46 -0400 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/80fe40862b02 7144328: Improper commandlines for -XX:+-UnlockCommercialFeatures require proper warning/error messages Summary: Provide custom error messages for locked commercial feature options which are not first unlocked. Reviewed-by: dcubed, jcoomes, kamg Contributed-by: james.melvin(a)oracle.com ! src/share/vm/runtime/arguments.cpp ! src/share/vm/runtime/globals.cpp ! src/share/vm/runtime/globals.hpp ! src/share/vm/runtime/globals_ext.hpp Changeset: ee138854b3a6 Author: kvn Date: 2012-03-12 10:46 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/ee138854b3a6 7147744: CTW: assert(false) failed: infinite EA connection graph build Summary: rewrote Connection graph construction code in EA to reduce time spent there. Reviewed-by: never ! src/share/vm/opto/c2_globals.hpp ! src/share/vm/opto/callnode.cpp ! src/share/vm/opto/callnode.hpp ! src/share/vm/opto/compile.cpp ! src/share/vm/opto/escape.cpp ! src/share/vm/opto/escape.hpp ! src/share/vm/opto/phase.cpp ! src/share/vm/opto/phase.hpp ! src/share/vm/utilities/growableArray.hpp Changeset: 2537ebc321d4 Author: never Date: 2012-03-12 19:54 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/2537ebc321d4 Merge Changeset: 0f4014d7731b Author: never Date: 2012-03-13 10:03 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/0f4014d7731b 7152961: InlineTree::should_not_inline may exit prematurely Reviewed-by: kvn, never Contributed-by: nils.eliasson(a)oracle.com ! src/share/vm/opto/bytecodeInfo.cpp Changeset: dbd21c7c833f Author: never Date: 2012-03-13 20:54 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/dbd21c7c833f 7152955: print_method crashes with null root Reviewed-by: kvn, never Contributed-by: nils.eliasson(a)oracle.com ! src/share/vm/opto/compile.cpp Changeset: 56ee89841dc4 Author: iveresov Date: 2012-03-15 16:38 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/56ee89841dc4 7154333: JVM fails to start if -XX:+AggressiveHeap is set Summary: Don't set CompilationPolicyChoice with AggressiveHeap Reviewed-by: never ! src/share/vm/runtime/arguments.cpp Changeset: 1a11548571e8 Author: jcoomes Date: 2012-03-16 23:52 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/1a11548571e8 Merge Changeset: ed4c92f54c2d Author: kvn Date: 2012-03-20 13:10 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/ed4c92f54c2d 7154997: assert(false) failed: not G1 barrier raw StoreP Summary: Skip only G1 cases and explicitly set global escape state in unsafe cases. Reviewed-by: never ! src/share/vm/opto/escape.cpp Changeset: ad412114302a Author: never Date: 2012-03-22 13:54 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/ad412114302a Merge ! src/share/vm/runtime/arguments.cpp Changeset: 27863e4586de Author: jcoomes Date: 2012-03-23 21:31 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/27863e4586de Merge Changeset: 25410a347ebb Author: jcoomes Date: 2012-03-23 21:31 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/25410a347ebb Added tag hs24-b05 for changeset 27863e4586de ! .hgtags Changeset: 39e5c6153285 Author: cl Date: 2012-03-29 13:02 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/hotspot/rev/39e5c6153285 Added tag jdk8-b32 for changeset 25410a347ebb ! .hgtags

1 0

hg: jdk8/tl/jaxws: 6 new changesets
by lana.steuck＠oracle.com 31 Mar '12

31 Mar '12

Changeset: c46e0b6e3f98 Author: ohair Date: 2012-03-08 18:20 -0800 URL: http://hg.openjdk.java.net/jdk8/tl/jaxws/rev/c46e0b6e3f98 7152425: Fix copyright notices on 12 files in jaxws Reviewed-by: mbykov ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/EnvelopeStyle.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/EnvelopeStyleFeature.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/databinding/Databinding.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/databinding/DatabindingFactory.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/databinding/DatabindingMode.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/databinding/DatabindingModeFeature.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/databinding/JavaCallInfo.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/message/ContentType.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/message/DistributedPropertySet.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/message/MessageContext.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/message/MessageContextFactory.java ! src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/ws/message/PropertySet.java Changeset: df8e8071a413 Author: ohair Date: 2012-03-12 16:40 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jaxws/rev/df8e8071a413 Merge Changeset: 6882b10e85d6 Author: katleman Date: 2012-03-14 13:49 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jaxws/rev/6882b10e85d6 Merge Changeset: 4c41c6d0e15d Author: katleman Date: 2012-03-15 15:16 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jaxws/rev/4c41c6d0e15d Added tag jdk8-b30 for changeset 6882b10e85d6 ! .hgtags Changeset: 017a7dbfaa92 Author: katleman Date: 2012-03-22 12:41 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jaxws/rev/017a7dbfaa92 Added tag jdk8-b31 for changeset 4c41c6d0e15d ! .hgtags Changeset: ea80b2388dce Author: cl Date: 2012-03-29 13:02 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/jaxws/rev/ea80b2388dce Added tag jdk8-b32 for changeset 017a7dbfaa92 ! .hgtags

1 0

hg: jdk8/tl/langtools: 6 new changesets
by lana.steuck＠oracle.com 31 Mar '12

31 Mar '12

Changeset: b28cfbe7e8b1 Author: katleman Date: 2012-03-15 15:18 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/langtools/rev/b28cfbe7e8b1 Added tag jdk8-b30 for changeset 08a3425f39f8 ! .hgtags Changeset: ebfe9b8ce039 Author: katleman Date: 2012-03-22 12:41 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/langtools/rev/ebfe9b8ce039 Added tag jdk8-b31 for changeset b28cfbe7e8b1 ! .hgtags Changeset: 6b473c9ebf1e Author: lana Date: 2012-03-21 13:39 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/langtools/rev/6b473c9ebf1e Merge Changeset: be069d72dde2 Author: lana Date: 2012-03-26 17:32 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/langtools/rev/be069d72dde2 Merge Changeset: 46831c72b7f6 Author: cl Date: 2012-03-29 13:02 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/langtools/rev/46831c72b7f6 Added tag jdk8-b32 for changeset be069d72dde2 ! .hgtags Changeset: 01e7924ea479 Author: lana Date: 2012-03-30 16:58 -0700 URL: http://hg.openjdk.java.net/jdk8/tl/langtools/rev/01e7924ea479 Merge

1 0