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
|
/*
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: rmqgtsrchr.m,v 1.5 94/04/17 21:10:20 rws Exp $
*/
>>TITLE XrmQGetSearchResource CH10
Bool
XrmHashTable *list = sl;
XrmName name;
XrmClass class;
XrmRepresentation *type_return = &type;
XrmValue *value=&val;
>>SET startup rmstartup
>>EXTERN
static XrmRepresentation type;
static XrmValue val;
static XrmDatabase dbase;
#define XQGSR_ARRAY_SIZE 10
static XrmHashTable sl[XQGSR_ARRAY_SIZE];
static XrmName nl[XQGSR_ARRAY_SIZE];
static XrmClass cl[XQGSR_ARRAY_SIZE];
/* Database data */
#define XQGSR_T1_DATA 5
static char *t1_data[XQGSR_T1_DATA] = {
"applic.window.background:blue",
"Applic.window.BackGround:cyan",
"applic.Window.background:magenta",
"Applic.Window.BackGround:orange",
"Applic.Window.Unimportant:pink" };
/* Searchlist data */
#define XQGSR_T1_SEARCH 2
static char *t1_search[XQGSR_T1_SEARCH][2] = {
{ "applic", "Applic" },
{ "window", "Window" } };
/* SearchResource tests */
#define XQGSR_T1_TESTS 3
static char *t1_tests[XQGSR_T1_TESTS][3] = {
{ "background", "BackGround", "blue" },
{ "border", "BackGround", "cyan" },
{ "misc", "Unimportant", "pink" } };
#define XQGSR_T2_TESTS 1
static char *t2_tests[XQGSR_T2_TESTS][2] = {
{ "nomatch", "Nomatch" } };
>>ASSERTION Good A
When
.A name
and
.A class
fully identify a resource which is contained in
the specified database levels
.A list ,
then a call to xname
returns the type in
.A type_return
and
the value in
.A value_return
which first match,
and returns
.S True .
>>STRATEGY
Create a database containing testable resource/value pairs.
Call XrmQGetSearchList to build up the search list.
Call xname to retrieve information.
Verify the retrieved information was correct.
>>CODE
int a;
XrmRepresentation exp_type;
Bool ret;
/* Create a database containing testable resource/value pairs. */
dbase=(XrmDatabase)NULL;
for(a=0; a<XQGSR_T1_DATA; a++) {
CHECK;
XrmPutLineResource(&dbase, t1_data[a]);
}
#ifdef TESTING
XrmPutFileDatabase(dbase, "xqgsr_one");
#endif
/* Call XrmQGetSearchList to build up the search list. */
for(a=0; a<XQGSR_T1_SEARCH; a++) {
CHECK;
nl[a]=XrmStringToName(t1_search[a][0]);
cl[a]=XrmStringToClass(t1_search[a][1]);
}
nl[XQGSR_T1_SEARCH]=(XrmName)0;
cl[XQGSR_T1_SEARCH]=(XrmClass)0;
if(!XrmQGetSearchList(dbase, nl, cl, sl, XQGSR_ARRAY_SIZE)) {
delete("XrmQGetSearchList unexpectedly exhausted the allocated space for table.");
return;
} else
CHECK;
exp_type = XrmStringToRepresentation("String");
for(a=0; a<XQGSR_T1_TESTS; a++) {
/* Call xname to retrieve information. */
name = XrmStringToName(t1_tests[a][0]);
class= XrmStringToClass(t1_tests[a][1]);
type = (XrmRepresentation)0;
val.addr = (caddr_t)NULL;
val.size = 0;
ret = XCALL;
/* Verify the retrieved information was correct. */
if(ret != True) {
FAIL;
report("%s returned False when expecting a database match.",
TestName);
} else {
if (type != exp_type) {
char *rt;
FAIL;
report("%s returned unexpected type.", TestName);
report("Name (class): %s (%s)", t1_tests[a][0], t1_tests[a][1]);
report("Expected type: String");
rt=XrmRepresentationToString(type);
report("Returned type: %s", (rt==NULL?"<NULL STRING":rt));
} else
CHECK;
if (val.addr==NULL ||
strncmp((char*)val.addr, t1_tests[a][2],
strlen(t1_tests[a][2]))) {
FAIL;
report("%s returned unexpected value", TestName);
report("Name (class): %s (%s)", t1_tests[a][0], t1_tests[a][1]);
report("Expected value: %s", t1_tests[a][2]);
if (val.addr==NULL) {
report("Returned value: <NULL POINTER>");
} else {
report("Returned value: %.*s",
val.size,
(char *)val.addr);
}
} else
CHECK;
}
}
CHECKPASS(1+XQGSR_T1_DATA+XQGSR_T1_SEARCH+XQGSR_T1_TESTS*2);
XrmDestroyDatabase(dbase);
>>ASSERTION Good A
When
.A name
and
.A class
fully identify a resource which is not contained in
the specified database levels
.A list ,
then a call to xname returns
.S False .
>>STRATEGY
Create a database containing testable resource/value pairs.
Call XrmQGetSearchList to build up the search list.
Call xname to retrieve information.
Verify there was no match.
>>CODE
int a;
Bool ret;
/* Create a database containing testable resource/value pairs. */
dbase=(XrmDatabase)NULL;
for(a=0; a<XQGSR_T1_DATA; a++) {
CHECK;
XrmPutLineResource(&dbase, t1_data[a]);
}
#ifdef TESTING
XrmPutFileDatabase(dbase, "xqgsr_two");
#endif
/* Call XrmQGetSearchList to build up the search list. */
for(a=0; a<XQGSR_T1_SEARCH; a++) {
CHECK;
nl[a]=XrmStringToName(t1_search[a][0]);
cl[a]=XrmStringToClass(t1_search[a][1]);
}
nl[XQGSR_T1_SEARCH]=(XrmName)0;
cl[XQGSR_T1_SEARCH]=(XrmClass)0;
if(!XrmQGetSearchList(dbase, nl, cl, sl, XQGSR_ARRAY_SIZE)) {
delete("XrmQGetSearchList unexpectedly exhausted the allocated space for table.");
return;
} else
CHECK;
for(a=0; a<XQGSR_T2_TESTS; a++) {
/* Call xname to retrieve information. */
name = XrmStringToName(t2_tests[a][0]);
class= XrmStringToClass(t2_tests[a][1]);
type = (XrmRepresentation)0;
val.addr = (caddr_t)NULL;
val.size = 0;
ret = XCALL;
/* Verify there was no match. */
if(ret != False) {
char *rt;
FAIL;
report("%s returned True when expecting no match.",
TestName);
report("Name (class): %s (%s)", t2_tests[a][0], t2_tests[a][1]);
rt=XrmRepresentationToString(type);
report("Returned type: %s", (rt==NULL?"<NULL STRING":rt));
if (val.addr==NULL) {
report("Returned value: <NULL POINTER>");
} else {
report("Returned value: %.*s",
val.size,
(char *)val.addr);
}
} else
CHECK;
}
CHECKPASS(1+XQGSR_T1_DATA+XQGSR_T1_SEARCH+XQGSR_T2_TESTS);
XrmDestroyDatabase(dbase);
|
