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
|
/*
* Copyright (C) 1999-2001, Ian Main <imain@stemwinder.org>.
* All rights reserved.
*
* 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.
*
*/
#include <roy.h>
#define USE_ROY 1
#ifdef USE_ROY
#define ALLOC(size) rchunk_alloc (size)
#define FREE(ptr, size) rchunk_free (ptr, size)
#else
#define ALLOC(size) malloc (size)
#define FREE(ptr, size) free (ptr)
#endif
#define NUM_CHUNKS 4096
#define ITERATIONS 1
static void *
do_test (void *data)
{
long tid = (long) data;
int i;
int a;
int size = 4;
int *check;
int *block[NUM_CHUNKS];
for (size = 2; size <= 64; size += 5) {
for (a = 0; a < ITERATIONS; a++) {
for (i = 0; i < NUM_CHUNKS; i++) {
block[i] = ALLOC (size);
check = block[i];
*check = i;
}
for (i = 0; i < NUM_CHUNKS; i++) {
check = block[i];
if (*check != i) {
printf ("Bad Magic: found %d, expected %d\n", *check, i);
}
FREE (block[i], size);
}
}
}
printf ("thread %ld done.\n", tid);
return (NULL);
}
int
main (void)
{
RThread *thread1;
RThread *thread2;
rinit_threaded ();
thread1 = rthread_create (do_test, (void *) 1L);
thread2 = rthread_create (do_test, (void *) 2L);
rthread_waitfor (thread1, NULL);
rthread_free (thread1);
rthread_waitfor (thread2, NULL);
rthread_free (thread2);
rcleanup ();
return (0);
}
|
