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
|
/* Copyright 2000-2004 The Apache Software Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "apr_shm.h"
#include "apr_thread_proc.h"
#include "apr_file_io.h"
#include "apr_proc_mutex.h"
#include "apr_errno.h"
#include "apr_general.h"
#include "apr_getopt.h"
#include "errno.h"
#include <stdio.h>
#include <stdlib.h>
#include "testutil.h"
#if APR_HAS_FORK
#define MAX_ITER 200
#define CHILDREN 6
#define MAX_COUNTER (MAX_ITER * CHILDREN)
static apr_proc_mutex_t *proc_lock;
static volatile int *x;
/* a slower more racy way to implement (*x)++ */
static int increment(int n)
{
apr_sleep(1);
return n+1;
}
static void make_child(abts_case *tc, apr_proc_t **proc, apr_pool_t *p)
{
apr_status_t rv;
*proc = apr_pcalloc(p, sizeof(**proc));
/* slight delay to allow things to settle */
apr_sleep (1);
rv = apr_proc_fork(*proc, p);
if (rv == APR_INCHILD) {
int i = 0;
/* The parent process has setup all processes to call apr_terminate
* at exit. But, that means that all processes must also call
* apr_initialize at startup. You cannot have an unequal number
* of apr_terminate and apr_initialize calls. If you do, bad things
* will happen. In this case, the bad thing is that if the mutex
* is a semaphore, it will be destroyed before all of the processes
* die. That means that the test will most likely fail.
*/
apr_initialize();
if (apr_proc_mutex_child_init(&proc_lock, NULL, p))
exit(1);
do {
if (apr_proc_mutex_lock(proc_lock))
exit(1);
i++;
*x = increment(*x);
if (apr_proc_mutex_unlock(proc_lock))
exit(1);
} while (i < MAX_ITER);
exit(0);
}
ABTS_ASSERT(tc, "fork failed", rv == APR_INPARENT);
}
/* Wait for a child process and check it terminated with success. */
static void await_child(abts_case *tc, apr_proc_t *proc)
{
int code;
apr_exit_why_e why;
apr_status_t rv;
rv = apr_proc_wait(proc, &code, &why, APR_WAIT);
ABTS_ASSERT(tc, "child did not terminate with success",
rv == APR_CHILD_DONE && why == APR_PROC_EXIT && code == 0);
}
static void test_exclusive(abts_case *tc, const char *lockname)
{
apr_proc_t *child[CHILDREN];
apr_status_t rv;
int n;
rv = apr_proc_mutex_create(&proc_lock, lockname, APR_LOCK_DEFAULT, p);
apr_assert_success(tc, "create the mutex", rv);
for (n = 0; n < CHILDREN; n++)
make_child(tc, &child[n], p);
for (n = 0; n < CHILDREN; n++)
await_child(tc, child[n]);
ABTS_ASSERT(tc, "Locks don't appear to work", *x == MAX_COUNTER);
}
#endif
static void proc_mutex(abts_case *tc, void *data)
{
#if APR_HAS_FORK
apr_status_t rv;
const char *shmname = "tpm.shm";
apr_shm_t *shm;
/* Use anonymous shm if available. */
rv = apr_shm_create(&shm, sizeof(int), NULL, p);
if (rv == APR_ENOTIMPL) {
apr_file_remove(shmname, p);
rv = apr_shm_create(&shm, sizeof(int), shmname, p);
}
apr_assert_success(tc, "create shm segment", rv);
x = apr_shm_baseaddr_get(shm);
test_exclusive(tc, NULL);
#else
ABTS_NOT_IMPL(tc, "APR lacks fork() support");
#endif
}
abts_suite *testprocmutex(abts_suite *suite)
{
suite = ADD_SUITE(suite)
abts_run_test(suite, proc_mutex, NULL);
return suite;
}
|
