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
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 2015-2018 Free Software Foundation, Inc.
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 3 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, see <http://www.gnu.org/licenses/>. */
#define _GNU_SOURCE
#include <unistd.h>
#include <stdlib.h>
#include <pthread.h>
#include <assert.h>
#define NUM_THREADS 3
struct thread_data
{
const char *name;
pthread_barrier_t *barrier;
};
static void *
thread_func (void *varg)
{
struct thread_data *arg = (struct thread_data *) varg;
int res;
res = pthread_setname_np (pthread_self (), arg->name);
assert (res == 0);
pthread_barrier_wait (arg->barrier);
pthread_barrier_wait (arg->barrier);
return NULL;
}
static void
all_threads_ready (void)
{
}
int
main (int argc, char **argv)
{
pthread_t threads[NUM_THREADS];
struct thread_data args[NUM_THREADS];
pthread_barrier_t barrier;
int i, res;
const char *names[] = { "carrot", "potato", "celery" };
alarm (20);
/* Make sure that NAMES contains NUM_THREADS elements. */
assert (sizeof (names) / sizeof (names[0]) == NUM_THREADS);
res = pthread_barrier_init (&barrier, NULL, NUM_THREADS + 1);
assert (res == 0);;
res = pthread_setname_np (pthread_self (), "main");
assert (res == 0);
for (i = 0; i < NUM_THREADS; i++)
{
struct thread_data *arg = &args[i];
arg->name = names[i];
arg->barrier = &barrier;
res = pthread_create (&threads[i], NULL, thread_func, arg);
assert (res == 0);
}
pthread_barrier_wait (&barrier);
all_threads_ready ();
pthread_barrier_wait (&barrier);
for (i = 0; i < NUM_THREADS; i++)
{
res = pthread_join (threads[i], NULL);
assert (res == 0);
}
return 0;
}
|
