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
|
/*
* Copyright (c) 2009 Red Hat, Inc.
*
* All rights reserved.
*
* Author: Steven Dake (sdake@redhat.com)
*
* This software licensed under BSD license, the text of which follows:
*
* Redistribution and use 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.
* - Neither the name of the MontaVista Software, Inc. nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* 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.
*/
#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <string.h>
#include <corosync/corotypes.h>
#include <corosync/cpg.h>
#include <signal.h>
#include <assert.h>
struct my_msg {
unsigned int msg_size;
unsigned char sha1[20];
unsigned char buffer[0];
};
static int deliveries = 0;
static void cpg_deliver_fn (
cpg_handle_t handle,
const struct cpg_name *group_name,
uint32_t nodeid,
uint32_t pid,
void *m,
size_t msg_len)
{
deliveries++;
}
static void cpg_confchg_fn (
cpg_handle_t handle,
const struct cpg_name *group_name,
const struct cpg_address *member_list, size_t member_list_entries,
const struct cpg_address *left_list, size_t left_list_entries,
const struct cpg_address *joined_list, size_t joined_list_entries)
{
}
static cpg_callbacks_t callbacks = {
cpg_deliver_fn,
cpg_confchg_fn
};
static void sigintr_handler (int num)
{
exit (1);
}
#define ITERATIONS 100
#define ALLOCATIONS 2000
#define MAX_SIZE 100000
int main (void)
{
cs_error_t res;
cpg_handle_t handle;
size_t buffer_lens[ALLOCATIONS];
void *buffers[ALLOCATIONS];
int i, j;
printf ("stress cpgzc running %d allocations for %d iterations\n",
ALLOCATIONS, ITERATIONS);
signal (SIGINT, sigintr_handler);
res = cpg_initialize (&handle, &callbacks);
if (res != CS_OK) {
printf ("FAIL %d\n", res);
exit (-1);
}
for (j = 0; j < ITERATIONS; j++) {
for (i = 0; i < ALLOCATIONS; i++) {
buffer_lens[i] = (random() % MAX_SIZE) + 1;
res = cpg_zcb_alloc (
handle,
buffer_lens[i],
&buffers[i]);
if (res != CS_OK) {
printf ("FAIL %d\n", res);
exit (-1);
}
}
for (i = 0; i < ALLOCATIONS; i++) {
res = cpg_zcb_free (
handle,
buffers[i]);
if (res != CS_OK) {
printf ("FAIL %d\n", res);
exit (-1);
}
}
if ((j != 0) &&
(j % 20) == 0) {
printf ("iteration %d\n", j);
}
}
cpg_finalize (handle);
printf ("PASS\n");
exit (0);
}
|
