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
|
/*
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: lsthsts.m,v 1.5 92/06/11 17:15:03 rws Exp $
*/
>>TITLE XListHosts CH07
XHostAdress *
Display *display = Dsp;
int *nhosts_return = &Nhosts;
Bool *state_return = &State;
>>EXTERN
#include "xthost.h"
static int Nhosts;
static Bool State;
>>ASSERTION Good A
A call to xname
returns a pointer to a list of host structures,
that can be freed with
.F XFree ,
for hosts that
are in the current access control list and
returns the size of the list in
.A nhosts_return .
>>STRATEGY
Attempt to add some hosts to the access list.
If BadAccess error:
Note that the known address will not necessarily be in list.
Call xname.
If hosts were added to the access list:
Verify that nhosts_return is greater than or equal to number of known names.
Verify that each known name is in the list.
Verify that nhosts_return addresses can be accessed in the return value.
Free returned value with XFree.
>>CODE
XHostAddress *list;
int couldadd = 0;
int i, j;
CATCH_ERROR(display);
XAddHosts(display, xthosts, nxthosts);
RESTORE_ERROR(display);
if (GET_ERROR(display) == BadAccess) {
couldadd = False;
debug(1, "Could not add hosts");
} else {
couldadd = True;
}
list = XCALL;
if (couldadd) {
if (*nhosts_return >= nxthosts)
CHECK;
else {
report("nhosts was %d, expecting at least %d",
*nhosts_return, nxthosts);
FAIL;
}
for (i = 0; i < nxthosts; i++) {
for (j = 0; j < *nhosts_return; j++) {
if (samehost(&xthosts[i], &list[j]))
break;
}
if (j == *nhosts_return) {
report("Host list did not include xthosts[%d]", i);
FAIL;
} else if (i == 0)
CHECK;
}
} else {
CHECK; CHECK; /* For balance */
}
for (j = 0; j < *nhosts_return; j++) {
/* Do something to access addresses */
trace("family=%d, length=%d", list[j].family, list[j].length);
}
XFree((char*)list);
CHECKPASS(2);
>>ASSERTION Good A
A call to xname returns a boolean to
.A state_return
that is
.S True
to mean that the use of the list is enabled for restricting the hosts
that are allowed to make connections
and is
.S False
to mean that the use of the list is disabled and that any host
can connect.
>>STRATEGY
Call xname.
Verify that state_return is either True or False.
>>CODE
XHostAddress *list;
list = XCALL;
if (*state_return == True || *state_return == False)
CHECK;
else {
report("State return was neither True or False");
FAIL;
}
CHECKPASS(1);
XFree((char*)list);
|
