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
|
/*
Copyright (c) 2009 Eucalyptus Systems, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, only version 3 of the License.
This file is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License along
with this program. If not, see <http://www.gnu.org/licenses/>.
Please contact Eucalyptus Systems, Inc., 130 Castilian
Dr., Goleta, CA 93101 USA or visit <http://www.eucalyptus.com/licenses/>
if you need additional information or have any questions.
This file may incorporate work covered under the following copyright and
permission notice:
Software License Agreement (BSD License)
Copyright (c) 2008, Regents of the University of California
Redistribution and use of this software in source and binary forms, with
or without modification, are permitted provided that the following
conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. USERS OF
THIS SOFTWARE ACKNOWLEDGE THE POSSIBLE PRESENCE OF OTHER OPEN SOURCE
LICENSED MATERIAL, COPYRIGHTED MATERIAL OR PATENTED MATERIAL IN THIS
SOFTWARE, AND IF ANY SUCH MATERIAL IS DISCOVERED THE PARTY DISCOVERING
IT MAY INFORM DR. RICH WOLSKI AT THE UNIVERSITY OF CALIFORNIA, SANTA
BARBARA WHO WILL THEN ASCERTAIN THE MOST APPROPRIATE REMEDY, WHICH IN
THE REGENTS’ DISCRETION MAY INCLUDE, WITHOUT LIMITATION, REPLACEMENT
OF THE CODE SO IDENTIFIED, LICENSING OF THE CODE SO IDENTIFIED, OR
WITHDRAWAL OF THE CODE CAPABILITY TO THE EXTENT NEEDED TO COMPLY WITH
ANY SUCH LICENSES OR RIGHTS.
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h> /* usleep */
#include <pthread.h>
#include "ipc.h"
#include "misc.h"
#include "data.h"
#define ITER 160*4
void test_sem_fork (void)
{
sem * s = sem_alloc (1, "eucalyptus-util-test");
printf ("---> testing semaphores between processes\n");
if (fork()) {
char c = 'A';
int i;
sleep (1);
printf ("A trying sem...\n");
sem_p (s);
printf ("A got sem!\n");
sleep (1);
printf ("A releasing sem...\n");
sem_v (s);
sleep (1);
for (i=0; i<ITER; i++) {
sem_p(s);
if (i%16==0) printf ("\n");
write (1, &c, 1);
usleep (100);
write (1, &c, 1);
sem_v(s);
}
} else {
char c = 'B';
int i;
printf ("B trying sem...\n");
sem_p (s);
printf ("B got sem!\n");
sleep (2);
printf ("B releasing sem...\n");
sem_v (s);
sleep (2);
for (i=0; i<ITER; i++) {
sem_p(s);
write (1, &c, 1);
usleep (100);
write (1, &c, 1);
sem_v(s);
}
exit (0); /* child quits */
}
sem_free (s);
printf ("\n");
}
void * thread_a (void * arg)
{
sem * s = (sem *)arg;
char c = 'T';
int i;
sleep (1);
printf ("T trying sem...\n");
sem_p (s);
printf ("T got sem!\n");
sleep (1);
printf ("T releasing sem...\n");
sem_v (s);
sleep (1);
for (i=0; i<ITER; i++) {
sem_p(s);
if (i%16==0) printf ("\n");
write (1, &c, 1);
usleep (100);
write (1, &c, 1);
sem_v(s);
}
return NULL;
}
void * thread_b (void * arg)
{
sem * s = (sem *)arg;
char c = 'U';
int i;
printf ("U trying sem...\n");
sem_p (s);
printf ("U got sem!\n");
sleep (2);
printf ("U releasing sem...\n");
sem_v (s);
sleep (2);
for (i=0; i<ITER; i++) {
sem_p(s);
write (1, &c, 1);
usleep (100);
write (1, &c, 1);
sem_v(s);
}
return NULL;
}
void test_sem_pthreads (void)
{
sem * s = sem_alloc (1, "eucalyptus-util-test2");
pthread_t ta, tb;
void * status;
printf ("---> testing semaphores between threads\n");
pthread_create (&ta, NULL, thread_a, s);
pthread_create (&tb, NULL, thread_b, s);
pthread_join (ta, &status);
pthread_join (tb, &status);
printf ("\n");
sem_free (s);
}
#define EXIT { fprintf (stderr, "error on line %d\n", __LINE__); exit (1); }
static void test_volumes (void)
{
int i, j;
char id [100];
ncInstance inst;
ncVolume * vols [EUCA_MAX_VOLUMES+1];
for (j=0; j<10; j++) {
int pivot = random()%EUCA_MAX_VOLUMES;
printf ("testing volumes iteration=%d pivot=%d\n", j, pivot);
bzero (&inst, sizeof (ncInstance));
for (i=0; i<EUCA_MAX_VOLUMES; i++) {
snprintf (id, 100, "v%06d", i);
vols [i] = add_volume (&inst, id, "remote", "local");
if (vols [i] == NULL) {
fprintf (stderr, "error on add iteration %i-%i\n", i, j);
EXIT;
}
if (inst.volumesSize!=i+1) {
fprintf (stderr, "error on add iteration %i-%i\n", i, j);
EXIT;
}
}
snprintf (id, 100, "v%06d", i);
vols [i] = add_volume (&inst, id, "remote", "local");
if (vols [i] != NULL) EXIT;
if (inst.volumesSize!=EUCA_MAX_VOLUMES) EXIT;
ncVolume * v = vols [pivot];
strncpy (id, v->volumeId, 100);
ncVolume * v2 = free_volume (&inst, id, "remote", "local");
if (v2 != v) EXIT;
if (inst.volumesSize!=EUCA_MAX_VOLUMES-1) EXIT;
v = add_volume (&inst, id, "remote", "local");
if (v == NULL) EXIT;
if (inst.volumesSize!=EUCA_MAX_VOLUMES) EXIT;
v2 = free_volume (&inst, id, "remote", "local");
if (v2 != v) EXIT;
if (inst.volumesSize!=EUCA_MAX_VOLUMES-1) EXIT;
v = add_volume (&inst, id, "remote", "local");
if (v == NULL) EXIT;
if (inst.volumesSize!=EUCA_MAX_VOLUMES) EXIT;
for (i=0; i<EUCA_MAX_VOLUMES; i++) {
snprintf (id, 100, "v%06d", i);
v = free_volume (&inst, id, "remote", "local");
if (v == NULL) {
fprintf (stderr, "error on free iteration %i-%i\n", i, j);
EXIT;
}
if (inst.volumesSize!=EUCA_MAX_VOLUMES-i-1) {
fprintf (stderr, "error on free iteration %i-%i\n", i, j);
EXIT;
}
}
}
}
int main (int argc, char * argv[])
{
if ( diff ("/etc/motd", "/etc/motd") != 0 ) EXIT;
if ( diff ("/etc/passwd", "/etc/motd") == 0 ) EXIT;
char * s = strdup("jolly old jolly old time...");
char ** sp = &s;
if ( strcmp ( replace_string ( sp, "old", "new"), "jolly new jolly new time..." ) ) EXIT;
if ( vrun ( "ls / /etc >/dev/null" ) ) EXIT;
test_volumes ();
printf ("all tests passed!\n");
if (argc==1) return 0;
/* "visual" testing of the semaphores */
test_sem_fork ();
test_sem_pthreads ();
return 0;
}
|