File: TestDisposerRace.java

package info (click to toggle)
openjdk-26 26~12ea-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 826,896 kB
  • sloc: java: 5,602,163; cpp: 1,336,664; xml: 1,321,153; ansic: 488,421; asm: 404,003; objc: 21,113; sh: 15,220; javascript: 13,281; python: 8,323; makefile: 2,519; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (152 lines) | stat: -rw-r--r-- 5,005 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
/*
 * Copyright (c) 2022, JetBrains s.r.o.. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
import java.util.LinkedList;
import java.util.List;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.function.Supplier;
import javax.swing.SwingUtilities;

import sun.java2d.Disposer;
import sun.java2d.DisposerRecord;

/**
 * @test
 * @bug 8289208
 * @summary Verifies Disposer robustness in a multi-threaded environment.
 * @run main/othervm -Xmx128m TestDisposerRace
 * @modules java.desktop/sun.java2d
 */
public final class TestDisposerRace {
    private static final AtomicInteger recordsCount = new AtomicInteger();
    private static volatile boolean disposerDone = false;

    private static final String KO_OVERFLOW = "Some records have not been disposed!";
    private static final String KO_UNDERFLOW = "Disposed more records than were added!";

    public static void main(String[] args) throws Exception {
        new TestDisposerRace().run();

        checkRecordsCountIsSane();
        if (recordsCount.get() > 0) {
            System.err.println(KO_OVERFLOW); // In case the next line fails to allocate due to OOME
            throw new RuntimeException("Some records (" + recordsCount + ") have not been disposed");
        }
    }

    interface ThrowingRunnable<E extends Exception> {
        void run() throws E;
    }

    TestDisposerRace() {
        addRecordsToDisposer(30_000);
    }

    void run() throws Exception {
        generateOOME();
        for (int i = 0; i < 1000; ++i) {
            retryOnOOME(() -> SwingUtilities.invokeAndWait(Disposer::pollRemove));

            // Adding records will race with the diposer trying to remove them
            if (i % 10 == 0)
                addRecordsToDisposer(1000);
        }

        retryOnOOME(() -> Disposer.addObjectRecord(new Object(), new FinalDisposerRecord()));

        while (!disposerDone) {
             generateOOME();
        }
    }

    private static void checkRecordsCountIsSane() {
        if (recordsCount.get() < 0) {
            throw new RuntimeException(KO_UNDERFLOW);
        }
    }

    private static <T> T retryOnOOME(Supplier<T> allocator) {
        for(;;) {
            try {
                return allocator.get();
            } catch (OutOfMemoryError ignored1) {
                try {
                    Thread.sleep(1); // Give GC a little chance to run
                } catch (InterruptedException ignored2) {}
            }
        }
    }

    private static <E extends Exception> void retryOnOOME(ThrowingRunnable<E> tr) throws E {
        for(;;) {
            try {
                tr.run();
                break;
            } catch (OutOfMemoryError ignored1) {
                try {
                    Thread.sleep(1); // Give GC a little chance to run
                } catch (InterruptedException ignored2) {}
            }
        }
    }

    private void addRecordsToDisposer(int count) {
        checkRecordsCountIsSane();

        MyDisposerRecord disposerRecord = retryOnOOME(MyDisposerRecord::new);

        while(count > 0) {
            recordsCount.incrementAndGet(); // pre-add to make sure it doesn't go negative
            var o = retryOnOOME(Object::new);
            retryOnOOME(() -> Disposer.addObjectRecord(o, disposerRecord));
            --count;
        }
    }

    class MyDisposerRecord implements DisposerRecord {
        public void dispose() {
            recordsCount.decrementAndGet();
        }
    }

    class FinalDisposerRecord implements DisposerRecord {
        public void dispose() {
            disposerDone = true;
        }
    }

    private static void giveGCAChance() {
        try {
            Thread.sleep(2000);
        } catch (InterruptedException ignored) {}
    }

    private static void generateOOME() throws Exception {
        try {
            final List<Object> leak = new LinkedList<>();
            while (true) {
                leak.add(new byte[1024 * 1024]);
            }
        } catch (OutOfMemoryError ignored) {}
        giveGCAChance();
    }
}