Mercurial > hg > truffle
annotate test/compiler/6724218/Test.java @ 3293:1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
Summary: In G1 heap verification, we no longer scan perm to G1-collected heap refs as part of process_strong_roots() but rather in a separate explicit oop iteration over the perm gen. This preserves the original perm card-marks. Added a new assertion in younger_refs_iterate() to catch a simple subcase where the user may have forgotten a prior save_marks() call, as happened in the case of G1's attempt to iterate perm to G1 refs when verifying the heap before exit. The assert was deliberately weakened for ParNew+CMS and will be fixed for that combination in a future CR. Also made some (non-G1) cleanups related to code and comments obsoleted by the migration of Symbols to the native heap.
Reviewed-by: iveresov, jmasa, tonyp
author | ysr |
---|---|
date | Tue, 26 Apr 2011 21:17:24 -0700 |
parents | c18cbe5936b8 |
children |
rev | line source |
---|---|
247 | 1 /* |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
247
diff
changeset
|
2 * Copyright (c) 2008, Oracle and/or its affiliates. All rights reserved. |
247 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
247
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
247
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
247
diff
changeset
|
21 * questions. |
247 | 22 */ |
23 | |
24 /* | |
25 * @test | |
26 * @bug 6724218 | |
27 * @summary Fix raise_LCA_above_marks() early termination | |
28 * @run main/othervm -Xbatch -XX:CompileCommand=exclude,Test.update Test | |
29 */ | |
30 | |
31 public class Test { | |
32 Test next = null; | |
33 Object value = null; | |
34 | |
35 static boolean _closed = false; | |
36 static int size = 0; | |
37 static Test list = null; | |
38 static int cache_size = 0; | |
39 static Test cache = null; | |
40 | |
41 Object get(int i) { | |
42 Test t = list; | |
43 list = t.next; | |
44 size -= 1; | |
45 Object o = t.value; | |
46 if (i > 0) { | |
47 t.next = cache; | |
48 t.value = null; | |
49 cache = t; | |
50 cache_size = +1; | |
51 } | |
52 return o; | |
53 } | |
54 | |
55 void update() { | |
56 // Exclude compilation of this one. | |
57 if (size == 0) { | |
58 Test t; | |
59 if (cache_size > 0) { | |
60 t = cache; | |
61 cache = t.next; | |
62 cache_size = -1; | |
63 } else { | |
64 t = new Test(); | |
65 } | |
66 t.value = new Object(); | |
67 t.next = list; | |
68 list = t; | |
69 size += 1; | |
70 } | |
71 } | |
72 | |
73 synchronized Object test(int i) { | |
74 while (true) { | |
75 if (_closed) { | |
76 return null; | |
77 } else if (size > 0) { | |
78 return get(i); | |
79 } | |
80 update(); | |
81 } | |
82 } | |
83 | |
84 public static void main(String argv[]) throws Exception { | |
85 Test t = new Test(); | |
86 int lim = 500000; | |
87 Object o; | |
88 for (int j = 0; j < lim; j++) { | |
89 o = t.test(j&1); | |
90 if (o == null) { | |
91 throw new Exception("*** Failed on iteration " + j); | |
92 } | |
93 if ((j&1) == 0) { | |
94 t.update(); | |
95 } | |
96 } | |
97 } | |
98 } |