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
|
/*
* Ouroboros - Copyright (C) 2016
*
* Test of the Shared Memory Map
*
* Dimitri Staessens <dimitri.staessens@intec.ugent.be>
*
* 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; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <ouroboros/shm_du_map.h>
#include <sys/types.h>
#include <stdlib.h>
#include <time.h>
#include <sys/mman.h>
#include <pthread.h>
#define SIZE_OF_DU_BUFF 24
#define TEST_BUFF_SIZE (SHM_DU_BUFF_BLOCK_SIZE - SIZE_OF_DU_BUFF)
#define MAX(a,b) (a > b ? a : b)
#define MIN(a,b) (a < b ? a : b)
int sync;
void * produce()
{
struct shm_du_map * dum;
long test_buf_size = 0;
uint8_t * test_values;
int headspace;
int tailspace;
long i;
long bytes_written = 0;
struct timespec starttime;
struct timespec stoptime;
double elapsed;
dum = shm_du_map_open();
if (dum == NULL) {
LOG_ERR("Could not open shm.");
return (void *)-1;
}
srand(time(NULL));
test_values = malloc (sizeof *test_values * TEST_BUFF_SIZE);
for (i = 0; i < TEST_BUFF_SIZE; i++)
test_values[i] = 170;
clock_gettime(CLOCK_MONOTONIC, &starttime);
for (i = 1; i < SHM_BLOCKS_IN_MAP; i++) {
struct shm_du_buff * sdb;
size_t len;
test_buf_size = TEST_BUFF_SIZE;
headspace = 32;
tailspace = 8;
len = test_buf_size - (headspace + tailspace);
sdb = shm_create_du_buff(dum,
test_buf_size,
headspace,
test_values,
len);
if (sdb != NULL) {
bytes_written += len;
}
else {
sync = -2;
break;
}
}
clock_gettime(CLOCK_MONOTONIC, &stoptime);
elapsed =(stoptime.tv_sec + stoptime.tv_nsec / 1000000000.0) -
(starttime.tv_sec + starttime.tv_nsec / 1000000000.0);
LOG_INFO("%ld bytes written in %.1lf ms = %lf Gb/s",
bytes_written,
elapsed * 1000.0,
bytes_written * 8 / (elapsed * 1000000000));
free(test_values);
sync = -1;
return 0;
}
void * consume()
{
struct shm_du_map * dum;
struct timespec ts;
ts.tv_sec = 0;
ts.tv_nsec = 1000000;
dum = shm_du_map_open();
if (dum == NULL) {
LOG_ERR("Could not open shm.");
return (void *)-1;
}
while (!sync) {
while (!shm_release_du_buff(dum));
nanosleep(&ts, NULL);
}
return 0;
}
int shm_du_map_test(int argc, char ** argv)
{
struct shm_du_map * dum;
int res1;
pthread_t producer;
pthread_t consumer;
/* test 1 */
LOG_INFO("starting create/close test.");
dum = shm_du_map_create();
if (dum == NULL) {
LOG_ERR("Could not open shm (dum).");
return -1;
}
shm_du_map_close(dum);
LOG_INFO("done.");
/* test 2 */
LOG_INFO("starting sequential test.");
dum = shm_du_map_create();
res1 = (int) pthread_create(&producer, NULL, produce, NULL);
pthread_join(producer, NULL);
pthread_create(&consumer, NULL, consume, NULL);
pthread_join(consumer, NULL);
shm_du_map_close(dum);
LOG_INFO("done.");
/* test 3 */
LOG_INFO("starting concurrency test.");
dum = shm_du_map_create();
res1 = (int) pthread_create(&producer, NULL, produce, NULL);
pthread_create(&consumer, NULL, consume, NULL);
pthread_join(producer, NULL);
pthread_join(consumer, NULL);
shm_du_map_close(dum);
LOG_INFO("done.");
return res1;
}
|
