The libapr1 test cases are failing for flock locks. I've extracted
the attached STC to demonstrate the problem. It starts a number of
child processes, each of which repeatedly grab and release a lock on
a temporary file. While they have the lock, the increment a counter
in shared memory in a racy way.
If all goes well, the counter should end up having the value of
CHILDREN * ITERS_PER_CHILDREN. And it does, except sometimes the
test just hangs. The attached runs the test 10 times, which is
sufficient to reproduce the hang on my machine. Sometimes the first
iteration hangs, sometimes it's the last one.
This was working the last time I built libapr1 (19-Feb-2012).
To run the test, just run "make".
Regards,
David
--
David Rothenberger ---- daver...@acm.org
question = ( to ) ? be : ! be;
-- Wm. Shakespeare
CC=gcc
CFLAGS=-Wall
STC=stc-flock-fork
.PHONY: test
test: $(STC)
./$(STC)
$(STC): $(STC).c
$(CC) $(CFLAGS) -o $@ $^
.PHONY: clean
clean:
rm -f $(STC)
-rm -f /tmp/flocktst*
/***********************************************************************
* This is a STC to show that flock occasionally does not work.
*
* It tries to use flock() for file locking. It creates a temporary
* file, the uses fork to spawn a number of children. Each child opens
* the file, then repeatedly uses flock to lock and unlock it.
*
* While each child has the lock, it increments a counter stored in
* shared memory in a racy way, passing the current value to a function
* which sleeps briefly, then returns the incremented counter.
*
* If all works correctly, the counter should end up be incremented
* by each child iteration.
*
* However, this is failing for me occasionally. The test case hangs after a
few iterations.
*
* This test was extracted from the APR test suite.
*
* Compile: gcc -Wall -o stc-flock-fork stc-flock-fork.c
***********************************************************************/
#include <sys/types.h>
#include <sys/file.h>
#include <sys/wait.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <unistd.h>
#include <errno.h>
#define MAX_ITER 10
#define CHILDREN 6
#define MAX_COUNT (MAX_ITER * CHILDREN)
/* Counter stored in shared memory. */
static volatile int *x;
/* A temporary file used for flock. */
char tmpfilename[] = "/tmp/flocktstXXXXXX";
/* a slower more racy way to implement (*x)++ */
static int increment(int n)
{
usleep(1);
return n+1;
}
/* Fork and use flock to lock and unlock the file repeatedly in the child. */
void make_child(int trylock, pid_t *pid)
{
if ((*pid = fork()) < 0) {
perror("fork failed");
exit(1);
}
else if (*pid == 0) {
int fd2 = open(tmpfilename, O_RDONLY);
if (fd2 < 0) {
perror("child open");
exit(1);
}
int rc;
int i;
for (i=0; i<MAX_ITER; ++i) {
/* Get the lock. */
do {
rc = flock(fd2, LOCK_EX);
} while (rc < 0 && errno == EINTR);
if (rc < 0) {
perror("lock");
exit(1);
}
/* Have the lock. Increment the counter. */
*x = increment(*x);
/* Release the lock. */
do {
rc = flock(fd2, LOCK_UN);
} while (rc < 0 && errno == EINTR);
if (rc < 0) {
perror("unlock");
exit(1);
}
}
exit(0);
}
}
/* Wait for the child to finish. */
void await_child(pid_t pid)
{
pid_t pstatus;
int exit_int;
do {
pstatus = waitpid(pid, &exit_int, WUNTRACED);
} while (pstatus < 0 && errno == EINTR);
}
/* Allocate and attach shared memory */
void init_shm ()
{
x = mmap(NULL, getpagesize(), PROT_READ | PROT_WRITE,
MAP_SHARED | MAP_ANONYMOUS, -1, 0);
if (!x) {
perror ("mmap failed");
exit (1);
}
}
int main(int argc, const char * const * argv, const char * const *env)
{
pid_t child[CHILDREN];
int i;
int n;
int fd;
/* Create the temporary file. */
fd = mkstemp(tmpfilename);
if (fd < 0) {
perror("open failed");
exit(1);
}
close(fd);
/* Initialize shared memory */
init_shm();
/* Perform the test multiple times, since this fails only intermittedly. */
for (i = 0; i < 10; ++i) {
printf("Iteration %d\n", i);
/* Initialize counter */
*x = 0;
/* Create the children. */
for (n = 0; n < CHILDREN; n++)
make_child(0, &child[n]);
/* Wait for them to finish. */
for (n = 0; n < CHILDREN; n++)
await_child(child[n]);
/* Check counter */
if (*x != MAX_COUNT) {
printf("Iteration %d: FAILED: *x (%d) != MAX_COUNT (%d)\n", i, *x,
MAX_COUNT);
exit(1);
}
}
/* Clean up. */
unlink(tmpfilename);
return 0;
}
--
Problem reports: http://cygwin.com/problems.html
FAQ: http://cygwin.com/faq/
Documentation: http://cygwin.com/docs.html
Unsubscribe info: http://cygwin.com/ml/#unsubscribe-simple
