Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mobile
Path: blob/master/test/jdk/javax/management/relation/RelationNotificationSeqNoTest.java
41149 views
1
/*
2
* Copyright (c) 2005, 2015, Oracle and/or its affiliates. All rights reserved.
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
*
19
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20
* or visit www.oracle.com if you need additional information or have any
21
* questions.
22
*/
23
24
/*
25
* @test
26
* @bug 6701459
27
* @summary Test sequence numbers in RelationService notifications.
28
* @author Eamonn McManus
29
*/
30
31
/*
32
* Bug 6701459 is for a synchronization problem that is very unlikely to occur
33
* in practice and it would be very hard to test it. Instead we just check that
34
* the fix has not introduced any obviously-wrong behavior in the sequence
35
* numbers.
36
*/
37
38
import java.util.Arrays;
39
import java.util.concurrent.ArrayBlockingQueue;
40
import java.util.concurrent.BlockingQueue;
41
import javax.management.JMX;
42
import javax.management.MBeanServer;
43
import javax.management.MBeanServerFactory;
44
import javax.management.Notification;
45
import javax.management.NotificationListener;
46
import javax.management.ObjectName;
47
import javax.management.relation.RelationServiceMBean;
48
import javax.management.relation.Role;
49
import javax.management.relation.RoleInfo;
50
import javax.management.relation.RoleList;
51
52
public class RelationNotificationSeqNoTest {
53
public static void main(String[] args) throws Exception {
54
MBeanServer mbs = MBeanServerFactory.newMBeanServer();
55
ObjectName relSvcName = new ObjectName("a:type=relationService");
56
RelationServiceMBean relSvc =
57
JMX.newMBeanProxy(mbs, relSvcName, RelationServiceMBean.class);
58
mbs.createMBean("javax.management.relation.RelationService",
59
relSvcName,
60
new Object[] {Boolean.TRUE},
61
new String[] {"boolean"});
62
63
final BlockingQueue<Notification> q =
64
new ArrayBlockingQueue<Notification>(100);
65
NotificationListener qListener = new NotificationListener() {
66
public void handleNotification(Notification notification,
67
Object handback) {
68
q.add(notification);
69
}
70
};
71
mbs.addNotificationListener(relSvcName, qListener, null, null);
72
73
RoleInfo leftInfo =
74
new RoleInfo("left", "javax.management.timer.TimerMBean");
75
RoleInfo rightInfo =
76
new RoleInfo("right", "javax.management.timer.Timer");
77
relSvc.createRelationType("typeName", new RoleInfo[] {leftInfo, rightInfo});
78
ObjectName timer1 = new ObjectName("a:type=timer,number=1");
79
ObjectName timer2 = new ObjectName("a:type=timer,number=2");
80
mbs.createMBean("javax.management.timer.Timer", timer1);
81
mbs.createMBean("javax.management.timer.Timer", timer2);
82
83
Role leftRole =
84
new Role("left", Arrays.asList(new ObjectName[] {timer1}));
85
Role rightRole =
86
new Role("right", Arrays.asList(new ObjectName[] {timer2}));
87
RoleList roles =
88
new RoleList(Arrays.asList(new Role[] {leftRole, rightRole}));
89
90
final int NREPEAT = 10;
91
92
for (int i = 0; i < NREPEAT; i++) {
93
relSvc.createRelation("relationName", "typeName", roles);
94
relSvc.removeRelation("relationName");
95
}
96
97
Notification firstNotif = q.remove();
98
long seqNo = firstNotif.getSequenceNumber();
99
for (int i = 0; i < NREPEAT * 2 - 1; i++) {
100
Notification n = q.remove();
101
long nSeqNo = n.getSequenceNumber();
102
if (nSeqNo != seqNo + 1) {
103
throw new Exception(
104
"TEST FAILED: expected seqNo " + (seqNo + 1) + "; got " +
105
nSeqNo);
106
}
107
seqNo++;
108
}
109
System.out.println("TEST PASSED: got " + (NREPEAT * 2) + " notifications " +
110
"with contiguous sequence numbers");
111
}
112
}
113
114