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
|
/*
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.
*
* Copyright 1990, 1991 by UniSoft Group Limited.
*
* 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.
*
* $XConsortium: ftchbffr.m,v 1.7 92/06/11 17:34:34 rws Exp $
*/
>>#
>># COMMENT : Spec mentions the possibility of a BadValue error.
>># I can't see how this could be generated without
>># changing Xlib. The spec also fails to mention that
>># the call returns NULL if there is no data in the
>># specified cut buffer. I have added this to the
>># assertion.
>>#
>># Cal 12/07/91
>>#
>>TITLE XFetchBuffer CH10
char *
XFetchBuffer(display, nbytes_return, buffer)
Display *display = Dsp;
int *nbytes_return;
int buffer;
>>EXTERN
#include "Xatom.h"
>>ASSERTION Good A
When the cut buffer specified by the
.A buffer
argument contains data, then a call to xname returns in the
.A nbytes_return
argument the number of bytes stored in the buffer and returns a pointer
to storage allocated for the data, which can be freed with
.S XFree .
>>STRATEGY
For each cut buffer 0..7:
Set the buffer to contain data using XStoreBuffer.
For each cut buffer 0..7:
Obtain the contents of the buffer using xname.
Verify that the data is correct.
Free the returned data using XFree.
>>CODE
char *bp;
char *rbp;
int nr;
int len;
int i;
int j;
struct bstrct {
char *data;
int len;
} bfrs[8], *bptr;
for(i=0, bptr=bfrs; i<8; i++, bptr++) {
len = 1+i*123;
bptr->len = len;
if((bptr->data = (char*)malloc(len)) == (char *) NULL) {
delete("malloc() returned NULL.");
return;
} else
CHECK;
for(j=len, bp=bptr->data; j>0; *bp++ = (j) % (256 - i), j--)
;
XStoreBuffer(display, bptr->data, len, i);
}
for(i=0, bptr=bfrs; i<8; i++, bptr++) {
buffer = i;
nbytes_return = &nr;
rbp = XCALL;
if(rbp == (char *) NULL) {
report("%s() did not set buffer %d to contain any data.", TestName, i);
FAIL;
} else {
CHECK;
if(bptr->len != nr) {
report("%s() set buffer %d to contain %d bytes instead of %d.", TestName, i, nr, bptr->len);
FAIL;
} else {
CHECK;
if(memcmp(rbp, bptr->data, nr) != 0) {
report("%s() set buffer %d to contain the wrong data.", TestName, i);
FAIL;
} else
CHECK;
}
free(bptr->data);
XFree(rbp);
}
}
CHECKPASS(8 + 8 * (3));
>>ASSERTION Good A
When the cut buffer specified by the
.A buffer
argument does not contain any data, then a call to xname sets the
.A nbytes_return
argument to zero, and returns NULL.
>>STRATEGY
For each cut buffer 0..7:
Set the buffer to contain data using XStoreBuffer.
For i in 0..7:
Delete the property CUT_BUFFERi from screen 0 of the display using XDeletePropery.
For each cut buffer 0..7:
Obtain the contents of the buffer using xname.
Verify that the call returned NULL.
Verify that the nbytes_return argument was set to zero.
>>CODE
char *rbp;
char *tstr = "XTest Multi buffer string";
int len = 1 + strlen(tstr);
int nr;
int i;
for(i=0; i < 8; i++)
XStoreBuffer(display, tstr, len, i);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER0);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER1);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER2);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER3);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER4);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER5);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER6);
XDeleteProperty(display, RootWindow(display, 0), XA_CUT_BUFFER7);
for(i=0; i < 8; i++) {
buffer = i;
nbytes_return = &nr;
rbp = XCALL;
if(rbp != (char *) NULL) {
report("%s() did not return NULL for buffer %d.", TestName, i);
FAIL;
} else
CHECK;
if(nr != 0) {
report("%s() set nbytes_return to %d instead of 0 for buffer %d.", TestName, nr, i);
FAIL;
} else
CHECK;
}
CHECKPASS(8 * 2);
|
