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
|
/*
* This file is part of count-f strace test.
*
* Copyright (c) 2016-2021 Dmitry V. Levin <ldv@strace.io>
* All rights reserved.
*
* SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "tests.h"
#include <assert.h>
#include <errno.h>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/wait.h>
#include <unistd.h>
#define N 32
#define P 8
#define T 4
static void *
thread(void *arg)
{
assert(chdir(".") == 0);
for (unsigned int i = 0; i < N; ++i) {
assert(chdir("") == -1);
assert(chdir(".") == 0);
}
return NULL;
}
static int
process(void)
{
pthread_t t[T];
for (unsigned int i = 0; i < T; ++i) {
errno = pthread_create(&t[i], NULL, thread, NULL);
if (errno)
perror_msg_and_fail("pthread_create");
}
for (unsigned int i = 0; i < T; ++i) {
void *retval;
errno = pthread_join(t[i], &retval);
if (errno)
perror_msg_and_fail("pthread_join");
}
return 0;
}
int
main(void)
{
pid_t p[P];
for (unsigned int i = 0; i < P; ++i) {
p[i] = fork();
if (p[i] < 0)
perror_msg_and_fail("fork");
if (!p[i])
return process();
}
for (unsigned int i = 0; i < P; ++i) {
int s;
pid_t rc;
while ((rc = waitpid(p[i], &s, 0)) != p[i]) {
if (rc < 0 && errno == EINTR)
continue;
perror_msg_and_fail("waitpid: %d", p[i]);
}
assert(WIFEXITED(s));
if (WEXITSTATUS(s))
return WEXITSTATUS(s);
}
return 0;
}
|