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
|
/* Copyright (C) 2004-2023 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/>.
This file was written by Steve Munroe (sjmunroe@us.ibm.com). */
/* Test break points and single step on thread functions. */
#include <string.h>
#include <unistd.h>
#include <pthread.h>
#include <stdlib.h>
#include <stdio.h>
#include <errno.h>
#define N 2
static void *
tf (void *arg)
{
int n = (int) (long int) arg;
char number[160];
int unslept = 10;
sprintf(number, "tf(%ld): begin", (long)arg);
puts (number);
while (unslept > 0)
unslept = sleep(unslept);
sprintf(number, "tf(%ld): end", (long)arg);
puts (number);
return NULL;
}
int main (int argc, char *argv[])
{
int n;
int unslept = 2;
pthread_t th[N];
for (n = 0; n < N; ++n)
if (pthread_create (&th[n], NULL, tf, (void *) (long int) n) != 0)
{
while (unslept > 0)
unslept = sleep(2);
puts ("create failed");
exit (1);
}
puts("after create");
for (n = 0; n < N; ++n)
if (pthread_join (th[n], NULL) != 0)
{
puts ("join failed");
exit (1);
}
puts("after join");
return 0;
}
|
