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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
Copyright (c) 2005 X.Org Foundation L.L.C.
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Copyright (c) Applied Testing and Technology, Inc. 1995
All Rights Reserved.
>># Project: VSW5
>>#
>># File: xts5/Xlib13/XGetPointerMapping.m
>>#
>># Description:
>># Tests for XGetPointerMapping()
>>#
>># Modifications:
>># $Log: gtpntrmppn.m,v $
>># Revision 1.3 2006-12-07 15:51:28 gwc
>># Patch from bug #7428 - remove MAXBUTTON=5 constraints
>>#
>># Revision 1.2 2005/11/03 08:42:40 jmichael
>># clean up all vsw5 paths to use xts5 instead.
>>#
>># Revision 1.1.1.2 2005/04/15 14:05:19 anderson
>># Reimport of the base with the legal name in the copyright fixed.
>>#
>># Revision 8.0 1998/12/23 23:33:41 mar
>># Branch point for Release 5.0.2
>>#
>># Revision 7.0 1998/10/30 22:55:22 mar
>># Branch point for Release 5.0.2b1
>>#
>># Revision 6.0 1998/03/02 05:25:04 tbr
>># Branch point for Release 5.0.1
>>#
>># Revision 5.0 1998/01/26 03:21:36 tbr
>># Branch point for Release 5.0.1b1
>>#
>># Revision 4.0 1995/12/15 09:08:32 tbr
>># Branch point for Release 5.0.0
>>#
>># Revision 3.1 1995/12/15 01:09:50 andy
>># Prepare for GA Release
>>#
/*
Portions of this software are based on Xlib and X Protocol Test Suite.
We have used this material under the terms of its copyright, which grants
free use, subject to the conditions below. Note however that those
portions of this software that are based on the original Test Suite have
been significantly revised and that all such revisions are copyright (c)
1995 Applied Testing and Technology, Inc. Insomuch as the proprietary
revisions cannot be separated from the freely copyable material, the net
result is that use of this software is governed by the ApTest copyright.
Copyright (c) 1990, 1991 X Consortium
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of the X Consortium shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from the X Consortium.
Permission to use, copy, modify, distribute, and sell this software and
its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of UniSoft not be
used in advertising or publicity pertaining to distribution of the
software without specific, written prior permission. UniSoft
makes no representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty.
*/
>>TITLE XGetPointerMapping Xlib13
int
xname()
Display *display = Dsp;
unsigned char *map_return = Map;
int nmap = MAPSIZE;
>>EXTERN
#define MAPSIZE 32
static unsigned char Map[MAPSIZE];
>>ASSERTION Good B 3
>>#A call to xname
>>#returns the logical button numbers corresponding to the
>>#physical button i+1, where i is an index into the returned array
>>#.A map_return .
A call to xname
returns in map_return[i] the logical button numbers of the
physical buttons i+1.
>>STRATEGY
Call xname to get pointer mapping.
If extension available:
Create window and map it.
Select for ButtonPress events.
Warp into window.
For i in 1..nphysbuttons
Simulate pressing button i.
Check for incoming ButtonPress event.
Check that event.xbutton.button is map_return[i-1].
Release all buttons.
else
UNTESTED touch test only.
>>CODE
int nbuttons;
int i;
Window win;
nbuttons = XCALL;
trace("Number of buttons reported as %d", nbuttons);
if (noext(nbuttons)) {
report("There is no reliable test method, but a touch test was performed");
UNTESTED;
return;
} else
CHECK;
win = defwin(display);
if (isdeleted()) {
delete("Failed to create ButtonPress window.");
return;
} else
CHECK;
XSelectInput(display, win, ButtonPressMask);
XSync(display, True);
if (isdeleted()) {
delete("Failed to select for ButtonPress. May indicate competing clients (e.g. window managers).");
return;
} else
CHECK;
warppointer(display, win, 2, 2);
for (i=0; i<nbuttons; i++) {
XEvent ev;
XSync(display, True); /* clear out event Q */
_startcall(display); /* install and reset error handlers */
buttonpress(display, (unsigned int)i+1);
if (!XCheckWindowEvent(display, win, ButtonPressMask, &ev)) {
delete("No event received for button %d.", i+1);
relalldev();
return;
} else
CHECK;
relalldev();
_endcall(display); /* back to catching unexpected ones */
if (ev.xbutton.button != map_return[i]) {
report("Mapping for button %d is %d not %d.",
i+1, (int)ev.xbutton.button, (int)map_return[i]);
FAIL;
} else
CHECK;
trace("Mapping for button %d is %d, expecting %d.",
i+1, (int)ev.xbutton.button, (int)map_return[i]);
}
CHECKPASS(3+2*nbuttons);
>>ASSERTION Good B 3
A call to xname
returns the number of physical buttons actually on the pointer.
>>STRATEGY
Call xname to get number of buttons.
Check this lies within the limit.
If extension available:
Simulate the pressing of buttons 1..n and check that
we got Success for buttons in the range returned by xname, and
we got BadValue for the rest.
Release all buttons.
>>CODE
int nbuttons;
int i;
nbuttons = XCALL;
if (nbuttons < 1 || nbuttons > MAPSIZE) {
report("Limit of 1..%d buttons exceeded (%d).", MAPSIZE, nbuttons);
FAIL;
} else
CHECK;
if (noext(nbuttons)) {
report("There is no reliable test method, but a touch test was performed");
UNTESTED;
return;
} else
CHECK;
for(i=0; i<MAPSIZE; i++) {
_startcall(display); /* install and reset error handlers */
buttonpress(display, (unsigned int)i+1);
if (geterr() != ((i<nbuttons)?Success:BadValue)) {
report("Apparently button %d could%s be pressed.",
i+1, (i<nbuttons)?"n't":"");
FAIL;
} else
CHECK;
relalldev();
_endcall(display); /* back to catching unexpected ones */
}
CHECKPASS(2+MAPSIZE);
>>ASSERTION Good A
When the
.A nmap
argument is less than the number of elements in the pointer mapping,
then only the first
.A nmap
elements are returned in
.A map_return .
>>STRATEGY
Set all elements of map_return to 255.
Set nmap to a value less than number of elements in the pointer mapping.
Call xname.
Verify that elements of map_return beyond nmap-1 are still 255.
>>CODE
int nbuttons;
int i;
#define TEST_VAL ((unsigned char)255)
nbuttons = XCALL;
for (i = 0; i < MAPSIZE; i++)
Map[i] = TEST_VAL;
/*
* Its not clear that asking for 0 elements is really sensible so we
* only do it when there is only one button.
*/
if (nbuttons == 1)
nmap = 0;
else
nmap = 1;
XCALL;
for (i = nmap; i < MAPSIZE; i++) {
if (Map[i] != TEST_VAL) {
report("An element beyond the first nmap was returned");
report(" element %d was %u, expecting %u", i, (unsigned)Map[i],
(unsigned)TEST_VAL);
FAIL;
} else
CHECK;
}
CHECKPASS(MAPSIZE-nmap);
|